Upgrade V8 to 5.1.281.57 DO NOT MERGE
FPIIM-449
Change-Id: Id981b686b4d587ac31697662eb98bb34be42ad90
(cherry picked from commit 3b9bc31999c9787eb726ecdbfd5796bfdec32a18)
diff --git a/test/cctest/OWNERS b/test/cctest/OWNERS
index 7fae8f3..4b2b7c5 100644
--- a/test/cctest/OWNERS
+++ b/test/cctest/OWNERS
@@ -9,6 +9,11 @@
per-file *-ppc*=jyan@ca.ibm.com
per-file *-ppc*=mbrandy@us.ibm.com
per-file *-ppc*=michael_dawson@ca.ibm.com
+per-file *-s390*=dstence@us.ibm.com
+per-file *-s390*=joransiu@ca.ibm.com
+per-file *-s390*=jyan@ca.ibm.com
+per-file *-s390*=mbrandy@us.ibm.com
+per-file *-s390*=michael_dawson@ca.ibm.com
per-file *-x87*=chunyang.dai@intel.com
per-file *-x87*=weiliang.lin@intel.com
per-file expression-type-collector*=aseemgarg@chromium.org
diff --git a/test/cctest/cctest.cc b/test/cctest/cctest.cc
index 05f276d..5681f70 100644
--- a/test/cctest/cctest.cc
+++ b/test/cctest/cctest.cc
@@ -51,11 +51,13 @@
v8::ArrayBuffer::Allocator* CcTest::allocator_ = NULL;
v8::Isolate* CcTest::isolate_ = NULL;
-
CcTest::CcTest(TestFunction* callback, const char* file, const char* name,
- const char* dependency, bool enabled, bool initialize)
- : callback_(callback), name_(name), dependency_(dependency),
- enabled_(enabled), initialize_(initialize), prev_(last_) {
+ bool enabled, bool initialize)
+ : callback_(callback),
+ name_(name),
+ enabled_(enabled),
+ initialize_(initialize),
+ prev_(last_) {
// Find the base name of this test (const_cast required on Windows).
char *basename = strrchr(const_cast<char *>(file), '/');
if (!basename) {
@@ -128,21 +130,18 @@
static void PrintTestList(CcTest* current) {
if (current == NULL) return;
PrintTestList(current->prev());
- if (current->dependency() != NULL) {
- printf("%s/%s<%s\n",
- current->file(), current->name(), current->dependency());
- } else {
- printf("%s/%s<\n", current->file(), current->name());
- }
+ printf("%s/%s\n", current->file(), current->name());
}
class CcTestArrayBufferAllocator : public v8::ArrayBuffer::Allocator {
virtual void* Allocate(size_t length) {
- void* data = AllocateUninitialized(length);
+ void* data = AllocateUninitialized(length == 0 ? 1 : length);
return data == NULL ? data : memset(data, 0, length);
}
- virtual void* AllocateUninitialized(size_t length) { return malloc(length); }
+ virtual void* AllocateUninitialized(size_t length) {
+ return malloc(length == 0 ? 1 : length);
+ }
virtual void Free(void* data, size_t length) { free(data); }
// TODO(dslomov): Remove when v8:2823 is fixed.
virtual void Free(void* data) { UNREACHABLE(); }
diff --git a/test/cctest/cctest.gyp b/test/cctest/cctest.gyp
index 3b76ce1..2e00e88 100644
--- a/test/cctest/cctest.gyp
+++ b/test/cctest/cctest.gyp
@@ -71,6 +71,7 @@
'compiler/test-pipeline.cc',
'compiler/test-representation-change.cc',
'compiler/test-run-bytecode-graph-builder.cc',
+ 'compiler/test-run-calls-to-external-references.cc',
'compiler/test-run-deopt.cc',
'compiler/test-run-inlining.cc',
'compiler/test-run-intrinsics.cc',
@@ -88,8 +89,10 @@
'cctest.cc',
'expression-type-collector.cc',
'expression-type-collector.h',
+ 'interpreter/interpreter-tester.cc',
'interpreter/test-bytecode-generator.cc',
'interpreter/test-interpreter.cc',
+ 'interpreter/test-interpreter-intrinsics.cc',
'interpreter/bytecode-expectations-printer.cc',
'interpreter/bytecode-expectations-printer.h',
'gay-fixed.cc',
@@ -140,7 +143,6 @@
'test-fixed-dtoa.cc',
'test-flags.cc',
'test-func-name-inference.cc',
- 'test-gc-tracer.cc',
'test-global-handles.cc',
'test-global-object.cc',
'test-hashing.cc',
@@ -167,7 +169,6 @@
'test-sampler-api.cc',
'test-serialize.cc',
'test-simd.cc',
- 'test-slots-buffer.cc',
'test-strings.cc',
'test-symbols.cc',
'test-strtod.cc',
@@ -188,6 +189,7 @@
'test-weaksets.cc',
'trace-extension.cc',
'wasm/test-run-wasm.cc',
+ 'wasm/test-run-wasm-64.cc',
'wasm/test-run-wasm-js.cc',
'wasm/test-run-wasm-module.cc',
'wasm/test-signatures.h',
@@ -201,7 +203,8 @@
'test-code-stubs-ia32.cc',
'test-disasm-ia32.cc',
'test-macro-assembler-ia32.cc',
- 'test-log-stack-tracer.cc'
+ 'test-log-stack-tracer.cc',
+ 'test-run-wasm-relocation-ia32.cc'
],
}],
['v8_target_arch=="x64"', {
@@ -211,7 +214,8 @@
'test-code-stubs-x64.cc',
'test-disasm-x64.cc',
'test-macro-assembler-x64.cc',
- 'test-log-stack-tracer.cc'
+ 'test-log-stack-tracer.cc',
+ 'test-run-wasm-relocation-x64.cc'
],
}],
['v8_target_arch=="arm"', {
@@ -220,7 +224,8 @@
'test-code-stubs.cc',
'test-code-stubs-arm.cc',
'test-disasm-arm.cc',
- 'test-macro-assembler-arm.cc'
+ 'test-macro-assembler-arm.cc',
+ 'test-run-wasm-relocation-arm.cc'
],
}],
['v8_target_arch=="arm64"', {
@@ -232,7 +237,22 @@
'test-disasm-arm64.cc',
'test-fuzz-arm64.cc',
'test-javascript-arm64.cc',
- 'test-js-arm64-variables.cc'
+ 'test-js-arm64-variables.cc',
+ 'test-run-wasm-relocation-arm64.cc'
+ ],
+ }],
+ ['v8_target_arch=="s390"', {
+ 'sources': [ ### gcmole(arch:s390) ###
+ 'test-assembler-s390.cc',
+ 'test-code-stubs.cc',
+ 'test-disasm-s390.cc'
+ ],
+ }],
+ ['v8_target_arch=="s390x"', {
+ 'sources': [ ### gcmole(arch:s390x) ###
+ 'test-assembler-s390.cc',
+ 'test-code-stubs.cc',
+ 'test-disasm-s390.cc'
],
}],
['v8_target_arch=="ppc"', {
@@ -274,7 +294,8 @@
'test-code-stubs-x87.cc',
'test-disasm-x87.cc',
'test-macro-assembler-x87.cc',
- 'test-log-stack-tracer.cc'
+ 'test-log-stack-tracer.cc',
+ 'test-run-wasm-relocation-x87.cc'
],
}],
[ 'OS=="linux" or OS=="qnx"', {
@@ -293,7 +314,9 @@
},
},
}],
- ['v8_target_arch=="ppc" or v8_target_arch=="ppc64"', {
+ ['v8_target_arch=="ppc" or v8_target_arch=="ppc64" \
+ or v8_target_arch=="arm" or v8_target_arch=="arm64" \
+ or v8_target_arch=="s390" or v8_target_arch=="s390x"', {
# disable fmadd/fmsub so that expected results match generated code in
# RunFloat64MulAndFloat64Add1 and friends.
'cflags': ['-ffp-contract=off'],
diff --git a/test/cctest/cctest.h b/test/cctest/cctest.h
index fe9ae6e..dac3a5b 100644
--- a/test/cctest/cctest.h
+++ b/test/cctest/cctest.h
@@ -34,37 +34,23 @@
#include "src/v8.h"
#ifndef TEST
-#define TEST(Name) \
- static void Test##Name(); \
- CcTest register_test_##Name(Test##Name, __FILE__, #Name, NULL, true, true); \
+#define TEST(Name) \
+ static void Test##Name(); \
+ CcTest register_test_##Name(Test##Name, __FILE__, #Name, true, true); \
static void Test##Name()
#endif
#ifndef UNINITIALIZED_TEST
-#define UNINITIALIZED_TEST(Name) \
- static void Test##Name(); \
- CcTest register_test_##Name(Test##Name, __FILE__, #Name, NULL, true, false); \
- static void Test##Name()
-#endif
-
-#ifndef DEPENDENT_TEST
-#define DEPENDENT_TEST(Name, Dep) \
- static void Test##Name(); \
- CcTest register_test_##Name(Test##Name, __FILE__, #Name, #Dep, true, true); \
- static void Test##Name()
-#endif
-
-#ifndef UNINITIALIZED_DEPENDENT_TEST
-#define UNINITIALIZED_DEPENDENT_TEST(Name, Dep) \
- static void Test##Name(); \
- CcTest register_test_##Name(Test##Name, __FILE__, #Name, #Dep, true, false); \
+#define UNINITIALIZED_TEST(Name) \
+ static void Test##Name(); \
+ CcTest register_test_##Name(Test##Name, __FILE__, #Name, true, false); \
static void Test##Name()
#endif
#ifndef DISABLED_TEST
-#define DISABLED_TEST(Name) \
- static void Test##Name(); \
- CcTest register_test_##Name(Test##Name, __FILE__, #Name, NULL, false, true); \
+#define DISABLED_TEST(Name) \
+ static void Test##Name(); \
+ CcTest register_test_##Name(Test##Name, __FILE__, #Name, false, true); \
static void Test##Name()
#endif
@@ -94,14 +80,13 @@
public:
typedef void (TestFunction)();
CcTest(TestFunction* callback, const char* file, const char* name,
- const char* dependency, bool enabled, bool initialize);
+ bool enabled, bool initialize);
~CcTest() { i::DeleteArray(file_); }
void Run();
static CcTest* last() { return last_; }
CcTest* prev() { return prev_; }
const char* file() { return file_; }
const char* name() { return name_; }
- const char* dependency() { return dependency_; }
bool enabled() { return enabled_; }
static v8::Isolate* isolate() {
@@ -168,7 +153,6 @@
TestFunction* callback_;
const char* file_;
const char* name_;
- const char* dependency_;
bool enabled_;
bool initialize_;
CcTest* prev_;
@@ -601,12 +585,13 @@
class HandleAndZoneScope : public InitializedHandleScope {
public:
- HandleAndZoneScope() {}
+ HandleAndZoneScope() : main_zone_(&allocator_) {}
// Prefixing the below with main_ reduces a lot of naming clashes.
i::Zone* main_zone() { return &main_zone_; }
private:
+ v8::base::AccountingAllocator allocator_;
i::Zone main_zone_;
};
diff --git a/test/cctest/cctest.isolate b/test/cctest/cctest.isolate
index ab55466..dd03ab8 100644
--- a/test/cctest/cctest.isolate
+++ b/test/cctest/cctest.isolate
@@ -6,6 +6,7 @@
'files': [
'./cctest.status',
'./testcfg.py',
+ './interpreter/bytecode_expectations/',
],
},
'includes': [
diff --git a/test/cctest/cctest.status b/test/cctest/cctest.status
index 8eaa951..c992ab6 100644
--- a/test/cctest/cctest.status
+++ b/test/cctest/cctest.status
@@ -39,7 +39,6 @@
# These tests always fail. They are here to test test.py. If
# they don't fail then test.py has failed.
'test-serialize/TestThatAlwaysFails': [FAIL],
- 'test-serialize/DependentTestThatAlwaysFails': [FAIL],
'test-api/SealHandleScope': [FAIL],
# This test always fails. It tests that LiveEdit causes abort when turned off.
@@ -73,11 +72,9 @@
# BUG(2999). The cpu profiler tests are notoriously flaky.
'test-cpu-profiler/CpuProfileDeepStack': [SKIP],
+ 'test-cpu-profiler/CollectCpuProfile': [SKIP],
'test-cpu-profiler/HotDeoptNoFrameEntry': [SKIP],
-
- # BUG(3525). Test crashes flakily.
- 'test-debug/RecursiveBreakpoints': [PASS, FLAKY],
- 'test-debug/RecursiveBreakpointsGlobal': [PASS, FLAKY],
+ 'test-cpu-profiler/SampleWhenFrameIsNotSetup': [SKIP],
# BUG(v8:4358). Hangs flakily.
'test-debug/ProcessDebugMessagesThreaded': [SKIP],
@@ -89,17 +86,13 @@
'test-func-name-inference/UpperCaseClass': [FAIL],
'test-func-name-inference/LowerCaseClass': [FAIL],
- # BUG(3956). Strong mode is being deprecated. Decide about these tests.
- 'test-api/StrongModeAccessCheckAllowed': [FAIL],
- 'test-api/StrongModeAccessCheckBlocked': [FAIL],
-
##############################################################################
# TurboFan compiler failures.
# Some tests are just too slow to run for now.
'test-heap/IncrementalMarkingStepMakesBigProgressWithLargeObjects': [PASS, NO_VARIANTS],
'test-heap-profiler/ManyLocalsInSharedContext': [PASS, NO_VARIANTS],
- 'test-serialize/SerializeToplevelLargeCodeObject': [PASS, NO_VARIANTS],
+ 'test-serialize/CodeSerializerLargeCodeObject': [PASS, NO_VARIANTS],
'test-debug/ThreadedDebugging': [PASS, NO_VARIANTS],
# BUG(3742).
'test-mark-compact/MarkCompactCollector': [PASS, ['arch==arm', NO_VARIANTS]],
@@ -129,7 +122,6 @@
'test-cpu-profiler/DeoptAtFirstLevelInlinedSource': [PASS, NO_VARIANTS],
'test-cpu-profiler/DeoptAtSecondLevelInlinedSource': [PASS, NO_VARIANTS],
'test-cpu-profiler/DeoptUntrackedFunction': [PASS, NO_VARIANTS],
- 'test-cpu-profiler/TickLines': [PASS, NO_VARIANTS],
############################################################################
# Slow tests.
@@ -139,9 +131,7 @@
'test-api/Threading4': [PASS, ['mode == debug', SLOW]],
'test-debug/CallFunctionInDebugger': [PASS, ['mode == debug', SLOW]],
'test-strings/StringOOM*': [PASS, ['mode == debug', SKIP]],
-
- # TODO(machenbach, mvstanton): Flaky in debug on all platforms.
- 'test-lockers/LockerUnlocker': [PASS, ['mode == debug', FLAKY]],
+ 'test-serialize/CustomSnapshotDataBlobImmortalImmovableRoots': [PASS, ['mode == debug', SKIP]],
}], # ALWAYS
##############################################################################
@@ -152,8 +142,8 @@
'test-api/Bug618': [PASS],
# BUG(v8:3385).
- 'test-serialize/DeserializeFromSecondSerialization': [PASS, FAIL],
- 'test-serialize/DeserializeFromSecondSerializationAndRunScript2': [PASS, FAIL],
+ 'test-serialize/StartupSerializerOnceRunScript': [PASS, FAIL],
+ 'test-serialize/StartupSerializerTwiceRunScript': [PASS, FAIL],
# BUG(v8:3154).
'test-heap/ReleaseOverReservedPages': [PASS, FAIL],
@@ -169,6 +159,18 @@
# BUG(v8:3434).
' test-api/LoadICFastApi_DirectCall_GCMoveStubWithProfiler': [SKIP],
+
+ # BUG(v8:4795).
+ 'test-run-wasm-js/Run_JSSelectAlign_0': [SKIP],
+ 'test-run-wasm-js/Run_JSSelectAlign_2': [SKIP],
+ 'test-run-wasm-js/Run_JSSelectAlign_4': [SKIP],
+ 'test-run-wasm-js/Run_JSSelect_0': [SKIP],
+ 'test-run-wasm-js/Run_JSSelect_1': [SKIP],
+ 'test-run-wasm-js/Run_JSSelect_2': [SKIP],
+ 'test-run-wasm-js/Run_JSSelect_3': [SKIP],
+ 'test-run-wasm-js/Run_JSSelect_4': [SKIP],
+ 'test-run-wasm-js/Run_JSSelect_5': [SKIP],
+ 'test-run-wasm-js/Run_JSSelect_6': [SKIP],
}], # 'arch == arm64'
['arch == arm64 and simulator_run == True', {
@@ -235,44 +237,34 @@
# BUG(v8:4642).
'test-lockers/LockAndUnlockDifferentIsolates': [PASS, NO_VARIANTS],
+
+ # BUG(v8:2999,v8:4751).
+ 'test-cpu-profiler/CollectDeoptEvents': [SKIP],
+ 'test-cpu-profiler/FunctionCallSample': [SKIP],
+ 'test-cpu-profiler/JsNativeJsRuntimeJsSample': [SKIP],
+ 'test-cpu-profiler/JsNativeJsRuntimeJsSampleMultiple': [SKIP],
+ 'test-cpu-profiler/JsNativeJsSample': [SKIP],
+ 'test-cpu-profiler/JsNative1JsNative2JsSample': [SKIP],
}], # 'system == windows'
##############################################################################
-['system == macos', {
-
- # BUG(3125).
- 'test-debug/DebugGetLoadedScripts': [PASS, FLAKY],
- 'test-debug/DebugStepLinear': [PASS, FLAKY],
- 'test-debug/DebuggerClearMessageHandler': [PASS, FLAKY],
-}], # 'system == macos'
-
-##############################################################################
['byteorder == big', {
# TODO(mips-team): Fix Wasm for big-endian.
'test-run-wasm-module/Run_WasmModule_CallAdd': [SKIP],
- 'test-run-wasm-module/Run_WasmModule_CallAdd_rev': [SKIP],
'test-run-wasm-module/Run_WasmModule_CallMain_recursive': [SKIP],
'test-run-wasm-module/Run_WasmModule_ReadLoadedDataSegment': [SKIP],
'test-run-wasm-module/Run_WasmModule_Return114': [SKIP],
'test-run-wasm-module/Run_WasmModule_CheckMemoryIsZero': [SKIP],
'test-run-wasm-module/Run_WasmModule_Global': [SKIP],
- 'test-run-wasm/Run_WasmInt32*': [SKIP],
- 'test-run-wasm/Run_Wasm_TableSwitch*': [SKIP],
- 'test-run-wasm/Run_Wasm_StoreMemI32_offset': [SKIP],
- 'test-run-wasm/Run_Wasm_Int32LoadInt16_*': [SKIP],
+ 'test-run-wasm/Run_Wasm_Int32LoadInt16_signext': [SKIP],
+ 'test-run-wasm/Run_Wasm_Int32LoadInt16_zeroext': [SKIP],
'test-run-wasm/Run_WasmMixedGlobals': [SKIP],
- 'test-run-wasm/Run_WasmCall*': [SKIP],
- 'test-run-wasm/Run_WasmMixedCall_*': [SKIP],
- 'test-run-wasm/Run_WasmInt64*': [SKIP],
- 'test-run-wasm/Run_Wasm_LoadStoreI64_sx': [SKIP],
- 'test-run-wasm/Run_WASM_Int64DivS_byzero_const': [SKIP],
- 'test-run-wasm/Run_TestI64WasmRunner': [SKIP],
- 'test-run-wasm-js/Run_JSSelect_1': [SKIP],
- 'test-run-wasm-js/Run_JSSelect_2': [SKIP],
- 'test-run-wasm-js/Run_JSSelect_3': [SKIP],
- 'test-run-wasm-js/Run_JSSelect_4': [SKIP],
- 'test-run-wasm-js/Run_JSSelect_5': [SKIP],
- 'test-run-wasm-js/Run_JSSelect_6': [SKIP],
+ 'test-run-wasm-64/Run_WasmI64*': [SKIP],
+ 'test-run-wasm-64/Run_Wasm_I64*': [SKIP],
+ 'test-run-wasm-64/Run_Wasm_LoadStoreI64_sx': [SKIP],
+ 'test-run-wasm-64/Run_TestI64WasmRunner': [SKIP],
+ 'test-run-wasm-64/Run_WasmCall_Int64Sub': [SKIP],
+ 'test-run-wasm-64/Run_Wasm_MemI64_Sum': [SKIP],
}], # 'byteorder == big'
##############################################################################
@@ -284,10 +276,10 @@
'test-log/ProfLazyMode': [SKIP],
# BUG(1075): Unresolved crashes.
- 'test-serialize/Deserialize': [SKIP],
- 'test-serialize/DeserializeFromSecondSerializationAndRunScript2': [SKIP],
- 'test-serialize/DeserializeAndRunScript2': [SKIP],
- 'test-serialize/DeserializeFromSecondSerialization': [SKIP],
+ 'test-serialize/StartupSerializerOnce': [SKIP],
+ 'test-serialize/StartupSerializerTwice': [SKIP],
+ 'test-serialize/StartupSerializerOnceRunScript': [SKIP],
+ 'test-serialize/StartupSerializerTwiceRunScript': [SKIP],
############################################################################
# Slow tests.
@@ -295,10 +287,6 @@
'test-api/Threading2': [PASS, SLOW],
'test-api/Threading3': [PASS, SLOW],
'test-api/Threading4': [PASS, SLOW],
-
- # Crashes due to OOM in simulator.
- 'test-types/Distributivity1': [PASS, FLAKY],
- 'test-types/Distributivity2': [PASS, FLAKY],
}], # 'arch == arm'
##############################################################################
@@ -309,10 +297,10 @@
'test-heap/TestSizeOfRegExpCode': [SKIP],
# BUG(1075): Unresolved crashes on MIPS also.
- 'test-serialize/Deserialize': [SKIP],
- 'test-serialize/DeserializeFromSecondSerializationAndRunScript2': [SKIP],
- 'test-serialize/DeserializeAndRunScript2': [SKIP],
- 'test-serialize/DeserializeFromSecondSerialization': [SKIP],
+ 'test-serialize/StartupSerializerOnce': [SKIP],
+ 'test-serialize/StartupSerializerTwice': [SKIP],
+ 'test-serialize/StartupSerializerOnceRunScript': [SKIP],
+ 'test-serialize/StartupSerializerTwiceRunScript': [SKIP],
}], # 'arch == mipsel or arch == mips'
##############################################################################
@@ -336,10 +324,10 @@
'test-heap/TestSizeOfRegExpCode': [SKIP],
# BUG(1075): Unresolved crashes on MIPS also.
- 'test-serialize/Deserialize': [SKIP],
- 'test-serialize/DeserializeFromSecondSerializationAndRunScript2': [SKIP],
- 'test-serialize/DeserializeAndRunScript2': [SKIP],
- 'test-serialize/DeserializeFromSecondSerialization': [SKIP],
+ 'test-serialize/StartupSerializerOnce': [SKIP],
+ 'test-serialize/StartupSerializerTwice': [SKIP],
+ 'test-serialize/StartupSerializerOnceRunScript': [SKIP],
+ 'test-serialize/StartupSerializerTwiceRunScript': [SKIP],
}], # 'arch == mips64el or arch == mips64'
##############################################################################
@@ -353,6 +341,7 @@
'test-run-machops/RunFloat64MulAndFloat64Add2': [SKIP],
'test-run-machops/RunFloat64MulAndFloat64Sub1': [SKIP],
'test-run-machops/RunFloat64MulAndFloat64Sub2': [SKIP],
+ 'test-cpu-profiler/Inlining': [SKIP],
}], # 'arch == x87'
##############################################################################
@@ -498,56 +487,12 @@
}], # 'arch == ppc64 and simulator_run == True'
+##############################################################################
['ignition == True', {
- # TODO(yangguo,4690): Test failures in debugger tests.
- 'test-debug/DebugStepLocals': [FAIL],
- 'test-debug/DebugStepKeyedLoadLoop': [FAIL],
- 'test-debug/DebugStepKeyedStoreLoop': [FAIL],
- 'test-debug/DebugStepIf': [FAIL],
- 'test-debug/DebugStepNamedLoadLoop': [FAIL],
- 'test-debug/DebugStepDeclarations': [FAIL],
- 'test-debug/BreakPointConstructCallWithGC': [PASS, FAIL],
- 'test-debug/DebugStepNamedStoreLoop': [FAIL],
- 'test-debug/DebugStepLinearMixedICs': [FAIL],
- 'test-debug/DebugStepSwitch': [FAIL],
- 'test-debug/DebugStepWhile': [FAIL],
- 'test-debug/DebugStepFor': [FAIL],
- 'test-debug/DebugStepForContinue': [FAIL],
- 'test-debug/DebugStepForIn': [FAIL],
- 'test-debug/DebugStepDoWhile': [FAIL],
- 'test-debug/DebugConditional': [FAIL],
- 'test-debug/DebugStepForBreak': [FAIL],
- 'test-debug/DebugStepWith': [FAIL],
- 'test-debug/DebugStepFunctionApply': [FAIL],
- 'test-debug/StepInOutBranch': [FAIL],
- 'test-debug/DebugStepFunctionCall': [FAIL],
-
- # TODO(yangguo,4690): Required DebuggerStatement support.
- 'test-profile-generator/BailoutReason': [FAIL],
-
- # TODO(rmcilroy,4680): Check failed: toplevel_test_code_event_found.
- 'test-serialize/SerializeToplevelIsolates': [FAIL],
-
- # BUG(4333). Function name inferrer does not work for ES6 clases.
- 'test-func-name-inference/UpperCaseClass': [TIMEOUT],
- 'test-func-name-inference/LowerCaseClass': [TIMEOUT],
-
- # TODO(rmcilroy,4681): Requires support for generators.
- 'test-inobject-slack-tracking/JSGeneratorObjectBasic': [FAIL],
- 'test-inobject-slack-tracking/JSGeneratorObjectBasicNoInlineNew': [FAIL],
- 'test-api/IsGeneratorFunctionOrObject': [FAIL],
-
- # TODO(rmcilroy,4680): Strong mode failures.
- 'test-api/AccessorShouldThrowOnError': [FAIL],
- 'test-api/InterceptorShouldThrowOnError': [FAIL],
# TODO(rmcilroy,4680): The function_data field should be a BytecodeArray on interpreter entry
'test-api/SetFunctionEntryHook': [FAIL],
- # TODO(rmcilroy,4680): Fail on shared_function_data()->IsUndefined in
- #compiler.cc
- 'test-heap/CanonicalSharedFunctionInfo': [PASS, ['mode == debug or dcheck_always_on == True', FAIL]],
-
# TODO(rmcilroy,4680): Check failed: !function->shared()->is_compiled() || function->IsOptimized().
'test-heap/TestCodeFlushingPreAged': [FAIL],
'test-heap/TestCodeFlushingIncrementalScavenge': [FAIL],
@@ -555,64 +500,61 @@
'test-heap/TestCodeFlushingIncremental': [FAIL],
'test-heap/TestCodeFlushingIncrementalAbort': [PASS, ['mode == debug or dcheck_always_on == True', FAIL]],
- # TODO(rmcilroy,4680): Check failed: fun1->IsOptimized() || !CcTest::i_isolate()->use_crankshaft().
- 'test-compiler/OptimizedCodeSharing2': [FAIL],
- 'test-compiler/OptimizedCodeSharing3': [FAIL],
+ # TODO(rmcilroy,4766): Requires BytecodeGraphBuilder to track source position
+ # on nodes (behind --turbo_source_positions flag).
+ 'test-cpu-profiler/TickLinesOptimized': [FAIL],
- # TODO(rmcilroy,4689): Stack trace line number failures.
- 'test-run-jsexceptions/ThrowMessagePosition': [FAIL],
- 'test-api/TryCatchMixedNesting': [FAIL],
+ # TODO(rmcilroy,4680): Fails to find the correct function name for the
+ # anonymous function. Fails without ignition but with --no-lazy also, so seems
+ # to be an issue when eagerly parsing.
+ 'test-func-name-inference/ReturnAnonymousFunction': [FAIL],
- # TODO(rmcilroy,4680): Test assert errors.
- 'test-cpu-profiler/CodeEvents': [FAIL],
- 'test-cpu-profiler/TickEvents': [FAIL],
- 'test-cpu-profiler/BoundFunctionCall': [FAIL],
- 'test-cpu-profiler/CollectCpuProfile': [FAIL],
- 'test-cpu-profiler/CollectSampleAPI': [FAIL],
- 'test-cpu-profiler/CpuProfileDeepStack': [FAIL],
- 'test-cpu-profiler/FunctionApplySample': [FAIL],
- 'test-cpu-profiler/FunctionCallSample': [FAIL],
- 'test-cpu-profiler/FunctionDetails': [FAIL],
- 'test-cpu-profiler/HotDeoptNoFrameEntry': [FAIL],
- 'test-cpu-profiler/JsNative1JsNative2JsSample': [FAIL],
- 'test-cpu-profiler/JsNativeJsRuntimeJsSample': [FAIL],
- 'test-cpu-profiler/JsNativeJsRuntimeJsSampleMultiple': [FAIL],
- 'test-cpu-profiler/JsNativeJsSample': [FAIL],
- 'test-cpu-profiler/NativeMethodUninitializedIC': [FAIL],
- 'test-cpu-profiler/NativeMethodMonomorphicIC': [FAIL],
- 'test-cpu-profiler/NativeAccessorUninitializedIC': [FAIL],
- 'test-cpu-profiler/NativeAccessorMonomorphicIC': [FAIL],
- 'test-cpu-profiler/SampleWhenFrameIsNotSetup': [FAIL],
- 'test-sampler-api/StackFramesConsistent': [FAIL],
- 'test-profile-generator/LineNumber': [FAIL],
- 'test-profile-generator/ProfileNodeScriptId': [FAIL],
- 'test-profile-generator/RecordStackTraceAtStartProfiling': [FAIL],
+ # TODO(mythria,4780): Related to type feedback support for calls.
'test-feedback-vector/VectorCallICStates': [FAIL],
'test-compiler/FeedbackVectorPreservedAcrossRecompiles': [FAIL],
- 'test-api/PromiseRejectCallback': [FAIL],
- 'test-api/SetJitCodeEventHandler': [FAIL],
'test-heap/WeakFunctionInConstructor': [FAIL],
- 'test-heap/Regress169209': [FAIL],
'test-heap/IncrementalMarkingClearsMonomorphicConstructor': [FAIL],
'test-heap/IncrementalMarkingPreservesMonomorphicConstructor': [FAIL],
'test-heap/IncrementalMarkingPreservesMonomorphicCallIC': [FAIL],
- 'test-heap/CompilationCacheCachingBehavior': [FAIL],
'test-heap/CellsInOptimizedCodeAreWeak': [FAIL],
+
+ # TODO(mythria,4680): Lack of code-ageing in interpreter.
+ 'test-heap/Regress169209': [FAIL],
+
+ # TODO(mythria,4680): Lack of code-ageing and/or lack of compilation cache
+ # in interpreter.
+ 'test-heap/CompilationCacheCachingBehavior': [FAIL],
+
+ # TODO(mstarzinger,4680): Fails due to the turbo-asm pipeline only being taken
+ # in compiler.cc GetLazyCode for uncompiled code, and no similar path for eager
+ # code.
+ 'test-api/TurboAsmDisablesNeuter': [FAIL],
+
+ # TODO(rmcilroy,4837): We don't set a LoadContextSlot for a function as
+ # immutable in the BytecodeGraphBuilder, therefore no inlining happens.
+ 'test-run-inlining/InlineLoopGuardedTwice': [FAIL],
+ 'test-run-inlining/InlineSurplusArgumentsDeopt': [FAIL],
'test-run-inlining/InlineTwice': [FAIL],
- 'test-serialize/SerializeInternalReference': [FAIL, ['arch == arm or arch == arm64', PASS]],
+ 'test-run-inlining/InlineSurplusArgumentsObject': [FAIL],
+ 'test-run-inlining/InlineTwiceDependentDiamond': [FAIL],
+ 'test-run-inlining/InlineWithArguments': [FAIL],
+ 'test-run-inlining/InlineLoopUnguardedTwice': [FAIL],
+ 'test-run-inlining/InlineOmitArgumentsObject': [FAIL],
+ 'test-run-inlining/InlineLoopUnguardedOnce': [FAIL],
+ 'test-run-inlining/InlineOmitArgumentsDeopt': [FAIL],
+ 'test-run-inlining/InlineTwiceDependentDiamondDifferent': [FAIL],
+ 'test-run-inlining/SimpleInliningContext': [FAIL],
+ 'test-run-inlining/InlineMutuallyRecursive': [FAIL],
+ 'test-run-inlining/InlineLoopGuardedEmpty': [FAIL],
+ 'test-run-inlining/InlineLoopGuardedOnce': [FAIL],
+ 'test-run-inlining/InlineOmitArguments': [FAIL],
+ 'test-run-inlining/SimpleInlining': [FAIL],
+ 'test-run-inlining/InlineLoopUnguardedEmpty': [FAIL],
+ 'test-run-inlining/InlineNestedBuiltin': [FAIL],
+ 'test-run-inlining/InlineSurplusArguments': [FAIL],
+ 'test-run-inlining/InlineBuiltin': [FAIL],
+ 'test-run-inlining/InlineTwiceDependent': [FAIL],
+ 'test-run-inlining/SimpleInliningContextDeopt': [FAIL],
}], # ignition == True
-['ignition == True and arch == x64', {
- # TODO(rmcilroy,4680): The function_data field should be a BytecodeArray on interpreter entry
- 'test-serialize/PerIsolateSnapshotBlobsOutdatedContextWithOverflow': [PASS, ['mode == debug', FAIL]],
- 'test-serialize/PerIsolateSnapshotBlobsWithLocker': [PASS, ['mode == debug', FAIL]],
- 'test-serialize/SnapshotBlobsStackOverflow': [PASS, ['mode == debug', FAIL]],
- 'test-serialize/PerIsolateSnapshotBlobs': [PASS, ['mode == debug', FAIL]],
- 'test-serialize/SerializationMemoryStats': [PASS, ['mode == debug', FAIL]],
-
- # TODO(rmcilroy,4680): Test assert errors.
- 'test-heap-profiler/HeapSnapshotSimd': [PASS, ['mode == debug', FAIL]],
- 'test-api/InitializeDefaultIsolateOnSecondaryThread1': [PASS, ['mode == debug', FAIL]],
-}],
-
]
diff --git a/test/cctest/compiler/call-tester.h b/test/cctest/compiler/call-tester.h
index 8ee6b99..c75bde1 100644
--- a/test/cctest/compiler/call-tester.h
+++ b/test/cctest/compiler/call-tester.h
@@ -220,7 +220,8 @@
Simulator::CallArgument(p5), Simulator::CallArgument::End()};
return CastReturnValue<R>(CallSimulator(FUNCTION_ADDR(f), args));
}
-#elif USE_SIMULATOR && (V8_TARGET_ARCH_MIPS64 || V8_TARGET_ARCH_PPC64)
+#elif USE_SIMULATOR && \
+ (V8_TARGET_ARCH_MIPS64 || V8_TARGET_ARCH_PPC64 || V8_TARGET_ARCH_S390X)
uintptr_t CallSimulator(byte* f, int64_t p1 = 0, int64_t p2 = 0,
int64_t p3 = 0, int64_t p4 = 0, int64_t p5 = 0) {
Simulator* simulator = Simulator::current(isolate_);
@@ -264,8 +265,8 @@
ParameterTraits<P2>::Cast(p2), ParameterTraits<P3>::Cast(p3),
ParameterTraits<P4>::Cast(p4), ParameterTraits<P5>::Cast(p5)));
}
-#elif USE_SIMULATOR && \
- (V8_TARGET_ARCH_ARM || V8_TARGET_ARCH_MIPS || V8_TARGET_ARCH_PPC)
+#elif USE_SIMULATOR && (V8_TARGET_ARCH_ARM || V8_TARGET_ARCH_MIPS || \
+ V8_TARGET_ARCH_PPC || V8_TARGET_ARCH_S390)
uintptr_t CallSimulator(byte* f, int32_t p1 = 0, int32_t p2 = 0,
int32_t p3 = 0, int32_t p4 = 0, int32_t p5 = 0) {
Simulator* simulator = Simulator::current(isolate_);
diff --git a/test/cctest/compiler/codegen-tester.cc b/test/cctest/compiler/codegen-tester.cc
index fc0956f..9b5a9d9 100644
--- a/test/cctest/compiler/codegen-tester.cc
+++ b/test/cctest/compiler/codegen-tester.cc
@@ -563,7 +563,7 @@
Float64BinopTester bt(&m);
bt.AddReturn(bt.param0);
- FOR_FLOAT64_INPUTS(i) { CheckDoubleEq(*i, bt.call(*i, 9.0)); }
+ FOR_FLOAT64_INPUTS(i) { CHECK_DOUBLE_EQ(*i, bt.call(*i, 9.0)); }
}
{
@@ -571,7 +571,7 @@
Float64BinopTester bt(&m);
bt.AddReturn(bt.param1);
- FOR_FLOAT64_INPUTS(i) { CheckDoubleEq(*i, bt.call(-11.25, *i)); }
+ FOR_FLOAT64_INPUTS(i) { CHECK_DOUBLE_EQ(*i, bt.call(-11.25, *i)); }
}
}
@@ -587,7 +587,7 @@
{
BufferedRawMachineAssemblerTester<double> m(MachineType::Float64());
m.Return(m.Parameter(0));
- FOR_FLOAT64_INPUTS(i) { CheckDoubleEq(*i, m.Call(*i)); }
+ FOR_FLOAT64_INPUTS(i) { CHECK_DOUBLE_EQ(*i, m.Call(*i)); }
}
{
BufferedRawMachineAssemblerTester<int64_t> m(MachineType::Int64(),
@@ -647,7 +647,7 @@
m.Return(m.Int32Constant(0));
FOR_FLOAT64_INPUTS(i) {
m.Call(*i);
- CheckDoubleEq(*i, result);
+ CHECK_DOUBLE_EQ(*i, result);
}
}
{
diff --git a/test/cctest/compiler/function-tester.h b/test/cctest/compiler/function-tester.h
index c6093ce..631bdde 100644
--- a/test/cctest/compiler/function-tester.h
+++ b/test/cctest/compiler/function-tester.h
@@ -175,7 +175,7 @@
uint32_t flags_;
Handle<JSFunction> Compile(Handle<JSFunction> function) {
- Zone zone;
+ Zone zone(function->GetIsolate()->allocator());
ParseInfo parse_info(&zone, function);
CompilationInfo info(&parse_info);
info.MarkAsDeoptimizationEnabled();
@@ -224,7 +224,7 @@
// Compile the given machine graph instead of the source of the function
// and replace the JSFunction's code with the result.
Handle<JSFunction> CompileGraph(Graph* graph) {
- Zone zone;
+ Zone zone(function->GetIsolate()->allocator());
ParseInfo parse_info(&zone, function);
CompilationInfo info(&parse_info);
diff --git a/test/cctest/compiler/test-changes-lowering.cc b/test/cctest/compiler/test-changes-lowering.cc
index e850da7..ddeabe4 100644
--- a/test/cctest/compiler/test-changes-lowering.cc
+++ b/test/cctest/compiler/test-changes-lowering.cc
@@ -237,13 +237,13 @@
{
Handle<Object> number = t.factory()->NewNumber(input);
t.Call(*number);
- CheckDoubleEq(input, result);
+ CHECK_DOUBLE_EQ(input, result);
}
{
Handle<HeapNumber> number = t.factory()->NewHeapNumber(input);
t.Call(*number);
- CheckDoubleEq(input, result);
+ CHECK_DOUBLE_EQ(input, result);
}
}
}
diff --git a/test/cctest/compiler/test-code-stub-assembler.cc b/test/cctest/compiler/test-code-stub-assembler.cc
index 0306561..ff02cc9 100644
--- a/test/cctest/compiler/test-code-stub-assembler.cc
+++ b/test/cctest/compiler/test-code-stub-assembler.cc
@@ -13,12 +13,19 @@
class CodeStubAssemblerTester : public CodeStubAssembler {
public:
+ // Test generating code for a stub.
CodeStubAssemblerTester(Isolate* isolate,
const CallInterfaceDescriptor& descriptor)
: CodeStubAssembler(isolate, isolate->runtime_zone(), descriptor,
Code::ComputeFlags(Code::STUB), "test"),
scope_(isolate) {}
+ // Test generating code for a JS function (e.g. builtins).
+ CodeStubAssemblerTester(Isolate* isolate, int parameter_count)
+ : CodeStubAssembler(isolate, isolate->runtime_zone(), parameter_count,
+ Code::ComputeFlags(Code::FUNCTION), "test"),
+ scope_(isolate) {}
+
private:
HandleScope scope_;
LocalContext context_;
@@ -68,12 +75,12 @@
VoidDescriptor descriptor(isolate);
CodeStubAssemblerTester m(isolate, descriptor);
Node* context = m.HeapConstant(Handle<Context>(isolate->native_context()));
- Node* b = m.SmiTag(m.Int32Constant(256));
- m.Return(m.CallRuntime(Runtime::kMathSqrt, context, b));
+ Node* b = m.SmiTag(m.Int32Constant(0));
+ m.Return(m.CallRuntime(Runtime::kNumberToSmi, context, b));
Handle<Code> code = m.GenerateCode();
FunctionTester ft(descriptor, code);
MaybeHandle<Object> result = ft.Call();
- CHECK_EQ(16, Handle<Smi>::cast(result.ToHandleChecked())->value());
+ CHECK_EQ(0, Handle<Smi>::cast(result.ToHandleChecked())->value());
}
@@ -82,12 +89,12 @@
VoidDescriptor descriptor(isolate);
CodeStubAssemblerTester m(isolate, descriptor);
Node* context = m.HeapConstant(Handle<Context>(isolate->native_context()));
- Node* b = m.SmiTag(m.Int32Constant(256));
- m.TailCallRuntime(Runtime::kMathSqrt, context, b);
+ Node* b = m.SmiTag(m.Int32Constant(0));
+ m.TailCallRuntime(Runtime::kNumberToSmi, context, b);
Handle<Code> code = m.GenerateCode();
FunctionTester ft(descriptor, code);
MaybeHandle<Object> result = ft.Call();
- CHECK_EQ(16, Handle<Smi>::cast(result.ToHandleChecked())->value());
+ CHECK_EQ(0, Handle<Smi>::cast(result.ToHandleChecked())->value());
}
@@ -247,6 +254,113 @@
CHECK_EQ(733, Handle<Smi>::cast(result.ToHandleChecked())->value());
}
+TEST(LoadHeapNumberValue) {
+ Isolate* isolate(CcTest::InitIsolateOnce());
+ VoidDescriptor descriptor(isolate);
+ CodeStubAssemblerTester m(isolate, descriptor);
+ Handle<HeapNumber> number = isolate->factory()->NewHeapNumber(1234);
+ m.Return(m.SmiTag(
+ m.ChangeFloat64ToUint32(m.LoadHeapNumberValue(m.HeapConstant(number)))));
+ Handle<Code> code = m.GenerateCode();
+ FunctionTester ft(descriptor, code);
+ MaybeHandle<Object> result = ft.Call();
+ CHECK_EQ(1234, Handle<Smi>::cast(result.ToHandleChecked())->value());
+}
+
+TEST(LoadInstanceType) {
+ Isolate* isolate(CcTest::InitIsolateOnce());
+ VoidDescriptor descriptor(isolate);
+ CodeStubAssemblerTester m(isolate, descriptor);
+ Handle<HeapObject> undefined = isolate->factory()->undefined_value();
+ m.Return(m.SmiTag(m.LoadInstanceType(m.HeapConstant(undefined))));
+ Handle<Code> code = m.GenerateCode();
+ FunctionTester ft(descriptor, code);
+ MaybeHandle<Object> result = ft.Call();
+ CHECK_EQ(InstanceType::ODDBALL_TYPE,
+ Handle<Smi>::cast(result.ToHandleChecked())->value());
+}
+
+namespace {
+
+class TestBitField : public BitField<unsigned, 3, 3> {};
+
+} // namespace
+
+TEST(BitFieldDecode) {
+ Isolate* isolate(CcTest::InitIsolateOnce());
+ VoidDescriptor descriptor(isolate);
+ CodeStubAssemblerTester m(isolate, descriptor);
+ m.Return(m.SmiTag(m.BitFieldDecode<TestBitField>(m.Int32Constant(0x2f))));
+ Handle<Code> code = m.GenerateCode();
+ FunctionTester ft(descriptor, code);
+ MaybeHandle<Object> result = ft.Call();
+ // value = 00101111
+ // mask = 00111000
+ // result = 101
+ CHECK_EQ(5, Handle<Smi>::cast(result.ToHandleChecked())->value());
+}
+
+namespace {
+
+Handle<JSFunction> CreateFunctionFromCode(int parameter_count_with_receiver,
+ Handle<Code> code) {
+ Isolate* isolate = code->GetIsolate();
+ Handle<String> name = isolate->factory()->InternalizeUtf8String("test");
+ Handle<JSFunction> function =
+ isolate->factory()->NewFunctionWithoutPrototype(name, code);
+ function->shared()->set_internal_formal_parameter_count(
+ parameter_count_with_receiver - 1); // Implicit undefined receiver.
+ return function;
+}
+
+} // namespace
+
+TEST(JSFunction) {
+ const int kNumParams = 3; // Receiver, left, right.
+ Isolate* isolate(CcTest::InitIsolateOnce());
+ CodeStubAssemblerTester m(isolate, kNumParams);
+ m.Return(m.SmiTag(m.Int32Add(m.SmiToWord32(m.Parameter(1)),
+ m.SmiToWord32(m.Parameter(2)))));
+ Handle<Code> code = m.GenerateCode();
+ Handle<JSFunction> function = CreateFunctionFromCode(kNumParams, code);
+ Handle<Object> args[] = {Handle<Smi>(Smi::FromInt(23), isolate),
+ Handle<Smi>(Smi::FromInt(34), isolate)};
+ MaybeHandle<Object> result =
+ Execution::Call(isolate, function, isolate->factory()->undefined_value(),
+ arraysize(args), args);
+ CHECK_EQ(57, Handle<Smi>::cast(result.ToHandleChecked())->value());
+}
+
+TEST(SplitEdgeBranchMerge) {
+ Isolate* isolate(CcTest::InitIsolateOnce());
+ VoidDescriptor descriptor(isolate);
+ CodeStubAssemblerTester m(isolate, descriptor);
+ CodeStubAssembler::Label l1(&m), merge(&m);
+ m.Branch(m.Int32Constant(1), &l1, &merge);
+ m.Bind(&l1);
+ m.Goto(&merge);
+ m.Bind(&merge);
+ USE(m.GenerateCode());
+}
+
+TEST(SplitEdgeSwitchMerge) {
+ Isolate* isolate(CcTest::InitIsolateOnce());
+ VoidDescriptor descriptor(isolate);
+ CodeStubAssemblerTester m(isolate, descriptor);
+ CodeStubAssembler::Label l1(&m), l2(&m), l3(&m), default_label(&m);
+ CodeStubAssembler::Label* labels[] = {&l1, &l2};
+ int32_t values[] = {1, 2};
+ m.Branch(m.Int32Constant(1), &l3, &l1);
+ m.Bind(&l3);
+ m.Switch(m.Int32Constant(2), &default_label, values, labels, 2);
+ m.Bind(&l1);
+ m.Goto(&l2);
+ m.Bind(&l2);
+ m.Goto(&default_label);
+ m.Bind(&default_label);
+ USE(m.GenerateCode());
+}
+
} // namespace compiler
} // namespace internal
} // namespace v8
diff --git a/test/cctest/compiler/test-instruction.cc b/test/cctest/compiler/test-instruction.cc
index 4de3373..4cf72a5 100644
--- a/test/cctest/compiler/test-instruction.cc
+++ b/test/cctest/compiler/test-instruction.cc
@@ -268,7 +268,8 @@
TEST(InstructionOperands) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
{
TestInstr* i = TestInstr::New(&zone, 101);
diff --git a/test/cctest/compiler/test-js-typed-lowering.cc b/test/cctest/compiler/test-js-typed-lowering.cc
index 24db6a5..0075de5 100644
--- a/test/cctest/compiler/test-js-typed-lowering.cc
+++ b/test/cctest/compiler/test-js-typed-lowering.cc
@@ -975,7 +975,7 @@
BinopEffectsTester B(ops[j], Type::Symbol(), Type::String());
CHECK_EQ(ops[j + 1]->opcode(), B.result->op()->opcode());
- Node* i0 = B.CheckConvertedInput(IrOpcode::kJSToNumber, 0, true);
+ Node* i0 = B.CheckConvertedInput(IrOpcode::kStringToNumber, 0, false);
Node* i1 = B.CheckConvertedInput(IrOpcode::kJSToNumber, 1, true);
// Inputs should be commuted.
diff --git a/test/cctest/compiler/test-jump-threading.cc b/test/cctest/compiler/test-jump-threading.cc
index 71f774f..ed3d79e 100644
--- a/test/cctest/compiler/test-jump-threading.cc
+++ b/test/cctest/compiler/test-jump-threading.cc
@@ -106,7 +106,8 @@
void VerifyForwarding(TestCode& code, int count, int* expected) {
- Zone local_zone;
+ base::AccountingAllocator allocator;
+ Zone local_zone(&allocator);
ZoneVector<RpoNumber> result(&local_zone);
JumpThreading::ComputeForwarding(&local_zone, result, &code.sequence_, true);
diff --git a/test/cctest/compiler/test-linkage.cc b/test/cctest/compiler/test-linkage.cc
index 6722f59..0cbdb4c 100644
--- a/test/cctest/compiler/test-linkage.cc
+++ b/test/cctest/compiler/test-linkage.cc
@@ -30,12 +30,12 @@
Handle<String> source_code = isolate->factory()
->NewStringFromUtf8(CStrVector(source))
.ToHandleChecked();
- Handle<SharedFunctionInfo> shared_function = Compiler::CompileScript(
+ Handle<SharedFunctionInfo> shared = Compiler::GetSharedFunctionInfoForScript(
source_code, Handle<String>(), 0, 0, v8::ScriptOriginOptions(),
Handle<Object>(), Handle<Context>(isolate->native_context()), NULL, NULL,
v8::ScriptCompiler::kNoCompileOptions, NOT_NATIVES_CODE, false);
return isolate->factory()->NewFunctionFromSharedFunctionInfo(
- shared_function, isolate->native_context());
+ shared, isolate->native_context());
}
@@ -96,7 +96,7 @@
TEST(TestLinkageStubCall) {
Isolate* isolate = CcTest::InitIsolateOnce();
- Zone zone;
+ Zone zone(isolate->allocator());
ToNumberStub stub(isolate);
CompilationInfo info("test", isolate, &zone, Code::ComputeFlags(Code::STUB));
CallInterfaceDescriptor interface_descriptor =
diff --git a/test/cctest/compiler/test-loop-analysis.cc b/test/cctest/compiler/test-loop-analysis.cc
index 68bfc28..fb61e20 100644
--- a/test/cctest/compiler/test-loop-analysis.cc
+++ b/test/cctest/compiler/test-loop-analysis.cc
@@ -127,7 +127,7 @@
OFStream os(stdout);
os << AsRPO(graph);
}
- Zone zone;
+ Zone zone(main_isolate()->allocator());
loop_tree = LoopFinder::BuildLoopTree(&graph, &zone);
}
return loop_tree;
diff --git a/test/cctest/compiler/test-multiple-return.cc b/test/cctest/compiler/test-multiple-return.cc
index 7c08238..2108ab1 100644
--- a/test/cctest/compiler/test-multiple-return.cc
+++ b/test/cctest/compiler/test-multiple-return.cc
@@ -69,7 +69,8 @@
TEST(ReturnThreeValues) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
CallDescriptor* desc = GetCallDescriptor(&zone, 3, 2);
HandleAndZoneScope handles;
RawMachineAssembler m(handles.main_isolate(),
diff --git a/test/cctest/compiler/test-node.cc b/test/cctest/compiler/test-node.cc
index de1c2c0..d317c38 100644
--- a/test/cctest/compiler/test-node.cc
+++ b/test/cctest/compiler/test-node.cc
@@ -141,7 +141,8 @@
TEST(NodeUseIteratorReplaceUses) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
Graph graph(&zone);
Node* n0 = graph.NewNode(&dummy_operator0);
Node* n1 = graph.NewNode(&dummy_operator1, n0);
@@ -166,7 +167,8 @@
TEST(NodeUseIteratorReplaceUsesSelf) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
Graph graph(&zone);
Node* n0 = graph.NewNode(&dummy_operator0);
Node* n1 = graph.NewNode(&dummy_operator1, n0);
@@ -190,7 +192,8 @@
TEST(ReplaceInput) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
Graph graph(&zone);
Node* n0 = graph.NewNode(&dummy_operator0);
Node* n1 = graph.NewNode(&dummy_operator0);
@@ -216,7 +219,8 @@
TEST(OwnedBy) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
Graph graph(&zone);
{
@@ -266,7 +270,8 @@
TEST(Uses) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
Graph graph(&zone);
Node* n0 = graph.NewNode(&dummy_operator0);
@@ -288,7 +293,8 @@
TEST(Inputs) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
Graph graph(&zone);
Node* n0 = graph.NewNode(&dummy_operator0);
@@ -316,7 +322,8 @@
TEST(RemoveInput) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
Graph graph(&zone);
Node* n0 = graph.NewNode(&dummy_operator0);
@@ -346,7 +353,8 @@
TEST(AppendInputsAndIterator) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
Graph graph(&zone);
Node* n0 = graph.NewNode(&dummy_operator0);
@@ -368,7 +376,8 @@
TEST(NullInputsSimple) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
Graph graph(&zone);
Node* n0 = graph.NewNode(&dummy_operator0);
@@ -395,7 +404,8 @@
TEST(NullInputsAppended) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
Graph graph(&zone);
Node* n0 = graph.NewNode(&dummy_operator0);
@@ -418,7 +428,8 @@
TEST(ReplaceUsesFromAppendedInputs) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
Graph graph(&zone);
Node* n0 = graph.NewNode(&dummy_operator0);
@@ -446,7 +457,8 @@
TEST(ReplaceInputMultipleUses) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
Graph graph(&zone);
Node* n0 = graph.NewNode(&dummy_operator0);
@@ -464,7 +476,8 @@
TEST(TrimInputCountInline) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
Graph graph(&zone);
{
@@ -532,7 +545,8 @@
TEST(TrimInputCountOutOfLine1) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
Graph graph(&zone);
{
@@ -626,7 +640,8 @@
TEST(TrimInputCountOutOfLine2) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
Graph graph(&zone);
{
@@ -695,7 +710,8 @@
TEST(NullAllInputs) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
Graph graph(&zone);
for (int i = 0; i < 2; i++) {
@@ -747,7 +763,8 @@
TEST(AppendAndTrim) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
Graph graph(&zone);
Node* nodes[] = {
diff --git a/test/cctest/compiler/test-representation-change.cc b/test/cctest/compiler/test-representation-change.cc
index 7353e16..7e75bf8 100644
--- a/test/cctest/compiler/test-representation-change.cc
+++ b/test/cctest/compiler/test-representation-change.cc
@@ -55,13 +55,13 @@
void CheckFloat64Constant(Node* n, double expected) {
Float64Matcher m(n);
CHECK(m.HasValue());
- CheckDoubleEq(expected, m.Value());
+ CHECK_DOUBLE_EQ(expected, m.Value());
}
void CheckFloat32Constant(Node* n, float expected) {
CHECK_EQ(IrOpcode::kFloat32Constant, n->opcode());
float fval = OpParameter<float>(n->op());
- CheckDoubleEq(expected, fval);
+ CHECK_FLOAT_EQ(expected, fval);
}
void CheckHeapConstant(Node* n, HeapObject* expected) {
@@ -74,7 +74,7 @@
NumberMatcher m(n);
CHECK_EQ(IrOpcode::kNumberConstant, n->opcode());
CHECK(m.HasValue());
- CheckDoubleEq(expected, m.Value());
+ CHECK_DOUBLE_EQ(expected, m.Value());
}
Node* Parameter(int index = 0) {
diff --git a/test/cctest/compiler/test-run-bytecode-graph-builder.cc b/test/cctest/compiler/test-run-bytecode-graph-builder.cc
index 9a03822..c32f923 100644
--- a/test/cctest/compiler/test-run-bytecode-graph-builder.cc
+++ b/test/cctest/compiler/test-run-bytecode-graph-builder.cc
@@ -79,12 +79,6 @@
i::FLAG_always_opt = false;
i::FLAG_allow_natives_syntax = true;
i::FLAG_loop_assignment_analysis = false;
- // Set ignition filter flag via SetFlagsFromString to avoid double-free
- // (or potential leak with StrDup() based on ownership confusion).
- ScopedVector<char> ignition_filter(64);
- SNPrintF(ignition_filter, "--ignition-filter=%s", filter);
- FlagList::SetFlagsFromString(ignition_filter.start(),
- ignition_filter.length());
// Ensure handler table is generated.
isolate->interpreter()->Initialize();
}
@@ -659,6 +653,28 @@
}
}
+TEST(BytecodeGraphBuilderInvokeIntrinsic) {
+ HandleAndZoneScope scope;
+ Isolate* isolate = scope.main_isolate();
+ Zone* zone = scope.main_zone();
+ Factory* factory = isolate->factory();
+
+ ExpectedSnippet<1> snippets[] = {
+ {"function f(arg0) { return %_IsJSReceiver(arg0); }\nf()",
+ {factory->false_value(), factory->NewNumberFromInt(1)}},
+ {"function f(arg0) { return %_IsArray(arg0) }\nf(undefined)",
+ {factory->true_value(), BytecodeGraphTester::NewObject("[1, 2, 3]")}},
+ };
+
+ for (size_t i = 0; i < arraysize(snippets); i++) {
+ BytecodeGraphTester tester(isolate, zone, snippets[i].code_snippet);
+ auto callable = tester.GetCallable<Handle<Object>>();
+ Handle<Object> return_value =
+ callable(snippets[i].parameter(0)).ToHandleChecked();
+ CHECK(return_value->SameValue(*snippets[i].return_value()));
+ }
+}
+
void TestBytecodeGraphBuilderGlobals(size_t shard) {
HandleAndZoneScope scope;
Isolate* isolate = scope.main_isolate();
@@ -2835,29 +2851,6 @@
Handle<Object> return_value = callable().ToHandleChecked();
CHECK(return_value->SameValue(*const_decl[i].return_value()));
}
-
- // Tests for Legacy constant.
- bool old_flag_legacy_const = FLAG_legacy_const;
- FLAG_legacy_const = true;
-
- ExpectedSnippet<0> legacy_const_decl[] = {
- {"return outerConst = 23;", {handle(Smi::FromInt(23), isolate)}},
- {"outerConst = 30; return outerConst;",
- {handle(Smi::FromInt(10), isolate)}},
- };
-
- for (size_t i = 0; i < arraysize(legacy_const_decl); i++) {
- ScopedVector<char> script(1024);
- SNPrintF(script, "%s %s %s", prologue, legacy_const_decl[i].code_snippet,
- epilogue);
-
- BytecodeGraphTester tester(isolate, zone, script.start(), "*");
- auto callable = tester.GetCallable<>();
- Handle<Object> return_value = callable().ToHandleChecked();
- CHECK(return_value->SameValue(*legacy_const_decl[i].return_value()));
- }
-
- FLAG_legacy_const = old_flag_legacy_const;
}
TEST(BytecodeGraphBuilderIllegalConstDeclaration) {
@@ -2911,43 +2904,6 @@
}
}
-TEST(BytecodeGraphBuilderLegacyConstDeclaration) {
- bool old_flag_legacy_const = FLAG_legacy_const;
- FLAG_legacy_const = true;
-
- HandleAndZoneScope scope;
- Isolate* isolate = scope.main_isolate();
- Zone* zone = scope.main_zone();
-
- ExpectedSnippet<0> snippets[] = {
- {"const x = (x = 10) + 3; return x;",
- {handle(Smi::FromInt(13), isolate)}},
- {"const x = 10; x = 20; return x;", {handle(Smi::FromInt(10), isolate)}},
- {"var a = 10;\n"
- "for (var i = 0; i < 10; ++i) {\n"
- " const x = i;\n" // Legacy constants are not block scoped.
- " a = a + x;\n"
- "}\n"
- "return a;\n",
- {handle(Smi::FromInt(10), isolate)}},
- {"const x = 20; eval('x = 10;'); return x;",
- {handle(Smi::FromInt(20), isolate)}},
- };
-
- for (size_t i = 0; i < arraysize(snippets); i++) {
- ScopedVector<char> script(1024);
- SNPrintF(script, "function %s() { %s }\n%s();", kFunctionName,
- snippets[i].code_snippet, kFunctionName);
-
- BytecodeGraphTester tester(isolate, zone, script.start());
- auto callable = tester.GetCallable<>();
- Handle<Object> return_value = callable().ToHandleChecked();
- CHECK(return_value->SameValue(*snippets[i].return_value()));
- }
-
- FLAG_legacy_const = old_flag_legacy_const;
-}
-
TEST(BytecodeGraphBuilderDebuggerStatement) {
FLAG_expose_debug_as = "debug";
HandleAndZoneScope scope;
diff --git a/test/cctest/compiler/test-run-calls-to-external-references.cc b/test/cctest/compiler/test-run-calls-to-external-references.cc
new file mode 100644
index 0000000..3b79cd8
--- /dev/null
+++ b/test/cctest/compiler/test-run-calls-to-external-references.cc
@@ -0,0 +1,531 @@
+// Copyright 2014 the V8 project authors. All rights reserved. Use of this
+// source code is governed by a BSD-style license that can be found in the
+// LICENSE file.
+
+#include "test/cctest/cctest.h"
+#include "test/cctest/compiler/codegen-tester.h"
+#include "test/cctest/compiler/value-helper.h"
+
+namespace v8 {
+namespace internal {
+namespace compiler {
+
+template <typename T>
+void TestExternalReferenceRoundingFunction(
+ BufferedRawMachineAssemblerTester<int32_t>* m, ExternalReference ref,
+ T (*comparison)(T)) {
+ T parameter;
+
+ Node* function = m->ExternalConstant(ref);
+ m->CallCFunction1(MachineType::Pointer(), MachineType::Pointer(), function,
+ m->PointerConstant(¶meter));
+ m->Return(m->Int32Constant(4356));
+ FOR_FLOAT64_INPUTS(i) {
+ parameter = *i;
+ m->Call();
+ CHECK_DOUBLE_EQ(comparison(*i), parameter);
+ }
+}
+
+TEST(RunCallF32Trunc) {
+ BufferedRawMachineAssemblerTester<int32_t> m;
+ ExternalReference ref = ExternalReference::wasm_f32_trunc(m.isolate());
+ TestExternalReferenceRoundingFunction<float>(&m, ref, truncf);
+}
+
+TEST(RunCallF32Floor) {
+ BufferedRawMachineAssemblerTester<int32_t> m;
+ ExternalReference ref = ExternalReference::wasm_f32_floor(m.isolate());
+ TestExternalReferenceRoundingFunction<float>(&m, ref, floorf);
+}
+
+TEST(RunCallF32Ceil) {
+ BufferedRawMachineAssemblerTester<int32_t> m;
+ ExternalReference ref = ExternalReference::wasm_f32_ceil(m.isolate());
+ TestExternalReferenceRoundingFunction<float>(&m, ref, ceilf);
+}
+
+TEST(RunCallF32RoundTiesEven) {
+ BufferedRawMachineAssemblerTester<int32_t> m;
+ ExternalReference ref = ExternalReference::wasm_f32_nearest_int(m.isolate());
+ TestExternalReferenceRoundingFunction<float>(&m, ref, nearbyintf);
+}
+
+TEST(RunCallF64Trunc) {
+ BufferedRawMachineAssemblerTester<int32_t> m;
+ ExternalReference ref = ExternalReference::wasm_f64_trunc(m.isolate());
+ TestExternalReferenceRoundingFunction<double>(&m, ref, trunc);
+}
+
+TEST(RunCallF64Floor) {
+ BufferedRawMachineAssemblerTester<int32_t> m;
+ ExternalReference ref = ExternalReference::wasm_f64_floor(m.isolate());
+ TestExternalReferenceRoundingFunction<double>(&m, ref, floor);
+}
+
+TEST(RunCallF64Ceil) {
+ BufferedRawMachineAssemblerTester<int32_t> m;
+ ExternalReference ref = ExternalReference::wasm_f64_ceil(m.isolate());
+ TestExternalReferenceRoundingFunction<double>(&m, ref, ceil);
+}
+
+TEST(RunCallF64RoundTiesEven) {
+ BufferedRawMachineAssemblerTester<int32_t> m;
+ ExternalReference ref = ExternalReference::wasm_f64_nearest_int(m.isolate());
+ TestExternalReferenceRoundingFunction<double>(&m, ref, nearbyint);
+}
+
+TEST(RunCallInt64ToFloat32) {
+ BufferedRawMachineAssemblerTester<int32_t> m;
+ ExternalReference ref = ExternalReference::wasm_int64_to_float32(m.isolate());
+
+ int64_t input;
+ float output;
+
+ Node* function = m.ExternalConstant(ref);
+ m.CallCFunction2(MachineType::Pointer(), MachineType::Pointer(),
+ MachineType::Pointer(), function, m.PointerConstant(&input),
+ m.PointerConstant(&output));
+ m.Return(m.Int32Constant(4356));
+ FOR_INT64_INPUTS(i) {
+ input = *i;
+ m.Call();
+ CHECK_FLOAT_EQ(static_cast<float>(*i), output);
+ }
+}
+
+TEST(RunCallUint64ToFloat32) {
+ struct {
+ uint64_t input;
+ uint32_t expected;
+ } values[] = {{0x0, 0x0},
+ {0x1, 0x3f800000},
+ {0xffffffff, 0x4f800000},
+ {0x1b09788b, 0x4dd84bc4},
+ {0x4c5fce8, 0x4c98bf9d},
+ {0xcc0de5bf, 0x4f4c0de6},
+ {0x2, 0x40000000},
+ {0x3, 0x40400000},
+ {0x4, 0x40800000},
+ {0x5, 0x40a00000},
+ {0x8, 0x41000000},
+ {0x9, 0x41100000},
+ {0xffffffffffffffff, 0x5f800000},
+ {0xfffffffffffffffe, 0x5f800000},
+ {0xfffffffffffffffd, 0x5f800000},
+ {0x0, 0x0},
+ {0x100000000, 0x4f800000},
+ {0xffffffff00000000, 0x5f800000},
+ {0x1b09788b00000000, 0x5dd84bc4},
+ {0x4c5fce800000000, 0x5c98bf9d},
+ {0xcc0de5bf00000000, 0x5f4c0de6},
+ {0x200000000, 0x50000000},
+ {0x300000000, 0x50400000},
+ {0x400000000, 0x50800000},
+ {0x500000000, 0x50a00000},
+ {0x800000000, 0x51000000},
+ {0x900000000, 0x51100000},
+ {0x273a798e187937a3, 0x5e1ce9e6},
+ {0xece3af835495a16b, 0x5f6ce3b0},
+ {0xb668ecc11223344, 0x5d3668ed},
+ {0x9e, 0x431e0000},
+ {0x43, 0x42860000},
+ {0xaf73, 0x472f7300},
+ {0x116b, 0x458b5800},
+ {0x658ecc, 0x4acb1d98},
+ {0x2b3b4c, 0x4a2ced30},
+ {0x88776655, 0x4f087766},
+ {0x70000000, 0x4ee00000},
+ {0x7200000, 0x4ce40000},
+ {0x7fffffff, 0x4f000000},
+ {0x56123761, 0x4eac246f},
+ {0x7fffff00, 0x4efffffe},
+ {0x761c4761eeeeeeee, 0x5eec388f},
+ {0x80000000eeeeeeee, 0x5f000000},
+ {0x88888888dddddddd, 0x5f088889},
+ {0xa0000000dddddddd, 0x5f200000},
+ {0xddddddddaaaaaaaa, 0x5f5dddde},
+ {0xe0000000aaaaaaaa, 0x5f600000},
+ {0xeeeeeeeeeeeeeeee, 0x5f6eeeef},
+ {0xfffffffdeeeeeeee, 0x5f800000},
+ {0xf0000000dddddddd, 0x5f700000},
+ {0x7fffffdddddddd, 0x5b000000},
+ {0x3fffffaaaaaaaa, 0x5a7fffff},
+ {0x1fffffaaaaaaaa, 0x59fffffd},
+ {0xfffff, 0x497ffff0},
+ {0x7ffff, 0x48ffffe0},
+ {0x3ffff, 0x487fffc0},
+ {0x1ffff, 0x47ffff80},
+ {0xffff, 0x477fff00},
+ {0x7fff, 0x46fffe00},
+ {0x3fff, 0x467ffc00},
+ {0x1fff, 0x45fff800},
+ {0xfff, 0x457ff000},
+ {0x7ff, 0x44ffe000},
+ {0x3ff, 0x447fc000},
+ {0x1ff, 0x43ff8000},
+ {0x3fffffffffff, 0x56800000},
+ {0x1fffffffffff, 0x56000000},
+ {0xfffffffffff, 0x55800000},
+ {0x7ffffffffff, 0x55000000},
+ {0x3ffffffffff, 0x54800000},
+ {0x1ffffffffff, 0x54000000},
+ {0x8000008000000000, 0x5f000000},
+ {0x8000008000000001, 0x5f000001},
+ {0x8000008000000002, 0x5f000001},
+ {0x8000008000000004, 0x5f000001},
+ {0x8000008000000008, 0x5f000001},
+ {0x8000008000000010, 0x5f000001},
+ {0x8000008000000020, 0x5f000001},
+ {0x8000009000000000, 0x5f000001},
+ {0x800000a000000000, 0x5f000001},
+ {0x8000008000100000, 0x5f000001},
+ {0x8000000000000400, 0x5f000000},
+ {0x8000000000000401, 0x5f000000}};
+
+ BufferedRawMachineAssemblerTester<int32_t> m;
+ ExternalReference ref =
+ ExternalReference::wasm_uint64_to_float32(m.isolate());
+
+ uint64_t input;
+ float output;
+
+ Node* function = m.ExternalConstant(ref);
+ m.CallCFunction2(MachineType::Pointer(), MachineType::Pointer(),
+ MachineType::Pointer(), function, m.PointerConstant(&input),
+ m.PointerConstant(&output));
+ m.Return(m.Int32Constant(4356));
+
+ for (size_t i = 0; i < arraysize(values); i++) {
+ input = values[i].input;
+ m.Call();
+ CHECK_EQ(values[i].expected, bit_cast<uint32_t>(output));
+ }
+}
+
+TEST(RunCallInt64ToFloat64) {
+ BufferedRawMachineAssemblerTester<int32_t> m;
+ ExternalReference ref = ExternalReference::wasm_int64_to_float64(m.isolate());
+
+ int64_t input;
+ double output;
+
+ Node* function = m.ExternalConstant(ref);
+ m.CallCFunction2(MachineType::Pointer(), MachineType::Pointer(),
+ MachineType::Pointer(), function, m.PointerConstant(&input),
+ m.PointerConstant(&output));
+ m.Return(m.Int32Constant(4356));
+ FOR_INT64_INPUTS(i) {
+ input = *i;
+ m.Call();
+ CHECK_DOUBLE_EQ(static_cast<double>(*i), output);
+ }
+}
+
+TEST(RunCallUint64ToFloat64) {
+ struct {
+ uint64_t input;
+ uint64_t expected;
+ } values[] = {{0x0, 0x0},
+ {0x1, 0x3ff0000000000000},
+ {0xffffffff, 0x41efffffffe00000},
+ {0x1b09788b, 0x41bb09788b000000},
+ {0x4c5fce8, 0x419317f3a0000000},
+ {0xcc0de5bf, 0x41e981bcb7e00000},
+ {0x2, 0x4000000000000000},
+ {0x3, 0x4008000000000000},
+ {0x4, 0x4010000000000000},
+ {0x5, 0x4014000000000000},
+ {0x8, 0x4020000000000000},
+ {0x9, 0x4022000000000000},
+ {0xffffffffffffffff, 0x43f0000000000000},
+ {0xfffffffffffffffe, 0x43f0000000000000},
+ {0xfffffffffffffffd, 0x43f0000000000000},
+ {0x100000000, 0x41f0000000000000},
+ {0xffffffff00000000, 0x43efffffffe00000},
+ {0x1b09788b00000000, 0x43bb09788b000000},
+ {0x4c5fce800000000, 0x439317f3a0000000},
+ {0xcc0de5bf00000000, 0x43e981bcb7e00000},
+ {0x200000000, 0x4200000000000000},
+ {0x300000000, 0x4208000000000000},
+ {0x400000000, 0x4210000000000000},
+ {0x500000000, 0x4214000000000000},
+ {0x800000000, 0x4220000000000000},
+ {0x900000000, 0x4222000000000000},
+ {0x273a798e187937a3, 0x43c39d3cc70c3c9c},
+ {0xece3af835495a16b, 0x43ed9c75f06a92b4},
+ {0xb668ecc11223344, 0x43a6cd1d98224467},
+ {0x9e, 0x4063c00000000000},
+ {0x43, 0x4050c00000000000},
+ {0xaf73, 0x40e5ee6000000000},
+ {0x116b, 0x40b16b0000000000},
+ {0x658ecc, 0x415963b300000000},
+ {0x2b3b4c, 0x41459da600000000},
+ {0x88776655, 0x41e10eeccaa00000},
+ {0x70000000, 0x41dc000000000000},
+ {0x7200000, 0x419c800000000000},
+ {0x7fffffff, 0x41dfffffffc00000},
+ {0x56123761, 0x41d5848dd8400000},
+ {0x7fffff00, 0x41dfffffc0000000},
+ {0x761c4761eeeeeeee, 0x43dd8711d87bbbbc},
+ {0x80000000eeeeeeee, 0x43e00000001dddde},
+ {0x88888888dddddddd, 0x43e11111111bbbbc},
+ {0xa0000000dddddddd, 0x43e40000001bbbbc},
+ {0xddddddddaaaaaaaa, 0x43ebbbbbbbb55555},
+ {0xe0000000aaaaaaaa, 0x43ec000000155555},
+ {0xeeeeeeeeeeeeeeee, 0x43edddddddddddde},
+ {0xfffffffdeeeeeeee, 0x43efffffffbdddde},
+ {0xf0000000dddddddd, 0x43ee0000001bbbbc},
+ {0x7fffffdddddddd, 0x435ffffff7777777},
+ {0x3fffffaaaaaaaa, 0x434fffffd5555555},
+ {0x1fffffaaaaaaaa, 0x433fffffaaaaaaaa},
+ {0xfffff, 0x412ffffe00000000},
+ {0x7ffff, 0x411ffffc00000000},
+ {0x3ffff, 0x410ffff800000000},
+ {0x1ffff, 0x40fffff000000000},
+ {0xffff, 0x40efffe000000000},
+ {0x7fff, 0x40dfffc000000000},
+ {0x3fff, 0x40cfff8000000000},
+ {0x1fff, 0x40bfff0000000000},
+ {0xfff, 0x40affe0000000000},
+ {0x7ff, 0x409ffc0000000000},
+ {0x3ff, 0x408ff80000000000},
+ {0x1ff, 0x407ff00000000000},
+ {0x3fffffffffff, 0x42cfffffffffff80},
+ {0x1fffffffffff, 0x42bfffffffffff00},
+ {0xfffffffffff, 0x42affffffffffe00},
+ {0x7ffffffffff, 0x429ffffffffffc00},
+ {0x3ffffffffff, 0x428ffffffffff800},
+ {0x1ffffffffff, 0x427ffffffffff000},
+ {0x8000008000000000, 0x43e0000010000000},
+ {0x8000008000000001, 0x43e0000010000000},
+ {0x8000000000000400, 0x43e0000000000000},
+ {0x8000000000000401, 0x43e0000000000001},
+ {0x8000000000000402, 0x43e0000000000001},
+ {0x8000000000000404, 0x43e0000000000001},
+ {0x8000000000000408, 0x43e0000000000001},
+ {0x8000000000000410, 0x43e0000000000001},
+ {0x8000000000000420, 0x43e0000000000001},
+ {0x8000000000000440, 0x43e0000000000001},
+ {0x8000000000000480, 0x43e0000000000001},
+ {0x8000000000000500, 0x43e0000000000001},
+ {0x8000000000000600, 0x43e0000000000001}};
+
+ BufferedRawMachineAssemblerTester<int32_t> m;
+ ExternalReference ref =
+ ExternalReference::wasm_uint64_to_float64(m.isolate());
+
+ uint64_t input;
+ double output;
+
+ Node* function = m.ExternalConstant(ref);
+ m.CallCFunction2(MachineType::Pointer(), MachineType::Pointer(),
+ MachineType::Pointer(), function, m.PointerConstant(&input),
+ m.PointerConstant(&output));
+ m.Return(m.Int32Constant(4356));
+
+ for (size_t i = 0; i < arraysize(values); i++) {
+ input = values[i].input;
+ m.Call();
+ CHECK_EQ(values[i].expected, bit_cast<uint64_t>(output));
+ }
+}
+
+TEST(RunCallFloat32ToInt64) {
+ BufferedRawMachineAssemblerTester<int32_t> m;
+ ExternalReference ref = ExternalReference::wasm_float32_to_int64(m.isolate());
+
+ float input;
+ int64_t output;
+
+ Node* function = m.ExternalConstant(ref);
+ m.Return(m.CallCFunction2(
+ MachineType::Int32(), MachineType::Pointer(), MachineType::Pointer(),
+ function, m.PointerConstant(&input), m.PointerConstant(&output)));
+ FOR_FLOAT32_INPUTS(i) {
+ input = *i;
+ if (*i >= static_cast<float>(std::numeric_limits<int64_t>::min()) &&
+ *i < static_cast<float>(std::numeric_limits<int64_t>::max())) {
+ CHECK_EQ(1, m.Call());
+ CHECK_EQ(static_cast<int64_t>(*i), output);
+ } else {
+ CHECK_EQ(0, m.Call());
+ }
+ }
+}
+
+TEST(RunCallFloat32ToUint64) {
+ BufferedRawMachineAssemblerTester<int32_t> m;
+ ExternalReference ref =
+ ExternalReference::wasm_float32_to_uint64(m.isolate());
+
+ float input;
+ uint64_t output;
+
+ Node* function = m.ExternalConstant(ref);
+ m.Return(m.CallCFunction2(
+ MachineType::Int32(), MachineType::Pointer(), MachineType::Pointer(),
+ function, m.PointerConstant(&input), m.PointerConstant(&output)));
+ FOR_FLOAT32_INPUTS(i) {
+ input = *i;
+ if (*i > -1.0 &&
+ *i < static_cast<float>(std::numeric_limits<uint64_t>::max())) {
+ CHECK_EQ(1, m.Call());
+ CHECK_EQ(static_cast<uint64_t>(*i), output);
+ } else {
+ CHECK_EQ(0, m.Call());
+ }
+ }
+}
+
+TEST(RunCallFloat64ToInt64) {
+ BufferedRawMachineAssemblerTester<int32_t> m;
+ ExternalReference ref = ExternalReference::wasm_float64_to_int64(m.isolate());
+
+ double input;
+ int64_t output;
+
+ Node* function = m.ExternalConstant(ref);
+ m.Return(m.CallCFunction2(
+ MachineType::Int32(), MachineType::Pointer(), MachineType::Pointer(),
+ function, m.PointerConstant(&input), m.PointerConstant(&output)));
+ FOR_FLOAT64_INPUTS(i) {
+ input = *i;
+ if (*i >= static_cast<double>(std::numeric_limits<int64_t>::min()) &&
+ *i < static_cast<double>(std::numeric_limits<int64_t>::max())) {
+ CHECK_EQ(1, m.Call());
+ CHECK_EQ(static_cast<int64_t>(*i), output);
+ } else {
+ CHECK_EQ(0, m.Call());
+ }
+ }
+}
+
+TEST(RunCallFloat64ToUint64) {
+ BufferedRawMachineAssemblerTester<int32_t> m;
+ ExternalReference ref =
+ ExternalReference::wasm_float64_to_uint64(m.isolate());
+
+ double input;
+ uint64_t output;
+
+ Node* function = m.ExternalConstant(ref);
+ m.Return(m.CallCFunction2(
+ MachineType::Int32(), MachineType::Pointer(), MachineType::Pointer(),
+ function, m.PointerConstant(&input), m.PointerConstant(&output)));
+ FOR_FLOAT64_INPUTS(i) {
+ input = *i;
+ if (*i > -1.0 &&
+ *i < static_cast<double>(std::numeric_limits<uint64_t>::max())) {
+ CHECK_EQ(1, m.Call());
+ CHECK_EQ(static_cast<uint64_t>(*i), output);
+ } else {
+ CHECK_EQ(0, m.Call());
+ }
+ }
+}
+
+TEST(RunCallInt64Div) {
+ BufferedRawMachineAssemblerTester<int32_t> m;
+ ExternalReference ref = ExternalReference::wasm_int64_div(m.isolate());
+
+ int64_t dst;
+ int64_t src;
+
+ Node* function = m.ExternalConstant(ref);
+ m.Return(m.CallCFunction2(MachineType::Int32(), MachineType::Pointer(),
+ MachineType::Pointer(), function,
+ m.PointerConstant(&dst), m.PointerConstant(&src)));
+ FOR_INT64_INPUTS(i) {
+ FOR_INT64_INPUTS(j) {
+ dst = *i;
+ src = *j;
+ if (src == 0) {
+ CHECK_EQ(0, m.Call());
+ } else if (src == -1 && dst == std::numeric_limits<int64_t>::min()) {
+ CHECK_EQ(-1, m.Call());
+ } else {
+ CHECK_EQ(1, m.Call());
+ CHECK_EQ(*i / *j, dst);
+ }
+ }
+ }
+}
+
+TEST(RunCallInt64Mod) {
+ BufferedRawMachineAssemblerTester<int32_t> m;
+ ExternalReference ref = ExternalReference::wasm_int64_mod(m.isolate());
+
+ int64_t dst;
+ int64_t src;
+
+ Node* function = m.ExternalConstant(ref);
+ m.Return(m.CallCFunction2(MachineType::Int32(), MachineType::Pointer(),
+ MachineType::Pointer(), function,
+ m.PointerConstant(&dst), m.PointerConstant(&src)));
+ FOR_INT64_INPUTS(i) {
+ FOR_INT64_INPUTS(j) {
+ dst = *i;
+ src = *j;
+ if (src == 0) {
+ CHECK_EQ(0, m.Call());
+ } else {
+ CHECK_EQ(1, m.Call());
+ CHECK_EQ(*i % *j, dst);
+ }
+ }
+ }
+}
+
+TEST(RunCallUint64Div) {
+ BufferedRawMachineAssemblerTester<int32_t> m;
+ ExternalReference ref = ExternalReference::wasm_uint64_div(m.isolate());
+
+ uint64_t dst;
+ uint64_t src;
+
+ Node* function = m.ExternalConstant(ref);
+ m.Return(m.CallCFunction2(MachineType::Int32(), MachineType::Pointer(),
+ MachineType::Pointer(), function,
+ m.PointerConstant(&dst), m.PointerConstant(&src)));
+ FOR_UINT64_INPUTS(i) {
+ FOR_UINT64_INPUTS(j) {
+ dst = *i;
+ src = *j;
+ if (src == 0) {
+ CHECK_EQ(0, m.Call());
+ } else {
+ CHECK_EQ(1, m.Call());
+ CHECK_EQ(*i / *j, dst);
+ }
+ }
+ }
+}
+
+TEST(RunCallUint64Mod) {
+ BufferedRawMachineAssemblerTester<int32_t> m;
+ ExternalReference ref = ExternalReference::wasm_uint64_mod(m.isolate());
+
+ uint64_t dst;
+ uint64_t src;
+
+ Node* function = m.ExternalConstant(ref);
+ m.Return(m.CallCFunction2(MachineType::Int32(), MachineType::Pointer(),
+ MachineType::Pointer(), function,
+ m.PointerConstant(&dst), m.PointerConstant(&src)));
+ FOR_UINT64_INPUTS(i) {
+ FOR_UINT64_INPUTS(j) {
+ dst = *i;
+ src = *j;
+ if (src == 0) {
+ CHECK_EQ(0, m.Call());
+ } else {
+ CHECK_EQ(1, m.Call());
+ CHECK_EQ(*i % *j, dst);
+ }
+ }
+ }
+}
+} // namespace compiler
+} // namespace internal
+} // namespace v8
diff --git a/test/cctest/compiler/test-run-inlining.cc b/test/cctest/compiler/test-run-inlining.cc
index f332d74..234060c 100644
--- a/test/cctest/compiler/test-run-inlining.cc
+++ b/test/cctest/compiler/test-run-inlining.cc
@@ -268,7 +268,8 @@
"(function () {"
" var x = 42;"
" function bar(s) { AssertInlineCount(2); return x + s; };"
- " return (function (s,t) { return bar(s) + bar(t); });"
+ " function foo(s, t) { return bar(s) + bar(t); };"
+ " return foo;"
"})();",
kInlineFlags);
@@ -542,33 +543,6 @@
}
-TEST(StrongModeArity) {
- FLAG_strong_mode = true;
- FunctionTester T(
- "(function () {"
- " function foo(x, y) { 'use strong'; return x; }"
- " function bar(x, y) { return foo(x); }"
- " return bar;"
- "})();",
- kInlineFlags);
- T.CheckThrows(T.undefined(), T.undefined());
-}
-
-
-TEST(StrongModeArityOuter) {
- FLAG_strong_mode = true;
- FunctionTester T(
- "(function () {"
- " 'use strong';"
- " function foo(x, y) { return x; }"
- " function bar(x, y) { return foo(x); }"
- " return bar;"
- "})();",
- kInlineFlags);
- T.CheckThrows(T.undefined(), T.undefined());
-}
-
-
TEST(InlineSelfRecursive) {
FunctionTester T(
"(function () {"
diff --git a/test/cctest/compiler/test-run-intrinsics.cc b/test/cctest/compiler/test-run-intrinsics.cc
index 6e9ebf2..6aa5f39 100644
--- a/test/cctest/compiler/test-run-intrinsics.cc
+++ b/test/cctest/compiler/test-run-intrinsics.cc
@@ -34,31 +34,6 @@
}
-#define COUNTER_NAME "hurz"
-
-static int* LookupCounter(const char* name) {
- static int counter = 1234;
- return strcmp(name, COUNTER_NAME) == 0 ? &counter : nullptr;
-}
-
-
-TEST(IncrementStatsCounter) {
- FLAG_native_code_counters = true;
- reinterpret_cast<v8::Isolate*>(CcTest::InitIsolateOnce())
- ->SetCounterFunction(LookupCounter);
- FunctionTester T(
- "(function() { %_IncrementStatsCounter('" COUNTER_NAME "'); })", flags);
- StatsCounter counter(T.main_isolate(), COUNTER_NAME);
- if (!counter.Enabled()) return;
-
- int old_value = *counter.GetInternalPointer();
- T.CheckCall(T.undefined());
- CHECK_EQ(old_value + 1, *counter.GetInternalPointer());
-}
-
-#undef COUNTER_NAME
-
-
TEST(IsArray) {
FunctionTester T("(function(a) { return %_IsArray(a); })", flags);
diff --git a/test/cctest/compiler/test-run-jscalls.cc b/test/cctest/compiler/test-run-jscalls.cc
index c282958..12566c2 100644
--- a/test/cctest/compiler/test-run-jscalls.cc
+++ b/test/cctest/compiler/test-run-jscalls.cc
@@ -129,12 +129,18 @@
}
-TEST(RuntimeCallCPP2) {
+TEST(RuntimeCall) {
FLAG_allow_natives_syntax = true;
- FunctionTester T("(function(a,b) { return %NumberImul(a, b); })");
+ FunctionTester T("(function(a) { return %IsJSReceiver(a); })");
- T.CheckCall(T.Val(2730), T.Val(42), T.Val(65));
- T.CheckCall(T.Val(798), T.Val(42), T.Val(19));
+ T.CheckCall(T.false_value(), T.Val(23), T.undefined());
+ T.CheckCall(T.false_value(), T.Val(4.2), T.undefined());
+ T.CheckCall(T.false_value(), T.Val("str"), T.undefined());
+ T.CheckCall(T.false_value(), T.true_value(), T.undefined());
+ T.CheckCall(T.false_value(), T.false_value(), T.undefined());
+ T.CheckCall(T.false_value(), T.undefined(), T.undefined());
+ T.CheckCall(T.true_value(), T.NewObject("({})"), T.undefined());
+ T.CheckCall(T.true_value(), T.NewObject("([])"), T.undefined());
}
diff --git a/test/cctest/compiler/test-run-jsobjects.cc b/test/cctest/compiler/test-run-jsobjects.cc
index 4bf10ca..80a9181 100644
--- a/test/cctest/compiler/test-run-jsobjects.cc
+++ b/test/cctest/compiler/test-run-jsobjects.cc
@@ -16,7 +16,7 @@
CHECK(arguments->IsJSObject() && !arguments->IsJSArray());
CHECK(JSObject::cast(*arguments)->HasSloppyArgumentsElements());
Handle<String> l = T.isolate->factory()->length_string();
- Handle<Object> length = JSObject::GetProperty(arguments, l).ToHandleChecked();
+ Handle<Object> length = Object::GetProperty(arguments, l).ToHandleChecked();
CHECK_EQ(4, length->Number());
}
@@ -29,7 +29,7 @@
CHECK(arguments->IsJSObject() && !arguments->IsJSArray());
CHECK(!JSObject::cast(*arguments)->HasSloppyArgumentsElements());
Handle<String> l = T.isolate->factory()->length_string();
- Handle<Object> length = JSObject::GetProperty(arguments, l).ToHandleChecked();
+ Handle<Object> length = Object::GetProperty(arguments, l).ToHandleChecked();
CHECK_EQ(4, length->Number());
}
@@ -42,7 +42,7 @@
CHECK(arguments->IsJSObject() && arguments->IsJSArray());
CHECK(!JSObject::cast(*arguments)->HasSloppyArgumentsElements());
Handle<String> l = T.isolate->factory()->length_string();
- Handle<Object> length = JSObject::GetProperty(arguments, l).ToHandleChecked();
+ Handle<Object> length = Object::GetProperty(arguments, l).ToHandleChecked();
CHECK_EQ(3, length->Number());
}
diff --git a/test/cctest/compiler/test-run-jsops.cc b/test/cctest/compiler/test-run-jsops.cc
index 9a2c467..b68fc1c 100644
--- a/test/cctest/compiler/test-run-jsops.cc
+++ b/test/cctest/compiler/test-run-jsops.cc
@@ -394,17 +394,6 @@
}
-TEST(GlobalStoreSloppy) {
- FLAG_legacy_const = true;
- FunctionTester T("(function(a,b) { g = a + b; return g; })");
-
- T.CheckCall(T.Val(33), T.Val(22), T.Val(11));
- CompileRun("delete g");
- CompileRun("const g = 23");
- T.CheckCall(T.Val(23), T.Val(55), T.Val(44));
-}
-
-
TEST(GlobalStoreStrict) {
FunctionTester T("(function(a,b) { 'use strict'; g = a + b; return g; })");
diff --git a/test/cctest/compiler/test-run-machops.cc b/test/cctest/compiler/test-run-machops.cc
index fba9e0e..2bfe124 100644
--- a/test/cctest/compiler/test-run-machops.cc
+++ b/test/cctest/compiler/test-run-machops.cc
@@ -1197,7 +1197,7 @@
p1 = *j;
p2 = *j - 5;
CHECK_EQ(magic, m.Call());
- CheckDoubleEq(p1, p2);
+ CHECK_DOUBLE_EQ(p1, p2);
}
}
}
@@ -1224,7 +1224,7 @@
p1 = *j;
p2 = *j - 5;
CHECK_EQ(magic, m.Call());
- CheckDoubleEq(p1, p2);
+ CHECK_DOUBLE_EQ(p1, p2);
}
}
}
@@ -3658,10 +3658,7 @@
m.Return(m.Float32Add(m.Parameter(0), m.Parameter(1)));
FOR_FLOAT32_INPUTS(i) {
- FOR_FLOAT32_INPUTS(j) {
- volatile float expected = *i + *j;
- CheckFloatEq(expected, m.Call(*i, *j));
- }
+ FOR_FLOAT32_INPUTS(j) { CHECK_FLOAT_EQ(*i + *j, m.Call(*i, *j)); }
}
}
@@ -3672,10 +3669,7 @@
m.Return(m.Float32Sub(m.Parameter(0), m.Parameter(1)));
FOR_FLOAT32_INPUTS(i) {
- FOR_FLOAT32_INPUTS(j) {
- volatile float expected = *i - *j;
- CheckFloatEq(expected, m.Call(*i, *j));
- }
+ FOR_FLOAT32_INPUTS(j) { CHECK_FLOAT_EQ(*i - *j, m.Call(*i, *j)); }
}
}
@@ -3686,10 +3680,7 @@
m.Return(m.Float32Mul(m.Parameter(0), m.Parameter(1)));
FOR_FLOAT32_INPUTS(i) {
- FOR_FLOAT32_INPUTS(j) {
- volatile float expected = *i * *j;
- CheckFloatEq(expected, m.Call(*i, *j));
- }
+ FOR_FLOAT32_INPUTS(j) { CHECK_FLOAT_EQ(*i * *j, m.Call(*i, *j)); }
}
}
@@ -3700,10 +3691,7 @@
m.Return(m.Float32Div(m.Parameter(0), m.Parameter(1)));
FOR_FLOAT32_INPUTS(i) {
- FOR_FLOAT32_INPUTS(j) {
- volatile float expected = *i / *j;
- CheckFloatEq(expected, m.Call(*i, *j));
- }
+ FOR_FLOAT32_INPUTS(j) { CHECK_FLOAT_EQ(*i / *j, m.Call(*i, *j)); }
}
}
@@ -3714,10 +3702,7 @@
m.Return(m.Float64Add(m.Parameter(0), m.Parameter(1)));
FOR_FLOAT64_INPUTS(i) {
- FOR_FLOAT64_INPUTS(j) {
- volatile double expected = *i + *j;
- CheckDoubleEq(expected, m.Call(*i, *j));
- }
+ FOR_FLOAT64_INPUTS(j) { CHECK_DOUBLE_EQ(*i + *j, m.Call(*i, *j)); }
}
}
@@ -3728,10 +3713,7 @@
m.Return(m.Float64Sub(m.Parameter(0), m.Parameter(1)));
FOR_FLOAT64_INPUTS(i) {
- FOR_FLOAT64_INPUTS(j) {
- volatile double expected = *i - *j;
- CheckDoubleEq(expected, m.Call(*i, *j));
- }
+ FOR_FLOAT64_INPUTS(j) { CHECK_DOUBLE_EQ(*i - *j, m.Call(*i, *j)); }
}
}
@@ -3742,10 +3724,7 @@
m.Return(m.Float64Mul(m.Parameter(0), m.Parameter(1)));
FOR_FLOAT64_INPUTS(i) {
- FOR_FLOAT64_INPUTS(j) {
- volatile double expected = *i * *j;
- CheckDoubleEq(expected, m.Call(*i, *j));
- }
+ FOR_FLOAT64_INPUTS(j) { CHECK_DOUBLE_EQ(*i * *j, m.Call(*i, *j)); }
}
}
@@ -3756,10 +3735,7 @@
m.Return(m.Float64Div(m.Parameter(0), m.Parameter(1)));
FOR_FLOAT64_INPUTS(i) {
- FOR_FLOAT64_INPUTS(j) {
- volatile double expected = *i / *j;
- CheckDoubleEq(expected, m.Call(*i, *j));
- }
+ FOR_FLOAT64_INPUTS(j) { CHECK_DOUBLE_EQ(*i / *j, m.Call(*i, *j)); }
}
}
@@ -3770,7 +3746,7 @@
m.Return(m.Float64Mod(m.Parameter(0), m.Parameter(1)));
FOR_FLOAT64_INPUTS(i) {
- FOR_FLOAT64_INPUTS(j) { CheckDoubleEq(modulo(*i, *j), m.Call(*i, *j)); }
+ FOR_FLOAT64_INPUTS(j) { CHECK_DOUBLE_EQ(modulo(*i, *j), m.Call(*i, *j)); }
}
}
@@ -3816,10 +3792,7 @@
bt.AddReturn(m.Float32Add(bt.param0, bt.param1));
FOR_FLOAT32_INPUTS(pl) {
- FOR_FLOAT32_INPUTS(pr) {
- float expected = *pl + *pr;
- CheckFloatEq(expected, bt.call(*pl, *pr));
- }
+ FOR_FLOAT32_INPUTS(pr) { CHECK_FLOAT_EQ(*pl + *pr, bt.call(*pl, *pr)); }
}
}
@@ -3831,10 +3804,7 @@
bt.AddReturn(m.Float64Add(bt.param0, bt.param1));
FOR_FLOAT64_INPUTS(pl) {
- FOR_FLOAT64_INPUTS(pr) {
- double expected = *pl + *pr;
- CheckDoubleEq(expected, bt.call(*pl, *pr));
- }
+ FOR_FLOAT64_INPUTS(pr) { CHECK_DOUBLE_EQ(*pl + *pr, bt.call(*pl, *pr)); }
}
}
@@ -3848,8 +3818,7 @@
FOR_FLOAT32_INPUTS(pl) {
FOR_FLOAT32_INPUTS(pr) {
- double expected = *pl > *pr ? *pl : *pr;
- CheckDoubleEq(expected, bt.call(*pl, *pr));
+ CHECK_DOUBLE_EQ(*pl > *pr ? *pl : *pr, bt.call(*pl, *pr));
}
}
}
@@ -3864,8 +3833,7 @@
FOR_FLOAT64_INPUTS(pl) {
FOR_FLOAT64_INPUTS(pr) {
- double expected = *pl > *pr ? *pl : *pr;
- CheckDoubleEq(expected, bt.call(*pl, *pr));
+ CHECK_DOUBLE_EQ(*pl > *pr ? *pl : *pr, bt.call(*pl, *pr));
}
}
}
@@ -3880,8 +3848,7 @@
FOR_FLOAT32_INPUTS(pl) {
FOR_FLOAT32_INPUTS(pr) {
- double expected = *pl < *pr ? *pl : *pr;
- CheckDoubleEq(expected, bt.call(*pl, *pr));
+ CHECK_DOUBLE_EQ(*pl < *pr ? *pl : *pr, bt.call(*pl, *pr));
}
}
}
@@ -3896,8 +3863,7 @@
FOR_FLOAT64_INPUTS(pl) {
FOR_FLOAT64_INPUTS(pr) {
- double expected = *pl < *pr ? *pl : *pr;
- CheckDoubleEq(expected, bt.call(*pl, *pr));
+ CHECK_DOUBLE_EQ(*pl < *pr ? *pl : *pr, bt.call(*pl, *pr));
}
}
}
@@ -3910,10 +3876,7 @@
bt.AddReturn(m.Float32Sub(bt.param0, bt.param1));
FOR_FLOAT32_INPUTS(pl) {
- FOR_FLOAT32_INPUTS(pr) {
- float expected = *pl - *pr;
- CheckFloatEq(expected, bt.call(*pl, *pr));
- }
+ FOR_FLOAT32_INPUTS(pr) { CHECK_FLOAT_EQ(*pl - *pr, bt.call(*pl, *pr)); }
}
}
@@ -3923,10 +3886,7 @@
BufferedRawMachineAssemblerTester<float> m(MachineType::Float32());
m.Return(m.Float32Sub(m.Float32Constant(*i), m.Parameter(0)));
- FOR_FLOAT32_INPUTS(j) {
- volatile float expected = *i - *j;
- CheckFloatEq(expected, m.Call(*j));
- }
+ FOR_FLOAT32_INPUTS(j) { CHECK_FLOAT_EQ(*i - *j, m.Call(*j)); }
}
}
@@ -3936,10 +3896,7 @@
BufferedRawMachineAssemblerTester<float> m(MachineType::Float32());
m.Return(m.Float32Sub(m.Parameter(0), m.Float32Constant(*i)));
- FOR_FLOAT32_INPUTS(j) {
- volatile float expected = *j - *i;
- CheckFloatEq(expected, m.Call(*j));
- }
+ FOR_FLOAT32_INPUTS(j) { CHECK_FLOAT_EQ(*j - *i, m.Call(*j)); }
}
}
@@ -3949,7 +3906,7 @@
BufferedRawMachineAssemblerTester<double> m(MachineType::Float64());
m.Return(m.Float64Sub(m.Float64Constant(*i), m.Parameter(0)));
- FOR_FLOAT64_INPUTS(j) { CheckFloatEq(*i - *j, m.Call(*j)); }
+ FOR_FLOAT64_INPUTS(j) { CHECK_FLOAT_EQ(*i - *j, m.Call(*j)); }
}
}
@@ -3959,7 +3916,7 @@
BufferedRawMachineAssemblerTester<double> m(MachineType::Float64());
m.Return(m.Float64Sub(m.Parameter(0), m.Float64Constant(*i)));
- FOR_FLOAT64_INPUTS(j) { CheckFloatEq(*j - *i, m.Call(*j)); }
+ FOR_FLOAT64_INPUTS(j) { CHECK_FLOAT_EQ(*j - *i, m.Call(*j)); }
}
}
@@ -3973,7 +3930,7 @@
FOR_FLOAT64_INPUTS(pl) {
FOR_FLOAT64_INPUTS(pr) {
double expected = *pl - *pr;
- CheckDoubleEq(expected, bt.call(*pl, *pr));
+ CHECK_DOUBLE_EQ(expected, bt.call(*pl, *pr));
}
}
}
@@ -3986,10 +3943,7 @@
bt.AddReturn(m.Float32Mul(bt.param0, bt.param1));
FOR_FLOAT32_INPUTS(pl) {
- FOR_FLOAT32_INPUTS(pr) {
- float expected = *pl * *pr;
- CheckFloatEq(expected, bt.call(*pl, *pr));
- }
+ FOR_FLOAT32_INPUTS(pr) { CHECK_FLOAT_EQ(*pl * *pr, bt.call(*pl, *pr)); }
}
}
@@ -4003,7 +3957,7 @@
FOR_FLOAT64_INPUTS(pl) {
FOR_FLOAT64_INPUTS(pr) {
double expected = *pl * *pr;
- CheckDoubleEq(expected, bt.call(*pl, *pr));
+ CHECK_DOUBLE_EQ(expected, bt.call(*pl, *pr));
}
}
}
@@ -4018,7 +3972,7 @@
FOR_FLOAT64_INPUTS(i) {
FOR_FLOAT64_INPUTS(j) {
FOR_FLOAT64_INPUTS(k) {
- CheckDoubleEq((*i * *j) + *k, m.Call(*i, *j, *k));
+ CHECK_DOUBLE_EQ((*i * *j) + *k, m.Call(*i, *j, *k));
}
}
}
@@ -4034,7 +3988,7 @@
FOR_FLOAT64_INPUTS(i) {
FOR_FLOAT64_INPUTS(j) {
FOR_FLOAT64_INPUTS(k) {
- CheckDoubleEq(*i + (*j * *k), m.Call(*i, *j, *k));
+ CHECK_DOUBLE_EQ(*i + (*j * *k), m.Call(*i, *j, *k));
}
}
}
@@ -4050,7 +4004,7 @@
FOR_FLOAT64_INPUTS(i) {
FOR_FLOAT64_INPUTS(j) {
FOR_FLOAT64_INPUTS(k) {
- CheckDoubleEq((*i * *j) - *k, m.Call(*i, *j, *k));
+ CHECK_DOUBLE_EQ((*i * *j) - *k, m.Call(*i, *j, *k));
}
}
}
@@ -4066,7 +4020,7 @@
FOR_FLOAT64_INPUTS(i) {
FOR_FLOAT64_INPUTS(j) {
FOR_FLOAT64_INPUTS(k) {
- CheckDoubleEq(*i - (*j * *k), m.Call(*i, *j, *k));
+ CHECK_DOUBLE_EQ(*i - (*j * *k), m.Call(*i, *j, *k));
}
}
}
@@ -4078,7 +4032,7 @@
BufferedRawMachineAssemblerTester<double> m(MachineType::Float64());
m.Return(m.Float64Mul(m.Float64Constant(*i), m.Parameter(0)));
- FOR_FLOAT64_INPUTS(j) { CheckFloatEq(*i * *j, m.Call(*j)); }
+ FOR_FLOAT64_INPUTS(j) { CHECK_FLOAT_EQ(*i * *j, m.Call(*j)); }
}
}
@@ -4088,7 +4042,7 @@
BufferedRawMachineAssemblerTester<double> m(MachineType::Float64());
m.Return(m.Float64Mul(m.Parameter(0), m.Float64Constant(*i)));
- FOR_FLOAT64_INPUTS(j) { CheckFloatEq(*j * *i, m.Call(*j)); }
+ FOR_FLOAT64_INPUTS(j) { CHECK_FLOAT_EQ(*j * *i, m.Call(*j)); }
}
}
@@ -4100,10 +4054,7 @@
bt.AddReturn(m.Float32Div(bt.param0, bt.param1));
FOR_FLOAT32_INPUTS(pl) {
- FOR_FLOAT32_INPUTS(pr) {
- float expected = *pl / *pr;
- CheckFloatEq(expected, bt.call(*pl, *pr));
- }
+ FOR_FLOAT32_INPUTS(pr) { CHECK_FLOAT_EQ(*pl / *pr, bt.call(*pl, *pr)); }
}
}
@@ -4115,10 +4066,7 @@
bt.AddReturn(m.Float64Div(bt.param0, bt.param1));
FOR_FLOAT64_INPUTS(pl) {
- FOR_FLOAT64_INPUTS(pr) {
- double expected = *pl / *pr;
- CheckDoubleEq(expected, bt.call(*pl, *pr));
- }
+ FOR_FLOAT64_INPUTS(pr) { CHECK_DOUBLE_EQ(*pl / *pr, bt.call(*pl, *pr)); }
}
}
@@ -4130,11 +4078,7 @@
bt.AddReturn(m.Float64Mod(bt.param0, bt.param1));
FOR_FLOAT64_INPUTS(i) {
- FOR_FLOAT64_INPUTS(j) {
- double expected = modulo(*i, *j);
- double found = bt.call(*i, *j);
- CheckDoubleEq(expected, found);
- }
+ FOR_FLOAT64_INPUTS(j) { CHECK_DOUBLE_EQ(modulo(*i, *j), bt.call(*i, *j)); }
}
}
@@ -4143,7 +4087,7 @@
int32_t magic = 0x986234;
BufferedRawMachineAssemblerTester<double> m;
m.Return(m.ChangeInt32ToFloat64(m.Int32Constant(magic)));
- CheckDoubleEq(static_cast<double>(magic), m.Call());
+ CHECK_DOUBLE_EQ(static_cast<double>(magic), m.Call());
}
@@ -4151,7 +4095,7 @@
BufferedRawMachineAssemblerTester<double> m(MachineType::Int32());
m.Return(m.ChangeInt32ToFloat64(m.Parameter(0)));
- FOR_INT32_INPUTS(i) { CheckDoubleEq(static_cast<double>(*i), m.Call(*i)); }
+ FOR_INT32_INPUTS(i) { CHECK_DOUBLE_EQ(static_cast<double>(*i), m.Call(*i)); }
}
@@ -4159,7 +4103,7 @@
BufferedRawMachineAssemblerTester<double> m(MachineType::Uint32());
m.Return(m.ChangeUint32ToFloat64(m.Parameter(0)));
- FOR_UINT32_INPUTS(i) { CheckDoubleEq(static_cast<double>(*i), m.Call(*i)); }
+ FOR_UINT32_INPUTS(i) { CHECK_DOUBLE_EQ(static_cast<double>(*i), m.Call(*i)); }
}
@@ -4169,7 +4113,7 @@
FOR_FLOAT32_INPUTS(i) {
if (*i <= static_cast<float>(std::numeric_limits<int32_t>::max()) &&
*i >= static_cast<float>(std::numeric_limits<int32_t>::min())) {
- CheckFloatEq(static_cast<int32_t>(*i), m.Call(*i));
+ CHECK_FLOAT_EQ(static_cast<int32_t>(*i), m.Call(*i));
}
}
}
@@ -4193,7 +4137,7 @@
FOR_FLOAT32_INPUTS(i) {
if (*i <= static_cast<float>(std::numeric_limits<uint32_t>::max()) &&
*i >= static_cast<float>(std::numeric_limits<uint32_t>::min())) {
- CheckFloatEq(static_cast<uint32_t>(*i), m.Call(*i));
+ CHECK_FLOAT_EQ(static_cast<uint32_t>(*i), m.Call(*i));
}
}
}
@@ -4250,9 +4194,262 @@
m.Return(m.TruncateFloat64ToFloat32(m.Parameter(0)));
- FOR_FLOAT64_INPUTS(i) { CheckFloatEq(DoubleToFloat32(*i), m.Call(*i)); }
+ FOR_FLOAT64_INPUTS(i) { CHECK_FLOAT_EQ(DoubleToFloat32(*i), m.Call(*i)); }
}
+uint64_t ToInt64(uint32_t low, uint32_t high) {
+ return (static_cast<uint64_t>(high) << 32) | static_cast<uint64_t>(low);
+}
+
+#if V8_TARGET_ARCH_32_BIT && !V8_TARGET_ARCH_MIPS && !V8_TARGET_ARCH_X87
+TEST(RunInt32PairAdd) {
+ BufferedRawMachineAssemblerTester<int32_t> m(
+ MachineType::Uint32(), MachineType::Uint32(), MachineType::Uint32(),
+ MachineType::Uint32());
+
+ uint32_t high;
+ uint32_t low;
+
+ Node* PairAdd = m.Int32PairAdd(m.Parameter(0), m.Parameter(1), m.Parameter(2),
+ m.Parameter(3));
+
+ m.StoreToPointer(&low, MachineRepresentation::kWord32,
+ m.Projection(0, PairAdd));
+ m.StoreToPointer(&high, MachineRepresentation::kWord32,
+ m.Projection(1, PairAdd));
+ m.Return(m.Int32Constant(74));
+
+ FOR_UINT64_INPUTS(i) {
+ FOR_UINT64_INPUTS(j) {
+ m.Call(static_cast<uint32_t>(*i & 0xffffffff),
+ static_cast<uint32_t>(*i >> 32),
+ static_cast<uint32_t>(*j & 0xffffffff),
+ static_cast<uint32_t>(*j >> 32));
+ CHECK_EQ(*i + *j, ToInt64(low, high));
+ }
+ }
+}
+
+void TestInt32PairAddWithSharedInput(int a, int b, int c, int d) {
+ BufferedRawMachineAssemblerTester<int32_t> m(MachineType::Uint32(),
+ MachineType::Uint32());
+
+ uint32_t high;
+ uint32_t low;
+
+ Node* PairAdd = m.Int32PairAdd(m.Parameter(a), m.Parameter(b), m.Parameter(c),
+ m.Parameter(d));
+
+ m.StoreToPointer(&low, MachineRepresentation::kWord32,
+ m.Projection(0, PairAdd));
+ m.StoreToPointer(&high, MachineRepresentation::kWord32,
+ m.Projection(1, PairAdd));
+ m.Return(m.Int32Constant(74));
+
+ FOR_UINT32_INPUTS(i) {
+ FOR_UINT32_INPUTS(j) {
+ m.Call(*i, *j);
+ uint32_t inputs[] = {*i, *j};
+ CHECK_EQ(ToInt64(inputs[a], inputs[b]) + ToInt64(inputs[c], inputs[d]),
+ ToInt64(low, high));
+ }
+ }
+}
+
+TEST(RunInt32PairAddWithSharedInput) {
+ TestInt32PairAddWithSharedInput(0, 0, 0, 0);
+ TestInt32PairAddWithSharedInput(1, 0, 0, 0);
+ TestInt32PairAddWithSharedInput(0, 1, 0, 0);
+ TestInt32PairAddWithSharedInput(0, 0, 1, 0);
+ TestInt32PairAddWithSharedInput(0, 0, 0, 1);
+ TestInt32PairAddWithSharedInput(1, 1, 0, 0);
+}
+
+TEST(RunInt32PairSub) {
+ BufferedRawMachineAssemblerTester<int32_t> m(
+ MachineType::Uint32(), MachineType::Uint32(), MachineType::Uint32(),
+ MachineType::Uint32());
+
+ uint32_t high;
+ uint32_t low;
+
+ Node* PairSub = m.Int32PairSub(m.Parameter(0), m.Parameter(1), m.Parameter(2),
+ m.Parameter(3));
+
+ m.StoreToPointer(&low, MachineRepresentation::kWord32,
+ m.Projection(0, PairSub));
+ m.StoreToPointer(&high, MachineRepresentation::kWord32,
+ m.Projection(1, PairSub));
+ m.Return(m.Int32Constant(74));
+
+ FOR_UINT64_INPUTS(i) {
+ FOR_UINT64_INPUTS(j) {
+ m.Call(static_cast<uint32_t>(*i & 0xffffffff),
+ static_cast<uint32_t>(*i >> 32),
+ static_cast<uint32_t>(*j & 0xffffffff),
+ static_cast<uint32_t>(*j >> 32));
+ CHECK_EQ(*i - *j, ToInt64(low, high));
+ }
+ }
+}
+
+void TestInt32PairSubWithSharedInput(int a, int b, int c, int d) {
+ BufferedRawMachineAssemblerTester<int32_t> m(MachineType::Uint32(),
+ MachineType::Uint32());
+
+ uint32_t high;
+ uint32_t low;
+
+ Node* PairSub = m.Int32PairSub(m.Parameter(a), m.Parameter(b), m.Parameter(c),
+ m.Parameter(d));
+
+ m.StoreToPointer(&low, MachineRepresentation::kWord32,
+ m.Projection(0, PairSub));
+ m.StoreToPointer(&high, MachineRepresentation::kWord32,
+ m.Projection(1, PairSub));
+ m.Return(m.Int32Constant(74));
+
+ FOR_UINT32_INPUTS(i) {
+ FOR_UINT32_INPUTS(j) {
+ m.Call(*i, *j);
+ uint32_t inputs[] = {*i, *j};
+ CHECK_EQ(ToInt64(inputs[a], inputs[b]) - ToInt64(inputs[c], inputs[d]),
+ ToInt64(low, high));
+ }
+ }
+}
+
+TEST(RunInt32PairSubWithSharedInput) {
+ TestInt32PairSubWithSharedInput(0, 0, 0, 0);
+ TestInt32PairSubWithSharedInput(1, 0, 0, 0);
+ TestInt32PairSubWithSharedInput(0, 1, 0, 0);
+ TestInt32PairSubWithSharedInput(0, 0, 1, 0);
+ TestInt32PairSubWithSharedInput(0, 0, 0, 1);
+ TestInt32PairSubWithSharedInput(1, 1, 0, 0);
+}
+
+TEST(RunInt32PairMul) {
+ BufferedRawMachineAssemblerTester<int32_t> m(
+ MachineType::Uint32(), MachineType::Uint32(), MachineType::Uint32(),
+ MachineType::Uint32());
+
+ uint32_t high;
+ uint32_t low;
+
+ Node* PairMul = m.Int32PairMul(m.Parameter(0), m.Parameter(1), m.Parameter(2),
+ m.Parameter(3));
+
+ m.StoreToPointer(&low, MachineRepresentation::kWord32,
+ m.Projection(0, PairMul));
+ m.StoreToPointer(&high, MachineRepresentation::kWord32,
+ m.Projection(1, PairMul));
+ m.Return(m.Int32Constant(74));
+
+ FOR_UINT64_INPUTS(i) {
+ FOR_UINT64_INPUTS(j) {
+ m.Call(static_cast<uint32_t>(*i & 0xffffffff),
+ static_cast<uint32_t>(*i >> 32),
+ static_cast<uint32_t>(*j & 0xffffffff),
+ static_cast<uint32_t>(*j >> 32));
+ CHECK_EQ(*i * *j, ToInt64(low, high));
+ }
+ }
+}
+
+void TestInt32PairMulWithSharedInput(int a, int b, int c, int d) {
+ BufferedRawMachineAssemblerTester<int32_t> m(MachineType::Uint32(),
+ MachineType::Uint32());
+
+ uint32_t high;
+ uint32_t low;
+
+ Node* PairMul = m.Int32PairMul(m.Parameter(a), m.Parameter(b), m.Parameter(c),
+ m.Parameter(d));
+
+ m.StoreToPointer(&low, MachineRepresentation::kWord32,
+ m.Projection(0, PairMul));
+ m.StoreToPointer(&high, MachineRepresentation::kWord32,
+ m.Projection(1, PairMul));
+ m.Return(m.Int32Constant(74));
+
+ FOR_UINT32_INPUTS(i) {
+ FOR_UINT32_INPUTS(j) {
+ m.Call(*i, *j);
+ uint32_t inputs[] = {*i, *j};
+ CHECK_EQ(ToInt64(inputs[a], inputs[b]) * ToInt64(inputs[c], inputs[d]),
+ ToInt64(low, high));
+ }
+ }
+}
+
+TEST(RunInt32PairMulWithSharedInput) {
+ TestInt32PairMulWithSharedInput(0, 0, 0, 0);
+ TestInt32PairMulWithSharedInput(1, 0, 0, 0);
+ TestInt32PairMulWithSharedInput(0, 1, 0, 0);
+ TestInt32PairMulWithSharedInput(0, 0, 1, 0);
+ TestInt32PairMulWithSharedInput(0, 0, 0, 1);
+ TestInt32PairMulWithSharedInput(1, 1, 0, 0);
+ TestInt32PairMulWithSharedInput(0, 1, 1, 0);
+}
+
+TEST(RunWord32PairShl) {
+ BufferedRawMachineAssemblerTester<int32_t> m(
+ MachineType::Uint32(), MachineType::Uint32(), MachineType::Uint32());
+
+ uint32_t high;
+ uint32_t low;
+
+ Node* PairAdd =
+ m.Word32PairShl(m.Parameter(0), m.Parameter(1), m.Parameter(2));
+
+ m.StoreToPointer(&low, MachineRepresentation::kWord32,
+ m.Projection(0, PairAdd));
+ m.StoreToPointer(&high, MachineRepresentation::kWord32,
+ m.Projection(1, PairAdd));
+ m.Return(m.Int32Constant(74));
+
+ FOR_UINT64_INPUTS(i) {
+ for (uint32_t j = 0; j < 64; j++) {
+ m.Call(static_cast<uint32_t>(*i & 0xffffffff),
+ static_cast<uint32_t>(*i >> 32), j);
+ CHECK_EQ(*i << j, ToInt64(low, high));
+ }
+ }
+}
+
+void TestWord32PairShlWithSharedInput(int a, int b) {
+ BufferedRawMachineAssemblerTester<int32_t> m(MachineType::Uint32(),
+ MachineType::Uint32());
+
+ uint32_t high;
+ uint32_t low;
+
+ Node* PairAdd =
+ m.Word32PairShl(m.Parameter(a), m.Parameter(b), m.Parameter(1));
+
+ m.StoreToPointer(&low, MachineRepresentation::kWord32,
+ m.Projection(0, PairAdd));
+ m.StoreToPointer(&high, MachineRepresentation::kWord32,
+ m.Projection(1, PairAdd));
+ m.Return(m.Int32Constant(74));
+
+ FOR_UINT32_INPUTS(i) {
+ for (uint32_t j = 0; j < 64; j++) {
+ m.Call(*i, j);
+ uint32_t inputs[] = {*i, j};
+ CHECK_EQ(ToInt64(inputs[a], inputs[b]) << j, ToInt64(low, high));
+ }
+ }
+}
+
+TEST(RunWord32PairShlWithSharedInput) {
+ TestWord32PairShlWithSharedInput(0, 0);
+ TestWord32PairShlWithSharedInput(0, 1);
+ TestWord32PairShlWithSharedInput(1, 0);
+ TestWord32PairShlWithSharedInput(1, 1);
+}
+
+#endif
TEST(RunDeadChangeFloat64ToInt32) {
RawMachineAssemblerTester<int32_t> m;
@@ -5298,7 +5495,9 @@
m.Return(m.ChangeFloat32ToFloat64(m.Parameter(0)));
- FOR_FLOAT32_INPUTS(i) { CheckDoubleEq(static_cast<double>(*i), m.Call(*i)); }
+ FOR_FLOAT32_INPUTS(i) {
+ CHECK_DOUBLE_EQ(static_cast<double>(*i), m.Call(*i));
+ }
}
@@ -5306,7 +5505,7 @@
FOR_FLOAT32_INPUTS(i) {
BufferedRawMachineAssemblerTester<float> m;
m.Return(m.Float32Constant(*i));
- CheckFloatEq(*i, m.Call());
+ CHECK_FLOAT_EQ(*i, m.Call());
}
}
@@ -5340,7 +5539,7 @@
double expected = bit_cast<double>(
(bit_cast<uint64_t>(*i) & ~(V8_UINT64_C(0xFFFFFFFF))) |
(static_cast<uint64_t>(bit_cast<uint32_t>(*j))));
- CheckDoubleEq(expected, m.Call(*i, *j));
+ CHECK_DOUBLE_EQ(expected, m.Call(*i, *j));
}
}
}
@@ -5355,7 +5554,7 @@
uint64_t expected = (bit_cast<uint64_t>(*i) & 0xFFFFFFFF) |
(static_cast<uint64_t>(*j) << 32);
- CheckDoubleEq(bit_cast<double>(expected), m.Call(*i, *j));
+ CHECK_DOUBLE_EQ(bit_cast<double>(expected), m.Call(*i, *j));
}
}
}
@@ -5364,14 +5563,14 @@
TEST(RunFloat32Abs) {
BufferedRawMachineAssemblerTester<float> m(MachineType::Float32());
m.Return(m.Float32Abs(m.Parameter(0)));
- FOR_FLOAT32_INPUTS(i) { CheckFloatEq(std::abs(*i), m.Call(*i)); }
+ FOR_FLOAT32_INPUTS(i) { CHECK_FLOAT_EQ(std::abs(*i), m.Call(*i)); }
}
TEST(RunFloat64Abs) {
BufferedRawMachineAssemblerTester<double> m(MachineType::Float64());
m.Return(m.Float64Abs(m.Parameter(0)));
- FOR_FLOAT64_INPUTS(i) { CheckDoubleEq(std::abs(*i), m.Call(*i)); }
+ FOR_FLOAT64_INPUTS(i) { CHECK_DOUBLE_EQ(std::abs(*i), m.Call(*i)); }
}
@@ -5479,7 +5678,7 @@
m.Return(m.Float32RoundDown(m.Parameter(0)));
- FOR_FLOAT32_INPUTS(i) { CheckFloatEq(floorf(*i), m.Call(*i)); }
+ FOR_FLOAT32_INPUTS(i) { CHECK_FLOAT_EQ(floorf(*i), m.Call(*i)); }
}
@@ -5489,7 +5688,7 @@
m.Return(m.Float64RoundDown(m.Parameter(0)));
- FOR_FLOAT64_INPUTS(i) { CheckDoubleEq(floor(*i), m.Call(*i)); }
+ FOR_FLOAT64_INPUTS(i) { CHECK_DOUBLE_EQ(floor(*i), m.Call(*i)); }
}
@@ -5511,7 +5710,7 @@
if (!m.machine()->Float32RoundUp().IsSupported()) return;
m.Return(m.Float32RoundUp(m.Parameter(0)));
- FOR_FLOAT32_INPUTS(i) { CheckFloatEq(ceilf(*i), m.Call(*i)); }
+ FOR_FLOAT32_INPUTS(i) { CHECK_FLOAT_EQ(ceilf(*i), m.Call(*i)); }
}
@@ -5520,7 +5719,7 @@
if (!m.machine()->Float64RoundUp().IsSupported()) return;
m.Return(m.Float64RoundUp(m.Parameter(0)));
- FOR_FLOAT64_INPUTS(i) { CheckDoubleEq(ceil(*i), m.Call(*i)); }
+ FOR_FLOAT64_INPUTS(i) { CHECK_DOUBLE_EQ(ceil(*i), m.Call(*i)); }
}
@@ -5529,7 +5728,7 @@
if (!m.machine()->Float32RoundTiesEven().IsSupported()) return;
m.Return(m.Float32RoundTiesEven(m.Parameter(0)));
- FOR_FLOAT32_INPUTS(i) { CheckFloatEq(nearbyint(*i), m.Call(*i)); }
+ FOR_FLOAT32_INPUTS(i) { CHECK_FLOAT_EQ(nearbyint(*i), m.Call(*i)); }
}
@@ -5538,7 +5737,7 @@
if (!m.machine()->Float64RoundTiesEven().IsSupported()) return;
m.Return(m.Float64RoundTiesEven(m.Parameter(0)));
- FOR_FLOAT64_INPUTS(i) { CheckDoubleEq(nearbyint(*i), m.Call(*i)); }
+ FOR_FLOAT64_INPUTS(i) { CHECK_DOUBLE_EQ(nearbyint(*i), m.Call(*i)); }
}
@@ -5548,7 +5747,7 @@
m.Return(m.Float32RoundTruncate(m.Parameter(0)));
- FOR_FLOAT32_INPUTS(i) { CheckFloatEq(truncf(*i), m.Call(*i)); }
+ FOR_FLOAT32_INPUTS(i) { CHECK_FLOAT_EQ(truncf(*i), m.Call(*i)); }
}
@@ -5653,79 +5852,6 @@
}
#endif // USE_SIMULATOR
-template <typename T>
-void TestExternalReferenceFunction(
- BufferedRawMachineAssemblerTester<int32_t>* m, ExternalReference ref,
- T (*comparison)(T)) {
- T parameter;
-
- Node* function = m->ExternalConstant(ref);
- m->CallCFunction1(MachineType::Pointer(), MachineType::Pointer(), function,
- m->PointerConstant(¶meter));
- m->Return(m->Int32Constant(4356));
- FOR_FLOAT64_INPUTS(i) {
- parameter = *i;
- m->Call();
- CheckDoubleEq(comparison(*i), parameter);
- }
-}
-
-TEST(RunCallExternalReferenceF32Trunc) {
- BufferedRawMachineAssemblerTester<int32_t> m;
- ExternalReference ref =
- ExternalReference::f32_trunc_wrapper_function(m.isolate());
- TestExternalReferenceFunction<float>(&m, ref, truncf);
-}
-
-TEST(RunCallExternalReferenceF32Floor) {
- BufferedRawMachineAssemblerTester<int32_t> m;
- ExternalReference ref =
- ExternalReference::f32_floor_wrapper_function(m.isolate());
- TestExternalReferenceFunction<float>(&m, ref, floorf);
-}
-
-TEST(RunCallExternalReferenceF32Ceil) {
- BufferedRawMachineAssemblerTester<int32_t> m;
- ExternalReference ref =
- ExternalReference::f32_ceil_wrapper_function(m.isolate());
- TestExternalReferenceFunction<float>(&m, ref, ceilf);
-}
-
-TEST(RunCallExternalReferenceF32RoundTiesEven) {
- BufferedRawMachineAssemblerTester<int32_t> m;
- ExternalReference ref =
- ExternalReference::f32_nearest_int_wrapper_function(m.isolate());
- TestExternalReferenceFunction<float>(&m, ref, nearbyintf);
-}
-
-TEST(RunCallExternalReferenceF64Trunc) {
- BufferedRawMachineAssemblerTester<int32_t> m;
- ExternalReference ref =
- ExternalReference::f64_trunc_wrapper_function(m.isolate());
- TestExternalReferenceFunction<double>(&m, ref, trunc);
-}
-
-TEST(RunCallExternalReferenceF64Floor) {
- BufferedRawMachineAssemblerTester<int32_t> m;
- ExternalReference ref =
- ExternalReference::f64_floor_wrapper_function(m.isolate());
- TestExternalReferenceFunction<double>(&m, ref, floor);
-}
-
-TEST(RunCallExternalReferenceF64Ceil) {
- BufferedRawMachineAssemblerTester<int32_t> m;
- ExternalReference ref =
- ExternalReference::f64_ceil_wrapper_function(m.isolate());
- TestExternalReferenceFunction<double>(&m, ref, ceil);
-}
-
-TEST(RunCallExternalReferenceF64RoundTiesEven) {
- BufferedRawMachineAssemblerTester<int32_t> m;
- ExternalReference ref =
- ExternalReference::f64_nearest_int_wrapper_function(m.isolate());
- TestExternalReferenceFunction<double>(&m, ref, nearbyint);
-}
-
#if V8_TARGET_ARCH_64_BIT
// TODO(titzer): run int64 tests on all platforms when supported.
TEST(RunCheckedLoadInt64) {
@@ -5907,7 +6033,7 @@
TEST(RunTryTruncateFloat64ToUint64WithoutCheck) {
BufferedRawMachineAssemblerTester<uint64_t> m(MachineType::Float64());
- m.Return(m.TruncateFloat64ToUint64(m.Parameter(0)));
+ m.Return(m.TryTruncateFloat64ToUint64(m.Parameter(0)));
FOR_UINT64_INPUTS(j) {
double input = static_cast<double>(*j);
diff --git a/test/cctest/compiler/test-run-native-calls.cc b/test/cctest/compiler/test-run-native-calls.cc
index 8911409..bfdcc0e 100644
--- a/test/cctest/compiler/test-run-native-calls.cc
+++ b/test/cctest/compiler/test-run-native-calls.cc
@@ -270,7 +270,7 @@
Handle<Code> WrapWithCFunction(Handle<Code> inner, CallDescriptor* desc) {
- Zone zone;
+ Zone zone(inner->GetIsolate()->allocator());
MachineSignature* msig =
const_cast<MachineSignature*>(desc->GetMachineSignature());
int param_count = static_cast<int>(msig->parameter_count());
@@ -437,7 +437,7 @@
Handle<Code> inner = Handle<Code>::null();
{
// Build the graph for the computation.
- Zone zone;
+ Zone zone(isolate->allocator());
Graph graph(&zone);
RawMachineAssembler raw(isolate, &graph, desc);
build(desc, raw);
@@ -452,7 +452,7 @@
Handle<Code> wrapper = Handle<Code>::null();
{
// Wrap the above code with a callable function that passes constants.
- Zone zone;
+ Zone zone(isolate->allocator());
Graph graph(&zone);
CallDescriptor* cdesc = Linkage::GetSimplifiedCDescriptor(&zone, &csig);
RawMachineAssembler raw(isolate, &graph, cdesc);
@@ -484,7 +484,7 @@
Handle<Code> wrapper = Handle<Code>::null();
{
// Wrap the above code with a callable function that loads from {input}.
- Zone zone;
+ Zone zone(isolate->allocator());
Graph graph(&zone);
CallDescriptor* cdesc = Linkage::GetSimplifiedCDescriptor(&zone, &csig);
RawMachineAssembler raw(isolate, &graph, cdesc);
@@ -522,7 +522,7 @@
static void TestInt32Sub(CallDescriptor* desc) {
Isolate* isolate = CcTest::InitIsolateOnce();
HandleScope scope(isolate);
- Zone zone;
+ Zone zone(isolate->allocator());
GraphAndBuilders inner(&zone);
{
// Build the add function.
@@ -563,7 +563,7 @@
Handle<Code> inner = Handle<Code>::null();
{
// Writes all parameters into the output buffer.
- Zone zone;
+ Zone zone(isolate->allocator());
Graph graph(&zone);
RawMachineAssembler raw(isolate, &graph, desc);
Node* base = raw.PointerConstant(output);
@@ -580,7 +580,7 @@
Handle<Code> wrapper = Handle<Code>::null();
{
// Loads parameters from the input buffer and calls the above code.
- Zone zone;
+ Zone zone(isolate->allocator());
Graph graph(&zone);
CallDescriptor* cdesc = Linkage::GetSimplifiedCDescriptor(&zone, &csig);
RawMachineAssembler raw(isolate, &graph, cdesc);
@@ -619,7 +619,8 @@
static void Test_RunInt32SubWithRet(int retreg) {
Int32Signature sig(2);
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
RegisterPairs pairs;
while (pairs.More()) {
int parray[2];
@@ -670,7 +671,8 @@
Int32Signature sig(2);
RegisterPairs pairs;
while (pairs.More()) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
int parray[1];
int rarray[1];
pairs.Next(&rarray[0], &parray[0], true);
@@ -687,7 +689,8 @@
Int32Signature sig(20);
RegisterPairs pairs;
while (pairs.More()) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
int parray[2];
int rarray[] = {
RegisterConfiguration::ArchDefault(RegisterConfiguration::TURBOFAN)
@@ -739,7 +742,8 @@
Int32Signature sig(count);
for (int p0 = 0; p0 < Register::kNumRegisters; p0++) {
if (Register::from_code(p0).IsAllocatable()) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
int parray[] = {p0};
int rarray[] = {
@@ -807,7 +811,8 @@
Allocator rets(rarray, 1, nullptr, 0);
RegisterConfig config(params, rets);
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
for (int i = which + 1; i <= 64; i++) {
Int32Signature sig(i);
@@ -849,7 +854,8 @@
ArgsBuffer<int64_t>::Sig sig(2);
RegisterPairs pairs;
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
while (pairs.More()) {
int parray[2];
pairs.Next(&parray[0], &parray[1], false);
@@ -876,7 +882,8 @@
ArgsBuffer<float32>::Sig sig(2);
Float32RegisterPairs pairs;
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
while (pairs.More()) {
int parray[2];
pairs.Next(&parray[0], &parray[1], false);
@@ -904,7 +911,8 @@
ArgsBuffer<float64>::Sig sig(2);
Float64RegisterPairs pairs;
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
while (pairs.More()) {
int parray[2];
pairs.Next(&parray[0], &parray[1], false);
@@ -927,7 +935,8 @@
Allocator rets(nullptr, 0, rarray, 1);
RegisterConfig config(params, rets);
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
for (int count = 1; count < 6; count++) {
ArgsBuffer<float32>::Sig sig(count);
CallDescriptor* desc = config.Create(&zone, &sig);
@@ -949,7 +958,8 @@
Allocator rets(nullptr, 0, rarray, 1);
RegisterConfig config(params, rets);
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
for (int count = 1; count < 6; count++) {
ArgsBuffer<float64>::Sig sig(count);
CallDescriptor* desc = config.Create(&zone, &sig);
@@ -972,7 +982,7 @@
{
Isolate* isolate = CcTest::InitIsolateOnce();
// Build the actual select.
- Zone zone;
+ Zone zone(isolate->allocator());
Graph graph(&zone);
RawMachineAssembler raw(isolate, &graph, desc);
raw.Return(raw.Parameter(which));
@@ -1002,7 +1012,8 @@
Allocator params(nullptr, 0, nullptr, 0);
Allocator rets(nullptr, 0, rarray, 1);
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
ArgsBuffer<float64>::Sig sig(2);
RegisterConfig config(params, rets);
CallDescriptor* desc = config.Create(&zone, &sig);
@@ -1068,7 +1079,8 @@
RegisterConfig config(palloc, ralloc);
for (int which = 0; which < num_params; which++) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
HandleScope scope(isolate);
MachineSignature::Builder builder(&zone, 1, num_params);
builder.AddReturn(params[which]);
@@ -1079,7 +1091,7 @@
Handle<Code> select;
{
// build the select.
- Zone zone;
+ Zone zone(&allocator);
Graph graph(&zone);
RawMachineAssembler raw(isolate, &graph, desc);
raw.Return(raw.Parameter(which));
@@ -1096,7 +1108,7 @@
CSignature0<int32_t> csig;
{
// Wrap the select code with a callable function that passes constants.
- Zone zone;
+ Zone zone(&allocator);
Graph graph(&zone);
CallDescriptor* cdesc = Linkage::GetSimplifiedCDescriptor(&zone, &csig);
RawMachineAssembler raw(isolate, &graph, cdesc);
@@ -1189,7 +1201,7 @@
Allocator ralloc(rarray_gp, 1, rarray_fp, 1);
RegisterConfig config(palloc, ralloc);
- Zone zone;
+ Zone zone(isolate->allocator());
HandleScope scope(isolate);
MachineSignature::Builder builder(&zone, 1, 12);
builder.AddReturn(MachineType::Int32());
diff --git a/test/cctest/compiler/test-run-variables.cc b/test/cctest/compiler/test-run-variables.cc
index f856368..6997967 100644
--- a/test/cctest/compiler/test-run-variables.cc
+++ b/test/cctest/compiler/test-run-variables.cc
@@ -15,7 +15,6 @@
"var x = (r = x)", "undefined", "undefined",
"var x = (a?1:2); r = x", "1", "2",
"const x = a; r = x", "123", "0",
- "const x = (r = x)", "undefined", "undefined",
"const x = (a?3:4); r = x", "3", "4",
"'use strict'; const x = a; r = x", "123", "0",
"'use strict'; const x = (r = x)", throws, throws,
@@ -29,9 +28,6 @@
"var x = 1; x = a; r = x", "123", "0",
"var x = (a?(x=4,2):3); r = x", "2", "3",
"var x = (a?4:5); x = a; r = x", "123", "0",
- "const x = 1; x = a; r = x", "1", "1",
- "const x = (a?(x=4,2):3); r = x", "2", "3",
- "const x = (a?4:5); x = a; r = x", "4", "5",
// Assignments to 'const' are SyntaxErrors, handled by the parser,
// hence we cannot test them here because they are early errors.
"'use strict'; let x = 1; x = a; r = x", "123", "0",
@@ -39,16 +35,8 @@
"'use strict'; let x = (a?4:5); x = a; r = x", "123", "0",
NULL};
-static const char* bind_tests[] = {
- "if (a) { const x = a }; r = x;", "123", "undefined",
- "for (; a > 0; a--) { const x = a }; r = x", "123", "undefined",
- // Re-initialization of variables other than legacy 'const' is not
- // possible due to sane variable scoping, hence no tests here.
- NULL};
-
static void RunVariableTests(const char* source, const char* tests[]) {
- i::FLAG_legacy_const = true;
EmbeddedVector<char, 512> buffer;
for (int i = 0; tests[i] != NULL; i += 3) {
@@ -99,18 +87,6 @@
}
-TEST(StackInitializeVariables) {
- const char* source = "(function(a,r) { %s; return r; })";
- RunVariableTests(source, bind_tests);
-}
-
-
-TEST(ContextInitializeVariables) {
- const char* source = "(function(a,r) { %s; function f() {x} return r; })";
- RunVariableTests(source, bind_tests);
-}
-
-
TEST(SelfReferenceVariable) {
FunctionTester T("(function self() { return self; })");
diff --git a/test/cctest/compiler/test-simplified-lowering.cc b/test/cctest/compiler/test-simplified-lowering.cc
index 1b752ed..b5e9929 100644
--- a/test/cctest/compiler/test-simplified-lowering.cc
+++ b/test/cctest/compiler/test-simplified-lowering.cc
@@ -928,10 +928,8 @@
CHECK(c == cnv->InputAt(0) || c == cnv->InputAt(1));
}
-
static Type* test_types[] = {Type::Signed32(), Type::Unsigned32(),
- Type::Number(), Type::Any()};
-
+ Type::Number()};
TEST(LowerNumberCmp_to_int32) {
TestingGraph t(Type::Signed32(), Type::Signed32());
@@ -956,18 +954,13 @@
TEST(LowerNumberCmp_to_float64) {
- static Type* types[] = {Type::Number(), Type::Any()};
+ TestingGraph t(Type::Number(), Type::Number());
- for (size_t i = 0; i < arraysize(types); i++) {
- TestingGraph t(types[i], types[i]);
-
- t.CheckLoweringBinop(IrOpcode::kFloat64Equal,
- t.simplified()->NumberEqual());
- t.CheckLoweringBinop(IrOpcode::kFloat64LessThan,
- t.simplified()->NumberLessThan());
- t.CheckLoweringBinop(IrOpcode::kFloat64LessThanOrEqual,
- t.simplified()->NumberLessThanOrEqual());
- }
+ t.CheckLoweringBinop(IrOpcode::kFloat64Equal, t.simplified()->NumberEqual());
+ t.CheckLoweringBinop(IrOpcode::kFloat64LessThan,
+ t.simplified()->NumberLessThan());
+ t.CheckLoweringBinop(IrOpcode::kFloat64LessThanOrEqual,
+ t.simplified()->NumberLessThanOrEqual());
}
@@ -1140,25 +1133,8 @@
t.CheckLoweringBinop(opcode, t.simplified()->ReferenceEqual(Type::Any()));
}
-
-TEST(LowerStringOps_to_call_and_compare) {
- // These tests need linkage for the calls.
- TestingGraph t(Type::String(), Type::String());
- IrOpcode::Value compare_eq =
- static_cast<IrOpcode::Value>(t.machine()->WordEqual()->opcode());
- IrOpcode::Value compare_lt =
- static_cast<IrOpcode::Value>(t.machine()->IntLessThan()->opcode());
- IrOpcode::Value compare_le = static_cast<IrOpcode::Value>(
- t.machine()->IntLessThanOrEqual()->opcode());
- t.CheckLoweringStringBinop(compare_eq, t.simplified()->StringEqual());
- t.CheckLoweringStringBinop(compare_lt, t.simplified()->StringLessThan());
- t.CheckLoweringStringBinop(compare_le,
- t.simplified()->StringLessThanOrEqual());
- }
-
-
- void CheckChangeInsertion(IrOpcode::Value expected, MachineType from,
- MachineType to, Type* type = Type::Any()) {
+void CheckChangeInsertion(IrOpcode::Value expected, MachineType from,
+ MachineType to, Type* type = Type::Any()) {
TestingGraph t(Type::Any());
Node* in = t.ExampleWithOutput(from);
NodeProperties::SetType(in, type);
@@ -1169,7 +1145,6 @@
CHECK_EQ(in, use->InputAt(0)->InputAt(0));
}
-
TEST(InsertBasicChanges) {
CheckChangeInsertion(IrOpcode::kChangeFloat64ToInt32, MachineType::Float64(),
MachineType::Int32(), Type::Signed32());
@@ -1187,27 +1162,29 @@
CheckChangeInsertion(IrOpcode::kChangeFloat64ToTagged, MachineType::Float64(),
MachineType::AnyTagged());
CheckChangeInsertion(IrOpcode::kChangeTaggedToFloat64,
- MachineType::AnyTagged(), MachineType::Float64());
+ MachineType::AnyTagged(), MachineType::Float64(),
+ Type::Number());
CheckChangeInsertion(IrOpcode::kChangeInt32ToFloat64, MachineType::Int32(),
- MachineType::Float64());
+ MachineType::Float64(), Type::Signed32());
CheckChangeInsertion(IrOpcode::kChangeInt32ToTagged, MachineType::Int32(),
- MachineType::AnyTagged());
+ MachineType::AnyTagged(), Type::Signed32());
CheckChangeInsertion(IrOpcode::kChangeUint32ToFloat64, MachineType::Uint32(),
- MachineType::Float64());
+ MachineType::Float64(), Type::Unsigned32());
CheckChangeInsertion(IrOpcode::kChangeUint32ToTagged, MachineType::Uint32(),
- MachineType::AnyTagged());
+ MachineType::AnyTagged(), Type::Unsigned32());
}
-
static void CheckChangesAroundBinop(TestingGraph* t, const Operator* op,
IrOpcode::Value input_change,
- IrOpcode::Value output_change) {
+ IrOpcode::Value output_change,
+ Type* type = Type::Any()) {
Node* binop =
op->ControlInputCount() == 0
? t->graph()->NewNode(op, t->p0, t->p1)
: t->graph()->NewNode(op, t->p0, t->p1, t->graph()->start());
+ NodeProperties::SetType(binop, type);
t->Return(binop);
t->Lower();
CHECK_EQ(input_change, binop->InputAt(0)->opcode());
@@ -1230,7 +1207,9 @@
for (size_t i = 0; i < arraysize(ops); i++) {
CheckChangesAroundBinop(&t, ops[i], IrOpcode::kChangeTaggedToInt32,
- IrOpcode::kChangeInt32ToTagged);
+ IrOpcode::kChangeInt32ToTagged, Type::Signed32());
+ CheckChangesAroundBinop(&t, ops[i], IrOpcode::kChangeTaggedToInt32,
+ IrOpcode::kChangeInt32ToTagged, Type::Signed32());
}
}
diff --git a/test/cctest/compiler/value-helper.h b/test/cctest/compiler/value-helper.h
index 83cd33c..7d26dba 100644
--- a/test/cctest/compiler/value-helper.h
+++ b/test/cctest/compiler/value-helper.h
@@ -274,7 +274,7 @@
0x00003fffffffffff, 0x00001fffffffffff, 0x00000fffffffffff,
0x000007ffffffffff, 0x000003ffffffffff, 0x000001ffffffffff,
0x8000008000000000, 0x8000008000000001, 0x8000000000000400,
- 0x8000000000000401};
+ 0x8000000000000401, 0x0000000000000020};
return std::vector<uint64_t>(&kValues[0], &kValues[arraysize(kValues)]);
}
@@ -321,6 +321,12 @@
}
}
+#define CHECK_FLOAT_EQ(lhs, rhs) \
+ do { \
+ volatile float tmp = lhs; \
+ CheckFloatEq(tmp, rhs); \
+ } while (0)
+
static inline void CheckDoubleEq(volatile double x, volatile double y) {
if (std::isnan(x)) {
CHECK(std::isnan(y));
@@ -329,6 +335,12 @@
}
}
+#define CHECK_DOUBLE_EQ(lhs, rhs) \
+ do { \
+ volatile double tmp = lhs; \
+ CheckDoubleEq(tmp, rhs); \
+ } while (0)
+
} // namespace compiler
} // namespace internal
} // namespace v8
diff --git a/test/cctest/heap/heap-tester.h b/test/cctest/heap/heap-tester.h
index 5d098f5..599c5d8 100644
--- a/test/cctest/heap/heap-tester.h
+++ b/test/cctest/heap/heap-tester.h
@@ -29,14 +29,14 @@
V(TestMemoryReducerSampleJsCalls) \
V(TestSizeOfObjects) \
V(Regress587004) \
+ V(Regress589413) \
V(WriteBarriersInCopyJSObject)
#define HEAP_TEST(Name) \
CcTest register_test_##Name(v8::internal::HeapTester::Test##Name, __FILE__, \
- #Name, NULL, true, true); \
+ #Name, true, true); \
void v8::internal::HeapTester::Test##Name()
-
#define THREADED_HEAP_TEST(Name) \
RegisterThreadedTest register_##Name(v8::internal::HeapTester::Test##Name, \
#Name); \
diff --git a/test/cctest/heap/test-compaction.cc b/test/cctest/heap/test-compaction.cc
index 064e5a8..0feee5f 100644
--- a/test/cctest/heap/test-compaction.cc
+++ b/test/cctest/heap/test-compaction.cc
@@ -35,7 +35,7 @@
HandleScope scope1(isolate);
PageIterator it(heap->old_space());
while (it.has_next()) {
- it.next()->SetFlag(Page::NEVER_ALLOCATE_ON_PAGE);
+ it.next()->MarkNeverAllocateForTesting();
}
{
@@ -80,7 +80,7 @@
HandleScope scope1(isolate);
PageIterator it(heap->old_space());
while (it.has_next()) {
- it.next()->SetFlag(Page::NEVER_ALLOCATE_ON_PAGE);
+ it.next()->MarkNeverAllocateForTesting();
}
{
@@ -155,7 +155,7 @@
PageIterator it(heap->old_space());
while (it.has_next()) {
- it.next()->SetFlag(Page::NEVER_ALLOCATE_ON_PAGE);
+ it.next()->MarkNeverAllocateForTesting();
}
Page* to_be_aborted_page = nullptr;
@@ -241,7 +241,7 @@
isolate->factory()->NewFixedArray(10, TENURED);
PageIterator it(heap->old_space());
while (it.has_next()) {
- it.next()->SetFlag(Page::NEVER_ALLOCATE_ON_PAGE);
+ it.next()->MarkNeverAllocateForTesting();
}
Page* to_be_aborted_page = nullptr;
diff --git a/test/cctest/heap/test-heap.cc b/test/cctest/heap/test-heap.cc
index 88aee8a..424e987 100644
--- a/test/cctest/heap/test-heap.cc
+++ b/test/cctest/heap/test-heap.cc
@@ -1164,7 +1164,7 @@
// Allocate a JS array to OLD_SPACE and NEW_SPACE
objs[next_objs_index++] = factory->NewJSArray(10);
objs[next_objs_index++] =
- factory->NewJSArray(10, FAST_HOLEY_ELEMENTS, Strength::WEAK, TENURED);
+ factory->NewJSArray(10, FAST_HOLEY_ELEMENTS, TENURED);
// Allocate a small string to OLD_DATA_SPACE and NEW_SPACE
objs[next_objs_index++] = factory->NewStringFromStaticChars("abcdefghij");
@@ -1572,8 +1572,7 @@
Factory* factory = isolate->factory();
Heap* heap = isolate->heap();
CompilationCache* compilation_cache = isolate->compilation_cache();
- LanguageMode language_mode =
- construct_language_mode(FLAG_use_strict, FLAG_use_strong);
+ LanguageMode language_mode = construct_language_mode(FLAG_use_strict);
v8::HandleScope scope(CcTest::isolate());
const char* raw_source =
@@ -2068,7 +2067,7 @@
heap->new_space()->AllocateRawAligned(size, alignment);
HeapObject* obj = NULL;
allocation.To(&obj);
- heap->CreateFillerObjectAt(obj->address(), size);
+ heap->CreateFillerObjectAt(obj->address(), size, ClearRecordedSlots::kNo);
return obj;
}
@@ -2171,7 +2170,7 @@
heap->old_space()->AllocateRawAligned(size, alignment);
HeapObject* obj = NULL;
allocation.To(&obj);
- heap->CreateFillerObjectAt(obj->address(), size);
+ heap->CreateFillerObjectAt(obj->address(), size, ClearRecordedSlots::kNo);
return obj;
}
@@ -2334,11 +2333,7 @@
Heap* heap = CcTest::heap();
NewSpace* new_space = heap->new_space();
- if (heap->ReservedSemiSpaceSize() == heap->InitialSemiSpaceSize() ||
- heap->MaxSemiSpaceSize() == heap->InitialSemiSpaceSize()) {
- // The max size cannot exceed the reserved size, since semispaces must be
- // always within the reserved space. We can't test new space growing and
- // shrinking if the reserved size is the same as the minimum (initial) size.
+ if (heap->MaxSemiSpaceSize() == heap->InitialSemiSpaceSize()) {
return;
}
@@ -2383,11 +2378,7 @@
TEST(CollectingAllAvailableGarbageShrinksNewSpace) {
CcTest::InitializeVM();
Heap* heap = CcTest::heap();
- if (heap->ReservedSemiSpaceSize() == heap->InitialSemiSpaceSize() ||
- heap->MaxSemiSpaceSize() == heap->InitialSemiSpaceSize()) {
- // The max size cannot exceed the reserved size, since semispaces must be
- // always within the reserved space. We can't test new space growing and
- // shrinking if the reserved size is the same as the minimum (initial) size.
+ if (heap->MaxSemiSpaceSize() == heap->InitialSemiSpaceSize()) {
return;
}
@@ -4285,8 +4276,9 @@
AllocationMemento::kSize + kPointerSize);
CHECK(allocation.To(&obj));
Address addr_obj = obj->address();
- CcTest::heap()->CreateFillerObjectAt(
- addr_obj, AllocationMemento::kSize + kPointerSize);
+ CcTest::heap()->CreateFillerObjectAt(addr_obj,
+ AllocationMemento::kSize + kPointerSize,
+ ClearRecordedSlots::kNo);
// Give the array a name, making sure not to allocate strings.
v8::Local<v8::Object> array_obj = v8::Utils::ToLocal(array);
@@ -4644,7 +4636,7 @@
// Start incremental marking to active write barrier.
SimulateIncrementalMarking(heap, false);
heap->incremental_marking()->AdvanceIncrementalMarking(
- 10000000, 10000000, IncrementalMarking::IdleStepActions());
+ 10000000, IncrementalMarking::IdleStepActions());
// Create references from the large object to the object on the evacuation
// candidate.
@@ -4937,7 +4929,8 @@
i, i, i, i, i, i, i, i);
CompileRun(source.start());
}
- heap->CollectAllGarbage();
+ // We have to abort incremental marking here to abandon black pages.
+ heap->CollectAllGarbage(Heap::kAbortIncrementalMarkingMask);
}
int elements = 0;
if (heap->weak_object_to_code_table()->IsHashTable()) {
@@ -5457,6 +5450,9 @@
CHECK(weak_cell->value()->IsFixedArray());
weak_cells[i] = inner_scope.CloseAndEscape(weak_cell);
}
+ // Call collect all twice to make sure that we also cleared
+ // weak cells that were allocated on black pages.
+ heap->CollectAllGarbage();
heap->CollectAllGarbage();
CHECK_EQ(*survivor, weak_cells[0]->value());
for (int i = 1; i < N; i++) {
@@ -6003,7 +5999,7 @@
Handle<Object> exception = v8::Utils::OpenHandle(*try_catch.Exception());
Handle<Name> key = isolate->factory()->stack_trace_symbol();
Handle<Object> stack_trace =
- JSObject::GetProperty(exception, key).ToHandleChecked();
+ Object::GetProperty(exception, key).ToHandleChecked();
Handle<Object> code =
Object::GetElement(isolate, stack_trace, 3).ToHandleChecked();
CHECK(code->IsCode());
@@ -6277,6 +6273,7 @@
Handle<JSFunction> fun = Handle<JSFunction>::cast(obj);
fun->ReplaceCode(*isolate->builtins()->CompileLazy());
fun->shared()->ReplaceCode(*isolate->builtins()->CompileLazy());
+ fun->shared()->ClearBytecodeArray(); // Bytecode is code too.
isolate->heap()->CollectAllAvailableGarbage("remove code and gc");
}
@@ -6320,14 +6317,14 @@
int time2 = 200;
size_t counter2 = 2000;
tracer->SampleAllocation(time2, 0, counter2);
- size_t throughput =
- tracer->OldGenerationAllocationThroughputInBytesPerMillisecond(100);
+ size_t throughput = static_cast<size_t>(
+ tracer->OldGenerationAllocationThroughputInBytesPerMillisecond(100));
CHECK_EQ((counter2 - counter1) / (time2 - time1), throughput);
int time3 = 1000;
size_t counter3 = 30000;
tracer->SampleAllocation(time3, 0, counter3);
- throughput =
- tracer->OldGenerationAllocationThroughputInBytesPerMillisecond(100);
+ throughput = static_cast<size_t>(
+ tracer->OldGenerationAllocationThroughputInBytesPerMillisecond(100));
CHECK_EQ((counter3 - counter1) / (time3 - time1), throughput);
}
@@ -6344,7 +6341,8 @@
int time2 = 200;
size_t counter2 = 2000;
tracer->SampleAllocation(time2, counter2, counter2);
- size_t throughput = tracer->AllocationThroughputInBytesPerMillisecond(100);
+ size_t throughput = static_cast<size_t>(
+ tracer->AllocationThroughputInBytesPerMillisecond(100));
CHECK_EQ(2 * (counter2 - counter1) / (time2 - time1), throughput);
int time3 = 1000;
size_t counter3 = 30000;
@@ -6531,5 +6529,93 @@
heap->CollectGarbage(NEW_SPACE);
}
+HEAP_TEST(Regress589413) {
+ FLAG_stress_compaction = true;
+ FLAG_manual_evacuation_candidates_selection = true;
+ FLAG_parallel_compaction = false;
+ FLAG_concurrent_sweeping = false;
+ CcTest::InitializeVM();
+ v8::HandleScope scope(CcTest::isolate());
+ Heap* heap = CcTest::heap();
+ // Get the heap in clean state.
+ heap->CollectGarbage(OLD_SPACE);
+ heap->CollectGarbage(OLD_SPACE);
+ Isolate* isolate = CcTest::i_isolate();
+ Factory* factory = isolate->factory();
+ // Fill the new space with byte arrays with elements looking like pointers.
+ const int M = 256;
+ ByteArray* byte_array;
+ while (heap->AllocateByteArray(M).To(&byte_array)) {
+ for (int j = 0; j < M; j++) {
+ byte_array->set(j, 0x31);
+ }
+ // Add the array in root set.
+ handle(byte_array);
+ }
+ // Make sure the byte arrays will be promoted on the next GC.
+ heap->CollectGarbage(NEW_SPACE);
+ // This number is close to large free list category threshold.
+ const int N = 0x3eee;
+ {
+ std::vector<FixedArray*> arrays;
+ std::set<Page*> pages;
+ FixedArray* array;
+ // Fill all pages with fixed arrays.
+ heap->set_force_oom(true);
+ while (heap->AllocateFixedArray(N, TENURED).To(&array)) {
+ arrays.push_back(array);
+ pages.insert(Page::FromAddress(array->address()));
+ // Add the array in root set.
+ handle(array);
+ }
+ // Expand and full one complete page with fixed arrays.
+ heap->set_force_oom(false);
+ while (heap->AllocateFixedArray(N, TENURED).To(&array)) {
+ arrays.push_back(array);
+ pages.insert(Page::FromAddress(array->address()));
+ // Add the array in root set.
+ handle(array);
+ // Do not expand anymore.
+ heap->set_force_oom(true);
+ }
+ // Expand and mark the new page as evacuation candidate.
+ heap->set_force_oom(false);
+ {
+ AlwaysAllocateScope always_allocate(isolate);
+ Handle<HeapObject> ec_obj = factory->NewFixedArray(5000, TENURED);
+ Page* ec_page = Page::FromAddress(ec_obj->address());
+ ec_page->SetFlag(MemoryChunk::FORCE_EVACUATION_CANDIDATE_FOR_TESTING);
+ // Make all arrays point to evacuation candidate so that
+ // slots are recorded for them.
+ for (size_t j = 0; j < arrays.size(); j++) {
+ array = arrays[j];
+ for (int i = 0; i < N; i++) {
+ array->set(i, *ec_obj);
+ }
+ }
+ }
+ SimulateIncrementalMarking(heap);
+ for (size_t j = 0; j < arrays.size(); j++) {
+ heap->RightTrimFixedArray<Heap::CONCURRENT_TO_SWEEPER>(arrays[j], N - 1);
+ }
+ }
+ // Force allocation from the free list.
+ heap->set_force_oom(true);
+ heap->CollectGarbage(OLD_SPACE);
+}
+
+TEST(Regress609761) {
+ CcTest::InitializeVM();
+ v8::HandleScope scope(CcTest::isolate());
+ Heap* heap = CcTest::heap();
+ Isolate* isolate = heap->isolate();
+
+ intptr_t size_before = heap->SizeOfObjects();
+ Handle<FixedArray> array = isolate->factory()->NewFixedArray(200000);
+ array->Shrink(1);
+ intptr_t size_after = heap->SizeOfObjects();
+ CHECK_EQ(size_after, size_before + array->Size());
+}
+
} // namespace internal
} // namespace v8
diff --git a/test/cctest/heap/test-incremental-marking.cc b/test/cctest/heap/test-incremental-marking.cc
index 5822d4a..74cbf2c 100644
--- a/test/cctest/heap/test-incremental-marking.cc
+++ b/test/cctest/heap/test-incremental-marking.cc
@@ -86,8 +86,8 @@
}
uint64_t AddTraceEvent(char phase, const uint8_t* categoryEnabledFlag,
- const char* name, uint64_t id, uint64_t bind_id,
- int numArgs, const char** argNames,
+ const char* name, const char* scope, uint64_t id,
+ uint64_t bind_id, int numArgs, const char** argNames,
const uint8_t* argTypes, const uint64_t* argValues,
unsigned int flags) override {
return 0;
diff --git a/test/cctest/heap/test-lab.cc b/test/cctest/heap/test-lab.cc
index 770804f..bf4d3cc 100644
--- a/test/cctest/heap/test-lab.cc
+++ b/test/cctest/heap/test-lab.cc
@@ -46,7 +46,8 @@
AllocationResult result =
lab->AllocateRawAligned(static_cast<int>(size_in_bytes), alignment);
if (result.To(&obj)) {
- heap->CreateFillerObjectAt(obj->address(), static_cast<int>(size_in_bytes));
+ heap->CreateFillerObjectAt(obj->address(), static_cast<int>(size_in_bytes),
+ ClearRecordedSlots::kNo);
return true;
}
return false;
diff --git a/test/cctest/heap/test-spaces.cc b/test/cctest/heap/test-spaces.cc
index 41345bc..a7cf161 100644
--- a/test/cctest/heap/test-spaces.cc
+++ b/test/cctest/heap/test-spaces.cc
@@ -317,8 +317,9 @@
{
int total_pages = 0;
OldSpace faked_space(heap, OLD_SPACE, NOT_EXECUTABLE);
- Page* first_page = memory_allocator->AllocatePage(
- faked_space.AreaSize(), &faked_space, NOT_EXECUTABLE);
+ Page* first_page = memory_allocator->AllocatePage<Page>(
+ faked_space.AreaSize(), static_cast<PagedSpace*>(&faked_space),
+ NOT_EXECUTABLE);
first_page->InsertAfter(faked_space.anchor()->prev_page());
CHECK(first_page->is_valid());
@@ -330,8 +331,9 @@
}
// Again, we should get n or n - 1 pages.
- Page* other = memory_allocator->AllocatePage(faked_space.AreaSize(),
- &faked_space, NOT_EXECUTABLE);
+ Page* other = memory_allocator->AllocatePage<Page>(
+ faked_space.AreaSize(), static_cast<PagedSpace*>(&faked_space),
+ NOT_EXECUTABLE);
CHECK(other->is_valid());
total_pages++;
other->InsertAfter(first_page);
@@ -362,8 +364,8 @@
NewSpace new_space(heap);
- CHECK(new_space.SetUp(CcTest::heap()->ReservedSemiSpaceSize(),
- CcTest::heap()->ReservedSemiSpaceSize()));
+ CHECK(new_space.SetUp(CcTest::heap()->InitialSemiSpaceSize(),
+ CcTest::heap()->InitialSemiSpaceSize()));
CHECK(new_space.HasBeenSetUp());
while (new_space.Available() >= Page::kMaxRegularHeapObjectSize) {
@@ -519,7 +521,8 @@
CHECK(!allocation.IsRetry());
HeapObject* filler = NULL;
CHECK(allocation.To(&filler));
- space->heap()->CreateFillerObjectAt(filler->address(), size);
+ space->heap()->CreateFillerObjectAt(filler->address(), size,
+ ClearRecordedSlots::kNo);
return filler;
}
@@ -528,7 +531,8 @@
CHECK(!allocation.IsRetry());
HeapObject* filler = NULL;
CHECK(allocation.To(&filler));
- space->heap()->CreateFillerObjectAt(filler->address(), size);
+ space->heap()->CreateFillerObjectAt(filler->address(), size,
+ ClearRecordedSlots::kNo);
return filler;
}
diff --git a/test/cctest/heap/utils-inl.h b/test/cctest/heap/utils-inl.h
index f255bb6..56033c1 100644
--- a/test/cctest/heap/utils-inl.h
+++ b/test/cctest/heap/utils-inl.h
@@ -49,7 +49,7 @@
if (length <= 0) {
// Not enough room to create another fixed array. Let's create a filler.
heap->CreateFillerObjectAt(*heap->old_space()->allocation_top_address(),
- free_memory);
+ free_memory, ClearRecordedSlots::kNo);
break;
}
}
diff --git a/test/cctest/interpreter/bytecode-expectations-printer.cc b/test/cctest/interpreter/bytecode-expectations-printer.cc
index d5e0456..bf43b95 100644
--- a/test/cctest/interpreter/bytecode-expectations-printer.cc
+++ b/test/cctest/interpreter/bytecode-expectations-printer.cc
@@ -13,6 +13,7 @@
#include "src/base/logging.h"
#include "src/base/smart-pointers.h"
#include "src/compiler.h"
+#include "src/runtime/runtime.h"
#include "src/interpreter/bytecode-array-iterator.h"
#include "src/interpreter/bytecode-generator.h"
@@ -94,11 +95,18 @@
}
}
+namespace {
+i::Runtime::FunctionId IndexToFunctionId(uint32_t index) {
+ return static_cast<i::Runtime::FunctionId>(index);
+}
+} // namespace
+
void BytecodeExpectationsPrinter::PrintBytecodeOperand(
std::ostream& stream, const BytecodeArrayIterator& bytecode_iter,
const Bytecode& bytecode, int op_index, int parameter_count) const {
OperandType op_type = Bytecodes::GetOperandType(bytecode, op_index);
- OperandSize op_size = Bytecodes::GetOperandSize(bytecode, op_index);
+ OperandSize op_size = Bytecodes::GetOperandSize(
+ bytecode, op_index, bytecode_iter.current_operand_scale());
const char* size_tag;
switch (op_size) {
@@ -108,6 +116,9 @@
case OperandSize::kShort:
size_tag = "16";
break;
+ case OperandSize::kQuad:
+ size_tag = "32";
+ break;
default:
UNREACHABLE();
return;
@@ -136,15 +147,27 @@
} else {
stream << 'U' << size_tag << '(';
- if (Bytecodes::IsImmediateOperandType(op_type)) {
- // We need a cast, otherwise the result is printed as char.
- stream << static_cast<int>(bytecode_iter.GetImmediateOperand(op_index));
- } else if (Bytecodes::IsRegisterCountOperandType(op_type)) {
- stream << bytecode_iter.GetRegisterCountOperand(op_index);
- } else if (Bytecodes::IsIndexOperandType(op_type)) {
- stream << bytecode_iter.GetIndexOperand(op_index);
- } else {
- UNREACHABLE();
+ switch (op_type) {
+ case OperandType::kFlag8:
+ stream << bytecode_iter.GetFlagOperand(op_index);
+ break;
+ case OperandType::kIdx:
+ stream << bytecode_iter.GetIndexOperand(op_index);
+ break;
+ case OperandType::kImm:
+ stream << bytecode_iter.GetImmediateOperand(op_index);
+ break;
+ case OperandType::kRegCount:
+ stream << bytecode_iter.GetRegisterCountOperand(op_index);
+ break;
+ case OperandType::kRuntimeId: {
+ uint32_t operand = bytecode_iter.GetRuntimeIdOperand(op_index);
+ stream << "Runtime::k"
+ << i::Runtime::FunctionForId(IndexToFunctionId(operand))->name;
+ break;
+ }
+ default:
+ UNREACHABLE();
}
stream << ')';
@@ -155,9 +178,12 @@
std::ostream& stream, const BytecodeArrayIterator& bytecode_iter,
int parameter_count) const {
Bytecode bytecode = bytecode_iter.current_bytecode();
-
+ OperandScale operand_scale = bytecode_iter.current_operand_scale();
+ if (Bytecodes::OperandScaleRequiresPrefixBytecode(operand_scale)) {
+ Bytecode prefix = Bytecodes::OperandScaleToPrefixBytecode(operand_scale);
+ stream << "B(" << Bytecodes::ToString(prefix) << "), ";
+ }
stream << "B(" << Bytecodes::ToString(bytecode) << ')';
-
int operands_count = Bytecodes::NumberOfOperands(bytecode);
for (int op_index = 0; op_index < operands_count; ++op_index) {
stream << ", ";
@@ -212,14 +238,14 @@
int frame_size = bytecode_array->frame_size();
DCHECK_EQ(frame_size % kPointerSize, 0);
- stream << "frame size: " << frame_size / kPointerSize;
- if (frame_size > 0) stream << " # in multiples of sizeof(void*)";
- stream << "\nparameter count: " << bytecode_array->parameter_count() << '\n';
+ stream << "frame size: " << frame_size / kPointerSize
+ << "\nparameter count: " << bytecode_array->parameter_count() << '\n';
}
void BytecodeExpectationsPrinter::PrintBytecodeSequence(
std::ostream& stream, i::Handle<i::BytecodeArray> bytecode_array) const {
- stream << "bytecodes: [\n";
+ stream << "bytecode array length: " << bytecode_array->length()
+ << "\nbytecodes: [\n";
BytecodeArrayIterator bytecode_iter(bytecode_array);
for (; !bytecode_iter.done(); bytecode_iter.Advance()) {
stream << " ";
diff --git a/test/cctest/interpreter/bytecode-expectations-printer.h b/test/cctest/interpreter/bytecode-expectations-printer.h
index 236a7d4..0fcead5 100644
--- a/test/cctest/interpreter/bytecode-expectations-printer.h
+++ b/test/cctest/interpreter/bytecode-expectations-printer.h
@@ -36,6 +36,7 @@
const_pool_type_(t),
execute_(true),
wrap_(true),
+ top_level_(false),
test_function_name_(kDefaultTopFunctionName) {}
void PrintExpectation(std::ostream& stream, // NOLINT
diff --git a/test/cctest/interpreter/bytecode_expectations/ArrayLiterals.golden b/test/cctest/interpreter/bytecode_expectations/ArrayLiterals.golden
new file mode 100644
index 0000000..4c9753f
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/ArrayLiterals.golden
@@ -0,0 +1,125 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ return [ 1, 2 ];
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 6
+bytecodes: [
+ B(StackCheck),
+ B(CreateArrayLiteral), U8(0), U8(0), U8(3),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1; return [ a, a + 1 ];
+"
+frame size: 4
+parameter count: 1
+bytecode array length: 39
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(CreateArrayLiteral), U8(0), U8(0), U8(3),
+ B(Star), R(2),
+ B(LdaZero),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(KeyedStoreICSloppy), R(2), R(1), U8(1),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(Star), R(3),
+ B(LdaSmi), U8(1),
+ B(Add), R(3),
+ B(KeyedStoreICSloppy), R(2), R(1), U8(1),
+ B(Ldar), R(2),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ return [ [ 1, 2 ], [ 3 ] ];
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 6
+bytecodes: [
+ B(StackCheck),
+ B(CreateArrayLiteral), U8(0), U8(2), U8(2),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1; return [ [ a, 2 ], [ a + 2 ] ];
+"
+frame size: 6
+parameter count: 1
+bytecode array length: 69
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(CreateArrayLiteral), U8(0), U8(2), U8(2),
+ B(Star), R(2),
+ B(LdaZero),
+ B(Star), R(1),
+ B(CreateArrayLiteral), U8(1), U8(0), U8(3),
+ B(Star), R(4),
+ B(LdaZero),
+ B(Star), R(3),
+ B(Ldar), R(0),
+ B(KeyedStoreICSloppy), R(4), R(3), U8(1),
+ B(Ldar), R(4),
+ B(KeyedStoreICSloppy), R(2), R(1), U8(5),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(CreateArrayLiteral), U8(2), U8(1), U8(3),
+ B(Star), R(4),
+ B(LdaZero),
+ B(Star), R(3),
+ B(Ldar), R(0),
+ B(Star), R(5),
+ B(LdaSmi), U8(2),
+ B(Add), R(5),
+ B(KeyedStoreICSloppy), R(4), R(3), U8(3),
+ B(Ldar), R(4),
+ B(KeyedStoreICSloppy), R(2), R(1), U8(5),
+ B(Ldar), R(2),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::FIXED_ARRAY_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/ArrayLiteralsWide.golden b/test/cctest/interpreter/bytecode_expectations/ArrayLiteralsWide.golden
new file mode 100644
index 0000000..2077b79
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/ArrayLiteralsWide.golden
@@ -0,0 +1,1052 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ var a;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ return [ 1 , 2 ];
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 1033
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(0),
+ B(LdaConstant), U8(1),
+ B(Star), R(0),
+ B(LdaConstant), U8(2),
+ B(Star), R(0),
+ B(LdaConstant), U8(3),
+ B(Star), R(0),
+ B(LdaConstant), U8(4),
+ B(Star), R(0),
+ B(LdaConstant), U8(5),
+ B(Star), R(0),
+ B(LdaConstant), U8(6),
+ B(Star), R(0),
+ B(LdaConstant), U8(7),
+ B(Star), R(0),
+ B(LdaConstant), U8(8),
+ B(Star), R(0),
+ B(LdaConstant), U8(9),
+ B(Star), R(0),
+ B(LdaConstant), U8(10),
+ B(Star), R(0),
+ B(LdaConstant), U8(11),
+ B(Star), R(0),
+ B(LdaConstant), U8(12),
+ B(Star), R(0),
+ B(LdaConstant), U8(13),
+ B(Star), R(0),
+ B(LdaConstant), U8(14),
+ B(Star), R(0),
+ B(LdaConstant), U8(15),
+ B(Star), R(0),
+ B(LdaConstant), U8(16),
+ B(Star), R(0),
+ B(LdaConstant), U8(17),
+ B(Star), R(0),
+ B(LdaConstant), U8(18),
+ B(Star), R(0),
+ B(LdaConstant), U8(19),
+ B(Star), R(0),
+ B(LdaConstant), U8(20),
+ B(Star), R(0),
+ B(LdaConstant), U8(21),
+ B(Star), R(0),
+ B(LdaConstant), U8(22),
+ B(Star), R(0),
+ B(LdaConstant), U8(23),
+ B(Star), R(0),
+ B(LdaConstant), U8(24),
+ B(Star), R(0),
+ B(LdaConstant), U8(25),
+ B(Star), R(0),
+ B(LdaConstant), U8(26),
+ B(Star), R(0),
+ B(LdaConstant), U8(27),
+ B(Star), R(0),
+ B(LdaConstant), U8(28),
+ B(Star), R(0),
+ B(LdaConstant), U8(29),
+ B(Star), R(0),
+ B(LdaConstant), U8(30),
+ B(Star), R(0),
+ B(LdaConstant), U8(31),
+ B(Star), R(0),
+ B(LdaConstant), U8(32),
+ B(Star), R(0),
+ B(LdaConstant), U8(33),
+ B(Star), R(0),
+ B(LdaConstant), U8(34),
+ B(Star), R(0),
+ B(LdaConstant), U8(35),
+ B(Star), R(0),
+ B(LdaConstant), U8(36),
+ B(Star), R(0),
+ B(LdaConstant), U8(37),
+ B(Star), R(0),
+ B(LdaConstant), U8(38),
+ B(Star), R(0),
+ B(LdaConstant), U8(39),
+ B(Star), R(0),
+ B(LdaConstant), U8(40),
+ B(Star), R(0),
+ B(LdaConstant), U8(41),
+ B(Star), R(0),
+ B(LdaConstant), U8(42),
+ B(Star), R(0),
+ B(LdaConstant), U8(43),
+ B(Star), R(0),
+ B(LdaConstant), U8(44),
+ B(Star), R(0),
+ B(LdaConstant), U8(45),
+ B(Star), R(0),
+ B(LdaConstant), U8(46),
+ B(Star), R(0),
+ B(LdaConstant), U8(47),
+ B(Star), R(0),
+ B(LdaConstant), U8(48),
+ B(Star), R(0),
+ B(LdaConstant), U8(49),
+ B(Star), R(0),
+ B(LdaConstant), U8(50),
+ B(Star), R(0),
+ B(LdaConstant), U8(51),
+ B(Star), R(0),
+ B(LdaConstant), U8(52),
+ B(Star), R(0),
+ B(LdaConstant), U8(53),
+ B(Star), R(0),
+ B(LdaConstant), U8(54),
+ B(Star), R(0),
+ B(LdaConstant), U8(55),
+ B(Star), R(0),
+ B(LdaConstant), U8(56),
+ B(Star), R(0),
+ B(LdaConstant), U8(57),
+ B(Star), R(0),
+ B(LdaConstant), U8(58),
+ B(Star), R(0),
+ B(LdaConstant), U8(59),
+ B(Star), R(0),
+ B(LdaConstant), U8(60),
+ B(Star), R(0),
+ B(LdaConstant), U8(61),
+ B(Star), R(0),
+ B(LdaConstant), U8(62),
+ B(Star), R(0),
+ B(LdaConstant), U8(63),
+ B(Star), R(0),
+ B(LdaConstant), U8(64),
+ B(Star), R(0),
+ B(LdaConstant), U8(65),
+ B(Star), R(0),
+ B(LdaConstant), U8(66),
+ B(Star), R(0),
+ B(LdaConstant), U8(67),
+ B(Star), R(0),
+ B(LdaConstant), U8(68),
+ B(Star), R(0),
+ B(LdaConstant), U8(69),
+ B(Star), R(0),
+ B(LdaConstant), U8(70),
+ B(Star), R(0),
+ B(LdaConstant), U8(71),
+ B(Star), R(0),
+ B(LdaConstant), U8(72),
+ B(Star), R(0),
+ B(LdaConstant), U8(73),
+ B(Star), R(0),
+ B(LdaConstant), U8(74),
+ B(Star), R(0),
+ B(LdaConstant), U8(75),
+ B(Star), R(0),
+ B(LdaConstant), U8(76),
+ B(Star), R(0),
+ B(LdaConstant), U8(77),
+ B(Star), R(0),
+ B(LdaConstant), U8(78),
+ B(Star), R(0),
+ B(LdaConstant), U8(79),
+ B(Star), R(0),
+ B(LdaConstant), U8(80),
+ B(Star), R(0),
+ B(LdaConstant), U8(81),
+ B(Star), R(0),
+ B(LdaConstant), U8(82),
+ B(Star), R(0),
+ B(LdaConstant), U8(83),
+ B(Star), R(0),
+ B(LdaConstant), U8(84),
+ B(Star), R(0),
+ B(LdaConstant), U8(85),
+ B(Star), R(0),
+ B(LdaConstant), U8(86),
+ B(Star), R(0),
+ B(LdaConstant), U8(87),
+ B(Star), R(0),
+ B(LdaConstant), U8(88),
+ B(Star), R(0),
+ B(LdaConstant), U8(89),
+ B(Star), R(0),
+ B(LdaConstant), U8(90),
+ B(Star), R(0),
+ B(LdaConstant), U8(91),
+ B(Star), R(0),
+ B(LdaConstant), U8(92),
+ B(Star), R(0),
+ B(LdaConstant), U8(93),
+ B(Star), R(0),
+ B(LdaConstant), U8(94),
+ B(Star), R(0),
+ B(LdaConstant), U8(95),
+ B(Star), R(0),
+ B(LdaConstant), U8(96),
+ B(Star), R(0),
+ B(LdaConstant), U8(97),
+ B(Star), R(0),
+ B(LdaConstant), U8(98),
+ B(Star), R(0),
+ B(LdaConstant), U8(99),
+ B(Star), R(0),
+ B(LdaConstant), U8(100),
+ B(Star), R(0),
+ B(LdaConstant), U8(101),
+ B(Star), R(0),
+ B(LdaConstant), U8(102),
+ B(Star), R(0),
+ B(LdaConstant), U8(103),
+ B(Star), R(0),
+ B(LdaConstant), U8(104),
+ B(Star), R(0),
+ B(LdaConstant), U8(105),
+ B(Star), R(0),
+ B(LdaConstant), U8(106),
+ B(Star), R(0),
+ B(LdaConstant), U8(107),
+ B(Star), R(0),
+ B(LdaConstant), U8(108),
+ B(Star), R(0),
+ B(LdaConstant), U8(109),
+ B(Star), R(0),
+ B(LdaConstant), U8(110),
+ B(Star), R(0),
+ B(LdaConstant), U8(111),
+ B(Star), R(0),
+ B(LdaConstant), U8(112),
+ B(Star), R(0),
+ B(LdaConstant), U8(113),
+ B(Star), R(0),
+ B(LdaConstant), U8(114),
+ B(Star), R(0),
+ B(LdaConstant), U8(115),
+ B(Star), R(0),
+ B(LdaConstant), U8(116),
+ B(Star), R(0),
+ B(LdaConstant), U8(117),
+ B(Star), R(0),
+ B(LdaConstant), U8(118),
+ B(Star), R(0),
+ B(LdaConstant), U8(119),
+ B(Star), R(0),
+ B(LdaConstant), U8(120),
+ B(Star), R(0),
+ B(LdaConstant), U8(121),
+ B(Star), R(0),
+ B(LdaConstant), U8(122),
+ B(Star), R(0),
+ B(LdaConstant), U8(123),
+ B(Star), R(0),
+ B(LdaConstant), U8(124),
+ B(Star), R(0),
+ B(LdaConstant), U8(125),
+ B(Star), R(0),
+ B(LdaConstant), U8(126),
+ B(Star), R(0),
+ B(LdaConstant), U8(127),
+ B(Star), R(0),
+ B(LdaConstant), U8(128),
+ B(Star), R(0),
+ B(LdaConstant), U8(129),
+ B(Star), R(0),
+ B(LdaConstant), U8(130),
+ B(Star), R(0),
+ B(LdaConstant), U8(131),
+ B(Star), R(0),
+ B(LdaConstant), U8(132),
+ B(Star), R(0),
+ B(LdaConstant), U8(133),
+ B(Star), R(0),
+ B(LdaConstant), U8(134),
+ B(Star), R(0),
+ B(LdaConstant), U8(135),
+ B(Star), R(0),
+ B(LdaConstant), U8(136),
+ B(Star), R(0),
+ B(LdaConstant), U8(137),
+ B(Star), R(0),
+ B(LdaConstant), U8(138),
+ B(Star), R(0),
+ B(LdaConstant), U8(139),
+ B(Star), R(0),
+ B(LdaConstant), U8(140),
+ B(Star), R(0),
+ B(LdaConstant), U8(141),
+ B(Star), R(0),
+ B(LdaConstant), U8(142),
+ B(Star), R(0),
+ B(LdaConstant), U8(143),
+ B(Star), R(0),
+ B(LdaConstant), U8(144),
+ B(Star), R(0),
+ B(LdaConstant), U8(145),
+ B(Star), R(0),
+ B(LdaConstant), U8(146),
+ B(Star), R(0),
+ B(LdaConstant), U8(147),
+ B(Star), R(0),
+ B(LdaConstant), U8(148),
+ B(Star), R(0),
+ B(LdaConstant), U8(149),
+ B(Star), R(0),
+ B(LdaConstant), U8(150),
+ B(Star), R(0),
+ B(LdaConstant), U8(151),
+ B(Star), R(0),
+ B(LdaConstant), U8(152),
+ B(Star), R(0),
+ B(LdaConstant), U8(153),
+ B(Star), R(0),
+ B(LdaConstant), U8(154),
+ B(Star), R(0),
+ B(LdaConstant), U8(155),
+ B(Star), R(0),
+ B(LdaConstant), U8(156),
+ B(Star), R(0),
+ B(LdaConstant), U8(157),
+ B(Star), R(0),
+ B(LdaConstant), U8(158),
+ B(Star), R(0),
+ B(LdaConstant), U8(159),
+ B(Star), R(0),
+ B(LdaConstant), U8(160),
+ B(Star), R(0),
+ B(LdaConstant), U8(161),
+ B(Star), R(0),
+ B(LdaConstant), U8(162),
+ B(Star), R(0),
+ B(LdaConstant), U8(163),
+ B(Star), R(0),
+ B(LdaConstant), U8(164),
+ B(Star), R(0),
+ B(LdaConstant), U8(165),
+ B(Star), R(0),
+ B(LdaConstant), U8(166),
+ B(Star), R(0),
+ B(LdaConstant), U8(167),
+ B(Star), R(0),
+ B(LdaConstant), U8(168),
+ B(Star), R(0),
+ B(LdaConstant), U8(169),
+ B(Star), R(0),
+ B(LdaConstant), U8(170),
+ B(Star), R(0),
+ B(LdaConstant), U8(171),
+ B(Star), R(0),
+ B(LdaConstant), U8(172),
+ B(Star), R(0),
+ B(LdaConstant), U8(173),
+ B(Star), R(0),
+ B(LdaConstant), U8(174),
+ B(Star), R(0),
+ B(LdaConstant), U8(175),
+ B(Star), R(0),
+ B(LdaConstant), U8(176),
+ B(Star), R(0),
+ B(LdaConstant), U8(177),
+ B(Star), R(0),
+ B(LdaConstant), U8(178),
+ B(Star), R(0),
+ B(LdaConstant), U8(179),
+ B(Star), R(0),
+ B(LdaConstant), U8(180),
+ B(Star), R(0),
+ B(LdaConstant), U8(181),
+ B(Star), R(0),
+ B(LdaConstant), U8(182),
+ B(Star), R(0),
+ B(LdaConstant), U8(183),
+ B(Star), R(0),
+ B(LdaConstant), U8(184),
+ B(Star), R(0),
+ B(LdaConstant), U8(185),
+ B(Star), R(0),
+ B(LdaConstant), U8(186),
+ B(Star), R(0),
+ B(LdaConstant), U8(187),
+ B(Star), R(0),
+ B(LdaConstant), U8(188),
+ B(Star), R(0),
+ B(LdaConstant), U8(189),
+ B(Star), R(0),
+ B(LdaConstant), U8(190),
+ B(Star), R(0),
+ B(LdaConstant), U8(191),
+ B(Star), R(0),
+ B(LdaConstant), U8(192),
+ B(Star), R(0),
+ B(LdaConstant), U8(193),
+ B(Star), R(0),
+ B(LdaConstant), U8(194),
+ B(Star), R(0),
+ B(LdaConstant), U8(195),
+ B(Star), R(0),
+ B(LdaConstant), U8(196),
+ B(Star), R(0),
+ B(LdaConstant), U8(197),
+ B(Star), R(0),
+ B(LdaConstant), U8(198),
+ B(Star), R(0),
+ B(LdaConstant), U8(199),
+ B(Star), R(0),
+ B(LdaConstant), U8(200),
+ B(Star), R(0),
+ B(LdaConstant), U8(201),
+ B(Star), R(0),
+ B(LdaConstant), U8(202),
+ B(Star), R(0),
+ B(LdaConstant), U8(203),
+ B(Star), R(0),
+ B(LdaConstant), U8(204),
+ B(Star), R(0),
+ B(LdaConstant), U8(205),
+ B(Star), R(0),
+ B(LdaConstant), U8(206),
+ B(Star), R(0),
+ B(LdaConstant), U8(207),
+ B(Star), R(0),
+ B(LdaConstant), U8(208),
+ B(Star), R(0),
+ B(LdaConstant), U8(209),
+ B(Star), R(0),
+ B(LdaConstant), U8(210),
+ B(Star), R(0),
+ B(LdaConstant), U8(211),
+ B(Star), R(0),
+ B(LdaConstant), U8(212),
+ B(Star), R(0),
+ B(LdaConstant), U8(213),
+ B(Star), R(0),
+ B(LdaConstant), U8(214),
+ B(Star), R(0),
+ B(LdaConstant), U8(215),
+ B(Star), R(0),
+ B(LdaConstant), U8(216),
+ B(Star), R(0),
+ B(LdaConstant), U8(217),
+ B(Star), R(0),
+ B(LdaConstant), U8(218),
+ B(Star), R(0),
+ B(LdaConstant), U8(219),
+ B(Star), R(0),
+ B(LdaConstant), U8(220),
+ B(Star), R(0),
+ B(LdaConstant), U8(221),
+ B(Star), R(0),
+ B(LdaConstant), U8(222),
+ B(Star), R(0),
+ B(LdaConstant), U8(223),
+ B(Star), R(0),
+ B(LdaConstant), U8(224),
+ B(Star), R(0),
+ B(LdaConstant), U8(225),
+ B(Star), R(0),
+ B(LdaConstant), U8(226),
+ B(Star), R(0),
+ B(LdaConstant), U8(227),
+ B(Star), R(0),
+ B(LdaConstant), U8(228),
+ B(Star), R(0),
+ B(LdaConstant), U8(229),
+ B(Star), R(0),
+ B(LdaConstant), U8(230),
+ B(Star), R(0),
+ B(LdaConstant), U8(231),
+ B(Star), R(0),
+ B(LdaConstant), U8(232),
+ B(Star), R(0),
+ B(LdaConstant), U8(233),
+ B(Star), R(0),
+ B(LdaConstant), U8(234),
+ B(Star), R(0),
+ B(LdaConstant), U8(235),
+ B(Star), R(0),
+ B(LdaConstant), U8(236),
+ B(Star), R(0),
+ B(LdaConstant), U8(237),
+ B(Star), R(0),
+ B(LdaConstant), U8(238),
+ B(Star), R(0),
+ B(LdaConstant), U8(239),
+ B(Star), R(0),
+ B(LdaConstant), U8(240),
+ B(Star), R(0),
+ B(LdaConstant), U8(241),
+ B(Star), R(0),
+ B(LdaConstant), U8(242),
+ B(Star), R(0),
+ B(LdaConstant), U8(243),
+ B(Star), R(0),
+ B(LdaConstant), U8(244),
+ B(Star), R(0),
+ B(LdaConstant), U8(245),
+ B(Star), R(0),
+ B(LdaConstant), U8(246),
+ B(Star), R(0),
+ B(LdaConstant), U8(247),
+ B(Star), R(0),
+ B(LdaConstant), U8(248),
+ B(Star), R(0),
+ B(LdaConstant), U8(249),
+ B(Star), R(0),
+ B(LdaConstant), U8(250),
+ B(Star), R(0),
+ B(LdaConstant), U8(251),
+ B(Star), R(0),
+ B(LdaConstant), U8(252),
+ B(Star), R(0),
+ B(LdaConstant), U8(253),
+ B(Star), R(0),
+ B(LdaConstant), U8(254),
+ B(Star), R(0),
+ B(LdaConstant), U8(255),
+ B(Star), R(0),
+ B(Wide), B(CreateArrayLiteral), U16(256), U16(0), U8(3),
+ B(Return),
+]
+constant pool: [
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::FIXED_ARRAY_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/AssignmentsInBinaryExpression.golden b/test/cctest/interpreter/bytecode_expectations/AssignmentsInBinaryExpression.golden
new file mode 100644
index 0000000..f569bab
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/AssignmentsInBinaryExpression.golden
@@ -0,0 +1,279 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ var x = 0, y = 1;
+ return (x = 2, y = 3, x = 4, y = 5);
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 25
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(0),
+ B(LdaSmi), U8(3),
+ B(Star), R(1),
+ B(LdaSmi), U8(4),
+ B(Star), R(0),
+ B(LdaSmi), U8(5),
+ B(Star), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 55;
+ var y = (x = 100);
+ return y;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 12
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(55),
+ B(Star), R(0),
+ B(LdaSmi), U8(100),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 55;
+ x = x + (x = 100) + (x = 101);
+ return x;
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 24
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(55),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(100),
+ B(Star), R(0),
+ B(Add), R(1),
+ B(Star), R(2),
+ B(LdaSmi), U8(101),
+ B(Star), R(0),
+ B(Add), R(2),
+ B(Star), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 55;
+ x = (x = 56) - x + (x = 57);
+ x++;
+ return x;
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 32
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(55),
+ B(Star), R(0),
+ B(LdaSmi), U8(56),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(Sub), R(1),
+ B(Star), R(2),
+ B(LdaSmi), U8(57),
+ B(Star), R(0),
+ B(Add), R(2),
+ B(Star), R(0),
+ B(ToNumber),
+ B(Star), R(1),
+ B(Inc),
+ B(Star), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 55;
+ var y = x + (x = 1) + (x = 2) + (x = 3);
+ return y;
+"
+frame size: 4
+parameter count: 1
+bytecode array length: 32
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(55),
+ B(Star), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(Add), R(2),
+ B(Star), R(3),
+ B(LdaSmi), U8(2),
+ B(Star), R(0),
+ B(Add), R(3),
+ B(Star), R(2),
+ B(LdaSmi), U8(3),
+ B(Star), R(0),
+ B(Add), R(2),
+ B(Star), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 55;
+ var x = x + (x = 1) + (x = 2) + (x = 3);
+ return x;
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 32
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(55),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(Add), R(1),
+ B(Star), R(2),
+ B(LdaSmi), U8(2),
+ B(Star), R(0),
+ B(Add), R(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(3),
+ B(Star), R(0),
+ B(Add), R(1),
+ B(Star), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 10, y = 20;
+ return x + (x = 1) + (x + 1) * (y = 2) + (y = 3) + (x = 4) + (y = 5) + y;
+"
+frame size: 5
+parameter count: 1
+bytecode array length: 70
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(10),
+ B(Star), R(0),
+ B(LdaSmi), U8(20),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(Add), R(2),
+ B(Star), R(3),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Add), R(2),
+ B(Star), R(4),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(Mul), R(4),
+ B(Add), R(3),
+ B(Star), R(2),
+ B(LdaSmi), U8(3),
+ B(Star), R(1),
+ B(Add), R(2),
+ B(Star), R(3),
+ B(LdaSmi), U8(4),
+ B(Star), R(0),
+ B(Add), R(3),
+ B(Star), R(2),
+ B(LdaSmi), U8(5),
+ B(Star), R(1),
+ B(Add), R(2),
+ B(Star), R(3),
+ B(Ldar), R(1),
+ B(Add), R(3),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 17;
+ return 1 + x + (x++) + (++x);
+"
+frame size: 4
+parameter count: 1
+bytecode array length: 38
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(17),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(Add), R(1),
+ B(Star), R(2),
+ B(Ldar), R(0),
+ B(ToNumber),
+ B(Star), R(1),
+ B(Inc),
+ B(Star), R(0),
+ B(Ldar), R(1),
+ B(Add), R(2),
+ B(Star), R(3),
+ B(Ldar), R(0),
+ B(ToNumber),
+ B(Inc),
+ B(Star), R(0),
+ B(Add), R(3),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/BasicBlockToBoolean.golden b/test/cctest/interpreter/bytecode_expectations/BasicBlockToBoolean.golden
new file mode 100644
index 0000000..ee98e5a
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/BasicBlockToBoolean.golden
@@ -0,0 +1,92 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: number
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ var a = 1; if (a || a < 0) { return 1; }
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 21
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(JumpIfToBooleanTrue), U8(9),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaZero),
+ B(TestLessThan), R(1),
+ B(JumpIfToBooleanFalse), U8(5),
+ B(LdaSmi), U8(1),
+ B(Return),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1; if (a && a < 0) { return 1; }
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 21
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(JumpIfToBooleanFalse), U8(9),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaZero),
+ B(TestLessThan), R(1),
+ B(JumpIfToBooleanFalse), U8(5),
+ B(LdaSmi), U8(1),
+ B(Return),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1; a = (a || a < 0) ? 2 : 3;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 26
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(JumpIfToBooleanTrue), U8(9),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaZero),
+ B(TestLessThan), R(1),
+ B(JumpIfToBooleanFalse), U8(6),
+ B(LdaSmi), U8(2),
+ B(Jump), U8(4),
+ B(LdaSmi), U8(3),
+ B(Star), R(0),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/BasicLoops.golden b/test/cctest/interpreter/bytecode_expectations/BasicLoops.golden
new file mode 100644
index 0000000..05ee657
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/BasicLoops.golden
@@ -0,0 +1,860 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ var x = 0;
+ while (false) { x = 99; break; continue; }
+ return x;
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 5
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 0;
+ while (false) {
+ x = x + 1;
+ };
+ return x;
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 5
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 0;
+ var y = 1;
+ while (x < 10) {
+ y = y * 12;
+ x = x + 1;
+ if (x == 3) continue;
+ if (x == 4) break;
+ }
+ return y;
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 66
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(10),
+ B(TestLessThan), R(2),
+ B(JumpIfFalse), U8(47),
+ B(StackCheck),
+ B(Ldar), R(1),
+ B(Star), R(2),
+ B(LdaSmi), U8(12),
+ B(Mul), R(2),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Add), R(2),
+ B(Star), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(3),
+ B(TestEqual), R(2),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(-39),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(4),
+ B(TestEqual), R(2),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(4),
+ B(Jump), U8(-53),
+ B(Ldar), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var i = 0;
+ while (true) {
+ if (i < 0) continue;
+ if (i == 3) break;
+ if (i == 4) break;
+ if (i == 10) continue;
+ if (i == 5) break;
+ i = i + 1;
+ }
+ return i;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 79
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaZero),
+ B(TestLessThan), R(1),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(-10),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(3),
+ B(TestEqual), R(1),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(50),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(4),
+ B(TestEqual), R(1),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(38),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(10),
+ B(TestEqual), R(1),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(-46),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(5),
+ B(TestEqual), R(1),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(14),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(Add), R(1),
+ B(Star), R(0),
+ B(Jump), U8(-70),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var i = 0;
+ while (true) {
+ while (i < 3) {
+ if (i == 2) break;
+ i = i + 1;
+ }
+ i = i + 1;
+ break;
+ }
+ return i;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 57
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(3),
+ B(TestLessThan), R(1),
+ B(JumpIfFalse), U8(27),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(TestEqual), R(1),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(14),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(Add), R(1),
+ B(Star), R(0),
+ B(Jump), U8(-33),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(Add), R(1),
+ B(Star), R(0),
+ B(Jump), U8(4),
+ B(Jump), U8(-48),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 10;
+ var y = 1;
+ while (x) {
+ y = y * 12;
+ x = x - 1;
+ }
+ return y;
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 39
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(10),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(JumpIfToBooleanFalse), U8(25),
+ B(StackCheck),
+ B(Ldar), R(1),
+ B(Star), R(2),
+ B(LdaSmi), U8(12),
+ B(Mul), R(2),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Sub), R(2),
+ B(Star), R(0),
+ B(Jump), U8(-25),
+ B(Ldar), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 0; var y = 1;
+ do {
+ y = y * 10;
+ if (x == 5) break;
+ if (x == 6) continue;
+ x = x + 1;
+ } while (x < 10);
+ return y;
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 66
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(StackCheck),
+ B(Ldar), R(1),
+ B(Star), R(2),
+ B(LdaSmi), U8(10),
+ B(Mul), R(2),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(5),
+ B(TestEqual), R(2),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(34),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(6),
+ B(TestEqual), R(2),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(12),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Add), R(2),
+ B(Star), R(0),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(10),
+ B(TestLessThan), R(2),
+ B(JumpIfTrue), U8(-53),
+ B(Ldar), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 10;
+ var y = 1;
+ do {
+ y = y * 12;
+ x = x - 1;
+ } while (x);
+ return y;
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 37
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(10),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(StackCheck),
+ B(Ldar), R(1),
+ B(Star), R(2),
+ B(LdaSmi), U8(12),
+ B(Mul), R(2),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Sub), R(2),
+ B(Star), R(0),
+ B(Ldar), R(0),
+ B(JumpIfToBooleanTrue), U8(-23),
+ B(Ldar), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 0; var y = 1;
+ do {
+ y = y * 10;
+ if (x == 5) break;
+ x = x + 1;
+ if (x == 6) continue;
+ } while (false);
+ return y;
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 54
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(StackCheck),
+ B(Ldar), R(1),
+ B(Star), R(2),
+ B(LdaSmi), U8(10),
+ B(Mul), R(2),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(5),
+ B(TestEqual), R(2),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(22),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Add), R(2),
+ B(Star), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(6),
+ B(TestEqual), R(2),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(2),
+ B(Ldar), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 0; var y = 1;
+ do {
+ y = y * 10;
+ if (x == 5) break;
+ x = x + 1;
+ if (x == 6) continue;
+ } while (true);
+ return y;
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 56
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(StackCheck),
+ B(Ldar), R(1),
+ B(Star), R(2),
+ B(LdaSmi), U8(10),
+ B(Mul), R(2),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(5),
+ B(TestEqual), R(2),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(24),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Add), R(2),
+ B(Star), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(6),
+ B(TestEqual), R(2),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(-41),
+ B(Jump), U8(-43),
+ B(Ldar), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 0;
+ for (;;) {
+ if (x == 1) break;
+ if (x == 2) continue;
+ x = x + 1;
+ }
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 43
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(TestEqual), R(1),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(26),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(TestEqual), R(1),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(-23),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(Add), R(1),
+ B(Star), R(0),
+ B(Jump), U8(-35),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ for (var x = 0;;) {
+ if (x == 1) break;
+ if (x == 2) continue;
+ x = x + 1;
+ }
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 43
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(TestEqual), R(1),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(26),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(TestEqual), R(1),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(-23),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(Add), R(1),
+ B(Star), R(0),
+ B(Jump), U8(-35),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 0;
+ for (;; x = x + 1) {
+ if (x == 1) break;
+ if (x == 2) continue;
+ }
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 43
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(TestEqual), R(1),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(26),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(TestEqual), R(1),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(2),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(Add), R(1),
+ B(Star), R(0),
+ B(Jump), U8(-35),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ for (var x = 0;; x = x + 1) {
+ if (x == 1) break;
+ if (x == 2) continue;
+ }
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 43
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(TestEqual), R(1),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(26),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(TestEqual), R(1),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(2),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(Add), R(1),
+ B(Star), R(0),
+ B(Jump), U8(-35),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var u = 0;
+ for (var i = 0; i < 100; i = i + 1) {
+ u = u + 1;
+ continue;
+ }
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 44
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(LdaZero),
+ B(Star), R(1),
+ B(Ldar), R(1),
+ B(Star), R(2),
+ B(LdaSmi), U8(100),
+ B(TestLessThan), R(2),
+ B(JumpIfFalse), U8(27),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Add), R(2),
+ B(Star), R(0),
+ B(Jump), U8(2),
+ B(Ldar), R(1),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Add), R(2),
+ B(Star), R(1),
+ B(Jump), U8(-33),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var y = 1;
+ for (var x = 10; x; --x) {
+ y = y * 12;
+ }
+ return y;
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 35
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(LdaSmi), U8(10),
+ B(Star), R(1),
+ B(Ldar), R(1),
+ B(JumpIfToBooleanFalse), U8(21),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(12),
+ B(Mul), R(2),
+ B(Star), R(0),
+ B(Ldar), R(1),
+ B(ToNumber),
+ B(Dec),
+ B(Star), R(1),
+ B(Jump), U8(-21),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 0;
+ for (var i = 0; false; i++) {
+ x = x + 1;
+ };
+ return x;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 10
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(LdaZero),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 0;
+ for (var i = 0; true; ++i) {
+ x = x + 1;
+ if (x == 20) break;
+ };
+ return x;
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 39
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(LdaZero),
+ B(Star), R(1),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Add), R(2),
+ B(Star), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(20),
+ B(TestEqual), R(2),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(10),
+ B(Ldar), R(1),
+ B(ToNumber),
+ B(Inc),
+ B(Star), R(1),
+ B(Jump), U8(-27),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 0;
+ while (a) {
+ {
+ let z = 1;
+ function f() { z = 2; }
+ if (z) continue;
+ z++;
+ }
+ }
+"
+frame size: 7
+parameter count: 1
+bytecode array length: 120
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(1),
+ B(Ldar), R(1),
+ B(JumpIfToBooleanFalse), U8(112),
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(4),
+ B(Ldar), R(closure),
+ B(Star), R(5),
+ B(CallRuntime), U16(Runtime::kPushBlockContext), R(4), U8(2),
+ B(PushContext), R(3),
+ B(LdaTheHole),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateClosure), U8(1), U8(0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StaContextSlot), R(context), U8(4),
+ B(Ldar), R(0),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(2),
+ B(Star), R(4),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(4), U8(1),
+ B(Star), R(2),
+ B(LdaContextSlot), R(context), U8(4),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(3),
+ B(Star), R(4),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(4), U8(1),
+ B(JumpIfToBooleanFalse), U8(8),
+ B(PopContext), R(3),
+ B(PopContext), R(3),
+ B(Jump), U8(-69),
+ B(LdaContextSlot), R(context), U8(4),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(3),
+ B(Star), R(4),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(4), U8(1),
+ B(ToNumber),
+ B(Star), R(4),
+ B(Inc),
+ B(Star), R(5),
+ B(LdaContextSlot), R(context), U8(4),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(3),
+ B(Star), R(6),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(6), U8(1),
+ B(Ldar), R(5),
+ B(StaContextSlot), R(context), U8(4),
+ B(PopContext), R(3),
+ B(Jump), U8(-112),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/BreakableBlocks.golden b/test/cctest/interpreter/bytecode_expectations/BreakableBlocks.golden
new file mode 100644
index 0000000..162297d
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/BreakableBlocks.golden
@@ -0,0 +1,232 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ var x = 0;
+ label: {
+ x = x + 1;
+ break label;
+ x = x + 1;
+ }
+ return x;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 17
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(Add), R(1),
+ B(Star), R(0),
+ B(Jump), U8(2),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var sum = 0;
+ outer: {
+ for (var x = 0; x < 10; ++x) {
+ for (var y = 0; y < 3; ++y) {
+ ++sum;
+ if (x + y == 12) { break outer; }
+ }
+ }
+ }
+ return sum;
+"
+frame size: 5
+parameter count: 1
+bytecode array length: 75
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(LdaZero),
+ B(Star), R(1),
+ B(Ldar), R(1),
+ B(Star), R(3),
+ B(LdaSmi), U8(10),
+ B(TestLessThan), R(3),
+ B(JumpIfFalse), U8(57),
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(2),
+ B(Ldar), R(2),
+ B(Star), R(3),
+ B(LdaSmi), U8(3),
+ B(TestLessThan), R(3),
+ B(JumpIfFalse), U8(35),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(ToNumber),
+ B(Inc),
+ B(Star), R(0),
+ B(Ldar), R(1),
+ B(Star), R(3),
+ B(Ldar), R(2),
+ B(Add), R(3),
+ B(Star), R(4),
+ B(LdaSmi), U8(12),
+ B(TestEqual), R(4),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(18),
+ B(Ldar), R(2),
+ B(ToNumber),
+ B(Inc),
+ B(Star), R(2),
+ B(Jump), U8(-41),
+ B(Ldar), R(1),
+ B(ToNumber),
+ B(Inc),
+ B(Star), R(1),
+ B(Jump), U8(-63),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ outer: {
+ let y = 10;
+ function f() { return y; }
+ break outer;
+ }
+"
+frame size: 5
+parameter count: 1
+bytecode array length: 51
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(3),
+ B(Ldar), R(closure),
+ B(Star), R(4),
+ B(CallRuntime), U16(Runtime::kPushBlockContext), R(3), U8(2),
+ B(PushContext), R(2),
+ B(LdaTheHole),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateClosure), U8(1), U8(0),
+ B(Star), R(0),
+ B(LdaSmi), U8(10),
+ B(StaContextSlot), R(context), U8(4),
+ B(Ldar), R(0),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(2),
+ B(Star), R(3),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(3), U8(1),
+ B(Star), R(1),
+ B(Jump), U8(2),
+ B(PopContext), R(2),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ let x = 1;
+ outer: {
+ inner: {
+ let y = 2;
+ function f() { return x + y; }
+ if (y) break outer;
+ y = 3;
+ }
+ }
+ x = 4;
+"
+frame size: 6
+parameter count: 1
+bytecode array length: 131
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(2),
+ B(LdaTheHole),
+ B(StaContextSlot), R(context), U8(4),
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(StaContextSlot), R(context), U8(4),
+ B(LdaConstant), U8(0),
+ B(Star), R(4),
+ B(Ldar), R(closure),
+ B(Star), R(5),
+ B(CallRuntime), U16(Runtime::kPushBlockContext), R(4), U8(2),
+ B(PushContext), R(3),
+ B(LdaTheHole),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateClosure), U8(1), U8(0),
+ B(Star), R(0),
+ B(LdaSmi), U8(2),
+ B(StaContextSlot), R(context), U8(4),
+ B(Ldar), R(0),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(2),
+ B(Star), R(4),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(4), U8(1),
+ B(Star), R(1),
+ B(LdaContextSlot), R(context), U8(4),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(3),
+ B(Star), R(4),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(4), U8(1),
+ B(JumpIfToBooleanFalse), U8(6),
+ B(PopContext), R(3),
+ B(Jump), U8(27),
+ B(LdaSmi), U8(3),
+ B(Star), R(4),
+ B(LdaContextSlot), R(context), U8(4),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(3),
+ B(Star), R(5),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(5), U8(1),
+ B(Ldar), R(4),
+ B(StaContextSlot), R(context), U8(4),
+ B(PopContext), R(3),
+ B(LdaSmi), U8(4),
+ B(Star), R(4),
+ B(LdaContextSlot), R(context), U8(4),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(4),
+ B(Star), R(5),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(5), U8(1),
+ B(Ldar), R(4),
+ B(StaContextSlot), R(context), U8(4),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/CallGlobal.golden b/test/cctest/interpreter/bytecode_expectations/CallGlobal.golden
new file mode 100644
index 0000000..04bc3a9
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/CallGlobal.golden
@@ -0,0 +1,64 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: no
+test function name: f
+
+---
+snippet: "
+ function t() { }
+ function f() { return t(); }
+ f();
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 15
+bytecodes: [
+ B(StackCheck),
+ B(LdaUndefined),
+ B(Star), R(1),
+ B(LdaGlobal), U8(0), U8(3),
+ B(Star), R(0),
+ B(Call), R(0), R(1), U8(1), U8(1),
+ B(Return),
+]
+constant pool: [
+ "t",
+]
+handlers: [
+]
+
+---
+snippet: "
+ function t(a, b, c) { }
+ function f() { return t(1, 2, 3); }
+ f();
+"
+frame size: 5
+parameter count: 1
+bytecode array length: 27
+bytecodes: [
+ B(StackCheck),
+ B(LdaUndefined),
+ B(Star), R(1),
+ B(LdaGlobal), U8(0), U8(3),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(Star), R(2),
+ B(LdaSmi), U8(2),
+ B(Star), R(3),
+ B(LdaSmi), U8(3),
+ B(Star), R(4),
+ B(Call), R(0), R(1), U8(4), U8(1),
+ B(Return),
+]
+constant pool: [
+ "t",
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/CallLookupSlot.golden b/test/cctest/interpreter/bytecode_expectations/CallLookupSlot.golden
new file mode 100644
index 0000000..30b69d3
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/CallLookupSlot.golden
@@ -0,0 +1,58 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ g = function(){}; eval(''); return g();
+"
+frame size: 9
+parameter count: 1
+bytecode array length: 85
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(0),
+ B(Ldar), R(this),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateMappedArguments),
+ B(StaContextSlot), R(context), U8(5),
+ B(Ldar), R(new_target),
+ B(StaContextSlot), R(context), U8(6),
+ B(StackCheck),
+ B(CreateClosure), U8(0), U8(0),
+ B(StaLookupSlotSloppy), U8(1),
+ B(LdaConstant), U8(2),
+ B(Star), R(3),
+ B(CallRuntimeForPair), U16(Runtime::kLoadLookupSlotForCall), R(3), U8(1), R(1),
+ B(LdaConstant), U8(3),
+ B(Star), R(3),
+ B(Mov), R(1), R(4),
+ B(Mov), R(3), R(5),
+ B(Mov), R(closure), R(6),
+ B(LdaZero),
+ B(Star), R(7),
+ B(LdaSmi), U8(30),
+ B(Star), R(8),
+ B(CallRuntime), U16(Runtime::kResolvePossiblyDirectEval), R(4), U8(5),
+ B(Star), R(1),
+ B(Call), R(1), R(2), U8(2), U8(0),
+ B(LdaConstant), U8(1),
+ B(Star), R(3),
+ B(CallRuntimeForPair), U16(Runtime::kLoadLookupSlotForCall), R(3), U8(1), R(1),
+ B(Call), R(1), R(2), U8(1), U8(3),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/CallNew.golden b/test/cctest/interpreter/bytecode_expectations/CallNew.golden
new file mode 100644
index 0000000..4952c73
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/CallNew.golden
@@ -0,0 +1,91 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: no
+test function name: f
+
+---
+snippet: "
+ function bar() { this.value = 0; }
+ function f() { return new bar(); }
+ f();
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 11
+bytecodes: [
+ B(StackCheck),
+ B(LdaGlobal), U8(0), U8(2),
+ B(Star), R(0),
+ B(New), R(0), R(0), U8(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ function bar(x) { this.value = 18; this.x = x;}
+ function f() { return new bar(3); }
+ f();
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 17
+bytecodes: [
+ B(StackCheck),
+ B(LdaGlobal), U8(0), U8(2),
+ B(Star), R(0),
+ B(LdaSmi), U8(3),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(New), R(0), R(1), U8(1),
+ B(Return),
+]
+constant pool: [
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ function bar(w, x, y, z) {
+ this.value = 18;
+ this.x = x;
+ this.y = y;
+ this.z = z;
+ }
+ function f() { return new bar(3, 4, 5); }
+ f();
+"
+frame size: 4
+parameter count: 1
+bytecode array length: 25
+bytecodes: [
+ B(StackCheck),
+ B(LdaGlobal), U8(0), U8(2),
+ B(Star), R(0),
+ B(LdaSmi), U8(3),
+ B(Star), R(1),
+ B(LdaSmi), U8(4),
+ B(Star), R(2),
+ B(LdaSmi), U8(5),
+ B(Star), R(3),
+ B(Ldar), R(0),
+ B(New), R(0), R(1), U8(3),
+ B(Return),
+]
+constant pool: [
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/CallRuntime.golden b/test/cctest/interpreter/bytecode_expectations/CallRuntime.golden
new file mode 100644
index 0000000..ec10e67
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/CallRuntime.golden
@@ -0,0 +1,94 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: no
+test function name: f
+
+---
+snippet: "
+ function f() { %TheHole() }
+ f();
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 8
+bytecodes: [
+ B(StackCheck),
+ B(CallRuntime), U16(Runtime::kTheHole), R(0), U8(0),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a) { return %IsArray(a) }
+ f(undefined);
+"
+frame size: 1
+parameter count: 2
+bytecode array length: 11
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(CallRuntime), U16(Runtime::kIsArray), R(0), U8(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f() { return %Add(1, 2) }
+ f();
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 15
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(CallRuntime), U16(Runtime::kAdd), R(0), U8(2),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f() { return %spread_iterable([1]) }
+ f();
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 15
+bytecodes: [
+ B(StackCheck),
+ B(LdaUndefined),
+ B(Star), R(0),
+ B(CreateArrayLiteral), U8(0), U8(0), U8(3),
+ B(Star), R(1),
+ B(CallJSRuntime), U8(115), R(0), U8(2),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/ClassAndSuperClass.golden b/test/cctest/interpreter/bytecode_expectations/ClassAndSuperClass.golden
new file mode 100644
index 0000000..6869c5b
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/ClassAndSuperClass.golden
@@ -0,0 +1,261 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: no
+test function name: test
+
+---
+snippet: "
+ var test;
+ (function() {
+ class A {
+ method() { return 2; }
+ }
+ class B extends A {
+ method() { return super.method() + 1; }
+ }
+ test = new B().method;
+ test();
+ })();
+"
+frame size: 7
+parameter count: 1
+bytecode array length: 57
+bytecodes: [
+ B(Ldar), R(closure),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(this),
+ B(Star), R(3),
+ B(Ldar), R(0),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(0),
+ B(Star), R(6),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(6), U8(1),
+ B(Star), R(6),
+ B(LdaConstant), U8(1),
+ B(KeyedLoadIC), R(6), U8(3),
+ B(Star), R(4),
+ B(LdaConstant), U8(2),
+ B(Star), R(5),
+ B(CallRuntime), U16(Runtime::kLoadFromSuper), R(3), U8(3),
+ B(Mov), R(3), R(2),
+ B(Star), R(1),
+ B(Call), R(1), R(2), U8(1), U8(1),
+ B(Star), R(3),
+ B(LdaSmi), U8(1),
+ B(Add), R(3),
+ B(Return),
+]
+constant pool: [
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::SYMBOL_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var test;
+ (function() {
+ class A {
+ get x() { return 1; }
+ set x(val) { return; }
+ }
+ class B extends A {
+ method() { super.x = 2; return super.x; }
+ }
+ test = new B().method;
+ test();
+ })();
+"
+frame size: 6
+parameter count: 1
+bytecode array length: 80
+bytecodes: [
+ B(Ldar), R(closure),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(this),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(0),
+ B(Star), R(5),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(5), U8(1),
+ B(Star), R(5),
+ B(LdaConstant), U8(1),
+ B(KeyedLoadIC), R(5), U8(1),
+ B(Star), R(2),
+ B(LdaConstant), U8(2),
+ B(Star), R(3),
+ B(LdaSmi), U8(2),
+ B(Star), R(4),
+ B(CallRuntime), U16(Runtime::kStoreToSuper_Strict), R(1), U8(4),
+ B(Ldar), R(this),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(0),
+ B(Star), R(4),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(4), U8(1),
+ B(Star), R(4),
+ B(LdaConstant), U8(1),
+ B(KeyedLoadIC), R(4), U8(3),
+ B(Star), R(2),
+ B(LdaConstant), U8(2),
+ B(Star), R(3),
+ B(CallRuntime), U16(Runtime::kLoadFromSuper), R(1), U8(3),
+ B(Return),
+]
+constant pool: [
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::SYMBOL_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var test;
+ (function() {
+ class A {
+ constructor(x) { this.x_ = x; }
+ }
+ class B extends A {
+ constructor() { super(1); this.y_ = 2; }
+ }
+ test = new B().constructor;
+ })();
+"
+frame size: 5
+parameter count: 1
+bytecode array length: 106
+bytecodes: [
+ B(Ldar), R(closure),
+ B(Star), R(1),
+ B(Ldar), R(new_target),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(1),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(0),
+ B(Star), R(3),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(3), U8(1),
+ B(Star), R(2),
+ B(CallRuntime), U16(Runtime::k_GetSuperConstructor), R(2), U8(1),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(3),
+ B(Ldar), R(0),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(1),
+ B(Star), R(4),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(4), U8(1),
+ B(New), R(2), R(3), U8(1),
+ B(Star), R(2),
+ B(Ldar), R(this),
+ B(JumpIfNotHole), U8(4),
+ B(Jump), U8(11),
+ B(LdaConstant), U8(2),
+ B(Star), R(3),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(3), U8(1),
+ B(Ldar), R(2),
+ B(Star), R(this),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(2),
+ B(Star), R(2),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(2), U8(1),
+ B(Star), R(2),
+ B(LdaSmi), U8(2),
+ B(StoreICStrict), R(2), U8(3), U8(4),
+ B(Ldar), R(this),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(2),
+ B(Star), R(2),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(2), U8(1),
+ B(Return),
+]
+constant pool: [
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var test;
+ (function() {
+ class A {
+ constructor() { this.x_ = 1; }
+ }
+ class B extends A {
+ constructor() { super(); this.y_ = 2; }
+ }
+ test = new B().constructor;
+ })();
+"
+frame size: 4
+parameter count: 1
+bytecode array length: 102
+bytecodes: [
+ B(Ldar), R(closure),
+ B(Star), R(1),
+ B(Ldar), R(new_target),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(1),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(0),
+ B(Star), R(3),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(3), U8(1),
+ B(Star), R(2),
+ B(CallRuntime), U16(Runtime::k_GetSuperConstructor), R(2), U8(1),
+ B(Star), R(2),
+ B(Ldar), R(0),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(1),
+ B(Star), R(3),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(3), U8(1),
+ B(New), R(2), R(0), U8(0),
+ B(Star), R(2),
+ B(Ldar), R(this),
+ B(JumpIfNotHole), U8(4),
+ B(Jump), U8(11),
+ B(LdaConstant), U8(2),
+ B(Star), R(3),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(3), U8(1),
+ B(Ldar), R(2),
+ B(Star), R(this),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(2),
+ B(Star), R(2),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(2), U8(1),
+ B(Star), R(2),
+ B(LdaSmi), U8(2),
+ B(StoreICStrict), R(2), U8(3), U8(4),
+ B(Ldar), R(this),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(2),
+ B(Star), R(2),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(2), U8(1),
+ B(Return),
+]
+constant pool: [
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/ClassDeclarations.golden b/test/cctest/interpreter/bytecode_expectations/ClassDeclarations.golden
new file mode 100644
index 0000000..db42c50
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/ClassDeclarations.golden
@@ -0,0 +1,242 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ class Person {
+ constructor(name) { this.name = name; }
+ speak() { console.log(this.name + ' is speaking.'); }
+ }
+"
+frame size: 9
+parameter count: 1
+bytecode array length: 73
+bytecodes: [
+ B(LdaTheHole),
+ B(Star), R(1),
+ B(StackCheck),
+ B(LdaTheHole),
+ B(Star), R(0),
+ B(LdaTheHole),
+ B(Star), R(2),
+ B(CreateClosure), U8(0), U8(0),
+ B(Star), R(3),
+ B(LdaSmi), U8(34),
+ B(Star), R(4),
+ B(Wide), B(LdaSmi), U16(148),
+ B(Star), R(5),
+ B(CallRuntime), U16(Runtime::kDefineClass), R(2), U8(4),
+ B(Star), R(2),
+ B(LoadIC), R(2), U8(1), U8(1),
+ B(Star), R(3),
+ B(Mov), R(3), R(4),
+ B(LdaConstant), U8(2),
+ B(Star), R(5),
+ B(CreateClosure), U8(3), U8(0),
+ B(Star), R(6),
+ B(LdaSmi), U8(2),
+ B(Star), R(7),
+ B(LdaZero),
+ B(Star), R(8),
+ B(CallRuntime), U16(Runtime::kDefineDataPropertyInLiteral), R(4), U8(5),
+ B(CallRuntime), U16(Runtime::kFinalizeClassDefinition), R(2), U8(2),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ class person {
+ constructor(name) { this.name = name; }
+ speak() { console.log(this.name + ' is speaking.'); }
+ }
+"
+frame size: 9
+parameter count: 1
+bytecode array length: 73
+bytecodes: [
+ B(LdaTheHole),
+ B(Star), R(1),
+ B(StackCheck),
+ B(LdaTheHole),
+ B(Star), R(0),
+ B(LdaTheHole),
+ B(Star), R(2),
+ B(CreateClosure), U8(0), U8(0),
+ B(Star), R(3),
+ B(LdaSmi), U8(34),
+ B(Star), R(4),
+ B(Wide), B(LdaSmi), U16(148),
+ B(Star), R(5),
+ B(CallRuntime), U16(Runtime::kDefineClass), R(2), U8(4),
+ B(Star), R(2),
+ B(LoadIC), R(2), U8(1), U8(1),
+ B(Star), R(3),
+ B(Mov), R(3), R(4),
+ B(LdaConstant), U8(2),
+ B(Star), R(5),
+ B(CreateClosure), U8(3), U8(0),
+ B(Star), R(6),
+ B(LdaSmi), U8(2),
+ B(Star), R(7),
+ B(LdaZero),
+ B(Star), R(8),
+ B(CallRuntime), U16(Runtime::kDefineDataPropertyInLiteral), R(4), U8(5),
+ B(CallRuntime), U16(Runtime::kFinalizeClassDefinition), R(2), U8(2),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var n0 = 'a';
+ var n1 = 'b';
+ class N {
+ [n0]() { return n0; }
+ static [n1]() { return n1; }
+ }
+"
+frame size: 10
+parameter count: 1
+bytecode array length: 127
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(2),
+ B(LdaTheHole),
+ B(Star), R(1),
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(StaContextSlot), R(context), U8(4),
+ B(LdaConstant), U8(1),
+ B(StaContextSlot), R(context), U8(5),
+ B(LdaTheHole),
+ B(Star), R(0),
+ B(LdaTheHole),
+ B(Star), R(3),
+ B(CreateClosure), U8(2), U8(0),
+ B(Star), R(4),
+ B(LdaSmi), U8(62),
+ B(Star), R(5),
+ B(Wide), B(LdaSmi), U16(128),
+ B(Star), R(6),
+ B(CallRuntime), U16(Runtime::kDefineClass), R(3), U8(4),
+ B(Star), R(3),
+ B(LoadIC), R(3), U8(3), U8(1),
+ B(Star), R(4),
+ B(Mov), R(4), R(5),
+ B(LdaContextSlot), R(context), U8(4),
+ B(ToName),
+ B(Star), R(6),
+ B(CreateClosure), U8(4), U8(0),
+ B(Star), R(7),
+ B(LdaSmi), U8(2),
+ B(Star), R(8),
+ B(LdaSmi), U8(1),
+ B(Star), R(9),
+ B(CallRuntime), U16(Runtime::kDefineDataPropertyInLiteral), R(5), U8(5),
+ B(Mov), R(3), R(5),
+ B(LdaContextSlot), R(context), U8(5),
+ B(ToName),
+ B(Star), R(6),
+ B(LdaConstant), U8(3),
+ B(TestEqualStrict), R(6),
+ B(JumpIfFalse), U8(7),
+ B(CallRuntime), U16(Runtime::kThrowStaticPrototypeError), R(0), U8(0),
+ B(CreateClosure), U8(5), U8(0),
+ B(Star), R(7),
+ B(LdaSmi), U8(1),
+ B(Star), R(9),
+ B(CallRuntime), U16(Runtime::kDefineDataPropertyInLiteral), R(5), U8(5),
+ B(CallRuntime), U16(Runtime::kFinalizeClassDefinition), R(3), U8(2),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var count = 0;
+ class C { constructor() { count++; }}
+ return new C();
+"
+frame size: 10
+parameter count: 1
+bytecode array length: 74
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(2),
+ B(LdaTheHole),
+ B(Star), R(1),
+ B(StackCheck),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(4),
+ B(LdaTheHole),
+ B(Star), R(0),
+ B(LdaTheHole),
+ B(Star), R(3),
+ B(CreateClosure), U8(0), U8(0),
+ B(Star), R(4),
+ B(LdaSmi), U8(49),
+ B(Star), R(5),
+ B(LdaSmi), U8(86),
+ B(Star), R(6),
+ B(CallRuntime), U16(Runtime::kDefineClass), R(3), U8(4),
+ B(Star), R(3),
+ B(LoadIC), R(3), U8(1), U8(1),
+ B(Star), R(4),
+ B(CallRuntime), U16(Runtime::kFinalizeClassDefinition), R(3), U8(2),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(2),
+ B(Star), R(4),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(4), U8(1),
+ B(Star), R(3),
+ B(New), R(3), R(0), U8(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/CompoundExpressions.golden b/test/cctest/interpreter/bytecode_expectations/CompoundExpressions.golden
new file mode 100644
index 0000000..ccabedc
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/CompoundExpressions.golden
@@ -0,0 +1,140 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ var a = 1; a += 2;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 15
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Add), R(1),
+ B(Star), R(0),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1; a /= 2;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 15
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Div), R(1),
+ B(Star), R(0),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = { val: 2 }; a.name *= 2;
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 27
+bytecodes: [
+ B(StackCheck),
+ B(CreateObjectLiteral), U8(0), U8(0), U8(5),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(1), U8(1),
+ B(Star), R(2),
+ B(LdaSmi), U8(2),
+ B(Mul), R(2),
+ B(StoreICSloppy), R(1), U8(1), U8(3),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = { 1: 2 }; a[1] ^= 2;
+"
+frame size: 4
+parameter count: 1
+bytecode array length: 30
+bytecodes: [
+ B(StackCheck),
+ B(CreateObjectLiteral), U8(0), U8(0), U8(5),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(Star), R(2),
+ B(KeyedLoadIC), R(1), U8(1),
+ B(Star), R(3),
+ B(LdaSmi), U8(2),
+ B(BitwiseXor), R(3),
+ B(KeyedStoreICSloppy), R(1), R(2), U8(3),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1; (function f() { return a; }); a |= 24;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 30
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(0),
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateClosure), U8(0), U8(0),
+ B(LdaContextSlot), R(context), U8(4),
+ B(Star), R(1),
+ B(LdaSmi), U8(24),
+ B(BitwiseOr), R(1),
+ B(StaContextSlot), R(context), U8(4),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/Conditional.golden b/test/cctest/interpreter/bytecode_expectations/Conditional.golden
new file mode 100644
index 0000000..17327a5
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/Conditional.golden
@@ -0,0 +1,55 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: number
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ return 1 ? 2 : 3;
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 12
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(JumpIfToBooleanFalse), U8(6),
+ B(LdaSmi), U8(2),
+ B(Jump), U8(4),
+ B(LdaSmi), U8(3),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ return 1 ? 2 ? 3 : 4 : 5;
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 20
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(JumpIfToBooleanFalse), U8(14),
+ B(LdaSmi), U8(2),
+ B(JumpIfToBooleanFalse), U8(6),
+ B(LdaSmi), U8(3),
+ B(Jump), U8(4),
+ B(LdaSmi), U8(4),
+ B(Jump), U8(4),
+ B(LdaSmi), U8(5),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/ConstVariable.golden b/test/cctest/interpreter/bytecode_expectations/ConstVariable.golden
new file mode 100644
index 0000000..d3fb484
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/ConstVariable.golden
@@ -0,0 +1,117 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ const x = 10;
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 10
+bytecodes: [
+ B(LdaTheHole),
+ B(Star), R(0),
+ B(StackCheck),
+ B(LdaSmi), U8(10),
+ B(Star), R(0),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ const x = 10; return x;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 20
+bytecodes: [
+ B(LdaTheHole),
+ B(Star), R(0),
+ B(StackCheck),
+ B(LdaSmi), U8(10),
+ B(Star), R(0),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(0),
+ B(Star), R(1),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(1), U8(1),
+ B(Return),
+]
+constant pool: [
+ "x",
+]
+handlers: [
+]
+
+---
+snippet: "
+ const x = ( x = 20);
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 32
+bytecodes: [
+ B(LdaTheHole),
+ B(Star), R(0),
+ B(StackCheck),
+ B(LdaSmi), U8(20),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(0),
+ B(Star), R(2),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(2), U8(1),
+ B(CallRuntime), U16(Runtime::kThrowConstAssignError), R(0), U8(0),
+ B(Ldar), R(1),
+ B(Star), R(0),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "x",
+]
+handlers: [
+]
+
+---
+snippet: "
+ const x = 10; x = 20;
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 36
+bytecodes: [
+ B(LdaTheHole),
+ B(Star), R(0),
+ B(StackCheck),
+ B(LdaSmi), U8(10),
+ B(Star), R(0),
+ B(LdaSmi), U8(20),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(0),
+ B(Star), R(2),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(2), U8(1),
+ B(CallRuntime), U16(Runtime::kThrowConstAssignError), R(0), U8(0),
+ B(Ldar), R(1),
+ B(Star), R(0),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "x",
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/ConstVariableContextSlot.golden b/test/cctest/interpreter/bytecode_expectations/ConstVariableContextSlot.golden
new file mode 100644
index 0000000..3b445c1
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/ConstVariableContextSlot.golden
@@ -0,0 +1,139 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ const x = 10; function f1() {return x;}
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 24
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(1),
+ B(LdaTheHole),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateClosure), U8(0), U8(0),
+ B(Star), R(0),
+ B(StackCheck),
+ B(LdaSmi), U8(10),
+ B(StaContextSlot), R(context), U8(4),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ const x = 10; function f1() {return x;} return x;
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 37
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(1),
+ B(LdaTheHole),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateClosure), U8(0), U8(0),
+ B(Star), R(0),
+ B(StackCheck),
+ B(LdaSmi), U8(10),
+ B(StaContextSlot), R(context), U8(4),
+ B(LdaContextSlot), R(context), U8(4),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(1),
+ B(Star), R(2),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(2), U8(1),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ const x = (x = 20); function f1() {return x;}
+"
+frame size: 4
+parameter count: 1
+bytecode array length: 50
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(1),
+ B(LdaTheHole),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateClosure), U8(0), U8(0),
+ B(Star), R(0),
+ B(StackCheck),
+ B(LdaSmi), U8(20),
+ B(Star), R(2),
+ B(LdaContextSlot), R(context), U8(4),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(1),
+ B(Star), R(3),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(3), U8(1),
+ B(CallRuntime), U16(Runtime::kThrowConstAssignError), R(0), U8(0),
+ B(Ldar), R(2),
+ B(StaContextSlot), R(context), U8(4),
+ B(StaContextSlot), R(context), U8(4),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ const x = 10; x = 20; function f1() {return x;}
+"
+frame size: 4
+parameter count: 1
+bytecode array length: 52
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(1),
+ B(LdaTheHole),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateClosure), U8(0), U8(0),
+ B(Star), R(0),
+ B(StackCheck),
+ B(LdaSmi), U8(10),
+ B(StaContextSlot), R(context), U8(4),
+ B(LdaSmi), U8(20),
+ B(Star), R(2),
+ B(LdaContextSlot), R(context), U8(4),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(1),
+ B(Star), R(3),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(3), U8(1),
+ B(CallRuntime), U16(Runtime::kThrowConstAssignError), R(0), U8(0),
+ B(Ldar), R(2),
+ B(StaContextSlot), R(context), U8(4),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/ContextParameters.golden b/test/cctest/interpreter/bytecode_expectations/ContextParameters.golden
new file mode 100644
index 0000000..fb74600
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/ContextParameters.golden
@@ -0,0 +1,106 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: no
+test function name: f
+
+---
+snippet: "
+ function f(arg1) { return function() { arg1 = 2; }; }
+ f();
+"
+frame size: 1
+parameter count: 2
+bytecode array length: 17
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(0),
+ B(Ldar), R(arg0),
+ B(StaContextSlot), R(context), U8(4),
+ B(StackCheck),
+ B(CreateClosure), U8(0), U8(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(arg1) { var a = function() { arg1 = 2; }; return arg1; }
+ f();
+"
+frame size: 2
+parameter count: 2
+bytecode array length: 22
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(1),
+ B(Ldar), R(arg0),
+ B(StaContextSlot), R(context), U8(4),
+ B(StackCheck),
+ B(CreateClosure), U8(0), U8(0),
+ B(Star), R(0),
+ B(LdaContextSlot), R(context), U8(4),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a1, a2, a3, a4) { return function() { a1 = a3; }; }
+ f();
+"
+frame size: 1
+parameter count: 5
+bytecode array length: 22
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(0),
+ B(Ldar), R(arg0),
+ B(StaContextSlot), R(context), U8(5),
+ B(Ldar), R(arg2),
+ B(StaContextSlot), R(context), U8(4),
+ B(StackCheck),
+ B(CreateClosure), U8(0), U8(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f() { var self = this; return function() { self = 2; }; }
+ f();
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 17
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(0),
+ B(StackCheck),
+ B(Ldar), R(this),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateClosure), U8(0), U8(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/ContextVariables.golden b/test/cctest/interpreter/bytecode_expectations/ContextVariables.golden
new file mode 100644
index 0000000..b86e22b
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/ContextVariables.golden
@@ -0,0 +1,921 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ var a; return function() { a = 1; };
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 12
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(0),
+ B(StackCheck),
+ B(CreateClosure), U8(0), U8(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1; return function() { a = 2; };
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 17
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(0),
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateClosure), U8(0), U8(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1; var b = 2; return function() { a = 2; b = 3 };
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 22
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(0),
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(StaContextSlot), R(context), U8(4),
+ B(LdaSmi), U8(2),
+ B(StaContextSlot), R(context), U8(5),
+ B(CreateClosure), U8(0), U8(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a; (function() { a = 2; })(); return a;
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 25
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(0),
+ B(StackCheck),
+ B(LdaUndefined),
+ B(Star), R(2),
+ B(CreateClosure), U8(0), U8(0),
+ B(Star), R(1),
+ B(Call), R(1), R(2), U8(1), U8(1),
+ B(LdaContextSlot), R(context), U8(4),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ 'use strict';
+ let a = 1;
+ { let b = 2; return function() { a + b; }; }
+"
+frame size: 4
+parameter count: 1
+bytecode array length: 47
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(0),
+ B(LdaTheHole),
+ B(StaContextSlot), R(context), U8(4),
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(StaContextSlot), R(context), U8(4),
+ B(LdaConstant), U8(0),
+ B(Star), R(2),
+ B(Ldar), R(closure),
+ B(Star), R(3),
+ B(CallRuntime), U16(Runtime::kPushBlockContext), R(2), U8(2),
+ B(PushContext), R(1),
+ B(LdaTheHole),
+ B(StaContextSlot), R(context), U8(4),
+ B(LdaSmi), U8(2),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateClosure), U8(1), U8(0),
+ B(PopContext), R(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ 'use strict';
+ var a0 = 0;
+ var a1 = 0;
+ var a2 = 0;
+ var a3 = 0;
+ var a4 = 0;
+ var a5 = 0;
+ var a6 = 0;
+ var a7 = 0;
+ var a8 = 0;
+ var a9 = 0;
+ var a10 = 0;
+ var a11 = 0;
+ var a12 = 0;
+ var a13 = 0;
+ var a14 = 0;
+ var a15 = 0;
+ var a16 = 0;
+ var a17 = 0;
+ var a18 = 0;
+ var a19 = 0;
+ var a20 = 0;
+ var a21 = 0;
+ var a22 = 0;
+ var a23 = 0;
+ var a24 = 0;
+ var a25 = 0;
+ var a26 = 0;
+ var a27 = 0;
+ var a28 = 0;
+ var a29 = 0;
+ var a30 = 0;
+ var a31 = 0;
+ var a32 = 0;
+ var a33 = 0;
+ var a34 = 0;
+ var a35 = 0;
+ var a36 = 0;
+ var a37 = 0;
+ var a38 = 0;
+ var a39 = 0;
+ var a40 = 0;
+ var a41 = 0;
+ var a42 = 0;
+ var a43 = 0;
+ var a44 = 0;
+ var a45 = 0;
+ var a46 = 0;
+ var a47 = 0;
+ var a48 = 0;
+ var a49 = 0;
+ var a50 = 0;
+ var a51 = 0;
+ var a52 = 0;
+ var a53 = 0;
+ var a54 = 0;
+ var a55 = 0;
+ var a56 = 0;
+ var a57 = 0;
+ var a58 = 0;
+ var a59 = 0;
+ var a60 = 0;
+ var a61 = 0;
+ var a62 = 0;
+ var a63 = 0;
+ var a64 = 0;
+ var a65 = 0;
+ var a66 = 0;
+ var a67 = 0;
+ var a68 = 0;
+ var a69 = 0;
+ var a70 = 0;
+ var a71 = 0;
+ var a72 = 0;
+ var a73 = 0;
+ var a74 = 0;
+ var a75 = 0;
+ var a76 = 0;
+ var a77 = 0;
+ var a78 = 0;
+ var a79 = 0;
+ var a80 = 0;
+ var a81 = 0;
+ var a82 = 0;
+ var a83 = 0;
+ var a84 = 0;
+ var a85 = 0;
+ var a86 = 0;
+ var a87 = 0;
+ var a88 = 0;
+ var a89 = 0;
+ var a90 = 0;
+ var a91 = 0;
+ var a92 = 0;
+ var a93 = 0;
+ var a94 = 0;
+ var a95 = 0;
+ var a96 = 0;
+ var a97 = 0;
+ var a98 = 0;
+ var a99 = 0;
+ var a100 = 0;
+ var a101 = 0;
+ var a102 = 0;
+ var a103 = 0;
+ var a104 = 0;
+ var a105 = 0;
+ var a106 = 0;
+ var a107 = 0;
+ var a108 = 0;
+ var a109 = 0;
+ var a110 = 0;
+ var a111 = 0;
+ var a112 = 0;
+ var a113 = 0;
+ var a114 = 0;
+ var a115 = 0;
+ var a116 = 0;
+ var a117 = 0;
+ var a118 = 0;
+ var a119 = 0;
+ var a120 = 0;
+ var a121 = 0;
+ var a122 = 0;
+ var a123 = 0;
+ var a124 = 0;
+ var a125 = 0;
+ var a126 = 0;
+ var a127 = 0;
+ var a128 = 0;
+ var a129 = 0;
+ var a130 = 0;
+ var a131 = 0;
+ var a132 = 0;
+ var a133 = 0;
+ var a134 = 0;
+ var a135 = 0;
+ var a136 = 0;
+ var a137 = 0;
+ var a138 = 0;
+ var a139 = 0;
+ var a140 = 0;
+ var a141 = 0;
+ var a142 = 0;
+ var a143 = 0;
+ var a144 = 0;
+ var a145 = 0;
+ var a146 = 0;
+ var a147 = 0;
+ var a148 = 0;
+ var a149 = 0;
+ var a150 = 0;
+ var a151 = 0;
+ var a152 = 0;
+ var a153 = 0;
+ var a154 = 0;
+ var a155 = 0;
+ var a156 = 0;
+ var a157 = 0;
+ var a158 = 0;
+ var a159 = 0;
+ var a160 = 0;
+ var a161 = 0;
+ var a162 = 0;
+ var a163 = 0;
+ var a164 = 0;
+ var a165 = 0;
+ var a166 = 0;
+ var a167 = 0;
+ var a168 = 0;
+ var a169 = 0;
+ var a170 = 0;
+ var a171 = 0;
+ var a172 = 0;
+ var a173 = 0;
+ var a174 = 0;
+ var a175 = 0;
+ var a176 = 0;
+ var a177 = 0;
+ var a178 = 0;
+ var a179 = 0;
+ var a180 = 0;
+ var a181 = 0;
+ var a182 = 0;
+ var a183 = 0;
+ var a184 = 0;
+ var a185 = 0;
+ var a186 = 0;
+ var a187 = 0;
+ var a188 = 0;
+ var a189 = 0;
+ var a190 = 0;
+ var a191 = 0;
+ var a192 = 0;
+ var a193 = 0;
+ var a194 = 0;
+ var a195 = 0;
+ var a196 = 0;
+ var a197 = 0;
+ var a198 = 0;
+ var a199 = 0;
+ var a200 = 0;
+ var a201 = 0;
+ var a202 = 0;
+ var a203 = 0;
+ var a204 = 0;
+ var a205 = 0;
+ var a206 = 0;
+ var a207 = 0;
+ var a208 = 0;
+ var a209 = 0;
+ var a210 = 0;
+ var a211 = 0;
+ var a212 = 0;
+ var a213 = 0;
+ var a214 = 0;
+ var a215 = 0;
+ var a216 = 0;
+ var a217 = 0;
+ var a218 = 0;
+ var a219 = 0;
+ var a220 = 0;
+ var a221 = 0;
+ var a222 = 0;
+ var a223 = 0;
+ var a224 = 0;
+ var a225 = 0;
+ var a226 = 0;
+ var a227 = 0;
+ var a228 = 0;
+ var a229 = 0;
+ var a230 = 0;
+ var a231 = 0;
+ var a232 = 0;
+ var a233 = 0;
+ var a234 = 0;
+ var a235 = 0;
+ var a236 = 0;
+ var a237 = 0;
+ var a238 = 0;
+ var a239 = 0;
+ var a240 = 0;
+ var a241 = 0;
+ var a242 = 0;
+ var a243 = 0;
+ var a244 = 0;
+ var a245 = 0;
+ var a246 = 0;
+ var a247 = 0;
+ var a248 = 0;
+ eval();
+ var b = 100;
+ return b
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 1046
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(0),
+ B(Ldar), R(this),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateUnmappedArguments),
+ B(StaContextSlot), R(context), U8(5),
+ B(Ldar), R(new_target),
+ B(StaContextSlot), R(context), U8(6),
+ B(StackCheck),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(7),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(8),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(9),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(10),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(11),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(12),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(13),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(14),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(15),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(16),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(17),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(18),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(19),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(20),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(21),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(22),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(23),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(24),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(25),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(26),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(27),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(28),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(29),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(30),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(31),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(32),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(33),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(34),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(35),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(36),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(37),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(38),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(39),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(40),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(41),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(42),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(43),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(44),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(45),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(46),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(47),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(48),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(49),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(50),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(51),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(52),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(53),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(54),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(55),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(56),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(57),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(58),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(59),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(60),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(61),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(62),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(63),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(64),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(65),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(66),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(67),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(68),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(69),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(70),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(71),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(72),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(73),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(74),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(75),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(76),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(77),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(78),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(79),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(80),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(81),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(82),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(83),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(84),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(85),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(86),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(87),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(88),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(89),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(90),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(91),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(92),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(93),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(94),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(95),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(96),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(97),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(98),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(99),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(100),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(101),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(102),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(103),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(104),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(105),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(106),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(107),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(108),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(109),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(110),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(111),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(112),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(113),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(114),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(115),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(116),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(117),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(118),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(119),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(120),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(121),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(122),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(123),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(124),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(125),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(126),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(127),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(128),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(129),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(130),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(131),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(132),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(133),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(134),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(135),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(136),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(137),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(138),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(139),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(140),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(141),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(142),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(143),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(144),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(145),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(146),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(147),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(148),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(149),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(150),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(151),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(152),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(153),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(154),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(155),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(156),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(157),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(158),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(159),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(160),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(161),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(162),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(163),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(164),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(165),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(166),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(167),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(168),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(169),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(170),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(171),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(172),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(173),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(174),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(175),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(176),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(177),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(178),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(179),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(180),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(181),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(182),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(183),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(184),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(185),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(186),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(187),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(188),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(189),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(190),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(191),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(192),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(193),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(194),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(195),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(196),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(197),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(198),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(199),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(200),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(201),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(202),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(203),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(204),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(205),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(206),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(207),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(208),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(209),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(210),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(211),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(212),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(213),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(214),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(215),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(216),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(217),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(218),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(219),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(220),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(221),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(222),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(223),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(224),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(225),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(226),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(227),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(228),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(229),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(230),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(231),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(232),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(233),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(234),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(235),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(236),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(237),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(238),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(239),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(240),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(241),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(242),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(243),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(244),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(245),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(246),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(247),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(248),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(249),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(250),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(251),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(252),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(253),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(254),
+ B(LdaZero),
+ B(StaContextSlot), R(context), U8(255),
+ B(LdaUndefined),
+ B(Star), R(2),
+ B(LdaGlobal), U8(0), U8(1),
+ B(Star), R(1),
+ B(Call), R(1), R(2), U8(1), U8(0),
+ B(LdaSmi), U8(100),
+ B(Wide), B(StaContextSlot), R16(context), U16(256),
+ B(Wide), B(LdaContextSlot), R16(context), U16(256),
+ B(Return),
+]
+constant pool: [
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/CountOperators.golden b/test/cctest/interpreter/bytecode_expectations/CountOperators.golden
new file mode 100644
index 0000000..8857789
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/CountOperators.golden
@@ -0,0 +1,298 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ var a = 1; return ++a;
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 10
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(ToNumber),
+ B(Inc),
+ B(Star), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1; return a++;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 14
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(ToNumber),
+ B(Star), R(1),
+ B(Inc),
+ B(Star), R(0),
+ B(Ldar), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1; return --a;
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 10
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(ToNumber),
+ B(Dec),
+ B(Star), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1; return a--;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 14
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(ToNumber),
+ B(Star), R(1),
+ B(Dec),
+ B(Star), R(0),
+ B(Ldar), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = { val: 1 }; return a.val++;
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 26
+bytecodes: [
+ B(StackCheck),
+ B(CreateObjectLiteral), U8(0), U8(0), U8(5),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(1), U8(1),
+ B(ToNumber),
+ B(Star), R(2),
+ B(Inc),
+ B(StoreICSloppy), R(1), U8(1), U8(3),
+ B(Ldar), R(2),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = { val: 1 }; return --a.val;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 22
+bytecodes: [
+ B(StackCheck),
+ B(CreateObjectLiteral), U8(0), U8(0), U8(5),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(1), U8(1),
+ B(ToNumber),
+ B(Dec),
+ B(StoreICSloppy), R(1), U8(1), U8(3),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var name = 'var'; var a = { val: 1 }; return a[name]--;
+"
+frame size: 5
+parameter count: 1
+bytecode array length: 33
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(0),
+ B(CreateObjectLiteral), U8(1), U8(0), U8(5),
+ B(Star), R(2),
+ B(Star), R(1),
+ B(Star), R(2),
+ B(Ldar), R(0),
+ B(Star), R(3),
+ B(KeyedLoadIC), R(2), U8(1),
+ B(ToNumber),
+ B(Star), R(4),
+ B(Dec),
+ B(KeyedStoreICSloppy), R(2), R(3), U8(3),
+ B(Ldar), R(4),
+ B(Return),
+]
+constant pool: [
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::FIXED_ARRAY_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var name = 'var'; var a = { val: 1 }; return ++a[name];
+"
+frame size: 4
+parameter count: 1
+bytecode array length: 29
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(0),
+ B(CreateObjectLiteral), U8(1), U8(0), U8(5),
+ B(Star), R(2),
+ B(Star), R(1),
+ B(Star), R(2),
+ B(Ldar), R(0),
+ B(Star), R(3),
+ B(KeyedLoadIC), R(2), U8(1),
+ B(ToNumber),
+ B(Inc),
+ B(KeyedStoreICSloppy), R(2), R(3), U8(3),
+ B(Return),
+]
+constant pool: [
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::FIXED_ARRAY_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1; var b = function() { return a }; return ++a;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 27
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(1),
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateClosure), U8(0), U8(0),
+ B(Star), R(0),
+ B(LdaContextSlot), R(context), U8(4),
+ B(ToNumber),
+ B(Inc),
+ B(StaContextSlot), R(context), U8(4),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1; var b = function() { return a }; return a--;
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 31
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(1),
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateClosure), U8(0), U8(0),
+ B(Star), R(0),
+ B(LdaContextSlot), R(context), U8(4),
+ B(ToNumber),
+ B(Star), R(2),
+ B(Dec),
+ B(StaContextSlot), R(context), U8(4),
+ B(Ldar), R(2),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var idx = 1; var a = [1, 2]; return a[idx++] = 2;
+"
+frame size: 4
+parameter count: 1
+bytecode array length: 28
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(CreateArrayLiteral), U8(0), U8(0), U8(3),
+ B(Star), R(1),
+ B(Star), R(2),
+ B(Ldar), R(0),
+ B(ToNumber),
+ B(Star), R(3),
+ B(Inc),
+ B(Star), R(0),
+ B(LdaSmi), U8(2),
+ B(KeyedStoreICSloppy), R(2), R(3), U8(1),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/CreateArguments.golden b/test/cctest/interpreter/bytecode_expectations/CreateArguments.golden
new file mode 100644
index 0000000..ab60ba4
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/CreateArguments.golden
@@ -0,0 +1,148 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: no
+test function name: f
+
+---
+snippet: "
+ function f() { return arguments; }
+ f();
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 7
+bytecodes: [
+ B(CreateMappedArguments),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f() { return arguments[0]; }
+ f();
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 13
+bytecodes: [
+ B(CreateMappedArguments),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaZero),
+ B(KeyedLoadIC), R(1), U8(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f() { 'use strict'; return arguments; }
+ f();
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 7
+bytecodes: [
+ B(CreateUnmappedArguments),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a) { return arguments[0]; }
+ f();
+"
+frame size: 3
+parameter count: 2
+bytecode array length: 25
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(1),
+ B(Ldar), R(arg0),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateMappedArguments),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(LdaZero),
+ B(KeyedLoadIC), R(2), U8(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a, b, c) { return arguments; }
+ f();
+"
+frame size: 2
+parameter count: 4
+bytecode array length: 29
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(1),
+ B(Ldar), R(arg0),
+ B(StaContextSlot), R(context), U8(6),
+ B(Ldar), R(arg1),
+ B(StaContextSlot), R(context), U8(5),
+ B(Ldar), R(arg2),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateMappedArguments),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a, b, c) { 'use strict'; return arguments; }
+ f();
+"
+frame size: 1
+parameter count: 4
+bytecode array length: 7
+bytecodes: [
+ B(CreateUnmappedArguments),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/CreateRestParameter.golden b/test/cctest/interpreter/bytecode_expectations/CreateRestParameter.golden
new file mode 100644
index 0000000..e43a8cd
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/CreateRestParameter.golden
@@ -0,0 +1,116 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: number
+execute: yes
+wrap: no
+test function name: f
+
+---
+snippet: "
+ function f(...restArgs) { return restArgs; }
+ f();
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 7
+bytecodes: [
+ B(CreateRestParameter),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a, ...restArgs) { return restArgs; }
+ f();
+"
+frame size: 2
+parameter count: 2
+bytecode array length: 14
+bytecodes: [
+ B(CreateRestParameter),
+ B(Star), R(0),
+ B(LdaTheHole),
+ B(Star), R(1),
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a, ...restArgs) { return restArgs[0]; }
+ f();
+"
+frame size: 3
+parameter count: 2
+bytecode array length: 20
+bytecodes: [
+ B(CreateRestParameter),
+ B(Star), R(0),
+ B(LdaTheHole),
+ B(Star), R(1),
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(LdaZero),
+ B(KeyedLoadIC), R(2), U8(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a, ...restArgs) { return restArgs[0] + arguments[0]; }
+ f();
+"
+frame size: 5
+parameter count: 2
+bytecode array length: 35
+bytecodes: [
+ B(CreateUnmappedArguments),
+ B(Star), R(0),
+ B(CreateRestParameter),
+ B(Star), R(1),
+ B(LdaTheHole),
+ B(Star), R(2),
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(2),
+ B(Ldar), R(1),
+ B(Star), R(3),
+ B(LdaZero),
+ B(KeyedLoadIC), R(3), U8(1),
+ B(Star), R(4),
+ B(Ldar), R(0),
+ B(Star), R(3),
+ B(LdaZero),
+ B(KeyedLoadIC), R(3), U8(3),
+ B(Add), R(4),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/DeadCodeRemoval.golden b/test/cctest/interpreter/bytecode_expectations/DeadCodeRemoval.golden
new file mode 100644
index 0000000..0c7c176
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/DeadCodeRemoval.golden
@@ -0,0 +1,84 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: number
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ return; var a = 1; a();
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 3
+bytecodes: [
+ B(StackCheck),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ if (false) { return; }; var a = 1;
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 7
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ if (true) { return 1; } else { return 2; };
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 4
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1; if (a) { return 1; }; return 2;
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 13
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(JumpIfToBooleanFalse), U8(5),
+ B(LdaSmi), U8(1),
+ B(Return),
+ B(LdaSmi), U8(2),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/DeclareGlobals.golden b/test/cctest/interpreter/bytecode_expectations/DeclareGlobals.golden
new file mode 100644
index 0000000..bedbe31
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/DeclareGlobals.golden
@@ -0,0 +1,128 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: no
+wrap: no
+top level: yes
+
+---
+snippet: "
+ var a = 1;
+"
+frame size: 4
+parameter count: 1
+bytecode array length: 31
+bytecodes: [
+ B(LdaConstant), U8(0),
+ B(Star), R(1),
+ B(LdaZero),
+ B(Star), R(2),
+ B(CallRuntime), U16(Runtime::kDeclareGlobals), R(1), U8(2),
+ B(StackCheck),
+ B(LdaConstant), U8(1),
+ B(Star), R(1),
+ B(LdaZero),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(3),
+ B(CallRuntime), U16(Runtime::kInitializeVarGlobal), R(1), U8(3),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f() {}
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 15
+bytecodes: [
+ B(LdaConstant), U8(0),
+ B(Star), R(0),
+ B(LdaZero),
+ B(Star), R(1),
+ B(CallRuntime), U16(Runtime::kDeclareGlobals), R(0), U8(2),
+ B(StackCheck),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1;
+ a=2;
+"
+frame size: 4
+parameter count: 1
+bytecode array length: 37
+bytecodes: [
+ B(LdaConstant), U8(0),
+ B(Star), R(1),
+ B(LdaZero),
+ B(Star), R(2),
+ B(CallRuntime), U16(Runtime::kDeclareGlobals), R(1), U8(2),
+ B(StackCheck),
+ B(LdaConstant), U8(1),
+ B(Star), R(1),
+ B(LdaZero),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(3),
+ B(CallRuntime), U16(Runtime::kInitializeVarGlobal), R(1), U8(3),
+ B(LdaSmi), U8(2),
+ B(StaGlobalSloppy), U8(1), U8(3),
+ B(Star), R(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f() {}
+ f();
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 29
+bytecodes: [
+ B(LdaConstant), U8(0),
+ B(Star), R(1),
+ B(LdaZero),
+ B(Star), R(2),
+ B(CallRuntime), U16(Runtime::kDeclareGlobals), R(1), U8(2),
+ B(StackCheck),
+ B(LdaUndefined),
+ B(Star), R(2),
+ B(LdaGlobal), U8(1), U8(1),
+ B(Star), R(1),
+ B(Call), R(1), R(2), U8(1), U8(3),
+ B(Star), R(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/Delete.golden b/test/cctest/interpreter/bytecode_expectations/Delete.golden
new file mode 100644
index 0000000..369c158
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/Delete.golden
@@ -0,0 +1,147 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ var a = {x:13, y:14}; return delete a.x;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 16
+bytecodes: [
+ B(StackCheck),
+ B(CreateObjectLiteral), U8(0), U8(0), U8(5),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaConstant), U8(1),
+ B(DeletePropertySloppy), R(1),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ 'use strict'; var a = {x:13, y:14}; return delete a.x;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 16
+bytecodes: [
+ B(StackCheck),
+ B(CreateObjectLiteral), U8(0), U8(0), U8(5),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaConstant), U8(1),
+ B(DeletePropertyStrict), R(1),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = {1:13, 2:14}; return delete a[2];
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 16
+bytecodes: [
+ B(StackCheck),
+ B(CreateObjectLiteral), U8(0), U8(0), U8(5),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(DeletePropertySloppy), R(1),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 10; return delete a;
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 7
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(10),
+ B(Star), R(0),
+ B(LdaFalse),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ 'use strict';
+ var a = {1:10};
+ (function f1() {return a;});
+ return delete a[1];
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 30
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(0),
+ B(StackCheck),
+ B(CreateObjectLiteral), U8(0), U8(0), U8(5),
+ B(Star), R(1),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateClosure), U8(1), U8(0),
+ B(LdaContextSlot), R(context), U8(4),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(DeletePropertyStrict), R(1),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ return delete 'test';
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 3
+bytecodes: [
+ B(StackCheck),
+ B(LdaTrue),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/DeleteLookupSlotInEval.golden b/test/cctest/interpreter/bytecode_expectations/DeleteLookupSlotInEval.golden
new file mode 100644
index 0000000..b36f421
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/DeleteLookupSlotInEval.golden
@@ -0,0 +1,89 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: no
+test function name: f
+
+---
+snippet: "
+ var f;
+ var x = 1;
+ z = 10;
+ function f1() {
+ var y;
+ eval(\"function t() { delete x; }; f = t; f();\");
+ }
+ f1();
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 12
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(0),
+ B(CallRuntime), U16(Runtime::kDeleteLookupSlot), R(0), U8(1),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "x",
+]
+handlers: [
+]
+
+---
+snippet: "
+ var f;
+ var x = 1;
+ z = 10;
+ function f1() {
+ var y;
+ eval(\"function t() { return delete y; }; f = t; f();\");
+ }
+ f1();
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 3
+bytecodes: [
+ B(StackCheck),
+ B(LdaFalse),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var f;
+ var x = 1;
+ z = 10;
+ function f1() {
+ var y;
+ eval(\"function t() { return delete z; }; f = t; f();\");
+ }
+ f1();
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 11
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(0),
+ B(CallRuntime), U16(Runtime::kDeleteLookupSlot), R(0), U8(1),
+ B(Return),
+]
+constant pool: [
+ "z",
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/DoDebugger.golden b/test/cctest/interpreter/bytecode_expectations/DoDebugger.golden
new file mode 100644
index 0000000..ca26065
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/DoDebugger.golden
@@ -0,0 +1,27 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ debugger;
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 4
+bytecodes: [
+ B(StackCheck),
+ B(Debugger),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/DoExpression.golden b/test/cctest/interpreter/bytecode_expectations/DoExpression.golden
new file mode 100644
index 0000000..b46fa57
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/DoExpression.golden
@@ -0,0 +1,79 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: yes
+do expressions: yes
+
+---
+snippet: "
+ var a = do { }; return a;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 6
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = do { var x = 100; }; return a;
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 11
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(100),
+ B(Star), R(1),
+ B(LdaUndefined),
+ B(Star), R(0),
+ B(Star), R(2),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ while(true) { var a = 10; a = do { ++a; break; }; a = 20; }
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 26
+bytecodes: [
+ B(StackCheck),
+ B(StackCheck),
+ B(LdaSmi), U8(10),
+ B(Star), R(1),
+ B(ToNumber),
+ B(Inc),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Jump), U8(12),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(20),
+ B(Star), R(1),
+ B(Jump), U8(-21),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/Eval.golden b/test/cctest/interpreter/bytecode_expectations/Eval.golden
new file mode 100644
index 0000000..e3e48bc
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/Eval.golden
@@ -0,0 +1,50 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ return eval('1;');
+"
+frame size: 9
+parameter count: 1
+bytecode array length: 65
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(0),
+ B(Ldar), R(this),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateMappedArguments),
+ B(StaContextSlot), R(context), U8(5),
+ B(Ldar), R(new_target),
+ B(StaContextSlot), R(context), U8(6),
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(3),
+ B(CallRuntimeForPair), U16(Runtime::kLoadLookupSlotForCall), R(3), U8(1), R(1),
+ B(LdaConstant), U8(1),
+ B(Star), R(3),
+ B(Mov), R(1), R(4),
+ B(Mov), R(3), R(5),
+ B(Mov), R(closure), R(6),
+ B(LdaZero),
+ B(Star), R(7),
+ B(LdaSmi), U8(30),
+ B(Star), R(8),
+ B(CallRuntime), U16(Runtime::kResolvePossiblyDirectEval), R(4), U8(5),
+ B(Star), R(1),
+ B(Call), R(1), R(2), U8(2), U8(0),
+ B(Return),
+]
+constant pool: [
+ "eval",
+ "1;",
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/ForIn.golden b/test/cctest/interpreter/bytecode_expectations/ForIn.golden
new file mode 100644
index 0000000..9f0c64a
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/ForIn.golden
@@ -0,0 +1,259 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ for (var p in null) {}
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 3
+bytecodes: [
+ B(StackCheck),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ for (var p in undefined) {}
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 3
+bytecodes: [
+ B(StackCheck),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ for (var p in undefined) {}
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 3
+bytecodes: [
+ B(StackCheck),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 'potatoes';
+ for (var p in x) { return p; }
+"
+frame size: 8
+parameter count: 1
+bytecode array length: 45
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(1),
+ B(JumpIfUndefined), U8(38),
+ B(JumpIfNull), U8(36),
+ B(ToObject),
+ B(Star), R(3),
+ B(ForInPrepare), R(4),
+ B(LdaZero),
+ B(Star), R(7),
+ B(ForInDone), R(7), R(6),
+ B(JumpIfTrue), U8(23),
+ B(ForInNext), R(3), R(7), R(4), U8(1),
+ B(JumpIfUndefined), U8(10),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(Return),
+ B(ForInStep), R(7),
+ B(Star), R(7),
+ B(Jump), U8(-24),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 0;
+ for (var p in [1,2,3]) { x += p; }
+"
+frame size: 9
+parameter count: 1
+bytecode array length: 57
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(1),
+ B(CreateArrayLiteral), U8(0), U8(0), U8(3),
+ B(JumpIfUndefined), U8(47),
+ B(JumpIfNull), U8(45),
+ B(ToObject),
+ B(Star), R(3),
+ B(ForInPrepare), R(4),
+ B(LdaZero),
+ B(Star), R(7),
+ B(ForInDone), R(7), R(6),
+ B(JumpIfTrue), U8(32),
+ B(ForInNext), R(3), R(7), R(4), U8(1),
+ B(JumpIfUndefined), U8(19),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(Ldar), R(1),
+ B(Star), R(8),
+ B(Ldar), R(2),
+ B(Add), R(8),
+ B(Star), R(1),
+ B(ForInStep), R(7),
+ B(Star), R(7),
+ B(Jump), U8(-33),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = { 'a': 1, 'b': 2 };
+ for (x['a'] in [10, 20, 30]) {
+ if (x['a'] == 10) continue;
+ if (x['a'] == 20) break;
+ }
+"
+frame size: 8
+parameter count: 1
+bytecode array length: 94
+bytecodes: [
+ B(StackCheck),
+ B(CreateObjectLiteral), U8(0), U8(0), U8(5),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(CreateArrayLiteral), U8(1), U8(1), U8(3),
+ B(JumpIfUndefined), U8(79),
+ B(JumpIfNull), U8(77),
+ B(ToObject),
+ B(Star), R(1),
+ B(ForInPrepare), R(2),
+ B(LdaZero),
+ B(Star), R(5),
+ B(ForInDone), R(5), R(4),
+ B(JumpIfTrue), U8(64),
+ B(ForInNext), R(1), R(5), R(2), U8(9),
+ B(JumpIfUndefined), U8(51),
+ B(Star), R(6),
+ B(Ldar), R(0),
+ B(Star), R(7),
+ B(Ldar), R(6),
+ B(StoreICSloppy), R(7), U8(2), U8(7),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Star), R(6),
+ B(LoadIC), R(6), U8(2), U8(3),
+ B(Star), R(7),
+ B(LdaSmi), U8(10),
+ B(TestEqual), R(7),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(20),
+ B(Ldar), R(0),
+ B(Star), R(6),
+ B(LoadIC), R(6), U8(2), U8(5),
+ B(Star), R(7),
+ B(LdaSmi), U8(20),
+ B(TestEqual), R(7),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(8),
+ B(ForInStep), R(5),
+ B(Star), R(5),
+ B(Jump), U8(-65),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = [ 10, 11, 12 ] ;
+ for (x[0] in [1,2,3]) { return x[3]; }
+"
+frame size: 9
+parameter count: 1
+bytecode array length: 69
+bytecodes: [
+ B(StackCheck),
+ B(CreateArrayLiteral), U8(0), U8(0), U8(3),
+ B(Star), R(0),
+ B(CreateArrayLiteral), U8(1), U8(1), U8(3),
+ B(JumpIfUndefined), U8(56),
+ B(JumpIfNull), U8(54),
+ B(ToObject),
+ B(Star), R(1),
+ B(ForInPrepare), R(2),
+ B(LdaZero),
+ B(Star), R(5),
+ B(ForInDone), R(5), R(4),
+ B(JumpIfTrue), U8(41),
+ B(ForInNext), R(1), R(5), R(2), U8(7),
+ B(JumpIfUndefined), U8(28),
+ B(Star), R(6),
+ B(Ldar), R(0),
+ B(Star), R(7),
+ B(LdaZero),
+ B(Star), R(8),
+ B(Ldar), R(6),
+ B(KeyedStoreICSloppy), R(7), R(8), U8(5),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Star), R(6),
+ B(LdaSmi), U8(3),
+ B(KeyedLoadIC), R(6), U8(3),
+ B(Return),
+ B(ForInStep), R(5),
+ B(Star), R(5),
+ B(Jump), U8(-42),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::FIXED_ARRAY_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/ForOf.golden b/test/cctest/interpreter/bytecode_expectations/ForOf.golden
new file mode 100644
index 0000000..9b10f41
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/ForOf.golden
@@ -0,0 +1,761 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ for (var p of [0, 1, 2]) {}
+"
+frame size: 16
+parameter count: 1
+bytecode array length: 347
+bytecodes: [
+ B(StackCheck),
+ B(LdaUndefined),
+ B(Star), R(4),
+ B(LdaZero),
+ B(Star), R(3),
+ B(Mov), R(context), R(11),
+ B(Mov), R(context), R(12),
+ B(CreateArrayLiteral), U8(0), U8(0), U8(3),
+ B(Star), R(14),
+ B(LdaConstant), U8(1),
+ B(KeyedLoadIC), R(14), U8(3),
+ B(Star), R(13),
+ B(Call), R(13), R(14), U8(1), U8(1),
+ B(Star), R(1),
+ B(Ldar), R(1),
+ B(Star), R(15),
+ B(LoadIC), R(15), U8(2), U8(7),
+ B(Star), R(14),
+ B(Call), R(14), R(15), U8(1), U8(5),
+ B(Star), R(2),
+ B(Star), R(13),
+ B(InvokeIntrinsic), U16(Runtime::k_IsJSReceiver), R(13), U8(1),
+ B(LogicalNot),
+ B(JumpIfFalse), U8(11),
+ B(Ldar), R(2),
+ B(Star), R(13),
+ B(CallRuntime), U16(Runtime::kThrowIteratorResultNotAnObject), R(13), U8(1),
+ B(Ldar), R(2),
+ B(Star), R(13),
+ B(LoadIC), R(13), U8(3), U8(9),
+ B(JumpIfToBooleanTrue), U8(28),
+ B(LdaSmi), U8(2),
+ B(Star), R(3),
+ B(Ldar), R(2),
+ B(Star), R(13),
+ B(LoadIC), R(13), U8(4), U8(11),
+ B(Star), R(0),
+ B(Ldar), R(4),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Star), R(7),
+ B(LdaZero),
+ B(Star), R(3),
+ B(Jump), U8(-70),
+ B(Jump), U8(47),
+ B(Star), R(14),
+ B(LdaConstant), U8(5),
+ B(Star), R(13),
+ B(Ldar), R(closure),
+ B(Star), R(15),
+ B(CallRuntime), U16(Runtime::kPushCatchContext), R(13), U8(3),
+ B(Star), R(12),
+ B(PushContext), R(8),
+ B(Ldar), R(3),
+ B(Star), R(13),
+ B(LdaSmi), U8(2),
+ B(TestEqualStrict), R(13),
+ B(JumpIfFalse), U8(6),
+ B(LdaSmi), U8(1),
+ B(Star), R(3),
+ B(LdaContextSlot), R(context), U8(4),
+ B(Star), R(13),
+ B(CallRuntime), U16(Runtime::kReThrow), R(13), U8(1),
+ B(PopContext), R(8),
+ B(LdaSmi), U8(-1),
+ B(Star), R(9),
+ B(Jump), U8(7),
+ B(Star), R(10),
+ B(LdaZero),
+ B(Star), R(9),
+ B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), R(0), U8(0),
+ B(Star), R(11),
+ B(Ldar), R(3),
+ B(Star), R(12),
+ B(LdaZero),
+ B(TestEqualStrict), R(12),
+ B(JumpIfTrue), U8(9),
+ B(Ldar), R(1),
+ B(Star), R(12),
+ B(LdaUndefined),
+ B(TestEqualStrict), R(12),
+ B(LogicalNot),
+ B(JumpIfFalseConstant), U8(9),
+ B(Ldar), R(1),
+ B(Star), R(12),
+ B(LoadIC), R(12), U8(6), U8(13),
+ B(Star), R(5),
+ B(Star), R(12),
+ B(LdaNull),
+ B(TestEqual), R(12),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(124),
+ B(Ldar), R(3),
+ B(Star), R(12),
+ B(LdaSmi), U8(1),
+ B(TestEqualStrict), R(12),
+ B(JumpIfFalse), U8(79),
+ B(Ldar), R(5),
+ B(TypeOf),
+ B(Star), R(12),
+ B(LdaConstant), U8(7),
+ B(TestEqualStrict), R(12),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(18),
+ B(Wide), B(LdaSmi), U16(139),
+ B(Star), R(12),
+ B(LdaConstant), U8(8),
+ B(Star), R(13),
+ B(CallRuntime), U16(Runtime::kNewTypeError), R(12), U8(2),
+ B(Throw),
+ B(Mov), R(context), R(12),
+ B(Ldar), R(5),
+ B(Star), R(13),
+ B(Ldar), R(1),
+ B(Star), R(14),
+ B(CallRuntime), U16(Runtime::k_Call), R(13), U8(2),
+ B(Jump), U8(30),
+ B(Star), R(14),
+ B(LdaConstant), U8(5),
+ B(Star), R(13),
+ B(Ldar), R(closure),
+ B(Star), R(15),
+ B(CallRuntime), U16(Runtime::kPushCatchContext), R(13), U8(3),
+ B(Star), R(12),
+ B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), R(0), U8(0),
+ B(Ldar), R(12),
+ B(PushContext), R(8),
+ B(PopContext), R(8),
+ B(Jump), U8(37),
+ B(Ldar), R(5),
+ B(Star), R(12),
+ B(Ldar), R(1),
+ B(Star), R(13),
+ B(CallRuntime), U16(Runtime::k_Call), R(12), U8(2),
+ B(Star), R(6),
+ B(Star), R(12),
+ B(InvokeIntrinsic), U16(Runtime::k_IsJSReceiver), R(12), U8(1),
+ B(JumpIfToBooleanFalse), U8(4),
+ B(Jump), U8(11),
+ B(Ldar), R(6),
+ B(Star), R(12),
+ B(CallRuntime), U16(Runtime::kThrowIteratorResultNotAnObject), R(12), U8(1),
+ B(CallRuntime), U16(Runtime::kInterpreterSetPendingMessage), R(11), U8(1),
+ B(LdaZero),
+ B(TestEqualStrict), R(9),
+ B(JumpIfTrue), U8(4),
+ B(Jump), U8(5),
+ B(Ldar), R(10),
+ B(ReThrow),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::SYMBOL_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ kInstanceTypeDontCare,
+]
+handlers: [
+ [10, 152, 158],
+ [13, 105, 107],
+ [250, 263, 265],
+]
+
+---
+snippet: "
+ var x = 'potatoes';
+ for (var p of x) { return p; }
+"
+frame size: 17
+parameter count: 1
+bytecode array length: 363
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(7),
+ B(LdaUndefined),
+ B(Star), R(4),
+ B(LdaZero),
+ B(Star), R(3),
+ B(Mov), R(context), R(12),
+ B(Mov), R(context), R(13),
+ B(Ldar), R(7),
+ B(Star), R(15),
+ B(LdaConstant), U8(1),
+ B(KeyedLoadIC), R(15), U8(3),
+ B(Star), R(14),
+ B(Call), R(14), R(15), U8(1), U8(1),
+ B(Star), R(1),
+ B(Ldar), R(1),
+ B(Star), R(16),
+ B(LoadIC), R(16), U8(2), U8(7),
+ B(Star), R(15),
+ B(Call), R(15), R(16), U8(1), U8(5),
+ B(Star), R(2),
+ B(Star), R(14),
+ B(InvokeIntrinsic), U16(Runtime::k_IsJSReceiver), R(14), U8(1),
+ B(LogicalNot),
+ B(JumpIfFalse), U8(11),
+ B(Ldar), R(2),
+ B(Star), R(14),
+ B(CallRuntime), U16(Runtime::kThrowIteratorResultNotAnObject), R(14), U8(1),
+ B(Ldar), R(2),
+ B(Star), R(14),
+ B(LoadIC), R(14), U8(3), U8(9),
+ B(JumpIfToBooleanTrue), U8(32),
+ B(LdaSmi), U8(2),
+ B(Star), R(3),
+ B(Ldar), R(2),
+ B(Star), R(14),
+ B(LoadIC), R(14), U8(4), U8(11),
+ B(Star), R(0),
+ B(Ldar), R(4),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Star), R(8),
+ B(Star), R(11),
+ B(LdaZero),
+ B(Star), R(10),
+ B(Jump), U8(63),
+ B(Jump), U8(-74),
+ B(Jump), U8(47),
+ B(Star), R(15),
+ B(LdaConstant), U8(5),
+ B(Star), R(14),
+ B(Ldar), R(closure),
+ B(Star), R(16),
+ B(CallRuntime), U16(Runtime::kPushCatchContext), R(14), U8(3),
+ B(Star), R(13),
+ B(PushContext), R(9),
+ B(Ldar), R(3),
+ B(Star), R(14),
+ B(LdaSmi), U8(2),
+ B(TestEqualStrict), R(14),
+ B(JumpIfFalse), U8(6),
+ B(LdaSmi), U8(1),
+ B(Star), R(3),
+ B(LdaContextSlot), R(context), U8(4),
+ B(Star), R(14),
+ B(CallRuntime), U16(Runtime::kReThrow), R(14), U8(1),
+ B(PopContext), R(9),
+ B(LdaSmi), U8(-1),
+ B(Star), R(10),
+ B(Jump), U8(8),
+ B(Star), R(11),
+ B(LdaSmi), U8(1),
+ B(Star), R(10),
+ B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), R(0), U8(0),
+ B(Star), R(12),
+ B(Ldar), R(3),
+ B(Star), R(13),
+ B(LdaZero),
+ B(TestEqualStrict), R(13),
+ B(JumpIfTrue), U8(9),
+ B(Ldar), R(1),
+ B(Star), R(13),
+ B(LdaUndefined),
+ B(TestEqualStrict), R(13),
+ B(LogicalNot),
+ B(JumpIfFalseConstant), U8(9),
+ B(Ldar), R(1),
+ B(Star), R(13),
+ B(LoadIC), R(13), U8(6), U8(13),
+ B(Star), R(5),
+ B(Star), R(13),
+ B(LdaNull),
+ B(TestEqual), R(13),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(124),
+ B(Ldar), R(3),
+ B(Star), R(13),
+ B(LdaSmi), U8(1),
+ B(TestEqualStrict), R(13),
+ B(JumpIfFalse), U8(79),
+ B(Ldar), R(5),
+ B(TypeOf),
+ B(Star), R(13),
+ B(LdaConstant), U8(7),
+ B(TestEqualStrict), R(13),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(18),
+ B(Wide), B(LdaSmi), U16(139),
+ B(Star), R(13),
+ B(LdaConstant), U8(8),
+ B(Star), R(14),
+ B(CallRuntime), U16(Runtime::kNewTypeError), R(13), U8(2),
+ B(Throw),
+ B(Mov), R(context), R(13),
+ B(Ldar), R(5),
+ B(Star), R(14),
+ B(Ldar), R(1),
+ B(Star), R(15),
+ B(CallRuntime), U16(Runtime::k_Call), R(14), U8(2),
+ B(Jump), U8(30),
+ B(Star), R(15),
+ B(LdaConstant), U8(5),
+ B(Star), R(14),
+ B(Ldar), R(closure),
+ B(Star), R(16),
+ B(CallRuntime), U16(Runtime::kPushCatchContext), R(14), U8(3),
+ B(Star), R(13),
+ B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), R(0), U8(0),
+ B(Ldar), R(13),
+ B(PushContext), R(9),
+ B(PopContext), R(9),
+ B(Jump), U8(37),
+ B(Ldar), R(5),
+ B(Star), R(13),
+ B(Ldar), R(1),
+ B(Star), R(14),
+ B(CallRuntime), U16(Runtime::k_Call), R(13), U8(2),
+ B(Star), R(6),
+ B(Star), R(13),
+ B(InvokeIntrinsic), U16(Runtime::k_IsJSReceiver), R(13), U8(1),
+ B(JumpIfToBooleanFalse), U8(4),
+ B(Jump), U8(11),
+ B(Ldar), R(6),
+ B(Star), R(13),
+ B(CallRuntime), U16(Runtime::kThrowIteratorResultNotAnObject), R(13), U8(1),
+ B(CallRuntime), U16(Runtime::kInterpreterSetPendingMessage), R(12), U8(1),
+ B(LdaZero),
+ B(TestEqualStrict), R(10),
+ B(JumpIfTrue), U8(10),
+ B(LdaSmi), U8(1),
+ B(TestEqualStrict), R(10),
+ B(JumpIfTrue), U8(7),
+ B(Jump), U8(8),
+ B(Ldar), R(11),
+ B(Return),
+ B(Ldar), R(11),
+ B(ReThrow),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::SYMBOL_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ kInstanceTypeDontCare,
+]
+handlers: [
+ [14, 158, 164],
+ [17, 111, 113],
+ [257, 270, 272],
+]
+
+---
+snippet: "
+ for (var x of [10, 20, 30]) {
+ if (x == 10) continue;
+ if (x == 20) break;
+ }
+"
+frame size: 16
+parameter count: 1
+bytecode array length: 369
+bytecodes: [
+ B(StackCheck),
+ B(LdaUndefined),
+ B(Star), R(4),
+ B(LdaZero),
+ B(Star), R(3),
+ B(Mov), R(context), R(11),
+ B(Mov), R(context), R(12),
+ B(CreateArrayLiteral), U8(0), U8(0), U8(3),
+ B(Star), R(14),
+ B(LdaConstant), U8(1),
+ B(KeyedLoadIC), R(14), U8(3),
+ B(Star), R(13),
+ B(Call), R(13), R(14), U8(1), U8(1),
+ B(Star), R(1),
+ B(Ldar), R(1),
+ B(Star), R(15),
+ B(LoadIC), R(15), U8(2), U8(7),
+ B(Star), R(14),
+ B(Call), R(14), R(15), U8(1), U8(5),
+ B(Star), R(2),
+ B(Star), R(13),
+ B(InvokeIntrinsic), U16(Runtime::k_IsJSReceiver), R(13), U8(1),
+ B(LogicalNot),
+ B(JumpIfFalse), U8(11),
+ B(Ldar), R(2),
+ B(Star), R(13),
+ B(CallRuntime), U16(Runtime::kThrowIteratorResultNotAnObject), R(13), U8(1),
+ B(Ldar), R(2),
+ B(Star), R(13),
+ B(LoadIC), R(13), U8(3), U8(9),
+ B(JumpIfToBooleanTrue), U8(50),
+ B(LdaSmi), U8(2),
+ B(Star), R(3),
+ B(Ldar), R(2),
+ B(Star), R(13),
+ B(LoadIC), R(13), U8(4), U8(11),
+ B(Star), R(0),
+ B(Ldar), R(4),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Star), R(7),
+ B(Star), R(13),
+ B(LdaSmi), U8(10),
+ B(TestEqual), R(13),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(-75),
+ B(Ldar), R(7),
+ B(Star), R(13),
+ B(LdaSmi), U8(20),
+ B(TestEqual), R(13),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(7),
+ B(LdaZero),
+ B(Star), R(3),
+ B(Jump), U8(-92),
+ B(Jump), U8(47),
+ B(Star), R(14),
+ B(LdaConstant), U8(5),
+ B(Star), R(13),
+ B(Ldar), R(closure),
+ B(Star), R(15),
+ B(CallRuntime), U16(Runtime::kPushCatchContext), R(13), U8(3),
+ B(Star), R(12),
+ B(PushContext), R(8),
+ B(Ldar), R(3),
+ B(Star), R(13),
+ B(LdaSmi), U8(2),
+ B(TestEqualStrict), R(13),
+ B(JumpIfFalse), U8(6),
+ B(LdaSmi), U8(1),
+ B(Star), R(3),
+ B(LdaContextSlot), R(context), U8(4),
+ B(Star), R(13),
+ B(CallRuntime), U16(Runtime::kReThrow), R(13), U8(1),
+ B(PopContext), R(8),
+ B(LdaSmi), U8(-1),
+ B(Star), R(9),
+ B(Jump), U8(7),
+ B(Star), R(10),
+ B(LdaZero),
+ B(Star), R(9),
+ B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), R(0), U8(0),
+ B(Star), R(11),
+ B(Ldar), R(3),
+ B(Star), R(12),
+ B(LdaZero),
+ B(TestEqualStrict), R(12),
+ B(JumpIfTrue), U8(9),
+ B(Ldar), R(1),
+ B(Star), R(12),
+ B(LdaUndefined),
+ B(TestEqualStrict), R(12),
+ B(LogicalNot),
+ B(JumpIfFalseConstant), U8(9),
+ B(Ldar), R(1),
+ B(Star), R(12),
+ B(LoadIC), R(12), U8(6), U8(13),
+ B(Star), R(5),
+ B(Star), R(12),
+ B(LdaNull),
+ B(TestEqual), R(12),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(124),
+ B(Ldar), R(3),
+ B(Star), R(12),
+ B(LdaSmi), U8(1),
+ B(TestEqualStrict), R(12),
+ B(JumpIfFalse), U8(79),
+ B(Ldar), R(5),
+ B(TypeOf),
+ B(Star), R(12),
+ B(LdaConstant), U8(7),
+ B(TestEqualStrict), R(12),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(18),
+ B(Wide), B(LdaSmi), U16(139),
+ B(Star), R(12),
+ B(LdaConstant), U8(8),
+ B(Star), R(13),
+ B(CallRuntime), U16(Runtime::kNewTypeError), R(12), U8(2),
+ B(Throw),
+ B(Mov), R(context), R(12),
+ B(Ldar), R(5),
+ B(Star), R(13),
+ B(Ldar), R(1),
+ B(Star), R(14),
+ B(CallRuntime), U16(Runtime::k_Call), R(13), U8(2),
+ B(Jump), U8(30),
+ B(Star), R(14),
+ B(LdaConstant), U8(5),
+ B(Star), R(13),
+ B(Ldar), R(closure),
+ B(Star), R(15),
+ B(CallRuntime), U16(Runtime::kPushCatchContext), R(13), U8(3),
+ B(Star), R(12),
+ B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), R(0), U8(0),
+ B(Ldar), R(12),
+ B(PushContext), R(8),
+ B(PopContext), R(8),
+ B(Jump), U8(37),
+ B(Ldar), R(5),
+ B(Star), R(12),
+ B(Ldar), R(1),
+ B(Star), R(13),
+ B(CallRuntime), U16(Runtime::k_Call), R(12), U8(2),
+ B(Star), R(6),
+ B(Star), R(12),
+ B(InvokeIntrinsic), U16(Runtime::k_IsJSReceiver), R(12), U8(1),
+ B(JumpIfToBooleanFalse), U8(4),
+ B(Jump), U8(11),
+ B(Ldar), R(6),
+ B(Star), R(12),
+ B(CallRuntime), U16(Runtime::kThrowIteratorResultNotAnObject), R(12), U8(1),
+ B(CallRuntime), U16(Runtime::kInterpreterSetPendingMessage), R(11), U8(1),
+ B(LdaZero),
+ B(TestEqualStrict), R(9),
+ B(JumpIfTrue), U8(4),
+ B(Jump), U8(5),
+ B(Ldar), R(10),
+ B(ReThrow),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::SYMBOL_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ kInstanceTypeDontCare,
+]
+handlers: [
+ [10, 174, 180],
+ [13, 127, 129],
+ [272, 285, 287],
+]
+
+---
+snippet: "
+ var x = { 'a': 1, 'b': 2 };
+ for (x['a'] of [1,2,3]) { return x['a']; }
+"
+frame size: 15
+parameter count: 1
+bytecode array length: 379
+bytecodes: [
+ B(StackCheck),
+ B(CreateObjectLiteral), U8(0), U8(0), U8(5),
+ B(Star), R(8),
+ B(Star), R(6),
+ B(LdaUndefined),
+ B(Star), R(3),
+ B(LdaZero),
+ B(Star), R(2),
+ B(Mov), R(context), R(10),
+ B(Mov), R(context), R(11),
+ B(CreateArrayLiteral), U8(1), U8(1), U8(3),
+ B(Star), R(13),
+ B(LdaConstant), U8(2),
+ B(KeyedLoadIC), R(13), U8(3),
+ B(Star), R(12),
+ B(Call), R(12), R(13), U8(1), U8(1),
+ B(Star), R(0),
+ B(Ldar), R(0),
+ B(Star), R(14),
+ B(LoadIC), R(14), U8(3), U8(7),
+ B(Star), R(13),
+ B(Call), R(13), R(14), U8(1), U8(5),
+ B(Star), R(1),
+ B(Star), R(12),
+ B(InvokeIntrinsic), U16(Runtime::k_IsJSReceiver), R(12), U8(1),
+ B(LogicalNot),
+ B(JumpIfFalse), U8(11),
+ B(Ldar), R(1),
+ B(Star), R(12),
+ B(CallRuntime), U16(Runtime::kThrowIteratorResultNotAnObject), R(12), U8(1),
+ B(Ldar), R(1),
+ B(Star), R(12),
+ B(LoadIC), R(12), U8(4), U8(9),
+ B(JumpIfToBooleanTrue), U8(42),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(Ldar), R(6),
+ B(Star), R(12),
+ B(Ldar), R(1),
+ B(Star), R(13),
+ B(LoadIC), R(13), U8(5), U8(11),
+ B(StoreICSloppy), R(12), U8(6), U8(13),
+ B(Ldar), R(3),
+ B(StackCheck),
+ B(Ldar), R(6),
+ B(Star), R(12),
+ B(LoadIC), R(12), U8(6), U8(15),
+ B(Star), R(9),
+ B(LdaZero),
+ B(Star), R(8),
+ B(Jump), U8(63),
+ B(Jump), U8(-84),
+ B(Jump), U8(47),
+ B(Star), R(13),
+ B(LdaConstant), U8(7),
+ B(Star), R(12),
+ B(Ldar), R(closure),
+ B(Star), R(14),
+ B(CallRuntime), U16(Runtime::kPushCatchContext), R(12), U8(3),
+ B(Star), R(11),
+ B(PushContext), R(7),
+ B(Ldar), R(2),
+ B(Star), R(12),
+ B(LdaSmi), U8(2),
+ B(TestEqualStrict), R(12),
+ B(JumpIfFalse), U8(6),
+ B(LdaSmi), U8(1),
+ B(Star), R(2),
+ B(LdaContextSlot), R(context), U8(4),
+ B(Star), R(12),
+ B(CallRuntime), U16(Runtime::kReThrow), R(12), U8(1),
+ B(PopContext), R(7),
+ B(LdaSmi), U8(-1),
+ B(Star), R(8),
+ B(Jump), U8(8),
+ B(Star), R(9),
+ B(LdaSmi), U8(1),
+ B(Star), R(8),
+ B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), R(0), U8(0),
+ B(Star), R(10),
+ B(Ldar), R(2),
+ B(Star), R(11),
+ B(LdaZero),
+ B(TestEqualStrict), R(11),
+ B(JumpIfTrue), U8(9),
+ B(Ldar), R(0),
+ B(Star), R(11),
+ B(LdaUndefined),
+ B(TestEqualStrict), R(11),
+ B(LogicalNot),
+ B(JumpIfFalseConstant), U8(11),
+ B(Ldar), R(0),
+ B(Star), R(11),
+ B(LoadIC), R(11), U8(8), U8(17),
+ B(Star), R(4),
+ B(Star), R(11),
+ B(LdaNull),
+ B(TestEqual), R(11),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(124),
+ B(Ldar), R(2),
+ B(Star), R(11),
+ B(LdaSmi), U8(1),
+ B(TestEqualStrict), R(11),
+ B(JumpIfFalse), U8(79),
+ B(Ldar), R(4),
+ B(TypeOf),
+ B(Star), R(11),
+ B(LdaConstant), U8(9),
+ B(TestEqualStrict), R(11),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(18),
+ B(Wide), B(LdaSmi), U16(139),
+ B(Star), R(11),
+ B(LdaConstant), U8(10),
+ B(Star), R(12),
+ B(CallRuntime), U16(Runtime::kNewTypeError), R(11), U8(2),
+ B(Throw),
+ B(Mov), R(context), R(11),
+ B(Ldar), R(4),
+ B(Star), R(12),
+ B(Ldar), R(0),
+ B(Star), R(13),
+ B(CallRuntime), U16(Runtime::k_Call), R(12), U8(2),
+ B(Jump), U8(30),
+ B(Star), R(13),
+ B(LdaConstant), U8(7),
+ B(Star), R(12),
+ B(Ldar), R(closure),
+ B(Star), R(14),
+ B(CallRuntime), U16(Runtime::kPushCatchContext), R(12), U8(3),
+ B(Star), R(11),
+ B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), R(0), U8(0),
+ B(Ldar), R(11),
+ B(PushContext), R(7),
+ B(PopContext), R(7),
+ B(Jump), U8(37),
+ B(Ldar), R(4),
+ B(Star), R(11),
+ B(Ldar), R(0),
+ B(Star), R(12),
+ B(CallRuntime), U16(Runtime::k_Call), R(11), U8(2),
+ B(Star), R(5),
+ B(Star), R(11),
+ B(InvokeIntrinsic), U16(Runtime::k_IsJSReceiver), R(11), U8(1),
+ B(JumpIfToBooleanFalse), U8(4),
+ B(Jump), U8(11),
+ B(Ldar), R(5),
+ B(Star), R(11),
+ B(CallRuntime), U16(Runtime::kThrowIteratorResultNotAnObject), R(11), U8(1),
+ B(CallRuntime), U16(Runtime::kInterpreterSetPendingMessage), R(10), U8(1),
+ B(LdaZero),
+ B(TestEqualStrict), R(8),
+ B(JumpIfTrue), U8(10),
+ B(LdaSmi), U8(1),
+ B(TestEqualStrict), R(8),
+ B(JumpIfTrue), U8(7),
+ B(Jump), U8(8),
+ B(Ldar), R(9),
+ B(Return),
+ B(Ldar), R(9),
+ B(ReThrow),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::SYMBOL_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ kInstanceTypeDontCare,
+]
+handlers: [
+ [18, 174, 180],
+ [21, 127, 129],
+ [273, 286, 288],
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/FunctionLiterals.golden b/test/cctest/interpreter/bytecode_expectations/FunctionLiterals.golden
new file mode 100644
index 0000000..fe7176c
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/FunctionLiterals.golden
@@ -0,0 +1,73 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ return function(){ }
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 5
+bytecodes: [
+ B(StackCheck),
+ B(CreateClosure), U8(0), U8(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ return (function(){ })()
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 15
+bytecodes: [
+ B(StackCheck),
+ B(LdaUndefined),
+ B(Star), R(1),
+ B(CreateClosure), U8(0), U8(0),
+ B(Star), R(0),
+ B(Call), R(0), R(1), U8(1), U8(1),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ return (function(x){ return x; })(1)
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 19
+bytecodes: [
+ B(StackCheck),
+ B(LdaUndefined),
+ B(Star), R(1),
+ B(CreateClosure), U8(0), U8(0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(Star), R(2),
+ B(Call), R(0), R(1), U8(2), U8(1),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/GlobalCompoundExpressions.golden b/test/cctest/interpreter/bytecode_expectations/GlobalCompoundExpressions.golden
new file mode 100644
index 0000000..42a2c5b
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/GlobalCompoundExpressions.golden
@@ -0,0 +1,58 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: no
+test function name: f
+
+---
+snippet: "
+ var global = 1;
+ function f() { return global &= 1; }
+ f();
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 14
+bytecodes: [
+ B(StackCheck),
+ B(LdaGlobal), U8(0), U8(1),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(BitwiseAnd), R(0),
+ B(StaGlobalSloppy), U8(0), U8(3),
+ B(Return),
+]
+constant pool: [
+ "global",
+]
+handlers: [
+]
+
+---
+snippet: "
+ unallocated = 1;
+ function f() { return unallocated += 1; }
+ f();
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 14
+bytecodes: [
+ B(StackCheck),
+ B(LdaGlobal), U8(0), U8(1),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(Add), R(0),
+ B(StaGlobalSloppy), U8(0), U8(3),
+ B(Return),
+]
+constant pool: [
+ "unallocated",
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/GlobalCountOperators.golden b/test/cctest/interpreter/bytecode_expectations/GlobalCountOperators.golden
new file mode 100644
index 0000000..7d64503
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/GlobalCountOperators.golden
@@ -0,0 +1,106 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: no
+test function name: f
+
+---
+snippet: "
+ var global = 1;
+ function f() { return ++global; }
+ f();
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 10
+bytecodes: [
+ B(StackCheck),
+ B(LdaGlobal), U8(0), U8(1),
+ B(ToNumber),
+ B(Inc),
+ B(StaGlobalSloppy), U8(0), U8(3),
+ B(Return),
+]
+constant pool: [
+ "global",
+]
+handlers: [
+]
+
+---
+snippet: "
+ var global = 1;
+ function f() { return global--; }
+ f();
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 14
+bytecodes: [
+ B(StackCheck),
+ B(LdaGlobal), U8(0), U8(1),
+ B(ToNumber),
+ B(Star), R(0),
+ B(Dec),
+ B(StaGlobalSloppy), U8(0), U8(3),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+ "global",
+]
+handlers: [
+]
+
+---
+snippet: "
+ unallocated = 1;
+ function f() { 'use strict'; return --unallocated; }
+ f();
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 10
+bytecodes: [
+ B(StackCheck),
+ B(LdaGlobal), U8(0), U8(1),
+ B(ToNumber),
+ B(Dec),
+ B(StaGlobalStrict), U8(0), U8(3),
+ B(Return),
+]
+constant pool: [
+ "unallocated",
+]
+handlers: [
+]
+
+---
+snippet: "
+ unallocated = 1;
+ function f() { return unallocated++; }
+ f();
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 14
+bytecodes: [
+ B(StackCheck),
+ B(LdaGlobal), U8(0), U8(1),
+ B(ToNumber),
+ B(Star), R(0),
+ B(Inc),
+ B(StaGlobalSloppy), U8(0), U8(3),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+ "unallocated",
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/GlobalDelete.golden b/test/cctest/interpreter/bytecode_expectations/GlobalDelete.golden
new file mode 100644
index 0000000..ffed12e
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/GlobalDelete.golden
@@ -0,0 +1,116 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: no
+test function name: f
+
+---
+snippet: "
+ var a = {x:13, y:14};
+ function f() {
+ return delete a.x;
+ };
+ f();
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 11
+bytecodes: [
+ B(StackCheck),
+ B(LdaGlobal), U8(0), U8(1),
+ B(Star), R(0),
+ B(LdaConstant), U8(1),
+ B(DeletePropertySloppy), R(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ a = {1:13, 2:14};
+ function f() {
+ 'use strict';
+ return delete a[1];
+ };
+ f();
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 11
+bytecodes: [
+ B(StackCheck),
+ B(LdaGlobal), U8(0), U8(1),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(DeletePropertyStrict), R(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = {x:13, y:14};
+ function f() {
+ return delete a;
+ };
+ f();
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 16
+bytecodes: [
+ B(StackCheck),
+ B(LdaContextSlot), R(context), U8(3),
+ B(Star), R(0),
+ B(LdaContextSlot), R(0), U8(2),
+ B(Star), R(1),
+ B(LdaConstant), U8(0),
+ B(DeletePropertySloppy), R(1),
+ B(Return),
+]
+constant pool: [
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ b = 30;
+ function f() {
+ return delete b;
+ };
+ f();
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 16
+bytecodes: [
+ B(StackCheck),
+ B(LdaContextSlot), R(context), U8(3),
+ B(Star), R(0),
+ B(LdaContextSlot), R(0), U8(2),
+ B(Star), R(1),
+ B(LdaConstant), U8(0),
+ B(DeletePropertySloppy), R(1),
+ B(Return),
+]
+constant pool: [
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/HeapNumberConstants.golden b/test/cctest/interpreter/bytecode_expectations/HeapNumberConstants.golden
new file mode 100644
index 0000000..2ff2485
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/HeapNumberConstants.golden
@@ -0,0 +1,1113 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: number
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ return 1.2;
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 4
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Return),
+]
+constant pool: [
+ 1.2,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1.2; return 2.6;
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 8
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(0),
+ B(LdaConstant), U8(1),
+ B(Return),
+]
+constant pool: [
+ 1.2,
+ 2.6,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 3.14; return 3.14;
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 8
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(0),
+ B(LdaConstant), U8(1),
+ B(Return),
+]
+constant pool: [
+ 3.14,
+ 3.14,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414;
+ a = 1.414; a = 3.14;
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 1033
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(0),
+ B(LdaConstant), U8(1),
+ B(Star), R(0),
+ B(LdaConstant), U8(2),
+ B(Star), R(0),
+ B(LdaConstant), U8(3),
+ B(Star), R(0),
+ B(LdaConstant), U8(4),
+ B(Star), R(0),
+ B(LdaConstant), U8(5),
+ B(Star), R(0),
+ B(LdaConstant), U8(6),
+ B(Star), R(0),
+ B(LdaConstant), U8(7),
+ B(Star), R(0),
+ B(LdaConstant), U8(8),
+ B(Star), R(0),
+ B(LdaConstant), U8(9),
+ B(Star), R(0),
+ B(LdaConstant), U8(10),
+ B(Star), R(0),
+ B(LdaConstant), U8(11),
+ B(Star), R(0),
+ B(LdaConstant), U8(12),
+ B(Star), R(0),
+ B(LdaConstant), U8(13),
+ B(Star), R(0),
+ B(LdaConstant), U8(14),
+ B(Star), R(0),
+ B(LdaConstant), U8(15),
+ B(Star), R(0),
+ B(LdaConstant), U8(16),
+ B(Star), R(0),
+ B(LdaConstant), U8(17),
+ B(Star), R(0),
+ B(LdaConstant), U8(18),
+ B(Star), R(0),
+ B(LdaConstant), U8(19),
+ B(Star), R(0),
+ B(LdaConstant), U8(20),
+ B(Star), R(0),
+ B(LdaConstant), U8(21),
+ B(Star), R(0),
+ B(LdaConstant), U8(22),
+ B(Star), R(0),
+ B(LdaConstant), U8(23),
+ B(Star), R(0),
+ B(LdaConstant), U8(24),
+ B(Star), R(0),
+ B(LdaConstant), U8(25),
+ B(Star), R(0),
+ B(LdaConstant), U8(26),
+ B(Star), R(0),
+ B(LdaConstant), U8(27),
+ B(Star), R(0),
+ B(LdaConstant), U8(28),
+ B(Star), R(0),
+ B(LdaConstant), U8(29),
+ B(Star), R(0),
+ B(LdaConstant), U8(30),
+ B(Star), R(0),
+ B(LdaConstant), U8(31),
+ B(Star), R(0),
+ B(LdaConstant), U8(32),
+ B(Star), R(0),
+ B(LdaConstant), U8(33),
+ B(Star), R(0),
+ B(LdaConstant), U8(34),
+ B(Star), R(0),
+ B(LdaConstant), U8(35),
+ B(Star), R(0),
+ B(LdaConstant), U8(36),
+ B(Star), R(0),
+ B(LdaConstant), U8(37),
+ B(Star), R(0),
+ B(LdaConstant), U8(38),
+ B(Star), R(0),
+ B(LdaConstant), U8(39),
+ B(Star), R(0),
+ B(LdaConstant), U8(40),
+ B(Star), R(0),
+ B(LdaConstant), U8(41),
+ B(Star), R(0),
+ B(LdaConstant), U8(42),
+ B(Star), R(0),
+ B(LdaConstant), U8(43),
+ B(Star), R(0),
+ B(LdaConstant), U8(44),
+ B(Star), R(0),
+ B(LdaConstant), U8(45),
+ B(Star), R(0),
+ B(LdaConstant), U8(46),
+ B(Star), R(0),
+ B(LdaConstant), U8(47),
+ B(Star), R(0),
+ B(LdaConstant), U8(48),
+ B(Star), R(0),
+ B(LdaConstant), U8(49),
+ B(Star), R(0),
+ B(LdaConstant), U8(50),
+ B(Star), R(0),
+ B(LdaConstant), U8(51),
+ B(Star), R(0),
+ B(LdaConstant), U8(52),
+ B(Star), R(0),
+ B(LdaConstant), U8(53),
+ B(Star), R(0),
+ B(LdaConstant), U8(54),
+ B(Star), R(0),
+ B(LdaConstant), U8(55),
+ B(Star), R(0),
+ B(LdaConstant), U8(56),
+ B(Star), R(0),
+ B(LdaConstant), U8(57),
+ B(Star), R(0),
+ B(LdaConstant), U8(58),
+ B(Star), R(0),
+ B(LdaConstant), U8(59),
+ B(Star), R(0),
+ B(LdaConstant), U8(60),
+ B(Star), R(0),
+ B(LdaConstant), U8(61),
+ B(Star), R(0),
+ B(LdaConstant), U8(62),
+ B(Star), R(0),
+ B(LdaConstant), U8(63),
+ B(Star), R(0),
+ B(LdaConstant), U8(64),
+ B(Star), R(0),
+ B(LdaConstant), U8(65),
+ B(Star), R(0),
+ B(LdaConstant), U8(66),
+ B(Star), R(0),
+ B(LdaConstant), U8(67),
+ B(Star), R(0),
+ B(LdaConstant), U8(68),
+ B(Star), R(0),
+ B(LdaConstant), U8(69),
+ B(Star), R(0),
+ B(LdaConstant), U8(70),
+ B(Star), R(0),
+ B(LdaConstant), U8(71),
+ B(Star), R(0),
+ B(LdaConstant), U8(72),
+ B(Star), R(0),
+ B(LdaConstant), U8(73),
+ B(Star), R(0),
+ B(LdaConstant), U8(74),
+ B(Star), R(0),
+ B(LdaConstant), U8(75),
+ B(Star), R(0),
+ B(LdaConstant), U8(76),
+ B(Star), R(0),
+ B(LdaConstant), U8(77),
+ B(Star), R(0),
+ B(LdaConstant), U8(78),
+ B(Star), R(0),
+ B(LdaConstant), U8(79),
+ B(Star), R(0),
+ B(LdaConstant), U8(80),
+ B(Star), R(0),
+ B(LdaConstant), U8(81),
+ B(Star), R(0),
+ B(LdaConstant), U8(82),
+ B(Star), R(0),
+ B(LdaConstant), U8(83),
+ B(Star), R(0),
+ B(LdaConstant), U8(84),
+ B(Star), R(0),
+ B(LdaConstant), U8(85),
+ B(Star), R(0),
+ B(LdaConstant), U8(86),
+ B(Star), R(0),
+ B(LdaConstant), U8(87),
+ B(Star), R(0),
+ B(LdaConstant), U8(88),
+ B(Star), R(0),
+ B(LdaConstant), U8(89),
+ B(Star), R(0),
+ B(LdaConstant), U8(90),
+ B(Star), R(0),
+ B(LdaConstant), U8(91),
+ B(Star), R(0),
+ B(LdaConstant), U8(92),
+ B(Star), R(0),
+ B(LdaConstant), U8(93),
+ B(Star), R(0),
+ B(LdaConstant), U8(94),
+ B(Star), R(0),
+ B(LdaConstant), U8(95),
+ B(Star), R(0),
+ B(LdaConstant), U8(96),
+ B(Star), R(0),
+ B(LdaConstant), U8(97),
+ B(Star), R(0),
+ B(LdaConstant), U8(98),
+ B(Star), R(0),
+ B(LdaConstant), U8(99),
+ B(Star), R(0),
+ B(LdaConstant), U8(100),
+ B(Star), R(0),
+ B(LdaConstant), U8(101),
+ B(Star), R(0),
+ B(LdaConstant), U8(102),
+ B(Star), R(0),
+ B(LdaConstant), U8(103),
+ B(Star), R(0),
+ B(LdaConstant), U8(104),
+ B(Star), R(0),
+ B(LdaConstant), U8(105),
+ B(Star), R(0),
+ B(LdaConstant), U8(106),
+ B(Star), R(0),
+ B(LdaConstant), U8(107),
+ B(Star), R(0),
+ B(LdaConstant), U8(108),
+ B(Star), R(0),
+ B(LdaConstant), U8(109),
+ B(Star), R(0),
+ B(LdaConstant), U8(110),
+ B(Star), R(0),
+ B(LdaConstant), U8(111),
+ B(Star), R(0),
+ B(LdaConstant), U8(112),
+ B(Star), R(0),
+ B(LdaConstant), U8(113),
+ B(Star), R(0),
+ B(LdaConstant), U8(114),
+ B(Star), R(0),
+ B(LdaConstant), U8(115),
+ B(Star), R(0),
+ B(LdaConstant), U8(116),
+ B(Star), R(0),
+ B(LdaConstant), U8(117),
+ B(Star), R(0),
+ B(LdaConstant), U8(118),
+ B(Star), R(0),
+ B(LdaConstant), U8(119),
+ B(Star), R(0),
+ B(LdaConstant), U8(120),
+ B(Star), R(0),
+ B(LdaConstant), U8(121),
+ B(Star), R(0),
+ B(LdaConstant), U8(122),
+ B(Star), R(0),
+ B(LdaConstant), U8(123),
+ B(Star), R(0),
+ B(LdaConstant), U8(124),
+ B(Star), R(0),
+ B(LdaConstant), U8(125),
+ B(Star), R(0),
+ B(LdaConstant), U8(126),
+ B(Star), R(0),
+ B(LdaConstant), U8(127),
+ B(Star), R(0),
+ B(LdaConstant), U8(128),
+ B(Star), R(0),
+ B(LdaConstant), U8(129),
+ B(Star), R(0),
+ B(LdaConstant), U8(130),
+ B(Star), R(0),
+ B(LdaConstant), U8(131),
+ B(Star), R(0),
+ B(LdaConstant), U8(132),
+ B(Star), R(0),
+ B(LdaConstant), U8(133),
+ B(Star), R(0),
+ B(LdaConstant), U8(134),
+ B(Star), R(0),
+ B(LdaConstant), U8(135),
+ B(Star), R(0),
+ B(LdaConstant), U8(136),
+ B(Star), R(0),
+ B(LdaConstant), U8(137),
+ B(Star), R(0),
+ B(LdaConstant), U8(138),
+ B(Star), R(0),
+ B(LdaConstant), U8(139),
+ B(Star), R(0),
+ B(LdaConstant), U8(140),
+ B(Star), R(0),
+ B(LdaConstant), U8(141),
+ B(Star), R(0),
+ B(LdaConstant), U8(142),
+ B(Star), R(0),
+ B(LdaConstant), U8(143),
+ B(Star), R(0),
+ B(LdaConstant), U8(144),
+ B(Star), R(0),
+ B(LdaConstant), U8(145),
+ B(Star), R(0),
+ B(LdaConstant), U8(146),
+ B(Star), R(0),
+ B(LdaConstant), U8(147),
+ B(Star), R(0),
+ B(LdaConstant), U8(148),
+ B(Star), R(0),
+ B(LdaConstant), U8(149),
+ B(Star), R(0),
+ B(LdaConstant), U8(150),
+ B(Star), R(0),
+ B(LdaConstant), U8(151),
+ B(Star), R(0),
+ B(LdaConstant), U8(152),
+ B(Star), R(0),
+ B(LdaConstant), U8(153),
+ B(Star), R(0),
+ B(LdaConstant), U8(154),
+ B(Star), R(0),
+ B(LdaConstant), U8(155),
+ B(Star), R(0),
+ B(LdaConstant), U8(156),
+ B(Star), R(0),
+ B(LdaConstant), U8(157),
+ B(Star), R(0),
+ B(LdaConstant), U8(158),
+ B(Star), R(0),
+ B(LdaConstant), U8(159),
+ B(Star), R(0),
+ B(LdaConstant), U8(160),
+ B(Star), R(0),
+ B(LdaConstant), U8(161),
+ B(Star), R(0),
+ B(LdaConstant), U8(162),
+ B(Star), R(0),
+ B(LdaConstant), U8(163),
+ B(Star), R(0),
+ B(LdaConstant), U8(164),
+ B(Star), R(0),
+ B(LdaConstant), U8(165),
+ B(Star), R(0),
+ B(LdaConstant), U8(166),
+ B(Star), R(0),
+ B(LdaConstant), U8(167),
+ B(Star), R(0),
+ B(LdaConstant), U8(168),
+ B(Star), R(0),
+ B(LdaConstant), U8(169),
+ B(Star), R(0),
+ B(LdaConstant), U8(170),
+ B(Star), R(0),
+ B(LdaConstant), U8(171),
+ B(Star), R(0),
+ B(LdaConstant), U8(172),
+ B(Star), R(0),
+ B(LdaConstant), U8(173),
+ B(Star), R(0),
+ B(LdaConstant), U8(174),
+ B(Star), R(0),
+ B(LdaConstant), U8(175),
+ B(Star), R(0),
+ B(LdaConstant), U8(176),
+ B(Star), R(0),
+ B(LdaConstant), U8(177),
+ B(Star), R(0),
+ B(LdaConstant), U8(178),
+ B(Star), R(0),
+ B(LdaConstant), U8(179),
+ B(Star), R(0),
+ B(LdaConstant), U8(180),
+ B(Star), R(0),
+ B(LdaConstant), U8(181),
+ B(Star), R(0),
+ B(LdaConstant), U8(182),
+ B(Star), R(0),
+ B(LdaConstant), U8(183),
+ B(Star), R(0),
+ B(LdaConstant), U8(184),
+ B(Star), R(0),
+ B(LdaConstant), U8(185),
+ B(Star), R(0),
+ B(LdaConstant), U8(186),
+ B(Star), R(0),
+ B(LdaConstant), U8(187),
+ B(Star), R(0),
+ B(LdaConstant), U8(188),
+ B(Star), R(0),
+ B(LdaConstant), U8(189),
+ B(Star), R(0),
+ B(LdaConstant), U8(190),
+ B(Star), R(0),
+ B(LdaConstant), U8(191),
+ B(Star), R(0),
+ B(LdaConstant), U8(192),
+ B(Star), R(0),
+ B(LdaConstant), U8(193),
+ B(Star), R(0),
+ B(LdaConstant), U8(194),
+ B(Star), R(0),
+ B(LdaConstant), U8(195),
+ B(Star), R(0),
+ B(LdaConstant), U8(196),
+ B(Star), R(0),
+ B(LdaConstant), U8(197),
+ B(Star), R(0),
+ B(LdaConstant), U8(198),
+ B(Star), R(0),
+ B(LdaConstant), U8(199),
+ B(Star), R(0),
+ B(LdaConstant), U8(200),
+ B(Star), R(0),
+ B(LdaConstant), U8(201),
+ B(Star), R(0),
+ B(LdaConstant), U8(202),
+ B(Star), R(0),
+ B(LdaConstant), U8(203),
+ B(Star), R(0),
+ B(LdaConstant), U8(204),
+ B(Star), R(0),
+ B(LdaConstant), U8(205),
+ B(Star), R(0),
+ B(LdaConstant), U8(206),
+ B(Star), R(0),
+ B(LdaConstant), U8(207),
+ B(Star), R(0),
+ B(LdaConstant), U8(208),
+ B(Star), R(0),
+ B(LdaConstant), U8(209),
+ B(Star), R(0),
+ B(LdaConstant), U8(210),
+ B(Star), R(0),
+ B(LdaConstant), U8(211),
+ B(Star), R(0),
+ B(LdaConstant), U8(212),
+ B(Star), R(0),
+ B(LdaConstant), U8(213),
+ B(Star), R(0),
+ B(LdaConstant), U8(214),
+ B(Star), R(0),
+ B(LdaConstant), U8(215),
+ B(Star), R(0),
+ B(LdaConstant), U8(216),
+ B(Star), R(0),
+ B(LdaConstant), U8(217),
+ B(Star), R(0),
+ B(LdaConstant), U8(218),
+ B(Star), R(0),
+ B(LdaConstant), U8(219),
+ B(Star), R(0),
+ B(LdaConstant), U8(220),
+ B(Star), R(0),
+ B(LdaConstant), U8(221),
+ B(Star), R(0),
+ B(LdaConstant), U8(222),
+ B(Star), R(0),
+ B(LdaConstant), U8(223),
+ B(Star), R(0),
+ B(LdaConstant), U8(224),
+ B(Star), R(0),
+ B(LdaConstant), U8(225),
+ B(Star), R(0),
+ B(LdaConstant), U8(226),
+ B(Star), R(0),
+ B(LdaConstant), U8(227),
+ B(Star), R(0),
+ B(LdaConstant), U8(228),
+ B(Star), R(0),
+ B(LdaConstant), U8(229),
+ B(Star), R(0),
+ B(LdaConstant), U8(230),
+ B(Star), R(0),
+ B(LdaConstant), U8(231),
+ B(Star), R(0),
+ B(LdaConstant), U8(232),
+ B(Star), R(0),
+ B(LdaConstant), U8(233),
+ B(Star), R(0),
+ B(LdaConstant), U8(234),
+ B(Star), R(0),
+ B(LdaConstant), U8(235),
+ B(Star), R(0),
+ B(LdaConstant), U8(236),
+ B(Star), R(0),
+ B(LdaConstant), U8(237),
+ B(Star), R(0),
+ B(LdaConstant), U8(238),
+ B(Star), R(0),
+ B(LdaConstant), U8(239),
+ B(Star), R(0),
+ B(LdaConstant), U8(240),
+ B(Star), R(0),
+ B(LdaConstant), U8(241),
+ B(Star), R(0),
+ B(LdaConstant), U8(242),
+ B(Star), R(0),
+ B(LdaConstant), U8(243),
+ B(Star), R(0),
+ B(LdaConstant), U8(244),
+ B(Star), R(0),
+ B(LdaConstant), U8(245),
+ B(Star), R(0),
+ B(LdaConstant), U8(246),
+ B(Star), R(0),
+ B(LdaConstant), U8(247),
+ B(Star), R(0),
+ B(LdaConstant), U8(248),
+ B(Star), R(0),
+ B(LdaConstant), U8(249),
+ B(Star), R(0),
+ B(LdaConstant), U8(250),
+ B(Star), R(0),
+ B(LdaConstant), U8(251),
+ B(Star), R(0),
+ B(LdaConstant), U8(252),
+ B(Star), R(0),
+ B(LdaConstant), U8(253),
+ B(Star), R(0),
+ B(LdaConstant), U8(254),
+ B(Star), R(0),
+ B(LdaConstant), U8(255),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(256),
+ B(Star), R(0),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 1.414,
+ 3.14,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/IfConditions.golden b/test/cctest/interpreter/bytecode_expectations/IfConditions.golden
new file mode 100644
index 0000000..f450f3f
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/IfConditions.golden
@@ -0,0 +1,765 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: number
+execute: yes
+wrap: no
+test function name: f
+
+---
+snippet: "
+ function f() {
+ if (0) {
+ return 1;
+ } else {
+ return -1;
+ }
+ };
+ f();
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 4
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(-1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f() {
+ if ('lucky') {
+ return 1;
+ } else {
+ return -1;
+ }
+ };
+ f();
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 4
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f() {
+ if (false) {
+ return 1;
+ } else {
+ return -1;
+ }
+ };
+ f();
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 4
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(-1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f() {
+ if (false) {
+ return 1;
+ }
+ };
+ f();
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 3
+bytecodes: [
+ B(StackCheck),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f() {
+ var a = 1;
+ if (a) {
+ a += 1;
+ } else {
+ return 2;
+ }
+ };
+ f();
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 24
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(JumpIfToBooleanFalse), U8(14),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(Add), R(1),
+ B(Star), R(0),
+ B(Jump), U8(5),
+ B(LdaSmi), U8(2),
+ B(Return),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a) {
+ if (a <= 0) {
+ return 200;
+ } else {
+ return -200;
+ }
+ };
+ f(99);
+"
+frame size: 1
+parameter count: 2
+bytecode array length: 22
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaZero),
+ B(TestLessThanOrEqual), R(0),
+ B(JumpIfFalse), U8(7),
+ B(Wide), B(LdaSmi), U16(200),
+ B(Return),
+ B(Wide), B(LdaSmi), U16(-200),
+ B(Return),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a, b) { if (a in b) { return 200; } }f('prop', { prop: 'yes'});
+"
+frame size: 1
+parameter count: 3
+bytecode array length: 18
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(TestIn), R(0),
+ B(JumpIfFalse), U8(7),
+ B(Wide), B(LdaSmi), U16(200),
+ B(Return),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(z) { var a = 0; var b = 0; if (a === 0.01) {
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ return 200; } else { return -200; } } f(0.001);
+"
+frame size: 3
+parameter count: 2
+bytecode array length: 287
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(LdaZero),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(LdaConstant), U8(0),
+ B(TestEqualStrict), R(2),
+ B(JumpIfFalseConstant), U8(1),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Wide), B(LdaSmi), U16(200),
+ B(Return),
+ B(Wide), B(LdaSmi), U16(-200),
+ B(Return),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ 0.01,
+ 265,
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f() {
+ var a = 0; var b = 0;
+ if (a) {
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ b = a; a = b;
+ return 200; } else { return -200; }
+ };
+ f();
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 281
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(LdaZero),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(JumpIfToBooleanFalseConstant), U8(0),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Wide), B(LdaSmi), U16(200),
+ B(Return),
+ B(Wide), B(LdaSmi), U16(-200),
+ B(Return),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ 265,
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a, b) {
+ if (a == b) { return 1; }
+ if (a === b) { return 1; }
+ if (a < b) { return 1; }
+ if (a > b) { return 1; }
+ if (a <= b) { return 1; }
+ if (a >= b) { return 1; }
+ if (a in b) { return 1; }
+ if (a instanceof b) { return 1; }
+ return 0;
+ }
+ f(1, 1);
+"
+frame size: 1
+parameter count: 3
+bytecode array length: 107
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(TestEqual), R(0),
+ B(JumpIfFalse), U8(5),
+ B(LdaSmi), U8(1),
+ B(Return),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(TestEqualStrict), R(0),
+ B(JumpIfFalse), U8(5),
+ B(LdaSmi), U8(1),
+ B(Return),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(TestLessThan), R(0),
+ B(JumpIfFalse), U8(5),
+ B(LdaSmi), U8(1),
+ B(Return),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(TestGreaterThan), R(0),
+ B(JumpIfFalse), U8(5),
+ B(LdaSmi), U8(1),
+ B(Return),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(TestLessThanOrEqual), R(0),
+ B(JumpIfFalse), U8(5),
+ B(LdaSmi), U8(1),
+ B(Return),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(TestGreaterThanOrEqual), R(0),
+ B(JumpIfFalse), U8(5),
+ B(LdaSmi), U8(1),
+ B(Return),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(TestIn), R(0),
+ B(JumpIfFalse), U8(5),
+ B(LdaSmi), U8(1),
+ B(Return),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(TestInstanceOf), R(0),
+ B(JumpIfFalse), U8(5),
+ B(LdaSmi), U8(1),
+ B(Return),
+ B(LdaZero),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f() {
+ var a = 0;
+ if (a) {
+ return 20;
+ } else {
+ return -20;
+ }
+ };
+ f();
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 14
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(JumpIfToBooleanFalse), U8(5),
+ B(LdaSmi), U8(20),
+ B(Return),
+ B(LdaSmi), U8(-20),
+ B(Return),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/IntegerConstants.golden b/test/cctest/interpreter/bytecode_expectations/IntegerConstants.golden
new file mode 100644
index 0000000..1c37c12
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/IntegerConstants.golden
@@ -0,0 +1,64 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: number
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ return 12345678;
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 8
+bytecodes: [
+ B(StackCheck),
+ B(ExtraWide), B(LdaSmi), U32(12345678),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1234; return 5678;
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 12
+bytecodes: [
+ B(StackCheck),
+ B(Wide), B(LdaSmi), U16(1234),
+ B(Star), R(0),
+ B(Wide), B(LdaSmi), U16(5678),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1234; return 1234;
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 12
+bytecodes: [
+ B(StackCheck),
+ B(Wide), B(LdaSmi), U16(1234),
+ B(Star), R(0),
+ B(Wide), B(LdaSmi), U16(1234),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/JumpsRequiringConstantWideOperands.golden b/test/cctest/interpreter/bytecode_expectations/JumpsRequiringConstantWideOperands.golden
new file mode 100644
index 0000000..3f0b49d
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/JumpsRequiringConstantWideOperands.golden
@@ -0,0 +1,1304 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: number
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.1;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.2;
+ var x = 0.3;
+ var x = 0.3;
+ var x = 0.3;
+ var x = 0.3;
+ var x = 0.3;
+ var x = 0.3;
+ var x = 0.3;
+ var x = 0.3;
+ var x = 0.3;
+ var x = 0.3;
+ var x = 0.3;
+ var x = 0.3;
+ var x = 0.3;
+ var x = 0.3;
+ var x = 0.3;
+ var x = 0.3;
+ var x = 0.4;
+ var x = 0.4;
+ var x = 0.4;
+ var x = 0.4;
+ var x = 0.4;
+ var x = 0.4;
+ var x = 0.4;
+ var x = 0.4;
+ for (var i = 0; i < 3; i++) {
+ if (i == 1) continue;
+ if (i == 2) break;
+ }
+ return 3;
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 1422
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(0),
+ B(LdaConstant), U8(1),
+ B(Star), R(0),
+ B(LdaConstant), U8(2),
+ B(Star), R(0),
+ B(LdaConstant), U8(3),
+ B(Star), R(0),
+ B(LdaConstant), U8(4),
+ B(Star), R(0),
+ B(LdaConstant), U8(5),
+ B(Star), R(0),
+ B(LdaConstant), U8(6),
+ B(Star), R(0),
+ B(LdaConstant), U8(7),
+ B(Star), R(0),
+ B(LdaConstant), U8(8),
+ B(Star), R(0),
+ B(LdaConstant), U8(9),
+ B(Star), R(0),
+ B(LdaConstant), U8(10),
+ B(Star), R(0),
+ B(LdaConstant), U8(11),
+ B(Star), R(0),
+ B(LdaConstant), U8(12),
+ B(Star), R(0),
+ B(LdaConstant), U8(13),
+ B(Star), R(0),
+ B(LdaConstant), U8(14),
+ B(Star), R(0),
+ B(LdaConstant), U8(15),
+ B(Star), R(0),
+ B(LdaConstant), U8(16),
+ B(Star), R(0),
+ B(LdaConstant), U8(17),
+ B(Star), R(0),
+ B(LdaConstant), U8(18),
+ B(Star), R(0),
+ B(LdaConstant), U8(19),
+ B(Star), R(0),
+ B(LdaConstant), U8(20),
+ B(Star), R(0),
+ B(LdaConstant), U8(21),
+ B(Star), R(0),
+ B(LdaConstant), U8(22),
+ B(Star), R(0),
+ B(LdaConstant), U8(23),
+ B(Star), R(0),
+ B(LdaConstant), U8(24),
+ B(Star), R(0),
+ B(LdaConstant), U8(25),
+ B(Star), R(0),
+ B(LdaConstant), U8(26),
+ B(Star), R(0),
+ B(LdaConstant), U8(27),
+ B(Star), R(0),
+ B(LdaConstant), U8(28),
+ B(Star), R(0),
+ B(LdaConstant), U8(29),
+ B(Star), R(0),
+ B(LdaConstant), U8(30),
+ B(Star), R(0),
+ B(LdaConstant), U8(31),
+ B(Star), R(0),
+ B(LdaConstant), U8(32),
+ B(Star), R(0),
+ B(LdaConstant), U8(33),
+ B(Star), R(0),
+ B(LdaConstant), U8(34),
+ B(Star), R(0),
+ B(LdaConstant), U8(35),
+ B(Star), R(0),
+ B(LdaConstant), U8(36),
+ B(Star), R(0),
+ B(LdaConstant), U8(37),
+ B(Star), R(0),
+ B(LdaConstant), U8(38),
+ B(Star), R(0),
+ B(LdaConstant), U8(39),
+ B(Star), R(0),
+ B(LdaConstant), U8(40),
+ B(Star), R(0),
+ B(LdaConstant), U8(41),
+ B(Star), R(0),
+ B(LdaConstant), U8(42),
+ B(Star), R(0),
+ B(LdaConstant), U8(43),
+ B(Star), R(0),
+ B(LdaConstant), U8(44),
+ B(Star), R(0),
+ B(LdaConstant), U8(45),
+ B(Star), R(0),
+ B(LdaConstant), U8(46),
+ B(Star), R(0),
+ B(LdaConstant), U8(47),
+ B(Star), R(0),
+ B(LdaConstant), U8(48),
+ B(Star), R(0),
+ B(LdaConstant), U8(49),
+ B(Star), R(0),
+ B(LdaConstant), U8(50),
+ B(Star), R(0),
+ B(LdaConstant), U8(51),
+ B(Star), R(0),
+ B(LdaConstant), U8(52),
+ B(Star), R(0),
+ B(LdaConstant), U8(53),
+ B(Star), R(0),
+ B(LdaConstant), U8(54),
+ B(Star), R(0),
+ B(LdaConstant), U8(55),
+ B(Star), R(0),
+ B(LdaConstant), U8(56),
+ B(Star), R(0),
+ B(LdaConstant), U8(57),
+ B(Star), R(0),
+ B(LdaConstant), U8(58),
+ B(Star), R(0),
+ B(LdaConstant), U8(59),
+ B(Star), R(0),
+ B(LdaConstant), U8(60),
+ B(Star), R(0),
+ B(LdaConstant), U8(61),
+ B(Star), R(0),
+ B(LdaConstant), U8(62),
+ B(Star), R(0),
+ B(LdaConstant), U8(63),
+ B(Star), R(0),
+ B(LdaConstant), U8(64),
+ B(Star), R(0),
+ B(LdaConstant), U8(65),
+ B(Star), R(0),
+ B(LdaConstant), U8(66),
+ B(Star), R(0),
+ B(LdaConstant), U8(67),
+ B(Star), R(0),
+ B(LdaConstant), U8(68),
+ B(Star), R(0),
+ B(LdaConstant), U8(69),
+ B(Star), R(0),
+ B(LdaConstant), U8(70),
+ B(Star), R(0),
+ B(LdaConstant), U8(71),
+ B(Star), R(0),
+ B(LdaConstant), U8(72),
+ B(Star), R(0),
+ B(LdaConstant), U8(73),
+ B(Star), R(0),
+ B(LdaConstant), U8(74),
+ B(Star), R(0),
+ B(LdaConstant), U8(75),
+ B(Star), R(0),
+ B(LdaConstant), U8(76),
+ B(Star), R(0),
+ B(LdaConstant), U8(77),
+ B(Star), R(0),
+ B(LdaConstant), U8(78),
+ B(Star), R(0),
+ B(LdaConstant), U8(79),
+ B(Star), R(0),
+ B(LdaConstant), U8(80),
+ B(Star), R(0),
+ B(LdaConstant), U8(81),
+ B(Star), R(0),
+ B(LdaConstant), U8(82),
+ B(Star), R(0),
+ B(LdaConstant), U8(83),
+ B(Star), R(0),
+ B(LdaConstant), U8(84),
+ B(Star), R(0),
+ B(LdaConstant), U8(85),
+ B(Star), R(0),
+ B(LdaConstant), U8(86),
+ B(Star), R(0),
+ B(LdaConstant), U8(87),
+ B(Star), R(0),
+ B(LdaConstant), U8(88),
+ B(Star), R(0),
+ B(LdaConstant), U8(89),
+ B(Star), R(0),
+ B(LdaConstant), U8(90),
+ B(Star), R(0),
+ B(LdaConstant), U8(91),
+ B(Star), R(0),
+ B(LdaConstant), U8(92),
+ B(Star), R(0),
+ B(LdaConstant), U8(93),
+ B(Star), R(0),
+ B(LdaConstant), U8(94),
+ B(Star), R(0),
+ B(LdaConstant), U8(95),
+ B(Star), R(0),
+ B(LdaConstant), U8(96),
+ B(Star), R(0),
+ B(LdaConstant), U8(97),
+ B(Star), R(0),
+ B(LdaConstant), U8(98),
+ B(Star), R(0),
+ B(LdaConstant), U8(99),
+ B(Star), R(0),
+ B(LdaConstant), U8(100),
+ B(Star), R(0),
+ B(LdaConstant), U8(101),
+ B(Star), R(0),
+ B(LdaConstant), U8(102),
+ B(Star), R(0),
+ B(LdaConstant), U8(103),
+ B(Star), R(0),
+ B(LdaConstant), U8(104),
+ B(Star), R(0),
+ B(LdaConstant), U8(105),
+ B(Star), R(0),
+ B(LdaConstant), U8(106),
+ B(Star), R(0),
+ B(LdaConstant), U8(107),
+ B(Star), R(0),
+ B(LdaConstant), U8(108),
+ B(Star), R(0),
+ B(LdaConstant), U8(109),
+ B(Star), R(0),
+ B(LdaConstant), U8(110),
+ B(Star), R(0),
+ B(LdaConstant), U8(111),
+ B(Star), R(0),
+ B(LdaConstant), U8(112),
+ B(Star), R(0),
+ B(LdaConstant), U8(113),
+ B(Star), R(0),
+ B(LdaConstant), U8(114),
+ B(Star), R(0),
+ B(LdaConstant), U8(115),
+ B(Star), R(0),
+ B(LdaConstant), U8(116),
+ B(Star), R(0),
+ B(LdaConstant), U8(117),
+ B(Star), R(0),
+ B(LdaConstant), U8(118),
+ B(Star), R(0),
+ B(LdaConstant), U8(119),
+ B(Star), R(0),
+ B(LdaConstant), U8(120),
+ B(Star), R(0),
+ B(LdaConstant), U8(121),
+ B(Star), R(0),
+ B(LdaConstant), U8(122),
+ B(Star), R(0),
+ B(LdaConstant), U8(123),
+ B(Star), R(0),
+ B(LdaConstant), U8(124),
+ B(Star), R(0),
+ B(LdaConstant), U8(125),
+ B(Star), R(0),
+ B(LdaConstant), U8(126),
+ B(Star), R(0),
+ B(LdaConstant), U8(127),
+ B(Star), R(0),
+ B(LdaConstant), U8(128),
+ B(Star), R(0),
+ B(LdaConstant), U8(129),
+ B(Star), R(0),
+ B(LdaConstant), U8(130),
+ B(Star), R(0),
+ B(LdaConstant), U8(131),
+ B(Star), R(0),
+ B(LdaConstant), U8(132),
+ B(Star), R(0),
+ B(LdaConstant), U8(133),
+ B(Star), R(0),
+ B(LdaConstant), U8(134),
+ B(Star), R(0),
+ B(LdaConstant), U8(135),
+ B(Star), R(0),
+ B(LdaConstant), U8(136),
+ B(Star), R(0),
+ B(LdaConstant), U8(137),
+ B(Star), R(0),
+ B(LdaConstant), U8(138),
+ B(Star), R(0),
+ B(LdaConstant), U8(139),
+ B(Star), R(0),
+ B(LdaConstant), U8(140),
+ B(Star), R(0),
+ B(LdaConstant), U8(141),
+ B(Star), R(0),
+ B(LdaConstant), U8(142),
+ B(Star), R(0),
+ B(LdaConstant), U8(143),
+ B(Star), R(0),
+ B(LdaConstant), U8(144),
+ B(Star), R(0),
+ B(LdaConstant), U8(145),
+ B(Star), R(0),
+ B(LdaConstant), U8(146),
+ B(Star), R(0),
+ B(LdaConstant), U8(147),
+ B(Star), R(0),
+ B(LdaConstant), U8(148),
+ B(Star), R(0),
+ B(LdaConstant), U8(149),
+ B(Star), R(0),
+ B(LdaConstant), U8(150),
+ B(Star), R(0),
+ B(LdaConstant), U8(151),
+ B(Star), R(0),
+ B(LdaConstant), U8(152),
+ B(Star), R(0),
+ B(LdaConstant), U8(153),
+ B(Star), R(0),
+ B(LdaConstant), U8(154),
+ B(Star), R(0),
+ B(LdaConstant), U8(155),
+ B(Star), R(0),
+ B(LdaConstant), U8(156),
+ B(Star), R(0),
+ B(LdaConstant), U8(157),
+ B(Star), R(0),
+ B(LdaConstant), U8(158),
+ B(Star), R(0),
+ B(LdaConstant), U8(159),
+ B(Star), R(0),
+ B(LdaConstant), U8(160),
+ B(Star), R(0),
+ B(LdaConstant), U8(161),
+ B(Star), R(0),
+ B(LdaConstant), U8(162),
+ B(Star), R(0),
+ B(LdaConstant), U8(163),
+ B(Star), R(0),
+ B(LdaConstant), U8(164),
+ B(Star), R(0),
+ B(LdaConstant), U8(165),
+ B(Star), R(0),
+ B(LdaConstant), U8(166),
+ B(Star), R(0),
+ B(LdaConstant), U8(167),
+ B(Star), R(0),
+ B(LdaConstant), U8(168),
+ B(Star), R(0),
+ B(LdaConstant), U8(169),
+ B(Star), R(0),
+ B(LdaConstant), U8(170),
+ B(Star), R(0),
+ B(LdaConstant), U8(171),
+ B(Star), R(0),
+ B(LdaConstant), U8(172),
+ B(Star), R(0),
+ B(LdaConstant), U8(173),
+ B(Star), R(0),
+ B(LdaConstant), U8(174),
+ B(Star), R(0),
+ B(LdaConstant), U8(175),
+ B(Star), R(0),
+ B(LdaConstant), U8(176),
+ B(Star), R(0),
+ B(LdaConstant), U8(177),
+ B(Star), R(0),
+ B(LdaConstant), U8(178),
+ B(Star), R(0),
+ B(LdaConstant), U8(179),
+ B(Star), R(0),
+ B(LdaConstant), U8(180),
+ B(Star), R(0),
+ B(LdaConstant), U8(181),
+ B(Star), R(0),
+ B(LdaConstant), U8(182),
+ B(Star), R(0),
+ B(LdaConstant), U8(183),
+ B(Star), R(0),
+ B(LdaConstant), U8(184),
+ B(Star), R(0),
+ B(LdaConstant), U8(185),
+ B(Star), R(0),
+ B(LdaConstant), U8(186),
+ B(Star), R(0),
+ B(LdaConstant), U8(187),
+ B(Star), R(0),
+ B(LdaConstant), U8(188),
+ B(Star), R(0),
+ B(LdaConstant), U8(189),
+ B(Star), R(0),
+ B(LdaConstant), U8(190),
+ B(Star), R(0),
+ B(LdaConstant), U8(191),
+ B(Star), R(0),
+ B(LdaConstant), U8(192),
+ B(Star), R(0),
+ B(LdaConstant), U8(193),
+ B(Star), R(0),
+ B(LdaConstant), U8(194),
+ B(Star), R(0),
+ B(LdaConstant), U8(195),
+ B(Star), R(0),
+ B(LdaConstant), U8(196),
+ B(Star), R(0),
+ B(LdaConstant), U8(197),
+ B(Star), R(0),
+ B(LdaConstant), U8(198),
+ B(Star), R(0),
+ B(LdaConstant), U8(199),
+ B(Star), R(0),
+ B(LdaConstant), U8(200),
+ B(Star), R(0),
+ B(LdaConstant), U8(201),
+ B(Star), R(0),
+ B(LdaConstant), U8(202),
+ B(Star), R(0),
+ B(LdaConstant), U8(203),
+ B(Star), R(0),
+ B(LdaConstant), U8(204),
+ B(Star), R(0),
+ B(LdaConstant), U8(205),
+ B(Star), R(0),
+ B(LdaConstant), U8(206),
+ B(Star), R(0),
+ B(LdaConstant), U8(207),
+ B(Star), R(0),
+ B(LdaConstant), U8(208),
+ B(Star), R(0),
+ B(LdaConstant), U8(209),
+ B(Star), R(0),
+ B(LdaConstant), U8(210),
+ B(Star), R(0),
+ B(LdaConstant), U8(211),
+ B(Star), R(0),
+ B(LdaConstant), U8(212),
+ B(Star), R(0),
+ B(LdaConstant), U8(213),
+ B(Star), R(0),
+ B(LdaConstant), U8(214),
+ B(Star), R(0),
+ B(LdaConstant), U8(215),
+ B(Star), R(0),
+ B(LdaConstant), U8(216),
+ B(Star), R(0),
+ B(LdaConstant), U8(217),
+ B(Star), R(0),
+ B(LdaConstant), U8(218),
+ B(Star), R(0),
+ B(LdaConstant), U8(219),
+ B(Star), R(0),
+ B(LdaConstant), U8(220),
+ B(Star), R(0),
+ B(LdaConstant), U8(221),
+ B(Star), R(0),
+ B(LdaConstant), U8(222),
+ B(Star), R(0),
+ B(LdaConstant), U8(223),
+ B(Star), R(0),
+ B(LdaConstant), U8(224),
+ B(Star), R(0),
+ B(LdaConstant), U8(225),
+ B(Star), R(0),
+ B(LdaConstant), U8(226),
+ B(Star), R(0),
+ B(LdaConstant), U8(227),
+ B(Star), R(0),
+ B(LdaConstant), U8(228),
+ B(Star), R(0),
+ B(LdaConstant), U8(229),
+ B(Star), R(0),
+ B(LdaConstant), U8(230),
+ B(Star), R(0),
+ B(LdaConstant), U8(231),
+ B(Star), R(0),
+ B(LdaConstant), U8(232),
+ B(Star), R(0),
+ B(LdaConstant), U8(233),
+ B(Star), R(0),
+ B(LdaConstant), U8(234),
+ B(Star), R(0),
+ B(LdaConstant), U8(235),
+ B(Star), R(0),
+ B(LdaConstant), U8(236),
+ B(Star), R(0),
+ B(LdaConstant), U8(237),
+ B(Star), R(0),
+ B(LdaConstant), U8(238),
+ B(Star), R(0),
+ B(LdaConstant), U8(239),
+ B(Star), R(0),
+ B(LdaConstant), U8(240),
+ B(Star), R(0),
+ B(LdaConstant), U8(241),
+ B(Star), R(0),
+ B(LdaConstant), U8(242),
+ B(Star), R(0),
+ B(LdaConstant), U8(243),
+ B(Star), R(0),
+ B(LdaConstant), U8(244),
+ B(Star), R(0),
+ B(LdaConstant), U8(245),
+ B(Star), R(0),
+ B(LdaConstant), U8(246),
+ B(Star), R(0),
+ B(LdaConstant), U8(247),
+ B(Star), R(0),
+ B(LdaConstant), U8(248),
+ B(Star), R(0),
+ B(LdaConstant), U8(249),
+ B(Star), R(0),
+ B(LdaConstant), U8(250),
+ B(Star), R(0),
+ B(LdaConstant), U8(251),
+ B(Star), R(0),
+ B(LdaConstant), U8(252),
+ B(Star), R(0),
+ B(LdaConstant), U8(253),
+ B(Star), R(0),
+ B(LdaConstant), U8(254),
+ B(Star), R(0),
+ B(LdaConstant), U8(255),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(256),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(257),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(258),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(259),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(260),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(261),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(262),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(263),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(264),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(265),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(266),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(267),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(268),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(269),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(270),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(271),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(272),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(273),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(274),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(275),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(276),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(277),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(278),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(279),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(280),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(281),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(282),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(283),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(284),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(285),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(286),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(287),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(288),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(289),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(290),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(291),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(292),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(293),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(294),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(295),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(296),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(297),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(298),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(299),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(300),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(301),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(302),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(303),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(304),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(305),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(306),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(307),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(308),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(309),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(310),
+ B(Star), R(0),
+ B(Wide), B(LdaConstant), U16(311),
+ B(Star), R(0),
+ B(LdaZero),
+ B(Star), R(1),
+ B(Ldar), R(1),
+ B(Star), R(2),
+ B(LdaSmi), U8(3),
+ B(TestLessThan), R(2),
+ B(Wide), B(JumpIfFalse), U16(46),
+ B(StackCheck),
+ B(Ldar), R(1),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(TestEqual), R(2),
+ B(Wide), B(JumpIfFalse), U16(7),
+ B(Wide), B(Jump), U16(19),
+ B(Ldar), R(1),
+ B(Star), R(2),
+ B(LdaSmi), U8(2),
+ B(TestEqual), R(2),
+ B(Wide), B(JumpIfFalse), U16(7),
+ B(Wide), B(Jump), U16(13),
+ B(Ldar), R(1),
+ B(ToNumber),
+ B(Star), R(2),
+ B(Inc),
+ B(Star), R(1),
+ B(Jump), U8(-53),
+ B(LdaSmi), U8(3),
+ B(Return),
+]
+constant pool: [
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.1,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.2,
+ 0.3,
+ 0.3,
+ 0.3,
+ 0.3,
+ 0.3,
+ 0.3,
+ 0.3,
+ 0.3,
+ 0.3,
+ 0.3,
+ 0.3,
+ 0.3,
+ 0.3,
+ 0.3,
+ 0.3,
+ 0.3,
+ 0.4,
+ 0.4,
+ 0.4,
+ 0.4,
+ 0.4,
+ 0.4,
+ 0.4,
+ 0.4,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/LetVariable.golden b/test/cctest/interpreter/bytecode_expectations/LetVariable.golden
new file mode 100644
index 0000000..5ceda85
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/LetVariable.golden
@@ -0,0 +1,115 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ let x = 10;
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 10
+bytecodes: [
+ B(LdaTheHole),
+ B(Star), R(0),
+ B(StackCheck),
+ B(LdaSmi), U8(10),
+ B(Star), R(0),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ let x = 10; return x;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 20
+bytecodes: [
+ B(LdaTheHole),
+ B(Star), R(0),
+ B(StackCheck),
+ B(LdaSmi), U8(10),
+ B(Star), R(0),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(0),
+ B(Star), R(1),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(1), U8(1),
+ B(Return),
+]
+constant pool: [
+ "x",
+]
+handlers: [
+]
+
+---
+snippet: "
+ let x = (x = 20);
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 27
+bytecodes: [
+ B(LdaTheHole),
+ B(Star), R(0),
+ B(StackCheck),
+ B(LdaSmi), U8(20),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(0),
+ B(Star), R(2),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(2), U8(1),
+ B(Ldar), R(1),
+ B(Star), R(0),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "x",
+]
+handlers: [
+]
+
+---
+snippet: "
+ let x = 10; x = 20;
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 31
+bytecodes: [
+ B(LdaTheHole),
+ B(Star), R(0),
+ B(StackCheck),
+ B(LdaSmi), U8(10),
+ B(Star), R(0),
+ B(LdaSmi), U8(20),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(0),
+ B(Star), R(2),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(2), U8(1),
+ B(Ldar), R(1),
+ B(Star), R(0),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "x",
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/LetVariableContextSlot.golden b/test/cctest/interpreter/bytecode_expectations/LetVariableContextSlot.golden
new file mode 100644
index 0000000..4fc5c4f
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/LetVariableContextSlot.golden
@@ -0,0 +1,137 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ let x = 10; function f1() {return x;}
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 24
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(1),
+ B(LdaTheHole),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateClosure), U8(0), U8(0),
+ B(Star), R(0),
+ B(StackCheck),
+ B(LdaSmi), U8(10),
+ B(StaContextSlot), R(context), U8(4),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ let x = 10; function f1() {return x;} return x;
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 37
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(1),
+ B(LdaTheHole),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateClosure), U8(0), U8(0),
+ B(Star), R(0),
+ B(StackCheck),
+ B(LdaSmi), U8(10),
+ B(StaContextSlot), R(context), U8(4),
+ B(LdaContextSlot), R(context), U8(4),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(1),
+ B(Star), R(2),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(2), U8(1),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ let x = (x = 20); function f1() {return x;}
+"
+frame size: 4
+parameter count: 1
+bytecode array length: 45
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(1),
+ B(LdaTheHole),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateClosure), U8(0), U8(0),
+ B(Star), R(0),
+ B(StackCheck),
+ B(LdaSmi), U8(20),
+ B(Star), R(2),
+ B(LdaContextSlot), R(context), U8(4),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(1),
+ B(Star), R(3),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(3), U8(1),
+ B(Ldar), R(2),
+ B(StaContextSlot), R(context), U8(4),
+ B(StaContextSlot), R(context), U8(4),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ let x = 10; x = 20; function f1() {return x;}
+"
+frame size: 4
+parameter count: 1
+bytecode array length: 47
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(1),
+ B(LdaTheHole),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateClosure), U8(0), U8(0),
+ B(Star), R(0),
+ B(StackCheck),
+ B(LdaSmi), U8(10),
+ B(StaContextSlot), R(context), U8(4),
+ B(LdaSmi), U8(20),
+ B(Star), R(2),
+ B(LdaContextSlot), R(context), U8(4),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(1),
+ B(Star), R(3),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(3), U8(1),
+ B(Ldar), R(2),
+ B(StaContextSlot), R(context), U8(4),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/LoadGlobal.golden b/test/cctest/interpreter/bytecode_expectations/LoadGlobal.golden
new file mode 100644
index 0000000..0a96cae
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/LoadGlobal.golden
@@ -0,0 +1,605 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: no
+test function name: f
+
+---
+snippet: "
+ var a = 1;
+ function f() { return a; }
+ f()
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 5
+bytecodes: [
+ B(StackCheck),
+ B(LdaGlobal), U8(0), U8(1),
+ B(Return),
+]
+constant pool: [
+ "a",
+]
+handlers: [
+]
+
+---
+snippet: "
+ function t() { }
+ function f() { return t; }
+ f()
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 5
+bytecodes: [
+ B(StackCheck),
+ B(LdaGlobal), U8(0), U8(1),
+ B(Return),
+]
+constant pool: [
+ "t",
+]
+handlers: [
+]
+
+---
+snippet: "
+ a = 1;
+ function f() { return a; }
+ f()
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 5
+bytecodes: [
+ B(StackCheck),
+ B(LdaGlobal), U8(0), U8(1),
+ B(Return),
+]
+constant pool: [
+ "a",
+]
+handlers: [
+]
+
+---
+snippet: "
+ a = 1;
+ function f(b) {
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ return a;
+ }
+ f({name: 1});
+"
+frame size: 1
+parameter count: 2
+bytecode array length: 1032
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(1),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(3),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(5),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(7),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(9),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(11),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(13),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(15),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(17),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(19),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(21),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(23),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(25),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(27),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(29),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(31),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(33),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(35),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(37),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(39),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(41),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(43),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(45),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(47),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(49),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(51),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(53),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(55),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(57),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(59),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(61),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(63),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(65),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(67),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(69),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(71),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(73),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(75),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(77),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(79),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(81),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(83),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(85),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(87),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(89),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(91),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(93),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(95),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(97),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(99),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(101),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(103),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(105),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(107),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(109),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(111),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(113),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(115),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(117),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(119),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(121),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(123),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(125),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(127),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(129),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(131),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(133),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(135),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(137),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(139),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(141),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(143),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(145),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(147),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(149),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(151),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(153),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(155),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(157),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(159),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(161),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(163),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(165),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(167),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(169),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(171),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(173),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(175),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(177),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(179),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(181),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(183),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(185),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(187),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(189),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(191),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(193),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(195),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(197),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(199),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(201),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(203),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(205),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(207),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(209),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(211),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(213),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(215),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(217),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(219),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(221),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(223),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(225),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(227),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(229),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(231),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(233),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(235),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(237),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(239),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(241),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(243),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(245),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(247),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(249),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(251),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(253),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(255),
+ B(Wide), B(LdaGlobal), U16(1), U16(257),
+ B(Return),
+]
+constant pool: [
+ "name",
+ "a",
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/LogicalExpressions.golden b/test/cctest/interpreter/bytecode_expectations/LogicalExpressions.golden
new file mode 100644
index 0000000..cddb9a1
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/LogicalExpressions.golden
@@ -0,0 +1,953 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: number
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ var x = 0; return x || 3;
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 9
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(JumpIfToBooleanTrue), U8(4),
+ B(LdaSmi), U8(3),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 0; return (x == 1) || 3;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 15
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(TestEqual), R(1),
+ B(JumpIfTrue), U8(4),
+ B(LdaSmi), U8(3),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 0; return x && 3;
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 9
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(JumpIfToBooleanFalse), U8(4),
+ B(LdaSmi), U8(3),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 0; return (x == 0) && 3;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 14
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaZero),
+ B(TestEqual), R(1),
+ B(JumpIfFalse), U8(4),
+ B(LdaSmi), U8(3),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 0; return x || (1, 2, 3);
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 9
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(JumpIfToBooleanTrue), U8(4),
+ B(LdaSmi), U8(3),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 2, b = 3, c = 4; return a || (a, b, a, b, c = 5, 3);
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 32
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(2),
+ B(Star), R(0),
+ B(LdaSmi), U8(3),
+ B(Star), R(1),
+ B(LdaSmi), U8(4),
+ B(Star), R(2),
+ B(Ldar), R(0),
+ B(JumpIfToBooleanTrue), U8(16),
+ B(Ldar), R(0),
+ B(Ldar), R(1),
+ B(Ldar), R(0),
+ B(Ldar), R(1),
+ B(LdaSmi), U8(5),
+ B(Star), R(2),
+ B(LdaSmi), U8(3),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 1; var a = 2, b = 3; return x || (
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2, 3);
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 276
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(3),
+ B(Star), R(2),
+ B(Ldar), R(0),
+ B(JumpIfToBooleanTrueConstant), U8(0),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(3),
+ B(Return),
+]
+constant pool: [
+ 260,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 0; var a = 2, b = 3; return x && (
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2, 3);
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 275
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(3),
+ B(Star), R(2),
+ B(Ldar), R(0),
+ B(JumpIfToBooleanFalseConstant), U8(0),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(3),
+ B(Return),
+]
+constant pool: [
+ 260,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 1; var a = 2, b = 3; return (x > 3) || (
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2, 3);
+"
+frame size: 4
+parameter count: 1
+bytecode array length: 282
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(3),
+ B(Star), R(2),
+ B(Ldar), R(0),
+ B(Star), R(3),
+ B(LdaSmi), U8(3),
+ B(TestGreaterThan), R(3),
+ B(JumpIfTrueConstant), U8(0),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(3),
+ B(Return),
+]
+constant pool: [
+ 260,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 0; var a = 2, b = 3; return (x < 5) && (
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2,
+ a = 1, b = 2, 3);
+"
+frame size: 4
+parameter count: 1
+bytecode array length: 281
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(3),
+ B(Star), R(2),
+ B(Ldar), R(0),
+ B(Star), R(3),
+ B(LdaSmi), U8(5),
+ B(TestLessThan), R(3),
+ B(JumpIfFalseConstant), U8(0),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(LdaSmi), U8(3),
+ B(Return),
+]
+constant pool: [
+ 260,
+]
+handlers: [
+]
+
+---
+snippet: "
+ return 0 && 3;
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 3
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ return 1 || 3;
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 4
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 1; return x && 3 || 0, 1;
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 15
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(JumpIfToBooleanFalse), U8(4),
+ B(LdaSmi), U8(3),
+ B(JumpIfToBooleanTrue), U8(3),
+ B(LdaZero),
+ B(LdaSmi), U8(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/LookupSlot.golden b/test/cctest/interpreter/bytecode_expectations/LookupSlot.golden
new file mode 100644
index 0000000..acec42f
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/LookupSlot.golden
@@ -0,0 +1,140 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ eval('var x = 10;'); return x;
+"
+frame size: 9
+parameter count: 1
+bytecode array length: 67
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(0),
+ B(Ldar), R(this),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateMappedArguments),
+ B(StaContextSlot), R(context), U8(5),
+ B(Ldar), R(new_target),
+ B(StaContextSlot), R(context), U8(6),
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(3),
+ B(CallRuntimeForPair), U16(Runtime::kLoadLookupSlotForCall), R(3), U8(1), R(1),
+ B(LdaConstant), U8(1),
+ B(Star), R(3),
+ B(Mov), R(1), R(4),
+ B(Mov), R(3), R(5),
+ B(Mov), R(closure), R(6),
+ B(LdaZero),
+ B(Star), R(7),
+ B(LdaSmi), U8(30),
+ B(Star), R(8),
+ B(CallRuntime), U16(Runtime::kResolvePossiblyDirectEval), R(4), U8(5),
+ B(Star), R(1),
+ B(Call), R(1), R(2), U8(2), U8(0),
+ B(LdaLookupSlot), U8(2),
+ B(Return),
+]
+constant pool: [
+ "eval",
+ "var x = 10;",
+ "x",
+]
+handlers: [
+]
+
+---
+snippet: "
+ eval('var x = 10;'); return typeof x;
+"
+frame size: 9
+parameter count: 1
+bytecode array length: 68
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(0),
+ B(Ldar), R(this),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateMappedArguments),
+ B(StaContextSlot), R(context), U8(5),
+ B(Ldar), R(new_target),
+ B(StaContextSlot), R(context), U8(6),
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(3),
+ B(CallRuntimeForPair), U16(Runtime::kLoadLookupSlotForCall), R(3), U8(1), R(1),
+ B(LdaConstant), U8(1),
+ B(Star), R(3),
+ B(Mov), R(1), R(4),
+ B(Mov), R(3), R(5),
+ B(Mov), R(closure), R(6),
+ B(LdaZero),
+ B(Star), R(7),
+ B(LdaSmi), U8(30),
+ B(Star), R(8),
+ B(CallRuntime), U16(Runtime::kResolvePossiblyDirectEval), R(4), U8(5),
+ B(Star), R(1),
+ B(Call), R(1), R(2), U8(2), U8(0),
+ B(LdaLookupSlotInsideTypeof), U8(2),
+ B(TypeOf),
+ B(Return),
+]
+constant pool: [
+ "eval",
+ "var x = 10;",
+ "x",
+]
+handlers: [
+]
+
+---
+snippet: "
+ x = 20; return eval('');
+"
+frame size: 9
+parameter count: 1
+bytecode array length: 69
+bytecodes: [
+ B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1),
+ B(PushContext), R(0),
+ B(Ldar), R(this),
+ B(StaContextSlot), R(context), U8(4),
+ B(CreateMappedArguments),
+ B(StaContextSlot), R(context), U8(5),
+ B(Ldar), R(new_target),
+ B(StaContextSlot), R(context), U8(6),
+ B(StackCheck),
+ B(LdaSmi), U8(20),
+ B(StaLookupSlotSloppy), U8(0),
+ B(LdaConstant), U8(1),
+ B(Star), R(3),
+ B(CallRuntimeForPair), U16(Runtime::kLoadLookupSlotForCall), R(3), U8(1), R(1),
+ B(LdaConstant), U8(2),
+ B(Star), R(3),
+ B(Mov), R(1), R(4),
+ B(Mov), R(3), R(5),
+ B(Mov), R(closure), R(6),
+ B(LdaZero),
+ B(Star), R(7),
+ B(LdaSmi), U8(30),
+ B(Star), R(8),
+ B(CallRuntime), U16(Runtime::kResolvePossiblyDirectEval), R(4), U8(5),
+ B(Star), R(1),
+ B(Call), R(1), R(2), U8(2), U8(0),
+ B(Return),
+]
+constant pool: [
+ "x",
+ "eval",
+ "",
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/LookupSlotInEval.golden b/test/cctest/interpreter/bytecode_expectations/LookupSlotInEval.golden
new file mode 100644
index 0000000..26e11e3
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/LookupSlotInEval.golden
@@ -0,0 +1,107 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: no
+test function name: f
+
+---
+snippet: "
+ var f;
+ var x = 1;
+ function f1() {
+ eval(\"function t() { return x; }; f = t; f();\");
+ }
+ f1();
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 4
+bytecodes: [
+ B(StackCheck),
+ B(LdaLookupSlot), U8(0),
+ B(Return),
+]
+constant pool: [
+ "x",
+]
+handlers: [
+]
+
+---
+snippet: "
+ var f;
+ var x = 1;
+ function f1() {
+ eval(\"function t() { x = 10; }; f = t; f();\");
+ }
+ f1();
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 7
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(10),
+ B(StaLookupSlotSloppy), U8(0),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "x",
+]
+handlers: [
+]
+
+---
+snippet: "
+ var f;
+ var x = 1;
+ function f1() {
+ eval(\"function t() { 'use strict'; x = 10; }; f = t; f();\");
+ }
+ f1();
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 7
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(10),
+ B(StaLookupSlotStrict), U8(0),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "x",
+]
+handlers: [
+]
+
+---
+snippet: "
+ var f;
+ var x = 1;
+ function f1() {
+ eval(\"function t() { return typeof x; }; f = t; f();\");
+ }
+ f1();
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 5
+bytecodes: [
+ B(StackCheck),
+ B(LdaLookupSlotInsideTypeof), U8(0),
+ B(TypeOf),
+ B(Return),
+]
+constant pool: [
+ "x",
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/LookupSlotWideInEval.golden b/test/cctest/interpreter/bytecode_expectations/LookupSlotWideInEval.golden
new file mode 100644
index 0000000..2fdc3e9
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/LookupSlotWideInEval.golden
@@ -0,0 +1,4220 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: no
+test function name: f
+
+---
+snippet: "
+ var f;
+ var x = 1;
+ function f1() {
+ eval(\"function t() {\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"return x;\" +
+ \"};\" +
+ \"f = t; f();\"
+ );
+ }
+ f1();
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 1030
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(0),
+ B(LdaConstant), U8(1),
+ B(Star), R(0),
+ B(LdaConstant), U8(2),
+ B(Star), R(0),
+ B(LdaConstant), U8(3),
+ B(Star), R(0),
+ B(LdaConstant), U8(4),
+ B(Star), R(0),
+ B(LdaConstant), U8(5),
+ B(Star), R(0),
+ B(LdaConstant), U8(6),
+ B(Star), R(0),
+ B(LdaConstant), U8(7),
+ B(Star), R(0),
+ B(LdaConstant), U8(8),
+ B(Star), R(0),
+ B(LdaConstant), U8(9),
+ B(Star), R(0),
+ B(LdaConstant), U8(10),
+ B(Star), R(0),
+ B(LdaConstant), U8(11),
+ B(Star), R(0),
+ B(LdaConstant), U8(12),
+ B(Star), R(0),
+ B(LdaConstant), U8(13),
+ B(Star), R(0),
+ B(LdaConstant), U8(14),
+ B(Star), R(0),
+ B(LdaConstant), U8(15),
+ B(Star), R(0),
+ B(LdaConstant), U8(16),
+ B(Star), R(0),
+ B(LdaConstant), U8(17),
+ B(Star), R(0),
+ B(LdaConstant), U8(18),
+ B(Star), R(0),
+ B(LdaConstant), U8(19),
+ B(Star), R(0),
+ B(LdaConstant), U8(20),
+ B(Star), R(0),
+ B(LdaConstant), U8(21),
+ B(Star), R(0),
+ B(LdaConstant), U8(22),
+ B(Star), R(0),
+ B(LdaConstant), U8(23),
+ B(Star), R(0),
+ B(LdaConstant), U8(24),
+ B(Star), R(0),
+ B(LdaConstant), U8(25),
+ B(Star), R(0),
+ B(LdaConstant), U8(26),
+ B(Star), R(0),
+ B(LdaConstant), U8(27),
+ B(Star), R(0),
+ B(LdaConstant), U8(28),
+ B(Star), R(0),
+ B(LdaConstant), U8(29),
+ B(Star), R(0),
+ B(LdaConstant), U8(30),
+ B(Star), R(0),
+ B(LdaConstant), U8(31),
+ B(Star), R(0),
+ B(LdaConstant), U8(32),
+ B(Star), R(0),
+ B(LdaConstant), U8(33),
+ B(Star), R(0),
+ B(LdaConstant), U8(34),
+ B(Star), R(0),
+ B(LdaConstant), U8(35),
+ B(Star), R(0),
+ B(LdaConstant), U8(36),
+ B(Star), R(0),
+ B(LdaConstant), U8(37),
+ B(Star), R(0),
+ B(LdaConstant), U8(38),
+ B(Star), R(0),
+ B(LdaConstant), U8(39),
+ B(Star), R(0),
+ B(LdaConstant), U8(40),
+ B(Star), R(0),
+ B(LdaConstant), U8(41),
+ B(Star), R(0),
+ B(LdaConstant), U8(42),
+ B(Star), R(0),
+ B(LdaConstant), U8(43),
+ B(Star), R(0),
+ B(LdaConstant), U8(44),
+ B(Star), R(0),
+ B(LdaConstant), U8(45),
+ B(Star), R(0),
+ B(LdaConstant), U8(46),
+ B(Star), R(0),
+ B(LdaConstant), U8(47),
+ B(Star), R(0),
+ B(LdaConstant), U8(48),
+ B(Star), R(0),
+ B(LdaConstant), U8(49),
+ B(Star), R(0),
+ B(LdaConstant), U8(50),
+ B(Star), R(0),
+ B(LdaConstant), U8(51),
+ B(Star), R(0),
+ B(LdaConstant), U8(52),
+ B(Star), R(0),
+ B(LdaConstant), U8(53),
+ B(Star), R(0),
+ B(LdaConstant), U8(54),
+ B(Star), R(0),
+ B(LdaConstant), U8(55),
+ B(Star), R(0),
+ B(LdaConstant), U8(56),
+ B(Star), R(0),
+ B(LdaConstant), U8(57),
+ B(Star), R(0),
+ B(LdaConstant), U8(58),
+ B(Star), R(0),
+ B(LdaConstant), U8(59),
+ B(Star), R(0),
+ B(LdaConstant), U8(60),
+ B(Star), R(0),
+ B(LdaConstant), U8(61),
+ B(Star), R(0),
+ B(LdaConstant), U8(62),
+ B(Star), R(0),
+ B(LdaConstant), U8(63),
+ B(Star), R(0),
+ B(LdaConstant), U8(64),
+ B(Star), R(0),
+ B(LdaConstant), U8(65),
+ B(Star), R(0),
+ B(LdaConstant), U8(66),
+ B(Star), R(0),
+ B(LdaConstant), U8(67),
+ B(Star), R(0),
+ B(LdaConstant), U8(68),
+ B(Star), R(0),
+ B(LdaConstant), U8(69),
+ B(Star), R(0),
+ B(LdaConstant), U8(70),
+ B(Star), R(0),
+ B(LdaConstant), U8(71),
+ B(Star), R(0),
+ B(LdaConstant), U8(72),
+ B(Star), R(0),
+ B(LdaConstant), U8(73),
+ B(Star), R(0),
+ B(LdaConstant), U8(74),
+ B(Star), R(0),
+ B(LdaConstant), U8(75),
+ B(Star), R(0),
+ B(LdaConstant), U8(76),
+ B(Star), R(0),
+ B(LdaConstant), U8(77),
+ B(Star), R(0),
+ B(LdaConstant), U8(78),
+ B(Star), R(0),
+ B(LdaConstant), U8(79),
+ B(Star), R(0),
+ B(LdaConstant), U8(80),
+ B(Star), R(0),
+ B(LdaConstant), U8(81),
+ B(Star), R(0),
+ B(LdaConstant), U8(82),
+ B(Star), R(0),
+ B(LdaConstant), U8(83),
+ B(Star), R(0),
+ B(LdaConstant), U8(84),
+ B(Star), R(0),
+ B(LdaConstant), U8(85),
+ B(Star), R(0),
+ B(LdaConstant), U8(86),
+ B(Star), R(0),
+ B(LdaConstant), U8(87),
+ B(Star), R(0),
+ B(LdaConstant), U8(88),
+ B(Star), R(0),
+ B(LdaConstant), U8(89),
+ B(Star), R(0),
+ B(LdaConstant), U8(90),
+ B(Star), R(0),
+ B(LdaConstant), U8(91),
+ B(Star), R(0),
+ B(LdaConstant), U8(92),
+ B(Star), R(0),
+ B(LdaConstant), U8(93),
+ B(Star), R(0),
+ B(LdaConstant), U8(94),
+ B(Star), R(0),
+ B(LdaConstant), U8(95),
+ B(Star), R(0),
+ B(LdaConstant), U8(96),
+ B(Star), R(0),
+ B(LdaConstant), U8(97),
+ B(Star), R(0),
+ B(LdaConstant), U8(98),
+ B(Star), R(0),
+ B(LdaConstant), U8(99),
+ B(Star), R(0),
+ B(LdaConstant), U8(100),
+ B(Star), R(0),
+ B(LdaConstant), U8(101),
+ B(Star), R(0),
+ B(LdaConstant), U8(102),
+ B(Star), R(0),
+ B(LdaConstant), U8(103),
+ B(Star), R(0),
+ B(LdaConstant), U8(104),
+ B(Star), R(0),
+ B(LdaConstant), U8(105),
+ B(Star), R(0),
+ B(LdaConstant), U8(106),
+ B(Star), R(0),
+ B(LdaConstant), U8(107),
+ B(Star), R(0),
+ B(LdaConstant), U8(108),
+ B(Star), R(0),
+ B(LdaConstant), U8(109),
+ B(Star), R(0),
+ B(LdaConstant), U8(110),
+ B(Star), R(0),
+ B(LdaConstant), U8(111),
+ B(Star), R(0),
+ B(LdaConstant), U8(112),
+ B(Star), R(0),
+ B(LdaConstant), U8(113),
+ B(Star), R(0),
+ B(LdaConstant), U8(114),
+ B(Star), R(0),
+ B(LdaConstant), U8(115),
+ B(Star), R(0),
+ B(LdaConstant), U8(116),
+ B(Star), R(0),
+ B(LdaConstant), U8(117),
+ B(Star), R(0),
+ B(LdaConstant), U8(118),
+ B(Star), R(0),
+ B(LdaConstant), U8(119),
+ B(Star), R(0),
+ B(LdaConstant), U8(120),
+ B(Star), R(0),
+ B(LdaConstant), U8(121),
+ B(Star), R(0),
+ B(LdaConstant), U8(122),
+ B(Star), R(0),
+ B(LdaConstant), U8(123),
+ B(Star), R(0),
+ B(LdaConstant), U8(124),
+ B(Star), R(0),
+ B(LdaConstant), U8(125),
+ B(Star), R(0),
+ B(LdaConstant), U8(126),
+ B(Star), R(0),
+ B(LdaConstant), U8(127),
+ B(Star), R(0),
+ B(LdaConstant), U8(128),
+ B(Star), R(0),
+ B(LdaConstant), U8(129),
+ B(Star), R(0),
+ B(LdaConstant), U8(130),
+ B(Star), R(0),
+ B(LdaConstant), U8(131),
+ B(Star), R(0),
+ B(LdaConstant), U8(132),
+ B(Star), R(0),
+ B(LdaConstant), U8(133),
+ B(Star), R(0),
+ B(LdaConstant), U8(134),
+ B(Star), R(0),
+ B(LdaConstant), U8(135),
+ B(Star), R(0),
+ B(LdaConstant), U8(136),
+ B(Star), R(0),
+ B(LdaConstant), U8(137),
+ B(Star), R(0),
+ B(LdaConstant), U8(138),
+ B(Star), R(0),
+ B(LdaConstant), U8(139),
+ B(Star), R(0),
+ B(LdaConstant), U8(140),
+ B(Star), R(0),
+ B(LdaConstant), U8(141),
+ B(Star), R(0),
+ B(LdaConstant), U8(142),
+ B(Star), R(0),
+ B(LdaConstant), U8(143),
+ B(Star), R(0),
+ B(LdaConstant), U8(144),
+ B(Star), R(0),
+ B(LdaConstant), U8(145),
+ B(Star), R(0),
+ B(LdaConstant), U8(146),
+ B(Star), R(0),
+ B(LdaConstant), U8(147),
+ B(Star), R(0),
+ B(LdaConstant), U8(148),
+ B(Star), R(0),
+ B(LdaConstant), U8(149),
+ B(Star), R(0),
+ B(LdaConstant), U8(150),
+ B(Star), R(0),
+ B(LdaConstant), U8(151),
+ B(Star), R(0),
+ B(LdaConstant), U8(152),
+ B(Star), R(0),
+ B(LdaConstant), U8(153),
+ B(Star), R(0),
+ B(LdaConstant), U8(154),
+ B(Star), R(0),
+ B(LdaConstant), U8(155),
+ B(Star), R(0),
+ B(LdaConstant), U8(156),
+ B(Star), R(0),
+ B(LdaConstant), U8(157),
+ B(Star), R(0),
+ B(LdaConstant), U8(158),
+ B(Star), R(0),
+ B(LdaConstant), U8(159),
+ B(Star), R(0),
+ B(LdaConstant), U8(160),
+ B(Star), R(0),
+ B(LdaConstant), U8(161),
+ B(Star), R(0),
+ B(LdaConstant), U8(162),
+ B(Star), R(0),
+ B(LdaConstant), U8(163),
+ B(Star), R(0),
+ B(LdaConstant), U8(164),
+ B(Star), R(0),
+ B(LdaConstant), U8(165),
+ B(Star), R(0),
+ B(LdaConstant), U8(166),
+ B(Star), R(0),
+ B(LdaConstant), U8(167),
+ B(Star), R(0),
+ B(LdaConstant), U8(168),
+ B(Star), R(0),
+ B(LdaConstant), U8(169),
+ B(Star), R(0),
+ B(LdaConstant), U8(170),
+ B(Star), R(0),
+ B(LdaConstant), U8(171),
+ B(Star), R(0),
+ B(LdaConstant), U8(172),
+ B(Star), R(0),
+ B(LdaConstant), U8(173),
+ B(Star), R(0),
+ B(LdaConstant), U8(174),
+ B(Star), R(0),
+ B(LdaConstant), U8(175),
+ B(Star), R(0),
+ B(LdaConstant), U8(176),
+ B(Star), R(0),
+ B(LdaConstant), U8(177),
+ B(Star), R(0),
+ B(LdaConstant), U8(178),
+ B(Star), R(0),
+ B(LdaConstant), U8(179),
+ B(Star), R(0),
+ B(LdaConstant), U8(180),
+ B(Star), R(0),
+ B(LdaConstant), U8(181),
+ B(Star), R(0),
+ B(LdaConstant), U8(182),
+ B(Star), R(0),
+ B(LdaConstant), U8(183),
+ B(Star), R(0),
+ B(LdaConstant), U8(184),
+ B(Star), R(0),
+ B(LdaConstant), U8(185),
+ B(Star), R(0),
+ B(LdaConstant), U8(186),
+ B(Star), R(0),
+ B(LdaConstant), U8(187),
+ B(Star), R(0),
+ B(LdaConstant), U8(188),
+ B(Star), R(0),
+ B(LdaConstant), U8(189),
+ B(Star), R(0),
+ B(LdaConstant), U8(190),
+ B(Star), R(0),
+ B(LdaConstant), U8(191),
+ B(Star), R(0),
+ B(LdaConstant), U8(192),
+ B(Star), R(0),
+ B(LdaConstant), U8(193),
+ B(Star), R(0),
+ B(LdaConstant), U8(194),
+ B(Star), R(0),
+ B(LdaConstant), U8(195),
+ B(Star), R(0),
+ B(LdaConstant), U8(196),
+ B(Star), R(0),
+ B(LdaConstant), U8(197),
+ B(Star), R(0),
+ B(LdaConstant), U8(198),
+ B(Star), R(0),
+ B(LdaConstant), U8(199),
+ B(Star), R(0),
+ B(LdaConstant), U8(200),
+ B(Star), R(0),
+ B(LdaConstant), U8(201),
+ B(Star), R(0),
+ B(LdaConstant), U8(202),
+ B(Star), R(0),
+ B(LdaConstant), U8(203),
+ B(Star), R(0),
+ B(LdaConstant), U8(204),
+ B(Star), R(0),
+ B(LdaConstant), U8(205),
+ B(Star), R(0),
+ B(LdaConstant), U8(206),
+ B(Star), R(0),
+ B(LdaConstant), U8(207),
+ B(Star), R(0),
+ B(LdaConstant), U8(208),
+ B(Star), R(0),
+ B(LdaConstant), U8(209),
+ B(Star), R(0),
+ B(LdaConstant), U8(210),
+ B(Star), R(0),
+ B(LdaConstant), U8(211),
+ B(Star), R(0),
+ B(LdaConstant), U8(212),
+ B(Star), R(0),
+ B(LdaConstant), U8(213),
+ B(Star), R(0),
+ B(LdaConstant), U8(214),
+ B(Star), R(0),
+ B(LdaConstant), U8(215),
+ B(Star), R(0),
+ B(LdaConstant), U8(216),
+ B(Star), R(0),
+ B(LdaConstant), U8(217),
+ B(Star), R(0),
+ B(LdaConstant), U8(218),
+ B(Star), R(0),
+ B(LdaConstant), U8(219),
+ B(Star), R(0),
+ B(LdaConstant), U8(220),
+ B(Star), R(0),
+ B(LdaConstant), U8(221),
+ B(Star), R(0),
+ B(LdaConstant), U8(222),
+ B(Star), R(0),
+ B(LdaConstant), U8(223),
+ B(Star), R(0),
+ B(LdaConstant), U8(224),
+ B(Star), R(0),
+ B(LdaConstant), U8(225),
+ B(Star), R(0),
+ B(LdaConstant), U8(226),
+ B(Star), R(0),
+ B(LdaConstant), U8(227),
+ B(Star), R(0),
+ B(LdaConstant), U8(228),
+ B(Star), R(0),
+ B(LdaConstant), U8(229),
+ B(Star), R(0),
+ B(LdaConstant), U8(230),
+ B(Star), R(0),
+ B(LdaConstant), U8(231),
+ B(Star), R(0),
+ B(LdaConstant), U8(232),
+ B(Star), R(0),
+ B(LdaConstant), U8(233),
+ B(Star), R(0),
+ B(LdaConstant), U8(234),
+ B(Star), R(0),
+ B(LdaConstant), U8(235),
+ B(Star), R(0),
+ B(LdaConstant), U8(236),
+ B(Star), R(0),
+ B(LdaConstant), U8(237),
+ B(Star), R(0),
+ B(LdaConstant), U8(238),
+ B(Star), R(0),
+ B(LdaConstant), U8(239),
+ B(Star), R(0),
+ B(LdaConstant), U8(240),
+ B(Star), R(0),
+ B(LdaConstant), U8(241),
+ B(Star), R(0),
+ B(LdaConstant), U8(242),
+ B(Star), R(0),
+ B(LdaConstant), U8(243),
+ B(Star), R(0),
+ B(LdaConstant), U8(244),
+ B(Star), R(0),
+ B(LdaConstant), U8(245),
+ B(Star), R(0),
+ B(LdaConstant), U8(246),
+ B(Star), R(0),
+ B(LdaConstant), U8(247),
+ B(Star), R(0),
+ B(LdaConstant), U8(248),
+ B(Star), R(0),
+ B(LdaConstant), U8(249),
+ B(Star), R(0),
+ B(LdaConstant), U8(250),
+ B(Star), R(0),
+ B(LdaConstant), U8(251),
+ B(Star), R(0),
+ B(LdaConstant), U8(252),
+ B(Star), R(0),
+ B(LdaConstant), U8(253),
+ B(Star), R(0),
+ B(LdaConstant), U8(254),
+ B(Star), R(0),
+ B(LdaConstant), U8(255),
+ B(Star), R(0),
+ B(Wide), B(LdaLookupSlot), U16(256),
+ B(Return),
+]
+constant pool: [
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var f;
+ var x = 1;
+ function f1() {
+ eval(\"function t() {\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"return typeof x;\" +
+ \"};\" +
+ \"f = t; f();\"
+ );
+ }
+ f1();
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 1031
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(0),
+ B(LdaConstant), U8(1),
+ B(Star), R(0),
+ B(LdaConstant), U8(2),
+ B(Star), R(0),
+ B(LdaConstant), U8(3),
+ B(Star), R(0),
+ B(LdaConstant), U8(4),
+ B(Star), R(0),
+ B(LdaConstant), U8(5),
+ B(Star), R(0),
+ B(LdaConstant), U8(6),
+ B(Star), R(0),
+ B(LdaConstant), U8(7),
+ B(Star), R(0),
+ B(LdaConstant), U8(8),
+ B(Star), R(0),
+ B(LdaConstant), U8(9),
+ B(Star), R(0),
+ B(LdaConstant), U8(10),
+ B(Star), R(0),
+ B(LdaConstant), U8(11),
+ B(Star), R(0),
+ B(LdaConstant), U8(12),
+ B(Star), R(0),
+ B(LdaConstant), U8(13),
+ B(Star), R(0),
+ B(LdaConstant), U8(14),
+ B(Star), R(0),
+ B(LdaConstant), U8(15),
+ B(Star), R(0),
+ B(LdaConstant), U8(16),
+ B(Star), R(0),
+ B(LdaConstant), U8(17),
+ B(Star), R(0),
+ B(LdaConstant), U8(18),
+ B(Star), R(0),
+ B(LdaConstant), U8(19),
+ B(Star), R(0),
+ B(LdaConstant), U8(20),
+ B(Star), R(0),
+ B(LdaConstant), U8(21),
+ B(Star), R(0),
+ B(LdaConstant), U8(22),
+ B(Star), R(0),
+ B(LdaConstant), U8(23),
+ B(Star), R(0),
+ B(LdaConstant), U8(24),
+ B(Star), R(0),
+ B(LdaConstant), U8(25),
+ B(Star), R(0),
+ B(LdaConstant), U8(26),
+ B(Star), R(0),
+ B(LdaConstant), U8(27),
+ B(Star), R(0),
+ B(LdaConstant), U8(28),
+ B(Star), R(0),
+ B(LdaConstant), U8(29),
+ B(Star), R(0),
+ B(LdaConstant), U8(30),
+ B(Star), R(0),
+ B(LdaConstant), U8(31),
+ B(Star), R(0),
+ B(LdaConstant), U8(32),
+ B(Star), R(0),
+ B(LdaConstant), U8(33),
+ B(Star), R(0),
+ B(LdaConstant), U8(34),
+ B(Star), R(0),
+ B(LdaConstant), U8(35),
+ B(Star), R(0),
+ B(LdaConstant), U8(36),
+ B(Star), R(0),
+ B(LdaConstant), U8(37),
+ B(Star), R(0),
+ B(LdaConstant), U8(38),
+ B(Star), R(0),
+ B(LdaConstant), U8(39),
+ B(Star), R(0),
+ B(LdaConstant), U8(40),
+ B(Star), R(0),
+ B(LdaConstant), U8(41),
+ B(Star), R(0),
+ B(LdaConstant), U8(42),
+ B(Star), R(0),
+ B(LdaConstant), U8(43),
+ B(Star), R(0),
+ B(LdaConstant), U8(44),
+ B(Star), R(0),
+ B(LdaConstant), U8(45),
+ B(Star), R(0),
+ B(LdaConstant), U8(46),
+ B(Star), R(0),
+ B(LdaConstant), U8(47),
+ B(Star), R(0),
+ B(LdaConstant), U8(48),
+ B(Star), R(0),
+ B(LdaConstant), U8(49),
+ B(Star), R(0),
+ B(LdaConstant), U8(50),
+ B(Star), R(0),
+ B(LdaConstant), U8(51),
+ B(Star), R(0),
+ B(LdaConstant), U8(52),
+ B(Star), R(0),
+ B(LdaConstant), U8(53),
+ B(Star), R(0),
+ B(LdaConstant), U8(54),
+ B(Star), R(0),
+ B(LdaConstant), U8(55),
+ B(Star), R(0),
+ B(LdaConstant), U8(56),
+ B(Star), R(0),
+ B(LdaConstant), U8(57),
+ B(Star), R(0),
+ B(LdaConstant), U8(58),
+ B(Star), R(0),
+ B(LdaConstant), U8(59),
+ B(Star), R(0),
+ B(LdaConstant), U8(60),
+ B(Star), R(0),
+ B(LdaConstant), U8(61),
+ B(Star), R(0),
+ B(LdaConstant), U8(62),
+ B(Star), R(0),
+ B(LdaConstant), U8(63),
+ B(Star), R(0),
+ B(LdaConstant), U8(64),
+ B(Star), R(0),
+ B(LdaConstant), U8(65),
+ B(Star), R(0),
+ B(LdaConstant), U8(66),
+ B(Star), R(0),
+ B(LdaConstant), U8(67),
+ B(Star), R(0),
+ B(LdaConstant), U8(68),
+ B(Star), R(0),
+ B(LdaConstant), U8(69),
+ B(Star), R(0),
+ B(LdaConstant), U8(70),
+ B(Star), R(0),
+ B(LdaConstant), U8(71),
+ B(Star), R(0),
+ B(LdaConstant), U8(72),
+ B(Star), R(0),
+ B(LdaConstant), U8(73),
+ B(Star), R(0),
+ B(LdaConstant), U8(74),
+ B(Star), R(0),
+ B(LdaConstant), U8(75),
+ B(Star), R(0),
+ B(LdaConstant), U8(76),
+ B(Star), R(0),
+ B(LdaConstant), U8(77),
+ B(Star), R(0),
+ B(LdaConstant), U8(78),
+ B(Star), R(0),
+ B(LdaConstant), U8(79),
+ B(Star), R(0),
+ B(LdaConstant), U8(80),
+ B(Star), R(0),
+ B(LdaConstant), U8(81),
+ B(Star), R(0),
+ B(LdaConstant), U8(82),
+ B(Star), R(0),
+ B(LdaConstant), U8(83),
+ B(Star), R(0),
+ B(LdaConstant), U8(84),
+ B(Star), R(0),
+ B(LdaConstant), U8(85),
+ B(Star), R(0),
+ B(LdaConstant), U8(86),
+ B(Star), R(0),
+ B(LdaConstant), U8(87),
+ B(Star), R(0),
+ B(LdaConstant), U8(88),
+ B(Star), R(0),
+ B(LdaConstant), U8(89),
+ B(Star), R(0),
+ B(LdaConstant), U8(90),
+ B(Star), R(0),
+ B(LdaConstant), U8(91),
+ B(Star), R(0),
+ B(LdaConstant), U8(92),
+ B(Star), R(0),
+ B(LdaConstant), U8(93),
+ B(Star), R(0),
+ B(LdaConstant), U8(94),
+ B(Star), R(0),
+ B(LdaConstant), U8(95),
+ B(Star), R(0),
+ B(LdaConstant), U8(96),
+ B(Star), R(0),
+ B(LdaConstant), U8(97),
+ B(Star), R(0),
+ B(LdaConstant), U8(98),
+ B(Star), R(0),
+ B(LdaConstant), U8(99),
+ B(Star), R(0),
+ B(LdaConstant), U8(100),
+ B(Star), R(0),
+ B(LdaConstant), U8(101),
+ B(Star), R(0),
+ B(LdaConstant), U8(102),
+ B(Star), R(0),
+ B(LdaConstant), U8(103),
+ B(Star), R(0),
+ B(LdaConstant), U8(104),
+ B(Star), R(0),
+ B(LdaConstant), U8(105),
+ B(Star), R(0),
+ B(LdaConstant), U8(106),
+ B(Star), R(0),
+ B(LdaConstant), U8(107),
+ B(Star), R(0),
+ B(LdaConstant), U8(108),
+ B(Star), R(0),
+ B(LdaConstant), U8(109),
+ B(Star), R(0),
+ B(LdaConstant), U8(110),
+ B(Star), R(0),
+ B(LdaConstant), U8(111),
+ B(Star), R(0),
+ B(LdaConstant), U8(112),
+ B(Star), R(0),
+ B(LdaConstant), U8(113),
+ B(Star), R(0),
+ B(LdaConstant), U8(114),
+ B(Star), R(0),
+ B(LdaConstant), U8(115),
+ B(Star), R(0),
+ B(LdaConstant), U8(116),
+ B(Star), R(0),
+ B(LdaConstant), U8(117),
+ B(Star), R(0),
+ B(LdaConstant), U8(118),
+ B(Star), R(0),
+ B(LdaConstant), U8(119),
+ B(Star), R(0),
+ B(LdaConstant), U8(120),
+ B(Star), R(0),
+ B(LdaConstant), U8(121),
+ B(Star), R(0),
+ B(LdaConstant), U8(122),
+ B(Star), R(0),
+ B(LdaConstant), U8(123),
+ B(Star), R(0),
+ B(LdaConstant), U8(124),
+ B(Star), R(0),
+ B(LdaConstant), U8(125),
+ B(Star), R(0),
+ B(LdaConstant), U8(126),
+ B(Star), R(0),
+ B(LdaConstant), U8(127),
+ B(Star), R(0),
+ B(LdaConstant), U8(128),
+ B(Star), R(0),
+ B(LdaConstant), U8(129),
+ B(Star), R(0),
+ B(LdaConstant), U8(130),
+ B(Star), R(0),
+ B(LdaConstant), U8(131),
+ B(Star), R(0),
+ B(LdaConstant), U8(132),
+ B(Star), R(0),
+ B(LdaConstant), U8(133),
+ B(Star), R(0),
+ B(LdaConstant), U8(134),
+ B(Star), R(0),
+ B(LdaConstant), U8(135),
+ B(Star), R(0),
+ B(LdaConstant), U8(136),
+ B(Star), R(0),
+ B(LdaConstant), U8(137),
+ B(Star), R(0),
+ B(LdaConstant), U8(138),
+ B(Star), R(0),
+ B(LdaConstant), U8(139),
+ B(Star), R(0),
+ B(LdaConstant), U8(140),
+ B(Star), R(0),
+ B(LdaConstant), U8(141),
+ B(Star), R(0),
+ B(LdaConstant), U8(142),
+ B(Star), R(0),
+ B(LdaConstant), U8(143),
+ B(Star), R(0),
+ B(LdaConstant), U8(144),
+ B(Star), R(0),
+ B(LdaConstant), U8(145),
+ B(Star), R(0),
+ B(LdaConstant), U8(146),
+ B(Star), R(0),
+ B(LdaConstant), U8(147),
+ B(Star), R(0),
+ B(LdaConstant), U8(148),
+ B(Star), R(0),
+ B(LdaConstant), U8(149),
+ B(Star), R(0),
+ B(LdaConstant), U8(150),
+ B(Star), R(0),
+ B(LdaConstant), U8(151),
+ B(Star), R(0),
+ B(LdaConstant), U8(152),
+ B(Star), R(0),
+ B(LdaConstant), U8(153),
+ B(Star), R(0),
+ B(LdaConstant), U8(154),
+ B(Star), R(0),
+ B(LdaConstant), U8(155),
+ B(Star), R(0),
+ B(LdaConstant), U8(156),
+ B(Star), R(0),
+ B(LdaConstant), U8(157),
+ B(Star), R(0),
+ B(LdaConstant), U8(158),
+ B(Star), R(0),
+ B(LdaConstant), U8(159),
+ B(Star), R(0),
+ B(LdaConstant), U8(160),
+ B(Star), R(0),
+ B(LdaConstant), U8(161),
+ B(Star), R(0),
+ B(LdaConstant), U8(162),
+ B(Star), R(0),
+ B(LdaConstant), U8(163),
+ B(Star), R(0),
+ B(LdaConstant), U8(164),
+ B(Star), R(0),
+ B(LdaConstant), U8(165),
+ B(Star), R(0),
+ B(LdaConstant), U8(166),
+ B(Star), R(0),
+ B(LdaConstant), U8(167),
+ B(Star), R(0),
+ B(LdaConstant), U8(168),
+ B(Star), R(0),
+ B(LdaConstant), U8(169),
+ B(Star), R(0),
+ B(LdaConstant), U8(170),
+ B(Star), R(0),
+ B(LdaConstant), U8(171),
+ B(Star), R(0),
+ B(LdaConstant), U8(172),
+ B(Star), R(0),
+ B(LdaConstant), U8(173),
+ B(Star), R(0),
+ B(LdaConstant), U8(174),
+ B(Star), R(0),
+ B(LdaConstant), U8(175),
+ B(Star), R(0),
+ B(LdaConstant), U8(176),
+ B(Star), R(0),
+ B(LdaConstant), U8(177),
+ B(Star), R(0),
+ B(LdaConstant), U8(178),
+ B(Star), R(0),
+ B(LdaConstant), U8(179),
+ B(Star), R(0),
+ B(LdaConstant), U8(180),
+ B(Star), R(0),
+ B(LdaConstant), U8(181),
+ B(Star), R(0),
+ B(LdaConstant), U8(182),
+ B(Star), R(0),
+ B(LdaConstant), U8(183),
+ B(Star), R(0),
+ B(LdaConstant), U8(184),
+ B(Star), R(0),
+ B(LdaConstant), U8(185),
+ B(Star), R(0),
+ B(LdaConstant), U8(186),
+ B(Star), R(0),
+ B(LdaConstant), U8(187),
+ B(Star), R(0),
+ B(LdaConstant), U8(188),
+ B(Star), R(0),
+ B(LdaConstant), U8(189),
+ B(Star), R(0),
+ B(LdaConstant), U8(190),
+ B(Star), R(0),
+ B(LdaConstant), U8(191),
+ B(Star), R(0),
+ B(LdaConstant), U8(192),
+ B(Star), R(0),
+ B(LdaConstant), U8(193),
+ B(Star), R(0),
+ B(LdaConstant), U8(194),
+ B(Star), R(0),
+ B(LdaConstant), U8(195),
+ B(Star), R(0),
+ B(LdaConstant), U8(196),
+ B(Star), R(0),
+ B(LdaConstant), U8(197),
+ B(Star), R(0),
+ B(LdaConstant), U8(198),
+ B(Star), R(0),
+ B(LdaConstant), U8(199),
+ B(Star), R(0),
+ B(LdaConstant), U8(200),
+ B(Star), R(0),
+ B(LdaConstant), U8(201),
+ B(Star), R(0),
+ B(LdaConstant), U8(202),
+ B(Star), R(0),
+ B(LdaConstant), U8(203),
+ B(Star), R(0),
+ B(LdaConstant), U8(204),
+ B(Star), R(0),
+ B(LdaConstant), U8(205),
+ B(Star), R(0),
+ B(LdaConstant), U8(206),
+ B(Star), R(0),
+ B(LdaConstant), U8(207),
+ B(Star), R(0),
+ B(LdaConstant), U8(208),
+ B(Star), R(0),
+ B(LdaConstant), U8(209),
+ B(Star), R(0),
+ B(LdaConstant), U8(210),
+ B(Star), R(0),
+ B(LdaConstant), U8(211),
+ B(Star), R(0),
+ B(LdaConstant), U8(212),
+ B(Star), R(0),
+ B(LdaConstant), U8(213),
+ B(Star), R(0),
+ B(LdaConstant), U8(214),
+ B(Star), R(0),
+ B(LdaConstant), U8(215),
+ B(Star), R(0),
+ B(LdaConstant), U8(216),
+ B(Star), R(0),
+ B(LdaConstant), U8(217),
+ B(Star), R(0),
+ B(LdaConstant), U8(218),
+ B(Star), R(0),
+ B(LdaConstant), U8(219),
+ B(Star), R(0),
+ B(LdaConstant), U8(220),
+ B(Star), R(0),
+ B(LdaConstant), U8(221),
+ B(Star), R(0),
+ B(LdaConstant), U8(222),
+ B(Star), R(0),
+ B(LdaConstant), U8(223),
+ B(Star), R(0),
+ B(LdaConstant), U8(224),
+ B(Star), R(0),
+ B(LdaConstant), U8(225),
+ B(Star), R(0),
+ B(LdaConstant), U8(226),
+ B(Star), R(0),
+ B(LdaConstant), U8(227),
+ B(Star), R(0),
+ B(LdaConstant), U8(228),
+ B(Star), R(0),
+ B(LdaConstant), U8(229),
+ B(Star), R(0),
+ B(LdaConstant), U8(230),
+ B(Star), R(0),
+ B(LdaConstant), U8(231),
+ B(Star), R(0),
+ B(LdaConstant), U8(232),
+ B(Star), R(0),
+ B(LdaConstant), U8(233),
+ B(Star), R(0),
+ B(LdaConstant), U8(234),
+ B(Star), R(0),
+ B(LdaConstant), U8(235),
+ B(Star), R(0),
+ B(LdaConstant), U8(236),
+ B(Star), R(0),
+ B(LdaConstant), U8(237),
+ B(Star), R(0),
+ B(LdaConstant), U8(238),
+ B(Star), R(0),
+ B(LdaConstant), U8(239),
+ B(Star), R(0),
+ B(LdaConstant), U8(240),
+ B(Star), R(0),
+ B(LdaConstant), U8(241),
+ B(Star), R(0),
+ B(LdaConstant), U8(242),
+ B(Star), R(0),
+ B(LdaConstant), U8(243),
+ B(Star), R(0),
+ B(LdaConstant), U8(244),
+ B(Star), R(0),
+ B(LdaConstant), U8(245),
+ B(Star), R(0),
+ B(LdaConstant), U8(246),
+ B(Star), R(0),
+ B(LdaConstant), U8(247),
+ B(Star), R(0),
+ B(LdaConstant), U8(248),
+ B(Star), R(0),
+ B(LdaConstant), U8(249),
+ B(Star), R(0),
+ B(LdaConstant), U8(250),
+ B(Star), R(0),
+ B(LdaConstant), U8(251),
+ B(Star), R(0),
+ B(LdaConstant), U8(252),
+ B(Star), R(0),
+ B(LdaConstant), U8(253),
+ B(Star), R(0),
+ B(LdaConstant), U8(254),
+ B(Star), R(0),
+ B(LdaConstant), U8(255),
+ B(Star), R(0),
+ B(Wide), B(LdaLookupSlotInsideTypeof), U16(256),
+ B(TypeOf),
+ B(Return),
+]
+constant pool: [
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var f;
+ var x = 1;
+ function f1() {
+ eval(\"function t() {\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"x = 10;\" +
+ \"};\" +
+ \"f = t; f();\"
+ );
+ }
+ f1();
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 1033
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(0),
+ B(LdaConstant), U8(1),
+ B(Star), R(0),
+ B(LdaConstant), U8(2),
+ B(Star), R(0),
+ B(LdaConstant), U8(3),
+ B(Star), R(0),
+ B(LdaConstant), U8(4),
+ B(Star), R(0),
+ B(LdaConstant), U8(5),
+ B(Star), R(0),
+ B(LdaConstant), U8(6),
+ B(Star), R(0),
+ B(LdaConstant), U8(7),
+ B(Star), R(0),
+ B(LdaConstant), U8(8),
+ B(Star), R(0),
+ B(LdaConstant), U8(9),
+ B(Star), R(0),
+ B(LdaConstant), U8(10),
+ B(Star), R(0),
+ B(LdaConstant), U8(11),
+ B(Star), R(0),
+ B(LdaConstant), U8(12),
+ B(Star), R(0),
+ B(LdaConstant), U8(13),
+ B(Star), R(0),
+ B(LdaConstant), U8(14),
+ B(Star), R(0),
+ B(LdaConstant), U8(15),
+ B(Star), R(0),
+ B(LdaConstant), U8(16),
+ B(Star), R(0),
+ B(LdaConstant), U8(17),
+ B(Star), R(0),
+ B(LdaConstant), U8(18),
+ B(Star), R(0),
+ B(LdaConstant), U8(19),
+ B(Star), R(0),
+ B(LdaConstant), U8(20),
+ B(Star), R(0),
+ B(LdaConstant), U8(21),
+ B(Star), R(0),
+ B(LdaConstant), U8(22),
+ B(Star), R(0),
+ B(LdaConstant), U8(23),
+ B(Star), R(0),
+ B(LdaConstant), U8(24),
+ B(Star), R(0),
+ B(LdaConstant), U8(25),
+ B(Star), R(0),
+ B(LdaConstant), U8(26),
+ B(Star), R(0),
+ B(LdaConstant), U8(27),
+ B(Star), R(0),
+ B(LdaConstant), U8(28),
+ B(Star), R(0),
+ B(LdaConstant), U8(29),
+ B(Star), R(0),
+ B(LdaConstant), U8(30),
+ B(Star), R(0),
+ B(LdaConstant), U8(31),
+ B(Star), R(0),
+ B(LdaConstant), U8(32),
+ B(Star), R(0),
+ B(LdaConstant), U8(33),
+ B(Star), R(0),
+ B(LdaConstant), U8(34),
+ B(Star), R(0),
+ B(LdaConstant), U8(35),
+ B(Star), R(0),
+ B(LdaConstant), U8(36),
+ B(Star), R(0),
+ B(LdaConstant), U8(37),
+ B(Star), R(0),
+ B(LdaConstant), U8(38),
+ B(Star), R(0),
+ B(LdaConstant), U8(39),
+ B(Star), R(0),
+ B(LdaConstant), U8(40),
+ B(Star), R(0),
+ B(LdaConstant), U8(41),
+ B(Star), R(0),
+ B(LdaConstant), U8(42),
+ B(Star), R(0),
+ B(LdaConstant), U8(43),
+ B(Star), R(0),
+ B(LdaConstant), U8(44),
+ B(Star), R(0),
+ B(LdaConstant), U8(45),
+ B(Star), R(0),
+ B(LdaConstant), U8(46),
+ B(Star), R(0),
+ B(LdaConstant), U8(47),
+ B(Star), R(0),
+ B(LdaConstant), U8(48),
+ B(Star), R(0),
+ B(LdaConstant), U8(49),
+ B(Star), R(0),
+ B(LdaConstant), U8(50),
+ B(Star), R(0),
+ B(LdaConstant), U8(51),
+ B(Star), R(0),
+ B(LdaConstant), U8(52),
+ B(Star), R(0),
+ B(LdaConstant), U8(53),
+ B(Star), R(0),
+ B(LdaConstant), U8(54),
+ B(Star), R(0),
+ B(LdaConstant), U8(55),
+ B(Star), R(0),
+ B(LdaConstant), U8(56),
+ B(Star), R(0),
+ B(LdaConstant), U8(57),
+ B(Star), R(0),
+ B(LdaConstant), U8(58),
+ B(Star), R(0),
+ B(LdaConstant), U8(59),
+ B(Star), R(0),
+ B(LdaConstant), U8(60),
+ B(Star), R(0),
+ B(LdaConstant), U8(61),
+ B(Star), R(0),
+ B(LdaConstant), U8(62),
+ B(Star), R(0),
+ B(LdaConstant), U8(63),
+ B(Star), R(0),
+ B(LdaConstant), U8(64),
+ B(Star), R(0),
+ B(LdaConstant), U8(65),
+ B(Star), R(0),
+ B(LdaConstant), U8(66),
+ B(Star), R(0),
+ B(LdaConstant), U8(67),
+ B(Star), R(0),
+ B(LdaConstant), U8(68),
+ B(Star), R(0),
+ B(LdaConstant), U8(69),
+ B(Star), R(0),
+ B(LdaConstant), U8(70),
+ B(Star), R(0),
+ B(LdaConstant), U8(71),
+ B(Star), R(0),
+ B(LdaConstant), U8(72),
+ B(Star), R(0),
+ B(LdaConstant), U8(73),
+ B(Star), R(0),
+ B(LdaConstant), U8(74),
+ B(Star), R(0),
+ B(LdaConstant), U8(75),
+ B(Star), R(0),
+ B(LdaConstant), U8(76),
+ B(Star), R(0),
+ B(LdaConstant), U8(77),
+ B(Star), R(0),
+ B(LdaConstant), U8(78),
+ B(Star), R(0),
+ B(LdaConstant), U8(79),
+ B(Star), R(0),
+ B(LdaConstant), U8(80),
+ B(Star), R(0),
+ B(LdaConstant), U8(81),
+ B(Star), R(0),
+ B(LdaConstant), U8(82),
+ B(Star), R(0),
+ B(LdaConstant), U8(83),
+ B(Star), R(0),
+ B(LdaConstant), U8(84),
+ B(Star), R(0),
+ B(LdaConstant), U8(85),
+ B(Star), R(0),
+ B(LdaConstant), U8(86),
+ B(Star), R(0),
+ B(LdaConstant), U8(87),
+ B(Star), R(0),
+ B(LdaConstant), U8(88),
+ B(Star), R(0),
+ B(LdaConstant), U8(89),
+ B(Star), R(0),
+ B(LdaConstant), U8(90),
+ B(Star), R(0),
+ B(LdaConstant), U8(91),
+ B(Star), R(0),
+ B(LdaConstant), U8(92),
+ B(Star), R(0),
+ B(LdaConstant), U8(93),
+ B(Star), R(0),
+ B(LdaConstant), U8(94),
+ B(Star), R(0),
+ B(LdaConstant), U8(95),
+ B(Star), R(0),
+ B(LdaConstant), U8(96),
+ B(Star), R(0),
+ B(LdaConstant), U8(97),
+ B(Star), R(0),
+ B(LdaConstant), U8(98),
+ B(Star), R(0),
+ B(LdaConstant), U8(99),
+ B(Star), R(0),
+ B(LdaConstant), U8(100),
+ B(Star), R(0),
+ B(LdaConstant), U8(101),
+ B(Star), R(0),
+ B(LdaConstant), U8(102),
+ B(Star), R(0),
+ B(LdaConstant), U8(103),
+ B(Star), R(0),
+ B(LdaConstant), U8(104),
+ B(Star), R(0),
+ B(LdaConstant), U8(105),
+ B(Star), R(0),
+ B(LdaConstant), U8(106),
+ B(Star), R(0),
+ B(LdaConstant), U8(107),
+ B(Star), R(0),
+ B(LdaConstant), U8(108),
+ B(Star), R(0),
+ B(LdaConstant), U8(109),
+ B(Star), R(0),
+ B(LdaConstant), U8(110),
+ B(Star), R(0),
+ B(LdaConstant), U8(111),
+ B(Star), R(0),
+ B(LdaConstant), U8(112),
+ B(Star), R(0),
+ B(LdaConstant), U8(113),
+ B(Star), R(0),
+ B(LdaConstant), U8(114),
+ B(Star), R(0),
+ B(LdaConstant), U8(115),
+ B(Star), R(0),
+ B(LdaConstant), U8(116),
+ B(Star), R(0),
+ B(LdaConstant), U8(117),
+ B(Star), R(0),
+ B(LdaConstant), U8(118),
+ B(Star), R(0),
+ B(LdaConstant), U8(119),
+ B(Star), R(0),
+ B(LdaConstant), U8(120),
+ B(Star), R(0),
+ B(LdaConstant), U8(121),
+ B(Star), R(0),
+ B(LdaConstant), U8(122),
+ B(Star), R(0),
+ B(LdaConstant), U8(123),
+ B(Star), R(0),
+ B(LdaConstant), U8(124),
+ B(Star), R(0),
+ B(LdaConstant), U8(125),
+ B(Star), R(0),
+ B(LdaConstant), U8(126),
+ B(Star), R(0),
+ B(LdaConstant), U8(127),
+ B(Star), R(0),
+ B(LdaConstant), U8(128),
+ B(Star), R(0),
+ B(LdaConstant), U8(129),
+ B(Star), R(0),
+ B(LdaConstant), U8(130),
+ B(Star), R(0),
+ B(LdaConstant), U8(131),
+ B(Star), R(0),
+ B(LdaConstant), U8(132),
+ B(Star), R(0),
+ B(LdaConstant), U8(133),
+ B(Star), R(0),
+ B(LdaConstant), U8(134),
+ B(Star), R(0),
+ B(LdaConstant), U8(135),
+ B(Star), R(0),
+ B(LdaConstant), U8(136),
+ B(Star), R(0),
+ B(LdaConstant), U8(137),
+ B(Star), R(0),
+ B(LdaConstant), U8(138),
+ B(Star), R(0),
+ B(LdaConstant), U8(139),
+ B(Star), R(0),
+ B(LdaConstant), U8(140),
+ B(Star), R(0),
+ B(LdaConstant), U8(141),
+ B(Star), R(0),
+ B(LdaConstant), U8(142),
+ B(Star), R(0),
+ B(LdaConstant), U8(143),
+ B(Star), R(0),
+ B(LdaConstant), U8(144),
+ B(Star), R(0),
+ B(LdaConstant), U8(145),
+ B(Star), R(0),
+ B(LdaConstant), U8(146),
+ B(Star), R(0),
+ B(LdaConstant), U8(147),
+ B(Star), R(0),
+ B(LdaConstant), U8(148),
+ B(Star), R(0),
+ B(LdaConstant), U8(149),
+ B(Star), R(0),
+ B(LdaConstant), U8(150),
+ B(Star), R(0),
+ B(LdaConstant), U8(151),
+ B(Star), R(0),
+ B(LdaConstant), U8(152),
+ B(Star), R(0),
+ B(LdaConstant), U8(153),
+ B(Star), R(0),
+ B(LdaConstant), U8(154),
+ B(Star), R(0),
+ B(LdaConstant), U8(155),
+ B(Star), R(0),
+ B(LdaConstant), U8(156),
+ B(Star), R(0),
+ B(LdaConstant), U8(157),
+ B(Star), R(0),
+ B(LdaConstant), U8(158),
+ B(Star), R(0),
+ B(LdaConstant), U8(159),
+ B(Star), R(0),
+ B(LdaConstant), U8(160),
+ B(Star), R(0),
+ B(LdaConstant), U8(161),
+ B(Star), R(0),
+ B(LdaConstant), U8(162),
+ B(Star), R(0),
+ B(LdaConstant), U8(163),
+ B(Star), R(0),
+ B(LdaConstant), U8(164),
+ B(Star), R(0),
+ B(LdaConstant), U8(165),
+ B(Star), R(0),
+ B(LdaConstant), U8(166),
+ B(Star), R(0),
+ B(LdaConstant), U8(167),
+ B(Star), R(0),
+ B(LdaConstant), U8(168),
+ B(Star), R(0),
+ B(LdaConstant), U8(169),
+ B(Star), R(0),
+ B(LdaConstant), U8(170),
+ B(Star), R(0),
+ B(LdaConstant), U8(171),
+ B(Star), R(0),
+ B(LdaConstant), U8(172),
+ B(Star), R(0),
+ B(LdaConstant), U8(173),
+ B(Star), R(0),
+ B(LdaConstant), U8(174),
+ B(Star), R(0),
+ B(LdaConstant), U8(175),
+ B(Star), R(0),
+ B(LdaConstant), U8(176),
+ B(Star), R(0),
+ B(LdaConstant), U8(177),
+ B(Star), R(0),
+ B(LdaConstant), U8(178),
+ B(Star), R(0),
+ B(LdaConstant), U8(179),
+ B(Star), R(0),
+ B(LdaConstant), U8(180),
+ B(Star), R(0),
+ B(LdaConstant), U8(181),
+ B(Star), R(0),
+ B(LdaConstant), U8(182),
+ B(Star), R(0),
+ B(LdaConstant), U8(183),
+ B(Star), R(0),
+ B(LdaConstant), U8(184),
+ B(Star), R(0),
+ B(LdaConstant), U8(185),
+ B(Star), R(0),
+ B(LdaConstant), U8(186),
+ B(Star), R(0),
+ B(LdaConstant), U8(187),
+ B(Star), R(0),
+ B(LdaConstant), U8(188),
+ B(Star), R(0),
+ B(LdaConstant), U8(189),
+ B(Star), R(0),
+ B(LdaConstant), U8(190),
+ B(Star), R(0),
+ B(LdaConstant), U8(191),
+ B(Star), R(0),
+ B(LdaConstant), U8(192),
+ B(Star), R(0),
+ B(LdaConstant), U8(193),
+ B(Star), R(0),
+ B(LdaConstant), U8(194),
+ B(Star), R(0),
+ B(LdaConstant), U8(195),
+ B(Star), R(0),
+ B(LdaConstant), U8(196),
+ B(Star), R(0),
+ B(LdaConstant), U8(197),
+ B(Star), R(0),
+ B(LdaConstant), U8(198),
+ B(Star), R(0),
+ B(LdaConstant), U8(199),
+ B(Star), R(0),
+ B(LdaConstant), U8(200),
+ B(Star), R(0),
+ B(LdaConstant), U8(201),
+ B(Star), R(0),
+ B(LdaConstant), U8(202),
+ B(Star), R(0),
+ B(LdaConstant), U8(203),
+ B(Star), R(0),
+ B(LdaConstant), U8(204),
+ B(Star), R(0),
+ B(LdaConstant), U8(205),
+ B(Star), R(0),
+ B(LdaConstant), U8(206),
+ B(Star), R(0),
+ B(LdaConstant), U8(207),
+ B(Star), R(0),
+ B(LdaConstant), U8(208),
+ B(Star), R(0),
+ B(LdaConstant), U8(209),
+ B(Star), R(0),
+ B(LdaConstant), U8(210),
+ B(Star), R(0),
+ B(LdaConstant), U8(211),
+ B(Star), R(0),
+ B(LdaConstant), U8(212),
+ B(Star), R(0),
+ B(LdaConstant), U8(213),
+ B(Star), R(0),
+ B(LdaConstant), U8(214),
+ B(Star), R(0),
+ B(LdaConstant), U8(215),
+ B(Star), R(0),
+ B(LdaConstant), U8(216),
+ B(Star), R(0),
+ B(LdaConstant), U8(217),
+ B(Star), R(0),
+ B(LdaConstant), U8(218),
+ B(Star), R(0),
+ B(LdaConstant), U8(219),
+ B(Star), R(0),
+ B(LdaConstant), U8(220),
+ B(Star), R(0),
+ B(LdaConstant), U8(221),
+ B(Star), R(0),
+ B(LdaConstant), U8(222),
+ B(Star), R(0),
+ B(LdaConstant), U8(223),
+ B(Star), R(0),
+ B(LdaConstant), U8(224),
+ B(Star), R(0),
+ B(LdaConstant), U8(225),
+ B(Star), R(0),
+ B(LdaConstant), U8(226),
+ B(Star), R(0),
+ B(LdaConstant), U8(227),
+ B(Star), R(0),
+ B(LdaConstant), U8(228),
+ B(Star), R(0),
+ B(LdaConstant), U8(229),
+ B(Star), R(0),
+ B(LdaConstant), U8(230),
+ B(Star), R(0),
+ B(LdaConstant), U8(231),
+ B(Star), R(0),
+ B(LdaConstant), U8(232),
+ B(Star), R(0),
+ B(LdaConstant), U8(233),
+ B(Star), R(0),
+ B(LdaConstant), U8(234),
+ B(Star), R(0),
+ B(LdaConstant), U8(235),
+ B(Star), R(0),
+ B(LdaConstant), U8(236),
+ B(Star), R(0),
+ B(LdaConstant), U8(237),
+ B(Star), R(0),
+ B(LdaConstant), U8(238),
+ B(Star), R(0),
+ B(LdaConstant), U8(239),
+ B(Star), R(0),
+ B(LdaConstant), U8(240),
+ B(Star), R(0),
+ B(LdaConstant), U8(241),
+ B(Star), R(0),
+ B(LdaConstant), U8(242),
+ B(Star), R(0),
+ B(LdaConstant), U8(243),
+ B(Star), R(0),
+ B(LdaConstant), U8(244),
+ B(Star), R(0),
+ B(LdaConstant), U8(245),
+ B(Star), R(0),
+ B(LdaConstant), U8(246),
+ B(Star), R(0),
+ B(LdaConstant), U8(247),
+ B(Star), R(0),
+ B(LdaConstant), U8(248),
+ B(Star), R(0),
+ B(LdaConstant), U8(249),
+ B(Star), R(0),
+ B(LdaConstant), U8(250),
+ B(Star), R(0),
+ B(LdaConstant), U8(251),
+ B(Star), R(0),
+ B(LdaConstant), U8(252),
+ B(Star), R(0),
+ B(LdaConstant), U8(253),
+ B(Star), R(0),
+ B(LdaConstant), U8(254),
+ B(Star), R(0),
+ B(LdaConstant), U8(255),
+ B(Star), R(0),
+ B(LdaSmi), U8(10),
+ B(Wide), B(StaLookupSlotSloppy), U16(256),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var f;
+ var x = 1;
+ function f1() {
+ eval(\"function t() {\" +
+ \"'use strict';\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"var y = 2.3;\" +
+ \"x = 10;\" +
+ \"};\" +
+ \"f = t; f();\"
+ );
+ }
+ f1();
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 1033
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(0),
+ B(LdaConstant), U8(1),
+ B(Star), R(0),
+ B(LdaConstant), U8(2),
+ B(Star), R(0),
+ B(LdaConstant), U8(3),
+ B(Star), R(0),
+ B(LdaConstant), U8(4),
+ B(Star), R(0),
+ B(LdaConstant), U8(5),
+ B(Star), R(0),
+ B(LdaConstant), U8(6),
+ B(Star), R(0),
+ B(LdaConstant), U8(7),
+ B(Star), R(0),
+ B(LdaConstant), U8(8),
+ B(Star), R(0),
+ B(LdaConstant), U8(9),
+ B(Star), R(0),
+ B(LdaConstant), U8(10),
+ B(Star), R(0),
+ B(LdaConstant), U8(11),
+ B(Star), R(0),
+ B(LdaConstant), U8(12),
+ B(Star), R(0),
+ B(LdaConstant), U8(13),
+ B(Star), R(0),
+ B(LdaConstant), U8(14),
+ B(Star), R(0),
+ B(LdaConstant), U8(15),
+ B(Star), R(0),
+ B(LdaConstant), U8(16),
+ B(Star), R(0),
+ B(LdaConstant), U8(17),
+ B(Star), R(0),
+ B(LdaConstant), U8(18),
+ B(Star), R(0),
+ B(LdaConstant), U8(19),
+ B(Star), R(0),
+ B(LdaConstant), U8(20),
+ B(Star), R(0),
+ B(LdaConstant), U8(21),
+ B(Star), R(0),
+ B(LdaConstant), U8(22),
+ B(Star), R(0),
+ B(LdaConstant), U8(23),
+ B(Star), R(0),
+ B(LdaConstant), U8(24),
+ B(Star), R(0),
+ B(LdaConstant), U8(25),
+ B(Star), R(0),
+ B(LdaConstant), U8(26),
+ B(Star), R(0),
+ B(LdaConstant), U8(27),
+ B(Star), R(0),
+ B(LdaConstant), U8(28),
+ B(Star), R(0),
+ B(LdaConstant), U8(29),
+ B(Star), R(0),
+ B(LdaConstant), U8(30),
+ B(Star), R(0),
+ B(LdaConstant), U8(31),
+ B(Star), R(0),
+ B(LdaConstant), U8(32),
+ B(Star), R(0),
+ B(LdaConstant), U8(33),
+ B(Star), R(0),
+ B(LdaConstant), U8(34),
+ B(Star), R(0),
+ B(LdaConstant), U8(35),
+ B(Star), R(0),
+ B(LdaConstant), U8(36),
+ B(Star), R(0),
+ B(LdaConstant), U8(37),
+ B(Star), R(0),
+ B(LdaConstant), U8(38),
+ B(Star), R(0),
+ B(LdaConstant), U8(39),
+ B(Star), R(0),
+ B(LdaConstant), U8(40),
+ B(Star), R(0),
+ B(LdaConstant), U8(41),
+ B(Star), R(0),
+ B(LdaConstant), U8(42),
+ B(Star), R(0),
+ B(LdaConstant), U8(43),
+ B(Star), R(0),
+ B(LdaConstant), U8(44),
+ B(Star), R(0),
+ B(LdaConstant), U8(45),
+ B(Star), R(0),
+ B(LdaConstant), U8(46),
+ B(Star), R(0),
+ B(LdaConstant), U8(47),
+ B(Star), R(0),
+ B(LdaConstant), U8(48),
+ B(Star), R(0),
+ B(LdaConstant), U8(49),
+ B(Star), R(0),
+ B(LdaConstant), U8(50),
+ B(Star), R(0),
+ B(LdaConstant), U8(51),
+ B(Star), R(0),
+ B(LdaConstant), U8(52),
+ B(Star), R(0),
+ B(LdaConstant), U8(53),
+ B(Star), R(0),
+ B(LdaConstant), U8(54),
+ B(Star), R(0),
+ B(LdaConstant), U8(55),
+ B(Star), R(0),
+ B(LdaConstant), U8(56),
+ B(Star), R(0),
+ B(LdaConstant), U8(57),
+ B(Star), R(0),
+ B(LdaConstant), U8(58),
+ B(Star), R(0),
+ B(LdaConstant), U8(59),
+ B(Star), R(0),
+ B(LdaConstant), U8(60),
+ B(Star), R(0),
+ B(LdaConstant), U8(61),
+ B(Star), R(0),
+ B(LdaConstant), U8(62),
+ B(Star), R(0),
+ B(LdaConstant), U8(63),
+ B(Star), R(0),
+ B(LdaConstant), U8(64),
+ B(Star), R(0),
+ B(LdaConstant), U8(65),
+ B(Star), R(0),
+ B(LdaConstant), U8(66),
+ B(Star), R(0),
+ B(LdaConstant), U8(67),
+ B(Star), R(0),
+ B(LdaConstant), U8(68),
+ B(Star), R(0),
+ B(LdaConstant), U8(69),
+ B(Star), R(0),
+ B(LdaConstant), U8(70),
+ B(Star), R(0),
+ B(LdaConstant), U8(71),
+ B(Star), R(0),
+ B(LdaConstant), U8(72),
+ B(Star), R(0),
+ B(LdaConstant), U8(73),
+ B(Star), R(0),
+ B(LdaConstant), U8(74),
+ B(Star), R(0),
+ B(LdaConstant), U8(75),
+ B(Star), R(0),
+ B(LdaConstant), U8(76),
+ B(Star), R(0),
+ B(LdaConstant), U8(77),
+ B(Star), R(0),
+ B(LdaConstant), U8(78),
+ B(Star), R(0),
+ B(LdaConstant), U8(79),
+ B(Star), R(0),
+ B(LdaConstant), U8(80),
+ B(Star), R(0),
+ B(LdaConstant), U8(81),
+ B(Star), R(0),
+ B(LdaConstant), U8(82),
+ B(Star), R(0),
+ B(LdaConstant), U8(83),
+ B(Star), R(0),
+ B(LdaConstant), U8(84),
+ B(Star), R(0),
+ B(LdaConstant), U8(85),
+ B(Star), R(0),
+ B(LdaConstant), U8(86),
+ B(Star), R(0),
+ B(LdaConstant), U8(87),
+ B(Star), R(0),
+ B(LdaConstant), U8(88),
+ B(Star), R(0),
+ B(LdaConstant), U8(89),
+ B(Star), R(0),
+ B(LdaConstant), U8(90),
+ B(Star), R(0),
+ B(LdaConstant), U8(91),
+ B(Star), R(0),
+ B(LdaConstant), U8(92),
+ B(Star), R(0),
+ B(LdaConstant), U8(93),
+ B(Star), R(0),
+ B(LdaConstant), U8(94),
+ B(Star), R(0),
+ B(LdaConstant), U8(95),
+ B(Star), R(0),
+ B(LdaConstant), U8(96),
+ B(Star), R(0),
+ B(LdaConstant), U8(97),
+ B(Star), R(0),
+ B(LdaConstant), U8(98),
+ B(Star), R(0),
+ B(LdaConstant), U8(99),
+ B(Star), R(0),
+ B(LdaConstant), U8(100),
+ B(Star), R(0),
+ B(LdaConstant), U8(101),
+ B(Star), R(0),
+ B(LdaConstant), U8(102),
+ B(Star), R(0),
+ B(LdaConstant), U8(103),
+ B(Star), R(0),
+ B(LdaConstant), U8(104),
+ B(Star), R(0),
+ B(LdaConstant), U8(105),
+ B(Star), R(0),
+ B(LdaConstant), U8(106),
+ B(Star), R(0),
+ B(LdaConstant), U8(107),
+ B(Star), R(0),
+ B(LdaConstant), U8(108),
+ B(Star), R(0),
+ B(LdaConstant), U8(109),
+ B(Star), R(0),
+ B(LdaConstant), U8(110),
+ B(Star), R(0),
+ B(LdaConstant), U8(111),
+ B(Star), R(0),
+ B(LdaConstant), U8(112),
+ B(Star), R(0),
+ B(LdaConstant), U8(113),
+ B(Star), R(0),
+ B(LdaConstant), U8(114),
+ B(Star), R(0),
+ B(LdaConstant), U8(115),
+ B(Star), R(0),
+ B(LdaConstant), U8(116),
+ B(Star), R(0),
+ B(LdaConstant), U8(117),
+ B(Star), R(0),
+ B(LdaConstant), U8(118),
+ B(Star), R(0),
+ B(LdaConstant), U8(119),
+ B(Star), R(0),
+ B(LdaConstant), U8(120),
+ B(Star), R(0),
+ B(LdaConstant), U8(121),
+ B(Star), R(0),
+ B(LdaConstant), U8(122),
+ B(Star), R(0),
+ B(LdaConstant), U8(123),
+ B(Star), R(0),
+ B(LdaConstant), U8(124),
+ B(Star), R(0),
+ B(LdaConstant), U8(125),
+ B(Star), R(0),
+ B(LdaConstant), U8(126),
+ B(Star), R(0),
+ B(LdaConstant), U8(127),
+ B(Star), R(0),
+ B(LdaConstant), U8(128),
+ B(Star), R(0),
+ B(LdaConstant), U8(129),
+ B(Star), R(0),
+ B(LdaConstant), U8(130),
+ B(Star), R(0),
+ B(LdaConstant), U8(131),
+ B(Star), R(0),
+ B(LdaConstant), U8(132),
+ B(Star), R(0),
+ B(LdaConstant), U8(133),
+ B(Star), R(0),
+ B(LdaConstant), U8(134),
+ B(Star), R(0),
+ B(LdaConstant), U8(135),
+ B(Star), R(0),
+ B(LdaConstant), U8(136),
+ B(Star), R(0),
+ B(LdaConstant), U8(137),
+ B(Star), R(0),
+ B(LdaConstant), U8(138),
+ B(Star), R(0),
+ B(LdaConstant), U8(139),
+ B(Star), R(0),
+ B(LdaConstant), U8(140),
+ B(Star), R(0),
+ B(LdaConstant), U8(141),
+ B(Star), R(0),
+ B(LdaConstant), U8(142),
+ B(Star), R(0),
+ B(LdaConstant), U8(143),
+ B(Star), R(0),
+ B(LdaConstant), U8(144),
+ B(Star), R(0),
+ B(LdaConstant), U8(145),
+ B(Star), R(0),
+ B(LdaConstant), U8(146),
+ B(Star), R(0),
+ B(LdaConstant), U8(147),
+ B(Star), R(0),
+ B(LdaConstant), U8(148),
+ B(Star), R(0),
+ B(LdaConstant), U8(149),
+ B(Star), R(0),
+ B(LdaConstant), U8(150),
+ B(Star), R(0),
+ B(LdaConstant), U8(151),
+ B(Star), R(0),
+ B(LdaConstant), U8(152),
+ B(Star), R(0),
+ B(LdaConstant), U8(153),
+ B(Star), R(0),
+ B(LdaConstant), U8(154),
+ B(Star), R(0),
+ B(LdaConstant), U8(155),
+ B(Star), R(0),
+ B(LdaConstant), U8(156),
+ B(Star), R(0),
+ B(LdaConstant), U8(157),
+ B(Star), R(0),
+ B(LdaConstant), U8(158),
+ B(Star), R(0),
+ B(LdaConstant), U8(159),
+ B(Star), R(0),
+ B(LdaConstant), U8(160),
+ B(Star), R(0),
+ B(LdaConstant), U8(161),
+ B(Star), R(0),
+ B(LdaConstant), U8(162),
+ B(Star), R(0),
+ B(LdaConstant), U8(163),
+ B(Star), R(0),
+ B(LdaConstant), U8(164),
+ B(Star), R(0),
+ B(LdaConstant), U8(165),
+ B(Star), R(0),
+ B(LdaConstant), U8(166),
+ B(Star), R(0),
+ B(LdaConstant), U8(167),
+ B(Star), R(0),
+ B(LdaConstant), U8(168),
+ B(Star), R(0),
+ B(LdaConstant), U8(169),
+ B(Star), R(0),
+ B(LdaConstant), U8(170),
+ B(Star), R(0),
+ B(LdaConstant), U8(171),
+ B(Star), R(0),
+ B(LdaConstant), U8(172),
+ B(Star), R(0),
+ B(LdaConstant), U8(173),
+ B(Star), R(0),
+ B(LdaConstant), U8(174),
+ B(Star), R(0),
+ B(LdaConstant), U8(175),
+ B(Star), R(0),
+ B(LdaConstant), U8(176),
+ B(Star), R(0),
+ B(LdaConstant), U8(177),
+ B(Star), R(0),
+ B(LdaConstant), U8(178),
+ B(Star), R(0),
+ B(LdaConstant), U8(179),
+ B(Star), R(0),
+ B(LdaConstant), U8(180),
+ B(Star), R(0),
+ B(LdaConstant), U8(181),
+ B(Star), R(0),
+ B(LdaConstant), U8(182),
+ B(Star), R(0),
+ B(LdaConstant), U8(183),
+ B(Star), R(0),
+ B(LdaConstant), U8(184),
+ B(Star), R(0),
+ B(LdaConstant), U8(185),
+ B(Star), R(0),
+ B(LdaConstant), U8(186),
+ B(Star), R(0),
+ B(LdaConstant), U8(187),
+ B(Star), R(0),
+ B(LdaConstant), U8(188),
+ B(Star), R(0),
+ B(LdaConstant), U8(189),
+ B(Star), R(0),
+ B(LdaConstant), U8(190),
+ B(Star), R(0),
+ B(LdaConstant), U8(191),
+ B(Star), R(0),
+ B(LdaConstant), U8(192),
+ B(Star), R(0),
+ B(LdaConstant), U8(193),
+ B(Star), R(0),
+ B(LdaConstant), U8(194),
+ B(Star), R(0),
+ B(LdaConstant), U8(195),
+ B(Star), R(0),
+ B(LdaConstant), U8(196),
+ B(Star), R(0),
+ B(LdaConstant), U8(197),
+ B(Star), R(0),
+ B(LdaConstant), U8(198),
+ B(Star), R(0),
+ B(LdaConstant), U8(199),
+ B(Star), R(0),
+ B(LdaConstant), U8(200),
+ B(Star), R(0),
+ B(LdaConstant), U8(201),
+ B(Star), R(0),
+ B(LdaConstant), U8(202),
+ B(Star), R(0),
+ B(LdaConstant), U8(203),
+ B(Star), R(0),
+ B(LdaConstant), U8(204),
+ B(Star), R(0),
+ B(LdaConstant), U8(205),
+ B(Star), R(0),
+ B(LdaConstant), U8(206),
+ B(Star), R(0),
+ B(LdaConstant), U8(207),
+ B(Star), R(0),
+ B(LdaConstant), U8(208),
+ B(Star), R(0),
+ B(LdaConstant), U8(209),
+ B(Star), R(0),
+ B(LdaConstant), U8(210),
+ B(Star), R(0),
+ B(LdaConstant), U8(211),
+ B(Star), R(0),
+ B(LdaConstant), U8(212),
+ B(Star), R(0),
+ B(LdaConstant), U8(213),
+ B(Star), R(0),
+ B(LdaConstant), U8(214),
+ B(Star), R(0),
+ B(LdaConstant), U8(215),
+ B(Star), R(0),
+ B(LdaConstant), U8(216),
+ B(Star), R(0),
+ B(LdaConstant), U8(217),
+ B(Star), R(0),
+ B(LdaConstant), U8(218),
+ B(Star), R(0),
+ B(LdaConstant), U8(219),
+ B(Star), R(0),
+ B(LdaConstant), U8(220),
+ B(Star), R(0),
+ B(LdaConstant), U8(221),
+ B(Star), R(0),
+ B(LdaConstant), U8(222),
+ B(Star), R(0),
+ B(LdaConstant), U8(223),
+ B(Star), R(0),
+ B(LdaConstant), U8(224),
+ B(Star), R(0),
+ B(LdaConstant), U8(225),
+ B(Star), R(0),
+ B(LdaConstant), U8(226),
+ B(Star), R(0),
+ B(LdaConstant), U8(227),
+ B(Star), R(0),
+ B(LdaConstant), U8(228),
+ B(Star), R(0),
+ B(LdaConstant), U8(229),
+ B(Star), R(0),
+ B(LdaConstant), U8(230),
+ B(Star), R(0),
+ B(LdaConstant), U8(231),
+ B(Star), R(0),
+ B(LdaConstant), U8(232),
+ B(Star), R(0),
+ B(LdaConstant), U8(233),
+ B(Star), R(0),
+ B(LdaConstant), U8(234),
+ B(Star), R(0),
+ B(LdaConstant), U8(235),
+ B(Star), R(0),
+ B(LdaConstant), U8(236),
+ B(Star), R(0),
+ B(LdaConstant), U8(237),
+ B(Star), R(0),
+ B(LdaConstant), U8(238),
+ B(Star), R(0),
+ B(LdaConstant), U8(239),
+ B(Star), R(0),
+ B(LdaConstant), U8(240),
+ B(Star), R(0),
+ B(LdaConstant), U8(241),
+ B(Star), R(0),
+ B(LdaConstant), U8(242),
+ B(Star), R(0),
+ B(LdaConstant), U8(243),
+ B(Star), R(0),
+ B(LdaConstant), U8(244),
+ B(Star), R(0),
+ B(LdaConstant), U8(245),
+ B(Star), R(0),
+ B(LdaConstant), U8(246),
+ B(Star), R(0),
+ B(LdaConstant), U8(247),
+ B(Star), R(0),
+ B(LdaConstant), U8(248),
+ B(Star), R(0),
+ B(LdaConstant), U8(249),
+ B(Star), R(0),
+ B(LdaConstant), U8(250),
+ B(Star), R(0),
+ B(LdaConstant), U8(251),
+ B(Star), R(0),
+ B(LdaConstant), U8(252),
+ B(Star), R(0),
+ B(LdaConstant), U8(253),
+ B(Star), R(0),
+ B(LdaConstant), U8(254),
+ B(Star), R(0),
+ B(LdaConstant), U8(255),
+ B(Star), R(0),
+ B(LdaSmi), U8(10),
+ B(Wide), B(StaLookupSlotStrict), U16(256),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/NewTarget.golden b/test/cctest/interpreter/bytecode_expectations/NewTarget.golden
new file mode 100644
index 0000000..da2d35e
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/NewTarget.golden
@@ -0,0 +1,58 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ return new.target;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 19
+bytecodes: [
+ B(Ldar), R(new_target),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(0),
+ B(Star), R(1),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(1), U8(1),
+ B(Return),
+]
+constant pool: [
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ new.target;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 20
+bytecodes: [
+ B(Ldar), R(new_target),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(JumpIfNotHole), U8(11),
+ B(LdaConstant), U8(0),
+ B(Star), R(1),
+ B(CallRuntime), U16(Runtime::kThrowReferenceError), R(1), U8(1),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/ObjectLiterals.golden b/test/cctest/interpreter/bytecode_expectations/ObjectLiterals.golden
new file mode 100644
index 0000000..063ebbf
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/ObjectLiterals.golden
@@ -0,0 +1,463 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ return { };
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 8
+bytecodes: [
+ B(StackCheck),
+ B(CreateObjectLiteral), U8(0), U8(0), U8(7),
+ B(Star), R(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ return { name: 'string', val: 9.2 };
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 8
+bytecodes: [
+ B(StackCheck),
+ B(CreateObjectLiteral), U8(0), U8(0), U8(5),
+ B(Star), R(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1; return { name: 'string', val: a };
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 20
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(CreateObjectLiteral), U8(0), U8(0), U8(5),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(StoreICSloppy), R(1), U8(1), U8(1),
+ B(Ldar), R(1),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1; return { val: a, val: a + 1 };
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 26
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(CreateObjectLiteral), U8(0), U8(0), U8(5),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(Add), R(2),
+ B(StoreICSloppy), R(1), U8(1), U8(1),
+ B(Ldar), R(1),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ return { func: function() { } };
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 17
+bytecodes: [
+ B(StackCheck),
+ B(CreateObjectLiteral), U8(0), U8(0), U8(5),
+ B(Star), R(0),
+ B(CreateClosure), U8(1), U8(0),
+ B(StoreICSloppy), R(0), U8(2), U8(1),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ return { func(a) { return a; } };
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 17
+bytecodes: [
+ B(StackCheck),
+ B(CreateObjectLiteral), U8(0), U8(0), U8(5),
+ B(Star), R(0),
+ B(CreateClosure), U8(1), U8(0),
+ B(StoreICSloppy), R(0), U8(2), U8(1),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ return { get a() { return 2; } };
+"
+frame size: 6
+parameter count: 1
+bytecode array length: 33
+bytecodes: [
+ B(StackCheck),
+ B(CreateObjectLiteral), U8(0), U8(0), U8(5),
+ B(Star), R(0),
+ B(Mov), R(0), R(1),
+ B(LdaConstant), U8(1),
+ B(Star), R(2),
+ B(CreateClosure), U8(2), U8(0),
+ B(Star), R(3),
+ B(LdaNull),
+ B(Star), R(4),
+ B(LdaZero),
+ B(Star), R(5),
+ B(CallRuntime), U16(Runtime::kDefineAccessorPropertyUnchecked), R(1), U8(5),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ return { get a() { return this.x; }, set a(val) { this.x = val } };
+"
+frame size: 6
+parameter count: 1
+bytecode array length: 35
+bytecodes: [
+ B(StackCheck),
+ B(CreateObjectLiteral), U8(0), U8(0), U8(5),
+ B(Star), R(0),
+ B(Mov), R(0), R(1),
+ B(LdaConstant), U8(1),
+ B(Star), R(2),
+ B(CreateClosure), U8(2), U8(0),
+ B(Star), R(3),
+ B(CreateClosure), U8(3), U8(0),
+ B(Star), R(4),
+ B(LdaZero),
+ B(Star), R(5),
+ B(CallRuntime), U16(Runtime::kDefineAccessorPropertyUnchecked), R(1), U8(5),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ return { set b(val) { this.y = val } };
+"
+frame size: 6
+parameter count: 1
+bytecode array length: 33
+bytecodes: [
+ B(StackCheck),
+ B(CreateObjectLiteral), U8(0), U8(0), U8(5),
+ B(Star), R(0),
+ B(Mov), R(0), R(1),
+ B(LdaConstant), U8(1),
+ B(Star), R(2),
+ B(LdaNull),
+ B(Star), R(3),
+ B(CreateClosure), U8(2), U8(0),
+ B(Star), R(4),
+ B(LdaZero),
+ B(Star), R(5),
+ B(CallRuntime), U16(Runtime::kDefineAccessorPropertyUnchecked), R(1), U8(5),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1; return { 1: a };
+"
+frame size: 6
+parameter count: 1
+bytecode array length: 33
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(CreateObjectLiteral), U8(0), U8(0), U8(5),
+ B(Star), R(1),
+ B(Mov), R(1), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(3),
+ B(Ldar), R(0),
+ B(Star), R(4),
+ B(LdaZero),
+ B(Star), R(5),
+ B(CallRuntime), U16(Runtime::kSetProperty), R(2), U8(4),
+ B(Ldar), R(1),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ return { __proto__: null };
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 21
+bytecodes: [
+ B(StackCheck),
+ B(CreateObjectLiteral), U8(0), U8(0), U8(7),
+ B(Star), R(0),
+ B(Mov), R(0), R(1),
+ B(LdaNull),
+ B(Star), R(2),
+ B(CallRuntime), U16(Runtime::kInternalSetPrototype), R(1), U8(2),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 'test'; return { [a]: 1 };
+"
+frame size: 7
+parameter count: 1
+bytecode array length: 37
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(0),
+ B(CreateObjectLiteral), U8(1), U8(0), U8(7),
+ B(Star), R(1),
+ B(Mov), R(1), R(2),
+ B(Ldar), R(0),
+ B(ToName),
+ B(Star), R(3),
+ B(LdaSmi), U8(1),
+ B(Star), R(4),
+ B(LdaZero),
+ B(Star), R(5),
+ B(LdaZero),
+ B(Star), R(6),
+ B(CallRuntime), U16(Runtime::kDefineDataPropertyInLiteral), R(2), U8(5),
+ B(Ldar), R(1),
+ B(Return),
+]
+constant pool: [
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::FIXED_ARRAY_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 'test'; return { val: a, [a]: 1 };
+"
+frame size: 7
+parameter count: 1
+bytecode array length: 43
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(0),
+ B(CreateObjectLiteral), U8(1), U8(0), U8(5),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(StoreICSloppy), R(1), U8(2), U8(1),
+ B(Mov), R(1), R(2),
+ B(Ldar), R(0),
+ B(ToName),
+ B(Star), R(3),
+ B(LdaSmi), U8(1),
+ B(Star), R(4),
+ B(LdaZero),
+ B(Star), R(5),
+ B(LdaZero),
+ B(Star), R(6),
+ B(CallRuntime), U16(Runtime::kDefineDataPropertyInLiteral), R(2), U8(5),
+ B(Ldar), R(1),
+ B(Return),
+]
+constant pool: [
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 'test'; return { [a]: 1, __proto__: {} };
+"
+frame size: 7
+parameter count: 1
+bytecode array length: 53
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(0),
+ B(CreateObjectLiteral), U8(1), U8(1), U8(7),
+ B(Star), R(1),
+ B(Mov), R(1), R(2),
+ B(Ldar), R(0),
+ B(ToName),
+ B(Star), R(3),
+ B(LdaSmi), U8(1),
+ B(Star), R(4),
+ B(LdaZero),
+ B(Star), R(5),
+ B(LdaZero),
+ B(Star), R(6),
+ B(CallRuntime), U16(Runtime::kDefineDataPropertyInLiteral), R(2), U8(5),
+ B(Mov), R(1), R(2),
+ B(CreateObjectLiteral), U8(1), U8(0), U8(7),
+ B(Star), R(4),
+ B(Star), R(3),
+ B(CallRuntime), U16(Runtime::kInternalSetPrototype), R(2), U8(2),
+ B(Ldar), R(1),
+ B(Return),
+]
+constant pool: [
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::FIXED_ARRAY_TYPE,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var n = 'name'; return { [n]: 'val', get a() { }, set a(b) {} };
+"
+frame size: 7
+parameter count: 1
+bytecode array length: 77
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(0),
+ B(CreateObjectLiteral), U8(1), U8(0), U8(7),
+ B(Star), R(1),
+ B(Mov), R(1), R(2),
+ B(Ldar), R(0),
+ B(ToName),
+ B(Star), R(3),
+ B(LdaConstant), U8(2),
+ B(Star), R(4),
+ B(LdaZero),
+ B(Star), R(5),
+ B(LdaZero),
+ B(Star), R(6),
+ B(CallRuntime), U16(Runtime::kDefineDataPropertyInLiteral), R(2), U8(5),
+ B(Mov), R(1), R(2),
+ B(LdaConstant), U8(3),
+ B(Star), R(3),
+ B(CreateClosure), U8(4), U8(0),
+ B(Star), R(4),
+ B(LdaZero),
+ B(Star), R(5),
+ B(CallRuntime), U16(Runtime::kDefineGetterPropertyUnchecked), R(2), U8(4),
+ B(Mov), R(1), R(2),
+ B(LdaConstant), U8(3),
+ B(Star), R(3),
+ B(CreateClosure), U8(5), U8(0),
+ B(Star), R(4),
+ B(LdaZero),
+ B(Star), R(5),
+ B(CallRuntime), U16(Runtime::kDefineSetterPropertyUnchecked), R(2), U8(4),
+ B(Ldar), R(1),
+ B(Return),
+]
+constant pool: [
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/ObjectLiteralsWide.golden b/test/cctest/interpreter/bytecode_expectations/ObjectLiteralsWide.golden
new file mode 100644
index 0000000..83c6fe9
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/ObjectLiteralsWide.golden
@@ -0,0 +1,1053 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ var a;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ return { name: 'string', val: 9.2 };
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 1035
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(0),
+ B(LdaConstant), U8(1),
+ B(Star), R(0),
+ B(LdaConstant), U8(2),
+ B(Star), R(0),
+ B(LdaConstant), U8(3),
+ B(Star), R(0),
+ B(LdaConstant), U8(4),
+ B(Star), R(0),
+ B(LdaConstant), U8(5),
+ B(Star), R(0),
+ B(LdaConstant), U8(6),
+ B(Star), R(0),
+ B(LdaConstant), U8(7),
+ B(Star), R(0),
+ B(LdaConstant), U8(8),
+ B(Star), R(0),
+ B(LdaConstant), U8(9),
+ B(Star), R(0),
+ B(LdaConstant), U8(10),
+ B(Star), R(0),
+ B(LdaConstant), U8(11),
+ B(Star), R(0),
+ B(LdaConstant), U8(12),
+ B(Star), R(0),
+ B(LdaConstant), U8(13),
+ B(Star), R(0),
+ B(LdaConstant), U8(14),
+ B(Star), R(0),
+ B(LdaConstant), U8(15),
+ B(Star), R(0),
+ B(LdaConstant), U8(16),
+ B(Star), R(0),
+ B(LdaConstant), U8(17),
+ B(Star), R(0),
+ B(LdaConstant), U8(18),
+ B(Star), R(0),
+ B(LdaConstant), U8(19),
+ B(Star), R(0),
+ B(LdaConstant), U8(20),
+ B(Star), R(0),
+ B(LdaConstant), U8(21),
+ B(Star), R(0),
+ B(LdaConstant), U8(22),
+ B(Star), R(0),
+ B(LdaConstant), U8(23),
+ B(Star), R(0),
+ B(LdaConstant), U8(24),
+ B(Star), R(0),
+ B(LdaConstant), U8(25),
+ B(Star), R(0),
+ B(LdaConstant), U8(26),
+ B(Star), R(0),
+ B(LdaConstant), U8(27),
+ B(Star), R(0),
+ B(LdaConstant), U8(28),
+ B(Star), R(0),
+ B(LdaConstant), U8(29),
+ B(Star), R(0),
+ B(LdaConstant), U8(30),
+ B(Star), R(0),
+ B(LdaConstant), U8(31),
+ B(Star), R(0),
+ B(LdaConstant), U8(32),
+ B(Star), R(0),
+ B(LdaConstant), U8(33),
+ B(Star), R(0),
+ B(LdaConstant), U8(34),
+ B(Star), R(0),
+ B(LdaConstant), U8(35),
+ B(Star), R(0),
+ B(LdaConstant), U8(36),
+ B(Star), R(0),
+ B(LdaConstant), U8(37),
+ B(Star), R(0),
+ B(LdaConstant), U8(38),
+ B(Star), R(0),
+ B(LdaConstant), U8(39),
+ B(Star), R(0),
+ B(LdaConstant), U8(40),
+ B(Star), R(0),
+ B(LdaConstant), U8(41),
+ B(Star), R(0),
+ B(LdaConstant), U8(42),
+ B(Star), R(0),
+ B(LdaConstant), U8(43),
+ B(Star), R(0),
+ B(LdaConstant), U8(44),
+ B(Star), R(0),
+ B(LdaConstant), U8(45),
+ B(Star), R(0),
+ B(LdaConstant), U8(46),
+ B(Star), R(0),
+ B(LdaConstant), U8(47),
+ B(Star), R(0),
+ B(LdaConstant), U8(48),
+ B(Star), R(0),
+ B(LdaConstant), U8(49),
+ B(Star), R(0),
+ B(LdaConstant), U8(50),
+ B(Star), R(0),
+ B(LdaConstant), U8(51),
+ B(Star), R(0),
+ B(LdaConstant), U8(52),
+ B(Star), R(0),
+ B(LdaConstant), U8(53),
+ B(Star), R(0),
+ B(LdaConstant), U8(54),
+ B(Star), R(0),
+ B(LdaConstant), U8(55),
+ B(Star), R(0),
+ B(LdaConstant), U8(56),
+ B(Star), R(0),
+ B(LdaConstant), U8(57),
+ B(Star), R(0),
+ B(LdaConstant), U8(58),
+ B(Star), R(0),
+ B(LdaConstant), U8(59),
+ B(Star), R(0),
+ B(LdaConstant), U8(60),
+ B(Star), R(0),
+ B(LdaConstant), U8(61),
+ B(Star), R(0),
+ B(LdaConstant), U8(62),
+ B(Star), R(0),
+ B(LdaConstant), U8(63),
+ B(Star), R(0),
+ B(LdaConstant), U8(64),
+ B(Star), R(0),
+ B(LdaConstant), U8(65),
+ B(Star), R(0),
+ B(LdaConstant), U8(66),
+ B(Star), R(0),
+ B(LdaConstant), U8(67),
+ B(Star), R(0),
+ B(LdaConstant), U8(68),
+ B(Star), R(0),
+ B(LdaConstant), U8(69),
+ B(Star), R(0),
+ B(LdaConstant), U8(70),
+ B(Star), R(0),
+ B(LdaConstant), U8(71),
+ B(Star), R(0),
+ B(LdaConstant), U8(72),
+ B(Star), R(0),
+ B(LdaConstant), U8(73),
+ B(Star), R(0),
+ B(LdaConstant), U8(74),
+ B(Star), R(0),
+ B(LdaConstant), U8(75),
+ B(Star), R(0),
+ B(LdaConstant), U8(76),
+ B(Star), R(0),
+ B(LdaConstant), U8(77),
+ B(Star), R(0),
+ B(LdaConstant), U8(78),
+ B(Star), R(0),
+ B(LdaConstant), U8(79),
+ B(Star), R(0),
+ B(LdaConstant), U8(80),
+ B(Star), R(0),
+ B(LdaConstant), U8(81),
+ B(Star), R(0),
+ B(LdaConstant), U8(82),
+ B(Star), R(0),
+ B(LdaConstant), U8(83),
+ B(Star), R(0),
+ B(LdaConstant), U8(84),
+ B(Star), R(0),
+ B(LdaConstant), U8(85),
+ B(Star), R(0),
+ B(LdaConstant), U8(86),
+ B(Star), R(0),
+ B(LdaConstant), U8(87),
+ B(Star), R(0),
+ B(LdaConstant), U8(88),
+ B(Star), R(0),
+ B(LdaConstant), U8(89),
+ B(Star), R(0),
+ B(LdaConstant), U8(90),
+ B(Star), R(0),
+ B(LdaConstant), U8(91),
+ B(Star), R(0),
+ B(LdaConstant), U8(92),
+ B(Star), R(0),
+ B(LdaConstant), U8(93),
+ B(Star), R(0),
+ B(LdaConstant), U8(94),
+ B(Star), R(0),
+ B(LdaConstant), U8(95),
+ B(Star), R(0),
+ B(LdaConstant), U8(96),
+ B(Star), R(0),
+ B(LdaConstant), U8(97),
+ B(Star), R(0),
+ B(LdaConstant), U8(98),
+ B(Star), R(0),
+ B(LdaConstant), U8(99),
+ B(Star), R(0),
+ B(LdaConstant), U8(100),
+ B(Star), R(0),
+ B(LdaConstant), U8(101),
+ B(Star), R(0),
+ B(LdaConstant), U8(102),
+ B(Star), R(0),
+ B(LdaConstant), U8(103),
+ B(Star), R(0),
+ B(LdaConstant), U8(104),
+ B(Star), R(0),
+ B(LdaConstant), U8(105),
+ B(Star), R(0),
+ B(LdaConstant), U8(106),
+ B(Star), R(0),
+ B(LdaConstant), U8(107),
+ B(Star), R(0),
+ B(LdaConstant), U8(108),
+ B(Star), R(0),
+ B(LdaConstant), U8(109),
+ B(Star), R(0),
+ B(LdaConstant), U8(110),
+ B(Star), R(0),
+ B(LdaConstant), U8(111),
+ B(Star), R(0),
+ B(LdaConstant), U8(112),
+ B(Star), R(0),
+ B(LdaConstant), U8(113),
+ B(Star), R(0),
+ B(LdaConstant), U8(114),
+ B(Star), R(0),
+ B(LdaConstant), U8(115),
+ B(Star), R(0),
+ B(LdaConstant), U8(116),
+ B(Star), R(0),
+ B(LdaConstant), U8(117),
+ B(Star), R(0),
+ B(LdaConstant), U8(118),
+ B(Star), R(0),
+ B(LdaConstant), U8(119),
+ B(Star), R(0),
+ B(LdaConstant), U8(120),
+ B(Star), R(0),
+ B(LdaConstant), U8(121),
+ B(Star), R(0),
+ B(LdaConstant), U8(122),
+ B(Star), R(0),
+ B(LdaConstant), U8(123),
+ B(Star), R(0),
+ B(LdaConstant), U8(124),
+ B(Star), R(0),
+ B(LdaConstant), U8(125),
+ B(Star), R(0),
+ B(LdaConstant), U8(126),
+ B(Star), R(0),
+ B(LdaConstant), U8(127),
+ B(Star), R(0),
+ B(LdaConstant), U8(128),
+ B(Star), R(0),
+ B(LdaConstant), U8(129),
+ B(Star), R(0),
+ B(LdaConstant), U8(130),
+ B(Star), R(0),
+ B(LdaConstant), U8(131),
+ B(Star), R(0),
+ B(LdaConstant), U8(132),
+ B(Star), R(0),
+ B(LdaConstant), U8(133),
+ B(Star), R(0),
+ B(LdaConstant), U8(134),
+ B(Star), R(0),
+ B(LdaConstant), U8(135),
+ B(Star), R(0),
+ B(LdaConstant), U8(136),
+ B(Star), R(0),
+ B(LdaConstant), U8(137),
+ B(Star), R(0),
+ B(LdaConstant), U8(138),
+ B(Star), R(0),
+ B(LdaConstant), U8(139),
+ B(Star), R(0),
+ B(LdaConstant), U8(140),
+ B(Star), R(0),
+ B(LdaConstant), U8(141),
+ B(Star), R(0),
+ B(LdaConstant), U8(142),
+ B(Star), R(0),
+ B(LdaConstant), U8(143),
+ B(Star), R(0),
+ B(LdaConstant), U8(144),
+ B(Star), R(0),
+ B(LdaConstant), U8(145),
+ B(Star), R(0),
+ B(LdaConstant), U8(146),
+ B(Star), R(0),
+ B(LdaConstant), U8(147),
+ B(Star), R(0),
+ B(LdaConstant), U8(148),
+ B(Star), R(0),
+ B(LdaConstant), U8(149),
+ B(Star), R(0),
+ B(LdaConstant), U8(150),
+ B(Star), R(0),
+ B(LdaConstant), U8(151),
+ B(Star), R(0),
+ B(LdaConstant), U8(152),
+ B(Star), R(0),
+ B(LdaConstant), U8(153),
+ B(Star), R(0),
+ B(LdaConstant), U8(154),
+ B(Star), R(0),
+ B(LdaConstant), U8(155),
+ B(Star), R(0),
+ B(LdaConstant), U8(156),
+ B(Star), R(0),
+ B(LdaConstant), U8(157),
+ B(Star), R(0),
+ B(LdaConstant), U8(158),
+ B(Star), R(0),
+ B(LdaConstant), U8(159),
+ B(Star), R(0),
+ B(LdaConstant), U8(160),
+ B(Star), R(0),
+ B(LdaConstant), U8(161),
+ B(Star), R(0),
+ B(LdaConstant), U8(162),
+ B(Star), R(0),
+ B(LdaConstant), U8(163),
+ B(Star), R(0),
+ B(LdaConstant), U8(164),
+ B(Star), R(0),
+ B(LdaConstant), U8(165),
+ B(Star), R(0),
+ B(LdaConstant), U8(166),
+ B(Star), R(0),
+ B(LdaConstant), U8(167),
+ B(Star), R(0),
+ B(LdaConstant), U8(168),
+ B(Star), R(0),
+ B(LdaConstant), U8(169),
+ B(Star), R(0),
+ B(LdaConstant), U8(170),
+ B(Star), R(0),
+ B(LdaConstant), U8(171),
+ B(Star), R(0),
+ B(LdaConstant), U8(172),
+ B(Star), R(0),
+ B(LdaConstant), U8(173),
+ B(Star), R(0),
+ B(LdaConstant), U8(174),
+ B(Star), R(0),
+ B(LdaConstant), U8(175),
+ B(Star), R(0),
+ B(LdaConstant), U8(176),
+ B(Star), R(0),
+ B(LdaConstant), U8(177),
+ B(Star), R(0),
+ B(LdaConstant), U8(178),
+ B(Star), R(0),
+ B(LdaConstant), U8(179),
+ B(Star), R(0),
+ B(LdaConstant), U8(180),
+ B(Star), R(0),
+ B(LdaConstant), U8(181),
+ B(Star), R(0),
+ B(LdaConstant), U8(182),
+ B(Star), R(0),
+ B(LdaConstant), U8(183),
+ B(Star), R(0),
+ B(LdaConstant), U8(184),
+ B(Star), R(0),
+ B(LdaConstant), U8(185),
+ B(Star), R(0),
+ B(LdaConstant), U8(186),
+ B(Star), R(0),
+ B(LdaConstant), U8(187),
+ B(Star), R(0),
+ B(LdaConstant), U8(188),
+ B(Star), R(0),
+ B(LdaConstant), U8(189),
+ B(Star), R(0),
+ B(LdaConstant), U8(190),
+ B(Star), R(0),
+ B(LdaConstant), U8(191),
+ B(Star), R(0),
+ B(LdaConstant), U8(192),
+ B(Star), R(0),
+ B(LdaConstant), U8(193),
+ B(Star), R(0),
+ B(LdaConstant), U8(194),
+ B(Star), R(0),
+ B(LdaConstant), U8(195),
+ B(Star), R(0),
+ B(LdaConstant), U8(196),
+ B(Star), R(0),
+ B(LdaConstant), U8(197),
+ B(Star), R(0),
+ B(LdaConstant), U8(198),
+ B(Star), R(0),
+ B(LdaConstant), U8(199),
+ B(Star), R(0),
+ B(LdaConstant), U8(200),
+ B(Star), R(0),
+ B(LdaConstant), U8(201),
+ B(Star), R(0),
+ B(LdaConstant), U8(202),
+ B(Star), R(0),
+ B(LdaConstant), U8(203),
+ B(Star), R(0),
+ B(LdaConstant), U8(204),
+ B(Star), R(0),
+ B(LdaConstant), U8(205),
+ B(Star), R(0),
+ B(LdaConstant), U8(206),
+ B(Star), R(0),
+ B(LdaConstant), U8(207),
+ B(Star), R(0),
+ B(LdaConstant), U8(208),
+ B(Star), R(0),
+ B(LdaConstant), U8(209),
+ B(Star), R(0),
+ B(LdaConstant), U8(210),
+ B(Star), R(0),
+ B(LdaConstant), U8(211),
+ B(Star), R(0),
+ B(LdaConstant), U8(212),
+ B(Star), R(0),
+ B(LdaConstant), U8(213),
+ B(Star), R(0),
+ B(LdaConstant), U8(214),
+ B(Star), R(0),
+ B(LdaConstant), U8(215),
+ B(Star), R(0),
+ B(LdaConstant), U8(216),
+ B(Star), R(0),
+ B(LdaConstant), U8(217),
+ B(Star), R(0),
+ B(LdaConstant), U8(218),
+ B(Star), R(0),
+ B(LdaConstant), U8(219),
+ B(Star), R(0),
+ B(LdaConstant), U8(220),
+ B(Star), R(0),
+ B(LdaConstant), U8(221),
+ B(Star), R(0),
+ B(LdaConstant), U8(222),
+ B(Star), R(0),
+ B(LdaConstant), U8(223),
+ B(Star), R(0),
+ B(LdaConstant), U8(224),
+ B(Star), R(0),
+ B(LdaConstant), U8(225),
+ B(Star), R(0),
+ B(LdaConstant), U8(226),
+ B(Star), R(0),
+ B(LdaConstant), U8(227),
+ B(Star), R(0),
+ B(LdaConstant), U8(228),
+ B(Star), R(0),
+ B(LdaConstant), U8(229),
+ B(Star), R(0),
+ B(LdaConstant), U8(230),
+ B(Star), R(0),
+ B(LdaConstant), U8(231),
+ B(Star), R(0),
+ B(LdaConstant), U8(232),
+ B(Star), R(0),
+ B(LdaConstant), U8(233),
+ B(Star), R(0),
+ B(LdaConstant), U8(234),
+ B(Star), R(0),
+ B(LdaConstant), U8(235),
+ B(Star), R(0),
+ B(LdaConstant), U8(236),
+ B(Star), R(0),
+ B(LdaConstant), U8(237),
+ B(Star), R(0),
+ B(LdaConstant), U8(238),
+ B(Star), R(0),
+ B(LdaConstant), U8(239),
+ B(Star), R(0),
+ B(LdaConstant), U8(240),
+ B(Star), R(0),
+ B(LdaConstant), U8(241),
+ B(Star), R(0),
+ B(LdaConstant), U8(242),
+ B(Star), R(0),
+ B(LdaConstant), U8(243),
+ B(Star), R(0),
+ B(LdaConstant), U8(244),
+ B(Star), R(0),
+ B(LdaConstant), U8(245),
+ B(Star), R(0),
+ B(LdaConstant), U8(246),
+ B(Star), R(0),
+ B(LdaConstant), U8(247),
+ B(Star), R(0),
+ B(LdaConstant), U8(248),
+ B(Star), R(0),
+ B(LdaConstant), U8(249),
+ B(Star), R(0),
+ B(LdaConstant), U8(250),
+ B(Star), R(0),
+ B(LdaConstant), U8(251),
+ B(Star), R(0),
+ B(LdaConstant), U8(252),
+ B(Star), R(0),
+ B(LdaConstant), U8(253),
+ B(Star), R(0),
+ B(LdaConstant), U8(254),
+ B(Star), R(0),
+ B(LdaConstant), U8(255),
+ B(Star), R(0),
+ B(Wide), B(CreateObjectLiteral), U16(256), U16(0), U8(5),
+ B(Star), R(1),
+ B(Return),
+]
+constant pool: [
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::FIXED_ARRAY_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/OuterContextVariables.golden b/test/cctest/interpreter/bytecode_expectations/OuterContextVariables.golden
new file mode 100644
index 0000000..378a5b7
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/OuterContextVariables.golden
@@ -0,0 +1,75 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: no
+test function name: f
+
+---
+snippet: "
+ function Outer() {
+ var outerVar = 1;
+ function Inner(innerArg) {
+ this.innerFunc = function() { return outerVar * innerArg; }
+ }
+ this.getInnerFunc = function() { return new Inner(1).innerFunc; }
+ }
+ var f = new Outer().getInnerFunc();
+ f();
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 21
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(context),
+ B(Star), R(0),
+ B(LdaContextSlot), R(0), U8(1),
+ B(Star), R(0),
+ B(LdaContextSlot), R(0), U8(4),
+ B(Star), R(1),
+ B(LdaContextSlot), R(context), U8(4),
+ B(Mul), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function Outer() {
+ var outerVar = 1;
+ function Inner(innerArg) {
+ this.innerFunc = function() { outerVar = innerArg; }
+ }
+ this.getInnerFunc = function() { return new Inner(1).innerFunc; }
+ }
+ var f = new Outer().getInnerFunc();
+ f();
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 22
+bytecodes: [
+ B(StackCheck),
+ B(LdaContextSlot), R(context), U8(4),
+ B(Star), R(0),
+ B(Ldar), R(context),
+ B(Star), R(1),
+ B(LdaContextSlot), R(1), U8(1),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(StaContextSlot), R(1), U8(4),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/Parameters.golden b/test/cctest/interpreter/bytecode_expectations/Parameters.golden
new file mode 100644
index 0000000..e124788
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/Parameters.golden
@@ -0,0 +1,140 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: no
+test function name: f
+
+---
+snippet: "
+ function f() { return this; }
+ f();
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 4
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(this),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(arg1) { return arg1; }
+ f();
+"
+frame size: 0
+parameter count: 2
+bytecode array length: 4
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(arg1) { return this; }
+ f();
+"
+frame size: 0
+parameter count: 2
+bytecode array length: 4
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(this),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(arg1, arg2, arg3, arg4, arg5, arg6, arg7) { return arg4; }
+ f();
+"
+frame size: 0
+parameter count: 8
+bytecode array length: 4
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg3),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(arg1, arg2, arg3, arg4, arg5, arg6, arg7) { return this; }
+ f();
+"
+frame size: 0
+parameter count: 8
+bytecode array length: 4
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(this),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(arg1) { arg1 = 1; }
+ f();
+"
+frame size: 0
+parameter count: 2
+bytecode array length: 7
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(arg0),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(arg1, arg2, arg3, arg4) { arg2 = 1; }
+ f();
+"
+frame size: 0
+parameter count: 5
+bytecode array length: 7
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(arg1),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/PrimitiveExpressions.golden b/test/cctest/interpreter/bytecode_expectations/PrimitiveExpressions.golden
new file mode 100644
index 0000000..08b20dd
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/PrimitiveExpressions.golden
@@ -0,0 +1,277 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: number
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ var x = 0; return x;
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 5
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 0; return x + 3;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 11
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(3),
+ B(Add), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 0; return x - 3;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 11
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(3),
+ B(Sub), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 4; return x * 3;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 12
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(4),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(3),
+ B(Mul), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 4; return x / 3;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 12
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(4),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(3),
+ B(Div), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 4; return x % 3;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 12
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(4),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(3),
+ B(Mod), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 1; return x | 2;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 12
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(BitwiseOr), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 1; return x ^ 2;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 12
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(BitwiseXor), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 1; return x & 2;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 12
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(BitwiseAnd), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 10; return x << 3;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 12
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(10),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(3),
+ B(ShiftLeft), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 10; return x >> 3;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 12
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(10),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(3),
+ B(ShiftRight), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 10; return x >>> 3;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 12
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(10),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(3),
+ B(ShiftRightLogical), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 0; return (x, 3);
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 7
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(LdaSmi), U8(3),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/PrimitiveReturnStatements.golden b/test/cctest/interpreter/bytecode_expectations/PrimitiveReturnStatements.golden
new file mode 100644
index 0000000..0a23f2b
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/PrimitiveReturnStatements.golden
@@ -0,0 +1,178 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: number
+execute: yes
+wrap: yes
+
+---
+snippet: "
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 3
+bytecodes: [
+ B(StackCheck),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ return;
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 3
+bytecodes: [
+ B(StackCheck),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ return null;
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 3
+bytecodes: [
+ B(StackCheck),
+ B(LdaNull),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ return true;
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 3
+bytecodes: [
+ B(StackCheck),
+ B(LdaTrue),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ return false;
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 3
+bytecodes: [
+ B(StackCheck),
+ B(LdaFalse),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ return 0;
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 3
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ return +1;
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 4
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ return -1;
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 4
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(-1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ return +127;
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 4
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(127),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ return -128;
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 4
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(-128),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/PropertyCall.golden b/test/cctest/interpreter/bytecode_expectations/PropertyCall.golden
new file mode 100644
index 0000000..d6108f1
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/PropertyCall.golden
@@ -0,0 +1,626 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: no
+test function name: f
+
+---
+snippet: "
+ function f(a) { return a.func(); }
+ f(new (function Obj() { this.func = function() { return; }})())
+"
+frame size: 2
+parameter count: 2
+bytecode array length: 17
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(3),
+ B(Star), R(0),
+ B(Call), R(0), R(1), U8(1), U8(1),
+ B(Return),
+]
+constant pool: [
+ "func",
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a, b, c) { return a.func(b, c); }
+ f(new (function Obj() { this.func = function() { return; }})(), 1, 2)
+"
+frame size: 4
+parameter count: 4
+bytecode array length: 25
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(3),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(2),
+ B(Ldar), R(arg2),
+ B(Star), R(3),
+ B(Call), R(0), R(1), U8(3), U8(1),
+ B(Return),
+]
+constant pool: [
+ "func",
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a, b) { return a.func(b + b, b); }
+ f(new (function Obj() { this.func = function() { return; }})(), 1)
+"
+frame size: 4
+parameter count: 3
+bytecode array length: 31
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(3),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(3),
+ B(Ldar), R(arg1),
+ B(Add), R(3),
+ B(Star), R(2),
+ B(Ldar), R(arg1),
+ B(Star), R(3),
+ B(Call), R(0), R(1), U8(3), U8(1),
+ B(Return),
+]
+constant pool: [
+ "func",
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a) {
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ a.func;
+ return a.func(); }
+ f(new (function Obj() { this.func = function() { return; }})())
+"
+frame size: 2
+parameter count: 2
+bytecode array length: 1050
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(1),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(3),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(5),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(7),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(9),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(11),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(13),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(15),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(17),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(19),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(21),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(23),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(25),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(27),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(29),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(31),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(33),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(35),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(37),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(39),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(41),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(43),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(45),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(47),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(49),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(51),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(53),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(55),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(57),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(59),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(61),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(63),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(65),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(67),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(69),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(71),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(73),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(75),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(77),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(79),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(81),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(83),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(85),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(87),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(89),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(91),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(93),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(95),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(97),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(99),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(101),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(103),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(105),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(107),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(109),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(111),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(113),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(115),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(117),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(119),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(121),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(123),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(125),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(127),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(129),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(131),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(133),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(135),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(137),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(139),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(141),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(143),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(145),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(147),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(149),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(151),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(153),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(155),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(157),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(159),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(161),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(163),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(165),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(167),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(169),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(171),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(173),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(175),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(177),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(179),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(181),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(183),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(185),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(187),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(189),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(191),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(193),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(195),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(197),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(199),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(201),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(203),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(205),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(207),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(209),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(211),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(213),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(215),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(217),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(219),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(221),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(223),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(225),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(227),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(229),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(231),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(233),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(235),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(237),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(239),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(241),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(243),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(245),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(247),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(249),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(251),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(253),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(255),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Wide), B(LoadIC), R16(1), U16(0), U16(259),
+ B(Star), R(0),
+ B(Wide), B(Call), R16(0), R16(1), U16(1), U16(257),
+ B(Return),
+]
+constant pool: [
+ "func",
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/PropertyLoads.golden b/test/cctest/interpreter/bytecode_expectations/PropertyLoads.golden
new file mode 100644
index 0000000..7d5a58e
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/PropertyLoads.golden
@@ -0,0 +1,1576 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: no
+test function name: f
+
+---
+snippet: "
+ function f(a) { return a.name; }
+ f({name : \"test\"});
+"
+frame size: 1
+parameter count: 2
+bytecode array length: 10
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(1),
+ B(Return),
+]
+constant pool: [
+ "name",
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a) { return a[\"key\"]; }
+ f({key : \"test\"});
+"
+frame size: 1
+parameter count: 2
+bytecode array length: 10
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(1),
+ B(Return),
+]
+constant pool: [
+ "key",
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a) { return a[100]; }
+ f({100 : \"test\"});
+"
+frame size: 1
+parameter count: 2
+bytecode array length: 11
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(100),
+ B(KeyedLoadIC), R(0), U8(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a, b) { return a[b]; }
+ f({arg : \"test\"}, \"arg\");
+"
+frame size: 1
+parameter count: 3
+bytecode array length: 11
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(0), U8(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a) { var b = a.name; return a[-124]; }
+ f({\"-124\" : \"test\", name : 123 })
+"
+frame size: 2
+parameter count: 2
+bytecode array length: 21
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(1),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LdaSmi), U8(-124),
+ B(KeyedLoadIC), R(1), U8(3),
+ B(Return),
+]
+constant pool: [
+ "name",
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a) {
+ var b;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ b = a.name;
+ return a.name;
+ }
+ f({name : \"test\"})
+"
+frame size: 2
+parameter count: 2
+bytecode array length: 1294
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(1),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(3),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(5),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(7),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(9),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(11),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(13),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(15),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(17),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(19),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(21),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(23),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(25),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(27),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(29),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(31),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(33),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(35),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(37),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(39),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(41),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(43),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(45),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(47),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(49),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(51),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(53),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(55),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(57),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(59),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(61),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(63),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(65),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(67),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(69),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(71),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(73),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(75),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(77),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(79),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(81),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(83),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(85),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(87),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(89),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(91),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(93),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(95),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(97),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(99),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(101),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(103),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(105),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(107),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(109),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(111),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(113),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(115),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(117),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(119),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(121),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(123),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(125),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(127),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(129),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(131),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(133),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(135),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(137),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(139),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(141),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(143),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(145),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(147),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(149),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(151),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(153),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(155),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(157),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(159),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(161),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(163),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(165),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(167),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(169),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(171),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(173),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(175),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(177),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(179),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(181),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(183),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(185),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(187),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(189),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(191),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(193),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(195),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(197),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(199),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(201),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(203),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(205),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(207),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(209),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(211),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(213),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(215),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(217),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(219),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(221),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(223),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(225),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(227),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(229),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(231),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(233),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(235),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(237),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(239),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(241),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(243),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(245),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(247),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(249),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(251),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(253),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(0), U8(255),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Wide), B(LoadIC), R16(1), U16(0), U16(257),
+ B(Return),
+]
+constant pool: [
+ "name",
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a, b) {
+ var c;
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ c = a[b];
+ return a[b];
+ }
+ f({name : \"test\"}, \"name\")
+"
+frame size: 2
+parameter count: 3
+bytecode array length: 1422
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(1),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(3),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(5),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(7),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(9),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(11),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(13),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(15),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(17),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(19),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(21),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(23),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(25),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(27),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(29),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(31),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(33),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(35),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(37),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(39),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(41),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(43),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(45),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(47),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(49),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(51),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(53),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(55),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(57),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(59),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(61),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(63),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(65),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(67),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(69),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(71),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(73),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(75),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(77),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(79),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(81),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(83),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(85),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(87),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(89),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(91),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(93),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(95),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(97),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(99),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(101),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(103),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(105),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(107),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(109),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(111),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(113),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(115),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(117),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(119),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(121),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(123),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(125),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(127),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(129),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(131),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(133),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(135),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(137),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(139),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(141),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(143),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(145),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(147),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(149),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(151),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(153),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(155),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(157),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(159),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(161),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(163),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(165),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(167),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(169),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(171),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(173),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(175),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(177),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(179),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(181),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(183),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(185),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(187),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(189),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(191),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(193),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(195),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(197),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(199),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(201),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(203),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(205),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(207),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(209),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(211),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(213),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(215),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(217),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(219),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(221),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(223),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(225),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(227),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(229),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(231),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(233),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(235),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(237),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(239),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(241),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(243),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(245),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(247),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(249),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(251),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(253),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(KeyedLoadIC), R(1), U8(255),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(Ldar), R(arg1),
+ B(Wide), B(KeyedLoadIC), R16(1), U16(257),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/PropertyStores.golden b/test/cctest/interpreter/bytecode_expectations/PropertyStores.golden
new file mode 100644
index 0000000..9e67a90
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/PropertyStores.golden
@@ -0,0 +1,3359 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: no
+test function name: f
+
+---
+snippet: "
+ function f(a) { a.name = \"val\"; }
+ f({name : \"test\"})
+"
+frame size: 1
+parameter count: 2
+bytecode array length: 13
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaConstant), U8(0),
+ B(StoreICSloppy), R(0), U8(1), U8(1),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "val",
+ "name",
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a) { a[\"key\"] = \"val\"; }
+ f({key : \"test\"})
+"
+frame size: 1
+parameter count: 2
+bytecode array length: 13
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaConstant), U8(0),
+ B(StoreICSloppy), R(0), U8(1), U8(1),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "val",
+ "key",
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a) { a[100] = \"val\"; }
+ f({100 : \"test\"})
+"
+frame size: 2
+parameter count: 2
+bytecode array length: 17
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(100),
+ B(Star), R(1),
+ B(LdaConstant), U8(0),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(1),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "val",
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a, b) { a[b] = \"val\"; }
+ f({arg : \"test\"}, \"arg\")
+"
+frame size: 2
+parameter count: 3
+bytecode array length: 17
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaConstant), U8(0),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(1),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "val",
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a) { a.name = a[-124]; }
+ f({\"-124\" : \"test\", name : 123 })
+"
+frame size: 2
+parameter count: 2
+bytecode array length: 20
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg0),
+ B(Star), R(1),
+ B(LdaSmi), U8(-124),
+ B(KeyedLoadIC), R(1), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(3),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "name",
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a) { \"use strict\"; a.name = \"val\"; }
+ f({name : \"test\"})
+"
+frame size: 1
+parameter count: 2
+bytecode array length: 13
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaConstant), U8(0),
+ B(StoreICStrict), R(0), U8(1), U8(1),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "val",
+ "name",
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a, b) { \"use strict\"; a[b] = \"val\"; }
+ f({arg : \"test\"}, \"arg\")
+"
+frame size: 2
+parameter count: 3
+bytecode array length: 17
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaConstant), U8(0),
+ B(KeyedStoreICStrict), R(0), R(1), U8(1),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "val",
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a) {
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 2;
+ }
+ f({name : \"test\"})
+"
+frame size: 1
+parameter count: 2
+bytecode array length: 1297
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(1),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(3),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(5),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(7),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(9),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(11),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(13),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(15),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(17),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(19),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(21),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(23),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(25),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(27),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(29),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(31),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(33),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(35),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(37),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(39),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(41),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(43),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(45),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(47),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(49),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(51),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(53),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(55),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(57),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(59),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(61),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(63),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(65),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(67),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(69),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(71),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(73),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(75),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(77),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(79),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(81),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(83),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(85),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(87),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(89),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(91),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(93),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(95),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(97),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(99),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(101),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(103),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(105),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(107),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(109),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(111),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(113),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(115),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(117),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(119),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(121),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(123),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(125),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(127),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(129),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(131),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(133),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(135),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(137),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(139),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(141),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(143),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(145),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(147),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(149),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(151),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(153),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(155),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(157),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(159),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(161),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(163),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(165),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(167),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(169),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(171),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(173),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(175),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(177),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(179),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(181),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(183),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(185),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(187),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(189),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(191),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(193),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(195),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(197),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(199),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(201),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(203),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(205),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(207),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(209),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(211),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(213),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(215),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(217),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(219),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(221),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(223),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(225),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(227),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(229),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(231),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(233),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(235),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(237),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(239),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(241),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(243),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(245),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(247),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(249),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(251),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(253),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICSloppy), R(0), U8(0), U8(255),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(2),
+ B(Wide), B(StoreICSloppy), R16(0), U16(0), U16(257),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "name",
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a) {
+ 'use strict';
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 1;
+ a.name = 2;
+ }
+ f({name : \"test\"})
+"
+frame size: 1
+parameter count: 2
+bytecode array length: 1297
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(1),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(3),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(5),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(7),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(9),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(11),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(13),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(15),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(17),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(19),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(21),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(23),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(25),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(27),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(29),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(31),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(33),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(35),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(37),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(39),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(41),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(43),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(45),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(47),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(49),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(51),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(53),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(55),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(57),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(59),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(61),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(63),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(65),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(67),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(69),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(71),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(73),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(75),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(77),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(79),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(81),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(83),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(85),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(87),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(89),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(91),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(93),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(95),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(97),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(99),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(101),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(103),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(105),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(107),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(109),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(111),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(113),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(115),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(117),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(119),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(121),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(123),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(125),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(127),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(129),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(131),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(133),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(135),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(137),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(139),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(141),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(143),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(145),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(147),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(149),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(151),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(153),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(155),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(157),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(159),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(161),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(163),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(165),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(167),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(169),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(171),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(173),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(175),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(177),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(179),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(181),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(183),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(185),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(187),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(189),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(191),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(193),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(195),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(197),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(199),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(201),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(203),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(205),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(207),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(209),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(211),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(213),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(215),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(217),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(219),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(221),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(223),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(225),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(227),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(229),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(231),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(233),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(235),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(237),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(239),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(241),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(243),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(245),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(247),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(249),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(251),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(253),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(1),
+ B(StoreICStrict), R(0), U8(0), U8(255),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LdaSmi), U8(2),
+ B(Wide), B(StoreICStrict), R16(0), U16(0), U16(257),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "name",
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a, b) {
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 2;
+ }
+ f({name : \"test\"})
+"
+frame size: 2
+parameter count: 3
+bytecode array length: 1813
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(1),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(3),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(5),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(7),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(9),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(11),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(13),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(15),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(17),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(19),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(21),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(23),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(25),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(27),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(29),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(31),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(33),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(35),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(37),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(39),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(41),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(43),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(45),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(47),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(49),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(51),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(53),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(55),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(57),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(59),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(61),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(63),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(65),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(67),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(69),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(71),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(73),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(75),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(77),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(79),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(81),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(83),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(85),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(87),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(89),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(91),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(93),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(95),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(97),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(99),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(101),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(103),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(105),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(107),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(109),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(111),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(113),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(115),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(117),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(119),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(121),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(123),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(125),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(127),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(129),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(131),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(133),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(135),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(137),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(139),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(141),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(143),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(145),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(147),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(149),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(151),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(153),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(155),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(157),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(159),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(161),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(163),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(165),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(167),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(169),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(171),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(173),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(175),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(177),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(179),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(181),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(183),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(185),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(187),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(189),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(191),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(193),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(195),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(197),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(199),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(201),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(203),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(205),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(207),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(209),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(211),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(213),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(215),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(217),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(219),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(221),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(223),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(225),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(227),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(229),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(231),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(233),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(235),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(237),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(239),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(241),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(243),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(245),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(247),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(249),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(251),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(253),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICSloppy), R(0), R(1), U8(255),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Wide), B(KeyedStoreICSloppy), R16(0), R16(1), U16(257),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ function f(a, b) {
+ 'use strict';
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 1;
+ a[b] = 2;
+ }
+ f({name : \"test\"})
+"
+frame size: 2
+parameter count: 3
+bytecode array length: 1813
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(1),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(3),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(5),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(7),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(9),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(11),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(13),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(15),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(17),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(19),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(21),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(23),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(25),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(27),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(29),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(31),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(33),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(35),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(37),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(39),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(41),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(43),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(45),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(47),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(49),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(51),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(53),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(55),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(57),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(59),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(61),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(63),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(65),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(67),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(69),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(71),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(73),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(75),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(77),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(79),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(81),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(83),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(85),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(87),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(89),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(91),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(93),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(95),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(97),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(99),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(101),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(103),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(105),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(107),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(109),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(111),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(113),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(115),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(117),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(119),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(121),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(123),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(125),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(127),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(129),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(131),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(133),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(135),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(137),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(139),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(141),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(143),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(145),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(147),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(149),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(151),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(153),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(155),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(157),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(159),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(161),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(163),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(165),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(167),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(169),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(171),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(173),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(175),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(177),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(179),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(181),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(183),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(185),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(187),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(189),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(191),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(193),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(195),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(197),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(199),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(201),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(203),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(205),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(207),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(209),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(211),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(213),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(215),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(217),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(219),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(221),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(223),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(225),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(227),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(229),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(231),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(233),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(235),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(237),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(239),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(241),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(243),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(245),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(247),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(249),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(251),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(253),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(KeyedStoreICStrict), R(0), R(1), U8(255),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(Ldar), R(arg1),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Wide), B(KeyedStoreICStrict), R16(0), R16(1), U16(257),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/RegExpLiterals.golden b/test/cctest/interpreter/bytecode_expectations/RegExpLiterals.golden
new file mode 100644
index 0000000..adffb75
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/RegExpLiterals.golden
@@ -0,0 +1,71 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ return /ab+d/;
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 6
+bytecodes: [
+ B(StackCheck),
+ B(CreateRegExpLiteral), U8(0), U8(0), U8(0),
+ B(Return),
+]
+constant pool: [
+ "ab+d",
+]
+handlers: [
+]
+
+---
+snippet: "
+ return /(\\w+)\\s(\\w+)/i;
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 6
+bytecodes: [
+ B(StackCheck),
+ B(CreateRegExpLiteral), U8(0), U8(0), U8(2),
+ B(Return),
+]
+constant pool: [
+ "(\x5cw+)\x5cs(\x5cw+)",
+]
+handlers: [
+]
+
+---
+snippet: "
+ return /ab+d/.exec('abdd');
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 23
+bytecodes: [
+ B(StackCheck),
+ B(CreateRegExpLiteral), U8(0), U8(0), U8(0),
+ B(Star), R(1),
+ B(LoadIC), R(1), U8(1), U8(3),
+ B(Star), R(0),
+ B(LdaConstant), U8(2),
+ B(Star), R(2),
+ B(Call), R(0), R(1), U8(2), U8(1),
+ B(Return),
+]
+constant pool: [
+ "ab+d",
+ "exec",
+ "abdd",
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/RegExpLiteralsWide.golden b/test/cctest/interpreter/bytecode_expectations/RegExpLiteralsWide.golden
new file mode 100644
index 0000000..d6fb160
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/RegExpLiteralsWide.golden
@@ -0,0 +1,1052 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ var a;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ a = 1.23;
+ return /ab+d/;
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 1033
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(0),
+ B(LdaConstant), U8(1),
+ B(Star), R(0),
+ B(LdaConstant), U8(2),
+ B(Star), R(0),
+ B(LdaConstant), U8(3),
+ B(Star), R(0),
+ B(LdaConstant), U8(4),
+ B(Star), R(0),
+ B(LdaConstant), U8(5),
+ B(Star), R(0),
+ B(LdaConstant), U8(6),
+ B(Star), R(0),
+ B(LdaConstant), U8(7),
+ B(Star), R(0),
+ B(LdaConstant), U8(8),
+ B(Star), R(0),
+ B(LdaConstant), U8(9),
+ B(Star), R(0),
+ B(LdaConstant), U8(10),
+ B(Star), R(0),
+ B(LdaConstant), U8(11),
+ B(Star), R(0),
+ B(LdaConstant), U8(12),
+ B(Star), R(0),
+ B(LdaConstant), U8(13),
+ B(Star), R(0),
+ B(LdaConstant), U8(14),
+ B(Star), R(0),
+ B(LdaConstant), U8(15),
+ B(Star), R(0),
+ B(LdaConstant), U8(16),
+ B(Star), R(0),
+ B(LdaConstant), U8(17),
+ B(Star), R(0),
+ B(LdaConstant), U8(18),
+ B(Star), R(0),
+ B(LdaConstant), U8(19),
+ B(Star), R(0),
+ B(LdaConstant), U8(20),
+ B(Star), R(0),
+ B(LdaConstant), U8(21),
+ B(Star), R(0),
+ B(LdaConstant), U8(22),
+ B(Star), R(0),
+ B(LdaConstant), U8(23),
+ B(Star), R(0),
+ B(LdaConstant), U8(24),
+ B(Star), R(0),
+ B(LdaConstant), U8(25),
+ B(Star), R(0),
+ B(LdaConstant), U8(26),
+ B(Star), R(0),
+ B(LdaConstant), U8(27),
+ B(Star), R(0),
+ B(LdaConstant), U8(28),
+ B(Star), R(0),
+ B(LdaConstant), U8(29),
+ B(Star), R(0),
+ B(LdaConstant), U8(30),
+ B(Star), R(0),
+ B(LdaConstant), U8(31),
+ B(Star), R(0),
+ B(LdaConstant), U8(32),
+ B(Star), R(0),
+ B(LdaConstant), U8(33),
+ B(Star), R(0),
+ B(LdaConstant), U8(34),
+ B(Star), R(0),
+ B(LdaConstant), U8(35),
+ B(Star), R(0),
+ B(LdaConstant), U8(36),
+ B(Star), R(0),
+ B(LdaConstant), U8(37),
+ B(Star), R(0),
+ B(LdaConstant), U8(38),
+ B(Star), R(0),
+ B(LdaConstant), U8(39),
+ B(Star), R(0),
+ B(LdaConstant), U8(40),
+ B(Star), R(0),
+ B(LdaConstant), U8(41),
+ B(Star), R(0),
+ B(LdaConstant), U8(42),
+ B(Star), R(0),
+ B(LdaConstant), U8(43),
+ B(Star), R(0),
+ B(LdaConstant), U8(44),
+ B(Star), R(0),
+ B(LdaConstant), U8(45),
+ B(Star), R(0),
+ B(LdaConstant), U8(46),
+ B(Star), R(0),
+ B(LdaConstant), U8(47),
+ B(Star), R(0),
+ B(LdaConstant), U8(48),
+ B(Star), R(0),
+ B(LdaConstant), U8(49),
+ B(Star), R(0),
+ B(LdaConstant), U8(50),
+ B(Star), R(0),
+ B(LdaConstant), U8(51),
+ B(Star), R(0),
+ B(LdaConstant), U8(52),
+ B(Star), R(0),
+ B(LdaConstant), U8(53),
+ B(Star), R(0),
+ B(LdaConstant), U8(54),
+ B(Star), R(0),
+ B(LdaConstant), U8(55),
+ B(Star), R(0),
+ B(LdaConstant), U8(56),
+ B(Star), R(0),
+ B(LdaConstant), U8(57),
+ B(Star), R(0),
+ B(LdaConstant), U8(58),
+ B(Star), R(0),
+ B(LdaConstant), U8(59),
+ B(Star), R(0),
+ B(LdaConstant), U8(60),
+ B(Star), R(0),
+ B(LdaConstant), U8(61),
+ B(Star), R(0),
+ B(LdaConstant), U8(62),
+ B(Star), R(0),
+ B(LdaConstant), U8(63),
+ B(Star), R(0),
+ B(LdaConstant), U8(64),
+ B(Star), R(0),
+ B(LdaConstant), U8(65),
+ B(Star), R(0),
+ B(LdaConstant), U8(66),
+ B(Star), R(0),
+ B(LdaConstant), U8(67),
+ B(Star), R(0),
+ B(LdaConstant), U8(68),
+ B(Star), R(0),
+ B(LdaConstant), U8(69),
+ B(Star), R(0),
+ B(LdaConstant), U8(70),
+ B(Star), R(0),
+ B(LdaConstant), U8(71),
+ B(Star), R(0),
+ B(LdaConstant), U8(72),
+ B(Star), R(0),
+ B(LdaConstant), U8(73),
+ B(Star), R(0),
+ B(LdaConstant), U8(74),
+ B(Star), R(0),
+ B(LdaConstant), U8(75),
+ B(Star), R(0),
+ B(LdaConstant), U8(76),
+ B(Star), R(0),
+ B(LdaConstant), U8(77),
+ B(Star), R(0),
+ B(LdaConstant), U8(78),
+ B(Star), R(0),
+ B(LdaConstant), U8(79),
+ B(Star), R(0),
+ B(LdaConstant), U8(80),
+ B(Star), R(0),
+ B(LdaConstant), U8(81),
+ B(Star), R(0),
+ B(LdaConstant), U8(82),
+ B(Star), R(0),
+ B(LdaConstant), U8(83),
+ B(Star), R(0),
+ B(LdaConstant), U8(84),
+ B(Star), R(0),
+ B(LdaConstant), U8(85),
+ B(Star), R(0),
+ B(LdaConstant), U8(86),
+ B(Star), R(0),
+ B(LdaConstant), U8(87),
+ B(Star), R(0),
+ B(LdaConstant), U8(88),
+ B(Star), R(0),
+ B(LdaConstant), U8(89),
+ B(Star), R(0),
+ B(LdaConstant), U8(90),
+ B(Star), R(0),
+ B(LdaConstant), U8(91),
+ B(Star), R(0),
+ B(LdaConstant), U8(92),
+ B(Star), R(0),
+ B(LdaConstant), U8(93),
+ B(Star), R(0),
+ B(LdaConstant), U8(94),
+ B(Star), R(0),
+ B(LdaConstant), U8(95),
+ B(Star), R(0),
+ B(LdaConstant), U8(96),
+ B(Star), R(0),
+ B(LdaConstant), U8(97),
+ B(Star), R(0),
+ B(LdaConstant), U8(98),
+ B(Star), R(0),
+ B(LdaConstant), U8(99),
+ B(Star), R(0),
+ B(LdaConstant), U8(100),
+ B(Star), R(0),
+ B(LdaConstant), U8(101),
+ B(Star), R(0),
+ B(LdaConstant), U8(102),
+ B(Star), R(0),
+ B(LdaConstant), U8(103),
+ B(Star), R(0),
+ B(LdaConstant), U8(104),
+ B(Star), R(0),
+ B(LdaConstant), U8(105),
+ B(Star), R(0),
+ B(LdaConstant), U8(106),
+ B(Star), R(0),
+ B(LdaConstant), U8(107),
+ B(Star), R(0),
+ B(LdaConstant), U8(108),
+ B(Star), R(0),
+ B(LdaConstant), U8(109),
+ B(Star), R(0),
+ B(LdaConstant), U8(110),
+ B(Star), R(0),
+ B(LdaConstant), U8(111),
+ B(Star), R(0),
+ B(LdaConstant), U8(112),
+ B(Star), R(0),
+ B(LdaConstant), U8(113),
+ B(Star), R(0),
+ B(LdaConstant), U8(114),
+ B(Star), R(0),
+ B(LdaConstant), U8(115),
+ B(Star), R(0),
+ B(LdaConstant), U8(116),
+ B(Star), R(0),
+ B(LdaConstant), U8(117),
+ B(Star), R(0),
+ B(LdaConstant), U8(118),
+ B(Star), R(0),
+ B(LdaConstant), U8(119),
+ B(Star), R(0),
+ B(LdaConstant), U8(120),
+ B(Star), R(0),
+ B(LdaConstant), U8(121),
+ B(Star), R(0),
+ B(LdaConstant), U8(122),
+ B(Star), R(0),
+ B(LdaConstant), U8(123),
+ B(Star), R(0),
+ B(LdaConstant), U8(124),
+ B(Star), R(0),
+ B(LdaConstant), U8(125),
+ B(Star), R(0),
+ B(LdaConstant), U8(126),
+ B(Star), R(0),
+ B(LdaConstant), U8(127),
+ B(Star), R(0),
+ B(LdaConstant), U8(128),
+ B(Star), R(0),
+ B(LdaConstant), U8(129),
+ B(Star), R(0),
+ B(LdaConstant), U8(130),
+ B(Star), R(0),
+ B(LdaConstant), U8(131),
+ B(Star), R(0),
+ B(LdaConstant), U8(132),
+ B(Star), R(0),
+ B(LdaConstant), U8(133),
+ B(Star), R(0),
+ B(LdaConstant), U8(134),
+ B(Star), R(0),
+ B(LdaConstant), U8(135),
+ B(Star), R(0),
+ B(LdaConstant), U8(136),
+ B(Star), R(0),
+ B(LdaConstant), U8(137),
+ B(Star), R(0),
+ B(LdaConstant), U8(138),
+ B(Star), R(0),
+ B(LdaConstant), U8(139),
+ B(Star), R(0),
+ B(LdaConstant), U8(140),
+ B(Star), R(0),
+ B(LdaConstant), U8(141),
+ B(Star), R(0),
+ B(LdaConstant), U8(142),
+ B(Star), R(0),
+ B(LdaConstant), U8(143),
+ B(Star), R(0),
+ B(LdaConstant), U8(144),
+ B(Star), R(0),
+ B(LdaConstant), U8(145),
+ B(Star), R(0),
+ B(LdaConstant), U8(146),
+ B(Star), R(0),
+ B(LdaConstant), U8(147),
+ B(Star), R(0),
+ B(LdaConstant), U8(148),
+ B(Star), R(0),
+ B(LdaConstant), U8(149),
+ B(Star), R(0),
+ B(LdaConstant), U8(150),
+ B(Star), R(0),
+ B(LdaConstant), U8(151),
+ B(Star), R(0),
+ B(LdaConstant), U8(152),
+ B(Star), R(0),
+ B(LdaConstant), U8(153),
+ B(Star), R(0),
+ B(LdaConstant), U8(154),
+ B(Star), R(0),
+ B(LdaConstant), U8(155),
+ B(Star), R(0),
+ B(LdaConstant), U8(156),
+ B(Star), R(0),
+ B(LdaConstant), U8(157),
+ B(Star), R(0),
+ B(LdaConstant), U8(158),
+ B(Star), R(0),
+ B(LdaConstant), U8(159),
+ B(Star), R(0),
+ B(LdaConstant), U8(160),
+ B(Star), R(0),
+ B(LdaConstant), U8(161),
+ B(Star), R(0),
+ B(LdaConstant), U8(162),
+ B(Star), R(0),
+ B(LdaConstant), U8(163),
+ B(Star), R(0),
+ B(LdaConstant), U8(164),
+ B(Star), R(0),
+ B(LdaConstant), U8(165),
+ B(Star), R(0),
+ B(LdaConstant), U8(166),
+ B(Star), R(0),
+ B(LdaConstant), U8(167),
+ B(Star), R(0),
+ B(LdaConstant), U8(168),
+ B(Star), R(0),
+ B(LdaConstant), U8(169),
+ B(Star), R(0),
+ B(LdaConstant), U8(170),
+ B(Star), R(0),
+ B(LdaConstant), U8(171),
+ B(Star), R(0),
+ B(LdaConstant), U8(172),
+ B(Star), R(0),
+ B(LdaConstant), U8(173),
+ B(Star), R(0),
+ B(LdaConstant), U8(174),
+ B(Star), R(0),
+ B(LdaConstant), U8(175),
+ B(Star), R(0),
+ B(LdaConstant), U8(176),
+ B(Star), R(0),
+ B(LdaConstant), U8(177),
+ B(Star), R(0),
+ B(LdaConstant), U8(178),
+ B(Star), R(0),
+ B(LdaConstant), U8(179),
+ B(Star), R(0),
+ B(LdaConstant), U8(180),
+ B(Star), R(0),
+ B(LdaConstant), U8(181),
+ B(Star), R(0),
+ B(LdaConstant), U8(182),
+ B(Star), R(0),
+ B(LdaConstant), U8(183),
+ B(Star), R(0),
+ B(LdaConstant), U8(184),
+ B(Star), R(0),
+ B(LdaConstant), U8(185),
+ B(Star), R(0),
+ B(LdaConstant), U8(186),
+ B(Star), R(0),
+ B(LdaConstant), U8(187),
+ B(Star), R(0),
+ B(LdaConstant), U8(188),
+ B(Star), R(0),
+ B(LdaConstant), U8(189),
+ B(Star), R(0),
+ B(LdaConstant), U8(190),
+ B(Star), R(0),
+ B(LdaConstant), U8(191),
+ B(Star), R(0),
+ B(LdaConstant), U8(192),
+ B(Star), R(0),
+ B(LdaConstant), U8(193),
+ B(Star), R(0),
+ B(LdaConstant), U8(194),
+ B(Star), R(0),
+ B(LdaConstant), U8(195),
+ B(Star), R(0),
+ B(LdaConstant), U8(196),
+ B(Star), R(0),
+ B(LdaConstant), U8(197),
+ B(Star), R(0),
+ B(LdaConstant), U8(198),
+ B(Star), R(0),
+ B(LdaConstant), U8(199),
+ B(Star), R(0),
+ B(LdaConstant), U8(200),
+ B(Star), R(0),
+ B(LdaConstant), U8(201),
+ B(Star), R(0),
+ B(LdaConstant), U8(202),
+ B(Star), R(0),
+ B(LdaConstant), U8(203),
+ B(Star), R(0),
+ B(LdaConstant), U8(204),
+ B(Star), R(0),
+ B(LdaConstant), U8(205),
+ B(Star), R(0),
+ B(LdaConstant), U8(206),
+ B(Star), R(0),
+ B(LdaConstant), U8(207),
+ B(Star), R(0),
+ B(LdaConstant), U8(208),
+ B(Star), R(0),
+ B(LdaConstant), U8(209),
+ B(Star), R(0),
+ B(LdaConstant), U8(210),
+ B(Star), R(0),
+ B(LdaConstant), U8(211),
+ B(Star), R(0),
+ B(LdaConstant), U8(212),
+ B(Star), R(0),
+ B(LdaConstant), U8(213),
+ B(Star), R(0),
+ B(LdaConstant), U8(214),
+ B(Star), R(0),
+ B(LdaConstant), U8(215),
+ B(Star), R(0),
+ B(LdaConstant), U8(216),
+ B(Star), R(0),
+ B(LdaConstant), U8(217),
+ B(Star), R(0),
+ B(LdaConstant), U8(218),
+ B(Star), R(0),
+ B(LdaConstant), U8(219),
+ B(Star), R(0),
+ B(LdaConstant), U8(220),
+ B(Star), R(0),
+ B(LdaConstant), U8(221),
+ B(Star), R(0),
+ B(LdaConstant), U8(222),
+ B(Star), R(0),
+ B(LdaConstant), U8(223),
+ B(Star), R(0),
+ B(LdaConstant), U8(224),
+ B(Star), R(0),
+ B(LdaConstant), U8(225),
+ B(Star), R(0),
+ B(LdaConstant), U8(226),
+ B(Star), R(0),
+ B(LdaConstant), U8(227),
+ B(Star), R(0),
+ B(LdaConstant), U8(228),
+ B(Star), R(0),
+ B(LdaConstant), U8(229),
+ B(Star), R(0),
+ B(LdaConstant), U8(230),
+ B(Star), R(0),
+ B(LdaConstant), U8(231),
+ B(Star), R(0),
+ B(LdaConstant), U8(232),
+ B(Star), R(0),
+ B(LdaConstant), U8(233),
+ B(Star), R(0),
+ B(LdaConstant), U8(234),
+ B(Star), R(0),
+ B(LdaConstant), U8(235),
+ B(Star), R(0),
+ B(LdaConstant), U8(236),
+ B(Star), R(0),
+ B(LdaConstant), U8(237),
+ B(Star), R(0),
+ B(LdaConstant), U8(238),
+ B(Star), R(0),
+ B(LdaConstant), U8(239),
+ B(Star), R(0),
+ B(LdaConstant), U8(240),
+ B(Star), R(0),
+ B(LdaConstant), U8(241),
+ B(Star), R(0),
+ B(LdaConstant), U8(242),
+ B(Star), R(0),
+ B(LdaConstant), U8(243),
+ B(Star), R(0),
+ B(LdaConstant), U8(244),
+ B(Star), R(0),
+ B(LdaConstant), U8(245),
+ B(Star), R(0),
+ B(LdaConstant), U8(246),
+ B(Star), R(0),
+ B(LdaConstant), U8(247),
+ B(Star), R(0),
+ B(LdaConstant), U8(248),
+ B(Star), R(0),
+ B(LdaConstant), U8(249),
+ B(Star), R(0),
+ B(LdaConstant), U8(250),
+ B(Star), R(0),
+ B(LdaConstant), U8(251),
+ B(Star), R(0),
+ B(LdaConstant), U8(252),
+ B(Star), R(0),
+ B(LdaConstant), U8(253),
+ B(Star), R(0),
+ B(LdaConstant), U8(254),
+ B(Star), R(0),
+ B(LdaConstant), U8(255),
+ B(Star), R(0),
+ B(Wide), B(CreateRegExpLiteral), U16(256), U16(0), U8(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::HEAP_NUMBER_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/RemoveRedundantLdar.golden b/test/cctest/interpreter/bytecode_expectations/RemoveRedundantLdar.golden
new file mode 100644
index 0000000..e9283cd
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/RemoveRedundantLdar.golden
@@ -0,0 +1,104 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: number
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ var ld_a = 1;
+ while(true) {
+ ld_a = ld_a + ld_a;
+ if (ld_a > 10) break;
+ }
+ return ld_a;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 31
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(Add), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(10),
+ B(TestGreaterThan), R(1),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(4),
+ B(Jump), U8(-21),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var ld_a = 1;
+ do {
+ ld_a = ld_a + ld_a;
+ if (ld_a > 10) continue;
+ } while(false);
+ return ld_a;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 29
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(Add), R(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(10),
+ B(TestGreaterThan), R(1),
+ B(JumpIfFalse), U8(4),
+ B(Jump), U8(2),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var ld_a = 1;
+ ld_a = ld_a + ld_a;
+ return ld_a;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 14
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(Add), R(1),
+ B(Star), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/StoreGlobal.golden b/test/cctest/interpreter/bytecode_expectations/StoreGlobal.golden
new file mode 100644
index 0000000..151c334
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/StoreGlobal.golden
@@ -0,0 +1,1172 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: no
+test function name: f
+
+---
+snippet: "
+ var a = 1;
+ function f() { a = 2; }
+ f();
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 8
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(2),
+ B(StaGlobalSloppy), U8(0), U8(1),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "a",
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = \"test\"; function f(b) { a = b; }
+ f(\"global\");
+"
+frame size: 0
+parameter count: 2
+bytecode array length: 8
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(StaGlobalSloppy), U8(0), U8(1),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "a",
+]
+handlers: [
+]
+
+---
+snippet: "
+ 'use strict'; var a = 1;
+ function f() { a = 2; }
+ f();
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 8
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(2),
+ B(StaGlobalStrict), U8(0), U8(1),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "a",
+]
+handlers: [
+]
+
+---
+snippet: "
+ a = 1;
+ function f() { a = 2; }
+ f();
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 8
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(2),
+ B(StaGlobalSloppy), U8(0), U8(1),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "a",
+]
+handlers: [
+]
+
+---
+snippet: "
+ a = 1;
+ function f(b) {
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ a = 2;
+ }
+ f({name: 1});
+"
+frame size: 1
+parameter count: 2
+bytecode array length: 1035
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(1),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(3),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(5),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(7),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(9),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(11),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(13),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(15),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(17),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(19),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(21),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(23),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(25),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(27),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(29),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(31),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(33),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(35),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(37),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(39),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(41),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(43),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(45),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(47),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(49),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(51),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(53),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(55),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(57),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(59),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(61),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(63),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(65),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(67),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(69),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(71),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(73),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(75),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(77),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(79),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(81),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(83),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(85),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(87),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(89),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(91),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(93),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(95),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(97),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(99),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(101),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(103),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(105),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(107),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(109),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(111),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(113),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(115),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(117),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(119),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(121),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(123),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(125),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(127),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(129),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(131),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(133),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(135),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(137),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(139),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(141),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(143),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(145),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(147),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(149),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(151),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(153),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(155),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(157),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(159),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(161),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(163),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(165),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(167),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(169),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(171),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(173),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(175),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(177),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(179),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(181),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(183),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(185),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(187),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(189),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(191),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(193),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(195),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(197),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(199),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(201),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(203),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(205),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(207),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(209),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(211),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(213),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(215),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(217),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(219),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(221),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(223),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(225),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(227),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(229),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(231),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(233),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(235),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(237),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(239),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(241),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(243),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(245),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(247),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(249),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(251),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(253),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(255),
+ B(LdaSmi), U8(2),
+ B(Wide), B(StaGlobalSloppy), U16(1), U16(257),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "name",
+ "a",
+]
+handlers: [
+]
+
+---
+snippet: "
+ a = 1;
+ function f(b) {
+ 'use strict';
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ b.name;
+ a = 2;
+ }
+ f({name: 1});
+"
+frame size: 1
+parameter count: 2
+bytecode array length: 1035
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(1),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(3),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(5),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(7),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(9),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(11),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(13),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(15),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(17),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(19),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(21),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(23),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(25),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(27),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(29),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(31),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(33),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(35),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(37),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(39),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(41),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(43),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(45),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(47),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(49),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(51),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(53),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(55),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(57),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(59),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(61),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(63),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(65),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(67),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(69),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(71),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(73),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(75),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(77),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(79),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(81),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(83),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(85),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(87),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(89),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(91),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(93),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(95),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(97),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(99),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(101),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(103),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(105),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(107),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(109),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(111),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(113),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(115),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(117),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(119),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(121),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(123),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(125),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(127),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(129),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(131),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(133),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(135),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(137),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(139),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(141),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(143),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(145),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(147),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(149),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(151),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(153),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(155),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(157),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(159),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(161),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(163),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(165),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(167),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(169),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(171),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(173),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(175),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(177),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(179),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(181),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(183),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(185),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(187),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(189),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(191),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(193),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(195),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(197),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(199),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(201),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(203),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(205),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(207),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(209),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(211),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(213),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(215),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(217),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(219),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(221),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(223),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(225),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(227),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(229),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(231),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(233),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(235),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(237),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(239),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(241),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(243),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(245),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(247),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(249),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(251),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(253),
+ B(Ldar), R(arg0),
+ B(Star), R(0),
+ B(LoadIC), R(0), U8(0), U8(255),
+ B(LdaSmi), U8(2),
+ B(Wide), B(StaGlobalStrict), U16(1), U16(257),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "name",
+ "a",
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/StringConstants.golden b/test/cctest/interpreter/bytecode_expectations/StringConstants.golden
new file mode 100644
index 0000000..9cf212c
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/StringConstants.golden
@@ -0,0 +1,68 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ return \"This is a string\";
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 4
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Return),
+]
+constant pool: [
+ "This is a string",
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = \"First string\"; return \"Second string\";
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 8
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(0),
+ B(LdaConstant), U8(1),
+ B(Return),
+]
+constant pool: [
+ "First string",
+ "Second string",
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = \"Same string\"; return \"Same string\";
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 8
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Star), R(0),
+ B(LdaConstant), U8(0),
+ B(Return),
+]
+constant pool: [
+ "Same string",
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/Switch.golden b/test/cctest/interpreter/bytecode_expectations/Switch.golden
new file mode 100644
index 0000000..c908959
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/Switch.golden
@@ -0,0 +1,524 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: number
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ var a = 1;
+ switch(a) {
+ case 1: return 2;
+ case 2: return 3;
+ }
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 31
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(TestEqualStrict), R(2),
+ B(JumpIfTrue), U8(10),
+ B(LdaSmi), U8(2),
+ B(TestEqualStrict), R(2),
+ B(JumpIfTrue), U8(7),
+ B(Jump), U8(8),
+ B(LdaSmi), U8(2),
+ B(Return),
+ B(LdaSmi), U8(3),
+ B(Return),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1;
+ switch(a) {
+ case 1: a = 2; break;
+ case 2: a = 3; break;
+ }
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 37
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(TestEqualStrict), R(2),
+ B(JumpIfTrue), U8(10),
+ B(LdaSmi), U8(2),
+ B(TestEqualStrict), R(2),
+ B(JumpIfTrue), U8(10),
+ B(Jump), U8(14),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(Jump), U8(8),
+ B(LdaSmi), U8(3),
+ B(Star), R(1),
+ B(Jump), U8(2),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1;
+ switch(a) {
+ case 1: a = 2; // fall-through
+ case 2: a = 3; break;
+ }
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 35
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(TestEqualStrict), R(2),
+ B(JumpIfTrue), U8(10),
+ B(LdaSmi), U8(2),
+ B(TestEqualStrict), R(2),
+ B(JumpIfTrue), U8(8),
+ B(Jump), U8(12),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(3),
+ B(Star), R(1),
+ B(Jump), U8(2),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1;
+ switch(a) {
+ case 2: break;
+ case 3: break;
+ default: a = 1; break;
+ }
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 35
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(2),
+ B(TestEqualStrict), R(2),
+ B(JumpIfTrue), U8(10),
+ B(LdaSmi), U8(3),
+ B(TestEqualStrict), R(2),
+ B(JumpIfTrue), U8(6),
+ B(Jump), U8(6),
+ B(Jump), U8(10),
+ B(Jump), U8(8),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(Jump), U8(2),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1;
+ switch(typeof(a)) {
+ case 2: a = 1; break;
+ case 3: a = 2; break;
+ default: a = 3; break;
+ }
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 44
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(TypeOf),
+ B(Star), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(2),
+ B(TestEqualStrict), R(2),
+ B(JumpIfTrue), U8(10),
+ B(LdaSmi), U8(3),
+ B(TestEqualStrict), R(2),
+ B(JumpIfTrue), U8(10),
+ B(Jump), U8(14),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(Jump), U8(14),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(Jump), U8(8),
+ B(LdaSmi), U8(3),
+ B(Star), R(1),
+ B(Jump), U8(2),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1;
+ switch(a) {
+ case typeof(a): a = 1; break;
+ default: a = 2; break;
+ }
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 32
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(2),
+ B(Ldar), R(1),
+ B(TypeOf),
+ B(TestEqualStrict), R(2),
+ B(JumpIfTrue), U8(4),
+ B(Jump), U8(8),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(Jump), U8(8),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(Jump), U8(2),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1;
+ switch(a) {
+ case 1:
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ a = 2;
+ break;
+ case 2:
+ a = 3;
+ break;
+ }
+"
+frame size: 3
+parameter count: 1
+bytecode array length: 289
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(1),
+ B(Star), R(0),
+ B(Star), R(2),
+ B(LdaSmi), U8(1),
+ B(TestEqualStrict), R(2),
+ B(JumpIfTrue), U8(10),
+ B(LdaSmi), U8(2),
+ B(TestEqualStrict), R(2),
+ B(JumpIfTrueConstant), U8(0),
+ B(JumpConstant), U8(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(1),
+ B(Jump), U8(8),
+ B(LdaSmi), U8(3),
+ B(Star), R(1),
+ B(Jump), U8(2),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ 262,
+ 266,
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1;
+ switch(a) {
+ case 1:
+ switch(a + 1) {
+ case 2 : a = 1; break;
+ default : a = 2; break;
+ } // fall-through
+ case 2: a = 3;
+ }
+"
+frame size: 5
+parameter count: 1
+bytecode array length: 61
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(2),
+ B(Star), R(0),
+ B(Star), R(3),
+ B(LdaSmi), U8(1),
+ B(TestEqualStrict), R(3),
+ B(JumpIfTrue), U8(10),
+ B(LdaSmi), U8(2),
+ B(TestEqualStrict), R(3),
+ B(JumpIfTrue), U8(36),
+ B(Jump), U8(38),
+ B(Ldar), R(2),
+ B(Star), R(4),
+ B(LdaSmi), U8(1),
+ B(Add), R(4),
+ B(Star), R(1),
+ B(Star), R(4),
+ B(LdaSmi), U8(2),
+ B(TestEqualStrict), R(4),
+ B(JumpIfTrue), U8(4),
+ B(Jump), U8(8),
+ B(LdaSmi), U8(1),
+ B(Star), R(2),
+ B(Jump), U8(8),
+ B(LdaSmi), U8(2),
+ B(Star), R(2),
+ B(Jump), U8(2),
+ B(LdaSmi), U8(3),
+ B(Star), R(2),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/ThisFunction.golden b/test/cctest/interpreter/bytecode_expectations/ThisFunction.golden
new file mode 100644
index 0000000..da84a49
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/ThisFunction.golden
@@ -0,0 +1,66 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: number
+execute: yes
+wrap: no
+test function name: f
+
+---
+snippet: "
+ var f;
+ f = function f() {};
+ f();
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 19
+bytecodes: [
+ B(LdaTheHole),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(closure),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(JumpIfNotHole), U8(5),
+ B(Mov), R(1), R(0),
+ B(Ldar), R(1),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var f;
+ f = function f() { return f; };
+ f();
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 23
+bytecodes: [
+ B(LdaTheHole),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(closure),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(JumpIfNotHole), U8(5),
+ B(Mov), R(1), R(0),
+ B(Ldar), R(1),
+ B(Ldar), R(0),
+ B(JumpIfNotHole), U8(3),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/Throw.golden b/test/cctest/interpreter/bytecode_expectations/Throw.golden
new file mode 100644
index 0000000..99e17fc
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/Throw.golden
@@ -0,0 +1,67 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ throw 1;
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 4
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Throw),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ throw 'Error';
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 4
+bytecodes: [
+ B(StackCheck),
+ B(LdaConstant), U8(0),
+ B(Throw),
+]
+constant pool: [
+ "Error",
+]
+handlers: [
+]
+
+---
+snippet: "
+ var a = 1; if (a) { throw 'Error'; };
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 12
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(JumpIfToBooleanFalse), U8(5),
+ B(LdaConstant), U8(0),
+ B(Throw),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "Error",
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/TopLevelObjectLiterals.golden b/test/cctest/interpreter/bytecode_expectations/TopLevelObjectLiterals.golden
new file mode 100644
index 0000000..23d3609
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/TopLevelObjectLiterals.golden
@@ -0,0 +1,48 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: no
+wrap: no
+top level: yes
+
+---
+snippet: "
+ var a = { func: function() { } };
+"
+frame size: 5
+parameter count: 1
+bytecode array length: 44
+bytecodes: [
+ B(LdaConstant), U8(0),
+ B(Star), R(1),
+ B(LdaZero),
+ B(Star), R(2),
+ B(CallRuntime), U16(Runtime::kDeclareGlobals), R(1), U8(2),
+ B(StackCheck),
+ B(LdaConstant), U8(1),
+ B(Star), R(1),
+ B(LdaZero),
+ B(Star), R(2),
+ B(CreateObjectLiteral), U8(2), U8(0), U8(5),
+ B(Star), R(4),
+ B(CreateClosure), U8(3), U8(0),
+ B(StoreICSloppy), R(4), U8(4), U8(3),
+ B(Ldar), R(4),
+ B(Star), R(3),
+ B(CallRuntime), U16(Runtime::kInitializeVarGlobal), R(1), U8(3),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::SHARED_FUNCTION_INFO_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/TryCatch.golden b/test/cctest/interpreter/bytecode_expectations/TryCatch.golden
new file mode 100644
index 0000000..20abd3e
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/TryCatch.golden
@@ -0,0 +1,99 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ try { return 1; } catch(e) { return 2; }
+"
+frame size: 5
+parameter count: 1
+bytecode array length: 40
+bytecodes: [
+ B(StackCheck),
+ B(Mov), R(context), R(1),
+ B(LdaSmi), U8(1),
+ B(Return),
+ B(Star), R(3),
+ B(LdaConstant), U8(0),
+ B(Star), R(2),
+ B(Ldar), R(closure),
+ B(Star), R(4),
+ B(CallRuntime), U16(Runtime::kPushCatchContext), R(2), U8(3),
+ B(Star), R(1),
+ B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), R(0), U8(0),
+ B(Ldar), R(1),
+ B(PushContext), R(0),
+ B(LdaSmi), U8(2),
+ B(PopContext), R(0),
+ B(Return),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "e",
+]
+handlers: [
+ [4, 7, 7],
+]
+
+---
+snippet: "
+ var a;
+ try { a = 1 } catch(e1) {};
+ try { a = 2 } catch(e2) { a = 3 }
+"
+frame size: 6
+parameter count: 1
+bytecode array length: 81
+bytecodes: [
+ B(StackCheck),
+ B(Mov), R(context), R(2),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(Jump), U8(30),
+ B(Star), R(4),
+ B(LdaConstant), U8(0),
+ B(Star), R(3),
+ B(Ldar), R(closure),
+ B(Star), R(5),
+ B(CallRuntime), U16(Runtime::kPushCatchContext), R(3), U8(3),
+ B(Star), R(2),
+ B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), R(0), U8(0),
+ B(Ldar), R(2),
+ B(PushContext), R(1),
+ B(PopContext), R(1),
+ B(Mov), R(context), R(2),
+ B(LdaSmi), U8(2),
+ B(Star), R(0),
+ B(Jump), U8(34),
+ B(Star), R(4),
+ B(LdaConstant), U8(1),
+ B(Star), R(3),
+ B(Ldar), R(closure),
+ B(Star), R(5),
+ B(CallRuntime), U16(Runtime::kPushCatchContext), R(3), U8(3),
+ B(Star), R(2),
+ B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), R(0), U8(0),
+ B(Ldar), R(2),
+ B(PushContext), R(1),
+ B(LdaSmi), U8(3),
+ B(Star), R(0),
+ B(PopContext), R(1),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "e1",
+ "e2",
+]
+handlers: [
+ [4, 8, 10],
+ [41, 45, 47],
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/TryFinally.golden b/test/cctest/interpreter/bytecode_expectations/TryFinally.golden
new file mode 100644
index 0000000..e14a709
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/TryFinally.golden
@@ -0,0 +1,181 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ var a = 1;
+ try { a = 2; } finally { a = 3; }
+"
+frame size: 4
+parameter count: 1
+bytecode array length: 51
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(Mov), R(context), R(3),
+ B(LdaSmi), U8(2),
+ B(Star), R(0),
+ B(LdaSmi), U8(-1),
+ B(Star), R(1),
+ B(Jump), U8(7),
+ B(Star), R(2),
+ B(LdaZero),
+ B(Star), R(1),
+ B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), R(0), U8(0),
+ B(Star), R(3),
+ B(LdaSmi), U8(3),
+ B(Star), R(0),
+ B(CallRuntime), U16(Runtime::kInterpreterSetPendingMessage), R(3), U8(1),
+ B(LdaZero),
+ B(TestEqualStrict), R(1),
+ B(JumpIfTrue), U8(4),
+ B(Jump), U8(5),
+ B(Ldar), R(2),
+ B(ReThrow),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+ [8, 12, 18],
+]
+
+---
+snippet: "
+ var a = 1;
+ try { a = 2; } catch(e) { a = 20 } finally { a = 3; }
+"
+frame size: 9
+parameter count: 1
+bytecode array length: 88
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(Mov), R(context), R(4),
+ B(Mov), R(context), R(5),
+ B(LdaSmi), U8(2),
+ B(Star), R(0),
+ B(Jump), U8(34),
+ B(Star), R(7),
+ B(LdaConstant), U8(0),
+ B(Star), R(6),
+ B(Ldar), R(closure),
+ B(Star), R(8),
+ B(CallRuntime), U16(Runtime::kPushCatchContext), R(6), U8(3),
+ B(Star), R(5),
+ B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), R(0), U8(0),
+ B(Ldar), R(5),
+ B(PushContext), R(1),
+ B(LdaSmi), U8(20),
+ B(Star), R(0),
+ B(PopContext), R(1),
+ B(LdaSmi), U8(-1),
+ B(Star), R(2),
+ B(Jump), U8(7),
+ B(Star), R(3),
+ B(LdaZero),
+ B(Star), R(2),
+ B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), R(0), U8(0),
+ B(Star), R(4),
+ B(LdaSmi), U8(3),
+ B(Star), R(0),
+ B(CallRuntime), U16(Runtime::kInterpreterSetPendingMessage), R(4), U8(1),
+ B(LdaZero),
+ B(TestEqualStrict), R(2),
+ B(JumpIfTrue), U8(4),
+ B(Jump), U8(5),
+ B(Ldar), R(3),
+ B(ReThrow),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "e",
+]
+handlers: [
+ [8, 49, 55],
+ [11, 15, 17],
+]
+
+---
+snippet: "
+ var a; try {
+ try { a = 1 } catch(e) { a = 2 }
+ } catch(e) { a = 20 } finally { a = 3; }
+"
+frame size: 10
+parameter count: 1
+bytecode array length: 121
+bytecodes: [
+ B(StackCheck),
+ B(Mov), R(context), R(4),
+ B(Mov), R(context), R(5),
+ B(Mov), R(context), R(6),
+ B(LdaSmi), U8(1),
+ B(Star), R(0),
+ B(Jump), U8(34),
+ B(Star), R(8),
+ B(LdaConstant), U8(0),
+ B(Star), R(7),
+ B(Ldar), R(closure),
+ B(Star), R(9),
+ B(CallRuntime), U16(Runtime::kPushCatchContext), R(7), U8(3),
+ B(Star), R(6),
+ B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), R(0), U8(0),
+ B(Ldar), R(6),
+ B(PushContext), R(1),
+ B(LdaSmi), U8(2),
+ B(Star), R(0),
+ B(PopContext), R(1),
+ B(Jump), U8(34),
+ B(Star), R(7),
+ B(LdaConstant), U8(0),
+ B(Star), R(6),
+ B(Ldar), R(closure),
+ B(Star), R(8),
+ B(CallRuntime), U16(Runtime::kPushCatchContext), R(6), U8(3),
+ B(Star), R(5),
+ B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), R(0), U8(0),
+ B(Ldar), R(5),
+ B(PushContext), R(1),
+ B(LdaSmi), U8(20),
+ B(Star), R(0),
+ B(PopContext), R(1),
+ B(LdaSmi), U8(-1),
+ B(Star), R(2),
+ B(Jump), U8(7),
+ B(Star), R(3),
+ B(LdaZero),
+ B(Star), R(2),
+ B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), R(0), U8(0),
+ B(Star), R(4),
+ B(LdaSmi), U8(3),
+ B(Star), R(0),
+ B(CallRuntime), U16(Runtime::kInterpreterSetPendingMessage), R(4), U8(1),
+ B(LdaZero),
+ B(TestEqualStrict), R(2),
+ B(JumpIfTrue), U8(4),
+ B(Jump), U8(5),
+ B(Ldar), R(3),
+ B(ReThrow),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+ "e",
+]
+handlers: [
+ [4, 82, 88],
+ [7, 48, 50],
+ [10, 14, 16],
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/Typeof.golden b/test/cctest/interpreter/bytecode_expectations/Typeof.golden
new file mode 100644
index 0000000..e5db7a7
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/Typeof.golden
@@ -0,0 +1,56 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: string
+execute: yes
+wrap: no
+test function name: f
+
+---
+snippet: "
+ function f() {
+ var x = 13;
+ return typeof(x);
+ };
+ f();
+"
+frame size: 1
+parameter count: 1
+bytecode array length: 7
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(13),
+ B(Star), R(0),
+ B(TypeOf),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 13;
+ function f() {
+ return typeof(x);
+ };
+ f();
+"
+frame size: 0
+parameter count: 1
+bytecode array length: 6
+bytecodes: [
+ B(StackCheck),
+ B(LdaGlobalInsideTypeof), U8(0), U8(1),
+ B(TypeOf),
+ B(Return),
+]
+constant pool: [
+ "x",
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/UnaryOperators.golden b/test/cctest/interpreter/bytecode_expectations/UnaryOperators.golden
new file mode 100644
index 0000000..0a3ca76
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/UnaryOperators.golden
@@ -0,0 +1,194 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: number
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ var x = 0;
+ while (x != 10) {
+ x = x + 10;
+ }
+ return x;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 31
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(10),
+ B(TestEqual), R(1),
+ B(LogicalNot),
+ B(JumpIfFalse), U8(15),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(10),
+ B(Add), R(1),
+ B(Star), R(0),
+ B(Jump), U8(-22),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = false;
+ do {
+ x = !x;
+ } while(x == false);
+ return x;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 22
+bytecodes: [
+ B(StackCheck),
+ B(LdaFalse),
+ B(Star), R(0),
+ B(StackCheck),
+ B(Ldar), R(0),
+ B(LogicalNot),
+ B(Star), R(0),
+ B(Ldar), R(0),
+ B(Star), R(1),
+ B(LdaFalse),
+ B(TestEqual), R(1),
+ B(JumpIfTrue), U8(-13),
+ B(Ldar), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 101;
+ return void(x * 3);
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 13
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(101),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(3),
+ B(Mul), R(1),
+ B(LdaUndefined),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 1234;
+ var y = void (x * x - 1);
+ return y;
+"
+frame size: 4
+parameter count: 1
+bytecode array length: 23
+bytecodes: [
+ B(StackCheck),
+ B(Wide), B(LdaSmi), U16(1234),
+ B(Star), R(0),
+ B(Star), R(2),
+ B(Ldar), R(0),
+ B(Mul), R(2),
+ B(Star), R(3),
+ B(LdaSmi), U8(1),
+ B(Sub), R(3),
+ B(LdaUndefined),
+ B(Star), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 13;
+ return ~x;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 12
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(13),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(-1),
+ B(BitwiseXor), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 13;
+ return +x;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 12
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(13),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(1),
+ B(Mul), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x = 13;
+ return -x;
+"
+frame size: 2
+parameter count: 1
+bytecode array length: 12
+bytecodes: [
+ B(StackCheck),
+ B(LdaSmi), U8(13),
+ B(Star), R(0),
+ B(Star), R(1),
+ B(LdaSmi), U8(-1),
+ B(Mul), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/WideRegisters.golden b/test/cctest/interpreter/bytecode_expectations/WideRegisters.golden
new file mode 100644
index 0000000..9300775
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/WideRegisters.golden
@@ -0,0 +1,1327 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: number
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ var x0;
+ var x1;
+ var x2;
+ var x3;
+ var x4;
+ var x5;
+ var x6;
+ var x7;
+ var x8;
+ var x9;
+ var x10;
+ var x11;
+ var x12;
+ var x13;
+ var x14;
+ var x15;
+ var x16;
+ var x17;
+ var x18;
+ var x19;
+ var x20;
+ var x21;
+ var x22;
+ var x23;
+ var x24;
+ var x25;
+ var x26;
+ var x27;
+ var x28;
+ var x29;
+ var x30;
+ var x31;
+ var x32;
+ var x33;
+ var x34;
+ var x35;
+ var x36;
+ var x37;
+ var x38;
+ var x39;
+ var x40;
+ var x41;
+ var x42;
+ var x43;
+ var x44;
+ var x45;
+ var x46;
+ var x47;
+ var x48;
+ var x49;
+ var x50;
+ var x51;
+ var x52;
+ var x53;
+ var x54;
+ var x55;
+ var x56;
+ var x57;
+ var x58;
+ var x59;
+ var x60;
+ var x61;
+ var x62;
+ var x63;
+ var x64;
+ var x65;
+ var x66;
+ var x67;
+ var x68;
+ var x69;
+ var x70;
+ var x71;
+ var x72;
+ var x73;
+ var x74;
+ var x75;
+ var x76;
+ var x77;
+ var x78;
+ var x79;
+ var x80;
+ var x81;
+ var x82;
+ var x83;
+ var x84;
+ var x85;
+ var x86;
+ var x87;
+ var x88;
+ var x89;
+ var x90;
+ var x91;
+ var x92;
+ var x93;
+ var x94;
+ var x95;
+ var x96;
+ var x97;
+ var x98;
+ var x99;
+ var x100;
+ var x101;
+ var x102;
+ var x103;
+ var x104;
+ var x105;
+ var x106;
+ var x107;
+ var x108;
+ var x109;
+ var x110;
+ var x111;
+ var x112;
+ var x113;
+ var x114;
+ var x115;
+ var x116;
+ var x117;
+ var x118;
+ var x119;
+ var x120;
+ var x121;
+ var x122;
+ var x123;
+ var x124;
+ var x125;
+ var x126;
+ var x127;
+ var x128;
+ var x129;
+ var x130;
+ var x131;
+ var x132;
+ var x133;
+ var x134;
+ var x135;
+ var x136;
+ var x137;
+ var x138;
+ var x139;
+ var x140;
+ var x141;
+ var x142;
+ var x143;
+ var x144;
+ var x145;
+ var x146;
+ var x147;
+ var x148;
+ var x149;
+ var x150;
+ var x151;
+ var x152;
+ var x153;
+ var x154;
+ var x155;
+ var x156;
+ x0 = x127;
+ return x0;
+"
+frame size: 157
+parameter count: 1
+bytecode array length: 6
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(127),
+ B(Star), R(0),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x0;
+ var x1;
+ var x2;
+ var x3;
+ var x4;
+ var x5;
+ var x6;
+ var x7;
+ var x8;
+ var x9;
+ var x10;
+ var x11;
+ var x12;
+ var x13;
+ var x14;
+ var x15;
+ var x16;
+ var x17;
+ var x18;
+ var x19;
+ var x20;
+ var x21;
+ var x22;
+ var x23;
+ var x24;
+ var x25;
+ var x26;
+ var x27;
+ var x28;
+ var x29;
+ var x30;
+ var x31;
+ var x32;
+ var x33;
+ var x34;
+ var x35;
+ var x36;
+ var x37;
+ var x38;
+ var x39;
+ var x40;
+ var x41;
+ var x42;
+ var x43;
+ var x44;
+ var x45;
+ var x46;
+ var x47;
+ var x48;
+ var x49;
+ var x50;
+ var x51;
+ var x52;
+ var x53;
+ var x54;
+ var x55;
+ var x56;
+ var x57;
+ var x58;
+ var x59;
+ var x60;
+ var x61;
+ var x62;
+ var x63;
+ var x64;
+ var x65;
+ var x66;
+ var x67;
+ var x68;
+ var x69;
+ var x70;
+ var x71;
+ var x72;
+ var x73;
+ var x74;
+ var x75;
+ var x76;
+ var x77;
+ var x78;
+ var x79;
+ var x80;
+ var x81;
+ var x82;
+ var x83;
+ var x84;
+ var x85;
+ var x86;
+ var x87;
+ var x88;
+ var x89;
+ var x90;
+ var x91;
+ var x92;
+ var x93;
+ var x94;
+ var x95;
+ var x96;
+ var x97;
+ var x98;
+ var x99;
+ var x100;
+ var x101;
+ var x102;
+ var x103;
+ var x104;
+ var x105;
+ var x106;
+ var x107;
+ var x108;
+ var x109;
+ var x110;
+ var x111;
+ var x112;
+ var x113;
+ var x114;
+ var x115;
+ var x116;
+ var x117;
+ var x118;
+ var x119;
+ var x120;
+ var x121;
+ var x122;
+ var x123;
+ var x124;
+ var x125;
+ var x126;
+ var x127;
+ var x128;
+ var x129;
+ var x130;
+ var x131;
+ var x132;
+ var x133;
+ var x134;
+ var x135;
+ var x136;
+ var x137;
+ var x138;
+ var x139;
+ var x140;
+ var x141;
+ var x142;
+ var x143;
+ var x144;
+ var x145;
+ var x146;
+ var x147;
+ var x148;
+ var x149;
+ var x150;
+ var x151;
+ var x152;
+ var x153;
+ var x154;
+ var x155;
+ var x156;
+ x127 = x126;
+ return x127;
+"
+frame size: 157
+parameter count: 1
+bytecode array length: 6
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(126),
+ B(Star), R(127),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x0;
+ var x1;
+ var x2;
+ var x3;
+ var x4;
+ var x5;
+ var x6;
+ var x7;
+ var x8;
+ var x9;
+ var x10;
+ var x11;
+ var x12;
+ var x13;
+ var x14;
+ var x15;
+ var x16;
+ var x17;
+ var x18;
+ var x19;
+ var x20;
+ var x21;
+ var x22;
+ var x23;
+ var x24;
+ var x25;
+ var x26;
+ var x27;
+ var x28;
+ var x29;
+ var x30;
+ var x31;
+ var x32;
+ var x33;
+ var x34;
+ var x35;
+ var x36;
+ var x37;
+ var x38;
+ var x39;
+ var x40;
+ var x41;
+ var x42;
+ var x43;
+ var x44;
+ var x45;
+ var x46;
+ var x47;
+ var x48;
+ var x49;
+ var x50;
+ var x51;
+ var x52;
+ var x53;
+ var x54;
+ var x55;
+ var x56;
+ var x57;
+ var x58;
+ var x59;
+ var x60;
+ var x61;
+ var x62;
+ var x63;
+ var x64;
+ var x65;
+ var x66;
+ var x67;
+ var x68;
+ var x69;
+ var x70;
+ var x71;
+ var x72;
+ var x73;
+ var x74;
+ var x75;
+ var x76;
+ var x77;
+ var x78;
+ var x79;
+ var x80;
+ var x81;
+ var x82;
+ var x83;
+ var x84;
+ var x85;
+ var x86;
+ var x87;
+ var x88;
+ var x89;
+ var x90;
+ var x91;
+ var x92;
+ var x93;
+ var x94;
+ var x95;
+ var x96;
+ var x97;
+ var x98;
+ var x99;
+ var x100;
+ var x101;
+ var x102;
+ var x103;
+ var x104;
+ var x105;
+ var x106;
+ var x107;
+ var x108;
+ var x109;
+ var x110;
+ var x111;
+ var x112;
+ var x113;
+ var x114;
+ var x115;
+ var x116;
+ var x117;
+ var x118;
+ var x119;
+ var x120;
+ var x121;
+ var x122;
+ var x123;
+ var x124;
+ var x125;
+ var x126;
+ var x127;
+ var x128;
+ var x129;
+ var x130;
+ var x131;
+ var x132;
+ var x133;
+ var x134;
+ var x135;
+ var x136;
+ var x137;
+ var x138;
+ var x139;
+ var x140;
+ var x141;
+ var x142;
+ var x143;
+ var x144;
+ var x145;
+ var x146;
+ var x147;
+ var x148;
+ var x149;
+ var x150;
+ var x151;
+ var x152;
+ var x153;
+ var x154;
+ var x155;
+ var x156;
+ if (x2 > 3) { return x129; }
+ return x128;
+"
+frame size: 158
+parameter count: 1
+bytecode array length: 23
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(2),
+ B(Wide), B(Star), R16(157),
+ B(LdaSmi), U8(3),
+ B(Wide), B(TestGreaterThan), R16(157),
+ B(JumpIfFalse), U8(7),
+ B(Wide), B(Ldar), R16(129),
+ B(Return),
+ B(Ldar), R(128),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x0;
+ var x1;
+ var x2;
+ var x3;
+ var x4;
+ var x5;
+ var x6;
+ var x7;
+ var x8;
+ var x9;
+ var x10;
+ var x11;
+ var x12;
+ var x13;
+ var x14;
+ var x15;
+ var x16;
+ var x17;
+ var x18;
+ var x19;
+ var x20;
+ var x21;
+ var x22;
+ var x23;
+ var x24;
+ var x25;
+ var x26;
+ var x27;
+ var x28;
+ var x29;
+ var x30;
+ var x31;
+ var x32;
+ var x33;
+ var x34;
+ var x35;
+ var x36;
+ var x37;
+ var x38;
+ var x39;
+ var x40;
+ var x41;
+ var x42;
+ var x43;
+ var x44;
+ var x45;
+ var x46;
+ var x47;
+ var x48;
+ var x49;
+ var x50;
+ var x51;
+ var x52;
+ var x53;
+ var x54;
+ var x55;
+ var x56;
+ var x57;
+ var x58;
+ var x59;
+ var x60;
+ var x61;
+ var x62;
+ var x63;
+ var x64;
+ var x65;
+ var x66;
+ var x67;
+ var x68;
+ var x69;
+ var x70;
+ var x71;
+ var x72;
+ var x73;
+ var x74;
+ var x75;
+ var x76;
+ var x77;
+ var x78;
+ var x79;
+ var x80;
+ var x81;
+ var x82;
+ var x83;
+ var x84;
+ var x85;
+ var x86;
+ var x87;
+ var x88;
+ var x89;
+ var x90;
+ var x91;
+ var x92;
+ var x93;
+ var x94;
+ var x95;
+ var x96;
+ var x97;
+ var x98;
+ var x99;
+ var x100;
+ var x101;
+ var x102;
+ var x103;
+ var x104;
+ var x105;
+ var x106;
+ var x107;
+ var x108;
+ var x109;
+ var x110;
+ var x111;
+ var x112;
+ var x113;
+ var x114;
+ var x115;
+ var x116;
+ var x117;
+ var x118;
+ var x119;
+ var x120;
+ var x121;
+ var x122;
+ var x123;
+ var x124;
+ var x125;
+ var x126;
+ var x127;
+ var x128;
+ var x129;
+ var x130;
+ var x131;
+ var x132;
+ var x133;
+ var x134;
+ var x135;
+ var x136;
+ var x137;
+ var x138;
+ var x139;
+ var x140;
+ var x141;
+ var x142;
+ var x143;
+ var x144;
+ var x145;
+ var x146;
+ var x147;
+ var x148;
+ var x149;
+ var x150;
+ var x151;
+ var x152;
+ var x153;
+ var x154;
+ var x155;
+ var x156;
+ var x0 = 0;
+ if (x129 == 3) { var x129 = x0; }
+ if (x2 > 3) { return x0; }
+ return x129;
+"
+frame size: 158
+parameter count: 1
+bytecode array length: 48
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(Wide), B(Ldar), R16(129),
+ B(Wide), B(Star), R16(157),
+ B(LdaSmi), U8(3),
+ B(Wide), B(TestEqual), R16(157),
+ B(JumpIfFalse), U8(8),
+ B(Ldar), R(0),
+ B(Wide), B(Star), R16(129),
+ B(Ldar), R(2),
+ B(Wide), B(Star), R16(157),
+ B(LdaSmi), U8(3),
+ B(Wide), B(TestGreaterThan), R16(157),
+ B(JumpIfFalse), U8(5),
+ B(Ldar), R(0),
+ B(Return),
+ B(Wide), B(Ldar), R16(129),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x0;
+ var x1;
+ var x2;
+ var x3;
+ var x4;
+ var x5;
+ var x6;
+ var x7;
+ var x8;
+ var x9;
+ var x10;
+ var x11;
+ var x12;
+ var x13;
+ var x14;
+ var x15;
+ var x16;
+ var x17;
+ var x18;
+ var x19;
+ var x20;
+ var x21;
+ var x22;
+ var x23;
+ var x24;
+ var x25;
+ var x26;
+ var x27;
+ var x28;
+ var x29;
+ var x30;
+ var x31;
+ var x32;
+ var x33;
+ var x34;
+ var x35;
+ var x36;
+ var x37;
+ var x38;
+ var x39;
+ var x40;
+ var x41;
+ var x42;
+ var x43;
+ var x44;
+ var x45;
+ var x46;
+ var x47;
+ var x48;
+ var x49;
+ var x50;
+ var x51;
+ var x52;
+ var x53;
+ var x54;
+ var x55;
+ var x56;
+ var x57;
+ var x58;
+ var x59;
+ var x60;
+ var x61;
+ var x62;
+ var x63;
+ var x64;
+ var x65;
+ var x66;
+ var x67;
+ var x68;
+ var x69;
+ var x70;
+ var x71;
+ var x72;
+ var x73;
+ var x74;
+ var x75;
+ var x76;
+ var x77;
+ var x78;
+ var x79;
+ var x80;
+ var x81;
+ var x82;
+ var x83;
+ var x84;
+ var x85;
+ var x86;
+ var x87;
+ var x88;
+ var x89;
+ var x90;
+ var x91;
+ var x92;
+ var x93;
+ var x94;
+ var x95;
+ var x96;
+ var x97;
+ var x98;
+ var x99;
+ var x100;
+ var x101;
+ var x102;
+ var x103;
+ var x104;
+ var x105;
+ var x106;
+ var x107;
+ var x108;
+ var x109;
+ var x110;
+ var x111;
+ var x112;
+ var x113;
+ var x114;
+ var x115;
+ var x116;
+ var x117;
+ var x118;
+ var x119;
+ var x120;
+ var x121;
+ var x122;
+ var x123;
+ var x124;
+ var x125;
+ var x126;
+ var x127;
+ var x128;
+ var x129;
+ var x130;
+ var x131;
+ var x132;
+ var x133;
+ var x134;
+ var x135;
+ var x136;
+ var x137;
+ var x138;
+ var x139;
+ var x140;
+ var x141;
+ var x142;
+ var x143;
+ var x144;
+ var x145;
+ var x146;
+ var x147;
+ var x148;
+ var x149;
+ var x150;
+ var x151;
+ var x152;
+ var x153;
+ var x154;
+ var x155;
+ var x156;
+ var x0 = 0;
+ var x1 = 0;
+ for (x128 = 0; x128 < 64; x128++) { x1 += x128;}return x128;
+"
+frame size: 158
+parameter count: 1
+bytecode array length: 54
+bytecodes: [
+ B(StackCheck),
+ B(LdaZero),
+ B(Star), R(0),
+ B(LdaZero),
+ B(Star), R(1),
+ B(LdaZero),
+ B(Star), R(128),
+ B(Ldar), R(128),
+ B(Wide), B(Star), R16(157),
+ B(LdaSmi), U8(64),
+ B(Wide), B(TestLessThan), R16(157),
+ B(JumpIfFalse), U8(29),
+ B(StackCheck),
+ B(Ldar), R(1),
+ B(Wide), B(Star), R16(157),
+ B(Ldar), R(128),
+ B(Wide), B(Add), R16(157),
+ B(Star), R(1),
+ B(Ldar), R(128),
+ B(ToNumber),
+ B(Wide), B(Star), R16(157),
+ B(Inc),
+ B(Star), R(128),
+ B(Jump), U8(-39),
+ B(Ldar), R(128),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x0;
+ var x1;
+ var x2;
+ var x3;
+ var x4;
+ var x5;
+ var x6;
+ var x7;
+ var x8;
+ var x9;
+ var x10;
+ var x11;
+ var x12;
+ var x13;
+ var x14;
+ var x15;
+ var x16;
+ var x17;
+ var x18;
+ var x19;
+ var x20;
+ var x21;
+ var x22;
+ var x23;
+ var x24;
+ var x25;
+ var x26;
+ var x27;
+ var x28;
+ var x29;
+ var x30;
+ var x31;
+ var x32;
+ var x33;
+ var x34;
+ var x35;
+ var x36;
+ var x37;
+ var x38;
+ var x39;
+ var x40;
+ var x41;
+ var x42;
+ var x43;
+ var x44;
+ var x45;
+ var x46;
+ var x47;
+ var x48;
+ var x49;
+ var x50;
+ var x51;
+ var x52;
+ var x53;
+ var x54;
+ var x55;
+ var x56;
+ var x57;
+ var x58;
+ var x59;
+ var x60;
+ var x61;
+ var x62;
+ var x63;
+ var x64;
+ var x65;
+ var x66;
+ var x67;
+ var x68;
+ var x69;
+ var x70;
+ var x71;
+ var x72;
+ var x73;
+ var x74;
+ var x75;
+ var x76;
+ var x77;
+ var x78;
+ var x79;
+ var x80;
+ var x81;
+ var x82;
+ var x83;
+ var x84;
+ var x85;
+ var x86;
+ var x87;
+ var x88;
+ var x89;
+ var x90;
+ var x91;
+ var x92;
+ var x93;
+ var x94;
+ var x95;
+ var x96;
+ var x97;
+ var x98;
+ var x99;
+ var x100;
+ var x101;
+ var x102;
+ var x103;
+ var x104;
+ var x105;
+ var x106;
+ var x107;
+ var x108;
+ var x109;
+ var x110;
+ var x111;
+ var x112;
+ var x113;
+ var x114;
+ var x115;
+ var x116;
+ var x117;
+ var x118;
+ var x119;
+ var x120;
+ var x121;
+ var x122;
+ var x123;
+ var x124;
+ var x125;
+ var x126;
+ var x127;
+ var x128;
+ var x129;
+ var x130;
+ var x131;
+ var x132;
+ var x133;
+ var x134;
+ var x135;
+ var x136;
+ var x137;
+ var x138;
+ var x139;
+ var x140;
+ var x141;
+ var x142;
+ var x143;
+ var x144;
+ var x145;
+ var x146;
+ var x147;
+ var x148;
+ var x149;
+ var x150;
+ var x151;
+ var x152;
+ var x153;
+ var x154;
+ var x155;
+ var x156;
+ var x0 = 1234;
+ var x1 = 0;
+ for (x128 in x0) { x1 += x128;}return x1;
+"
+frame size: 163
+parameter count: 1
+bytecode array length: 80
+bytecodes: [
+ B(StackCheck),
+ B(Wide), B(LdaSmi), U16(1234),
+ B(Star), R(0),
+ B(LdaZero),
+ B(Star), R(1),
+ B(Ldar), R(0),
+ B(JumpIfUndefined), U8(65),
+ B(JumpIfNull), U8(63),
+ B(ToObject),
+ B(Wide), B(Star), R16(157),
+ B(Wide), B(ForInPrepare), R16(158),
+ B(LdaZero),
+ B(Wide), B(Star), R16(161),
+ B(Wide), B(ForInDone), R16(161), R16(160),
+ B(JumpIfTrue), U8(41),
+ B(Wide), B(ForInNext), R16(157), R16(161), R16(158), U16(1),
+ B(JumpIfUndefined), U8(19),
+ B(Star), R(128),
+ B(StackCheck),
+ B(Ldar), R(1),
+ B(Wide), B(Star), R16(162),
+ B(Ldar), R(128),
+ B(Wide), B(Add), R16(162),
+ B(Star), R(1),
+ B(Wide), B(ForInStep), R16(161),
+ B(Wide), B(Star), R16(161),
+ B(Jump), U8(-45),
+ B(Ldar), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
+---
+snippet: "
+ var x0;
+ var x1;
+ var x2;
+ var x3;
+ var x4;
+ var x5;
+ var x6;
+ var x7;
+ var x8;
+ var x9;
+ var x10;
+ var x11;
+ var x12;
+ var x13;
+ var x14;
+ var x15;
+ var x16;
+ var x17;
+ var x18;
+ var x19;
+ var x20;
+ var x21;
+ var x22;
+ var x23;
+ var x24;
+ var x25;
+ var x26;
+ var x27;
+ var x28;
+ var x29;
+ var x30;
+ var x31;
+ var x32;
+ var x33;
+ var x34;
+ var x35;
+ var x36;
+ var x37;
+ var x38;
+ var x39;
+ var x40;
+ var x41;
+ var x42;
+ var x43;
+ var x44;
+ var x45;
+ var x46;
+ var x47;
+ var x48;
+ var x49;
+ var x50;
+ var x51;
+ var x52;
+ var x53;
+ var x54;
+ var x55;
+ var x56;
+ var x57;
+ var x58;
+ var x59;
+ var x60;
+ var x61;
+ var x62;
+ var x63;
+ var x64;
+ var x65;
+ var x66;
+ var x67;
+ var x68;
+ var x69;
+ var x70;
+ var x71;
+ var x72;
+ var x73;
+ var x74;
+ var x75;
+ var x76;
+ var x77;
+ var x78;
+ var x79;
+ var x80;
+ var x81;
+ var x82;
+ var x83;
+ var x84;
+ var x85;
+ var x86;
+ var x87;
+ var x88;
+ var x89;
+ var x90;
+ var x91;
+ var x92;
+ var x93;
+ var x94;
+ var x95;
+ var x96;
+ var x97;
+ var x98;
+ var x99;
+ var x100;
+ var x101;
+ var x102;
+ var x103;
+ var x104;
+ var x105;
+ var x106;
+ var x107;
+ var x108;
+ var x109;
+ var x110;
+ var x111;
+ var x112;
+ var x113;
+ var x114;
+ var x115;
+ var x116;
+ var x117;
+ var x118;
+ var x119;
+ var x120;
+ var x121;
+ var x122;
+ var x123;
+ var x124;
+ var x125;
+ var x126;
+ var x127;
+ var x128;
+ var x129;
+ var x130;
+ var x131;
+ var x132;
+ var x133;
+ var x134;
+ var x135;
+ var x136;
+ var x137;
+ var x138;
+ var x139;
+ var x140;
+ var x141;
+ var x142;
+ var x143;
+ var x144;
+ var x145;
+ var x146;
+ var x147;
+ var x148;
+ var x149;
+ var x150;
+ var x151;
+ var x152;
+ var x153;
+ var x154;
+ var x155;
+ var x156;
+ x0 = %Add(x64, x63);
+ x1 = %Add(x27, x143);
+ %TheHole();
+ return x1;
+"
+frame size: 159
+parameter count: 1
+bytecode array length: 55
+bytecodes: [
+ B(StackCheck),
+ B(Ldar), R(64),
+ B(Wide), B(Star), R16(157),
+ B(Ldar), R(63),
+ B(Wide), B(Star), R16(158),
+ B(Wide), B(CallRuntime), U16(Runtime::kAdd), R16(157), U16(2),
+ B(Star), R(0),
+ B(Ldar), R(27),
+ B(Wide), B(Star), R16(157),
+ B(Wide), B(Ldar), R16(143),
+ B(Wide), B(Star), R16(158),
+ B(Wide), B(CallRuntime), U16(Runtime::kAdd), R16(157), U16(2),
+ B(Star), R(1),
+ B(CallRuntime), U16(Runtime::kTheHole), R(0), U8(0),
+ B(Ldar), R(1),
+ B(Return),
+]
+constant pool: [
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/bytecode_expectations/WithStatement.golden b/test/cctest/interpreter/bytecode_expectations/WithStatement.golden
new file mode 100644
index 0000000..350a0a5
--- /dev/null
+++ b/test/cctest/interpreter/bytecode_expectations/WithStatement.golden
@@ -0,0 +1,37 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+pool type: mixed
+execute: yes
+wrap: yes
+
+---
+snippet: "
+ with ({x:42}) { return x; }
+"
+frame size: 4
+parameter count: 1
+bytecode array length: 26
+bytecodes: [
+ B(StackCheck),
+ B(CreateObjectLiteral), U8(0), U8(0), U8(5),
+ B(Star), R(1),
+ B(ToObject),
+ B(Star), R(2),
+ B(Ldar), R(closure),
+ B(Star), R(3),
+ B(CallRuntime), U16(Runtime::kPushWithContext), R(2), U8(2),
+ B(PushContext), R(0),
+ B(LdaLookupSlot), U8(1),
+ B(PopContext), R(0),
+ B(Return),
+]
+constant pool: [
+ InstanceType::FIXED_ARRAY_TYPE,
+ InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
+]
+handlers: [
+]
+
diff --git a/test/cctest/interpreter/generate-bytecode-expectations.cc b/test/cctest/interpreter/generate-bytecode-expectations.cc
index 567aa41..92ba9ba 100644
--- a/test/cctest/interpreter/generate-bytecode-expectations.cc
+++ b/test/cctest/interpreter/generate-bytecode-expectations.cc
@@ -4,6 +4,7 @@
#include <cstring>
#include <fstream>
+#include <vector>
#include "test/cctest/interpreter/bytecode-expectations-printer.h"
@@ -15,10 +16,20 @@
#include "src/compiler.h"
#include "src/interpreter/interpreter.h"
+#ifdef V8_OS_POSIX
+#include <dirent.h>
+#endif
+
using v8::internal::interpreter::BytecodeExpectationsPrinter;
+#define REPORT_ERROR(MESSAGE) (((std::cerr << "ERROR: ") << MESSAGE) << '\n')
+
namespace {
+#ifdef V8_OS_POSIX
+const char* kGoldenFilesPath = "test/cctest/interpreter/bytecode_expectations/";
+#endif
+
class ProgramOptions final {
public:
static ProgramOptions FromCommandLine(int argc, char** argv);
@@ -32,8 +43,8 @@
wrap_(true),
execute_(true),
top_level_(false),
- legacy_const_(false),
do_expressions_(false),
+ verbose_(false),
const_pool_type_(
BytecodeExpectationsPrinter::ConstantPoolType::kMixed) {}
@@ -52,12 +63,13 @@
bool wrap() const { return wrap_; }
bool execute() const { return execute_; }
bool top_level() const { return top_level_; }
- bool legacy_const() const { return legacy_const_; }
bool do_expressions() const { return do_expressions_; }
+ bool verbose() const { return verbose_; }
+ bool suppress_runtime_errors() const { return rebaseline_ && !verbose_; }
BytecodeExpectationsPrinter::ConstantPoolType const_pool_type() const {
return const_pool_type_;
}
- std::string input_filename() const { return input_filename_; }
+ std::vector<std::string> input_filenames() const { return input_filenames_; }
std::string output_filename() const { return output_filename_; }
std::string test_function_name() const { return test_function_name_; }
@@ -70,10 +82,10 @@
bool wrap_;
bool execute_;
bool top_level_;
- bool legacy_const_;
bool do_expressions_;
+ bool verbose_;
BytecodeExpectationsPrinter::ConstantPoolType const_pool_type_;
- std::string input_filename_;
+ std::vector<std::string> input_filenames_;
std::string output_filename_;
std::string test_function_name_;
};
@@ -144,6 +156,39 @@
const char* BooleanToString(bool value) { return value ? "yes" : "no"; }
+#ifdef V8_OS_POSIX
+
+bool StrEndsWith(const char* string, const char* suffix) {
+ int string_size = i::StrLength(string);
+ int suffix_size = i::StrLength(suffix);
+ if (string_size < suffix_size) return false;
+
+ return strcmp(string + (string_size - suffix_size), suffix) == 0;
+}
+
+bool CollectGoldenFiles(std::vector<std::string>* golden_file_list,
+ const char* directory_path) {
+ DIR* directory = opendir(directory_path);
+ if (!directory) return false;
+
+ dirent entry_buffer;
+ dirent* entry;
+
+ while (readdir_r(directory, &entry_buffer, &entry) == 0 && entry) {
+ if (StrEndsWith(entry->d_name, ".golden")) {
+ std::string golden_filename(kGoldenFilesPath);
+ golden_filename += entry->d_name;
+ golden_file_list->push_back(golden_filename);
+ }
+ }
+
+ closedir(directory);
+
+ return true;
+}
+
+#endif // V8_OS_POSIX
+
// static
ProgramOptions ProgramOptions::FromCommandLine(int argc, char** argv) {
ProgramOptions options;
@@ -165,28 +210,38 @@
options.execute_ = false;
} else if (strcmp(argv[i], "--top-level") == 0) {
options.top_level_ = true;
- } else if (strcmp(argv[i], "--legacy-const") == 0) {
- options.legacy_const_ = true;
} else if (strcmp(argv[i], "--do-expressions") == 0) {
options.do_expressions_ = true;
+ } else if (strcmp(argv[i], "--verbose") == 0) {
+ options.verbose_ = true;
} else if (strncmp(argv[i], "--output=", 9) == 0) {
options.output_filename_ = argv[i] + 9;
} else if (strncmp(argv[i], "--test-function-name=", 21) == 0) {
options.test_function_name_ = argv[i] + 21;
} else if (strncmp(argv[i], "--", 2) != 0) { // It doesn't start with --
- if (!options.input_filename_.empty()) {
- std::cerr << "ERROR: More than one input file specified\n";
- options.parsing_failed_ = true;
- break;
- }
- options.input_filename_ = argv[i];
+ options.input_filenames_.push_back(argv[i]);
} else {
- std::cerr << "ERROR: Unknonwn option " << argv[i] << "\n";
+ REPORT_ERROR("Unknown option " << argv[i]);
options.parsing_failed_ = true;
break;
}
}
+ if (options.rebaseline_ && options.input_filenames_.empty()) {
+#ifdef V8_OS_POSIX
+ if (options.verbose_) {
+ std::cout << "Looking for golden files in " << kGoldenFilesPath << '\n';
+ }
+ if (!CollectGoldenFiles(&options.input_filenames_, kGoldenFilesPath)) {
+ REPORT_ERROR("Golden files autodiscovery failed.");
+ options.parsing_failed_ = true;
+ }
+#else
+ REPORT_ERROR("Golden files autodiscovery requires a POSIX OS, sorry.");
+ options.parsing_failed_ = true;
+#endif
+ }
+
return options;
}
@@ -196,28 +251,44 @@
if (const_pool_type_ ==
BytecodeExpectationsPrinter::ConstantPoolType::kUnknown) {
- std::cerr << "ERROR: Unknown constant pool type.\n";
+ REPORT_ERROR("Unknown constant pool type.");
return false;
}
- if (!read_from_stdin_ && input_filename_.empty()) {
- std::cerr << "ERROR: No input file specified.\n";
+ if (!read_from_stdin_ && input_filenames_.empty()) {
+ REPORT_ERROR("No input file specified.");
return false;
}
- if (read_from_stdin_ && !input_filename_.empty()) {
- std::cerr << "ERROR: Reading from stdin, but input files supplied.\n";
+ if (read_from_stdin_ && !input_filenames_.empty()) {
+ REPORT_ERROR("Reading from stdin, but input files supplied.");
return false;
}
if (rebaseline_ && read_raw_js_snippet_) {
- std::cerr << "ERROR: Cannot use --rebaseline on a raw JS snippet.\n";
+ REPORT_ERROR("Cannot use --rebaseline on a raw JS snippet.");
+ return false;
+ }
+
+ if (rebaseline_ && !output_filename_.empty()) {
+ REPORT_ERROR("Output file cannot be specified together with --rebaseline.");
+ return false;
+ }
+
+ if (rebaseline_ && read_from_stdin_) {
+ REPORT_ERROR("Cannot --rebaseline when input is --stdin.");
+ return false;
+ }
+
+ if (input_filenames_.size() > 1 && !rebaseline_ && !read_raw_js_snippet()) {
+ REPORT_ERROR(
+ "Multiple input files, but no --rebaseline or --raw-js specified.");
return false;
}
if (top_level_ && !test_function_name_.empty()) {
- std::cerr << "ERROR: test function name specified while processing "
- "top level code.\n";
+ REPORT_ERROR(
+ "Test function name specified while processing top level code.");
return false;
}
@@ -243,8 +314,6 @@
test_function_name_ = line.c_str() + 20;
} else if (line.compare(0, 11, "top level: ") == 0) {
top_level_ = ParseBoolean(line.c_str() + 11);
- } else if (line.compare(0, 14, "legacy const: ") == 0) {
- legacy_const_ = ParseBoolean(line.c_str() + 14);
} else if (line.compare(0, 16, "do expressions: ") == 0) {
do_expressions_ = ParseBoolean(line.c_str() + 16);
} else if (line == "---") {
@@ -270,7 +339,6 @@
}
if (top_level_) stream << "\ntop level: yes";
- if (legacy_const_) stream << "\nlegacy const: yes";
if (do_expressions_) stream << "\ndo expressions: yes";
stream << "\n\n";
@@ -360,41 +428,66 @@
void GenerateExpectationsFile(std::ostream& stream, // NOLINT
const std::vector<std::string>& snippet_list,
- const ProgramOptions& options,
- const char* exec_path) {
- V8InitializationScope platform(exec_path);
- {
- v8::Isolate::Scope isolate_scope(platform.isolate());
- v8::HandleScope handle_scope(platform.isolate());
- v8::Local<v8::Context> context = v8::Context::New(platform.isolate());
- v8::Context::Scope context_scope(context);
+ const V8InitializationScope& platform,
+ const ProgramOptions& options) {
+ v8::Isolate::Scope isolate_scope(platform.isolate());
+ v8::HandleScope handle_scope(platform.isolate());
+ v8::Local<v8::Context> context = v8::Context::New(platform.isolate());
+ v8::Context::Scope context_scope(context);
- BytecodeExpectationsPrinter printer(platform.isolate(),
- options.const_pool_type());
- printer.set_wrap(options.wrap());
- printer.set_execute(options.execute());
- printer.set_top_level(options.top_level());
- if (!options.test_function_name().empty()) {
- printer.set_test_function_name(options.test_function_name());
- }
+ BytecodeExpectationsPrinter printer(platform.isolate(),
+ options.const_pool_type());
+ printer.set_wrap(options.wrap());
+ printer.set_execute(options.execute());
+ printer.set_top_level(options.top_level());
+ if (!options.test_function_name().empty()) {
+ printer.set_test_function_name(options.test_function_name());
+ }
- if (options.legacy_const()) i::FLAG_legacy_const = true;
- if (options.do_expressions()) i::FLAG_harmony_do_expressions = true;
+ if (options.do_expressions()) i::FLAG_harmony_do_expressions = true;
- stream << "#\n# Autogenerated by generate-bytecode-expectations\n#\n\n";
- options.PrintHeader(stream);
- for (const std::string& snippet : snippet_list) {
- printer.PrintExpectation(stream, snippet);
+ stream << "#\n# Autogenerated by generate-bytecode-expectations.\n#\n\n";
+ options.PrintHeader(stream);
+ for (const std::string& snippet : snippet_list) {
+ printer.PrintExpectation(stream, snippet);
+ }
+
+ i::FLAG_harmony_do_expressions = false;
+}
+
+bool WriteExpectationsFile(const std::vector<std::string>& snippet_list,
+ const V8InitializationScope& platform,
+ const ProgramOptions& options,
+ const std::string& output_filename) {
+ std::ofstream output_file_handle;
+ if (!options.write_to_stdout()) {
+ output_file_handle.open(output_filename.c_str());
+ if (!output_file_handle.is_open()) {
+ REPORT_ERROR("Could not open " << output_filename << " for writing.");
+ return false;
}
}
+ std::ostream& output_stream =
+ options.write_to_stdout() ? std::cout : output_file_handle;
+
+ GenerateExpectationsFile(output_stream, snippet_list, platform, options);
+
+ return true;
}
+void PrintMessage(v8::Local<v8::Message> message, v8::Local<v8::Value>) {
+ std::cerr << "INFO: " << *v8::String::Utf8Value(message->Get()) << '\n';
+}
+
+void DiscardMessage(v8::Local<v8::Message>, v8::Local<v8::Value>) {}
+
void PrintUsage(const char* exec_path) {
std::cerr
<< "\nUsage: " << exec_path
- << " [OPTIONS]... [INPUT FILE]\n\n"
+ << " [OPTIONS]... [INPUT FILES]...\n\n"
"Options:\n"
" --help Print this help message.\n"
+ " --verbose Emit messages about the progress of the tool.\n"
" --raw-js Read raw JavaScript, instead of the output format.\n"
" --stdin Read from standard input instead of file.\n"
" --rebaseline Rebaseline input snippet file.\n"
@@ -402,8 +495,7 @@
" --no-execute Do not execute after compilation.\n"
" --test-function-name=foo "
"Specify the name of the test function.\n"
- " --top-level Process top level code, not the top-level function."
- " --legacy-const Enable legacy_const flag.\n"
+ " --top-level Process top level code, not the top-level function.\n"
" --do-expressions Enable harmony_do_expressions flag.\n"
" --output=file.name\n"
" Specify the output file. If not specified, output goes to "
@@ -431,39 +523,52 @@
return options.print_help() ? 0 : 1;
}
- std::ifstream input_file_handle;
- if (!options.read_from_stdin()) {
- input_file_handle.open(options.input_filename().c_str());
- if (!input_file_handle.is_open()) {
- std::cerr << "ERROR: Could not open '" << options.input_filename()
- << "' for reading.\n";
- return 2;
- }
- }
- std::istream& input_stream =
- options.read_from_stdin() ? std::cin : input_file_handle;
-
- if (options.rebaseline()) {
- options.UpdateFromHeader(input_stream);
- CHECK(options.Validate());
- }
+ V8InitializationScope platform(argv[0]);
+ platform.isolate()->AddMessageListener(
+ options.suppress_runtime_errors() ? DiscardMessage : PrintMessage);
std::vector<std::string> snippet_list;
- ExtractSnippets(&snippet_list, input_stream, options.read_raw_js_snippet());
- std::ofstream output_file_handle;
- if (!options.write_to_stdout()) {
- output_file_handle.open(options.rebaseline()
- ? options.input_filename().c_str()
- : options.output_filename().c_str());
- if (!output_file_handle.is_open()) {
- std::cerr << "ERROR: Could not open '" << options.output_filename()
- << "' for writing.\n";
+ if (options.read_from_stdin()) {
+ // Rebaseline will never get here, so we will always take the
+ // GenerateExpectationsFile at the end of this function.
+ DCHECK(!options.rebaseline());
+ ExtractSnippets(&snippet_list, std::cin, options.read_raw_js_snippet());
+ } else {
+ for (const std::string& input_filename : options.input_filenames()) {
+ if (options.verbose()) {
+ std::cerr << "Processing " << input_filename << '\n';
+ }
+
+ std::ifstream input_stream(input_filename.c_str());
+ if (!input_stream.is_open()) {
+ REPORT_ERROR("Could not open " << input_filename << " for reading.");
+ return 2;
+ }
+
+ ProgramOptions updated_options = options;
+ if (options.rebaseline()) {
+ updated_options.UpdateFromHeader(input_stream);
+ CHECK(updated_options.Validate());
+ }
+
+ ExtractSnippets(&snippet_list, input_stream,
+ options.read_raw_js_snippet());
+
+ if (options.rebaseline()) {
+ if (!WriteExpectationsFile(snippet_list, platform, updated_options,
+ input_filename)) {
+ return 3;
+ }
+ snippet_list.clear();
+ }
+ }
+ }
+
+ if (!options.rebaseline()) {
+ if (!WriteExpectationsFile(snippet_list, platform, options,
+ options.output_filename())) {
return 3;
}
}
- std::ostream& output_stream =
- options.write_to_stdout() ? std::cout : output_file_handle;
-
- GenerateExpectationsFile(output_stream, snippet_list, options, argv[0]);
}
diff --git a/test/cctest/interpreter/interpreter-tester.cc b/test/cctest/interpreter/interpreter-tester.cc
new file mode 100644
index 0000000..df60c45
--- /dev/null
+++ b/test/cctest/interpreter/interpreter-tester.cc
@@ -0,0 +1,73 @@
+// Copyright 2015 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "test/cctest/interpreter/interpreter-tester.h"
+
+namespace v8 {
+namespace internal {
+namespace interpreter {
+
+MaybeHandle<Object> CallInterpreter(Isolate* isolate,
+ Handle<JSFunction> function) {
+ return Execution::Call(isolate, function,
+ isolate->factory()->undefined_value(), 0, nullptr);
+}
+
+InterpreterTester::InterpreterTester(
+ Isolate* isolate, const char* source, MaybeHandle<BytecodeArray> bytecode,
+ MaybeHandle<TypeFeedbackVector> feedback_vector, const char* filter)
+ : isolate_(isolate),
+ source_(source),
+ bytecode_(bytecode),
+ feedback_vector_(feedback_vector) {
+ i::FLAG_ignition = true;
+ i::FLAG_always_opt = false;
+ // Ensure handler table is generated.
+ isolate->interpreter()->Initialize();
+}
+
+InterpreterTester::InterpreterTester(
+ Isolate* isolate, Handle<BytecodeArray> bytecode,
+ MaybeHandle<TypeFeedbackVector> feedback_vector, const char* filter)
+ : InterpreterTester(isolate, nullptr, bytecode, feedback_vector, filter) {}
+
+InterpreterTester::InterpreterTester(Isolate* isolate, const char* source,
+ const char* filter)
+ : InterpreterTester(isolate, source, MaybeHandle<BytecodeArray>(),
+ MaybeHandle<TypeFeedbackVector>(), filter) {}
+
+InterpreterTester::~InterpreterTester() {}
+
+Local<Message> InterpreterTester::CheckThrowsReturnMessage() {
+ TryCatch try_catch(reinterpret_cast<v8::Isolate*>(isolate_));
+ auto callable = GetCallable<>();
+ MaybeHandle<Object> no_result = callable();
+ CHECK(isolate_->has_pending_exception());
+ CHECK(try_catch.HasCaught());
+ CHECK(no_result.is_null());
+ isolate_->OptionalRescheduleException(true);
+ CHECK(!try_catch.Message().IsEmpty());
+ return try_catch.Message();
+}
+
+Handle<Object> InterpreterTester::NewObject(const char* script) {
+ return v8::Utils::OpenHandle(*CompileRun(script));
+}
+
+Handle<String> InterpreterTester::GetName(Isolate* isolate, const char* name) {
+ Handle<String> result = isolate->factory()->NewStringFromAsciiChecked(name);
+ return isolate->factory()->string_table()->LookupString(isolate, result);
+}
+
+std::string InterpreterTester::SourceForBody(const char* body) {
+ return "function " + function_name() + "() {\n" + std::string(body) + "\n}";
+}
+
+std::string InterpreterTester::function_name() {
+ return std::string(kFunctionName);
+}
+
+} // namespace interpreter
+} // namespace internal
+} // namespace v8
diff --git a/test/cctest/interpreter/interpreter-tester.h b/test/cctest/interpreter/interpreter-tester.h
new file mode 100644
index 0000000..f8a0a8a
--- /dev/null
+++ b/test/cctest/interpreter/interpreter-tester.h
@@ -0,0 +1,128 @@
+// Copyright 2015 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/v8.h"
+
+#include "src/execution.h"
+#include "src/handles.h"
+#include "src/interpreter/bytecode-array-builder.h"
+#include "src/interpreter/interpreter.h"
+#include "test/cctest/cctest.h"
+#include "test/cctest/test-feedback-vector.h"
+
+namespace v8 {
+namespace internal {
+namespace interpreter {
+
+MaybeHandle<Object> CallInterpreter(Isolate* isolate,
+ Handle<JSFunction> function);
+template <class... A>
+static MaybeHandle<Object> CallInterpreter(Isolate* isolate,
+ Handle<JSFunction> function,
+ A... args) {
+ Handle<Object> argv[] = {args...};
+ return Execution::Call(isolate, function,
+ isolate->factory()->undefined_value(), sizeof...(args),
+ argv);
+}
+
+template <class... A>
+class InterpreterCallable {
+ public:
+ InterpreterCallable(Isolate* isolate, Handle<JSFunction> function)
+ : isolate_(isolate), function_(function) {}
+ virtual ~InterpreterCallable() {}
+
+ MaybeHandle<Object> operator()(A... args) {
+ return CallInterpreter(isolate_, function_, args...);
+ }
+
+ private:
+ Isolate* isolate_;
+ Handle<JSFunction> function_;
+};
+
+namespace {
+const char kFunctionName[] = "f";
+} // namespace
+
+class InterpreterTester {
+ public:
+ InterpreterTester(Isolate* isolate, const char* source,
+ MaybeHandle<BytecodeArray> bytecode,
+ MaybeHandle<TypeFeedbackVector> feedback_vector,
+ const char* filter);
+
+ InterpreterTester(Isolate* isolate, Handle<BytecodeArray> bytecode,
+ MaybeHandle<TypeFeedbackVector> feedback_vector =
+ MaybeHandle<TypeFeedbackVector>(),
+ const char* filter = kFunctionName);
+
+ InterpreterTester(Isolate* isolate, const char* source,
+ const char* filter = kFunctionName);
+
+ virtual ~InterpreterTester();
+
+ template <class... A>
+ InterpreterCallable<A...> GetCallable() {
+ return InterpreterCallable<A...>(isolate_, GetBytecodeFunction<A...>());
+ }
+
+ Local<Message> CheckThrowsReturnMessage();
+
+ static Handle<Object> NewObject(const char* script);
+
+ static Handle<String> GetName(Isolate* isolate, const char* name);
+
+ static std::string SourceForBody(const char* body);
+
+ static std::string function_name();
+
+ private:
+ Isolate* isolate_;
+ const char* source_;
+ MaybeHandle<BytecodeArray> bytecode_;
+ MaybeHandle<TypeFeedbackVector> feedback_vector_;
+
+ template <class... A>
+ Handle<JSFunction> GetBytecodeFunction() {
+ Handle<JSFunction> function;
+ if (source_) {
+ CompileRun(source_);
+ v8::Local<v8::Context> context =
+ v8::Isolate::GetCurrent()->GetCurrentContext();
+ Local<Function> api_function =
+ Local<Function>::Cast(CcTest::global()
+ ->Get(context, v8_str(kFunctionName))
+ .ToLocalChecked());
+ function = Handle<JSFunction>::cast(v8::Utils::OpenHandle(*api_function));
+ } else {
+ int arg_count = sizeof...(A);
+ std::string source("(function " + function_name() + "(");
+ for (int i = 0; i < arg_count; i++) {
+ source += i == 0 ? "a" : ", a";
+ }
+ source += "){})";
+ function = Handle<JSFunction>::cast(v8::Utils::OpenHandle(
+ *v8::Local<v8::Function>::Cast(CompileRun(source.c_str()))));
+ function->ReplaceCode(
+ *isolate_->builtins()->InterpreterEntryTrampoline());
+ }
+
+ if (!bytecode_.is_null()) {
+ function->shared()->set_function_data(*bytecode_.ToHandleChecked());
+ }
+ if (!feedback_vector_.is_null()) {
+ function->shared()->set_feedback_vector(
+ *feedback_vector_.ToHandleChecked());
+ }
+ return function;
+ }
+
+ DISALLOW_COPY_AND_ASSIGN(InterpreterTester);
+};
+
+} // namespace interpreter
+} // namespace internal
+} // namespace v8
diff --git a/test/cctest/interpreter/test-bytecode-generator.cc b/test/cctest/interpreter/test-bytecode-generator.cc
index 73767eb..2519f25 100644
--- a/test/cctest/interpreter/test-bytecode-generator.cc
+++ b/test/cctest/interpreter/test-bytecode-generator.cc
@@ -2,6 +2,8 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
+#include <fstream>
+
#include "src/v8.h"
#include "src/compiler.h"
@@ -9,7936 +11,1893 @@
#include "src/interpreter/bytecode-generator.h"
#include "src/interpreter/interpreter.h"
#include "test/cctest/cctest.h"
+#include "test/cctest/interpreter/bytecode-expectations-printer.h"
#include "test/cctest/test-feedback-vector.h"
namespace v8 {
namespace internal {
namespace interpreter {
-static const InstanceType kInstanceTypeDontCare = static_cast<InstanceType>(-1);
+#define XSTR(A) #A
+#define STR(A) XSTR(A)
-class BytecodeGeneratorHelper {
+#define UNIQUE_VAR() "var a" STR(__COUNTER__) " = 0;\n"
+
+#define REPEAT_2(...) __VA_ARGS__ __VA_ARGS__
+#define REPEAT_4(...) REPEAT_2(__VA_ARGS__) REPEAT_2(__VA_ARGS__)
+#define REPEAT_8(...) REPEAT_4(__VA_ARGS__) REPEAT_4(__VA_ARGS__)
+#define REPEAT_16(...) REPEAT_8(__VA_ARGS__) REPEAT_8(__VA_ARGS__)
+#define REPEAT_32(...) REPEAT_16(__VA_ARGS__) REPEAT_16(__VA_ARGS__)
+#define REPEAT_64(...) REPEAT_32(__VA_ARGS__) REPEAT_32(__VA_ARGS__)
+#define REPEAT_128(...) REPEAT_64(__VA_ARGS__) REPEAT_64(__VA_ARGS__)
+#define REPEAT_256(...) REPEAT_128(__VA_ARGS__) REPEAT_128(__VA_ARGS__)
+
+#define REPEAT_127(...) \
+ REPEAT_64(__VA_ARGS__) \
+ REPEAT_32(__VA_ARGS__) \
+ REPEAT_16(__VA_ARGS__) \
+ REPEAT_8(__VA_ARGS__) \
+ REPEAT_4(__VA_ARGS__) \
+ REPEAT_2(__VA_ARGS__) \
+ __VA_ARGS__
+
+#define REPEAT_249(...) \
+ REPEAT_127(__VA_ARGS__) \
+ REPEAT_64(__VA_ARGS__) \
+ REPEAT_32(__VA_ARGS__) \
+ REPEAT_16(__VA_ARGS__) \
+ REPEAT_8(__VA_ARGS__) \
+ REPEAT_2(__VA_ARGS__)
+
+#define REPEAT_2_UNIQUE_VARS() UNIQUE_VAR() UNIQUE_VAR()
+#define REPEAT_4_UNIQUE_VARS() REPEAT_2_UNIQUE_VARS() REPEAT_2_UNIQUE_VARS()
+#define REPEAT_8_UNIQUE_VARS() REPEAT_4_UNIQUE_VARS() REPEAT_4_UNIQUE_VARS()
+#define REPEAT_16_UNIQUE_VARS() REPEAT_8_UNIQUE_VARS() REPEAT_8_UNIQUE_VARS()
+#define REPEAT_32_UNIQUE_VARS() REPEAT_16_UNIQUE_VARS() REPEAT_16_UNIQUE_VARS()
+#define REPEAT_64_UNIQUE_VARS() REPEAT_32_UNIQUE_VARS() REPEAT_32_UNIQUE_VARS()
+#define REPEAT_128_UNIQUE_VARS() REPEAT_64_UNIQUE_VARS() REPEAT_64_UNIQUE_VARS()
+
+#define REPEAT_249_UNIQUE_VARS() \
+ REPEAT_128_UNIQUE_VARS() \
+ REPEAT_64_UNIQUE_VARS() \
+ REPEAT_32_UNIQUE_VARS() \
+ REPEAT_16_UNIQUE_VARS() \
+ REPEAT_8_UNIQUE_VARS() \
+ UNIQUE_VAR()
+
+static const char* kGoldenFileDirectory =
+ "test/cctest/interpreter/bytecode_expectations/";
+
+class InitializedIgnitionHandleScope : public InitializedHandleScope {
public:
- const char* kFunctionName = "f";
-
- static const int kLastParamIndex =
- -InterpreterFrameConstants::kLastParamFromRegisterPointer / kPointerSize;
-
- BytecodeGeneratorHelper() {
+ InitializedIgnitionHandleScope() {
i::FLAG_ignition = true;
- i::FLAG_ignition_filter = StrDup(kFunctionName);
i::FLAG_always_opt = false;
i::FLAG_allow_natives_syntax = true;
CcTest::i_isolate()->interpreter()->Initialize();
}
-
- Isolate* isolate() { return CcTest::i_isolate(); }
- Factory* factory() { return CcTest::i_isolate()->factory(); }
-
- Handle<BytecodeArray> MakeTopLevelBytecode(const char* source) {
- const char* old_ignition_filter = i::FLAG_ignition_filter;
- i::FLAG_ignition_filter = "*";
- Local<v8::Script> script = v8_compile(source);
- i::FLAG_ignition_filter = old_ignition_filter;
- i::Handle<i::JSFunction> js_function = v8::Utils::OpenHandle(*script);
- return handle(js_function->shared()->bytecode_array(), CcTest::i_isolate());
- }
-
- Handle<BytecodeArray> MakeBytecode(const char* script,
- const char* function_name) {
- CompileRun(script);
- v8::Local<v8::Context> context =
- v8::Isolate::GetCurrent()->GetCurrentContext();
- Local<Function> function = Local<Function>::Cast(
- CcTest::global()->Get(context, v8_str(function_name)).ToLocalChecked());
- i::Handle<i::JSFunction> js_function =
- i::Handle<i::JSFunction>::cast(v8::Utils::OpenHandle(*function));
- return handle(js_function->shared()->bytecode_array(), CcTest::i_isolate());
- }
-
- Handle<BytecodeArray> MakeBytecode(const char* script, const char* filter,
- const char* function_name) {
- const char* old_ignition_filter = i::FLAG_ignition_filter;
- i::FLAG_ignition_filter = filter;
- Handle<BytecodeArray> return_val = MakeBytecode(script, function_name);
- i::FLAG_ignition_filter = old_ignition_filter;
- return return_val;
- }
-
- Handle<BytecodeArray> MakeBytecodeForFunctionBody(const char* body) {
- static const char kFormat[] = "function %s() { %s }\n%s();";
- static const int kFormatLength = arraysize(kFormat);
- int length = kFormatLength + 2 * StrLength(kFunctionName) + StrLength(body);
- ScopedVector<char> program(length);
- length = SNPrintF(program, kFormat, kFunctionName, body, kFunctionName);
- CHECK_GT(length, 0);
- return MakeBytecode(program.start(), kFunctionName);
- }
-
- Handle<BytecodeArray> MakeBytecodeForFunction(const char* function) {
- ScopedVector<char> program(3072);
- SNPrintF(program, "%s\n%s();", function, kFunctionName);
- return MakeBytecode(program.start(), kFunctionName);
- }
-
- Handle<BytecodeArray> MakeBytecodeForFunctionNoFilter(const char* function) {
- ScopedVector<char> program(3072);
- SNPrintF(program, "%s\n%s();", function, kFunctionName);
- return MakeBytecode(program.start(), "*", kFunctionName);
- }
};
-
-// Helper macros for handcrafting bytecode sequences.
-#define B(x) static_cast<uint8_t>(Bytecode::k##x)
-#define U8(x) static_cast<uint8_t>((x) & 0xff)
-#define R(x) static_cast<uint8_t>(-(x) & 0xff)
-#define R16(x) U16(-(x))
-#define A(x, n) R(helper.kLastParamIndex - (n) + 1 + (x))
-#define THIS(n) A(0, n)
-#if defined(V8_TARGET_LITTLE_ENDIAN)
-#define U16(x) static_cast<uint8_t>((x) & 0xff), \
- static_cast<uint8_t>(((x) >> kBitsPerByte) & 0xff)
-#define U16I(x) static_cast<uint8_t>((x) & 0xff), \
- static_cast<uint8_t>(((x++) >> kBitsPerByte) & 0xff)
-#elif defined(V8_TARGET_BIG_ENDIAN)
-#define U16(x) static_cast<uint8_t>(((x) >> kBitsPerByte) & 0xff), \
- static_cast<uint8_t>((x) & 0xff)
-#define U16I(x) static_cast<uint8_t>(((x) >> kBitsPerByte) & 0xff), \
- static_cast<uint8_t>((x++) & 0xff)
-#else
-#error Unknown byte ordering
-#endif
-
-#define XSTR(A) #A
-#define STR(A) XSTR(A)
-
-#define COMMA() ,
-#define SPACE()
-#define UNIQUE_VAR() "var a" STR(__COUNTER__) " = 0;\n"
-
-#define REPEAT_2(SEP, ...) \
- __VA_ARGS__ SEP() __VA_ARGS__
-#define REPEAT_4(SEP, ...) \
- REPEAT_2(SEP, __VA_ARGS__) SEP() REPEAT_2(SEP, __VA_ARGS__)
-#define REPEAT_8(SEP, ...) \
- REPEAT_4(SEP, __VA_ARGS__) SEP() REPEAT_4(SEP, __VA_ARGS__)
-#define REPEAT_16(SEP, ...) \
- REPEAT_8(SEP, __VA_ARGS__) SEP() REPEAT_8(SEP, __VA_ARGS__)
-#define REPEAT_32(SEP, ...) \
- REPEAT_16(SEP, __VA_ARGS__) SEP() REPEAT_16(SEP, __VA_ARGS__)
-#define REPEAT_64(SEP, ...) \
- REPEAT_32(SEP, __VA_ARGS__) SEP() REPEAT_32(SEP, __VA_ARGS__)
-#define REPEAT_128(SEP, ...) \
- REPEAT_64(SEP, __VA_ARGS__) SEP() REPEAT_64(SEP, __VA_ARGS__)
-#define REPEAT_256(SEP, ...) \
- REPEAT_128(SEP, __VA_ARGS__) SEP() REPEAT_128(SEP, __VA_ARGS__)
-
-#define REPEAT_127(SEP, ...) \
- REPEAT_64(SEP, __VA_ARGS__) SEP() REPEAT_32(SEP, __VA_ARGS__) SEP() \
- REPEAT_16(SEP, __VA_ARGS__) SEP() REPEAT_8(SEP, __VA_ARGS__) SEP() \
- REPEAT_4(SEP, __VA_ARGS__) SEP() REPEAT_2(SEP, __VA_ARGS__) SEP() \
- __VA_ARGS__
-
-#define REPEAT_249(SEP, ...) \
- REPEAT_127(SEP, __VA_ARGS__) SEP() REPEAT_64(SEP, __VA_ARGS__) SEP() \
- REPEAT_32(SEP, __VA_ARGS__) SEP() REPEAT_16(SEP, __VA_ARGS__) SEP() \
- REPEAT_8(SEP, __VA_ARGS__) SEP() REPEAT_2(SEP, __VA_ARGS__)
-
-#define REPEAT_249_UNIQUE_VARS() \
-UNIQUE_VAR() REPEAT_127(UNIQUE_VAR) UNIQUE_VAR() REPEAT_64(UNIQUE_VAR) \
-UNIQUE_VAR() REPEAT_32(UNIQUE_VAR) UNIQUE_VAR() REPEAT_16(UNIQUE_VAR) \
-UNIQUE_VAR() REPEAT_8(UNIQUE_VAR) UNIQUE_VAR() REPEAT_2(UNIQUE_VAR)
-
-// Structure for containing expected bytecode snippets.
-template<typename T, int C = 6>
-struct ExpectedSnippet {
- const char* code_snippet;
- int frame_size;
- int parameter_count;
- int bytecode_length;
- const uint8_t bytecode[2048];
- int constant_count;
- T constants[C];
- int handler_count;
- struct {
- int start;
- int end;
- int handler;
- } handlers[C];
-};
-
-
-static void CheckConstant(int expected, Object* actual) {
- CHECK_EQ(expected, Smi::cast(actual)->value());
-}
-
-
-static void CheckConstant(double expected, Object* actual) {
- CHECK_EQ(expected, HeapNumber::cast(actual)->value());
-}
-
-
-static void CheckConstant(const char* expected, Object* actual) {
- Handle<String> expected_string =
- CcTest::i_isolate()->factory()->NewStringFromAsciiChecked(expected);
- CHECK(String::cast(actual)->Equals(*expected_string));
-}
-
-
-static void CheckConstant(Handle<Object> expected, Object* actual) {
- CHECK(actual == *expected || expected->StrictEquals(actual));
-}
-
-
-static void CheckConstant(InstanceType expected, Object* actual) {
- if (expected != kInstanceTypeDontCare) {
- CHECK_EQ(expected, HeapObject::cast(actual)->map()->instance_type());
+void SkipGoldenFileHeader(std::istream& stream) { // NOLINT
+ std::string line;
+ int separators_seen = 0;
+ while (std::getline(stream, line)) {
+ if (line == "---") separators_seen += 1;
+ if (separators_seen == 2) return;
}
}
-
-template <typename T, int C>
-static void CheckBytecodeArrayEqual(const ExpectedSnippet<T, C>& expected,
- Handle<BytecodeArray> actual) {
- CHECK_EQ(expected.frame_size, actual->frame_size());
- CHECK_EQ(expected.parameter_count, actual->parameter_count());
- CHECK_EQ(expected.bytecode_length, actual->length());
- if (expected.constant_count == 0) {
- CHECK_EQ(CcTest::heap()->empty_fixed_array(), actual->constant_pool());
- } else {
- CHECK_EQ(expected.constant_count, actual->constant_pool()->length());
- for (int i = 0; i < expected.constant_count; i++) {
- CheckConstant(expected.constants[i], actual->constant_pool()->get(i));
- }
- }
- if (expected.handler_count == 0) {
- CHECK_EQ(CcTest::heap()->empty_fixed_array(), actual->handler_table());
- } else {
- HandlerTable* table = HandlerTable::cast(actual->handler_table());
- CHECK_EQ(expected.handler_count, table->NumberOfRangeEntries());
- for (int i = 0; i < expected.handler_count; i++) {
- CHECK_EQ(expected.handlers[i].start, table->GetRangeStart(i));
- CHECK_EQ(expected.handlers[i].end, table->GetRangeEnd(i));
- CHECK_EQ(expected.handlers[i].handler, table->GetRangeHandler(i));
- }
- }
-
- BytecodeArrayIterator iterator(actual);
- int i = 0;
- while (!iterator.done()) {
- int bytecode_index = i++;
- Bytecode bytecode = iterator.current_bytecode();
- if (Bytecodes::ToByte(bytecode) != expected.bytecode[bytecode_index]) {
- std::ostringstream stream;
- stream << "Check failed: expected bytecode [" << bytecode_index
- << "] to be " << Bytecodes::ToString(static_cast<Bytecode>(
- expected.bytecode[bytecode_index]))
- << " but got " << Bytecodes::ToString(bytecode);
- FATAL(stream.str().c_str());
- }
- for (int j = 0; j < Bytecodes::NumberOfOperands(bytecode); ++j) {
- OperandType operand_type = Bytecodes::GetOperandType(bytecode, j);
- int operand_index = i;
- i += static_cast<int>(Bytecodes::SizeOfOperand(operand_type));
- uint32_t raw_operand = iterator.GetRawOperand(j, operand_type);
- uint32_t expected_operand;
- switch (Bytecodes::SizeOfOperand(operand_type)) {
- case OperandSize::kNone:
- UNREACHABLE();
- return;
- case OperandSize::kByte:
- expected_operand =
- static_cast<uint32_t>(expected.bytecode[operand_index]);
- break;
- case OperandSize::kShort:
- expected_operand =
- ReadUnalignedUInt16(&expected.bytecode[operand_index]);
- break;
- default:
- UNREACHABLE();
- return;
- }
- if (raw_operand != expected_operand) {
- std::ostringstream stream;
- stream << "Check failed: expected operand [" << j << "] for bytecode ["
- << bytecode_index << "] to be "
- << static_cast<unsigned int>(expected_operand) << " but got "
- << static_cast<unsigned int>(raw_operand);
- FATAL(stream.str().c_str());
- }
- }
- iterator.Advance();
- }
+std::string LoadGolden(const std::string& golden_filename) {
+ std::ifstream expected_file((kGoldenFileDirectory + golden_filename).c_str());
+ CHECK(expected_file.is_open());
+ SkipGoldenFileHeader(expected_file);
+ std::ostringstream expected_stream;
+ // Restore the first separator, which was consumed by SkipGoldenFileHeader
+ expected_stream << "---\n" << expected_file.rdbuf();
+ return expected_stream.str();
}
+template <size_t N>
+std::string BuildActual(const BytecodeExpectationsPrinter& printer,
+ const char* (&snippet_list)[N],
+ const char* prologue = nullptr,
+ const char* epilogue = nullptr) {
+ std::ostringstream actual_stream;
+ for (const char* snippet : snippet_list) {
+ std::string source_code;
+ if (prologue) source_code += prologue;
+ source_code += snippet;
+ if (epilogue) source_code += epilogue;
+ printer.PrintExpectation(actual_stream, source_code);
+ }
+ return actual_stream.str();
+}
+
+using ConstantPoolType = BytecodeExpectationsPrinter::ConstantPoolType;
TEST(PrimitiveReturnStatements) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kNumber);
+ const char* snippets[] = {
+ "",
- // clang-format off
- ExpectedSnippet<int> snippets[] = {
- {"",
- 0,
- 1,
- 3,
- {
- B(StackCheck), //
- B(LdaUndefined), //
- B(Return) //
- },
- 0},
- {"return;",
- 0,
- 1,
- 3,
- {
- B(StackCheck), //
- B(LdaUndefined), //
- B(Return) //
- },
- 0},
- {"return null;",
- 0,
- 1,
- 3,
- {
- B(StackCheck), //
- B(LdaNull), //
- B(Return) //
- },
- 0},
- {"return true;",
- 0,
- 1,
- 3,
- {
- B(StackCheck), //
- B(LdaTrue), //
- B(Return) //
- },
- 0},
- {"return false;",
- 0,
- 1,
- 3,
- {
- B(StackCheck), //
- B(LdaFalse), //
- B(Return) //
- },
- 0},
- {"return 0;",
- 0,
- 1,
- 3,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Return) //
- },
- 0},
- {"return +1;",
- 0,
- 1,
- 4,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Return) //
- },
- 0},
- {"return -1;",
- 0,
- 1,
- 4,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(-1), //
- B(Return) //
- },
- 0},
- {"return +127;",
- 0,
- 1,
- 4,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(127), //
- B(Return) //
- },
- 0},
- {"return -128;",
- 0,
- 1,
- 4,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(-128), //
- B(Return) //
- },
- 0},
+ "return;",
+
+ "return null;",
+
+ "return true;",
+
+ "return false;",
+
+ "return 0;",
+
+ "return +1;",
+
+ "return -1;",
+
+ "return +127;",
+
+ "return -128;",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("PrimitiveReturnStatements.golden"));
}
-
TEST(PrimitiveExpressions) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kNumber);
+ const char* snippets[] = {
+ "var x = 0; return x;",
- // clang-format off
- ExpectedSnippet<int> snippets[] = {
- {"var x = 0; return x;",
- kPointerSize,
- 1,
- 5,
- {B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(Return)},
- 0},
- {"var x = 0; return x + 3;",
- 2 * kPointerSize,
- 1,
- 11,
- {B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(3), //
- B(Add), R(1), //
- B(Return)},
- 0},
- {"var x = 0; return x - 3;",
- 2 * kPointerSize,
- 1,
- 11,
- {B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(3), //
- B(Sub), R(1), //
- B(Return)},
- 0},
- {"var x = 4; return x * 3;",
- 2 * kPointerSize,
- 1,
- 12,
- {B(StackCheck), //
- B(LdaSmi8), U8(4), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(3), //
- B(Mul), R(1), //
- B(Return)},
- 0},
- {"var x = 4; return x / 3;",
- 2 * kPointerSize,
- 1,
- 12,
- {B(StackCheck), //
- B(LdaSmi8), U8(4), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(3), //
- B(Div), R(1), //
- B(Return)},
- 0},
- {"var x = 4; return x % 3;",
- 2 * kPointerSize,
- 1,
- 12,
- {B(StackCheck), //
- B(LdaSmi8), U8(4), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(3), //
- B(Mod), R(1), //
- B(Return)},
- 0},
- {"var x = 1; return x | 2;",
- 2 * kPointerSize,
- 1,
- 12,
- {B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(2), //
- B(BitwiseOr), R(1), //
- B(Return)},
- 0},
- {"var x = 1; return x ^ 2;",
- 2 * kPointerSize,
- 1,
- 12,
- {B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(2), //
- B(BitwiseXor), R(1), //
- B(Return)},
- 0},
- {"var x = 1; return x & 2;",
- 2 * kPointerSize,
- 1,
- 12,
- {B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(2), //
- B(BitwiseAnd), R(1), //
- B(Return)},
- 0},
- {"var x = 10; return x << 3;",
- 2 * kPointerSize,
- 1,
- 12,
- {B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(3), //
- B(ShiftLeft), R(1), //
- B(Return)},
- 0},
- {"var x = 10; return x >> 3;",
- 2 * kPointerSize,
- 1,
- 12,
- {B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(3), //
- B(ShiftRight), R(1), //
- B(Return)},
- 0},
- {"var x = 10; return x >>> 3;",
- 2 * kPointerSize,
- 1,
- 12,
- {B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(3), //
- B(ShiftRightLogical), R(1), //
- B(Return)},
- 0},
- {"var x = 0; return (x, 3);",
- 1 * kPointerSize,
- 1,
- 7,
- {B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(LdaSmi8), U8(3), //
- B(Return)},
- 0},
+ "var x = 0; return x + 3;",
+
+ "var x = 0; return x - 3;",
+
+ "var x = 4; return x * 3;",
+
+ "var x = 4; return x / 3;",
+
+ "var x = 4; return x % 3;",
+
+ "var x = 1; return x | 2;",
+
+ "var x = 1; return x ^ 2;",
+
+ "var x = 1; return x & 2;",
+
+ "var x = 10; return x << 3;",
+
+ "var x = 10; return x >> 3;",
+
+ "var x = 10; return x >>> 3;",
+
+ "var x = 0; return (x, 3);",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("PrimitiveExpressions.golden"));
}
-
TEST(LogicalExpressions) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kNumber);
+ const char* snippets[] = {
+ "var x = 0; return x || 3;",
- // clang-format off
- ExpectedSnippet<int> snippets[] = {
- {"var x = 0; return x || 3;",
- 1 * kPointerSize,
- 1,
- 9,
- {B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(JumpIfToBooleanTrue), U8(4), //
- B(LdaSmi8), U8(3), //
- B(Return)},
- 0},
- {"var x = 0; return (x == 1) || 3;",
- 2 * kPointerSize,
- 1,
- 15,
- {B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(1), //
- B(TestEqual), R(1), //
- B(JumpIfTrue), U8(4), //
- B(LdaSmi8), U8(3), //
- B(Return)},
- 0},
- {"var x = 0; return x && 3;",
- 1 * kPointerSize,
- 1,
- 9,
- {B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(JumpIfToBooleanFalse), U8(4), //
- B(LdaSmi8), U8(3), //
- B(Return)},
- 0},
- {"var x = 0; return (x == 0) && 3;",
- 2 * kPointerSize,
- 1,
- 14,
- {B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaZero), //
- B(TestEqual), R(1), //
- B(JumpIfFalse), U8(4), //
- B(LdaSmi8), U8(3), //
- B(Return)},
- 0},
- {"var x = 0; return x || (1, 2, 3);",
- 1 * kPointerSize,
- 1,
- 9,
- {B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(JumpIfToBooleanTrue), U8(4), //
- B(LdaSmi8), U8(3), //
- B(Return)},
- 0},
- {"var a = 2, b = 3, c = 4; return a || (a, b, a, b, c = 5, 3);",
- 3 * kPointerSize,
- 1,
- 32,
- {B(StackCheck), //
- B(LdaSmi8), U8(2), //
- B(Star), R(0), //
- B(LdaSmi8), U8(3), //
- B(Star), R(1), //
- B(LdaSmi8), U8(4), //
- B(Star), R(2), //
- B(Ldar), R(0), //
- B(JumpIfToBooleanTrue), U8(16), //
- B(Ldar), R(0), //
- B(Ldar), R(1), //
- B(Ldar), R(0), //
- B(Ldar), R(1), //
- B(LdaSmi8), U8(5), //
- B(Star), R(2), //
- B(LdaSmi8), U8(3), //
- B(Return)},
- 0},
- {"var x = 1; var a = 2, b = 3; return x || ("
- REPEAT_32(SPACE, "a = 1, b = 2, ")
- "3);",
- 3 * kPointerSize,
- 1,
- 276,
- {B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(LdaSmi8), U8(2), //
- B(Star), R(1), //
- B(LdaSmi8), U8(3), //
- B(Star), R(2), //
- B(Ldar), R(0), //
- B(JumpIfToBooleanTrueConstant), U8(0), //
- REPEAT_32(COMMA, //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), //
- B(LdaSmi8), U8(2), //
- B(Star), R(2)), //
- B(LdaSmi8), U8(3), //
- B(Return)},
- 1,
- {260, 0, 0, 0}},
- {"var x = 0; var a = 2, b = 3; return x && ("
- REPEAT_32(SPACE, "a = 1, b = 2, ")
- "3);",
- 3 * kPointerSize,
- 1,
- 275,
- {B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(LdaSmi8), U8(2), //
- B(Star), R(1), //
- B(LdaSmi8), U8(3), //
- B(Star), R(2), //
- B(Ldar), R(0), //
- B(JumpIfToBooleanFalseConstant), U8(0), //
- REPEAT_32(COMMA, //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), //
- B(LdaSmi8), U8(2), //
- B(Star), R(2)), //
- B(LdaSmi8), U8(3), //
- B(Return)}, //
- 1,
- {260, 0, 0, 0}},
- {"var x = 1; var a = 2, b = 3; return (x > 3) || ("
- REPEAT_32(SPACE, "a = 1, b = 2, ")
- "3);",
- 4 * kPointerSize,
- 1,
- 282,
- {B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(LdaSmi8), U8(2), //
- B(Star), R(1), //
- B(LdaSmi8), U8(3), //
- B(Star), R(2), //
- B(Ldar), R(0), //
- B(Star), R(3), //
- B(LdaSmi8), U8(3), //
- B(TestGreaterThan), R(3), //
- B(JumpIfTrueConstant), U8(0), //
- REPEAT_32(COMMA, //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), //
- B(LdaSmi8), U8(2), //
- B(Star), R(2)), //
- B(LdaSmi8), U8(3), //
- B(Return)},
- 1,
- {260, 0, 0, 0}},
- {"var x = 0; var a = 2, b = 3; return (x < 5) && ("
- REPEAT_32(SPACE, "a = 1, b = 2, ")
- "3);",
- 4 * kPointerSize,
- 1,
- 281,
- {B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(LdaSmi8), U8(2), //
- B(Star), R(1), //
- B(LdaSmi8), U8(3), //
- B(Star), R(2), //
- B(Ldar), R(0), //
- B(Star), R(3), //
- B(LdaSmi8), U8(5), //
- B(TestLessThan), R(3), //
- B(JumpIfFalseConstant), U8(0), //
- REPEAT_32(COMMA, //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), //
- B(LdaSmi8), U8(2), //
- B(Star), R(2)), //
- B(LdaSmi8), U8(3), //
- B(Return)},
- 1,
- {260, 0, 0, 0}},
- {"return 0 && 3;",
- 0 * kPointerSize,
- 1,
- 3,
- {B(StackCheck), //
- B(LdaZero), //
- B(Return)},
- 0},
- {"return 1 || 3;",
- 0 * kPointerSize,
- 1,
- 4,
- {B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Return)},
- 0},
- {"var x = 1; return x && 3 || 0, 1;",
- 1 * kPointerSize,
- 1,
- 15,
- {B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(JumpIfToBooleanFalse), U8(4), //
- B(LdaSmi8), U8(3), //
- B(JumpIfToBooleanTrue), U8(3), //
- B(LdaZero), //
- B(LdaSmi8), U8(1), //
- B(Return)},
- 0}
+ "var x = 0; return (x == 1) || 3;",
+
+ "var x = 0; return x && 3;",
+
+ "var x = 0; return (x == 0) && 3;",
+
+ "var x = 0; return x || (1, 2, 3);",
+
+ "var a = 2, b = 3, c = 4; return a || (a, b, a, b, c = 5, 3);",
+
+ "var x = 1; var a = 2, b = 3; return x || (" //
+ REPEAT_32("\n a = 1, b = 2, ") //
+ "3);",
+
+ "var x = 0; var a = 2, b = 3; return x && (" //
+ REPEAT_32("\n a = 1, b = 2, ") //
+ "3);",
+
+ "var x = 1; var a = 2, b = 3; return (x > 3) || (" //
+ REPEAT_32("\n a = 1, b = 2, ") //
+ "3);",
+
+ "var x = 0; var a = 2, b = 3; return (x < 5) && (" //
+ REPEAT_32("\n a = 1, b = 2, ") //
+ "3);",
+
+ "return 0 && 3;",
+
+ "return 1 || 3;",
+
+ "var x = 1; return x && 3 || 0, 1;",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("LogicalExpressions.golden"));
}
-
TEST(Parameters) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kNumber);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
- // clang-format off
- ExpectedSnippet<int> snippets[] = {
- {"function f() { return this; }",
- 0,
- 1,
- 4,
- {B(StackCheck), //
- B(Ldar), THIS(1), //
- B(Return)},
- 0},
- {"function f(arg1) { return arg1; }",
- 0,
- 2,
- 4,
- {B(StackCheck), //
- B(Ldar), A(1, 2), //
- B(Return)},
- 0},
- {"function f(arg1) { return this; }",
- 0,
- 2,
- 4,
- {B(StackCheck), //
- B(Ldar), THIS(2), //
- B(Return)},
- 0},
- {"function f(arg1, arg2, arg3, arg4, arg5, arg6, arg7) { return arg4; }",
- 0,
- 8,
- 4,
- {B(StackCheck), //
- B(Ldar), A(4, 8), //
- B(Return)},
- 0},
- {"function f(arg1, arg2, arg3, arg4, arg5, arg6, arg7) { return this; }",
- 0,
- 8,
- 4,
- {B(StackCheck), //
- B(Ldar), THIS(8), //
- B(Return)},
- 0},
- {"function f(arg1) { arg1 = 1; }",
- 0,
- 2,
- 7,
- {B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), A(1, 2), //
- B(LdaUndefined), //
- B(Return)},
- 0},
- {"function f(arg1, arg2, arg3, arg4) { arg2 = 1; }",
- 0,
- 5,
- 7,
- {B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), A(2, 5), //
- B(LdaUndefined), //
- B(Return)},
- 0},
+ const char* snippets[] = {
+ "function f() { return this; }",
+
+ "function f(arg1) { return arg1; }",
+
+ "function f(arg1) { return this; }",
+
+ "function f(arg1, arg2, arg3, arg4, arg5, arg6, arg7) { return arg4; }",
+
+ "function f(arg1, arg2, arg3, arg4, arg5, arg6, arg7) { return this; }",
+
+ "function f(arg1) { arg1 = 1; }",
+
+ "function f(arg1, arg2, arg3, arg4) { arg2 = 1; }",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunction(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets, "", "\nf();"),
+ LoadGolden("Parameters.golden"));
}
-
TEST(IntegerConstants) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kNumber);
+ const char* snippets[] = {
+ "return 12345678;",
- // clang-format off
- ExpectedSnippet<int> snippets[] = {
- {"return 12345678;",
- 0,
- 1,
- 4,
- {
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Return) //
- },
- 1,
- {12345678}},
- {"var a = 1234; return 5678;",
- 1 * kPointerSize,
- 1,
- 8,
- {
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Star), R(0), //
- B(LdaConstant), U8(1), //
- B(Return) //
- },
- 2,
- {1234, 5678}},
- {"var a = 1234; return 1234;",
- 1 * kPointerSize,
- 1,
- 8,
- {
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Star), R(0), //
- B(LdaConstant), U8(0), //
- B(Return) //
- },
- 1,
- {1234}}
+ "var a = 1234; return 5678;",
+
+ "var a = 1234; return 1234;",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("IntegerConstants.golden"));
}
-
TEST(HeapNumberConstants) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kNumber);
+ const char* snippets[] = {
+ "return 1.2;",
- int wide_idx = 0;
+ "var a = 1.2; return 2.6;",
- // clang-format off
- ExpectedSnippet<double, 257> snippets[] = {
- {"return 1.2;",
- 0,
- 1,
- 4,
- {
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Return) //
- },
- 1,
- {1.2}},
- {"var a = 1.2; return 2.6;",
- 1 * kPointerSize,
- 1,
- 8,
- {
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Star), R(0), //
- B(LdaConstant), U8(1), //
- B(Return) //
- },
- 2,
- {1.2, 2.6}},
- {"var a = 3.14; return 3.14;",
- 1 * kPointerSize,
- 1,
- 8,
- {
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Star), R(0), //
- B(LdaConstant), U8(1), //
- B(Return) //
- },
- 2,
- {3.14, 3.14}},
- {"var a;"
- REPEAT_256(SPACE, " a = 1.414;")
- " a = 3.14;",
- 1 * kPointerSize,
- 1,
- 1032,
- {
- B(StackCheck), //
- REPEAT_256(COMMA, //
- B(LdaConstant), U8(wide_idx++), //
- B(Star), R(0)), //
- B(LdaConstantWide), U16(wide_idx), //
- B(Star), R(0), //
- B(LdaUndefined), //
- B(Return), //
- },
- 257,
- {REPEAT_256(COMMA, 1.414),
- 3.14}}
+ "var a = 3.14; return 3.14;",
+
+ "var a;" //
+ REPEAT_256("\na = 1.414;") //
+ " a = 3.14;",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("HeapNumberConstants.golden"));
}
-
TEST(StringConstants) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
+ const char* snippets[] = {
+ "return \"This is a string\";",
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"return \"This is a string\";",
- 0,
- 1,
- 4,
- {
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Return) //
- },
- 1,
- {"This is a string"}},
- {"var a = \"First string\"; return \"Second string\";",
- 1 * kPointerSize,
- 1,
- 8,
- {
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Star), R(0), //
- B(LdaConstant), U8(1), //
- B(Return) //
- },
- 2,
- {"First string", "Second string"}},
- {"var a = \"Same string\"; return \"Same string\";",
- 1 * kPointerSize,
- 1,
- 8,
- {
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Star), R(0), //
- B(LdaConstant), U8(0), //
- B(Return) //
- },
- 1,
- {"Same string"}}
+ "var a = \"First string\"; return \"Second string\";",
+
+ "var a = \"Same string\"; return \"Same string\";",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("StringConstants.golden"));
}
-
TEST(PropertyLoads) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
- FeedbackVectorSpec feedback_spec(&zone);
- FeedbackVectorSlot slot1 = feedback_spec.AddLoadICSlot();
- FeedbackVectorSlot slot2 = feedback_spec.AddLoadICSlot();
+ const char* snippets[] = {
+ "function f(a) { return a.name; }\n"
+ "f({name : \"test\"});",
- Handle<i::TypeFeedbackVector> vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec);
+ "function f(a) { return a[\"key\"]; }\n"
+ "f({key : \"test\"});",
- // These are a hack used by the LoadICXXXWide tests below.
- int wide_idx_1 = vector->GetIndex(slot1) - 2;
- int wide_idx_2 = vector->GetIndex(slot1) - 2;
+ "function f(a) { return a[100]; }\n"
+ "f({100 : \"test\"});",
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"function f(a) { return a.name; }\nf({name : \"test\"})",
- 1 * kPointerSize,
- 2,
- 10,
- {
- B(StackCheck), //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(LoadIC), R(0), U8(0), U8(vector->GetIndex(slot1)), //
- B(Return), //
- },
- 1,
- {"name"}},
- {"function f(a) { return a[\"key\"]; }\nf({key : \"test\"})",
- 1 * kPointerSize,
- 2,
- 10,
- {
- B(StackCheck), //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(LoadIC), R(0), U8(0), U8(vector->GetIndex(slot1)), //
- B(Return) //
- },
- 1,
- {"key"}},
- {"function f(a) { return a[100]; }\nf({100 : \"test\"})",
- 1 * kPointerSize,
- 2,
- 11,
- {
- B(StackCheck), //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(LdaSmi8), U8(100), //
- B(KeyedLoadIC), R(0), U8(vector->GetIndex(slot1)), //
- B(Return) //
- },
- 0},
- {"function f(a, b) { return a[b]; }\nf({arg : \"test\"}, \"arg\")",
- 1 * kPointerSize,
- 3,
- 11,
- {
- B(StackCheck), //
- B(Ldar), A(1, 3), //
- B(Star), R(0), //
- B(Ldar), A(1, 2), //
- B(KeyedLoadIC), R(0), U8(vector->GetIndex(slot1)), //
- B(Return) //
- },
- 0},
- {"function f(a) { var b = a.name; return a[-124]; }\n"
- "f({\"-124\" : \"test\", name : 123 })",
- 2 * kPointerSize,
- 2,
- 21,
- {
- B(StackCheck), //
- B(Ldar), A(1, 2), //
- B(Star), R(1), //
- B(LoadIC), R(1), U8(0), U8(vector->GetIndex(slot1)), //
- B(Star), R(0), //
- B(Ldar), A(1, 2), //
- B(Star), R(1), //
- B(LdaSmi8), U8(-124), //
- B(KeyedLoadIC), R(1), U8(vector->GetIndex(slot2)), //
- B(Return), //
- },
- 1,
- {"name"}},
- {"function f(a) {\n"
- " var b;\n"
- "b = a.name;"
- REPEAT_127(SPACE, " b = a.name; ")
- " return a.name; }\n"
- "f({name : \"test\"})\n",
- 2 * kPointerSize,
- 2,
- 1292,
- {
- B(StackCheck), //
- B(Ldar), A(1, 2), //
- B(Star), R(1), //
- B(LoadIC), R(1), U8(0), U8(wide_idx_1 += 2), //
- B(Star), R(0), //
- REPEAT_127(COMMA, //
- B(Ldar), A(1, 2), //
- B(Star), R(1), //
- B(LoadIC), R(1), U8(0), //
- U8((wide_idx_1 += 2)), //
- B(Star), R(0)), //
- B(Ldar), A(1, 2), //
- B(Star), R(1), //
- B(LoadICWide), R(1), U16(0), U16(wide_idx_1 + 2), //
- B(Return), //
- },
- 1,
- {"name"}},
- {"function f(a, b) {\n"
- " var c;\n"
- " c = a[b];"
- REPEAT_127(SPACE, " c = a[b]; ")
- " return a[b]; }\n"
- "f({name : \"test\"}, \"name\")\n",
- 2 * kPointerSize,
- 3,
- 1420,
- {
- B(StackCheck), //
- B(Ldar), A(1, 3), //
- B(Star), R(1), //
- B(Ldar), A(2, 3), //
- B(KeyedLoadIC), R(1), U8((wide_idx_2 += 2)), //
- B(Star), R(0), //
- REPEAT_127(COMMA, //
- B(Ldar), A(1, 3), //
- B(Star), R(1), //
- B(Ldar), A(2, 3), //
- B(KeyedLoadIC), R(1), U8((wide_idx_2 += 2)), //
- B(Star), R(0)), //
- B(Ldar), A(1, 3), //
- B(Star), R(1), //
- B(Ldar), A(2, 3), //
- B(KeyedLoadICWide), R(1), U16(wide_idx_2 + 2), //
- B(Return), //
- }},
+ "function f(a, b) { return a[b]; }\n"
+ "f({arg : \"test\"}, \"arg\");",
+
+ "function f(a) { var b = a.name; return a[-124]; }\n"
+ "f({\"-124\" : \"test\", name : 123 })",
+
+ "function f(a) {\n"
+ " var b;\n"
+ " b = a.name;\n"
+ REPEAT_127(" b = a.name;\n")
+ " return a.name;\n"
+ "}\n"
+ "f({name : \"test\"})\n",
+
+ "function f(a, b) {\n"
+ " var c;\n"
+ " c = a[b];\n"
+ REPEAT_127(" c = a[b];\n")
+ " return a[b];\n"
+ "}\n"
+ "f({name : \"test\"}, \"name\")\n",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecode(snippets[i].code_snippet, helper.kFunctionName);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("PropertyLoads.golden"));
}
-
TEST(PropertyStores) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
- FeedbackVectorSpec feedback_spec(&zone);
- FeedbackVectorSlot slot1 = feedback_spec.AddStoreICSlot();
- FeedbackVectorSlot slot2 = feedback_spec.AddStoreICSlot();
+ const char* snippets[] = {
+ "function f(a) { a.name = \"val\"; }\n"
+ "f({name : \"test\"})",
- Handle<i::TypeFeedbackVector> vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec);
+ "function f(a) { a[\"key\"] = \"val\"; }\n"
+ "f({key : \"test\"})",
- // These are a hack used by the StoreICXXXWide tests below.
- int wide_idx_1 = vector->GetIndex(slot1) - 2;
- int wide_idx_2 = vector->GetIndex(slot1) - 2;
- int wide_idx_3 = vector->GetIndex(slot1) - 2;
- int wide_idx_4 = vector->GetIndex(slot1) - 2;
+ "function f(a) { a[100] = \"val\"; }\n"
+ "f({100 : \"test\"})",
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"function f(a) { a.name = \"val\"; }\nf({name : \"test\"})",
- kPointerSize,
- 2,
- 13,
- {
- B(StackCheck), //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(LdaConstant), U8(0), //
- B(StoreICSloppy), R(0), U8(1), U8(vector->GetIndex(slot1)), //
- B(LdaUndefined), //
- B(Return), //
- },
- 2,
- {"val", "name"}},
- {"function f(a) { a[\"key\"] = \"val\"; }\nf({key : \"test\"})",
- kPointerSize,
- 2,
- 13,
- {
- B(StackCheck), //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(LdaConstant), U8(0), //
- B(StoreICSloppy), R(0), U8(1), U8(vector->GetIndex(slot1)), //
- B(LdaUndefined), //
- B(Return), //
- },
- 2,
- {"val", "key"}},
- {"function f(a) { a[100] = \"val\"; }\nf({100 : \"test\"})",
- 2 * kPointerSize,
- 2,
- 17,
- {
- B(StackCheck), //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(LdaSmi8), U8(100), //
- B(Star), R(1), //
- B(LdaConstant), U8(0), //
- B(KeyedStoreICSloppy), R(0), R(1), //
- U8(vector->GetIndex(slot1)), //
- B(LdaUndefined), //
- B(Return), //
- },
- 1,
- {"val"}},
- {"function f(a, b) { a[b] = \"val\"; }\nf({arg : \"test\"}, \"arg\")",
- 2 * kPointerSize,
- 3,
- 17,
- {
- B(StackCheck), //
- B(Ldar), A(1, 3), //
- B(Star), R(0), //
- B(Ldar), A(2, 3), //
- B(Star), R(1), //
- B(LdaConstant), U8(0), //
- B(KeyedStoreICSloppy), R(0), R(1), //
- U8(vector->GetIndex(slot1)), //
- B(LdaUndefined), //
- B(Return), //
- },
- 1,
- {"val"}},
- {"function f(a) { a.name = a[-124]; }\n"
- "f({\"-124\" : \"test\", name : 123 })",
- 2 * kPointerSize,
- 2,
- 20,
- {
- B(StackCheck), //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(Ldar), A(1, 2), //
- B(Star), R(1), //
- B(LdaSmi8), U8(-124), //
- B(KeyedLoadIC), R(1), U8(vector->GetIndex(slot1)), //
- B(StoreICSloppy), R(0), U8(0), U8(vector->GetIndex(slot2)), //
- B(LdaUndefined), //
- B(Return), //
- },
- 1,
- {"name"}},
- {"function f(a) { \"use strict\"; a.name = \"val\"; }\n"
- "f({name : \"test\"})",
- kPointerSize,
- 2,
- 13,
- {
- B(StackCheck), //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(LdaConstant), U8(0), //
- B(StoreICStrict), R(0), U8(1), U8(vector->GetIndex(slot1)), //
- B(LdaUndefined), //
- B(Return), //
- },
- 2,
- {"val", "name"}},
- {"function f(a, b) { \"use strict\"; a[b] = \"val\"; }\n"
- "f({arg : \"test\"}, \"arg\")",
- 2 * kPointerSize,
- 3,
- 17,
- {
- B(StackCheck), //
- B(Ldar), A(1, 3), //
- B(Star), R(0), //
- B(Ldar), A(2, 3), //
- B(Star), R(1), //
- B(LdaConstant), U8(0), //
- B(KeyedStoreICStrict), R(0), R(1), U8(vector->GetIndex(slot1)), //
- B(LdaUndefined), //
- B(Return), //
- },
- 1,
- {"val"}},
- {"function f(a) {\n"
- "a.name = 1;"
- REPEAT_127(SPACE, " a.name = 1; ")
- " a.name = 2; }\n"
- "f({name : \"test\"})\n",
- kPointerSize,
- 2,
- 1295,
- {
- B(StackCheck), //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(LdaSmi8), U8(1), //
- B(StoreICSloppy), R(0), U8(0), U8((wide_idx_1 += 2)), //
- REPEAT_127(COMMA, //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(LdaSmi8), U8(1), //
- B(StoreICSloppy), R(0), U8(0), //
- U8((wide_idx_1 += 2))), //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(LdaSmi8), U8(2), //
- B(StoreICSloppyWide), R(0), U16(0), U16(wide_idx_1 + 2), //
- B(LdaUndefined), //
- B(Return), //
- },
- 1,
- {"name"}},
- {"function f(a) {\n"
- " 'use strict';\n"
- " a.name = 1;"
- REPEAT_127(SPACE, " a.name = 1; ")
- " a.name = 2; }\n"
- "f({name : \"test\"})\n",
- kPointerSize,
- 2,
- 1295,
- {
- B(StackCheck), //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(LdaSmi8), U8(1), //
- B(StoreICStrict), R(0), U8(0), U8(wide_idx_2 += 2), //
- REPEAT_127(COMMA, //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(LdaSmi8), U8(1), //
- B(StoreICStrict), R(0), U8(0), //
- U8((wide_idx_2 += 2))), //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(LdaSmi8), U8(2), //
- B(StoreICStrictWide), R(0), U16(0), U16(wide_idx_2 + 2), //
- B(LdaUndefined), //
- B(Return), //
- },
- 1,
- {"name"}},
- {"function f(a, b) {\n"
- " a[b] = 1;"
- REPEAT_127(SPACE, " a[b] = 1; ")
- " a[b] = 2; }\n"
- "f({name : \"test\"})\n",
- 2 * kPointerSize,
- 3,
- 1810,
- {
- B(StackCheck), //
- B(Ldar), A(1, 3), //
- B(Star), R(0), //
- B(Ldar), A(2, 3), //
- B(Star), R(1), //
- B(LdaSmi8), U8(1), //
- B(KeyedStoreICSloppy), R(0), R(1), U8(wide_idx_3 += 2), //
- REPEAT_127(COMMA, //
- B(Ldar), A(1, 3), //
- B(Star), R(0), //
- B(Ldar), A(2, 3), //
- B(Star), R(1), //
- B(LdaSmi8), U8(1), //
- B(KeyedStoreICSloppy), R(0), R(1), //
- U8((wide_idx_3 += 2))), //
- B(Ldar), A(1, 3), //
- B(Star), R(0), //
- B(Ldar), A(2, 3), //
- B(Star), R(1), //
- B(LdaSmi8), U8(2), //
- B(KeyedStoreICSloppyWide), R(0), R(1), U16(wide_idx_3 + 2), //
- B(LdaUndefined), //
- B(Return), //
- }},
- {"function f(a, b) {\n"
- " 'use strict';\n"
- " a[b] = 1;"
- REPEAT_127(SPACE, " a[b] = 1; ")
- " a[b] = 2; }\n"
- "f({name : \"test\"})\n",
- 2 * kPointerSize,
- 3,
- 1810,
- {
- B(StackCheck), //
- B(Ldar), A(1, 3), //
- B(Star), R(0), //
- B(Ldar), A(2, 3), //
- B(Star), R(1), //
- B(LdaSmi8), U8(1), //
- B(KeyedStoreICStrict), R(0), R(1), U8(wide_idx_4 += 2), //
- REPEAT_127(COMMA, //
- B(Ldar), A(1, 3), //
- B(Star), R(0), //
- B(Ldar), A(2, 3), //
- B(Star), R(1), //
- B(LdaSmi8), U8(1), //
- B(KeyedStoreICStrict), R(0), R(1), //
- U8((wide_idx_4 += 2))), //
- B(Ldar), A(1, 3), //
- B(Star), R(0), //
- B(Ldar), A(2, 3), //
- B(Star), R(1), //
- B(LdaSmi8), U8(2), //
- B(KeyedStoreICStrictWide), R(0), R(1), U16(wide_idx_4 + 2), //
- B(LdaUndefined), //
- B(Return), //
- }}
+ "function f(a, b) { a[b] = \"val\"; }\n"
+ "f({arg : \"test\"}, \"arg\")",
+
+ "function f(a) { a.name = a[-124]; }\n"
+ "f({\"-124\" : \"test\", name : 123 })",
+
+ "function f(a) { \"use strict\"; a.name = \"val\"; }\n"
+ "f({name : \"test\"})",
+
+ "function f(a, b) { \"use strict\"; a[b] = \"val\"; }\n"
+ "f({arg : \"test\"}, \"arg\")",
+
+ "function f(a) {\n"
+ " a.name = 1;\n"
+ REPEAT_127(" a.name = 1;\n")
+ " a.name = 2;\n"
+ "}\n"
+ "f({name : \"test\"})\n",
+
+ "function f(a) {\n"
+ " 'use strict';\n"
+ " a.name = 1;\n"
+ REPEAT_127(" a.name = 1;\n")
+ " a.name = 2;\n"
+ "}\n"
+ "f({name : \"test\"})\n",
+
+ "function f(a, b) {\n"
+ " a[b] = 1;\n"
+ REPEAT_127(" a[b] = 1;\n")
+ " a[b] = 2;\n"
+ "}\n"
+ "f({name : \"test\"})\n",
+
+ "function f(a, b) {\n"
+ " 'use strict';\n"
+ " a[b] = 1;\n"
+ REPEAT_127(" a[b] = 1;\n")
+ " a[b] = 2;\n"
+ "}\n"
+ "f({name : \"test\"})\n",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecode(snippets[i].code_snippet, helper.kFunctionName);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("PropertyStores.golden"));
}
-
#define FUNC_ARG "new (function Obj() { this.func = function() { return; }})()"
-
TEST(PropertyCall) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
- FeedbackVectorSpec feedback_spec(&zone);
- FeedbackVectorSlot slot1 = feedback_spec.AddCallICSlot();
- FeedbackVectorSlot slot2 = feedback_spec.AddLoadICSlot();
+ const char* snippets[] = {
+ "function f(a) { return a.func(); }\n"
+ "f(" FUNC_ARG ")",
- Handle<i::TypeFeedbackVector> vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec);
+ "function f(a, b, c) { return a.func(b, c); }\n"
+ "f(" FUNC_ARG ", 1, 2)",
- // These are a hack used by the CallWide test below.
- int wide_idx = vector->GetIndex(slot1) - 2;
+ "function f(a, b) { return a.func(b + b, b); }\n"
+ "f(" FUNC_ARG ", 1)",
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"function f(a) { return a.func(); }\nf(" FUNC_ARG ")",
- 2 * kPointerSize,
- 2,
- 17,
- {
- B(StackCheck), //
- B(Ldar), A(1, 2), //
- B(Star), R(1), //
- B(LoadIC), R(1), U8(0), U8(vector->GetIndex(slot2)), //
- B(Star), R(0), //
- B(Call), R(0), R(1), U8(1), U8(vector->GetIndex(slot1)), //
- B(Return), //
- },
- 1,
- {"func"}},
- {"function f(a, b, c) { return a.func(b, c); }\nf(" FUNC_ARG ", 1, 2)",
- 4 * kPointerSize,
- 4,
- 25,
- {
- B(StackCheck), //
- B(Ldar), A(1, 4), //
- B(Star), R(1), //
- B(LoadIC), R(1), U8(0), U8(vector->GetIndex(slot2)), //
- B(Star), R(0), //
- B(Ldar), A(2, 4), //
- B(Star), R(2), //
- B(Ldar), A(3, 4), //
- B(Star), R(3), //
- B(Call), R(0), R(1), U8(3), U8(vector->GetIndex(slot1)), //
- B(Return) //
- },
- 1,
- {"func"}},
- {"function f(a, b) { return a.func(b + b, b); }\nf(" FUNC_ARG ", 1)",
- 4 * kPointerSize,
- 3,
- 31,
- {
- B(StackCheck), //
- B(Ldar), A(1, 3), //
- B(Star), R(1), //
- B(LoadIC), R(1), U8(0), U8(vector->GetIndex(slot2)), //
- B(Star), R(0), //
- B(Ldar), A(2, 3), //
- B(Star), R(3), //
- B(Ldar), A(2, 3), //
- B(Add), R(3), //
- B(Star), R(2), //
- B(Ldar), A(2, 3), //
- B(Star), R(3), //
- B(Call), R(0), R(1), U8(3), U8(vector->GetIndex(slot1)), //
- B(Return), //
- },
- 1,
- {"func"}},
- {"function f(a) {\n"
- " a.func;\n" REPEAT_127(
- SPACE, " a.func;\n") " return a.func(); }\nf(" FUNC_ARG ")",
- 2 * kPointerSize,
- 2,
- 1047,
- {
- B(StackCheck), //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(LoadIC), R(0), U8(0), U8(wide_idx += 2), //
- REPEAT_127(COMMA, //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(LoadIC), R(0), U8(0), U8((wide_idx += 2))), //
- B(Ldar), A(1, 2), //
- B(Star), R(1), //
- B(LoadICWide), R(1), U16(0), U16(wide_idx + 4), //
- B(Star), R(0), //
- B(CallWide), R16(0), R16(1), U16(1), U16(wide_idx + 2), //
- B(Return), //
- },
- 1,
- {"func"}},
+ "function f(a) {\n"
+ " a.func;\n" //
+ REPEAT_127(" a.func;\n") //
+ " return a.func(); }\n"
+ "f(" FUNC_ARG ")",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecode(snippets[i].code_snippet, helper.kFunctionName);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("PropertyCall.golden"));
}
-
TEST(LoadGlobal) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
- FeedbackVectorSpec feedback_spec(&zone);
- FeedbackVectorSlot slot = feedback_spec.AddLoadICSlot();
+ const char* snippets[] = {
+ "var a = 1;\n"
+ "function f() { return a; }\n"
+ "f()",
- Handle<i::TypeFeedbackVector> vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec);
+ "function t() { }\n"
+ "function f() { return t; }\n"
+ "f()",
- // These are a hack used by the LdaGlobalXXXWide tests below.
- int wide_idx_1 = vector->GetIndex(slot) - 2;
+ "a = 1;\n"
+ "function f() { return a; }\n"
+ "f()",
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"var a = 1;\nfunction f() { return a; }\nf()",
- 0,
- 1,
- 5,
- {
- B(StackCheck), //
- B(LdaGlobal), U8(0), U8(vector->GetIndex(slot)), //
- B(Return) //
- },
- 1,
- {"a"}},
- {"function t() { }\nfunction f() { return t; }\nf()",
- 0,
- 1,
- 5,
- {
- B(StackCheck), //
- B(LdaGlobal), U8(0), U8(vector->GetIndex(slot)), //
- B(Return) //
- },
- 1,
- {"t"}},
- {"a = 1;\nfunction f() { return a; }\nf()",
- 0,
- 1,
- 5,
- {
- B(StackCheck), //
- B(LdaGlobal), U8(0), U8(vector->GetIndex(slot)), //
- B(Return) //
- },
- 1,
- {"a"}},
- {"a = 1;"
- "function f(b) {\n"
- " b.name;\n"
- REPEAT_127(SPACE, "b.name; ")
- " return a;"
- "}\nf({name: 1});",
- kPointerSize,
- 2,
- 1031,
- {
- B(StackCheck), //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(LoadIC), R(0), U8(0), U8(wide_idx_1 += 2), //
- REPEAT_127(COMMA, //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(LoadIC), R(0), U8(0), U8(wide_idx_1 += 2)), //
- B(LdaGlobalWide), U16(1), U16(wide_idx_1 + 2), //
- B(Return), //
- },
- 2,
- {"name", "a"}},
+ "a = 1;\n"
+ "function f(b) {\n"
+ " b.name;\n"
+ REPEAT_127(" b.name;\n")
+ " return a;\n"
+ "}\n"
+ "f({name: 1});",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecode(snippets[i].code_snippet, "f");
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("LoadGlobal.golden"));
}
-
TEST(StoreGlobal) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
- FeedbackVectorSpec feedback_spec(&zone);
- FeedbackVectorSlot slot = feedback_spec.AddStoreICSlot();
+ const char* snippets[] = {
+ "var a = 1;\n"
+ "function f() { a = 2; }\n"
+ "f();",
- Handle<i::TypeFeedbackVector> vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec);
+ "var a = \"test\"; function f(b) { a = b; }\n"
+ "f(\"global\");",
- // These are a hack used by the StaGlobalXXXWide tests below.
- int wide_idx_1 = vector->GetIndex(slot) - 2;
- int wide_idx_2 = vector->GetIndex(slot) - 2;
+ "'use strict'; var a = 1;\n"
+ "function f() { a = 2; }\n"
+ "f();",
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"var a = 1;\nfunction f() { a = 2; }\nf()",
- 0,
- 1,
- 8,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(2), //
- B(StaGlobalSloppy), U8(0), U8(vector->GetIndex(slot)), //
- B(LdaUndefined), //
- B(Return) //
- },
- 1,
- {"a"}},
- {"var a = \"test\"; function f(b) { a = b; }\nf(\"global\")",
- 0,
- 2,
- 8,
- {
- B(StackCheck), //
- B(Ldar), R(helper.kLastParamIndex), //
- B(StaGlobalSloppy), U8(0), U8(vector->GetIndex(slot)), //
- B(LdaUndefined), //
- B(Return) //
- },
- 1,
- {"a"}},
- {"'use strict'; var a = 1;\nfunction f() { a = 2; }\nf()",
- 0,
- 1,
- 8,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(2), //
- B(StaGlobalStrict), U8(0), U8(vector->GetIndex(slot)), //
- B(LdaUndefined), //
- B(Return) //
- },
- 1,
- {"a"}},
- {"a = 1;\nfunction f() { a = 2; }\nf()",
- 0,
- 1,
- 8,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(2), //
- B(StaGlobalSloppy), U8(0), U8(vector->GetIndex(slot)), //
- B(LdaUndefined), //
- B(Return) //
- },
- 1,
- {"a"}},
- {"a = 1;"
- "function f(b) {"
- " b.name;\n"
- REPEAT_127(SPACE, "b.name; ")
- " a = 2; }\n"
- "f({name: 1});",
- kPointerSize,
- 2,
- 1034,
- {
- B(StackCheck), //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(LoadIC), R(0), U8(0), U8(wide_idx_1 += 2), //
- REPEAT_127(COMMA, //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(LoadIC), R(0), U8(0), U8(wide_idx_1 += 2)), //
- B(LdaSmi8), U8(2), //
- B(StaGlobalSloppyWide), U16(1), U16(wide_idx_1 + 2), //
- B(LdaUndefined), //
- B(Return), //
- },
- 2,
- {"name", "a"}},
- {"a = 1;"
- "function f(b) {\n"
- " 'use strict';\n"
- " b.name;\n"
- REPEAT_127(SPACE, "b.name; ")
- " a = 2; }\n"
- "f({name: 1});",
- kPointerSize,
- 2,
- 1034,
- {
- B(StackCheck), //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(LoadIC), R(0), U8(0), U8(wide_idx_2 += 2), //
- REPEAT_127(COMMA, //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(LoadIC), R(0), U8(0), U8(wide_idx_2 += 2)), //
- B(LdaSmi8), U8(2), //
- B(StaGlobalStrictWide), U16(1), U16(wide_idx_2 + 2), //
- B(LdaUndefined), //
- B(Return), //
- },
- 2,
- {"name", "a"}},
+ "a = 1;\n"
+ "function f() { a = 2; }\n"
+ "f();",
+
+ "a = 1;\n"
+ "function f(b) {\n"
+ " b.name;\n"
+ REPEAT_127(" b.name;\n")
+ " a = 2;\n"
+ "}\n"
+ "f({name: 1});",
+
+ "a = 1;\n"
+ "function f(b) {\n"
+ " 'use strict';\n"
+ " b.name;\n"
+ REPEAT_127(" b.name;\n")
+ " a = 2;\n"
+ "}\n"
+ "f({name: 1});",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecode(snippets[i].code_snippet, "f");
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("StoreGlobal.golden"));
}
-
TEST(CallGlobal) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
- FeedbackVectorSpec feedback_spec(&zone);
- FeedbackVectorSlot slot1 = feedback_spec.AddCallICSlot();
- FeedbackVectorSlot slot2 = feedback_spec.AddLoadICSlot();
+ const char* snippets[] = {
+ "function t() { }\n"
+ "function f() { return t(); }\n"
+ "f();",
- Handle<i::TypeFeedbackVector> vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec);
-
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"function t() { }\nfunction f() { return t(); }\nf()",
- 2 * kPointerSize,
- 1,
- 15,
- {
- B(StackCheck), //
- B(LdaUndefined), //
- B(Star), R(1), //
- B(LdaGlobal), U8(0), U8(vector->GetIndex(slot2)), //
- B(Star), R(0), //
- B(Call), R(0), R(1), U8(1), U8(vector->GetIndex(slot1)), //
- B(Return) //
- },
- 1,
- {"t"}},
- {"function t(a, b, c) { }\nfunction f() { return t(1, 2, 3); }\nf()",
- 5 * kPointerSize,
- 1,
- 27,
- {
- B(StackCheck), //
- B(LdaUndefined), //
- B(Star), R(1), //
- B(LdaGlobal), U8(0), U8(vector->GetIndex(slot2)), //
- B(Star), R(0), //
- B(LdaSmi8), U8(1), //
- B(Star), R(2), //
- B(LdaSmi8), U8(2), //
- B(Star), R(3), //
- B(LdaSmi8), U8(3), //
- B(Star), R(4), //
- B(Call), R(0), R(1), U8(4), U8(vector->GetIndex(slot1)), //
- B(Return) //
- },
- 1,
- {"t"}},
+ "function t(a, b, c) { }\n"
+ "function f() { return t(1, 2, 3); }\n"
+ "f();",
};
- // clang-format on
- size_t num_snippets = sizeof(snippets) / sizeof(snippets[0]);
- for (size_t i = 0; i < num_snippets; i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecode(snippets[i].code_snippet, "f");
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("CallGlobal.golden"));
}
-
TEST(CallRuntime) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
- // clang-format off
- ExpectedSnippet<InstanceType> snippets[] = {
- {
- "function f() { %TheHole() }\nf()",
- 0,
- 1,
- 8,
- {
- B(StackCheck), //
- B(CallRuntime), U16(Runtime::kTheHole), R(0), U8(0), //
- B(LdaUndefined), //
- B(Return) //
- },
- },
- {
- "function f(a) { return %IsArray(a) }\nf(undefined)",
- 1 * kPointerSize,
- 2,
- 11,
- {
- B(StackCheck), //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(CallRuntime), U16(Runtime::kIsArray), R(0), U8(1), //
- B(Return) //
- },
- },
- {
- "function f() { return %Add(1, 2) }\nf()",
- 2 * kPointerSize,
- 1,
- 15,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(LdaSmi8), U8(2), //
- B(Star), R(1), //
- B(CallRuntime), U16(Runtime::kAdd), R(0), U8(2), //
- B(Return) //
- },
- },
- {
- "function f() { return %spread_iterable([1]) }\nf()",
- 2 * kPointerSize,
- 1,
- 16,
- {
- B(StackCheck), //
- B(LdaUndefined), //
- B(Star), R(0), //
- B(CreateArrayLiteral), U8(0), U8(0), U8(3), //
- B(Star), R(1), //
- B(CallJSRuntime), U16(Context::SPREAD_ITERABLE_INDEX), R(0), //
- /* */ U8(2), //
- B(Return), //
- },
- 1,
- {InstanceType::FIXED_ARRAY_TYPE},
- },
+ const char* snippets[] = {
+ "function f() { %TheHole() }\n"
+ "f();",
+
+ "function f(a) { return %IsArray(a) }\n"
+ "f(undefined);",
+
+ "function f() { return %Add(1, 2) }\n"
+ "f();",
+
+ "function f() { return %spread_iterable([1]) }\n"
+ "f();",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecode(snippets[i].code_snippet, "f");
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("CallRuntime.golden"));
}
-
TEST(IfConditions) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
-
- Handle<Object> unused = helper.factory()->undefined_value();
-
- // clang-format off
- ExpectedSnippet<Handle<Object>> snippets[] = {
- {"function f() { if (0) { return 1; } else { return -1; } } f()",
- 0,
- 1,
- 4,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(-1), //
- B(Return), //
- },
- 0,
- {unused, unused, unused, unused, unused, unused}},
- {"function f() { if ('lucky') { return 1; } else { return -1; } } f();",
- 0,
- 1,
- 4,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Return), //
- },
- 0,
- {unused, unused, unused, unused, unused, unused}},
- {"function f() { if (false) { return 1; } else { return -1; } } f();",
- 0,
- 1,
- 4,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(-1), //
- B(Return), //
- },
- 0,
- {unused, unused, unused, unused, unused, unused}},
- {"function f() { if (false) { return 1; } } f();",
- 0,
- 1,
- 3,
- {
- B(StackCheck), //
- B(LdaUndefined), //
- B(Return), //
- },
- 0,
- {unused, unused, unused, unused, unused, unused}},
- {"function f() { var a = 1; if (a) { a += 1; } else { return 2; } } f();",
- 2 * kPointerSize,
- 1,
- 24,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(JumpIfToBooleanFalse), U8(14), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(1), //
- B(Add), R(1), //
- B(Star), R(0), //
- B(Jump), U8(5), //
- B(LdaSmi8), U8(2), //
- B(Return), //
- B(LdaUndefined), //
- B(Return), //
- },
- 0,
- {unused, unused, unused, unused, unused, unused}},
- {"function f(a) { if (a <= 0) { return 200; } else { return -200; } }"
- "f(99);",
- kPointerSize,
- 2,
- 18,
- {
- B(StackCheck), //
- B(Ldar), A(1, 2), //
- B(Star), R(0), //
- B(LdaZero), //
- B(TestLessThanOrEqual), R(0), //
- B(JumpIfFalse), U8(5), //
- B(LdaConstant), U8(0), //
- B(Return), //
- B(LdaConstant), U8(1), //
- B(Return), //
- B(LdaUndefined), //
- B(Return), //
- },
- 2,
- {helper.factory()->NewNumberFromInt(200),
- helper.factory()->NewNumberFromInt(-200), unused, unused, unused,
- unused}},
- {"function f(a, b) { if (a in b) { return 200; } }"
- "f('prop', { prop: 'yes'});",
- kPointerSize,
- 3,
- 16,
- {
- B(StackCheck), //
- B(Ldar), A(1, 3), //
- B(Star), R(0), //
- B(Ldar), A(2, 3), //
- B(TestIn), R(0), //
- B(JumpIfFalse), U8(5), //
- B(LdaConstant), U8(0), //
- B(Return), //
- B(LdaUndefined), //
- B(Return), //
- },
- 1,
- {helper.factory()->NewNumberFromInt(200), unused, unused, unused, unused,
- unused}},
- {"function f(z) { var a = 0; var b = 0; if (a === 0.01) { "
- REPEAT_64(SPACE, "b = a; a = b; ")
- " return 200; } else { return -200; } } f(0.001)",
- 3 * kPointerSize,
- 2,
- 283,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(LdaZero), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(LdaConstant), U8(0), //
- B(TestEqualStrict), R(2), //
- B(JumpIfFalseConstant), U8(2), //
- B(Ldar), R(0), //
- REPEAT_64(COMMA, //
- B(Star), R(1), //
- B(Star), R(0)), //
- B(LdaConstant), U8(1), //
- B(Return), //
- B(LdaConstant), U8(3), //
- B(Return), //
- B(LdaUndefined), //
- B(Return)}, //
- 4,
- {helper.factory()->NewHeapNumber(0.01),
- helper.factory()->NewNumberFromInt(200),
- helper.factory()->NewNumberFromInt(263),
- helper.factory()->NewNumberFromInt(-200), unused, unused}},
- {"function f() { var a = 0; var b = 0; if (a) { "
- REPEAT_64(SPACE, "b = a; a = b; ")
- " return 200; } else { return -200; } } f()",
- 2 * kPointerSize,
- 1,
- 277,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(LdaZero), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(JumpIfToBooleanFalseConstant), U8(1), //
- B(Ldar), R(0), //
- REPEAT_64(COMMA, //
- B(Star), R(1), //
- B(Star), R(0)), //
- B(LdaConstant), U8(0), //
- B(Return), //
- B(LdaConstant), U8(2), //
- B(Return), //
- B(LdaUndefined), //
- B(Return)}, //
- 3,
- {helper.factory()->NewNumberFromInt(200),
- helper.factory()->NewNumberFromInt(263),
- helper.factory()->NewNumberFromInt(-200), unused, unused, unused}},
-
- {"function f(a, b) {\n"
- " if (a == b) { return 1; }\n"
- " if (a === b) { return 1; }\n"
- " if (a < b) { return 1; }\n"
- " if (a > b) { return 1; }\n"
- " if (a <= b) { return 1; }\n"
- " if (a >= b) { return 1; }\n"
- " if (a in b) { return 1; }\n"
- " if (a instanceof b) { return 1; }\n"
- " return 0;\n"
- "} f(1, 1);",
- kPointerSize,
- 3,
- 107,
- {
-#define IF_CONDITION_RETURN(condition) \
- B(Ldar), A(1, 3), \
- B(Star), R(0), \
- B(Ldar), A(2, 3), \
- B(condition), R(0), \
- B(JumpIfFalse), U8(5), \
- B(LdaSmi8), U8(1), \
- B(Return),
- B(StackCheck), //
- IF_CONDITION_RETURN(TestEqual) //
- IF_CONDITION_RETURN(TestEqualStrict) //
- IF_CONDITION_RETURN(TestLessThan) //
- IF_CONDITION_RETURN(TestGreaterThan) //
- IF_CONDITION_RETURN(TestLessThanOrEqual) //
- IF_CONDITION_RETURN(TestGreaterThanOrEqual) //
- IF_CONDITION_RETURN(TestIn) //
- IF_CONDITION_RETURN(TestInstanceOf) //
- B(LdaZero), //
- B(Return)}, //
-#undef IF_CONDITION_RETURN
- 0,
- {unused, unused, unused, unused, unused, unused}},
- {"function f() {"
- " var a = 0;"
- " if (a) {"
- " return 20;"
- "} else {"
- " return -20;}"
- "};"
- "f();",
- 1 * kPointerSize,
- 1,
- 14,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(JumpIfToBooleanFalse), U8(5), //
- B(LdaSmi8), U8(20), //
- B(Return), //
- B(LdaSmi8), U8(-20), //
- B(Return), //
- B(LdaUndefined), //
- B(Return)
- },
- 0,
- {unused, unused, unused, unused, unused, unused}}
- };
- // clang-format on
-
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecode(snippets[i].code_snippet, helper.kFunctionName);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
+ if (FLAG_harmony_instanceof) {
+ // TODO(mvstanton): when ES6 instanceof ships, regenerate the bytecode
+ // expectations and remove this flag check.
+ return;
}
-}
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kNumber);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
+ const char* snippets[] = {
+ "function f() {\n"
+ " if (0) {\n"
+ " return 1;\n"
+ " } else {\n"
+ " return -1;\n"
+ " }\n"
+ "};\n"
+ "f();",
+
+ "function f() {\n"
+ " if ('lucky') {\n"
+ " return 1;\n"
+ " } else {\n"
+ " return -1;\n"
+ " }\n"
+ "};\n"
+ "f();",
+
+ "function f() {\n"
+ " if (false) {\n"
+ " return 1;\n"
+ " } else {\n"
+ " return -1;\n"
+ " }\n"
+ "};\n"
+ "f();",
+
+ "function f() {\n"
+ " if (false) {\n"
+ " return 1;\n"
+ " }\n"
+ "};\n"
+ "f();",
+
+ "function f() {\n"
+ " var a = 1;\n"
+ " if (a) {\n"
+ " a += 1;\n"
+ " } else {\n"
+ " return 2;\n"
+ " }\n"
+ "};\n"
+ "f();",
+
+ "function f(a) {\n"
+ " if (a <= 0) {\n"
+ " return 200;\n"
+ " } else {\n"
+ " return -200;\n"
+ " }\n"
+ "};\n"
+ "f(99);",
+
+ "function f(a, b) { if (a in b) { return 200; } }"
+ "f('prop', { prop: 'yes'});",
+
+ "function f(z) { var a = 0; var b = 0; if (a === 0.01) {\n"
+ REPEAT_64(" b = a; a = b;\n")
+ " return 200; } else { return -200; } } f(0.001);",
+
+ "function f() {\n"
+ " var a = 0; var b = 0;\n"
+ " if (a) {\n"
+ REPEAT_64(" b = a; a = b;\n")
+ " return 200; } else { return -200; }\n"
+ "};\n"
+ "f();",
+
+ "function f(a, b) {\n"
+ " if (a == b) { return 1; }\n"
+ " if (a === b) { return 1; }\n"
+ " if (a < b) { return 1; }\n"
+ " if (a > b) { return 1; }\n"
+ " if (a <= b) { return 1; }\n"
+ " if (a >= b) { return 1; }\n"
+ " if (a in b) { return 1; }\n"
+ " if (a instanceof b) { return 1; }\n"
+ " return 0;\n"
+ "}\n"
+ "f(1, 1);",
+
+ "function f() {\n"
+ " var a = 0;\n"
+ " if (a) {\n"
+ " return 20;\n"
+ " } else {\n"
+ " return -20;\n"
+ " }\n"
+ "};\n"
+ "f();",
+ };
+
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("IfConditions.golden"));
+}
TEST(DeclareGlobals) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
+ printer.set_execute(false);
+ printer.set_top_level(true);
- // Create different feedback vector specs to be precise on slot numbering.
- FeedbackVectorSpec feedback_spec_stores(&zone);
- FeedbackVectorSlot store_slot_1 = feedback_spec_stores.AddStoreICSlot();
- FeedbackVectorSlot store_slot_2 = feedback_spec_stores.AddStoreICSlot();
- USE(store_slot_1);
+ const char* snippets[] = {
+ "var a = 1;",
- Handle<i::TypeFeedbackVector> store_vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec_stores);
+ "function f() {}",
- FeedbackVectorSpec feedback_spec_loads(&zone);
- FeedbackVectorSlot load_slot_1 = feedback_spec_loads.AddLoadICSlot();
- FeedbackVectorSlot call_slot_1 = feedback_spec_loads.AddCallICSlot();
+ "var a = 1;\n"
+ "a=2;",
- Handle<i::TypeFeedbackVector> load_vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec_loads);
-
- // clang-format off
- ExpectedSnippet<InstanceType> snippets[] = {
- {"var a = 1;",
- 4 * kPointerSize,
- 1,
- 31,
- {
- B(LdaConstant), U8(0), //
- B(Star), R(1), //
- B(LdaZero), //
- B(Star), R(2), //
- B(CallRuntime), U16(Runtime::kDeclareGlobals), R(1), U8(2), //
- B(StackCheck), //
- B(LdaConstant), U8(1), //
- B(Star), R(1), //
- B(LdaZero), //
- B(Star), R(2), //
- B(LdaSmi8), U8(1), //
- B(Star), R(3), //
- B(CallRuntime), U16(Runtime::kInitializeVarGlobal), R(1), U8(3), //
- B(LdaUndefined), //
- B(Return) //
- },
- 2,
- {InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"function f() {}",
- 2 * kPointerSize,
- 1,
- 15,
- {
- B(LdaConstant), U8(0), //
- B(Star), R(0), //
- B(LdaZero), //
- B(Star), R(1), //
- B(CallRuntime), U16(Runtime::kDeclareGlobals), R(0), U8(2), //
- B(StackCheck), //
- B(LdaUndefined), //
- B(Return) //
- },
- 1,
- {InstanceType::FIXED_ARRAY_TYPE}},
- {"var a = 1;\na=2;",
- 4 * kPointerSize,
- 1,
- 37,
- {
- B(LdaConstant), U8(0), //
- B(Star), R(1), //
- B(LdaZero), //
- B(Star), R(2), //
- B(CallRuntime), U16(Runtime::kDeclareGlobals), R(1), U8(2), //
- B(StackCheck), //
- B(LdaConstant), U8(1), //
- B(Star), R(1), //
- B(LdaZero), //
- B(Star), R(2), //
- B(LdaSmi8), U8(1), //
- B(Star), R(3), //
- B(CallRuntime), U16(Runtime::kInitializeVarGlobal), R(1), U8(3), //
- B(LdaSmi8), U8(2), //
- B(StaGlobalSloppy), U8(1), //
- /* */ U8(store_vector->GetIndex(store_slot_2)), //
- B(Star), R(0), //
- B(Return) //
- },
- 2,
- {InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"function f() {}\nf();",
- 3 * kPointerSize,
- 1,
- 29,
- {
- B(LdaConstant), U8(0), //
- B(Star), R(1), //
- B(LdaZero), //
- B(Star), R(2), //
- B(CallRuntime), U16(Runtime::kDeclareGlobals), R(1), U8(2), //
- B(StackCheck), //
- B(LdaUndefined), //
- B(Star), R(2), //
- B(LdaGlobal), U8(1), U8(load_vector->GetIndex(load_slot_1)), //
- B(Star), R(1), //
- B(Call), R(1), R(2), U8(1), //
- /* */ U8(load_vector->GetIndex(call_slot_1)), //
- B(Star), R(0), //
- B(Return) //
- },
- 2,
- {InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
+ "function f() {}\n"
+ "f();",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeTopLevelBytecode(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("DeclareGlobals.golden"));
}
-
TEST(BreakableBlocks) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
- int closure = Register::function_closure().index();
- int context = Register::current_context().index();
+ const char* snippets[] = {
+ "var x = 0;\n"
+ "label: {\n"
+ " x = x + 1;\n"
+ " break label;\n"
+ " x = x + 1;\n"
+ "}\n"
+ "return x;",
- // clang-format off
- ExpectedSnippet<InstanceType> snippets[] = {
- {"var x = 0;\n"
- "label: {\n"
- " x = x + 1;\n"
- " break label;\n"
- " x = x + 1;\n"
- "}\n"
- "return x;",
- 2 * kPointerSize,
- 1,
- 17,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(1), //
- B(Add), R(1), //
- B(Star), R(0), //
- B(Jump), U8(2), //
- B(Ldar), R(0), //
- B(Return) //
- }},
- {"var sum = 0;\n"
- "outer: {\n"
- " for (var x = 0; x < 10; ++x) {\n"
- " for (var y = 0; y < 3; ++y) {\n"
- " ++sum;\n"
- " if (x + y == 12) { break outer; }\n"
- " }\n"
- " }\n"
- "}\n"
- "return sum;",
- 5 * kPointerSize,
- 1,
- 75,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(LdaZero), //
- B(Star), R(1), //
- B(Ldar), R(1), //
- B(Star), R(3), //
- B(LdaSmi8), U8(10), //
- B(TestLessThan), R(3), //
- B(JumpIfFalse), U8(57), //
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(2), //
- B(Ldar), R(2), //
- B(Star), R(3), //
- B(LdaSmi8), U8(3), //
- B(TestLessThan), R(3), //
- B(JumpIfFalse), U8(35), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(ToNumber), //
- B(Inc), //
- B(Star), R(0), //
- B(Ldar), R(1), //
- B(Star), R(3), //
- B(Ldar), R(2), //
- B(Add), R(3), //
- B(Star), R(4), //
- B(LdaSmi8), U8(12), //
- B(TestEqual), R(4), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(18), //
- B(Ldar), R(2), //
- B(ToNumber), //
- B(Inc), //
- B(Star), R(2), //
- B(Jump), U8(-41), //
- B(Ldar), R(1), //
- B(ToNumber), //
- B(Inc), //
- B(Star), R(1), //
- B(Jump), U8(-63), //
- B(Ldar), R(0), //
- B(Return), //
- }},
- {"outer: {\n"
- " let y = 10;"
- " function f() { return y; }\n"
- " break outer;\n"
- "}\n",
- 5 * kPointerSize,
- 1,
- 51,
- {
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Star), R(3), //
- B(Ldar), R(closure), //
- B(Star), R(4), //
- B(CallRuntime), U16(Runtime::kPushBlockContext), R(3), U8(2), //
- B(PushContext), R(2), //
- B(LdaTheHole), //
- B(StaContextSlot), R(context), U8(4), //
- B(CreateClosure), U8(1), U8(0), //
- B(Star), R(0), //
- B(LdaSmi8), U8(10), //
- B(StaContextSlot), R(context), U8(4), //
- B(Ldar), R(0), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(2), //
- B(Star), R(3), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(3), U8(1), //
- B(Star), R(1), //
- B(Jump), U8(2), //
- B(PopContext), R(2), //
- B(LdaUndefined), //
- B(Return), //
- },
- 3,
- {InstanceType::FIXED_ARRAY_TYPE, InstanceType::SHARED_FUNCTION_INFO_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"let x = 1;\n"
- "outer: {\n"
- " inner: {\n"
- " let y = 2;\n"
- " function f() { return x + y; }\n"
- " if (y) break outer;\n"
- " y = 3;\n"
- " }\n"
- "}\n"
- "x = 4;",
- 6 * kPointerSize,
- 1,
- 131,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), //
- U8(1), //
- B(PushContext), R(2), //
- B(LdaTheHole), //
- B(StaContextSlot), R(context), U8(4), //
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(StaContextSlot), R(context), U8(4), //
- B(LdaConstant), U8(0), //
- B(Star), R(4), //
- B(Ldar), R(closure), //
- B(Star), R(5), //
- B(CallRuntime), U16(Runtime::kPushBlockContext), R(4), U8(2), //
- B(PushContext), R(3), //
- B(LdaTheHole), //
- B(StaContextSlot), R(context), U8(4), //
- B(CreateClosure), U8(1), U8(0), //
- B(Star), R(0), //
- B(LdaSmi8), U8(2), //
- B(StaContextSlot), R(context), U8(4), //
- B(Ldar), R(0), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(2), //
- B(Star), R(4), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(4), U8(1), //
- B(Star), R(1), //
- B(LdaContextSlot), R(context), U8(4), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(3), //
- B(Star), R(4), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(4), U8(1), //
- B(JumpIfToBooleanFalse), U8(6), //
- B(PopContext), R(3), //
- B(Jump), U8(27), //
- B(LdaSmi8), U8(3), //
- B(Star), R(4), //
- B(LdaContextSlot), R(context), U8(4), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(3), //
- B(Star), R(5), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(5), U8(1), //
- B(Ldar), R(4), //
- B(StaContextSlot), R(context), U8(4), //
- B(PopContext), R(3), //
- B(LdaSmi8), U8(4), //
- B(Star), R(4), //
- B(LdaContextSlot), R(context), U8(4), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(4), //
- B(Star), R(5), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(5), U8(1), //
- B(Ldar), R(4), //
- B(StaContextSlot), R(context), U8(4), //
- B(LdaUndefined), //
- B(Return), //
- },
- 5,
- {InstanceType::FIXED_ARRAY_TYPE, InstanceType::SHARED_FUNCTION_INFO_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
+ "var sum = 0;\n"
+ "outer: {\n"
+ " for (var x = 0; x < 10; ++x) {\n"
+ " for (var y = 0; y < 3; ++y) {\n"
+ " ++sum;\n"
+ " if (x + y == 12) { break outer; }\n"
+ " }\n"
+ " }\n"
+ "}\n"
+ "return sum;",
+
+ "outer: {\n"
+ " let y = 10;\n"
+ " function f() { return y; }\n"
+ " break outer;\n"
+ "}\n",
+
+ "let x = 1;\n"
+ "outer: {\n"
+ " inner: {\n"
+ " let y = 2;\n"
+ " function f() { return x + y; }\n"
+ " if (y) break outer;\n"
+ " y = 3;\n"
+ " }\n"
+ "}\n"
+ "x = 4;",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("BreakableBlocks.golden"));
}
-
TEST(BasicLoops) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
+ const char* snippets[] = {
+ "var x = 0;\n"
+ "while (false) { x = 99; break; continue; }\n"
+ "return x;",
- int closure = Register::function_closure().index();
- int context = Register::current_context().index();
+ "var x = 0;\n"
+ "while (false) {\n"
+ " x = x + 1;\n"
+ "};\n"
+ "return x;",
- // clang-format off
- ExpectedSnippet<InstanceType> snippets[] = {
- {"var x = 0;\n"
- "while (false) { x = 99; break; continue; }\n"
- "return x;",
- 1 * kPointerSize,
- 1,
- 5,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(Return) //
- }},
- {"var x = 0;"
- "while (false) {"
- " x = x + 1;"
- "};"
- "return x;",
- 1 * kPointerSize,
- 1,
- 5,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(Return), //
- },
- 0},
- {"var x = 0;"
- "var y = 1;"
- "while (x < 10) {"
- " y = y * 12;"
- " x = x + 1;"
- " if (x == 3) continue;"
- " if (x == 4) break;"
- "}"
- "return y;",
- 3 * kPointerSize,
- 1,
- 66,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(10), //
- B(TestLessThan), R(2), //
- B(JumpIfFalse), U8(47), //
- B(StackCheck), //
- B(Ldar), R(1), //
- B(Star), R(2), //
- B(LdaSmi8), U8(12), //
- B(Mul), R(2), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(1), //
- B(Add), R(2), //
- B(Star), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(3), //
- B(TestEqual), R(2), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(-39), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(4), //
- B(TestEqual), R(2), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(4), //
- B(Jump), U8(-53), //
- B(Ldar), R(1), //
- B(Return), //
- },
- 0},
- {"var i = 0;"
- "while (true) {"
- " if (i < 0) continue;"
- " if (i == 3) break;"
- " if (i == 4) break;"
- " if (i == 10) continue;"
- " if (i == 5) break;"
- " i = i + 1;"
- "}"
- "return i;",
- 2 * kPointerSize,
- 1,
- 79,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaZero), //
- B(TestLessThan), R(1), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(-10), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(3), //
- B(TestEqual), R(1), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(50), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(4), //
- B(TestEqual), R(1), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(38), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(10), //
- B(TestEqual), R(1), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(-46), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(5), //
- B(TestEqual), R(1), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(14), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(1), //
- B(Add), R(1), //
- B(Star), R(0), //
- B(Jump), U8(-70), //
- B(Ldar), R(0), //
- B(Return), //
- },
- 0},
- {"var i = 0;"
- "while (true) {"
- " while (i < 3) {"
- " if (i == 2) break;"
- " i = i + 1;"
- " }"
- " i = i + 1;"
- " break;"
- "}"
- "return i;",
- 2 * kPointerSize,
- 1,
- 57,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(3), //
- B(TestLessThan), R(1), //
- B(JumpIfFalse), U8(27), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(2), //
- B(TestEqual), R(1), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(14), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(1), //
- B(Add), R(1), //
- B(Star), R(0), //
- B(Jump), U8(-33), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(1), //
- B(Add), R(1), //
- B(Star), R(0), //
- B(Jump), U8(4), //
- B(Jump), U8(-48), //
- B(Ldar), R(0), //
- B(Return), //
- },
- 0},
- {"var x = 10;"
- "var y = 1;"
- "while (x) {"
- " y = y * 12;"
- " x = x - 1;"
- "}"
- "return y;",
- 3 * kPointerSize,
- 1,
- 39,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(Star), R(0), //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(JumpIfToBooleanFalse), U8(25), //
- B(StackCheck), //
- B(Ldar), R(1), //
- B(Star), R(2), //
- B(LdaSmi8), U8(12), //
- B(Mul), R(2), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(1), //
- B(Sub), R(2), //
- B(Star), R(0), //
- B(Jump), U8(-25), //
- B(Ldar), R(1), //
- B(Return), //
- },
- 0},
- {"var x = 0; var y = 1;"
- "do {"
- " y = y * 10;"
- " if (x == 5) break;"
- " if (x == 6) continue;"
- " x = x + 1;"
- "} while (x < 10);"
- "return y;",
- 3 * kPointerSize,
- 1,
- 66,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), //
- B(StackCheck), //
- B(Ldar), R(1), //
- B(Star), R(2), //
- B(LdaSmi8), U8(10), //
- B(Mul), R(2), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(5), //
- B(TestEqual), R(2), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(34), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(6), //
- B(TestEqual), R(2), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(12), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(1), //
- B(Add), R(2), //
- B(Star), R(0), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(10), //
- B(TestLessThan), R(2), //
- B(JumpIfTrue), U8(-53), //
- B(Ldar), R(1), //
- B(Return), //
- },
- 0},
- {"var x = 10;"
- "var y = 1;"
- "do {"
- " y = y * 12;"
- " x = x - 1;"
- "} while (x);"
- "return y;",
- 3 * kPointerSize,
- 1,
- 37,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(Star), R(0), //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), //
- B(StackCheck), //
- B(Ldar), R(1), //
- B(Star), R(2), //
- B(LdaSmi8), U8(12), //
- B(Mul), R(2), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(1), //
- B(Sub), R(2), //
- B(Star), R(0), //
- B(Ldar), R(0), //
- B(JumpIfToBooleanTrue), U8(-23), //
- B(Ldar), R(1), //
- B(Return), //
- },
- 0},
- {"var x = 0; var y = 1;"
- "do {"
- " y = y * 10;"
- " if (x == 5) break;"
- " x = x + 1;"
- " if (x == 6) continue;"
- "} while (false);"
- "return y;",
- 3 * kPointerSize,
- 1,
- 54,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), //
- B(StackCheck), //
- B(Ldar), R(1), //
- B(Star), R(2), //
- B(LdaSmi8), U8(10), //
- B(Mul), R(2), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(5), //
- B(TestEqual), R(2), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(22), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(1), //
- B(Add), R(2), //
- B(Star), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(6), //
- B(TestEqual), R(2), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(2), //
- B(Ldar), R(1), //
- B(Return), //
- },
- 0},
- {"var x = 0; var y = 1;"
- "do {"
- " y = y * 10;"
- " if (x == 5) break;"
- " x = x + 1;"
- " if (x == 6) continue;"
- "} while (true);"
- "return y;",
- 3 * kPointerSize,
- 1,
- 56,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), //
- B(StackCheck), //
- B(Ldar), R(1), //
- B(Star), R(2), //
- B(LdaSmi8), U8(10), //
- B(Mul), R(2), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(5), //
- B(TestEqual), R(2), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(24), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(1), //
- B(Add), R(2), //
- B(Star), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(6), //
- B(TestEqual), R(2), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(-41), //
- B(Jump), U8(-43), //
- B(Ldar), R(1), //
- B(Return), //
- },
- 0},
- {"var x = 0; "
- "for (;;) {"
- " if (x == 1) break;"
- " if (x == 2) continue;"
- " x = x + 1;"
- "}",
- 2 * kPointerSize,
- 1,
- 43,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(1), //
- B(TestEqual), R(1), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(26), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(2), //
- B(TestEqual), R(1), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(-23), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(1), //
- B(Add), R(1), //
- B(Star), R(0), //
- B(Jump), U8(-35), //
- B(LdaUndefined), //
- B(Return), //
- },
- 0},
- {"for (var x = 0;;) {"
- " if (x == 1) break;"
- " if (x == 2) continue;"
- " x = x + 1;"
- "}",
- 2 * kPointerSize,
- 1,
- 43,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(1), //
- B(TestEqual), R(1), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(26), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(2), //
- B(TestEqual), R(1), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(-23), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(1), //
- B(Add), R(1), //
- B(Star), R(0), //
- B(Jump), U8(-35), //
- B(LdaUndefined), //
- B(Return), //
- },
- 0},
- {"var x = 0; "
- "for (;; x = x + 1) {"
- " if (x == 1) break;"
- " if (x == 2) continue;"
- "}",
- 2 * kPointerSize,
- 1,
- 43,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(1), //
- B(TestEqual), R(1), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(26), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(2), //
- B(TestEqual), R(1), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(2), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(1), //
- B(Add), R(1), //
- B(Star), R(0), //
- B(Jump), U8(-35), //
- B(LdaUndefined), //
- B(Return), //
- },
- 0},
- {"for (var x = 0;; x = x + 1) {"
- " if (x == 1) break;"
- " if (x == 2) continue;"
- "}",
- 2 * kPointerSize,
- 1,
- 43,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(1), //
- B(TestEqual), R(1), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(26), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(2), //
- B(TestEqual), R(1), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(2), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(1), //
- B(Add), R(1), //
- B(Star), R(0), //
- B(Jump), U8(-35), //
- B(LdaUndefined), //
- B(Return), //
- },
- 0},
- {"var u = 0;"
- "for (var i = 0; i < 100; i = i + 1) {"
- " u = u + 1;"
- " continue;"
- "}",
- 3 * kPointerSize,
- 1,
- 44,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(LdaZero), //
- B(Star), R(1), //
- B(Ldar), R(1), //
- B(Star), R(2), //
- B(LdaSmi8), U8(100), //
- B(TestLessThan), R(2), //
- B(JumpIfFalse), U8(27), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(1), //
- B(Add), R(2), //
- B(Star), R(0), //
- B(Jump), U8(2), //
- B(Ldar), R(1), //
- B(Star), R(2), //
- B(LdaSmi8), U8(1), //
- B(Add), R(2), //
- B(Star), R(1), //
- B(Jump), U8(-33), //
- B(LdaUndefined), //
- B(Return), //
- },
- 0},
- {"var y = 1;"
- "for (var x = 10; x; --x) {"
- " y = y * 12;"
- "}"
- "return y;",
- 3 * kPointerSize,
- 1,
- 35,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(LdaSmi8), U8(10), //
- B(Star), R(1), //
- B(Ldar), R(1), //
- B(JumpIfToBooleanFalse), U8(21), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(12), //
- B(Mul), R(2), //
- B(Star), R(0), //
- B(Ldar), R(1), //
- B(ToNumber), //
- B(Dec), //
- B(Star), R(1), //
- B(Jump), U8(-21), //
- B(Ldar), R(0), //
- B(Return), //
- },
- 0},
- {"var x = 0;"
- "for (var i = 0; false; i++) {"
- " x = x + 1;"
- "};"
- "return x;",
- 2 * kPointerSize,
- 1,
- 10,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(LdaZero), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(Return), //
- },
- 0},
- {"var x = 0;"
- "for (var i = 0; true; ++i) {"
- " x = x + 1;"
- " if (x == 20) break;"
- "};"
- "return x;",
- 3 * kPointerSize,
- 1,
- 39,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(LdaZero), //
- B(Star), R(1), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(1), //
- B(Add), R(2), //
- B(Star), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(20), //
- B(TestEqual), R(2), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(10), //
- B(Ldar), R(1), //
- B(ToNumber), //
- B(Inc), //
- B(Star), R(1), //
- B(Jump), U8(-27), //
- B(Ldar), R(0), //
- B(Return), //
- },
- 0},
- {"var a = 0;\n"
- "while (a) {\n"
- " { \n"
- " let z = 1;\n"
- " function f() { z = 2; }\n"
- " if (z) continue;\n"
- " z++;\n"
- " }\n"
- "}\n",
- 7 * kPointerSize,
- 1,
- 118,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(1), //
- B(Ldar), R(1), //
- B(JumpIfToBooleanFalse), U8(110), //
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Star), R(4), //
- B(Ldar), R(closure), //
- B(Star), R(5), //
- B(CallRuntime), U16(Runtime::kPushBlockContext), R(4), U8(2), //
- B(PushContext), R(3), //
- B(LdaTheHole), //
- B(StaContextSlot), R(context), U8(4), //
- B(CreateClosure), U8(1), U8(0), //
- B(Star), R(0), //
- B(LdaSmi8), U8(1), //
- B(StaContextSlot), R(context), U8(4), //
- B(Ldar), R(0), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(2), //
- B(Star), R(4), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(4), U8(1), //
- B(Star), R(2), //
- B(LdaContextSlot), R(context), U8(4), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(3), //
- B(Star), R(4), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(4), U8(1), //
- B(JumpIfToBooleanFalse), U8(6), //
- B(PopContext), R(3), //
- B(Jump), U8(-67), //
- B(LdaContextSlot), R(context), U8(4), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(3), //
- B(Star), R(4), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(4), U8(1), //
- B(ToNumber), //
- B(Star), R(4), //
- B(Inc), //
- B(Star), R(5), //
- B(LdaContextSlot), R(context), U8(4), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(3), //
- B(Star), R(6), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(6), U8(1), //
- B(Ldar), R(5), //
- B(StaContextSlot), R(context), U8(4), //
- B(PopContext), R(3), //
- B(Jump), U8(-110), //
- B(LdaUndefined), //
- B(Return), //
- },
- 4,
- {InstanceType::FIXED_ARRAY_TYPE, InstanceType::SHARED_FUNCTION_INFO_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
+ "var x = 0;\n"
+ "var y = 1;\n"
+ "while (x < 10) {\n"
+ " y = y * 12;\n"
+ " x = x + 1;\n"
+ " if (x == 3) continue;\n"
+ " if (x == 4) break;\n"
+ "}\n"
+ "return y;",
+
+ "var i = 0;\n"
+ "while (true) {\n"
+ " if (i < 0) continue;\n"
+ " if (i == 3) break;\n"
+ " if (i == 4) break;\n"
+ " if (i == 10) continue;\n"
+ " if (i == 5) break;\n"
+ " i = i + 1;\n"
+ "}\n"
+ "return i;",
+
+ "var i = 0;\n"
+ "while (true) {\n"
+ " while (i < 3) {\n"
+ " if (i == 2) break;\n"
+ " i = i + 1;\n"
+ " }\n"
+ " i = i + 1;\n"
+ " break;\n"
+ "}\n"
+ "return i;",
+
+ "var x = 10;\n"
+ "var y = 1;\n"
+ "while (x) {\n"
+ " y = y * 12;\n"
+ " x = x - 1;\n"
+ "}\n"
+ "return y;",
+
+ "var x = 0; var y = 1;\n"
+ "do {\n"
+ " y = y * 10;\n"
+ " if (x == 5) break;\n"
+ " if (x == 6) continue;\n"
+ " x = x + 1;\n"
+ "} while (x < 10);\n"
+ "return y;",
+
+ "var x = 10;\n"
+ "var y = 1;\n"
+ "do {\n"
+ " y = y * 12;\n"
+ " x = x - 1;\n"
+ "} while (x);\n"
+ "return y;",
+
+ "var x = 0; var y = 1;\n"
+ "do {\n"
+ " y = y * 10;\n"
+ " if (x == 5) break;\n"
+ " x = x + 1;\n"
+ " if (x == 6) continue;\n"
+ "} while (false);\n"
+ "return y;",
+
+ "var x = 0; var y = 1;\n"
+ "do {\n"
+ " y = y * 10;\n"
+ " if (x == 5) break;\n"
+ " x = x + 1;\n"
+ " if (x == 6) continue;\n"
+ "} while (true);\n"
+ "return y;",
+
+ "var x = 0;\n"
+ "for (;;) {\n"
+ " if (x == 1) break;\n"
+ " if (x == 2) continue;\n"
+ " x = x + 1;\n"
+ "}",
+
+ "for (var x = 0;;) {\n"
+ " if (x == 1) break;\n"
+ " if (x == 2) continue;\n"
+ " x = x + 1;\n"
+ "}",
+
+ "var x = 0;\n"
+ "for (;; x = x + 1) {\n"
+ " if (x == 1) break;\n"
+ " if (x == 2) continue;\n"
+ "}",
+
+ "for (var x = 0;; x = x + 1) {\n"
+ " if (x == 1) break;\n"
+ " if (x == 2) continue;\n"
+ "}",
+
+ "var u = 0;\n"
+ "for (var i = 0; i < 100; i = i + 1) {\n"
+ " u = u + 1;\n"
+ " continue;\n"
+ "}",
+
+ "var y = 1;\n"
+ "for (var x = 10; x; --x) {\n"
+ " y = y * 12;\n"
+ "}\n"
+ "return y;",
+
+ "var x = 0;\n"
+ "for (var i = 0; false; i++) {\n"
+ " x = x + 1;\n"
+ "};\n"
+ "return x;",
+
+ "var x = 0;\n"
+ "for (var i = 0; true; ++i) {\n"
+ " x = x + 1;\n"
+ " if (x == 20) break;\n"
+ "};\n"
+ "return x;",
+
+ "var a = 0;\n"
+ "while (a) {\n"
+ " { \n"
+ " let z = 1;\n"
+ " function f() { z = 2; }\n"
+ " if (z) continue;\n"
+ " z++;\n"
+ " }\n"
+ "}",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("BasicLoops.golden"));
}
-
TEST(JumpsRequiringConstantWideOperands) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
-
- int constant_count = 0;
- // clang-format off
- ExpectedSnippet<Handle<Object>, 316> snippets[] = {
- {
- REPEAT_256(SPACE, "var x = 0.1;")
- REPEAT_32(SPACE, "var x = 0.2;")
- REPEAT_16(SPACE, "var x = 0.3;")
- REPEAT_8(SPACE, "var x = 0.4;")
- "for (var i = 0; i < 3; i++) {\n"
- " if (i == 1) continue;\n"
- " if (i == 2) break;\n"
- "}\n"
- "return 3;",
- kPointerSize * 3,
- 1,
- 1361,
- {
- B(StackCheck), //
-#define L(c) B(LdaConstant), U8(c), B(Star), R(0)
- REPEAT_256(COMMA, L(constant_count++)),
-#undef L
-#define LW(c) B(LdaConstantWide), U16I(c), B(Star), R(0)
- REPEAT_32(COMMA, LW(constant_count)),
- REPEAT_16(COMMA, LW(constant_count)),
- REPEAT_8(COMMA, LW(constant_count)),
-#undef LW
- B(LdaZero), //
- B(Star), R(1), //
- B(Ldar), R(1), //
- B(Star), R(2), //
- B(LdaSmi8), U8(3), //
- B(TestLessThan), R(2), //
- B(JumpIfFalseConstantWide), U16(313), //
- B(StackCheck), //
- B(Ldar), R(1), //
- B(Star), R(2), //
- B(LdaSmi8), U8(1), //
- B(TestEqual), R(2), //
- B(JumpIfFalseConstantWide), U16(312), //
- B(JumpConstantWide), U16(315), //
- B(Ldar), R(1), //
- B(Star), R(2), //
- B(LdaSmi8), U8(2), //
- B(TestEqual), R(2), //
- B(JumpIfFalseConstantWide), U16(312), //
- B(JumpConstantWide), U16(314), //
- B(Ldar), R(1), //
- B(ToNumber), //
- B(Star), R(2), //
- B(Inc), //
- B(Star), R(1), //
- B(Jump), U8(-48), //
- B(LdaSmi8), U8(3), //
- B(Return) //
- },
- 316,
- {
-#define S(x) CcTest::i_isolate()->factory()->NewNumber(x)
- REPEAT_256(COMMA, S(0.1)),
- REPEAT_32(COMMA, S(0.2)),
- REPEAT_16(COMMA, S(0.3)),
- REPEAT_8(COMMA, S(0.4)),
-#undef S
-#define N(x) CcTest::i_isolate()->factory()->NewNumberFromInt(x)
- N(6), N(42), N(13), N(17)
-#undef N
- }}
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kNumber);
+ const char* snippets[] = {
+ REPEAT_256("var x = 0.1;\n")
+ REPEAT_32("var x = 0.2;\n")
+ REPEAT_16("var x = 0.3;\n")
+ REPEAT_8("var x = 0.4;\n")
+ "for (var i = 0; i < 3; i++) {\n"
+ " if (i == 1) continue;\n"
+ " if (i == 2) break;\n"
+ "}\n"
+ "return 3;",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("JumpsRequiringConstantWideOperands.golden"));
}
-
TEST(UnaryOperators) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kNumber);
+ const char* snippets[] = {
+ "var x = 0;\n"
+ "while (x != 10) {\n"
+ " x = x + 10;\n"
+ "}\n"
+ "return x;",
- // clang-format off
- ExpectedSnippet<int> snippets[] = {
- {"var x = 0;"
- "while (x != 10) {"
- " x = x + 10;"
- "}"
- "return x;",
- 2 * kPointerSize,
- 1,
- 31,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(10), //
- B(TestEqual), R(1), //
- B(LogicalNot), //
- B(JumpIfFalse), U8(15), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(10), //
- B(Add), R(1), //
- B(Star), R(0), //
- B(Jump), U8(-22), //
- B(Ldar), R(0), //
- B(Return), //
- },
- 0},
- {"var x = false;"
- "do {"
- " x = !x;"
- "} while(x == false);"
- "return x;",
- 2 * kPointerSize,
- 1,
- 22,
- {
- B(StackCheck), //
- B(LdaFalse), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(LogicalNot), //
- B(Star), R(0), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaFalse), //
- B(TestEqual), R(1), //
- B(JumpIfTrue), U8(-13), //
- B(Ldar), R(0), //
- B(Return), //
- },
- 0},
- {"var x = 101;"
- "return void(x * 3);",
- 2 * kPointerSize,
- 1,
- 13,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(101), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(3), //
- B(Mul), R(1), //
- B(LdaUndefined), //
- B(Return), //
- },
- 0},
- {"var x = 1234;"
- "var y = void (x * x - 1);"
- "return y;",
- 4 * kPointerSize,
- 1,
- 21,
- {
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Star), R(0), //
- B(Star), R(2), //
- B(Ldar), R(0), //
- B(Mul), R(2), //
- B(Star), R(3), //
- B(LdaSmi8), U8(1), //
- B(Sub), R(3), //
- B(LdaUndefined), //
- B(Star), R(1), //
- B(Return), //
- },
- 1,
- {1234}},
- {"var x = 13;"
- "return ~x;",
- 2 * kPointerSize,
- 1,
- 12,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(13), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(-1), //
- B(BitwiseXor), R(1), //
- B(Return), //
- },
- 0},
- {"var x = 13;"
- "return +x;",
- 2 * kPointerSize,
- 1,
- 12,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(13), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(1), //
- B(Mul), R(1), //
- B(Return), //
- },
- 0},
- {"var x = 13;"
- "return -x;",
- 2 * kPointerSize,
- 1,
- 12,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(13), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(-1), //
- B(Mul), R(1), //
- B(Return), //
- },
- 0}
+ "var x = false;\n"
+ "do {\n"
+ " x = !x;\n"
+ "} while(x == false);\n"
+ "return x;",
+
+ "var x = 101;\n"
+ "return void(x * 3);",
+
+ "var x = 1234;\n"
+ "var y = void (x * x - 1);\n"
+ "return y;",
+
+ "var x = 13;\n"
+ "return ~x;",
+
+ "var x = 13;\n"
+ "return +x;",
+
+ "var x = 13;\n"
+ "return -x;",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("UnaryOperators.golden"));
}
-
TEST(Typeof) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
- FeedbackVectorSpec feedback_spec(&zone);
- FeedbackVectorSlot slot = feedback_spec.AddLoadICSlot();
+ const char* snippets[] = {
+ "function f() {\n"
+ " var x = 13;\n"
+ " return typeof(x);\n"
+ "};",
- Handle<i::TypeFeedbackVector> vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec);
-
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"function f() {\n"
- " var x = 13;\n"
- " return typeof(x);\n"
- "}; f();",
- kPointerSize,
- 1,
- 7,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(13), //
- B(Star), R(0), //
- B(TypeOf), //
- B(Return), //
- }},
- {"var x = 13;\n"
- "function f() {\n"
- " return typeof(x);\n"
- "}; f();",
- 0,
- 1,
- 6,
- {
- B(StackCheck), //
- B(LdaGlobalInsideTypeof), U8(0), U8(vector->GetIndex(slot)), //
- B(TypeOf), //
- B(Return), //
- },
- 1,
- {"x"}},
+ "var x = 13;\n"
+ "function f() {\n"
+ " return typeof(x);\n"
+ "};",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunction(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets, "", "\nf();"),
+ LoadGolden("Typeof.golden"));
}
-
TEST(Delete) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
- int deep_elements_flags =
- ObjectLiteral::kFastElements | ObjectLiteral::kDisableMementos;
- int closure = Register::function_closure().index();
- int context = Register::current_context().index();
- int first_context_slot = Context::MIN_CONTEXT_SLOTS;
+ const char* snippets[] = {
+ "var a = {x:13, y:14}; return delete a.x;",
- // clang-format off
- ExpectedSnippet<InstanceType> snippets[] = {
- {"var a = {x:13, y:14}; return delete a.x;",
- 2 * kPointerSize,
- 1,
- 16,
- {
- B(StackCheck), //
- B(CreateObjectLiteral), U8(0), U8(0), U8(deep_elements_flags), //
- B(Star), R(1), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaConstant), U8(1), //
- B(DeletePropertySloppy), R(1), //
- B(Return)},
- 2,
- {InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"'use strict'; var a = {x:13, y:14}; return delete a.x;",
- 2 * kPointerSize,
- 1,
- 16,
- {B(StackCheck), //
- B(CreateObjectLiteral), U8(0), U8(0), U8(deep_elements_flags), //
- B(Star), R(1), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaConstant), U8(1), //
- B(DeletePropertyStrict), R(1), //
- B(Return)},
- 2,
- {InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"var a = {1:13, 2:14}; return delete a[2];",
- 2 * kPointerSize,
- 1,
- 16,
- {B(StackCheck), //
- B(CreateObjectLiteral), U8(0), U8(0), U8(deep_elements_flags), //
- B(Star), R(1), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(2), //
- B(DeletePropertySloppy), R(1), //
- B(Return)},
- 1,
- {InstanceType::FIXED_ARRAY_TYPE}},
- {"var a = 10; return delete a;",
- 1 * kPointerSize,
- 1,
- 7,
- {B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(Star), R(0), //
- B(LdaFalse), //
- B(Return)},
- 0},
- {"'use strict';"
- "var a = {1:10};"
- "(function f1() {return a;});"
- "return delete a[1];",
- 2 * kPointerSize,
- 1,
- 30,
- {B(CallRuntime), U16(Runtime::kNewFunctionContext), //
- /* */ R(closure), U8(1), //
- B(PushContext), R(0), //
- B(StackCheck), //
- B(CreateObjectLiteral), U8(0), U8(0), U8(deep_elements_flags), //
- B(Star), R(1), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(CreateClosure), U8(1), U8(0), //
- B(LdaContextSlot), R(context), U8(first_context_slot), //
- B(Star), R(1), //
- B(LdaSmi8), U8(1), //
- B(DeletePropertyStrict), R(1), //
- B(Return)},
- 2,
- {InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::SHARED_FUNCTION_INFO_TYPE}},
- {"return delete 'test';",
- 0 * kPointerSize,
- 1,
- 3,
- {B(StackCheck), //
- B(LdaTrue), //
- B(Return)},
- 0},
+ "'use strict'; var a = {x:13, y:14}; return delete a.x;",
+
+ "var a = {1:13, 2:14}; return delete a[2];",
+
+ "var a = 10; return delete a;",
+
+ "'use strict';\n"
+ "var a = {1:10};\n"
+ "(function f1() {return a;});\n"
+ "return delete a[1];",
+
+ "return delete 'test';",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("Delete.golden"));
}
-
TEST(GlobalDelete) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
- int context = Register::current_context().index();
- int native_context_index = Context::NATIVE_CONTEXT_INDEX;
- int global_context_index = Context::EXTENSION_INDEX;
- FeedbackVectorSpec feedback_spec(&zone);
- FeedbackVectorSlot slot = feedback_spec.AddLoadICSlot();
+ const char* snippets[] = {
+ "var a = {x:13, y:14};\n"
+ "function f() {\n"
+ " return delete a.x;\n"
+ "};\n"
+ "f();",
- Handle<i::TypeFeedbackVector> vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec);
+ "a = {1:13, 2:14};\n"
+ "function f() {\n"
+ " 'use strict';\n"
+ " return delete a[1];\n"
+ "};\n"
+ "f();",
- // clang-format off
- ExpectedSnippet<InstanceType> snippets[] = {
- {"var a = {x:13, y:14};\n function f() { return delete a.x; };\n f();",
- 1 * kPointerSize,
- 1,
- 11,
- {B(StackCheck), //
- B(LdaGlobal), U8(0), U8(vector->GetIndex(slot)), //
- B(Star), R(0), //
- B(LdaConstant), U8(1), //
- B(DeletePropertySloppy), R(0), //
- B(Return)},
- 2,
- {InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"a = {1:13, 2:14};\n"
- "function f() {'use strict'; return delete a[1];};\n f();",
- 1 * kPointerSize,
- 1,
- 11,
- {B(StackCheck), //
- B(LdaGlobal), U8(0), U8(vector->GetIndex(slot)), //
- B(Star), R(0), //
- B(LdaSmi8), U8(1), //
- B(DeletePropertyStrict), R(0), //
- B(Return)},
- 1,
- {InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"var a = {x:13, y:14};\n function f() { return delete a; };\n f();",
- 2 * kPointerSize,
- 1,
- 16,
- {B(StackCheck), //
- B(LdaContextSlot), R(context), U8(native_context_index), //
- B(Star), R(0), //
- B(LdaContextSlot), R(0), U8(global_context_index), //
- B(Star), R(1), //
- B(LdaConstant), U8(0), //
- B(DeletePropertySloppy), R(1), //
- B(Return)},
- 1,
- {InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"b = 30;\n function f() { return delete b; };\n f();",
- 2 * kPointerSize,
- 1,
- 16,
- {B(StackCheck), //
- B(LdaContextSlot), R(context), U8(native_context_index), //
- B(Star), R(0), //
- B(LdaContextSlot), R(0), U8(global_context_index), //
- B(Star), R(1), //
- B(LdaConstant), U8(0), //
- B(DeletePropertySloppy), R(1), //
- B(Return)},
- 1,
- {InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}}
+ "var a = {x:13, y:14};\n"
+ "function f() {\n"
+ " return delete a;\n"
+ "};\n"
+ "f();",
+
+ "b = 30;\n"
+ "function f() {\n"
+ " return delete b;\n"
+ "};\n"
+ "f();",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecode(snippets[i].code_snippet, "f");
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("GlobalDelete.golden"));
}
-
TEST(FunctionLiterals) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
- FeedbackVectorSpec feedback_spec(&zone);
- FeedbackVectorSlot slot = feedback_spec.AddCallICSlot();
+ const char* snippets[] = {
+ "return function(){ }",
- Handle<i::TypeFeedbackVector> vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec);
+ "return (function(){ })()",
- // clang-format off
- ExpectedSnippet<InstanceType> snippets[] = {
- {"return function(){ }",
- 0,
- 1,
- 5,
- {
- B(StackCheck), //
- B(CreateClosure), U8(0), U8(0), //
- B(Return) //
- },
- 1,
- {InstanceType::SHARED_FUNCTION_INFO_TYPE}},
- {"return (function(){ })()",
- 2 * kPointerSize,
- 1,
- 15,
- {
- B(StackCheck), //
- B(LdaUndefined), //
- B(Star), R(1), //
- B(CreateClosure), U8(0), U8(0), //
- B(Star), R(0), //
- B(Call), R(0), R(1), U8(1), U8(vector->GetIndex(slot)), //
- B(Return) //
- },
- 1,
- {InstanceType::SHARED_FUNCTION_INFO_TYPE}},
- {"return (function(x){ return x; })(1)",
- 3 * kPointerSize,
- 1,
- 19,
- {
- B(StackCheck), //
- B(LdaUndefined), //
- B(Star), R(1), //
- B(CreateClosure), U8(0), U8(0), //
- B(Star), R(0), //
- B(LdaSmi8), U8(1), //
- B(Star), R(2), //
- B(Call), R(0), R(1), U8(2), U8(vector->GetIndex(slot)), //
- B(Return) //
- },
- 1,
- {InstanceType::SHARED_FUNCTION_INFO_TYPE}},
+ "return (function(x){ return x; })(1)",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("FunctionLiterals.golden"));
}
-
TEST(RegExpLiterals) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
- FeedbackVectorSpec feedback_spec(&zone);
- FeedbackVectorSlot slot1 = feedback_spec.AddCallICSlot();
- FeedbackVectorSlot slot2 = feedback_spec.AddLoadICSlot();
- uint8_t i_flags = JSRegExp::kIgnoreCase;
+ const char* snippets[] = {
+ "return /ab+d/;",
- Handle<i::TypeFeedbackVector> vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec);
+ "return /(\\w+)\\s(\\w+)/i;",
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"return /ab+d/;",
- 0 * kPointerSize,
- 1,
- 6,
- {
- B(StackCheck), //
- B(CreateRegExpLiteral), U8(0), U8(0), U8(0), //
- B(Return), //
- },
- 1,
- {"ab+d"}},
- {"return /(\\w+)\\s(\\w+)/i;",
- 0 * kPointerSize,
- 1,
- 6,
- {
- B(StackCheck), //
- B(CreateRegExpLiteral), U8(0), U8(0), U8(i_flags), //
- B(Return), //
- },
- 1,
- {"(\\w+)\\s(\\w+)"}},
- {"return /ab+d/.exec('abdd');",
- 3 * kPointerSize,
- 1,
- 23,
- {
- B(StackCheck), //
- B(CreateRegExpLiteral), U8(0), U8(0), U8(0), //
- B(Star), R(1), //
- B(LoadIC), R(1), U8(1), U8(vector->GetIndex(slot2)), //
- B(Star), R(0), //
- B(LdaConstant), U8(2), //
- B(Star), R(2), //
- B(Call), R(0), R(1), U8(2), U8(vector->GetIndex(slot1)), //
- B(Return), //
- },
- 3,
- {"ab+d", "exec", "abdd"}},
+ "return /ab+d/.exec('abdd');",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("RegExpLiterals.golden"));
}
-
TEST(RegExpLiteralsWide) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
- int wide_idx = 0;
-
- // clang-format off
- ExpectedSnippet<InstanceType, 257> snippets[] = {
- {"var a;" REPEAT_256(SPACE, "a = 1.23;") "return /ab+d/;",
- 1 * kPointerSize,
- 1,
- 1032,
- {
- B(StackCheck), //
- REPEAT_256(COMMA, //
- B(LdaConstant), U8(wide_idx++), //
- B(Star), R(0)), //
- B(CreateRegExpLiteralWide), U16(256), U16(0), U8(0), //
- B(Return) //
- },
- 257,
- {REPEAT_256(COMMA, InstanceType::HEAP_NUMBER_TYPE),
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
+ const char* snippets[] = {
+ "var a;" //
+ REPEAT_256("\na = 1.23;") //
+ "\nreturn /ab+d/;",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("RegExpLiteralsWide.golden"));
}
-
TEST(ArrayLiterals) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
- FeedbackVectorSpec feedback_spec(&zone);
- FeedbackVectorSlot slot1 = feedback_spec.AddKeyedStoreICSlot();
- FeedbackVectorSlot slot2 = feedback_spec.AddKeyedStoreICSlot();
- FeedbackVectorSlot slot3 = feedback_spec.AddKeyedStoreICSlot();
+ const char* snippets[] = {
+ "return [ 1, 2 ];",
- Handle<i::TypeFeedbackVector> vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec);
+ "var a = 1; return [ a, a + 1 ];",
- int simple_flags =
- ArrayLiteral::kDisableMementos | ArrayLiteral::kShallowElements;
- int deep_elements_flags = ArrayLiteral::kDisableMementos;
- // clang-format off
- ExpectedSnippet<InstanceType> snippets[] = {
- {"return [ 1, 2 ];",
- 0,
- 1,
- 6,
- {
- B(StackCheck), //
- B(CreateArrayLiteral), U8(0), U8(0), U8(simple_flags), //
- B(Return) //
- },
- 1,
- {InstanceType::FIXED_ARRAY_TYPE}},
- {"var a = 1; return [ a, a + 1 ];",
- 4 * kPointerSize,
- 1,
- 39,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(CreateArrayLiteral), U8(0), U8(0), U8(3), //
- B(Star), R(2), //
- B(LdaZero), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(KeyedStoreICSloppy), R(2), R(1), U8(vector->GetIndex(slot1)), //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(Star), R(3), //
- B(LdaSmi8), U8(1), //
- B(Add), R(3), //
- B(KeyedStoreICSloppy), R(2), R(1), U8(vector->GetIndex(slot1)), //
- B(Ldar), R(2), //
- B(Return), //
- },
- 1,
- {InstanceType::FIXED_ARRAY_TYPE}},
- {"return [ [ 1, 2 ], [ 3 ] ];",
- 0,
- 1,
- 6,
- {
- B(StackCheck), //
- B(CreateArrayLiteral), U8(0), U8(2), U8(deep_elements_flags), //
- B(Return) //
- },
- 1,
- {InstanceType::FIXED_ARRAY_TYPE}},
- {"var a = 1; return [ [ a, 2 ], [ a + 2 ] ];",
- 6 * kPointerSize,
- 1,
- 69,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(CreateArrayLiteral), U8(0), U8(2), U8(deep_elements_flags), //
- B(Star), R(2), //
- B(LdaZero), //
- B(Star), R(1), //
- B(CreateArrayLiteral), U8(1), U8(0), U8(simple_flags), //
- B(Star), R(4), //
- B(LdaZero), //
- B(Star), R(3), //
- B(Ldar), R(0), //
- B(KeyedStoreICSloppy), R(4), R(3), U8(vector->GetIndex(slot1)), //
- B(Ldar), R(4), //
- B(KeyedStoreICSloppy), R(2), R(1), U8(vector->GetIndex(slot3)), //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), //
- B(CreateArrayLiteral), U8(2), U8(1), U8(simple_flags), //
- B(Star), R(4), //
- B(LdaZero), //
- B(Star), R(3), //
- B(Ldar), R(0), //
- B(Star), R(5), //
- B(LdaSmi8), U8(2), //
- B(Add), R(5), //
- B(KeyedStoreICSloppy), R(4), R(3), U8(vector->GetIndex(slot2)), //
- B(Ldar), R(4), //
- B(KeyedStoreICSloppy), R(2), R(1), U8(vector->GetIndex(slot3)), //
- B(Ldar), R(2), //
- B(Return), //
- },
- 3,
- {InstanceType::FIXED_ARRAY_TYPE, InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::FIXED_ARRAY_TYPE}},
+ "return [ [ 1, 2 ], [ 3 ] ];",
+
+ "var a = 1; return [ [ a, 2 ], [ a + 2 ] ];",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("ArrayLiterals.golden"));
}
-
TEST(ArrayLiteralsWide) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
- int wide_idx = 0;
- int simple_flags =
- ArrayLiteral::kDisableMementos | ArrayLiteral::kShallowElements;
-
- // clang-format off
- ExpectedSnippet<InstanceType, 257> snippets[] = {
- {"var a;" REPEAT_256(SPACE, "a = 1.23;") "return [ 1 , 2 ];",
- 1 * kPointerSize,
- 1,
- 1032,
- {
- B(StackCheck), //
- REPEAT_256(COMMA, //
- B(LdaConstant), U8(wide_idx++), //
- B(Star), R(0)), //
- B(CreateArrayLiteralWide), U16(256), U16(0), U8(simple_flags), //
- B(Return) //
- },
- 257,
- {REPEAT_256(COMMA, InstanceType::HEAP_NUMBER_TYPE),
- InstanceType::FIXED_ARRAY_TYPE}},
+ const char* snippets[] = {
+ "var a;" //
+ REPEAT_256("\na = 1.23;") //
+ "\nreturn [ 1 , 2 ];",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("ArrayLiteralsWide.golden"));
}
-
TEST(ObjectLiterals) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
- FeedbackVectorSpec feedback_spec(&zone);
- FeedbackVectorSlot slot1 = feedback_spec.AddStoreICSlot();
+ const char* snippets[] = {
+ "return { };",
- Handle<i::TypeFeedbackVector> vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec);
+ "return { name: 'string', val: 9.2 };",
- int simple_flags = ObjectLiteral::kFastElements |
- ObjectLiteral::kShallowProperties |
- ObjectLiteral::kDisableMementos;
- int deep_elements_flags =
- ObjectLiteral::kFastElements | ObjectLiteral::kDisableMementos;
+ "var a = 1; return { name: 'string', val: a };",
- // clang-format off
- ExpectedSnippet<InstanceType> snippets[] = {
- {"return { };",
- kPointerSize,
- 1,
- 8,
- {
- B(StackCheck), //
- B(CreateObjectLiteral), U8(0), U8(0), U8(simple_flags), //
- B(Star), R(0), //
- B(Return) //
- },
- 1,
- {InstanceType::FIXED_ARRAY_TYPE}},
- {"return { name: 'string', val: 9.2 };",
- kPointerSize,
- 1,
- 8,
- {
- B(StackCheck), //
- B(CreateObjectLiteral), U8(0), U8(0), U8(deep_elements_flags), //
- B(Star), R(0), //
- B(Return) //
- },
- 1,
- {InstanceType::FIXED_ARRAY_TYPE}},
- {"var a = 1; return { name: 'string', val: a };",
- 2 * kPointerSize,
- 1,
- 20,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(CreateObjectLiteral), U8(0), U8(0), U8(deep_elements_flags), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(StoreICSloppy), R(1), U8(1), U8(vector->GetIndex(slot1)), //
- B(Ldar), R(1), //
- B(Return), //
- },
- 2,
- {InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"var a = 1; return { val: a, val: a + 1 };",
- 3 * kPointerSize,
- 1,
- 26,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(CreateObjectLiteral), U8(0), U8(0), U8(deep_elements_flags), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(1), //
- B(Add), R(2), //
- B(StoreICSloppy), R(1), U8(1), U8(vector->GetIndex(slot1)), //
- B(Ldar), R(1), //
- B(Return), //
- },
- 2,
- {InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"return { func: function() { } };",
- 1 * kPointerSize,
- 1,
- 17,
- {
- B(StackCheck), //
- B(CreateObjectLiteral), U8(0), U8(0), U8(deep_elements_flags), //
- B(Star), R(0), //
- B(CreateClosure), U8(1), U8(0), //
- B(StoreICSloppy), R(0), U8(2), U8(vector->GetIndex(slot1)), //
- B(Ldar), R(0), //
- B(Return), //
- },
- 3,
- {InstanceType::FIXED_ARRAY_TYPE, InstanceType::SHARED_FUNCTION_INFO_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"return { func(a) { return a; } };",
- 1 * kPointerSize,
- 1,
- 17,
- {
- B(StackCheck), //
- B(CreateObjectLiteral), U8(0), U8(0), U8(deep_elements_flags), //
- B(Star), R(0), //
- B(CreateClosure), U8(1), U8(0), //
- B(StoreICSloppy), R(0), U8(2), U8(vector->GetIndex(slot1)), //
- B(Ldar), R(0), //
- B(Return), //
- },
- 3,
- {InstanceType::FIXED_ARRAY_TYPE, InstanceType::SHARED_FUNCTION_INFO_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"return { get a() { return 2; } };",
- 6 * kPointerSize,
- 1,
- 33,
- {
- B(StackCheck), //
- B(CreateObjectLiteral), U8(0), U8(0), U8(deep_elements_flags), //
- B(Star), R(0), //
- B(Mov), R(0), R(1), //
- B(LdaConstant), U8(1), //
- B(Star), R(2), //
- B(CreateClosure), U8(2), U8(0), //
- B(Star), R(3), //
- B(LdaNull), //
- B(Star), R(4), //
- B(LdaZero), //
- B(Star), R(5), //
- B(CallRuntime), U16(Runtime::kDefineAccessorPropertyUnchecked), //
- /* */ R(1), U8(5), //
- B(Ldar), R(0), //
- B(Return), //
- },
- 3,
- {InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::SHARED_FUNCTION_INFO_TYPE}},
- {"return { get a() { return this.x; }, set a(val) { this.x = val } };",
- 6 * kPointerSize,
- 1,
- 35,
- {
- B(StackCheck), //
- B(CreateObjectLiteral), U8(0), U8(0), U8(deep_elements_flags), //
- B(Star), R(0), //
- B(Mov), R(0), R(1), //
- B(LdaConstant), U8(1), //
- B(Star), R(2), //
- B(CreateClosure), U8(2), U8(0), //
- B(Star), R(3), //
- B(CreateClosure), U8(3), U8(0), //
- B(Star), R(4), //
- B(LdaZero), //
- B(Star), R(5), //
- B(CallRuntime), U16(Runtime::kDefineAccessorPropertyUnchecked), //
- /* */ R(1), U8(5), //
- B(Ldar), R(0), //
- B(Return), //
- },
- 4,
- {InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::SHARED_FUNCTION_INFO_TYPE,
- InstanceType::SHARED_FUNCTION_INFO_TYPE}},
- {"return { set b(val) { this.y = val } };",
- 6 * kPointerSize,
- 1,
- 33,
- {
- B(StackCheck), //
- B(CreateObjectLiteral), U8(0), U8(0), U8(deep_elements_flags), //
- B(Star), R(0), //
- B(Mov), R(0), R(1), //
- B(LdaConstant), U8(1), //
- B(Star), R(2), //
- B(LdaNull), //
- B(Star), R(3), //
- B(CreateClosure), U8(2), U8(0), //
- B(Star), R(4), //
- B(LdaZero), //
- B(Star), R(5), //
- B(CallRuntime), U16(Runtime::kDefineAccessorPropertyUnchecked), //
- /* */ R(1), U8(5), //
- B(Ldar), R(0), //
- B(Return), //
- },
- 3,
- {InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::SHARED_FUNCTION_INFO_TYPE}},
- {"var a = 1; return { 1: a };",
- 6 * kPointerSize,
- 1,
- 33,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(CreateObjectLiteral), U8(0), U8(0), U8(deep_elements_flags), //
- B(Star), R(1), //
- B(Mov), R(1), R(2), //
- B(LdaSmi8), U8(1), //
- B(Star), R(3), //
- B(Ldar), R(0), //
- B(Star), R(4), //
- B(LdaZero), //
- B(Star), R(5), //
- B(CallRuntime), U16(Runtime::kSetProperty), R(2), U8(4), //
- B(Ldar), R(1), //
- B(Return), //
- },
- 1,
- {InstanceType::FIXED_ARRAY_TYPE}},
- {"return { __proto__: null }",
- 3 * kPointerSize,
- 1,
- 21,
- {
- B(StackCheck), //
- B(CreateObjectLiteral), U8(0), U8(0), U8(simple_flags), //
- B(Star), R(0), //
- B(Mov), R(0), R(1), //
- B(LdaNull), B(Star), R(2), //
- B(CallRuntime), U16(Runtime::kInternalSetPrototype), R(1), U8(2), //
- B(Ldar), R(0), //
- B(Return), //
- },
- 1,
- {InstanceType::FIXED_ARRAY_TYPE}},
- {"var a = 'test'; return { [a]: 1 }",
- 7 * kPointerSize,
- 1,
- 37,
- {
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Star), R(0), //
- B(CreateObjectLiteral), U8(1), U8(0), U8(simple_flags), //
- B(Star), R(1), //
- B(Mov), R(1), R(2), //
- B(Ldar), R(0), //
- B(ToName), //
- B(Star), R(3), //
- B(LdaSmi8), U8(1), //
- B(Star), R(4), //
- B(LdaZero), //
- B(Star), R(5), //
- B(LdaZero), //
- B(Star), R(6), //
- B(CallRuntime), U16(Runtime::kDefineDataPropertyInLiteral), R(2), //
- /* */ U8(5), //
- B(Ldar), R(1), //
- B(Return), //
- },
- 2,
- {InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::FIXED_ARRAY_TYPE}},
- {"var a = 'test'; return { val: a, [a]: 1 }",
- 7 * kPointerSize,
- 1,
- 43,
- {
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Star), R(0), //
- B(CreateObjectLiteral), U8(1), U8(0), U8(deep_elements_flags), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(StoreICSloppy), R(1), U8(2), U8(vector->GetIndex(slot1)), //
- B(Mov), R(1), R(2), //
- B(Ldar), R(0), //
- B(ToName), //
- B(Star), R(3), //
- B(LdaSmi8), U8(1), //
- B(Star), R(4), //
- B(LdaZero), //
- B(Star), R(5), //
- B(LdaZero), //
- B(Star), R(6), //
- B(CallRuntime), U16(Runtime::kDefineDataPropertyInLiteral), R(2), //
- /* */ U8(5), //
- B(Ldar), R(1), //
- B(Return), //
- },
- 3,
- {InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"var a = 'test'; return { [a]: 1, __proto__: {} }",
- 7 * kPointerSize,
- 1,
- 53,
- {
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Star), R(0), //
- B(CreateObjectLiteral), U8(1), U8(1), U8(simple_flags), //
- B(Star), R(1), //
- B(Mov), R(1), R(2), //
- B(Ldar), R(0), //
- B(ToName), //
- B(Star), R(3), //
- B(LdaSmi8), U8(1), //
- B(Star), R(4), //
- B(LdaZero), //
- B(Star), R(5), //
- B(LdaZero), //
- B(Star), R(6), //
- B(CallRuntime), U16(Runtime::kDefineDataPropertyInLiteral), R(2), //
- /* */ U8(5), //
- B(Mov), R(1), R(2), //
- B(CreateObjectLiteral), U8(1), U8(0), U8(13), //
- B(Star), R(4), //
- B(Star), R(3), //
- B(CallRuntime), U16(Runtime::kInternalSetPrototype), R(2), U8(2), //
- B(Ldar), R(1), //
- B(Return), //
- },
- 2,
- {InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::FIXED_ARRAY_TYPE}},
- {"var n = 'name'; return { [n]: 'val', get a() { }, set a(b) {} };",
- 7 * kPointerSize,
- 1,
- 77,
- {
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Star), R(0), //
- B(CreateObjectLiteral), U8(1), U8(0), U8(simple_flags), //
- B(Star), R(1), //
- B(Mov), R(1), R(2), //
- B(Ldar), R(0), //
- B(ToName), //
- B(Star), R(3), //
- B(LdaConstant), U8(2), //
- B(Star), R(4), //
- B(LdaZero), //
- B(Star), R(5), //
- B(LdaZero), //
- B(Star), R(6), //
- B(CallRuntime), U16(Runtime::kDefineDataPropertyInLiteral), R(2), //
- /* */ U8(5), //
- B(Mov), R(1), R(2), //
- B(LdaConstant), U8(3), //
- B(Star), R(3), //
- B(CreateClosure), U8(4), U8(0), //
- B(Star), R(4), //
- B(LdaZero), //
- B(Star), R(5), //
- B(CallRuntime), U16(Runtime::kDefineGetterPropertyUnchecked), //
- /* */ R(2), U8(4), //
- B(Mov), R(1), R(2), //
- B(LdaConstant), U8(3), //
- B(Star), R(3), //
- B(CreateClosure), U8(5), U8(0), //
- B(Star), R(4), //
- B(LdaZero), //
- B(Star), R(5), //
- B(CallRuntime), U16(Runtime::kDefineSetterPropertyUnchecked), //
- /* */ R(2), U8(4), //
- B(Ldar), R(1), //
- B(Return), //
- },
- 6,
- {InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::SHARED_FUNCTION_INFO_TYPE,
- InstanceType::SHARED_FUNCTION_INFO_TYPE}},
+ "var a = 1; return { val: a, val: a + 1 };",
+
+ "return { func: function() { } };",
+
+ "return { func(a) { return a; } };",
+
+ "return { get a() { return 2; } };",
+
+ "return { get a() { return this.x; }, set a(val) { this.x = val } };",
+
+ "return { set b(val) { this.y = val } };",
+
+ "var a = 1; return { 1: a };",
+
+ "return { __proto__: null };",
+
+ "var a = 'test'; return { [a]: 1 };",
+
+ "var a = 'test'; return { val: a, [a]: 1 };",
+
+ "var a = 'test'; return { [a]: 1, __proto__: {} };",
+
+ "var n = 'name'; return { [n]: 'val', get a() { }, set a(b) {} };",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("ObjectLiterals.golden"));
}
-
TEST(ObjectLiteralsWide) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
-
- int deep_elements_flags =
- ObjectLiteral::kFastElements | ObjectLiteral::kDisableMementos;
- int wide_idx = 0;
-
- // clang-format off
- ExpectedSnippet<InstanceType, 257> snippets[] = {
- {"var a;" REPEAT_256(SPACE,
- "a = 1.23;") "return { name: 'string', val: 9.2 };",
- 2 * kPointerSize,
- 1,
- 1034,
- {
- B(StackCheck), //
- REPEAT_256(COMMA, //
- B(LdaConstant), U8(wide_idx++), //
- B(Star), R(0)), //
- B(CreateObjectLiteralWide), U16(256), U16(0), //
- /* */ U8(deep_elements_flags), //
- B(Star), R(1), //
- B(Return) //
- },
- 257,
- {REPEAT_256(COMMA, InstanceType::HEAP_NUMBER_TYPE),
- InstanceType::FIXED_ARRAY_TYPE}},
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
+ const char* snippets[] = {
+ "var a;" //
+ REPEAT_256("\na = 1.23;") //
+ "\nreturn { name: 'string', val: 9.2 };",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("ObjectLiteralsWide.golden"));
}
-
TEST(TopLevelObjectLiterals) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
+ printer.set_execute(false);
+ printer.set_top_level(true);
- int has_function_flags = ObjectLiteral::kFastElements |
- ObjectLiteral::kHasFunction |
- ObjectLiteral::kDisableMementos;
- // clang-format off
- ExpectedSnippet<InstanceType> snippets[] = {
- {"var a = { func: function() { } };",
- 5 * kPointerSize,
- 1,
- 49,
- {
- B(LdaConstant), U8(0), //
- B(Star), R(1), //
- B(LdaZero), //
- B(Star), R(2), //
- B(CallRuntime), U16(Runtime::kDeclareGlobals), R(1), U8(2), //
- B(StackCheck), //
- B(LdaConstant), U8(1), //
- B(Star), R(1), //
- B(LdaZero), //
- B(Star), R(2), //
- B(CreateObjectLiteral), U8(2), U8(0), U8(has_function_flags), //
- B(Star), R(4), //
- B(CreateClosure), U8(3), U8(1), //
- B(StoreICSloppy), R(4), U8(4), U8(3), //
- B(CallRuntime), U16(Runtime::kToFastProperties), R(4), U8(1), //
- B(Ldar), R(4), //
- B(Star), R(3), //
- B(CallRuntime), U16(Runtime::kInitializeVarGlobal), R(1), U8(3), //
- B(LdaUndefined), //
- B(Return), //
- },
- 5,
- {InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::SHARED_FUNCTION_INFO_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
+ const char* snippets[] = {
+ "var a = { func: function() { } };",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeTopLevelBytecode(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("TopLevelObjectLiterals.golden"));
}
-
TEST(TryCatch) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
- int closure = Register::function_closure().index();
- int context = Register::current_context().index();
+ const char* snippets[] = {
+ "try { return 1; } catch(e) { return 2; }",
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"try { return 1; } catch(e) { return 2; }",
- 5 * kPointerSize,
- 1,
- 40,
- {
- B(StackCheck), //
- B(Mov), R(context), R(1), //
- B(LdaSmi8), U8(1), //
- B(Return), //
- B(Star), R(3), //
- B(LdaConstant), U8(0), //
- B(Star), R(2), //
- B(Ldar), R(closure), //
- B(Star), R(4), //
- B(CallRuntime), U16(Runtime::kPushCatchContext), R(2), U8(3), //
- B(Star), R(1), //
- B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), //
- /* */ R(0), U8(0), //
- B(Ldar), R(1), //
- B(PushContext), R(0), //
- B(LdaSmi8), U8(2), //
- B(PopContext), R(0), //
- B(Return), //
- // TODO(mstarzinger): Potential optimization, elide next bytes.
- B(LdaUndefined), //
- B(Return), //
- },
- 1,
- {"e"},
- 1,
- {{4, 7, 7}}},
- {"var a; try { a = 1 } catch(e1) {}; try { a = 2 } catch(e2) { a = 3 }",
- 6 * kPointerSize,
- 1,
- 81,
- {
- B(StackCheck), //
- B(Mov), R(context), R(2), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(Jump), U8(30), //
- B(Star), R(4), //
- B(LdaConstant), U8(0), //
- B(Star), R(3), //
- B(Ldar), R(closure), //
- B(Star), R(5), //
- B(CallRuntime), U16(Runtime::kPushCatchContext), R(3), U8(3), //
- B(Star), R(2), //
- B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), //
- /* */ R(0), U8(0), //
- B(Ldar), R(2), //
- B(PushContext), R(1), //
- B(PopContext), R(1), //
- B(Mov), R(context), R(2), //
- B(LdaSmi8), U8(2), //
- B(Star), R(0), //
- B(Jump), U8(34), //
- B(Star), R(4), //
- B(LdaConstant), U8(1), //
- B(Star), R(3), //
- B(Ldar), R(closure), //
- B(Star), R(5), //
- B(CallRuntime), U16(Runtime::kPushCatchContext), R(3), U8(3), //
- B(Star), R(2), //
- B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), //
- /* */ R(0), U8(0), //
- B(Ldar), R(2), //
- B(PushContext), R(1), //
- B(LdaSmi8), U8(3), //
- B(Star), R(0), //
- B(PopContext), R(1), //
- B(LdaUndefined), //
- B(Return), //
- },
- 2,
- {"e1", "e2"},
- 2,
- {{4, 8, 10}, {41, 45, 47}}},
+ "var a;\n"
+ "try { a = 1 } catch(e1) {};\n"
+ "try { a = 2 } catch(e2) { a = 3 }",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("TryCatch.golden"));
}
-
TEST(TryFinally) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
+ const char* snippets[] = {
+ "var a = 1;\n"
+ "try { a = 2; } finally { a = 3; }",
- int closure = Register::function_closure().index();
- int context = Register::current_context().index();
+ "var a = 1;\n"
+ "try { a = 2; } catch(e) { a = 20 } finally { a = 3; }",
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"var a = 1; try { a = 2; } finally { a = 3; }",
- 4 * kPointerSize,
- 1,
- 51,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(Mov), R(context), R(3), //
- B(LdaSmi8), U8(2), //
- B(Star), R(0), //
- B(LdaSmi8), U8(-1), //
- B(Star), R(1), //
- B(Jump), U8(7), //
- B(Star), R(2), //
- B(LdaZero), //
- B(Star), R(1), //
- B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), //
- /* */ R(0), U8(0), //
- B(Star), R(3), //
- B(LdaSmi8), U8(3), //
- B(Star), R(0), //
- B(CallRuntime), U16(Runtime::kInterpreterSetPendingMessage), //
- /* */ R(3), U8(1), //
- B(LdaZero), //
- B(TestEqualStrict), R(1), //
- B(JumpIfTrue), U8(4), //
- B(Jump), U8(5), //
- B(Ldar), R(2), //
- B(ReThrow), //
- B(LdaUndefined), //
- B(Return), //
- },
- 0,
- {},
- 1,
- {{8, 12, 18}}},
- {"var a = 1; try { a = 2; } catch(e) { a = 20 } finally { a = 3; }",
- 9 * kPointerSize,
- 1,
- 88,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(Mov), R(context), R(4), //
- B(Mov), R(context), R(5), //
- B(LdaSmi8), U8(2), //
- B(Star), R(0), //
- B(Jump), U8(34), //
- B(Star), R(7), //
- B(LdaConstant), U8(0), //
- B(Star), R(6), //
- B(Ldar), R(closure), //
- B(Star), R(8), //
- B(CallRuntime), U16(Runtime::kPushCatchContext), R(6), U8(3), //
- B(Star), R(5), //
- B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), //
- /* */ R(0), U8(0), //
- B(Ldar), R(5), //
- B(PushContext), R(1), //
- B(LdaSmi8), U8(20), //
- B(Star), R(0), //
- B(PopContext), R(1), //
- B(LdaSmi8), U8(-1), //
- B(Star), R(2), //
- B(Jump), U8(7), //
- B(Star), R(3), //
- B(LdaZero), //
- B(Star), R(2), //
- B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), //
- /* */ R(0), U8(0), //
- B(Star), R(4), //
- B(LdaSmi8), U8(3), //
- B(Star), R(0), //
- B(CallRuntime), U16(Runtime::kInterpreterSetPendingMessage), //
- /* */ R(4), U8(1), //
- B(LdaZero), //
- B(TestEqualStrict), R(2), //
- B(JumpIfTrue), U8(4), //
- B(Jump), U8(5), //
- B(Ldar), R(3), //
- B(ReThrow), //
- B(LdaUndefined), //
- B(Return), //
- },
- 1,
- {"e"},
- 2,
- {{8, 49, 55}, {11, 15, 17}}},
- {"var a; try {"
- " try { a = 1 } catch(e) { a = 2 }"
- "} catch(e) { a = 20 } finally { a = 3; }",
- 10 * kPointerSize,
- 1,
- 121,
- {
- B(StackCheck), //
- B(Mov), R(context), R(4), //
- B(Mov), R(context), R(5), //
- B(Mov), R(context), R(6), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(Jump), U8(34), //
- B(Star), R(8), //
- B(LdaConstant), U8(0), //
- B(Star), R(7), //
- B(Ldar), R(closure), //
- B(Star), R(9), //
- B(CallRuntime), U16(Runtime::kPushCatchContext), R(7), U8(3), //
- B(Star), R(6), //
- B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), //
- /* */ R(0), U8(0), //
- B(Ldar), R(6), //
- B(PushContext), R(1), //
- B(LdaSmi8), U8(2), //
- B(Star), R(0), //
- B(PopContext), R(1), //
- B(Jump), U8(34), //
- B(Star), R(7), //
- B(LdaConstant), U8(0), //
- B(Star), R(6), //
- B(Ldar), R(closure), //
- B(Star), R(8), //
- B(CallRuntime), U16(Runtime::kPushCatchContext), R(6), U8(3), //
- B(Star), R(5), //
- B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), //
- /* */ R(0), U8(0), //
- B(Ldar), R(5), //
- B(PushContext), R(1), //
- B(LdaSmi8), U8(20), //
- B(Star), R(0), //
- B(PopContext), R(1), //
- B(LdaSmi8), U8(-1), //
- B(Star), R(2), //
- B(Jump), U8(7), //
- B(Star), R(3), //
- B(LdaZero), //
- B(Star), R(2), //
- B(CallRuntime), U16(Runtime::kInterpreterClearPendingMessage), //
- /* */ R(0), U8(0), //
- B(Star), R(4), //
- B(LdaSmi8), U8(3), //
- B(Star), R(0), //
- B(CallRuntime), U16(Runtime::kInterpreterSetPendingMessage), //
- /* */ R(4), U8(1), //
- B(LdaZero), //
- B(TestEqualStrict), R(2), //
- B(JumpIfTrue), U8(4), //
- B(Jump), U8(5), //
- B(Ldar), R(3), //
- B(ReThrow), //
- B(LdaUndefined), //
- B(Return), //
- },
- 1,
- {"e"},
- 3,
- {{4, 82, 88}, {7, 48, 50}, {10, 14, 16}}},
+ "var a; try {\n"
+ " try { a = 1 } catch(e) { a = 2 }\n"
+ "} catch(e) { a = 20 } finally { a = 3; }",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("TryFinally.golden"));
}
-
TEST(Throw) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
+ const char* snippets[] = {
+ "throw 1;",
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"throw 1;",
- 0,
- 1,
- 4,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Throw), //
- },
- 0},
- {"throw 'Error';",
- 0,
- 1,
- 4,
- {
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Throw), //
- },
- 1,
- {"Error"}},
- {"var a = 1; if (a) { throw 'Error'; };",
- 1 * kPointerSize,
- 1,
- 12,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(JumpIfToBooleanFalse), U8(5), //
- B(LdaConstant), U8(0), //
- B(Throw), //
- B(LdaUndefined), //
- B(Return), //
- },
- 1,
- {"Error"}},
+ "throw 'Error';",
+
+ "var a = 1; if (a) { throw 'Error'; };",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("Throw.golden"));
}
-
TEST(CallNew) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
- FeedbackVectorSpec feedback_spec(&zone);
- FeedbackVectorSlot slot1 = feedback_spec.AddGeneralSlot();
- FeedbackVectorSlot slot2 = feedback_spec.AddLoadICSlot();
- USE(slot1);
+ const char* snippets[] = {
+ "function bar() { this.value = 0; }\n"
+ "function f() { return new bar(); }\n"
+ "f();",
- Handle<i::TypeFeedbackVector> vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec);
+ "function bar(x) { this.value = 18; this.x = x;}\n"
+ "function f() { return new bar(3); }\n"
+ "f();",
- // clang-format off
- ExpectedSnippet<InstanceType> snippets[] = {
- {"function bar() { this.value = 0; }\n"
- "function f() { return new bar(); }\n"
- "f()",
- 1 * kPointerSize,
- 1,
- 11,
- {
- B(StackCheck), //
- B(LdaGlobal), U8(0), U8(vector->GetIndex(slot2)), //
- B(Star), R(0), //
- B(New), R(0), R(0), U8(0), //
- B(Return), //
- },
- 1,
- {InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"function bar(x) { this.value = 18; this.x = x;}\n"
- "function f() { return new bar(3); }\n"
- "f()",
- 2 * kPointerSize,
- 1,
- 17,
- {
- B(StackCheck), //
- B(LdaGlobal), U8(0), U8(vector->GetIndex(slot2)), //
- B(Star), R(0), //
- B(LdaSmi8), U8(3), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(New), R(0), R(1), U8(1), //
- B(Return), //
- },
- 1,
- {InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"function bar(w, x, y, z) {\n"
- " this.value = 18;\n"
- " this.x = x;\n"
- " this.y = y;\n"
- " this.z = z;\n"
- "}\n"
- "function f() { return new bar(3, 4, 5); }\n"
- "f()",
- 4 * kPointerSize,
- 1,
- 25,
- {
- B(StackCheck), //
- B(LdaGlobal), U8(0), U8(vector->GetIndex(slot2)), //
- B(Star), R(0), //
- B(LdaSmi8), U8(3), //
- B(Star), R(1), //
- B(LdaSmi8), U8(4), //
- B(Star), R(2), //
- B(LdaSmi8), U8(5), //
- B(Star), R(3), //
- B(Ldar), R(0), //
- B(New), R(0), R(1), U8(3), //
- B(Return), //
- },
- 1,
- {InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
+ "function bar(w, x, y, z) {\n"
+ " this.value = 18;\n"
+ " this.x = x;\n"
+ " this.y = y;\n"
+ " this.z = z;\n"
+ "}\n"
+ "function f() { return new bar(3, 4, 5); }\n"
+ "f();",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecode(snippets[i].code_snippet, "f");
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("CallNew.golden"));
}
-
TEST(ContextVariables) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
-
- FeedbackVectorSpec feedback_spec(&zone);
- FeedbackVectorSlot slot = feedback_spec.AddCallICSlot();
-
- Handle<i::TypeFeedbackVector> vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec);
-
- int closure = Register::function_closure().index();
- int context = Register::current_context().index();
- int new_target = Register::new_target().index();
- int first_context_slot = Context::MIN_CONTEXT_SLOTS;
-
// The wide check below relies on MIN_CONTEXT_SLOTS + 3 + 249 == 256, if this
// ever changes, the REPEAT_XXX should be changed to output the correct number
// of unique variables to trigger the wide slot load / store.
STATIC_ASSERT(Context::MIN_CONTEXT_SLOTS + 3 + 249 == 256);
- int wide_slot = first_context_slot + 3;
- // clang-format off
- ExpectedSnippet<InstanceType> snippets[] = {
- {"var a; return function() { a = 1; };",
- 1 * kPointerSize,
- 1,
- 12,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), //
- /* */ R(closure), U8(1), //
- B(PushContext), R(0), //
- B(StackCheck), //
- B(CreateClosure), U8(0), U8(0), //
- B(Return), //
- },
- 1,
- {InstanceType::SHARED_FUNCTION_INFO_TYPE}},
- {"var a = 1; return function() { a = 2; };",
- 1 * kPointerSize,
- 1,
- 17,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), //
- /* */ R(closure), U8(1), //
- B(PushContext), R(0), //
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(CreateClosure), U8(0), U8(0), //
- B(Return), //
- },
- 1,
- {InstanceType::SHARED_FUNCTION_INFO_TYPE}},
- {"var a = 1; var b = 2; return function() { a = 2; b = 3 };",
- 1 * kPointerSize,
- 1,
- 22,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), //
- /* */ R(closure), U8(1), //
- B(PushContext), R(0), //
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(LdaSmi8), U8(2), //
- B(StaContextSlot), R(context), U8(first_context_slot + 1), //
- B(CreateClosure), U8(0), U8(0), //
- B(Return), //
- },
- 1,
- {InstanceType::SHARED_FUNCTION_INFO_TYPE}},
- {"var a; (function() { a = 2; })(); return a;",
- 3 * kPointerSize,
- 1,
- 25,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), //
- /* */ R(closure), U8(1), //
- B(PushContext), R(0), //
- B(StackCheck), //
- B(LdaUndefined), //
- B(Star), R(2), //
- B(CreateClosure), U8(0), U8(0), //
- B(Star), R(1), //
- B(Call), R(1), R(2), U8(1), U8(vector->GetIndex(slot)), //
- B(LdaContextSlot), R(context), U8(first_context_slot), //
- B(Return), //
- },
- 1,
- {InstanceType::SHARED_FUNCTION_INFO_TYPE}},
- {"'use strict'; let a = 1; { let b = 2; return function() { a + b; }; }",
- 4 * kPointerSize,
- 1,
- 47,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), //
- /* */ R(closure), U8(1), //
- B(PushContext), R(0), //
- B(LdaTheHole), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(LdaConstant), U8(0), //
- B(Star), R(2), //
- B(Ldar), R(closure), //
- B(Star), R(3), //
- B(CallRuntime), U16(Runtime::kPushBlockContext), R(2), U8(2), //
- B(PushContext), R(1), //
- B(LdaTheHole), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(LdaSmi8), U8(2), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(CreateClosure), U8(1), U8(0), //
- B(PopContext), R(0), //
- B(Return), //
- },
- 2,
- {InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::SHARED_FUNCTION_INFO_TYPE}},
- {"'use strict';\n"
- REPEAT_249_UNIQUE_VARS()
- "eval();"
- "var b = 100;"
- "return b",
- 3 * kPointerSize,
- 1,
- 1042,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), //
- /* */ U8(1), //
- B(PushContext), R(0), //
- B(Ldar), THIS(1), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(CreateUnmappedArguments), //
- B(StaContextSlot), R(context), U8(first_context_slot + 1), //
- B(Ldar), R(new_target), //
- B(StaContextSlot), R(context), U8(first_context_slot + 2), //
- B(StackCheck), //
- REPEAT_249(COMMA, //
- B(LdaZero), //
- B(StaContextSlot), R(context), U8(wide_slot++)), //
- B(LdaUndefined), //
- B(Star), R(2), //
- B(LdaGlobal), U8(0), U8(1), //
- B(Star), R(1), //
- B(Call), R(1), R(2), U8(1), U8(0), //
- B(LdaSmi8), U8(100), //
- B(StaContextSlotWide), R(context), U16(256), //
- B(LdaContextSlotWide), R(context), U16(256), //
- B(Return), //
- },
- 1,
- {InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
+ const char* snippets[] = {
+ "var a; return function() { a = 1; };",
+
+ "var a = 1; return function() { a = 2; };",
+
+ "var a = 1; var b = 2; return function() { a = 2; b = 3 };",
+
+ "var a; (function() { a = 2; })(); return a;",
+
+ "'use strict';\n"
+ "let a = 1;\n"
+ "{ let b = 2; return function() { a + b; }; }",
+
+ "'use strict';\n"
+ REPEAT_249_UNIQUE_VARS()
+ "eval();\n"
+ "var b = 100;\n"
+ "return b",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("ContextVariables.golden"));
}
-
TEST(ContextParameters) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
- int closure = Register::function_closure().index();
- int context = Register::current_context().index();
- int first_context_slot = Context::MIN_CONTEXT_SLOTS;
+ const char* snippets[] = {
+ "function f(arg1) { return function() { arg1 = 2; }; }",
- // clang-format off
- ExpectedSnippet<InstanceType> snippets[] = {
- {"function f(arg1) { return function() { arg1 = 2; }; }",
- 1 * kPointerSize,
- 2,
- 17,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), //
- /* */ R(closure), U8(1), //
- B(PushContext), R(0), //
- B(Ldar), R(helper.kLastParamIndex), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(StackCheck), //
- B(CreateClosure), U8(0), U8(0), //
- B(Return), //
- },
- 1,
- {InstanceType::SHARED_FUNCTION_INFO_TYPE}},
- {"function f(arg1) { var a = function() { arg1 = 2; }; return arg1; }",
- 2 * kPointerSize,
- 2,
- 22,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), //
- /* */ R(closure), U8(1), //
- B(PushContext), R(1), //
- B(Ldar), R(helper.kLastParamIndex), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(StackCheck), //
- B(CreateClosure), U8(0), U8(0), //
- B(Star), R(0), //
- B(LdaContextSlot), R(context), U8(first_context_slot), //
- B(Return), //
- },
- 1,
- {InstanceType::SHARED_FUNCTION_INFO_TYPE}},
- {"function f(a1, a2, a3, a4) { return function() { a1 = a3; }; }",
- 1 * kPointerSize,
- 5,
- 22,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), //
- /* */ R(closure), U8(1), //
- B(PushContext), R(0), //
- B(Ldar), R(helper.kLastParamIndex - 3), //
- B(StaContextSlot), R(context), U8(first_context_slot + 1), //
- B(Ldar), R(helper.kLastParamIndex -1), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(StackCheck), //
- B(CreateClosure), U8(0), U8(0), //
- B(Return), //
- },
- 1,
- {InstanceType::SHARED_FUNCTION_INFO_TYPE}},
- {"function f() { var self = this; return function() { self = 2; }; }",
- 1 * kPointerSize,
- 1,
- 17,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), //
- /* */ R(closure), U8(1), //
- B(PushContext), R(0), //
- B(StackCheck), //
- B(Ldar), R(helper.kLastParamIndex), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(CreateClosure), U8(0), U8(0), //
- B(Return), //
- },
- 1,
- {InstanceType::SHARED_FUNCTION_INFO_TYPE}},
+ "function f(arg1) { var a = function() { arg1 = 2; }; return arg1; }",
+
+ "function f(a1, a2, a3, a4) { return function() { a1 = a3; }; }",
+
+ "function f() { var self = this; return function() { self = 2; }; }",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunction(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets, "", "\nf();"),
+ LoadGolden("ContextParameters.golden"));
}
-
TEST(OuterContextVariables) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
- int context = Register::current_context().index();
- int first_context_slot = Context::MIN_CONTEXT_SLOTS;
+ const char* snippets[] = {
+ "function Outer() {\n"
+ " var outerVar = 1;\n"
+ " function Inner(innerArg) {\n"
+ " this.innerFunc = function() { return outerVar * innerArg; }\n"
+ " }\n"
+ " this.getInnerFunc = function() { return new Inner(1).innerFunc; }\n"
+ "}\n"
+ "var f = new Outer().getInnerFunc();",
- // clang-format off
- ExpectedSnippet<InstanceType> snippets[] = {
- {"function Outer() {"
- " var outerVar = 1;"
- " function Inner(innerArg) {"
- " this.innerFunc = function() { return outerVar * innerArg; }"
- " }"
- " this.getInnerFunc = function() { return new Inner(1).innerFunc; }"
- "}"
- "var f = new Outer().getInnerFunc();",
- 2 * kPointerSize,
- 1,
- 21,
- {
- B(StackCheck), //
- B(Ldar), R(context), //
- B(Star), R(0), //
- B(LdaContextSlot), R(0), U8(Context::PREVIOUS_INDEX), //
- B(Star), R(0), //
- B(LdaContextSlot), R(0), U8(first_context_slot), //
- B(Star), R(1), //
- B(LdaContextSlot), R(context), U8(first_context_slot), //
- B(Mul), R(1), //
- B(Return), //
- }},
- {"function Outer() {"
- " var outerVar = 1;"
- " function Inner(innerArg) {"
- " this.innerFunc = function() { outerVar = innerArg; }"
- " }"
- " this.getInnerFunc = function() { return new Inner(1).innerFunc; }"
- "}"
- "var f = new Outer().getInnerFunc();",
- 2 * kPointerSize,
- 1,
- 22,
- {
- B(StackCheck), //
- B(LdaContextSlot), R(context), U8(first_context_slot), //
- B(Star), R(0), //
- B(Ldar), R(context), //
- B(Star), R(1), //
- B(LdaContextSlot), R(1), U8(Context::PREVIOUS_INDEX), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(StaContextSlot), R(1), U8(first_context_slot), //
- B(LdaUndefined), //
- B(Return), //
- }},
+ "function Outer() {\n"
+ " var outerVar = 1;\n"
+ " function Inner(innerArg) {\n"
+ " this.innerFunc = function() { outerVar = innerArg; }\n"
+ " }\n"
+ " this.getInnerFunc = function() { return new Inner(1).innerFunc; }\n"
+ "}\n"
+ "var f = new Outer().getInnerFunc();",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionNoFilter(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets, "", "\nf();"),
+ LoadGolden("OuterContextVariables.golden"));
}
-
TEST(CountOperators) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
+ const char* snippets[] = {
+ "var a = 1; return ++a;",
- FeedbackVectorSpec feedback_spec(&zone);
- FeedbackVectorSlot slot1 = feedback_spec.AddLoadICSlot();
- FeedbackVectorSlot slot2 = feedback_spec.AddStoreICSlot();
- Handle<i::TypeFeedbackVector> vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec);
+ "var a = 1; return a++;",
- FeedbackVectorSpec store_feedback_spec(&zone);
- FeedbackVectorSlot store_slot = store_feedback_spec.AddStoreICSlot();
- Handle<i::TypeFeedbackVector> store_vector =
- i::NewTypeFeedbackVector(helper.isolate(), &store_feedback_spec);
+ "var a = 1; return --a;",
- int closure = Register::function_closure().index();
- int context = Register::current_context().index();
- int first_context_slot = Context::MIN_CONTEXT_SLOTS;
+ "var a = 1; return a--;",
- int object_literal_flags =
- ObjectLiteral::kFastElements | ObjectLiteral::kDisableMementos;
- int array_literal_flags =
- ArrayLiteral::kDisableMementos | ArrayLiteral::kShallowElements;
+ "var a = { val: 1 }; return a.val++;",
- // clang-format off
- ExpectedSnippet<InstanceType> snippets[] = {
- {"var a = 1; return ++a;",
- 1 * kPointerSize,
- 1,
- 10,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(ToNumber), //
- B(Inc), //
- B(Star), R(0), //
- B(Return), //
- }},
- {"var a = 1; return a++;",
- 2 * kPointerSize,
- 1,
- 14,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(ToNumber), //
- B(Star), R(1), //
- B(Inc), //
- B(Star), R(0), //
- B(Ldar), R(1), //
- B(Return), //
- }},
- {"var a = 1; return --a;",
- 1 * kPointerSize,
- 1,
- 10,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(ToNumber), //
- B(Dec), //
- B(Star), R(0), //
- B(Return), //
- }},
- {"var a = 1; return a--;",
- 2 * kPointerSize,
- 1,
- 14,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(ToNumber), //
- B(Star), R(1), //
- B(Dec), //
- B(Star), R(0), //
- B(Ldar), R(1), //
- B(Return), //
- }},
- {"var a = { val: 1 }; return a.val++;",
- 3 * kPointerSize,
- 1,
- 26,
- {
- B(StackCheck), //
- B(CreateObjectLiteral), U8(0), U8(0), U8(object_literal_flags), //
- B(Star), R(1), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LoadIC), R(1), U8(1), U8(vector->GetIndex(slot1)), //
- B(ToNumber), //
- B(Star), R(2), //
- B(Inc), //
- B(StoreICSloppy), R(1), U8(1), U8(vector->GetIndex(slot2)), //
- B(Ldar), R(2), //
- B(Return), //
- },
- 2,
- {InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"var a = { val: 1 }; return --a.val;",
- 2 * kPointerSize,
- 1,
- 22,
- {
- B(StackCheck), //
- B(CreateObjectLiteral), U8(0), U8(0), U8(object_literal_flags), //
- B(Star), R(1), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LoadIC), R(1), U8(1), U8(vector->GetIndex(slot1)), //
- B(ToNumber), //
- B(Dec), //
- B(StoreICSloppy), R(1), U8(1), U8(vector->GetIndex(slot2)), //
- B(Return), //
- },
- 2,
- {InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"var name = 'var'; var a = { val: 1 }; return a[name]--;",
- 5 * kPointerSize,
- 1,
- 33,
- {
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Star), R(0), //
- B(CreateObjectLiteral), U8(1), U8(0), U8(object_literal_flags), //
- B(Star), R(2), //
- B(Star), R(1), //
- B(Star), R(2), //
- B(Ldar), R(0), //
- B(Star), R(3), //
- B(KeyedLoadIC), R(2), U8(vector->GetIndex(slot1)), //
- B(ToNumber), //
- B(Star), R(4), //
- B(Dec), //
- B(KeyedStoreICSloppy), R(2), R(3), U8(vector->GetIndex(slot2)), //
- B(Ldar), R(4), //
- B(Return), //
- },
- 2,
- {InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::FIXED_ARRAY_TYPE}},
- {"var name = 'var'; var a = { val: 1 }; return ++a[name];",
- 4 * kPointerSize,
- 1,
- 29,
- {
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Star), R(0), //
- B(CreateObjectLiteral), U8(1), U8(0), U8(object_literal_flags), //
- B(Star), R(2), //
- B(Star), R(1), //
- B(Star), R(2), //
- B(Ldar), R(0), //
- B(Star), R(3), //
- B(KeyedLoadIC), R(2), U8(vector->GetIndex(slot1)), //
- B(ToNumber), //
- B(Inc), //
- B(KeyedStoreICSloppy), R(2), R(3), U8(vector->GetIndex(slot2)), //
- B(Return), //
- },
- 2,
- {InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::FIXED_ARRAY_TYPE}},
- {"var a = 1; var b = function() { return a }; return ++a;",
- 2 * kPointerSize,
- 1,
- 27,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), //
- /* */ U8(1), //
- B(PushContext), R(1), //
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(CreateClosure), U8(0), U8(0), //
- B(Star), R(0), //
- B(LdaContextSlot), R(context), U8(first_context_slot), //
- B(ToNumber), //
- B(Inc), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(Return), //
- },
- 1,
- {InstanceType::SHARED_FUNCTION_INFO_TYPE}},
- {"var a = 1; var b = function() { return a }; return a--;",
- 3 * kPointerSize,
- 1,
- 31,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), //
- /* */ U8(1), //
- B(PushContext), R(1), //
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(CreateClosure), U8(0), U8(0), //
- B(Star), R(0), //
- B(LdaContextSlot), R(context), U8(first_context_slot), //
- B(ToNumber), //
- B(Star), R(2), //
- B(Dec), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(Ldar), R(2), //
- B(Return), //
- },
- 1,
- {InstanceType::SHARED_FUNCTION_INFO_TYPE}},
- {"var idx = 1; var a = [1, 2]; return a[idx++] = 2;",
- 4 * kPointerSize,
- 1,
- 28,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(CreateArrayLiteral), U8(0), U8(0), U8(array_literal_flags), //
- B(Star), R(1), //
- B(Star), R(2), //
- B(Ldar), R(0), //
- B(ToNumber), //
- B(Star), R(3), //
- B(Inc), //
- B(Star), R(0), //
- B(LdaSmi8), U8(2), //
- B(KeyedStoreICSloppy), R(2), R(3), //
- /* */ U8(store_vector->GetIndex(store_slot)), //
- B(Return), //
- },
- 1,
- {InstanceType::FIXED_ARRAY_TYPE}},
+ "var a = { val: 1 }; return --a.val;",
+
+ "var name = 'var'; var a = { val: 1 }; return a[name]--;",
+
+ "var name = 'var'; var a = { val: 1 }; return ++a[name];",
+
+ "var a = 1; var b = function() { return a }; return ++a;",
+
+ "var a = 1; var b = function() { return a }; return a--;",
+
+ "var idx = 1; var a = [1, 2]; return a[idx++] = 2;",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("CountOperators.golden"));
}
-
TEST(GlobalCountOperators) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
- FeedbackVectorSpec feedback_spec(&zone);
- FeedbackVectorSlot slot1 = feedback_spec.AddLoadICSlot();
- FeedbackVectorSlot slot2 = feedback_spec.AddStoreICSlot();
+ const char* snippets[] = {
+ "var global = 1;\n"
+ "function f() { return ++global; }\n"
+ "f();",
- Handle<i::TypeFeedbackVector> vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec);
+ "var global = 1;\n"
+ "function f() { return global--; }\n"
+ "f();",
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"var global = 1;\nfunction f() { return ++global; }\nf()",
- 0,
- 1,
- 10,
- {
- B(StackCheck), //
- B(LdaGlobal), U8(0), U8(vector->GetIndex(slot1)), //
- B(ToNumber), //
- B(Inc), //
- B(StaGlobalSloppy), U8(0), U8(vector->GetIndex(slot2)), //
- B(Return), //
- },
- 1,
- {"global"}},
- {"var global = 1;\nfunction f() { return global--; }\nf()",
- 1 * kPointerSize,
- 1,
- 14,
- {
- B(StackCheck), //
- B(LdaGlobal), U8(0), U8(vector->GetIndex(slot1)), //
- B(ToNumber), //
- B(Star), R(0), //
- B(Dec), //
- B(StaGlobalSloppy), U8(0), U8(vector->GetIndex(slot2)), //
- B(Ldar), R(0), //
- B(Return),
- },
- 1,
- {"global"}},
- {"unallocated = 1;\nfunction f() { 'use strict'; return --unallocated; }"
- "f()",
- 0,
- 1,
- 10,
- {
- B(StackCheck), //
- B(LdaGlobal), U8(0), U8(vector->GetIndex(slot1)), //
- B(ToNumber), //
- B(Dec), //
- B(StaGlobalStrict), U8(0), U8(vector->GetIndex(slot2)), //
- B(Return), //
- },
- 1,
- {"unallocated"}},
- {"unallocated = 1;\nfunction f() { return unallocated++; }\nf()",
- 1 * kPointerSize,
- 1,
- 14,
- {
- B(StackCheck), //
- B(LdaGlobal), U8(0), U8(vector->GetIndex(slot1)), //
- B(ToNumber), //
- B(Star), R(0), //
- B(Inc), //
- B(StaGlobalSloppy), U8(0), U8(vector->GetIndex(slot2)), //
- B(Ldar), R(0), //
- B(Return),
- },
- 1,
- {"unallocated"}},
+ "unallocated = 1;\n"
+ "function f() { 'use strict'; return --unallocated; }\n"
+ "f();",
+
+ "unallocated = 1;\n"
+ "function f() { return unallocated++; }\n"
+ "f();",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecode(snippets[i].code_snippet, "f");
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("GlobalCountOperators.golden"));
}
-
TEST(CompoundExpressions) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
+ const char* snippets[] = {
+ "var a = 1; a += 2;",
- int closure = Register::function_closure().index();
- int context = Register::current_context().index();
- int first_context_slot = Context::MIN_CONTEXT_SLOTS;
+ "var a = 1; a /= 2;",
- FeedbackVectorSpec feedback_spec(&zone);
- FeedbackVectorSlot slot1 = feedback_spec.AddLoadICSlot();
- FeedbackVectorSlot slot2 = feedback_spec.AddStoreICSlot();
+ "var a = { val: 2 }; a.name *= 2;",
- Handle<i::TypeFeedbackVector> vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec);
+ "var a = { 1: 2 }; a[1] ^= 2;",
- int object_literal_flags =
- ObjectLiteral::kFastElements | ObjectLiteral::kDisableMementos;
-
- // clang-format off
- ExpectedSnippet<InstanceType> snippets[] = {
- {"var a = 1; a += 2;",
- 2 * kPointerSize,
- 1,
- 15,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(2), //
- B(Add), R(1), //
- B(Star), R(0), //
- B(LdaUndefined), //
- B(Return), //
- }},
- {"var a = 1; a /= 2;",
- 2 * kPointerSize,
- 1,
- 15,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(2), //
- B(Div), R(1), //
- B(Star), R(0), //
- B(LdaUndefined), //
- B(Return), //
- }},
- {"var a = { val: 2 }; a.name *= 2;",
- 3 * kPointerSize,
- 1,
- 27,
- {
- B(StackCheck), //
- B(CreateObjectLiteral), U8(0), U8(0), U8(object_literal_flags), //
- B(Star), R(1), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LoadIC), R(1), U8(1), U8(vector->GetIndex(slot1)), //
- B(Star), R(2), //
- B(LdaSmi8), U8(2), //
- B(Mul), R(2), //
- B(StoreICSloppy), R(1), U8(1), U8(vector->GetIndex(slot2)), //
- B(LdaUndefined), //
- B(Return), //
- },
- 2,
- {InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"var a = { 1: 2 }; a[1] ^= 2;",
- 4 * kPointerSize,
- 1,
- 30,
- {
- B(StackCheck), //
- B(CreateObjectLiteral), U8(0), U8(0), U8(object_literal_flags), //
- B(Star), R(1), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(1), //
- B(Star), R(2), //
- B(KeyedLoadIC), R(1), U8(vector->GetIndex(slot1)), //
- B(Star), R(3), //
- B(LdaSmi8), U8(2), //
- B(BitwiseXor), R(3), //
- B(KeyedStoreICSloppy), R(1), R(2), U8(vector->GetIndex(slot2)), //
- B(LdaUndefined), //
- B(Return), //
- },
- 1,
- {InstanceType::FIXED_ARRAY_TYPE}},
- {"var a = 1; (function f() { return a; }); a |= 24;",
- 2 * kPointerSize,
- 1,
- 30,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), //
- /* */ U8(1), //
- B(PushContext), R(0), //
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(CreateClosure), U8(0), U8(0), //
- B(LdaContextSlot), R(context), U8(first_context_slot), //
- B(Star), R(1), //
- B(LdaSmi8), U8(24), //
- B(BitwiseOr), R(1), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(LdaUndefined), //
- B(Return), //
- },
- 1,
- {InstanceType::SHARED_FUNCTION_INFO_TYPE}},
+ "var a = 1; (function f() { return a; }); a |= 24;",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("CompoundExpressions.golden"));
}
-
TEST(GlobalCompoundExpressions) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
- FeedbackVectorSpec feedback_spec(&zone);
- FeedbackVectorSlot slot1 = feedback_spec.AddLoadICSlot();
- FeedbackVectorSlot slot2 = feedback_spec.AddStoreICSlot();
+ const char* snippets[] = {
+ "var global = 1;\n"
+ "function f() { return global &= 1; }\n"
+ "f();",
- Handle<i::TypeFeedbackVector> vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec);
-
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"var global = 1;\nfunction f() { return global &= 1; }\nf()",
- 1 * kPointerSize,
- 1,
- 14,
- {
- B(StackCheck), //
- B(LdaGlobal), U8(0), U8(vector->GetIndex(slot1)), //
- B(Star), R(0), //
- B(LdaSmi8), U8(1), //
- B(BitwiseAnd), R(0), //
- B(StaGlobalSloppy), U8(0), U8(vector->GetIndex(slot2)), //
- B(Return), //
- },
- 1,
- {"global"}},
- {"unallocated = 1;\nfunction f() { return unallocated += 1; }\nf()",
- 1 * kPointerSize,
- 1,
- 14,
- {
- B(StackCheck), //
- B(LdaGlobal), U8(0), U8(vector->GetIndex(slot1)), //
- B(Star), R(0), //
- B(LdaSmi8), U8(1), //
- B(Add), R(0), //
- B(StaGlobalSloppy), U8(0), U8(vector->GetIndex(slot2)), //
- B(Return), //
- },
- 1,
- {"unallocated"}},
+ "unallocated = 1;\n"
+ "function f() { return unallocated += 1; }\n"
+ "f();",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecode(snippets[i].code_snippet, "f");
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("GlobalCompoundExpressions.golden"));
}
-
TEST(CreateArguments) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
- int closure = Register::function_closure().index();
- int context = Register::current_context().index();
- int first_context_slot = Context::MIN_CONTEXT_SLOTS;
+ const char* snippets[] = {
+ "function f() { return arguments; }",
- FeedbackVectorSpec feedback_spec(&zone);
- FeedbackVectorSlot slot = feedback_spec.AddKeyedLoadICSlot();
+ "function f() { return arguments[0]; }",
- Handle<i::TypeFeedbackVector> vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec);
+ "function f() { 'use strict'; return arguments; }",
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"function f() { return arguments; }",
- 1 * kPointerSize,
- 1,
- 7,
- {
- B(CreateMappedArguments), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Return), //
- }},
- {"function f() { return arguments[0]; }",
- 2 * kPointerSize,
- 1,
- 13,
- {
- B(CreateMappedArguments), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaZero), //
- B(KeyedLoadIC), R(1), U8(vector->GetIndex(slot)), //
- B(Return), //
- }},
- {"function f() { 'use strict'; return arguments; }",
- 1 * kPointerSize,
- 1,
- 7,
- {
- B(CreateUnmappedArguments), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Return), //
- }},
- {"function f(a) { return arguments[0]; }",
- 3 * kPointerSize,
- 2,
- 25,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), //
- /* */ U8(1), //
- B(PushContext), R(1), //
- B(Ldar), R(BytecodeGeneratorHelper::kLastParamIndex), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(CreateMappedArguments), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(LdaZero), //
- B(KeyedLoadIC), R(2), U8(vector->GetIndex(slot)), //
- B(Return), //
- }},
- {"function f(a, b, c) { return arguments; }",
- 2 * kPointerSize,
- 4,
- 29,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), //
- /* */ U8(1), //
- B(PushContext), R(1), //
- B(Ldar), R(BytecodeGeneratorHelper::kLastParamIndex - 2), //
- B(StaContextSlot), R(context), U8(first_context_slot + 2), //
- B(Ldar), R(BytecodeGeneratorHelper::kLastParamIndex - 1), //
- B(StaContextSlot), R(context), U8(first_context_slot + 1), //
- B(Ldar), R(BytecodeGeneratorHelper::kLastParamIndex), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(CreateMappedArguments), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Return), //
- }},
- {"function f(a, b, c) { 'use strict'; return arguments; }",
- 1 * kPointerSize,
- 4,
- 7,
- {
- B(CreateUnmappedArguments), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Return), //
- }},
+ "function f(a) { return arguments[0]; }",
+
+ "function f(a, b, c) { return arguments; }",
+
+ "function f(a, b, c) { 'use strict'; return arguments; }",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunction(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets, "", "\nf();"),
+ LoadGolden("CreateArguments.golden"));
}
TEST(CreateRestParameter) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kNumber);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
- FeedbackVectorSpec feedback_spec(&zone);
- FeedbackVectorSlot slot = feedback_spec.AddKeyedLoadICSlot();
- FeedbackVectorSlot slot1 = feedback_spec.AddKeyedLoadICSlot();
+ const char* snippets[] = {
+ "function f(...restArgs) { return restArgs; }",
- Handle<i::TypeFeedbackVector> vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec);
+ "function f(a, ...restArgs) { return restArgs; }",
- // clang-format off
- ExpectedSnippet<int> snippets[] = {
- {"function f(...restArgs) { return restArgs; }",
- 1 * kPointerSize,
- 1,
- 7,
- {
- B(CreateRestParameter), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Return), //
- },
- 0,
- {}},
- {"function f(a, ...restArgs) { return restArgs; }",
- 2 * kPointerSize,
- 2,
- 14,
- {
- B(CreateRestParameter), //
- B(Star), R(0), //
- B(LdaTheHole), //
- B(Star), R(1), //
- B(StackCheck), //
- B(Ldar), A(1, 2), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(Return), //
- },
- 0,
- {}},
- {"function f(a, ...restArgs) { return restArgs[0]; }",
- 3 * kPointerSize,
- 2,
- 20,
- {
- B(CreateRestParameter), //
- B(Star), R(0), //
- B(LdaTheHole), //
- B(Star), R(1), //
- B(StackCheck), //
- B(Ldar), A(1, 2), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(LdaZero), //
- B(KeyedLoadIC), R(2), U8(vector->GetIndex(slot)), //
- B(Return), //
- },
- 0,
- {}},
- {"function f(a, ...restArgs) { return restArgs[0] + arguments[0]; }",
- 5 * kPointerSize,
- 2,
- 35,
- {
- B(CreateUnmappedArguments), //
- B(Star), R(0), //
- B(CreateRestParameter), //
- B(Star), R(1), //
- B(LdaTheHole), //
- B(Star), R(2), //
- B(StackCheck), //
- B(Ldar), A(1, 2), //
- B(Star), R(2), //
- B(Ldar), R(1), //
- B(Star), R(3), //
- B(LdaZero), //
- B(KeyedLoadIC), R(3), U8(vector->GetIndex(slot)), //
- B(Star), R(4), //
- B(Ldar), R(0), //
- B(Star), R(3), //
- B(LdaZero), //
- B(KeyedLoadIC), R(3), U8(vector->GetIndex(slot1)), //
- B(Add), R(4), //
- B(Return), //
- },
- 0,
- {}},
+ "function f(a, ...restArgs) { return restArgs[0]; }",
+
+ "function f(a, ...restArgs) { return restArgs[0] + arguments[0]; }",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunction(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets, "", "\nf();"),
+ LoadGolden("CreateRestParameter.golden"));
}
-TEST(IllegalRedeclaration) {
- bool old_legacy_const_flag = FLAG_legacy_const;
- FLAG_legacy_const = true;
-
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
-
- CHECK_GE(MessageTemplate::kVarRedeclaration, 128);
- // Must adapt bytecode if this changes.
-
- // clang-format off
- ExpectedSnippet<Handle<Object>, 2> snippets[] = {
- {"const a = 1; { var a = 2; }",
- 3 * kPointerSize,
- 1,
- 14,
- {
- B(LdaConstant), U8(0), //
- B(Star), R(1), //
- B(LdaConstant), U8(1), //
- B(Star), R(2), //
- B(CallRuntime), U16(Runtime::kNewSyntaxError), R(1), U8(2), //
- B(Throw), //
- },
- 2,
- {helper.factory()->NewNumberFromInt(MessageTemplate::kVarRedeclaration),
- helper.factory()->NewStringFromAsciiChecked("a")}},
- };
- // clang-format on
-
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
-
- FLAG_legacy_const = old_legacy_const_flag;
-}
-
-
TEST(ForIn) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
+ const char* snippets[] = {
+ "for (var p in null) {}",
- int simple_flags =
- ArrayLiteral::kDisableMementos | ArrayLiteral::kShallowElements;
- int deep_elements_flags =
- ObjectLiteral::kFastElements | ObjectLiteral::kDisableMementos;
+ "for (var p in undefined) {}",
- FeedbackVectorSpec feedback_spec(&zone);
- feedback_spec.AddStoreICSlot();
- FeedbackVectorSlot slot2 = feedback_spec.AddStoreICSlot();
- FeedbackVectorSlot slot3 = feedback_spec.AddStoreICSlot();
- FeedbackVectorSlot slot4 = feedback_spec.AddStoreICSlot();
- Handle<i::TypeFeedbackVector> vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec);
+ "for (var p in undefined) {}",
- // clang-format off
- ExpectedSnippet<InstanceType> snippets[] = {
- {"for (var p in null) {}",
- 2 * kPointerSize,
- 1,
- 3,
- {
- B(StackCheck), //
- B(LdaUndefined), //
- B(Return) //
- },
- 0},
- {"for (var p in undefined) {}",
- 2 * kPointerSize,
- 1,
- 3,
- {
- B(StackCheck), //
- B(LdaUndefined), //
- B(Return) //
- },
- 0},
- {"for (var p in undefined) {}",
- 2 * kPointerSize,
- 1,
- 3,
- {
- B(StackCheck), //
- B(LdaUndefined), //
- B(Return) //
- },
- 0},
- {"var x = 'potatoes';\n"
- "for (var p in x) { return p; }",
- 8 * kPointerSize,
- 1,
- 46,
- {
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Star), R(1), //
- B(JumpIfUndefined), U8(39), //
- B(JumpIfNull), U8(37), //
- B(ToObject), //
- B(JumpIfNull), U8(34), //
- B(Star), R(3), //
- B(ForInPrepare), R(4), //
- B(LdaZero), //
- B(Star), R(7), //
- B(ForInDone), R(7), R(6), //
- B(JumpIfTrue), U8(22), //
- B(ForInNext), R(3), R(7), R(4), //
- B(JumpIfUndefined), U8(10), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(Return), //
- B(ForInStep), R(7), //
- B(Star), R(7), //
- B(Jump), U8(-23), //
- B(LdaUndefined), //
- B(Return), //
- },
- 1,
- {InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"var x = 0;\n"
- "for (var p in [1,2,3]) { x += p; }",
- 9 * kPointerSize,
- 1,
- 58,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(1), //
- B(CreateArrayLiteral), U8(0), U8(0), U8(3), //
- B(JumpIfUndefined), U8(48), //
- B(JumpIfNull), U8(46), //
- B(ToObject), //
- B(JumpIfNull), U8(43), //
- B(Star), R(3), //
- B(ForInPrepare), R(4), //
- B(LdaZero), //
- B(Star), R(7), //
- B(ForInDone), R(7), R(6), //
- B(JumpIfTrue), U8(31), //
- B(ForInNext), R(3), R(7), R(4), //
- B(JumpIfUndefined), U8(19), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(Ldar), R(1), //
- B(Star), R(8), //
- B(Ldar), R(2), //
- B(Add), R(8), //
- B(Star), R(1), //
- B(ForInStep), R(7), //
- B(Star), R(7), //
- B(Jump), U8(-32), //
- B(LdaUndefined), //
- B(Return), //
- },
- 1,
- {InstanceType::FIXED_ARRAY_TYPE}},
- {"var x = { 'a': 1, 'b': 2 };\n"
- "for (x['a'] in [10, 20, 30]) {\n"
- " if (x['a'] == 10) continue;\n"
- " if (x['a'] == 20) break;\n"
- "}",
- 8 * kPointerSize,
- 1,
- 95,
- {
- B(StackCheck), //
- B(CreateObjectLiteral), U8(0), U8(0), U8(deep_elements_flags), //
- B(Star), R(1), //
- B(Star), R(0), //
- B(CreateArrayLiteral), U8(1), U8(1), U8(simple_flags), //
- B(JumpIfUndefined), U8(80), //
- B(JumpIfNull), U8(78), //
- B(ToObject), //
- B(JumpIfNull), U8(75), //
- B(Star), R(1), //
- B(ForInPrepare), R(2), //
- B(LdaZero), //
- B(Star), R(5), //
- B(ForInDone), R(5), R(4), //
- B(JumpIfTrue), U8(63), //
- B(ForInNext), R(1), R(5), R(2), //
- B(JumpIfUndefined), U8(51), //
- B(Star), R(6), //
- B(Ldar), R(0), //
- B(Star), R(7), //
- B(Ldar), R(6), //
- B(StoreICSloppy), R(7), U8(2), U8(vector->GetIndex(slot4)), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Star), R(6), //
- B(LoadIC), R(6), U8(2), U8(vector->GetIndex(slot2)), //
- B(Star), R(7), //
- B(LdaSmi8), U8(10), //
- B(TestEqual), R(7), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(20), //
- B(Ldar), R(0), //
- B(Star), R(6), //
- B(LoadIC), R(6), U8(2), U8(vector->GetIndex(slot3)), //
- B(Star), R(7), //
- B(LdaSmi8), U8(20), //
- B(TestEqual), R(7), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(8), //
- B(ForInStep), R(5), //
- B(Star), R(5), //
- B(Jump), U8(-64), //
- B(LdaUndefined), //
- B(Return), //
- },
- 3,
- {InstanceType::FIXED_ARRAY_TYPE, InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"var x = [ 10, 11, 12 ] ;\n"
- "for (x[0] in [1,2,3]) { return x[3]; }",
- 9 * kPointerSize,
- 1,
- 70,
- {
- B(StackCheck), //
- B(CreateArrayLiteral), U8(0), U8(0), U8(simple_flags), //
- B(Star), R(0), //
- B(CreateArrayLiteral), U8(1), U8(1), U8(simple_flags), //
- B(JumpIfUndefined), U8(57), //
- B(JumpIfNull), U8(55), //
- B(ToObject), //
- B(JumpIfNull), U8(52), //
- B(Star), R(1), //
- B(ForInPrepare), R(2), //
- B(LdaZero), //
- B(Star), R(5), //
- B(ForInDone), R(5), R(4), //
- B(JumpIfTrue), U8(40), //
- B(ForInNext), R(1), R(5), R(2), //
- B(JumpIfUndefined), U8(28), //
- B(Star), R(6), //
- B(Ldar), R(0), //
- B(Star), R(7), //
- B(LdaZero), //
- B(Star), R(8), //
- B(Ldar), R(6), //
- B(KeyedStoreICSloppy), R(7), R(8), U8(vector->GetIndex(slot3)), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Star), R(6), //
- B(LdaSmi8), U8(3), //
- B(KeyedLoadIC), R(6), U8(vector->GetIndex(slot2)), //
- B(Return), //
- B(ForInStep), R(5), //
- B(Star), R(5), //
- B(Jump), U8(-41), //
- B(LdaUndefined), //
- B(Return), //
- },
- 2,
- {InstanceType::FIXED_ARRAY_TYPE, InstanceType::FIXED_ARRAY_TYPE}},
+ "var x = 'potatoes';\n"
+ "for (var p in x) { return p; }",
+
+ "var x = 0;\n"
+ "for (var p in [1,2,3]) { x += p; }",
+
+ "var x = { 'a': 1, 'b': 2 };\n"
+ "for (x['a'] in [10, 20, 30]) {\n"
+ " if (x['a'] == 10) continue;\n"
+ " if (x['a'] == 20) break;\n"
+ "}",
+
+ "var x = [ 10, 11, 12 ] ;\n"
+ "for (x[0] in [1,2,3]) { return x[3]; }",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("ForIn.golden"));
}
+TEST(ForOf) {
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
+ const char* snippets[] = {
+ "for (var p of [0, 1, 2]) {}",
-// TODO(rmcilroy): Do something about this; new bytecode is too large
-// (150+ instructions) to adapt manually.
-DISABLED_TEST(ForOf) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
+ "var x = 'potatoes';\n"
+ "for (var p of x) { return p; }",
- int array_literal_flags =
- ArrayLiteral::kDisableMementos | ArrayLiteral::kShallowElements;
- int object_literal_flags =
- ObjectLiteral::kFastElements | ObjectLiteral::kDisableMementos;
+ "for (var x of [10, 20, 30]) {\n"
+ " if (x == 10) continue;\n"
+ " if (x == 20) break;\n"
+ "}",
- FeedbackVectorSpec feedback_spec(&zone);
- FeedbackVectorSlot slot1 = feedback_spec.AddCallICSlot();
- FeedbackVectorSlot slot2 = feedback_spec.AddKeyedLoadICSlot();
- FeedbackVectorSlot slot3 = feedback_spec.AddCallICSlot();
- FeedbackVectorSlot slot4 = feedback_spec.AddLoadICSlot();
- FeedbackVectorSlot slot5 = feedback_spec.AddLoadICSlot();
- FeedbackVectorSlot slot6 = feedback_spec.AddLoadICSlot();
- FeedbackVectorSlot slot7 = feedback_spec.AddStoreICSlot();
- FeedbackVectorSlot slot8 = feedback_spec.AddLoadICSlot();
- Handle<i::TypeFeedbackVector> vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec);
-
- // clang-format off
- ExpectedSnippet<InstanceType, 8> snippets[] = {
- {"for (var p of [0, 1, 2]) {}",
- 7 * kPointerSize,
- 1,
- 86,
- {
- B(StackCheck), //
- B(CreateArrayLiteral), U8(0), U8(0), U8(array_literal_flags), //
- B(Star), R(5), //
- B(LdaConstant), U8(1), //
- B(KeyedLoadIC), R(5), U8(vector->GetIndex(slot2)), //
- B(Star), R(4), //
- B(Call), R(4), R(5), U8(1), U8(vector->GetIndex(slot1)), //
- B(Star), R(1), //
- B(Ldar), R(1), //
- B(Star), R(6), //
- B(LoadIC), R(6), U8(2), U8(vector->GetIndex(slot4)), //
- B(Star), R(5), //
- B(Call), R(5), R(6), U8(1), U8(vector->GetIndex(slot3)), //
- B(Star), R(2), //
- B(Star), R(4), //
- B(CallRuntime), U16(Runtime::kInlineIsJSReceiver), R(4), U8(1), //
- B(LogicalNot), //
- B(JumpIfFalse), U8(11), //
- B(Ldar), R(2), //
- B(Star), R(4), //
- B(CallRuntime), U16(Runtime::kThrowIteratorResultNotAnObject), //
- /* */ R(4), U8(1), //
- B(Ldar), R(2), //
- B(Star), R(4), //
- B(LoadIC), R(4), U8(3), U8(vector->GetIndex(slot5)), //
- B(JumpIfToBooleanTrue), U8(19), //
- B(Ldar), R(2), //
- B(Star), R(4), //
- B(LoadIC), R(4), U8(4), U8(vector->GetIndex(slot6)), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Star), R(3), //
- B(Jump), U8(-61), //
- B(LdaUndefined), //
- B(Return), //
- },
- 5,
- {InstanceType::FIXED_ARRAY_TYPE, InstanceType::SYMBOL_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"var x = 'potatoes';\n"
- "for (var p of x) { return p; }",
- 8 * kPointerSize,
- 1,
- 85,
- {
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Star), R(3), //
- B(Star), R(6), //
- B(LdaConstant), U8(1), //
- B(KeyedLoadIC), R(6), U8(vector->GetIndex(slot2)), //
- B(Star), R(5), //
- B(Call), R(5), R(6), U8(1), U8(vector->GetIndex(slot1)), //
- B(Star), R(1), //
- B(Ldar), R(1), //
- B(Star), R(7), //
- B(LoadIC), R(7), U8(2), U8(vector->GetIndex(slot4)), //
- B(Star), R(6), //
- B(Call), R(6), R(7), U8(1), U8(vector->GetIndex(slot3)), //
- B(Star), R(2), //
- B(Star), R(5), //
- B(CallRuntime), U16(Runtime::kInlineIsJSReceiver), R(5), U8(1), //
- B(LogicalNot), //
- B(JumpIfFalse), U8(11), //
- B(Ldar), R(2), //
- B(Star), R(5), //
- B(CallRuntime), U16(Runtime::kThrowIteratorResultNotAnObject), //
- /* */ R(5), U8(1), //
- B(Ldar), R(2), //
- B(Star), R(5), //
- B(LoadIC), R(5), U8(3), U8(vector->GetIndex(slot5)), //
- B(JumpIfToBooleanTrue), U8(18), //
- B(Ldar), R(2), //
- B(Star), R(5), //
- B(LoadIC), R(5), U8(4), U8(vector->GetIndex(slot6)), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Star), R(4), //
- B(Return), //
- B(LdaUndefined), //
- B(Return), //
- },
- 5,
- {InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::SYMBOL_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"for (var x of [10, 20, 30]) {\n"
- " if (x == 10) continue;\n"
- " if (x == 20) break;\n"
- "}",
- 7 * kPointerSize,
- 1,
- 108,
- {
- B(StackCheck), //
- B(CreateArrayLiteral), U8(0), U8(0), U8(array_literal_flags), //
- B(Star), R(5), //
- B(LdaConstant), U8(1), //
- B(KeyedLoadIC), R(5), U8(vector->GetIndex(slot2)), //
- B(Star), R(4), //
- B(Call), R(4), R(5), U8(1), U8(vector->GetIndex(slot1)), //
- B(Star), R(1), //
- B(Ldar), R(1), //
- B(Star), R(6), //
- B(LoadIC), R(6), U8(2), U8(vector->GetIndex(slot4)), //
- B(Star), R(5), //
- B(Call), R(5), R(6), U8(1), U8(vector->GetIndex(slot3)), //
- B(Star), R(2), //
- B(Star), R(4), //
- B(CallRuntime), U16(Runtime::kInlineIsJSReceiver), R(4), U8(1), //
- B(LogicalNot), //
- B(JumpIfFalse), U8(11), //
- B(Ldar), R(2), //
- B(Star), R(4), //
- B(CallRuntime), U16(Runtime::kThrowIteratorResultNotAnObject), //
- /* */ R(4), U8(1), //
- B(Ldar), R(2), //
- B(Star), R(4), //
- B(LoadIC), R(4), U8(3), U8(vector->GetIndex(slot5)), //
- B(JumpIfToBooleanTrue), U8(41), //
- B(Ldar), R(2), //
- B(Star), R(4), //
- B(LoadIC), R(4), U8(4), U8(vector->GetIndex(slot6)), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Star), R(3), //
- B(Star), R(4), //
- B(LdaSmi8), U8(10), //
- B(TestEqual), R(4), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(-69), //
- B(Ldar), R(3), //
- B(Star), R(4), //
- B(LdaSmi8), U8(20), //
- B(TestEqual), R(4), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(4), //
- B(Jump), U8(-83), //
- B(LdaUndefined), //
- B(Return), //
- },
- 5,
- {InstanceType::FIXED_ARRAY_TYPE, InstanceType::SYMBOL_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"var x = { 'a': 1, 'b': 2 };\n"
- "for (x['a'] of [1,2,3]) { return x['a']; }",
- 6 * kPointerSize,
- 1,
- 103,
- {
- B(StackCheck), //
- B(CreateObjectLiteral), U8(0), U8(0), U8(object_literal_flags), //
- B(Star), R(3), //
- B(Star), R(2), //
- B(CreateArrayLiteral), U8(1), U8(1), U8(array_literal_flags), //
- B(Star), R(4), //
- B(LdaConstant), U8(2), //
- B(KeyedLoadIC), R(4), U8(vector->GetIndex(slot2)), //
- B(Star), R(3), //
- B(Call), R(3), R(4), U8(1), U8(vector->GetIndex(slot1)), //
- B(Star), R(0), //
- B(Ldar), R(0), //
- B(Star), R(5), //
- B(LoadIC), R(5), U8(3), U8(vector->GetIndex(slot4)), //
- B(Star), R(4), //
- B(Call), R(4), R(5), U8(1), U8(vector->GetIndex(slot3)), //
- B(Star), R(1), //
- B(Star), R(3), //
- B(CallRuntime), U16(Runtime::kInlineIsJSReceiver), R(3), U8(1), //
- B(LogicalNot), //
- B(JumpIfFalse), U8(11), //
- B(Ldar), R(1), //
- B(Star), R(3), //
- B(CallRuntime), U16(Runtime::kThrowIteratorResultNotAnObject), //
- /* */ R(3), U8(1), //
- B(Ldar), R(1), //
- B(Star), R(3), //
- B(LoadIC), R(3), U8(4), U8(vector->GetIndex(slot5)), //
- B(JumpIfToBooleanTrue), U8(28), //
- B(Ldar), R(2), //
- B(Star), R(3), //
- B(Ldar), R(1), //
- B(Star), R(4), //
- B(LoadIC), R(4), U8(5), U8(vector->GetIndex(slot6)), //
- B(StoreICSloppy), R(3), U8(6), U8(vector->GetIndex(slot7)), //
- B(StackCheck), //
- B(Ldar), R(2), //
- B(Star), R(3), //
- B(LoadIC), R(3), U8(6), U8(vector->GetIndex(slot8)), //
- B(Return), //
- B(LdaUndefined), //
- B(Return), //
- },
- 7,
- {InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::SYMBOL_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
+ "var x = { 'a': 1, 'b': 2 };\n"
+ "for (x['a'] of [1,2,3]) { return x['a']; }",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("ForOf.golden"));
}
-
TEST(Conditional) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kNumber);
+ const char* snippets[] = {
+ "return 1 ? 2 : 3;",
- // clang-format off
- ExpectedSnippet<int> snippets[] = {
- {"return 1 ? 2 : 3;",
- 0,
- 1,
- 12,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(JumpIfToBooleanFalse), U8(6), //
- B(LdaSmi8), U8(2), //
- B(Jump), U8(4), //
- B(LdaSmi8), U8(3), //
- B(Return), //
- }},
- {"return 1 ? 2 ? 3 : 4 : 5;",
- 0,
- 1,
- 20,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(JumpIfToBooleanFalse), U8(14), //
- B(LdaSmi8), U8(2), //
- B(JumpIfToBooleanFalse), U8(6), //
- B(LdaSmi8), U8(3), //
- B(Jump), U8(4), //
- B(LdaSmi8), U8(4), //
- B(Jump), U8(4), //
- B(LdaSmi8), U8(5), //
- B(Return), //
- }},
+ "return 1 ? 2 ? 3 : 4 : 5;",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("Conditional.golden"));
}
-
TEST(Switch) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kNumber);
+ const char* snippets[] = {
+ "var a = 1;\n"
+ "switch(a) {\n"
+ " case 1: return 2;\n"
+ " case 2: return 3;\n"
+ "}",
- // clang-format off
- ExpectedSnippet<int> snippets[] = {
- {"var a = 1;\n"
- "switch(a) {\n"
- " case 1: return 2;\n"
- " case 2: return 3;\n"
- "}\n",
- 3 * kPointerSize,
- 1,
- 31,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), // The tag variable is allocated as a
- B(Star), R(0), // local by the parser, hence the store
- B(Star), R(2), // to another local register.
- B(LdaSmi8), U8(1), //
- B(TestEqualStrict), R(2), //
- B(JumpIfTrue), U8(10), //
- B(LdaSmi8), U8(2), //
- B(TestEqualStrict), R(2), //
- B(JumpIfTrue), U8(7), //
- B(Jump), U8(8), //
- B(LdaSmi8), U8(2), //
- B(Return), //
- B(LdaSmi8), U8(3), //
- B(Return), //
- B(LdaUndefined), //
- B(Return), //
- }},
- {"var a = 1;\n"
- "switch(a) {\n"
- " case 1: a = 2; break;\n"
- " case 2: a = 3; break;\n"
- "}\n",
- 3 * kPointerSize,
- 1,
- 37,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), //
- B(Star), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(1), //
- B(TestEqualStrict), R(2), //
- B(JumpIfTrue), U8(10), //
- B(LdaSmi8), U8(2), //
- B(TestEqualStrict), R(2), //
- B(JumpIfTrue), U8(10), //
- B(Jump), U8(14), //
- B(LdaSmi8), U8(2), //
- B(Star), R(1), //
- B(Jump), U8(8), //
- B(LdaSmi8), U8(3), //
- B(Star), R(1), //
- B(Jump), U8(2), //
- B(LdaUndefined), //
- B(Return), //
- }},
- {"var a = 1;\n"
- "switch(a) {\n"
- " case 1: a = 2; // fall-through\n"
- " case 2: a = 3; break;\n"
- "}\n",
- 3 * kPointerSize,
- 1,
- 35,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), //
- B(Star), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(1), //
- B(TestEqualStrict), R(2), //
- B(JumpIfTrue), U8(10), //
- B(LdaSmi8), U8(2), //
- B(TestEqualStrict), R(2), //
- B(JumpIfTrue), U8(8), //
- B(Jump), U8(12), //
- B(LdaSmi8), U8(2), //
- B(Star), R(1), //
- B(LdaSmi8), U8(3), //
- B(Star), R(1), //
- B(Jump), U8(2), //
- B(LdaUndefined), //
- B(Return), //
- }},
- {"var a = 1;\n"
- "switch(a) {\n"
- " case 2: break;\n"
- " case 3: break;\n"
- " default: a = 1; break;\n"
- "}\n",
- 3 * kPointerSize,
- 1,
- 35,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), //
- B(Star), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(2), //
- B(TestEqualStrict), R(2), //
- B(JumpIfTrue), U8(10), //
- B(LdaSmi8), U8(3), //
- B(TestEqualStrict), R(2), //
- B(JumpIfTrue), U8(6), //
- B(Jump), U8(6), //
- B(Jump), U8(10), //
- B(Jump), U8(8), //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), //
- B(Jump), U8(2), //
- B(LdaUndefined), //
- B(Return), //
- }},
- {"var a = 1;\n"
- "switch(typeof(a)) {\n"
- " case 2: a = 1; break;\n"
- " case 3: a = 2; break;\n"
- " default: a = 3; break;\n"
- "}\n",
- 3 * kPointerSize,
- 1,
- 44,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), //
- B(TypeOf), //
- B(Star), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(2), //
- B(TestEqualStrict), R(2), //
- B(JumpIfTrue), U8(10), //
- B(LdaSmi8), U8(3), //
- B(TestEqualStrict), R(2), //
- B(JumpIfTrue), U8(10), //
- B(Jump), U8(14), //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), //
- B(Jump), U8(14), //
- B(LdaSmi8), U8(2), //
- B(Star), R(1), //
- B(Jump), U8(8), //
- B(LdaSmi8), U8(3), //
- B(Star), R(1), //
- B(Jump), U8(2), //
- B(LdaUndefined), //
- B(Return), //
- }},
- {"var a = 1;\n"
- "switch(a) {\n"
- " case typeof(a): a = 1; break;\n"
- " default: a = 2; break;\n"
- "}\n",
- 3 * kPointerSize,
- 1,
- 32,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), //
- B(Star), R(0), //
- B(Star), R(2), //
- B(Ldar), R(1), //
- B(TypeOf), //
- B(TestEqualStrict), R(2), //
- B(JumpIfTrue), U8(4), //
- B(Jump), U8(8), //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), //
- B(Jump), U8(8), //
- B(LdaSmi8), U8(2), //
- B(Star), R(1), //
- B(Jump), U8(2), //
- B(LdaUndefined), //
- B(Return), //
- }},
- {"var a = 1;\n"
- "switch(a) {\n"
- " case 1:\n" REPEAT_64(SPACE, " a = 2;")
- "break;\n"
- " case 2: a = 3; break;"
- "}\n",
- 3 * kPointerSize,
- 1,
- 289,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), //
- B(Star), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(1), //
- B(TestEqualStrict), R(2), //
- B(JumpIfTrue), U8(10), //
- B(LdaSmi8), U8(2), //
- B(TestEqualStrict), R(2), //
- B(JumpIfTrueConstant), U8(0), //
- B(JumpConstant), U8(1), //
- REPEAT_64(COMMA, //
- B(LdaSmi8), U8(2), //
- B(Star), R(1)), //
- B(Jump), U8(8), //
- B(LdaSmi8), U8(3), //
- B(Star), R(1), //
- B(Jump), U8(2), //
- B(LdaUndefined), //
- B(Return), //
- },
- 2,
- {262, 266}},
- {"var a = 1;\n"
- "switch(a) {\n"
- " case 1: \n"
- " switch(a + 1) {\n"
- " case 2 : a = 1; break;\n"
- " default : a = 2; break;\n"
- " } // fall-through\n"
- " case 2: a = 3;\n"
- "}\n",
- 5 * kPointerSize,
- 1,
- 61,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(2), //
- B(Star), R(0), //
- B(Star), R(3), //
- B(LdaSmi8), U8(1), //
- B(TestEqualStrict), R(3), //
- B(JumpIfTrue), U8(10), //
- B(LdaSmi8), U8(2), //
- B(TestEqualStrict), R(3), //
- B(JumpIfTrue), U8(36), //
- B(Jump), U8(38), //
- B(Ldar), R(2), //
- B(Star), R(4), //
- B(LdaSmi8), U8(1), //
- B(Add), R(4), //
- B(Star), R(1), //
- B(Star), R(4), //
- B(LdaSmi8), U8(2), //
- B(TestEqualStrict), R(4), //
- B(JumpIfTrue), U8(4), //
- B(Jump), U8(8), //
- B(LdaSmi8), U8(1), //
- B(Star), R(2), //
- B(Jump), U8(8), //
- B(LdaSmi8), U8(2), //
- B(Star), R(2), //
- B(Jump), U8(2), //
- B(LdaSmi8), U8(3), //
- B(Star), R(2), //
- B(LdaUndefined), //
- B(Return), //
- }},
+ "var a = 1;\n"
+ "switch(a) {\n"
+ " case 1: a = 2; break;\n"
+ " case 2: a = 3; break;\n"
+ "}",
+
+ "var a = 1;\n"
+ "switch(a) {\n"
+ " case 1: a = 2; // fall-through\n"
+ " case 2: a = 3; break;\n"
+ "}",
+
+ "var a = 1;\n"
+ "switch(a) {\n"
+ " case 2: break;\n"
+ " case 3: break;\n"
+ " default: a = 1; break;\n"
+ "}",
+
+ "var a = 1;\n"
+ "switch(typeof(a)) {\n"
+ " case 2: a = 1; break;\n"
+ " case 3: a = 2; break;\n"
+ " default: a = 3; break;\n"
+ "}",
+
+ "var a = 1;\n"
+ "switch(a) {\n"
+ " case typeof(a): a = 1; break;\n"
+ " default: a = 2; break;\n"
+ "}",
+
+ "var a = 1;\n"
+ "switch(a) {\n"
+ " case 1:\n"
+ REPEAT_64(" a = 2;\n")
+ " break;\n"
+ " case 2:\n"
+ " a = 3;\n"
+ " break;\n"
+ "}",
+
+ "var a = 1;\n"
+ "switch(a) {\n"
+ " case 1: \n"
+ " switch(a + 1) {\n"
+ " case 2 : a = 1; break;\n"
+ " default : a = 2; break;\n"
+ " } // fall-through\n"
+ " case 2: a = 3;\n"
+ "}",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("Switch.golden"));
}
-
TEST(BasicBlockToBoolean) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kNumber);
+ const char* snippets[] = {
+ "var a = 1; if (a || a < 0) { return 1; }",
- // Check that we generate JumpIfToBoolean if they are at the start of basic
- // blocks.
- // clang-format off
- ExpectedSnippet<int> snippets[] = {
- {"var a = 1; if (a || a < 0) { return 1; }",
- 2 * kPointerSize,
- 1,
- 21,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(JumpIfToBooleanTrue), U8(9), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaZero), //
- B(TestLessThan), R(1), //
- B(JumpIfToBooleanFalse), U8(5), //
- B(LdaSmi8), U8(1), //
- B(Return), //
- B(LdaUndefined), //
- B(Return), //
- }},
- {"var a = 1; if (a && a < 0) { return 1; }",
- 2 * kPointerSize,
- 1,
- 21,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(JumpIfToBooleanFalse), U8(9), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaZero), //
- B(TestLessThan), R(1), //
- B(JumpIfToBooleanFalse), U8(5), //
- B(LdaSmi8), U8(1), //
- B(Return), //
- B(LdaUndefined), //
- B(Return), //
- }},
- {"var a = 1; a = (a || a < 0) ? 2 : 3;",
- 2 * kPointerSize,
- 1,
- 26,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(JumpIfToBooleanTrue), U8(9), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaZero), //
- B(TestLessThan), R(1), //
- B(JumpIfToBooleanFalse), U8(6), //
- B(LdaSmi8), U8(2), //
- B(Jump), U8(4), //
- B(LdaSmi8), U8(3), //
- B(Star), R(0), //
- B(LdaUndefined), //
- B(Return), //
- }},
+ "var a = 1; if (a && a < 0) { return 1; }",
+
+ "var a = 1; a = (a || a < 0) ? 2 : 3;",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("BasicBlockToBoolean.golden"));
}
-
TEST(DeadCodeRemoval) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kNumber);
+ const char* snippets[] = {
+ "return; var a = 1; a();",
- // clang-format off
- ExpectedSnippet<int> snippets[] = {
- {"return; var a = 1; a();",
- 1 * kPointerSize,
- 1,
- 3,
- {
- B(StackCheck), //
- B(LdaUndefined), //
- B(Return), //
- }},
- {"if (false) { return; }; var a = 1;",
- 1 * kPointerSize,
- 1,
- 7,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(LdaUndefined), //
- B(Return), //
- }},
- {"if (true) { return 1; } else { return 2; };",
- 0,
- 1,
- 4,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Return), //
- }},
- {"var a = 1; if (a) { return 1; }; return 2;",
- 1 * kPointerSize,
- 1,
- 13,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(JumpIfToBooleanFalse), U8(5), //
- B(LdaSmi8), U8(1), //
- B(Return), //
- B(LdaSmi8), U8(2), //
- B(Return), //
- }},
+ "if (false) { return; }; var a = 1;",
+
+ "if (true) { return 1; } else { return 2; };",
+
+ "var a = 1; if (a) { return 1; }; return 2;",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("DeadCodeRemoval.golden"));
}
-
TEST(ThisFunction) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kNumber);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
- int closure = Register::function_closure().index();
+ const char* snippets[] = {
+ "var f;\n"
+ "f = function f() {};",
- // clang-format off
- ExpectedSnippet<int> snippets[] = {
- {"var f;\n f = function f() { }",
- 2 * kPointerSize,
- 1,
- 19,
- {
- B(LdaTheHole), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(closure), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(JumpIfNotHole), U8(5), //
- B(Mov), R(1), R(0), //
- B(Ldar), R(1), //
- B(LdaUndefined), //
- B(Return), //
- }},
- {"var f;\n f = function f() { return f; }",
- 2 * kPointerSize,
- 1,
- 23,
- {
- B(LdaTheHole), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(closure), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(JumpIfNotHole), U8(5), //
- B(Mov), R(1), R(0), //
- B(Ldar), R(1), //
- B(Ldar), R(0), //
- B(JumpIfNotHole), U8(3), //
- B(LdaUndefined), //
- B(Return), //
- }},
+ "var f;\n"
+ "f = function f() { return f; };",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunction(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets, "", "\nf();"),
+ LoadGolden("ThisFunction.golden"));
}
-
TEST(NewTarget) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
- int new_target = Register::new_target().index();
+ const char* snippets[] = {
+ "return new.target;",
- // clang-format off
- ExpectedSnippet<InstanceType> snippets[] = {
- {"return new.target;",
- 2 * kPointerSize,
- 1,
- 19,
- {
- B(Ldar), R(new_target), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(0), //
- B(Star), R(1), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(1), U8(1), //
- B(Return), //
- },
- 1,
- {InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"new.target;",
- 2 * kPointerSize,
- 1,
- 20,
- {
- B(Ldar), R(new_target), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(0), //
- B(Star), R(1), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(1), U8(1), //
- B(LdaUndefined), //
- B(Return), //
- },
- 1,
- {InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}}};
- // clang-format on
+ "new.target;",
+ };
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("NewTarget.golden"));
}
-
TEST(RemoveRedundantLdar) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kNumber);
+ const char* snippets[] = {
+ "var ld_a = 1;\n" // This test is to check Ldar does not
+ "while(true) {\n" // get removed if the preceding Star is
+ " ld_a = ld_a + ld_a;\n" // in a different basicblock.
+ " if (ld_a > 10) break;\n"
+ "}\n"
+ "return ld_a;",
- // clang-format off
- ExpectedSnippet<int> snippets[] = {
- {"var ld_a = 1;\n" // This test is to check Ldar does not
- "while(true) {\n" // get removed if the preceding Star is
- " ld_a = ld_a + ld_a;\n" // in a different basicblock.
- " if (ld_a > 10) break;\n"
- "}\n"
- "return ld_a;",
- 2 * kPointerSize,
- 1,
- 31,
- {B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(0), // This load should not be removed as it
- B(Star), R(1), // is the target of the branch.
- B(Ldar), R(0), //
- B(Add), R(1), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(10), //
- B(TestGreaterThan), R(1), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(4), //
- B(Jump), U8(-21), //
- B(Ldar), R(0), //
- B(Return)}},
- {"var ld_a = 1;\n"
- "do {\n"
- " ld_a = ld_a + ld_a;\n"
- " if (ld_a > 10) continue;\n"
- "} while(false);\n"
- "return ld_a;",
- 2 * kPointerSize,
- 1,
- 29,
- {B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(Add), R(1), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(10), //
- B(TestGreaterThan), R(1), //
- B(JumpIfFalse), U8(4), //
- B(Jump), U8(2), //
- B(Ldar), R(0), //
- B(Return)}},
- {"var ld_a = 1;\n"
- " ld_a = ld_a + ld_a;\n"
- " return ld_a;",
- 2 * kPointerSize,
- 1,
- 14,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(Add), R(1), //
- B(Star), R(0), //
- B(Return) //
- }},
+ "var ld_a = 1;\n"
+ "do {\n"
+ " ld_a = ld_a + ld_a;\n"
+ " if (ld_a > 10) continue;\n"
+ "} while(false);\n"
+ "return ld_a;",
+
+ "var ld_a = 1;\n"
+ " ld_a = ld_a + ld_a;\n"
+ " return ld_a;",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("RemoveRedundantLdar.golden"));
}
-
TEST(AssignmentsInBinaryExpression) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
+ const char* snippets[] = {
+ "var x = 0, y = 1;\n"
+ "return (x = 2, y = 3, x = 4, y = 5);",
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"var x = 0, y = 1;\n"
- "return (x = 2, y = 3, x = 4, y = 5)",
- 2 * kPointerSize,
- 1,
- 25,
- {
- B(StackCheck), //
- B(LdaZero), B(Star), R(0), //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), //
- B(LdaSmi8), U8(2), //
- B(Star), R(0), //
- B(LdaSmi8), U8(3), //
- B(Star), R(1), //
- B(LdaSmi8), U8(4), //
- B(Star), R(0), //
- B(LdaSmi8), U8(5), //
- B(Star), R(1), //
- B(Return), //
- },
- 0},
- {"var x = 55;\n"
- "var y = (x = 100);\n"
- "return y",
- 2 * kPointerSize,
- 1,
- 12,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(55), //
- B(Star), R(0), //
- B(LdaSmi8), U8(100), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(Return), //
- },
- 0},
- {"var x = 55;\n"
- "x = x + (x = 100) + (x = 101);\n"
- "return x;",
- 3 * kPointerSize,
- 1,
- 24,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(55), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(100), //
- B(Star), R(0), //
- B(Add), R(1), //
- B(Star), R(2), //
- B(LdaSmi8), U8(101), //
- B(Star), R(0), //
- B(Add), R(2), //
- B(Star), R(0), //
- B(Return), //
- },
- 0},
- {"var x = 55;\n"
- "x = (x = 56) - x + (x = 57);\n"
- "x++;\n"
- "return x;",
- 3 * kPointerSize,
- 1,
- 32,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(55), //
- B(Star), R(0), //
- B(LdaSmi8), U8(56), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(Sub), R(1), //
- B(Star), R(2), //
- B(LdaSmi8), U8(57), //
- B(Star), R(0), //
- B(Add), R(2), //
- B(Star), R(0), //
- B(ToNumber), //
- B(Star), R(1), //
- B(Inc), //
- B(Star), R(0), //
- B(Return), //
- },
- 0},
- {"var x = 55;\n"
- "var y = x + (x = 1) + (x = 2) + (x = 3);\n"
- "return y;",
- 4 * kPointerSize,
- 1,
- 32,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(55), //
- B(Star), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(Add), R(2), //
- B(Star), R(3), //
- B(LdaSmi8), U8(2), //
- B(Star), R(0), //
- B(Add), R(3), //
- B(Star), R(2), //
- B(LdaSmi8), U8(3), //
- B(Star), R(0), //
- B(Add), R(2), //
- B(Star), R(1), //
- B(Return), //
- },
- 0},
- {"var x = 55;\n"
- "var x = x + (x = 1) + (x = 2) + (x = 3);\n"
- "return x;",
- 3 * kPointerSize,
- 1,
- 32,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(55), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(Add), R(1), //
- B(Star), R(2), //
- B(LdaSmi8), U8(2), //
- B(Star), R(0), //
- B(Add), R(2), //
- B(Star), R(1), //
- B(LdaSmi8), U8(3), //
- B(Star), R(0), //
- B(Add), R(1), //
- B(Star), R(0), //
- B(Return), //
- },
- 0},
- {"var x = 10, y = 20;\n"
- "return x + (x = 1) + (x + 1) * (y = 2) + (y = 3) + (x = 4) + (y = 5) + "
- "y;\n",
- 5 * kPointerSize,
- 1,
- 70,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(Star), R(0), //
- B(LdaSmi8), U8(20), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(1), //
- B(Star), R(0), //
- B(Add), R(2), //
- B(Star), R(3), //
- B(Ldar), R(0), //
- B(Star), R(2), //
- B(LdaSmi8), U8(1), //
- B(Add), R(2), //
- B(Star), R(4), //
- B(LdaSmi8), U8(2), //
- B(Star), R(1), //
- B(Mul), R(4), //
- B(Add), R(3), //
- B(Star), R(2), //
- B(LdaSmi8), U8(3), //
- B(Star), R(1), //
- B(Add), R(2), //
- B(Star), R(3), //
- B(LdaSmi8), U8(4), //
- B(Star), R(0), //
- B(Add), R(3), //
- B(Star), R(2), //
- B(LdaSmi8), U8(5), //
- B(Star), R(1), //
- B(Add), R(2), //
- B(Star), R(3), //
- B(Ldar), R(1), //
- B(Add), R(3), //
- B(Return), //
- },
- 0},
- {"var x = 17;\n"
- "return 1 + x + (x++) + (++x);\n",
- 4 * kPointerSize,
- 1,
- 38,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(17), //
- B(Star), R(0), //
- B(LdaSmi8), U8(1), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(Add), R(1), //
- B(Star), R(2), //
- B(Ldar), R(0), //
- B(ToNumber), //
- B(Star), R(1), //
- B(Inc), //
- B(Star), R(0), //
- B(Ldar), R(1), //
- B(Add), R(2), //
- B(Star), R(3), //
- B(Ldar), R(0), //
- B(ToNumber), //
- B(Inc), //
- B(Star), R(0), //
- B(Add), R(3), //
- B(Return), //
- },
- 0}
+ "var x = 55;\n"
+ "var y = (x = 100);\n"
+ "return y;",
+
+ "var x = 55;\n"
+ "x = x + (x = 100) + (x = 101);\n"
+ "return x;",
+
+ "var x = 55;\n"
+ "x = (x = 56) - x + (x = 57);\n"
+ "x++;\n"
+ "return x;",
+
+ "var x = 55;\n"
+ "var y = x + (x = 1) + (x = 2) + (x = 3);\n"
+ "return y;",
+
+ "var x = 55;\n"
+ "var x = x + (x = 1) + (x = 2) + (x = 3);\n"
+ "return x;",
+
+ "var x = 10, y = 20;\n"
+ "return x + (x = 1) + (x + 1) * (y = 2) + (y = 3) + (x = 4) + (y = 5) + "
+ "y;\n",
+
+ "var x = 17;\n"
+ "return 1 + x + (x++) + (++x);\n",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("AssignmentsInBinaryExpression.golden"));
}
-
TEST(Eval) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
-
- int closure = Register::function_closure().index();
- int context = Register::current_context().index();
- int new_target = Register::new_target().index();
-
- int first_context_slot = Context::MIN_CONTEXT_SLOTS;
-
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"return eval('1;');",
- 9 * kPointerSize,
- 1,
- 65,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), //
- /* */ U8(1), //
- B(PushContext), R(0), //
- B(Ldar), THIS(1), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(CreateMappedArguments), //
- B(StaContextSlot), R(context), U8(first_context_slot + 1), //
- B(Ldar), R(new_target), //
- B(StaContextSlot), R(context), U8(first_context_slot + 2), //
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Star), R(3), //
- B(CallRuntimeForPair), U16(Runtime::kLoadLookupSlotForCall), //
- /* */ R(3), U8(1), R(1), //
- B(LdaConstant), U8(1), //
- B(Star), R(3), //
- B(Mov), R(1), R(4), //
- B(Mov), R(3), R(5), //
- B(Mov), R(closure), R(6), //
- B(LdaZero), //
- B(Star), R(7), //
- B(LdaSmi8), U8(10), //
- B(Star), R(8), //
- B(CallRuntime), U16(Runtime::kResolvePossiblyDirectEval), R(4), //
- /* */ U8(5), //
- B(Star), R(1), //
- B(Call), R(1), R(2), U8(2), U8(0), //
- B(Return), //
- },
- 2,
- {"eval", "1;"}},
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
+ const char* snippets[] = {
+ "return eval('1;');",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("Eval.golden"));
}
-
TEST(LookupSlot) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
- int closure = Register::function_closure().index();
- int context = Register::current_context().index();
- int first_context_slot = Context::MIN_CONTEXT_SLOTS;
- int new_target = Register::new_target().index();
+ const char* snippets[] = {
+ "eval('var x = 10;'); return x;",
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"eval('var x = 10;'); return x;",
- 9 * kPointerSize,
- 1,
- 67,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), //
- /* */ U8(1), //
- B(PushContext), R(0), //
- B(Ldar), THIS(1), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(CreateMappedArguments), //
- B(StaContextSlot), R(context), U8(first_context_slot + 1), //
- B(Ldar), R(new_target), //
- B(StaContextSlot), R(context), U8(first_context_slot + 2), //
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Star), R(3), //
- B(CallRuntimeForPair), U16(Runtime::kLoadLookupSlotForCall), //
- R(3), U8(1), R(1), //
- B(LdaConstant), U8(1), //
- B(Star), R(3), //
- B(Mov), R(1), R(4), //
- B(Mov), R(3), R(5), //
- B(Mov), R(closure), R(6), //
- B(LdaZero), //
- B(Star), R(7), //
- B(LdaSmi8), U8(10), //
- B(Star), R(8), //
- B(CallRuntime), U16(Runtime::kResolvePossiblyDirectEval), R(4), //
- U8(5), //
- B(Star), R(1), //
- B(Call), R(1), R(2), U8(2), U8(0), //
- B(LdaLookupSlot), U8(2), //
- B(Return), //
- },
- 3,
- {"eval", "var x = 10;", "x"}},
- {"eval('var x = 10;'); return typeof x;",
- 9 * kPointerSize,
- 1,
- 68,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), //
- /* */ U8(1), //
- B(PushContext), R(0), //
- B(Ldar), THIS(1), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(CreateMappedArguments), //
- B(StaContextSlot), R(context), U8(first_context_slot + 1), //
- B(Ldar), R(new_target), //
- B(StaContextSlot), R(context), U8(first_context_slot + 2), //
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Star), R(3), //
- B(CallRuntimeForPair), U16(Runtime::kLoadLookupSlotForCall), //
- /* */ R(3), U8(1), R(1), //
- B(LdaConstant), U8(1), //
- B(Star), R(3), //
- B(Mov), R(1), R(4), //
- B(Mov), R(3), R(5), //
- B(Mov), R(closure), R(6), //
- B(LdaZero), //
- B(Star), R(7), //
- B(LdaSmi8), U8(10), //
- B(Star), R(8), //
- B(CallRuntime), U16(Runtime::kResolvePossiblyDirectEval), R(4), //
- /* */ U8(5), //
- B(Star), R(1), //
- B(Call), R(1), R(2), U8(2), U8(0), //
- B(LdaLookupSlotInsideTypeof), U8(2), //
- B(TypeOf), //
- B(Return), //
- },
- 3,
- {"eval", "var x = 10;", "x"}},
- {"x = 20; return eval('');",
- 9 * kPointerSize,
- 1,
- 69,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), //
- U8(1), //
- B(PushContext), R(0), //
- B(Ldar), THIS(1), //
- B(StaContextSlot), R(context), U8(first_context_slot), //
- B(CreateMappedArguments), //
- B(StaContextSlot), R(context), U8(first_context_slot + 1), //
- B(Ldar), R(new_target), //
- B(StaContextSlot), R(context), U8(first_context_slot + 2), //
- B(StackCheck), //
- B(LdaSmi8), U8(20), //
- B(StaLookupSlotSloppy), U8(0), //
- B(LdaConstant), U8(1), //
- B(Star), R(3), //
- B(CallRuntimeForPair), U16(Runtime::kLoadLookupSlotForCall), //
- /* */ R(3), U8(1), R(1), //
- B(LdaConstant), U8(2), //
- B(Star), R(3), //
- B(Mov), R(1), R(4), //
- B(Mov), R(3), R(5), //
- B(Mov), R(closure), R(6), //
- B(LdaZero), //
- B(Star), R(7), //
- B(LdaSmi8), U8(10), //
- B(Star), R(8), //
- B(CallRuntime), U16(Runtime::kResolvePossiblyDirectEval), R(4), //
- /* */ U8(5), //
- B(Star), R(1), //
- B(Call), R(1), R(2), U8(2), U8(0), //
- B(Return), //
- },
- 3,
- {"x", "eval", ""}},
+ "eval('var x = 10;'); return typeof x;",
+
+ "x = 20; return eval('');",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("LookupSlot.golden"));
}
-
TEST(CallLookupSlot) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- Zone zone;
-
- FeedbackVectorSpec feedback_spec(&zone);
- FeedbackVectorSlot slot1 = feedback_spec.AddLoadICSlot();
- FeedbackVectorSlot slot2 = feedback_spec.AddCallICSlot();
- USE(slot1);
-
- Handle<i::TypeFeedbackVector> vector =
- i::NewTypeFeedbackVector(helper.isolate(), &feedback_spec);
-
- int closure = Register::function_closure().index();
- int context = Register::current_context().index();
- int new_target = Register::new_target().index();
-
- // clang-format off
- ExpectedSnippet<InstanceType> snippets[] = {
- {"g = function(){}; eval(''); return g();",
- 9 * kPointerSize,
- 1,
- 85,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), //
- /* */ U8(1), //
- B(PushContext), R(0), //
- B(Ldar), THIS(1), //
- B(StaContextSlot), R(context), U8(4), //
- B(CreateMappedArguments), //
- B(StaContextSlot), R(context), U8(5), //
- B(Ldar), R(new_target), //
- B(StaContextSlot), R(context), U8(6), //
- B(StackCheck), //
- B(CreateClosure), U8(0), U8(0), //
- B(StaLookupSlotSloppy), U8(1), //
- B(LdaConstant), U8(2), //
- B(Star), R(3), //
- B(CallRuntimeForPair), U16(Runtime::kLoadLookupSlotForCall), //
- R(3), U8(1), R(1), //
- B(LdaConstant), U8(3), //
- B(Star), R(3), //
- B(Mov), R(1), R(4), //
- B(Mov), R(3), R(5), //
- B(Mov), R(closure), R(6), //
- B(LdaZero), //
- B(Star), R(7), //
- B(LdaSmi8), U8(10), //
- B(Star), R(8), //
- B(CallRuntime), U16(Runtime::kResolvePossiblyDirectEval), R(4), //
- U8(5), //
- B(Star), R(1), //
- B(Call), R(1), R(2), U8(2), U8(0), //
- B(LdaConstant), U8(1), //
- B(Star), R(3), //
- B(CallRuntimeForPair), U16(Runtime::kLoadLookupSlotForCall), //
- R(3), U8(1), R(1), //
- B(Call), R(1), R(2), U8(1), U8(vector->GetIndex(slot2)), //
- B(Return), //
- },
- 4,
- {InstanceType::SHARED_FUNCTION_INFO_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
+ const char* snippets[] = {
+ "g = function(){}; eval(''); return g();",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("CallLookupSlot.golden"));
}
-
// TODO(mythria): tests for variable/function declaration in lookup slots.
TEST(LookupSlotInEval) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
- const char* function_prologue = "var f;"
- "var x = 1;"
- "function f1() {"
- " eval(\"function t() {";
- const char* function_epilogue = " }; f = t; f();\");"
- "}"
- "f1();";
+ const char* snippets[] = {
+ "return x;",
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"return x;",
- 0 * kPointerSize,
- 1,
- 4,
- {
- B(StackCheck), //
- B(LdaLookupSlot), U8(0), //
- B(Return) //
- },
- 1,
- {"x"}},
- {"x = 10;",
- 0 * kPointerSize,
- 1,
- 7,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(StaLookupSlotSloppy), U8(0), //
- B(LdaUndefined), //
- B(Return), //
- },
- 1,
- {"x"}},
- {"'use strict'; x = 10;",
- 0 * kPointerSize,
- 1,
- 7,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(StaLookupSlotStrict), U8(0), //
- B(LdaUndefined), //
- B(Return), //
- },
- 1,
- {"x"}},
- {"return typeof x;",
- 0 * kPointerSize,
- 1,
- 5,
- {
- B(StackCheck), //
- B(LdaLookupSlotInsideTypeof), U8(0), //
- B(TypeOf), //
- B(Return), //
- },
- 1,
- {"x"}},
+ "x = 10;",
+
+ "'use strict'; x = 10;",
+
+ "return typeof x;",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- std::string script = std::string(function_prologue) +
- std::string(snippets[i].code_snippet) +
- std::string(function_epilogue);
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecode(script.c_str(), "*", "f");
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ std::string actual = BuildActual(printer, snippets,
+ "var f;\n"
+ "var x = 1;\n"
+ "function f1() {\n"
+ " eval(\"function t() { ",
+
+ " }; f = t; f();\");\n"
+ "}\n"
+ "f1();");
+
+ CHECK_EQ(actual, LoadGolden("LookupSlotInEval.golden"));
}
-
TEST(LookupSlotWideInEval) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
- const char* function_prologue =
- "var f;"
- "var x = 1;"
- "function f1() {"
- " eval(\"function t() {";
- const char* function_epilogue =
- " }; f = t; f();\");"
- "}"
- "f1();";
+ const char* snippets[] = {
+ REPEAT_256(" \"var y = 2.3;\" +\n") //
+ " \"return x;\" +\n",
- int const_count[] = {0, 0, 0, 0};
- // clang-format off
- ExpectedSnippet<InstanceType, 257> snippets[] = {
- {REPEAT_256(SPACE, "var y = 2.3;")
- "return x;",
- 1 * kPointerSize,
- 1,
- 1029,
- {
- B(StackCheck), //
- REPEAT_256(SPACE, //
- B(LdaConstant), U8(const_count[0]++), //
- B(Star), R(0), ) //
- B(LdaLookupSlotWide), U16(256), //
- B(Return) //
- },
- 257,
- {REPEAT_256(COMMA, InstanceType::HEAP_NUMBER_TYPE),
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {REPEAT_256(SPACE, "var y = 2.3;")
- "return typeof x;",
- 1 * kPointerSize,
- 1,
- 1030,
- {
- B(StackCheck), //
- REPEAT_256(SPACE, //
- B(LdaConstant), U8(const_count[1]++), //
- B(Star), R(0), ) //
- B(LdaLookupSlotInsideTypeofWide), U16(256), //
- B(TypeOf), //
- B(Return) //
- },
- 257,
- {REPEAT_256(COMMA, InstanceType::HEAP_NUMBER_TYPE),
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {REPEAT_256(SPACE, "var y = 2.3;")
- "x = 10;",
- 1 * kPointerSize,
- 1,
- 1032,
- {
- B(StackCheck), //
- REPEAT_256(SPACE, //
- B(LdaConstant), U8(const_count[2]++), //
- B(Star), R(0), ) //
- B(LdaSmi8), U8(10), //
- B(StaLookupSlotSloppyWide), U16(256), //
- B(LdaUndefined), //
- B(Return) //
- },
- 257,
- {REPEAT_256(COMMA, InstanceType::HEAP_NUMBER_TYPE),
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"'use strict';"
- REPEAT_256(SPACE, "var y = 2.3;")
- "x = 10;",
- 1 * kPointerSize,
- 1,
- 1032,
- {
- B(StackCheck), //
- REPEAT_256(SPACE, //
- B(LdaConstant), U8(const_count[3]++), //
- B(Star), R(0), ) //
- B(LdaSmi8), U8(10), //
- B(StaLookupSlotStrictWide), U16(256), //
- B(LdaUndefined), //
- B(Return) //
- },
- 257,
- {REPEAT_256(COMMA, InstanceType::HEAP_NUMBER_TYPE),
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
+ REPEAT_256(" \"var y = 2.3;\" +\n") //
+ " \"return typeof x;\" +\n",
+
+ REPEAT_256(" \"var y = 2.3;\" +\n") //
+ " \"x = 10;\" +\n",
+
+ " \"'use strict';\" +\n" //
+ REPEAT_256(" \"var y = 2.3;\" +\n") //
+ " \"x = 10;\" +\n",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- std::string script = std::string(function_prologue) +
- std::string(snippets[i].code_snippet) +
- std::string(function_epilogue);
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecode(script.c_str(), "*", "f");
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ std::string actual = BuildActual(printer, snippets,
+ "var f;\n"
+ "var x = 1;\n"
+ "function f1() {\n"
+ " eval(\"function t() {\" +\n",
+
+ " \"};\" +\n"
+ " \"f = t; f();\"\n);\n"
+ "}\n"
+ "f1();");
+
+ CHECK_EQ(actual, LoadGolden("LookupSlotWideInEval.golden"));
}
-
TEST(DeleteLookupSlotInEval) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
+ printer.set_wrap(false);
+ printer.set_test_function_name("f");
- const char* function_prologue = "var f;"
- "var x = 1;"
- "z = 10;"
- "function f1() {"
- " var y;"
- " eval(\"function t() {";
- const char* function_epilogue = " }; f = t; f();\");"
- "}"
- "f1();";
+ const char* snippets[] = {
+ "delete x;",
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"delete x;",
- 1 * kPointerSize,
- 1,
- 12,
- {
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Star), R(0), //
- B(CallRuntime), U16(Runtime::kDeleteLookupSlot), R(0), U8(1), //
- B(LdaUndefined), //
- B(Return) //
- },
- 1,
- {"x"}},
- {"return delete y;",
- 0 * kPointerSize,
- 1,
- 3,
- {
- B(StackCheck), //
- B(LdaFalse), //
- B(Return) //
- },
- 0},
- {"return delete z;",
- 1 * kPointerSize,
- 1,
- 11,
- {
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Star), R(0), //
- B(CallRuntime), U16(Runtime::kDeleteLookupSlot), R(0), U8(1), //
- B(Return) //
- },
- 1,
- {"z"}},
+ "return delete y;",
+
+ "return delete z;",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- std::string script = std::string(function_prologue) +
- std::string(snippets[i].code_snippet) +
- std::string(function_epilogue);
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecode(script.c_str(), "*", "f");
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ std::string actual = BuildActual(printer, snippets,
+ "var f;\n"
+ "var x = 1;\n"
+ "z = 10;\n"
+ "function f1() {\n"
+ " var y;\n"
+ " eval(\"function t() { ",
+
+ " }; f = t; f();\");\n"
+ "}\n"
+ "f1();");
+
+ CHECK_EQ(actual, LoadGolden("DeleteLookupSlotInEval.golden"));
}
TEST(WideRegisters) {
@@ -7949,1154 +1908,251 @@
}
std::string prologue(os.str());
- // clang-format off
- ExpectedSnippet<int> snippets[] = {
- {"x0 = x127;\n"
- "return x0;\n",
- 161 * kPointerSize,
- 1,
- 11,
- {
- B(StackCheck), //
- B(MovWide), R16(131), R16(125), //
- B(Ldar), R(125), //
- B(Star), R(0), //
- B(Return), //
- }},
- {"x127 = x126;\n"
- "return x127;\n",
- 161 * kPointerSize,
- 1,
- 23,
- {
- B(StackCheck), //
- B(MovWide), R16(130), R16(125), //
- B(Ldar), R(125), //
- B(Star), R(125), //
- B(MovWide), R16(125), R16(131), //
- B(MovWide), R16(131), R16(125), //
- B(Ldar), R(125), //
- B(Return), //
- }},
- {"if (x2 > 3) { return x129; }\n"
- "return x128;\n",
- 162 * kPointerSize,
- 1,
- 37,
- {
- B(StackCheck), //
- B(Ldar), R(2), //
- B(Star), R(125), //
- B(MovWide), R16(125), R16(161), //
- B(LdaSmi8), U8(3), //
- B(MovWide), R16(161), R16(125), //
- B(TestGreaterThan), R(125), //
- B(JumpIfFalse), U8(10), //
- B(MovWide), R16(133), R16(125), //
- B(Ldar), R(125), //
- B(Return), //
- B(MovWide), R16(132), R16(125), //
- B(Ldar), R(125), //
- B(Return), //
- }},
- {"var x0 = 0;\n"
- "if (x129 == 3) { var x129 = x0; }\n"
- "if (x2 > 3) { return x0; }\n"
- "return x129;\n",
- 162 * kPointerSize,
- 1,
- 69,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(MovWide), R16(133), R16(125), //
- B(Ldar), R(125), //
- B(Star), R(125), //
- B(MovWide), R16(125), R16(161), //
- B(LdaSmi8), U8(3), //
- B(MovWide), R16(161), R16(125), //
- B(TestEqual), R(125), //
- B(JumpIfFalse), U8(11), //
- B(Ldar), R(0), //
- B(Star), R(125), //
- B(MovWide), R16(125), R16(133), //
- B(Ldar), R(2), //
- B(Star), R(125), //
- B(MovWide), R16(125), R16(161), //
- B(LdaSmi8), U8(3), //
- B(MovWide), R16(161), R16(125), //
- B(TestGreaterThan), R(125), //
- B(JumpIfFalse), U8(5), //
- B(Ldar), R(0), //
- B(Return), //
- B(MovWide), R16(133), R16(125), //
- B(Ldar), R(125), //
- B(Return), //
- }},
- {"var x0 = 0;\n"
- "var x1 = 0;\n"
- "for (x128 = 0; x128 < 64; x128++) {"
- " x1 += x128;"
- "}"
- "return x128;\n",
- 162 * kPointerSize,
- 1,
- 99,
- {
- B(StackCheck), //
- B(LdaZero), //
- B(Star), R(0), //
- B(LdaZero), //
- B(Star), R(1), //
- B(LdaZero), //
- B(Star), R(125), //
- B(MovWide), R16(125), R16(132), //
- B(MovWide), R16(132), R16(125), //
- B(Ldar), R(125), //
- B(Star), R(125), //
- B(MovWide), R16(125), R16(161), //
- B(LdaSmi8), U8(64), //
- B(MovWide), R16(161), R16(125), //
- B(TestLessThan), R(125), //
- B(JumpIfFalse), U8(53), //
- B(StackCheck), //
- B(Ldar), R(1), //
- B(Star), R(125), //
- B(MovWide), R16(125), R16(161), //
- B(MovWide), R16(132), R16(125), //
- B(Ldar), R(125), //
- B(MovWide), R16(161), R16(125), //
- B(Add), R(125), //
- B(Star), R(1), //
- B(MovWide), R16(132), R16(125), //
- B(Ldar), R(125), //
- B(ToNumber), //
- B(Star), R(125), //
- B(MovWide), R16(125), R16(161), //
- B(Inc), //
- B(Star), R(125), //
- B(MovWide), R16(125), R16(132), //
- B(Jump), U8(-74), //
- B(MovWide), R16(132), R16(125), //
- B(Ldar), R(125), //
- B(Return), //
- }},
- {"var x0 = 1234;\n"
- "var x1 = 0;\n"
- "for (x128 in x0) {"
- " x1 += x128;"
- "}"
- "return x1;\n",
- 167 * kPointerSize,
- 1,
- 111,
- {
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(Star), R(0), //
- B(LdaZero), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(JumpIfUndefined), U8(98), //
- B(JumpIfNull), U8(96), //
- B(ToObject), //
- B(JumpIfNull), U8(93), //
- B(Star), R(125), //
- B(MovWide), R16(125), R16(161), //
- B(ForInPrepareWide), R16(162), //
- B(LdaZero), //
- B(Star), R(125), //
- B(MovWide), R16(125), R16(165), //
- B(MovWide), R16(165), R16(125), //
- B(MovWide), R16(164), R16(126), //
- B(ForInDone), R(125), R(126), //
- B(JumpIfTrue), U8(60), //
- B(ForInNextWide), R16(161), R16(165), R16(162), //
- B(JumpIfUndefined), U8(35), //
- B(Star), R(125), //
- B(MovWide), R16(125), R16(132), //
- B(StackCheck), //
- B(Ldar), R(1), //
- B(Star), R(125), //
- B(MovWide), R16(125), R16(166), //
- B(MovWide), R16(132), R16(125), //
- B(Ldar), R(125), //
- B(MovWide), R16(166), R16(125), //
- B(Add), R(125), //
- B(Star), R(1), //
- B(MovWide), R16(165), R16(125), //
- B(ForInStep), R(125), //
- B(Star), R(125), //
- B(MovWide), R16(125), R16(165), //
- B(Jump), U8(-71), //
- B(Ldar), R(1), //
- B(Return), //
- },
- 1,
- {1234}},
- {"x0 = %Add(x64, x63);\n"
- "x1 = %Add(x27, x143);\n"
- "%TheHole();\n"
- "return x1;\n",
- 163 * kPointerSize,
- 1,
- 66,
- {
- B(StackCheck), //
- B(Ldar), R(64), //
- B(Star), R(125), //
- B(MovWide), R16(125), R16(161), //
- B(Ldar), R(63), //
- B(Star), R(125), //
- B(MovWide), R16(125), R16(162), //
- B(CallRuntimeWide), U16(Runtime::kAdd), R16(161), U8(2), //
- B(Star), R(0), //
- B(Ldar), R(27), //
- B(Star), R(125), //
- B(MovWide), R16(125), R16(161), //
- B(MovWide), R16(147), R16(125), //
- B(Ldar), R(125), //
- B(Star), R(125), //
- B(MovWide), R16(125), R16(162), //
- B(CallRuntimeWide), U16(Runtime::kAdd), R16(161), U8(2), //
- B(Star), R(1), //
- B(CallRuntime), U16(Runtime::kTheHole), R(0), U8(0), //
- B(Ldar), R(1), //
- B(Return), //
- }}
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kNumber);
+ const char* snippets[] = {
+ "x0 = x127;\n"
+ "return x0;",
+
+ "x127 = x126;\n"
+ "return x127;",
+
+ "if (x2 > 3) { return x129; }\n"
+ "return x128;",
+
+ "var x0 = 0;\n"
+ "if (x129 == 3) { var x129 = x0; }\n"
+ "if (x2 > 3) { return x0; }\n"
+ "return x129;",
+
+ "var x0 = 0;\n"
+ "var x1 = 0;\n"
+ "for (x128 = 0; x128 < 64; x128++) {"
+ " x1 += x128;"
+ "}"
+ "return x128;",
+
+ "var x0 = 1234;\n"
+ "var x1 = 0;\n"
+ "for (x128 in x0) {"
+ " x1 += x128;"
+ "}"
+ "return x1;",
+
+ "x0 = %Add(x64, x63);\n"
+ "x1 = %Add(x27, x143);\n"
+ "%TheHole();\n"
+ "return x1;",
};
- // clang-format on
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
-
- for (size_t i = 0; i < arraysize(snippets); ++i) {
- std::string body = prologue + snippets[i].code_snippet;
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(body.c_str());
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets, prologue.c_str()),
+ LoadGolden("WideRegisters.golden"));
}
TEST(ConstVariable) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"const x = 10;",
- 1 * kPointerSize,
- 1,
- 10,
- {
- B(LdaTheHole), //
- B(Star), R(0), //
- B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(Star), R(0), //
- B(LdaUndefined), //
- B(Return) //
- },
- 0},
- {"const x = 10; return x;",
- 2 * kPointerSize,
- 1,
- 20,
- {
- B(LdaTheHole), //
- B(Star), R(0), //
- B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(Star), R(0), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(0), //
- B(Star), R(1), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(1), U8(1), //
- B(Return) //
- },
- 1,
- {"x"}},
- {"const x = ( x = 20);",
- 3 * kPointerSize,
- 1,
- 32,
- {
- B(LdaTheHole), //
- B(Star), R(0), //
- B(StackCheck), //
- B(LdaSmi8), U8(20), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(0), //
- B(Star), R(2), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(2), U8(1), //
- B(CallRuntime), U16(Runtime::kThrowConstAssignError), R(0), //
- /* */ U8(0), //
- B(Ldar), R(1), //
- B(Star), R(0), //
- B(LdaUndefined), //
- B(Return) //
- },
- 1,
- {"x"}},
- {"const x = 10; x = 20;",
- 3 * kPointerSize,
- 1,
- 36,
- {
- B(LdaTheHole), //
- B(Star), R(0), //
- B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(Star), R(0), //
- B(LdaSmi8), U8(20), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(0), //
- B(Star), R(2), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(2), U8(1), //
- B(CallRuntime), U16(Runtime::kThrowConstAssignError), R(0), //
- /* */ U8(0), //
- B(Ldar), R(1), //
- B(Star), R(0), //
- B(LdaUndefined), //
- B(Return) //
- },
- 1,
- {"x"}},
- };
- // clang-format on
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
+ const char* snippets[] = {
+ "const x = 10;",
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ "const x = 10; return x;",
+
+ "const x = ( x = 20);",
+
+ "const x = 10; x = 20;",
+ };
+
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("ConstVariable.golden"));
}
TEST(LetVariable) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
+ const char* snippets[] = {
+ "let x = 10;",
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"let x = 10;",
- 1 * kPointerSize,
- 1,
- 10,
- {
- B(LdaTheHole), //
- B(Star), R(0), //
- B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(Star), R(0), //
- B(LdaUndefined), //
- B(Return) //
- },
- 0},
- {"let x = 10; return x;",
- 2 * kPointerSize,
- 1,
- 20,
- {
- B(LdaTheHole), //
- B(Star), R(0), //
- B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(Star), R(0), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(0), //
- B(Star), R(1), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(1), U8(1), //
- B(Return) //
- },
- 1,
- {"x"}},
- {"let x = (x = 20);",
- 3 * kPointerSize,
- 1,
- 27,
- {
- B(LdaTheHole), //
- B(Star), R(0), //
- B(StackCheck), //
- B(LdaSmi8), U8(20), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(0), //
- B(Star), R(2), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(2), U8(1), //
- B(Ldar), R(1), //
- B(Star), R(0), //
- B(LdaUndefined), //
- B(Return) //
- },
- 1,
- {"x"}},
- {"let x = 10; x = 20;",
- 3 * kPointerSize,
- 1,
- 31,
- {
- B(LdaTheHole), //
- B(Star), R(0), //
- B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(Star), R(0), //
- B(LdaSmi8), U8(20), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(0), //
- B(Star), R(2), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(2), U8(1), //
- B(Ldar), R(1), //
- B(Star), R(0), //
- B(LdaUndefined), //
- B(Return) //
- },
- 1,
- {"x"}},
+ "let x = 10; return x;",
+
+ "let x = (x = 20);",
+
+ "let x = 10; x = 20;",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
-}
-
-TEST(LegacyConstVariable) {
- bool old_legacy_const_flag = FLAG_legacy_const;
- FLAG_legacy_const = true;
-
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
-
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"const x = 10;",
- 2 * kPointerSize,
- 1,
- 19,
- {
- B(LdaTheHole), //
- B(Star), R(0), //
- B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(JumpIfNotHole), U8(5), //
- B(Mov), R(1), R(0), //
- B(Ldar), R(1), //
- B(LdaUndefined), //
- B(Return) //
- },
- 0},
- {"const x = 10; return x;",
- 2 * kPointerSize,
- 1,
- 23,
- {
- B(LdaTheHole), //
- B(Star), R(0), //
- B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(JumpIfNotHole), U8(5), //
- B(Mov), R(1), R(0), //
- B(Ldar), R(1), //
- B(Ldar), R(0), //
- B(JumpIfNotHole), U8(3), //
- B(LdaUndefined), //
- B(Return) //
- },
- 0},
- {"const x = ( x = 20);",
- 2 * kPointerSize,
- 1,
- 23,
- {
- B(LdaTheHole), //
- B(Star), R(0), //
- B(StackCheck), //
- B(LdaSmi8), U8(20), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(Ldar), R(1), //
- B(Ldar), R(0), //
- B(JumpIfNotHole), U8(5), //
- B(Mov), R(1), R(0), //
- B(Ldar), R(1), //
- B(LdaUndefined), //
- B(Return) //
- },
- 0},
- {"const x = 10; x = 20;",
- 2 * kPointerSize,
- 1,
- 27,
- {
- B(LdaTheHole), //
- B(Star), R(0), //
- B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(JumpIfNotHole), U8(5), //
- B(Mov), R(1), R(0), //
- B(Ldar), R(1), //
- B(LdaSmi8), U8(20), //
- B(Star), R(1), //
- B(Ldar), R(0), //
- B(Ldar), R(1), //
- B(LdaUndefined), //
- B(Return) //
- },
- 0},
- };
- // clang-format on
-
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
-
- FLAG_legacy_const = old_legacy_const_flag;
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("LetVariable.golden"));
}
TEST(ConstVariableContextSlot) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
-
- int closure = Register::function_closure().index();
- int context = Register::current_context().index();
-
// TODO(mythria): Add tests for initialization of this via super calls.
// TODO(mythria): Add tests that walk the context chain.
- // clang-format off
- ExpectedSnippet<InstanceType> snippets[] = {
- {"const x = 10; function f1() {return x;}",
- 2 * kPointerSize,
- 1,
- 24,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), //
- U8(1), //
- B(PushContext), R(1), //
- B(LdaTheHole), //
- B(StaContextSlot), R(context), U8(4), //
- B(CreateClosure), U8(0), U8(0), //
- B(Star), R(0), //
- B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(StaContextSlot), R(context), U8(4), //
- B(LdaUndefined), //
- B(Return) //
- },
- 1,
- {InstanceType::SHARED_FUNCTION_INFO_TYPE}},
- {"const x = 10; function f1() {return x;} return x;",
- 3 * kPointerSize,
- 1,
- 37,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), //
- U8(1), //
- B(PushContext), R(1), //
- B(LdaTheHole), //
- B(StaContextSlot), R(context), U8(4), //
- B(CreateClosure), U8(0), U8(0), //
- B(Star), R(0), //
- B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(StaContextSlot), R(context), U8(4), //
- B(LdaContextSlot), R(context), U8(4), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(1), //
- B(Star), R(2), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(2), U8(1), //
- B(Return) //
- },
- 2,
- {InstanceType::SHARED_FUNCTION_INFO_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"const x = (x = 20); function f1() {return x;}",
- 4 * kPointerSize,
- 1,
- 50,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), //
- /* */ U8(1), //
- B(PushContext), R(1), //
- B(LdaTheHole), //
- B(StaContextSlot), R(context), U8(4), //
- B(CreateClosure), U8(0), U8(0), //
- B(Star), R(0), //
- B(StackCheck), //
- B(LdaSmi8), U8(20), //
- B(Star), R(2), //
- B(LdaContextSlot), R(context), U8(4), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(1), //
- B(Star), R(3), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(3), U8(1), //
- B(CallRuntime), U16(Runtime::kThrowConstAssignError), R(0), //
- U8(0), //
- B(Ldar), R(2), //
- B(StaContextSlot), R(context), U8(4), //
- B(StaContextSlot), R(context), U8(4), //
- B(LdaUndefined), //
- B(Return) //
- },
- 2,
- {InstanceType::SHARED_FUNCTION_INFO_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"const x = 10; x = 20; function f1() {return x;}",
- 4 * kPointerSize,
- 1,
- 52,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), //
- /* */ U8(1), //
- B(PushContext), R(1), //
- B(LdaTheHole), //
- B(StaContextSlot), R(context), U8(4), //
- B(CreateClosure), U8(0), U8(0), //
- B(Star), R(0), //
- B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(StaContextSlot), R(context), U8(4), //
- B(LdaSmi8), U8(20), //
- B(Star), R(2), //
- B(LdaContextSlot), R(context), U8(4), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(1), //
- B(Star), R(3), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(3), U8(1), //
- B(CallRuntime), U16(Runtime::kThrowConstAssignError), R(0), //
- U8(0), //
- B(Ldar), R(2), //
- B(StaContextSlot), R(context), U8(4), //
- B(LdaUndefined), //
- B(Return) //
- },
- 2,
- {InstanceType::SHARED_FUNCTION_INFO_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- };
- // clang-format on
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
+ const char* snippets[] = {
+ "const x = 10; function f1() {return x;}",
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ "const x = 10; function f1() {return x;} return x;",
+
+ "const x = (x = 20); function f1() {return x;}",
+
+ "const x = 10; x = 20; function f1() {return x;}",
+ };
+
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("ConstVariableContextSlot.golden"));
}
TEST(LetVariableContextSlot) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
+ const char* snippets[] = {
+ "let x = 10; function f1() {return x;}",
- int closure = Register::function_closure().index();
- int context = Register::current_context().index();
+ "let x = 10; function f1() {return x;} return x;",
- // clang-format off
- ExpectedSnippet<InstanceType> snippets[] = {
- {"let x = 10; function f1() {return x;}",
- 2 * kPointerSize,
- 1,
- 24,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), //
- /* */ U8(1), //
- B(PushContext), R(1), //
- B(LdaTheHole), //
- B(StaContextSlot), R(context), U8(4), //
- B(CreateClosure), U8(0), U8(0), //
- B(Star), R(0), //
- B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(StaContextSlot), R(context), U8(4), //
- B(LdaUndefined), //
- B(Return) //
- },
- 1,
- {InstanceType::SHARED_FUNCTION_INFO_TYPE}},
- {"let x = 10; function f1() {return x;} return x;",
- 3 * kPointerSize,
- 1,
- 37,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), //
- /* */ U8(1), //
- B(PushContext), R(1), //
- B(LdaTheHole), //
- B(StaContextSlot), R(context), U8(4), //
- B(CreateClosure), U8(0), U8(0), //
- B(Star), R(0), //
- B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(StaContextSlot), R(context), U8(4), //
- B(LdaContextSlot), R(context), U8(4), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(1), //
- B(Star), R(2), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(2), U8(1), //
- B(Return) //
- },
- 2,
- {InstanceType::SHARED_FUNCTION_INFO_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"let x = (x = 20); function f1() {return x;}",
- 4 * kPointerSize,
- 1,
- 45,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), //
- /* */ U8(1), //
- B(PushContext), R(1), //
- B(LdaTheHole), //
- B(StaContextSlot), R(context), U8(4), //
- B(CreateClosure), U8(0), U8(0), //
- B(Star), R(0), //
- B(StackCheck), //
- B(LdaSmi8), U8(20), //
- B(Star), R(2), //
- B(LdaContextSlot), R(context), U8(4), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(1), //
- B(Star), R(3), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(3), U8(1), //
- B(Ldar), R(2), //
- B(StaContextSlot), R(context), U8(4), //
- B(StaContextSlot), R(context), U8(4), //
- B(LdaUndefined), //
- B(Return) //
- },
- 2,
- {InstanceType::SHARED_FUNCTION_INFO_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
- {"let x = 10; x = 20; function f1() {return x;}",
- 4 * kPointerSize,
- 1,
- 47,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), //
- /* */ U8(1), //
- B(PushContext), R(1), //
- B(LdaTheHole), //
- B(StaContextSlot), R(context), U8(4), //
- B(CreateClosure), U8(0), U8(0), //
- B(Star), R(0), //
- B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(StaContextSlot), R(context), U8(4), //
- B(LdaSmi8), U8(20), //
- B(Star), R(2), //
- B(LdaContextSlot), R(context), U8(4), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(1), //
- B(Star), R(3), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(3), U8(1), //
- B(Ldar), R(2), //
- B(StaContextSlot), R(context), U8(4), //
- B(LdaUndefined), //
- B(Return) //
- },
- 2,
- {InstanceType::SHARED_FUNCTION_INFO_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
+ "let x = (x = 20); function f1() {return x;}",
+
+ "let x = 10; x = 20; function f1() {return x;}",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("LetVariableContextSlot.golden"));
}
TEST(DoExpression) {
bool old_flag = FLAG_harmony_do_expressions;
FLAG_harmony_do_expressions = true;
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
+ const char* snippets[] = {
+ "var a = do { }; return a;",
- // clang-format off
- ExpectedSnippet<const char*> snippets[] = {
- {"var a = do { }; return a;",
- 2 * kPointerSize,
- 1,
- 6,
- {
- B(StackCheck), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(Return) //
- },
- 0},
- {"var a = do { var x = 100; }; return a;",
- 3 * kPointerSize,
- 1,
- 11,
- {
- B(StackCheck), //
- B(LdaSmi8), U8(100), //
- B(Star), R(1), //
- B(LdaUndefined), //
- B(Star), R(0), //
- B(Star), R(2), //
- B(Return) //
- },
- 0},
- {"while(true) { var a = 10; a = do { ++a; break; }; a = 20; }",
- 2 * kPointerSize,
- 1,
- 26,
- {
- B(StackCheck), //
- B(StackCheck), //
- B(LdaSmi8), U8(10), //
- B(Star), R(1), //
- B(ToNumber), //
- B(Inc), //
- B(Star), R(1), //
- B(Star), R(0), //
- B(Jump), U8(12), //
- B(Ldar), R(0), //
- B(Star), R(1), //
- B(LdaSmi8), U8(20), //
- B(Star), R(1), //
- B(Jump), U8(-21), //
- B(LdaUndefined), //
- B(Return), //
- },
- 0},
+ "var a = do { var x = 100; }; return a;",
+
+ "while(true) { var a = 10; a = do { ++a; break; }; a = 20; }",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("DoExpression.golden"));
+
FLAG_harmony_do_expressions = old_flag;
}
TEST(WithStatement) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
-
- int deep_elements_flags =
- ObjectLiteral::kFastElements | ObjectLiteral::kDisableMementos;
- int context = Register::current_context().index();
- int closure = Register::function_closure().index();
- int new_target = Register::new_target().index();
-
- // clang-format off
- ExpectedSnippet<InstanceType> snippets[] = {
- {"with ({x:42}) { return x; }",
- 5 * kPointerSize,
- 1,
- 47,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), //
- /* */ U8(1), //
- B(PushContext), R(0), //
- B(Ldar), THIS(1), //
- B(StaContextSlot), R(context), U8(4), //
- B(CreateMappedArguments), //
- B(StaContextSlot), R(context), U8(5), //
- B(Ldar), R(new_target), //
- B(StaContextSlot), R(context), U8(6), //
- B(StackCheck), //
- B(CreateObjectLiteral), U8(0), U8(0), U8(deep_elements_flags), //
- B(Star), R(2), //
- B(ToObject), //
- B(Star), R(3), //
- B(Ldar), R(closure), //
- B(Star), R(4), //
- B(CallRuntime), U16(Runtime::kPushWithContext), R(3), U8(2), //
- B(PushContext), R(1), //
- B(LdaLookupSlot), U8(1), //
- B(PopContext), R(0), //
- B(Return), //
- },
- 2,
- {InstanceType::FIXED_ARRAY_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
+ const char* snippets[] = {
+ "with ({x:42}) { return x; }",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("WithStatement.golden"));
}
TEST(DoDebugger) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
-
- // clang-format off
- ExpectedSnippet<const char*> snippet = {
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kString);
+ const char* snippets[] = {
"debugger;",
- 0,
- 1,
- 4,
- {
- B(StackCheck), //
- B(Debugger), //
- B(LdaUndefined), //
- B(Return) //
- },
- 0
};
- // clang-format on
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippet.code_snippet);
- CheckBytecodeArrayEqual(snippet, bytecode_array);
+ CHECK_EQ(BuildActual(printer, snippets), LoadGolden("DoDebugger.golden"));
}
-// TODO(rmcilroy): Update expectations after switch to
-// Runtime::kDefineDataPropertyInLiteral.
TEST(ClassDeclarations) {
- InitializedHandleScope handle_scope;
- BytecodeGeneratorHelper helper;
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
+ const char* snippets[] = {
+ "class Person {\n"
+ " constructor(name) { this.name = name; }\n"
+ " speak() { console.log(this.name + ' is speaking.'); }\n"
+ "}",
- int closure = Register::function_closure().index();
- int context = Register::current_context().index();
+ "class person {\n"
+ " constructor(name) { this.name = name; }\n"
+ " speak() { console.log(this.name + ' is speaking.'); }\n"
+ "}",
- // clang-format off
- ExpectedSnippet<InstanceType, 12> snippets[] = {
- {"class Person {\n"
- " constructor(name) { this.name = name; }\n"
- " speak() { console.log(this.name + ' is speaking.'); }\n"
- "}\n",
- 9 * kPointerSize,
- 1,
- 71,
- {
- B(LdaTheHole), //
- B(Star), R(1), //
- B(StackCheck), //
- B(LdaTheHole), //
- B(Star), R(0), //
- B(LdaTheHole), //
- B(Star), R(2), //
- B(CreateClosure), U8(0), U8(0), //
- B(Star), R(3), //
- B(LdaSmi8), U8(15), //
- B(Star), R(4), //
- B(LdaConstant), U8(1), //
- B(Star), R(5), //
- B(CallRuntime), U16(Runtime::kDefineClass), R(2), U8(4), //
- B(Star), R(2), //
- B(LoadIC), R(2), U8(2), U8(1), //
- B(Star), R(3), //
- B(Mov), R(3), R(4), //
- B(LdaConstant), U8(3), //
- B(Star), R(5), //
- B(CreateClosure), U8(4), U8(0), //
- B(Star), R(6), //
- B(LdaSmi8), U8(2), //
- B(Star), R(7), //
- B(LdaZero), //
- B(Star), R(8), //
- B(CallRuntime), U16(Runtime::kDefineDataPropertyInLiteral), R(4), U8(5),
- B(CallRuntime), U16(Runtime::kFinalizeClassDefinition), R(2), U8(2), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaUndefined), //
- B(Return) //
- },
- 5,
- { InstanceType::SHARED_FUNCTION_INFO_TYPE, kInstanceTypeDontCare,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::SHARED_FUNCTION_INFO_TYPE}},
- {"class person {\n"
- " constructor(name) { this.name = name; }\n"
- " speak() { console.log(this.name + ' is speaking.'); }\n"
- "}\n",
- 9 * kPointerSize,
- 1,
- 71,
- {
- B(LdaTheHole), //
- B(Star), R(1), //
- B(StackCheck), //
- B(LdaTheHole), //
- B(Star), R(0), //
- B(LdaTheHole), //
- B(Star), R(2), //
- B(CreateClosure), U8(0), U8(0), //
- B(Star), R(3), //
- B(LdaSmi8), U8(15), //
- B(Star), R(4), //
- B(LdaConstant), U8(1), //
- B(Star), R(5), //
- B(CallRuntime), U16(Runtime::kDefineClass), R(2), U8(4), //
- B(Star), R(2), //
- B(LoadIC), R(2), U8(2), U8(1), //
- B(Star), R(3), //
- B(Mov), R(3), R(4), //
- B(LdaConstant), U8(3), //
- B(Star), R(5), //
- B(CreateClosure), U8(4), U8(0), //
- B(Star), R(6), //
- B(LdaSmi8), U8(2), //
- B(Star), R(7), //
- B(LdaZero), //
- B(Star), R(8), //
- B(CallRuntime), U16(Runtime::kDefineDataPropertyInLiteral), R(4), U8(5),
- B(CallRuntime), U16(Runtime::kFinalizeClassDefinition), R(2), U8(2), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaUndefined), //
- B(Return) //
- },
- 5,
- { InstanceType::SHARED_FUNCTION_INFO_TYPE, kInstanceTypeDontCare,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::SHARED_FUNCTION_INFO_TYPE}},
- {"var n0 = 'a';"
- "var n1 = 'b';"
- "class N {\n"
- " [n0]() { return n0; }\n"
- " static [n1]() { return n1; }\n"
- "}\n",
- 10 * kPointerSize,
- 1,
- 125,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), //
- /* */ U8(1), //
- B(PushContext), R(2), //
- B(LdaTheHole), //
- B(Star), R(1), //
- B(StackCheck), //
- B(LdaConstant), U8(0), //
- B(StaContextSlot), R(context), U8(4), //
- B(LdaConstant), U8(1), //
- B(StaContextSlot), R(context), U8(5), //
- B(LdaTheHole), //
- B(Star), R(0), //
- B(LdaTheHole), //
- B(Star), R(3), //
- B(CreateClosure), U8(2), U8(0), //
- B(Star), R(4), //
- B(LdaSmi8), U8(41), //
- B(Star), R(5), //
- B(LdaSmi8), U8(107), //
- B(Star), R(6), //
- B(CallRuntime), U16(Runtime::kDefineClass), R(3), U8(4), //
- B(Star), R(3), //
- B(LoadIC), R(3), U8(3), U8(1), //
- B(Star), R(4), //
- B(Mov), R(4), R(5), //
- B(LdaContextSlot), R(context), U8(4), //
- B(ToName), //
- B(Star), R(6), //
- B(CreateClosure), U8(4), U8(0), //
- B(Star), R(7), //
- B(LdaSmi8), U8(2), //
- B(Star), R(8), //
- B(LdaSmi8), U8(1), //
- B(Star), R(9), //
- B(CallRuntime), U16(Runtime::kDefineDataPropertyInLiteral), R(5), U8(5),
- B(Mov), R(3), R(5), //
- B(LdaContextSlot), R(context), U8(5), //
- B(ToName), //
- B(Star), R(6), //
- B(LdaConstant), U8(3), //
- B(TestEqualStrict), R(6), //
- B(JumpIfFalse), U8(7), //
- B(CallRuntime), U16(Runtime::kThrowStaticPrototypeError), //
- /* */ R(0), U8(0), //
- B(CreateClosure), U8(5), U8(0), //
- B(Star), R(7), //
- B(LdaSmi8), U8(1), //
- B(Star), R(9), //
- B(CallRuntime), U16(Runtime::kDefineDataPropertyInLiteral), R(5), U8(5),
- B(CallRuntime), U16(Runtime::kFinalizeClassDefinition), R(3), U8(2), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(LdaUndefined), //
- B(Return), //
- },
- 6,
- { InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::SHARED_FUNCTION_INFO_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::SHARED_FUNCTION_INFO_TYPE,
- InstanceType::SHARED_FUNCTION_INFO_TYPE}},
- {"var count = 0;\n"
- "class C { constructor() { count++; }}\n"
- "return new C();\n",
- 10 * kPointerSize,
- 1,
- 74,
- {
- B(CallRuntime), U16(Runtime::kNewFunctionContext), R(closure), U8(1), //
- B(PushContext), R(2), //
- B(LdaTheHole), //
- B(Star), R(1), //
- B(StackCheck), //
- B(LdaZero), //
- B(StaContextSlot), R(context), U8(4), //
- B(LdaTheHole), //
- B(Star), R(0), //
- B(LdaTheHole), //
- B(Star), R(3), //
- B(CreateClosure), U8(0), U8(0), //
- B(Star), R(4), //
- B(LdaSmi8), U8(30), //
- B(Star), R(5), //
- B(LdaSmi8), U8(67), //
- B(Star), R(6), //
- B(CallRuntime), U16(Runtime::kDefineClass), R(3), U8(4), //
- B(Star), R(3), //
- B(LoadIC), R(3), U8(1), U8(1), //
- B(Star), R(4), //
- B(CallRuntime), U16(Runtime::kFinalizeClassDefinition), R(3), U8(2), //
- B(Star), R(0), //
- B(Star), R(1), //
- B(JumpIfNotHole), U8(11), //
- B(LdaConstant), U8(2), //
- B(Star), R(4), //
- B(CallRuntime), U16(Runtime::kThrowReferenceError), R(4), U8(1), //
- B(Star), R(3), //
- B(New), R(3), R(0), U8(0), //
- B(Return), //
- },
- 3,
- { InstanceType::SHARED_FUNCTION_INFO_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE,
- InstanceType::ONE_BYTE_INTERNALIZED_STRING_TYPE}},
+ "var n0 = 'a';\n"
+ "var n1 = 'b';\n"
+ "class N {\n"
+ " [n0]() { return n0; }\n"
+ " static [n1]() { return n1; }\n"
+ "}",
+
+ "var count = 0;\n"
+ "class C { constructor() { count++; }}\n"
+ "return new C();\n",
};
- // clang-format on
- for (size_t i = 0; i < arraysize(snippets); i++) {
- Handle<BytecodeArray> bytecode_array =
- helper.MakeBytecodeForFunctionBody(snippets[i].code_snippet);
- CheckBytecodeArrayEqual(snippets[i], bytecode_array);
- }
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("ClassDeclarations.golden"));
}
-// TODO(oth): Add tests for super keyword.
+TEST(ClassAndSuperClass) {
+ InitializedIgnitionHandleScope scope;
+ BytecodeExpectationsPrinter printer(CcTest::isolate(),
+ ConstantPoolType::kMixed);
+ printer.set_wrap(false);
+ printer.set_test_function_name("test");
+ const char* snippets[] = {
+ "var test;\n"
+ "(function() {\n"
+ " class A {\n"
+ " method() { return 2; }\n"
+ " }\n"
+ " class B extends A {\n"
+ " method() { return super.method() + 1; }\n"
+ " }\n"
+ " test = new B().method;\n"
+ " test();\n"
+ "})();\n",
+
+ "var test;\n"
+ "(function() {\n"
+ " class A {\n"
+ " get x() { return 1; }\n"
+ " set x(val) { return; }\n"
+ " }\n"
+ " class B extends A {\n"
+ " method() { super.x = 2; return super.x; }\n"
+ " }\n"
+ " test = new B().method;\n"
+ " test();\n"
+ "})();\n",
+
+ "var test;\n"
+ "(function() {\n"
+ " class A {\n"
+ " constructor(x) { this.x_ = x; }\n"
+ " }\n"
+ " class B extends A {\n"
+ " constructor() { super(1); this.y_ = 2; }\n"
+ " }\n"
+ " test = new B().constructor;\n"
+ "})();\n",
+
+ "var test;\n"
+ "(function() {\n"
+ " class A {\n"
+ " constructor() { this.x_ = 1; }\n"
+ " }\n"
+ " class B extends A {\n"
+ " constructor() { super(); this.y_ = 2; }\n"
+ " }\n"
+ " test = new B().constructor;\n"
+ "})();\n",
+ };
+
+ CHECK_EQ(BuildActual(printer, snippets),
+ LoadGolden("ClassAndSuperClass.golden"));
+}
} // namespace interpreter
} // namespace internal
diff --git a/test/cctest/interpreter/test-interpreter-intrinsics.cc b/test/cctest/interpreter/test-interpreter-intrinsics.cc
new file mode 100644
index 0000000..e4cf809
--- /dev/null
+++ b/test/cctest/interpreter/test-interpreter-intrinsics.cc
@@ -0,0 +1,96 @@
+// Copyright 2015 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/v8.h"
+
+#include "src/interpreter/interpreter-intrinsics.h"
+#include "test/cctest/interpreter/interpreter-tester.h"
+
+namespace v8 {
+namespace internal {
+namespace interpreter {
+
+namespace {
+
+class InvokeIntrinsicHelper {
+ public:
+ InvokeIntrinsicHelper(Isolate* isolate, Zone* zone,
+ Runtime::FunctionId function_id)
+ : isolate_(isolate),
+ zone_(zone),
+ factory_(isolate->factory()),
+ function_id_(function_id) {}
+
+ template <class... A>
+ Handle<Object> Invoke(A... args) {
+ CHECK(IntrinsicsHelper::IsSupported(function_id_));
+ BytecodeArrayBuilder builder(isolate_, zone_, sizeof...(args), 0, 0);
+ builder.CallRuntime(function_id_, builder.Parameter(0), sizeof...(args))
+ .Return();
+ InterpreterTester tester(isolate_, builder.ToBytecodeArray());
+ auto callable = tester.GetCallable<Handle<Object>>();
+ return callable(args...).ToHandleChecked();
+ }
+
+ Handle<Object> NewObject(const char* script) {
+ return v8::Utils::OpenHandle(*CompileRun(script));
+ }
+
+ Handle<Object> Undefined() { return factory_->undefined_value(); }
+ Handle<Object> Null() { return factory_->null_value(); }
+
+ private:
+ Isolate* isolate_;
+ Zone* zone_;
+ Factory* factory_;
+ Runtime::FunctionId function_id_;
+};
+
+} // namespace
+
+TEST(IsJSReceiver) {
+ HandleAndZoneScope handles;
+
+ InvokeIntrinsicHelper helper(handles.main_isolate(), handles.main_zone(),
+ Runtime::kInlineIsJSReceiver);
+ Factory* factory = handles.main_isolate()->factory();
+
+ CHECK_EQ(*factory->true_value(),
+ *helper.Invoke(helper.NewObject("new Date()")));
+ CHECK_EQ(*factory->true_value(),
+ *helper.Invoke(helper.NewObject("(function() {})")));
+ CHECK_EQ(*factory->true_value(), *helper.Invoke(helper.NewObject("([1])")));
+ CHECK_EQ(*factory->true_value(), *helper.Invoke(helper.NewObject("({})")));
+ CHECK_EQ(*factory->true_value(), *helper.Invoke(helper.NewObject("(/x/)")));
+ CHECK_EQ(*factory->false_value(), *helper.Invoke(helper.Undefined()));
+ CHECK_EQ(*factory->false_value(), *helper.Invoke(helper.Null()));
+ CHECK_EQ(*factory->false_value(),
+ *helper.Invoke(helper.NewObject("'string'")));
+ CHECK_EQ(*factory->false_value(), *helper.Invoke(helper.NewObject("42")));
+}
+
+TEST(IsArray) {
+ HandleAndZoneScope handles;
+
+ InvokeIntrinsicHelper helper(handles.main_isolate(), handles.main_zone(),
+ Runtime::kInlineIsArray);
+ Factory* factory = handles.main_isolate()->factory();
+
+ CHECK_EQ(*factory->false_value(),
+ *helper.Invoke(helper.NewObject("new Date()")));
+ CHECK_EQ(*factory->false_value(),
+ *helper.Invoke(helper.NewObject("(function() {})")));
+ CHECK_EQ(*factory->true_value(), *helper.Invoke(helper.NewObject("([1])")));
+ CHECK_EQ(*factory->false_value(), *helper.Invoke(helper.NewObject("({})")));
+ CHECK_EQ(*factory->false_value(), *helper.Invoke(helper.NewObject("(/x/)")));
+ CHECK_EQ(*factory->false_value(), *helper.Invoke(helper.Undefined()));
+ CHECK_EQ(*factory->false_value(), *helper.Invoke(helper.Null()));
+ CHECK_EQ(*factory->false_value(),
+ *helper.Invoke(helper.NewObject("'string'")));
+ CHECK_EQ(*factory->false_value(), *helper.Invoke(helper.NewObject("42")));
+}
+
+} // namespace interpreter
+} // namespace internal
+} // namespace v8
diff --git a/test/cctest/interpreter/test-interpreter.cc b/test/cctest/interpreter/test-interpreter.cc
index 69cf0e1..c8dc776 100644
--- a/test/cctest/interpreter/test-interpreter.cc
+++ b/test/cctest/interpreter/test-interpreter.cc
@@ -7,8 +7,10 @@
#include "src/execution.h"
#include "src/handles.h"
#include "src/interpreter/bytecode-array-builder.h"
+#include "src/interpreter/bytecode-array-iterator.h"
#include "src/interpreter/interpreter.h"
#include "test/cctest/cctest.h"
+#include "test/cctest/interpreter/interpreter-tester.h"
#include "test/cctest/test-feedback-vector.h"
namespace v8 {
@@ -16,160 +18,6 @@
namespace interpreter {
-static MaybeHandle<Object> CallInterpreter(Isolate* isolate,
- Handle<JSFunction> function) {
- return Execution::Call(isolate, function,
- isolate->factory()->undefined_value(), 0, nullptr);
-}
-
-
-template <class... A>
-static MaybeHandle<Object> CallInterpreter(Isolate* isolate,
- Handle<JSFunction> function,
- A... args) {
- Handle<Object> argv[] = { args... };
- return Execution::Call(isolate, function,
- isolate->factory()->undefined_value(), sizeof...(args),
- argv);
-}
-
-
-template <class... A>
-class InterpreterCallable {
- public:
- InterpreterCallable(Isolate* isolate, Handle<JSFunction> function)
- : isolate_(isolate), function_(function) {}
- virtual ~InterpreterCallable() {}
-
- MaybeHandle<Object> operator()(A... args) {
- return CallInterpreter(isolate_, function_, args...);
- }
-
- private:
- Isolate* isolate_;
- Handle<JSFunction> function_;
-};
-
-
-static const char* kFunctionName = "f";
-
-
-class InterpreterTester {
- public:
- InterpreterTester(Isolate* isolate, const char* source,
- MaybeHandle<BytecodeArray> bytecode,
- MaybeHandle<TypeFeedbackVector> feedback_vector,
- const char* filter)
- : isolate_(isolate),
- source_(source),
- bytecode_(bytecode),
- feedback_vector_(feedback_vector) {
- i::FLAG_ignition = true;
- i::FLAG_always_opt = false;
- // Set ignition filter flag via SetFlagsFromString to avoid double-free
- // (or potential leak with StrDup() based on ownership confusion).
- ScopedVector<char> ignition_filter(64);
- SNPrintF(ignition_filter, "--ignition-filter=%s", filter);
- FlagList::SetFlagsFromString(ignition_filter.start(),
- ignition_filter.length());
- // Ensure handler table is generated.
- isolate->interpreter()->Initialize();
- }
-
- InterpreterTester(Isolate* isolate, Handle<BytecodeArray> bytecode,
- MaybeHandle<TypeFeedbackVector> feedback_vector =
- MaybeHandle<TypeFeedbackVector>(),
- const char* filter = kFunctionName)
- : InterpreterTester(isolate, nullptr, bytecode, feedback_vector, filter) {
- }
-
-
- InterpreterTester(Isolate* isolate, const char* source,
- const char* filter = kFunctionName)
- : InterpreterTester(isolate, source, MaybeHandle<BytecodeArray>(),
- MaybeHandle<TypeFeedbackVector>(), filter) {}
-
- virtual ~InterpreterTester() {}
-
- template <class... A>
- InterpreterCallable<A...> GetCallable() {
- return InterpreterCallable<A...>(isolate_, GetBytecodeFunction<A...>());
- }
-
- Local<Message> CheckThrowsReturnMessage() {
- TryCatch try_catch(reinterpret_cast<v8::Isolate*>(isolate_));
- auto callable = GetCallable<>();
- MaybeHandle<Object> no_result = callable();
- CHECK(isolate_->has_pending_exception());
- CHECK(try_catch.HasCaught());
- CHECK(no_result.is_null());
- isolate_->OptionalRescheduleException(true);
- CHECK(!try_catch.Message().IsEmpty());
- return try_catch.Message();
- }
-
- static Handle<Object> NewObject(const char* script) {
- return v8::Utils::OpenHandle(*CompileRun(script));
- }
-
- static Handle<String> GetName(Isolate* isolate, const char* name) {
- Handle<String> result = isolate->factory()->NewStringFromAsciiChecked(name);
- return isolate->factory()->string_table()->LookupString(isolate, result);
- }
-
- static std::string SourceForBody(const char* body) {
- return "function " + function_name() + "() {\n" + std::string(body) + "\n}";
- }
-
- static std::string function_name() {
- return std::string(kFunctionName);
- }
-
- private:
- Isolate* isolate_;
- const char* source_;
- MaybeHandle<BytecodeArray> bytecode_;
- MaybeHandle<TypeFeedbackVector> feedback_vector_;
-
- template <class... A>
- Handle<JSFunction> GetBytecodeFunction() {
- Handle<JSFunction> function;
- if (source_) {
- CompileRun(source_);
- v8::Local<v8::Context> context =
- v8::Isolate::GetCurrent()->GetCurrentContext();
- Local<Function> api_function =
- Local<Function>::Cast(CcTest::global()
- ->Get(context, v8_str(kFunctionName))
- .ToLocalChecked());
- function = Handle<JSFunction>::cast(v8::Utils::OpenHandle(*api_function));
- } else {
- int arg_count = sizeof...(A);
- std::string source("(function " + function_name() + "(");
- for (int i = 0; i < arg_count; i++) {
- source += i == 0 ? "a" : ", a";
- }
- source += "){})";
- function = Handle<JSFunction>::cast(v8::Utils::OpenHandle(
- *v8::Local<v8::Function>::Cast(CompileRun(source.c_str()))));
- function->ReplaceCode(
- *isolate_->builtins()->InterpreterEntryTrampoline());
- }
-
- if (!bytecode_.is_null()) {
- function->shared()->set_function_data(*bytecode_.ToHandleChecked());
- }
- if (!feedback_vector_.is_null()) {
- function->shared()->set_feedback_vector(
- *feedback_vector_.ToHandleChecked());
- }
- return function;
- }
-
- DISALLOW_COPY_AND_ASSIGN(InterpreterTester);
-};
-
-
TEST(InterpreterReturn) {
HandleAndZoneScope handles;
Handle<Object> undefined_value =
@@ -731,7 +579,7 @@
HandleAndZoneScope handles;
i::Isolate* isolate = handles.main_isolate();
i::Factory* factory = isolate->factory();
- i::Zone zone;
+ i::Zone zone(isolate->allocator());
i::FeedbackVectorSpec feedback_spec(&zone);
i::FeedbackVectorSlot slot = feedback_spec.AddLoadICSlot();
@@ -784,7 +632,7 @@
HandleAndZoneScope handles;
i::Isolate* isolate = handles.main_isolate();
i::Factory* factory = isolate->factory();
- i::Zone zone;
+ i::Zone zone(isolate->allocator());
i::FeedbackVectorSpec feedback_spec(&zone);
i::FeedbackVectorSlot slot = feedback_spec.AddKeyedLoadICSlot();
@@ -826,7 +674,7 @@
HandleAndZoneScope handles;
i::Isolate* isolate = handles.main_isolate();
i::Factory* factory = isolate->factory();
- i::Zone zone;
+ i::Zone zone(isolate->allocator());
i::FeedbackVectorSpec feedback_spec(&zone);
i::FeedbackVectorSlot slot = feedback_spec.AddStoreICSlot();
@@ -885,7 +733,7 @@
HandleAndZoneScope handles;
i::Isolate* isolate = handles.main_isolate();
i::Factory* factory = isolate->factory();
- i::Zone zone;
+ i::Zone zone(isolate->allocator());
i::FeedbackVectorSpec feedback_spec(&zone);
i::FeedbackVectorSlot slot = feedback_spec.AddKeyedStoreICSlot();
@@ -932,7 +780,7 @@
HandleAndZoneScope handles;
i::Isolate* isolate = handles.main_isolate();
i::Factory* factory = isolate->factory();
- i::Zone zone;
+ i::Zone zone(isolate->allocator());
i::FeedbackVectorSpec feedback_spec(&zone);
i::FeedbackVectorSlot slot = feedback_spec.AddLoadICSlot();
@@ -1145,7 +993,6 @@
CHECK_EQ(Smi::cast(*return_value)->value(), 7);
}
-
TEST(InterpreterConditionalJumps2) {
// TODO(oth): Add tests for all conditional jumps near and far.
HandleAndZoneScope handles;
@@ -1179,12 +1026,96 @@
CHECK_EQ(Smi::cast(*return_value)->value(), 7);
}
+TEST(InterpreterJumpConstantWith16BitOperand) {
+ HandleAndZoneScope handles;
+ BytecodeArrayBuilder builder(handles.main_isolate(), handles.main_zone(), 1,
+ 0, 257);
+ Register reg(0), scratch(256);
+ BytecodeLabel done;
+
+ builder.LoadLiteral(Smi::FromInt(0));
+ builder.StoreAccumulatorInRegister(reg);
+ // Consume all 8-bit operands
+ for (int i = 1; i <= 256; i++) {
+ builder.LoadLiteral(handles.main_isolate()->factory()->NewNumber(i));
+ builder.BinaryOperation(Token::Value::ADD, reg);
+ builder.StoreAccumulatorInRegister(reg);
+ }
+ builder.Jump(&done);
+
+ // Emit more than 16-bit immediate operands worth of code to jump over.
+ for (int i = 0; i < 6600; i++) {
+ builder.LoadLiteral(Smi::FromInt(0)); // 1-byte
+ builder.BinaryOperation(Token::Value::ADD, scratch); // 4-bytes
+ builder.StoreAccumulatorInRegister(scratch); // 4-bytes
+ builder.MoveRegister(scratch, reg); // 6-bytes
+ }
+ builder.Bind(&done);
+ builder.LoadAccumulatorWithRegister(reg);
+ builder.Return();
+
+ Handle<BytecodeArray> bytecode_array = builder.ToBytecodeArray();
+ BytecodeArrayIterator iterator(bytecode_array);
+
+ bool found_16bit_constant_jump = false;
+ while (!iterator.done()) {
+ if (iterator.current_bytecode() == Bytecode::kJumpConstant &&
+ iterator.current_operand_scale() == OperandScale::kDouble) {
+ found_16bit_constant_jump = true;
+ break;
+ }
+ iterator.Advance();
+ }
+ CHECK(found_16bit_constant_jump);
+
+ InterpreterTester tester(handles.main_isolate(), bytecode_array);
+ auto callable = tester.GetCallable<>();
+ Handle<Object> return_value = callable().ToHandleChecked();
+ CHECK_EQ(Smi::cast(*return_value)->value(), 256.0 / 2 * (1 + 256));
+}
+
+TEST(InterpreterJumpWith32BitOperand) {
+ HandleAndZoneScope handles;
+ BytecodeArrayBuilder builder(handles.main_isolate(), handles.main_zone(), 1,
+ 0, 1);
+ Register reg(0);
+ BytecodeLabel done;
+
+ builder.LoadLiteral(Smi::FromInt(0));
+ builder.StoreAccumulatorInRegister(reg);
+ // Consume all 16-bit constant pool entries
+ for (int i = 1; i <= 65536; i++) {
+ builder.LoadLiteral(handles.main_isolate()->factory()->NewNumber(i));
+ }
+ builder.Jump(&done);
+ builder.LoadLiteral(Smi::FromInt(0));
+ builder.Bind(&done);
+ builder.Return();
+
+ Handle<BytecodeArray> bytecode_array = builder.ToBytecodeArray();
+ BytecodeArrayIterator iterator(bytecode_array);
+
+ bool found_32bit_jump = false;
+ while (!iterator.done()) {
+ if (iterator.current_bytecode() == Bytecode::kJump &&
+ iterator.current_operand_scale() == OperandScale::kQuadruple) {
+ found_32bit_jump = true;
+ break;
+ }
+ iterator.Advance();
+ }
+ CHECK(found_32bit_jump);
+
+ InterpreterTester tester(handles.main_isolate(), bytecode_array);
+ auto callable = tester.GetCallable<>();
+ Handle<Object> return_value = callable().ToHandleChecked();
+ CHECK_EQ(Smi::cast(*return_value)->value(), 65536.0);
+}
static const Token::Value kComparisonTypes[] = {
- Token::Value::EQ, Token::Value::NE, Token::Value::EQ_STRICT,
- Token::Value::NE_STRICT, Token::Value::LT, Token::Value::LTE,
- Token::Value::GT, Token::Value::GTE};
-
+ Token::Value::EQ, Token::Value::NE, Token::Value::EQ_STRICT,
+ Token::Value::LT, Token::Value::LTE, Token::Value::GT,
+ Token::Value::GTE};
template <typename T>
bool CompareC(Token::Value op, T lhs, T rhs, bool types_differed = false) {
@@ -1379,9 +1310,84 @@
}
}
+TEST(InterpreterStrictNotEqual) {
+ HandleAndZoneScope handles;
+ i::Factory* factory = handles.main_isolate()->factory();
+ const char* code_snippet =
+ "function f(lhs, rhs) {\n"
+ " return lhs !== rhs;\n"
+ "}\n"
+ "f(0, 0);\n";
+ InterpreterTester tester(handles.main_isolate(), code_snippet);
+ auto callable = tester.GetCallable<Handle<Object>, Handle<Object>>();
+
+ // Test passing different types.
+ const char* inputs[] = {"-1.77", "-40.333", "0.01", "55.77e5", "2.01"};
+ i::UnicodeCache unicode_cache;
+ for (size_t i = 0; i < arraysize(inputs); i++) {
+ for (size_t j = 0; j < arraysize(inputs); j++) {
+ double lhs = StringToDouble(&unicode_cache, inputs[i],
+ i::ConversionFlags::NO_FLAGS);
+ double rhs = StringToDouble(&unicode_cache, inputs[j],
+ i::ConversionFlags::NO_FLAGS);
+ Handle<Object> lhs_obj = factory->NewNumber(lhs);
+ Handle<Object> rhs_obj = factory->NewStringFromAsciiChecked(inputs[j]);
+
+ Handle<Object> return_value =
+ callable(lhs_obj, rhs_obj).ToHandleChecked();
+ CHECK(return_value->IsBoolean());
+ CHECK_EQ(return_value->BooleanValue(),
+ CompareC(Token::Value::NE_STRICT, lhs, rhs, true));
+ }
+ }
+
+ // Test passing string types.
+ const char* inputs_str[] = {"A", "abc", "z", "", "Foo!", "Foo"};
+ for (size_t i = 0; i < arraysize(inputs_str); i++) {
+ for (size_t j = 0; j < arraysize(inputs_str); j++) {
+ Handle<Object> lhs_obj =
+ factory->NewStringFromAsciiChecked(inputs_str[i]);
+ Handle<Object> rhs_obj =
+ factory->NewStringFromAsciiChecked(inputs_str[j]);
+
+ Handle<Object> return_value =
+ callable(lhs_obj, rhs_obj).ToHandleChecked();
+ CHECK(return_value->IsBoolean());
+ CHECK_EQ(return_value->BooleanValue(),
+ CompareC(Token::Value::NE_STRICT, inputs_str[i], inputs_str[j]));
+ }
+ }
+
+ // Test passing doubles.
+ double inputs_number[] = {std::numeric_limits<double>::min(),
+ std::numeric_limits<double>::max(),
+ -0.001,
+ 0.01,
+ 0.1000001,
+ 1e99,
+ -1e-99};
+ for (size_t i = 0; i < arraysize(inputs_number); i++) {
+ for (size_t j = 0; j < arraysize(inputs_number); j++) {
+ Handle<Object> lhs_obj = factory->NewNumber(inputs_number[i]);
+ Handle<Object> rhs_obj = factory->NewNumber(inputs_number[j]);
+
+ Handle<Object> return_value =
+ callable(lhs_obj, rhs_obj).ToHandleChecked();
+ CHECK(return_value->IsBoolean());
+ CHECK_EQ(return_value->BooleanValue(),
+ CompareC(Token::Value::NE_STRICT, inputs_number[i],
+ inputs_number[j]));
+ }
+ }
+}
TEST(InterpreterInstanceOf) {
HandleAndZoneScope handles;
+ // TODO(4447): The new ES6 'instanceof' operator is fully desugared in the
+ // parser and the Token::INSTANCEOF is not needed anymore. This test only
+ // makes sense with --no-harmony-instanceof and can be removed once we
+ // deprecate the ability to switch to old skool ES5 'instanceof' for good.
+ FLAG_harmony_instanceof = false;
i::Factory* factory = handles.main_isolate()->factory();
Handle<i::String> name = factory->NewStringFromAsciiChecked("cons");
Handle<i::JSFunction> func = factory->NewFunction(name);
@@ -1566,6 +1572,24 @@
CHECK_EQ(Smi::cast(*return_val), Smi::FromInt(55));
}
+TEST(InterpreterInvokeIntrinsic) {
+ HandleAndZoneScope handles;
+
+ BytecodeArrayBuilder builder(handles.main_isolate(), handles.main_zone(), 1,
+ 0, 2);
+ builder.LoadLiteral(Smi::FromInt(15))
+ .StoreAccumulatorInRegister(Register(0))
+ .CallRuntime(Runtime::kInlineIsArray, Register(0), 1)
+ .Return();
+ Handle<BytecodeArray> bytecode_array = builder.ToBytecodeArray();
+
+ InterpreterTester tester(handles.main_isolate(), bytecode_array);
+ auto callable = tester.GetCallable<>();
+
+ Handle<Object> return_val = callable().ToHandleChecked();
+ CHECK(return_val->IsBoolean());
+ CHECK_EQ(return_val->BooleanValue(), false);
+}
TEST(InterpreterFunctionLiteral) {
HandleAndZoneScope handles;
@@ -2007,6 +2031,15 @@
" try { a = 3; throw 23; } finally { a = 4; }"
"} catch(e) { a = a + e; } return a;",
factory->NewStringFromStaticChars("R27")),
+ std::make_pair("var func_name;"
+ "function tcf2(a) {"
+ " try { throw new Error('boom');} "
+ " catch(e) {return 153; } "
+ " finally {func_name = tcf2.name;}"
+ "}"
+ "tcf2();"
+ "return func_name;",
+ factory->NewStringFromStaticChars("Rtcf2")),
};
const char* try_wrapper =
@@ -3857,7 +3890,7 @@
for (size_t i = 0; i < arraysize(examples); ++i) {
std::string source(InterpreterTester::SourceForBody(examples[i].first));
- InterpreterTester tester(handles.main_isolate(), source.c_str());
+ InterpreterTester tester(handles.main_isolate(), source.c_str(), "*");
auto callable = tester.GetCallable<>();
Handle<i::Object> return_value = callable().ToHandleChecked();
@@ -3917,7 +3950,7 @@
for (size_t i = 0; i < arraysize(examples); ++i) {
std::string source(InterpreterTester::SourceForBody(examples[i].first));
- InterpreterTester tester(handles.main_isolate(), source.c_str());
+ InterpreterTester tester(handles.main_isolate(), source.c_str(), "*");
auto callable = tester.GetCallable<>();
Handle<i::Object> return_value = callable().ToHandleChecked();
CHECK(return_value->SameValue(*examples[i].second));
@@ -4061,29 +4094,6 @@
Handle<i::Object> return_value = callable().ToHandleChecked();
CHECK(return_value->SameValue(*const_decl[i].second));
}
-
- // Tests for Legacy constant.
- bool old_flag_legacy_const = FLAG_legacy_const;
- FLAG_legacy_const = true;
-
- std::pair<const char*, Handle<Object>> legacy_const_decl[] = {
- {"return outerConst = 23;", handle(Smi::FromInt(23), isolate)},
- {"outerConst = 30; return outerConst;",
- handle(Smi::FromInt(10), isolate)},
- };
-
- for (size_t i = 0; i < arraysize(legacy_const_decl); i++) {
- std::string script = std::string(prologue) +
- std::string(legacy_const_decl[i].first) +
- std::string(epilogue);
- InterpreterTester tester(handles.main_isolate(), script.c_str(), "*");
- auto callable = tester.GetCallable<>();
-
- Handle<i::Object> return_value = callable().ToHandleChecked();
- CHECK(return_value->SameValue(*legacy_const_decl[i].second));
- }
-
- FLAG_legacy_const = old_flag_legacy_const;
}
TEST(InterpreterIllegalConstDeclaration) {
@@ -4129,39 +4139,6 @@
}
}
-TEST(InterpreterLegacyConstDeclaration) {
- bool old_flag_legacy_const = FLAG_legacy_const;
- FLAG_legacy_const = true;
-
- HandleAndZoneScope handles;
- i::Isolate* isolate = handles.main_isolate();
-
- std::pair<const char*, Handle<Object>> const_decl[] = {
- {"const x = (x = 10) + 3; return x;", handle(Smi::FromInt(13), isolate)},
- {"const x = 10; x = 20; return x;", handle(Smi::FromInt(10), isolate)},
- {"var a = 10;\n"
- "for (var i = 0; i < 10; ++i) {\n"
- " const x = i;\n" // Legacy constants are not block scoped.
- " a = a + x;\n"
- "}\n"
- "return a;\n",
- handle(Smi::FromInt(10), isolate)},
- {"const x = 20; eval('x = 10;'); return x;",
- handle(Smi::FromInt(20), isolate)},
- };
-
- for (size_t i = 0; i < arraysize(const_decl); i++) {
- std::string source(InterpreterTester::SourceForBody(const_decl[i].first));
- InterpreterTester tester(handles.main_isolate(), source.c_str());
- auto callable = tester.GetCallable<>();
-
- Handle<i::Object> return_value = callable().ToHandleChecked();
- CHECK(return_value->SameValue(*const_decl[i].second));
- }
-
- FLAG_legacy_const = old_flag_legacy_const;
-}
-
} // namespace interpreter
} // namespace internal
} // namespace v8
diff --git a/test/cctest/test-accessors.cc b/test/cctest/test-accessors.cc
index 90ea081..67803ee 100644
--- a/test/cctest/test-accessors.cc
+++ b/test/cctest/test-accessors.cc
@@ -774,3 +774,28 @@
CHECK(try_catch.HasCaught());
}
}
+
+static void check_receiver(Local<String> name,
+ const v8::PropertyCallbackInfo<v8::Value>& info) {
+ CHECK(info.This()->IsObject());
+}
+
+TEST(Regress609134) {
+ v8::internal::FLAG_allow_natives_syntax = true;
+ LocalContext env;
+ v8::Isolate* isolate = env->GetIsolate();
+ v8::HandleScope scope(isolate);
+ auto fun_templ = v8::FunctionTemplate::New(isolate);
+ fun_templ->InstanceTemplate()->SetNativeDataProperty(v8_str("foo"),
+ check_receiver);
+
+ CHECK(env->Global()
+ ->Set(env.local(), v8_str("Fun"),
+ fun_templ->GetFunction(env.local()).ToLocalChecked())
+ .FromJust());
+
+ CompileRun(
+ "var f = new Fun();"
+ "Number.prototype.__proto__ = f;"
+ "[42][0].foo");
+}
diff --git a/test/cctest/test-api-interceptors.cc b/test/cctest/test-api-interceptors.cc
index ac54ede..a1894fa 100644
--- a/test/cctest/test-api-interceptors.cc
+++ b/test/cctest/test-api-interceptors.cc
@@ -3888,3 +3888,28 @@
"eval('obj.x');",
9);
}
+
+static void CheckReceiver(Local<Name> name,
+ const v8::PropertyCallbackInfo<v8::Value>& info) {
+ CHECK(info.This()->IsObject());
+}
+
+TEST(Regress609134Interceptor) {
+ LocalContext env;
+ v8::Isolate* isolate = env->GetIsolate();
+ v8::HandleScope scope(isolate);
+ auto fun_templ = v8::FunctionTemplate::New(isolate);
+ fun_templ->InstanceTemplate()->SetHandler(
+ v8::NamedPropertyHandlerConfiguration(CheckReceiver));
+
+ CHECK(env->Global()
+ ->Set(env.local(), v8_str("Fun"),
+ fun_templ->GetFunction(env.local()).ToLocalChecked())
+ .FromJust());
+
+ CompileRun(
+ "var f = new Fun();"
+ "Number.prototype.__proto__ = f;"
+ "var a = 42;"
+ "for (var i = 0; i<3; i++) { a.foo; }");
+}
diff --git a/test/cctest/test-api.cc b/test/cctest/test-api.cc
index f4e8fe8..220b0cd 100644
--- a/test/cctest/test-api.cc
+++ b/test/cctest/test-api.cc
@@ -2989,7 +2989,6 @@
THREADED_TEST(PrivatePropertiesOnProxies) {
- i::FLAG_harmony_proxies = true;
LocalContext env;
v8::Isolate* isolate = env->GetIsolate();
v8::HandleScope scope(isolate);
@@ -12898,6 +12897,19 @@
CHECK(try_catch.HasCaught());
try_catch.Reset();
CHECK(result.IsEmpty());
+
+ Local<Object> target = CompileRun("({})").As<Object>();
+ Local<Object> handler = CompileRun("({})").As<Object>();
+ Local<v8::Proxy> proxy =
+ v8::Proxy::New(context.local(), target, handler).ToLocalChecked();
+
+ result = target->GetRealNamedProperty(context.local(), v8_str("f"));
+ CHECK(!try_catch.HasCaught());
+ CHECK(result.IsEmpty());
+
+ result = proxy->GetRealNamedProperty(context.local(), v8_str("f"));
+ CHECK(!try_catch.HasCaught());
+ CHECK(result.IsEmpty());
}
@@ -13076,7 +13088,6 @@
THREADED_TEST(AccessorShouldThrowOnError) {
- i::FLAG_strong_mode = true;
LocalContext context;
v8::Isolate* isolate = context->GetIsolate();
v8::HandleScope scope(isolate);
@@ -13109,14 +13120,6 @@
value = global->Get(context.local(), v8_str("should_throw_setter"))
.ToLocalChecked();
CHECK(value->IsTrue());
-
- // STRONG mode
- value = v8_compile("'use strong';o.f")->Run(context.local()).ToLocalChecked();
- CHECK(value->IsFalse());
- v8_compile("'use strong'; o.f = 153")->Run(context.local()).ToLocalChecked();
- value = global->Get(context.local(), v8_str("should_throw_setter"))
- .ToLocalChecked();
- CHECK(value->IsTrue());
}
@@ -13172,7 +13175,6 @@
THREADED_TEST(InterceptorShouldThrowOnError) {
- i::FLAG_strong_mode = true;
LocalContext context;
v8::Isolate* isolate = context->GetIsolate();
v8::HandleScope scope(isolate);
@@ -13229,21 +13231,6 @@
value = global->Get(context.local(), v8_str("should_throw_enumerator"))
.ToLocalChecked();
CHECK(value->IsFalse());
-
- // STRONG mode
- value = v8_compile("'use strong';o.f")->Run(context.local()).ToLocalChecked();
- CHECK(value->IsFalse());
- v8_compile("'use strong'; o.f = 153")->Run(context.local()).ToLocalChecked();
- value = global->Get(context.local(), v8_str("should_throw_setter"))
- .ToLocalChecked();
- CHECK(value->IsTrue());
-
- v8_compile("'use strong'; Object.getOwnPropertyNames(o)")
- ->Run(context.local())
- .ToLocalChecked();
- value = global->Get(context.local(), v8_str("should_throw_enumerator"))
- .ToLocalChecked();
- CHECK(value->IsFalse());
}
@@ -13325,8 +13312,6 @@
TEST(ObjectProtoToStringES6) {
- // TODO(dslomov, caitp): merge into ObjectProtoToString test once shipped.
- i::FLAG_harmony_tostring = true;
LocalContext context;
v8::Isolate* isolate = CcTest::isolate();
v8::HandleScope scope(isolate);
@@ -13521,7 +13506,7 @@
"function Child() {};"
"Child.prototype = new Parent();"
"Child.prototype.constructor = Child;"
- "var outer = { inner: function() { } };"
+ "var outer = { inner: (0, function() { }) };"
"var p = new Parent();"
"var c = new Child();"
"var x = new outer.inner();"
@@ -14544,12 +14529,17 @@
static bool FunctionNameIs(const char* expected,
const v8::JitCodeEvent* event) {
// Log lines for functions are of the general form:
- // "LazyCompile:<type><function_name>", where the type is one of
- // "*", "~" or "".
- static const char kPreamble[] = "LazyCompile:";
- static size_t kPreambleLen = sizeof(kPreamble) - 1;
+ // "LazyCompile:<type><function_name>" or Function:<type><function_name>,
+ // where the type is one of "*", "~" or "".
+ static const char* kPreamble;
+ if (!i::FLAG_lazy || (i::FLAG_ignition && i::FLAG_ignition_eager)) {
+ kPreamble = "Function:";
+ } else {
+ kPreamble = "LazyCompile:";
+ }
+ static size_t kPreambleLen = strlen(kPreamble);
- if (event->name.len < sizeof(kPreamble) - 1 ||
+ if (event->name.len < kPreambleLen ||
strncmp(kPreamble, event->name.str, kPreambleLen) != 0) {
return false;
}
@@ -14717,7 +14707,8 @@
for (int i = 0; i < kIterations; ++i) {
LocalContext env(isolate);
i::AlwaysAllocateScope always_allocate(i_isolate);
- SimulateFullSpace(heap->code_space());
+ SimulateFullSpace(i::FLAG_ignition ? heap->old_space()
+ : heap->code_space());
CompileRun(script);
// Keep a strong reference to the code object in the handle scope.
@@ -15158,6 +15149,9 @@
// Tests that ScriptData can be serialized and deserialized.
TEST(PreCompileSerialization) {
+ // Producing cached parser data while parsing eagerly is not supported.
+ if (!i::FLAG_lazy || (i::FLAG_ignition && i::FLAG_ignition_eager)) return;
+
v8::V8::Initialize();
LocalContext env;
v8::Isolate* isolate = env->GetIsolate();
@@ -18377,6 +18371,7 @@
THREADED_TEST(FunctionGetDebugName) {
+ i::FLAG_harmony_function_name = true;
LocalContext env;
v8::HandleScope scope(env->GetIsolate());
const char* code =
@@ -18420,7 +18415,8 @@
"Object.defineProperty(i, 'name', { value: 'function.name' });"
"var j = function() {};"
"Object.defineProperty(j, 'name', { value: 'function.name' });"
- "var foo = { bar : { baz : function() {}}}; var k = foo.bar.baz;";
+ "var foo = { bar : { baz : (0, function() {})}}; var k = foo.bar.baz;"
+ "var foo = { bar : { baz : function() {} }}; var l = foo.bar.baz;";
v8::ScriptOrigin origin = v8::ScriptOrigin(v8_str("test"));
v8::Script::Compile(env.local(), v8_str(code), &origin)
.ToLocalChecked()
@@ -18439,7 +18435,8 @@
"h", "displayName",
"i", "function.name",
"j", "function.name",
- "k", "foo.bar.baz"};
+ "k", "foo.bar.baz",
+ "l", "baz"};
for (size_t i = 0; i < sizeof(functions) / sizeof(functions[0]) / 2; ++i) {
v8::Local<v8::Function> f = v8::Local<v8::Function>::Cast(
env->Global()
@@ -19915,7 +19912,6 @@
TEST(RegExp) {
- i::FLAG_harmony_regexps = true;
i::FLAG_harmony_unicode_regexps = true;
LocalContext context;
v8::HandleScope scope(context->GetIsolate());
@@ -20571,7 +20567,8 @@
int elements = CountLiveMapsInMapCache(CcTest::i_isolate()->context());
CHECK_LE(1, elements);
- CcTest::heap()->CollectAllGarbage();
+ // We have to abort incremental marking here to abandon black pages.
+ CcTest::heap()->CollectAllGarbage(i::Heap::kAbortIncrementalMarkingMask);
CHECK_GT(elements, CountLiveMapsInMapCache(CcTest::i_isolate()->context()));
}
@@ -20921,12 +20918,16 @@
static void MicrotaskOne(const v8::FunctionCallbackInfo<Value>& info) {
v8::HandleScope scope(info.GetIsolate());
+ v8::MicrotasksScope microtasks(info.GetIsolate(),
+ v8::MicrotasksScope::kDoNotRunMicrotasks);
CompileRun("ext1Calls++;");
}
static void MicrotaskTwo(const v8::FunctionCallbackInfo<Value>& info) {
v8::HandleScope scope(info.GetIsolate());
+ v8::MicrotasksScope microtasks(info.GetIsolate(),
+ v8::MicrotasksScope::kDoNotRunMicrotasks);
CompileRun("ext2Calls++;");
}
@@ -21033,23 +21034,35 @@
}
+uint8_t microtasks_completed_callback_count = 0;
+
+
+static void MicrotasksCompletedCallback(v8::Isolate* isolate) {
+ ++microtasks_completed_callback_count;
+}
+
+
TEST(SetAutorunMicrotasks) {
LocalContext env;
v8::HandleScope scope(env->GetIsolate());
+ env->GetIsolate()->AddMicrotasksCompletedCallback(
+ &MicrotasksCompletedCallback);
CompileRun(
"var ext1Calls = 0;"
"var ext2Calls = 0;");
CompileRun("1+1;");
CHECK_EQ(0, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
CHECK_EQ(0, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(0u, microtasks_completed_callback_count);
env->GetIsolate()->EnqueueMicrotask(
Function::New(env.local(), MicrotaskOne).ToLocalChecked());
CompileRun("1+1;");
CHECK_EQ(1, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
CHECK_EQ(0, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(1u, microtasks_completed_callback_count);
- env->GetIsolate()->SetAutorunMicrotasks(false);
+ env->GetIsolate()->SetMicrotasksPolicy(v8::MicrotasksPolicy::kExplicit);
env->GetIsolate()->EnqueueMicrotask(
Function::New(env.local(), MicrotaskOne).ToLocalChecked());
env->GetIsolate()->EnqueueMicrotask(
@@ -21057,27 +21070,32 @@
CompileRun("1+1;");
CHECK_EQ(1, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
CHECK_EQ(0, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(1u, microtasks_completed_callback_count);
env->GetIsolate()->RunMicrotasks();
CHECK_EQ(2, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
CHECK_EQ(1, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(2u, microtasks_completed_callback_count);
env->GetIsolate()->EnqueueMicrotask(
Function::New(env.local(), MicrotaskTwo).ToLocalChecked());
CompileRun("1+1;");
CHECK_EQ(2, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
CHECK_EQ(1, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(2u, microtasks_completed_callback_count);
env->GetIsolate()->RunMicrotasks();
CHECK_EQ(2, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
CHECK_EQ(2, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(3u, microtasks_completed_callback_count);
- env->GetIsolate()->SetAutorunMicrotasks(true);
+ env->GetIsolate()->SetMicrotasksPolicy(v8::MicrotasksPolicy::kAuto);
env->GetIsolate()->EnqueueMicrotask(
Function::New(env.local(), MicrotaskTwo).ToLocalChecked());
CompileRun("1+1;");
CHECK_EQ(2, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
CHECK_EQ(3, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(4u, microtasks_completed_callback_count);
env->GetIsolate()->EnqueueMicrotask(
Function::New(env.local(), MicrotaskTwo).ToLocalChecked());
@@ -21086,18 +21104,29 @@
CompileRun("1+1;");
CHECK_EQ(2, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
CHECK_EQ(3, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(4u, microtasks_completed_callback_count);
}
CompileRun("1+1;");
CHECK_EQ(2, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
CHECK_EQ(4, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(5u, microtasks_completed_callback_count);
+
+ env->GetIsolate()->RemoveMicrotasksCompletedCallback(
+ &MicrotasksCompletedCallback);
+ env->GetIsolate()->EnqueueMicrotask(
+ Function::New(env.local(), MicrotaskOne).ToLocalChecked());
+ CompileRun("1+1;");
+ CHECK_EQ(3, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(4, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(5u, microtasks_completed_callback_count);
}
TEST(RunMicrotasksWithoutEnteringContext) {
v8::Isolate* isolate = CcTest::isolate();
HandleScope handle_scope(isolate);
- isolate->SetAutorunMicrotasks(false);
+ isolate->SetMicrotasksPolicy(v8::MicrotasksPolicy::kExplicit);
Local<Context> context = Context::New(isolate);
{
Context::Scope context_scope(context);
@@ -21110,7 +21139,147 @@
Context::Scope context_scope(context);
CHECK_EQ(1, CompileRun("ext1Calls")->Int32Value(context).FromJust());
}
- isolate->SetAutorunMicrotasks(true);
+ isolate->SetMicrotasksPolicy(v8::MicrotasksPolicy::kAuto);
+}
+
+
+TEST(ScopedMicrotasks) {
+ LocalContext env;
+ v8::HandleScope handles(env->GetIsolate());
+ env->GetIsolate()->SetMicrotasksPolicy(v8::MicrotasksPolicy::kScoped);
+ {
+ v8::MicrotasksScope scope1(env->GetIsolate(),
+ v8::MicrotasksScope::kDoNotRunMicrotasks);
+ env->GetIsolate()->EnqueueMicrotask(
+ Function::New(env.local(), MicrotaskOne).ToLocalChecked());
+ CompileRun(
+ "var ext1Calls = 0;"
+ "var ext2Calls = 0;");
+ CompileRun("1+1;");
+ CHECK_EQ(0, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(0, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ {
+ v8::MicrotasksScope scope2(env->GetIsolate(),
+ v8::MicrotasksScope::kRunMicrotasks);
+ CompileRun("1+1;");
+ CHECK_EQ(0, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(0, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ {
+ v8::MicrotasksScope scope3(env->GetIsolate(),
+ v8::MicrotasksScope::kRunMicrotasks);
+ CompileRun("1+1;");
+ CHECK_EQ(0,
+ CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(0,
+ CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ }
+ CHECK_EQ(0, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(0, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ }
+ CHECK_EQ(1, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(0, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ env->GetIsolate()->EnqueueMicrotask(
+ Function::New(env.local(), MicrotaskTwo).ToLocalChecked());
+ }
+
+ {
+ v8::MicrotasksScope scope(env->GetIsolate(),
+ v8::MicrotasksScope::kDoNotRunMicrotasks);
+ CHECK_EQ(1, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(0, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ }
+
+ {
+ v8::MicrotasksScope scope1(env->GetIsolate(),
+ v8::MicrotasksScope::kRunMicrotasks);
+ CompileRun("1+1;");
+ CHECK_EQ(1, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(0, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ {
+ v8::MicrotasksScope scope2(env->GetIsolate(),
+ v8::MicrotasksScope::kDoNotRunMicrotasks);
+ }
+ CHECK_EQ(1, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(0, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ }
+
+ {
+ v8::MicrotasksScope scope(env->GetIsolate(),
+ v8::MicrotasksScope::kDoNotRunMicrotasks);
+ CHECK_EQ(1, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(1, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ env->GetIsolate()->EnqueueMicrotask(
+ Function::New(env.local(), MicrotaskTwo).ToLocalChecked());
+ }
+
+ {
+ v8::Isolate::SuppressMicrotaskExecutionScope scope1(env->GetIsolate());
+ {
+ v8::MicrotasksScope scope2(env->GetIsolate(),
+ v8::MicrotasksScope::kRunMicrotasks);
+ }
+ v8::MicrotasksScope scope3(env->GetIsolate(),
+ v8::MicrotasksScope::kDoNotRunMicrotasks);
+ CHECK_EQ(1, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(1, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ }
+
+ {
+ v8::MicrotasksScope scope1(env->GetIsolate(),
+ v8::MicrotasksScope::kRunMicrotasks);
+ v8::MicrotasksScope::PerformCheckpoint(env->GetIsolate());
+ CHECK_EQ(1, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(1, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ }
+
+ {
+ v8::MicrotasksScope scope(env->GetIsolate(),
+ v8::MicrotasksScope::kDoNotRunMicrotasks);
+ CHECK_EQ(1, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(2, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ }
+
+ v8::MicrotasksScope::PerformCheckpoint(env->GetIsolate());
+
+ {
+ v8::MicrotasksScope scope(env->GetIsolate(),
+ v8::MicrotasksScope::kDoNotRunMicrotasks);
+ CHECK_EQ(1, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(2, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ env->GetIsolate()->EnqueueMicrotask(
+ Function::New(env.local(), MicrotaskTwo).ToLocalChecked());
+ }
+
+ v8::MicrotasksScope::PerformCheckpoint(env->GetIsolate());
+
+ {
+ v8::MicrotasksScope scope(env->GetIsolate(),
+ v8::MicrotasksScope::kDoNotRunMicrotasks);
+ CHECK_EQ(1, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(3, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ }
+
+ env->GetIsolate()->EnqueueMicrotask(
+ Function::New(env.local(), MicrotaskOne).ToLocalChecked());
+ {
+ v8::Isolate::SuppressMicrotaskExecutionScope scope1(env->GetIsolate());
+ v8::MicrotasksScope::PerformCheckpoint(env->GetIsolate());
+ v8::MicrotasksScope scope2(env->GetIsolate(),
+ v8::MicrotasksScope::kDoNotRunMicrotasks);
+ CHECK_EQ(1, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(3, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ }
+
+ v8::MicrotasksScope::PerformCheckpoint(env->GetIsolate());
+
+ {
+ v8::MicrotasksScope scope(env->GetIsolate(),
+ v8::MicrotasksScope::kDoNotRunMicrotasks);
+ CHECK_EQ(2, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
+ CHECK_EQ(3, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+ }
+
+ env->GetIsolate()->SetMicrotasksPolicy(v8::MicrotasksPolicy::kAuto);
}
@@ -21133,7 +21302,7 @@
i::FLAG_allow_natives_syntax = true;
v8::Isolate* isolate = CcTest::isolate();
HandleScope handle_scope(isolate);
- isolate->SetAutorunMicrotasks(false);
+ isolate->SetMicrotasksPolicy(v8::MicrotasksPolicy::kExplicit);
Local<Context> context = Context::New(isolate);
v8::Debug::SetDebugEventListener(isolate, DebugEventInObserver);
{
@@ -21143,7 +21312,7 @@
"obj.a = 0;");
}
isolate->RunMicrotasks();
- isolate->SetAutorunMicrotasks(true);
+ isolate->SetMicrotasksPolicy(v8::MicrotasksPolicy::kAuto);
v8::Debug::SetDebugEventListener(isolate, nullptr);
}
@@ -22037,7 +22206,7 @@
CheckCorrectThrow("%DeleteProperty_Strict(other, 'x')");
CheckCorrectThrow("%DeleteProperty_Sloppy(other, '1')");
CheckCorrectThrow("%DeleteProperty_Strict(other, '1')");
- CheckCorrectThrow("%HasOwnProperty(other, 'x')");
+ CheckCorrectThrow("Object.prototype.hasOwnProperty.call(other, 'x')");
CheckCorrectThrow("%HasProperty('x', other)");
CheckCorrectThrow("%PropertyIsEnumerable(other, 'x')");
// PROPERTY_ATTRIBUTES_NONE = 0
@@ -22447,7 +22616,8 @@
->serial_number()),
i_isolate);
auto cache = i_isolate->template_instantiations_cache();
- CHECK(cache->Lookup(serial_number)->IsTheHole());
+ CHECK(cache->FindEntry(static_cast<uint32_t>(serial_number->value())) ==
+ i::UnseededNumberDictionary::kNotFound);
// Verify that each Function::New creates a new function instance
Local<Object> data2 = v8::Object::New(isolate);
function_new_expected_env = data2;
@@ -23912,12 +24082,18 @@
v8::V8::Initialize();
v8::HandleScope scope(CcTest::isolate());
LocalContext context;
- TestInvalidCacheData(v8::ScriptCompiler::kConsumeParserCache);
+ if (i::FLAG_lazy && !(i::FLAG_ignition && i::FLAG_ignition_eager)) {
+ // Cached parser data is not consumed while parsing eagerly.
+ TestInvalidCacheData(v8::ScriptCompiler::kConsumeParserCache);
+ }
TestInvalidCacheData(v8::ScriptCompiler::kConsumeCodeCache);
}
TEST(ParserCacheRejectedGracefully) {
+ // Producing cached parser data while parsing eagerly is not supported.
+ if (!i::FLAG_lazy || (i::FLAG_ignition && i::FLAG_ignition_eager)) return;
+
i::FLAG_min_preparse_length = 0;
v8::V8::Initialize();
v8::HandleScope scope(CcTest::isolate());
@@ -24184,271 +24360,6 @@
}
-static bool access_was_called = false;
-
-static bool AccessAlwaysAllowedWithFlag(Local<v8::Context> accessing_context,
- Local<v8::Object> accessed_object,
- Local<v8::Value> data) {
- access_was_called = true;
- return true;
-}
-
-static bool AccessAlwaysBlockedWithFlag(Local<v8::Context> accessing_context,
- Local<v8::Object> accessed_object,
- Local<v8::Value> data) {
- access_was_called = true;
- return false;
-}
-
-
-TEST(StrongModeAccessCheckAllowed) {
- i::FLAG_strong_mode = true;
- v8::Isolate* isolate = CcTest::isolate();
- v8::HandleScope handle_scope(isolate);
- v8::Local<Value> value;
- access_was_called = false;
-
- v8::Local<v8::ObjectTemplate> obj_template = v8::ObjectTemplate::New(isolate);
-
- obj_template->Set(v8_str("x"), v8::Integer::New(isolate, 42));
- obj_template->SetAccessCheckCallback(AccessAlwaysAllowedWithFlag);
-
- // Create an environment
- v8::Local<Context> context0 = Context::New(isolate, NULL, obj_template);
- context0->Enter();
- v8::Local<v8::Object> global0 = context0->Global();
- global0->Set(context0, v8_str("object"),
- obj_template->NewInstance(context0).ToLocalChecked())
- .FromJust();
- {
- v8::TryCatch try_catch(isolate);
- value = CompileRun("'use strong'; object.x");
- CHECK(!try_catch.HasCaught());
- CHECK(!access_was_called);
- CHECK_EQ(42, value->Int32Value(context0).FromJust());
- }
- {
- v8::TryCatch try_catch(isolate);
- value = CompileRun("'use strong'; object.foo");
- CHECK(try_catch.HasCaught());
- CHECK(!access_was_called);
- }
- {
- v8::TryCatch try_catch(isolate);
- value = CompileRun("'use strong'; object[10]");
- CHECK(try_catch.HasCaught());
- CHECK(!access_was_called);
- }
-
- // Create an environment
- v8::Local<Context> context1 = Context::New(isolate);
- context1->Enter();
- v8::Local<v8::Object> global1 = context1->Global();
- global1->Set(context1, v8_str("object"),
- obj_template->NewInstance(context1).ToLocalChecked())
- .FromJust();
- {
- v8::TryCatch try_catch(isolate);
- value = CompileRun("'use strong'; object.x");
- CHECK(!try_catch.HasCaught());
- CHECK(access_was_called);
- CHECK_EQ(42, value->Int32Value(context1).FromJust());
- }
- access_was_called = false;
- {
- v8::TryCatch try_catch(isolate);
- value = CompileRun("'use strong'; object.foo");
- CHECK(try_catch.HasCaught());
- CHECK(access_was_called);
- }
- access_was_called = false;
- {
- v8::TryCatch try_catch(isolate);
- value = CompileRun("'use strong'; object[10]");
- CHECK(try_catch.HasCaught());
- CHECK(access_was_called);
- }
-
- context1->Exit();
- context0->Exit();
-}
-
-
-TEST(StrongModeAccessCheckBlocked) {
- i::FLAG_strong_mode = true;
- v8::Isolate* isolate = CcTest::isolate();
- v8::HandleScope handle_scope(isolate);
- v8::Local<Value> value;
- access_was_called = false;
-
- v8::Local<v8::ObjectTemplate> obj_template = v8::ObjectTemplate::New(isolate);
-
- obj_template->Set(v8_str("x"), v8::Integer::New(isolate, 42));
- obj_template->SetAccessCheckCallback(AccessAlwaysBlockedWithFlag);
-
- // Create an environment
- v8::Local<Context> context0 = Context::New(isolate, NULL, obj_template);
- context0->Enter();
- v8::Local<v8::Object> global0 = context0->Global();
- global0->Set(context0, v8_str("object"),
- obj_template->NewInstance(context0).ToLocalChecked())
- .FromJust();
- {
- v8::TryCatch try_catch(isolate);
- value = CompileRun("'use strong'; object.x");
- CHECK(!try_catch.HasCaught());
- CHECK(!access_was_called);
- CHECK_EQ(42, value->Int32Value(context0).FromJust());
- }
- {
- v8::TryCatch try_catch(isolate);
- value = CompileRun("'use strong'; object.foo");
- CHECK(try_catch.HasCaught());
- CHECK(!access_was_called);
- }
- {
- v8::TryCatch try_catch(isolate);
- value = CompileRun("'use strong'; object[10]");
- CHECK(try_catch.HasCaught());
- CHECK(!access_was_called);
- }
-
- // Create an environment
- v8::Local<Context> context1 = Context::New(isolate);
- context1->Enter();
- v8::Local<v8::Object> global1 = context1->Global();
- global1->Set(context1, v8_str("object"),
- obj_template->NewInstance(context1).ToLocalChecked())
- .FromJust();
- {
- v8::TryCatch try_catch(isolate);
- value = CompileRun("'use strong'; object.x");
- CHECK(try_catch.HasCaught());
- CHECK(access_was_called);
- }
- access_was_called = false;
- {
- v8::TryCatch try_catch(isolate);
- value = CompileRun("'use strong'; object.foo");
- CHECK(try_catch.HasCaught());
- CHECK(access_was_called);
- }
- access_was_called = false;
- {
- v8::TryCatch try_catch(isolate);
- value = CompileRun("'use strong'; object[10]");
- CHECK(try_catch.HasCaught());
- CHECK(access_was_called);
- }
-
- context1->Exit();
- context0->Exit();
-}
-
-
-TEST(StrongModeArityCallFromApi) {
- i::FLAG_strong_mode = true;
- LocalContext env;
- v8::Isolate* isolate = env->GetIsolate();
- v8::HandleScope scope(isolate);
- Local<Function> fun;
- {
- v8::TryCatch try_catch(isolate);
- fun = Local<Function>::Cast(CompileRun(
- "function f(x) { 'use strong'; }"
- "f"));
-
- CHECK(!try_catch.HasCaught());
- }
-
- {
- v8::TryCatch try_catch(isolate);
- CHECK(fun->Call(env.local(), v8::Undefined(isolate), 0, nullptr).IsEmpty());
- CHECK(try_catch.HasCaught());
- }
-
- {
- v8::TryCatch try_catch(isolate);
- v8::Local<Value> args[] = {v8_num(42)};
- fun->Call(env.local(), v8::Undefined(isolate), arraysize(args), args)
- .ToLocalChecked();
- CHECK(!try_catch.HasCaught());
- }
-
- {
- v8::TryCatch try_catch(isolate);
- v8::Local<Value> args[] = {v8_num(42), v8_num(555)};
- fun->Call(env.local(), v8::Undefined(isolate), arraysize(args), args)
- .ToLocalChecked();
- CHECK(!try_catch.HasCaught());
- }
-}
-
-
-TEST(StrongModeArityCallFromApi2) {
- i::FLAG_strong_mode = true;
- LocalContext env;
- v8::Isolate* isolate = env->GetIsolate();
- v8::HandleScope scope(isolate);
- Local<Function> fun;
- {
- v8::TryCatch try_catch(isolate);
- fun = Local<Function>::Cast(CompileRun(
- "'use strong';"
- "function f(x) {}"
- "f"));
-
- CHECK(!try_catch.HasCaught());
- }
-
- {
- v8::TryCatch try_catch(isolate);
- CHECK(fun->Call(env.local(), v8::Undefined(isolate), 0, nullptr).IsEmpty());
- CHECK(try_catch.HasCaught());
- }
-
- {
- v8::TryCatch try_catch(isolate);
- v8::Local<Value> args[] = {v8_num(42)};
- fun->Call(env.local(), v8::Undefined(isolate), arraysize(args), args)
- .ToLocalChecked();
- CHECK(!try_catch.HasCaught());
- }
-
- {
- v8::TryCatch try_catch(isolate);
- v8::Local<Value> args[] = {v8_num(42), v8_num(555)};
- fun->Call(env.local(), v8::Undefined(isolate), arraysize(args), args)
- .ToLocalChecked();
- CHECK(!try_catch.HasCaught());
- }
-}
-
-
-TEST(StrongObjectDelete) {
- i::FLAG_strong_mode = true;
- LocalContext env;
- v8::Isolate* isolate = env->GetIsolate();
- v8::HandleScope scope(isolate);
- Local<Object> obj;
- {
- v8::TryCatch try_catch(isolate);
- obj = Local<Object>::Cast(CompileRun(
- "'use strong';"
- "({});"));
- CHECK(!try_catch.HasCaught());
- }
- obj->DefineOwnProperty(env.local(), v8_str("foo"), v8_num(1), v8::None)
- .FromJust();
- obj->DefineOwnProperty(env.local(), v8_str("2"), v8_num(1), v8::None)
- .FromJust();
- CHECK(obj->HasOwnProperty(env.local(), v8_str("foo")).FromJust());
- CHECK(obj->HasOwnProperty(env.local(), v8_str("2")).FromJust());
- CHECK(!obj->Delete(env.local(), v8_str("foo")).FromJust());
- CHECK(!obj->Delete(env.local(), 2).FromJust());
-}
-
-
static void ExtrasBindingTestRuntimeFunction(
const v8::FunctionCallbackInfo<v8::Value>& args) {
CHECK_EQ(
@@ -24760,6 +24671,53 @@
0);
}
+THREADED_TEST(ReceiverConversionForAccessors) {
+ LocalContext env;
+ v8::Isolate* isolate = CcTest::isolate();
+ v8::HandleScope scope(isolate);
+ Local<v8::FunctionTemplate> acc =
+ v8::FunctionTemplate::New(isolate, Returns42);
+ CHECK(env->Global()
+ ->Set(env.local(), v8_str("acc"),
+ acc->GetFunction(env.local()).ToLocalChecked())
+ .FromJust());
+
+ Local<ObjectTemplate> templ = ObjectTemplate::New(isolate);
+ templ->SetAccessorProperty(v8_str("acc"), acc, acc);
+ Local<v8::Object> instance = templ->NewInstance(env.local()).ToLocalChecked();
+
+ CHECK(env->Global()->Set(env.local(), v8_str("p"), instance).FromJust());
+ CHECK(CompileRun("(p.acc == 42)")->BooleanValue(env.local()).FromJust());
+ CHECK(CompileRun("(p.acc = 7) == 7")->BooleanValue(env.local()).FromJust());
+
+ CHECK(!CompileRun("Number.prototype.__proto__ = p;"
+ "var a = 1;")
+ .IsEmpty());
+ CHECK(CompileRun("(a.acc == 42)")->BooleanValue(env.local()).FromJust());
+ CHECK(CompileRun("(a.acc = 7) == 7")->BooleanValue(env.local()).FromJust());
+
+ CHECK(!CompileRun("Boolean.prototype.__proto__ = p;"
+ "var a = true;")
+ .IsEmpty());
+ CHECK(CompileRun("(a.acc == 42)")->BooleanValue(env.local()).FromJust());
+ CHECK(CompileRun("(a.acc = 7) == 7")->BooleanValue(env.local()).FromJust());
+
+ CHECK(!CompileRun("String.prototype.__proto__ = p;"
+ "var a = 'foo';")
+ .IsEmpty());
+ CHECK(CompileRun("(a.acc == 42)")->BooleanValue(env.local()).FromJust());
+ CHECK(CompileRun("(a.acc = 7) == 7")->BooleanValue(env.local()).FromJust());
+
+ CHECK(CompileRun("acc.call(1) == 42")->BooleanValue(env.local()).FromJust());
+ CHECK(CompileRun("acc.call(true)==42")->BooleanValue(env.local()).FromJust());
+ CHECK(CompileRun("acc.call('aa')==42")->BooleanValue(env.local()).FromJust());
+ CHECK(
+ CompileRun("acc.call(null) == 42")->BooleanValue(env.local()).FromJust());
+ CHECK(CompileRun("acc.call(undefined) == 42")
+ ->BooleanValue(env.local())
+ .FromJust());
+}
+
class FutexInterruptionThread : public v8::base::Thread {
public:
explicit FutexInterruptionThread(v8::Isolate* isolate)
@@ -24873,7 +24831,6 @@
TEST(AccessCheckedToStringTag) {
- i::FLAG_harmony_tostring = true;
v8::Isolate* isolate = CcTest::isolate();
HandleScope scope(isolate);
LocalContext env;
@@ -24952,7 +24909,6 @@
TEST(Proxy) {
- i::FLAG_harmony_proxies = true;
LocalContext context;
v8::Isolate* isolate = CcTest::isolate();
v8::HandleScope scope(isolate);
@@ -24974,3 +24930,98 @@
CHECK(proxy->GetTarget()->SameValue(target));
CHECK(proxy->GetHandler()->IsNull());
}
+
+WeakCallCounterAndPersistent<Value>* CreateGarbageWithWeakCallCounter(
+ v8::Isolate* isolate, WeakCallCounter* counter) {
+ v8::Locker locker(isolate);
+ LocalContext env;
+ HandleScope scope(isolate);
+ WeakCallCounterAndPersistent<Value>* val =
+ new WeakCallCounterAndPersistent<Value>(counter);
+ val->handle.Reset(isolate, Object::New(isolate));
+ val->handle.SetWeak(val, &WeakPointerCallback,
+ v8::WeakCallbackType::kParameter);
+ return val;
+}
+
+class MemoryPressureThread : public v8::base::Thread {
+ public:
+ explicit MemoryPressureThread(v8::Isolate* isolate,
+ v8::MemoryPressureLevel level)
+ : Thread(Options("MemoryPressureThread")),
+ isolate_(isolate),
+ level_(level) {}
+
+ virtual void Run() { isolate_->MemoryPressureNotification(level_); }
+
+ private:
+ v8::Isolate* isolate_;
+ v8::MemoryPressureLevel level_;
+};
+
+TEST(MemoryPressure) {
+ v8::Isolate* isolate = CcTest::isolate();
+ WeakCallCounter counter(1234);
+
+ // Check that critical memory pressure notification sets GC interrupt.
+ auto garbage = CreateGarbageWithWeakCallCounter(isolate, &counter);
+ CHECK(!v8::Locker::IsLocked(isolate));
+ {
+ v8::Locker locker(isolate);
+ v8::HandleScope scope(isolate);
+ LocalContext env;
+ MemoryPressureThread memory_pressure_thread(
+ isolate, v8::MemoryPressureLevel::kCritical);
+ memory_pressure_thread.Start();
+ memory_pressure_thread.Join();
+ // This should trigger GC.
+ CHECK_EQ(0, counter.NumberOfWeakCalls());
+ CompileRun("(function noop() { return 0; })()");
+ CHECK_EQ(1, counter.NumberOfWeakCalls());
+ }
+ delete garbage;
+ // Check that critical memory pressure notification triggers GC.
+ garbage = CreateGarbageWithWeakCallCounter(isolate, &counter);
+ {
+ v8::Locker locker(isolate);
+ // If isolate is locked, memory pressure notification should trigger GC.
+ CHECK_EQ(1, counter.NumberOfWeakCalls());
+ isolate->MemoryPressureNotification(v8::MemoryPressureLevel::kCritical);
+ CHECK_EQ(2, counter.NumberOfWeakCalls());
+ }
+ delete garbage;
+ // Check that moderate memory pressure notification sets GC into memory
+ // optimizing mode.
+ isolate->MemoryPressureNotification(v8::MemoryPressureLevel::kModerate);
+ CHECK(CcTest::i_isolate()->heap()->ShouldOptimizeForMemoryUsage());
+ // Check that disabling memory pressure returns GC into normal mode.
+ isolate->MemoryPressureNotification(v8::MemoryPressureLevel::kNone);
+ CHECK(!CcTest::i_isolate()->heap()->ShouldOptimizeForMemoryUsage());
+}
+
+TEST(SetIntegrityLevel) {
+ LocalContext context;
+ v8::Isolate* isolate = CcTest::isolate();
+ v8::HandleScope scope(isolate);
+
+ v8::Local<v8::Object> obj = v8::Object::New(isolate);
+ CHECK(context->Global()->Set(context.local(), v8_str("o"), obj).FromJust());
+
+ v8::Local<v8::Value> is_frozen = CompileRun("Object.isFrozen(o)");
+ CHECK(!is_frozen->BooleanValue(context.local()).FromJust());
+
+ CHECK(obj->SetIntegrityLevel(context.local(), v8::IntegrityLevel::kFrozen)
+ .FromJust());
+
+ is_frozen = CompileRun("Object.isFrozen(o)");
+ CHECK(is_frozen->BooleanValue(context.local()).FromJust());
+}
+
+TEST(PrivateForApiIsNumber) {
+ LocalContext context;
+ v8::Isolate* isolate = CcTest::isolate();
+ v8::HandleScope scope(isolate);
+
+ // Shouldn't crash.
+ v8::Private::ForApi(isolate, v8_str("42"));
+}
diff --git a/test/cctest/test-api.h b/test/cctest/test-api.h
index 379fe9c..8887a8a 100644
--- a/test/cctest/test-api.h
+++ b/test/cctest/test-api.h
@@ -18,6 +18,12 @@
CHECK((*o)->IsTheHole() || (*o)->IsUndefined());
// Verify reset
bool is_runtime = (*o)->IsTheHole();
+ if (is_runtime) {
+ CHECK(rv.Get()->IsUndefined());
+ } else {
+ i::Handle<i::Object> v = v8::Utils::OpenHandle(*rv.Get());
+ CHECK_EQ(*v, *o);
+ }
rv.Set(true);
CHECK(!(*o)->IsTheHole() && !(*o)->IsUndefined());
rv.Set(v8::Local<v8::Object>());
diff --git a/test/cctest/test-asm-validator.cc b/test/cctest/test-asm-validator.cc
index 207b915..d5b5179 100644
--- a/test/cctest/test-asm-validator.cc
+++ b/test/cctest/test-asm-validator.cc
@@ -183,7 +183,7 @@
CHECK_EXPR(Literal, Bounds(cache.kAsmFixnum));
}
}
- // p = (p + 8)|0) {\n"
+ // p = (p + 8)|0) {
CHECK_EXPR(Assignment, Bounds(cache.kAsmInt)) {
CHECK_VAR(p, Bounds(cache.kAsmInt));
CHECK_EXPR(BinaryOperation, Bounds(cache.kAsmSigned)) {
@@ -354,59 +354,54 @@
Validate(zone, test_function, &types));
}
+#define HARNESS_STDLIB() \
+ "var Infinity = stdlib.Infinity; " \
+ "var NaN = stdlib.NaN; " \
+ "var acos = stdlib.Math.acos; " \
+ "var asin = stdlib.Math.asin; " \
+ "var atan = stdlib.Math.atan; " \
+ "var cos = stdlib.Math.cos; " \
+ "var sin = stdlib.Math.sin; " \
+ "var tan = stdlib.Math.tan; " \
+ "var exp = stdlib.Math.exp; " \
+ "var log = stdlib.Math.log; " \
+ "var ceil = stdlib.Math.ceil; " \
+ "var floor = stdlib.Math.floor; " \
+ "var sqrt = stdlib.Math.sqrt; " \
+ "var min = stdlib.Math.min; " \
+ "var max = stdlib.Math.max; " \
+ "var atan2 = stdlib.Math.atan2; " \
+ "var pow = stdlib.Math.pow; " \
+ "var abs = stdlib.Math.abs; " \
+ "var imul = stdlib.Math.imul; " \
+ "var fround = stdlib.Math.fround; " \
+ "var E = stdlib.Math.E; " \
+ "var LN10 = stdlib.Math.LN10; " \
+ "var LN2 = stdlib.Math.LN2; " \
+ "var LOG2E = stdlib.Math.LOG2E; " \
+ "var LOG10E = stdlib.Math.LOG10E; " \
+ "var PI = stdlib.Math.PI; " \
+ "var SQRT1_2 = stdlib.Math.SQRT1_2; " \
+ "var SQRT2 = stdlib.Math.SQRT2; "
-#define HARNESS_STDLIB() \
- "var Infinity = stdlib.Infinity;\n" \
- "var NaN = stdlib.NaN;\n" \
- "var acos = stdlib.Math.acos;\n" \
- "var asin = stdlib.Math.asin;\n" \
- "var atan = stdlib.Math.atan;\n" \
- "var cos = stdlib.Math.cos;\n" \
- "var sin = stdlib.Math.sin;\n" \
- "var tan = stdlib.Math.tan;\n" \
- "var exp = stdlib.Math.exp;\n" \
- "var log = stdlib.Math.log;\n" \
- "var ceil = stdlib.Math.ceil;\n" \
- "var floor = stdlib.Math.floor;\n" \
- "var sqrt = stdlib.Math.sqrt;\n" \
- "var min = stdlib.Math.min;\n" \
- "var max = stdlib.Math.max;\n" \
- "var atan2 = stdlib.Math.atan2;\n" \
- "var pow = stdlib.Math.pow;\n" \
- "var abs = stdlib.Math.abs;\n" \
- "var imul = stdlib.Math.imul;\n" \
- "var fround = stdlib.Math.fround;\n" \
- "var E = stdlib.Math.E;\n" \
- "var LN10 = stdlib.Math.LN10;\n" \
- "var LN2 = stdlib.Math.LN2;\n" \
- "var LOG2E = stdlib.Math.LOG2E;\n" \
- "var LOG10E = stdlib.Math.LOG10E;\n" \
- "var PI = stdlib.Math.PI;\n" \
- "var SQRT1_2 = stdlib.Math.SQRT1_2;\n" \
- "var SQRT2 = stdlib.Math.SQRT2;\n"
+#define HARNESS_HEAP() \
+ "var u8 = new stdlib.Uint8Array(buffer); " \
+ "var i8 = new stdlib.Int8Array(buffer); " \
+ "var u16 = new stdlib.Uint16Array(buffer); " \
+ "var i16 = new stdlib.Int16Array(buffer); " \
+ "var u32 = new stdlib.Uint32Array(buffer); " \
+ "var i32 = new stdlib.Int32Array(buffer); " \
+ "var f32 = new stdlib.Float32Array(buffer); " \
+ "var f64 = new stdlib.Float64Array(buffer); "
-
-#define HARNESS_HEAP() \
- "var u8 = new stdlib.Uint8Array(buffer);\n" \
- "var i8 = new stdlib.Int8Array(buffer);\n" \
- "var u16 = new stdlib.Uint16Array(buffer);\n" \
- "var i16 = new stdlib.Int16Array(buffer);\n" \
- "var u32 = new stdlib.Uint32Array(buffer);\n" \
- "var i32 = new stdlib.Int32Array(buffer);\n" \
- "var f32 = new stdlib.Float32Array(buffer);\n" \
- "var f64 = new stdlib.Float64Array(buffer);\n"
-
-
-#define HARNESS_PREAMBLE() \
- const char test_function[] = \
- "function Module(stdlib, foreign, buffer) {\n" \
- "\"use asm\";\n" HARNESS_STDLIB() HARNESS_HEAP()
-
+#define HARNESS_PREAMBLE() \
+ const char test_function[] = \
+ "function Module(stdlib, foreign, buffer) { " \
+ "\"use asm\"; " HARNESS_STDLIB() HARNESS_HEAP()
#define HARNESS_POSTAMBLE() \
- "return { foo: foo };\n" \
- "}\n";
-
+ "return { foo: foo }; " \
+ "} ";
#define CHECK_VAR_MATH_SHORTCUT(name, type) \
CHECK_EXPR(Assignment, type) { \
@@ -1088,7 +1083,7 @@
CHECK_FUNC_ERROR(
"function bar() { var x = 1.0; return (x>>>0)|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: left bitwise operand expected to be an integer\n");
+ "asm: line 1: left bitwise operand expected to be an integer\n");
}
@@ -1096,7 +1091,7 @@
CHECK_FUNC_ERROR(
"function bar() { var x = 1.0; return (x&0)|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: left bitwise operand expected to be an integer\n");
+ "asm: line 1: left bitwise operand expected to be an integer\n");
}
@@ -1104,7 +1099,7 @@
CHECK_FUNC_ERROR(
"function bar() { var x = 1.0; var y = 0; return (x + y)|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: ill-typed arithmetic operation\n");
+ "asm: line 1: ill-typed arithmetic operation\n");
}
@@ -1112,7 +1107,7 @@
CHECK_FUNC_ERROR(
"function bar() { var x = 1.0; var y = 0; return (x - y)|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: ill-typed arithmetic operation\n");
+ "asm: line 1: ill-typed arithmetic operation\n");
}
@@ -1120,7 +1115,7 @@
CHECK_FUNC_ERROR(
"function bar() { var x = 1.0; var y = 0; return (x / y)|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: ill-typed arithmetic operation\n");
+ "asm: line 1: ill-typed arithmetic operation\n");
}
@@ -1128,7 +1123,7 @@
CHECK_FUNC_ERROR(
"function bar() { var x = 1.0; var y = 0; return (x % y)|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: ill-typed arithmetic operation\n");
+ "asm: line 1: ill-typed arithmetic operation\n");
}
@@ -1136,7 +1131,7 @@
CHECK_FUNC_ERROR(
"function bar() { var x = fround(1.0); return (x % x)|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: ill-typed arithmetic operation\n");
+ "asm: line 1: ill-typed arithmetic operation\n");
}
@@ -1144,7 +1139,7 @@
CHECK_FUNC_ERROR(
"function bar() { var x = 1; var y = 0.0; return (1 ? x : y)|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: then and else expressions in ? must have the same type\n");
+ "asm: line 1: then and else expressions in ? must have the same type\n");
}
@@ -1152,15 +1147,15 @@
CHECK_FUNC_ERROR(
"function bar() { var x = 1; var y = 0; return (1 ? x + x : y)|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: invalid type in ? then expression\n");
+ "asm: line 1: invalid type in ? then expression\n");
}
TEST(TernaryMismatchInt32Float32) {
CHECK_FUNC_ERROR(
- "function bar() { var x = 1; var y = 2; return (x?fround(y):x)|0; }\n"
+ "function bar() { var x = 1; var y = 2.0; return (x?fround(y):x)|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: then and else expressions in ? must have the same type\n");
+ "asm: line 1: then and else expressions in ? must have the same type\n");
}
@@ -1168,13 +1163,26 @@
CHECK_FUNC_ERROR(
"function bar() { var x = 1; var y = 2.0; return (y?x:1)|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: condition must be of type int\n");
+ "asm: line 1: condition must be of type int\n");
}
+TEST(BadIntishMultiply) {
+ CHECK_FUNC_ERROR(
+ "function bar() { var x = 1; return ((x + x) * 4) | 0; }\n"
+ "function foo() { bar(); }",
+ "asm: line 1: intish not allowed in multiply\n");
+}
-TEST(FroundFloat32) {
- CHECK_FUNC_TYPES_BEGIN(
+TEST(IntToFloat32) {
+ CHECK_FUNC_ERROR(
"function bar() { var x = 1; return fround(x); }\n"
+ "function foo() { bar(); }",
+ "asm: line 1: illegal function argument type\n");
+}
+
+TEST(Int32ToFloat32) {
+ CHECK_FUNC_TYPES_BEGIN(
+ "function bar() { var x = 1; return fround(x|0); }\n"
"function foo() { bar(); }") {
CHECK_EXPR(FunctionLiteral, FUNC_F_TYPE) {
CHECK_EXPR(Assignment, Bounds(cache.kAsmInt)) {
@@ -1183,7 +1191,10 @@
}
CHECK_EXPR(Call, Bounds(cache.kAsmFloat)) {
CHECK_VAR(fround, FUNC_N2F_TYPE);
- CHECK_VAR(x, Bounds(cache.kAsmInt));
+ CHECK_EXPR(BinaryOperation, Bounds(cache.kAsmSigned)) {
+ CHECK_VAR(x, Bounds(cache.kAsmInt));
+ CHECK_EXPR(Literal, Bounds(cache.kAsmFixnum));
+ }
}
}
CHECK_SKIP();
@@ -1191,6 +1202,77 @@
CHECK_FUNC_TYPES_END
}
+TEST(Uint32ToFloat32) {
+ CHECK_FUNC_TYPES_BEGIN(
+ "function bar() { var x = 1; return fround(x>>>0); }\n"
+ "function foo() { bar(); }") {
+ CHECK_EXPR(FunctionLiteral, FUNC_F_TYPE) {
+ CHECK_EXPR(Assignment, Bounds(cache.kAsmInt)) {
+ CHECK_VAR(x, Bounds(cache.kAsmInt));
+ CHECK_EXPR(Literal, Bounds(cache.kAsmFixnum));
+ }
+ CHECK_EXPR(Call, Bounds(cache.kAsmFloat)) {
+ CHECK_VAR(fround, FUNC_N2F_TYPE);
+ CHECK_EXPR(BinaryOperation, Bounds(cache.kAsmUnsigned)) {
+ CHECK_VAR(x, Bounds(cache.kAsmInt));
+ CHECK_EXPR(Literal, Bounds(cache.kAsmFixnum));
+ }
+ }
+ }
+ CHECK_SKIP();
+ }
+ CHECK_FUNC_TYPES_END
+}
+
+TEST(Float64ToFloat32) {
+ CHECK_FUNC_TYPES_BEGIN(
+ "function bar() { var x = 1.0; return fround(x); }\n"
+ "function foo() { bar(); }") {
+ CHECK_EXPR(FunctionLiteral, FUNC_F_TYPE) {
+ CHECK_EXPR(Assignment, Bounds(cache.kAsmDouble)) {
+ CHECK_VAR(x, Bounds(cache.kAsmDouble));
+ CHECK_EXPR(Literal, Bounds(cache.kAsmDouble));
+ }
+ CHECK_EXPR(Call, Bounds(cache.kAsmFloat)) {
+ CHECK_VAR(fround, FUNC_N2F_TYPE);
+ CHECK_VAR(x, Bounds(cache.kAsmDouble));
+ }
+ }
+ CHECK_SKIP();
+ }
+ CHECK_FUNC_TYPES_END
+}
+
+TEST(Int32ToFloat32ToInt32) {
+ CHECK_FUNC_TYPES_BEGIN(
+ "function bar() { var x = 1; return ~~fround(x|0) | 0; }\n"
+ "function foo() { bar(); }") {
+ CHECK_EXPR(FunctionLiteral, FUNC_I_TYPE) {
+ CHECK_EXPR(Assignment, Bounds(cache.kAsmInt)) {
+ CHECK_VAR(x, Bounds(cache.kAsmInt));
+ CHECK_EXPR(Literal, Bounds(cache.kAsmFixnum));
+ }
+ CHECK_EXPR(BinaryOperation, Bounds(cache.kAsmSigned)) {
+ CHECK_EXPR(BinaryOperation, Bounds(cache.kAsmSigned)) {
+ CHECK_EXPR(BinaryOperation, Bounds(cache.kAsmSigned)) {
+ CHECK_EXPR(Call, Bounds(cache.kAsmFloat)) {
+ CHECK_VAR(fround, FUNC_N2F_TYPE);
+ CHECK_EXPR(BinaryOperation, Bounds(cache.kAsmSigned)) {
+ CHECK_VAR(x, Bounds(cache.kAsmInt));
+ CHECK_EXPR(Literal, Bounds(cache.kAsmFixnum));
+ }
+ }
+ CHECK_EXPR(Literal, Bounds(cache.kAsmSigned));
+ }
+ CHECK_EXPR(Literal, Bounds(cache.kAsmSigned));
+ }
+ CHECK_EXPR(Literal, Bounds(cache.kAsmFixnum));
+ }
+ }
+ CHECK_SKIP();
+ }
+ CHECK_FUNC_TYPES_END
+}
TEST(Addition4) {
CHECK_FUNC_TYPES_BEGIN(
@@ -1229,7 +1311,7 @@
CHECK_FUNC_ERROR(
"function bar() { var x = 1; var y = 2; return (x*y)|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: direct integer multiply forbidden\n");
+ "asm: line 1: multiply must be by an integer literal\n");
}
@@ -1237,7 +1319,7 @@
CHECK_FUNC_ERROR(
"function bar() { var x = 1; var y = 2; return (x/y/x/y)|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: too many consecutive multiplicative ops\n");
+ "asm: line 1: too many consecutive multiplicative ops\n");
}
@@ -1245,7 +1327,7 @@
CHECK_FUNC_ERROR(
"function bar() { var x = 1; return ('hi' > x)|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: bad type on left side of comparison\n");
+ "asm: line 1: bad type on left side of comparison\n");
}
@@ -1253,7 +1335,7 @@
CHECK_FUNC_ERROR(
"function bar() { var x = 1; return (x < 'hi')|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: bad type on right side of comparison\n");
+ "asm: line 1: bad type on right side of comparison\n");
}
@@ -1261,7 +1343,7 @@
CHECK_FUNC_ERROR(
"function bar() { var x = 1; var y = 2.0; return (x < y)|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: left and right side of comparison must match\n");
+ "asm: line 1: left and right side of comparison must match\n");
}
@@ -1269,15 +1351,15 @@
CHECK_FUNC_ERROR(
"function bar() { var x = 1; var y = 2; return ((x|0) < (y>>>0))|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: left and right side of comparison must match\n");
+ "asm: line 1: left and right side of comparison must match\n");
}
TEST(CompareMismatchInt32Float32) {
CHECK_FUNC_ERROR(
- "function bar() { var x = 1; var y = 2; return (x < fround(y))|0; }\n"
+ "function bar() { var x = 1; var y = 2.0; return (x < fround(y))|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: left and right side of comparison must match\n");
+ "asm: line 1: left and right side of comparison must match\n");
}
@@ -1618,7 +1700,7 @@
"function bar(x, y) { x = x | 0; y = y | 0;\n"
" return table1[x & 1](y)|0; }\n"
"function foo() { bar(1, 2); }",
- "asm: line 40: array component expected to be a function\n");
+ "asm: line 2: array component expected to be a function\n");
}
@@ -1626,7 +1708,7 @@
CHECK_FUNC_ERROR(
"function bar(x) { var y = 1; }\n"
"function foo() { bar(2); }",
- "asm: line 39: missing parameter type annotations\n");
+ "asm: line 1: missing parameter type annotations\n");
}
@@ -1634,7 +1716,7 @@
CHECK_FUNC_ERROR(
"function bar(x) { x = x / 4; }\n"
"function foo() { bar(2); }",
- "asm: line 39: invalid type annotation on binary op\n");
+ "asm: line 1: invalid type annotation on binary op\n");
}
@@ -1642,7 +1724,7 @@
CHECK_FUNC_ERROR(
"function bar(x) { x = x * 4.0; }\n"
"function foo() { bar(2); }",
- "asm: line 39: invalid type annotation on binary op\n");
+ "asm: line 1: invalid type annotation on binary op\n");
}
@@ -1650,7 +1732,7 @@
CHECK_FUNC_ERROR(
"function bar(x) { return fround(4, 5); }\n"
"function foo() { bar(); }",
- "asm: line 39: invalid argument count calling function\n");
+ "asm: line 1: invalid argument count calling function\n");
}
@@ -1658,7 +1740,7 @@
CHECK_FUNC_ERROR(
"function bar(x) { x = max(x); }\n"
"function foo() { bar(3); }",
- "asm: line 39: only fround allowed on expression annotations\n");
+ "asm: line 1: only fround allowed on expression annotations\n");
}
@@ -1666,7 +1748,7 @@
CHECK_FUNC_ERROR(
"function bar(x) { x = sin(x); }\n"
"function foo() { bar(3); }",
- "asm: line 39: only fround allowed on expression annotations\n");
+ "asm: line 1: only fround allowed on expression annotations\n");
}
@@ -1674,7 +1756,7 @@
CHECK_FUNC_ERROR(
"function bar(x) { x = (x+x)(x); }\n"
"function foo() { bar(3); }",
- "asm: line 39: invalid type annotation\n");
+ "asm: line 1: invalid type annotation\n");
}
@@ -1682,7 +1764,7 @@
CHECK_FUNC_ERROR(
"function bar() { var x = 0; with (x) { x = x + 1; } }\n"
"function foo() { bar(); }",
- "asm: line 39: bad with statement\n");
+ "asm: line 1: bad with statement\n");
}
@@ -1690,7 +1772,7 @@
CHECK_FUNC_ERROR(
"function bar() { function x() { return 1; } }\n"
"function foo() { bar(); }",
- "asm: line 39: function declared inside another\n");
+ "asm: line 1: function declared inside another\n");
}
@@ -1698,7 +1780,7 @@
CHECK_FUNC_ERROR(
"function bar() { var x = y; }\n"
"function foo() { bar(); }",
- "asm: line 39: unbound variable\n");
+ "asm: line 1: unbound variable\n");
}
@@ -1706,7 +1788,7 @@
CHECK_FUNC_ERROR(
"function bar() { return (0 === 0)|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: illegal comparison operator\n");
+ "asm: line 1: illegal comparison operator\n");
}
@@ -1714,15 +1796,19 @@
CHECK_FUNC_ERROR(
"function bar() { return (0 !== 0)|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: illegal comparison operator\n");
+ "asm: line 1: illegal comparison operator\n");
}
TEST(InstanceOf) {
+ const char* errorMsg = FLAG_harmony_instanceof
+ ? "asm: line 0: do-expression encountered\n"
+ : "asm: line 1: illegal comparison operator\n";
+
CHECK_FUNC_ERROR(
"function bar() { return (0 instanceof 0)|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: illegal comparison operator\n");
+ errorMsg);
}
@@ -1730,7 +1816,7 @@
CHECK_FUNC_ERROR(
"function bar() { return (0 in 0)|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: illegal comparison operator\n");
+ "asm: line 1: illegal comparison operator\n");
}
@@ -1738,7 +1824,7 @@
CHECK_FUNC_ERROR(
"function bar() { return (0 && 0)|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: illegal logical operator\n");
+ "asm: line 1: illegal logical operator\n");
}
@@ -1746,15 +1832,21 @@
CHECK_FUNC_ERROR(
"function bar() { return (0 || 0)|0; }\n"
"function foo() { bar(); }",
- "asm: line 39: illegal logical operator\n");
+ "asm: line 1: illegal logical operator\n");
}
+TEST(BitOrDouble) {
+ CHECK_FUNC_ERROR(
+ "function bar() { var x = 1.0; return x | 0; }\n"
+ "function foo() { bar(); }",
+ "asm: line 1: intish required\n");
+}
TEST(BadLiteral) {
CHECK_FUNC_ERROR(
"function bar() { return true | 0; }\n"
"function foo() { bar(); }",
- "asm: line 39: illegal literal\n");
+ "asm: line 1: illegal literal\n");
}
@@ -1762,7 +1854,7 @@
CHECK_FUNC_ERROR(
"function bar() { if(1) { return 1; } return 1.0; }\n"
"function foo() { bar(); }",
- "asm: line 39: return type does not match function signature\n");
+ "asm: line 1: return type does not match function signature\n");
}
@@ -1771,7 +1863,7 @@
"function bar() {\n"
" var x = 1; var y = 1.0; if(1) { return x; } return +y; }\n"
"function foo() { bar(); }",
- "asm: line 40: return type does not match function signature\n");
+ "asm: line 2: return type does not match function signature\n");
}
@@ -1779,7 +1871,7 @@
CHECK_FUNC_ERROR(
"function bar() { var v = fround(1.0); f64[0] = v + fround(1.0); }\n"
"function foo() { bar(); }",
- "asm: line 39: floatish assignment to double array\n");
+ "asm: line 1: floatish assignment to double array\n");
}
@@ -1848,7 +1940,7 @@
HandleAndZoneScope handles;
Zone* zone = handles.main_zone();
ZoneVector<ExpressionTypeEntry> types(zone);
- CHECK_EQ("asm: line 40: non-function in function table\n",
+ CHECK_EQ("asm: line 2: non-function in function table\n",
Validate(zone, test_function, &types));
}
@@ -1857,14 +1949,14 @@
CHECK_FUNC_ERROR(
"function bar() { var x = 0; i16[x = 1] = 2; }\n"
"function foo() { bar(); }",
- "asm: line 39: expected >> in heap access\n");
+ "asm: line 1: expected >> in heap access\n");
}
TEST(BadOperatorHeapAssignment) {
CHECK_FUNC_ERROR(
"function bar() { var x = 0; i16[x & 1] = 2; }\n"
"function foo() { bar(); }",
- "asm: line 39: expected >> in heap access\n");
+ "asm: line 1: expected >> in heap access\n");
}
@@ -1872,7 +1964,7 @@
CHECK_FUNC_ERROR(
"function bar() { i8[0] = 0.0; }\n"
"function foo() { bar(); }",
- "asm: line 39: illegal type in assignment\n");
+ "asm: line 1: illegal type in assignment\n");
}
@@ -1881,7 +1973,7 @@
"var s0 = sin(0);\n"
"function bar() { }\n"
"function foo() { bar(); }",
- "asm: line 39: illegal variable reference in module body\n");
+ "asm: line 1: illegal variable reference in module body\n");
}
@@ -1890,9 +1982,23 @@
"function bar() { return 0.0; }\n"
"var s0 = bar(0);\n"
"function foo() { bar(); }",
- "asm: line 40: illegal variable reference in module body\n");
+ "asm: line 2: illegal variable reference in module body\n");
}
+TEST(UnaryPlusOnIntForbidden) {
+ CHECK_FUNC_ERROR(
+ "function bar() { var x = 1; return +x; }\n"
+ "function foo() { bar(); }",
+ "asm: line 1: "
+ "unary + only allowed on signed, unsigned, float?, or double?\n");
+}
+
+TEST(MultiplyNon1ConvertForbidden) {
+ CHECK_FUNC_ERROR(
+ "function bar() { var x = 0.0; return x * 2.0; }\n"
+ "function foo() { bar(); }",
+ "asm: line 1: invalid type annotation on binary op\n");
+}
TEST(NestedVariableAssignment) {
CHECK_FUNC_TYPES_BEGIN(
@@ -2026,6 +2132,30 @@
CHECK_FUNC_TYPES_END
}
+TEST(FloatReturnAsDouble) {
+ CHECK_FUNC_TYPES_BEGIN(
+ "function bar() { var x = fround(3.1); return +fround(x); }\n"
+ "function foo() { bar(); }") {
+ CHECK_EXPR(FunctionLiteral, FUNC_D_TYPE) {
+ CHECK_EXPR(Assignment, Bounds(cache.kAsmFloat)) {
+ CHECK_VAR(x, Bounds(cache.kAsmFloat));
+ CHECK_EXPR(Call, Bounds(cache.kAsmFloat)) {
+ CHECK_VAR(fround, FUNC_N2F_TYPE);
+ CHECK_EXPR(Literal, Bounds(cache.kAsmDouble));
+ }
+ }
+ CHECK_EXPR(BinaryOperation, Bounds(cache.kAsmDouble)) {
+ CHECK_EXPR(Call, Bounds(cache.kAsmFloat)) {
+ CHECK_VAR(fround, FUNC_N2F_TYPE);
+ CHECK_VAR(x, Bounds(cache.kAsmFloat));
+ }
+ CHECK_EXPR(Literal, Bounds(cache.kAsmDouble));
+ }
+ }
+ CHECK_SKIP();
+ }
+ CHECK_FUNC_TYPES_END
+}
TEST(TypeConsistency) {
v8::V8::Initialize();
@@ -2125,7 +2255,7 @@
CHECK_FUNC_ERROR(
"function bar() { switch (1) { case -1: case 0x7fffffff: } }\n"
"function foo() { bar(); }",
- "asm: line 39: case range too large\n");
+ "asm: line 1: case range too large\n");
}
@@ -2133,7 +2263,7 @@
CHECK_FUNC_ERROR(
"function bar() { switch (1) { case 0: case 0: } }\n"
"function foo() { bar(); }",
- "asm: line 39: duplicate case value\n");
+ "asm: line 1: duplicate case value\n");
}
@@ -2141,7 +2271,7 @@
CHECK_FUNC_ERROR(
"function bar() { switch (1) { default: case 0: } }\n"
"function foo() { bar(); }",
- "asm: line 39: default case out of order\n");
+ "asm: line 1: default case out of order\n");
}
TEST(BadForeignCall) {
@@ -2342,3 +2472,43 @@
}
CHECK_TYPES_END
}
+
+TEST(StoreFloatFromDouble) {
+ CHECK_FUNC_TYPES_BEGIN(
+ "function bar() { f32[0] = 0.0; }\n"
+ "function foo() { bar(); }") {
+ CHECK_EXPR(FunctionLiteral, FUNC_V_TYPE) {
+ CHECK_EXPR(Assignment, Bounds(cache.kAsmDouble)) {
+ CHECK_EXPR(Property, Bounds::Unbounded()) {
+ CHECK_VAR(f32, Bounds(cache.kFloat32Array));
+ CHECK_EXPR(Literal, Bounds(cache.kAsmFixnum));
+ }
+ CHECK_EXPR(Literal, Bounds(cache.kAsmDouble));
+ }
+ }
+ CHECK_SKIP();
+ }
+ CHECK_FUNC_TYPES_END
+}
+
+TEST(NegateDouble) {
+ CHECK_FUNC_TYPES_BEGIN(
+ "function bar() { var x = 0.0; x = -x; }\n"
+ "function foo() { bar(); }") {
+ CHECK_EXPR(FunctionLiteral, FUNC_V_TYPE) {
+ CHECK_EXPR(Assignment, Bounds(cache.kAsmDouble)) {
+ CHECK_VAR(x, Bounds(cache.kAsmDouble));
+ CHECK_EXPR(Literal, Bounds(cache.kAsmDouble));
+ }
+ CHECK_EXPR(Assignment, Bounds(cache.kAsmDouble)) {
+ CHECK_VAR(x, Bounds(cache.kAsmDouble));
+ CHECK_EXPR(BinaryOperation, Bounds(cache.kAsmDouble)) {
+ CHECK_VAR(x, Bounds(cache.kAsmDouble));
+ CHECK_EXPR(Literal, Bounds(cache.kAsmDouble));
+ }
+ }
+ }
+ CHECK_SKIP();
+ }
+ CHECK_FUNC_TYPES_END
+}
diff --git a/test/cctest/test-assembler-arm.cc b/test/cctest/test-assembler-arm.cc
index 68eaab1..3763f06 100644
--- a/test/cctest/test-assembler-arm.cc
+++ b/test/cctest/test-assembler-arm.cc
@@ -46,7 +46,7 @@
typedef Object* (*F2)(int x, int y, int p2, int p3, int p4);
typedef Object* (*F3)(void* p0, int p1, int p2, int p3, int p4);
typedef Object* (*F4)(void* p0, void* p1, int p2, int p3, int p4);
-
+typedef Object* (*F5)(uint32_t p0, void* p1, void* p2, int p3, int p4);
#define __ assm.
@@ -232,6 +232,8 @@
double j;
double m;
double n;
+ float o;
+ float p;
float x;
float y;
} T;
@@ -314,6 +316,12 @@
__ vneg(d0, d1);
__ vstr(d0, r4, offsetof(T, n));
+ // Test vmov for single-precision immediates.
+ __ vmov(s0, 0.25f);
+ __ vstr(s0, r4, offsetof(T, o));
+ __ vmov(s0, -16.0f);
+ __ vstr(s0, r4, offsetof(T, p));
+
__ ldm(ia_w, sp, r4.bit() | fp.bit() | pc.bit());
CodeDesc desc;
@@ -341,6 +349,8 @@
t.y = 9.0;
Object* dummy = CALL_GENERATED_CODE(isolate, f, &t, 0, 0, 0, 0);
USE(dummy);
+ CHECK_EQ(-16.0f, t.p);
+ CHECK_EQ(0.25f, t.o);
CHECK_EQ(-123.456, t.n);
CHECK_EQ(2718.2818, t.m);
CHECK_EQ(2, t.i);
@@ -1939,6 +1949,78 @@
CHECK_EQ(42, res);
}
+TEST(msr_mrs) {
+ // Test msr and mrs.
+ CcTest::InitializeVM();
+ Isolate* isolate = CcTest::i_isolate();
+ HandleScope scope(isolate);
+
+ Assembler assm(isolate, NULL, 0);
+
+ // Create a helper function:
+ // void TestMsrMrs(uint32_t nzcv,
+ // uint32_t * result_conditionals,
+ // uint32_t * result_mrs);
+ __ msr(CPSR_f, Operand(r0));
+
+ // Test that the condition flags have taken effect.
+ __ mov(r3, Operand(0));
+ __ orr(r3, r3, Operand(1 << 31), LeaveCC, mi); // N
+ __ orr(r3, r3, Operand(1 << 30), LeaveCC, eq); // Z
+ __ orr(r3, r3, Operand(1 << 29), LeaveCC, cs); // C
+ __ orr(r3, r3, Operand(1 << 28), LeaveCC, vs); // V
+ __ str(r3, MemOperand(r1));
+
+ // Also check mrs, ignoring everything other than the flags.
+ __ mrs(r3, CPSR);
+ __ and_(r3, r3, Operand(kSpecialCondition));
+ __ str(r3, MemOperand(r2));
+
+ __ bx(lr);
+
+ CodeDesc desc;
+ assm.GetCode(&desc);
+ Handle<Code> code = isolate->factory()->NewCode(
+ desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
+#ifdef DEBUG
+ OFStream os(stdout);
+ code->Print(os);
+#endif
+ F5 f = FUNCTION_CAST<F5>(code->entry());
+ Object* dummy = nullptr;
+ USE(dummy);
+
+#define CHECK_MSR_MRS(n, z, c, v) \
+ do { \
+ uint32_t nzcv = (n << 31) | (z << 30) | (c << 29) | (v << 28); \
+ uint32_t result_conditionals = -1; \
+ uint32_t result_mrs = -1; \
+ dummy = CALL_GENERATED_CODE(isolate, f, nzcv, &result_conditionals, \
+ &result_mrs, 0, 0); \
+ CHECK_EQ(nzcv, result_conditionals); \
+ CHECK_EQ(nzcv, result_mrs); \
+ } while (0);
+
+ // N Z C V
+ CHECK_MSR_MRS(0, 0, 0, 0);
+ CHECK_MSR_MRS(0, 0, 0, 1);
+ CHECK_MSR_MRS(0, 0, 1, 0);
+ CHECK_MSR_MRS(0, 0, 1, 1);
+ CHECK_MSR_MRS(0, 1, 0, 0);
+ CHECK_MSR_MRS(0, 1, 0, 1);
+ CHECK_MSR_MRS(0, 1, 1, 0);
+ CHECK_MSR_MRS(0, 1, 1, 1);
+ CHECK_MSR_MRS(1, 0, 0, 0);
+ CHECK_MSR_MRS(1, 0, 0, 1);
+ CHECK_MSR_MRS(1, 0, 1, 0);
+ CHECK_MSR_MRS(1, 0, 1, 1);
+ CHECK_MSR_MRS(1, 1, 0, 0);
+ CHECK_MSR_MRS(1, 1, 0, 1);
+ CHECK_MSR_MRS(1, 1, 1, 0);
+ CHECK_MSR_MRS(1, 1, 1, 1);
+
+#undef CHECK_MSR_MRS
+}
TEST(ARMv8_float32_vrintX) {
// Test the vrintX floating point instructions.
diff --git a/test/cctest/test-assembler-arm64.cc b/test/cctest/test-assembler-arm64.cc
index d930173..c2c5b78 100644
--- a/test/cctest/test-assembler-arm64.cc
+++ b/test/cctest/test-assembler-arm64.cc
@@ -37,6 +37,7 @@
#include "src/arm64/disasm-arm64.h"
#include "src/arm64/simulator-arm64.h"
#include "src/arm64/utils-arm64.h"
+#include "src/base/platform/platform.h"
#include "src/base/utils/random-number-generator.h"
#include "src/macro-assembler.h"
#include "test/cctest/cctest.h"
@@ -173,8 +174,10 @@
Isolate* isolate = CcTest::i_isolate(); \
HandleScope scope(isolate); \
CHECK(isolate != NULL); \
- byte* buf = new byte[buf_size]; \
- MacroAssembler masm(isolate, buf, buf_size, \
+ size_t actual_size; \
+ byte* buf = static_cast<byte*>( \
+ v8::base::OS::Allocate(buf_size, &actual_size, true)); \
+ MacroAssembler masm(isolate, buf, actual_size, \
v8::internal::CodeObjectRequired::kYes); \
RegisterDump core;
@@ -208,7 +211,7 @@
__ GetCode(NULL);
#define TEARDOWN() \
- delete[] buf;
+ v8::base::OS::Free(buf, actual_size);
#endif // ifdef USE_SIMULATOR.
diff --git a/test/cctest/test-assembler-mips.cc b/test/cctest/test-assembler-mips.cc
index 1928a75..b8a0426 100644
--- a/test/cctest/test-assembler-mips.cc
+++ b/test/cctest/test-assembler-mips.cc
@@ -1490,7 +1490,7 @@
float inputse[kTableLength] = {2.0, 3.0, fnan, 3.0, -0.0, 0.0, finf,
fnan, 42.0, finf, fminf, finf, fnan};
- float inputsf[kTableLength] = {3.0, 2.0, 3.0, fnan, -0.0, 0.0, fnan,
+ float inputsf[kTableLength] = {3.0, 2.0, 3.0, fnan, 0.0, -0.0, fnan,
finf, finf, 42.0, finf, fminf, fnan};
float outputsfmin[kTableLength] = {2.0, 2.0, 3.0, 3.0, -0.0,
-0.0, finf, finf, 42.0, 42.0,
@@ -1524,19 +1524,12 @@
test.e = inputse[i];
test.f = inputsf[i];
- (CALL_GENERATED_CODE(isolate, f, &test, 0, 0, 0, 0));
+ CALL_GENERATED_CODE(isolate, f, &test, 0, 0, 0, 0);
- if (i < kTableLength - 1) {
- CHECK_EQ(test.c, outputsdmin[i]);
- CHECK_EQ(test.d, outputsdmax[i]);
- CHECK_EQ(test.g, outputsfmin[i]);
- CHECK_EQ(test.h, outputsfmax[i]);
- } else {
- CHECK(std::isnan(test.c));
- CHECK(std::isnan(test.d));
- CHECK(std::isnan(test.g));
- CHECK(std::isnan(test.h));
- }
+ CHECK_EQ(0, memcmp(&test.c, &outputsdmin[i], sizeof(test.c)));
+ CHECK_EQ(0, memcmp(&test.d, &outputsdmax[i], sizeof(test.d)));
+ CHECK_EQ(0, memcmp(&test.g, &outputsfmin[i], sizeof(test.g)));
+ CHECK_EQ(0, memcmp(&test.h, &outputsfmax[i], sizeof(test.h)));
}
}
}
@@ -5360,78 +5353,6 @@
}
-static uint32_t run_lsa(uint32_t rt, uint32_t rs, int8_t sa) {
- Isolate* isolate = CcTest::i_isolate();
- HandleScope scope(isolate);
- MacroAssembler assm(isolate, nullptr, 0,
- v8::internal::CodeObjectRequired::kYes);
-
- __ lsa(v0, a0, a1, sa);
- __ jr(ra);
- __ nop();
-
- CodeDesc desc;
- assm.GetCode(&desc);
- Handle<Code> code = isolate->factory()->NewCode(
- desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
-
- F1 f = FUNCTION_CAST<F1>(code->entry());
-
- uint32_t res = reinterpret_cast<uint32_t>(
- CALL_GENERATED_CODE(isolate, f, rt, rs, 0, 0, 0));
-
- return res;
-}
-
-
-TEST(lsa) {
- if (!IsMipsArchVariant(kMips32r6)) return;
-
- CcTest::InitializeVM();
- struct TestCaseLsa {
- int32_t rt;
- int32_t rs;
- uint8_t sa;
- uint32_t expected_res;
- };
-
- struct TestCaseLsa tc[] = {
- // rt, rs, sa, expected_res
- {0x4, 0x1, 1, 0x6},
- {0x4, 0x1, 2, 0x8},
- {0x4, 0x1, 3, 0xc},
- {0x4, 0x1, 4, 0x14},
- {0x0, 0x1, 1, 0x2},
- {0x0, 0x1, 2, 0x4},
- {0x0, 0x1, 3, 0x8},
- {0x0, 0x1, 4, 0x10},
- {0x4, 0x0, 1, 0x4},
- {0x4, 0x0, 2, 0x4},
- {0x4, 0x0, 3, 0x4},
- {0x4, 0x0, 4, 0x4},
- {0x4, INT32_MAX, 1, 0x2}, // Shift overflow.
- {0x4, INT32_MAX >> 1, 2, 0x0}, // Shift overflow.
- {0x4, INT32_MAX >> 2, 3, 0xfffffffc}, // Shift overflow.
- {0x4, INT32_MAX >> 3, 4, 0xfffffff4}, // Shift overflow.
- {INT32_MAX - 1, 0x1, 1, 0x80000000}, // Signed adition overflow.
- {INT32_MAX - 3, 0x1, 2, 0x80000000}, // Signed addition overflow.
- {INT32_MAX - 7, 0x1, 3, 0x80000000}, // Signed addition overflow.
- {INT32_MAX - 15, 0x1, 4, 0x80000000}, // Signed addition overflow.
- {-2, 0x1, 1, 0x0}, // Addition overflow.
- {-4, 0x1, 2, 0x0}, // Addition overflow.
- {-8, 0x1, 3, 0x0}, // Addition overflow.
- {-16, 0x1, 4, 0x0}}; // Addition overflow.
-
- size_t nr_test_cases = sizeof(tc) / sizeof(TestCaseLsa);
- for (size_t i = 0; i < nr_test_cases; ++i) {
- uint32_t res = run_lsa(tc[i].rt, tc[i].rs, tc[i].sa);
- PrintF("0x%x =? 0x%x == lsa(v0, %x, %x, %hhu)\n", tc[i].expected_res, res,
- tc[i].rt, tc[i].rs, tc[i].sa);
- CHECK_EQ(tc[i].expected_res, res);
- }
-}
-
-
TEST(Trampoline) {
// Private member of Assembler class.
static const int kMaxBranchOffset = (1 << (18 - 1)) - 1;
diff --git a/test/cctest/test-assembler-mips64.cc b/test/cctest/test-assembler-mips64.cc
index b979db2..dd6ed6b 100644
--- a/test/cctest/test-assembler-mips64.cc
+++ b/test/cctest/test-assembler-mips64.cc
@@ -1620,7 +1620,7 @@
float inputse[kTableLength] = {2.0, 3.0, fnan, 3.0, -0.0, 0.0, finf,
fnan, 42.0, finf, fminf, finf, fnan};
- float inputsf[kTableLength] = {3.0, 2.0, 3.0, fnan, -0.0, 0.0, fnan,
+ float inputsf[kTableLength] = {3.0, 2.0, 3.0, fnan, 0.0, -0.0, fnan,
finf, finf, 42.0, finf, fminf, fnan};
float outputsfmin[kTableLength] = {2.0, 2.0, 3.0, 3.0, -0.0,
-0.0, finf, finf, 42.0, 42.0,
@@ -1648,25 +1648,18 @@
Handle<Code> code = isolate->factory()->NewCode(
desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
F3 f = FUNCTION_CAST<F3>(code->entry());
- for (int i = 0; i < kTableLength; i++) {
+ for (int i = 4; i < kTableLength; i++) {
test.a = inputsa[i];
test.b = inputsb[i];
test.e = inputse[i];
test.f = inputsf[i];
- (CALL_GENERATED_CODE(isolate, f, &test, 0, 0, 0, 0));
+ CALL_GENERATED_CODE(isolate, f, &test, 0, 0, 0, 0);
- if (i < kTableLength - 1) {
- CHECK_EQ(test.c, outputsdmin[i]);
- CHECK_EQ(test.d, outputsdmax[i]);
- CHECK_EQ(test.g, outputsfmin[i]);
- CHECK_EQ(test.h, outputsfmax[i]);
- } else {
- CHECK(std::isnan(test.c));
- CHECK(std::isnan(test.d));
- CHECK(std::isnan(test.g));
- CHECK(std::isnan(test.h));
- }
+ CHECK_EQ(0, memcmp(&test.c, &outputsdmin[i], sizeof(test.c)));
+ CHECK_EQ(0, memcmp(&test.d, &outputsdmax[i], sizeof(test.d)));
+ CHECK_EQ(0, memcmp(&test.g, &outputsfmin[i], sizeof(test.g)));
+ CHECK_EQ(0, memcmp(&test.h, &outputsfmax[i], sizeof(test.h)));
}
}
}
diff --git a/test/cctest/test-assembler-s390.cc b/test/cctest/test-assembler-s390.cc
new file mode 100644
index 0000000..dee8e07
--- /dev/null
+++ b/test/cctest/test-assembler-s390.cc
@@ -0,0 +1,416 @@
+// Copyright 2014 the V8 project authors. All rights reserved.
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are
+// met:
+//
+// * Redistributions of source code must retain the above copyright
+// notice, this list of conditions and the following disclaimer.
+// * Redistributions in binary form must reproduce the above
+// copyright notice, this list of conditions and the following
+// disclaimer in the documentation and/or other materials provided
+// with the distribution.
+// * Neither the name of Google Inc. nor the names of its
+// contributors may be used to endorse or promote products derived
+// from this software without specific prior written permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+#include "src/v8.h"
+
+#include "src/disassembler.h"
+#include "src/factory.h"
+#include "src/macro-assembler.h"
+#include "src/s390/assembler-s390-inl.h"
+#include "src/s390/simulator-s390.h"
+#include "test/cctest/cctest.h"
+
+using namespace v8::internal;
+
+// Define these function prototypes to match JSEntryFunction in execution.cc.
+typedef Object* (*F1)(int x, int p1, int p2, int p3, int p4);
+typedef Object* (*F2)(int x, int y, int p2, int p3, int p4);
+typedef Object* (*F3)(void* p0, int p1, int p2, int p3, int p4);
+typedef Object* (*F4)(void* p0, void* p1, int p2, int p3, int p4);
+
+#define __ assm.
+
+// Simple add parameter 1 to parameter 2 and return
+TEST(0) {
+ CcTest::InitializeVM();
+ Isolate* isolate = CcTest::i_isolate();
+ HandleScope scope(isolate);
+
+ Assembler assm(isolate, NULL, 0);
+
+ __ lhi(r1, Operand(3)); // test 4-byte instr
+ __ llilf(r2, Operand(4)); // test 6-byte instr
+ __ lgr(r2, r2); // test 2-byte opcode
+ __ ar(r2, r1); // test 2-byte instr
+ __ b(r14);
+
+ CodeDesc desc;
+ assm.GetCode(&desc);
+ Handle<Code> code = isolate->factory()->NewCode(
+ desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
+#ifdef DEBUG
+ code->Print();
+#endif
+ F2 f = FUNCTION_CAST<F2>(code->entry());
+ intptr_t res = reinterpret_cast<intptr_t>(
+ CALL_GENERATED_CODE(isolate, f, 3, 4, 0, 0, 0));
+ ::printf("f() = %" V8PRIxPTR "\n", res);
+ CHECK_EQ(7, static_cast<int>(res));
+}
+
+// Loop 100 times, adding loop counter to result
+TEST(1) {
+ CcTest::InitializeVM();
+ Isolate* isolate = CcTest::i_isolate();
+ HandleScope scope(isolate);
+
+ Assembler assm(isolate, NULL, 0);
+ Label L, C;
+
+#if defined(_AIX)
+ __ function_descriptor();
+#endif
+
+ __ lr(r3, r2);
+ __ lhi(r2, Operand(0, kRelocInfo_NONEPTR));
+ __ b(&C);
+
+ __ bind(&L);
+ __ ar(r2, r3);
+ __ ahi(r3, Operand(-1 & 0xFFFF));
+
+ __ bind(&C);
+ __ cfi(r3, Operand(0, kRelocInfo_NONEPTR));
+ __ bne(&L);
+ __ b(r14);
+
+ CodeDesc desc;
+ assm.GetCode(&desc);
+ Handle<Code> code = isolate->factory()->NewCode(
+ desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
+#ifdef DEBUG
+ code->Print();
+#endif
+ F1 f = FUNCTION_CAST<F1>(code->entry());
+ intptr_t res = reinterpret_cast<intptr_t>(
+ CALL_GENERATED_CODE(isolate, f, 100, 0, 0, 0, 0));
+ ::printf("f() = %" V8PRIxPTR "\n", res);
+ CHECK_EQ(5050, static_cast<int>(res));
+}
+
+TEST(2) {
+ CcTest::InitializeVM();
+ Isolate* isolate = CcTest::i_isolate();
+ HandleScope scope(isolate);
+
+ // Create a function that accepts &t, and loads, manipulates, and stores
+ // the doubles and floats.
+ Assembler assm(CcTest::i_isolate(), NULL, 0);
+ Label L, C;
+
+#if defined(_AIX)
+ __ function_descriptor();
+#endif
+
+ __ lgr(r3, r2);
+ __ lhi(r2, Operand(1));
+ __ b(&C);
+
+ __ bind(&L);
+ __ lr(r5, r2); // Set up muliplicant in R4:R5
+ __ mr_z(r4, r3); // this is actually R4:R5 = R5 * R2
+ __ lr(r2, r5);
+ __ ahi(r3, Operand(-1 & 0xFFFF));
+
+ __ bind(&C);
+ __ cfi(r3, Operand(0, kRelocInfo_NONEPTR));
+ __ bne(&L);
+ __ b(r14);
+
+ // some relocated stuff here, not executed
+ __ RecordComment("dead code, just testing relocations");
+ __ iilf(r0, Operand(isolate->factory()->true_value()));
+ __ RecordComment("dead code, just testing immediate operands");
+ __ iilf(r0, Operand(-1));
+ __ iilf(r0, Operand(0xFF000000));
+ __ iilf(r0, Operand(0xF0F0F0F0));
+ __ iilf(r0, Operand(0xFFF0FFFF));
+
+ CodeDesc desc;
+ assm.GetCode(&desc);
+ Handle<Code> code = isolate->factory()->NewCode(
+ desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
+#ifdef DEBUG
+ code->Print();
+#endif
+ F1 f = FUNCTION_CAST<F1>(code->entry());
+ intptr_t res = reinterpret_cast<intptr_t>(
+ CALL_GENERATED_CODE(isolate, f, 10, 0, 0, 0, 0));
+ ::printf("f() = %" V8PRIxPTR "\n", res);
+ CHECK_EQ(3628800, static_cast<int>(res));
+}
+
+TEST(3) {
+ CcTest::InitializeVM();
+ Isolate* isolate = CcTest::i_isolate();
+ HandleScope scope(isolate);
+
+ Assembler assm(isolate, NULL, 0);
+
+ __ ar(r14, r13);
+ __ sr(r14, r13);
+ __ mr_z(r14, r13);
+ __ dr(r14, r13);
+ __ or_z(r14, r13);
+ __ nr(r14, r13);
+ __ xr(r14, r13);
+
+ __ agr(r14, r13);
+ __ sgr(r14, r13);
+ __ ogr(r14, r13);
+ __ ngr(r14, r13);
+ __ xgr(r14, r13);
+
+ __ ahi(r13, Operand(123));
+ __ aghi(r13, Operand(123));
+ __ stm(r1, r2, MemOperand(r3, r0, 123));
+ __ slag(r1, r2, Operand(123));
+ __ lay(r1, MemOperand(r2, r3, -123));
+ __ a(r13, MemOperand(r1, r2, 123));
+ __ ay(r13, MemOperand(r1, r2, 123));
+ __ brc(Condition(14), Operand(123));
+ __ brc(Condition(14), Operand(-123));
+ __ brcl(Condition(14), Operand(123), false);
+ __ brcl(Condition(14), Operand(-123), false);
+ __ iilf(r13, Operand(123456789));
+ __ iihf(r13, Operand(-123456789));
+ __ mvc(MemOperand(r0, 123), MemOperand(r4, 567), 89);
+ __ sll(r13, Operand(10));
+
+ v8::internal::byte* bufPos = assm.buffer_pos();
+ ::printf("buffer position = %p", bufPos);
+ ::fflush(stdout);
+ // OS::DebugBreak();
+
+ CodeDesc desc;
+ assm.GetCode(&desc);
+ Handle<Code> code = isolate->factory()->NewCode(
+ desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
+#ifdef DEBUG
+ code->Print();
+#endif
+ USE(code);
+ ::exit(0);
+}
+
+#if 0
+TEST(4) {
+ CcTest::InitializeVM();
+ Isolate* isolate = CcTest::i_isolate();
+ HandleScope scope(isolate);
+
+ Assembler assm(isolate, NULL, 0);
+ Label L2, L3, L4;
+
+ __ chi(r2, Operand(10));
+ __ ble(&L2);
+ __ lr(r2, r4);
+ __ ar(r2, r3);
+ __ b(&L3);
+
+ __ bind(&L2);
+ __ chi(r2, Operand(5));
+ __ bgt(&L4);
+
+ __ lhi(r2, Operand::Zero());
+ __ b(&L3);
+
+ __ bind(&L4);
+ __ lr(r2, r3);
+ __ sr(r2, r4);
+
+ __ bind(&L3);
+ __ lgfr(r2, r3);
+ __ b(r14);
+
+ CodeDesc desc;
+ assm.GetCode(&desc);
+ Handle<Code> code = isolate->factory()->NewCode(
+ desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
+#ifdef DEBUG
+ code->Print();
+#endif
+ F2 f = FUNCTION_CAST<F2>(code->entry());
+ intptr_t res = reinterpret_cast<intptr_t>(
+ CALL_GENERATED_CODE(isolate, f, 3, 4, 3, 0, 0));
+ ::printf("f() = %" V8PRIdPTR "\n", res);
+ CHECK_EQ(4, static_cast<int>(res));
+}
+
+
+// Test ExtractBitRange
+TEST(5) {
+ CcTest::InitializeVM();
+ Isolate* isolate = CcTest::i_isolate();
+ HandleScope scope(isolate);
+
+ MacroAssembler assm(isolate, NULL, 0);
+
+ __ mov(r2, Operand(0x12345678));
+ __ ExtractBitRange(r3, r2, 3, 2);
+ __ lgfr(r2, r3);
+ __ b(r14);
+
+ CodeDesc desc;
+ assm.GetCode(&desc);
+ Handle<Code> code = isolate->factory()->NewCode(
+ desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
+#ifdef DEBUG
+ code->Print();
+#endif
+ F2 f = FUNCTION_CAST<F2>(code->entry());
+ intptr_t res =
+ reinterpret_cast<intptr_t>(CALL_GENERATED_CODE(isolate, f, 3, 4, 3, 0, 0));
+ ::printf("f() = %" V8PRIdPTR "\n", res);
+ CHECK_EQ(2, static_cast<int>(res));
+}
+
+
+// Test JumpIfSmi
+TEST(6) {
+ CcTest::InitializeVM();
+ Isolate* isolate = CcTest::i_isolate();
+ HandleScope scope(isolate);
+
+ MacroAssembler assm(isolate, NULL, 0);
+
+ Label yes;
+
+ __ mov(r2, Operand(0x12345678));
+ __ JumpIfSmi(r2, &yes);
+ __ beq(&yes);
+ __ Load(r2, Operand::Zero());
+ __ b(r14);
+ __ bind(&yes);
+ __ Load(r2, Operand(1));
+ __ b(r14);
+
+ CodeDesc desc;
+ assm.GetCode(&desc);
+ Handle<Code> code = isolate->factory()->NewCode(
+ desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
+#ifdef DEBUG
+ code->Print();
+#endif
+ F2 f = FUNCTION_CAST<F2>(code->entry());
+ intptr_t res =
+ reinterpret_cast<intptr_t>(CALL_GENERATED_CODE(isolate, f, 3, 4, 3, 0, 0));
+ ::printf("f() = %" V8PRIdPTR "\n", res);
+ CHECK_EQ(1, static_cast<int>(res));
+}
+
+
+// Test fix<->floating point conversion.
+TEST(7) {
+ CcTest::InitializeVM();
+ Isolate* isolate = CcTest::i_isolate();
+ HandleScope scope(isolate);
+
+ MacroAssembler assm(isolate, NULL, 0);
+
+ Label yes;
+
+ __ mov(r3, Operand(0x1234));
+ __ cdfbr(d1, r3);
+ __ ldr(d2, d1);
+ __ adbr(d1, d2);
+ __ cfdbr(Condition(0), r2, d1);
+ __ b(r14);
+
+ CodeDesc desc;
+ assm.GetCode(&desc);
+ Handle<Code> code = isolate->factory()->NewCode(
+ desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
+#ifdef DEBUG
+ code->Print();
+#endif
+ F2 f = FUNCTION_CAST<F2>(code->entry());
+ intptr_t res =
+ reinterpret_cast<intptr_t>(CALL_GENERATED_CODE(isolate, f, 3, 4, 3, 0, 0));
+ ::printf("f() = %" V8PRIdPTR "\n", res);
+ CHECK_EQ(0x2468, static_cast<int>(res));
+}
+
+
+// Test DSGR
+TEST(8) {
+ CcTest::InitializeVM();
+ Isolate* isolate = CcTest::i_isolate();
+ HandleScope scope(isolate);
+
+ MacroAssembler assm(isolate, NULL, 0);
+
+ // Zero upper bits of r3/r4
+ __ llihf(r3, Operand::Zero());
+ __ llihf(r4, Operand::Zero());
+ __ mov(r3, Operand(0x0002));
+ __ mov(r4, Operand(0x0002));
+ __ dsgr(r2, r4);
+ __ b(r14);
+
+ CodeDesc desc;
+ assm.GetCode(&desc);
+ Handle<Code> code = isolate->factory()->NewCode(
+ desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
+#ifdef DEBUG
+ code->Print();
+#endif
+ F1 f = FUNCTION_CAST<F1>(code->entry());
+ intptr_t res =
+ reinterpret_cast<intptr_t>(CALL_GENERATED_CODE(isolate, f, 100, 0,
+ 0, 0, 0));
+ ::printf("f() = %" V8PRIdPTR "\n", res);
+ CHECK_EQ(0, static_cast<int>(res));
+}
+
+
+// Test LZDR
+TEST(9) {
+ CcTest::InitializeVM();
+ Isolate* isolate = CcTest::i_isolate();
+ HandleScope scope(isolate);
+
+ MacroAssembler assm(isolate, NULL, 0);
+
+ __ lzdr(d4);
+ __ b(r14);
+
+ CodeDesc desc;
+ assm.GetCode(&desc);
+ Handle<Code> code = isolate->factory()->NewCode(
+ desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
+#ifdef DEBUG
+ code->Print();
+#endif
+ F1 f = FUNCTION_CAST<F1>(code->entry());
+ intptr_t res =
+ reinterpret_cast<intptr_t>(CALL_GENERATED_CODE(isolate, f, 0, 0, 0, 0, 0));
+ ::printf("f() = %" V8PRIdPTR "\n", res);
+}
+#endif
+
+#undef __
diff --git a/test/cctest/test-ast-expression-visitor.cc b/test/cctest/test-ast-expression-visitor.cc
index a40f87c..bda1fba 100644
--- a/test/cctest/test-ast-expression-visitor.cc
+++ b/test/cctest/test-ast-expression-visitor.cc
@@ -378,14 +378,17 @@
CHECK_EXPR(CallRuntime, Bounds::Unbounded());
}
}
- // Explicit yield
+ // Explicit yield (argument wrapped with CreateIterResultObject)
CHECK_EXPR(Yield, Bounds::Unbounded()) {
CHECK_VAR(.generator_object, Bounds::Unbounded());
- CHECK_EXPR(Literal, Bounds::Unbounded());
+ CHECK_EXPR(CallRuntime, Bounds::Unbounded()) {
+ CHECK_EXPR(Literal, Bounds::Unbounded());
+ CHECK_EXPR(Literal, Bounds::Unbounded());
+ }
}
- // Implicit final yield
- CHECK_EXPR(Yield, Bounds::Unbounded()) {
- CHECK_VAR(.generator_object, Bounds::Unbounded());
+ // Argument to implicit final return
+ CHECK_EXPR(CallRuntime, Bounds::Unbounded()) { // CreateIterResultObject
+ CHECK_EXPR(Literal, Bounds::Unbounded());
CHECK_EXPR(Literal, Bounds::Unbounded());
}
// Implicit finally clause
diff --git a/test/cctest/test-ast.cc b/test/cctest/test-ast.cc
index 49e44eb..365652e 100644
--- a/test/cctest/test-ast.cc
+++ b/test/cctest/test-ast.cc
@@ -38,7 +38,8 @@
List<AstNode*>* list = new List<AstNode*>(0);
CHECK_EQ(0, list->length());
- Zone zone;
+ v8::base::AccountingAllocator allocator;
+ Zone zone(&allocator);
AstValueFactory value_factory(&zone, 0);
AstNodeFactory factory(&value_factory);
AstNode* node = factory.NewEmptyStatement(RelocInfo::kNoPosition);
diff --git a/test/cctest/test-bit-vector.cc b/test/cctest/test-bit-vector.cc
index e8571d9..6b9fbc7 100644
--- a/test/cctest/test-bit-vector.cc
+++ b/test/cctest/test-bit-vector.cc
@@ -35,7 +35,8 @@
using namespace v8::internal;
TEST(BitVector) {
- Zone zone;
+ v8::base::AccountingAllocator allocator;
+ Zone zone(&allocator);
{
BitVector v(15, &zone);
v.Add(1);
diff --git a/test/cctest/test-compiler.cc b/test/cctest/test-compiler.cc
index db2ccb2..32d720e 100644
--- a/test/cctest/test-compiler.cc
+++ b/test/cctest/test-compiler.cc
@@ -39,8 +39,8 @@
static Handle<Object> GetGlobalProperty(const char* name) {
Isolate* isolate = CcTest::i_isolate();
- return Object::GetProperty(
- isolate, isolate->global_object(), name).ToHandleChecked();
+ return JSReceiver::GetProperty(isolate, isolate->global_object(), name)
+ .ToHandleChecked();
}
@@ -59,12 +59,12 @@
Isolate* isolate = CcTest::i_isolate();
Handle<String> source_code = isolate->factory()->NewStringFromUtf8(
CStrVector(source)).ToHandleChecked();
- Handle<SharedFunctionInfo> shared_function = Compiler::CompileScript(
+ Handle<SharedFunctionInfo> shared = Compiler::GetSharedFunctionInfoForScript(
source_code, Handle<String>(), 0, 0, v8::ScriptOriginOptions(),
Handle<Object>(), Handle<Context>(isolate->native_context()), NULL, NULL,
v8::ScriptCompiler::kNoCompileOptions, NOT_NATIVES_CODE, false);
return isolate->factory()->NewFunctionFromSharedFunctionInfo(
- shared_function, isolate->native_context());
+ shared, isolate->native_context());
}
@@ -227,10 +227,9 @@
Handle<JSObject> global(isolate->context()->global_object());
Execution::Call(isolate, fun0, global, 0, NULL).Check();
- Handle<String> foo_string =
- isolate->factory()->InternalizeOneByteString(STATIC_CHAR_VECTOR("foo"));
- Handle<Object> fun1 = Object::GetProperty(
- isolate->global_object(), foo_string).ToHandleChecked();
+ Handle<Object> fun1 =
+ JSReceiver::GetProperty(isolate, isolate->global_object(), "foo")
+ .ToHandleChecked();
CHECK(fun1->IsJSFunction());
Handle<Object> argv[] = {isolate->factory()->InternalizeOneByteString(
@@ -328,7 +327,10 @@
TEST(FeedbackVectorUnaffectedByScopeChanges) {
- if (i::FLAG_always_opt || !i::FLAG_lazy) return;
+ if (i::FLAG_always_opt || !i::FLAG_lazy ||
+ (FLAG_ignition && FLAG_ignition_eager)) {
+ return;
+ }
CcTest::InitializeVM();
v8::HandleScope scope(CcTest::isolate());
v8::Local<v8::Context> context = CcTest::isolate()->GetCurrentContext();
@@ -350,7 +352,8 @@
->Get(context, v8_str("morphing_call"))
.ToLocalChecked())));
- // Not compiled, and so no feedback vector allocated yet.
+ // If we are compiling lazily then it should not be compiled, and so no
+ // feedback vector allocated yet.
CHECK(!f->shared()->is_compiled());
CHECK(f->shared()->feedback_vector()->is_empty());
diff --git a/test/cctest/test-cpu-profiler.cc b/test/cctest/test-cpu-profiler.cc
index 361c879..24c84c3 100644
--- a/test/cctest/test-cpu-profiler.cc
+++ b/test/cctest/test-cpu-profiler.cc
@@ -119,8 +119,7 @@
} // namespace
-
-i::Code* CreateCode(LocalContext* env) {
+i::AbstractCode* CreateCode(LocalContext* env) {
static int counter = 0;
i::EmbeddedVector<char, 256> script;
i::EmbeddedVector<char, 32> name;
@@ -138,10 +137,9 @@
i::Handle<i::JSFunction> fun = i::Handle<i::JSFunction>::cast(
v8::Utils::OpenHandle(*GetFunction(env->local(), name_start)));
- return fun->code();
+ return fun->abstract_code();
}
-
TEST(CodeEvents) {
CcTest::InitializeVM();
LocalContext env;
@@ -151,13 +149,13 @@
i::HandleScope scope(isolate);
- i::Code* aaa_code = CreateCode(&env);
- i::Code* comment_code = CreateCode(&env);
- i::Code* args5_code = CreateCode(&env);
- i::Code* comment2_code = CreateCode(&env);
- i::Code* moved_code = CreateCode(&env);
- i::Code* args3_code = CreateCode(&env);
- i::Code* args4_code = CreateCode(&env);
+ i::AbstractCode* aaa_code = CreateCode(&env);
+ i::AbstractCode* comment_code = CreateCode(&env);
+ i::AbstractCode* args5_code = CreateCode(&env);
+ i::AbstractCode* comment2_code = CreateCode(&env);
+ i::AbstractCode* moved_code = CreateCode(&env);
+ i::AbstractCode* args3_code = CreateCode(&env);
+ i::AbstractCode* args4_code = CreateCode(&env);
CpuProfilesCollection* profiles = new CpuProfilesCollection(isolate->heap());
profiles->StartProfiling("", false);
@@ -174,7 +172,7 @@
profiler.CodeCreateEvent(i::Logger::BUILTIN_TAG, comment_code, "comment");
profiler.CodeCreateEvent(i::Logger::STUB_TAG, args5_code, 5);
profiler.CodeCreateEvent(i::Logger::BUILTIN_TAG, comment2_code, "comment2");
- profiler.CodeMoveEvent(comment2_code->address(), moved_code->address());
+ profiler.CodeMoveEvent(comment2_code, moved_code->address());
profiler.CodeCreateEvent(i::Logger::STUB_TAG, args3_code, 3);
profiler.CodeCreateEvent(i::Logger::STUB_TAG, args4_code, 4);
@@ -203,22 +201,20 @@
CHECK_EQ(0, strcmp("comment2", comment2->name()));
}
-
template<typename T>
static int CompareProfileNodes(const T* p1, const T* p2) {
return strcmp((*p1)->entry()->name(), (*p2)->entry()->name());
}
-
TEST(TickEvents) {
TestSetup test_setup;
LocalContext env;
i::Isolate* isolate = CcTest::i_isolate();
i::HandleScope scope(isolate);
- i::Code* frame1_code = CreateCode(&env);
- i::Code* frame2_code = CreateCode(&env);
- i::Code* frame3_code = CreateCode(&env);
+ i::AbstractCode* frame1_code = CreateCode(&env);
+ i::AbstractCode* frame2_code = CreateCode(&env);
+ i::AbstractCode* frame3_code = CreateCode(&env);
CpuProfilesCollection* profiles = new CpuProfilesCollection(isolate->heap());
profiles->StartProfiling("", false);
@@ -265,7 +261,6 @@
CHECK_EQ(0, top_down_ddd_children->length());
}
-
// http://crbug/51594
// This test must not crash.
TEST(CrashIfStoppingLastNonExistentProfile) {
@@ -278,7 +273,6 @@
profiler->StopProfiling("");
}
-
// http://code.google.com/p/v8/issues/detail?id=1398
// Long stacks (exceeding max frames limit) must not be erased.
TEST(Issue1398) {
@@ -287,7 +281,7 @@
i::Isolate* isolate = CcTest::i_isolate();
i::HandleScope scope(isolate);
- i::Code* code = CreateCode(&env);
+ i::AbstractCode* code = CreateCode(&env);
CpuProfilesCollection* profiles = new CpuProfilesCollection(isolate->heap());
profiles->StartProfiling("", false);
@@ -322,7 +316,6 @@
CHECK_EQ(1 + i::TickSample::kMaxFramesCount, actual_depth); // +1 for PC.
}
-
TEST(DeleteAllCpuProfiles) {
CcTest::InitializeVM();
TestSetup test_setup;
@@ -990,11 +983,11 @@
profile->Delete();
}
-
// This tests checks distribution of the samples through the source lines.
-TEST(TickLines) {
+static void TickLines(bool optimize) {
CcTest::InitializeVM();
LocalContext env;
+ i::FLAG_allow_natives_syntax = true;
i::FLAG_turbo_source_positions = true;
i::Isolate* isolate = CcTest::i_isolate();
i::Factory* factory = isolate->factory();
@@ -1003,6 +996,8 @@
i::EmbeddedVector<char, 512> script;
const char* func_name = "func";
+ const char* opt_func =
+ optimize ? "%OptimizeFunctionOnNextCall" : "%NeverOptimizeFunction";
i::SNPrintF(script,
"function %s() {\n"
" var n = 0;\n"
@@ -1012,22 +1007,17 @@
" n += m * m * m;\n"
" }\n"
"}\n"
+ "%s(%s);\n"
"%s();\n",
- func_name, func_name);
+ func_name, opt_func, func_name, func_name);
CompileRun(script.start());
i::Handle<i::JSFunction> func = i::Handle<i::JSFunction>::cast(
v8::Utils::OpenHandle(*GetFunction(env.local(), func_name)));
CHECK(func->shared());
- CHECK(func->shared()->code());
- i::Code* code = NULL;
- if (func->code()->is_optimized_code()) {
- code = func->code();
- } else {
- CHECK(func->shared()->code() == func->code() || !i::FLAG_crankshaft);
- code = func->shared()->code();
- }
+ CHECK(func->shared()->abstract_code());
+ i::AbstractCode* code = func->abstract_code();
CHECK(code);
i::Address code_address = code->instruction_start();
CHECK(code_address);
@@ -1088,6 +1078,10 @@
CHECK_EQ(hit_count, value);
}
+TEST(TickLinesBaseline) { TickLines(false); }
+
+TEST(TickLinesOptimized) { TickLines(true); }
+
static const char* call_function_test_source =
"%NeverOptimizeFunction(bar);\n"
"%NeverOptimizeFunction(start);\n"
@@ -1510,6 +1504,68 @@
profile->Delete();
}
+static const char* inlining_test_source =
+ "%NeverOptimizeFunction(action);\n"
+ "%NeverOptimizeFunction(start);\n"
+ "%OptimizeFunctionOnNextCall(level1);\n"
+ "%OptimizeFunctionOnNextCall(level2);\n"
+ "%OptimizeFunctionOnNextCall(level3);\n"
+ "var finish = false;\n"
+ "function action(n) {\n"
+ " var s = 0;\n"
+ " for (var i = 0; i < n; ++i) s += i*i*i;\n"
+ " if (finish)\n"
+ " startProfiling('my_profile');\n"
+ " return s;\n"
+ "}\n"
+ "function level3() { return action(100); }\n"
+ "function level2() { return level3() * 2; }\n"
+ "function level1() { return level2(); }\n"
+ "function start() {\n"
+ " var n = 100;\n"
+ " while (--n)\n"
+ " level1();\n"
+ " finish = true;\n"
+ " level1();\n"
+ "}";
+
+// The test check multiple entrances/exits between JS and native code.
+//
+// [Top down]:
+// (root) #0 1
+// start #16 3
+// level1 #0 4
+// level2 #16 5
+// level3 #16 6
+// action #16 7
+// (program) #0 2
+TEST(Inlining) {
+ i::FLAG_allow_natives_syntax = true;
+ v8::HandleScope scope(CcTest::isolate());
+ v8::Local<v8::Context> env = CcTest::NewContext(PROFILER_EXTENSION);
+ v8::Context::Scope context_scope(env);
+
+ CompileRun(inlining_test_source);
+ v8::Local<v8::Function> function = GetFunction(env, "start");
+
+ v8::CpuProfiler* cpu_profiler = env->GetIsolate()->GetCpuProfiler();
+ v8::Local<v8::String> profile_name = v8_str("my_profile");
+ function->Call(env, env->Global(), 0, NULL).ToLocalChecked();
+ v8::CpuProfile* profile = cpu_profiler->StopProfiling(profile_name);
+ CHECK(profile);
+ // Dump collected profile to have a better diagnostic in case of failure.
+ reinterpret_cast<i::CpuProfile*>(profile)->Print();
+
+ const v8::CpuProfileNode* root = profile->GetTopDownRoot();
+ const v8::CpuProfileNode* start_node = GetChild(env, root, "start");
+ const v8::CpuProfileNode* level1_node = GetChild(env, start_node, "level1");
+ const v8::CpuProfileNode* level2_node = GetChild(env, level1_node, "level2");
+ const v8::CpuProfileNode* level3_node = GetChild(env, level2_node, "level3");
+ GetChild(env, level3_node, "action");
+
+ profile->Delete();
+}
+
// [Top down]:
// 0 (root) #0 1
// 2 (program) #0 2
diff --git a/test/cctest/test-debug.cc b/test/cctest/test-debug.cc
index dd483c0..ab27f39 100644
--- a/test/cctest/test-debug.cc
+++ b/test/cctest/test-debug.cc
@@ -2747,7 +2747,7 @@
foo->Call(context, env->Global(), kArgc, args).ToLocalChecked();
// With stepping all break locations are hit.
- CHECK_EQ(45, break_point_hit_count);
+ CHECK_EQ(44, break_point_hit_count);
v8::Debug::SetDebugEventListener(env->GetIsolate(), nullptr);
CheckDebuggerUnloaded(env->GetIsolate());
@@ -2888,7 +2888,6 @@
// Test of the stepping mechanism for named load in a loop.
TEST(DebugStepNamedStoreLoop) { DoDebugStepNamedStoreLoop(34); }
-
// Test the stepping mechanism with different ICs.
TEST(DebugStepLinearMixedICs) {
DebugLocalContext env;
@@ -2917,7 +2916,7 @@
foo->Call(context, env->Global(), 0, NULL).ToLocalChecked();
// With stepping all break locations are hit.
- CHECK_EQ(11, break_point_hit_count);
+ CHECK_EQ(10, break_point_hit_count);
v8::Debug::SetDebugEventListener(env->GetIsolate(), nullptr);
CheckDebuggerUnloaded(env->GetIsolate());
@@ -2964,7 +2963,7 @@
step_action = StepIn;
break_point_hit_count = 0;
foo->Call(context, env->Global(), 0, NULL).ToLocalChecked();
- CHECK_EQ(6, break_point_hit_count);
+ CHECK_EQ(5, break_point_hit_count);
// Get rid of the debug event listener.
v8::Debug::SetDebugEventListener(env->GetIsolate(), nullptr);
@@ -2998,7 +2997,7 @@
step_action = StepIn;
break_point_hit_count = 0;
foo->Call(context, env->Global(), 0, NULL).ToLocalChecked();
- CHECK_EQ(6, break_point_hit_count);
+ CHECK_EQ(5, break_point_hit_count);
// Get rid of the debug event listener.
v8::Debug::SetDebugEventListener(env->GetIsolate(), nullptr);
@@ -3459,26 +3458,25 @@
v8::Local<v8::Context> context = env.context();
// Create a function for testing stepping. Run it to allow it to get
// optimized.
- const char* src = "function foo(x) { "
- " var a;"
- " a = x ? 1 : 2;"
- " return a;"
- "}"
- "foo()";
+ const char* src =
+ "function foo(x) { "
+ " return x ? 1 : 2;"
+ "}"
+ "foo()";
v8::Local<v8::Function> foo = CompileFunction(&env, src, "foo");
SetBreakPoint(foo, 0); // "var a;"
step_action = StepIn;
break_point_hit_count = 0;
foo->Call(context, env->Global(), 0, NULL).ToLocalChecked();
- CHECK_EQ(4, break_point_hit_count);
+ CHECK_EQ(2, break_point_hit_count);
step_action = StepIn;
break_point_hit_count = 0;
const int argc = 1;
v8::Local<v8::Value> argv_true[argc] = {v8::True(isolate)};
foo->Call(context, env->Global(), argc, argv_true).ToLocalChecked();
- CHECK_EQ(4, break_point_hit_count);
+ CHECK_EQ(2, break_point_hit_count);
// Get rid of the debug event listener.
v8::Debug::SetDebugEventListener(isolate, nullptr);
@@ -8072,3 +8070,118 @@
DisableDebugger(isolate);
}
+
+TEST(DisableTailCallElimination) {
+ i::FLAG_allow_natives_syntax = true;
+ i::FLAG_harmony_tailcalls = true;
+ // TODO(ishell, 4698): Investigate why TurboFan in --always-opt mode makes
+ // stack[2].getFunctionName() return null.
+ i::FLAG_turbo_inlining = false;
+
+ DebugLocalContext env;
+ v8::Isolate* isolate = env->GetIsolate();
+ v8::HandleScope scope(isolate);
+ CHECK(v8::Debug::IsTailCallEliminationEnabled(isolate));
+
+ CompileRun(
+ "'use strict'; \n"
+ "Error.prepareStackTrace = (error,stack) => { \n"
+ " error.strace = stack; \n"
+ " return error.message + \"\\n at \" + stack.join(\"\\n at \"); \n"
+ "} \n"
+ " \n"
+ "function getCaller() { \n"
+ " var e = new Error(); \n"
+ " e.stack; // prepare stack trace \n"
+ " var stack = e.strace; \n"
+ " %GlobalPrint('caller: '); \n"
+ " %GlobalPrint(stack[2].getFunctionName()); \n"
+ " %GlobalPrint('\\n'); \n"
+ " return stack[2].getFunctionName(); \n"
+ "} \n"
+ "function f() { \n"
+ " var caller = getCaller(); \n"
+ " if (caller === 'g') return 1; \n"
+ " if (caller === 'h') return 2; \n"
+ " return 0; \n"
+ "} \n"
+ "function g() { \n"
+ " return f(); \n"
+ "} \n"
+ "function h() { \n"
+ " var result = g(); \n"
+ " return result; \n"
+ "} \n"
+ "%NeverOptimizeFunction(getCaller); \n"
+ "%NeverOptimizeFunction(f); \n"
+ "%NeverOptimizeFunction(h); \n"
+ "");
+ ExpectInt32("h();", 2);
+ ExpectInt32("h(); %OptimizeFunctionOnNextCall(g); h();", 2);
+ v8::Debug::SetTailCallEliminationEnabled(isolate, false);
+ CHECK(!v8::Debug::IsTailCallEliminationEnabled(isolate));
+ ExpectInt32("h();", 1);
+ ExpectInt32("h(); %OptimizeFunctionOnNextCall(g); h();", 1);
+ v8::Debug::SetTailCallEliminationEnabled(isolate, true);
+ CHECK(v8::Debug::IsTailCallEliminationEnabled(isolate));
+ ExpectInt32("h();", 2);
+ ExpectInt32("h(); %OptimizeFunctionOnNextCall(g); h();", 2);
+}
+
+TEST(DebugStepNextTailCallEliminiation) {
+ i::FLAG_allow_natives_syntax = true;
+ i::FLAG_harmony_tailcalls = true;
+ // TODO(ishell, 4698): Investigate why TurboFan in --always-opt mode makes
+ // stack[2].getFunctionName() return null.
+ i::FLAG_turbo_inlining = false;
+
+ DebugLocalContext env;
+ env.ExposeDebug();
+ v8::Isolate* isolate = env->GetIsolate();
+ v8::HandleScope scope(isolate);
+ CHECK(v8::Debug::IsTailCallEliminationEnabled(isolate));
+
+ const char* source =
+ "'use strict'; \n"
+ "var Debug = debug.Debug; \n"
+ "var exception = null; \n"
+ "var breaks = 0; \n"
+ "var log = []; \n"
+ "function f(x) { \n"
+ " if (x == 2) { \n"
+ " debugger; // Break a \n"
+ " } \n"
+ " if (x-- > 0) { // Break b \n"
+ " return f(x); // Break c \n"
+ " } \n"
+ "} // Break e \n"
+ "function listener(event, exec_state, event_data, data) {\n"
+ " if (event != Debug.DebugEvent.Break) return; \n"
+ " try { \n"
+ " var line = exec_state.frame(0).sourceLineText(); \n"
+ " var col = exec_state.frame(0).sourceColumn(); \n"
+ " var match = line.match(/\\/\\/ Break (\\w)/); \n"
+ " log.push(match[1] + col); \n"
+ " exec_state.prepareStep(Debug.StepAction.StepNext); \n"
+ " } catch (e) { \n"
+ " exception = e; \n"
+ " }; \n"
+ "}; \n"
+ "Debug.setListener(listener); \n"
+ "f(4); \n"
+ "Debug.setListener(null); // Break d \n";
+
+ CompileRun(source);
+ ExpectNull("exception");
+ ExpectString("JSON.stringify(log)", "[\"a4\",\"b2\",\"c4\",\"c11\",\"d0\"]");
+
+ v8::Debug::SetTailCallEliminationEnabled(isolate, false);
+ CompileRun(
+ "log = []; \n"
+ "Debug.setListener(listener); \n"
+ "f(5); \n"
+ "Debug.setListener(null); // Break f \n");
+ ExpectNull("exception");
+ ExpectString("JSON.stringify(log)",
+ "[\"a4\",\"b2\",\"c4\",\"e0\",\"e0\",\"e0\",\"e0\",\"f0\"]");
+}
diff --git a/test/cctest/test-decls.cc b/test/cctest/test-decls.cc
index 4e95952..35cb515 100644
--- a/test/cctest/test-decls.cc
+++ b/test/cctest/test-decls.cc
@@ -227,7 +227,6 @@
// Test global declaration of a property the interceptor doesn't know
// about and doesn't handle.
TEST(Unknown) {
- i::FLAG_legacy_const = true;
HandleScope scope(CcTest::isolate());
v8::V8::Initialize();
@@ -251,20 +250,6 @@
0,
EXPECT_RESULT);
}
-
- { DeclarationContext context;
- context.Check("const x; x",
- 1, // access
- 0, 0, EXPECT_RESULT, Undefined(CcTest::isolate()));
- }
-
- { DeclarationContext context;
- context.Check("const x = 0; x",
- 1, // access
- 0,
- 0,
- EXPECT_RESULT, Number::New(CcTest::isolate(), 0));
- }
}
@@ -277,7 +262,6 @@
TEST(Absent) {
- i::FLAG_legacy_const = true;
v8::Isolate* isolate = CcTest::isolate();
v8::V8::Initialize();
HandleScope scope(isolate);
@@ -304,18 +288,6 @@
}
{ AbsentPropertyContext context;
- context.Check("const x; x",
- 1, // access
- 0, 0, EXPECT_RESULT, Undefined(isolate));
- }
-
- { AbsentPropertyContext context;
- context.Check("const x = 0; x",
- 1, // access
- 0, 0, EXPECT_RESULT, Number::New(isolate, 0));
- }
-
- { AbsentPropertyContext context;
context.Check("if (false) { var x = 0 }; x",
1, // access
0, 0, EXPECT_RESULT, Undefined(isolate));
@@ -361,7 +333,6 @@
TEST(Appearing) {
- i::FLAG_legacy_const = true;
v8::V8::Initialize();
HandleScope scope(CcTest::isolate());
@@ -385,18 +356,6 @@
0,
EXPECT_RESULT);
}
-
- { AppearingPropertyContext context;
- context.Check("const x; x",
- 1, // access
- 0, 0, EXPECT_RESULT, Undefined(CcTest::isolate()));
- }
-
- { AppearingPropertyContext context;
- context.Check("const x = 0; x",
- 1, // access
- 0, 0, EXPECT_RESULT, Number::New(CcTest::isolate(), 0));
- }
}
@@ -418,7 +377,6 @@
TEST(ExistsInPrototype) {
- i::FLAG_legacy_const = true;
HandleScope scope(CcTest::isolate());
// Sanity check to make sure that the holder of the interceptor
@@ -443,22 +401,6 @@
0,
EXPECT_RESULT, Number::New(CcTest::isolate(), 0));
}
-
- { ExistsInPrototypeContext context;
- context.Check("const x; x",
- 0,
- 0,
- 0,
- EXPECT_RESULT, Undefined(CcTest::isolate()));
- }
-
- { ExistsInPrototypeContext context;
- context.Check("const x = 0; x",
- 0,
- 0,
- 0,
- EXPECT_RESULT, Number::New(CcTest::isolate(), 0));
- }
}
@@ -528,7 +470,6 @@
TEST(ExistsInHiddenPrototype) {
- i::FLAG_legacy_const = true;
HandleScope scope(CcTest::isolate());
{ ExistsInHiddenPrototypeContext context;
@@ -548,18 +489,6 @@
0,
EXPECT_RESULT);
}
-
- // TODO(mstarzinger): The semantics of global const is vague.
- { ExistsInHiddenPrototypeContext context;
- context.Check("const x; x", 0, 0, 0, EXPECT_RESULT,
- Undefined(CcTest::isolate()));
- }
-
- // TODO(mstarzinger): The semantics of global const is vague.
- { ExistsInHiddenPrototypeContext context;
- context.Check("const x = 0; x", 0, 0, 0, EXPECT_RESULT,
- Number::New(CcTest::isolate(), 0));
- }
}
@@ -612,7 +541,6 @@
TEST(CrossScriptReferences) {
- i::FLAG_legacy_const = true;
v8::Isolate* isolate = CcTest::isolate();
HandleScope scope(isolate);
@@ -621,8 +549,6 @@
EXPECT_RESULT, Number::New(isolate, 1));
context.Check("var x = 2; x",
EXPECT_RESULT, Number::New(isolate, 2));
- context.Check("const x = 3; x", EXPECT_EXCEPTION);
- context.Check("const x = 4; x", EXPECT_EXCEPTION);
context.Check("x = 5; x",
EXPECT_RESULT, Number::New(isolate, 5));
context.Check("var x = 6; x",
@@ -632,22 +558,6 @@
context.Check("function x() { return 7 }; x()",
EXPECT_RESULT, Number::New(isolate, 7));
}
-
- { SimpleContext context;
- context.Check("const x = 1; x",
- EXPECT_RESULT, Number::New(isolate, 1));
- context.Check("var x = 2; x", // assignment ignored
- EXPECT_RESULT, Number::New(isolate, 1));
- context.Check("const x = 3; x", EXPECT_EXCEPTION);
- context.Check("x = 4; x", // assignment ignored
- EXPECT_RESULT, Number::New(isolate, 1));
- context.Check("var x = 5; x", // assignment ignored
- EXPECT_RESULT, Number::New(isolate, 1));
- context.Check("this.x",
- EXPECT_RESULT, Number::New(isolate, 1));
- context.Check("function x() { return 7 }; x",
- EXPECT_EXCEPTION);
- }
}
diff --git a/test/cctest/test-dictionary.cc b/test/cctest/test-dictionary.cc
index 0d4edf5..cc4a753 100644
--- a/test/cctest/test-dictionary.cc
+++ b/test/cctest/test-dictionary.cc
@@ -82,7 +82,7 @@
CHECK_EQ(table->NumberOfElements(), i + 1);
CHECK_NE(table->FindEntry(key), HashMap::kNotFound);
CHECK_EQ(table->Lookup(key), *value);
- CHECK(key->GetIdentityHash()->IsSmi());
+ CHECK(JSReceiver::GetIdentityHash(isolate, key)->IsSmi());
}
// Keys never added to the map which already have an identity hash
@@ -92,7 +92,7 @@
CHECK(JSReceiver::GetOrCreateIdentityHash(key)->IsSmi());
CHECK_EQ(table->FindEntry(key), HashMap::kNotFound);
CHECK_EQ(table->Lookup(key), CcTest::heap()->the_hole_value());
- CHECK(key->GetIdentityHash()->IsSmi());
+ CHECK(JSReceiver::GetIdentityHash(isolate, key)->IsSmi());
}
// Keys that don't have an identity hash should not be found and also
@@ -100,8 +100,8 @@
for (int i = 0; i < 100; i++) {
Handle<JSReceiver> key = factory->NewJSArray(7);
CHECK_EQ(table->Lookup(key), CcTest::heap()->the_hole_value());
- Object* identity_hash = key->GetIdentityHash();
- CHECK_EQ(identity_hash, CcTest::heap()->undefined_value());
+ Handle<Object> identity_hash = JSReceiver::GetIdentityHash(isolate, key);
+ CHECK_EQ(CcTest::heap()->undefined_value(), *identity_hash);
}
}
diff --git a/test/cctest/test-disasm-arm.cc b/test/cctest/test-disasm-arm.cc
index 74144f2..7eea8a1 100644
--- a/test/cctest/test-disasm-arm.cc
+++ b/test/cctest/test-disasm-arm.cc
@@ -453,6 +453,54 @@
}
+TEST(msr_mrs_disasm) {
+ SET_UP();
+
+ SRegisterFieldMask CPSR_all = CPSR_f | CPSR_s | CPSR_x | CPSR_c;
+ SRegisterFieldMask SPSR_all = SPSR_f | SPSR_s | SPSR_x | SPSR_c;
+
+ COMPARE(msr(CPSR_f, Operand(r0)), "e128f000 msr CPSR_f, r0");
+ COMPARE(msr(CPSR_s, Operand(r1)), "e124f001 msr CPSR_s, r1");
+ COMPARE(msr(CPSR_x, Operand(r2)), "e122f002 msr CPSR_x, r2");
+ COMPARE(msr(CPSR_c, Operand(r3)), "e121f003 msr CPSR_c, r3");
+ COMPARE(msr(CPSR_all, Operand(ip)), "e12ff00c msr CPSR_fsxc, ip");
+ COMPARE(msr(SPSR_f, Operand(r0)), "e168f000 msr SPSR_f, r0");
+ COMPARE(msr(SPSR_s, Operand(r1)), "e164f001 msr SPSR_s, r1");
+ COMPARE(msr(SPSR_x, Operand(r2)), "e162f002 msr SPSR_x, r2");
+ COMPARE(msr(SPSR_c, Operand(r3)), "e161f003 msr SPSR_c, r3");
+ COMPARE(msr(SPSR_all, Operand(ip)), "e16ff00c msr SPSR_fsxc, ip");
+ COMPARE(msr(CPSR_f, Operand(r0), eq), "0128f000 msreq CPSR_f, r0");
+ COMPARE(msr(CPSR_s, Operand(r1), ne), "1124f001 msrne CPSR_s, r1");
+ COMPARE(msr(CPSR_x, Operand(r2), cs), "2122f002 msrcs CPSR_x, r2");
+ COMPARE(msr(CPSR_c, Operand(r3), cc), "3121f003 msrcc CPSR_c, r3");
+ COMPARE(msr(CPSR_all, Operand(ip), mi), "412ff00c msrmi CPSR_fsxc, ip");
+ COMPARE(msr(SPSR_f, Operand(r0), pl), "5168f000 msrpl SPSR_f, r0");
+ COMPARE(msr(SPSR_s, Operand(r1), vs), "6164f001 msrvs SPSR_s, r1");
+ COMPARE(msr(SPSR_x, Operand(r2), vc), "7162f002 msrvc SPSR_x, r2");
+ COMPARE(msr(SPSR_c, Operand(r3), hi), "8161f003 msrhi SPSR_c, r3");
+ COMPARE(msr(SPSR_all, Operand(ip), ls), "916ff00c msrls SPSR_fsxc, ip");
+
+ // Other combinations of mask bits.
+ COMPARE(msr(CPSR_s | CPSR_x, Operand(r4)),
+ "e126f004 msr CPSR_sx, r4");
+ COMPARE(msr(SPSR_s | SPSR_x | SPSR_c, Operand(r5)),
+ "e167f005 msr SPSR_sxc, r5");
+ COMPARE(msr(SPSR_s | SPSR_c, Operand(r6)),
+ "e165f006 msr SPSR_sc, r6");
+ COMPARE(msr(SPSR_f | SPSR_c, Operand(r7)),
+ "e169f007 msr SPSR_fc, r7");
+ // MSR with no mask is UNPREDICTABLE, and checked by the assembler, but check
+ // that the disassembler does something sensible.
+ COMPARE(dd(0xe120f008), "e120f008 msr CPSR_(none), r8");
+
+ COMPARE(mrs(r0, CPSR), "e10f0000 mrs r0, CPSR");
+ COMPARE(mrs(r1, SPSR), "e14f1000 mrs r1, SPSR");
+ COMPARE(mrs(r2, CPSR, ge), "a10f2000 mrsge r2, CPSR");
+ COMPARE(mrs(r3, SPSR, lt), "b14f3000 mrslt r3, SPSR");
+
+ VERIFY_RUN();
+}
+
TEST(Vfp) {
SET_UP();
@@ -566,6 +614,11 @@
COMPARE(vmov(d2, -13.0),
"eeba2b0a vmov.f64 d2, #-13");
+ COMPARE(vmov(s1, -1.0),
+ "eeff0a00 vmov.f32 s1, #-1");
+ COMPARE(vmov(s3, 13.0),
+ "eef21a0a vmov.f32 s3, #13");
+
COMPARE(vmov(d0, VmovIndexLo, r0),
"ee000b10 vmov.32 d0[0], r0");
COMPARE(vmov(d0, VmovIndexHi, r0),
diff --git a/test/cctest/test-disasm-ia32.cc b/test/cctest/test-disasm-ia32.cc
index 669e37a..f96eb00 100644
--- a/test/cctest/test-disasm-ia32.cc
+++ b/test/cctest/test-disasm-ia32.cc
@@ -96,6 +96,7 @@
__ nop();
__ add(ebx, Immediate(12));
__ nop();
+ __ adc(edx, Operand(ebx));
__ adc(ecx, 12);
__ adc(ecx, 1000);
__ nop();
@@ -119,8 +120,10 @@
__ nop();
__ imul(edx, ecx);
- __ shld(edx, ecx);
- __ shrd(edx, ecx);
+ __ shld(edx, ecx, 10);
+ __ shld_cl(edx, ecx);
+ __ shrd(edx, ecx, 10);
+ __ shrd_cl(edx, ecx);
__ bts(edx, ecx);
__ bts(Operand(ebx, ecx, times_4, 0), ecx);
__ nop();
@@ -214,14 +217,13 @@
__ sar(Operand(ebx, ecx, times_4, 10000), 6);
__ sar_cl(Operand(ebx, ecx, times_4, 10000));
__ sbb(edx, Operand(ebx, ecx, times_4, 10000));
- __ shld(edx, Operand(ebx, ecx, times_4, 10000));
__ shl(edx, 1);
__ shl(edx, 6);
__ shl_cl(edx);
__ shl(Operand(ebx, ecx, times_4, 10000), 1);
__ shl(Operand(ebx, ecx, times_4, 10000), 6);
__ shl_cl(Operand(ebx, ecx, times_4, 10000));
- __ shrd(edx, Operand(ebx, ecx, times_4, 10000));
+ __ shrd_cl(Operand(ebx, ecx, times_4, 10000), edx);
__ shr(edx, 1);
__ shr(edx, 7);
__ shr_cl(edx);
@@ -242,7 +244,7 @@
__ cmp(ebx, 12345);
__ cmp(ebx, Immediate(12));
__ cmp(Operand(edx, ecx, times_4, 10000), Immediate(12));
- __ cmpb(eax, 100);
+ __ cmpb(eax, Immediate(100));
__ or_(ebx, 12345);
@@ -266,7 +268,7 @@
__ test(edx, Operand(ebx, ecx, times_8, 10000));
__ test(Operand(esi, edi, times_1, -20000000), Immediate(300000000));
__ test_b(edx, Operand(ecx, ebx, times_2, 1000));
- __ test_b(Operand(eax, -20), 0x9A);
+ __ test_b(Operand(eax, -20), Immediate(0x9A));
__ nop();
__ xor_(edx, 12345);
diff --git a/test/cctest/test-disasm-s390.cc b/test/cctest/test-disasm-s390.cc
new file mode 100644
index 0000000..ba9e5e0
--- /dev/null
+++ b/test/cctest/test-disasm-s390.cc
@@ -0,0 +1,297 @@
+// Copyright 2014 the V8 project authors. All rights reserved.
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are
+// met:
+//
+// * Redistributions of source code must retain the above copyright
+// notice, this list of conditions and the following disclaimer.
+// * Redistributions in binary form must reproduce the above
+// copyright notice, this list of conditions and the following
+// disclaimer in the documentation and/or other materials provided
+// with the distribution.
+// * Neither the name of Google Inc. nor the names of its
+// contributors may be used to endorse or promote products derived
+// from this software without specific prior written permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+//
+
+#include <stdlib.h>
+
+#include "src/v8.h"
+
+#include "src/debug/debug.h"
+#include "src/disasm.h"
+#include "src/disassembler.h"
+#include "src/macro-assembler.h"
+#include "test/cctest/cctest.h"
+
+using namespace v8::internal;
+
+bool DisassembleAndCompare(byte* pc, const char* compare_string) {
+ disasm::NameConverter converter;
+ disasm::Disassembler disasm(converter);
+ EmbeddedVector<char, 128> disasm_buffer;
+
+ disasm.InstructionDecode(disasm_buffer, pc);
+
+ if (strcmp(compare_string, disasm_buffer.start()) != 0) {
+ fprintf(stderr,
+ "expected: \n"
+ "%s\n"
+ "disassembled: \n"
+ "%s\n\n",
+ compare_string, disasm_buffer.start());
+ return false;
+ }
+ return true;
+}
+
+// Set up V8 to a state where we can at least run the assembler and
+// disassembler. Declare the variables and allocate the data structures used
+// in the rest of the macros.
+#define SET_UP() \
+ CcTest::InitializeVM(); \
+ Isolate* isolate = CcTest::i_isolate(); \
+ HandleScope scope(isolate); \
+ byte* buffer = reinterpret_cast<byte*>(malloc(4 * 1024)); \
+ Assembler assm(isolate, buffer, 4 * 1024); \
+ bool failure = false;
+
+// This macro assembles one instruction using the preallocated assembler and
+// disassembles the generated instruction, comparing the output to the expected
+// value. If the comparison fails an error message is printed, but the test
+// continues to run until the end.
+#define COMPARE(asm_, compare_string) \
+ { \
+ int pc_offset = assm.pc_offset(); \
+ byte* progcounter = &buffer[pc_offset]; \
+ assm.asm_; \
+ if (!DisassembleAndCompare(progcounter, compare_string)) failure = true; \
+ }
+
+// Force emission of any pending literals into a pool.
+#define EMIT_PENDING_LITERALS() assm.CheckConstPool(true, false)
+
+// Verify that all invocations of the COMPARE macro passed successfully.
+// Exit with a failure if at least one of the tests failed.
+#define VERIFY_RUN() \
+ if (failure) { \
+ V8_Fatal(__FILE__, __LINE__, "S390 Disassembler tests failed.\n"); \
+ }
+
+TEST(TwoBytes) {
+ SET_UP();
+
+ COMPARE(ar(r3, r10), "1a3a ar\tr3,r10");
+ COMPARE(sr(r8, ip), "1b8c sr\tr8,ip");
+ COMPARE(mr_z(r0, r6), "1c06 mr\tr0,r6");
+ COMPARE(dr(r0, r5), "1d05 dr\tr0,r5");
+ COMPARE(or_z(r4, r2), "1642 or\tr4,r2");
+ COMPARE(nr(fp, r9), "14b9 nr\tfp,r9");
+ COMPARE(xr(r10, ip), "17ac xr\tr10,ip");
+ COMPARE(lr(r2, r13), "182d lr\tr2,r13");
+ COMPARE(cr_z(r9, r3), "1993 cr\tr9,r3");
+ COMPARE(clr(sp, r4), "15f4 clr\tsp,r4");
+ COMPARE(bcr(eq, r8), "0788 bcr\t0x8,r8");
+ COMPARE(ltr(r10, r1), "12a1 ltr\tr10,r1");
+ COMPARE(alr(r6, r8), "1e68 alr\tr6,r8");
+ COMPARE(slr(r3, ip), "1f3c slr\tr3,ip");
+ COMPARE(lnr(r4, r1), "1141 lnr\tr4,r1");
+ COMPARE(lcr(r0, r3), "1303 lcr\tr0,r3");
+ COMPARE(basr(r14, r7), "0de7 basr\tr14,r7");
+ COMPARE(ldr(d4, d6), "2846 ldr\td4,d6");
+
+ VERIFY_RUN();
+}
+
+TEST(FourBytes) {
+ SET_UP();
+
+#if V8_TARGET_ARCH_S390X
+ COMPARE(aghi(r5, Operand(1)), "a75b0001 aghi\tr5,1");
+ COMPARE(lghi(r6, Operand(8)), "a7690008 lghi\tr6,8");
+ COMPARE(mghi(r1, Operand(2)), "a71d0002 mghi\tr1,2");
+ COMPARE(cghi(r3, Operand(7)), "a73f0007 cghi\tr3,7");
+#else
+ COMPARE(ahi(r3, Operand(9)), "a73a0009 ahi\tr3,9");
+ COMPARE(lhi(r7, Operand::Zero()), "a7780000 lhi\tr7,0");
+ COMPARE(mhi(r8, Operand(3)), "a78c0003 mhi\tr8,3");
+ COMPARE(chi(r4, Operand(5)), "a74e0005 chi\tr4,5");
+ COMPARE(a(r13, MemOperand(r8, 70)), "5ad08046 a\tr13,70(r8)");
+ COMPARE(s(r9, MemOperand(sp, 9)), "5b90f009 s\tr9,9(sp)");
+ COMPARE(m(r6, MemOperand(r7, ip, 20)), "5c67c014 m\tr6,20(r7,ip)");
+ COMPARE(d(r14, MemOperand(r7, 15)), "5de0700f d\tr14,15(r7)");
+ COMPARE(o(r7, MemOperand(r3, r2, 10)), "5673200a o\tr7,10(r3,r2)");
+ COMPARE(n(r9, MemOperand(r5, sp, 9)), "5495f009 n\tr9,9(r5,sp)");
+ COMPARE(l(r0, MemOperand(r4, fp, 1)), "5804b001 l\tr0,1(r4,fp)");
+ COMPARE(c(r8, MemOperand(r5, r7, 18)), "59857012 c\tr8,18(r5,r7)");
+ COMPARE(al_z(r6, MemOperand(r9, sp, 2000)),
+ "5e69f7d0 al\tr6,2000(r9,sp)");
+ COMPARE(sl(r8, MemOperand(r1, 100)), "5f801064 sl\tr8,100(r1)");
+ COMPARE(la(r5, MemOperand(r9, 9)), "41509009 la\tr5,9(r9)");
+ COMPARE(ch(r0, MemOperand(r3, 0)), "49003000 ch\tr0,0(r3)");
+ COMPARE(cl(r1, MemOperand(r8, 5)), "55108005 cl\tr1,5(r8)");
+ COMPARE(cli(MemOperand(r9, 64), Operand(5)), "95059040 cli\t64(r9),5");
+ COMPARE(tm(MemOperand(r0, 8), Operand(7)), "91070008 tm\t8(r0),7");
+ COMPARE(bct(r1, MemOperand(r9, 15)), "4610900f bct\tr1,15(r9)");
+ COMPARE(st(r5, MemOperand(r9, r8, 7)), "50598007 st\tr5,7(r9,r8)");
+ COMPARE(stc(r13, MemOperand(r5, r1, 8)), "42d51008 stc\tr13,8(r5,r1)");
+ COMPARE(ic_z(r9, MemOperand(r1, 90)), "4390105a ic\tr9,90(r1)");
+ COMPARE(sth(r5, MemOperand(r9, r0, 87)), "40590057 sth\tr5,87(r9,r0)");
+#endif
+ COMPARE(iihh(r10, Operand(8)), "a5a00008 iihh\tr10,8");
+ COMPARE(iihl(r9, Operand(10)), "a591000a iihl\tr9,10");
+ COMPARE(iilh(r0, Operand(40)), "a5020028 iilh\tr0,40");
+ COMPARE(iill(r6, Operand(19)), "a5630013 iill\tr6,19");
+ COMPARE(oill(r9, Operand(9)), "a59b0009 oill\tr9,9");
+ COMPARE(tmll(r4, Operand(7)), "a7410007 tmll\tr4,7");
+ COMPARE(stm(r2, r5, MemOperand(r9, 44)), "9025902c stm\tr2,r5,44(r9)");
+ COMPARE(lm(r8, r0, MemOperand(sp, 88)), "9880f058 lm\tr8,r0,88(sp)");
+ COMPARE(nill(r7, Operand(30)), "a577001e nill\tr7,30");
+ COMPARE(nilh(r8, Operand(4)), "a5860004 nilh\tr8,4");
+ COMPARE(ah(r9, MemOperand(r5, r4, 4)), "4a954004 ah\tr9,4(r5,r4)");
+ COMPARE(sh(r8, MemOperand(r1, r2, 6)), "4b812006 sh\tr8,6(r1,r2)");
+ COMPARE(mh(r5, MemOperand(r9, r8, 7)), "4c598007 mh\tr5,7(r9,r8)");
+
+ VERIFY_RUN();
+}
+
+TEST(SixBytes) {
+ SET_UP();
+
+#if V8_TARGET_ARCH_S390X
+ COMPARE(llihf(ip, Operand(90000)), "c0ce00015f90 llihf\tip,90000");
+ COMPARE(agsi(MemOperand(r9, 1000), Operand(70)),
+ "eb4693e8007a agsi\t1000(r9),70");
+ COMPARE(clgfi(r7, Operand(80)), "c27e00000050 clgfi\tr7,80");
+ COMPARE(cgfi(r8, Operand(10)), "c28c0000000a cgfi\tr8,10");
+ COMPARE(xihf(fp, Operand(8)), "c0b600000008 xihf\tfp,8");
+ COMPARE(sllg(r0, r1, r2), "eb012000000d sllg\tr0,r1,0(r2)");
+ COMPARE(sllg(r0, r1, Operand(10)), "eb01000a000d sllg\tr0,r1,10(r0)");
+ COMPARE(srlg(r1, r3, Operand(10)), "eb13000a000c srlg\tr1,r3,10(r0)");
+ COMPARE(srlg(r1, r3, r10), "eb13a000000c srlg\tr1,r3,0(r10)");
+ COMPARE(slag(r1, r3, Operand(2)), "eb130002000b slag\tr1,r3,2(r0)");
+ COMPARE(slag(r1, r3, r2), "eb132000000b slag\tr1,r3,0(r2)");
+ COMPARE(srag(r1, r3, r2), "eb132000000a srag\tr1,r3,0(r2)");
+ COMPARE(srag(r1, r3, Operand(2)), "eb130002000a srag\tr1,r3,2(r0)");
+ COMPARE(risbg(r1, r2, Operand(3), Operand(5), Operand(2), false),
+ "ec1203050255 risbg\tr1,r2,3,5,2");
+ COMPARE(risbgn(r1, r2, Operand(3), Operand(5), Operand(2), false),
+ "ec1203050259 risbgn\tr1,r2,3,5,2");
+ COMPARE(stmg(r3, r4, MemOperand(sp, 10)),
+ "eb34f00a0024 stmg\tr3,r4,10(sp)");
+ COMPARE(ltg(r1, MemOperand(r4, sp, 10)), "e314f00a0002 ltg\tr1,10(r4,sp)");
+ COMPARE(lgh(r8, MemOperand(r1, 8888)), "e38012b80215 lgh\tr8,8888(r1)");
+ COMPARE(ag(r4, MemOperand(r9, r4, 2046)),
+ "e34947fe0008 ag\tr4,2046(r9,r4)");
+ COMPARE(agf(r1, MemOperand(r3, sp, 9)), "e313f0090018 agf\tr1,9(r3,sp)");
+ COMPARE(sg(r9, MemOperand(r5, 15)), "e390500f0009 sg\tr9,15(r5)");
+ COMPARE(ng(r7, MemOperand(r5, r6, 1000)),
+ "e37563e80080 ng\tr7,1000(r5,r6)");
+ COMPARE(og(r2, MemOperand(r8, r0, 1000)),
+ "e32803e80081 og\tr2,1000(r8,r0)");
+ COMPARE(xg(r9, MemOperand(r3, 8888)), "e39032b80282 xg\tr9,8888(r3)");
+ COMPARE(ng(r0, MemOperand(r9, r3, 900)), "e30933840080 ng\tr0,900(r9,r3)");
+ COMPARE(og(r3, MemOperand(r8, r2, 8888)),
+ "e33822b80281 og\tr3,8888(r8,r2)");
+ COMPARE(xg(r9, MemOperand(r3, 15)), "e390300f0082 xg\tr9,15(r3)");
+ COMPARE(cg(r0, MemOperand(r5, r4, 4)), "e30540040020 cg\tr0,4(r5,r4)");
+ COMPARE(lg(r1, MemOperand(r7, r8, 90)), "e317805a0004 lg\tr1,90(r7,r8)");
+ COMPARE(lgf(r1, MemOperand(sp, 15)), "e310f00f0014 lgf\tr1,15(sp)");
+ COMPARE(llgf(r0, MemOperand(r3, r4, 8)), "e30340080016 llgf\tr0,8(r3,r4)");
+ COMPARE(alg(r8, MemOperand(r4, 11)), "e380400b000a alg\tr8,11(r4)");
+ COMPARE(slg(r1, MemOperand(r5, r6, 11)), "e315600b000b slg\tr1,11(r5,r6)");
+ COMPARE(sgf(r0, MemOperand(r4, r5, 8888)),
+ "e30452b80219 sgf\tr0,8888(r4,r5)");
+ COMPARE(llgh(r4, MemOperand(r1, 8000)), "e3401f400191 llgh\tr4,8000(r1)");
+ COMPARE(llgc(r0, MemOperand(r4, r5, 30)),
+ "e304501e0090 llgc\tr0,30(r4,r5)");
+ COMPARE(lgb(r9, MemOperand(r8, r7, 10)), "e398700a0077 lgb\tr9,10(r8,r7)");
+ COMPARE(stg(r0, MemOperand(r9, 10)), "e300900a0024 stg\tr0,10(r9)");
+ COMPARE(mvghi(MemOperand(r7, 25), Operand(100)),
+ "e54870190064 mvghi\t25(r7),100");
+ COMPARE(algfi(r1, Operand(34250)), "c21a000085ca algfi\tr1,34250");
+ COMPARE(slgfi(r1, Operand(87654321)), "c21405397fb1 slgfi\tr1,87654321");
+ COMPARE(nihf(r2, Operand(8888)), "c02a000022b8 nihf\tr2,8888");
+ COMPARE(oihf(r6, Operand(9000)), "c06c00002328 oihf\tr6,9000");
+ COMPARE(msgfi(r6, Operand(90000)), "c26000015f90 msgfi\tr6,90000");
+#else
+ COMPARE(llilf(r10, Operand(72354)), "c0af00011aa2 llilf\tr10,72354");
+ COMPARE(iilf(r4, Operand(11)), "c0490000000b iilf\tr4,11");
+ COMPARE(afi(r2, Operand(8000)), "c22900001f40 afi\tr2,8000");
+ COMPARE(asi(MemOperand(r9, 1000), Operand(70)),
+ "eb4693e8006a asi\t1000(r9),70");
+ COMPARE(alfi(r1, Operand(90)), "c21b0000005a alfi\tr1,90");
+ COMPARE(clfi(r9, Operand(60)), "c29f0000003c clfi\tr9,60");
+ COMPARE(cfi(r8, Operand(10)), "c28d0000000a cfi\tr8,10");
+ COMPARE(xilf(r3, Operand(15)), "c0370000000f xilf\tr3,15");
+ COMPARE(sllk(r6, r7, Operand(10)), "eb67000a00df sllk\tr6,r7,10(r0)");
+ COMPARE(sllk(r6, r7, r8), "eb67800000df sllk\tr6,r7,0(r8)");
+ COMPARE(slak(r1, r3, r2), "eb13200000dd slak\tr1,r3,0(r2)");
+ COMPARE(slak(r1, r3, Operand(2)), "eb13000200dd slak\tr1,r3,2(r0)");
+ COMPARE(srak(r1, r3, Operand(2)), "eb13000200dc srak\tr1,r3,2(r0)");
+ COMPARE(srak(r1, r3, r2), "eb13200000dc srak\tr1,r3,0(r2)");
+ COMPARE(stmy(r3, r4, MemOperand(sp, 10)),
+ "eb34f00a0090 stmy\tr3,r4,10(sp)");
+ COMPARE(lt_z(r1, MemOperand(r4, sp, 10)), "e314f00a0012 lt\tr1,10(r4,sp)");
+ COMPARE(ml(r0, MemOperand(r3, r9, 2046)),
+ "e30397fe0096 ml\tr0,2046(r3,r9)");
+ COMPARE(ay(r5, MemOperand(r7, 8888)), "e35072b8025a ay\tr5,8888(r7)");
+ COMPARE(sy(r8, MemOperand(r6, r7, 2046)),
+ "e38677fe005b sy\tr8,2046(r6,r7)");
+ COMPARE(ny(r2, MemOperand(r9, r0, 8888)),
+ "e32902b80254 ny\tr2,8888(r9,r0)");
+ COMPARE(oy(r8, MemOperand(r4, 321)), "e38041410056 oy\tr8,321(r4)");
+ COMPARE(xy(r5, MemOperand(r3, r2, 0)), "e35320000057 xy\tr5,0(r3,r2)");
+ COMPARE(cy(r9, MemOperand(r4, 321)), "e39041410059 cy\tr9,321(r4)");
+ COMPARE(ahy(r1, MemOperand(r5, r6, 8888)),
+ "e31562b8027a ahy\tr1,8888(r5,r6)");
+ COMPARE(shy(r1, MemOperand(r5, r6, 8888)),
+ "e31562b8027b shy\tr1,8888(r5,r6)");
+ COMPARE(lb(r7, MemOperand(sp, 15)), "e370f00f0076 lb\tr7,15(sp)");
+ COMPARE(ly(r0, MemOperand(r1, r2, 321)), "e30121410058 ly\tr0,321(r1,r2)");
+ COMPARE(aly(r9, MemOperand(r2, r3, 10)), "e392300a005e aly\tr9,10(r2,r3)");
+ COMPARE(sly(r2, MemOperand(r9, r1, 15)), "e329100f005f sly\tr2,15(r9,r1)");
+ COMPARE(llh(r4, MemOperand(r1, 10)), "e340100a0095 llh\tr4,10(r1)");
+ COMPARE(llc(r0, MemOperand(r4, r5, 30)), "e304501e0094 llc\tr0,30(r4,r5)");
+ COMPARE(chy(r9, MemOperand(r8, r7, 30)), "e398701e0079 chy\tr9,30(r8,r7)");
+ COMPARE(cly(r8, MemOperand(r5, r4, 14)), "e385400e0055 cly\tr8,14(r5,r4)");
+ COMPARE(sty(r0, MemOperand(r0, 15)), "e300000f0050 sty\tr0,15(r0)");
+ COMPARE(mvhi(MemOperand(r7, 25), Operand(100)),
+ "e54c70190064 mvhi\t25(r7),100");
+ COMPARE(slfi(r4, Operand(100)), "c24500000064 slfi\tr4,100");
+ COMPARE(msfi(r8, Operand(1000)), "c281000003e8 msfi\tr8,1000");
+#endif
+ COMPARE(iihf(r6, Operand(9)), "c06800000009 iihf\tr6,9");
+ COMPARE(srlk(r1, r3, r2), "eb13200000de srlk\tr1,r3,0(r2)");
+ COMPARE(srlk(r1, r3, Operand(2)), "eb13000200de srlk\tr1,r3,2(r0)");
+ COMPARE(lmy(r9, r10, MemOperand(r8, 100)),
+ "eb9a80640098 lmy\tr9,r10,100(r8)");
+ COMPARE(lmg(r7, r8, MemOperand(r9, 100)),
+ "eb7890640004 lmg\tr7,r8,100(r9)");
+ COMPARE(lay(fp, MemOperand(sp, 8000)), "e3b0ff400171 lay\tfp,8000(sp)");
+ COMPARE(cliy(MemOperand(sp, 80), Operand(80)),
+ "eb50f0500055 cliy\t80(sp),80");
+ COMPARE(tmy(MemOperand(r0, 20), Operand(10)),
+ "eb0a00140051 tmy\t20(r0),10");
+ COMPARE(clg(r9, MemOperand(r6, r7, 19)), "e39670130021 clg\tr9,19(r6,r7)");
+ COMPARE(bctg(r8, MemOperand(sp, 10)), "e380f00a0046 bctg\tr8,10(sp)");
+ COMPARE(icy(r2, MemOperand(r3, 2)), "e32030020073 icy\tr2,2(r3)");
+ COMPARE(mvc(MemOperand(r9, 9), MemOperand(r3, 15), 10),
+ "d2099009300f mvc\t9(9,r9),15(r3)");
+ COMPARE(nilf(r0, Operand(8000)), "c00b00001f40 nilf\tr0,8000");
+ COMPARE(oilf(r9, Operand(1000)), "c09d000003e8 oilf\tr9,1000");
+
+ VERIFY_RUN();
+}
diff --git a/test/cctest/test-disasm-x87.cc b/test/cctest/test-disasm-x87.cc
index 17609cf..697a9d3 100644
--- a/test/cctest/test-disasm-x87.cc
+++ b/test/cctest/test-disasm-x87.cc
@@ -96,6 +96,7 @@
__ nop();
__ add(ebx, Immediate(12));
__ nop();
+ __ adc(edx, Operand(ebx));
__ adc(ecx, 12);
__ adc(ecx, 1000);
__ nop();
@@ -119,8 +120,10 @@
__ nop();
__ imul(edx, ecx);
- __ shld(edx, ecx);
- __ shrd(edx, ecx);
+ __ shld(edx, ecx, 10);
+ __ shld_cl(edx, ecx);
+ __ shrd(edx, ecx, 10);
+ __ shrd_cl(edx, ecx);
__ bts(edx, ecx);
__ bts(Operand(ebx, ecx, times_4, 0), ecx);
__ nop();
@@ -214,14 +217,13 @@
__ sar(Operand(ebx, ecx, times_4, 10000), 6);
__ sar_cl(Operand(ebx, ecx, times_4, 10000));
__ sbb(edx, Operand(ebx, ecx, times_4, 10000));
- __ shld(edx, Operand(ebx, ecx, times_4, 10000));
__ shl(edx, 1);
__ shl(edx, 6);
__ shl_cl(edx);
__ shl(Operand(ebx, ecx, times_4, 10000), 1);
__ shl(Operand(ebx, ecx, times_4, 10000), 6);
__ shl_cl(Operand(ebx, ecx, times_4, 10000));
- __ shrd(edx, Operand(ebx, ecx, times_4, 10000));
+ __ shrd_cl(Operand(ebx, ecx, times_4, 10000), edx);
__ shr(edx, 1);
__ shr(edx, 7);
__ shr_cl(edx);
@@ -242,7 +244,7 @@
__ cmp(ebx, 12345);
__ cmp(ebx, Immediate(12));
__ cmp(Operand(edx, ecx, times_4, 10000), Immediate(12));
- __ cmpb(eax, 100);
+ __ cmpb(eax, Immediate(100));
__ or_(ebx, 12345);
@@ -266,7 +268,7 @@
__ test(edx, Operand(ebx, ecx, times_8, 10000));
__ test(Operand(esi, edi, times_1, -20000000), Immediate(300000000));
__ test_b(edx, Operand(ecx, ebx, times_2, 1000));
- __ test_b(Operand(eax, -20), 0x9A);
+ __ test_b(Operand(eax, -20), Immediate(0x9A));
__ nop();
__ xor_(edx, 12345);
diff --git a/test/cctest/test-field-type-tracking.cc b/test/cctest/test-field-type-tracking.cc
index cee3600..7b262db 100644
--- a/test/cctest/test-field-type-tracking.cc
+++ b/test/cctest/test-field-type-tracking.cc
@@ -399,13 +399,17 @@
Handle<Object> getter(pair->getter(), isolate);
Handle<Object> setter(pair->setter(), isolate);
- map = Map::TransitionToAccessorProperty(map, name, ACCESSOR_GETTER, getter,
- attributes);
+ int descriptor =
+ map->instance_descriptors()->SearchWithCache(isolate, *name, *map);
+ map = Map::TransitionToAccessorProperty(
+ map, name, descriptor, ACCESSOR_GETTER, getter, attributes);
CHECK(!map->is_deprecated());
CHECK(!map->is_dictionary_map());
- map = Map::TransitionToAccessorProperty(map, name, ACCESSOR_SETTER, setter,
- attributes);
+ descriptor =
+ map->instance_descriptors()->SearchWithCache(isolate, *name, *map);
+ map = Map::TransitionToAccessorProperty(
+ map, name, descriptor, ACCESSOR_SETTER, setter, attributes);
CHECK(!map->is_deprecated());
CHECK(!map->is_dictionary_map());
return map;
@@ -570,7 +574,7 @@
CHECK(map->is_stable());
CHECK(expectations.Check(*map));
- Zone zone;
+ Zone zone(isolate->allocator());
if (is_detached_map) {
detach_point_map = Map::ReconfigureProperty(
@@ -962,7 +966,7 @@
CHECK(map2->is_stable());
CHECK(expectations2.Check(*map2));
- Zone zone;
+ Zone zone(isolate->allocator());
Handle<Map> field_owner(map->FindFieldOwner(kSplitProp), isolate);
CompilationInfo info("testing", isolate, &zone);
CHECK(!info.dependencies()->HasAborted());
@@ -1047,7 +1051,7 @@
CHECK(map2->is_stable());
CHECK(expectations2.Check(*map2));
- Zone zone;
+ Zone zone(isolate->allocator());
Handle<Map> field_owner(map->FindFieldOwner(kSplitProp), isolate);
CompilationInfo info("testing", isolate, &zone);
CHECK(!info.dependencies()->HasAborted());
diff --git a/test/cctest/test-gc-tracer.cc b/test/cctest/test-gc-tracer.cc
deleted file mode 100644
index 1289ec5..0000000
--- a/test/cctest/test-gc-tracer.cc
+++ /dev/null
@@ -1,124 +0,0 @@
-// Copyright 2014 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-#include <stdlib.h>
-#include <utility>
-
-#include "src/heap/gc-tracer.h"
-#include "test/cctest/cctest.h"
-
-using namespace v8::internal;
-
-TEST(RingBufferPartialFill) {
- const int max_size = 6;
- typedef RingBuffer<int, max_size>::const_iterator Iter;
- RingBuffer<int, max_size> ring_buffer;
- CHECK(ring_buffer.empty());
- CHECK_EQ(static_cast<int>(ring_buffer.size()), 0);
- CHECK(ring_buffer.begin() == ring_buffer.end());
-
- // Fill ring_buffer partially: [0, 1, 2]
- for (int i = 0; i < max_size / 2; i++) ring_buffer.push_back(i);
-
- CHECK(!ring_buffer.empty());
- CHECK(static_cast<int>(ring_buffer.size()) == max_size / 2);
- CHECK(ring_buffer.begin() != ring_buffer.end());
-
- // Test forward itartion
- int i = 0;
- for (Iter iter = ring_buffer.begin(); iter != ring_buffer.end(); ++iter) {
- CHECK(*iter == i);
- ++i;
- }
- CHECK_EQ(i, 3); // one past last element.
-
- // Test backward iteration
- i = 2;
- Iter iter = ring_buffer.back();
- while (true) {
- CHECK(*iter == i);
- if (iter == ring_buffer.begin()) break;
- --iter;
- --i;
- }
- CHECK_EQ(i, 0);
-}
-
-
-TEST(RingBufferWrapAround) {
- const int max_size = 6;
- typedef RingBuffer<int, max_size>::const_iterator Iter;
- RingBuffer<int, max_size> ring_buffer;
-
- // Fill ring_buffer (wrap around): [9, 10, 11, 12, 13, 14]
- for (int i = 0; i < 2 * max_size + 3; i++) ring_buffer.push_back(i);
-
- CHECK(!ring_buffer.empty());
- CHECK(static_cast<int>(ring_buffer.size()) == max_size);
- CHECK(ring_buffer.begin() != ring_buffer.end());
-
- // Test forward iteration
- int i = 9;
- for (Iter iter = ring_buffer.begin(); iter != ring_buffer.end(); ++iter) {
- CHECK(*iter == i);
- ++i;
- }
- CHECK_EQ(i, 15); // one past last element.
-
- // Test backward iteration
- i = 14;
- Iter iter = ring_buffer.back();
- while (true) {
- CHECK(*iter == i);
- if (iter == ring_buffer.begin()) break;
- --iter;
- --i;
- }
- CHECK_EQ(i, 9);
-}
-
-
-TEST(RingBufferPushFront) {
- const int max_size = 6;
- typedef RingBuffer<int, max_size>::const_iterator Iter;
- RingBuffer<int, max_size> ring_buffer;
-
- // Fill ring_buffer (wrap around): [14, 13, 12, 11, 10, 9]
- for (int i = 0; i < 2 * max_size + 3; i++) ring_buffer.push_front(i);
-
- CHECK(!ring_buffer.empty());
- CHECK(static_cast<int>(ring_buffer.size()) == max_size);
- CHECK(ring_buffer.begin() != ring_buffer.end());
-
- // Test forward iteration
- int i = 14;
- for (Iter iter = ring_buffer.begin(); iter != ring_buffer.end(); ++iter) {
- CHECK(*iter == i);
- --i;
- }
- CHECK_EQ(i, 8); // one past last element.
-}
diff --git a/test/cctest/test-hashing.cc b/test/cctest/test-hashing.cc
index 25a8e5c..d6f055e 100644
--- a/test/cctest/test-hashing.cc
+++ b/test/cctest/test-hashing.cc
@@ -90,6 +90,15 @@
__ pop(kRootRegister);
__ jr(ra);
__ nop();
+#elif V8_TARGET_ARCH_S390
+ __ push(kRootRegister);
+ __ push(ip);
+ __ InitializeRootRegister();
+ __ lhi(r2, Operand(key));
+ __ GetNumberHash(r2, ip);
+ __ pop(ip);
+ __ pop(kRootRegister);
+ __ Ret();
#elif V8_TARGET_ARCH_PPC
__ function_descriptor();
__ push(kRootRegister);
diff --git a/test/cctest/test-heap-profiler.cc b/test/cctest/test-heap-profiler.cc
index 2632593..dfe5911 100644
--- a/test/cctest/test-heap-profiler.cc
+++ b/test/cctest/test-heap-profiler.cc
@@ -32,6 +32,7 @@
#include "src/v8.h"
#include "include/v8-profiler.h"
+#include "src/collector.h"
#include "src/debug/debug.h"
#include "src/hashmap.h"
#include "src/profiler/allocation-tracker.h"
@@ -366,7 +367,9 @@
}
}
CHECK(compiled_references_x);
- CHECK(!lazy_references_x);
+ if (i::FLAG_lazy && !(i::FLAG_ignition && i::FLAG_ignition_eager)) {
+ CHECK(!lazy_references_x);
+ }
}
@@ -2872,7 +2875,6 @@
return node;
}
-
TEST(SamplingHeapProfiler) {
v8::HandleScope scope(v8::Isolate::GetCurrent());
LocalContext env;
@@ -2985,6 +2987,23 @@
heap_profiler->StopSamplingHeapProfiler();
}
+
+ // A test case with scripts unloaded before profile gathered
+ {
+ heap_profiler->StartSamplingHeapProfiler(64);
+ CompileRun(
+ "for (var i = 0; i < 1024; i++) {\n"
+ " eval(\"new Array(100)\");\n"
+ "}\n");
+
+ CcTest::heap()->CollectAllGarbage();
+
+ v8::base::SmartPointer<v8::AllocationProfile> profile(
+ heap_profiler->GetAllocationProfile());
+ CHECK(!profile.is_empty());
+
+ heap_profiler->StopSamplingHeapProfiler();
+ }
}
diff --git a/test/cctest/test-inobject-slack-tracking.cc b/test/cctest/test-inobject-slack-tracking.cc
index 5cc4e94..004781a 100644
--- a/test/cctest/test-inobject-slack-tracking.cc
+++ b/test/cctest/test-inobject-slack-tracking.cc
@@ -612,6 +612,8 @@
Handle<JSObject> tmp = Run<JSObject>(new_script);
CHECK_EQ(initial_map->IsInobjectSlackTrackingInProgress(),
IsObjectShrinkable(*tmp));
+ CHECK_EQ(Map::kSlackTrackingCounterStart - i - 1,
+ initial_map->construction_counter());
}
CHECK(!initial_map->IsInobjectSlackTrackingInProgress());
CHECK(!IsObjectShrinkable(*obj));
diff --git a/test/cctest/test-liveedit.cc b/test/cctest/test-liveedit.cc
index b8cf406..bae3ed5 100644
--- a/test/cctest/test-liveedit.cc
+++ b/test/cctest/test-liveedit.cc
@@ -95,7 +95,8 @@
int expected_diff_parameter = -1) {
StringCompareInput input(s1, s2);
- Zone zone;
+ v8::base::AccountingAllocator allocator;
+ Zone zone(&allocator);
DiffChunkStruct* first_chunk;
ListDiffOutputWriter writer(&first_chunk, &zone);
diff --git a/test/cctest/test-lockers.cc b/test/cctest/test-lockers.cc
index 385366a..f12ca87 100644
--- a/test/cctest/test-lockers.cc
+++ b/test/cctest/test-lockers.cc
@@ -298,7 +298,7 @@
// Run parallel threads that lock and access different isolates in parallel
TEST(SeparateIsolatesLocksNonexclusive) {
i::FLAG_always_opt = false;
-#if V8_TARGET_ARCH_ARM || V8_TARGET_ARCH_MIPS
+#if V8_TARGET_ARCH_ARM || V8_TARGET_ARCH_MIPS || V8_TARGET_ARCH_S390
const int kNThreads = 50;
#else
const int kNThreads = 100;
@@ -382,7 +382,7 @@
// Use unlocker inside of a Locker, multiple threads.
TEST(LockerUnlocker) {
i::FLAG_always_opt = false;
-#if V8_TARGET_ARCH_ARM || V8_TARGET_ARCH_MIPS
+#if V8_TARGET_ARCH_ARM || V8_TARGET_ARCH_MIPS || V8_TARGET_ARCH_S390
const int kNThreads = 50;
#else
const int kNThreads = 100;
@@ -439,7 +439,7 @@
// Use Unlocker inside two Lockers.
TEST(LockTwiceAndUnlock) {
i::FLAG_always_opt = false;
-#if V8_TARGET_ARCH_ARM || V8_TARGET_ARCH_MIPS
+#if V8_TARGET_ARCH_ARM || V8_TARGET_ARCH_MIPS || V8_TARGET_ARCH_S390
const int kNThreads = 50;
#else
const int kNThreads = 100;
@@ -710,6 +710,8 @@
const int kNThreads = 10;
#elif V8_TARGET_ARCH_X64 && V8_TARGET_ARCH_32_BIT
const int kNThreads = 4;
+#elif V8_TARGET_ARCH_S390 && V8_TARGET_ARCH_32_BIT
+ const int kNThreads = 10;
#else
const int kNThreads = 40;
#endif
diff --git a/test/cctest/test-log-stack-tracer.cc b/test/cctest/test-log-stack-tracer.cc
index 21dafda..05d7103 100644
--- a/test/cctest/test-log-stack-tracer.cc
+++ b/test/cctest/test-log-stack-tracer.cc
@@ -57,7 +57,7 @@
static bool IsAddressWithinFuncCode(JSFunction* function, Address addr) {
- i::Code* code = function->code();
+ i::AbstractCode* code = function->abstract_code();
return code->contains(addr);
}
diff --git a/test/cctest/test-log.cc b/test/cctest/test-log.cc
index 8077f65..9c7e63b 100644
--- a/test/cctest/test-log.cc
+++ b/test/cctest/test-log.cc
@@ -569,14 +569,13 @@
TEST(Issue539892) {
class : public i::CodeEventLogger {
public:
- virtual void CodeMoveEvent(Address from, Address to) {}
- virtual void CodeDeleteEvent(Address from) {}
- virtual void CodeDisableOptEvent(i::Code* code,
- i::SharedFunctionInfo* shared) {}
+ void CodeMoveEvent(i::AbstractCode* from, Address to) override {}
+ void CodeDisableOptEvent(i::AbstractCode* code,
+ i::SharedFunctionInfo* shared) override {}
private:
- virtual void LogRecordedBuffer(i::Code* code, i::SharedFunctionInfo* shared,
- const char* name, int length) {}
+ void LogRecordedBuffer(i::AbstractCode* code, i::SharedFunctionInfo* shared,
+ const char* name, int length) override {}
} code_event_logger;
SETUP_FLAGS();
v8::Isolate::CreateParams create_params;
diff --git a/test/cctest/test-macro-assembler-mips.cc b/test/cctest/test-macro-assembler-mips.cc
index 77dc859..91ee215 100644
--- a/test/cctest/test-macro-assembler-mips.cc
+++ b/test/cctest/test-macro-assembler-mips.cc
@@ -40,6 +40,7 @@
typedef void* (*F)(int x, int y, int p2, int p3, int p4);
typedef Object* (*F1)(int x, int p1, int p2, int p3, int p4);
+typedef Object* (*F3)(void* p, int p1, int p2, int p3, int p4);
#define __ masm->
@@ -267,7 +268,7 @@
masm, kNumCases * kPointerSize + ((6 + 1) * Assembler::kInstrSize));
__ addiupc(at, 6 + 1);
- __ lsa(at, at, a0, 2);
+ __ Lsa(at, at, a0, 2);
__ lw(at, MemOperand(at));
__ jalr(at);
__ nop(); // Branch delay slot nop.
@@ -389,4 +390,191 @@
}
}
+static const std::vector<uint32_t> uint32_test_values() {
+ static const uint32_t kValues[] = {0x00000000, 0x00000001, 0x00ffff00,
+ 0x7fffffff, 0x80000000, 0x80000001,
+ 0x80ffff00, 0x8fffffff, 0xffffffff};
+ return std::vector<uint32_t>(&kValues[0], &kValues[arraysize(kValues)]);
+}
+
+static const std::vector<int32_t> int32_test_values() {
+ static const int32_t kValues[] = {
+ static_cast<int32_t>(0x00000000), static_cast<int32_t>(0x00000001),
+ static_cast<int32_t>(0x00ffff00), static_cast<int32_t>(0x7fffffff),
+ static_cast<int32_t>(0x80000000), static_cast<int32_t>(0x80000001),
+ static_cast<int32_t>(0x80ffff00), static_cast<int32_t>(0x8fffffff),
+ static_cast<int32_t>(0xffffffff)};
+ return std::vector<int32_t>(&kValues[0], &kValues[arraysize(kValues)]);
+}
+
+// Helper macros that can be used in FOR_INT32_INPUTS(i) { ... *i ... }
+#define FOR_INPUTS(ctype, itype, var) \
+ std::vector<ctype> var##_vec = itype##_test_values(); \
+ for (std::vector<ctype>::iterator var = var##_vec.begin(); \
+ var != var##_vec.end(); ++var)
+
+#define FOR_UINT32_INPUTS(var) FOR_INPUTS(uint32_t, uint32, var)
+#define FOR_INT32_INPUTS(var) FOR_INPUTS(int32_t, int32, var)
+
+template <typename RET_TYPE, typename IN_TYPE, typename Func>
+RET_TYPE run_Cvt(IN_TYPE x, Func GenerateConvertInstructionFunc) {
+ typedef RET_TYPE (*F_CVT)(IN_TYPE x0, int x1, int x2, int x3, int x4);
+
+ Isolate* isolate = CcTest::i_isolate();
+ HandleScope scope(isolate);
+ MacroAssembler assm(isolate, nullptr, 0,
+ v8::internal::CodeObjectRequired::kYes);
+ MacroAssembler* masm = &assm;
+
+ __ mtc1(a0, f4);
+ GenerateConvertInstructionFunc(masm);
+ __ mfc1(v0, f2);
+ __ jr(ra);
+ __ nop();
+
+ CodeDesc desc;
+ assm.GetCode(&desc);
+ Handle<Code> code = isolate->factory()->NewCode(
+ desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
+
+ F_CVT f = FUNCTION_CAST<F_CVT>(code->entry());
+
+ return reinterpret_cast<RET_TYPE>(
+ CALL_GENERATED_CODE(isolate, f, x, 0, 0, 0, 0));
+}
+
+TEST(cvt_s_w_Trunc_uw_s) {
+ CcTest::InitializeVM();
+ FOR_UINT32_INPUTS(i) {
+ uint32_t input = *i;
+ CHECK_EQ(static_cast<float>(input),
+ run_Cvt<uint32_t>(input, [](MacroAssembler* masm) {
+ __ cvt_s_w(f0, f4);
+ __ Trunc_uw_s(f2, f0, f1);
+ }));
+ }
+}
+
+TEST(cvt_d_w_Trunc_w_d) {
+ CcTest::InitializeVM();
+ FOR_INT32_INPUTS(i) {
+ int32_t input = *i;
+ CHECK_EQ(static_cast<double>(input),
+ run_Cvt<int32_t>(input, [](MacroAssembler* masm) {
+ __ cvt_d_w(f0, f4);
+ __ Trunc_w_d(f2, f0);
+ }));
+ }
+}
+
+TEST(min_max_nan) {
+ CcTest::InitializeVM();
+ Isolate* isolate = CcTest::i_isolate();
+ HandleScope scope(isolate);
+ MacroAssembler assembler(isolate, nullptr, 0,
+ v8::internal::CodeObjectRequired::kYes);
+ MacroAssembler* masm = &assembler;
+
+ struct TestFloat {
+ double a;
+ double b;
+ double c;
+ double d;
+ float e;
+ float f;
+ float g;
+ float h;
+ };
+
+ TestFloat test;
+ const double dnan = std::numeric_limits<double>::quiet_NaN();
+ const double dinf = std::numeric_limits<double>::infinity();
+ const double dminf = -std::numeric_limits<double>::infinity();
+ const float fnan = std::numeric_limits<float>::quiet_NaN();
+ const float finf = std::numeric_limits<float>::infinity();
+ const float fminf = std::numeric_limits<float>::infinity();
+ const int kTableLength = 13;
+
+ double inputsa[kTableLength] = {2.0, 3.0, -0.0, 0.0, 42.0, dinf, dminf,
+ dinf, dnan, 3.0, dinf, dnan, dnan};
+ double inputsb[kTableLength] = {3.0, 2.0, 0.0, -0.0, dinf, 42.0, dinf,
+ dminf, 3.0, dnan, dnan, dinf, dnan};
+ double outputsdmin[kTableLength] = {2.0, 2.0, -0.0, -0.0, 42.0,
+ 42.0, dminf, dminf, dnan, dnan,
+ dnan, dnan, dnan};
+ double outputsdmax[kTableLength] = {3.0, 3.0, 0.0, 0.0, dinf, dinf, dinf,
+ dinf, dnan, dnan, dnan, dnan, dnan};
+
+ float inputse[kTableLength] = {2.0, 3.0, -0.0, 0.0, 42.0, finf, fminf,
+ finf, fnan, 3.0, finf, fnan, fnan};
+ float inputsf[kTableLength] = {3.0, 2.0, 0.0, -0.0, finf, 42.0, finf,
+ fminf, 3.0, fnan, fnan, finf, fnan};
+ float outputsfmin[kTableLength] = {2.0, 2.0, -0.0, -0.0, 42.0, 42.0, fminf,
+ fminf, fnan, fnan, fnan, fnan, fnan};
+ float outputsfmax[kTableLength] = {3.0, 3.0, 0.0, 0.0, finf, finf, finf,
+ finf, fnan, fnan, fnan, fnan, fnan};
+
+ auto handle_dnan = [masm](FPURegister dst, Label* nan, Label* back) {
+ __ bind(nan);
+ __ LoadRoot(at, Heap::kNanValueRootIndex);
+ __ ldc1(dst, FieldMemOperand(at, HeapNumber::kValueOffset));
+ __ Branch(back);
+ };
+
+ auto handle_snan = [masm, fnan](FPURegister dst, Label* nan, Label* back) {
+ __ bind(nan);
+ __ Move(dst, fnan);
+ __ Branch(back);
+ };
+
+ Label handle_mind_nan, handle_maxd_nan, handle_mins_nan, handle_maxs_nan;
+ Label back_mind_nan, back_maxd_nan, back_mins_nan, back_maxs_nan;
+
+ __ push(s6);
+ __ InitializeRootRegister();
+ __ ldc1(f4, MemOperand(a0, offsetof(TestFloat, a)));
+ __ ldc1(f8, MemOperand(a0, offsetof(TestFloat, b)));
+ __ lwc1(f2, MemOperand(a0, offsetof(TestFloat, e)));
+ __ lwc1(f6, MemOperand(a0, offsetof(TestFloat, f)));
+ __ MinNaNCheck_d(f10, f4, f8, &handle_mind_nan);
+ __ bind(&back_mind_nan);
+ __ MaxNaNCheck_d(f12, f4, f8, &handle_maxd_nan);
+ __ bind(&back_maxd_nan);
+ __ MinNaNCheck_s(f14, f2, f6, &handle_mins_nan);
+ __ bind(&back_mins_nan);
+ __ MaxNaNCheck_s(f16, f2, f6, &handle_maxs_nan);
+ __ bind(&back_maxs_nan);
+ __ sdc1(f10, MemOperand(a0, offsetof(TestFloat, c)));
+ __ sdc1(f12, MemOperand(a0, offsetof(TestFloat, d)));
+ __ swc1(f14, MemOperand(a0, offsetof(TestFloat, g)));
+ __ swc1(f16, MemOperand(a0, offsetof(TestFloat, h)));
+ __ pop(s6);
+ __ jr(ra);
+ __ nop();
+
+ handle_dnan(f10, &handle_mind_nan, &back_mind_nan);
+ handle_dnan(f12, &handle_maxd_nan, &back_maxd_nan);
+ handle_snan(f14, &handle_mins_nan, &back_mins_nan);
+ handle_snan(f16, &handle_maxs_nan, &back_maxs_nan);
+
+ CodeDesc desc;
+ masm->GetCode(&desc);
+ Handle<Code> code = isolate->factory()->NewCode(
+ desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
+ ::F3 f = FUNCTION_CAST<::F3>(code->entry());
+ for (int i = 0; i < kTableLength; i++) {
+ test.a = inputsa[i];
+ test.b = inputsb[i];
+ test.e = inputse[i];
+ test.f = inputsf[i];
+
+ CALL_GENERATED_CODE(isolate, f, &test, 0, 0, 0, 0);
+
+ CHECK_EQ(0, memcmp(&test.c, &outputsdmin[i], sizeof(test.c)));
+ CHECK_EQ(0, memcmp(&test.d, &outputsdmax[i], sizeof(test.d)));
+ CHECK_EQ(0, memcmp(&test.g, &outputsfmin[i], sizeof(test.g)));
+ CHECK_EQ(0, memcmp(&test.h, &outputsfmax[i], sizeof(test.h)));
+ }
+}
+
#undef __
diff --git a/test/cctest/test-macro-assembler-mips64.cc b/test/cctest/test-macro-assembler-mips64.cc
index e74703b..e251242 100644
--- a/test/cctest/test-macro-assembler-mips64.cc
+++ b/test/cctest/test-macro-assembler-mips64.cc
@@ -41,6 +41,7 @@
typedef void* (*F)(int64_t x, int64_t y, int p2, int p3, int p4);
typedef Object* (*F1)(int x, int p1, int p2, int p3, int p4);
+typedef Object* (*F3)(void* p, int p1, int p2, int p3, int p4);
#define __ masm->
@@ -316,7 +317,7 @@
masm, kNumCases * kPointerSize + ((6 + 1) * Assembler::kInstrSize));
__ addiupc(at, 6 + 1);
- __ dlsa(at, at, a0, 3);
+ __ Dlsa(at, at, a0, 3);
__ ld(at, MemOperand(at));
__ jalr(at);
__ nop(); // Branch delay slot nop.
@@ -522,4 +523,268 @@
}
}
+static const std::vector<uint32_t> uint32_test_values() {
+ static const uint32_t kValues[] = {0x00000000, 0x00000001, 0x00ffff00,
+ 0x7fffffff, 0x80000000, 0x80000001,
+ 0x80ffff00, 0x8fffffff, 0xffffffff};
+ return std::vector<uint32_t>(&kValues[0], &kValues[arraysize(kValues)]);
+}
+
+static const std::vector<int32_t> int32_test_values() {
+ static const int32_t kValues[] = {
+ static_cast<int32_t>(0x00000000), static_cast<int32_t>(0x00000001),
+ static_cast<int32_t>(0x00ffff00), static_cast<int32_t>(0x7fffffff),
+ static_cast<int32_t>(0x80000000), static_cast<int32_t>(0x80000001),
+ static_cast<int32_t>(0x80ffff00), static_cast<int32_t>(0x8fffffff),
+ static_cast<int32_t>(0xffffffff)};
+ return std::vector<int32_t>(&kValues[0], &kValues[arraysize(kValues)]);
+}
+
+static const std::vector<uint64_t> uint64_test_values() {
+ static const uint64_t kValues[] = {
+ 0x0000000000000000, 0x0000000000000001, 0x0000ffffffff0000,
+ 0x7fffffffffffffff, 0x8000000000000000, 0x8000000000000001,
+ 0x8000ffffffff0000, 0x8fffffffffffffff, 0xffffffffffffffff};
+ return std::vector<uint64_t>(&kValues[0], &kValues[arraysize(kValues)]);
+}
+
+static const std::vector<int64_t> int64_test_values() {
+ static const int64_t kValues[] = {static_cast<int64_t>(0x0000000000000000),
+ static_cast<int64_t>(0x0000000000000001),
+ static_cast<int64_t>(0x0000ffffffff0000),
+ static_cast<int64_t>(0x7fffffffffffffff),
+ static_cast<int64_t>(0x8000000000000000),
+ static_cast<int64_t>(0x8000000000000001),
+ static_cast<int64_t>(0x8000ffffffff0000),
+ static_cast<int64_t>(0x8fffffffffffffff),
+ static_cast<int64_t>(0xffffffffffffffff)};
+ return std::vector<int64_t>(&kValues[0], &kValues[arraysize(kValues)]);
+}
+
+// Helper macros that can be used in FOR_INT32_INPUTS(i) { ... *i ... }
+#define FOR_INPUTS(ctype, itype, var) \
+ std::vector<ctype> var##_vec = itype##_test_values(); \
+ for (std::vector<ctype>::iterator var = var##_vec.begin(); \
+ var != var##_vec.end(); ++var)
+
+#define FOR_INT32_INPUTS(var) FOR_INPUTS(int32_t, int32, var)
+#define FOR_INT64_INPUTS(var) FOR_INPUTS(int64_t, int64, var)
+#define FOR_UINT32_INPUTS(var) FOR_INPUTS(uint32_t, uint32, var)
+#define FOR_UINT64_INPUTS(var) FOR_INPUTS(uint64_t, uint64, var)
+
+template <typename RET_TYPE, typename IN_TYPE, typename Func>
+RET_TYPE run_Cvt(IN_TYPE x, Func GenerateConvertInstructionFunc) {
+ typedef RET_TYPE (*F_CVT)(IN_TYPE x0, int x1, int x2, int x3, int x4);
+
+ Isolate* isolate = CcTest::i_isolate();
+ HandleScope scope(isolate);
+ MacroAssembler assm(isolate, nullptr, 0,
+ v8::internal::CodeObjectRequired::kYes);
+ MacroAssembler* masm = &assm;
+
+ GenerateConvertInstructionFunc(masm);
+ __ dmfc1(v0, f2);
+ __ jr(ra);
+ __ nop();
+
+ CodeDesc desc;
+ assm.GetCode(&desc);
+ Handle<Code> code = isolate->factory()->NewCode(
+ desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
+
+ F_CVT f = FUNCTION_CAST<F_CVT>(code->entry());
+
+ return reinterpret_cast<RET_TYPE>(
+ CALL_GENERATED_CODE(isolate, f, x, 0, 0, 0, 0));
+}
+
+TEST(Cvt_s_uw_Trunc_uw_s) {
+ CcTest::InitializeVM();
+ FOR_UINT32_INPUTS(i) {
+ uint32_t input = *i;
+ CHECK_EQ(static_cast<float>(input),
+ run_Cvt<uint64_t>(input, [](MacroAssembler* masm) {
+ __ Cvt_s_uw(f0, a0);
+ __ mthc1(zero_reg, f2);
+ __ Trunc_uw_s(f2, f0, f1);
+ }));
+ }
+}
+
+TEST(Cvt_s_ul_Trunc_ul_s) {
+ CcTest::InitializeVM();
+ FOR_UINT64_INPUTS(i) {
+ uint64_t input = *i;
+ CHECK_EQ(static_cast<float>(input),
+ run_Cvt<uint64_t>(input, [](MacroAssembler* masm) {
+ __ Cvt_s_ul(f0, a0);
+ __ Trunc_ul_s(f2, f0, f1, v0);
+ }));
+ }
+}
+
+TEST(Cvt_d_ul_Trunc_ul_d) {
+ CcTest::InitializeVM();
+ FOR_UINT64_INPUTS(i) {
+ uint64_t input = *i;
+ CHECK_EQ(static_cast<double>(input),
+ run_Cvt<uint64_t>(input, [](MacroAssembler* masm) {
+ __ Cvt_d_ul(f0, a0);
+ __ Trunc_ul_d(f2, f0, f1, v0);
+ }));
+ }
+}
+
+TEST(cvt_d_l_Trunc_l_d) {
+ CcTest::InitializeVM();
+ FOR_INT64_INPUTS(i) {
+ int64_t input = *i;
+ CHECK_EQ(static_cast<double>(input),
+ run_Cvt<int64_t>(input, [](MacroAssembler* masm) {
+ __ dmtc1(a0, f4);
+ __ cvt_d_l(f0, f4);
+ __ Trunc_l_d(f2, f0);
+ }));
+ }
+}
+
+TEST(cvt_d_l_Trunc_l_ud) {
+ CcTest::InitializeVM();
+ FOR_INT64_INPUTS(i) {
+ int64_t input = *i;
+ uint64_t abs_input = (input < 0) ? -input : input;
+ CHECK_EQ(static_cast<double>(abs_input),
+ run_Cvt<uint64_t>(input, [](MacroAssembler* masm) {
+ __ dmtc1(a0, f4);
+ __ cvt_d_l(f0, f4);
+ __ Trunc_l_ud(f2, f0, f6);
+ }));
+ }
+}
+
+TEST(cvt_d_w_Trunc_w_d) {
+ CcTest::InitializeVM();
+ FOR_INT32_INPUTS(i) {
+ int32_t input = *i;
+ CHECK_EQ(static_cast<double>(input),
+ run_Cvt<int64_t>(input, [](MacroAssembler* masm) {
+ __ mtc1(a0, f4);
+ __ cvt_d_w(f0, f4);
+ __ Trunc_w_d(f2, f0);
+ __ mfc1(v1, f2);
+ __ dmtc1(v1, f2);
+ }));
+ }
+}
+
+TEST(min_max_nan) {
+ CcTest::InitializeVM();
+ Isolate* isolate = CcTest::i_isolate();
+ HandleScope scope(isolate);
+ MacroAssembler assembler(isolate, nullptr, 0,
+ v8::internal::CodeObjectRequired::kYes);
+ MacroAssembler* masm = &assembler;
+
+ struct TestFloat {
+ double a;
+ double b;
+ double c;
+ double d;
+ float e;
+ float f;
+ float g;
+ float h;
+ };
+
+ TestFloat test;
+ const double dnan = std::numeric_limits<double>::quiet_NaN();
+ const double dinf = std::numeric_limits<double>::infinity();
+ const double dminf = -std::numeric_limits<double>::infinity();
+ const float fnan = std::numeric_limits<float>::quiet_NaN();
+ const float finf = std::numeric_limits<float>::infinity();
+ const float fminf = std::numeric_limits<float>::infinity();
+ const int kTableLength = 13;
+
+ double inputsa[kTableLength] = {2.0, 3.0, -0.0, 0.0, 42.0, dinf, dminf,
+ dinf, dnan, 3.0, dinf, dnan, dnan};
+ double inputsb[kTableLength] = {3.0, 2.0, 0.0, -0.0, dinf, 42.0, dinf,
+ dminf, 3.0, dnan, dnan, dinf, dnan};
+ double outputsdmin[kTableLength] = {2.0, 2.0, -0.0, -0.0, 42.0,
+ 42.0, dminf, dminf, dnan, dnan,
+ dnan, dnan, dnan};
+ double outputsdmax[kTableLength] = {3.0, 3.0, 0.0, 0.0, dinf, dinf, dinf,
+ dinf, dnan, dnan, dnan, dnan, dnan};
+
+ float inputse[kTableLength] = {2.0, 3.0, -0.0, 0.0, 42.0, finf, fminf,
+ finf, fnan, 3.0, finf, fnan, fnan};
+ float inputsf[kTableLength] = {3.0, 2.0, 0.0, -0.0, finf, 42.0, finf,
+ fminf, 3.0, fnan, fnan, finf, fnan};
+ float outputsfmin[kTableLength] = {2.0, 2.0, -0.0, -0.0, 42.0, 42.0, fminf,
+ fminf, fnan, fnan, fnan, fnan, fnan};
+ float outputsfmax[kTableLength] = {3.0, 3.0, 0.0, 0.0, finf, finf, finf,
+ finf, fnan, fnan, fnan, fnan, fnan};
+
+ auto handle_dnan = [masm](FPURegister dst, Label* nan, Label* back) {
+ __ bind(nan);
+ __ LoadRoot(at, Heap::kNanValueRootIndex);
+ __ ldc1(dst, FieldMemOperand(at, HeapNumber::kValueOffset));
+ __ Branch(back);
+ };
+
+ auto handle_snan = [masm, fnan](FPURegister dst, Label* nan, Label* back) {
+ __ bind(nan);
+ __ Move(dst, fnan);
+ __ Branch(back);
+ };
+
+ Label handle_mind_nan, handle_maxd_nan, handle_mins_nan, handle_maxs_nan;
+ Label back_mind_nan, back_maxd_nan, back_mins_nan, back_maxs_nan;
+
+ __ push(s6);
+ __ InitializeRootRegister();
+ __ ldc1(f4, MemOperand(a0, offsetof(TestFloat, a)));
+ __ ldc1(f8, MemOperand(a0, offsetof(TestFloat, b)));
+ __ lwc1(f2, MemOperand(a0, offsetof(TestFloat, e)));
+ __ lwc1(f6, MemOperand(a0, offsetof(TestFloat, f)));
+ __ MinNaNCheck_d(f10, f4, f8, &handle_mind_nan);
+ __ bind(&back_mind_nan);
+ __ MaxNaNCheck_d(f12, f4, f8, &handle_maxd_nan);
+ __ bind(&back_maxd_nan);
+ __ MinNaNCheck_s(f14, f2, f6, &handle_mins_nan);
+ __ bind(&back_mins_nan);
+ __ MaxNaNCheck_s(f16, f2, f6, &handle_maxs_nan);
+ __ bind(&back_maxs_nan);
+ __ sdc1(f10, MemOperand(a0, offsetof(TestFloat, c)));
+ __ sdc1(f12, MemOperand(a0, offsetof(TestFloat, d)));
+ __ swc1(f14, MemOperand(a0, offsetof(TestFloat, g)));
+ __ swc1(f16, MemOperand(a0, offsetof(TestFloat, h)));
+ __ pop(s6);
+ __ jr(ra);
+ __ nop();
+
+ handle_dnan(f10, &handle_mind_nan, &back_mind_nan);
+ handle_dnan(f12, &handle_maxd_nan, &back_maxd_nan);
+ handle_snan(f14, &handle_mins_nan, &back_mins_nan);
+ handle_snan(f16, &handle_maxs_nan, &back_maxs_nan);
+
+ CodeDesc desc;
+ masm->GetCode(&desc);
+ Handle<Code> code = isolate->factory()->NewCode(
+ desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
+ ::F3 f = FUNCTION_CAST<::F3>(code->entry());
+ for (int i = 0; i < kTableLength; i++) {
+ test.a = inputsa[i];
+ test.b = inputsb[i];
+ test.e = inputse[i];
+ test.f = inputsf[i];
+
+ CALL_GENERATED_CODE(isolate, f, &test, 0, 0, 0, 0);
+
+ CHECK_EQ(0, memcmp(&test.c, &outputsdmin[i], sizeof(test.c)));
+ CHECK_EQ(0, memcmp(&test.d, &outputsdmax[i], sizeof(test.d)));
+ CHECK_EQ(0, memcmp(&test.g, &outputsfmin[i], sizeof(test.g)));
+ CHECK_EQ(0, memcmp(&test.h, &outputsfmax[i], sizeof(test.h)));
+ }
+}
+
#undef __
diff --git a/test/cctest/test-microtask-delivery.cc b/test/cctest/test-microtask-delivery.cc
index ecec77f..3150ab8 100644
--- a/test/cctest/test-microtask-delivery.cc
+++ b/test/cctest/test-microtask-delivery.cc
@@ -105,7 +105,7 @@
HarmonyIsolate isolate;
v8::HandleScope scope(isolate.GetIsolate());
LocalContext context1(isolate.GetIsolate());
- isolate.GetIsolate()->SetAutorunMicrotasks(false);
+ isolate.GetIsolate()->SetMicrotasksPolicy(v8::MicrotasksPolicy::kExplicit);
CompileRun(
"var obj = { calls: 0 };");
v8::Local<v8::Value> obj = CompileRun("obj");
diff --git a/test/cctest/test-object-observe.cc b/test/cctest/test-object-observe.cc
index 5164b87..f17b8c0 100644
--- a/test/cctest/test-object-observe.cc
+++ b/test/cctest/test-object-observe.cc
@@ -491,16 +491,17 @@
i::Isolate* i_isolate = CcTest::i_isolate();
i::Handle<i::JSObject> observation_state =
i_isolate->factory()->observation_state();
- i::Handle<i::JSWeakMap> callbackInfoMap =
- i::Handle<i::JSWeakMap>::cast(i::Object::GetProperty(
- i_isolate, observation_state, "callbackInfoMap").ToHandleChecked());
- i::Handle<i::JSWeakMap> objectInfoMap =
- i::Handle<i::JSWeakMap>::cast(i::Object::GetProperty(
- i_isolate, observation_state, "objectInfoMap").ToHandleChecked());
- i::Handle<i::JSWeakMap> notifierObjectInfoMap =
- i::Handle<i::JSWeakMap>::cast(i::Object::GetProperty(
- i_isolate, observation_state, "notifierObjectInfoMap")
- .ToHandleChecked());
+ i::Handle<i::JSWeakMap> callbackInfoMap = i::Handle<i::JSWeakMap>::cast(
+ i::JSReceiver::GetProperty(i_isolate, observation_state,
+ "callbackInfoMap")
+ .ToHandleChecked());
+ i::Handle<i::JSWeakMap> objectInfoMap = i::Handle<i::JSWeakMap>::cast(
+ i::JSReceiver::GetProperty(i_isolate, observation_state, "objectInfoMap")
+ .ToHandleChecked());
+ i::Handle<i::JSWeakMap> notifierObjectInfoMap = i::Handle<i::JSWeakMap>::cast(
+ i::JSReceiver::GetProperty(i_isolate, observation_state,
+ "notifierObjectInfoMap")
+ .ToHandleChecked());
CHECK_EQ(1, NumberOfElements(callbackInfoMap));
CHECK_EQ(1, NumberOfElements(objectInfoMap));
CHECK_EQ(1, NumberOfElements(notifierObjectInfoMap));
diff --git a/test/cctest/test-parsing.cc b/test/cctest/test-parsing.cc
index b04fb94..ae278d8 100644
--- a/test/cctest/test-parsing.cc
+++ b/test/cctest/test-parsing.cc
@@ -153,7 +153,7 @@
i::CompleteParserRecorder log;
i::Scanner scanner(CcTest::i_isolate()->unicode_cache());
scanner.Initialize(&stream);
- i::Zone zone;
+ i::Zone zone(CcTest::i_isolate()->allocator());
i::AstValueFactory ast_value_factory(
&zone, CcTest::i_isolate()->heap()->HashSeed());
i::PreParser preparser(&zone, &scanner, &ast_value_factory, &log,
@@ -171,7 +171,7 @@
i::CompleteParserRecorder log;
i::Scanner scanner(CcTest::i_isolate()->unicode_cache());
scanner.Initialize(&stream);
- i::Zone zone;
+ i::Zone zone(CcTest::i_isolate()->allocator());
i::AstValueFactory ast_value_factory(
&zone, CcTest::i_isolate()->heap()->HashSeed());
i::PreParser preparser(&zone, &scanner, &ast_value_factory, &log,
@@ -200,6 +200,9 @@
TEST(UsingCachedData) {
+ // Producing cached parser data while parsing eagerly is not supported.
+ if (!i::FLAG_lazy || (i::FLAG_ignition && i::FLAG_ignition_eager)) return;
+
v8::Isolate* isolate = CcTest::isolate();
v8::HandleScope handles(isolate);
v8::Local<v8::Context> context = v8::Context::New(isolate);
@@ -250,6 +253,9 @@
TEST(PreparseFunctionDataIsUsed) {
+ // Producing cached parser data while parsing eagerly is not supported.
+ if (!i::FLAG_lazy || (i::FLAG_ignition && i::FLAG_ignition_eager)) return;
+
// This tests that we actually do use the function data generated by the
// preparser.
@@ -326,7 +332,7 @@
i::Scanner scanner(CcTest::i_isolate()->unicode_cache());
scanner.Initialize(&stream);
- i::Zone zone;
+ i::Zone zone(CcTest::i_isolate()->allocator());
i::AstValueFactory ast_value_factory(
&zone, CcTest::i_isolate()->heap()->HashSeed());
i::PreParser preparser(&zone, &scanner, &ast_value_factory, &log,
@@ -363,7 +369,7 @@
scanner.Initialize(&stream);
// Preparser defaults to disallowing natives syntax.
- i::Zone zone;
+ i::Zone zone(CcTest::i_isolate()->allocator());
i::AstValueFactory ast_value_factory(
&zone, CcTest::i_isolate()->heap()->HashSeed());
i::PreParser preparser(&zone, &scanner, &ast_value_factory, &log,
@@ -432,7 +438,7 @@
i::CompleteParserRecorder log;
i::Scanner scanner(CcTest::i_isolate()->unicode_cache());
scanner.Initialize(&stream);
- i::Zone zone;
+ i::Zone zone(CcTest::i_isolate()->allocator());
i::AstValueFactory ast_value_factory(&zone,
CcTest::i_isolate()->heap()->HashSeed());
i::PreParser preparser(&zone, &scanner, &ast_value_factory, &log,
@@ -467,7 +473,7 @@
i::CompleteParserRecorder log;
i::Scanner scanner(CcTest::i_isolate()->unicode_cache());
scanner.Initialize(&stream);
- i::Zone zone;
+ i::Zone zone(CcTest::i_isolate()->allocator());
i::AstValueFactory ast_value_factory(&zone,
CcTest::i_isolate()->heap()->HashSeed());
i::PreParser preparser(&zone, &scanner, &ast_value_factory, &log,
@@ -520,7 +526,7 @@
i::Scanner scanner(CcTest::i_isolate()->unicode_cache());
scanner.Initialize(&stream);
- i::Zone zone;
+ i::Zone zone(CcTest::i_isolate()->allocator());
i::AstValueFactory ast_value_factory(&zone,
CcTest::i_isolate()->heap()->HashSeed());
i::PreParser preparser(&zone, &scanner, &ast_value_factory, &log,
@@ -837,7 +843,7 @@
CHECK(start == i::Token::DIV || start == i::Token::ASSIGN_DIV);
CHECK(scanner.ScanRegExpPattern(start == i::Token::ASSIGN_DIV));
scanner.Next(); // Current token is now the regexp literal.
- i::Zone zone;
+ i::Zone zone(CcTest::i_isolate()->allocator());
i::AstValueFactory ast_value_factory(&zone,
CcTest::i_isolate()->heap()->HashSeed());
ast_value_factory.Internalize(CcTest::i_isolate());
@@ -1061,7 +1067,7 @@
factory->NewStringFromUtf8(i::CStrVector(program.start()))
.ToHandleChecked();
i::Handle<i::Script> script = factory->NewScript(source);
- i::Zone zone;
+ i::Zone zone(CcTest::i_isolate()->allocator());
i::ParseInfo info(&zone, script);
i::Parser parser(&info);
parser.set_allow_harmony_sloppy(true);
@@ -1379,7 +1385,7 @@
i::CStrVector(program.start())).ToHandleChecked();
CHECK_EQ(source->length(), kProgramSize);
i::Handle<i::Script> script = factory->NewScript(source);
- i::Zone zone;
+ i::Zone zone(CcTest::i_isolate()->allocator());
i::ParseInfo info(&zone, script);
i::Parser parser(&info);
parser.set_allow_lazy(true);
@@ -1428,7 +1434,7 @@
i::Handle<i::String> source_code =
factory->NewStringFromUtf8(i::CStrVector(source)).ToHandleChecked();
i::Handle<i::Script> script = factory->NewScript(source_code);
- i::Zone zone;
+ i::Zone zone(CcTest::i_isolate()->allocator());
i::ParseInfo info(&zone, script);
info.set_allow_lazy_parsing();
i::Parser parser(&info);
@@ -1503,15 +1509,12 @@
enum ParserFlag {
kAllowLazy,
kAllowNatives,
- kAllowHarmonyDefaultParameters,
kAllowHarmonySloppy,
kAllowHarmonySloppyLet,
- kAllowHarmonyDestructuring,
- kAllowHarmonyDestructuringAssignment,
kAllowHarmonyNewTarget,
- kAllowStrongMode,
- kNoLegacyConst,
- kAllowHarmonyFunctionSent
+ kAllowHarmonyFunctionSent,
+ kAllowHarmonyRestrictiveDeclarations,
+ kAllowHarmonyExponentiationOperator
};
enum ParserSyncTestResult {
@@ -1525,18 +1528,14 @@
i::EnumSet<ParserFlag> flags) {
parser->set_allow_lazy(flags.Contains(kAllowLazy));
parser->set_allow_natives(flags.Contains(kAllowNatives));
- parser->set_allow_harmony_default_parameters(
- flags.Contains(kAllowHarmonyDefaultParameters));
parser->set_allow_harmony_sloppy(flags.Contains(kAllowHarmonySloppy));
parser->set_allow_harmony_sloppy_let(flags.Contains(kAllowHarmonySloppyLet));
- parser->set_allow_harmony_destructuring_bind(
- flags.Contains(kAllowHarmonyDestructuring));
- parser->set_allow_harmony_destructuring_assignment(
- flags.Contains(kAllowHarmonyDestructuringAssignment));
- parser->set_allow_strong_mode(flags.Contains(kAllowStrongMode));
- parser->set_allow_legacy_const(!flags.Contains(kNoLegacyConst));
parser->set_allow_harmony_function_sent(
flags.Contains(kAllowHarmonyFunctionSent));
+ parser->set_allow_harmony_restrictive_declarations(
+ flags.Contains(kAllowHarmonyRestrictiveDeclarations));
+ parser->set_allow_harmony_exponentiation_operator(
+ flags.Contains(kAllowHarmonyExponentiationOperator));
}
@@ -1557,7 +1556,7 @@
if (test_preparser) {
i::Scanner scanner(isolate->unicode_cache());
i::GenericStringUtf16CharacterStream stream(source, 0, source->length());
- i::Zone zone;
+ i::Zone zone(CcTest::i_isolate()->allocator());
i::AstValueFactory ast_value_factory(
&zone, CcTest::i_isolate()->heap()->HashSeed());
i::PreParser preparser(&zone, &scanner, &ast_value_factory, &log,
@@ -1574,7 +1573,7 @@
i::FunctionLiteral* function;
{
i::Handle<i::Script> script = factory->NewScript(source);
- i::Zone zone;
+ i::Zone zone(CcTest::i_isolate()->allocator());
i::ParseInfo info(&zone, script);
i::Parser parser(&info);
SetParserFlags(&parser, flags);
@@ -1596,9 +1595,9 @@
CHECK(isolate->has_pending_exception());
i::Handle<i::JSObject> exception_handle(
i::JSObject::cast(isolate->pending_exception()));
- i::Handle<i::String> message_string =
- i::Handle<i::String>::cast(i::Object::GetProperty(
- isolate, exception_handle, "message").ToHandleChecked());
+ i::Handle<i::String> message_string = i::Handle<i::String>::cast(
+ i::JSReceiver::GetProperty(isolate, exception_handle, "message")
+ .ToHandleChecked());
if (result == kSuccess) {
v8::base::OS::Print(
@@ -1910,12 +1909,9 @@
int always_true_len = 0,
const ParserFlag* always_false_flags = NULL,
int always_false_len = 0) {
- bool flag = i::FLAG_harmony_modules;
- i::FLAG_harmony_modules = true;
RunParserSyncTest(context_data, statement_data, result, flags, flags_len,
always_true_flags, always_true_len, always_false_flags,
always_false_len, true);
- i::FLAG_harmony_modules = flag;
}
@@ -1926,9 +1922,7 @@
// isn't.
const char* context_data[][2] = {
{"\"use strict\";", ""},
- {"\"use strong\";", ""},
{"var eval; function test_func() {\"use strict\"; ", "}"},
- {"var eval; function test_func() {\"use strong\"; ", "}"},
{NULL, NULL}};
const char* statement_data[] = {
@@ -1959,9 +1953,7 @@
NULL
};
- static const ParserFlag always_flags[] = {kAllowStrongMode};
- RunParserSyncTest(context_data, statement_data, kError, NULL, 0, always_flags,
- arraysize(always_flags));
+ RunParserSyncTest(context_data, statement_data, kError);
}
@@ -2068,8 +2060,6 @@
const char* context_data[][2] = {
{"function test_func() {\"use strict\"; ", "}"},
{"() => { \"use strict\"; ", "}"},
- {"function test_func() {\"use strong\"; ", "}"},
- {"() => { \"use strong\"; ", "}"},
{NULL, NULL}};
const char* statement_data[] {
@@ -2077,11 +2067,7 @@
NULL
};
- static const ParserFlag always_flags[] = {kAllowStrongMode};
- RunParserSyncTest(context_data, statement_data, kError, NULL, 0, always_flags,
- arraysize(always_flags));
- RunParserSyncTest(context_data, statement_data, kError, NULL, 0, always_flags,
- arraysize(always_flags));
+ RunParserSyncTest(context_data, statement_data, kError);
}
@@ -2258,13 +2244,6 @@
{"\"use strict\"; (function not_gen() {", "})"},
{"\"use strict\"; (function * gen() { (function not_gen() {", "}) })"},
{"() => {\"use strict\"; ", "}"},
- {"\"use strong\";", ""},
- {"\"use strong\"; function not_gen() {", "}"},
- {"function test_func() {\"use strong\"; ", "}"},
- {"\"use strong\"; function * gen() { function not_gen() {", "} }"},
- {"\"use strong\"; (function not_gen() {", "})"},
- {"\"use strong\"; (function * gen() { (function not_gen() {", "}) })"},
- {"() => {\"use strong\"; ", "}"},
{NULL, NULL}};
const char* statement_data[] = {
@@ -2285,9 +2264,7 @@
NULL
};
- static const ParserFlag always_flags[] = {kAllowStrongMode};
- RunParserSyncTest(context_data, statement_data, kError, NULL, 0, always_flags,
- arraysize(always_flags));
+ RunParserSyncTest(context_data, statement_data, kError);
}
@@ -2364,13 +2341,16 @@
"(yield) \n ? yield : yield",
// If there is a newline before the next token, we don't look for RHS.
"yield\nfor (;;) {}",
+ "x = class extends (yield) {}",
+ "x = class extends f(yield) {}",
+ "x = class extends (null, yield) { }",
+ "x = class extends (a ? null : yield) { }",
NULL
};
// clang-format on
- static const ParserFlag always_flags[] = {
- kAllowHarmonyDestructuringAssignment};
- RunParserSyncTest(context_data, statement_data, kSuccess, nullptr, 0,
+ static const ParserFlag always_flags[] = {kAllowHarmonySloppy};
+ RunParserSyncTest(context_data, statement_data, kSuccess, NULL, 0,
always_flags, arraysize(always_flags));
}
@@ -2427,6 +2407,7 @@
"var {foo: yield 24} = {a: 42};",
"[yield 24] = [42];",
"({a: yield 24} = {a: 42});",
+ "class C extends yield { }",
NULL
};
// clang-format on
@@ -2441,10 +2422,8 @@
const char* context_data[][2] = {
{ "function ", ""},
{ "\"use strict\"; function", ""},
- { "\"use strong\"; function", ""},
{ "function * ", ""},
{ "\"use strict\"; function * ", ""},
- { "\"use strong\"; function * ", ""},
{ NULL, NULL }
};
@@ -2459,9 +2438,7 @@
NULL
};
- static const ParserFlag always_flags[] = {kAllowStrongMode};
- RunParserSyncTest(context_data, statement_data, kError, NULL, 0, always_flags,
- arraysize(always_flags));
+ RunParserSyncTest(context_data, statement_data, kError);
}
@@ -2525,9 +2502,6 @@
{"\"use strict\";", ""},
{"function test_func() {\"use strict\"; ", "}"},
{"() => {\"use strict\"; ", "}"},
- {"\"use strong\";", ""},
- {"function test_func() {\"use strong\"; ", "}"},
- {"() => {\"use strong\"; ", "}"},
{NULL, NULL}};
#define LABELLED_WHILE(NAME) #NAME ": while (true) { break " #NAME "; }",
@@ -2538,9 +2512,7 @@
};
#undef LABELLED_WHILE
- static const ParserFlag always_flags[] = {kAllowStrongMode};
- RunParserSyncTest(context_data, statement_data, kError, NULL, 0, always_flags,
- arraysize(always_flags));
+ RunParserSyncTest(context_data, statement_data, kError);
}
@@ -2613,13 +2585,10 @@
const char* statement_data[] = {
"(\"use strict\"); var eval;",
- "(\"use strong\"); var eval;",
NULL
};
- static const ParserFlag always_flags[] = {kAllowStrongMode};
- RunParserSyncTest(context_data, statement_data, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
+ RunParserSyncTest(context_data, statement_data, kSuccess);
}
@@ -2700,7 +2669,7 @@
i::Handle<i::String> source =
factory->NewStringFromUtf8(i::CStrVector(program)).ToHandleChecked();
i::Handle<i::Script> script = factory->NewScript(source);
- i::Zone zone;
+ i::Zone zone(CcTest::i_isolate()->allocator());
i::ParseInfo info(&zone, script);
i::ScriptData* sd = NULL;
info.set_cached_data(&sd);
@@ -2747,7 +2716,6 @@
const char* strict_statement_data[] = {
"\"use strict\";",
- "\"use strong\";",
NULL
};
@@ -2756,11 +2724,8 @@
NULL
};
- static const ParserFlag always_flags[] = {kAllowStrongMode};
- RunParserSyncTest(context_data, strict_statement_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(context_data, non_strict_statement_data, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
+ RunParserSyncTest(context_data, strict_statement_data, kError);
+ RunParserSyncTest(context_data, non_strict_statement_data, kSuccess);
}
@@ -3028,11 +2993,6 @@
TEST(StrictDelete) {
// "delete <Identifier>" is not allowed in strict mode.
- const char* strong_context_data[][2] = {
- {"\"use strong\"; ", ""},
- { NULL, NULL }
- };
-
const char* strict_context_data[][2] = {
{"\"use strict\"; ", ""},
{ NULL, NULL }
@@ -3074,27 +3034,14 @@
NULL
};
- static const ParserFlag always_flags[] = {kAllowStrongMode};
- RunParserSyncTest(strong_context_data, sloppy_statement_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strict_context_data, sloppy_statement_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(sloppy_context_data, sloppy_statement_data, kSuccess, NULL,
- 0, always_flags, arraysize(always_flags));
+ RunParserSyncTest(strict_context_data, sloppy_statement_data, kError);
+ RunParserSyncTest(sloppy_context_data, sloppy_statement_data, kSuccess);
- RunParserSyncTest(strong_context_data, good_statement_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strict_context_data, good_statement_data, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(sloppy_context_data, good_statement_data, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
+ RunParserSyncTest(strict_context_data, good_statement_data, kSuccess);
+ RunParserSyncTest(sloppy_context_data, good_statement_data, kSuccess);
- RunParserSyncTest(strong_context_data, bad_statement_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strict_context_data, bad_statement_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(sloppy_context_data, bad_statement_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
+ RunParserSyncTest(strict_context_data, bad_statement_data, kError);
+ RunParserSyncTest(sloppy_context_data, bad_statement_data, kError);
}
@@ -3302,6 +3249,9 @@
TEST(RegressionLazyFunctionWithErrorWithArg) {
+ // Test only applies when lazy parsing.
+ if (!i::FLAG_lazy || (i::FLAG_ignition && i::FLAG_ignition_eager)) return;
+
// The bug occurred when a lazy function had an error which requires a
// parameter (such as "unknown label" here). The error message was processed
// before the AstValueFactory containing the error message string was
@@ -3345,7 +3295,7 @@
i::Handle<i::String> source = factory->InternalizeUtf8String(program.start());
source->PrintOn(stdout);
printf("\n");
- i::Zone zone;
+ i::Zone zone(CcTest::i_isolate()->allocator());
v8::Local<v8::Value> v = CompileRun(src);
i::Handle<i::Object> o = v8::Utils::OpenHandle(*v);
i::Handle<i::JSFunction> f = i::Handle<i::JSFunction>::cast(o);
@@ -3395,7 +3345,7 @@
i::Handle<i::String> source = factory->InternalizeUtf8String(program.start());
source->PrintOn(stdout);
printf("\n");
- i::Zone zone;
+ i::Zone zone(CcTest::i_isolate()->allocator());
v8::Local<v8::Value> v = CompileRun(src);
i::Handle<i::Object> o = v8::Utils::OpenHandle(*v);
i::Handle<i::JSFunction> f = i::Handle<i::JSFunction>::cast(o);
@@ -3539,7 +3489,7 @@
printf("\n");
i::Handle<i::Script> script = factory->NewScript(source);
- i::Zone zone;
+ i::Zone zone(CcTest::i_isolate()->allocator());
i::ParseInfo info(&zone, script);
i::Parser parser(&info);
CHECK(parser.Parse(&info));
@@ -3590,27 +3540,6 @@
}
-TEST(UseConstLegacyCount) {
- i::FLAG_legacy_const = true;
- i::Isolate* isolate = CcTest::i_isolate();
- i::HandleScope scope(isolate);
- LocalContext env;
- int use_counts[v8::Isolate::kUseCounterFeatureCount] = {};
- global_use_counts = use_counts;
- CcTest::isolate()->SetUseCounterCallback(MockUseCounterCallback);
- CompileRun(
- "const x = 1;\n"
- "var foo = 1;\n"
- "const y = 1;\n"
- "function bar() {\n"
- " const z = 1; var baz = 1;\n"
- " function q() { const k = 42; }\n"
- "}");
- // Optimizing will double-count because the source is parsed twice.
- CHECK_EQ(i::FLAG_always_opt ? 8 : 4, use_counts[v8::Isolate::kLegacyConst]);
-}
-
-
TEST(StrictModeUseCount) {
i::Isolate* isolate = CcTest::i_isolate();
i::HandleScope scope(isolate);
@@ -3794,20 +3723,11 @@
"(-a, b) => {}",
"(a, -b) => {}",
"{} => {}",
- "({}) => {}",
- "(a, {}) => {}",
- "({}, a) => {}",
"a++ => {}",
"(a++) => {}",
"(a++, b) => {}",
"(a, b++) => {}",
"[] => {}",
- "([]) => {}",
- "(a, []) => {}",
- "([], a) => {}",
- "(a = b) => {}",
- "(a = b, c) => {}",
- "(a, b = c) => {}",
"(foo ? bar : baz) => {}",
"(a, foo ? bar : baz) => {}",
"(foo ? bar : baz, a) => {}",
@@ -3841,6 +3761,7 @@
TEST(NoErrorsArrowFunctions) {
// Tests that parser and preparser accept valid arrow functions syntax.
+ // clang-format off
const char* context_data[][2] = {
{"", ";"},
{"bar ? (", ") : baz;"},
@@ -3886,6 +3807,15 @@
"foo ? bar : baz => {}",
// Arrows with non-simple parameters.
+ "({}) => {}",
+ "(a, {}) => {}",
+ "({}, a) => {}",
+ "([]) => {}",
+ "(a, []) => {}",
+ "([], a) => {}",
+ "(a = b) => {}",
+ "(a = b, c) => {}",
+ "(a, b = c) => {}",
"({a}) => {}",
"(x = 9) => {}",
"(x, y = 9) => {}",
@@ -3897,18 +3827,15 @@
"(x = 9, ...a) => {}",
"(x, y = 9, ...a) => {}",
"(x, y = 9, {b}, z = 8, ...a) => {}",
- // TODO(wingo, rossberg): This is not accepted right now.
- // "({a} = {}) => {}",
- // "([x] = []) => {}",
+ "({a} = {}) => {}",
+ "([x] = []) => {}",
"({a = 42}) => {}",
"([x = 0]) => {}",
NULL
};
+ // clang-format on
- static const ParserFlag always_flags[] = {kAllowHarmonyDefaultParameters,
- kAllowHarmonyDestructuring};
- RunParserSyncTest(context_data, statement_data, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
+ RunParserSyncTest(context_data, statement_data, kSuccess);
static const ParserFlag flags[] = {kAllowLazy};
// In a context where a concise arrow body is parsed with [~In] variant,
@@ -3922,15 +3849,6 @@
TEST(ArrowFunctionsSloppyParameterNames) {
- const char* strong_context_data[][2] = {
- {"'use strong'; ", ";"},
- {"'use strong'; bar ? (", ") : baz;"},
- {"'use strong'; bar ? baz : (", ");"},
- {"'use strong'; bar, ", ";"},
- {"'use strong'; ", ", bar;"},
- {NULL, NULL}
- };
-
const char* strict_context_data[][2] = {
{"'use strict'; ", ";"},
{"'use strict'; bar ? (", ") : baz;"},
@@ -3970,13 +3888,8 @@
NULL
};
- static const ParserFlag always_flags[] = {kAllowStrongMode};
- RunParserSyncTest(strong_context_data, statement_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strict_context_data, statement_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(sloppy_context_data, statement_data, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
+ RunParserSyncTest(strict_context_data, statement_data, kError);
+ RunParserSyncTest(sloppy_context_data, statement_data, kSuccess);
}
@@ -3987,13 +3900,11 @@
};
const char* strict_function_context_data[][2] = {
- {"(function f() {'use strong'; (", "); });"},
{"(function f() {'use strict'; (", "); });"},
{NULL, NULL}
};
const char* generator_context_data[][2] = {
- {"(function *g() {'use strong'; (", "); });"},
{"(function *g() {'use strict'; (", "); });"},
{"(function *g() { (", "); });"},
{NULL, NULL}
@@ -4011,14 +3922,9 @@
NULL
};
- static const ParserFlag always_flags[] = { kAllowHarmonyDestructuring,
- kAllowStrongMode};
- RunParserSyncTest(sloppy_function_context_data, arrow_data, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strict_function_context_data, arrow_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(generator_context_data, arrow_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
+ RunParserSyncTest(sloppy_function_context_data, arrow_data, kSuccess);
+ RunParserSyncTest(strict_function_context_data, arrow_data, kError);
+ RunParserSyncTest(generator_context_data, arrow_data, kError);
}
@@ -4963,8 +4869,8 @@
"for(let x in {}, {}) {}", "for(const x in {}, {}) {}",
NULL};
- static const ParserFlag always_flags[] = {
- kAllowHarmonySloppy, kAllowHarmonySloppyLet, kNoLegacyConst};
+ static const ParserFlag always_flags[] = {kAllowHarmonySloppy,
+ kAllowHarmonySloppyLet};
RunParserSyncTest(context_data, data, kSuccess, nullptr, 0, always_flags,
arraysize(always_flags));
}
@@ -5153,8 +5059,8 @@
"for(x of 'foo' in {}) {}", "for(var x of 'foo' in {}) {}",
"for(let x of 'foo' in {}) {}", "for(const x of 'foo' in {}) {}", NULL};
- static const ParserFlag always_flags[] = {
- kAllowHarmonySloppy, kAllowHarmonySloppyLet, kNoLegacyConst};
+ static const ParserFlag always_flags[] = {kAllowHarmonySloppy,
+ kAllowHarmonySloppyLet};
RunParserSyncTest(context_data, data, kSuccess, nullptr, 0, always_flags,
arraysize(always_flags));
}
@@ -5167,8 +5073,8 @@
"for(let x of yield) {}", "for(const x of yield) {}",
NULL};
- static const ParserFlag always_flags[] = {
- kAllowHarmonySloppy, kAllowHarmonySloppyLet, kNoLegacyConst};
+ static const ParserFlag always_flags[] = {kAllowHarmonySloppy,
+ kAllowHarmonySloppyLet};
RunParserSyncTest(context_data, data, kSuccess, nullptr, 0, always_flags,
arraysize(always_flags));
}
@@ -5185,8 +5091,8 @@
"function* g() { for(let x of yield) {} }",
"function* g() { for(const x of yield) {} }", NULL};
- static const ParserFlag always_flags[] = {
- kAllowHarmonySloppy, kAllowHarmonySloppyLet, kNoLegacyConst};
+ static const ParserFlag always_flags[] = {kAllowHarmonySloppy,
+ kAllowHarmonySloppyLet};
RunParserSyncTest(context_data, data, kSuccess, nullptr, 0, always_flags,
arraysize(always_flags));
}
@@ -5206,8 +5112,8 @@
"for(x of { y = 23 }) {}", "for(var x of { y = 23 }) {}",
"for(let x of { y = 23 }) {}", "for(const x of { y = 23 }) {}", NULL};
- static const ParserFlag always_flags[] = {
- kAllowHarmonySloppy, kAllowHarmonySloppyLet, kNoLegacyConst};
+ static const ParserFlag always_flags[] = {kAllowHarmonySloppy,
+ kAllowHarmonySloppyLet};
RunParserSyncTest(context_data, data, kError, nullptr, 0, always_flags,
arraysize(always_flags));
}
@@ -5445,9 +5351,7 @@
"...[]",
"...[...[a, b, ...c]]",
NULL};
- static const ParserFlag always_flags[] = {kAllowHarmonyDestructuring};
- RunParserSyncTest(context_data, data, kSuccess, nullptr, 0, always_flags,
- arraysize(always_flags));
+ RunParserSyncTest(context_data, data, kSuccess);
}
@@ -5668,8 +5572,6 @@
TEST(BasicImportExportParsing) {
- i::FLAG_harmony_modules = true;
-
// clang-format off
const char* kSources[] = {
"export let x = 0;",
@@ -5732,16 +5634,16 @@
// Show that parsing as a module works
{
i::Handle<i::Script> script = factory->NewScript(source);
- i::Zone zone;
+ i::Zone zone(CcTest::i_isolate()->allocator());
i::ParseInfo info(&zone, script);
i::Parser parser(&info);
info.set_module();
if (!parser.Parse(&info)) {
i::Handle<i::JSObject> exception_handle(
i::JSObject::cast(isolate->pending_exception()));
- i::Handle<i::String> message_string =
- i::Handle<i::String>::cast(i::Object::GetProperty(
- isolate, exception_handle, "message").ToHandleChecked());
+ i::Handle<i::String> message_string = i::Handle<i::String>::cast(
+ i::JSReceiver::GetProperty(isolate, exception_handle, "message")
+ .ToHandleChecked());
v8::base::OS::Print(
"Parser failed on:\n"
@@ -5757,7 +5659,7 @@
// And that parsing a script does not.
{
i::Handle<i::Script> script = factory->NewScript(source);
- i::Zone zone;
+ i::Zone zone(CcTest::i_isolate()->allocator());
i::ParseInfo info(&zone, script);
i::Parser parser(&info);
info.set_global();
@@ -5768,8 +5670,6 @@
TEST(ImportExportParsingErrors) {
- i::FLAG_harmony_modules = true;
-
// clang-format off
const char* kErrorSources[] = {
"export {",
@@ -5849,7 +5749,7 @@
factory->NewStringFromAsciiChecked(kErrorSources[i]);
i::Handle<i::Script> script = factory->NewScript(source);
- i::Zone zone;
+ i::Zone zone(CcTest::i_isolate()->allocator());
i::ParseInfo info(&zone, script);
i::Parser parser(&info);
info.set_module();
@@ -5859,8 +5759,6 @@
TEST(ModuleParsingInternals) {
- i::FLAG_harmony_modules = true;
-
i::Isolate* isolate = CcTest::i_isolate();
i::Factory* factory = isolate->factory();
v8::HandleScope handles(CcTest::isolate());
@@ -5879,7 +5777,7 @@
"import 'q.js'";
i::Handle<i::String> source = factory->NewStringFromAsciiChecked(kSource);
i::Handle<i::Script> script = factory->NewScript(source);
- i::Zone zone;
+ i::Zone zone(CcTest::i_isolate()->allocator());
i::ParseInfo info(&zone, script);
i::Parser parser(&info);
info.set_module();
@@ -5968,12 +5866,6 @@
{"'use strict'; for (;;)", ""},
{"'use strict'; for (x in y)", ""},
{"'use strict'; do ", " while (false)"},
- {"'use strong'; if (true)", ""},
- {"'use strong'; if (false) {} else", ""},
- {"'use strong'; while (false)", ""},
- {"'use strong'; for (;;)", ""},
- {"'use strong'; for (x in y)", ""},
- {"'use strong'; do ", " while (false)"},
{NULL, NULL}};
const char* statement_data[] = {
@@ -5982,9 +5874,7 @@
"class C {}",
NULL};
- static const ParserFlag always_flags[] = {kAllowStrongMode};
- RunParserSyncTest(context_data, statement_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
+ RunParserSyncTest(context_data, statement_data, kError);
}
@@ -6000,10 +5890,9 @@
i::Handle<i::Script> script =
factory->NewScript(factory->NewStringFromAsciiChecked(source));
- i::Zone zone;
+ i::Zone zone(CcTest::i_isolate()->allocator());
i::ParseInfo info(&zone, script);
i::Parser parser(&info);
- parser.set_allow_strong_mode(true);
info.set_global();
parser.Parse(&info);
CHECK(info.literal() != NULL);
@@ -6014,24 +5903,15 @@
TEST(LanguageModeDirectives) {
TestLanguageMode("\"use nothing\"", i::SLOPPY);
TestLanguageMode("\"use strict\"", i::STRICT);
- TestLanguageMode("\"use strong\"", i::STRONG);
TestLanguageMode("var x = 1; \"use strict\"", i::SLOPPY);
- TestLanguageMode("var x = 1; \"use strong\"", i::SLOPPY);
-
- // Test that multiple directives ("use strict" / "use strong") put the parser
- // into the correct mode.
- TestLanguageMode("\"use strict\"; \"use strong\";", i::STRONG);
- TestLanguageMode("\"use strong\"; \"use strict\";", i::STRONG);
TestLanguageMode("\"use some future directive\"; \"use strict\";", i::STRICT);
- TestLanguageMode("\"use some future directive\"; \"use strong\";", i::STRONG);
}
TEST(PropertyNameEvalArguments) {
const char* context_data[][2] = {{"'use strict';", ""},
- {"'use strong';", ""},
{NULL, NULL}};
const char* statement_data[] = {
@@ -6066,9 +5946,7 @@
NULL};
- static const ParserFlag always_flags[] = {kAllowStrongMode};
- RunParserSyncTest(context_data, statement_data, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
+ RunParserSyncTest(context_data, statement_data, kSuccess);
}
@@ -6078,10 +5956,6 @@
{"(function(", ") { 'use strict'; })();"},
{"'use strict'; function fn(", ") {}; fn();"},
{"function fn(", ") { 'use strict'; }; fn();"},
- {"'use strong';(function(", "){})();"},
- {"(function(", ") { 'use strong'; })();"},
- {"'use strong'; function fn(", ") {}; fn();"},
- {"function fn(", ") { 'use strong'; }; fn();"},
{NULL, NULL}};
const char* sloppy_context_data[][2] =
@@ -6099,451 +5973,8 @@
"a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, w",
NULL};
- static const ParserFlag always_flags[] = { kAllowStrongMode };
- RunParserSyncTest(strict_context_data, data, kError, NULL, 0, always_flags,
- arraysize(always_flags));
- RunParserSyncTest(sloppy_context_data, data, kSuccess, NULL, 0, NULL, 0);
-}
-
-
-TEST(VarForbiddenInStrongMode) {
- const char* strong_context_data[][2] =
- {{"'use strong'; ", ""},
- {"function f() {'use strong'; ", "}"},
- {"function f() {'use strong'; while (true) { ", "} }"},
- {NULL, NULL}};
-
- const char* strict_context_data[][2] =
- {{"'use strict'; ", ""},
- {"function f() {'use strict'; ", "}"},
- {"function f() {'use strict'; while (true) { ", "} }"},
- {NULL, NULL}};
-
- const char* sloppy_context_data[][2] =
- {{"", ""},
- {"function f() { ", "}"},
- {NULL, NULL}};
-
- const char* var_declarations[] = {
- "var x = 0;",
- "for (var i = 0; i < 10; i++) { }",
- NULL};
-
- const char* let_declarations[] = {
- "let x = 0;",
- "for (let i = 0; i < 10; i++) { }",
- NULL};
-
- const char* const_declarations[] = {
- "const x = 0;",
- NULL};
-
- static const ParserFlag always_flags[] = {kAllowStrongMode};
- RunParserSyncTest(strong_context_data, var_declarations, kError, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strong_context_data, let_declarations, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strong_context_data, const_declarations, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
-
- RunParserSyncTest(strict_context_data, var_declarations, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strict_context_data, let_declarations, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
-
- RunParserSyncTest(sloppy_context_data, var_declarations, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
- // At the moment, let declarations are only available in strict mode.
- RunParserSyncTest(sloppy_context_data, let_declarations, kError, NULL, 0,
- always_flags, arraysize(always_flags));
-}
-
-
-TEST(StrongEmptySubStatements) {
- const char* sloppy_context_data[][2] = {{"", ""}, {NULL}};
- const char* strict_context_data[][2] = {{"'use strict';", ""}, {NULL}};
- const char* strong_context_data[][2] = {{"'use strong';", ""}, {NULL}};
-
- const char* data_error[] = {
- "if (1);",
- "if (1) {} else;",
- "while (1);",
- "do; while (1);",
- "for (;;);",
- "for (x in []);",
- "for (x of []);",
- "for (const x = 0;;);",
- "for (const x in []);",
- "for (const x of []);",
- NULL};
-
- const char* data_success[] = {
- "if (1) {} else {}",
- "switch(1) {}",
- "1+1;;",
- "1+1; ;",
- NULL};
-
- static const ParserFlag always_flags[] = {
- kAllowStrongMode,
- };
- RunParserSyncTest(sloppy_context_data, data_error, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strict_context_data, data_error, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strong_context_data, data_error, kError, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strong_context_data, data_success, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
-}
-
-
-TEST(StrongForIn) {
- const char* sloppy_context_data[][2] = {{"", ""}, {NULL}};
- const char* strict_context_data[][2] = {{"'use strict';", ""}, {NULL}};
- const char* strong_context_data[][2] = {{"'use strong';", ""}, {NULL}};
-
- const char* data[] = {
- "for (x in []) {}",
- "for (const x in []) {}",
- NULL};
-
- static const ParserFlag always_flags[] = {
- kAllowStrongMode,
- };
- RunParserSyncTest(sloppy_context_data, data, kSuccess, NULL, 0, always_flags,
- arraysize(always_flags));
- RunParserSyncTest(strict_context_data, data, kSuccess, NULL, 0, always_flags,
- arraysize(always_flags));
- RunParserSyncTest(strong_context_data, data, kError, NULL, 0, always_flags,
- arraysize(always_flags));
-}
-
-
-TEST(StrongConstructorThis) {
- const char* sloppy_context_data[][2] = {{"", ""}, {NULL}};
- const char* strict_context_data[][2] = {{"'use strict';", ""}, {NULL}};
- const char* strong_context_data[][2] = {{"'use strong';", ""}, {NULL}};
-
- const char* error_data[] = {
- "class C { constructor() { this; } }",
- "class C { constructor() { this.a; } }",
- "class C { constructor() { this['a']; } }",
- "class C { constructor() { (this); } }",
- "class C { constructor() { this(); } }",
- // TODO(rossberg): arrow functions not handled yet.
- // "class C { constructor() { () => this; } }",
- "class C { constructor() { this.a = 0, 0; } }",
- "class C { constructor() { (this.a = 0); } }",
- // "class C { constructor() { (() => this.a = 0)(); } }",
- "class C { constructor() { { this.a = 0; } } }",
- "class C { constructor() { if (1) this.a = 0; } }",
- "class C { constructor() { label: this.a = 0; } }",
- "class C { constructor() { this.a = this.b; } }",
- "class C { constructor() { this.a = {b: 1}; this.a.b } }",
- "class C { constructor() { this.a = {b: 1}; this.a.b = 0 } }",
- "class C { constructor() { this.a = function(){}; this.a() } }",
- NULL};
-
- const char* success_data[] = {
- "class C { constructor() { this.a = 0; } }",
- "class C { constructor() { label: 0; this.a = 0; this.b = 6; } }",
- NULL};
-
- static const ParserFlag always_flags[] = {kAllowStrongMode};
- RunParserSyncTest(sloppy_context_data, error_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strict_context_data, error_data, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strong_context_data, error_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
-
- RunParserSyncTest(sloppy_context_data, success_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strict_context_data, success_data, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strong_context_data, success_data, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
-}
-
-
-TEST(StrongConstructorSuper) {
- const char* sloppy_context_data[][2] = {{"", ""}, {NULL}};
- const char* strict_context_data[][2] = {{"'use strict';", ""}, {NULL}};
- const char* strong_context_data[][2] = {{"'use strong';", ""}, {NULL}};
-
- const char* error_data[] = {
- "class C extends Object { constructor() {} }",
- "class C extends Object { constructor() { super.a; } }",
- "class C extends Object { constructor() { super['a']; } }",
- "class C extends Object { constructor() { super.a = 0; } }",
- "class C extends Object { constructor() { (super.a); } }",
- // TODO(rossberg): arrow functions do not handle super yet.
- // "class C extends Object { constructor() { () => super.a; } }",
- "class C extends Object { constructor() { super(), 0; } }",
- "class C extends Object { constructor() { (super()); } }",
- // "class C extends Object { constructor() { (() => super())(); } }",
- "class C extends Object { constructor() { { super(); } } }",
- "class C extends Object { constructor() { if (1) super(); } }",
- "class C extends Object { constructor() { label: super(); } }",
- "class C extends Object { constructor() { super(), super(); } }",
- "class C extends Object { constructor() { super(); super(); } }",
- "class C extends Object { constructor() { super(); (super()); } }",
- "class C extends Object { constructor() { super(); { super() } } }",
- "class C extends Object { constructor() { this.a = 0, super(); } }",
- "class C extends Object { constructor() { this.a = 0; super(); } }",
- "class C extends Object { constructor() { super(this.a = 0); } }",
- "class C extends Object { constructor() { super().a; } }",
- NULL};
-
- const char* success_data[] = {
- "class C extends Object { constructor() { super(); } }",
- "class C extends Object { constructor() { label: 66; super(); } }",
- "class C extends Object { constructor() { super(3); this.x = 0; } }",
- "class C extends Object { constructor() { 3; super(3); this.x = 0; } }",
- NULL};
-
- static const ParserFlag always_flags[] = {kAllowStrongMode};
- RunParserSyncTest(sloppy_context_data, error_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strict_context_data, error_data, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strong_context_data, error_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
-
- RunParserSyncTest(sloppy_context_data, success_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strict_context_data, success_data, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strong_context_data, success_data, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
-}
-
-
-TEST(StrongConstructorReturns) {
- const char* sloppy_context_data[][2] = {{"", ""}, {NULL}};
- const char* strict_context_data[][2] = {{"'use strict';", ""}, {NULL}};
- const char* strong_context_data[][2] = {{"'use strong';", ""}, {NULL}};
-
- const char* error_data[] = {
- "class C extends Object { constructor() { super(); return {}; } }",
- "class C extends Object { constructor() { super(); { return {}; } } }",
- "class C extends Object { constructor() { super(); if (1) return {}; } }",
- "class C extends Object { constructor() { return; super(); } }",
- "class C extends Object { constructor() { { return; } super(); } }",
- "class C extends Object { constructor() { if (0) return; super(); } }",
- "class C { constructor() { return; this.a = 0; } }",
- "class C { constructor() { { return; } this.a = 0; } }",
- "class C { constructor() { if (0) return; this.a = 0; } }",
- "class C { constructor() { this.a = 0; if (0) return; this.b = 0; } }",
- NULL};
-
- const char* success_data[] = {
- "class C extends Object { constructor() { super(); return; } }",
- "class C extends Object { constructor() { super(); { return } } }",
- "class C extends Object { constructor() { super(); if (1) return; } }",
- "class C { constructor() { this.a = 0; return; } }",
- "class C { constructor() { this.a = 0; { return; } } }",
- "class C { constructor() { this.a = 0; if (0) return; 65; } }",
- "class C extends Array { constructor() { super(); this.a = 9; return } }",
- NULL};
-
- static const ParserFlag always_flags[] = {kAllowStrongMode};
- RunParserSyncTest(sloppy_context_data, error_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strict_context_data, error_data, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strong_context_data, error_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
-
- RunParserSyncTest(sloppy_context_data, success_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strict_context_data, success_data, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strong_context_data, success_data, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
-}
-
-
-TEST(StrongConstructorDirective) {
- const char* context_data[][2] = {{"class c { ", " }"},
- {"(class c { ", " });"},
- {"let a = (class c { ", " });"},
- {NULL}};
-
- const char* error_data[] = {
- "constructor() { \"use strong\" }",
- "constructor(...rest) { \"use strong\" }",
- "foo() {} constructor() { \"use strong\" }",
- "foo(...rest) { \"use strict\" } constructor() { \"use strong\" }", NULL};
-
- const char* success_data[] = {
- "constructor() { \"use strict\" }", "foo() { \"use strong\" }",
- "foo() { \"use strong\" } constructor() {}", NULL};
-
- static const ParserFlag always_flags[] = {
- kAllowHarmonySloppy, kAllowHarmonySloppyLet, kAllowStrongMode};
-
- RunParserSyncTest(context_data, error_data, kError, NULL, 0, always_flags,
- arraysize(always_flags));
- RunParserSyncTest(context_data, success_data, kSuccess, NULL, 0, always_flags,
- arraysize(always_flags));
-}
-
-
-TEST(StrongUndefinedLocal) {
- const char* context_data[][2] = {{"", ""}, {NULL}};
-
- const char* data[] = {
- "function undefined() {'use strong';}",
- "function* undefined() {'use strong';}",
- "(function undefined() {'use strong';});",
- "{foo: (function undefined(){'use strong';})};",
- "(function* undefined() {'use strong';})",
- "{foo: (function* undefined(){'use strong';})};",
- "function foo(a, b, undefined, c, d) {'use strong';}",
- "function* foo(a, b, undefined, c, d) {'use strong';}",
- "(function foo(a, b, undefined, c, d) {'use strong';})",
- "{foo: (function foo(a, b, undefined, c, d) {'use strong';})};",
- "(function* foo(a, b, undefined, c, d) {'use strong';})",
- "{foo: (function* foo(a, b, undefined, c, d) {'use strong';})};",
- "class C { foo(a, b, undefined, c, d) {'use strong';} }",
- "class C { *foo(a, b, undefined, c, d) {'use strong';} }",
- "({ foo(a, b, undefined, c, d) {'use strong';} });",
- "{ *foo(a, b, undefined, c, d) {'use strong';} });",
- "class undefined {'use strong'}",
- "(class undefined {'use strong'});",
- NULL};
-
- static const ParserFlag always_flags[] = {
- kAllowStrongMode, kAllowHarmonySloppy
- };
-
- RunParserSyncTest(context_data, data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
-}
-
-
-TEST(StrongUndefinedArrow) {
- const char* sloppy_context_data[][2] = {{"", ""}, {NULL}};
- const char* strict_context_data[][2] = {{"'use strict';", ""}, {NULL}};
- const char* strong_context_data[][2] = {{"'use strong';", ""}, {NULL}};
-
- const char* data[] = {
- "(undefined => {return});",
- "((undefined, b, c) => {return});",
- "((a, undefined, c) => {return});",
- "((a, b, undefined) => {return});",
- NULL};
-
- const char* local_strong[] = {
- "(undefined => {'use strong';});",
- "((undefined, b, c) => {'use strong';});",
- "((a, undefined, c) => {'use strong';});",
- "((a, b, undefined) => {'use strong';});",
- NULL};
-
- static const ParserFlag always_flags[] = {kAllowStrongMode};
- RunParserSyncTest(sloppy_context_data, data, kSuccess, NULL, 0, always_flags,
- arraysize(always_flags));
- RunParserSyncTest(strict_context_data, data, kSuccess, NULL, 0, always_flags,
- arraysize(always_flags));
- RunParserSyncTest(strong_context_data, data, kError, NULL, 0, always_flags,
- arraysize(always_flags));
- RunParserSyncTest(sloppy_context_data, local_strong, kError, NULL, 0,
- always_flags, arraysize(always_flags));
-}
-
-
-TEST(StrongDirectEval) {
- const char* sloppy_context_data[][2] = {{"", ""}, {NULL}};
- const char* strong_context_data[][2] = {{"'use strong';", ""}, {NULL}};
-
- const char* error_data[] = {
- "eval();",
- "eval([]);",
- "(eval)();",
- "(((eval)))();",
- "eval('function f() {}');",
- "function f() {eval()}",
- NULL};
-
- const char* success_data[] = {
- "eval;",
- "eval`foo`;",
- "let foo = eval; foo();",
- "(1, eval)();",
- NULL};
-
- static const ParserFlag always_flags[] = {
- kAllowStrongMode
- };
-
- RunParserSyncTest(sloppy_context_data, error_data, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strong_context_data, error_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strong_context_data, success_data, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
-}
-
-
-TEST(StrongSwitchFallthrough) {
- const char* sloppy_context_data[][2] = {
- {"function f() { foo:for(;;) { switch(1) {", "};}}"},
- {NULL, NULL}
- };
- const char* strong_context_data[][2] = {
- {"function f() { 'use strong'; foo:for(;;) { switch(1) {", "};}}"},
- {NULL, NULL}
- };
-
- const char* data_success[] = {
- "",
- "case 1:",
- "case 1: case 2:",
- "case 1: break;",
- "default: throw new TypeError();",
- "case 1: case 2: null",
- "case 1: case 2: default: 1+1",
- "case 1: break; case 2: return; default:",
- "case 1: break foo; case 2: return; default:",
- "case 1: case 2: break; case 3: continue; case 4: default:",
- "case 1: case 2: break; case 3: continue foo; case 4: default:",
- "case 1: case 2: {{return;}} case 3: default:",
- "case 1: case 2: case 3: default: {1+1;{continue;}}",
- "case 1: case 2: {1+1;{1+1;{continue;}}} case 3: default:",
- "case 1: if (1) break; else continue; case 2: case 3: default:",
- "case 1: case 2: if (1) {{break;}} else break; case 3: default:",
- "case 1: if (1) break; else {if (1) break; else break;} case 2: default:",
- "case 1: if (1) {if (1) break; else break;} else break; case 2: default:",
- NULL};
-
- const char* data_error[] = {
- "case 1: case 2: (function(){return}); default:",
- "case 1: 1+1; case 2:",
- "case 1: bar: break bar; case 2: break;",
- "case 1: bar:return; case 2:",
- "case 1: bar:{ continue;} case 2:",
- "case 1: break; case 2: bar:{ throw new TypeError() } default:",
- "case 1: case 2: { bar:{ { break;} } } default: break;",
- "case 1: if (1) break; else {}; case 2: default:",
- "case 1: case 2: if (1) break; default:",
- "case 1: case 2: if (1) break; else 0; default:",
- "case 1: case 2: if (1) 0; else break; default:",
- "case 1: case 2: case 3: if (1) {} default:",
- "case 1: bar:if (1) break; else continue; case 2: case 3: default:",
- NULL};
-
- static const ParserFlag always_flags[] = {
- kAllowStrongMode
- };
- RunParserSyncTest(strong_context_data, data_success, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(sloppy_context_data, data_error, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
- RunParserSyncTest(strong_context_data, data_error, kError, NULL, 0,
- always_flags, arraysize(always_flags));
+ RunParserSyncTest(strict_context_data, data, kError);
+ RunParserSyncTest(sloppy_context_data, data, kSuccess);
}
@@ -6563,108 +5994,7 @@
}
-TEST(StrongModeFreeVariablesDeclaredByPreviousScript) {
- i::FLAG_strong_mode = true;
- i::FLAG_legacy_const = true;
- v8::V8::Initialize();
- v8::HandleScope scope(CcTest::isolate());
- v8::Context::Scope context_scope(v8::Context::New(CcTest::isolate()));
- v8::TryCatch try_catch(CcTest::isolate());
-
- // Introduce a bunch of variables, in all language modes.
- const char* script1 =
- "var my_var1 = 0; \n"
- "function my_func1() { } \n"
- "const my_const1 = 0; \n";
- CompileRun(v8_str(script1));
- CHECK(!try_catch.HasCaught());
-
- const char* script2 =
- "\"use strict\"; \n"
- "let my_var2 = 0; \n"
- "function my_func2() { } \n"
- "const my_const2 = 0 \n";
- CompileRun(v8_str(script2));
- CHECK(!try_catch.HasCaught());
-
- const char* script3 =
- "\"use strong\"; \n"
- "let my_var3 = 0; \n"
- "function my_func3() { } \n"
- "const my_const3 = 0; \n";
- CompileRun(v8_str(script3));
- CHECK(!try_catch.HasCaught());
-
- // Sloppy eval introduces variables in the surrounding scope.
- const char* script4 =
- "eval('var my_var4 = 0;') \n"
- "eval('function my_func4() { }') \n"
- "eval('const my_const4 = 0;') \n";
- CompileRun(v8_str(script4));
- CHECK(!try_catch.HasCaught());
-
- // Test that referencing these variables work.
- const char* script5 =
- "\"use strong\"; \n"
- "my_var1; \n"
- "my_func1; \n"
- "my_const1; \n"
- "my_var2; \n"
- "my_func2; \n"
- "my_const2; \n"
- "my_var3; \n"
- "my_func3; \n"
- "my_const3; \n"
- "my_var4; \n"
- "my_func4; \n"
- "my_const4; \n";
- CompileRun(v8_str(script5));
- CHECK(!try_catch.HasCaught());
-}
-
-
-TEST(StrongModeFreeVariablesDeclaredByLanguage) {
- i::FLAG_strong_mode = true;
- v8::V8::Initialize();
- v8::HandleScope scope(CcTest::isolate());
- v8::Context::Scope context_scope(v8::Context::New(CcTest::isolate()));
- v8::TryCatch try_catch(CcTest::isolate());
-
- const char* script1 =
- "\"use strong\"; \n"
- "Math; \n"
- "RegExp; \n";
- CompileRun(v8_str(script1));
- CHECK(!try_catch.HasCaught());
-}
-
-
-TEST(StrongModeFreeVariablesDeclaredInGlobalPrototype) {
- i::FLAG_strong_mode = true;
- v8::V8::Initialize();
- v8::HandleScope scope(CcTest::isolate());
- v8::Context::Scope context_scope(v8::Context::New(CcTest::isolate()));
- v8::TryCatch try_catch(CcTest::isolate());
-
- const char* script1 = "this.__proto__.my_var = 0;\n";
- CompileRun(v8_str(script1));
- CHECK(!try_catch.HasCaught());
-
- const char* script2 =
- "\"use strong\"; \n"
- "my_var; \n";
- CompileRun(v8_str(script2));
- CHECK(!try_catch.HasCaught());
-}
-
-
-static const ParserFlag kAllDestructuringFlags[] = {
- kAllowHarmonyDestructuring, kAllowHarmonyDestructuringAssignment,
- kAllowHarmonyDefaultParameters};
-
TEST(DestructuringPositiveTests) {
- i::FLAG_harmony_destructuring_bind = true;
-
const char* context_data[][2] = {{"'use strict'; let ", " = {};"},
{"var ", " = {};"},
{"'use strict'; const ", " = {};"},
@@ -6715,18 +6045,11 @@
"[a,,...rest]",
NULL};
// clang-format on
- static const ParserFlag always_flags[] = {kAllowHarmonyDestructuring};
- RunParserSyncTest(context_data, data, kSuccess, NULL, 0, always_flags,
- arraysize(always_flags));
- RunParserSyncTest(context_data, data, kSuccess, NULL, 0,
- kAllDestructuringFlags, arraysize(kAllDestructuringFlags));
+ RunParserSyncTest(context_data, data, kSuccess);
}
TEST(DestructuringNegativeTests) {
- i::FLAG_harmony_destructuring_bind = true;
- static const ParserFlag always_flags[] = {kAllowHarmonyDestructuring};
-
{ // All modes.
const char* context_data[][2] = {{"'use strict'; let ", " = {};"},
{"var ", " = {};"},
@@ -6811,11 +6134,7 @@
"{ *method() {} }",
NULL};
// clang-format on
- RunParserSyncTest(context_data, data, kError, NULL, 0, always_flags,
- arraysize(always_flags));
- RunParserSyncTest(context_data, data, kError, NULL, 0,
- kAllDestructuringFlags,
- arraysize(kAllDestructuringFlags));
+ RunParserSyncTest(context_data, data, kError);
}
{ // All modes.
@@ -6834,11 +6153,7 @@
"() => x",
NULL};
// clang-format on
- RunParserSyncTest(context_data, data, kError, NULL, 0, always_flags,
- arraysize(always_flags));
- RunParserSyncTest(context_data, data, kError, NULL, 0,
- kAllDestructuringFlags,
- arraysize(kAllDestructuringFlags));
+ RunParserSyncTest(context_data, data, kError);
}
{ // Strict mode.
@@ -6857,11 +6172,7 @@
"{ x : private }",
NULL};
// clang-format on
- RunParserSyncTest(context_data, data, kError, NULL, 0, always_flags,
- arraysize(always_flags));
- RunParserSyncTest(context_data, data, kError, NULL, 0,
- kAllDestructuringFlags,
- arraysize(kAllDestructuringFlags));
+ RunParserSyncTest(context_data, data, kError);
}
{ // 'yield' in generators.
@@ -6878,11 +6189,7 @@
"{ x : yield }",
NULL};
// clang-format on
- RunParserSyncTest(context_data, data, kError, NULL, 0, always_flags,
- arraysize(always_flags));
- RunParserSyncTest(context_data, data, kError, NULL, 0,
- kAllDestructuringFlags,
- arraysize(kAllDestructuringFlags));
+ RunParserSyncTest(context_data, data, kError);
}
{ // Declaration-specific errors
@@ -6906,8 +6213,7 @@
"[ a ]",
NULL};
// clang-format on
- static const ParserFlag always_flags[] = {kAllowHarmonyDestructuring,
- kAllowHarmonySloppyLet};
+ static const ParserFlag always_flags[] = {kAllowHarmonySloppyLet};
RunParserSyncTest(context_data, data, kError, NULL, 0, always_flags,
arraysize(always_flags));
}
@@ -7080,14 +6386,9 @@
NULL};
// clang-format on
- static const ParserFlag always_flags[] = {
- kAllowHarmonyDestructuringAssignment, kAllowHarmonyDestructuring,
- kAllowHarmonyDefaultParameters};
- RunParserSyncTest(context_data, data, kSuccess, NULL, 0, always_flags,
- arraysize(always_flags));
+ RunParserSyncTest(context_data, data, kSuccess);
- RunParserSyncTest(mixed_assignments_context_data, data, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
+ RunParserSyncTest(mixed_assignments_context_data, data, kSuccess);
const char* empty_context_data[][2] = {
{"'use strict';", ""}, {"", ""}, {NULL, NULL}};
@@ -7108,8 +6409,7 @@
"var x; (({ x = 10 } = { x = 20 } = {}) => x)({})",
NULL,
};
- RunParserSyncTest(empty_context_data, ambiguity_data, kSuccess, NULL, 0,
- always_flags, arraysize(always_flags));
+ RunParserSyncTest(empty_context_data, ambiguity_data, kSuccess);
}
@@ -7208,11 +6508,7 @@
NULL};
// clang-format on
- static const ParserFlag always_flags[] = {
- kAllowHarmonyDestructuringAssignment, kAllowHarmonyDestructuring,
- kAllowHarmonyDefaultParameters};
- RunParserSyncTest(context_data, data, kError, NULL, 0, always_flags,
- arraysize(always_flags));
+ RunParserSyncTest(context_data, data, kError);
const char* empty_context_data[][2] = {
{"'use strict';", ""}, {"", ""}, {NULL, NULL}};
@@ -7237,8 +6533,7 @@
NULL,
};
- RunParserSyncTest(empty_context_data, ambiguity_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
+ RunParserSyncTest(empty_context_data, ambiguity_data, kError);
// Strict mode errors
const char* strict_context_data[][2] = {{"'use strict'; (", " = {})"},
@@ -7279,14 +6574,11 @@
"[ ...(arguments) = 0 ]",
NULL};
- RunParserSyncTest(strict_context_data, strict_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
+ RunParserSyncTest(strict_context_data, strict_data, kError);
}
TEST(DestructuringDisallowPatternsInForVarIn) {
- i::FLAG_harmony_destructuring_bind = true;
- static const ParserFlag always_flags[] = {kAllowHarmonyDestructuring};
const char* context_data[][2] = {
{"", ""}, {"function f() {", "}"}, {NULL, NULL}};
// clang-format off
@@ -7295,22 +6587,18 @@
"for (let x = {} of null);",
NULL};
// clang-format on
- RunParserSyncTest(context_data, error_data, kError, NULL, 0, always_flags,
- arraysize(always_flags));
+ RunParserSyncTest(context_data, error_data, kError);
// clang-format off
const char* success_data[] = {
"for (var x = {} in null);",
NULL};
// clang-format on
- RunParserSyncTest(context_data, success_data, kSuccess, NULL, 0, always_flags,
- arraysize(always_flags));
+ RunParserSyncTest(context_data, success_data, kSuccess);
}
TEST(DestructuringDuplicateParams) {
- i::FLAG_harmony_destructuring_bind = true;
- static const ParserFlag always_flags[] = {kAllowHarmonyDestructuring};
const char* context_data[][2] = {{"'use strict';", ""},
{"function outer() { 'use strict';", "}"},
{nullptr, nullptr}};
@@ -7329,14 +6617,11 @@
"function f(x, x, {a}) {}",
nullptr};
// clang-format on
- RunParserSyncTest(context_data, error_data, kError, NULL, 0, always_flags,
- arraysize(always_flags));
+ RunParserSyncTest(context_data, error_data, kError);
}
TEST(DestructuringDuplicateParamsSloppy) {
- i::FLAG_harmony_destructuring_bind = true;
- static const ParserFlag always_flags[] = {kAllowHarmonyDestructuring};
const char* context_data[][2] = {
{"", ""}, {"function outer() {", "}"}, {nullptr, nullptr}};
@@ -7350,14 +6635,11 @@
"function f(x, x, {a}) {}",
nullptr};
// clang-format on
- RunParserSyncTest(context_data, error_data, kError, NULL, 0, always_flags,
- arraysize(always_flags));
+ RunParserSyncTest(context_data, error_data, kError);
}
TEST(DestructuringDisallowPatternsInSingleParamArrows) {
- i::FLAG_harmony_destructuring_bind = true;
- static const ParserFlag always_flags[] = {kAllowHarmonyDestructuring};
const char* context_data[][2] = {{"'use strict';", ""},
{"function outer() { 'use strict';", "}"},
{"", ""},
@@ -7370,8 +6652,7 @@
"var f = {x,y} => {};",
nullptr};
// clang-format on
- RunParserSyncTest(context_data, error_data, kError, NULL, 0, always_flags,
- arraysize(always_flags));
+ RunParserSyncTest(context_data, error_data, kError);
}
@@ -7383,7 +6664,6 @@
};
const char* strict_function_context_data[][2] = {
- {"'use strong'; (function f(", ") { });"},
{"'use strict'; (function f(", ") { });"},
{NULL, NULL}
};
@@ -7394,15 +6674,16 @@
};
const char* strict_arrow_context_data[][2] = {
- {"'use strong'; ((", ")=>{});"},
{"'use strict'; ((", ")=>{});"},
{NULL, NULL}
};
const char* generator_context_data[][2] = {
- {"'use strong'; (function *g(", ") { });"},
{"'use strict'; (function *g(", ") { });"},
{"(function *g(", ") { });"},
+ // Arrow function within generator has the same rules.
+ {"'use strict'; (function *g() { (", ") => {} });"},
+ {"(function *g() { (", ") => {} });"},
{NULL, NULL}
};
@@ -7433,26 +6714,33 @@
NULL
};
+ // Because classes are always in strict mode, these are always errors.
+ const char* always_error_param_data[] = {
+ "x = class extends (yield) { }",
+ "x = class extends f(yield) { }",
+ "x = class extends (null, yield) { }",
+ "x = class extends (a ? null : yield) { }",
+ "[x] = [class extends (a ? null : yield) { }]",
+ "[x = class extends (a ? null : yield) { }]",
+ "[x = class extends (a ? null : yield) { }] = [null]",
+ "x = class { [yield]() { } }",
+ "x = class { static [yield]() { } }",
+ "x = class { [(yield, 1)]() { } }",
+ "x = class { [y = (yield, 1)]() { } }",
+ NULL
+ };
// clang-format on
- static const ParserFlag always_flags[] = {kAllowHarmonyDestructuring,
- kAllowHarmonyDefaultParameters,
- kAllowStrongMode};
- RunParserSyncTest(sloppy_function_context_data, parameter_data, kSuccess,
- NULL, 0, always_flags, arraysize(always_flags));
- RunParserSyncTest(sloppy_arrow_context_data, parameter_data, kSuccess, NULL,
- 0, always_flags, arraysize(always_flags));
+ RunParserSyncTest(sloppy_function_context_data, parameter_data, kSuccess);
+ RunParserSyncTest(sloppy_arrow_context_data, parameter_data, kSuccess);
- RunParserSyncTest(strict_function_context_data, parameter_data, kError, NULL,
- 0, always_flags, arraysize(always_flags));
- RunParserSyncTest(strict_arrow_context_data, parameter_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
+ RunParserSyncTest(strict_function_context_data, parameter_data, kError);
+ RunParserSyncTest(strict_arrow_context_data, parameter_data, kError);
- RunParserSyncTest(generator_context_data, parameter_data, kError, NULL, 0,
- always_flags, arraysize(always_flags));
+ RunParserSyncTest(generator_context_data, parameter_data, kError);
+ RunParserSyncTest(generator_context_data, always_error_param_data, kError);
}
-
TEST(SpreadArray) {
const char* context_data[][2] = {
{"'use strict';", ""}, {"", ""}, {NULL, NULL}};
@@ -7544,32 +6832,6 @@
}
-TEST(ConstLegacy) {
- // clang-format off
- const char* context_data[][2] = {
- {"", ""},
- {"{", "}"},
- {NULL, NULL}
- };
-
- const char* data[] = {
- "const x",
- "const x = 1",
- "for (const x = 1; x < 1; x++) {}",
- "for (const x in {}) {}",
- "for (const x of []) {}",
- NULL
- };
- // clang-format on
-
-
- static const ParserFlag always_flags[] = {kNoLegacyConst};
- RunParserSyncTest(context_data, data, kError, NULL, 0, always_flags,
- arraysize(always_flags));
- RunParserSyncTest(context_data, data, kSuccess);
-}
-
-
TEST(ConstSloppy) {
// clang-format off
const char* context_data[][2] = {
@@ -7586,8 +6848,7 @@
NULL
};
// clang-format on
- static const ParserFlag always_flags[] = {kAllowHarmonySloppy,
- kNoLegacyConst};
+ static const ParserFlag always_flags[] = {kAllowHarmonySloppy};
RunParserSyncTest(context_data, data, kSuccess, NULL, 0, always_flags,
arraysize(always_flags));
}
@@ -7623,59 +6884,24 @@
// TC39 deemed "use strict" directives to be an error when occurring in the
// body of a function with non-simple parameter list, on 29/7/2015.
// https://goo.gl/ueA7Ln
- //
- // In V8, this also applies to "use strong " directives.
const char* context_data[][2] = {
{"function f(", ") { 'use strict'; }"},
- {"function f(", ") { 'use strong'; }"},
{"function* g(", ") { 'use strict'; }"},
- {"function* g(", ") { 'use strong'; }"},
{"class c { foo(", ") { 'use strict' }"},
- {"class c { foo(", ") { 'use strong' }"},
{"var a = (", ") => { 'use strict'; }"},
- {"var a = (", ") => { 'use strong'; }"},
{"var o = { m(", ") { 'use strict'; }"},
- {"var o = { m(", ") { 'use strong'; }"},
{"var o = { *gm(", ") { 'use strict'; }"},
- {"var o = { *gm(", ") { 'use strong'; }"},
{"var c = { m(", ") { 'use strict'; }"},
- {"var c = { m(", ") { 'use strong'; }"},
{"var c = { *gm(", ") { 'use strict'; }"},
- {"var c = { *gm(", ") { 'use strong'; }"},
{"'use strict'; function f(", ") { 'use strict'; }"},
- {"'use strict'; function f(", ") { 'use strong'; }"},
{"'use strict'; function* g(", ") { 'use strict'; }"},
- {"'use strict'; function* g(", ") { 'use strong'; }"},
{"'use strict'; class c { foo(", ") { 'use strict' }"},
- {"'use strict'; class c { foo(", ") { 'use strong' }"},
{"'use strict'; var a = (", ") => { 'use strict'; }"},
- {"'use strict'; var a = (", ") => { 'use strong'; }"},
{"'use strict'; var o = { m(", ") { 'use strict'; }"},
- {"'use strict'; var o = { m(", ") { 'use strong'; }"},
{"'use strict'; var o = { *gm(", ") { 'use strict'; }"},
- {"'use strict'; var o = { *gm(", ") { 'use strong'; }"},
{"'use strict'; var c = { m(", ") { 'use strict'; }"},
- {"'use strict'; var c = { m(", ") { 'use strong'; }"},
{"'use strict'; var c = { *gm(", ") { 'use strict'; }"},
- {"'use strict'; var c = { *gm(", ") { 'use strong'; }"},
-
- {"'use strong'; function f(", ") { 'use strict'; }"},
- {"'use strong'; function f(", ") { 'use strong'; }"},
- {"'use strong'; function* g(", ") { 'use strict'; }"},
- {"'use strong'; function* g(", ") { 'use strong'; }"},
- {"'use strong'; class c { foo(", ") { 'use strict' }"},
- {"'use strong'; class c { foo(", ") { 'use strong' }"},
- {"'use strong'; var a = (", ") => { 'use strict'; }"},
- {"'use strong'; var a = (", ") => { 'use strong'; }"},
- {"'use strong'; var o = { m(", ") { 'use strict'; }"},
- {"'use strong'; var o = { m(", ") { 'use strong'; }"},
- {"'use strong'; var o = { *gm(", ") { 'use strict'; }"},
- {"'use strong'; var o = { *gm(", ") { 'use strong'; }"},
- {"'use strong'; var c = { m(", ") { 'use strict'; }"},
- {"'use strong'; var c = { m(", ") { 'use strong'; }"},
- {"'use strong'; var c = { *gm(", ") { 'use strict'; }"},
- {"'use strong'; var c = { *gm(", ") { 'use strong'; }"},
{NULL, NULL}};
@@ -7696,9 +6922,7 @@
"{ initializedBindingPattern } = { initializedBindingPattern: true }",
NULL};
- static const ParserFlag always_flags[] = {
- kAllowHarmonyDefaultParameters, kAllowHarmonyDestructuring,
- kAllowHarmonySloppy, kAllowStrongMode};
+ static const ParserFlag always_flags[] = {kAllowHarmonySloppy};
RunParserSyncTest(context_data, data, kError, NULL, 0, always_flags,
arraysize(always_flags));
}
@@ -7724,18 +6948,12 @@
"for (var [let] in {}) {}",
"var let",
"var [let] = []",
- "for (const let = 1; let < 1; let++) {}",
- "for (const let in {}) {}",
- "for (const [let] = 1; let < 1; let++) {}",
- "for (const [let] in {}) {}",
- "const let",
- "const [let] = []",
NULL
};
// clang-format on
- static const ParserFlag always_flags[] = {
- kAllowHarmonySloppy, kAllowHarmonySloppyLet, kAllowHarmonyDestructuring};
+ static const ParserFlag always_flags[] = {kAllowHarmonySloppy,
+ kAllowHarmonySloppyLet};
RunParserSyncTest(context_data, data, kSuccess, NULL, 0, always_flags,
arraysize(always_flags));
@@ -7771,9 +6989,8 @@
};
// clang-format on
- static const ParserFlag fail_flags[] = {
- kAllowHarmonySloppy, kAllowHarmonySloppyLet, kNoLegacyConst,
- kAllowHarmonyDestructuring};
+ static const ParserFlag fail_flags[] = {kAllowHarmonySloppy,
+ kAllowHarmonySloppyLet};
RunParserSyncTest(context_data, fail_data, kError, NULL, 0, fail_flags,
arraysize(fail_flags));
}
@@ -7875,8 +7092,7 @@
};
// clang-format on
- static const ParserFlag always_flags[] = {kAllowHarmonySloppy,
- kAllowHarmonyDestructuring};
+ static const ParserFlag always_flags[] = {kAllowHarmonySloppy};
RunParserSyncTest(sloppy_context_data, fail_data, kError, NULL, 0,
always_flags, arraysize(always_flags));
RunParserSyncTest(strict_context_data, fail_data, kError, NULL, 0,
@@ -7898,8 +7114,8 @@
RunParserSyncTest(strict_context_data, let_data, kError, NULL, 0,
always_flags, arraysize(always_flags));
- static const ParserFlag sloppy_let_flags[] = {
- kAllowHarmonySloppy, kAllowHarmonySloppyLet, kAllowHarmonyDestructuring};
+ static const ParserFlag sloppy_let_flags[] = {kAllowHarmonySloppy,
+ kAllowHarmonySloppyLet};
RunParserSyncTest(sloppy_context_data, let_data, kSuccess, NULL, 0,
sloppy_let_flags, arraysize(sloppy_let_flags));
@@ -7954,6 +7170,36 @@
RunParserSyncTest(context_data, error_data, kError, NULL, 0, NULL, 0);
}
+
+TEST(EscapeSequenceErrors) {
+ // clang-format off
+ const char* context_data[][2] = {
+ { "'", "'" },
+ { "\"", "\"" },
+ { "`", "`" },
+ { "`${'", "'}`" },
+ { "`${\"", "\"}`" },
+ { "`${`", "`}`" },
+ { "f(tag`", "`);" },
+ { NULL, NULL }
+ };
+ const char* error_data[] = {
+ "\\uABCG",
+ "\\u{ZZ}",
+ "\\u{FFZ}",
+ "\\u{FFFFFFFFFF }",
+ "\\u{110000}",
+ "\\u{110000",
+ "\\u{FFFD }",
+ "\\xZF",
+ NULL
+ };
+ // clang-format on
+
+ RunParserSyncTest(context_data, error_data, kError, NULL, 0, NULL, 0);
+}
+
+
TEST(FunctionSentErrors) {
// clang-format off
const char* context_data[][2] = {
@@ -7988,3 +7234,181 @@
// clang-format on
RunParserSyncTest(context_data, error_data, kError);
}
+
+TEST(FunctionDeclarationError) {
+ // clang-format off
+ const char* strict_context[][2] = {
+ { "'use strict';", "" },
+ { "'use strict'; { ", "}" },
+ {"(function() { 'use strict';", "})()"},
+ {"(function() { 'use strict'; {", "} })()"},
+ { NULL, NULL }
+ };
+ const char* sloppy_context[][2] = {
+ { "", "" },
+ { "{", "}" },
+ {"(function() {", "})()"},
+ {"(function() { {", "} })()"},
+ { NULL, NULL }
+ };
+ // Invalid in all contexts
+ const char* error_data[] = {
+ "try function foo() {} catch (e) {}",
+ NULL
+ };
+ // Valid in sloppy mode only, and only when the
+ // --harmony-restrictive-declarations flag is off
+ const char* unrestricted_data[] = {
+ "do function foo() {} while (0);",
+ "for (;false;) function foo() {}",
+ "for (var i = 0; i < 1; i++) function f() { };",
+ "for (var x in {a: 1}) function f() { };",
+ "for (var x in {}) function f() { };",
+ "for (var x in {}) function foo() {}",
+ "for (x in {a: 1}) function f() { };",
+ "for (x in {}) function f() { };",
+ "var x; for (x in {}) function foo() {}",
+ "with ({}) function f() { };",
+ "do label: function foo() {} while (0);",
+ "for (;false;) label: function foo() {}",
+ "for (var i = 0; i < 1; i++) label: function f() { };",
+ "for (var x in {a: 1}) label: function f() { };",
+ "for (var x in {}) label: function f() { };",
+ "for (var x in {}) label: function foo() {}",
+ "for (x in {a: 1}) label: function f() { };",
+ "for (x in {}) label: function f() { };",
+ "var x; for (x in {}) label: function foo() {}",
+ "with ({}) label: function f() { };",
+ "if (true) label: function f() {}",
+ "if (true) {} else label: function f() {}",
+ NULL
+ };
+ // Valid only in sloppy mode, with or without
+ // --harmony-restrictive-declarations
+ const char* sloppy_data[] = {
+ "if (true) function foo() {}",
+ "if (false) {} else function f() { };",
+ "label: function f() { }",
+ "label: if (true) function f() { }",
+ "label: if (true) {} else function f() { }",
+ NULL
+ };
+ // clang-format on
+
+ static const ParserFlag restrictive_flags[] = {
+ kAllowHarmonyRestrictiveDeclarations};
+
+ // Nothing parses in strict mode without a SyntaxError
+ RunParserSyncTest(strict_context, error_data, kError);
+ RunParserSyncTest(strict_context, error_data, kError, NULL, 0,
+ restrictive_flags, arraysize(restrictive_flags));
+ RunParserSyncTest(strict_context, unrestricted_data, kError);
+ RunParserSyncTest(strict_context, unrestricted_data, kError, NULL, 0,
+ restrictive_flags, arraysize(restrictive_flags));
+ RunParserSyncTest(strict_context, sloppy_data, kError);
+ RunParserSyncTest(strict_context, sloppy_data, kError, NULL, 0,
+ restrictive_flags, arraysize(restrictive_flags));
+
+ // In sloppy mode, some things are successful, depending on the flag
+ RunParserSyncTest(sloppy_context, error_data, kError);
+ RunParserSyncTest(sloppy_context, error_data, kError, NULL, 0,
+ restrictive_flags, arraysize(restrictive_flags));
+ RunParserSyncTest(sloppy_context, unrestricted_data, kSuccess);
+ RunParserSyncTest(sloppy_context, unrestricted_data, kError, NULL, 0,
+ restrictive_flags, arraysize(restrictive_flags));
+ RunParserSyncTest(sloppy_context, sloppy_data, kSuccess);
+ RunParserSyncTest(sloppy_context, sloppy_data, kSuccess, restrictive_flags,
+ arraysize(restrictive_flags));
+}
+
+TEST(ExponentiationOperator) {
+ // clang-format off
+ const char* context_data[][2] = {
+ { "var O = { p: 1 }, x = 10; ; if (", ") { foo(); }" },
+ { "var O = { p: 1 }, x = 10; ; (", ")" },
+ { "var O = { p: 1 }, x = 10; foo(", ")" },
+ { NULL, NULL }
+ };
+ const char* data[] = {
+ "(delete O.p) ** 10",
+ "(delete x) ** 10",
+ "(~O.p) ** 10",
+ "(~x) ** 10",
+ "(!O.p) ** 10",
+ "(!x) ** 10",
+ "(+O.p) ** 10",
+ "(+x) ** 10",
+ "(-O.p) ** 10",
+ "(-x) ** 10",
+ "(typeof O.p) ** 10",
+ "(typeof x) ** 10",
+ "(void 0) ** 10",
+ "(void O.p) ** 10",
+ "(void x) ** 10",
+ "++O.p ** 10",
+ "++x ** 10",
+ "--O.p ** 10",
+ "--x ** 10",
+ "O.p++ ** 10",
+ "x++ ** 10",
+ "O.p-- ** 10",
+ "x-- ** 10",
+ NULL
+ };
+ // clang-format on
+
+ static const ParserFlag always_flags[] = {
+ kAllowHarmonyExponentiationOperator};
+ RunParserSyncTest(context_data, data, kSuccess, NULL, 0, always_flags,
+ arraysize(always_flags));
+}
+
+TEST(ExponentiationOperatorErrors) {
+ // clang-format off
+ const char* context_data[][2] = {
+ { "var O = { p: 1 }, x = 10; ; if (", ") { foo(); }" },
+ { "var O = { p: 1 }, x = 10; ; (", ")" },
+ { "var O = { p: 1 }, x = 10; foo(", ")" },
+ { NULL, NULL }
+ };
+ const char* error_data[] = {
+ "delete O.p ** 10",
+ "delete x ** 10",
+ "~O.p ** 10",
+ "~x ** 10",
+ "!O.p ** 10",
+ "!x ** 10",
+ "+O.p ** 10",
+ "+x ** 10",
+ "-O.p ** 10",
+ "-x ** 10",
+ "typeof O.p ** 10",
+ "typeof x ** 10",
+ "void ** 10",
+ "void O.p ** 10",
+ "void x ** 10",
+ "++delete O.p ** 10",
+ "--delete O.p ** 10",
+ "++~O.p ** 10",
+ "++~x ** 10",
+ "--!O.p ** 10",
+ "--!x ** 10",
+ "++-O.p ** 10",
+ "++-x ** 10",
+ "--+O.p ** 10",
+ "--+x ** 10",
+ "[ x ] **= [ 2 ]",
+ "[ x **= 2 ] = [ 2 ]",
+ "{ x } **= { x: 2 }",
+ "{ x: x **= 2 ] = { x: 2 }",
+ // TODO(caitp): a Call expression as LHS should be an early ReferenceError!
+ // "Array() **= 10",
+ NULL
+ };
+ // clang-format on
+
+ static const ParserFlag always_flags[] = {
+ kAllowHarmonyExponentiationOperator};
+ RunParserSyncTest(context_data, error_data, kError, NULL, 0, always_flags,
+ arraysize(always_flags));
+}
diff --git a/test/cctest/test-platform.cc b/test/cctest/test-platform.cc
index 2645a3d..6012fd4 100644
--- a/test/cctest/test-platform.cc
+++ b/test/cctest/test-platform.cc
@@ -24,6 +24,10 @@
__asm__ __volatile__("sw $sp, %0" : "=g"(sp_addr));
#elif V8_HOST_ARCH_MIPS64
__asm__ __volatile__("sd $sp, %0" : "=g"(sp_addr));
+#elif defined(__s390x__) || defined(_ARCH_S390X)
+ __asm__ __volatile__("stg 15, %0" : "=g"(sp_addr));
+#elif defined(__s390__) || defined(_ARCH_S390)
+ __asm__ __volatile__("st 15, %0" : "=g"(sp_addr));
#elif defined(__PPC64__) || defined(_ARCH_PPC64)
__asm__ __volatile__("std 1, %0" : "=g"(sp_addr));
#elif defined(__PPC__) || defined(_ARCH_PPC)
diff --git a/test/cctest/test-profile-generator.cc b/test/cctest/test-profile-generator.cc
index fa7dc15..48633f5 100644
--- a/test/cctest/test-profile-generator.cc
+++ b/test/cctest/test-profile-generator.cc
@@ -132,7 +132,7 @@
CHECK(!helper.Walk(&entry3));
CodeEntry* path[] = {NULL, &entry3, NULL, &entry2, NULL, NULL, &entry1, NULL};
- Vector<CodeEntry*> path_vec(path, sizeof(path) / sizeof(path[0]));
+ std::vector<CodeEntry*> path_vec(path, path + arraysize(path));
tree.AddPathFromEnd(path_vec);
CHECK(!helper.Walk(&entry2));
CHECK(!helper.Walk(&entry3));
@@ -162,7 +162,7 @@
CHECK_EQ(2u, node3->self_ticks());
CodeEntry* path2[] = {&entry2, &entry2, &entry1};
- Vector<CodeEntry*> path2_vec(path2, sizeof(path2) / sizeof(path2[0]));
+ std::vector<CodeEntry*> path2_vec(path2, path2 + arraysize(path2));
tree.AddPathFromEnd(path2_vec);
CHECK(!helper.Walk(&entry2));
CHECK(!helper.Walk(&entry3));
@@ -189,8 +189,7 @@
CodeEntry entry1(i::Logger::FUNCTION_TAG, "aaa");
CodeEntry* e1_path[] = {&entry1};
- Vector<CodeEntry*> e1_path_vec(
- e1_path, sizeof(e1_path) / sizeof(e1_path[0]));
+ std::vector<CodeEntry*> e1_path_vec(e1_path, e1_path + arraysize(e1_path));
ProfileTree single_child_tree(CcTest::i_isolate());
single_child_tree.AddPathFromEnd(e1_path_vec);
@@ -204,8 +203,8 @@
CodeEntry entry2(i::Logger::FUNCTION_TAG, "bbb");
CodeEntry* e2_e1_path[] = {&entry2, &entry1};
- Vector<CodeEntry*> e2_e1_path_vec(e2_e1_path,
- sizeof(e2_e1_path) / sizeof(e2_e1_path[0]));
+ std::vector<CodeEntry*> e2_e1_path_vec(e2_e1_path,
+ e2_e1_path + arraysize(e2_e1_path));
ProfileTree flat_tree(CcTest::i_isolate());
ProfileTreeTestHelper flat_helper(&flat_tree);
@@ -227,12 +226,10 @@
CHECK_EQ(2u, node1->self_ticks());
CodeEntry* e2_path[] = {&entry2};
- Vector<CodeEntry*> e2_path_vec(
- e2_path, sizeof(e2_path) / sizeof(e2_path[0]));
+ std::vector<CodeEntry*> e2_path_vec(e2_path, e2_path + arraysize(e2_path));
CodeEntry entry3(i::Logger::FUNCTION_TAG, "ccc");
CodeEntry* e3_path[] = {&entry3};
- Vector<CodeEntry*> e3_path_vec(
- e3_path, sizeof(e3_path) / sizeof(e3_path[0]));
+ std::vector<CodeEntry*> e3_path_vec(e3_path, e3_path + arraysize(e3_path));
ProfileTree wide_tree(CcTest::i_isolate());
ProfileTreeTestHelper wide_helper(&wide_tree);
@@ -649,7 +646,7 @@
->Get(v8::Isolate::GetCurrent()->GetCurrentContext(),
v8_str(name))
.ToLocalChecked())));
- CodeEntry* func_entry = code_map->FindEntry(func->code()->address());
+ CodeEntry* func_entry = code_map->FindEntry(func->abstract_code()->address());
if (!func_entry)
FATAL(name);
return func_entry->line_number();
@@ -675,10 +672,13 @@
profiler->processor()->StopSynchronously();
+ bool is_lazy = i::FLAG_lazy && !(i::FLAG_ignition && i::FLAG_ignition_eager);
CHECK_EQ(1, GetFunctionLineNumber(&env, "foo_at_the_first_line"));
- CHECK_EQ(0, GetFunctionLineNumber(&env, "lazy_func_at_forth_line"));
+ CHECK_EQ(is_lazy ? 0 : 4,
+ GetFunctionLineNumber(&env, "lazy_func_at_forth_line"));
CHECK_EQ(2, GetFunctionLineNumber(&env, "bar_at_the_second_line"));
- CHECK_EQ(0, GetFunctionLineNumber(&env, "lazy_func_at_6th_line"));
+ CHECK_EQ(is_lazy ? 0 : 6,
+ GetFunctionLineNumber(&env, "lazy_func_at_6th_line"));
profiler->StopProfiling("LineNumber");
}
diff --git a/test/cctest/test-regexp.cc b/test/cctest/test-regexp.cc
index 22321c3..0a153b7 100644
--- a/test/cctest/test-regexp.cc
+++ b/test/cctest/test-regexp.cc
@@ -54,6 +54,11 @@
#include "src/arm64/macro-assembler-arm64.h"
#include "src/regexp/arm64/regexp-macro-assembler-arm64.h"
#endif
+#if V8_TARGET_ARCH_S390
+#include "src/regexp/s390/regexp-macro-assembler-s390.h"
+#include "src/s390/assembler-s390.h"
+#include "src/s390/macro-assembler-s390.h"
+#endif
#if V8_TARGET_ARCH_PPC
#include "src/ppc/assembler-ppc.h"
#include "src/ppc/macro-assembler-ppc.h"
@@ -92,7 +97,7 @@
static bool CheckParse(const char* input) {
v8::HandleScope scope(CcTest::isolate());
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
FlatStringReader reader(CcTest::i_isolate(), CStrVector(input));
RegExpCompileData result;
return v8::internal::RegExpParser::ParseRegExp(
@@ -103,7 +108,7 @@
static void CheckParseEq(const char* input, const char* expected,
bool unicode = false) {
v8::HandleScope scope(CcTest::isolate());
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
FlatStringReader reader(CcTest::i_isolate(), CStrVector(input));
RegExpCompileData result;
JSRegExp::Flags flags = JSRegExp::kNone;
@@ -123,7 +128,7 @@
static bool CheckSimple(const char* input) {
v8::HandleScope scope(CcTest::isolate());
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
FlatStringReader reader(CcTest::i_isolate(), CStrVector(input));
RegExpCompileData result;
CHECK(v8::internal::RegExpParser::ParseRegExp(
@@ -141,7 +146,7 @@
static MinMaxPair CheckMinMaxMatch(const char* input) {
v8::HandleScope scope(CcTest::isolate());
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
FlatStringReader reader(CcTest::i_isolate(), CStrVector(input));
RegExpCompileData result;
CHECK(v8::internal::RegExpParser::ParseRegExp(
@@ -456,7 +461,7 @@
static void ExpectError(const char* input,
const char* expected) {
v8::HandleScope scope(CcTest::isolate());
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
FlatStringReader reader(CcTest::i_isolate(), CStrVector(input));
RegExpCompileData result;
CHECK(!v8::internal::RegExpParser::ParseRegExp(
@@ -525,7 +530,7 @@
static void TestCharacterClassEscapes(uc16 c, bool (pred)(uc16 c)) {
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
ZoneList<CharacterRange>* ranges =
new(&zone) ZoneList<CharacterRange>(2, &zone);
CharacterRange::AddClassEscape(c, ranges, &zone);
@@ -576,7 +581,7 @@
static void Execute(const char* input, bool multiline, bool unicode,
bool is_one_byte, bool dot_output = false) {
v8::HandleScope scope(CcTest::isolate());
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
RegExpNode* node = Compile(input, multiline, unicode, is_one_byte, &zone);
USE(node);
#ifdef DEBUG
@@ -614,7 +619,7 @@
TEST(SplayTreeSimple) {
static const unsigned kLimit = 1000;
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
ZoneSplayTree<TestConfig> tree(&zone);
bool seen[kLimit];
for (unsigned i = 0; i < kLimit; i++) seen[i] = false;
@@ -681,7 +686,7 @@
}
}
// Enter test data into dispatch table.
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
DispatchTable table(&zone);
for (int i = 0; i < kRangeCount; i++) {
uc16* range = ranges[i];
@@ -744,6 +749,8 @@
typedef RegExpMacroAssemblerARM ArchRegExpMacroAssembler;
#elif V8_TARGET_ARCH_ARM64
typedef RegExpMacroAssemblerARM64 ArchRegExpMacroAssembler;
+#elif V8_TARGET_ARCH_S390
+typedef RegExpMacroAssemblerS390 ArchRegExpMacroAssembler;
#elif V8_TARGET_ARCH_PPC
typedef RegExpMacroAssemblerPPC ArchRegExpMacroAssembler;
#elif V8_TARGET_ARCH_MIPS
@@ -793,7 +800,7 @@
ContextInitializer initializer;
Isolate* isolate = CcTest::i_isolate();
Factory* factory = isolate->factory();
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
ArchRegExpMacroAssembler m(isolate, &zone, NativeRegExpMacroAssembler::LATIN1,
4);
@@ -831,7 +838,7 @@
ContextInitializer initializer;
Isolate* isolate = CcTest::i_isolate();
Factory* factory = isolate->factory();
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
ArchRegExpMacroAssembler m(isolate, &zone, NativeRegExpMacroAssembler::LATIN1,
4);
@@ -898,7 +905,7 @@
ContextInitializer initializer;
Isolate* isolate = CcTest::i_isolate();
Factory* factory = isolate->factory();
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
ArchRegExpMacroAssembler m(isolate, &zone, NativeRegExpMacroAssembler::UC16,
4);
@@ -971,7 +978,7 @@
ContextInitializer initializer;
Isolate* isolate = CcTest::i_isolate();
Factory* factory = isolate->factory();
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
ArchRegExpMacroAssembler m(isolate, &zone, NativeRegExpMacroAssembler::LATIN1,
0);
@@ -1012,7 +1019,7 @@
ContextInitializer initializer;
Isolate* isolate = CcTest::i_isolate();
Factory* factory = isolate->factory();
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
ArchRegExpMacroAssembler m(isolate, &zone, NativeRegExpMacroAssembler::LATIN1,
4);
@@ -1062,7 +1069,7 @@
ContextInitializer initializer;
Isolate* isolate = CcTest::i_isolate();
Factory* factory = isolate->factory();
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
ArchRegExpMacroAssembler m(isolate, &zone, NativeRegExpMacroAssembler::UC16,
4);
@@ -1115,7 +1122,7 @@
ContextInitializer initializer;
Isolate* isolate = CcTest::i_isolate();
Factory* factory = isolate->factory();
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
ArchRegExpMacroAssembler m(isolate, &zone, NativeRegExpMacroAssembler::LATIN1,
0);
@@ -1175,7 +1182,7 @@
ContextInitializer initializer;
Isolate* isolate = CcTest::i_isolate();
Factory* factory = isolate->factory();
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
ArchRegExpMacroAssembler m(isolate, &zone, NativeRegExpMacroAssembler::LATIN1,
4);
@@ -1234,7 +1241,7 @@
ContextInitializer initializer;
Isolate* isolate = CcTest::i_isolate();
Factory* factory = isolate->factory();
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
ArchRegExpMacroAssembler m(isolate, &zone, NativeRegExpMacroAssembler::LATIN1,
6);
@@ -1336,7 +1343,7 @@
ContextInitializer initializer;
Isolate* isolate = CcTest::i_isolate();
Factory* factory = isolate->factory();
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
ArchRegExpMacroAssembler m(isolate, &zone, NativeRegExpMacroAssembler::LATIN1,
0);
@@ -1375,7 +1382,7 @@
ContextInitializer initializer;
Isolate* isolate = CcTest::i_isolate();
Factory* factory = isolate->factory();
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
ArchRegExpMacroAssembler m(isolate, &zone, NativeRegExpMacroAssembler::LATIN1,
2);
@@ -1423,7 +1430,7 @@
TEST(MacroAssembler) {
byte codes[1024];
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
RegExpMacroAssemblerIrregexp m(CcTest::i_isolate(), Vector<byte>(codes, 1024),
&zone);
// ^f(o)o.
@@ -1491,7 +1498,7 @@
static const int kLimit = 1000;
static const int kRangeCount = 16;
for (int t = 0; t < 10; t++) {
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
ZoneList<CharacterRange>* ranges =
new(&zone) ZoneList<CharacterRange>(kRangeCount, &zone);
for (int i = 0; i < kRangeCount; i++) {
@@ -1512,7 +1519,7 @@
CHECK_EQ(is_on, set->Get(0) == false);
}
}
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
ZoneList<CharacterRange>* ranges =
new(&zone) ZoneList<CharacterRange>(1, &zone);
ranges->Add(CharacterRange::Range(0xFFF0, 0xFFFE), &zone);
@@ -1625,7 +1632,7 @@
static void TestRangeCaseIndependence(Isolate* isolate, CharacterRange input,
Vector<CharacterRange> expected) {
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
int count = expected.length();
ZoneList<CharacterRange>* list =
new(&zone) ZoneList<CharacterRange>(count, &zone);
@@ -1694,7 +1701,7 @@
TEST(UnicodeRangeSplitter) {
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
ZoneList<CharacterRange>* base =
new(&zone) ZoneList<CharacterRange>(1, &zone);
base->Add(CharacterRange::Everything(), &zone);
@@ -1738,7 +1745,7 @@
TEST(CanonicalizeCharacterSets) {
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
ZoneList<CharacterRange>* list =
new(&zone) ZoneList<CharacterRange>(4, &zone);
CharacterSet set(list);
@@ -1799,7 +1806,7 @@
TEST(CharacterRangeMerge) {
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
ZoneList<CharacterRange> l1(4, &zone);
ZoneList<CharacterRange> l2(4, &zone);
// Create all combinations of intersections of ranges, both singletons and
@@ -1904,7 +1911,6 @@
// Test that ES2015 RegExp compatibility fixes are in place, that they
// are not overly broad, and the appropriate UseCounters are incremented
TEST(UseCountRegExp) {
- i::FLAG_harmony_regexps = true;
v8::Isolate* isolate = CcTest::isolate();
v8::HandleScope scope(isolate);
LocalContext env;
@@ -1943,7 +1949,7 @@
// a UseCounter is incremented to track it.
v8::Local<v8::Value> resultToString =
CompileRun("RegExp.prototype.toString().length");
- CHECK_EQ(1, use_counts[v8::Isolate::kRegExpPrototypeStickyGetter]);
+ CHECK_EQ(2, use_counts[v8::Isolate::kRegExpPrototypeStickyGetter]);
CHECK_EQ(1, use_counts[v8::Isolate::kRegExpPrototypeToString]);
CHECK(resultToString->IsInt32());
CHECK_EQ(6,
@@ -1951,7 +1957,7 @@
// .toString() works on normal RegExps
v8::Local<v8::Value> resultReToString = CompileRun("/a/.toString().length");
- CHECK_EQ(1, use_counts[v8::Isolate::kRegExpPrototypeStickyGetter]);
+ CHECK_EQ(2, use_counts[v8::Isolate::kRegExpPrototypeStickyGetter]);
CHECK_EQ(1, use_counts[v8::Isolate::kRegExpPrototypeToString]);
CHECK(resultReToString->IsInt32());
CHECK_EQ(
@@ -1963,7 +1969,7 @@
"try { RegExp.prototype.toString.call(null) }"
"catch (e) { exception = e; }"
"exception");
- CHECK_EQ(1, use_counts[v8::Isolate::kRegExpPrototypeStickyGetter]);
+ CHECK_EQ(2, use_counts[v8::Isolate::kRegExpPrototypeStickyGetter]);
CHECK_EQ(1, use_counts[v8::Isolate::kRegExpPrototypeToString]);
CHECK(resultToStringError->IsObject());
}
diff --git a/test/cctest/test-run-wasm-relocation-arm.cc b/test/cctest/test-run-wasm-relocation-arm.cc
new file mode 100644
index 0000000..adfeb28
--- /dev/null
+++ b/test/cctest/test-run-wasm-relocation-arm.cc
@@ -0,0 +1,80 @@
+// Copyright 2015 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include <iostream> // NOLINT(readability/streams)
+
+#include "src/v8.h"
+#include "test/cctest/cctest.h"
+
+#include "src/arm/assembler-arm-inl.h"
+#include "src/arm/simulator-arm.h"
+#include "src/disassembler.h"
+#include "src/factory.h"
+#include "src/ostreams.h"
+#include "test/cctest/compiler/c-signature.h"
+#include "test/cctest/compiler/call-tester.h"
+
+using namespace v8::base;
+using namespace v8::internal;
+using namespace v8::internal::compiler;
+
+#define __ assm.
+
+static int32_t DummyStaticFunction(Object* result) { return 1; }
+
+TEST(WasmRelocationArm) {
+ CcTest::InitializeVM();
+ Isolate* isolate = CcTest::i_isolate();
+ HandleScope scope(isolate);
+ v8::internal::byte buffer[4096];
+ DummyStaticFunction(NULL);
+ int32_t imm = 1234567;
+
+ Assembler assm(isolate, buffer, sizeof buffer);
+
+ __ mov(r0, Operand(imm, RelocInfo::WASM_MEMORY_REFERENCE));
+ __ mov(pc, Operand(lr));
+
+ CodeDesc desc;
+ assm.GetCode(&desc);
+ Handle<Code> code = isolate->factory()->NewCode(
+ desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
+
+ CSignature0<int32_t> csig;
+ CodeRunner<int32_t> runnable(isolate, code, &csig);
+ int32_t ret_value = runnable.Call();
+ CHECK_EQ(ret_value, imm);
+
+#ifdef DEBUG
+ OFStream os(stdout);
+ code->Print(os);
+ ::printf("f() = %d\n\n", ret_value);
+#endif
+ size_t offset = 1234;
+
+ // Relocating references by offset
+ int mode_mask = (1 << RelocInfo::WASM_MEMORY_REFERENCE);
+ for (RelocIterator it(*code, mode_mask); !it.done(); it.next()) {
+ RelocInfo::Mode mode = it.rinfo()->rmode();
+ if (RelocInfo::IsWasmMemoryReference(mode)) {
+ // Dummy values of size used here as the objective of the test is to
+ // verify that the immediate is patched correctly
+ it.rinfo()->update_wasm_memory_reference(
+ it.rinfo()->wasm_memory_reference(),
+ it.rinfo()->wasm_memory_reference() + offset, 1, 2,
+ SKIP_ICACHE_FLUSH);
+ }
+ }
+
+ // Call into relocated code object
+ ret_value = runnable.Call();
+ CHECK_EQ((imm + offset), ret_value);
+
+#ifdef DEBUG
+ code->Print(os);
+ ::printf("f() = %d\n\n", ret_value);
+#endif
+}
+
+#undef __
diff --git a/test/cctest/test-run-wasm-relocation-arm64.cc b/test/cctest/test-run-wasm-relocation-arm64.cc
new file mode 100644
index 0000000..48f9e85
--- /dev/null
+++ b/test/cctest/test-run-wasm-relocation-arm64.cc
@@ -0,0 +1,82 @@
+// Copyright 2015 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include <iostream> // NOLINT(readability/streams)
+
+#include "src/v8.h"
+#include "test/cctest/cctest.h"
+
+#include "src/arm64/simulator-arm64.h"
+#include "src/arm64/utils-arm64.h"
+#include "src/disassembler.h"
+#include "src/factory.h"
+#include "src/macro-assembler.h"
+#include "src/ostreams.h"
+#include "test/cctest/compiler/c-signature.h"
+#include "test/cctest/compiler/call-tester.h"
+
+using namespace v8::base;
+using namespace v8::internal;
+using namespace v8::internal::compiler;
+
+#define __ masm.
+
+static int64_t DummyStaticFunction(Object* result) { return 1; }
+
+TEST(WasmRelocationArm64) {
+ CcTest::InitializeVM();
+ Isolate* isolate = CcTest::i_isolate();
+ HandleScope scope(isolate);
+ v8::internal::byte buffer[4096];
+ DummyStaticFunction(NULL);
+ int64_t imm = 1234567;
+
+ MacroAssembler masm(isolate, buffer, sizeof buffer,
+ v8::internal::CodeObjectRequired::kYes);
+
+ __ Mov(x0, Immediate(imm, RelocInfo::WASM_MEMORY_REFERENCE));
+ __ Ret();
+
+ CodeDesc desc;
+ masm.GetCode(&desc);
+ Handle<Code> code = isolate->factory()->NewCode(
+ desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
+
+ CSignature0<int64_t> csig;
+ CodeRunner<int64_t> runnable(isolate, code, &csig);
+ int64_t ret_value = runnable.Call();
+ CHECK_EQ(ret_value, imm);
+
+#ifdef DEBUG
+ OFStream os(stdout);
+ code->Print(os);
+ ::printf("f() = %ld\n\n", ret_value);
+#endif
+ size_t offset = 1234;
+
+ // Relocating reference by offset
+ int mode_mask = (1 << RelocInfo::WASM_MEMORY_REFERENCE);
+ for (RelocIterator it(*code, mode_mask); !it.done(); it.next()) {
+ RelocInfo::Mode mode = it.rinfo()->rmode();
+ if (RelocInfo::IsWasmMemoryReference(mode)) {
+ // Dummy values of size used here as the objective of the test is to
+ // verify that the immediate is patched correctly
+ it.rinfo()->update_wasm_memory_reference(
+ it.rinfo()->wasm_memory_reference(),
+ it.rinfo()->wasm_memory_reference() + offset, 1, 2,
+ SKIP_ICACHE_FLUSH);
+ }
+ }
+
+ // Call into relocated code object
+ ret_value = runnable.Call();
+ CHECK_EQ((imm + offset), ret_value);
+
+#ifdef DEBUG
+ code->Print(os);
+ ::printf("f() = %ld\n\n", ret_value);
+#endif
+}
+
+#undef __
diff --git a/test/cctest/test-run-wasm-relocation-ia32.cc b/test/cctest/test-run-wasm-relocation-ia32.cc
new file mode 100644
index 0000000..135b522
--- /dev/null
+++ b/test/cctest/test-run-wasm-relocation-ia32.cc
@@ -0,0 +1,89 @@
+// Copyright 2015 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include <stdlib.h>
+
+#include "src/v8.h"
+
+#include "src/debug/debug.h"
+#include "src/disasm.h"
+#include "src/disassembler.h"
+#include "src/ia32/frames-ia32.h"
+#include "src/ic/ic.h"
+#include "src/macro-assembler.h"
+#include "test/cctest/cctest.h"
+#include "test/cctest/compiler/c-signature.h"
+#include "test/cctest/compiler/call-tester.h"
+
+using namespace v8::internal;
+using namespace v8::internal::compiler;
+
+#define __ assm.
+
+static int32_t DummyStaticFunction(Object* result) { return 1; }
+
+TEST(WasmRelocationIa32) {
+ CcTest::InitializeVM();
+ Isolate* isolate = CcTest::i_isolate();
+ Zone zone(isolate->allocator());
+ HandleScope scope(isolate);
+ v8::internal::byte buffer[4096];
+ Assembler assm(isolate, buffer, sizeof buffer);
+ DummyStaticFunction(NULL);
+ int32_t imm = 1234567;
+
+ __ mov(eax, Immediate(reinterpret_cast<Address>(imm),
+ RelocInfo::WASM_MEMORY_REFERENCE));
+ __ nop();
+ __ ret(0);
+
+ CSignature0<int32_t> csig;
+ CodeDesc desc;
+ assm.GetCode(&desc);
+ Handle<Code> code = isolate->factory()->NewCode(
+ desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
+ USE(code);
+
+ CodeRunner<int32_t> runnable(isolate, code, &csig);
+ int32_t ret_value = runnable.Call();
+ CHECK_EQ(ret_value, imm);
+
+#ifdef OBJECT_PRINT
+ OFStream os(stdout);
+ code->Print(os);
+ byte* begin = code->instruction_start();
+ byte* end = begin + code->instruction_size();
+ disasm::Disassembler::Disassemble(stdout, begin, end);
+#endif
+
+ size_t offset = 1234;
+
+ // Relocating references by offset
+ int mode_mask = (1 << RelocInfo::WASM_MEMORY_REFERENCE);
+ for (RelocIterator it(*code, mode_mask); !it.done(); it.next()) {
+ RelocInfo::Mode mode = it.rinfo()->rmode();
+ if (RelocInfo::IsWasmMemoryReference(mode)) {
+ // Dummy values of size used here as the objective of the test is to
+ // verify that the immediate is patched correctly
+ it.rinfo()->update_wasm_memory_reference(
+ it.rinfo()->wasm_memory_reference(),
+ it.rinfo()->wasm_memory_reference() + offset, 1, 2,
+ SKIP_ICACHE_FLUSH);
+ }
+ }
+
+ // Check if immediate is updated correctly
+ ret_value = runnable.Call();
+ CHECK_EQ(ret_value, imm + offset);
+
+#ifdef OBJECT_PRINT
+ // OFStream os(stdout);
+ code->Print(os);
+ begin = code->instruction_start();
+ end = begin + code->instruction_size();
+ disasm::Disassembler::Disassemble(stdout, begin, end);
+#endif
+}
+
+#undef __
diff --git a/test/cctest/test-run-wasm-relocation-x64.cc b/test/cctest/test-run-wasm-relocation-x64.cc
new file mode 100644
index 0000000..f1b6d96
--- /dev/null
+++ b/test/cctest/test-run-wasm-relocation-x64.cc
@@ -0,0 +1,83 @@
+// Copyright 2015 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include <stdlib.h>
+
+#include "src/v8.h"
+
+#include "src/debug/debug.h"
+#include "src/disasm.h"
+#include "src/disassembler.h"
+#include "src/ic/ic.h"
+#include "src/macro-assembler.h"
+#include "test/cctest/cctest.h"
+#include "test/cctest/compiler/c-signature.h"
+#include "test/cctest/compiler/call-tester.h"
+
+using namespace v8::internal;
+using namespace v8::internal::compiler;
+
+#define __ assm.
+
+static int32_t DummyStaticFunction(Object* result) { return 1; }
+TEST(WasmRelocationX64movq64) {
+ CcTest::InitializeVM();
+ Isolate* isolate = CcTest::i_isolate();
+ HandleScope scope(isolate);
+ v8::internal::byte buffer[4096];
+ Assembler assm(isolate, buffer, sizeof buffer);
+ DummyStaticFunction(NULL);
+ int64_t imm = 1234567;
+
+ __ movq(rax, imm, RelocInfo::WASM_MEMORY_REFERENCE);
+ __ nop();
+ __ ret(0);
+
+ CodeDesc desc;
+ assm.GetCode(&desc);
+ Handle<Code> code = isolate->factory()->NewCode(
+ desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
+ USE(code);
+
+ CSignature0<int64_t> csig;
+ CodeRunner<int64_t> runnable(isolate, code, &csig);
+ int64_t ret_value = runnable.Call();
+ CHECK_EQ(ret_value, imm);
+
+#ifdef OBJECT_PRINT
+ OFStream os(stdout);
+ code->Print(os);
+ byte* begin = code->instruction_start();
+ byte* end = begin + code->instruction_size();
+ disasm::Disassembler::Disassemble(stdout, begin, end);
+#endif
+ size_t offset = 1234;
+
+ // Relocating references by offset
+ int mode_mask = (1 << RelocInfo::WASM_MEMORY_REFERENCE);
+ for (RelocIterator it(*code, mode_mask); !it.done(); it.next()) {
+ RelocInfo::Mode mode = it.rinfo()->rmode();
+ if (RelocInfo::IsWasmMemoryReference(mode)) {
+ // Dummy values of size used here as the objective of the test is to
+ // verify that the immediate is patched correctly
+ it.rinfo()->update_wasm_memory_reference(
+ it.rinfo()->wasm_memory_reference(),
+ it.rinfo()->wasm_memory_reference() + offset, 1, 2,
+ SKIP_ICACHE_FLUSH);
+ }
+ }
+
+ // Check if immediate is updated correctly
+ ret_value = runnable.Call();
+ CHECK_EQ(ret_value, imm + offset);
+
+#ifdef OBJECT_PRINT
+ code->Print(os);
+ begin = code->instruction_start();
+ end = begin + code->instruction_size();
+ disasm::Disassembler::Disassemble(stdout, begin, end);
+#endif
+}
+
+#undef __
diff --git a/test/cctest/test-run-wasm-relocation-x87.cc b/test/cctest/test-run-wasm-relocation-x87.cc
new file mode 100644
index 0000000..6cbd065
--- /dev/null
+++ b/test/cctest/test-run-wasm-relocation-x87.cc
@@ -0,0 +1,89 @@
+// Copyright 2015 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include <stdlib.h>
+
+#include "src/v8.h"
+
+#include "src/debug/debug.h"
+#include "src/disasm.h"
+#include "src/disassembler.h"
+#include "src/ic/ic.h"
+#include "src/macro-assembler.h"
+#include "src/x87/frames-x87.h"
+#include "test/cctest/cctest.h"
+#include "test/cctest/compiler/c-signature.h"
+#include "test/cctest/compiler/call-tester.h"
+
+using namespace v8::internal;
+using namespace v8::internal::compiler;
+
+#define __ assm.
+
+static int32_t DummyStaticFunction(Object* result) { return 1; }
+
+TEST(WasmRelocationIa32) {
+ CcTest::InitializeVM();
+ Isolate* isolate = CcTest::i_isolate();
+ Zone zone(isolate->allocator());
+ HandleScope scope(isolate);
+ v8::internal::byte buffer[4096];
+ Assembler assm(isolate, buffer, sizeof buffer);
+ DummyStaticFunction(NULL);
+ int32_t imm = 1234567;
+
+ __ mov(eax, Immediate(reinterpret_cast<Address>(imm),
+ RelocInfo::WASM_MEMORY_REFERENCE));
+ __ nop();
+ __ ret(0);
+
+ CSignature0<int32_t> csig;
+ CodeDesc desc;
+ assm.GetCode(&desc);
+ Handle<Code> code = isolate->factory()->NewCode(
+ desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
+ USE(code);
+
+ CodeRunner<int32_t> runnable(isolate, code, &csig);
+ int32_t ret_value = runnable.Call();
+ CHECK_EQ(ret_value, imm);
+
+#ifdef OBJECT_PRINT
+ OFStream os(stdout);
+ code->Print(os);
+ byte* begin = code->instruction_start();
+ byte* end = begin + code->instruction_size();
+ disasm::Disassembler::Disassemble(stdout, begin, end);
+#endif
+
+ size_t offset = 1234;
+
+ // Relocating references by offset
+ int mode_mask = (1 << RelocInfo::WASM_MEMORY_REFERENCE);
+ for (RelocIterator it(*code, mode_mask); !it.done(); it.next()) {
+ RelocInfo::Mode mode = it.rinfo()->rmode();
+ if (RelocInfo::IsWasmMemoryReference(mode)) {
+ // Dummy values of size used here as the objective of the test is to
+ // verify that the immediate is patched correctly
+ it.rinfo()->update_wasm_memory_reference(
+ it.rinfo()->wasm_memory_reference(),
+ it.rinfo()->wasm_memory_reference() + offset, 1, 2,
+ SKIP_ICACHE_FLUSH);
+ }
+ }
+
+ // Check if immediate is updated correctly
+ ret_value = runnable.Call();
+ CHECK_EQ(ret_value, imm + offset);
+
+#ifdef OBJECT_PRINT
+ // OFStream os(stdout);
+ code->Print(os);
+ begin = code->instruction_start();
+ end = begin + code->instruction_size();
+ disasm::Disassembler::Disassemble(stdout, begin, end);
+#endif
+}
+
+#undef __
diff --git a/test/cctest/test-sampler-api.cc b/test/cctest/test-sampler-api.cc
index 2cc15f8..e2c1c25 100644
--- a/test/cctest/test-sampler-api.cc
+++ b/test/cctest/test-sampler-api.cc
@@ -71,6 +71,12 @@
simulator_->get_register(v8::internal::Simulator::sp));
state->fp = reinterpret_cast<void*>(
simulator_->get_register(v8::internal::Simulator::fp));
+#elif V8_TARGET_ARCH_S390 || V8_TARGET_ARCH_S390X
+ state->pc = reinterpret_cast<void*>(simulator_->get_pc());
+ state->sp = reinterpret_cast<void*>(
+ simulator_->get_register(v8::internal::Simulator::sp));
+ state->fp = reinterpret_cast<void*>(
+ simulator_->get_register(v8::internal::Simulator::fp));
#endif
}
diff --git a/test/cctest/test-serialize.cc b/test/cctest/test-serialize.cc
index 2f29b25..cd349f9 100644
--- a/test/cctest/test-serialize.cc
+++ b/test/cctest/test-serialize.cc
@@ -39,20 +39,17 @@
#include "src/objects.h"
#include "src/parsing/parser.h"
#include "src/runtime/runtime.h"
+#include "src/snapshot/code-serializer.h"
+#include "src/snapshot/deserializer.h"
#include "src/snapshot/natives.h"
-#include "src/snapshot/serialize.h"
+#include "src/snapshot/partial-serializer.h"
#include "src/snapshot/snapshot.h"
+#include "src/snapshot/startup-serializer.h"
#include "test/cctest/cctest.h"
#include "test/cctest/heap/utils-inl.h"
using namespace v8::internal;
-
-bool DefaultSnapshotAvailable() {
- return i::Snapshot::DefaultSnapshotBlob() != NULL;
-}
-
-
void DisableTurbofan() {
const char* flag = "--turbo-filter=\"\"";
FlagList::SetFlagsFromString(flag, StrLength(flag));
@@ -74,34 +71,14 @@
}
};
-
-void WritePayload(const Vector<const byte>& payload, const char* file_name) {
- FILE* file = v8::base::OS::FOpen(file_name, "wb");
- if (file == NULL) {
- PrintF("Unable to write to snapshot file \"%s\"\n", file_name);
- exit(1);
- }
- size_t written = fwrite(payload.begin(), 1, payload.length(), file);
- if (written != static_cast<size_t>(payload.length())) {
- i::PrintF("Writing snapshot file failed.. Aborting.\n");
- exit(1);
- }
- fclose(file);
+static Vector<const byte> WritePayload(const Vector<const byte>& payload) {
+ int length = payload.length();
+ byte* blob = NewArray<byte>(length);
+ memcpy(blob, payload.begin(), length);
+ return Vector<const byte>(const_cast<const byte*>(blob), length);
}
-
-static bool WriteToFile(Isolate* isolate, const char* snapshot_file) {
- SnapshotByteSink sink;
- StartupSerializer ser(isolate, &sink);
- ser.SerializeStrongReferences();
- ser.SerializeWeakReferencesAndDeferred();
- SnapshotData snapshot_data(ser);
- WritePayload(snapshot_data.RawData(), snapshot_file);
- return true;
-}
-
-
-static void Serialize(v8::Isolate* isolate) {
+static Vector<const byte> Serialize(v8::Isolate* isolate) {
// We have to create one context. One reason for this is so that the builtins
// can be loaded from v8natives.js and their addresses can be processed. This
// will clear the pending fixups array, which would otherwise contain GC roots
@@ -114,7 +91,12 @@
Isolate* internal_isolate = reinterpret_cast<Isolate*>(isolate);
internal_isolate->heap()->CollectAllAvailableGarbage("serialize");
- WriteToFile(internal_isolate, FLAG_testing_serialization_file);
+ SnapshotByteSink sink;
+ StartupSerializer ser(internal_isolate, &sink);
+ ser.SerializeStrongReferences();
+ ser.SerializeWeakReferencesAndDeferred();
+ SnapshotData snapshot_data(ser);
+ return WritePayload(snapshot_data.RawData());
}
@@ -134,49 +116,21 @@
source_length);
}
-
-// Test that the whole heap can be serialized.
-UNINITIALIZED_TEST(Serialize) {
- DisableTurbofan();
- if (DefaultSnapshotAvailable()) return;
- v8::Isolate* isolate = TestIsolate::NewInitialized(true);
- Serialize(isolate);
-}
-
-
-// Test that heap serialization is non-destructive.
-UNINITIALIZED_TEST(SerializeTwice) {
- DisableTurbofan();
- if (DefaultSnapshotAvailable()) return;
- v8::Isolate* isolate = TestIsolate::NewInitialized(true);
- Serialize(isolate);
- Serialize(isolate);
-}
-
-
-//----------------------------------------------------------------------------
-// Tests that the heap can be deserialized.
-
-v8::Isolate* InitializeFromFile(const char* snapshot_file) {
- int len;
- byte* str = ReadBytes(snapshot_file, &len);
- if (!str) return NULL;
+v8::Isolate* InitializeFromBlob(Vector<const byte> blob) {
v8::Isolate* v8_isolate = NULL;
{
- SnapshotData snapshot_data(Vector<const byte>(str, len));
+ SnapshotData snapshot_data(blob);
Deserializer deserializer(&snapshot_data);
Isolate* isolate = new TestIsolate(false);
v8_isolate = reinterpret_cast<v8::Isolate*>(isolate);
v8::Isolate::Scope isolate_scope(v8_isolate);
isolate->Init(&deserializer);
}
- DeleteArray(str);
return v8_isolate;
}
-
-static v8::Isolate* Deserialize() {
- v8::Isolate* isolate = InitializeFromFile(FLAG_testing_serialization_file);
+static v8::Isolate* Deserialize(Vector<const byte> blob) {
+ v8::Isolate* isolate = InitializeFromBlob(blob);
CHECK(isolate);
return isolate;
}
@@ -194,14 +148,15 @@
isolate->factory()->InternalizeOneByteString(STATIC_CHAR_VECTOR("Empty"));
}
-
-UNINITIALIZED_DEPENDENT_TEST(Deserialize, Serialize) {
+UNINITIALIZED_TEST(StartupSerializerOnce) {
// The serialize-deserialize tests only work if the VM is built without
// serialization. That doesn't matter. We don't need to be able to
// serialize a snapshot in a VM that is booted from a snapshot.
DisableTurbofan();
- if (DefaultSnapshotAvailable()) return;
- v8::Isolate* isolate = Deserialize();
+ v8::Isolate* isolate = TestIsolate::NewInitialized(true);
+ Vector<const byte> blob = Serialize(isolate);
+ isolate = Deserialize(blob);
+ blob.Dispose();
{
v8::HandleScope handle_scope(isolate);
v8::Isolate::Scope isolate_scope(isolate);
@@ -214,12 +169,14 @@
isolate->Dispose();
}
-
-UNINITIALIZED_DEPENDENT_TEST(DeserializeFromSecondSerialization,
- SerializeTwice) {
+UNINITIALIZED_TEST(StartupSerializerTwice) {
DisableTurbofan();
- if (DefaultSnapshotAvailable()) return;
- v8::Isolate* isolate = Deserialize();
+ v8::Isolate* isolate = TestIsolate::NewInitialized(true);
+ Vector<const byte> blob1 = Serialize(isolate);
+ Vector<const byte> blob2 = Serialize(isolate);
+ blob1.Dispose();
+ isolate = Deserialize(blob2);
+ blob2.Dispose();
{
v8::Isolate::Scope isolate_scope(isolate);
v8::HandleScope handle_scope(isolate);
@@ -232,11 +189,12 @@
isolate->Dispose();
}
-
-UNINITIALIZED_DEPENDENT_TEST(DeserializeAndRunScript2, Serialize) {
+UNINITIALIZED_TEST(StartupSerializerOnceRunScript) {
DisableTurbofan();
- if (DefaultSnapshotAvailable()) return;
- v8::Isolate* isolate = Deserialize();
+ v8::Isolate* isolate = TestIsolate::NewInitialized(true);
+ Vector<const byte> blob = Serialize(isolate);
+ isolate = Deserialize(blob);
+ blob.Dispose();
{
v8::Isolate::Scope isolate_scope(isolate);
v8::HandleScope handle_scope(isolate);
@@ -255,12 +213,14 @@
isolate->Dispose();
}
-
-UNINITIALIZED_DEPENDENT_TEST(DeserializeFromSecondSerializationAndRunScript2,
- SerializeTwice) {
+UNINITIALIZED_TEST(StartupSerializerTwiceRunScript) {
DisableTurbofan();
- if (DefaultSnapshotAvailable()) return;
- v8::Isolate* isolate = Deserialize();
+ v8::Isolate* isolate = TestIsolate::NewInitialized(true);
+ Vector<const byte> blob1 = Serialize(isolate);
+ Vector<const byte> blob2 = Serialize(isolate);
+ blob1.Dispose();
+ isolate = Deserialize(blob2);
+ blob2.Dispose();
{
v8::Isolate::Scope isolate_scope(isolate);
v8::HandleScope handle_scope(isolate);
@@ -278,10 +238,8 @@
isolate->Dispose();
}
-
-UNINITIALIZED_TEST(PartialSerialization) {
- DisableTurbofan();
- if (DefaultSnapshotAvailable()) return;
+static void PartiallySerializeObject(Vector<const byte>* startup_blob_out,
+ Vector<const byte>* partial_blob_out) {
v8::Isolate* v8_isolate = TestIsolate::NewInitialized(true);
Isolate* isolate = reinterpret_cast<Isolate*>(v8_isolate);
v8_isolate->Enter();
@@ -316,10 +274,6 @@
raw_foo = *(v8::Utils::OpenHandle(*foo));
}
- int file_name_length = StrLength(FLAG_testing_serialization_file) + 10;
- Vector<char> startup_name = Vector<char>::New(file_name_length + 1);
- SNPrintF(startup_name, "%s.startup", FLAG_testing_serialization_file);
-
{
v8::HandleScope handle_scope(v8_isolate);
v8::Local<v8::Context>::New(v8_isolate, env)->Exit();
@@ -340,34 +294,25 @@
SnapshotData startup_snapshot(startup_serializer);
SnapshotData partial_snapshot(partial_serializer);
- WritePayload(partial_snapshot.RawData(), FLAG_testing_serialization_file);
- WritePayload(startup_snapshot.RawData(), startup_name.start());
-
- startup_name.Dispose();
+ *partial_blob_out = WritePayload(partial_snapshot.RawData());
+ *startup_blob_out = WritePayload(startup_snapshot.RawData());
}
v8_isolate->Exit();
v8_isolate->Dispose();
}
-
-UNINITIALIZED_DEPENDENT_TEST(PartialDeserialization, PartialSerialization) {
+UNINITIALIZED_TEST(PartialSerializerObject) {
DisableTurbofan();
- if (DefaultSnapshotAvailable()) return;
- int file_name_length = StrLength(FLAG_testing_serialization_file) + 10;
- Vector<char> startup_name = Vector<char>::New(file_name_length + 1);
- SNPrintF(startup_name, "%s.startup", FLAG_testing_serialization_file);
+ Vector<const byte> startup_blob;
+ Vector<const byte> partial_blob;
+ PartiallySerializeObject(&startup_blob, &partial_blob);
- v8::Isolate* v8_isolate = InitializeFromFile(startup_name.start());
+ v8::Isolate* v8_isolate = InitializeFromBlob(startup_blob);
+ startup_blob.Dispose();
CHECK(v8_isolate);
- startup_name.Dispose();
{
v8::Isolate::Scope isolate_scope(v8_isolate);
- const char* file_name = FLAG_testing_serialization_file;
-
- int snapshot_size = 0;
- byte* snapshot = ReadBytes(file_name, &snapshot_size);
-
Isolate* isolate = reinterpret_cast<Isolate*>(v8_isolate);
HandleScope handle_scope(isolate);
Handle<Object> root;
@@ -375,7 +320,7 @@
// any references to the global proxy in this test.
Handle<JSGlobalProxy> global_proxy = Handle<JSGlobalProxy>::null();
{
- SnapshotData snapshot_data(Vector<const byte>(snapshot, snapshot_size));
+ SnapshotData snapshot_data(partial_blob);
Deserializer deserializer(&snapshot_data);
root = deserializer.DeserializePartial(isolate, global_proxy)
.ToHandleChecked();
@@ -384,23 +329,20 @@
Handle<Object> root2;
{
- SnapshotData snapshot_data(Vector<const byte>(snapshot, snapshot_size));
+ SnapshotData snapshot_data(partial_blob);
Deserializer deserializer(&snapshot_data);
root2 = deserializer.DeserializePartial(isolate, global_proxy)
.ToHandleChecked();
CHECK(root2->IsString());
CHECK(root.is_identical_to(root2));
}
-
- DeleteArray(snapshot);
+ partial_blob.Dispose();
}
v8_isolate->Dispose();
}
-
-UNINITIALIZED_TEST(ContextSerialization) {
- DisableTurbofan();
- if (DefaultSnapshotAvailable()) return;
+static void PartiallySerializeContext(Vector<const byte>* startup_blob_out,
+ Vector<const byte>* partial_blob_out) {
v8::Isolate* v8_isolate = TestIsolate::NewInitialized(true);
Isolate* isolate = reinterpret_cast<Isolate*>(v8_isolate);
Heap* heap = isolate->heap();
@@ -428,10 +370,6 @@
// context even after we have disposed of env.
heap->CollectAllGarbage();
- int file_name_length = StrLength(FLAG_testing_serialization_file) + 10;
- Vector<char> startup_name = Vector<char>::New(file_name_length + 1);
- SNPrintF(startup_name, "%s.startup", FLAG_testing_serialization_file);
-
{
v8::HandleScope handle_scope(v8_isolate);
v8::Local<v8::Context>::New(v8_isolate, env)->Exit();
@@ -454,40 +392,31 @@
SnapshotData startup_snapshot(startup_serializer);
SnapshotData partial_snapshot(partial_serializer);
- WritePayload(partial_snapshot.RawData(), FLAG_testing_serialization_file);
- WritePayload(startup_snapshot.RawData(), startup_name.start());
-
- startup_name.Dispose();
+ *partial_blob_out = WritePayload(partial_snapshot.RawData());
+ *startup_blob_out = WritePayload(startup_snapshot.RawData());
}
v8_isolate->Dispose();
}
-
-UNINITIALIZED_DEPENDENT_TEST(ContextDeserialization, ContextSerialization) {
+UNINITIALIZED_TEST(PartialSerializerContext) {
DisableTurbofan();
- if (DefaultSnapshotAvailable()) return;
- int file_name_length = StrLength(FLAG_testing_serialization_file) + 10;
- Vector<char> startup_name = Vector<char>::New(file_name_length + 1);
- SNPrintF(startup_name, "%s.startup", FLAG_testing_serialization_file);
+ Vector<const byte> startup_blob;
+ Vector<const byte> partial_blob;
+ PartiallySerializeContext(&startup_blob, &partial_blob);
- v8::Isolate* v8_isolate = InitializeFromFile(startup_name.start());
+ v8::Isolate* v8_isolate = InitializeFromBlob(startup_blob);
CHECK(v8_isolate);
- startup_name.Dispose();
+ startup_blob.Dispose();
{
v8::Isolate::Scope isolate_scope(v8_isolate);
- const char* file_name = FLAG_testing_serialization_file;
-
- int snapshot_size = 0;
- byte* snapshot = ReadBytes(file_name, &snapshot_size);
-
Isolate* isolate = reinterpret_cast<Isolate*>(v8_isolate);
HandleScope handle_scope(isolate);
Handle<Object> root;
Handle<JSGlobalProxy> global_proxy =
isolate->factory()->NewUninitializedJSGlobalProxy();
{
- SnapshotData snapshot_data(Vector<const byte>(snapshot, snapshot_size));
+ SnapshotData snapshot_data(partial_blob);
Deserializer deserializer(&snapshot_data);
root = deserializer.DeserializePartial(isolate, global_proxy)
.ToHandleChecked();
@@ -497,22 +426,21 @@
Handle<Object> root2;
{
- SnapshotData snapshot_data(Vector<const byte>(snapshot, snapshot_size));
+ SnapshotData snapshot_data(partial_blob);
Deserializer deserializer(&snapshot_data);
root2 = deserializer.DeserializePartial(isolate, global_proxy)
.ToHandleChecked();
CHECK(root2->IsContext());
CHECK(!root.is_identical_to(root2));
}
- DeleteArray(snapshot);
+ partial_blob.Dispose();
}
v8_isolate->Dispose();
}
-
-UNINITIALIZED_TEST(CustomContextSerialization) {
- DisableTurbofan();
- if (DefaultSnapshotAvailable()) return;
+static void PartiallySerializeCustomContext(
+ Vector<const byte>* startup_blob_out,
+ Vector<const byte>* partial_blob_out) {
v8::Isolate* v8_isolate = TestIsolate::NewInitialized(true);
Isolate* isolate = reinterpret_cast<Isolate*>(v8_isolate);
{
@@ -534,7 +462,8 @@
" e = function(s) { return eval (s); }"
"})();"
"var o = this;"
- "var r = Math.sin(0) + Math.cos(0);"
+ "var r = Math.random();"
+ "var c = Math.sin(0) + Math.cos(0);"
"var f = (function(a, b) { return a + b; }).bind(1, 2, 3);"
"var s = parseInt('12345');");
@@ -559,10 +488,6 @@
// context even after we have disposed of env.
isolate->heap()->CollectAllAvailableGarbage("snapshotting");
- int file_name_length = StrLength(FLAG_testing_serialization_file) + 10;
- Vector<char> startup_name = Vector<char>::New(file_name_length + 1);
- SNPrintF(startup_name, "%s.startup", FLAG_testing_serialization_file);
-
{
v8::HandleScope handle_scope(v8_isolate);
v8::Local<v8::Context>::New(v8_isolate, env)->Exit();
@@ -585,47 +510,43 @@
SnapshotData startup_snapshot(startup_serializer);
SnapshotData partial_snapshot(partial_serializer);
- WritePayload(partial_snapshot.RawData(), FLAG_testing_serialization_file);
- WritePayload(startup_snapshot.RawData(), startup_name.start());
-
- startup_name.Dispose();
+ *partial_blob_out = WritePayload(partial_snapshot.RawData());
+ *startup_blob_out = WritePayload(startup_snapshot.RawData());
}
v8_isolate->Dispose();
}
-
-UNINITIALIZED_DEPENDENT_TEST(CustomContextDeserialization,
- CustomContextSerialization) {
+UNINITIALIZED_TEST(PartialSerializerCustomContext) {
DisableTurbofan();
- FLAG_crankshaft = false;
- if (DefaultSnapshotAvailable()) return;
- int file_name_length = StrLength(FLAG_testing_serialization_file) + 10;
- Vector<char> startup_name = Vector<char>::New(file_name_length + 1);
- SNPrintF(startup_name, "%s.startup", FLAG_testing_serialization_file);
+ Vector<const byte> startup_blob;
+ Vector<const byte> partial_blob;
+ PartiallySerializeCustomContext(&startup_blob, &partial_blob);
- v8::Isolate* v8_isolate = InitializeFromFile(startup_name.start());
+ v8::Isolate* v8_isolate = InitializeFromBlob(startup_blob);
CHECK(v8_isolate);
- startup_name.Dispose();
+ startup_blob.Dispose();
{
v8::Isolate::Scope isolate_scope(v8_isolate);
- const char* file_name = FLAG_testing_serialization_file;
-
- int snapshot_size = 0;
- byte* snapshot = ReadBytes(file_name, &snapshot_size);
-
Isolate* isolate = reinterpret_cast<Isolate*>(v8_isolate);
HandleScope handle_scope(isolate);
Handle<Object> root;
Handle<JSGlobalProxy> global_proxy =
isolate->factory()->NewUninitializedJSGlobalProxy();
{
- SnapshotData snapshot_data(Vector<const byte>(snapshot, snapshot_size));
+ SnapshotData snapshot_data(partial_blob);
Deserializer deserializer(&snapshot_data);
root = deserializer.DeserializePartial(isolate, global_proxy)
.ToHandleChecked();
CHECK(root->IsContext());
Handle<Context> context = Handle<Context>::cast(root);
+
+ // Add context to the weak native context list
+ context->set(Context::NEXT_CONTEXT_LINK,
+ isolate->heap()->native_contexts_list(),
+ UPDATE_WEAK_WRITE_BARRIER);
+ isolate->heap()->set_native_contexts_list(*context);
+
CHECK(context->global_proxy() == *global_proxy);
Handle<String> o = isolate->factory()->NewStringFromAsciiChecked("o");
Handle<JSObject> global_object(context->global_object(), isolate);
@@ -638,7 +559,18 @@
->ToNumber(v8_isolate->GetCurrentContext())
.ToLocalChecked()
->Value();
- CHECK_EQ(1, r);
+ CHECK(0.0 <= r && r < 1.0);
+ // Math.random still works.
+ double random = CompileRun("Math.random()")
+ ->ToNumber(v8_isolate->GetCurrentContext())
+ .ToLocalChecked()
+ ->Value();
+ CHECK(0.0 <= random && random < 1.0);
+ double c = CompileRun("c")
+ ->ToNumber(v8_isolate->GetCurrentContext())
+ .ToLocalChecked()
+ ->Value();
+ CHECK_EQ(1, c);
int f = CompileRun("f()")
->ToNumber(v8_isolate->GetCurrentContext())
.ToLocalChecked()
@@ -669,13 +601,12 @@
.FromJust();
CHECK_EQ(100002, b);
}
- DeleteArray(snapshot);
+ partial_blob.Dispose();
}
v8_isolate->Dispose();
}
-
-TEST(PerIsolateSnapshotBlobs) {
+TEST(CustomSnapshotDataBlob) {
DisableTurbofan();
const char* source1 = "function f() { return 42; }";
const char* source2 =
@@ -729,8 +660,7 @@
args.GetReturnValue().Set(args[0]);
}
-
-TEST(PerIsolateSnapshotBlobsOutdatedContextWithOverflow) {
+TEST(CustomSnapshotDataBlobOutdatedContextWithOverflow) {
DisableTurbofan();
const char* source1 =
@@ -776,8 +706,7 @@
isolate->Dispose();
}
-
-TEST(PerIsolateSnapshotBlobsWithLocker) {
+TEST(CustomSnapshotDataBlobWithLocker) {
DisableTurbofan();
v8::Isolate::CreateParams create_params;
create_params.array_buffer_allocator = CcTest::array_buffer_allocator();
@@ -815,8 +744,7 @@
isolate1->Dispose();
}
-
-TEST(SnapshotBlobsStackOverflow) {
+TEST(CustomSnapshotDataBlobStackOverflow) {
DisableTurbofan();
const char* source =
"var a = [0];"
@@ -855,6 +783,106 @@
isolate->Dispose();
}
+bool IsCompiled(const char* name) {
+ return i::Handle<i::JSFunction>::cast(
+ v8::Utils::OpenHandle(*CompileRun(name)))
+ ->shared()
+ ->is_compiled();
+}
+
+TEST(SnapshotDataBlobWithWarmup) {
+ DisableTurbofan();
+ const char* warmup = "Math.tan(1); Math.sin = 1;";
+
+ v8::StartupData cold = v8::V8::CreateSnapshotDataBlob();
+ v8::StartupData warm = v8::V8::WarmUpSnapshotDataBlob(cold, warmup);
+ delete[] cold.data;
+
+ v8::Isolate::CreateParams params;
+ params.snapshot_blob = &warm;
+ params.array_buffer_allocator = CcTest::array_buffer_allocator();
+
+ v8::Isolate* isolate = v8::Isolate::New(params);
+ {
+ v8::Isolate::Scope i_scope(isolate);
+ v8::HandleScope h_scope(isolate);
+ v8::Local<v8::Context> context = v8::Context::New(isolate);
+ delete[] warm.data;
+ v8::Context::Scope c_scope(context);
+ // Running the warmup script has effect on whether functions are
+ // pre-compiled, but does not pollute the context.
+ CHECK(IsCompiled("Math.tan"));
+ CHECK(!IsCompiled("Math.cos"));
+ CHECK(CompileRun("Math.sin")->IsFunction());
+ }
+ isolate->Dispose();
+}
+
+TEST(CustomSnapshotDataBlobWithWarmup) {
+ DisableTurbofan();
+ const char* source =
+ "function f() { return Math.sin(1); }\n"
+ "function g() { return Math.cos(1); }\n"
+ "Math.tan(1);"
+ "var a = 5";
+ const char* warmup = "a = f()";
+
+ v8::StartupData cold = v8::V8::CreateSnapshotDataBlob(source);
+ v8::StartupData warm = v8::V8::WarmUpSnapshotDataBlob(cold, warmup);
+ delete[] cold.data;
+
+ v8::Isolate::CreateParams params;
+ params.snapshot_blob = &warm;
+ params.array_buffer_allocator = CcTest::array_buffer_allocator();
+
+ v8::Isolate* isolate = v8::Isolate::New(params);
+ {
+ v8::Isolate::Scope i_scope(isolate);
+ v8::HandleScope h_scope(isolate);
+ v8::Local<v8::Context> context = v8::Context::New(isolate);
+ delete[] warm.data;
+ v8::Context::Scope c_scope(context);
+ // Running the warmup script has effect on whether functions are
+ // pre-compiled, but does not pollute the context.
+ CHECK(IsCompiled("f"));
+ CHECK(IsCompiled("Math.sin"));
+ CHECK(!IsCompiled("g"));
+ CHECK(!IsCompiled("Math.cos"));
+ CHECK(!IsCompiled("Math.tan"));
+ CHECK_EQ(5, CompileRun("a")->Int32Value(context).FromJust());
+ }
+ isolate->Dispose();
+}
+
+TEST(CustomSnapshotDataBlobImmortalImmovableRoots) {
+ DisableTurbofan();
+ // Flood the startup snapshot with shared function infos. If they are
+ // serialized before the immortal immovable root, the root will no longer end
+ // up on the first page.
+ Vector<const uint8_t> source =
+ ConstructSource(STATIC_CHAR_VECTOR("var a = [];"),
+ STATIC_CHAR_VECTOR("a.push(function() {return 7});"),
+ STATIC_CHAR_VECTOR("\0"), 10000);
+
+ v8::StartupData data = v8::V8::CreateSnapshotDataBlob(
+ reinterpret_cast<const char*>(source.start()));
+
+ v8::Isolate::CreateParams params;
+ params.snapshot_blob = &data;
+ params.array_buffer_allocator = CcTest::array_buffer_allocator();
+
+ v8::Isolate* isolate = v8::Isolate::New(params);
+ {
+ v8::Isolate::Scope i_scope(isolate);
+ v8::HandleScope h_scope(isolate);
+ v8::Local<v8::Context> context = v8::Context::New(isolate);
+ delete[] data.data; // We can dispose of the snapshot blob now.
+ v8::Context::Scope c_scope(context);
+ CHECK_EQ(7, CompileRun("a[0]()")->Int32Value(context).FromJust());
+ }
+ isolate->Dispose();
+ source.Dispose();
+}
TEST(TestThatAlwaysSucceeds) {
}
@@ -866,12 +894,6 @@
}
-DEPENDENT_TEST(DependentTestThatAlwaysFails, TestThatAlwaysSucceeds) {
- bool ArtificialFailure2 = false;
- CHECK(ArtificialFailure2);
-}
-
-
int CountBuiltins() {
// Check that we have not deserialized any additional builtin.
HeapIterator iterator(CcTest::heap());
@@ -887,14 +909,13 @@
static Handle<SharedFunctionInfo> CompileScript(
Isolate* isolate, Handle<String> source, Handle<String> name,
ScriptData** cached_data, v8::ScriptCompiler::CompileOptions options) {
- return Compiler::CompileScript(
+ return Compiler::GetSharedFunctionInfoForScript(
source, name, 0, 0, v8::ScriptOriginOptions(), Handle<Object>(),
Handle<Context>(isolate->native_context()), NULL, cached_data, options,
NOT_NATIVES_CODE, false);
}
-
-TEST(SerializeToplevelOnePlusOne) {
+TEST(CodeSerializerOnePlusOne) {
FLAG_serialize_toplevel = true;
LocalContext context;
Isolate* isolate = CcTest::i_isolate();
@@ -944,8 +965,7 @@
delete cache;
}
-
-TEST(CodeCachePromotedToCompilationCache) {
+TEST(CodeSerializerPromotedToCompilationCache) {
FLAG_serialize_toplevel = true;
LocalContext context;
Isolate* isolate = CcTest::i_isolate();
@@ -975,8 +995,7 @@
delete cache;
}
-
-TEST(SerializeToplevelInternalizedString) {
+TEST(CodeSerializerInternalizedString) {
FLAG_serialize_toplevel = true;
LocalContext context;
Isolate* isolate = CcTest::i_isolate();
@@ -1035,8 +1054,7 @@
delete cache;
}
-
-TEST(SerializeToplevelLargeCodeObject) {
+TEST(CodeSerializerLargeCodeObject) {
FLAG_serialize_toplevel = true;
LocalContext context;
Isolate* isolate = CcTest::i_isolate();
@@ -1083,8 +1101,7 @@
source.Dispose();
}
-
-TEST(SerializeToplevelLargeStrings) {
+TEST(CodeSerializerLargeStrings) {
FLAG_serialize_toplevel = true;
LocalContext context;
Isolate* isolate = CcTest::i_isolate();
@@ -1141,8 +1158,7 @@
source_t.Dispose();
}
-
-TEST(SerializeToplevelThreeBigStrings) {
+TEST(CodeSerializerThreeBigStrings) {
FLAG_serialize_toplevel = true;
LocalContext context;
Isolate* isolate = CcTest::i_isolate();
@@ -1252,8 +1268,7 @@
size_t length_;
};
-
-TEST(SerializeToplevelExternalString) {
+TEST(CodeSerializerExternalString) {
FLAG_serialize_toplevel = true;
LocalContext context;
Isolate* isolate = CcTest::i_isolate();
@@ -1315,8 +1330,7 @@
delete cache;
}
-
-TEST(SerializeToplevelLargeExternalString) {
+TEST(CodeSerializerLargeExternalString) {
FLAG_serialize_toplevel = true;
LocalContext context;
Isolate* isolate = CcTest::i_isolate();
@@ -1374,8 +1388,7 @@
string.Dispose();
}
-
-TEST(SerializeToplevelExternalScriptName) {
+TEST(CodeSerializerExternalScriptName) {
FLAG_serialize_toplevel = true;
LocalContext context;
Isolate* isolate = CcTest::i_isolate();
@@ -1474,8 +1487,7 @@
return cache;
}
-
-TEST(SerializeToplevelIsolates) {
+TEST(CodeSerializerIsolates) {
FLAG_serialize_toplevel = true;
const char* source = "function f() { return 'abc'; }; f() + 'def'";
@@ -1516,8 +1528,7 @@
isolate2->Dispose();
}
-
-TEST(SerializeToplevelFlagChange) {
+TEST(CodeSerializerFlagChange) {
FLAG_serialize_toplevel = true;
const char* source = "function f() { return 'abc'; }; f() + 'def'";
@@ -1546,8 +1557,7 @@
isolate2->Dispose();
}
-
-TEST(SerializeToplevelBitFlip) {
+TEST(CodeSerializerBitFlip) {
FLAG_serialize_toplevel = true;
const char* source = "function f() { return 'abc'; }; f() + 'def'";
@@ -1576,8 +1586,7 @@
isolate2->Dispose();
}
-
-TEST(SerializeWithHarmonyScoping) {
+TEST(CodeSerializerWithHarmonyScoping) {
FLAG_serialize_toplevel = true;
const char* source1 = "'use strict'; let x = 'X'";
@@ -1655,11 +1664,16 @@
isolate2->Dispose();
}
-
-TEST(SerializeInternalReference) {
+TEST(CodeSerializerInternalReference) {
#if V8_TARGET_ARCH_ARM || V8_TARGET_ARCH_ARM64
return;
#endif
+ // In ignition there are only relative jumps, so the following code
+ // would not have any internal references. This test is not relevant
+ // for ignition.
+ if (FLAG_ignition) {
+ return;
+ }
// Disable experimental natives that are loaded after deserialization.
FLAG_function_context_specialization = false;
FLAG_always_opt = true;
@@ -1740,11 +1754,65 @@
isolate->Dispose();
}
+TEST(CodeSerializerEagerCompilationAndPreAge) {
+ if (FLAG_ignition) return;
+
+ FLAG_lazy = true;
+ FLAG_serialize_toplevel = true;
+ FLAG_serialize_age_code = true;
+ FLAG_serialize_eager = true;
+ FLAG_min_preparse_length = 1;
+
+ static const char* source =
+ "function f() {"
+ " function g() {"
+ " return 1;"
+ " }"
+ " return g();"
+ "}"
+ "'abcdef';";
+
+ v8::ScriptCompiler::CachedData* cache = ProduceCache(source);
+
+ v8::Isolate::CreateParams create_params;
+ create_params.array_buffer_allocator = CcTest::array_buffer_allocator();
+ v8::Isolate* isolate2 = v8::Isolate::New(create_params);
+ {
+ v8::Isolate::Scope iscope(isolate2);
+ v8::HandleScope scope(isolate2);
+ v8::Local<v8::Context> context = v8::Context::New(isolate2);
+ v8::Context::Scope context_scope(context);
+
+ v8::Local<v8::String> source_str = v8_str(source);
+ v8::ScriptOrigin origin(v8_str("test"));
+ v8::ScriptCompiler::Source source(source_str, origin, cache);
+ v8::Local<v8::UnboundScript> unbound =
+ v8::ScriptCompiler::CompileUnboundScript(
+ isolate2, &source, v8::ScriptCompiler::kConsumeCodeCache)
+ .ToLocalChecked();
+
+ CHECK(!cache->rejected);
+
+ Isolate* i_isolate = reinterpret_cast<Isolate*>(isolate2);
+ HandleScope i_scope(i_isolate);
+ Handle<SharedFunctionInfo> toplevel = v8::Utils::OpenHandle(*unbound);
+ Handle<Script> script(Script::cast(toplevel->script()));
+ WeakFixedArray::Iterator iterator(script->shared_function_infos());
+ // Every function has been pre-compiled from the code cache.
+ int count = 0;
+ while (SharedFunctionInfo* shared = iterator.Next<SharedFunctionInfo>()) {
+ CHECK(shared->is_compiled());
+ CHECK_EQ(Code::kPreAgedCodeAge, shared->code()->GetAge());
+ count++;
+ }
+ CHECK_EQ(3, count);
+ }
+ isolate2->Dispose();
+}
TEST(Regress503552) {
// Test that the code serializer can deal with weak cells that form a linked
// list during incremental marking.
-
CcTest::InitializeVM();
Isolate* isolate = CcTest::i_isolate();
@@ -1752,7 +1820,7 @@
Handle<String> source = isolate->factory()->NewStringFromAsciiChecked(
"function f() {} function g() {}");
ScriptData* script_data = NULL;
- Handle<SharedFunctionInfo> shared = Compiler::CompileScript(
+ Handle<SharedFunctionInfo> shared = Compiler::GetSharedFunctionInfoForScript(
source, Handle<String>(), 0, 0, v8::ScriptOriginOptions(),
Handle<Object>(), Handle<Context>(isolate->native_context()), NULL,
&script_data, v8::ScriptCompiler::kProduceCodeCache, NOT_NATIVES_CODE,
diff --git a/test/cctest/test-strings.cc b/test/cctest/test-strings.cc
index e992f33..770042d 100644
--- a/test/cctest/test-strings.cc
+++ b/test/cctest/test-strings.cc
@@ -1508,3 +1508,25 @@
"'arg0' returned for property 'arg1' of object 'arg2' is not a function");
CHECK(String::Equals(result, expected));
}
+
+TEST(Regress609831) {
+ CcTest::InitializeVM();
+ LocalContext context;
+ Isolate* isolate = CcTest::i_isolate();
+ {
+ HandleScope scope(isolate);
+ v8::Local<v8::Value> result = CompileRun(
+ "String.fromCharCode(32, 32, 32, 32, 32, "
+ "32, 32, 32, 32, 32, 32, 32, 32, 32, 32, "
+ "32, 32, 32, 32, 32, 32, 32, 32, 32, 32)");
+ CHECK(v8::Utils::OpenHandle(*result)->IsSeqOneByteString());
+ }
+ {
+ HandleScope scope(isolate);
+ v8::Local<v8::Value> result = CompileRun(
+ "String.fromCharCode(432, 432, 432, 432, 432, "
+ "432, 432, 432, 432, 432, 432, 432, 432, 432, "
+ "432, 432, 432, 432, 432, 432, 432, 432, 432)");
+ CHECK(v8::Utils::OpenHandle(*result)->IsSeqTwoByteString());
+ }
+}
diff --git a/test/cctest/test-thread-termination.cc b/test/cctest/test-thread-termination.cc
index 05a3c33..85dfd13 100644
--- a/test/cctest/test-thread-termination.cc
+++ b/test/cctest/test-thread-termination.cc
@@ -403,7 +403,7 @@
thread.Start();
v8::Isolate* isolate = CcTest::isolate();
- isolate->SetAutorunMicrotasks(false);
+ isolate->SetMicrotasksPolicy(v8::MicrotasksPolicy::kExplicit);
v8::HandleScope scope(isolate);
v8::Local<v8::ObjectTemplate> global =
CreateGlobalTemplate(CcTest::isolate(), Signal, DoLoop);
diff --git a/test/cctest/test-trace-event.cc b/test/cctest/test-trace-event.cc
index a889e08..190cb40 100644
--- a/test/cctest/test-trace-event.cc
+++ b/test/cctest/test-trace-event.cc
@@ -72,8 +72,8 @@
void PerformDelayedTask() {}
uint64_t AddTraceEvent(char phase, const uint8_t* category_enabled_flag,
- const char* name, uint64_t id, uint64_t bind_id,
- int num_args, const char** arg_names,
+ const char* name, const char* scope, uint64_t id,
+ uint64_t bind_id, int num_args, const char** arg_names,
const uint8_t* arg_types, const uint64_t* arg_values,
unsigned int flags) override {
MockTraceObject* to = new MockTraceObject(phase, std::string(name), id,
@@ -256,3 +256,27 @@
i::V8::SetPlatformForTesting(old_platform);
}
+
+TEST(TestEventInContext) {
+ v8::Platform* old_platform = i::V8::GetCurrentPlatform();
+ MockTracingPlatform platform(old_platform);
+ i::V8::SetPlatformForTesting(&platform);
+
+ static uint64_t isolate_id = 0x20151021;
+ {
+ TRACE_EVENT_SCOPED_CONTEXT("v8-cat", "Isolate", isolate_id);
+ TRACE_EVENT0("v8-cat", "e");
+ }
+
+ CHECK_EQ(3, GET_TRACE_OBJECTS_LIST->length());
+ CHECK_EQ(TRACE_EVENT_PHASE_ENTER_CONTEXT, GET_TRACE_OBJECT(0)->phase);
+ CHECK_EQ("Isolate", GET_TRACE_OBJECT(0)->name);
+ CHECK_EQ(isolate_id, GET_TRACE_OBJECT(0)->id);
+ CHECK_EQ(TRACE_EVENT_PHASE_COMPLETE, GET_TRACE_OBJECT(1)->phase);
+ CHECK_EQ("e", GET_TRACE_OBJECT(1)->name);
+ CHECK_EQ(TRACE_EVENT_PHASE_LEAVE_CONTEXT, GET_TRACE_OBJECT(2)->phase);
+ CHECK_EQ("Isolate", GET_TRACE_OBJECT(2)->name);
+ CHECK_EQ(isolate_id, GET_TRACE_OBJECT(2)->id);
+
+ i::V8::SetPlatformForTesting(old_platform);
+}
diff --git a/test/cctest/test-types.cc b/test/cctest/test-types.cc
index 2e658b0..7b7706f 100644
--- a/test/cctest/test-types.cc
+++ b/test/cctest/test-types.cc
@@ -40,7 +40,7 @@
Tests()
: isolate(CcTest::InitIsolateOnce()),
scope(isolate),
- zone(),
+ zone(isolate->allocator()),
T(&zone, isolate, isolate->random_number_generator()) {}
bool IsBitset(Type* type) { return type->IsBitsetForTesting(); }
@@ -941,7 +941,7 @@
CheckSub(T.Object, T.Receiver);
CheckSub(T.Proxy, T.Receiver);
CheckSub(T.OtherObject, T.Object);
- CheckSub(T.Undetectable, T.Object);
+ CheckSub(T.OtherUndetectable, T.Object);
CheckSub(T.OtherObject, T.Object);
CheckUnordered(T.Object, T.Proxy);
diff --git a/test/cctest/test-unboxed-doubles.cc b/test/cctest/test-unboxed-doubles.cc
index f195a31..7fc9b5b 100644
--- a/test/cctest/test-unboxed-doubles.cc
+++ b/test/cctest/test-unboxed-doubles.cc
@@ -12,7 +12,6 @@
#include "src/factory.h"
#include "src/field-type.h"
#include "src/global-handles.h"
-#include "src/heap/slots-buffer.h"
#include "src/ic/ic.h"
#include "src/macro-assembler.h"
#include "test/cctest/cctest.h"
@@ -1114,8 +1113,7 @@
AlwaysAllocateScope always_allocate(isolate);
// Make sure |obj_value| is placed on an old-space evacuation candidate.
SimulateFullSpace(old_space);
- obj_value = factory->NewJSArray(32 * KB, FAST_HOLEY_ELEMENTS,
- Strength::WEAK, TENURED);
+ obj_value = factory->NewJSArray(32 * KB, FAST_HOLEY_ELEMENTS, TENURED);
ec_page = Page::FromAddress(obj_value->address());
}
@@ -1454,8 +1452,7 @@
// Make sure |obj_value| is placed on an old-space evacuation candidate.
SimulateFullSpace(old_space);
- obj_value = factory->NewJSArray(32 * KB, FAST_HOLEY_ELEMENTS,
- Strength::WEAK, TENURED);
+ obj_value = factory->NewJSArray(32 * KB, FAST_HOLEY_ELEMENTS, TENURED);
ec_page = Page::FromAddress(obj_value->address());
CHECK_NE(ec_page, Page::FromAddress(obj->address()));
}
@@ -1474,18 +1471,11 @@
CHECK(Marking::IsBlack(Marking::MarkBitFrom(*obj_value)));
CHECK(MarkCompactCollector::IsOnEvacuationCandidate(*obj_value));
- // Trigger incremental write barrier, which should add a slot to |ec_page|'s
- // slots buffer.
+ // Trigger incremental write barrier, which should add a slot to remembered
+ // set.
{
- int slots_buffer_len = SlotsBuffer::SizeOfChain(ec_page->slots_buffer());
FieldIndex index = FieldIndex::ForDescriptor(*map, tagged_descriptor);
- const int n = SlotsBuffer::kNumberOfElements + 10;
- for (int i = 0; i < n; i++) {
- obj->FastPropertyAtPut(index, *obj_value);
- }
- // Ensure that the slot was actually added to the |ec_page|'s slots buffer.
- CHECK_EQ(slots_buffer_len + n,
- SlotsBuffer::SizeOfChain(ec_page->slots_buffer()));
+ obj->FastPropertyAtPut(index, *obj_value);
}
// Migrate |obj| to |new_map| which should shift fields and put the
diff --git a/test/cctest/test-unique.cc b/test/cctest/test-unique.cc
index 207c245..d842794 100644
--- a/test/cctest/test-unique.cc
+++ b/test/cctest/test-unique.cc
@@ -143,7 +143,7 @@
MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
MAKE_UNIQUES_A_B_C;
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
UniqueSet<String>* set = new(&zone) UniqueSet<String>();
@@ -170,7 +170,7 @@
MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
MAKE_UNIQUES_A_B_C;
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
UniqueSet<String>* set = new(&zone) UniqueSet<String>();
@@ -210,7 +210,7 @@
MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
MAKE_UNIQUES_A_B_C;
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
UniqueSet<String>* set = new(&zone) UniqueSet<String>();
@@ -241,7 +241,7 @@
MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
MAKE_UNIQUES_A_B_C;
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
UniqueSet<String>* set = new(&zone) UniqueSet<String>();
@@ -278,7 +278,7 @@
MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
MAKE_UNIQUES_A_B_C;
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
UniqueSet<String>* set1 = new(&zone) UniqueSet<String>();
UniqueSet<String>* set2 = new(&zone) UniqueSet<String>();
@@ -316,7 +316,7 @@
MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
MAKE_UNIQUES_A_B_C;
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
UniqueSet<String>* set1 = new(&zone) UniqueSet<String>();
UniqueSet<String>* set2 = new(&zone) UniqueSet<String>();
@@ -351,7 +351,7 @@
MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
MAKE_UNIQUES_A_B_C_D_E_F_G;
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
UniqueSet<String>* set1 = new(&zone) UniqueSet<String>();
UniqueSet<String>* set2 = new(&zone) UniqueSet<String>();
@@ -394,7 +394,7 @@
MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
MAKE_UNIQUES_A_B_C_D_E_F_G;
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
Unique<String> elements[] = {
A, B, C, D, E, F, G
@@ -417,7 +417,7 @@
MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
MAKE_UNIQUES_A_B_C;
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
UniqueSet<String>* set1 = new(&zone) UniqueSet<String>();
UniqueSet<String>* set2 = new(&zone) UniqueSet<String>();
@@ -458,7 +458,7 @@
MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
MAKE_UNIQUES_A_B_C_D_E_F_G;
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
Unique<String> elements[] = {
A, B, C, D, E, F, G
@@ -485,7 +485,7 @@
MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
MAKE_UNIQUES_A_B_C;
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
UniqueSet<String>* set1 = new(&zone) UniqueSet<String>();
UniqueSet<String>* set2 = new(&zone) UniqueSet<String>();
@@ -526,7 +526,7 @@
MAKE_HANDLES_AND_DISALLOW_ALLOCATION;
MAKE_UNIQUES_A_B_C_D_E_F_G;
- Zone zone;
+ Zone zone(CcTest::i_isolate()->allocator());
Unique<String> elements[] = {
A, B, C, D, E, F, G
diff --git a/test/cctest/test-utils.cc b/test/cctest/test-utils.cc
index 5045b7e..00702a5 100644
--- a/test/cctest/test-utils.cc
+++ b/test/cctest/test-utils.cc
@@ -32,6 +32,7 @@
#include "src/v8.h"
#include "src/base/platform/platform.h"
+#include "src/collector.h"
#include "test/cctest/cctest.h"
using namespace v8::internal;
diff --git a/test/cctest/testcfg.py b/test/cctest/testcfg.py
index d28ef7d..36db837 100644
--- a/test/cctest/testcfg.py
+++ b/test/cctest/testcfg.py
@@ -42,15 +42,6 @@
build_dir = "build"
else:
build_dir = "out"
- self.serdes_dir = os.path.normpath(
- os.path.join(root, "..", "..", build_dir, ".serdes"))
-
- def SetupWorkingDirectory(self):
- # This is only called once per machine, while init above is called once per
- # process.
- if os.path.exists(self.serdes_dir):
- shutil.rmtree(self.serdes_dir, True)
- os.makedirs(self.serdes_dir)
def ListTests(self, context):
shell = os.path.abspath(os.path.join(context.shell_dir, self.shell()))
@@ -65,26 +56,14 @@
return []
tests = []
for test_desc in output.stdout.strip().split():
- if test_desc.find('<') < 0:
- # Native Client output can contain a few non-test arguments
- # before the tests. Skip these.
- continue
- raw_test, dependency = test_desc.split('<')
- if dependency != '':
- dependency = raw_test.split('/')[0] + '/' + dependency
- else:
- dependency = None
- test = testcase.TestCase(self, raw_test, dependency=dependency)
+ test = testcase.TestCase(self, test_desc)
tests.append(test)
- tests.sort()
+ tests.sort(key=lambda t: t.path)
return tests
def GetFlagsForTestCase(self, testcase, context):
testname = testcase.path.split(os.path.sep)[-1]
- serialization_file = os.path.join(self.serdes_dir, "serdes_" + testname)
- serialization_file += ''.join(testcase.flags).replace('-', '_')
- return (testcase.flags + [testcase.path] + context.mode_flags +
- ["--testing_serialization_file=" + serialization_file])
+ return (testcase.flags + [testcase.path] + context.mode_flags)
def shell(self):
return "cctest"
diff --git a/test/cctest/wasm/test-run-wasm-64.cc b/test/cctest/wasm/test-run-wasm-64.cc
new file mode 100644
index 0000000..784f21a
--- /dev/null
+++ b/test/cctest/wasm/test-run-wasm-64.cc
@@ -0,0 +1,1360 @@
+// Copyright 2015 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include <stdint.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "src/base/bits.h"
+#include "src/wasm/wasm-macro-gen.h"
+
+#include "test/cctest/cctest.h"
+#include "test/cctest/compiler/value-helper.h"
+#include "test/cctest/wasm/test-signatures.h"
+#include "test/cctest/wasm/wasm-run-utils.h"
+
+#define CHECK_TRAP32(x) \
+ CHECK_EQ(0xdeadbeef, (bit_cast<uint32_t>(x)) & 0xFFFFFFFF)
+#define CHECK_TRAP64(x) \
+ CHECK_EQ(0xdeadbeefdeadbeef, (bit_cast<uint64_t>(x)) & 0xFFFFFFFFFFFFFFFF)
+#define CHECK_TRAP(x) CHECK_TRAP32(x)
+
+#define asi64(x) static_cast<int64_t>(x)
+
+#define asu64(x) static_cast<uint64_t>(x)
+
+#define B2(a, b) kExprBlock, 2, a, b
+#define B1(a) kExprBlock, 1, a
+
+// Can't bridge macro land with nested macros.
+#if V8_TARGET_ARCH_MIPS || V8_TARGET_ARCH_X87
+#define MIPS_OR_X87 true
+#else
+#define MIPS_OR_X87 false
+#endif
+
+#if V8_TARGET_ARCH_MIPS || V8_TARGET_ARCH_X87 || V8_TARGET_ARCH_ARM
+#define MIPS_OR_ARM_OR_X87 true
+#else
+#define MIPS_OR_ARM_OR_X87 false
+#endif
+
+#define FOREACH_I64_OPERATOR(V) \
+ V(DepthFirst, true) \
+ V(I64Phi, true) \
+ V(I64Const, true) \
+ V(I64Return, true) \
+ V(I64Param, true) \
+ V(I64LoadStore, true) \
+ V(I64Add, !MIPS_OR_X87) \
+ V(I64Sub, !MIPS_OR_X87) \
+ V(I64Mul, !MIPS_OR_X87) \
+ V(I64DivS, true) \
+ V(I64DivU, true) \
+ V(I64RemS, true) \
+ V(I64RemU, true) \
+ V(I64And, true) \
+ V(I64Ior, true) \
+ V(I64Xor, true) \
+ V(I64Shl, !MIPS_OR_X87) \
+ V(I64ShrU, !MIPS_OR_X87) \
+ V(I64ShrS, !MIPS_OR_X87) \
+ V(I64Eq, true) \
+ V(I64Ne, true) \
+ V(I64LtS, true) \
+ V(I64LeS, true) \
+ V(I64LtU, true) \
+ V(I64LeU, true) \
+ V(I64GtS, true) \
+ V(I64GeS, true) \
+ V(I64GtU, true) \
+ V(I64GeU, true) \
+ V(I64Ctz, true) \
+ V(I64Clz, true) \
+ V(I64Popcnt, !MIPS_OR_X87) \
+ V(I32ConvertI64, true) \
+ V(I64SConvertF32, true) \
+ V(I64SConvertF64, true) \
+ V(I64UConvertF32, true) \
+ V(I64UConvertF64, true) \
+ V(I64SConvertI32, true) \
+ V(I64UConvertI32, true) \
+ V(F32SConvertI64, true) \
+ V(F32UConvertI64, true) \
+ V(F64SConvertI64, true) \
+ V(F64UConvertI64, true) \
+ V(F64ReinterpretI64, true) \
+ V(I64ReinterpretF64, true) \
+ V(I64Ror, true) \
+ V(I64Rol, true)
+
+#define DECLARE_CONST(name, cond) static const bool kSupported_##name = cond;
+FOREACH_I64_OPERATOR(DECLARE_CONST)
+#undef DECLARE_CONST
+
+#define REQUIRE(name) \
+ if (!WASM_64 && !kSupported_##name) return
+
+TEST(Run_Wasm_I64Const) {
+ REQUIRE(I64Const);
+ WasmRunner<int64_t> r;
+ const int64_t kExpectedValue = 0x1122334455667788LL;
+ // return(kExpectedValue)
+ BUILD(r, WASM_I64V_9(kExpectedValue));
+ CHECK_EQ(kExpectedValue, r.Call());
+}
+
+TEST(Run_Wasm_I64Const_many) {
+ REQUIRE(I64Const);
+ int cntr = 0;
+ FOR_INT32_INPUTS(i) {
+ WasmRunner<int64_t> r;
+ const int64_t kExpectedValue = (static_cast<int64_t>(*i) << 32) | cntr;
+ // return(kExpectedValue)
+ BUILD(r, WASM_I64V(kExpectedValue));
+ CHECK_EQ(kExpectedValue, r.Call());
+ cntr++;
+ }
+}
+
+TEST(Run_Wasm_Return_I64) {
+ REQUIRE(I64Return);
+ WasmRunner<int64_t> r(MachineType::Int64());
+
+ BUILD(r, WASM_RETURN(WASM_GET_LOCAL(0)));
+
+ FOR_INT64_INPUTS(i) { CHECK_EQ(*i, r.Call(*i)); }
+}
+
+// todo(ahaas): I added a list of missing instructions here to make merging
+// easier when I do them one by one.
+// kExprI64Add:
+TEST(Run_WasmI64Add) {
+ REQUIRE(I64Add);
+ WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_ADD(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ FOR_INT64_INPUTS(i) {
+ FOR_INT64_INPUTS(j) { CHECK_EQ(*i + *j, r.Call(*i, *j)); }
+ }
+}
+// kExprI64Sub:
+TEST(Run_Wasm_I64Sub) {
+ REQUIRE(I64Sub);
+ WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_SUB(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ FOR_INT64_INPUTS(i) {
+ FOR_INT64_INPUTS(j) { CHECK_EQ(*i - *j, r.Call(*i, *j)); }
+ }
+}
+// kExprI64Mul:
+// kExprI64DivS:
+
+TEST(Run_WasmI64DivS) {
+ REQUIRE(I64DivS);
+ WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_DIVS(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ FOR_INT64_INPUTS(i) {
+ FOR_INT64_INPUTS(j) {
+ if (*j == 0) {
+ CHECK_TRAP64(r.Call(*i, *j));
+ } else if (*j == -1 && *i == std::numeric_limits<int64_t>::min()) {
+ CHECK_TRAP64(r.Call(*i, *j));
+ } else {
+ CHECK_EQ(*i / *j, r.Call(*i, *j));
+ }
+ }
+ }
+}
+
+TEST(Run_WasmI64DivS_Trap) {
+ REQUIRE(I64DivS);
+ WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_DIVS(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ CHECK_EQ(0, r.Call(asi64(0), asi64(100)));
+ CHECK_TRAP64(r.Call(asi64(100), asi64(0)));
+ CHECK_TRAP64(r.Call(asi64(-1001), asi64(0)));
+ CHECK_TRAP64(r.Call(std::numeric_limits<int64_t>::min(), asi64(-1)));
+ CHECK_TRAP64(r.Call(std::numeric_limits<int64_t>::min(), asi64(0)));
+}
+
+TEST(Run_WasmI64DivS_Byzero_Const) {
+ REQUIRE(I64DivS);
+ for (int8_t denom = -2; denom < 8; denom++) {
+ WasmRunner<int64_t> r(MachineType::Int64());
+ BUILD(r, WASM_I64_DIVS(WASM_GET_LOCAL(0), WASM_I64V_1(denom)));
+ for (int64_t val = -7; val < 8; val++) {
+ if (denom == 0) {
+ CHECK_TRAP64(r.Call(val));
+ } else {
+ CHECK_EQ(val / denom, r.Call(val));
+ }
+ }
+ }
+}
+// kExprI64DivU:
+
+TEST(Run_WasmI64DivU) {
+ REQUIRE(I64DivU);
+ WasmRunner<uint64_t> r(MachineType::Uint64(), MachineType::Uint64());
+ BUILD(r, WASM_I64_DIVU(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ FOR_UINT64_INPUTS(i) {
+ FOR_UINT64_INPUTS(j) {
+ if (*j == 0) {
+ CHECK_TRAP64(r.Call(*i, *j));
+ } else {
+ CHECK_EQ(*i / *j, r.Call(*i, *j));
+ }
+ }
+ }
+}
+
+TEST(Run_WasmI64DivU_Trap) {
+ REQUIRE(I64DivU);
+ WasmRunner<uint64_t> r(MachineType::Uint64(), MachineType::Uint64());
+ BUILD(r, WASM_I64_DIVU(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ CHECK_EQ(0, r.Call(asu64(0), asu64(100)));
+ CHECK_TRAP64(r.Call(asu64(100), asu64(0)));
+ CHECK_TRAP64(r.Call(asu64(1001), asu64(0)));
+ CHECK_TRAP64(r.Call(std::numeric_limits<uint64_t>::max(), asu64(0)));
+}
+
+TEST(Run_WasmI64DivU_Byzero_Const) {
+ REQUIRE(I64DivU);
+ for (uint64_t denom = 0xfffffffffffffffe; denom < 8; denom++) {
+ WasmRunner<uint64_t> r(MachineType::Uint64());
+ BUILD(r, WASM_I64_DIVU(WASM_GET_LOCAL(0), WASM_I64V_1(denom)));
+
+ for (uint64_t val = 0xfffffffffffffff0; val < 8; val++) {
+ if (denom == 0) {
+ CHECK_TRAP64(r.Call(val));
+ } else {
+ CHECK_EQ(val / denom, r.Call(val));
+ }
+ }
+ }
+}
+// kExprI64RemS:
+TEST(Run_WasmI64RemS) {
+ REQUIRE(I64RemS);
+ WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_REMS(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ FOR_INT64_INPUTS(i) {
+ FOR_INT64_INPUTS(j) {
+ if (*j == 0) {
+ CHECK_TRAP64(r.Call(*i, *j));
+ } else {
+ CHECK_EQ(*i % *j, r.Call(*i, *j));
+ }
+ }
+ }
+}
+
+TEST(Run_WasmI64RemS_Trap) {
+ REQUIRE(I64RemS);
+ WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_REMS(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ CHECK_EQ(33, r.Call(asi64(133), asi64(100)));
+ CHECK_EQ(0, r.Call(std::numeric_limits<int64_t>::min(), asi64(-1)));
+ CHECK_TRAP64(r.Call(asi64(100), asi64(0)));
+ CHECK_TRAP64(r.Call(asi64(-1001), asi64(0)));
+ CHECK_TRAP64(r.Call(std::numeric_limits<int64_t>::min(), asi64(0)));
+}
+
+// kExprI64RemU:
+TEST(Run_WasmI64RemU) {
+ REQUIRE(I64RemU);
+ WasmRunner<uint64_t> r(MachineType::Uint64(), MachineType::Uint64());
+ BUILD(r, WASM_I64_REMU(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ FOR_UINT64_INPUTS(i) {
+ FOR_UINT64_INPUTS(j) {
+ if (*j == 0) {
+ CHECK_TRAP64(r.Call(*i, *j));
+ } else {
+ CHECK_EQ(*i % *j, r.Call(*i, *j));
+ }
+ }
+ }
+}
+
+TEST(Run_Wasm_I64RemU_Trap) {
+ REQUIRE(I64RemU);
+ WasmRunner<uint64_t> r(MachineType::Uint64(), MachineType::Uint64());
+ BUILD(r, WASM_I64_REMU(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ CHECK_EQ(17, r.Call(asu64(217), asu64(100)));
+ CHECK_TRAP64(r.Call(asu64(100), asu64(0)));
+ CHECK_TRAP64(r.Call(asu64(1001), asu64(0)));
+ CHECK_TRAP64(r.Call(std::numeric_limits<uint64_t>::max(), asu64(0)));
+}
+
+// kExprI64And:
+TEST(Run_Wasm_I64And) {
+ REQUIRE(I64And);
+ WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_AND(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ FOR_INT64_INPUTS(i) {
+ FOR_INT64_INPUTS(j) { CHECK_EQ((*i) & (*j), r.Call(*i, *j)); }
+ }
+}
+// kExprI64Ior:
+TEST(Run_Wasm_I64Ior) {
+ REQUIRE(I64Ior);
+ WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_IOR(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ FOR_INT64_INPUTS(i) {
+ FOR_INT64_INPUTS(j) { CHECK_EQ((*i) | (*j), r.Call(*i, *j)); }
+ }
+}
+// kExprI64Xor:
+TEST(Run_Wasm_I64Xor) {
+ REQUIRE(I64Xor);
+ WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_XOR(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ FOR_INT64_INPUTS(i) {
+ FOR_INT64_INPUTS(j) { CHECK_EQ((*i) ^ (*j), r.Call(*i, *j)); }
+ }
+}
+// kExprI64Shl:
+TEST(Run_Wasm_I64Shl) {
+ REQUIRE(I64Shl);
+ {
+ WasmRunner<uint64_t> r(MachineType::Uint64(), MachineType::Uint64());
+ BUILD(r, WASM_I64_SHL(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+
+ FOR_UINT64_INPUTS(i) {
+ FOR_UINT64_INPUTS(j) {
+ uint64_t expected = (*i) << (*j & 0x3f);
+ CHECK_EQ(expected, r.Call(*i, *j));
+ }
+ }
+ }
+ {
+ WasmRunner<int64_t> r(MachineType::Int64());
+ BUILD(r, WASM_I64_SHL(WASM_GET_LOCAL(0), WASM_I64V_1(0)));
+ FOR_UINT64_INPUTS(i) { CHECK_EQ(*i << 0, r.Call(*i)); }
+ }
+ {
+ WasmRunner<int64_t> r(MachineType::Int64());
+ BUILD(r, WASM_I64_SHL(WASM_GET_LOCAL(0), WASM_I64V_1(32)));
+ FOR_UINT64_INPUTS(i) { CHECK_EQ(*i << 32, r.Call(*i)); }
+ }
+ {
+ WasmRunner<int64_t> r(MachineType::Int64());
+ BUILD(r, WASM_I64_SHL(WASM_GET_LOCAL(0), WASM_I64V_1(20)));
+ FOR_UINT64_INPUTS(i) { CHECK_EQ(*i << 20, r.Call(*i)); }
+ }
+ {
+ WasmRunner<int64_t> r(MachineType::Int64());
+ BUILD(r, WASM_I64_SHL(WASM_GET_LOCAL(0), WASM_I64V_1(40)));
+ FOR_UINT64_INPUTS(i) { CHECK_EQ(*i << 40, r.Call(*i)); }
+ }
+}
+// kExprI64ShrU:
+TEST(Run_Wasm_I64ShrU) {
+ REQUIRE(I64ShrU);
+ {
+ WasmRunner<uint64_t> r(MachineType::Uint64(), MachineType::Uint64());
+ BUILD(r, WASM_I64_SHR(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+
+ FOR_UINT64_INPUTS(i) {
+ FOR_UINT64_INPUTS(j) {
+ uint64_t expected = (*i) >> (*j & 0x3f);
+ CHECK_EQ(expected, r.Call(*i, *j));
+ }
+ }
+ }
+ {
+ WasmRunner<int64_t> r(MachineType::Int64());
+ BUILD(r, WASM_I64_SHR(WASM_GET_LOCAL(0), WASM_I64V_1(0)));
+ FOR_UINT64_INPUTS(i) { CHECK_EQ(*i >> 0, r.Call(*i)); }
+ }
+ {
+ WasmRunner<int64_t> r(MachineType::Int64());
+ BUILD(r, WASM_I64_SHR(WASM_GET_LOCAL(0), WASM_I64V_1(32)));
+ FOR_UINT64_INPUTS(i) { CHECK_EQ(*i >> 32, r.Call(*i)); }
+ }
+ {
+ WasmRunner<int64_t> r(MachineType::Int64());
+ BUILD(r, WASM_I64_SHR(WASM_GET_LOCAL(0), WASM_I64V_1(20)));
+ FOR_UINT64_INPUTS(i) { CHECK_EQ(*i >> 20, r.Call(*i)); }
+ }
+ {
+ WasmRunner<int64_t> r(MachineType::Int64());
+ BUILD(r, WASM_I64_SHR(WASM_GET_LOCAL(0), WASM_I64V_1(40)));
+ FOR_UINT64_INPUTS(i) { CHECK_EQ(*i >> 40, r.Call(*i)); }
+ }
+}
+// kExprI64ShrS:
+TEST(Run_Wasm_I64ShrS) {
+ REQUIRE(I64ShrS);
+ {
+ WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_SAR(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+
+ FOR_INT64_INPUTS(i) {
+ FOR_INT64_INPUTS(j) {
+ int64_t expected = (*i) >> (*j & 0x3f);
+ CHECK_EQ(expected, r.Call(*i, *j));
+ }
+ }
+ }
+ {
+ WasmRunner<int64_t> r(MachineType::Int64());
+ BUILD(r, WASM_I64_SAR(WASM_GET_LOCAL(0), WASM_I64V_1(0)));
+ FOR_INT64_INPUTS(i) { CHECK_EQ(*i >> 0, r.Call(*i)); }
+ }
+ {
+ WasmRunner<int64_t> r(MachineType::Int64());
+ BUILD(r, WASM_I64_SAR(WASM_GET_LOCAL(0), WASM_I64V_1(32)));
+ FOR_INT64_INPUTS(i) { CHECK_EQ(*i >> 32, r.Call(*i)); }
+ }
+ {
+ WasmRunner<int64_t> r(MachineType::Int64());
+ BUILD(r, WASM_I64_SAR(WASM_GET_LOCAL(0), WASM_I64V_1(20)));
+ FOR_INT64_INPUTS(i) { CHECK_EQ(*i >> 20, r.Call(*i)); }
+ }
+ {
+ WasmRunner<int64_t> r(MachineType::Int64());
+ BUILD(r, WASM_I64_SAR(WASM_GET_LOCAL(0), WASM_I64V_1(40)));
+ FOR_INT64_INPUTS(i) { CHECK_EQ(*i >> 40, r.Call(*i)); }
+ }
+}
+// kExprI64Eq:
+TEST(Run_Wasm_I64Eq) {
+ REQUIRE(I64Eq);
+ WasmRunner<int32_t> r(MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_EQ(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ FOR_INT64_INPUTS(i) {
+ FOR_INT64_INPUTS(j) { CHECK_EQ(*i == *j ? 1 : 0, r.Call(*i, *j)); }
+ }
+}
+// kExprI64Ne:
+TEST(Run_Wasm_I64Ne) {
+ REQUIRE(I64Ne);
+ WasmRunner<int32_t> r(MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_NE(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ FOR_INT64_INPUTS(i) {
+ FOR_INT64_INPUTS(j) { CHECK_EQ(*i != *j ? 1 : 0, r.Call(*i, *j)); }
+ }
+}
+// kExprI64LtS:
+TEST(Run_Wasm_I64LtS) {
+ REQUIRE(I64LtS);
+ WasmRunner<int32_t> r(MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_LTS(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ FOR_INT64_INPUTS(i) {
+ FOR_INT64_INPUTS(j) { CHECK_EQ(*i < *j ? 1 : 0, r.Call(*i, *j)); }
+ }
+}
+TEST(Run_Wasm_I64LeS) {
+ REQUIRE(I64LeS);
+ WasmRunner<int32_t> r(MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_LES(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ FOR_INT64_INPUTS(i) {
+ FOR_INT64_INPUTS(j) { CHECK_EQ(*i <= *j ? 1 : 0, r.Call(*i, *j)); }
+ }
+}
+TEST(Run_Wasm_I64LtU) {
+ REQUIRE(I64LtU);
+ WasmRunner<int32_t> r(MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_LTU(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ FOR_UINT64_INPUTS(i) {
+ FOR_UINT64_INPUTS(j) { CHECK_EQ(*i < *j ? 1 : 0, r.Call(*i, *j)); }
+ }
+}
+TEST(Run_Wasm_I64LeU) {
+ REQUIRE(I64LeU);
+ WasmRunner<int32_t> r(MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_LEU(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ FOR_UINT64_INPUTS(i) {
+ FOR_UINT64_INPUTS(j) { CHECK_EQ(*i <= *j ? 1 : 0, r.Call(*i, *j)); }
+ }
+}
+TEST(Run_Wasm_I64GtS) {
+ REQUIRE(I64GtS);
+ WasmRunner<int32_t> r(MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_GTS(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ FOR_INT64_INPUTS(i) {
+ FOR_INT64_INPUTS(j) { CHECK_EQ(*i > *j ? 1 : 0, r.Call(*i, *j)); }
+ }
+}
+TEST(Run_Wasm_I64GeS) {
+ REQUIRE(I64GeS);
+ WasmRunner<int32_t> r(MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_GES(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ FOR_INT64_INPUTS(i) {
+ FOR_INT64_INPUTS(j) { CHECK_EQ(*i >= *j ? 1 : 0, r.Call(*i, *j)); }
+ }
+}
+
+TEST(Run_Wasm_I64GtU) {
+ REQUIRE(I64GtU);
+ WasmRunner<int32_t> r(MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_GTU(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ FOR_UINT64_INPUTS(i) {
+ FOR_UINT64_INPUTS(j) { CHECK_EQ(*i > *j ? 1 : 0, r.Call(*i, *j)); }
+ }
+}
+
+TEST(Run_Wasm_I64GeU) {
+ REQUIRE(I64GeU);
+ WasmRunner<int32_t> r(MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_GEU(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ FOR_UINT64_INPUTS(i) {
+ FOR_UINT64_INPUTS(j) { CHECK_EQ(*i >= *j ? 1 : 0, r.Call(*i, *j)); }
+ }
+}
+// kExprI32ConvertI64:
+TEST(Run_Wasm_I32ConvertI64) {
+ REQUIRE(I32ConvertI64);
+ FOR_INT64_INPUTS(i) {
+ WasmRunner<int32_t> r;
+ BUILD(r, WASM_I32_CONVERT_I64(WASM_I64V(*i)));
+ CHECK_EQ(static_cast<int32_t>(*i), r.Call());
+ }
+}
+// kExprI64SConvertI32:
+TEST(Run_Wasm_I64SConvertI32) {
+ REQUIRE(I64SConvertI32);
+ WasmRunner<int64_t> r(MachineType::Int32());
+ BUILD(r, WASM_I64_SCONVERT_I32(WASM_GET_LOCAL(0)));
+ FOR_INT32_INPUTS(i) { CHECK_EQ(static_cast<int64_t>(*i), r.Call(*i)); }
+}
+
+// kExprI64UConvertI32:
+TEST(Run_Wasm_I64UConvertI32) {
+ REQUIRE(I64UConvertI32);
+ WasmRunner<int64_t> r(MachineType::Uint32());
+ BUILD(r, WASM_I64_UCONVERT_I32(WASM_GET_LOCAL(0)));
+ FOR_UINT32_INPUTS(i) { CHECK_EQ(static_cast<uint64_t>(*i), r.Call(*i)); }
+}
+
+// kExprF64ReinterpretI64:
+// kExprI64ReinterpretF64:
+
+// kExprI64Clz:
+// kExprI64Ctz:
+// kExprI64Popcnt:
+TEST(Run_WasmI64Popcnt) {
+ struct {
+ int64_t expected;
+ uint64_t input;
+ } values[] = {{64, 0xffffffffffffffff},
+ {0, 0x0000000000000000},
+ {2, 0x0000080000008000},
+ {26, 0x1123456782345678},
+ {38, 0xffedcba09edcba09}};
+
+ WasmRunner<int64_t> r(MachineType::Uint64());
+ BUILD(r, WASM_I64_POPCNT(WASM_GET_LOCAL(0)));
+ for (size_t i = 0; i < arraysize(values); i++) {
+ CHECK_EQ(values[i].expected, r.Call(values[i].input));
+ }
+}
+
+// kExprF32SConvertI64:
+TEST(Run_WasmF32SConvertI64) {
+ REQUIRE(F32SConvertI64);
+ WasmRunner<float> r(MachineType::Int64());
+ BUILD(r, WASM_F32_SCONVERT_I64(WASM_GET_LOCAL(0)));
+ FOR_INT64_INPUTS(i) { CHECK_FLOAT_EQ(static_cast<float>(*i), r.Call(*i)); }
+}
+// kExprF32UConvertI64:
+TEST(Run_WasmF32UConvertI64) {
+ REQUIRE(F32UConvertI64);
+ struct {
+ uint64_t input;
+ uint32_t expected;
+ } values[] = {{0x0, 0x0},
+ {0x1, 0x3f800000},
+ {0xffffffff, 0x4f800000},
+ {0x1b09788b, 0x4dd84bc4},
+ {0x4c5fce8, 0x4c98bf9d},
+ {0xcc0de5bf, 0x4f4c0de6},
+ {0x2, 0x40000000},
+ {0x3, 0x40400000},
+ {0x4, 0x40800000},
+ {0x5, 0x40a00000},
+ {0x8, 0x41000000},
+ {0x9, 0x41100000},
+ {0xffffffffffffffff, 0x5f800000},
+ {0xfffffffffffffffe, 0x5f800000},
+ {0xfffffffffffffffd, 0x5f800000},
+ {0x0, 0x0},
+ {0x100000000, 0x4f800000},
+ {0xffffffff00000000, 0x5f800000},
+ {0x1b09788b00000000, 0x5dd84bc4},
+ {0x4c5fce800000000, 0x5c98bf9d},
+ {0xcc0de5bf00000000, 0x5f4c0de6},
+ {0x200000000, 0x50000000},
+ {0x300000000, 0x50400000},
+ {0x400000000, 0x50800000},
+ {0x500000000, 0x50a00000},
+ {0x800000000, 0x51000000},
+ {0x900000000, 0x51100000},
+ {0x273a798e187937a3, 0x5e1ce9e6},
+ {0xece3af835495a16b, 0x5f6ce3b0},
+ {0xb668ecc11223344, 0x5d3668ed},
+ {0x9e, 0x431e0000},
+ {0x43, 0x42860000},
+ {0xaf73, 0x472f7300},
+ {0x116b, 0x458b5800},
+ {0x658ecc, 0x4acb1d98},
+ {0x2b3b4c, 0x4a2ced30},
+ {0x88776655, 0x4f087766},
+ {0x70000000, 0x4ee00000},
+ {0x7200000, 0x4ce40000},
+ {0x7fffffff, 0x4f000000},
+ {0x56123761, 0x4eac246f},
+ {0x7fffff00, 0x4efffffe},
+ {0x761c4761eeeeeeee, 0x5eec388f},
+ {0x80000000eeeeeeee, 0x5f000000},
+ {0x88888888dddddddd, 0x5f088889},
+ {0xa0000000dddddddd, 0x5f200000},
+ {0xddddddddaaaaaaaa, 0x5f5dddde},
+ {0xe0000000aaaaaaaa, 0x5f600000},
+ {0xeeeeeeeeeeeeeeee, 0x5f6eeeef},
+ {0xfffffffdeeeeeeee, 0x5f800000},
+ {0xf0000000dddddddd, 0x5f700000},
+ {0x7fffffdddddddd, 0x5b000000},
+ {0x3fffffaaaaaaaa, 0x5a7fffff},
+ {0x1fffffaaaaaaaa, 0x59fffffd},
+ {0xfffff, 0x497ffff0},
+ {0x7ffff, 0x48ffffe0},
+ {0x3ffff, 0x487fffc0},
+ {0x1ffff, 0x47ffff80},
+ {0xffff, 0x477fff00},
+ {0x7fff, 0x46fffe00},
+ {0x3fff, 0x467ffc00},
+ {0x1fff, 0x45fff800},
+ {0xfff, 0x457ff000},
+ {0x7ff, 0x44ffe000},
+ {0x3ff, 0x447fc000},
+ {0x1ff, 0x43ff8000},
+ {0x3fffffffffff, 0x56800000},
+ {0x1fffffffffff, 0x56000000},
+ {0xfffffffffff, 0x55800000},
+ {0x7ffffffffff, 0x55000000},
+ {0x3ffffffffff, 0x54800000},
+ {0x1ffffffffff, 0x54000000},
+ {0x8000008000000000, 0x5f000000},
+ {0x8000008000000001, 0x5f000001},
+ {0x8000000000000400, 0x5f000000},
+ {0x8000000000000401, 0x5f000000}};
+ WasmRunner<float> r(MachineType::Uint64());
+ BUILD(r, WASM_F32_UCONVERT_I64(WASM_GET_LOCAL(0)));
+ for (size_t i = 0; i < arraysize(values); i++) {
+ CHECK_EQ(bit_cast<float>(values[i].expected), r.Call(values[i].input));
+ }
+}
+// kExprF64SConvertI64:
+TEST(Run_WasmF64SConvertI64) {
+ REQUIRE(F64SConvertI64);
+ WasmRunner<double> r(MachineType::Int64());
+ BUILD(r, WASM_F64_SCONVERT_I64(WASM_GET_LOCAL(0)));
+ FOR_INT64_INPUTS(i) { CHECK_DOUBLE_EQ(static_cast<double>(*i), r.Call(*i)); }
+}
+// kExprF64UConvertI64:
+TEST(Run_Wasm_F64UConvertI64) {
+ REQUIRE(F64UConvertI64);
+ struct {
+ uint64_t input;
+ uint64_t expected;
+ } values[] = {{0x0, 0x0},
+ {0x1, 0x3ff0000000000000},
+ {0xffffffff, 0x41efffffffe00000},
+ {0x1b09788b, 0x41bb09788b000000},
+ {0x4c5fce8, 0x419317f3a0000000},
+ {0xcc0de5bf, 0x41e981bcb7e00000},
+ {0x2, 0x4000000000000000},
+ {0x3, 0x4008000000000000},
+ {0x4, 0x4010000000000000},
+ {0x5, 0x4014000000000000},
+ {0x8, 0x4020000000000000},
+ {0x9, 0x4022000000000000},
+ {0xffffffffffffffff, 0x43f0000000000000},
+ {0xfffffffffffffffe, 0x43f0000000000000},
+ {0xfffffffffffffffd, 0x43f0000000000000},
+ {0x100000000, 0x41f0000000000000},
+ {0xffffffff00000000, 0x43efffffffe00000},
+ {0x1b09788b00000000, 0x43bb09788b000000},
+ {0x4c5fce800000000, 0x439317f3a0000000},
+ {0xcc0de5bf00000000, 0x43e981bcb7e00000},
+ {0x200000000, 0x4200000000000000},
+ {0x300000000, 0x4208000000000000},
+ {0x400000000, 0x4210000000000000},
+ {0x500000000, 0x4214000000000000},
+ {0x800000000, 0x4220000000000000},
+ {0x900000000, 0x4222000000000000},
+ {0x273a798e187937a3, 0x43c39d3cc70c3c9c},
+ {0xece3af835495a16b, 0x43ed9c75f06a92b4},
+ {0xb668ecc11223344, 0x43a6cd1d98224467},
+ {0x9e, 0x4063c00000000000},
+ {0x43, 0x4050c00000000000},
+ {0xaf73, 0x40e5ee6000000000},
+ {0x116b, 0x40b16b0000000000},
+ {0x658ecc, 0x415963b300000000},
+ {0x2b3b4c, 0x41459da600000000},
+ {0x88776655, 0x41e10eeccaa00000},
+ {0x70000000, 0x41dc000000000000},
+ {0x7200000, 0x419c800000000000},
+ {0x7fffffff, 0x41dfffffffc00000},
+ {0x56123761, 0x41d5848dd8400000},
+ {0x7fffff00, 0x41dfffffc0000000},
+ {0x761c4761eeeeeeee, 0x43dd8711d87bbbbc},
+ {0x80000000eeeeeeee, 0x43e00000001dddde},
+ {0x88888888dddddddd, 0x43e11111111bbbbc},
+ {0xa0000000dddddddd, 0x43e40000001bbbbc},
+ {0xddddddddaaaaaaaa, 0x43ebbbbbbbb55555},
+ {0xe0000000aaaaaaaa, 0x43ec000000155555},
+ {0xeeeeeeeeeeeeeeee, 0x43edddddddddddde},
+ {0xfffffffdeeeeeeee, 0x43efffffffbdddde},
+ {0xf0000000dddddddd, 0x43ee0000001bbbbc},
+ {0x7fffffdddddddd, 0x435ffffff7777777},
+ {0x3fffffaaaaaaaa, 0x434fffffd5555555},
+ {0x1fffffaaaaaaaa, 0x433fffffaaaaaaaa},
+ {0xfffff, 0x412ffffe00000000},
+ {0x7ffff, 0x411ffffc00000000},
+ {0x3ffff, 0x410ffff800000000},
+ {0x1ffff, 0x40fffff000000000},
+ {0xffff, 0x40efffe000000000},
+ {0x7fff, 0x40dfffc000000000},
+ {0x3fff, 0x40cfff8000000000},
+ {0x1fff, 0x40bfff0000000000},
+ {0xfff, 0x40affe0000000000},
+ {0x7ff, 0x409ffc0000000000},
+ {0x3ff, 0x408ff80000000000},
+ {0x1ff, 0x407ff00000000000},
+ {0x3fffffffffff, 0x42cfffffffffff80},
+ {0x1fffffffffff, 0x42bfffffffffff00},
+ {0xfffffffffff, 0x42affffffffffe00},
+ {0x7ffffffffff, 0x429ffffffffffc00},
+ {0x3ffffffffff, 0x428ffffffffff800},
+ {0x1ffffffffff, 0x427ffffffffff000},
+ {0x8000008000000000, 0x43e0000010000000},
+ {0x8000008000000001, 0x43e0000010000000},
+ {0x8000000000000400, 0x43e0000000000000},
+ {0x8000000000000401, 0x43e0000000000001}};
+ WasmRunner<double> r(MachineType::Uint64());
+ BUILD(r, WASM_F64_UCONVERT_I64(WASM_GET_LOCAL(0)));
+ for (size_t i = 0; i < arraysize(values); i++) {
+ CHECK_EQ(bit_cast<double>(values[i].expected), r.Call(values[i].input));
+ }
+}
+// kExprI64SConvertF32:
+
+TEST(Run_Wasm_I64SConvertF32a) {
+ WasmRunner<int64_t> r(MachineType::Float32());
+ BUILD(r, WASM_I64_SCONVERT_F32(WASM_GET_LOCAL(0)));
+
+ FOR_FLOAT32_INPUTS(i) {
+ if (*i < static_cast<float>(std::numeric_limits<int64_t>::max()) &&
+ *i >= static_cast<float>(std::numeric_limits<int64_t>::min())) {
+ CHECK_EQ(static_cast<int64_t>(*i), r.Call(*i));
+ } else {
+ CHECK_TRAP64(r.Call(*i));
+ }
+ }
+}
+// kExprI64SConvertF64:
+TEST(Run_Wasm_I64SConvertF64a) {
+ WasmRunner<int64_t> r(MachineType::Float64());
+ BUILD(r, WASM_I64_SCONVERT_F64(WASM_GET_LOCAL(0)));
+
+ FOR_FLOAT64_INPUTS(i) {
+ if (*i < static_cast<double>(std::numeric_limits<int64_t>::max()) &&
+ *i >= static_cast<double>(std::numeric_limits<int64_t>::min())) {
+ CHECK_EQ(static_cast<int64_t>(*i), r.Call(*i));
+ } else {
+ CHECK_TRAP64(r.Call(*i));
+ }
+ }
+}
+
+// kExprI64UConvertF32:
+TEST(Run_Wasm_I64UConvertF32a) {
+ WasmRunner<uint64_t> r(MachineType::Float32());
+ BUILD(r, WASM_I64_UCONVERT_F32(WASM_GET_LOCAL(0)));
+
+ FOR_FLOAT32_INPUTS(i) {
+ if (*i < static_cast<float>(std::numeric_limits<uint64_t>::max()) &&
+ *i > -1) {
+ CHECK_EQ(static_cast<uint64_t>(*i), r.Call(*i));
+ } else {
+ CHECK_TRAP64(r.Call(*i));
+ }
+ }
+}
+
+// kExprI64UConvertF64:
+TEST(Run_Wasm_I64UConvertF64a) {
+ WasmRunner<uint64_t> r(MachineType::Float64());
+ BUILD(r, WASM_I64_UCONVERT_F64(WASM_GET_LOCAL(0)));
+
+ FOR_FLOAT64_INPUTS(i) {
+ if (*i < static_cast<float>(std::numeric_limits<uint64_t>::max()) &&
+ *i > -1) {
+ CHECK_EQ(static_cast<uint64_t>(*i), r.Call(*i));
+ } else {
+ CHECK_TRAP64(r.Call(*i));
+ }
+ }
+}
+
+TEST(Run_WasmCallI64Parameter) {
+ // Build the target function.
+ LocalType param_types[20];
+ for (int i = 0; i < 20; i++) param_types[i] = kAstI64;
+ param_types[3] = kAstI32;
+ param_types[4] = kAstI32;
+ FunctionSig sig(1, 19, param_types);
+ for (int i = 0; i < 19; i++) {
+ TestingModule module;
+ WasmFunctionCompiler t(&sig, &module);
+ if (i == 2 || i == 3) {
+ continue;
+ } else {
+ BUILD(t, WASM_GET_LOCAL(i));
+ }
+ uint32_t index = t.CompileAndAdd();
+
+ // Build the calling function.
+ WasmRunner<int32_t> r(&module);
+ BUILD(
+ r,
+ WASM_I32_CONVERT_I64(WASM_CALL_FUNCTION(
+ index, WASM_I64V_9(0xbcd12340000000b),
+ WASM_I64V_9(0xbcd12340000000c), WASM_I32V_1(0xd),
+ WASM_I32_CONVERT_I64(WASM_I64V_9(0xbcd12340000000e)),
+ WASM_I64V_9(0xbcd12340000000f), WASM_I64V_10(0xbcd1234000000010),
+ WASM_I64V_10(0xbcd1234000000011), WASM_I64V_10(0xbcd1234000000012),
+ WASM_I64V_10(0xbcd1234000000013), WASM_I64V_10(0xbcd1234000000014),
+ WASM_I64V_10(0xbcd1234000000015), WASM_I64V_10(0xbcd1234000000016),
+ WASM_I64V_10(0xbcd1234000000017), WASM_I64V_10(0xbcd1234000000018),
+ WASM_I64V_10(0xbcd1234000000019), WASM_I64V_10(0xbcd123400000001a),
+ WASM_I64V_10(0xbcd123400000001b), WASM_I64V_10(0xbcd123400000001c),
+ WASM_I64V_10(0xbcd123400000001d))));
+
+ CHECK_EQ(i + 0xb, r.Call());
+ }
+}
+
+void TestI64Binop(WasmOpcode opcode, int64_t expected, int64_t a, int64_t b) {
+ {
+ WasmRunner<int64_t> r;
+ // return K op K
+ BUILD(r, WASM_BINOP(opcode, WASM_I64V(a), WASM_I64V(b)));
+ CHECK_EQ(expected, r.Call());
+ }
+ {
+ WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64());
+ // return a op b
+ BUILD(r, WASM_BINOP(opcode, WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ CHECK_EQ(expected, r.Call(a, b));
+ }
+}
+
+void TestI64Cmp(WasmOpcode opcode, int64_t expected, int64_t a, int64_t b) {
+ {
+ WasmRunner<int32_t> r;
+ // return K op K
+ BUILD(r, WASM_BINOP(opcode, WASM_I64V(a), WASM_I64V(b)));
+ CHECK_EQ(expected, r.Call());
+ }
+ {
+ WasmRunner<int32_t> r(MachineType::Int64(), MachineType::Int64());
+ // return a op b
+ BUILD(r, WASM_BINOP(opcode, WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ CHECK_EQ(expected, r.Call(a, b));
+ }
+}
+
+#define TEST_I64_BINOP(name, expected, a, b) \
+ do { \
+ if (WASM_64 || kSupported_##name) \
+ TestI64Binop(kExpr##name, expected, a, b); \
+ } while (false)
+
+TEST(Run_Wasm_I64Binops) {
+ TEST_I64_BINOP(I64Add, -5586332274295447011, 0x501b72ebabc26847,
+ 0x625de9793d8f79d6);
+ TEST_I64_BINOP(I64Sub, 9001903251710731490, 0xf24fe6474640002e,
+ 0x7562b6f711991b4c);
+ TEST_I64_BINOP(I64Mul, -4569547818546064176, 0x231a263c2cbc6451,
+ 0xead44de6bd3e23d0);
+ TEST_I64_BINOP(I64Mul, -25963122347507043, 0x4da1fa47c9352b73,
+ 0x91fe82317aa035af);
+ TEST_I64_BINOP(I64Mul, 7640290486138131960, 0x185731abe8eea47c,
+ 0x714ec59f1380d4c2);
+ TEST_I64_BINOP(I64DivS, -91517, 0x93b1190a34de56a0, 0x00004d8f68863948);
+ TEST_I64_BINOP(I64DivU, 149016, 0xe15b3727e8a2080a, 0x0000631bfa72db8b);
+ TEST_I64_BINOP(I64RemS, -664128064149968, 0x9a78b4e4fe708692,
+ 0x0003e0b6b3be7609);
+ TEST_I64_BINOP(I64RemU, 1742040017332765, 0x0ce84708c6258c81,
+ 0x000a6fde82016697);
+ TEST_I64_BINOP(I64And, 2531040582801836054, 0xaf257d1602644a16,
+ 0x33b290a91a10d997);
+ TEST_I64_BINOP(I64Ior, 8556201506536114940, 0x169d9be7bd3f0a5c,
+ 0x66bca28d77af40e8);
+ TEST_I64_BINOP(I64Xor, -4605655183785456377, 0xb6ea20a5d48e85b8,
+ 0x76ff4da6c80688bf);
+ TEST_I64_BINOP(I64Shl, -7240704056088331264, 0xef4dc1ed030e8ffe, 9);
+ TEST_I64_BINOP(I64ShrU, 12500673744059159, 0xb1a52fa7deec5d14, 10);
+ TEST_I64_BINOP(I64ShrS, 1725103446999874, 0x3107c791461a112b, 11);
+ TEST_I64_BINOP(I64Ror, -8960135652432576946, 0x73418d1717e4e83a, 12);
+ TEST_I64_BINOP(I64Ror, 7617662827409989779, 0xebff67cf0c126d36, 13);
+ TEST_I64_BINOP(I64Rol, -2097714064174346012, 0x43938b8db0b0f230, 14);
+ TEST_I64_BINOP(I64Rol, 8728493013947314237, 0xe07af243ac4d219d, 15);
+}
+
+#define TEST_I64_CMP(name, expected, a, b) \
+ do { \
+ if (WASM_64 || kSupported_##name) TestI64Cmp(kExpr##name, expected, a, b); \
+ } while (false)
+
+TEST(Run_Wasm_I64Compare) {
+ TEST_I64_CMP(I64Eq, 0, 0xB915D8FA494064F0, 0x04D700B2536019A3);
+ TEST_I64_CMP(I64Ne, 1, 0xC2FAFAAAB0446CDC, 0x52A3328F780C97A3);
+ TEST_I64_CMP(I64LtS, 0, 0x673636E6306B0578, 0x028EC9ECA78F7227);
+ TEST_I64_CMP(I64LeS, 1, 0xAE5214114B86A0FA, 0x7C1D21DA3DFD0CCF);
+ TEST_I64_CMP(I64LtU, 0, 0x7D52166381EC1CE0, 0x59F4A6A9E78CD3D8);
+ TEST_I64_CMP(I64LeU, 1, 0xE4169A385C7EA0E0, 0xFBDBED2C8781E5BC);
+ TEST_I64_CMP(I64GtS, 0, 0x9D08FF8FB5F42E81, 0xD4E5C9D7FE09F621);
+ TEST_I64_CMP(I64GeS, 1, 0x78DA3B2F73264E0F, 0x6FE5E2A67C501CBE);
+ TEST_I64_CMP(I64GtU, 0, 0x8F691284E44F7DA9, 0xD5EA9BC1EE149192);
+ TEST_I64_CMP(I64GeU, 0, 0x0886A0C58C7AA224, 0x5DDBE5A81FD7EE47);
+}
+
+TEST(Run_Wasm_I64Clz) {
+ REQUIRE(I64Clz);
+ struct {
+ int64_t expected;
+ uint64_t input;
+ } values[] = {{0, 0x8000100000000000}, {1, 0x4000050000000000},
+ {2, 0x2000030000000000}, {3, 0x1000000300000000},
+ {4, 0x0805000000000000}, {5, 0x0400600000000000},
+ {6, 0x0200000000000000}, {7, 0x010000a000000000},
+ {8, 0x00800c0000000000}, {9, 0x0040000000000000},
+ {10, 0x0020000d00000000}, {11, 0x00100f0000000000},
+ {12, 0x0008000000000000}, {13, 0x0004100000000000},
+ {14, 0x0002002000000000}, {15, 0x0001030000000000},
+ {16, 0x0000804000000000}, {17, 0x0000400500000000},
+ {18, 0x0000205000000000}, {19, 0x0000170000000000},
+ {20, 0x0000087000000000}, {21, 0x0000040500000000},
+ {22, 0x0000020300000000}, {23, 0x0000010100000000},
+ {24, 0x0000008900000000}, {25, 0x0000004100000000},
+ {26, 0x0000002200000000}, {27, 0x0000001300000000},
+ {28, 0x0000000800000000}, {29, 0x0000000400000000},
+ {30, 0x0000000200000000}, {31, 0x0000000100000000},
+ {32, 0x0000000080001000}, {33, 0x0000000040000500},
+ {34, 0x0000000020000300}, {35, 0x0000000010000003},
+ {36, 0x0000000008050000}, {37, 0x0000000004006000},
+ {38, 0x0000000002000000}, {39, 0x00000000010000a0},
+ {40, 0x0000000000800c00}, {41, 0x0000000000400000},
+ {42, 0x000000000020000d}, {43, 0x0000000000100f00},
+ {44, 0x0000000000080000}, {45, 0x0000000000041000},
+ {46, 0x0000000000020020}, {47, 0x0000000000010300},
+ {48, 0x0000000000008040}, {49, 0x0000000000004005},
+ {50, 0x0000000000002050}, {51, 0x0000000000001700},
+ {52, 0x0000000000000870}, {53, 0x0000000000000405},
+ {54, 0x0000000000000203}, {55, 0x0000000000000101},
+ {56, 0x0000000000000089}, {57, 0x0000000000000041},
+ {58, 0x0000000000000022}, {59, 0x0000000000000013},
+ {60, 0x0000000000000008}, {61, 0x0000000000000004},
+ {62, 0x0000000000000002}, {63, 0x0000000000000001},
+ {64, 0x0000000000000000}};
+
+ WasmRunner<int64_t> r(MachineType::Uint64());
+ BUILD(r, WASM_I64_CLZ(WASM_GET_LOCAL(0)));
+ for (size_t i = 0; i < arraysize(values); i++) {
+ CHECK_EQ(values[i].expected, r.Call(values[i].input));
+ }
+}
+
+TEST(Run_Wasm_I64Ctz) {
+ REQUIRE(I64Ctz);
+ struct {
+ int64_t expected;
+ uint64_t input;
+ } values[] = {{64, 0x0000000000000000}, {63, 0x8000000000000000},
+ {62, 0x4000000000000000}, {61, 0x2000000000000000},
+ {60, 0x1000000000000000}, {59, 0xa800000000000000},
+ {58, 0xf400000000000000}, {57, 0x6200000000000000},
+ {56, 0x9100000000000000}, {55, 0xcd80000000000000},
+ {54, 0x0940000000000000}, {53, 0xaf20000000000000},
+ {52, 0xac10000000000000}, {51, 0xe0b8000000000000},
+ {50, 0x9ce4000000000000}, {49, 0xc792000000000000},
+ {48, 0xb8f1000000000000}, {47, 0x3b9f800000000000},
+ {46, 0xdb4c400000000000}, {45, 0xe9a3200000000000},
+ {44, 0xfca6100000000000}, {43, 0x6c8a780000000000},
+ {42, 0x8ce5a40000000000}, {41, 0xcb7d020000000000},
+ {40, 0xcb4dc10000000000}, {39, 0xdfbec58000000000},
+ {38, 0x27a9db4000000000}, {37, 0xde3bcb2000000000},
+ {36, 0xd7e8a61000000000}, {35, 0x9afdbc8800000000},
+ {34, 0x9afdbc8400000000}, {33, 0x9afdbc8200000000},
+ {32, 0x9afdbc8100000000}, {31, 0x0000000080000000},
+ {30, 0x0000000040000000}, {29, 0x0000000020000000},
+ {28, 0x0000000010000000}, {27, 0x00000000a8000000},
+ {26, 0x00000000f4000000}, {25, 0x0000000062000000},
+ {24, 0x0000000091000000}, {23, 0x00000000cd800000},
+ {22, 0x0000000009400000}, {21, 0x00000000af200000},
+ {20, 0x00000000ac100000}, {19, 0x00000000e0b80000},
+ {18, 0x000000009ce40000}, {17, 0x00000000c7920000},
+ {16, 0x00000000b8f10000}, {15, 0x000000003b9f8000},
+ {14, 0x00000000db4c4000}, {13, 0x00000000e9a32000},
+ {12, 0x00000000fca61000}, {11, 0x000000006c8a7800},
+ {10, 0x000000008ce5a400}, {9, 0x00000000cb7d0200},
+ {8, 0x00000000cb4dc100}, {7, 0x00000000dfbec580},
+ {6, 0x0000000027a9db40}, {5, 0x00000000de3bcb20},
+ {4, 0x00000000d7e8a610}, {3, 0x000000009afdbc88},
+ {2, 0x000000009afdbc84}, {1, 0x000000009afdbc82},
+ {0, 0x000000009afdbc81}};
+
+ WasmRunner<int64_t> r(MachineType::Uint64());
+ BUILD(r, WASM_I64_CTZ(WASM_GET_LOCAL(0)));
+ for (size_t i = 0; i < arraysize(values); i++) {
+ CHECK_EQ(values[i].expected, r.Call(values[i].input));
+ }
+}
+
+TEST(Run_Wasm_I64Popcnt) {
+ REQUIRE(I64Popcnt);
+ struct {
+ int64_t expected;
+ uint64_t input;
+ } values[] = {{64, 0xffffffffffffffff},
+ {0, 0x0000000000000000},
+ {2, 0x0000080000008000},
+ {26, 0x1123456782345678},
+ {38, 0xffedcba09edcba09}};
+
+ WasmRunner<int64_t> r(MachineType::Uint64());
+ BUILD(r, WASM_I64_POPCNT(WASM_GET_LOCAL(0)));
+ for (size_t i = 0; i < arraysize(values); i++) {
+ CHECK_EQ(values[i].expected, r.Call(values[i].input));
+ }
+}
+
+// Test the WasmRunner with an Int64 return value and different numbers of
+// Int64 parameters.
+TEST(Run_TestI64WasmRunner) {
+ REQUIRE(I64Param);
+ REQUIRE(I64Xor);
+ {FOR_INT64_INPUTS(i){WasmRunner<int64_t> r;
+ BUILD(r, WASM_I64V(*i));
+ CHECK_EQ(*i, r.Call());
+}
+}
+{
+ WasmRunner<int64_t> r(MachineType::Int64());
+ BUILD(r, WASM_GET_LOCAL(0));
+ FOR_INT64_INPUTS(i) { CHECK_EQ(*i, r.Call(*i)); }
+}
+{
+ WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_XOR(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ FOR_INT64_INPUTS(i) {
+ FOR_INT64_INPUTS(j) { CHECK_EQ(*i ^ *j, r.Call(*i, *j)); }
+ }
+}
+{
+ WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64(),
+ MachineType::Int64());
+ BUILD(r, WASM_I64_XOR(WASM_GET_LOCAL(0),
+ WASM_I64_XOR(WASM_GET_LOCAL(1), WASM_GET_LOCAL(2))));
+ FOR_INT64_INPUTS(i) {
+ FOR_INT64_INPUTS(j) {
+ CHECK_EQ(*i ^ *j ^ *j, r.Call(*i, *j, *j));
+ CHECK_EQ(*j ^ *i ^ *j, r.Call(*j, *i, *j));
+ CHECK_EQ(*j ^ *j ^ *i, r.Call(*j, *j, *i));
+ }
+ }
+}
+{
+ WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64(),
+ MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_XOR(WASM_GET_LOCAL(0),
+ WASM_I64_XOR(WASM_GET_LOCAL(1),
+ WASM_I64_XOR(WASM_GET_LOCAL(2),
+ WASM_GET_LOCAL(3)))));
+ FOR_INT64_INPUTS(i) {
+ FOR_INT64_INPUTS(j) {
+ CHECK_EQ(*i ^ *j ^ *j ^ *j, r.Call(*i, *j, *j, *j));
+ CHECK_EQ(*j ^ *i ^ *j ^ *j, r.Call(*j, *i, *j, *j));
+ CHECK_EQ(*j ^ *j ^ *i ^ *j, r.Call(*j, *j, *i, *j));
+ CHECK_EQ(*j ^ *j ^ *j ^ *i, r.Call(*j, *j, *j, *i));
+ }
+ }
+}
+}
+
+TEST(Run_WasmCall_Int64Sub) {
+ REQUIRE(I64Sub);
+ // Build the target function.
+ TestSignatures sigs;
+ TestingModule module;
+ WasmFunctionCompiler t(sigs.l_ll(), &module);
+ BUILD(t, WASM_I64_SUB(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ uint32_t index = t.CompileAndAdd();
+
+ // Build the caller function.
+ WasmRunner<int64_t> r(&module, MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_CALL_FUNCTION(index, WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+
+ FOR_INT32_INPUTS(i) {
+ FOR_INT32_INPUTS(j) {
+ int64_t a = static_cast<int64_t>(*i) << 32 |
+ (static_cast<int64_t>(*j) | 0xFFFFFFFF);
+ int64_t b = static_cast<int64_t>(*j) << 32 |
+ (static_cast<int64_t>(*i) | 0xFFFFFFFF);
+
+ int64_t expected = static_cast<int64_t>(static_cast<uint64_t>(a) -
+ static_cast<uint64_t>(b));
+ CHECK_EQ(expected, r.Call(a, b));
+ }
+ }
+}
+
+TEST(Run_Wasm_LoadStoreI64_sx) {
+ REQUIRE(I64LoadStore);
+ REQUIRE(DepthFirst);
+ byte loads[] = {kExprI64LoadMem8S, kExprI64LoadMem16S, kExprI64LoadMem32S,
+ kExprI64LoadMem};
+
+ for (size_t m = 0; m < arraysize(loads); m++) {
+ TestingModule module;
+ byte* memory = module.AddMemoryElems<byte>(16);
+ WasmRunner<int64_t> r(&module);
+
+ byte code[] = {kExprI64StoreMem, ZERO_ALIGNMENT,
+ ZERO_OFFSET, // --
+ kExprI8Const, 8, // --
+ loads[m], ZERO_ALIGNMENT,
+ ZERO_OFFSET, // --
+ kExprI8Const, 0}; // --
+
+ r.Build(code, code + arraysize(code));
+
+ // Try a bunch of different negative values.
+ for (int i = -1; i >= -128; i -= 11) {
+ int size = 1 << m;
+ module.BlankMemory();
+ memory[size - 1] = static_cast<byte>(i); // set the high order byte.
+
+ int64_t expected = static_cast<int64_t>(i) << ((size - 1) * 8);
+
+ CHECK_EQ(expected, r.Call());
+ CHECK_EQ(static_cast<byte>(i), memory[8 + size - 1]);
+ for (int j = size; j < 8; j++) {
+ CHECK_EQ(255, memory[8 + j]);
+ }
+ }
+ }
+}
+
+TEST(Run_Wasm_I64SConvertF32b) {
+ REQUIRE(I64SConvertF32);
+ WasmRunner<int64_t> r(MachineType::Float32());
+ BUILD(r, WASM_I64_SCONVERT_F32(WASM_GET_LOCAL(0)));
+
+ FOR_FLOAT32_INPUTS(i) {
+ if (*i < static_cast<float>(INT64_MAX) &&
+ *i >= static_cast<float>(INT64_MIN)) {
+ CHECK_EQ(static_cast<int64_t>(*i), r.Call(*i));
+ } else {
+ CHECK_TRAP64(r.Call(*i));
+ }
+ }
+}
+
+TEST(Run_Wasm_I64SConvertF64b) {
+ REQUIRE(I64SConvertF64);
+ WasmRunner<int64_t> r(MachineType::Float64());
+ BUILD(r, WASM_I64_SCONVERT_F64(WASM_GET_LOCAL(0)));
+
+ FOR_FLOAT64_INPUTS(i) {
+ if (*i < static_cast<double>(INT64_MAX) &&
+ *i >= static_cast<double>(INT64_MIN)) {
+ CHECK_EQ(static_cast<int64_t>(*i), r.Call(*i));
+ } else {
+ CHECK_TRAP64(r.Call(*i));
+ }
+ }
+}
+
+TEST(Run_Wasm_I64UConvertF32b) {
+ REQUIRE(I64UConvertF32);
+ WasmRunner<uint64_t> r(MachineType::Float32());
+ BUILD(r, WASM_I64_UCONVERT_F32(WASM_GET_LOCAL(0)));
+
+ FOR_FLOAT32_INPUTS(i) {
+ if (*i < static_cast<float>(UINT64_MAX) && *i > -1) {
+ CHECK_EQ(static_cast<uint64_t>(*i), r.Call(*i));
+ } else {
+ CHECK_TRAP64(r.Call(*i));
+ }
+ }
+}
+
+TEST(Run_Wasm_I64UConvertF64b) {
+ REQUIRE(I64UConvertF64);
+ WasmRunner<uint64_t> r(MachineType::Float64());
+ BUILD(r, WASM_I64_UCONVERT_F64(WASM_GET_LOCAL(0)));
+
+ FOR_FLOAT64_INPUTS(i) {
+ if (*i < static_cast<float>(UINT64_MAX) && *i > -1) {
+ CHECK_EQ(static_cast<uint64_t>(*i), r.Call(*i));
+ } else {
+ CHECK_TRAP64(r.Call(*i));
+ }
+ }
+}
+
+TEST(Run_Wasm_I64ReinterpretF64) {
+ REQUIRE(I64ReinterpretF64);
+ TestingModule module;
+ int64_t* memory = module.AddMemoryElems<int64_t>(8);
+ WasmRunner<int64_t> r(&module);
+
+ BUILD(r, WASM_I64_REINTERPRET_F64(
+ WASM_LOAD_MEM(MachineType::Float64(), WASM_ZERO)));
+
+ FOR_INT32_INPUTS(i) {
+ int64_t expected = static_cast<int64_t>(*i) * 0x300010001;
+ memory[0] = expected;
+ CHECK_EQ(expected, r.Call());
+ }
+}
+
+TEST(Run_Wasm_F64ReinterpretI64) {
+ REQUIRE(F64ReinterpretI64);
+ TestingModule module;
+ int64_t* memory = module.AddMemoryElems<int64_t>(8);
+ WasmRunner<int64_t> r(&module, MachineType::Int64());
+
+ BUILD(r, WASM_BLOCK(
+ 2, WASM_STORE_MEM(MachineType::Float64(), WASM_ZERO,
+ WASM_F64_REINTERPRET_I64(WASM_GET_LOCAL(0))),
+ WASM_GET_LOCAL(0)));
+
+ FOR_INT32_INPUTS(i) {
+ int64_t expected = static_cast<int64_t>(*i) * 0x300010001;
+ CHECK_EQ(expected, r.Call(expected));
+ CHECK_EQ(expected, memory[0]);
+ }
+}
+
+TEST(Run_Wasm_LoadMemI64) {
+ REQUIRE(I64LoadStore);
+ TestingModule module;
+ int64_t* memory = module.AddMemoryElems<int64_t>(8);
+ module.RandomizeMemory(1111);
+ WasmRunner<int64_t> r(&module);
+
+ BUILD(r, WASM_LOAD_MEM(MachineType::Int64(), WASM_I8(0)));
+
+ memory[0] = 0xaabbccdd00112233LL;
+ CHECK_EQ(0xaabbccdd00112233LL, r.Call());
+
+ memory[0] = 0x33aabbccdd001122LL;
+ CHECK_EQ(0x33aabbccdd001122LL, r.Call());
+
+ memory[0] = 77777777;
+ CHECK_EQ(77777777, r.Call());
+}
+
+TEST(Run_Wasm_MemI64_Sum) {
+ REQUIRE(I64LoadStore);
+ REQUIRE(I64Add);
+ REQUIRE(I64Sub);
+ REQUIRE(I64Phi);
+ const int kNumElems = 20;
+ TestingModule module;
+ uint64_t* memory = module.AddMemoryElems<uint64_t>(kNumElems);
+ WasmRunner<uint64_t> r(&module, MachineType::Int32());
+ const byte kSum = r.AllocateLocal(kAstI64);
+
+ BUILD(r, WASM_BLOCK(
+ 2, WASM_WHILE(
+ WASM_GET_LOCAL(0),
+ WASM_BLOCK(
+ 2, WASM_SET_LOCAL(
+ kSum, WASM_I64_ADD(
+ WASM_GET_LOCAL(kSum),
+ WASM_LOAD_MEM(MachineType::Int64(),
+ WASM_GET_LOCAL(0)))),
+ WASM_SET_LOCAL(
+ 0, WASM_I32_SUB(WASM_GET_LOCAL(0), WASM_I8(8))))),
+ WASM_GET_LOCAL(1)));
+
+ // Run 4 trials.
+ for (int i = 0; i < 3; i++) {
+ module.RandomizeMemory(i * 33);
+ uint64_t expected = 0;
+ for (size_t j = kNumElems - 1; j > 0; j--) {
+ expected += memory[j];
+ }
+ uint64_t result = r.Call(8 * (kNumElems - 1));
+ CHECK_EQ(expected, result);
+ }
+}
+
+TEST(Run_Wasm_I64Global) {
+ REQUIRE(I64LoadStore);
+ REQUIRE(I64SConvertI32);
+ REQUIRE(I64And);
+ REQUIRE(DepthFirst);
+ TestingModule module;
+ int64_t* global = module.AddGlobal<int64_t>(MachineType::Int64());
+ WasmRunner<int32_t> r(&module, MachineType::Int32());
+ // global = global + p0
+ BUILD(r, B2(WASM_STORE_GLOBAL(
+ 0, WASM_I64_AND(WASM_LOAD_GLOBAL(0),
+ WASM_I64_SCONVERT_I32(WASM_GET_LOCAL(0)))),
+ WASM_ZERO));
+
+ *global = 0xFFFFFFFFFFFFFFFFLL;
+ for (int i = 9; i < 444444; i += 111111) {
+ int64_t expected = *global & i;
+ r.Call(i);
+ CHECK_EQ(expected, *global);
+ }
+}
+
+TEST(Run_Wasm_I64Eqz) {
+ REQUIRE(I64Eq);
+
+ WasmRunner<int32_t> r(MachineType::Int64());
+ BUILD(r, WASM_I64_EQZ(WASM_GET_LOCAL(0)));
+
+ FOR_INT64_INPUTS(i) {
+ int32_t result = *i == 0 ? 1 : 0;
+ CHECK_EQ(result, r.Call(*i));
+ }
+}
+
+TEST(Run_Wasm_I64Ror) {
+ REQUIRE(I64Ror);
+ WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_ROR(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+
+ FOR_UINT64_INPUTS(i) {
+ FOR_UINT64_INPUTS(j) {
+ int64_t expected = bits::RotateRight64(*i, *j & 0x3f);
+ CHECK_EQ(expected, r.Call(*i, *j));
+ }
+ }
+}
+
+TEST(Run_Wasm_I64Rol) {
+ REQUIRE(I64Rol);
+ WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64());
+ BUILD(r, WASM_I64_ROL(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+
+ FOR_UINT64_INPUTS(i) {
+ FOR_UINT64_INPUTS(j) {
+ int64_t expected = bits::RotateLeft64(*i, *j & 0x3f);
+ CHECK_EQ(expected, r.Call(*i, *j));
+ }
+ }
+}
diff --git a/test/cctest/wasm/test-run-wasm-js.cc b/test/cctest/wasm/test-run-wasm-js.cc
index 0b33808..6d95d6e 100644
--- a/test/cctest/wasm/test-run-wasm-js.cc
+++ b/test/cctest/wasm/test-run-wasm-js.cc
@@ -54,21 +54,30 @@
Handle<JSFunction> jsfunc = Handle<JSFunction>::cast(v8::Utils::OpenHandle(
*v8::Local<v8::Function>::Cast(CompileRun(source))));
module->AddFunction(sig, Handle<Code>::null());
- uint32_t index = static_cast<uint32_t>(module->module->functions->size() - 1);
+ uint32_t index = static_cast<uint32_t>(module->module->functions.size() - 1);
Isolate* isolate = CcTest::InitIsolateOnce();
- Handle<Code> code =
- CompileWasmToJSWrapper(isolate, module, jsfunc, sig, "test");
- module->instance->function_code->at(index) = code;
+ WasmName module_name = {"test", 4};
+ WasmName function_name = {nullptr, 0};
+ Handle<Code> code = CompileWasmToJSWrapper(isolate, module, jsfunc, sig,
+ module_name, function_name);
+ module->instance->function_code[index] = code;
return index;
}
uint32_t AddJSSelector(TestingModule* module, FunctionSig* sig, int which) {
- const int kMaxParams = 8;
- static const char* formals[kMaxParams] = {
- "", "a", "a,b", "a,b,c",
- "a,b,c,d", "a,b,c,d,e", "a,b,c,d,e,f", "a,b,c,d,e,f,g",
- };
+ const int kMaxParams = 11;
+ static const char* formals[kMaxParams] = {"",
+ "a",
+ "a,b",
+ "a,b,c",
+ "a,b,c,d",
+ "a,b,c,d,e",
+ "a,b,c,d,e,f",
+ "a,b,c,d,e,f,g",
+ "a,b,c,d,e,f,g,h",
+ "a,b,c,d,e,f,g,h,i",
+ "a,b,c,d,e,f,g,h,i,j"};
CHECK_LT(which, static_cast<int>(sig->parameter_count()));
CHECK_LT(static_cast<int>(sig->parameter_count()), kMaxParams);
@@ -86,7 +95,7 @@
// Wrap the code so it can be called as a JS function.
Handle<String> name = isolate->factory()->NewStringFromStaticChars("main");
Handle<JSObject> module_object = Handle<JSObject>(0, isolate);
- Handle<Code> code = module->instance->function_code->at(index);
+ Handle<Code> code = module->instance->function_code[index];
WasmJs::InstallWasmFunctionMap(isolate, isolate->native_context());
return compiler::CompileJSToWasmWrapper(isolate, module, name, code,
module_object, index);
@@ -171,8 +180,6 @@
}
-#if !V8_TARGET_ARCH_ARM64
-// TODO(titzer): dynamic frame alignment on arm64
TEST(Run_CallJS_Add_jswrapped) {
TestSignatures sigs;
TestingModule module;
@@ -187,12 +194,9 @@
EXPECT_CALL(199, jsfunc, 100, -1);
EXPECT_CALL(-666666801, jsfunc, -666666900, -1);
}
-#endif
void RunJSSelectTest(int which) {
-#if !V8_TARGET_ARCH_ARM
- // TODO(titzer): fix tests on arm and reenable
const int kMaxParams = 8;
PredictableInputValues inputs(0x100);
LocalType type = kAstF64;
@@ -223,7 +227,6 @@
double expected = inputs.arg_d(which);
EXPECT_CALL(expected, jsfunc, 0.0, 0.0);
}
-#endif
}
@@ -296,10 +299,11 @@
void RunWASMSelectAlignTest(int num_args, int num_params) {
PredictableInputValues inputs(0x300);
Isolate* isolate = CcTest::InitIsolateOnce();
- const int kMaxParams = 4;
+ const int kMaxParams = 10;
DCHECK_LE(num_args, kMaxParams);
LocalType type = kAstF64;
- LocalType types[kMaxParams + 1] = {type, type, type, type, type};
+ LocalType types[kMaxParams + 1] = {type, type, type, type, type, type,
+ type, type, type, type, type};
FunctionSig sig(1, num_params, types);
for (int which = 0; which < num_params; which++) {
@@ -308,12 +312,16 @@
BUILD(t, WASM_GET_LOCAL(which));
Handle<JSFunction> jsfunc = WrapCode(&module, t.CompileAndAdd());
- Handle<Object> args[] = {
- isolate->factory()->NewNumber(inputs.arg_d(0)),
- isolate->factory()->NewNumber(inputs.arg_d(1)),
- isolate->factory()->NewNumber(inputs.arg_d(2)),
- isolate->factory()->NewNumber(inputs.arg_d(3)),
- };
+ Handle<Object> args[] = {isolate->factory()->NewNumber(inputs.arg_d(0)),
+ isolate->factory()->NewNumber(inputs.arg_d(1)),
+ isolate->factory()->NewNumber(inputs.arg_d(2)),
+ isolate->factory()->NewNumber(inputs.arg_d(3)),
+ isolate->factory()->NewNumber(inputs.arg_d(4)),
+ isolate->factory()->NewNumber(inputs.arg_d(5)),
+ isolate->factory()->NewNumber(inputs.arg_d(6)),
+ isolate->factory()->NewNumber(inputs.arg_d(7)),
+ isolate->factory()->NewNumber(inputs.arg_d(8)),
+ isolate->factory()->NewNumber(inputs.arg_d(9))};
double nan = std::numeric_limits<double>::quiet_NaN();
double expected = which < num_args ? inputs.arg_d(which) : nan;
@@ -351,16 +359,43 @@
RunWASMSelectAlignTest(4, 4);
}
+TEST(Run_WASMSelectAlign_7) {
+ RunWASMSelectAlignTest(7, 5);
+ RunWASMSelectAlignTest(7, 6);
+ RunWASMSelectAlignTest(7, 7);
+}
+
+TEST(Run_WASMSelectAlign_8) {
+ RunWASMSelectAlignTest(8, 5);
+ RunWASMSelectAlignTest(8, 6);
+ RunWASMSelectAlignTest(8, 7);
+ RunWASMSelectAlignTest(8, 8);
+}
+
+TEST(Run_WASMSelectAlign_9) {
+ RunWASMSelectAlignTest(9, 6);
+ RunWASMSelectAlignTest(9, 7);
+ RunWASMSelectAlignTest(9, 8);
+ RunWASMSelectAlignTest(9, 9);
+}
+
+TEST(Run_WASMSelectAlign_10) {
+ RunWASMSelectAlignTest(10, 7);
+ RunWASMSelectAlignTest(10, 8);
+ RunWASMSelectAlignTest(10, 9);
+ RunWASMSelectAlignTest(10, 10);
+}
void RunJSSelectAlignTest(int num_args, int num_params) {
PredictableInputValues inputs(0x400);
Isolate* isolate = CcTest::InitIsolateOnce();
Factory* factory = isolate->factory();
- const int kMaxParams = 4;
+ const int kMaxParams = 10;
CHECK_LE(num_args, kMaxParams);
CHECK_LE(num_params, kMaxParams);
LocalType type = kAstF64;
- LocalType types[kMaxParams + 1] = {type, type, type, type, type};
+ LocalType types[kMaxParams + 1] = {type, type, type, type, type, type,
+ type, type, type, type, type};
FunctionSig sig(1, num_params, types);
// Build the calling code.
@@ -390,6 +425,12 @@
factory->NewNumber(inputs.arg_d(1)),
factory->NewNumber(inputs.arg_d(2)),
factory->NewNumber(inputs.arg_d(3)),
+ factory->NewNumber(inputs.arg_d(4)),
+ factory->NewNumber(inputs.arg_d(5)),
+ factory->NewNumber(inputs.arg_d(6)),
+ factory->NewNumber(inputs.arg_d(7)),
+ factory->NewNumber(inputs.arg_d(8)),
+ factory->NewNumber(inputs.arg_d(9)),
};
double nan = std::numeric_limits<double>::quiet_NaN();
@@ -404,29 +445,50 @@
RunJSSelectAlignTest(0, 2);
}
+TEST(Run_JSSelectAlign_1) {
+ RunJSSelectAlignTest(1, 2);
+ RunJSSelectAlignTest(1, 3);
+}
TEST(Run_JSSelectAlign_2) {
RunJSSelectAlignTest(2, 3);
RunJSSelectAlignTest(2, 4);
}
+TEST(Run_JSSelectAlign_3) {
+ RunJSSelectAlignTest(3, 3);
+ RunJSSelectAlignTest(3, 4);
+}
TEST(Run_JSSelectAlign_4) {
RunJSSelectAlignTest(4, 3);
RunJSSelectAlignTest(4, 4);
}
-
-#if !V8_TARGET_ARCH_ARM64
-// TODO(titzer): dynamic frame alignment on arm64
-TEST(Run_JSSelectAlign_1) {
- RunJSSelectAlignTest(1, 2);
- RunJSSelectAlignTest(1, 3);
+TEST(Run_JSSelectAlign_7) {
+ RunJSSelectAlignTest(7, 3);
+ RunJSSelectAlignTest(7, 4);
+ RunJSSelectAlignTest(7, 4);
+ RunJSSelectAlignTest(7, 4);
}
-
-TEST(Run_JSSelectAlign_3) {
- RunJSSelectAlignTest(3, 3);
- RunJSSelectAlignTest(3, 4);
+TEST(Run_JSSelectAlign_8) {
+ RunJSSelectAlignTest(8, 5);
+ RunJSSelectAlignTest(8, 6);
+ RunJSSelectAlignTest(8, 7);
+ RunJSSelectAlignTest(8, 8);
}
-#endif
+
+TEST(Run_JSSelectAlign_9) {
+ RunJSSelectAlignTest(9, 6);
+ RunJSSelectAlignTest(9, 7);
+ RunJSSelectAlignTest(9, 8);
+ RunJSSelectAlignTest(9, 9);
+}
+
+TEST(Run_JSSelectAlign_10) {
+ RunJSSelectAlignTest(10, 7);
+ RunJSSelectAlignTest(10, 8);
+ RunJSSelectAlignTest(10, 9);
+ RunJSSelectAlignTest(10, 10);
+}
diff --git a/test/cctest/wasm/test-run-wasm-module.cc b/test/cctest/wasm/test-run-wasm-module.cc
index 905e8e4..118a91f 100644
--- a/test/cctest/wasm/test-run-wasm-module.cc
+++ b/test/cctest/wasm/test-run-wasm-module.cc
@@ -19,7 +19,6 @@
using namespace v8::internal::wasm;
-#if !V8_TARGET_ARCH_ARM64
// TODO(titzer): fix arm64 frame alignment.
namespace {
void TestModule(WasmModuleIndex* module, int32_t expected_result) {
@@ -36,19 +35,24 @@
// A raw test that skips the WasmModuleBuilder.
TEST(Run_WasmModule_CallAdd_rev) {
static const byte data[] = {
+ WASM_MODULE_HEADER,
// sig#0 ------------------------------------------
- kDeclSignatures, 2, 0, kLocalI32, // void -> int
- 2, kLocalI32, kLocalI32, kLocalI32, // int,int -> int
+ WASM_SECTION_SIGNATURES_SIZE + 7, // Section size.
+ WASM_SECTION_SIGNATURES, 2, 0, kLocalI32, // void -> int
+ 2, kLocalI32, kLocalI32, kLocalI32, // int,int -> int
// func#0 (main) ----------------------------------
- kDeclFunctions, 2, kDeclFunctionExport, 0, 0, // sig index
- 6, 0, // body size
- kExprCallFunction, 1, // --
- kExprI8Const, 77, // --
- kExprI8Const, 22, // --
+ WASM_SECTION_FUNCTIONS_SIZE + 24, WASM_SECTION_FUNCTIONS, 2,
+ kDeclFunctionExport, 0, 0, // sig index
+ 7, 0, // body size
+ 0, // locals
+ kExprCallFunction, 1, // --
+ kExprI8Const, 77, // --
+ kExprI8Const, 22, // --
// func#1 -----------------------------------------
0, // no name, not exported
1, 0, // sig index
- 5, 0, // body size
+ 6, 0, // body size
+ 0, // locals
kExprI32Add, // --
kExprGetLocal, 0, // --
kExprGetLocal, 1, // --
@@ -65,7 +69,8 @@
TEST(Run_WasmModule_Return114) {
static const int32_t kReturnValue = 114;
- Zone zone;
+ v8::base::AccountingAllocator allocator;
+ Zone zone(&allocator);
WasmModuleBuilder* builder = new (&zone) WasmModuleBuilder(&zone);
uint16_t f_index = builder->AddFunction();
WasmFunctionBuilder* f = builder->FunctionAt(f_index);
@@ -79,7 +84,8 @@
TEST(Run_WasmModule_CallAdd) {
- Zone zone;
+ v8::base::AccountingAllocator allocator;
+ Zone zone(&allocator);
WasmModuleBuilder* builder = new (&zone) WasmModuleBuilder(&zone);
uint16_t f1_index = builder->AddFunction();
WasmFunctionBuilder* f = builder->FunctionAt(f1_index);
@@ -102,7 +108,8 @@
TEST(Run_WasmModule_ReadLoadedDataSegment) {
static const byte kDataSegmentDest0 = 12;
- Zone zone;
+ v8::base::AccountingAllocator allocator;
+ Zone zone(&allocator);
WasmModuleBuilder* builder = new (&zone) WasmModuleBuilder(&zone);
uint16_t f_index = builder->AddFunction();
WasmFunctionBuilder* f = builder->FunctionAt(f_index);
@@ -118,19 +125,10 @@
TestModule(writer->WriteTo(&zone), 0xddccbbaa);
}
-
-#if defined(__has_feature)
-#if __has_feature(address_sanitizer)
-#define V8_WITH_ASAN 1
-#endif
-#endif
-
-
-#if !defined(V8_WITH_ASAN)
-// TODO(bradnelson): Figure out why this crashes under asan.
TEST(Run_WasmModule_CheckMemoryIsZero) {
static const int kCheckSize = 16 * 1024;
- Zone zone;
+ v8::base::AccountingAllocator allocator;
+ Zone zone(&allocator);
WasmModuleBuilder* builder = new (&zone) WasmModuleBuilder(&zone);
uint16_t f_index = builder->AddFunction();
WasmFunctionBuilder* f = builder->FunctionAt(f_index);
@@ -140,23 +138,19 @@
byte code[] = {WASM_BLOCK(
2,
WASM_WHILE(
- WASM_I32_LTS(WASM_GET_LOCAL(localIndex), WASM_I32(kCheckSize)),
+ WASM_I32_LTS(WASM_GET_LOCAL(localIndex), WASM_I32V_3(kCheckSize)),
WASM_IF_ELSE(
WASM_LOAD_MEM(MachineType::Int32(), WASM_GET_LOCAL(localIndex)),
WASM_BRV(2, WASM_I8(-1)), WASM_INC_LOCAL_BY(localIndex, 4))),
WASM_I8(11))};
- uint32_t local_indices[] = {7, 19, 25, 28};
- f->EmitCode(code, sizeof(code), local_indices, sizeof(local_indices) / 4);
+ f->EmitCode(code, sizeof(code), nullptr, 0);
WasmModuleWriter* writer = builder->Build(&zone);
TestModule(writer->WriteTo(&zone), 11);
}
-#endif
-
-#if !defined(V8_WITH_ASAN)
-// TODO(bradnelson): Figure out why this crashes under asan.
TEST(Run_WasmModule_CallMain_recursive) {
- Zone zone;
+ v8::base::AccountingAllocator allocator;
+ Zone zone(&allocator);
WasmModuleBuilder* builder = new (&zone) WasmModuleBuilder(&zone);
uint16_t f_index = builder->AddFunction();
WasmFunctionBuilder* f = builder->FunctionAt(f_index);
@@ -171,18 +165,14 @@
WASM_INC_LOCAL(localIndex)),
WASM_BRV(1, WASM_CALL_FUNCTION0(0))),
WASM_BRV(0, WASM_I8(55))))};
- uint32_t local_indices[] = {3, 11, 21, 24};
- f->EmitCode(code, sizeof(code), local_indices, sizeof(local_indices) / 4);
+ f->EmitCode(code, sizeof(code), nullptr, 0);
WasmModuleWriter* writer = builder->Build(&zone);
TestModule(writer->WriteTo(&zone), 55);
}
-#endif
-
-#if !defined(V8_WITH_ASAN)
-// TODO(bradnelson): Figure out why this crashes under asan.
TEST(Run_WasmModule_Global) {
- Zone zone;
+ v8::base::AccountingAllocator allocator;
+ Zone zone(&allocator);
WasmModuleBuilder* builder = new (&zone) WasmModuleBuilder(&zone);
uint32_t global1 = builder->AddGlobal(MachineType::Int32(), 0);
uint32_t global2 = builder->AddGlobal(MachineType::Int32(), 0);
@@ -196,13 +186,10 @@
f = builder->FunctionAt(f2_index);
f->ReturnType(kAstI32);
f->Exported(1);
- byte code2[] = {WASM_STORE_GLOBAL(global1, WASM_I32(56)),
- WASM_STORE_GLOBAL(global2, WASM_I32(41)),
+ byte code2[] = {WASM_STORE_GLOBAL(global1, WASM_I32V_1(56)),
+ WASM_STORE_GLOBAL(global2, WASM_I32V_1(41)),
WASM_RETURN(WASM_CALL_FUNCTION0(f1_index))};
f->EmitCode(code2, sizeof(code2));
WasmModuleWriter* writer = builder->Build(&zone);
TestModule(writer->WriteTo(&zone), 97);
}
-#endif
-
-#endif // !V8_TARGET_ARCH_ARM64
diff --git a/test/cctest/wasm/test-run-wasm.cc b/test/cctest/wasm/test-run-wasm.cc
index a6f07f7..70d461b 100644
--- a/test/cctest/wasm/test-run-wasm.cc
+++ b/test/cctest/wasm/test-run-wasm.cc
@@ -18,12 +18,11 @@
using namespace v8::internal::compiler;
using namespace v8::internal::wasm;
-#define BUILD(r, ...) \
- do { \
- byte code[] = {__VA_ARGS__}; \
- r.Build(code, code + arraysize(code)); \
- } while (false)
-
+// for even shorter tests.
+#define B2(a, b) kExprBlock, 2, a, b
+#define B1(a) kExprBlock, 1, a
+#define RET(x) kExprReturn, x
+#define RET_I8(x) kExprReturn, kExprI8Const, x
TEST(Run_WasmInt8Const) {
WasmRunner<int32_t> r;
@@ -67,7 +66,7 @@
WasmRunner<int32_t> r;
const int32_t kExpectedValue = 0x11223344;
// return(kExpectedValue)
- BUILD(r, WASM_I32(kExpectedValue));
+ BUILD(r, WASM_I32V_5(kExpectedValue));
CHECK_EQ(kExpectedValue, r.Call());
}
@@ -77,7 +76,7 @@
WasmRunner<int32_t> r;
const int32_t kExpectedValue = *i;
// return(kExpectedValue)
- BUILD(r, WASM_I32(kExpectedValue));
+ BUILD(r, WASM_I32V(kExpectedValue));
CHECK_EQ(kExpectedValue, r.Call());
}
}
@@ -92,47 +91,6 @@
}
-#if WASM_64
-TEST(Run_WasmInt64Const) {
- WasmRunner<int64_t> r;
- const int64_t kExpectedValue = 0x1122334455667788LL;
- // return(kExpectedValue)
- BUILD(r, WASM_I64(kExpectedValue));
- CHECK_EQ(kExpectedValue, r.Call());
-}
-
-
-TEST(Run_WasmInt64Const_many) {
- int cntr = 0;
- FOR_INT32_INPUTS(i) {
- WasmRunner<int64_t> r;
- const int64_t kExpectedValue = (static_cast<int64_t>(*i) << 32) | cntr;
- // return(kExpectedValue)
- BUILD(r, WASM_I64(kExpectedValue));
- CHECK_EQ(kExpectedValue, r.Call());
- cntr++;
- }
-}
-#endif
-
-TEST(Run_WasmI32ConvertI64) {
- FOR_INT64_INPUTS(i) {
- WasmRunner<int32_t> r;
- BUILD(r, WASM_I32_CONVERT_I64(WASM_I64(*i)));
- CHECK_EQ(static_cast<int32_t>(*i), r.Call());
- }
-}
-
-TEST(Run_WasmI64AndConstants) {
- FOR_INT64_INPUTS(i) {
- FOR_INT64_INPUTS(j) {
- WasmRunner<int32_t> r;
- BUILD(r, WASM_I32_CONVERT_I64(WASM_I64_AND(WASM_I64(*i), WASM_I64(*j))));
- CHECK_EQ(static_cast<int32_t>(*i & *j), r.Call());
- }
- }
-}
-
TEST(Run_WasmInt32Param0) {
WasmRunner<int32_t> r(MachineType::Int32());
// return(local[0])
@@ -216,7 +174,7 @@
{
WasmRunner<int32_t> r;
// K op K
- BUILD(r, WASM_BINOP(opcode, WASM_I32(a), WASM_I32(b)));
+ BUILD(r, WASM_BINOP(opcode, WASM_I32V(a), WASM_I32V(b)));
CHECK_EQ(expected, r.Call());
}
{
@@ -241,6 +199,10 @@
TestInt32Binop(kExprI32Shl, 0xA0000000, 0xA, 28);
TestInt32Binop(kExprI32ShrU, 0x07000010, 0x70000100, 4);
TestInt32Binop(kExprI32ShrS, 0xFF000000, 0x80000000, 7);
+ TestInt32Binop(kExprI32Ror, 0x01000000, 0x80000000, 7);
+ TestInt32Binop(kExprI32Ror, 0x01000000, 0x80000000, 39);
+ TestInt32Binop(kExprI32Rol, 0x00000040, 0x80000000, 7);
+ TestInt32Binop(kExprI32Rol, 0x00000040, 0x80000000, 39);
TestInt32Binop(kExprI32Eq, 1, -99, -99);
TestInt32Binop(kExprI32Ne, 0, -97, -97);
@@ -260,7 +222,7 @@
{
WasmRunner<int32_t> r;
// return op K
- BUILD(r, WASM_UNOP(opcode, WASM_I32(a)));
+ BUILD(r, WASM_UNOP(opcode, WASM_I32V(a)));
CHECK_EQ(expected, r.Call());
}
{
@@ -354,209 +316,83 @@
TestInt32Unop(kExprI32Popcnt, 19, 0xfedcba09);
}
+TEST(Run_WasmI32Eqz) {
+ TestInt32Unop(kExprI32Eqz, 0, 1);
+ TestInt32Unop(kExprI32Eqz, 0, -1);
+ TestInt32Unop(kExprI32Eqz, 0, -827343);
+ TestInt32Unop(kExprI32Eqz, 0, 8888888);
+ TestInt32Unop(kExprI32Eqz, 1, 0);
+}
-#if WASM_64
-void TestInt64Binop(WasmOpcode opcode, int64_t expected, int64_t a, int64_t b) {
- if (!WasmOpcodes::IsSupported(opcode)) return;
- {
- WasmRunner<int64_t> r;
- // return K op K
- BUILD(r, WASM_BINOP(opcode, WASM_I64(a), WASM_I64(b)));
- CHECK_EQ(expected, r.Call());
- }
- {
- WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64());
- // return a op b
- BUILD(r, WASM_BINOP(opcode, WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
- CHECK_EQ(expected, r.Call(a, b));
+TEST(Run_WasmI32Shl) {
+ WasmRunner<uint32_t> r(MachineType::Uint32(), MachineType::Uint32());
+ BUILD(r, WASM_I32_SHL(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+
+ FOR_UINT32_INPUTS(i) {
+ FOR_UINT32_INPUTS(j) {
+ uint32_t expected = (*i) << (*j & 0x1f);
+ CHECK_EQ(expected, r.Call(*i, *j));
+ }
}
}
+TEST(Run_WasmI32Shr) {
+ WasmRunner<uint32_t> r(MachineType::Uint32(), MachineType::Uint32());
+ BUILD(r, WASM_I32_SHR(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
-void TestInt64Cmp(WasmOpcode opcode, int64_t expected, int64_t a, int64_t b) {
- if (!WasmOpcodes::IsSupported(opcode)) return;
- {
- WasmRunner<int32_t> r;
- // return K op K
- BUILD(r, WASM_BINOP(opcode, WASM_I64(a), WASM_I64(b)));
- CHECK_EQ(expected, r.Call());
- }
- {
- WasmRunner<int32_t> r(MachineType::Int64(), MachineType::Int64());
- // return a op b
- BUILD(r, WASM_BINOP(opcode, WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
- CHECK_EQ(expected, r.Call(a, b));
+ FOR_UINT32_INPUTS(i) {
+ FOR_UINT32_INPUTS(j) {
+ uint32_t expected = (*i) >> (*j & 0x1f);
+ CHECK_EQ(expected, r.Call(*i, *j));
+ }
}
}
+TEST(Run_WasmI32Sar) {
+ WasmRunner<int32_t> r(MachineType::Int32(), MachineType::Int32());
+ BUILD(r, WASM_I32_SAR(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
-TEST(Run_WasmInt64Binops) {
- // TODO(titzer): real 64-bit numbers
- TestInt64Binop(kExprI64Add, 8888888888888LL, 3333333333333LL,
- 5555555555555LL);
- TestInt64Binop(kExprI64Sub, -111111111111LL, 777777777777LL, 888888888888LL);
- TestInt64Binop(kExprI64Mul, 65130756, 88734, 734);
- TestInt64Binop(kExprI64DivS, -66, -4777344, 72384);
- TestInt64Binop(kExprI64DivU, 805306368, 0xF0000000, 5);
- TestInt64Binop(kExprI64RemS, -3, -3003, 1000);
- TestInt64Binop(kExprI64RemU, 4, 4004, 1000);
- TestInt64Binop(kExprI64And, 0xEE, 0xFFEE, 0xFF0000FF);
- TestInt64Binop(kExprI64Ior, 0xF0FF00FF, 0xF0F000EE, 0x000F0011);
- TestInt64Binop(kExprI64Xor, 0xABCDEF01, 0xABCDEFFF, 0xFE);
- TestInt64Binop(kExprI64Shl, 0xA0000000, 0xA, 28);
- TestInt64Binop(kExprI64ShrU, 0x0700001000123456LL, 0x7000010001234567LL, 4);
- TestInt64Binop(kExprI64ShrS, 0xFF00000000000000LL, 0x8000000000000000LL, 7);
- TestInt64Cmp(kExprI64Eq, 1, -9999, -9999);
- TestInt64Cmp(kExprI64Ne, 1, -9199, -9999);
- TestInt64Cmp(kExprI64LtS, 1, -4, 4);
- TestInt64Cmp(kExprI64LeS, 0, -2, -3);
- TestInt64Cmp(kExprI64LtU, 1, 0, -6);
- TestInt64Cmp(kExprI64LeU, 1, 98978, 0xF0000000);
-}
-
-
-TEST(Run_WasmInt64Clz) {
- struct {
- int64_t expected;
- uint64_t input;
- } values[] = {{0, 0x8000100000000000}, {1, 0x4000050000000000},
- {2, 0x2000030000000000}, {3, 0x1000000300000000},
- {4, 0x0805000000000000}, {5, 0x0400600000000000},
- {6, 0x0200000000000000}, {7, 0x010000a000000000},
- {8, 0x00800c0000000000}, {9, 0x0040000000000000},
- {10, 0x0020000d00000000}, {11, 0x00100f0000000000},
- {12, 0x0008000000000000}, {13, 0x0004100000000000},
- {14, 0x0002002000000000}, {15, 0x0001030000000000},
- {16, 0x0000804000000000}, {17, 0x0000400500000000},
- {18, 0x0000205000000000}, {19, 0x0000170000000000},
- {20, 0x0000087000000000}, {21, 0x0000040500000000},
- {22, 0x0000020300000000}, {23, 0x0000010100000000},
- {24, 0x0000008900000000}, {25, 0x0000004100000000},
- {26, 0x0000002200000000}, {27, 0x0000001300000000},
- {28, 0x0000000800000000}, {29, 0x0000000400000000},
- {30, 0x0000000200000000}, {31, 0x0000000100000000},
- {32, 0x0000000080001000}, {33, 0x0000000040000500},
- {34, 0x0000000020000300}, {35, 0x0000000010000003},
- {36, 0x0000000008050000}, {37, 0x0000000004006000},
- {38, 0x0000000002000000}, {39, 0x00000000010000a0},
- {40, 0x0000000000800c00}, {41, 0x0000000000400000},
- {42, 0x000000000020000d}, {43, 0x0000000000100f00},
- {44, 0x0000000000080000}, {45, 0x0000000000041000},
- {46, 0x0000000000020020}, {47, 0x0000000000010300},
- {48, 0x0000000000008040}, {49, 0x0000000000004005},
- {50, 0x0000000000002050}, {51, 0x0000000000001700},
- {52, 0x0000000000000870}, {53, 0x0000000000000405},
- {54, 0x0000000000000203}, {55, 0x0000000000000101},
- {56, 0x0000000000000089}, {57, 0x0000000000000041},
- {58, 0x0000000000000022}, {59, 0x0000000000000013},
- {60, 0x0000000000000008}, {61, 0x0000000000000004},
- {62, 0x0000000000000002}, {63, 0x0000000000000001},
- {64, 0x0000000000000000}};
-
- WasmRunner<int64_t> r(MachineType::Uint64());
- BUILD(r, WASM_I64_CLZ(WASM_GET_LOCAL(0)));
- for (size_t i = 0; i < arraysize(values); i++) {
- CHECK_EQ(values[i].expected, r.Call(values[i].input));
+ FOR_INT32_INPUTS(i) {
+ FOR_INT32_INPUTS(j) {
+ int32_t expected = (*i) >> (*j & 0x1f);
+ CHECK_EQ(expected, r.Call(*i, *j));
+ }
}
}
-
-TEST(Run_WasmInt64Ctz) {
- struct {
- int64_t expected;
- uint64_t input;
- } values[] = {{64, 0x0000000000000000}, {63, 0x8000000000000000},
- {62, 0x4000000000000000}, {61, 0x2000000000000000},
- {60, 0x1000000000000000}, {59, 0xa800000000000000},
- {58, 0xf400000000000000}, {57, 0x6200000000000000},
- {56, 0x9100000000000000}, {55, 0xcd80000000000000},
- {54, 0x0940000000000000}, {53, 0xaf20000000000000},
- {52, 0xac10000000000000}, {51, 0xe0b8000000000000},
- {50, 0x9ce4000000000000}, {49, 0xc792000000000000},
- {48, 0xb8f1000000000000}, {47, 0x3b9f800000000000},
- {46, 0xdb4c400000000000}, {45, 0xe9a3200000000000},
- {44, 0xfca6100000000000}, {43, 0x6c8a780000000000},
- {42, 0x8ce5a40000000000}, {41, 0xcb7d020000000000},
- {40, 0xcb4dc10000000000}, {39, 0xdfbec58000000000},
- {38, 0x27a9db4000000000}, {37, 0xde3bcb2000000000},
- {36, 0xd7e8a61000000000}, {35, 0x9afdbc8800000000},
- {34, 0x9afdbc8400000000}, {33, 0x9afdbc8200000000},
- {32, 0x9afdbc8100000000}, {31, 0x0000000080000000},
- {30, 0x0000000040000000}, {29, 0x0000000020000000},
- {28, 0x0000000010000000}, {27, 0x00000000a8000000},
- {26, 0x00000000f4000000}, {25, 0x0000000062000000},
- {24, 0x0000000091000000}, {23, 0x00000000cd800000},
- {22, 0x0000000009400000}, {21, 0x00000000af200000},
- {20, 0x00000000ac100000}, {19, 0x00000000e0b80000},
- {18, 0x000000009ce40000}, {17, 0x00000000c7920000},
- {16, 0x00000000b8f10000}, {15, 0x000000003b9f8000},
- {14, 0x00000000db4c4000}, {13, 0x00000000e9a32000},
- {12, 0x00000000fca61000}, {11, 0x000000006c8a7800},
- {10, 0x000000008ce5a400}, {9, 0x00000000cb7d0200},
- {8, 0x00000000cb4dc100}, {7, 0x00000000dfbec580},
- {6, 0x0000000027a9db40}, {5, 0x00000000de3bcb20},
- {4, 0x00000000d7e8a610}, {3, 0x000000009afdbc88},
- {2, 0x000000009afdbc84}, {1, 0x000000009afdbc82},
- {0, 0x000000009afdbc81}};
-
- WasmRunner<int64_t> r(MachineType::Uint64());
- BUILD(r, WASM_I64_CTZ(WASM_GET_LOCAL(0)));
- for (size_t i = 0; i < arraysize(values); i++) {
- CHECK_EQ(values[i].expected, r.Call(values[i].input));
- }
-}
-
-
-TEST(Run_WasmInt64Popcnt) {
- struct {
- int64_t expected;
- uint64_t input;
- } values[] = {{64, 0xffffffffffffffff},
- {0, 0x0000000000000000},
- {2, 0x0000080000008000},
- {26, 0x1123456782345678},
- {38, 0xffedcba09edcba09}};
-
- WasmRunner<int64_t> r(MachineType::Uint64());
- BUILD(r, WASM_I64_POPCNT(WASM_GET_LOCAL(0)));
- for (size_t i = 0; i < arraysize(values); i++) {
- CHECK_EQ(values[i].expected, r.Call(values[i].input));
- }
-}
-
-
-#endif
-
TEST(Run_WASM_Int32DivS_trap) {
WasmRunner<int32_t> r(MachineType::Int32(), MachineType::Int32());
BUILD(r, WASM_I32_DIVS(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ const int32_t kMin = std::numeric_limits<int32_t>::min();
CHECK_EQ(0, r.Call(0, 100));
CHECK_TRAP(r.Call(100, 0));
CHECK_TRAP(r.Call(-1001, 0));
- CHECK_TRAP(r.Call(std::numeric_limits<int32_t>::min(), -1));
- CHECK_TRAP(r.Call(std::numeric_limits<int32_t>::min(), 0));
+ CHECK_TRAP(r.Call(kMin, -1));
+ CHECK_TRAP(r.Call(kMin, 0));
}
TEST(Run_WASM_Int32RemS_trap) {
WasmRunner<int32_t> r(MachineType::Int32(), MachineType::Int32());
BUILD(r, WASM_I32_REMS(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ const int32_t kMin = std::numeric_limits<int32_t>::min();
CHECK_EQ(33, r.Call(133, 100));
- CHECK_EQ(0, r.Call(std::numeric_limits<int32_t>::min(), -1));
+ CHECK_EQ(0, r.Call(kMin, -1));
CHECK_TRAP(r.Call(100, 0));
CHECK_TRAP(r.Call(-1001, 0));
- CHECK_TRAP(r.Call(std::numeric_limits<int32_t>::min(), 0));
+ CHECK_TRAP(r.Call(kMin, 0));
}
TEST(Run_WASM_Int32DivU_trap) {
WasmRunner<int32_t> r(MachineType::Int32(), MachineType::Int32());
BUILD(r, WASM_I32_DIVU(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ const int32_t kMin = std::numeric_limits<int32_t>::min();
CHECK_EQ(0, r.Call(0, 100));
- CHECK_EQ(0, r.Call(std::numeric_limits<int32_t>::min(), -1));
+ CHECK_EQ(0, r.Call(kMin, -1));
CHECK_TRAP(r.Call(100, 0));
CHECK_TRAP(r.Call(-1001, 0));
- CHECK_TRAP(r.Call(std::numeric_limits<int32_t>::min(), 0));
+ CHECK_TRAP(r.Call(kMin, 0));
}
@@ -564,11 +400,63 @@
WasmRunner<int32_t> r(MachineType::Int32(), MachineType::Int32());
BUILD(r, WASM_I32_REMU(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
CHECK_EQ(17, r.Call(217, 100));
+ const int32_t kMin = std::numeric_limits<int32_t>::min();
CHECK_TRAP(r.Call(100, 0));
CHECK_TRAP(r.Call(-1001, 0));
- CHECK_TRAP(r.Call(std::numeric_limits<int32_t>::min(), 0));
- CHECK_EQ(std::numeric_limits<int32_t>::min(),
- r.Call(std::numeric_limits<int32_t>::min(), -1));
+ CHECK_TRAP(r.Call(kMin, 0));
+ CHECK_EQ(kMin, r.Call(kMin, -1));
+}
+
+TEST(Run_WASM_Int32DivS_asmjs) {
+ TestingModule module;
+ module.origin = kAsmJsOrigin;
+ WasmRunner<int32_t> r(&module, MachineType::Int32(), MachineType::Int32());
+ BUILD(r, WASM_I32_DIVS(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ const int32_t kMin = std::numeric_limits<int32_t>::min();
+ CHECK_EQ(0, r.Call(0, 100));
+ CHECK_EQ(0, r.Call(100, 0));
+ CHECK_EQ(0, r.Call(-1001, 0));
+ CHECK_EQ(kMin, r.Call(kMin, -1));
+ CHECK_EQ(0, r.Call(kMin, 0));
+}
+
+TEST(Run_WASM_Int32RemS_asmjs) {
+ TestingModule module;
+ module.origin = kAsmJsOrigin;
+ WasmRunner<int32_t> r(&module, MachineType::Int32(), MachineType::Int32());
+ BUILD(r, WASM_I32_REMS(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ const int32_t kMin = std::numeric_limits<int32_t>::min();
+ CHECK_EQ(33, r.Call(133, 100));
+ CHECK_EQ(0, r.Call(kMin, -1));
+ CHECK_EQ(0, r.Call(100, 0));
+ CHECK_EQ(0, r.Call(-1001, 0));
+ CHECK_EQ(0, r.Call(kMin, 0));
+}
+
+TEST(Run_WASM_Int32DivU_asmjs) {
+ TestingModule module;
+ module.origin = kAsmJsOrigin;
+ WasmRunner<int32_t> r(&module, MachineType::Int32(), MachineType::Int32());
+ BUILD(r, WASM_I32_DIVU(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ const int32_t kMin = std::numeric_limits<int32_t>::min();
+ CHECK_EQ(0, r.Call(0, 100));
+ CHECK_EQ(0, r.Call(kMin, -1));
+ CHECK_EQ(0, r.Call(100, 0));
+ CHECK_EQ(0, r.Call(-1001, 0));
+ CHECK_EQ(0, r.Call(kMin, 0));
+}
+
+TEST(Run_WASM_Int32RemU_asmjs) {
+ TestingModule module;
+ module.origin = kAsmJsOrigin;
+ WasmRunner<int32_t> r(&module, MachineType::Int32(), MachineType::Int32());
+ BUILD(r, WASM_I32_REMU(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
+ const int32_t kMin = std::numeric_limits<int32_t>::min();
+ CHECK_EQ(17, r.Call(217, 100));
+ CHECK_EQ(0, r.Call(100, 0));
+ CHECK_EQ(0, r.Call(-1001, 0));
+ CHECK_EQ(0, r.Call(kMin, 0));
+ CHECK_EQ(kMin, r.Call(kMin, -1));
}
@@ -590,7 +478,7 @@
TEST(Run_WASM_Int32DivU_byzero_const) {
for (uint32_t denom = 0xfffffffe; denom < 8; denom++) {
WasmRunner<uint32_t> r(MachineType::Uint32());
- BUILD(r, WASM_I32_DIVU(WASM_GET_LOCAL(0), WASM_I32(denom)));
+ BUILD(r, WASM_I32_DIVU(WASM_GET_LOCAL(0), WASM_I32V_1(denom)));
for (uint32_t val = 0xfffffff0; val < 8; val++) {
if (denom == 0) {
@@ -622,86 +510,6 @@
CHECK_TRAP(r.Call(0, 0));
}
-
-#if WASM_64
-#define as64(x) static_cast<int64_t>(x)
-TEST(Run_WASM_Int64DivS_trap) {
- WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64());
- BUILD(r, WASM_I64_DIVS(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
- CHECK_EQ(0, r.Call(as64(0), as64(100)));
- CHECK_TRAP64(r.Call(as64(100), as64(0)));
- CHECK_TRAP64(r.Call(as64(-1001), as64(0)));
- CHECK_TRAP64(r.Call(std::numeric_limits<int64_t>::min(), as64(-1)));
- CHECK_TRAP64(r.Call(std::numeric_limits<int64_t>::min(), as64(0)));
-}
-
-
-TEST(Run_WASM_Int64RemS_trap) {
- WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64());
- BUILD(r, WASM_I64_REMS(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
- CHECK_EQ(33, r.Call(as64(133), as64(100)));
- CHECK_EQ(0, r.Call(std::numeric_limits<int64_t>::min(), as64(-1)));
- CHECK_TRAP64(r.Call(as64(100), as64(0)));
- CHECK_TRAP64(r.Call(as64(-1001), as64(0)));
- CHECK_TRAP64(r.Call(std::numeric_limits<int64_t>::min(), as64(0)));
-}
-
-
-TEST(Run_WASM_Int64DivU_trap) {
- WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64());
- BUILD(r, WASM_I64_DIVU(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
- CHECK_EQ(0, r.Call(as64(0), as64(100)));
- CHECK_EQ(0, r.Call(std::numeric_limits<int64_t>::min(), as64(-1)));
- CHECK_TRAP64(r.Call(as64(100), as64(0)));
- CHECK_TRAP64(r.Call(as64(-1001), as64(0)));
- CHECK_TRAP64(r.Call(std::numeric_limits<int64_t>::min(), as64(0)));
-}
-
-
-TEST(Run_WASM_Int64RemU_trap) {
- WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64());
- BUILD(r, WASM_I64_REMU(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
- CHECK_EQ(17, r.Call(as64(217), as64(100)));
- CHECK_TRAP64(r.Call(as64(100), as64(0)));
- CHECK_TRAP64(r.Call(as64(-1001), as64(0)));
- CHECK_TRAP64(r.Call(std::numeric_limits<int64_t>::min(), as64(0)));
- CHECK_EQ(std::numeric_limits<int64_t>::min(),
- r.Call(std::numeric_limits<int64_t>::min(), as64(-1)));
-}
-
-
-TEST(Run_WASM_Int64DivS_byzero_const) {
- for (int8_t denom = -2; denom < 8; denom++) {
- WasmRunner<int64_t> r(MachineType::Int64());
- BUILD(r, WASM_I64_DIVS(WASM_GET_LOCAL(0), WASM_I64(denom)));
- for (int64_t val = -7; val < 8; val++) {
- if (denom == 0) {
- CHECK_TRAP64(r.Call(val));
- } else {
- CHECK_EQ(val / denom, r.Call(val));
- }
- }
- }
-}
-
-
-TEST(Run_WASM_Int64DivU_byzero_const) {
- for (uint64_t denom = 0xfffffffffffffffe; denom < 8; denom++) {
- WasmRunner<uint64_t> r(MachineType::Uint64());
- BUILD(r, WASM_I64_DIVU(WASM_GET_LOCAL(0), WASM_I64(denom)));
-
- for (uint64_t val = 0xfffffffffffffff0; val < 8; val++) {
- if (denom == 0) {
- CHECK_TRAP64(r.Call(val));
- } else {
- CHECK_EQ(val / denom, r.Call(val));
- }
- }
- }
-}
-#endif
-
-
void TestFloat32Binop(WasmOpcode opcode, int32_t expected, float a, float b) {
{
WasmRunner<int32_t> r;
@@ -892,7 +700,7 @@
TEST(Run_Wasm_Return12) {
WasmRunner<int32_t> r;
- BUILD(r, WASM_RETURN(WASM_I8(12)));
+ BUILD(r, RET_I8(12));
CHECK_EQ(12, r.Call());
}
@@ -900,7 +708,7 @@
TEST(Run_Wasm_Return17) {
WasmRunner<int32_t> r;
- BUILD(r, WASM_BLOCK(1, WASM_RETURN(WASM_I8(17))));
+ BUILD(r, B1(RET_I8(17)));
CHECK_EQ(17, r.Call());
}
@@ -908,27 +716,16 @@
TEST(Run_Wasm_Return_I32) {
WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r, WASM_RETURN(WASM_GET_LOCAL(0)));
+ BUILD(r, RET(WASM_GET_LOCAL(0)));
FOR_INT32_INPUTS(i) { CHECK_EQ(*i, r.Call(*i)); }
}
-#if WASM_64
-TEST(Run_Wasm_Return_I64) {
- WasmRunner<int64_t> r(MachineType::Int64());
-
- BUILD(r, WASM_RETURN(WASM_GET_LOCAL(0)));
-
- FOR_INT64_INPUTS(i) { CHECK_EQ(*i, r.Call(*i)); }
-}
-#endif
-
-
TEST(Run_Wasm_Return_F32) {
WasmRunner<float> r(MachineType::Float32());
- BUILD(r, WASM_RETURN(WASM_GET_LOCAL(0)));
+ BUILD(r, RET(WASM_GET_LOCAL(0)));
FOR_FLOAT32_INPUTS(i) {
float expect = *i;
@@ -945,7 +742,7 @@
TEST(Run_Wasm_Return_F64) {
WasmRunner<double> r(MachineType::Float64());
- BUILD(r, WASM_RETURN(WASM_GET_LOCAL(0)));
+ BUILD(r, RET(WASM_GET_LOCAL(0)));
FOR_FLOAT64_INPUTS(i) {
double expect = *i;
@@ -973,17 +770,18 @@
TEST(Run_Wasm_Select_strict1) {
WasmRunner<int32_t> r(MachineType::Int32());
// select(a=0, a=1, a=2); return a
- BUILD(r, WASM_BLOCK(2, WASM_SELECT(WASM_SET_LOCAL(0, WASM_I8(0)),
- WASM_SET_LOCAL(0, WASM_I8(1)),
- WASM_SET_LOCAL(0, WASM_I8(2))),
- WASM_GET_LOCAL(0)));
+ BUILD(r, B2(WASM_SELECT(WASM_SET_LOCAL(0, WASM_I8(0)),
+ WASM_SET_LOCAL(0, WASM_I8(1)),
+ WASM_SET_LOCAL(0, WASM_I8(2))),
+ WASM_GET_LOCAL(0)));
FOR_INT32_INPUTS(i) { CHECK_EQ(2, r.Call(*i)); }
}
TEST(Run_Wasm_Select_strict2) {
WasmRunner<int32_t> r(MachineType::Int32());
- r.env()->AddLocals(kAstI32, 2);
+ r.AllocateLocal(kAstI32);
+ r.AllocateLocal(kAstI32);
// select(b=5, c=6, a)
BUILD(r, WASM_SELECT(WASM_SET_LOCAL(1, WASM_I8(5)),
WASM_SET_LOCAL(2, WASM_I8(6)), WASM_GET_LOCAL(0)));
@@ -995,7 +793,8 @@
TEST(Run_Wasm_Select_strict3) {
WasmRunner<int32_t> r(MachineType::Int32());
- r.env()->AddLocals(kAstI32, 2);
+ r.AllocateLocal(kAstI32);
+ r.AllocateLocal(kAstI32);
// select(b=5, c=6, a=b)
BUILD(r, WASM_SELECT(WASM_SET_LOCAL(1, WASM_I8(5)),
WASM_SET_LOCAL(2, WASM_I8(6)),
@@ -1009,55 +808,67 @@
TEST(Run_Wasm_BrIf_strict) {
WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r, WASM_BLOCK(
- 2, WASM_BLOCK(1, WASM_BRV_IF(0, WASM_GET_LOCAL(0),
- WASM_SET_LOCAL(0, WASM_I8(99)))),
- WASM_GET_LOCAL(0)));
+ BUILD(
+ r,
+ B2(B1(WASM_BRV_IF(0, WASM_GET_LOCAL(0), WASM_SET_LOCAL(0, WASM_I8(99)))),
+ WASM_GET_LOCAL(0)));
FOR_INT32_INPUTS(i) { CHECK_EQ(99, r.Call(*i)); }
}
-TEST(Run_Wasm_TableSwitch0a) {
+TEST(Run_Wasm_BrTable0a) {
WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r, WASM_BLOCK(2, WASM_TABLESWITCH_OP(0, 1, WASM_CASE_BR(0)),
- WASM_TABLESWITCH_BODY0(WASM_GET_LOCAL(0)), WASM_I8(91)));
+ BUILD(r,
+ B2(B1(WASM_BR_TABLE(WASM_GET_LOCAL(0), 0, BR_TARGET(0))), WASM_I8(91)));
FOR_INT32_INPUTS(i) { CHECK_EQ(91, r.Call(*i)); }
}
-TEST(Run_Wasm_TableSwitch0b) {
+TEST(Run_Wasm_BrTable0b) {
WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r, WASM_BLOCK(
- 2, WASM_TABLESWITCH_OP(0, 2, WASM_CASE_BR(0), WASM_CASE_BR(0)),
- WASM_TABLESWITCH_BODY0(WASM_GET_LOCAL(0)), WASM_I8(92)));
+ BUILD(r,
+ B2(B1(WASM_BR_TABLE(WASM_GET_LOCAL(0), 1, BR_TARGET(0), BR_TARGET(0))),
+ WASM_I8(92)));
FOR_INT32_INPUTS(i) { CHECK_EQ(92, r.Call(*i)); }
}
-TEST(Run_Wasm_TableSwitch0c) {
+TEST(Run_Wasm_BrTable0c) {
WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r,
- WASM_BLOCK(2, WASM_BLOCK(2, WASM_TABLESWITCH_OP(0, 2, WASM_CASE_BR(0),
- WASM_CASE_BR(1)),
- WASM_TABLESWITCH_BODY0(WASM_GET_LOCAL(0)),
- WASM_RETURN(WASM_I8(76))),
- WASM_I8(77)));
+ BUILD(
+ r,
+ B2(B2(B1(WASM_BR_TABLE(WASM_GET_LOCAL(0), 1, BR_TARGET(0), BR_TARGET(1))),
+ RET_I8(76)),
+ WASM_I8(77)));
FOR_INT32_INPUTS(i) {
int32_t expected = *i == 0 ? 76 : 77;
CHECK_EQ(expected, r.Call(*i));
}
}
-TEST(Run_Wasm_TableSwitch1) {
+TEST(Run_Wasm_BrTable1) {
WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r, WASM_TABLESWITCH_OP(1, 1, WASM_CASE(0)),
- WASM_TABLESWITCH_BODY(WASM_GET_LOCAL(0), WASM_RETURN(WASM_I8(93))));
+ BUILD(r, B1(WASM_BR_TABLE(WASM_GET_LOCAL(0), 0, BR_TARGET(0))), RET_I8(93));
FOR_INT32_INPUTS(i) { CHECK_EQ(93, r.Call(*i)); }
}
-
-TEST(Run_Wasm_TableSwitch_br) {
+TEST(Run_Wasm_BrTable_loop) {
WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r, WASM_TABLESWITCH_OP(1, 2, WASM_CASE_BR(0), WASM_CASE(0)),
- WASM_TABLESWITCH_BODY(WASM_GET_LOCAL(0), WASM_RETURN(WASM_I8(91))),
+ BUILD(r,
+ B2(WASM_LOOP(1, WASM_BR_TABLE(WASM_INC_LOCAL_BY(0, 1), 2, BR_TARGET(2),
+ BR_TARGET(1), BR_TARGET(0))),
+ RET_I8(99)),
+ WASM_I8(98));
+ CHECK_EQ(99, r.Call(0));
+ CHECK_EQ(98, r.Call(-1));
+ CHECK_EQ(98, r.Call(-2));
+ CHECK_EQ(98, r.Call(-3));
+ CHECK_EQ(98, r.Call(-100));
+}
+
+TEST(Run_Wasm_BrTable_br) {
+ WasmRunner<int32_t> r(MachineType::Int32());
+ BUILD(r,
+ B2(B1(WASM_BR_TABLE(WASM_GET_LOCAL(0), 1, BR_TARGET(1), BR_TARGET(0))),
+ RET_I8(91)),
WASM_I8(99));
CHECK_EQ(99, r.Call(0));
CHECK_EQ(91, r.Call(1));
@@ -1065,17 +876,14 @@
CHECK_EQ(91, r.Call(3));
}
-
-TEST(Run_Wasm_TableSwitch_br2) {
+TEST(Run_Wasm_BrTable_br2) {
WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r, WASM_BLOCK(
- 2, WASM_BLOCK(2, WASM_TABLESWITCH_OP(
- 1, 4, WASM_CASE_BR(0), WASM_CASE_BR(1),
- WASM_CASE_BR(2), WASM_CASE(0)),
- WASM_TABLESWITCH_BODY(WASM_GET_LOCAL(0),
- WASM_RETURN(WASM_I8(85))),
- WASM_RETURN(WASM_I8(86))),
- WASM_RETURN(WASM_I8(87))),
+
+ BUILD(r, B2(B2(B2(B1(WASM_BR_TABLE(WASM_GET_LOCAL(0), 3, BR_TARGET(1),
+ BR_TARGET(2), BR_TARGET(3), BR_TARGET(0))),
+ RET_I8(85)),
+ RET_I8(86)),
+ RET_I8(87)),
WASM_I8(88));
CHECK_EQ(86, r.Call(0));
CHECK_EQ(87, r.Call(1));
@@ -1085,95 +893,74 @@
CHECK_EQ(85, r.Call(5));
}
-
-TEST(Run_Wasm_TableSwitch2) {
- WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r, WASM_TABLESWITCH_OP(2, 2, WASM_CASE(0), WASM_CASE(1)),
- WASM_TABLESWITCH_BODY(WASM_GET_LOCAL(0), WASM_RETURN(WASM_I8(91)),
- WASM_RETURN(WASM_I8(92))));
- FOR_INT32_INPUTS(i) {
- int32_t expected = *i == 0 ? 91 : 92;
- CHECK_EQ(expected, r.Call(*i));
- }
-}
-
-
-TEST(Run_Wasm_TableSwitch2b) {
- WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r, WASM_TABLESWITCH_OP(2, 2, WASM_CASE(1), WASM_CASE(0)),
- WASM_TABLESWITCH_BODY(WASM_GET_LOCAL(0), WASM_RETURN(WASM_I8(81)),
- WASM_RETURN(WASM_I8(82))));
- FOR_INT32_INPUTS(i) {
- int32_t expected = *i == 0 ? 82 : 81;
- CHECK_EQ(expected, r.Call(*i));
- }
-}
-
-
-TEST(Run_Wasm_TableSwitch4) {
+TEST(Run_Wasm_BrTable4) {
for (int i = 0; i < 4; i++) {
- const uint16_t br = 0x8000u;
- uint16_t c = 0;
- uint16_t cases[] = {i == 0 ? br : c++, i == 1 ? br : c++, i == 2 ? br : c++,
- i == 3 ? br : c++};
- byte code[] = {
- WASM_BLOCK(1, WASM_TABLESWITCH_OP(
- 3, 4, WASM_CASE(cases[0]), WASM_CASE(cases[1]),
- WASM_CASE(cases[2]), WASM_CASE(cases[3])),
- WASM_TABLESWITCH_BODY(
- WASM_GET_LOCAL(0), WASM_RETURN(WASM_I8(71)),
- WASM_RETURN(WASM_I8(72)), WASM_RETURN(WASM_I8(73)))),
- WASM_RETURN(WASM_I8(74))};
+ for (int t = 0; t < 4; t++) {
+ uint32_t cases[] = {0, 1, 2, 3};
+ cases[i] = t;
+ byte code[] = {B2(B2(B2(B2(B1(WASM_BR_TABLE(
+ WASM_GET_LOCAL(0), 3, BR_TARGET(cases[0]),
+ BR_TARGET(cases[1]), BR_TARGET(cases[2]),
+ BR_TARGET(cases[3]))),
+ RET_I8(70)),
+ RET_I8(71)),
+ RET_I8(72)),
+ RET_I8(73)),
+ WASM_I8(75)};
- WasmRunner<int32_t> r(MachineType::Int32());
- r.Build(code, code + arraysize(code));
+ WasmRunner<int32_t> r(MachineType::Int32());
+ r.Build(code, code + arraysize(code));
- FOR_INT32_INPUTS(i) {
- int index = (*i < 0 || *i > 3) ? 3 : *i;
- int32_t expected = 71 + cases[index];
- if (expected >= 0x8000) expected = 74;
- CHECK_EQ(expected, r.Call(*i));
+ for (int x = -3; x < 50; x++) {
+ int index = (x > 3 || x < 0) ? 3 : x;
+ int32_t expected = 70 + cases[index];
+ CHECK_EQ(expected, r.Call(x));
+ }
}
}
}
+TEST(Run_Wasm_BrTable4x4) {
+ for (byte a = 0; a < 4; a++) {
+ for (byte b = 0; b < 4; b++) {
+ for (byte c = 0; c < 4; c++) {
+ for (byte d = 0; d < 4; d++) {
+ for (int i = 0; i < 4; i++) {
+ uint32_t cases[] = {a, b, c, d};
+ byte code[] = {
+ B2(B2(B2(B2(B1(WASM_BR_TABLE(
+ WASM_GET_LOCAL(0), 3, BR_TARGET(cases[0]),
+ BR_TARGET(cases[1]), BR_TARGET(cases[2]),
+ BR_TARGET(cases[3]))),
+ RET_I8(50)),
+ RET_I8(51)),
+ RET_I8(52)),
+ RET_I8(53)),
+ WASM_I8(55)};
-TEST(Run_Wasm_TableSwitch4b) {
- for (int a = 0; a < 2; a++) {
- for (int b = 0; b < 2; b++) {
- for (int c = 0; c < 2; c++) {
- for (int d = 0; d < 2; d++) {
- if (a + b + c + d == 0) continue;
- if (a + b + c + d == 4) continue;
+ WasmRunner<int32_t> r(MachineType::Int32());
+ r.Build(code, code + arraysize(code));
- byte code[] = {
- WASM_TABLESWITCH_OP(2, 4, WASM_CASE(a), WASM_CASE(b),
- WASM_CASE(c), WASM_CASE(d)),
- WASM_TABLESWITCH_BODY(WASM_GET_LOCAL(0), WASM_RETURN(WASM_I8(61)),
- WASM_RETURN(WASM_I8(62)))};
-
- WasmRunner<int32_t> r(MachineType::Int32());
- r.Build(code, code + arraysize(code));
-
- CHECK_EQ(61 + a, r.Call(0));
- CHECK_EQ(61 + b, r.Call(1));
- CHECK_EQ(61 + c, r.Call(2));
- CHECK_EQ(61 + d, r.Call(3));
- CHECK_EQ(61 + d, r.Call(4));
+ for (int x = -6; x < 47; x++) {
+ int index = (x > 3 || x < 0) ? 3 : x;
+ int32_t expected = 50 + cases[index];
+ CHECK_EQ(expected, r.Call(x));
+ }
+ }
}
}
}
}
}
-
-TEST(Run_Wasm_TableSwitch4_fallthru) {
+TEST(Run_Wasm_BrTable4_fallthru) {
byte code[] = {
- WASM_TABLESWITCH_OP(4, 4, WASM_CASE(0), WASM_CASE(1), WASM_CASE(2),
- WASM_CASE(3)),
- WASM_TABLESWITCH_BODY(WASM_GET_LOCAL(0), WASM_INC_LOCAL_BY(1, 1),
- WASM_INC_LOCAL_BY(1, 2), WASM_INC_LOCAL_BY(1, 4),
- WASM_INC_LOCAL_BY(1, 8)),
+ B2(B2(B2(B2(B1(WASM_BR_TABLE(WASM_GET_LOCAL(0), 3, BR_TARGET(0),
+ BR_TARGET(1), BR_TARGET(2), BR_TARGET(3))),
+ WASM_INC_LOCAL_BY(1, 1)),
+ WASM_INC_LOCAL_BY(1, 2)),
+ WASM_INC_LOCAL_BY(1, 4)),
+ WASM_INC_LOCAL_BY(1, 8)),
WASM_GET_LOCAL(1)};
WasmRunner<int32_t> r(MachineType::Int32(), MachineType::Int32());
@@ -1192,34 +979,6 @@
CHECK_EQ(108, r.Call(4, 100));
}
-
-TEST(Run_Wasm_TableSwitch4_fallthru_br) {
- byte code[] = {
- WASM_TABLESWITCH_OP(4, 4, WASM_CASE(0), WASM_CASE(1), WASM_CASE(2),
- WASM_CASE(3)),
- WASM_TABLESWITCH_BODY(WASM_GET_LOCAL(0), WASM_INC_LOCAL_BY(1, 1),
- WASM_BRV(0, WASM_INC_LOCAL_BY(1, 2)),
- WASM_INC_LOCAL_BY(1, 4),
- WASM_BRV(0, WASM_INC_LOCAL_BY(1, 8))),
- WASM_GET_LOCAL(1)};
-
- WasmRunner<int32_t> r(MachineType::Int32(), MachineType::Int32());
- r.Build(code, code + arraysize(code));
-
- CHECK_EQ(3, r.Call(0, 0));
- CHECK_EQ(2, r.Call(1, 0));
- CHECK_EQ(12, r.Call(2, 0));
- CHECK_EQ(8, r.Call(3, 0));
- CHECK_EQ(8, r.Call(4, 0));
-
- CHECK_EQ(203, r.Call(0, 200));
- CHECK_EQ(202, r.Call(1, 200));
- CHECK_EQ(212, r.Call(2, 200));
- CHECK_EQ(208, r.Call(3, 200));
- CHECK_EQ(208, r.Call(4, 200));
-}
-
-
TEST(Run_Wasm_F32ReinterpretI32) {
TestingModule module;
int32_t* memory = module.AddMemoryElems<int32_t>(8);
@@ -1282,9 +1041,8 @@
const int32_t kExpected = -414444;
// Build the calling function.
- WasmRunner<int32_t> r;
- r.env()->module = &module;
- BUILD(r, WASM_BLOCK(2, WASM_CALL_FUNCTION0(index), WASM_I32(kExpected)));
+ WasmRunner<int32_t> r(&module);
+ BUILD(r, B2(WASM_CALL_FUNCTION0(index), WASM_I32V_3(kExpected)));
int32_t result = r.Call();
CHECK_EQ(kExpected, result);
@@ -1302,9 +1060,8 @@
const int32_t kExpected = -414444;
// Build the calling function.
- WasmRunner<int32_t> r;
- r.env()->module = &module;
- BUILD(r, WASM_BLOCK(2, WASM_CALL_FUNCTION0(index), WASM_I32(kExpected)));
+ WasmRunner<int32_t> r(&module);
+ BUILD(r, B2(WASM_CALL_FUNCTION0(index), WASM_I32V_3(kExpected)));
int32_t result = r.Call();
CHECK_EQ(kExpected, result);
@@ -1314,10 +1071,10 @@
TEST(Run_Wasm_Block_If_P) {
WasmRunner<int32_t> r(MachineType::Int32());
// { if (p0) return 51; return 52; }
- BUILD(r, WASM_BLOCK(2, // --
- WASM_IF(WASM_GET_LOCAL(0), // --
- WASM_BRV(0, WASM_I8(51))), // --
- WASM_I8(52))); // --
+ BUILD(r, B2( // --
+ WASM_IF(WASM_GET_LOCAL(0), // --
+ WASM_BRV(0, WASM_I8(51))), // --
+ WASM_I8(52))); // --
FOR_INT32_INPUTS(i) {
int32_t expected = *i ? 51 : 52;
CHECK_EQ(expected, r.Call(*i));
@@ -1327,8 +1084,7 @@
TEST(Run_Wasm_Block_BrIf_P) {
WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r, WASM_BLOCK(2, WASM_BRV_IF(0, WASM_I8(51), WASM_GET_LOCAL(0)),
- WASM_I8(52)));
+ BUILD(r, B2(WASM_BRV_IF(0, WASM_I8(51), WASM_GET_LOCAL(0)), WASM_I8(52)));
FOR_INT32_INPUTS(i) {
int32_t expected = *i ? 51 : 52;
CHECK_EQ(expected, r.Call(*i));
@@ -1339,11 +1095,11 @@
TEST(Run_Wasm_Block_IfElse_P_assign) {
WasmRunner<int32_t> r(MachineType::Int32());
// { if (p0) p0 = 71; else p0 = 72; return p0; }
- BUILD(r, WASM_BLOCK(2, // --
- WASM_IF_ELSE(WASM_GET_LOCAL(0), // --
- WASM_SET_LOCAL(0, WASM_I8(71)), // --
- WASM_SET_LOCAL(0, WASM_I8(72))), // --
- WASM_GET_LOCAL(0)));
+ BUILD(r, B2( // --
+ WASM_IF_ELSE(WASM_GET_LOCAL(0), // --
+ WASM_SET_LOCAL(0, WASM_I8(71)), // --
+ WASM_SET_LOCAL(0, WASM_I8(72))), // --
+ WASM_GET_LOCAL(0)));
FOR_INT32_INPUTS(i) {
int32_t expected = *i ? 71 : 72;
CHECK_EQ(expected, r.Call(*i));
@@ -1354,10 +1110,10 @@
TEST(Run_Wasm_Block_IfElse_P_return) {
WasmRunner<int32_t> r(MachineType::Int32());
// if (p0) return 81; else return 82;
- BUILD(r, // --
- WASM_IF_ELSE(WASM_GET_LOCAL(0), // --
- WASM_RETURN(WASM_I8(81)), // --
- WASM_RETURN(WASM_I8(82)))); // --
+ BUILD(r, // --
+ WASM_IF_ELSE(WASM_GET_LOCAL(0), // --
+ RET_I8(81), // --
+ RET_I8(82))); // --
FOR_INT32_INPUTS(i) {
int32_t expected = *i ? 81 : 82;
CHECK_EQ(expected, r.Call(*i));
@@ -1381,8 +1137,7 @@
TEST(Run_Wasm_DanglingAssign) {
WasmRunner<int32_t> r(MachineType::Int32());
// { return 0; p0 = 0; }
- BUILD(r,
- WASM_BLOCK(2, WASM_RETURN(WASM_I8(99)), WASM_SET_LOCAL(0, WASM_ZERO)));
+ BUILD(r, B2(RET_I8(99), WASM_SET_LOCAL(0, WASM_ZERO)));
CHECK_EQ(99, r.Call(1));
}
@@ -1459,9 +1214,9 @@
TEST(Run_Wasm_Loop_if_break1) {
WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r, WASM_BLOCK(2, WASM_LOOP(2, WASM_IF(WASM_GET_LOCAL(0), WASM_BREAK(0)),
- WASM_SET_LOCAL(0, WASM_I8(99))),
- WASM_GET_LOCAL(0)));
+ BUILD(r, B2(WASM_LOOP(2, WASM_IF(WASM_GET_LOCAL(0), WASM_BREAK(0)),
+ WASM_SET_LOCAL(0, WASM_I8(99))),
+ WASM_GET_LOCAL(0)));
CHECK_EQ(99, r.Call(0));
CHECK_EQ(3, r.Call(3));
CHECK_EQ(10000, r.Call(10000));
@@ -1471,9 +1226,9 @@
TEST(Run_Wasm_Loop_if_break2) {
WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r, WASM_BLOCK(2, WASM_LOOP(2, WASM_BR_IF(1, WASM_GET_LOCAL(0)),
- WASM_SET_LOCAL(0, WASM_I8(99))),
- WASM_GET_LOCAL(0)));
+ BUILD(r, B2(WASM_LOOP(2, WASM_BR_IF(1, WASM_GET_LOCAL(0)),
+ WASM_SET_LOCAL(0, WASM_I8(99))),
+ WASM_GET_LOCAL(0)));
CHECK_EQ(99, r.Call(0));
CHECK_EQ(3, r.Call(3));
CHECK_EQ(10000, r.Call(10000));
@@ -1483,8 +1238,8 @@
TEST(Run_Wasm_Loop_if_break_fallthru) {
WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r, WASM_BLOCK(1, WASM_LOOP(2, WASM_IF(WASM_GET_LOCAL(0), WASM_BREAK(1)),
- WASM_SET_LOCAL(0, WASM_I8(93)))),
+ BUILD(r, B1(WASM_LOOP(2, WASM_IF(WASM_GET_LOCAL(0), WASM_BREAK(1)),
+ WASM_SET_LOCAL(0, WASM_I8(93)))),
WASM_GET_LOCAL(0));
CHECK_EQ(93, r.Call(0));
CHECK_EQ(3, r.Call(3));
@@ -1534,7 +1289,7 @@
TEST(Run_Wasm_LoadMemI32_oob_asm) {
TestingModule module;
- module.asm_js = true;
+ module.origin = kAsmJsOrigin;
int32_t* memory = module.AddMemoryElems<int32_t>(8);
WasmRunner<int32_t> r(&module, MachineType::Uint32());
module.RandomizeMemory(1112);
@@ -1665,7 +1420,7 @@
const int32_t kWritten = 0xaabbccdd;
BUILD(r, WASM_STORE_MEM_OFFSET(MachineType::Int32(), 4, WASM_GET_LOCAL(0),
- WASM_I32(kWritten)));
+ WASM_I32V_5(kWritten)));
for (int i = 0; i < 2; i++) {
module.RandomizeMemory(1111);
@@ -1719,61 +1474,6 @@
}
-#if WASM_64
-TEST(Run_Wasm_F64ReinterpretI64) {
- TestingModule module;
- int64_t* memory = module.AddMemoryElems<int64_t>(8);
- WasmRunner<int64_t> r(&module);
-
- BUILD(r, WASM_I64_REINTERPRET_F64(
- WASM_LOAD_MEM(MachineType::Float64(), WASM_ZERO)));
-
- FOR_INT32_INPUTS(i) {
- int64_t expected = static_cast<int64_t>(*i) * 0x300010001;
- memory[0] = expected;
- CHECK_EQ(expected, r.Call());
- }
-}
-
-
-TEST(Run_Wasm_I64ReinterpretF64) {
- TestingModule module;
- int64_t* memory = module.AddMemoryElems<int64_t>(8);
- WasmRunner<int64_t> r(&module, MachineType::Int64());
-
- BUILD(r, WASM_BLOCK(
- 2, WASM_STORE_MEM(MachineType::Float64(), WASM_ZERO,
- WASM_F64_REINTERPRET_I64(WASM_GET_LOCAL(0))),
- WASM_GET_LOCAL(0)));
-
- FOR_INT32_INPUTS(i) {
- int64_t expected = static_cast<int64_t>(*i) * 0x300010001;
- CHECK_EQ(expected, r.Call(expected));
- CHECK_EQ(expected, memory[0]);
- }
-}
-
-
-TEST(Run_Wasm_LoadMemI64) {
- TestingModule module;
- int64_t* memory = module.AddMemoryElems<int64_t>(8);
- module.RandomizeMemory(1111);
- WasmRunner<int64_t> r(&module);
-
- BUILD(r, WASM_LOAD_MEM(MachineType::Int64(), WASM_I8(0)));
-
- memory[0] = 0xaabbccdd00112233LL;
- CHECK_EQ(0xaabbccdd00112233LL, r.Call());
-
- memory[0] = 0x33aabbccdd001122LL;
- CHECK_EQ(0x33aabbccdd001122LL, r.Call());
-
- memory[0] = 77777777;
- CHECK_EQ(77777777, r.Call());
-}
-#endif
-
-
TEST(Run_Wasm_LoadMemI32_P) {
const int kNumElems = 8;
TestingModule module;
@@ -1829,9 +1529,9 @@
WasmRunner<uint32_t> r(&module, MachineType::Int32());
BUILD(r, kExprBlock, 2, kExprLoop, 1, kExprIf, kExprGetLocal, 0, kExprBr, 0,
- kExprIfElse, kExprI32LoadMem, 0, kExprGetLocal, 0, kExprBr, 2,
- kExprI8Const, 255, kExprSetLocal, 0, kExprI32Sub, kExprGetLocal, 0,
- kExprI8Const, 4, kExprI8Const, 0);
+ kExprIfElse, kExprI32LoadMem, ZERO_ALIGNMENT, ZERO_OFFSET,
+ kExprGetLocal, 0, kExprBr, 2, kExprI8Const, 255, kExprSetLocal, 0,
+ kExprI32Sub, kExprGetLocal, 0, kExprI8Const, 4, kExprI8Const, 0);
module.BlankMemory();
CHECK_EQ(0, r.Call((kNumElems - 1) * 4));
@@ -1872,41 +1572,6 @@
}
-#if WASM_64
-TEST(Run_Wasm_MemI64_Sum) {
- const int kNumElems = 20;
- TestingModule module;
- uint64_t* memory = module.AddMemoryElems<uint64_t>(kNumElems);
- WasmRunner<uint64_t> r(&module, MachineType::Int32());
- const byte kSum = r.AllocateLocal(kAstI64);
-
- BUILD(r, WASM_BLOCK(
- 2, WASM_WHILE(
- WASM_GET_LOCAL(0),
- WASM_BLOCK(
- 2, WASM_SET_LOCAL(
- kSum, WASM_I64_ADD(
- WASM_GET_LOCAL(kSum),
- WASM_LOAD_MEM(MachineType::Int64(),
- WASM_GET_LOCAL(0)))),
- WASM_SET_LOCAL(
- 0, WASM_I32_SUB(WASM_GET_LOCAL(0), WASM_I8(8))))),
- WASM_GET_LOCAL(1)));
-
- // Run 4 trials.
- for (int i = 0; i < 3; i++) {
- module.RandomizeMemory(i * 33);
- uint64_t expected = 0;
- for (size_t j = kNumElems - 1; j > 0; j--) {
- expected += memory[j];
- }
- uint64_t result = r.Call(8 * (kNumElems - 1));
- CHECK_EQ(expected, result);
- }
-}
-#endif
-
-
template <typename T>
T GenerateAndRunFold(WasmOpcode binop, T* buffer, size_t size,
LocalType astType, MachineType memType) {
@@ -1966,8 +1631,7 @@
TEST(Run_Wasm_Unreachable0a) {
WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r,
- WASM_BLOCK(2, WASM_BRV(0, WASM_I8(9)), WASM_RETURN(WASM_GET_LOCAL(0))));
+ BUILD(r, B2(WASM_BRV(0, WASM_I8(9)), RET(WASM_GET_LOCAL(0))));
CHECK_EQ(9, r.Call(0));
CHECK_EQ(9, r.Call(1));
}
@@ -1975,7 +1639,7 @@
TEST(Run_Wasm_Unreachable0b) {
WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r, WASM_BLOCK(2, WASM_BRV(0, WASM_I8(7)), WASM_UNREACHABLE));
+ BUILD(r, B2(WASM_BRV(0, WASM_I8(7)), WASM_UNREACHABLE));
CHECK_EQ(7, r.Call(0));
CHECK_EQ(7, r.Call(1));
}
@@ -2014,8 +1678,8 @@
TEST(Run_Wasm_Unreachable_Load) {
WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r, WASM_BLOCK(2, WASM_BRV(0, WASM_GET_LOCAL(0)),
- WASM_LOAD_MEM(MachineType::Int8(), WASM_GET_LOCAL(0))));
+ BUILD(r, B2(WASM_BRV(0, WASM_GET_LOCAL(0)),
+ WASM_LOAD_MEM(MachineType::Int8(), WASM_GET_LOCAL(0))));
CHECK_EQ(11, r.Call(11));
CHECK_EQ(21, r.Call(21));
}
@@ -2023,8 +1687,7 @@
TEST(Run_Wasm_Infinite_Loop_not_taken1) {
WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r, WASM_BLOCK(2, WASM_IF(WASM_GET_LOCAL(0), WASM_INFINITE_LOOP),
- WASM_I8(45)));
+ BUILD(r, B2(WASM_IF(WASM_GET_LOCAL(0), WASM_INFINITE_LOOP), WASM_I8(45)));
// Run the code, but don't go into the infinite loop.
CHECK_EQ(45, r.Call(0));
}
@@ -2032,9 +1695,8 @@
TEST(Run_Wasm_Infinite_Loop_not_taken2) {
WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r,
- WASM_BLOCK(1, WASM_IF_ELSE(WASM_GET_LOCAL(0), WASM_BRV(0, WASM_I8(45)),
- WASM_INFINITE_LOOP)));
+ BUILD(r, B1(WASM_IF_ELSE(WASM_GET_LOCAL(0), WASM_BRV(0, WASM_I8(45)),
+ WASM_INFINITE_LOOP)));
// Run the code, but don't go into the infinite loop.
CHECK_EQ(45, r.Call(1));
}
@@ -2042,8 +1704,8 @@
TEST(Run_Wasm_Infinite_Loop_not_taken2_brif) {
WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r, WASM_BLOCK(2, WASM_BRV_IF(0, WASM_I8(45), WASM_GET_LOCAL(0)),
- WASM_INFINITE_LOOP));
+ BUILD(r,
+ B2(WASM_BRV_IF(0, WASM_I8(45), WASM_GET_LOCAL(0)), WASM_INFINITE_LOOP));
// Run the code, but don't go into the infinite loop.
CHECK_EQ(45, r.Call(1));
}
@@ -2052,8 +1714,8 @@
static void TestBuildGraphForSimpleExpression(WasmOpcode opcode) {
if (!WasmOpcodes::IsSupported(opcode)) return;
- Zone zone;
Isolate* isolate = CcTest::InitIsolateOnce();
+ Zone zone(isolate->allocator());
HandleScope scope(isolate);
// Enable all optional operators.
CommonOperatorBuilder common(&zone);
@@ -2061,18 +1723,19 @@
MachineOperatorBuilder::kAllOptionalOps);
Graph graph(&zone);
JSGraph jsgraph(isolate, &graph, &common, nullptr, nullptr, &machine);
- FunctionEnv env;
FunctionSig* sig = WasmOpcodes::Signature(opcode);
- init_env(&env, sig);
if (sig->parameter_count() == 1) {
- byte code[] = {static_cast<byte>(opcode), kExprGetLocal, 0};
- TestBuildingGraph(&zone, &jsgraph, &env, code, code + arraysize(code));
+ byte code[] = {WASM_NO_LOCALS, static_cast<byte>(opcode), kExprGetLocal, 0};
+ TestBuildingGraph(&zone, &jsgraph, nullptr, sig, code,
+ code + arraysize(code));
} else {
CHECK_EQ(2, sig->parameter_count());
- byte code[] = {static_cast<byte>(opcode), kExprGetLocal, 0, kExprGetLocal,
- 1};
- TestBuildingGraph(&zone, &jsgraph, &env, code, code + arraysize(code));
+ byte code[] = {WASM_NO_LOCALS, static_cast<byte>(opcode),
+ kExprGetLocal, 0,
+ kExprGetLocal, 1};
+ TestBuildingGraph(&zone, &jsgraph, nullptr, sig, code,
+ code + arraysize(code));
}
}
@@ -2196,38 +1859,15 @@
}
-#if WASM_64
-TEST(Run_WasmInt64Global) {
- TestingModule module;
- int64_t* global = module.AddGlobal<int64_t>(MachineType::Int64());
- WasmRunner<int32_t> r(&module, MachineType::Int32());
- // global = global + p0
- BUILD(r, WASM_BLOCK(2, WASM_STORE_GLOBAL(
- 0, WASM_I64_ADD(
- WASM_LOAD_GLOBAL(0),
- WASM_I64_SCONVERT_I32(WASM_GET_LOCAL(0)))),
- WASM_ZERO));
-
- *global = 0xFFFFFFFFFFFFFFFFLL;
- for (int i = 9; i < 444444; i += 111111) {
- int64_t expected = *global + i;
- r.Call(i);
- CHECK_EQ(expected, *global);
- }
-}
-#endif
-
-
TEST(Run_WasmFloat32Global) {
TestingModule module;
float* global = module.AddGlobal<float>(MachineType::Float32());
WasmRunner<int32_t> r(&module, MachineType::Int32());
// global = global + p0
- BUILD(r, WASM_BLOCK(2, WASM_STORE_GLOBAL(
- 0, WASM_F32_ADD(
- WASM_LOAD_GLOBAL(0),
- WASM_F32_SCONVERT_I32(WASM_GET_LOCAL(0)))),
- WASM_ZERO));
+ BUILD(r, B2(WASM_STORE_GLOBAL(
+ 0, WASM_F32_ADD(WASM_LOAD_GLOBAL(0),
+ WASM_F32_SCONVERT_I32(WASM_GET_LOCAL(0)))),
+ WASM_ZERO));
*global = 1.25;
for (int i = 9; i < 4444; i += 1111) {
@@ -2243,11 +1883,10 @@
double* global = module.AddGlobal<double>(MachineType::Float64());
WasmRunner<int32_t> r(&module, MachineType::Int32());
// global = global + p0
- BUILD(r, WASM_BLOCK(2, WASM_STORE_GLOBAL(
- 0, WASM_F64_ADD(
- WASM_LOAD_GLOBAL(0),
- WASM_F64_SCONVERT_I32(WASM_GET_LOCAL(0)))),
- WASM_ZERO));
+ BUILD(r, B2(WASM_STORE_GLOBAL(
+ 0, WASM_F64_ADD(WASM_LOAD_GLOBAL(0),
+ WASM_F64_SCONVERT_I32(WASM_GET_LOCAL(0)))),
+ WASM_ZERO));
*global = 1.25;
for (int i = 9; i < 4444; i += 1111) {
@@ -2313,69 +1952,13 @@
}
-#if WASM_64
-// Test the WasmRunner with an Int64 return value and different numbers of
-// Int64 parameters.
-TEST(Run_TestI64WasmRunner) {
- {
- FOR_INT64_INPUTS(i) {
- WasmRunner<int64_t> r;
- BUILD(r, WASM_I64(*i));
- CHECK_EQ(*i, r.Call());
- }
- }
- {
- WasmRunner<int64_t> r(MachineType::Int64());
- BUILD(r, WASM_GET_LOCAL(0));
- FOR_INT64_INPUTS(i) { CHECK_EQ(*i, r.Call(*i)); }
- }
- {
- WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64());
- BUILD(r, WASM_I64_ADD(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
- FOR_INT64_INPUTS(i) {
- FOR_INT64_INPUTS(j) { CHECK_EQ(*i + *j, r.Call(*i, *j)); }
- }
- }
- {
- WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64(),
- MachineType::Int64());
- BUILD(r, WASM_I64_ADD(WASM_GET_LOCAL(0),
- WASM_I64_ADD(WASM_GET_LOCAL(1), WASM_GET_LOCAL(2))));
- FOR_INT64_INPUTS(i) {
- FOR_INT64_INPUTS(j) {
- CHECK_EQ(*i + *j + *j, r.Call(*i, *j, *j));
- CHECK_EQ(*j + *i + *j, r.Call(*j, *i, *j));
- CHECK_EQ(*j + *j + *i, r.Call(*j, *j, *i));
- }
- }
- }
- {
- WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64(),
- MachineType::Int64(), MachineType::Int64());
- BUILD(r, WASM_I64_ADD(WASM_GET_LOCAL(0),
- WASM_I64_ADD(WASM_GET_LOCAL(1),
- WASM_I64_ADD(WASM_GET_LOCAL(2),
- WASM_GET_LOCAL(3)))));
- FOR_INT64_INPUTS(i) {
- FOR_INT64_INPUTS(j) {
- CHECK_EQ(*i + *j + *j + *j, r.Call(*i, *j, *j, *j));
- CHECK_EQ(*j + *i + *j + *j, r.Call(*j, *i, *j, *j));
- CHECK_EQ(*j + *j + *i + *j, r.Call(*j, *j, *i, *j));
- CHECK_EQ(*j + *j + *j + *i, r.Call(*j, *j, *j, *i));
- }
- }
- }
-}
-#endif
-
-
TEST(Run_WasmCallEmpty) {
const int32_t kExpected = -414444;
// Build the target function.
TestSignatures sigs;
TestingModule module;
WasmFunctionCompiler t(sigs.i_v(), &module);
- BUILD(t, WASM_I32(kExpected));
+ BUILD(t, WASM_I32V_3(kExpected));
uint32_t index = t.CompileAndAdd();
// Build the calling function.
@@ -2436,51 +2019,6 @@
CHECK_EQ(256.5, result);
}
-TEST(Run_WasmCallI64Parameter) {
- // Build the target function.
- LocalType param_types[20];
- for (int i = 0; i < 20; i++) param_types[i] = kAstI64;
- param_types[3] = kAstI32;
- param_types[4] = kAstI32;
- FunctionSig sig(1, 19, param_types);
- for (int i = 0; i < 19; i++) {
- TestingModule module;
- WasmFunctionCompiler t(&sig, &module);
- if (i == 2 || i == 3) {
- continue;
- } else {
- BUILD(t, WASM_GET_LOCAL(i));
- }
- uint32_t index = t.CompileAndAdd();
-
- // Build the calling function.
- WasmRunner<int32_t> r;
- r.env()->module = &module;
- BUILD(r,
- WASM_I32_CONVERT_I64(WASM_CALL_FUNCTION(
- index, WASM_I64(0xbcd12340000000b), WASM_I64(0xbcd12340000000c),
- WASM_I32(0xd), WASM_I32_CONVERT_I64(WASM_I64(0xbcd12340000000e)),
- WASM_I64(0xbcd12340000000f), WASM_I64(0xbcd1234000000010),
- WASM_I64(0xbcd1234000000011), WASM_I64(0xbcd1234000000012),
- WASM_I64(0xbcd1234000000013), WASM_I64(0xbcd1234000000014),
- WASM_I64(0xbcd1234000000015), WASM_I64(0xbcd1234000000016),
- WASM_I64(0xbcd1234000000017), WASM_I64(0xbcd1234000000018),
- WASM_I64(0xbcd1234000000019), WASM_I64(0xbcd123400000001a),
- WASM_I64(0xbcd123400000001b), WASM_I64(0xbcd123400000001c),
- WASM_I64(0xbcd123400000001d))));
-
- CHECK_EQ(i + 0xb, r.Call());
- }
-}
-
-TEST(Run_WasmI64And) {
- WasmRunner<int64_t> r(MachineType::Int64(), MachineType::Int64());
- BUILD(r, WASM_I64_AND(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
- FOR_INT64_INPUTS(i) {
- FOR_INT64_INPUTS(j) { CHECK_EQ((*i) & (*j), r.Call(*i, *j)); }
- }
-}
-
TEST(Run_WasmCallVoid) {
const byte kMemOffset = 8;
const int32_t kElemNum = kMemOffset / sizeof(int32_t);
@@ -2492,7 +2030,7 @@
module.RandomizeMemory();
WasmFunctionCompiler t(sigs.v_v(), &module);
BUILD(t, WASM_STORE_MEM(MachineType::Int32(), WASM_I8(kMemOffset),
- WASM_I32(kExpected)));
+ WASM_I32V_3(kExpected)));
uint32_t index = t.CompileAndAdd();
// Build the calling function.
@@ -2527,36 +2065,6 @@
}
}
-
-#if WASM_64
-TEST(Run_WasmCall_Int64Sub) {
- // Build the target function.
- TestSignatures sigs;
- TestingModule module;
- WasmFunctionCompiler t(sigs.l_ll(), &module);
- BUILD(t, WASM_I64_SUB(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
- uint32_t index = t.CompileAndAdd();
-
- // Build the caller function.
- WasmRunner<int64_t> r(&module, MachineType::Int64(), MachineType::Int64());
- BUILD(r, WASM_CALL_FUNCTION(index, WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
-
- FOR_INT32_INPUTS(i) {
- FOR_INT32_INPUTS(j) {
- int64_t a = static_cast<int64_t>(*i) << 32 |
- (static_cast<int64_t>(*j) | 0xFFFFFFFF);
- int64_t b = static_cast<int64_t>(*j) << 32 |
- (static_cast<int64_t>(*i) | 0xFFFFFFFF);
-
- int64_t expected = static_cast<int64_t>(static_cast<uint64_t>(a) -
- static_cast<uint64_t>(b));
- CHECK_EQ(expected, r.Call(a, b));
- }
- }
-}
-#endif
-
-
TEST(Run_WasmCall_Float32Sub) {
TestSignatures sigs;
TestingModule module;
@@ -2571,10 +2079,7 @@
BUILD(r, WASM_CALL_FUNCTION(index, WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
FOR_FLOAT32_INPUTS(i) {
- FOR_FLOAT32_INPUTS(j) {
- volatile float expected = *i - *j;
- CheckFloatEq(expected, r.Call(*i, *j));
- }
+ FOR_FLOAT32_INPUTS(j) { CHECK_FLOAT_EQ(*i - *j, r.Call(*i, *j)); }
}
}
@@ -2584,7 +2089,6 @@
double* memory = module.AddMemoryElems<double>(16);
WasmRunner<int32_t> r(&module);
- // TODO(titzer): convert to a binop test.
BUILD(r, WASM_BLOCK(
2, WASM_STORE_MEM(
MachineType::Float64(), WASM_ZERO,
@@ -2637,7 +2141,8 @@
int num_params = static_cast<int>(arraysize(mixed)) - start;
for (int which = 0; which < num_params; which++) {
- Zone zone;
+ v8::base::AccountingAllocator allocator;
+ Zone zone(&allocator);
TestingModule module;
module.AddMemory(1024);
MachineType* memtypes = &mixed[start];
@@ -2664,7 +2169,7 @@
std::vector<byte> code;
ADD_CODE(code,
static_cast<byte>(WasmOpcodes::LoadStoreOpcodeOf(result, true)),
- WasmOpcodes::LoadStoreAccessOf(false));
+ ZERO_ALIGNMENT, ZERO_OFFSET);
ADD_CODE(code, WASM_ZERO);
ADD_CODE(code, kExprCallFunction, static_cast<byte>(index));
@@ -2673,7 +2178,7 @@
ADD_CODE(code, WASM_LOAD_MEM(memtypes[i], WASM_I8(offset)));
}
- ADD_CODE(code, WASM_I32(kExpected));
+ ADD_CODE(code, WASM_I32V_2(kExpected));
size_t end = code.size();
code.push_back(0);
r.Build(&code[0], &code[end]);
@@ -2709,13 +2214,12 @@
WasmRunner<int32_t> r(&module, MachineType::Int32());
byte local = r.AllocateLocal(kAstI32);
- BUILD(r,
- WASM_BLOCK(2, WASM_SET_LOCAL(local, WASM_I8(99)),
- WASM_I32_ADD(
- WASM_CALL_FUNCTION(t1.function_index_, WASM_GET_LOCAL(0),
- WASM_GET_LOCAL(0)),
- WASM_CALL_FUNCTION(t1.function_index_, WASM_GET_LOCAL(1),
- WASM_GET_LOCAL(local)))));
+ BUILD(r, B2(WASM_SET_LOCAL(local, WASM_I8(99)),
+ WASM_I32_ADD(
+ WASM_CALL_FUNCTION(t1.function_index_, WASM_GET_LOCAL(0),
+ WASM_GET_LOCAL(0)),
+ WASM_CALL_FUNCTION(t1.function_index_, WASM_GET_LOCAL(1),
+ WASM_GET_LOCAL(local)))));
CHECK_EQ(198, r.Call(0));
CHECK_EQ(200, r.Call(1));
@@ -2737,8 +2241,7 @@
TEST(Run_Wasm_ExprBlock2a) {
WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r, WASM_BLOCK(2, WASM_IF(WASM_GET_LOCAL(0), WASM_BRV(0, WASM_I8(1))),
- WASM_I8(1)));
+ BUILD(r, B2(WASM_IF(WASM_GET_LOCAL(0), WASM_BRV(0, WASM_I8(1))), WASM_I8(1)));
CHECK_EQ(1, r.Call(0));
CHECK_EQ(1, r.Call(1));
}
@@ -2746,8 +2249,7 @@
TEST(Run_Wasm_ExprBlock2b) {
WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r, WASM_BLOCK(2, WASM_IF(WASM_GET_LOCAL(0), WASM_BRV(0, WASM_I8(1))),
- WASM_I8(2)));
+ BUILD(r, B2(WASM_IF(WASM_GET_LOCAL(0), WASM_BRV(0, WASM_I8(1))), WASM_I8(2)));
CHECK_EQ(2, r.Call(0));
CHECK_EQ(1, r.Call(1));
}
@@ -2755,8 +2257,7 @@
TEST(Run_Wasm_ExprBlock2c) {
WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r, WASM_BLOCK(2, WASM_BRV_IF(0, WASM_I8(1), WASM_GET_LOCAL(0)),
- WASM_I8(1)));
+ BUILD(r, B2(WASM_BRV_IF(0, WASM_I8(1), WASM_GET_LOCAL(0)), WASM_I8(1)));
CHECK_EQ(1, r.Call(0));
CHECK_EQ(1, r.Call(1));
}
@@ -2764,8 +2265,7 @@
TEST(Run_Wasm_ExprBlock2d) {
WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r, WASM_BLOCK(2, WASM_BRV_IF(0, WASM_I8(1), WASM_GET_LOCAL(0)),
- WASM_I8(2)));
+ BUILD(r, B2(WASM_BRV_IF(0, WASM_I8(1), WASM_GET_LOCAL(0)), WASM_I8(2)));
CHECK_EQ(2, r.Call(0));
CHECK_EQ(1, r.Call(1));
}
@@ -2837,9 +2337,8 @@
TEST(Run_Wasm_ExprBlock_if) {
WasmRunner<int32_t> r(MachineType::Int32());
- BUILD(r,
- WASM_BLOCK(1, WASM_IF_ELSE(WASM_GET_LOCAL(0), WASM_BRV(0, WASM_I8(11)),
- WASM_BRV(0, WASM_I8(14)))));
+ BUILD(r, B1(WASM_IF_ELSE(WASM_GET_LOCAL(0), WASM_BRV(0, WASM_I8(11)),
+ WASM_BRV(0, WASM_I8(14)))));
CHECK_EQ(11, r.Call(1));
CHECK_EQ(14, r.Call(0));
@@ -2884,42 +2383,6 @@
}
-#if WASM_64
-TEST(Run_Wasm_LoadStoreI64_sx) {
- byte loads[] = {kExprI64LoadMem8S, kExprI64LoadMem16S, kExprI64LoadMem32S,
- kExprI64LoadMem};
-
- for (size_t m = 0; m < arraysize(loads); m++) {
- TestingModule module;
- byte* memory = module.AddMemoryElems<byte>(16);
- WasmRunner<int64_t> r(&module);
-
- byte code[] = {kExprI64StoreMem, 0, kExprI8Const, 8,
- loads[m], 0, kExprI8Const, 0};
-
- r.Build(code, code + arraysize(code));
-
- // Try a bunch of different negative values.
- for (int i = -1; i >= -128; i -= 11) {
- int size = 1 << m;
- module.BlankMemory();
- memory[size - 1] = static_cast<byte>(i); // set the high order byte.
-
- int64_t expected = static_cast<int64_t>(i) << ((size - 1) * 8);
-
- CHECK_EQ(expected, r.Call());
- CHECK_EQ(static_cast<byte>(i), memory[8 + size - 1]);
- for (int j = size; j < 8; j++) {
- CHECK_EQ(255, memory[8 + j]);
- }
- }
- }
-}
-
-
-#endif
-
-
TEST(Run_Wasm_SimpleCallIndirect) {
TestSignatures sigs;
TestingModule module;
@@ -3020,56 +2483,56 @@
WasmRunner<float> r(MachineType::Float32());
BUILD(r, WASM_F32_FLOOR(WASM_GET_LOCAL(0)));
- FOR_FLOAT32_INPUTS(i) { CheckFloatEq(floorf(*i), r.Call(*i)); }
+ FOR_FLOAT32_INPUTS(i) { CHECK_FLOAT_EQ(floorf(*i), r.Call(*i)); }
}
TEST(Run_Wasm_F32Ceil) {
WasmRunner<float> r(MachineType::Float32());
BUILD(r, WASM_F32_CEIL(WASM_GET_LOCAL(0)));
- FOR_FLOAT32_INPUTS(i) { CheckFloatEq(ceilf(*i), r.Call(*i)); }
+ FOR_FLOAT32_INPUTS(i) { CHECK_FLOAT_EQ(ceilf(*i), r.Call(*i)); }
}
TEST(Run_Wasm_F32Trunc) {
WasmRunner<float> r(MachineType::Float32());
BUILD(r, WASM_F32_TRUNC(WASM_GET_LOCAL(0)));
- FOR_FLOAT32_INPUTS(i) { CheckFloatEq(truncf(*i), r.Call(*i)); }
+ FOR_FLOAT32_INPUTS(i) { CHECK_FLOAT_EQ(truncf(*i), r.Call(*i)); }
}
TEST(Run_Wasm_F32NearestInt) {
WasmRunner<float> r(MachineType::Float32());
BUILD(r, WASM_F32_NEARESTINT(WASM_GET_LOCAL(0)));
- FOR_FLOAT32_INPUTS(i) { CheckFloatEq(nearbyintf(*i), r.Call(*i)); }
+ FOR_FLOAT32_INPUTS(i) { CHECK_FLOAT_EQ(nearbyintf(*i), r.Call(*i)); }
}
TEST(Run_Wasm_F64Floor) {
WasmRunner<double> r(MachineType::Float64());
BUILD(r, WASM_F64_FLOOR(WASM_GET_LOCAL(0)));
- FOR_FLOAT64_INPUTS(i) { CheckDoubleEq(floor(*i), r.Call(*i)); }
+ FOR_FLOAT64_INPUTS(i) { CHECK_DOUBLE_EQ(floor(*i), r.Call(*i)); }
}
TEST(Run_Wasm_F64Ceil) {
WasmRunner<double> r(MachineType::Float64());
BUILD(r, WASM_F64_CEIL(WASM_GET_LOCAL(0)));
- FOR_FLOAT64_INPUTS(i) { CheckDoubleEq(ceil(*i), r.Call(*i)); }
+ FOR_FLOAT64_INPUTS(i) { CHECK_DOUBLE_EQ(ceil(*i), r.Call(*i)); }
}
TEST(Run_Wasm_F64Trunc) {
WasmRunner<double> r(MachineType::Float64());
BUILD(r, WASM_F64_TRUNC(WASM_GET_LOCAL(0)));
- FOR_FLOAT64_INPUTS(i) { CheckDoubleEq(trunc(*i), r.Call(*i)); }
+ FOR_FLOAT64_INPUTS(i) { CHECK_DOUBLE_EQ(trunc(*i), r.Call(*i)); }
}
TEST(Run_Wasm_F64NearestInt) {
WasmRunner<double> r(MachineType::Float64());
BUILD(r, WASM_F64_NEARESTINT(WASM_GET_LOCAL(0)));
- FOR_FLOAT64_INPUTS(i) { CheckDoubleEq(nearbyint(*i), r.Call(*i)); }
+ FOR_FLOAT64_INPUTS(i) { CHECK_DOUBLE_EQ(nearbyint(*i), r.Call(*i)); }
}
TEST(Run_Wasm_F32Min) {
@@ -3090,7 +2553,7 @@
expected = *j;
}
- CheckFloatEq(expected, r.Call(*i, *j));
+ CHECK_FLOAT_EQ(expected, r.Call(*i, *j));
}
}
}
@@ -3114,7 +2577,7 @@
expected = *j;
}
- CheckDoubleEq(expected, r.Call(*i, *j));
+ CHECK_DOUBLE_EQ(expected, r.Call(*i, *j));
}
}
}
@@ -3138,7 +2601,7 @@
expected = *j;
}
- CheckFloatEq(expected, r.Call(*i, *j));
+ CHECK_FLOAT_EQ(expected, r.Call(*i, *j));
}
}
}
@@ -3162,13 +2625,14 @@
expected = *j;
}
- CheckDoubleEq(expected, r.Call(*i, *j));
+ CHECK_DOUBLE_EQ(expected, r.Call(*i, *j));
}
}
}
-// TODO(ahaas): Fix on arm and reenable.
-#if !V8_TARGET_ARCH_ARM && !V8_TARGET_ARCH_ARM64
+// TODO(ahaas): Fix on arm and mips and reenable.
+#if !V8_TARGET_ARCH_ARM && !V8_TARGET_ARCH_ARM64 && !V8_TARGET_ARCH_MIPS && \
+ !V8_TARGET_ARCH_MIPS64
TEST(Run_Wasm_F32Min_Snan) {
// Test that the instruction does not return a signalling NaN.
@@ -3236,102 +2700,6 @@
#endif
-#if WASM_64
-TEST(Run_Wasm_F32SConvertI64) {
- WasmRunner<float> r(MachineType::Int64());
- BUILD(r, WASM_F32_SCONVERT_I64(WASM_GET_LOCAL(0)));
- FOR_INT64_INPUTS(i) { CHECK_EQ(static_cast<float>(*i), r.Call(*i)); }
-}
-
-
-#if !defined(_WIN64)
-// TODO(ahaas): Fix this failure.
-TEST(Run_Wasm_F32UConvertI64) {
- WasmRunner<float> r(MachineType::Uint64());
- BUILD(r, WASM_F32_UCONVERT_I64(WASM_GET_LOCAL(0)));
- FOR_UINT64_INPUTS(i) { CHECK_EQ(static_cast<float>(*i), r.Call(*i)); }
-}
-#endif
-
-
-TEST(Run_Wasm_F64SConvertI64) {
- WasmRunner<double> r(MachineType::Int64());
- BUILD(r, WASM_F64_SCONVERT_I64(WASM_GET_LOCAL(0)));
- FOR_INT64_INPUTS(i) { CHECK_EQ(static_cast<double>(*i), r.Call(*i)); }
-}
-
-
-#if !defined(_WIN64)
-// TODO(ahaas): Fix this failure.
-TEST(Run_Wasm_F64UConvertI64) {
- WasmRunner<double> r(MachineType::Uint64());
- BUILD(r, WASM_F64_UCONVERT_I64(WASM_GET_LOCAL(0)));
- FOR_UINT64_INPUTS(i) { CHECK_EQ(static_cast<double>(*i), r.Call(*i)); }
-}
-#endif
-
-
-TEST(Run_Wasm_I64SConvertF32) {
- WasmRunner<int64_t> r(MachineType::Float32());
- BUILD(r, WASM_I64_SCONVERT_F32(WASM_GET_LOCAL(0)));
-
- FOR_FLOAT32_INPUTS(i) {
- if (*i < static_cast<float>(INT64_MAX) &&
- *i >= static_cast<float>(INT64_MIN)) {
- CHECK_EQ(static_cast<int64_t>(*i), r.Call(*i));
- } else {
- CHECK_TRAP64(r.Call(*i));
- }
- }
-}
-
-
-TEST(Run_Wasm_I64SConvertF64) {
- WasmRunner<int64_t> r(MachineType::Float64());
- BUILD(r, WASM_I64_SCONVERT_F64(WASM_GET_LOCAL(0)));
-
- FOR_FLOAT64_INPUTS(i) {
- if (*i < static_cast<double>(INT64_MAX) &&
- *i >= static_cast<double>(INT64_MIN)) {
- CHECK_EQ(static_cast<int64_t>(*i), r.Call(*i));
- } else {
- CHECK_TRAP64(r.Call(*i));
- }
- }
-}
-
-
-TEST(Run_Wasm_I64UConvertF32) {
- WasmRunner<uint64_t> r(MachineType::Float32());
- BUILD(r, WASM_I64_UCONVERT_F32(WASM_GET_LOCAL(0)));
-
- FOR_FLOAT32_INPUTS(i) {
- if (*i < static_cast<float>(UINT64_MAX) && *i > -1) {
- CHECK_EQ(static_cast<uint64_t>(*i), r.Call(*i));
- } else {
- CHECK_TRAP64(r.Call(*i));
- }
- }
-}
-
-
-TEST(Run_Wasm_I64UConvertF64) {
- WasmRunner<uint64_t> r(MachineType::Float64());
- BUILD(r, WASM_I64_UCONVERT_F64(WASM_GET_LOCAL(0)));
-
- FOR_FLOAT64_INPUTS(i) {
- if (*i < static_cast<float>(UINT64_MAX) && *i > -1) {
- CHECK_EQ(static_cast<uint64_t>(*i), r.Call(*i));
- } else {
- CHECK_TRAP64(r.Call(*i));
- }
- }
-}
-#endif
-
-
-// TODO(titzer): Fix and re-enable.
-#if 0
TEST(Run_Wasm_I32SConvertF32) {
WasmRunner<int32_t> r(MachineType::Float32());
BUILD(r, WASM_I32_SCONVERT_F32(WASM_GET_LOCAL(0)));
@@ -3352,8 +2720,8 @@
BUILD(r, WASM_I32_SCONVERT_F64(WASM_GET_LOCAL(0)));
FOR_FLOAT64_INPUTS(i) {
- if (*i < static_cast<double>(INT32_MAX) &&
- *i >= static_cast<double>(INT32_MIN)) {
+ if (*i < (static_cast<double>(INT32_MAX) + 1.0) &&
+ *i > (static_cast<double>(INT32_MIN) - 1.0)) {
CHECK_EQ(static_cast<int64_t>(*i), r.Call(*i));
} else {
CHECK_TRAP32(r.Call(*i));
@@ -3367,7 +2735,7 @@
BUILD(r, WASM_I32_UCONVERT_F32(WASM_GET_LOCAL(0)));
FOR_FLOAT32_INPUTS(i) {
- if (*i < static_cast<float>(UINT32_MAX) && *i > -1) {
+ if (*i < (static_cast<float>(UINT32_MAX) + 1.0) && *i > -1) {
CHECK_EQ(static_cast<uint32_t>(*i), r.Call(*i));
} else {
CHECK_TRAP32(r.Call(*i));
@@ -3381,48 +2749,40 @@
BUILD(r, WASM_I32_UCONVERT_F64(WASM_GET_LOCAL(0)));
FOR_FLOAT64_INPUTS(i) {
- if (*i < static_cast<float>(UINT32_MAX) && *i > -1) {
+ if (*i < (static_cast<float>(UINT32_MAX) + 1.0) && *i > -1) {
CHECK_EQ(static_cast<uint32_t>(*i), r.Call(*i));
} else {
CHECK_TRAP32(r.Call(*i));
}
}
}
-#endif
-
TEST(Run_Wasm_F64CopySign) {
WasmRunner<double> r(MachineType::Float64(), MachineType::Float64());
BUILD(r, WASM_F64_COPYSIGN(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
FOR_FLOAT64_INPUTS(i) {
- FOR_FLOAT64_INPUTS(j) { CheckDoubleEq(copysign(*i, *j), r.Call(*i, *j)); }
+ FOR_FLOAT64_INPUTS(j) { CHECK_DOUBLE_EQ(copysign(*i, *j), r.Call(*i, *j)); }
}
}
-// TODO(tizer): Fix on arm and reenable.
-#if !V8_TARGET_ARCH_ARM && !V8_TARGET_ARCH_ARM64
-
TEST(Run_Wasm_F32CopySign) {
WasmRunner<float> r(MachineType::Float32(), MachineType::Float32());
BUILD(r, WASM_F32_COPYSIGN(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
FOR_FLOAT32_INPUTS(i) {
- FOR_FLOAT32_INPUTS(j) { CheckFloatEq(copysign(*i, *j), r.Call(*i, *j)); }
+ FOR_FLOAT32_INPUTS(j) { CHECK_FLOAT_EQ(copysignf(*i, *j), r.Call(*i, *j)); }
}
}
-
-#endif
-
-
void CompileCallIndirectMany(LocalType param) {
// Make sure we don't run out of registers when compiling indirect calls
// with many many parameters.
TestSignatures sigs;
for (byte num_params = 0; num_params < 40; num_params++) {
- Zone zone;
+ v8::base::AccountingAllocator allocator;
+ Zone zone(&allocator);
HandleScope scope(CcTest::InitIsolateOnce());
TestingModule module;
FunctionSig* sig = sigs.many(&zone, kAstStmt, param, num_params);
@@ -3458,3 +2818,15 @@
TEST(Compile_Wasm_CallIndirect_Many_f64) { CompileCallIndirectMany(kAstF64); }
+
+TEST(Run_WASM_Int32RemS_dead) {
+ WasmRunner<int32_t> r(MachineType::Int32(), MachineType::Int32());
+ BUILD(r, WASM_I32_REMS(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)), WASM_ZERO);
+ const int32_t kMin = std::numeric_limits<int32_t>::min();
+ CHECK_EQ(0, r.Call(133, 100));
+ CHECK_EQ(0, r.Call(kMin, -1));
+ CHECK_EQ(0, r.Call(0, 1));
+ CHECK_TRAP(r.Call(100, 0));
+ CHECK_TRAP(r.Call(-1001, 0));
+ CHECK_TRAP(r.Call(kMin, 0));
+}
diff --git a/test/cctest/wasm/wasm-run-utils.h b/test/cctest/wasm/wasm-run-utils.h
index 7ee3981..1e85f46 100644
--- a/test/cctest/wasm/wasm-run-utils.h
+++ b/test/cctest/wasm/wasm-run-utils.h
@@ -51,22 +51,18 @@
#define WASM_RUNNER_MAX_NUM_PARAMETERS 4
#define WASM_WRAPPER_RETURN_VALUE 8754
+#define BUILD(r, ...) \
+ do { \
+ byte code[] = {__VA_ARGS__}; \
+ r.Build(code, code + arraysize(code)); \
+ } while (false)
+
namespace {
using namespace v8::base;
using namespace v8::internal;
using namespace v8::internal::compiler;
using namespace v8::internal::wasm;
-inline void init_env(FunctionEnv* env, FunctionSig* sig) {
- env->module = nullptr;
- env->sig = sig;
- env->local_i32_count = 0;
- env->local_i64_count = 0;
- env->local_f32_count = 0;
- env->local_f64_count = 0;
- env->SumLocals();
-}
-
const uint32_t kMaxGlobalsSize = 128;
// A helper for module environments that adds the ability to allocate memory
@@ -83,9 +79,8 @@
instance->globals_size = kMaxGlobalsSize;
instance->mem_start = nullptr;
instance->mem_size = 0;
- instance->function_code = nullptr;
linker = nullptr;
- asm_js = false;
+ origin = kWasmOrigin;
memset(global_data, 0, sizeof(global_data));
}
@@ -93,9 +88,6 @@
if (instance->mem_start) {
free(instance->mem_start);
}
- if (instance->function_code) {
- delete instance->function_code;
- }
}
byte* AddMemory(size_t size) {
@@ -121,11 +113,8 @@
}
byte AddSignature(FunctionSig* sig) {
- if (!module->signatures) {
- module->signatures = new std::vector<FunctionSig*>();
- }
- module->signatures->push_back(sig);
- size_t size = module->signatures->size();
+ module->signatures.push_back(sig);
+ size_t size = module->signatures.size();
CHECK(size < 127);
return static_cast<byte>(size - 1);
}
@@ -171,23 +160,21 @@
}
int AddFunction(FunctionSig* sig, Handle<Code> code) {
- if (module->functions == nullptr) {
- module->functions = new std::vector<WasmFunction>();
+ if (module->functions.size() == 0) {
// TODO(titzer): Reserving space here to avoid the underlying WasmFunction
// structs from moving.
- module->functions->reserve(kMaxFunctions);
- instance->function_code = new std::vector<Handle<Code>>();
+ module->functions.reserve(kMaxFunctions);
}
- uint32_t index = static_cast<uint32_t>(module->functions->size());
- module->functions->push_back(
- {sig, index, 0, 0, 0, 0, 0, 0, 0, false, false});
- instance->function_code->push_back(code);
+ uint32_t index = static_cast<uint32_t>(module->functions.size());
+ module->functions.push_back(
+ {sig, index, 0, 0, 0, 0, 0, 0, 0, 0, 0, false, false});
+ instance->function_code.push_back(code);
DCHECK_LT(index, kMaxFunctions); // limited for testing.
return index;
}
void SetFunctionCode(uint32_t index, Handle<Code> code) {
- instance->function_code->at(index) = code;
+ instance->function_code[index] = code;
}
void AddIndirectFunctionTable(int* functions, int table_size) {
@@ -195,21 +182,21 @@
Handle<FixedArray> fixed =
isolate->factory()->NewFixedArray(2 * table_size);
instance->function_table = fixed;
- module->function_table = new std::vector<uint16_t>();
+ DCHECK_EQ(0u, module->function_table.size());
for (int i = 0; i < table_size; i++) {
- module->function_table->push_back(functions[i]);
+ module->function_table.push_back(functions[i]);
}
}
void PopulateIndirectFunctionTable() {
if (instance->function_table.is_null()) return;
- int table_size = static_cast<int>(module->function_table->size());
+ int table_size = static_cast<int>(module->function_table.size());
for (int i = 0; i < table_size; i++) {
- int function_index = module->function_table->at(i);
- WasmFunction* function = &module->functions->at(function_index);
+ int function_index = module->function_table[i];
+ WasmFunction* function = &module->functions[function_index];
instance->function_table->set(i, Smi::FromInt(function->sig_index));
- instance->function_table->set(
- i + table_size, *instance->function_code->at(function_index));
+ instance->function_table->set(i + table_size,
+ *instance->function_code[function_index]);
}
}
@@ -220,24 +207,22 @@
V8_ALIGNED(8) byte global_data[kMaxGlobalsSize]; // preallocated global data.
WasmGlobal* AddGlobal(MachineType mem_type) {
- if (!module->globals) {
- module->globals = new std::vector<WasmGlobal>();
- }
byte size = WasmOpcodes::MemSize(mem_type);
global_offset = (global_offset + size - 1) & ~(size - 1); // align
- module->globals->push_back({0, mem_type, global_offset, false});
+ module->globals.push_back({0, 0, mem_type, global_offset, false});
global_offset += size;
// limit number of globals.
CHECK_LT(global_offset, kMaxGlobalsSize);
- return &module->globals->back();
+ return &module->globals.back();
}
};
-
-inline void TestBuildingGraph(Zone* zone, JSGraph* jsgraph, FunctionEnv* env,
- const byte* start, const byte* end) {
- compiler::WasmGraphBuilder builder(zone, jsgraph, env->sig);
- TreeResult result = BuildTFGraph(&builder, env, start, end);
+inline void TestBuildingGraph(Zone* zone, JSGraph* jsgraph, ModuleEnv* module,
+ FunctionSig* sig, const byte* start,
+ const byte* end) {
+ compiler::WasmGraphBuilder builder(zone, jsgraph, sig);
+ TreeResult result =
+ BuildTFGraph(zone->allocator(), &builder, module, sig, start, end);
if (result.failed()) {
ptrdiff_t pc = result.error_pc - result.start;
ptrdiff_t pt = result.error_pt - result.start;
@@ -405,10 +390,9 @@
: GraphAndBuilders(main_zone()),
jsgraph(this->isolate(), this->graph(), this->common(), nullptr,
nullptr, this->machine()),
+ sig(sig),
descriptor_(nullptr),
testing_module_(module) {
- init_env(&env, sig);
- env.module = module;
if (module) {
// Get a new function from the testing module.
function_ = nullptr;
@@ -426,12 +410,13 @@
}
JSGraph jsgraph;
- FunctionEnv env;
+ FunctionSig* sig;
// The call descriptor is initialized when the function is compiled.
CallDescriptor* descriptor_;
TestingModule* testing_module_;
WasmFunction* function_;
int function_index_;
+ LocalDeclEncoder local_decls;
Isolate* isolate() { return main_isolate(); }
Graph* graph() const { return main_graph_; }
@@ -440,31 +425,25 @@
MachineOperatorBuilder* machine() { return &main_machine_; }
void InitializeDescriptor() {
if (descriptor_ == nullptr) {
- descriptor_ = env.module->GetWasmCallDescriptor(main_zone(), env.sig);
+ descriptor_ = testing_module_->GetWasmCallDescriptor(main_zone(), sig);
}
}
CallDescriptor* descriptor() { return descriptor_; }
void Build(const byte* start, const byte* end) {
- // Transfer local counts before compiling.
- function()->local_i32_count = env.local_i32_count;
- function()->local_i64_count = env.local_i64_count;
- function()->local_f32_count = env.local_f32_count;
- function()->local_f64_count = env.local_f64_count;
-
// Build the TurboFan graph.
- TestBuildingGraph(main_zone(), &jsgraph, &env, start, end);
+ local_decls.Prepend(&start, &end);
+ TestBuildingGraph(main_zone(), &jsgraph, testing_module_, sig, start, end);
+ delete[] start;
}
byte AllocateLocal(LocalType type) {
- int result = static_cast<int>(env.total_locals);
- env.AddLocals(type, 1);
- byte b = static_cast<byte>(result);
- CHECK_EQ(result, b);
- return b;
+ uint32_t index = local_decls.AddLocals(1, type, sig);
+ byte result = static_cast<byte>(index);
+ DCHECK_EQ(index, result);
+ return result;
}
- // TODO(titzer): remove me.
Handle<Code> Compile() {
InitializeDescriptor();
CallDescriptor* desc = descriptor_;
@@ -484,7 +463,6 @@
return result;
}
- // TODO(titzer): remove me.
uint32_t CompileAndAdd(uint16_t sig_index = 0) {
CHECK(testing_module_);
function()->sig_index = sig_index;
@@ -495,7 +473,7 @@
WasmFunction* function() {
if (function_) return function_;
- return &testing_module_->module->functions->at(function_index_);
+ return &testing_module_->module->functions[function_index_];
}
};
@@ -508,8 +486,8 @@
MachineType p1 = MachineType::None(),
MachineType p2 = MachineType::None(),
MachineType p3 = MachineType::None())
- : compiled_(false),
-
+ : zone(&allocator_),
+ compiled_(false),
signature_(MachineTypeForC<ReturnType>() == MachineType::None() ? 0 : 1,
GetParameterCount(p0, p1, p2, p3), storage_),
compiler_(&signature_, nullptr) {
@@ -520,7 +498,8 @@
MachineType p1 = MachineType::None(),
MachineType p2 = MachineType::None(),
MachineType p3 = MachineType::None())
- : compiled_(false),
+ : zone(&allocator_),
+ compiled_(false),
signature_(MachineTypeForC<ReturnType>() == MachineType::None() ? 0 : 1,
GetParameterCount(p0, p1, p2, p3), storage_),
compiler_(&signature_, module) {
@@ -548,8 +527,6 @@
wrapper_.Init(compiler_.descriptor(), p0, p1, p2, p3);
}
- FunctionEnv* env() { return &compiler_.env; }
-
// Builds a graph from the given Wasm code and generates the machine
// code and call wrapper for that graph. This method must not be called
// more than once.
@@ -599,15 +576,10 @@
return return_value;
}
- byte AllocateLocal(LocalType type) {
- int result = static_cast<int>(env()->total_locals);
- env()->AddLocals(type, 1);
- byte b = static_cast<byte>(result);
- CHECK_EQ(result, b);
- return b;
- }
+ byte AllocateLocal(LocalType type) { return compiler_.AllocateLocal(type); }
protected:
+ v8::base::AccountingAllocator allocator_;
Zone zone;
bool compiled_;
LocalType storage_[WASM_RUNNER_MAX_NUM_PARAMETERS];
diff --git a/test/fuzzer/fuzzer.gyp b/test/fuzzer/fuzzer.gyp
index 5fc338c..6e15a90 100644
--- a/test/fuzzer/fuzzer.gyp
+++ b/test/fuzzer/fuzzer.gyp
@@ -87,6 +87,58 @@
],
},
{
+ 'target_name': 'wasm_fuzzer',
+ 'type': 'executable',
+ 'dependencies': [
+ 'wasm_fuzzer_lib',
+ ],
+ 'include_dirs': [
+ '../..',
+ ],
+ 'sources': [
+ 'fuzzer.cc',
+ ],
+ },
+ {
+ 'target_name': 'wasm_fuzzer_lib',
+ 'type': 'static_library',
+ 'dependencies': [
+ 'fuzzer_support',
+ ],
+ 'include_dirs': [
+ '../..',
+ ],
+ 'sources': [ ### gcmole(all) ###
+ 'wasm.cc',
+ ],
+ },
+ {
+ 'target_name': 'wasm_asmjs_fuzzer',
+ 'type': 'executable',
+ 'dependencies': [
+ 'wasm_asmjs_fuzzer_lib',
+ ],
+ 'include_dirs': [
+ '../..',
+ ],
+ 'sources': [
+ 'fuzzer.cc',
+ ],
+ },
+ {
+ 'target_name': 'wasm_asmjs_fuzzer_lib',
+ 'type': 'static_library',
+ 'dependencies': [
+ 'fuzzer_support',
+ ],
+ 'include_dirs': [
+ '../..',
+ ],
+ 'sources': [ ### gcmole(all) ###
+ 'wasm-asmjs.cc',
+ ],
+ },
+ {
'target_name': 'fuzzer_support',
'type': 'static_library',
'dependencies': [
diff --git a/test/fuzzer/fuzzer.isolate b/test/fuzzer/fuzzer.isolate
index 286be2f..4e98edd 100644
--- a/test/fuzzer/fuzzer.isolate
+++ b/test/fuzzer/fuzzer.isolate
@@ -8,11 +8,15 @@
'<(PRODUCT_DIR)/json_fuzzer<(EXECUTABLE_SUFFIX)',
'<(PRODUCT_DIR)/parser_fuzzer<(EXECUTABLE_SUFFIX)',
'<(PRODUCT_DIR)/regexp_fuzzer<(EXECUTABLE_SUFFIX)',
+ '<(PRODUCT_DIR)/wasm_fuzzer<(EXECUTABLE_SUFFIX)',
+ '<(PRODUCT_DIR)/wasm_asmjs_fuzzer<(EXECUTABLE_SUFFIX)',
'./fuzzer.status',
'./testcfg.py',
'./json/',
'./parser/',
'./regexp/',
+ './wasm/',
+ './wasm_asmjs/',
],
},
'includes': [
diff --git a/test/fuzzer/parser.cc b/test/fuzzer/parser.cc
index aee4c0d..be70b43 100644
--- a/test/fuzzer/parser.cc
+++ b/test/fuzzer/parser.cc
@@ -33,7 +33,7 @@
v8::internal::Handle<v8::internal::Script> script =
factory->NewScript(source.ToHandleChecked());
- v8::internal::Zone zone;
+ v8::internal::Zone zone(i_isolate->allocator());
v8::internal::ParseInfo info(&zone, script);
info.set_global();
v8::internal::Parser parser(&info);
diff --git a/test/fuzzer/testcfg.py b/test/fuzzer/testcfg.py
index 976325a..35a5abb 100644
--- a/test/fuzzer/testcfg.py
+++ b/test/fuzzer/testcfg.py
@@ -18,7 +18,7 @@
class FuzzerTestSuite(testsuite.TestSuite):
- SUB_TESTS = ( 'json', 'parser', 'regexp', )
+ SUB_TESTS = ( 'json', 'parser', 'regexp', 'wasm', 'wasm_asmjs', )
def __init__(self, name, root):
super(FuzzerTestSuite, self).__init__(name, root)
diff --git a/test/fuzzer/wasm-asmjs.cc b/test/fuzzer/wasm-asmjs.cc
new file mode 100644
index 0000000..3f7477b
--- /dev/null
+++ b/test/fuzzer/wasm-asmjs.cc
@@ -0,0 +1,39 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include <limits.h>
+#include <stddef.h>
+#include <stdint.h>
+
+#include "include/v8.h"
+#include "src/factory.h"
+#include "src/isolate-inl.h"
+#include "src/isolate.h"
+#include "src/objects-inl.h"
+#include "src/objects.h"
+#include "src/wasm/wasm-js.h"
+#include "src/wasm/wasm-module.h"
+#include "test/fuzzer/fuzzer-support.h"
+
+extern "C" int LLVMFuzzerTestOneInput(const uint8_t* data, size_t size) {
+ v8_fuzzer::FuzzerSupport* support = v8_fuzzer::FuzzerSupport::Get();
+ v8::Isolate* isolate = support->GetIsolate();
+ v8::internal::Isolate* i_isolate =
+ reinterpret_cast<v8::internal::Isolate*>(isolate);
+
+ // Clear any pending exceptions from a prior run.
+ if (i_isolate->has_pending_exception()) {
+ i_isolate->clear_pending_exception();
+ }
+
+ v8::Isolate::Scope isolate_scope(isolate);
+ v8::HandleScope handle_scope(isolate);
+ v8::Context::Scope context_scope(support->GetContext());
+ v8::TryCatch try_catch(isolate);
+ v8::internal::WasmJs::InstallWasmFunctionMap(i_isolate,
+ i_isolate->native_context());
+ v8::internal::wasm::CompileAndRunWasmModule(i_isolate, data, data + size,
+ true);
+ return 0;
+}
diff --git a/test/fuzzer/wasm.cc b/test/fuzzer/wasm.cc
new file mode 100644
index 0000000..8750cbf
--- /dev/null
+++ b/test/fuzzer/wasm.cc
@@ -0,0 +1,39 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include <limits.h>
+#include <stddef.h>
+#include <stdint.h>
+
+#include "include/v8.h"
+#include "src/factory.h"
+#include "src/isolate-inl.h"
+#include "src/isolate.h"
+#include "src/objects-inl.h"
+#include "src/objects.h"
+#include "src/wasm/wasm-js.h"
+#include "src/wasm/wasm-module.h"
+#include "test/fuzzer/fuzzer-support.h"
+
+extern "C" int LLVMFuzzerTestOneInput(const uint8_t* data, size_t size) {
+ v8_fuzzer::FuzzerSupport* support = v8_fuzzer::FuzzerSupport::Get();
+ v8::Isolate* isolate = support->GetIsolate();
+ v8::internal::Isolate* i_isolate =
+ reinterpret_cast<v8::internal::Isolate*>(isolate);
+
+ // Clear any pending exceptions from a prior run.
+ if (i_isolate->has_pending_exception()) {
+ i_isolate->clear_pending_exception();
+ }
+
+ v8::Isolate::Scope isolate_scope(isolate);
+ v8::HandleScope handle_scope(isolate);
+ v8::Context::Scope context_scope(support->GetContext());
+ v8::TryCatch try_catch(isolate);
+ v8::internal::WasmJs::InstallWasmFunctionMap(i_isolate,
+ i_isolate->native_context());
+ v8::internal::wasm::CompileAndRunWasmModule(i_isolate, data, data + size,
+ false);
+ return 0;
+}
diff --git a/test/fuzzer/wasm/foo.wasm b/test/fuzzer/wasm/foo.wasm
new file mode 100644
index 0000000..79cd64b
--- /dev/null
+++ b/test/fuzzer/wasm/foo.wasm
Binary files differ
diff --git a/test/fuzzer/wasm_asmjs/foo.wasm b/test/fuzzer/wasm_asmjs/foo.wasm
new file mode 100644
index 0000000..79cd64b
--- /dev/null
+++ b/test/fuzzer/wasm_asmjs/foo.wasm
Binary files differ
diff --git a/test/ignition.isolate b/test/ignition.isolate
index 7e4e581..a8e4d5a 100644
--- a/test/ignition.isolate
+++ b/test/ignition.isolate
@@ -10,5 +10,7 @@
'includes': [
'cctest/cctest.isolate',
'mjsunit/mjsunit.isolate',
+ 'message/message.isolate',
+ 'webkit/webkit.isolate',
],
}
diff --git a/test/intl/number-format/format-is-bound.js b/test/intl/number-format/format-is-bound.js
index b24c2ed..d93ee00 100644
--- a/test/intl/number-format/format-is-bound.js
+++ b/test/intl/number-format/format-is-bound.js
@@ -37,3 +37,6 @@
// Formatting a number should work in a direct call.
nf.format(12345);
+
+// Reading the format doesn't add any additional property keys
+assertEquals(1, Object.getOwnPropertyNames(nf).length);
diff --git a/test/intl/regexp-assert.js b/test/intl/regexp-assert.js
new file mode 100644
index 0000000..28fafd0
--- /dev/null
+++ b/test/intl/regexp-assert.js
@@ -0,0 +1,19 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+assertEquals("a", RegExp.$1);
+assertEquals("b", RegExp.$2);
+assertEquals("c", RegExp.$3);
+assertEquals("d", RegExp.$4);
+assertEquals("e", RegExp.$5);
+assertEquals("f", RegExp.$6);
+assertEquals("g", RegExp.$7);
+assertEquals("h", RegExp.$8);
+assertEquals("i", RegExp.$9);
+
+assertEquals("abcdefghij", RegExp.lastMatch);
+assertEquals("j", RegExp.lastParen);
+assertEquals(">>>", RegExp.leftContext);
+assertEquals("<<<", RegExp.rightContext);
+assertEquals(">>>abcdefghij<<<", RegExp.input);
diff --git a/test/intl/regexp-prepare.js b/test/intl/regexp-prepare.js
new file mode 100644
index 0000000..dec8411
--- /dev/null
+++ b/test/intl/regexp-prepare.js
@@ -0,0 +1,5 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+/(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)/.exec(">>>abcdefghij<<<");
diff --git a/test/intl/testcfg.py b/test/intl/testcfg.py
index 51fa1e1..6e4b4f1 100644
--- a/test/intl/testcfg.py
+++ b/test/intl/testcfg.py
@@ -45,7 +45,8 @@
files.sort()
for filename in files:
if (filename.endswith(".js") and filename != "assert.js" and
- filename != "utils.js"):
+ filename != "utils.js" and filename != "regexp-assert.js" and
+ filename != "regexp-prepare.js"):
fullpath = os.path.join(dirname, filename)
relpath = fullpath[len(self.root) + 1 : -3]
testname = relpath.replace(os.path.sep, "/")
@@ -59,7 +60,9 @@
files = []
files.append(os.path.join(self.root, "assert.js"))
files.append(os.path.join(self.root, "utils.js"))
+ files.append(os.path.join(self.root, "regexp-prepare.js"))
files.append(os.path.join(self.root, testcase.path + self.suffix()))
+ files.append(os.path.join(self.root, "regexp-assert.js"))
flags += files
if context.isolates:
diff --git a/test/js-perf-test/JSTests.json b/test/js-perf-test/JSTests.json
index 31049d1..dc3cb75 100644
--- a/test/js-perf-test/JSTests.json
+++ b/test/js-perf-test/JSTests.json
@@ -110,10 +110,19 @@
"name": "Object",
"path": ["Object"],
"main": "run.js",
- "resources": ["assign.js"],
+ "flags": ["--harmony"],
+ "resources": [
+ "assign.js",
+ "values.js",
+ "entries.js"
+ ],
"results_regexp": "^%s\\-Object\\(Score\\): (.+)$",
"tests": [
- {"name": "Assign"}
+ {"name": "Assign"},
+ {"name": "Entries"},
+ {"name": "EntriesMegamorphic"},
+ {"name": "Values"},
+ {"name": "ValuesMegamorphic"}
]
},
{
@@ -135,6 +144,25 @@
"tests": [
{"name": "Try-Catch"}
]
+ },
+ {
+ "name": "Keys",
+ "path": ["Keys"],
+ "main": "run.js",
+ "resources": ["keys.js"],
+ "results_regexp": "^%s\\-Keys\\(Score\\): (.+)$",
+ "run_count": 3,
+ "run_count_android_arm": 2,
+ "run_count_android_arm64": 2,
+ "tests": [
+ {"name": "Object.keys()"},
+ {"name": "for-in"},
+ {"name": "for-in hasOwnProperty()"},
+ {"name": "for (i < Object.keys().length)"},
+ {"name": "Object.keys().forEach()"},
+ {"name": "for (i < array.length)"},
+ {"name": "for (i < length)"}
+ ]
}
]
}
diff --git a/test/js-perf-test/Keys/keys.js b/test/js-perf-test/Keys/keys.js
new file mode 100644
index 0000000..63ed0eb
--- /dev/null
+++ b/test/js-perf-test/Keys/keys.js
@@ -0,0 +1,209 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+function ObjectWithKeys(count, keyOffset, keyGen) {
+ if (keyOffset === undefined) keyOffset = 0;
+ if (keyGen === undefined) keyGen = (i) => { return "key" + i };
+ var o = {};
+ for (var i = 0; i < count; i++) {
+ var key = keyGen(i + keyOffset);
+ o[key] = "value";
+ }
+ return o
+}
+
+function ObjectWithMixedKeys(count, keyOffset) {
+ return ObjectWithKeys(count, keyOffset, (key) => {
+ if (key % 2 == 0) return key;
+ return "key" + key;
+ });
+}
+
+// Create an object with #depth prototypes each having #keys properties.
+function ObjectWithProtoKeys(depth, keys, cacheable) {
+ var o = ObjectWithKeys(keys);
+ var current = o;
+ var keyOffset = 0;
+ for (var i = 0; i < depth; i++) {
+ keyOffset += keys;
+ current.__proto__ = ObjectWithKeys(keys, keyOffset);
+ current = current.__proto__;
+ }
+ if (cacheable === false) {
+ // Add an empty proxy at the prototype chain to make caching properties
+ // impossible.
+ current.__proto__ = new Proxy({}, {});
+ }
+ return o;
+}
+
+function HoleyIntArray(size) {
+ var array = new Array(size);
+ for (var i = 0; i < size; i += 3) {
+ array[i] = i;
+ }
+ return array
+}
+
+function IntArray(size) {
+ var array = new Array(size);
+ for (var i = 0; i < size; i++) {
+ array[i] = i;
+ }
+ return array;
+}
+
+// ============================================================================
+var object_empty = {};
+var array_empty = [];
+
+var array_int_50 = IntArray(50);
+var array_int_50_proto_elements = IntArray(50);
+array_int_50_proto_elements.__proto__ = [51, 52, 53, 54];
+var array_int_holey_50 = HoleyIntArray(50);
+
+var empty_proto_5_10 = ObjectWithKeys(5);
+empty_proto_5_10.__proto__ = ObjectWithProtoKeys(10, 0);
+
+var empty_proto_5_5_slow = ObjectWithKeys(5);
+empty_proto_5_5_slow.__proto__ = ObjectWithProtoKeys(5, 0, false);
+
+var object_elements_proto_5_10 = ObjectWithKeys(5);
+object_elements_proto_5_10.__proto__ = ObjectWithProtoKeys(10, 0);
+// Add some properties further up the prototype chain, the rest stays
+// empty.
+for (var i = 0; i < 5; i++) {
+ object_elements_proto_5_10.__proto__.__proto__.__proto__["proto" + i] = true;
+}
+
+var TestObjects = {
+ object_empty: object_empty,
+ array_empty: array_empty,
+ array_int_50: array_int_50,
+ array_int_holey_50: array_int_holey_50,
+ array_int_50_proto_elements: array_int_50_proto_elements,
+ empty_proto_5_10: empty_proto_5_10,
+ empty_proto_5_5_slow: empty_proto_5_5_slow,
+ object_elements_proto_5_10: object_elements_proto_5_10
+}
+
+var TestArrays = {
+ array_empty: array_empty,
+ array_int_50: array_int_50,
+ array_int_holey_50: array_int_holey_50,
+ array_int_50_proto_elements: array_int_50_proto_elements,
+}
+
+// ============================================================================
+
+function CreateTestFunctionGen(fn) {
+ // Force a new function for each test-object to avoid side-effects due to ICs.
+ return (object) => {
+ var random_comment = "\n// random comment" + Math.random() + "\n";
+ return eval(random_comment + fn.toString());
+ }
+}
+
+var TestFunctions = {
+ "Object.keys()": CreateTestFunctionGen(() => {return Object.keys(object)}),
+ "for-in": CreateTestFunctionGen(() => {
+ var count = 0;
+ var result;
+ for (var key in object) {
+ count++;
+ result = object[key];
+ };
+ return [result, count];
+ }),
+ "for-in hasOwnProperty()": CreateTestFunctionGen(() => {
+ var count = 0;
+ var result;
+ for (var key in object) {
+ if (!object.hasOwnProperty(key)) continue;
+ count++;
+ result = object[key];
+ };
+ return [result, count];
+ }),
+ "for (i < Object.keys().length)": CreateTestFunctionGen(() => {
+ var count = 0;
+ var result;
+ var keys = Object.keys(object);
+ for (var i = 0; i < keys.length; i++) {
+ count++;
+ result = object[keys[i]];
+ };
+ return [result, count];
+ }),
+ "Object.keys().forEach()": CreateTestFunctionGen(() => {
+ var count = 0;
+ var result;
+ Object.keys(object).forEach((value, index, obj) => {
+ count++;
+ result = value;
+ });
+ return [result, count];
+ }),
+}
+
+var TestFunctionsArrays = {
+ "for (i < array.length)": CreateTestFunctionGen(() => {
+ var count = 0;
+ var result;
+ for (var i = 0; i < object.length; i++) {
+ count++;
+ result = object[i];
+ };
+ return [result, count];
+ }),
+ "for (i < length)": CreateTestFunctionGen(() => {
+ var count = 0;
+ var result;
+ var length = object.length;
+ for (var i = 0; i < length; i++) {
+ count++;
+ result = object[i];
+ };
+ return [result, count];
+ })
+}
+
+// ============================================================================
+// Create the benchmark suites. We create a suite for each of the test
+// functions above and each suite contains benchmarks for each object type.
+var Benchmarks = [];
+
+function NewBenchmark(
+ test_function_gen, test_function_name, test_object, test_object_name) {
+ var object = test_object;
+ var name = test_function_name + " " + test_object_name;
+ var test_function = test_function_gen(object);
+ return new Benchmark(name, false, false, 0, test_function)
+}
+
+for (var test_function_name in TestFunctions) {
+ var test_function_gen = TestFunctions[test_function_name];
+ var benchmarks = [];
+ for (var test_object_name in TestObjects) {
+ var test_object = TestObjects[test_object_name];
+ var benchmark = NewBenchmark(
+ test_function_gen, test_function_name, test_object, test_object_name);
+ benchmarks.push(benchmark);
+ }
+ Benchmarks.push(new BenchmarkSuite(test_function_name, [100], benchmarks));
+}
+
+for (var test_function_name in TestFunctionsArrays) {
+ var test_function_gen = TestFunctionsArrays[test_function_name];
+ var benchmarks = [];
+ for (var test_array_name in TestArrays) {
+ var test_array = TestArrays[test_array_name];
+ var benchmark = NewBenchmark(
+ test_function_gen, test_function_name, test_array, test_array_name);
+ benchmarks.push(benchmark);
+ }
+ Benchmarks.push(new BenchmarkSuite(test_function_name, [100], benchmarks));
+}
+
+// ============================================================================
diff --git a/test/js-perf-test/Keys/run.js b/test/js-perf-test/Keys/run.js
new file mode 100644
index 0000000..d4acbf3
--- /dev/null
+++ b/test/js-perf-test/Keys/run.js
@@ -0,0 +1,22 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+load('../base.js');
+load('keys.js');
+
+var success = true;
+
+function PrintResult(name, result) {
+ print(name + '-Keys(Score): ' + result);
+}
+
+function PrintError(name, error) {
+ PrintResult(name, error);
+ success = false;
+}
+
+BenchmarkSuite.config.doWarmup = undefined;
+BenchmarkSuite.config.doDeterministic = undefined;
+
+BenchmarkSuite.RunSuites({NotifyResult: PrintResult, NotifyError: PrintError});
diff --git a/test/js-perf-test/Object/ObjectTests.json b/test/js-perf-test/Object/ObjectTests.json
new file mode 100644
index 0000000..1c0e5ed
--- /dev/null
+++ b/test/js-perf-test/Object/ObjectTests.json
@@ -0,0 +1,31 @@
+{
+ "name": "ObjectTests",
+ "run_count": 5,
+ "run_count_android_arm": 3,
+ "run_count_android_arm64": 3,
+ "timeout": 120,
+ "units": "score",
+ "total": true,
+ "resources": ["base.js"],
+ "tests": [
+ {
+ "name": "Object",
+ "path": ["."],
+ "main": "run.js",
+ "flags": ["--harmony"],
+ "resources": [
+ "assign.js",
+ "values.js",
+ "entries.js"
+ ],
+ "results_regexp": "^%s\\-Object\\(Score\\): (.+)$",
+ "tests": [
+ {"name": "Assign"},
+ {"name": "Entries"},
+ {"name": "EntriesMegamorphic"},
+ {"name": "Values"},
+ {"name": "ValuesMegamorphic"}
+ ]
+ }
+ ]
+}
diff --git a/test/js-perf-test/Object/entries.js b/test/js-perf-test/Object/entries.js
new file mode 100644
index 0000000..0658b79
--- /dev/null
+++ b/test/js-perf-test/Object/entries.js
@@ -0,0 +1,75 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+new BenchmarkSuite('Entries', [1000], [
+ new Benchmark('Basic', false, false, 0, Basic, BasicSetup, BasicTearDown)
+]);
+
+var object;
+var expected;
+var result;
+var symbol1;
+
+function Basic() {
+ result = Object.entries(object);
+}
+
+
+function BasicSetup() {
+ result = undefined;
+ symbol1 = Symbol('test');
+ object = { a: 10 };
+ object[26.0] = 'third';
+ object.b = 72;
+ object[symbol1] = 'TEST';
+ Object.defineProperty(object, 'not-enumerable', {
+ enumerable: false, value: 'nope', writable: true, configurable: true });
+}
+
+
+function BasicTearDown() {
+ result = result.map(entry => `[${[String(entry[0]), String(entry[1])]}]`);
+ return result.length === 3 &&
+ result.join(', ') === '[a, 10], [26.0, third], [b, 72]';
+}
+
+// ----------------------------------------------------------------------------
+
+new BenchmarkSuite('EntriesMegamorphic', [1000], [
+ new Benchmark('BasicMegamorphic', false, false, 0, BasicMegamorphic,
+ BasicMegamorphicSetup, BasicMegamorphicTearDown)
+]);
+
+function BasicMegamorphic() {
+ for (var i = 0; i < object.length; ++i) {
+ result[i] = Object.entries(object[i]);
+ }
+}
+
+
+function BasicMegamorphicSetup() {
+ // Create 1k objects with different maps.
+ object = [];
+ expected = [];
+ result = [];
+ for (var i=0; i<1000; i++) {
+ var obj = {};
+ var exp = [];
+ for (var j=0; j<10; j++) {
+ obj['key-'+i+'-'+j] = 'property-'+i+'-'+j;
+ exp[j] = ['key-'+i+'-'+j, 'property-'+i+'-'+j];
+ }
+ object[i] = obj;
+ expected[i] = exp;
+ }
+}
+
+
+function BasicMegamorphicTearDown() {
+ if (JSON.stringify(expected) !== JSON.stringify(result)) {
+ throw new Error("FAILURE");
+ }
+ object = result = expected = undefined;
+ return true;
+}
diff --git a/test/js-perf-test/Object/run.js b/test/js-perf-test/Object/run.js
index 15c31ba..f25bee4 100644
--- a/test/js-perf-test/Object/run.js
+++ b/test/js-perf-test/Object/run.js
@@ -4,7 +4,10 @@
load('../base.js');
+
load('assign.js');
+load('values.js');
+load('entries.js');
var success = true;
diff --git a/test/js-perf-test/Object/values.js b/test/js-perf-test/Object/values.js
new file mode 100644
index 0000000..acdec49
--- /dev/null
+++ b/test/js-perf-test/Object/values.js
@@ -0,0 +1,75 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+new BenchmarkSuite('Values', [1000], [
+ new Benchmark('Basic', false, false, 0, Basic, BasicSetup, BasicTearDown),
+]);
+
+var object;
+var expected;
+var result;
+var symbol1;
+
+function Basic() {
+ result = Object.values(object);
+}
+
+
+function BasicSetup() {
+ result = undefined;
+ symbol1 = Symbol('test');
+ object = { a: 10 };
+ object[26.0] = 'third';
+ object.b = 72;
+ object[symbol1] = 'TEST';
+ Object.defineProperty(object, 'not-enumerable', {
+ enumerable: false, value: 'nope', writable: true, configurable: true });
+}
+
+
+function BasicTearDown() {
+ return result.length === 3 && result[0] === 10 && result[1] === 'third' &&
+ result[2] === 72;
+}
+
+// ----------------------------------------------------------------------------
+
+new BenchmarkSuite('ValuesMegamorphic', [1000], [
+ new Benchmark('BasicMegamorphic', false, false, 0, BasicMegamorphic,
+ BasicMegamorphicSetup, BasicMegamorphicTearDown)
+]);
+
+
+function BasicMegamorphic() {
+ for (var i = 0; i < object.length; ++i) {
+ result[i] = Object.values(object[i]);
+ }
+}
+
+
+function BasicMegamorphicSetup() {
+ // Create 1k objects with different maps.
+ object = [];
+ expected = [];
+ result = [];
+ for (var i=0; i<1000; i++) {
+ var obj = {};
+ var exp = [];
+ for (var j=0; j<10; j++) {
+ obj['key-'+i+'-'+j] = 'property-'+i+'-'+j;
+ exp[j] = 'property-'+i+'-'+j;
+ }
+ object[i] = obj;
+ expected[i] = exp;
+ }
+}
+
+
+function BasicMegamorphicTearDown() {
+ if (JSON.stringify(expected) !== JSON.stringify(result)) {
+ throw new Error("FAILURE");
+ }
+ object = result = expected = undefined;
+ return true;
+}
diff --git a/test/message/strong-object-set-proto.js b/test/message/const-decl-no-init-sloppy.js
similarity index 73%
copy from test/message/strong-object-set-proto.js
copy to test/message/const-decl-no-init-sloppy.js
index 890dd84..a122eae 100644
--- a/test/message/strong-object-set-proto.js
+++ b/test/message/const-decl-no-init-sloppy.js
@@ -1,9 +1,9 @@
// Copyright 2015 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
+//
+// Flags: --harmony-sloppy
-// Flags: --strong-mode
-
-"use strong";
-
-({}).__proto__ = {};
+function f() {
+ const a;
+}
diff --git a/test/message/const-decl-no-init-sloppy.out b/test/message/const-decl-no-init-sloppy.out
new file mode 100644
index 0000000..3024977
--- /dev/null
+++ b/test/message/const-decl-no-init-sloppy.out
@@ -0,0 +1,7 @@
+# Copyright 2016 the V8 project authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+*%(basename)s:8: SyntaxError: Missing initializer in const declaration
+ const a;
+ ^
+SyntaxError: Missing initializer in const declaration
diff --git a/test/message/default-parameter-tdz-arrow.js b/test/message/default-parameter-tdz-arrow.js
index cad091f..d68ceb2 100644
--- a/test/message/default-parameter-tdz-arrow.js
+++ b/test/message/default-parameter-tdz-arrow.js
@@ -2,6 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
-// Flags: --harmony-default-parameters
+//
((a=-a) => { })();
diff --git a/test/message/default-parameter-tdz.js b/test/message/default-parameter-tdz.js
index ff2a400..a109196 100644
--- a/test/message/default-parameter-tdz.js
+++ b/test/message/default-parameter-tdz.js
@@ -2,6 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
-// Flags: --harmony-default-parameters
+//
(function(a=+a) { })();
diff --git a/test/message/destructuring-decl-no-init-array.js b/test/message/destructuring-decl-no-init-array.js
index 7c73d3b..ab976b1 100644
--- a/test/message/destructuring-decl-no-init-array.js
+++ b/test/message/destructuring-decl-no-init-array.js
@@ -2,6 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
-// Flags: --harmony-destructuring-bind
+//
var [ a, b, c ];
diff --git a/test/message/destructuring-decl-no-init-array2.js b/test/message/destructuring-decl-no-init-array2.js
index a82afa4..9ffa58b 100644
--- a/test/message/destructuring-decl-no-init-array2.js
+++ b/test/message/destructuring-decl-no-init-array2.js
@@ -2,6 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
-// Flags: --harmony-destructuring-bind
+//
for (var [ a ]; a; ) {}
diff --git a/test/message/destructuring-decl-no-init-obj.js b/test/message/destructuring-decl-no-init-obj.js
index 23424aa..398b4fc 100644
--- a/test/message/destructuring-decl-no-init-obj.js
+++ b/test/message/destructuring-decl-no-init-obj.js
@@ -2,6 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
-// Flags: --harmony-destructuring-bind
+//
var { a, b, c };
diff --git a/test/message/destructuring-decl-no-init-obj2.js b/test/message/destructuring-decl-no-init-obj2.js
index 6c76137..652409b 100644
--- a/test/message/destructuring-decl-no-init-obj2.js
+++ b/test/message/destructuring-decl-no-init-obj2.js
@@ -2,6 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
-// Flags: --harmony-destructuring-bind
+//
for (var { a, b, c }; a && b && c; ) {}
diff --git a/test/message/destructuring-modify-const.js b/test/message/destructuring-modify-const.js
index 88bda35..5575ae9 100644
--- a/test/message/destructuring-modify-const.js
+++ b/test/message/destructuring-modify-const.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-destructuring-bind
+//
'use strict';
const { x : x, y : y } = { x : 1, y : 2 };
diff --git a/test/message/for-in-loop-initializers-destructuring.js b/test/message/for-in-loop-initializers-destructuring.js
index eab8b81..9bbfd8d 100644
--- a/test/message/for-in-loop-initializers-destructuring.js
+++ b/test/message/for-in-loop-initializers-destructuring.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
-// Flags: --harmony-destructuring-bind
+//
function f() {
for (var [x, y] = {} in {});
diff --git a/test/message/for-of-throw-in-body.js b/test/message/for-of-throw-in-body.js
new file mode 100644
index 0000000..38b27f3
--- /dev/null
+++ b/test/message/for-of-throw-in-body.js
@@ -0,0 +1,5 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+for (var x of [1, 2, 3]) { throw 42 }
diff --git a/test/message/for-of-throw-in-body.out b/test/message/for-of-throw-in-body.out
new file mode 100644
index 0000000..4bc48eb
--- /dev/null
+++ b/test/message/for-of-throw-in-body.out
@@ -0,0 +1,6 @@
+# Copyright 2016 the V8 project authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+*%(basename)s:5: 42
+for (var x of [1, 2, 3]) { throw 42 }
+ ^
diff --git a/test/message/instanceof.js b/test/message/instanceof-noncallable.js
similarity index 96%
copy from test/message/instanceof.js
copy to test/message/instanceof-noncallable.js
index 1d55e0f..571a2b0 100644
--- a/test/message/instanceof.js
+++ b/test/message/instanceof-noncallable.js
@@ -25,4 +25,6 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-1 instanceof 2;
+// Flags: --harmony-instanceof
+
+1 instanceof {};
diff --git a/test/message/instanceof-noncallable.out b/test/message/instanceof-noncallable.out
new file mode 100644
index 0000000..73e2ae6
--- /dev/null
+++ b/test/message/instanceof-noncallable.out
@@ -0,0 +1,5 @@
+*%(basename)s:30: TypeError: Right-hand side of 'instanceof' is not callable
+1 instanceof {};
+ ^
+TypeError: Right-hand side of 'instanceof' is not callable
+ at *%(basename)s:30:3
diff --git a/test/message/instanceof.js b/test/message/instanceof-nonobject.js
similarity index 97%
rename from test/message/instanceof.js
rename to test/message/instanceof-nonobject.js
index 1d55e0f..4715257 100644
--- a/test/message/instanceof.js
+++ b/test/message/instanceof-nonobject.js
@@ -25,4 +25,6 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+// Flags: --harmony-instanceof
+
1 instanceof 2;
diff --git a/test/message/instanceof-nonobject.out b/test/message/instanceof-nonobject.out
new file mode 100644
index 0000000..ecf47af
--- /dev/null
+++ b/test/message/instanceof-nonobject.out
@@ -0,0 +1,5 @@
+*%(basename)s:30: TypeError: Right-hand side of 'instanceof' is not an object
+1 instanceof 2;
+ ^
+TypeError: Right-hand side of 'instanceof' is not an object
+ at *%(basename)s:30:3
diff --git a/test/message/instanceof.out b/test/message/instanceof.out
deleted file mode 100644
index d279bc4..0000000
--- a/test/message/instanceof.out
+++ /dev/null
@@ -1,5 +0,0 @@
-*%(basename)s:28: TypeError: Expecting a function in instanceof check, but got 2
-1 instanceof 2;
- ^
-TypeError: Expecting a function in instanceof check, but got 2
- at *%(basename)s:28:3
diff --git a/test/message/let-lexical-name-in-array-prohibited.js b/test/message/let-lexical-name-in-array-prohibited.js
index c7a35cd..a6cba6f 100644
--- a/test/message/let-lexical-name-in-array-prohibited.js
+++ b/test/message/let-lexical-name-in-array-prohibited.js
@@ -2,6 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
-// Flags: --harmony-sloppy --harmony-sloppy-let --harmony-destructuring-bind
+// Flags: --harmony-sloppy --harmony-sloppy-let
let [let];
diff --git a/test/message/let-lexical-name-in-object-prohibited.js b/test/message/let-lexical-name-in-object-prohibited.js
index d2b7c90..0a12762 100644
--- a/test/message/let-lexical-name-in-object-prohibited.js
+++ b/test/message/let-lexical-name-in-object-prohibited.js
@@ -2,6 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
-// Flags: --harmony-sloppy --harmony-sloppy-let --harmony-destructuring-bind
+// Flags: --harmony-sloppy --harmony-sloppy-let
let {let};
diff --git a/test/message/message.status b/test/message/message.status
index 234bf0f..051911c 100644
--- a/test/message/message.status
+++ b/test/message/message.status
@@ -29,5 +29,9 @@
[ALWAYS, {
# All tests in the bug directory are expected to fail.
'bugs/*': [FAIL],
+ # We don't parse RegExps at scanning time, so we can't fail on octal
+ # escapes (we need to parse to distinguish octal escapes from valid
+ # back-references).
+ 'strict-octal-regexp': [SKIP],
}], # ALWAYS
]
diff --git a/test/message/no-legacy-const-2.js b/test/message/no-legacy-const-2.js
index 24e3f85..5dc63b3 100644
--- a/test/message/no-legacy-const-2.js
+++ b/test/message/no-legacy-const-2.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
-// Flags: --no-legacy-const --no-harmony-sloppy --no-harmony-sloppy-let
+// Flags: --no-harmony-sloppy --no-harmony-sloppy-let
// Flags: --no-harmony-sloppy-function
const = 42;
diff --git a/test/message/no-legacy-const-3.js b/test/message/no-legacy-const-3.js
index 4f6e9a4..43dd9c9 100644
--- a/test/message/no-legacy-const-3.js
+++ b/test/message/no-legacy-const-3.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
-// Flags: --no-legacy-const --no-harmony-sloppy --no-harmony-sloppy-let
+// Flags: --no-harmony-sloppy --no-harmony-sloppy-let
// Flags: --no-harmony-sloppy-function
const
diff --git a/test/message/no-legacy-const.js b/test/message/no-legacy-const.js
index d9a716b..9eebee5 100644
--- a/test/message/no-legacy-const.js
+++ b/test/message/no-legacy-const.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
-// Flags: --no-legacy-const --no-harmony-sloppy --no-harmony-sloppy-let
+// Flags: --no-harmony-sloppy --no-harmony-sloppy-let
// Flags: --no-harmony-sloppy-function
const x = 42;
diff --git a/test/preparser/non-alphanum.js b/test/message/non-alphanum.js
similarity index 98%
rename from test/preparser/non-alphanum.js
rename to test/message/non-alphanum.js
index 83bd1f8..357ebfa 100644
--- a/test/preparser/non-alphanum.js
+++ b/test/message/non-alphanum.js
@@ -29,6 +29,6 @@
// non-alphanumeric characters, but does contain valid code.
// Created using http://discogscounter.getfreehosting.co.uk/js-noalnum_com.php
-// Probably only works in Firefox, but should parse fine.
+// Will throw a TypeError, but should parse fine and not throw a SyntaxError.
([][(![]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]+(!![]+[])[+[]]][([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(![]+[])[+!+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[!+[]+!+[]]]()[(![]+[])[+!+[]]+(![]+[])[!+[]+!+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]+(!![]+[])[+[]]])([][(![]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]+(!![]+[])[+[]]][([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(![]+[])[+!+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[!+[]+!+[]]]()[([][(![]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]+(!![]+[])[+[]]][([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(![]+[])[+!+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[!+[]+!+[]]]()+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(![]+[])[+!+[]]]((![]+[])[+!+[]])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+([][[]]+[])[+[]]+(+[![]]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+!+[]]]+[][(![]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]+(!![]+[])[+[]]][([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(![]+[])[+!+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[!+[]+!+[]]]()[(![]+[])[+!+[]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+([][(![]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]+(!![]+[])[+[]]][([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(![]+[])[+!+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[!+[]+!+[]]]()+[])[!+[]+!+[]]]((![]+[])[+!+[]]+(+[![]]+[])[+[]])[+[]]+(![]+[])[+!+[]]+(+[]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[!+[]+!+[]+!+[]+[+[]]]+(!![]+[])[!+[]+!+[]+!+[]]+(+[![]]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+!+[]]]+([][(![]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]+(!![]+[])[+[]]][([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(![]+[])[+!+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[!+[]+!+[]]]()+[])[!+[]+!+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[!+[]+!+[]+!+[]]+([][[]]+[])[+!+[]]+(+[![]]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+!+[]]]+([]+([]+[])[([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+([][[]]+[])[+!+[]]+(![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[+!+[]]+([][[]]+[])[+[]]+([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]])[+!+[]+[!+[]+!+[]+!+[]+!+[]]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[!+[]+!+[]+!+[]]+[][(![]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]+(!![]+[])[+[]]][([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(![]+[])[+!+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[!+[]+!+[]]]()[(![]+[])[+!+[]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+([][(![]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]+(!![]+[])[+[]]][([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(![]+[])[+!+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[!+[]+!+[]]]()+[])[!+[]+!+[]]]((![]+[])[+!+[]]+[+[]])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+([][[]]+[])[!+[]+!+[]]+[][(![]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]+(!![]+[])[+[]]][([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(![]+[])[+!+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[!+[]+!+[]]]()[(![]+[])[+!+[]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+([][(![]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]+(!![]+[])[+[]]][([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(![]+[])[+!+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[!+[]+!+[]]]()+[])[!+[]+!+[]]]((+(+!+[]+(!+[]+[])[!+[]+!+[]+!+[]]+[+!+[]]+[+[]]+[+[]]+[+[]])+[])[+[]]+(![]+[])[+[]])[+[]])
diff --git a/test/preparser/non-alphanum.js b/test/message/non-alphanum.out
similarity index 78%
copy from test/preparser/non-alphanum.js
copy to test/message/non-alphanum.out
index 83bd1f8..dc15a61 100644
--- a/test/preparser/non-alphanum.js
+++ b/test/message/non-alphanum.out
@@ -1,34 +1,6 @@
-// Copyright 2011 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// This file contains no symbols or function declarations, and only
-// non-alphanumeric characters, but does contain valid code.
-
-// Created using http://discogscounter.getfreehosting.co.uk/js-noalnum_com.php
-// Probably only works in Firefox, but should parse fine.
-
+*%(basename)s:34: TypeError: Array.prototype.sort called on null or undefined
([][(![]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]+(!![]+[])[+[]]][([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(![]+[])[+!+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[!+[]+!+[]]]()[(![]+[])[+!+[]]+(![]+[])[!+[]+!+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]+(!![]+[])[+[]]])([][(![]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]+(!![]+[])[+[]]][([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(![]+[])[+!+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[!+[]+!+[]]]()[([][(![]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]+(!![]+[])[+[]]][([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(![]+[])[+!+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[!+[]+!+[]]]()+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(![]+[])[+!+[]]]((![]+[])[+!+[]])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+([][[]]+[])[+[]]+(+[![]]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+!+[]]]+[][(![]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]+(!![]+[])[+[]]][([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(![]+[])[+!+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[!+[]+!+[]]]()[(![]+[])[+!+[]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+([][(![]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]+(!![]+[])[+[]]][([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(![]+[])[+!+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[!+[]+!+[]]]()+[])[!+[]+!+[]]]((![]+[])[+!+[]]+(+[![]]+[])[+[]])[+[]]+(![]+[])[+!+[]]+(+[]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[!+[]+!+[]+!+[]+[+[]]]+(!![]+[])[!+[]+!+[]+!+[]]+(+[![]]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+!+[]]]+([][(![]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]+(!![]+[])[+[]]][([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(![]+[])[+!+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[!+[]+!+[]]]()+[])[!+[]+!+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[!+[]+!+[]+!+[]]+([][[]]+[])[+!+[]]+(+[![]]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+!+[]]]+([]+([]+[])[([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+([][[]]+[])[+!+[]]+(![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[+!+[]]+([][[]]+[])[+[]]+([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]])[+!+[]+[!+[]+!+[]+!+[]+!+[]]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[!+[]+!+[]+!+[]]+[][(![]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]+(!![]+[])[+[]]][([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(![]+[])[+!+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[!+[]+!+[]]]()[(![]+[])[+!+[]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+([][(![]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]+(!![]+[])[+[]]][([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(![]+[])[+!+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[!+[]+!+[]]]()+[])[!+[]+!+[]]]((![]+[])[+!+[]]+[+[]])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+([][[]]+[])[!+[]+!+[]]+[][(![]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]+(!![]+[])[+[]]][([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(![]+[])[+!+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[!+[]+!+[]]]()[(![]+[])[+!+[]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+([][(![]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]+(!![]+[])[+[]]][([][(![]+[])[+[]]+(![]+[]+[][[]])[+!+[]+[+[]]]+(![]+[])[!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+!+[]]]+[])[!+[]+!+[]+!+[]]+(![]+[])[+!+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[!+[]+!+[]]]()+[])[!+[]+!+[]]]((+(+!+[]+(!+[]+[])[!+[]+!+[]+!+[]]+[+!+[]]+[+[]]+[+[]]+[+[]])+[])[+[]]+(![]+[])[+[]])[+[]])
+ ^
+TypeError: Array.prototype.sort called on null or undefined
+ at sort (native)
+ at *%(basename)s:34:410
diff --git a/test/preparser/non-use-strict-hex-escape.js b/test/message/non-use-strict-hex-escape.js
similarity index 100%
rename from test/preparser/non-use-strict-hex-escape.js
rename to test/message/non-use-strict-hex-escape.js
diff --git a/test/message/non-use-strict-hex-escape.out b/test/message/non-use-strict-hex-escape.out
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/test/message/non-use-strict-hex-escape.out
diff --git a/test/preparser/non-use-strict-octal-escape.js b/test/message/non-use-strict-octal-escape.js
similarity index 100%
rename from test/preparser/non-use-strict-octal-escape.js
rename to test/message/non-use-strict-octal-escape.js
diff --git a/test/message/non-use-strict-octal-escape.out b/test/message/non-use-strict-octal-escape.out
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/test/message/non-use-strict-octal-escape.out
diff --git a/test/preparser/non-use-strict-uhex-escape.js b/test/message/non-use-strict-uhex-escape.js
similarity index 100%
rename from test/preparser/non-use-strict-uhex-escape.js
rename to test/message/non-use-strict-uhex-escape.js
diff --git a/test/message/non-use-strict-uhex-escape.out b/test/message/non-use-strict-uhex-escape.out
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/test/message/non-use-strict-uhex-escape.out
diff --git a/test/preparser/nonstrict-arguments.js b/test/message/nonstrict-arguments.js
similarity index 75%
rename from test/preparser/nonstrict-arguments.js
rename to test/message/nonstrict-arguments.js
index 43c7e2e..e5ce0f9 100644
--- a/test/preparser/nonstrict-arguments.js
+++ b/test/message/nonstrict-arguments.js
@@ -27,24 +27,26 @@
// Eval restrictions should not trigger outside of strict-mode code.
-var arguments = 42;
-arguments = arguments++;
-arguments += --arguments;
-arguments -= ++arguments;
-arguments *= arguments--;
-function arguments(arguments) {};
-try {} catch (arguments) {}
+function foo() {
+ var arguments = 42;
+ arguments = arguments++;
+ arguments += --arguments;
+ arguments -= ++arguments;
+ arguments *= arguments--;
+ function arguments(arguments) {};
+ try {} catch (arguments) {}
-function strict() {
- "use strict";
- // Reading eval and arguments is allowed.
- eval(arguments);
+ function strict() {
+ "use strict";
+ // Reading eval and arguments is allowed.
+ eval(arguments);
+ }
+
+ var arguments = 42;
+ arguments = arguments++;
+ arguments += --arguments;
+ arguments -= ++arguments;
+ arguments *= arguments--;
+ function arguments(arguments) {};
+ try {} catch (arguments) {}
}
-
-var arguments = 42;
-arguments = arguments++;
-arguments += --arguments;
-arguments -= ++arguments;
-arguments *= arguments--;
-function arguments(arguments) {};
-try {} catch (arguments) {}
diff --git a/test/message/nonstrict-arguments.out b/test/message/nonstrict-arguments.out
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/test/message/nonstrict-arguments.out
diff --git a/test/preparser/nonstrict-eval.js b/test/message/nonstrict-eval.js
similarity index 80%
rename from test/preparser/nonstrict-eval.js
rename to test/message/nonstrict-eval.js
index db6feda..13d7903 100644
--- a/test/preparser/nonstrict-eval.js
+++ b/test/message/nonstrict-eval.js
@@ -27,24 +27,26 @@
// Eval restrictions should not trigger outside of strict-mode code.
-var eval = 42;
-eval = eval++;
-eval += --eval;
-eval -= ++eval;
-eval *= eval--;
-function eval(eval) {};
-try {} catch (eval) {}
+function foo() {
+ var eval = 42;
+ eval = eval++;
+ eval += --eval;
+ eval -= ++eval;
+ eval *= eval--;
+ function eval(eval) {};
+ try {} catch (eval) {}
-function strict() {
- "use strict";
- // Reading eval and arguments is allowed.
- eval(arguments);
+ function strict() {
+ "use strict";
+ // Reading eval and arguments is allowed.
+ eval(arguments);
+ }
+
+ var eval = 42;
+ eval = eval++;
+ eval += --eval;
+ eval -= ++eval;
+ eval *= eval--;
+ function eval(eval) {};
+ try {} catch (eval) {}
}
-
-var eval = 42;
-eval = eval++;
-eval += --eval;
-eval -= ++eval;
-eval *= eval--;
-function eval(eval) {};
-try {} catch (eval) {}
diff --git a/test/message/nonstrict-eval.out b/test/message/nonstrict-eval.out
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/test/message/nonstrict-eval.out
diff --git a/test/preparser/nonstrict-with.js b/test/message/nonstrict-with.js
similarity index 91%
rename from test/preparser/nonstrict-with.js
rename to test/message/nonstrict-with.js
index 17f0c93..f6e39c9 100644
--- a/test/preparser/nonstrict-with.js
+++ b/test/message/nonstrict-with.js
@@ -28,13 +28,15 @@
// The with statement is allowed in non-strict code, and even around
// strict code.
-with ({}) {}
+function foo() {
+ with ({}) {}
-with ({x : 42}) {
- var foo = function () {
- "use strict";
- return x;
- };
+ with ({x : 42}) {
+ var foo = function () {
+ "use strict";
+ return x;
+ };
+ }
+
+ with ({}) {}
}
-
-with ({}) {}
diff --git a/test/message/nonstrict-with.out b/test/message/nonstrict-with.out
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/test/message/nonstrict-with.out
diff --git a/test/message/regress/regress-4829-1.js b/test/message/regress/regress-4829-1.js
new file mode 100644
index 0000000..1ad5fed
--- /dev/null
+++ b/test/message/regress/regress-4829-1.js
@@ -0,0 +1,7 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+function tag() {}
+
+tag(tag`\xyy`);
diff --git a/test/message/regress/regress-4829-1.out b/test/message/regress/regress-4829-1.out
new file mode 100644
index 0000000..6b51a8a
--- /dev/null
+++ b/test/message/regress/regress-4829-1.out
@@ -0,0 +1,8 @@
+# Copyright 2016 the V8 project authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+
+*%(basename)s:7: SyntaxError: Invalid hexadecimal escape sequence
+tag(tag`\xyy`);
+ ^^^^
+SyntaxError: Invalid hexadecimal escape sequence
diff --git a/test/message/regress/regress-4829-2.js b/test/message/regress/regress-4829-2.js
new file mode 100644
index 0000000..eadb653
--- /dev/null
+++ b/test/message/regress/regress-4829-2.js
@@ -0,0 +1,7 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+function tag() {}
+
+`${tag`\xyy`}`;
diff --git a/test/message/regress/regress-4829-2.out b/test/message/regress/regress-4829-2.out
new file mode 100644
index 0000000..c8272b4
--- /dev/null
+++ b/test/message/regress/regress-4829-2.out
@@ -0,0 +1,8 @@
+# Copyright 2016 the V8 project authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+
+*%(basename)s:7: SyntaxError: Invalid hexadecimal escape sequence
+`${tag`\xyy`}`;
+ ^^^^
+SyntaxError: Invalid hexadecimal escape sequence
diff --git a/test/preparser/strict-octal-indirect-regexp.js b/test/message/strict-octal-indirect-regexp.js
similarity index 100%
rename from test/preparser/strict-octal-indirect-regexp.js
rename to test/message/strict-octal-indirect-regexp.js
diff --git a/test/message/strict-octal-indirect-regexp.out b/test/message/strict-octal-indirect-regexp.out
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/test/message/strict-octal-indirect-regexp.out
diff --git a/test/preparser/strict-octal-number.js b/test/message/strict-octal-number.js
similarity index 100%
rename from test/preparser/strict-octal-number.js
rename to test/message/strict-octal-number.js
diff --git a/test/message/strict-octal-number.out b/test/message/strict-octal-number.out
new file mode 100644
index 0000000..6873218
--- /dev/null
+++ b/test/message/strict-octal-number.out
@@ -0,0 +1,4 @@
+*%(basename)s:32: SyntaxError: Octal literals are not allowed in strict mode.
+ var x = 012;
+ ^^^
+SyntaxError: Octal literals are not allowed in strict mode.
diff --git a/test/preparser/strict-octal-regexp.js b/test/message/strict-octal-regexp.js
similarity index 100%
rename from test/preparser/strict-octal-regexp.js
rename to test/message/strict-octal-regexp.js
diff --git a/test/message/strict-octal-regexp.out b/test/message/strict-octal-regexp.out
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/test/message/strict-octal-regexp.out
diff --git a/test/preparser/strict-octal-string.js b/test/message/strict-octal-string.js
similarity index 100%
rename from test/preparser/strict-octal-string.js
rename to test/message/strict-octal-string.js
diff --git a/test/message/strict-octal-string.out b/test/message/strict-octal-string.out
new file mode 100644
index 0000000..c46df6b
--- /dev/null
+++ b/test/message/strict-octal-string.out
@@ -0,0 +1,4 @@
+*%(basename)s:32: SyntaxError: Octal literals are not allowed in strict mode.
+ var x = "hello\040world";
+ ^^
+SyntaxError: Octal literals are not allowed in strict mode.
diff --git a/test/preparser/strict-octal-use-strict-after.js b/test/message/strict-octal-use-strict-after.js
similarity index 100%
rename from test/preparser/strict-octal-use-strict-after.js
rename to test/message/strict-octal-use-strict-after.js
diff --git a/test/message/strict-octal-use-strict-after.out b/test/message/strict-octal-use-strict-after.out
new file mode 100644
index 0000000..2a42500
--- /dev/null
+++ b/test/message/strict-octal-use-strict-after.out
@@ -0,0 +1,4 @@
+*%(basename)s:33: SyntaxError: Octal literals are not allowed in strict mode.
+ "use\040strict";
+ ^^
+SyntaxError: Octal literals are not allowed in strict mode.
diff --git a/test/preparser/strict-octal-use-strict-before.js b/test/message/strict-octal-use-strict-before.js
similarity index 100%
rename from test/preparser/strict-octal-use-strict-before.js
rename to test/message/strict-octal-use-strict-before.js
diff --git a/test/message/strict-octal-use-strict-before.out b/test/message/strict-octal-use-strict-before.out
new file mode 100644
index 0000000..cd93e50
--- /dev/null
+++ b/test/message/strict-octal-use-strict-before.out
@@ -0,0 +1,4 @@
+*%(basename)s:32: SyntaxError: Octal literals are not allowed in strict mode.
+ "use\040strict";
+ ^^
+SyntaxError: Octal literals are not allowed in strict mode.
diff --git a/test/preparser/strict-with.js b/test/message/strict-with.js
similarity index 100%
rename from test/preparser/strict-with.js
rename to test/message/strict-with.js
diff --git a/test/message/strict-with.out b/test/message/strict-with.out
new file mode 100644
index 0000000..06e7ed8
--- /dev/null
+++ b/test/message/strict-with.out
@@ -0,0 +1,4 @@
+*%(basename)s:32: SyntaxError: Strict mode code may not include a with statement
+ with ({}) {}
+ ^^^^
+SyntaxError: Strict mode code may not include a with statement
diff --git a/test/message/strong-object-freeze-prop.js b/test/message/strong-object-freeze-prop.js
deleted file mode 100644
index 1725015..0000000
--- a/test/message/strong-object-freeze-prop.js
+++ /dev/null
@@ -1,11 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode
-
-"use strong";
-
-let o = {};
-Object.defineProperty(o, "foo", { writable: true });
-Object.defineProperty(o, "foo", { writable: false });
diff --git a/test/message/strong-object-freeze-prop.out b/test/message/strong-object-freeze-prop.out
deleted file mode 100644
index 0c611c5..0000000
--- a/test/message/strong-object-freeze-prop.out
+++ /dev/null
@@ -1,9 +0,0 @@
-# Copyright 2015 the V8 project authors. All rights reserved.
-# Use of this source code is governed by a BSD-style license that can be
-# found in the LICENSE file.
-*%(basename)s:11: TypeError: On strong object #<Object>, redefining writable, non-configurable property 'foo' to be non-writable is deprecated
-Object.defineProperty(o, "foo", { writable: false });
- ^
-TypeError: On strong object #<Object>, redefining writable, non-configurable property 'foo' to be non-writable is deprecated
- at Function.defineProperty (native)
- at *%(basename)s:11:8
diff --git a/test/message/strong-object-set-proto.out b/test/message/strong-object-set-proto.out
deleted file mode 100644
index bf2c933..0000000
--- a/test/message/strong-object-set-proto.out
+++ /dev/null
@@ -1,9 +0,0 @@
-# Copyright 2015 the V8 project authors. All rights reserved.
-# Use of this source code is governed by a BSD-style license that can be
-# found in the LICENSE file.
-*%(basename)s:9: TypeError: On strong object #<Object>, redefining the internal prototype is deprecated
-({}).__proto__ = {};
- ^
-TypeError: On strong object #<Object>, redefining the internal prototype is deprecated
- at Object.set __proto__ (native)
- at *%(basename)s:9:16
diff --git a/test/message/testcfg.py b/test/message/testcfg.py
index 7c53041..577b476 100644
--- a/test/message/testcfg.py
+++ b/test/message/testcfg.py
@@ -94,7 +94,9 @@
string.find("Native Client module will be loaded") > 0 or
string.find("NaClHostDescOpen:") > 0)
- def IsFailureOutput(self, output, testpath):
+ def IsFailureOutput(self, testcase):
+ output = testcase.output
+ testpath = testcase.path
expected_path = os.path.join(self.root, testpath + ".out")
expected_lines = []
# Can't use utils.ReadLinesFrom() here because it strips whitespace.
diff --git a/test/message/try-catch-lexical-conflict.js b/test/message/try-catch-lexical-conflict.js
index a5db298..48b1a16 100644
--- a/test/message/try-catch-lexical-conflict.js
+++ b/test/message/try-catch-lexical-conflict.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
-// Flags: --harmony-destructuring-bind
+//
"use strict";
try {
diff --git a/test/message/try-catch-variable-conflict.js b/test/message/try-catch-variable-conflict.js
index 6cf04fa..49e120b 100644
--- a/test/message/try-catch-variable-conflict.js
+++ b/test/message/try-catch-variable-conflict.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
-// Flags: --harmony-destructuring-bind
+//
try {
} catch ({x}) {
diff --git a/test/message/unicode-escape-invalid-2.js b/test/message/unicode-escape-invalid-2.js
new file mode 100644
index 0000000..b83665b
--- /dev/null
+++ b/test/message/unicode-escape-invalid-2.js
@@ -0,0 +1,5 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+print("\u162P");
diff --git a/test/message/unicode-escape-invalid-2.out b/test/message/unicode-escape-invalid-2.out
new file mode 100644
index 0000000..423e79d
--- /dev/null
+++ b/test/message/unicode-escape-invalid-2.out
@@ -0,0 +1,8 @@
+# Copyright 2016 the V8 project authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+
+*%(basename)s:5: SyntaxError: Invalid Unicode escape sequence
+print("\u162P");
+ ^^^^^^
+SyntaxError: Invalid Unicode escape sequence
diff --git a/test/message/unicode-escape-invalid.js b/test/message/unicode-escape-invalid.js
new file mode 100644
index 0000000..5378acf
--- /dev/null
+++ b/test/message/unicode-escape-invalid.js
@@ -0,0 +1,5 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+print("\u{FFYZ}");
diff --git a/test/message/unicode-escape-invalid.out b/test/message/unicode-escape-invalid.out
new file mode 100644
index 0000000..2bdd538
--- /dev/null
+++ b/test/message/unicode-escape-invalid.out
@@ -0,0 +1,8 @@
+# Copyright 2016 the V8 project authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+
+*%(basename)s:5: SyntaxError: Invalid Unicode escape sequence
+print("\u{FFYZ}");
+ ^
+SyntaxError: Invalid Unicode escape sequence
diff --git a/test/message/unicode-escape-undefined.js b/test/message/unicode-escape-undefined.js
new file mode 100644
index 0000000..49de2fb
--- /dev/null
+++ b/test/message/unicode-escape-undefined.js
@@ -0,0 +1,5 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+print("\u{110000}");
diff --git a/test/message/unicode-escape-undefined.out b/test/message/unicode-escape-undefined.out
new file mode 100644
index 0000000..9b0483c
--- /dev/null
+++ b/test/message/unicode-escape-undefined.out
@@ -0,0 +1,8 @@
+# Copyright 2016 the V8 project authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+
+*%(basename)s:5: SyntaxError: Undefined Unicode code-point
+print("\u{110000}");
+ ^^^^^^^^^
+SyntaxError: Undefined Unicode code-point
\ No newline at end of file
diff --git a/test/message/yield-in-arrow-param.js b/test/message/yield-in-arrow-param.js
new file mode 100644
index 0000000..c815fe7
--- /dev/null
+++ b/test/message/yield-in-arrow-param.js
@@ -0,0 +1,5 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+function* g() { (a = yield) => {} }
diff --git a/test/message/yield-in-arrow-param.out b/test/message/yield-in-arrow-param.out
new file mode 100644
index 0000000..8eeb0df
--- /dev/null
+++ b/test/message/yield-in-arrow-param.out
@@ -0,0 +1,4 @@
+*%(basename)s:5: SyntaxError: Yield expression not allowed in formal parameter
+function* g() { (a = yield) => {} }
+ ^^^^^
+SyntaxError: Yield expression not allowed in formal parameter
diff --git a/test/message/strong-object-set-proto.js b/test/message/yield-in-generator-param.js
similarity index 73%
rename from test/message/strong-object-set-proto.js
rename to test/message/yield-in-generator-param.js
index 890dd84..1a8f842 100644
--- a/test/message/strong-object-set-proto.js
+++ b/test/message/yield-in-generator-param.js
@@ -2,8 +2,4 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --strong-mode
-
-"use strong";
-
-({}).__proto__ = {};
+function* g(a = yield) {}
diff --git a/test/message/yield-in-generator-param.out b/test/message/yield-in-generator-param.out
new file mode 100644
index 0000000..ec46f47
--- /dev/null
+++ b/test/message/yield-in-generator-param.out
@@ -0,0 +1,4 @@
+*%(basename)s:5: SyntaxError: Yield expression not allowed in formal parameter
+function* g(a = yield) {}
+ ^^^^^
+SyntaxError: Yield expression not allowed in formal parameter
diff --git a/test/mjsunit/allocation-site-info.js b/test/mjsunit/allocation-site-info.js
index 9984f5b..8325ab7 100644
--- a/test/mjsunit/allocation-site-info.js
+++ b/test/mjsunit/allocation-site-info.js
@@ -317,6 +317,9 @@
}
var realmBArray = Realm.eval(realmB, "Array");
+// Two calls with Array because ES6 instanceof desugars into a load of Array,
+// and load has a premonomorphic state.
+instanceof_check(Array);
instanceof_check(Array);
instanceof_check(realmBArray);
@@ -327,6 +330,10 @@
// It'll go (uninit->realmBArray) then (realmBArray->megamorphic). Recognize
// that state "Array" implies an AllocationSite is present, and code is
// configured to use it.
+
+// Two calls with realmBArray because ES6 instanceof desugars into a load of
+// realmBArray, and load has a premonomorphic state.
+instanceof_check2(realmBArray);
instanceof_check2(realmBArray);
instanceof_check2(Array);
@@ -467,3 +474,19 @@
assertKind(elements_kind.fast_double, obj[0]);
assertKind(elements_kind.fast, obj[1][0]);
})();
+
+// Test gathering allocation site feedback for generic ics.
+(function() {
+ function make() { return new Array(); }
+ function foo(a, i) { a[0] = i; }
+
+ var a = make();
+ assertKind(elements_kind.fast_smi_only, a);
+
+ // Make the keyed store ic go generic.
+ foo("howdy", 1);
+ foo(a, 3.5);
+
+ var b = make();
+ assertKind(elements_kind.fast_double, b);
+})();
diff --git a/test/mjsunit/array-foreach.js b/test/mjsunit/array-foreach.js
new file mode 100644
index 0000000..0e34c03
--- /dev/null
+++ b/test/mjsunit/array-foreach.js
@@ -0,0 +1,17 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+var a = [20, 21, 22, 23];
+a.__proto__ = [10, 11, 12, 13];
+
+var values = [];
+var indices = [];
+function callback(value, index, object) {
+ object.length = 2;
+ values.push(value);
+ indices.push(index);
+}
+a.forEach(callback);
+assertEquals([20, 21, 12, 13], values);
+assertEquals([0, 1, 2, 3], indices);
diff --git a/test/mjsunit/array-isarray.js b/test/mjsunit/array-isarray.js
index a21b1e1..6b0d885 100644
--- a/test/mjsunit/array-isarray.js
+++ b/test/mjsunit/array-isarray.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies
-
assertTrue(Array.isArray([]));
assertFalse(Array.isArray({}));
diff --git a/test/mjsunit/array-join.js b/test/mjsunit/array-join.js
index c08c182..0c949e7 100644
--- a/test/mjsunit/array-join.js
+++ b/test/mjsunit/array-join.js
@@ -91,3 +91,16 @@
a[5] = "ab";
a[90000] = "cd";
assertEquals("abcd", a.join("")); // Must not throw.
+
+
+// Make sure that each element is accessed exactly once, and in the correct
+// order.
+{
+ var log = [];
+ var p = new Proxy({length: 3, 0: 'a', 1: 'b'}, {
+ get: function(t, k, r) { log.push(k); return Reflect.get(t, k, r); }
+ });
+
+ assertEquals("a,b,", Array.prototype.join.call(p));
+ assertEquals(["length", "0", "1", "2"], log);
+}
diff --git a/test/mjsunit/array-natives-elements.js b/test/mjsunit/array-natives-elements.js
index bf884fc..9898faa 100644
--- a/test/mjsunit/array-natives-elements.js
+++ b/test/mjsunit/array-natives-elements.js
@@ -30,6 +30,16 @@
// IC and Crankshaft support for smi-only elements in dynamic array literals.
function get(foo) { return foo; } // Used to generate dynamic values.
+// This code exists to eliminate the learning influence of AllocationSites
+// on the following tests.
+function make_array_string(literal) {
+ this.__sequence = this.__sequence + 1;
+ return "/* " + this.__sequence + " */ " + literal;
+}
+function make_array(literal) {
+ return eval(make_array_string(literal));
+}
+
var __sequence = 0;
function array_natives_test() {
@@ -40,16 +50,6 @@
assertTrue(%HasFastDoubleElements([1.1]));
assertTrue(%HasFastDoubleElements([1.1,2]));
- // This code exists to eliminate the learning influence of AllocationSites
- // on the following tests.
- function make_array_string(literal) {
- this.__sequence = this.__sequence + 1;
- return "/* " + this.__sequence + " */ " + literal;
- }
- function make_array(literal) {
- return eval(make_array_string(literal));
- }
-
// Push
var a0 = make_array("[1, 2, 3]");
assertTrue(%HasFastSmiElements(a0));
diff --git a/test/mjsunit/asm/atomics-add.js b/test/mjsunit/asm/atomics-add.js
index 9a07ecf..abb7c98 100644
--- a/test/mjsunit/asm/atomics-add.js
+++ b/test/mjsunit/asm/atomics-add.js
@@ -78,8 +78,8 @@
assertEquals(10, f(0, 10), name);
assertEquals(20, ta[0]);
// out of bounds
- assertEquals(0, f(-1, 0), name);
- assertEquals(0, f(ta.length, 0), name);
+ assertThrows(function() { f(-1, 0); });
+ assertThrows(function() { f(ta.length, 0); });
}
function testElement(m, offset) {
diff --git a/test/mjsunit/asm/atomics-and.js b/test/mjsunit/asm/atomics-and.js
index 2e7de75..da770bf 100644
--- a/test/mjsunit/asm/atomics-and.js
+++ b/test/mjsunit/asm/atomics-and.js
@@ -79,8 +79,8 @@
assertEquals(0xf, f(0, 0x19), name);
assertEquals(0x9, ta[0]);
// out of bounds
- assertEquals(0, f(-1, 0), name);
- assertEquals(0, f(ta.length, 0), name);
+ assertThrows(function() { f(-1, 0); });
+ assertThrows(function() { f(ta.length, 0); });
}
function testElement(m, offset) {
diff --git a/test/mjsunit/asm/atomics-compareexchange.js b/test/mjsunit/asm/atomics-compareexchange.js
index 84d3850..dd93395 100644
--- a/test/mjsunit/asm/atomics-compareexchange.js
+++ b/test/mjsunit/asm/atomics-compareexchange.js
@@ -86,8 +86,8 @@
assertEquals(50, f(0, 0, 100), name);
assertEquals(50, ta[0]);
// out of bounds
- assertEquals(oobValue, f(-1, 0, 0), name);
- assertEquals(oobValue, f(ta.length, 0, 0), name);
+ assertThrows(function() { f(-1, 0, 0); });
+ assertThrows(function() { f(ta.length, 0, 0); });
}
function testElement(m, offset) {
diff --git a/test/mjsunit/asm/atomics-exchange.js b/test/mjsunit/asm/atomics-exchange.js
index 6de7b4b..ea9c246 100644
--- a/test/mjsunit/asm/atomics-exchange.js
+++ b/test/mjsunit/asm/atomics-exchange.js
@@ -80,8 +80,8 @@
assertEquals(0x7f, f(0, 0xf), name);
assertEquals(0xf, ta[0]);
// out of bounds
- assertEquals(0, f(-1, 0), name);
- assertEquals(0, f(ta.length, 0), name);
+ assertThrows(function() { f(-1, 0); });
+ assertThrows(function() { f(ta.length, 0); });
}
function testElement(m, offset) {
diff --git a/test/mjsunit/asm/atomics-load.js b/test/mjsunit/asm/atomics-load.js
index 3e1d19f..9a61a23 100644
--- a/test/mjsunit/asm/atomics-load.js
+++ b/test/mjsunit/asm/atomics-load.js
@@ -62,7 +62,7 @@
}
}
-function testElementType(taConstr, f, oobValue, offset) {
+function testElementType(taConstr, f, offset) {
clearArray();
var ta = new taConstr(sab, offset);
@@ -71,17 +71,17 @@
assertEquals(10, f(0), name);
assertEquals(0, f(1), name);
// out of bounds
- assertEquals(oobValue, f(-1), name);
- assertEquals(oobValue, f(ta.length), name);
+ assertThrows(function() { f(-1); });
+ assertThrows(function() { f(ta.length); });
}
function testElement(m, offset) {
- testElementType(Int8Array, m.loadi8, 0, offset);
- testElementType(Int16Array, m.loadi16, 0, offset);
- testElementType(Int32Array, m.loadi32, 0, offset);
- testElementType(Uint8Array, m.loadu8, 0, offset);
- testElementType(Uint16Array, m.loadu16, 0, offset);
- testElementType(Uint32Array, m.loadu32, 0, offset);
+ testElementType(Int8Array, m.loadi8, offset);
+ testElementType(Int16Array, m.loadi16, offset);
+ testElementType(Int32Array, m.loadi32, offset);
+ testElementType(Uint8Array, m.loadu8, offset);
+ testElementType(Uint16Array, m.loadu16, offset);
+ testElementType(Uint32Array, m.loadu32, offset);
}
var offset = 0;
diff --git a/test/mjsunit/asm/atomics-or.js b/test/mjsunit/asm/atomics-or.js
index 7431e35..351ce9d 100644
--- a/test/mjsunit/asm/atomics-or.js
+++ b/test/mjsunit/asm/atomics-or.js
@@ -81,8 +81,8 @@
assertEquals(0xf, f(0, 0x11), name);
assertEquals(0x1f, ta[0]);
// out of bounds
- assertEquals(0, f(-1, 0), name);
- assertEquals(0, f(ta.length, 0), name);
+ assertThrows(function() { f(-1, 0); });
+ assertThrows(function() { f(ta.length, 0); });
}
function testElement(m, offset) {
diff --git a/test/mjsunit/asm/atomics-store.js b/test/mjsunit/asm/atomics-store.js
index dab83af..8b9e4c6 100644
--- a/test/mjsunit/asm/atomics-store.js
+++ b/test/mjsunit/asm/atomics-store.js
@@ -68,7 +68,7 @@
}
}
-function testElementType(taConstr, f, oobValue, offset) {
+function testElementType(taConstr, f, offset) {
clearArray();
var ta = new taConstr(sab, offset);
@@ -76,17 +76,17 @@
assertEquals(10, f(0, 10), name);
assertEquals(10, ta[0]);
// out of bounds
- assertEquals(oobValue, f(-1, 0), name);
- assertEquals(oobValue, f(ta.length, 0), name);
+ assertThrows(function() { f(-1, 0); });
+ assertThrows(function() { f(ta.length, 0); });
}
function testElement(m, offset) {
- testElementType(Int8Array, m.storei8, 0, offset);
- testElementType(Int16Array, m.storei16, 0, offset);
- testElementType(Int32Array, m.storei32, 0, offset);
- testElementType(Uint8Array, m.storeu8, 0, offset);
- testElementType(Uint16Array, m.storeu16, 0, offset);
- testElementType(Uint32Array, m.storeu32, 0, offset);
+ testElementType(Int8Array, m.storei8, offset);
+ testElementType(Int16Array, m.storei16, offset);
+ testElementType(Int32Array, m.storei32, offset);
+ testElementType(Uint8Array, m.storeu8, offset);
+ testElementType(Uint16Array, m.storeu16, offset);
+ testElementType(Uint32Array, m.storeu32, offset);
}
var offset = 0;
diff --git a/test/mjsunit/asm/atomics-sub.js b/test/mjsunit/asm/atomics-sub.js
index 2ad97e4..6789aed 100644
--- a/test/mjsunit/asm/atomics-sub.js
+++ b/test/mjsunit/asm/atomics-sub.js
@@ -79,8 +79,8 @@
assertEquals(20, f(0, 10), name);
assertEquals(10, ta[0]);
// out of bounds
- assertEquals(0, f(-1, 0), name);
- assertEquals(0, f(ta.length, 0), name);
+ assertThrows(function() { f(-1, 0); });
+ assertThrows(function() { f(ta.length, 0); });
}
function testElement(m, offset) {
diff --git a/test/mjsunit/asm/atomics-xor.js b/test/mjsunit/asm/atomics-xor.js
index 990f842..13c6440 100644
--- a/test/mjsunit/asm/atomics-xor.js
+++ b/test/mjsunit/asm/atomics-xor.js
@@ -78,8 +78,8 @@
assertEquals(0xf, f(0, 0x11), name);
assertEquals(0x1e, ta[0]);
// out of bounds
- assertEquals(0, f(-1, 0), name);
- assertEquals(0, f(ta.length, 0), name);
+ assertThrows(function() { f(-1, 0); });
+ assertThrows(function() { f(ta.length, 0); });
}
function testElement(m, offset) {
diff --git a/test/mjsunit/asm/math-clz32.js b/test/mjsunit/asm/math-clz32.js
index 5a3aa20..42dcf46 100644
--- a/test/mjsunit/asm/math-clz32.js
+++ b/test/mjsunit/asm/math-clz32.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --allow-natives-syntax
-
var stdlib = { Math: Math };
var f = (function Module(stdlib) {
@@ -26,6 +24,5 @@
assertEquals(i, f((-1) >>> i));
}
for (var i = -2147483648; i < 2147483648; i += 3999773) {
- assertEquals(%MathClz32(i), f(i));
- assertEquals(%MathClz32(i), %_MathClz32(i >>> 0));
+ assertEquals(Math.clz32(i), f(i));
}
diff --git a/test/mjsunit/assert-opt-and-deopt.js b/test/mjsunit/assert-opt-and-deopt.js
index e9aba1d..19502f3 100644
--- a/test/mjsunit/assert-opt-and-deopt.js
+++ b/test/mjsunit/assert-opt-and-deopt.js
@@ -26,7 +26,7 @@
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
// Flags: --allow-natives-syntax
-// Flags: --noconcurrent-recompilation --noconcurrent-osr
+// Flags: --noconcurrent-recompilation
if (%IsConcurrentRecompilationSupported()) {
print("Concurrent recompilation is turned on after all. Skipping this test.");
diff --git a/test/mjsunit/call-intrinsic-type-error.js b/test/mjsunit/call-intrinsic-type-error.js
new file mode 100644
index 0000000..9d58697
--- /dev/null
+++ b/test/mjsunit/call-intrinsic-type-error.js
@@ -0,0 +1,11 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+try {
+ %Call(1, 0);
+} catch (e) {
+ assertTrue(e instanceof TypeError);
+}
diff --git a/test/mjsunit/compare-known-objects-tostringtag.js b/test/mjsunit/compare-known-objects-tostringtag.js
index 81544ca..4eacc8a 100644
--- a/test/mjsunit/compare-known-objects-tostringtag.js
+++ b/test/mjsunit/compare-known-objects-tostringtag.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --allow-natives-syntax --harmony-tostring
+// Flags: --allow-natives-syntax
function le(a, b) {
return a <= b;
diff --git a/test/mjsunit/compiler/deopt-materialize-accumulator.js b/test/mjsunit/compiler/deopt-materialize-accumulator.js
index c80e329..217de76 100644
--- a/test/mjsunit/compiler/deopt-materialize-accumulator.js
+++ b/test/mjsunit/compiler/deopt-materialize-accumulator.js
@@ -34,7 +34,7 @@
function f(a) {
// This will trigger a deopt since global was previously a SMI, with the
// accumulator holding an unboxed double which needs materialized.
- global = %_MathSqrt(a);
+ global = %math_sqrt(a);
}
%OptimizeFunctionOnNextCall(f);
f(0.25);
diff --git a/test/mjsunit/compiler/optimized-for-in.js b/test/mjsunit/compiler/optimized-for-in.js
index d93344e..9f5e4e7 100644
--- a/test/mjsunit/compiler/optimized-for-in.js
+++ b/test/mjsunit/compiler/optimized-for-in.js
@@ -25,7 +25,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --allow-natives-syntax --no-concurrent-osr
+// Flags: --allow-natives-syntax
// Test for-in support in Crankshaft. For simplicity this tests assumes certain
// fixed iteration order for properties and will have to be adjusted if V8
diff --git a/test/mjsunit/compiler/regress-600593.js b/test/mjsunit/compiler/regress-600593.js
new file mode 100644
index 0000000..c93f2ab
--- /dev/null
+++ b/test/mjsunit/compiler/regress-600593.js
@@ -0,0 +1,21 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+"use strict"
+
+function f(c) {
+ if (c) { throw new Error(); }
+ throw new Error();
+};
+
+function Error() {
+ return arguments.length;
+}
+
+assertThrows(function() { f(true); });
+assertThrows(function() { f(false); });
+%OptimizeFunctionOnNextCall(f);
+assertThrows(function() { f(true); });
diff --git a/test/mjsunit/compiler/regress-96989.js b/test/mjsunit/compiler/regress-96989.js
deleted file mode 100644
index 85beaed..0000000
--- a/test/mjsunit/compiler/regress-96989.js
+++ /dev/null
@@ -1,43 +0,0 @@
-// Copyright 2011 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-
-// Flags: --allow-natives-syntax --legacy-const
-
-// Test correct handling of uninitialized const.
-
-function test() {
- for (var i = 41; i < 42; i++) {
- var c = t ^ i;
- }
- const t;
- return c;
-}
-
-for (var i=0; i<10; i++) test();
-%OptimizeFunctionOnNextCall(test);
-assertEquals(41, test());
diff --git a/test/mjsunit/compiler/regress-const.js b/test/mjsunit/compiler/regress-const.js
index 89b559c..5099c2f 100644
--- a/test/mjsunit/compiler/regress-const.js
+++ b/test/mjsunit/compiler/regress-const.js
@@ -25,7 +25,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --allow-natives-syntax --legacy-const
+// Flags: --allow-natives-syntax
// Test const initialization and assignments.
function f() {
@@ -38,7 +38,6 @@
function g() {
const x = 42;
- x += 1;
return x;
}
@@ -50,7 +49,7 @@
%OptimizeFunctionOnNextCall(f);
%OptimizeFunctionOnNextCall(g);
-assertEquals(42, f());
+assertEquals(1, f());
assertEquals(42, g());
diff --git a/test/mjsunit/const-declaration.js b/test/mjsunit/const-declaration.js
deleted file mode 100644
index 42d03d5..0000000
--- a/test/mjsunit/const-declaration.js
+++ /dev/null
@@ -1,173 +0,0 @@
-// Copyright 2009 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// Flags: --legacy-const
-
-// Test handling of const variables in various settings.
-
-(function () {
- function f() {
- function g() {
- x = 42; // should be ignored
- return x; // force x into context
- }
- x = 43; // should be ignored
- assertEquals(undefined, g());
- x = 44; // should be ignored
- const x = 0;
- x = 45; // should be ignored
- assertEquals(0, g());
- }
- f();
-})();
-
-
-(function () {
- function f() {
- function g() {
- with ({foo: 0}) {
- x = 42; // should be ignored
- return x; // force x into context
- }
- }
- x = 43; // should be ignored
- assertEquals(undefined, g());
- x = 44; // should be ignored
- const x = 0;
- x = 45; // should be ignored
- assertEquals(0, g());
- }
- f();
-})();
-
-
-(function () {
- function f() {
- function g(s) {
- eval(s);
- return x; // force x into context
- }
- x = 43; // should be ignored
- assertEquals(undefined, g("x = 42;"));
- x = 44; // should be ignored
- const x = 0;
- x = 45; // should be ignored
- assertEquals(0, g("x = 46;"));
- }
- f();
-})();
-
-
-(function () {
- function f() {
- function g(s) {
- with ({foo: 0}) {
- eval(s);
- return x; // force x into context
- }
- }
- x = 43; // should be ignored
- assertEquals(undefined, g("x = 42;"));
- x = 44; // should be ignored
- const x = 0;
- x = 45; // should be ignored
- assertEquals(0, g("x = 46;"));
- }
- f();
-})();
-
-
-(function () {
- function f(s) {
- function g() {
- x = 42; // assign to global x, or to const x
- return x;
- }
- x = 43; // declare global x
- assertEquals(42, g());
- x = 44; // assign to global x
- eval(s);
- x = 45; // should be ignored (assign to const x)
- assertEquals(0, g());
- }
- f("const x = 0;");
-})();
-
-
-(function () {
- function f(s) {
- function g() {
- with ({foo: 0}) {
- x = 42; // assign to global x, or to const x
- return x;
- }
- }
- x = 43; // declare global x
- assertEquals(42, g());
- x = 44; // assign to global x
- eval(s);
- x = 45; // should be ignored (assign to const x)
- assertEquals(0, g());
- }
- f("const x = 0;");
-})();
-
-
-(function () {
- function f(s) {
- function g(s) {
- eval(s);
- return x;
- }
- x = 43; // declare global x
- assertEquals(42, g("x = 42;"));
- x = 44; // assign to global x
- eval(s);
- x = 45; // should be ignored (assign to const x)
- assertEquals(0, g("x = 46;"));
- }
- f("const x = 0;");
-})();
-
-
-(function () {
- function f(s) {
- function g(s) {
- with ({foo: 0}) {
- eval(s);
- return x;
- }
- }
- x = 43; // declare global x
- assertEquals(42, g("x = 42;"));
- x = 44; // assign to global x
- eval(s);
- x = 45; // should be ignored (assign to const x)
- assertEquals(0, g("x = 46;"));
- }
- f("const x = 0;");
-})();
diff --git a/test/mjsunit/const-eval-init.js b/test/mjsunit/const-eval-init.js
deleted file mode 100644
index a7e1fef..0000000
--- a/test/mjsunit/const-eval-init.js
+++ /dev/null
@@ -1,118 +0,0 @@
-// Copyright 2009 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// Flags: --allow-natives-syntax --legacy-const
-
-// Test the handling of initialization of deleted const variables.
-// This only makes sense in local scopes since the declaration and
-// initialization of consts in the global scope happen at the same
-// time.
-
-function testIntroduceGlobal() {
- var source =
- // Deleting 'x' removes the local const property.
- "delete x;" +
- // Initialization redefines global 'x'.
- "const x = 3; assertEquals(3, x);" +
- // Test constness of the global 'x'.
- "x = 4; assertEquals(3, x);";
- eval(source);
-}
-
-testIntroduceGlobal();
-assertEquals("undefined", typeof x);
-
-function testAssignExistingGlobal() {
- var source =
- // Delete 'x' to remove the local const property.
- "delete x;" +
- // Initialization redefines global 'x'.
- "const x = 5; assertEquals(5, x);" +
- // Test constness of the global 'x'.
- "x = 6; assertEquals(5, x);";
- eval(source);
-}
-
-testAssignExistingGlobal();
-assertEquals("undefined", typeof x);
-
-function testAssignmentArgument(x) {
- function local() {
- var source = "delete x; const x = 7; assertEquals(7, x)";
- eval(source);
- }
- local();
- assertEquals("undefined", typeof x);
-}
-
-for (var i = 0; i < 5; i++) {
- testAssignmentArgument();
-}
-%OptimizeFunctionOnNextCall(testAssignmentArgument);
-testAssignmentArgument();
-assertEquals("undefined", typeof x);
-
-__defineSetter__('x', function() { throw 42; });
-var finished = false;
-function testRedefineGlobal() {
- // Initialization redefines global 'x'.
- var source = "delete x; const x = 8; finished = true;";
- eval(source);
-}
-
-testRedefineGlobal();
-assertTrue(finished);
-
-function testInitFastCaseExtension() {
- var source = "const x = 9; assertEquals(9, x); x = 10; assertEquals(9, x)";
- eval(source);
-}
-
-testInitFastCaseExtension();
-
-function testInitSlowCaseExtension() {
- var source = "";
- // Introduce 100 properties on the context extension object to force
- // it in slow case.
- for (var i = 0; i < 100; i++) source += ("var a" + i + " = " + i + ";");
- source += "const x = 10; assertEquals(10, x); x = 11; assertEquals(10, x)";
- eval(source);
-}
-
-testInitSlowCaseExtension();
-
-function testAssignSurroundingContextSlot() {
- var x = 12;
- function local() {
- var source = "delete x; const x = 13; assertEquals(13, x)";
- eval(source);
- }
- local();
- assertEquals(12, x);
-}
-
-testAssignSurroundingContextSlot();
diff --git a/test/mjsunit/const-redecl.js b/test/mjsunit/const-redecl.js
deleted file mode 100644
index ba72930..0000000
--- a/test/mjsunit/const-redecl.js
+++ /dev/null
@@ -1,228 +0,0 @@
-// Copyright 2008 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// Flags: --legacy-const
-
-// Test for const semantics.
-
-
-function CheckException(e) {
- var string = e.toString();
- var index = string.indexOf(':');
- assertTrue(index >= 0);
- var name = string.slice(0, index);
- assertTrue(string.indexOf("has already been declared") >= 0 ||
- string.indexOf("redeclaration") >= 0);
- if (name == 'SyntaxError') return 'TypeError';
- return name;
-}
-
-
-function TestLocal(s,e) {
- try {
- return eval("(function(){" + s + ";return " + e + "})")();
- } catch (x) {
- return CheckException(x);
- }
-}
-
-
-function TestContext(s,e) {
- try {
- // Use a with-statement to force the system to do dynamic
- // declarations of the introduced variables or constants.
- with ({}) {
- return eval(s + ";" + e);
- }
- } catch (x) {
- return CheckException(x);
- }
-}
-
-
-function TestAll(expected,s,opt_e) {
- var e = "";
- var msg = s;
- if (opt_e) { e = opt_e; msg += "; " + opt_e; }
- assertEquals(expected, TestLocal(s,e), "local:'" + msg + "'");
- assertEquals(expected, TestContext(s,e), "context:'" + msg + "'");
-}
-
-
-function TestConflict(def0, def1) {
- // No eval.
- TestAll("TypeError", def0 +'; ' + def1);
- // Eval everything.
- TestAll("TypeError", 'eval("' + def0 + '; ' + def1 + '")');
- // Eval first definition.
- TestAll("TypeError", 'eval("' + def0 +'"); ' + def1);
- // Eval second definition.
- TestAll("TypeError", def0 + '; eval("' + def1 +'")');
- // Eval both definitions separately.
- TestAll("TypeError", 'eval("' + def0 +'"); eval("' + def1 + '")');
-}
-
-
-// Test conflicting definitions.
-TestConflict("const x", "var x");
-TestConflict("const x = 0", "var x");
-TestConflict("const x", "var x = 0");
-TestConflict("const x = 0", "var x = 0");
-
-TestConflict("var x", "const x");
-TestConflict("var x = 0", "const x");
-TestConflict("var x", "const x = 0");
-TestConflict("var x = 0", "const x = 0");
-
-TestConflict("const x = undefined", "var x");
-TestConflict("const x", "var x = undefined");
-TestConflict("const x = undefined", "var x = undefined");
-
-TestConflict("var x = undefined", "const x");
-TestConflict("var x", "const x = undefined");
-TestConflict("var x = undefined", "const x = undefined");
-
-TestConflict("const x = undefined", "var x = 0");
-TestConflict("const x = 0", "var x = undefined");
-
-TestConflict("var x = undefined", "const x = 0");
-TestConflict("var x = 0", "const x = undefined");
-
-TestConflict("const x", "function x() { }");
-TestConflict("const x = 0", "function x() { }");
-TestConflict("const x = undefined", "function x() { }");
-
-TestConflict("function x() { }", "const x");
-TestConflict("function x() { }", "const x = 0");
-TestConflict("function x() { }", "const x = undefined");
-
-TestConflict("const x, y", "var x");
-TestConflict("const x, y", "var y");
-TestConflict("const x = 0, y", "var x");
-TestConflict("const x = 0, y", "var y");
-TestConflict("const x, y = 0", "var x");
-TestConflict("const x, y = 0", "var y");
-TestConflict("const x = 0, y = 0", "var x");
-TestConflict("const x = 0, y = 0", "var y");
-
-TestConflict("var x", "const x, y");
-TestConflict("var y", "const x, y");
-TestConflict("var x", "const x = 0, y");
-TestConflict("var y", "const x = 0, y");
-TestConflict("var x", "const x, y = 0");
-TestConflict("var y", "const x, y = 0");
-TestConflict("var x", "const x = 0, y = 0");
-TestConflict("var y", "const x = 0, y = 0");
-
-
-// Test that multiple conflicts do not cause issues.
-TestConflict("var x, y", "const x, y");
-
-
-// Test that repeated const declarations throw redeclaration errors.
-TestConflict("const x", "const x");
-TestConflict("const x = 0", "const x");
-TestConflict("const x", "const x = 0");
-TestConflict("const x = 0", "const x = 0");
-
-TestConflict("const x = undefined", "const x");
-TestConflict("const x", "const x = undefined");
-TestConflict("const x = undefined", "const x = undefined");
-
-TestConflict("const x = undefined", "const x = 0");
-TestConflict("const x = 0", "const x = undefined");
-
-TestConflict("const x, y", "const x");
-TestConflict("const x, y", "const y");
-TestConflict("const x = 0, y", "const x");
-TestConflict("const x = 0, y", "const y");
-TestConflict("const x, y = 0", "const x");
-TestConflict("const x, y = 0", "const y");
-TestConflict("const x = 0, y = 0", "const x");
-TestConflict("const x = 0, y = 0", "const y");
-
-TestConflict("const x", "const x, y");
-TestConflict("const y", "const x, y");
-TestConflict("const x", "const x = 0, y");
-TestConflict("const y", "const x = 0, y");
-TestConflict("const x", "const x, y = 0");
-TestConflict("const y", "const x, y = 0");
-TestConflict("const x", "const x = 0, y = 0");
-TestConflict("const y", "const x = 0, y = 0");
-
-
-// Test that multiple const conflicts do not cause issues.
-TestConflict("const x, y", "const x, y");
-
-
-// Test that const inside loop behaves correctly.
-var loop = "for (var i = 0; i < 3; i++) { const x = i; }";
-TestAll(0, loop, "x");
-TestAll(0, "var a,b,c,d,e,f,g,h; " + loop, "x");
-
-
-// Test that const inside with behaves correctly.
-TestAll(87, "with ({x:42}) { const x = 87; }", "x");
-TestAll(undefined, "with ({x:42}) { const x; }", "x");
-
-
-// Additional tests for how various combinations of re-declarations affect
-// the values of the var/const in question.
-try {
- eval("var undefined;");
-} catch (ex) {
- assertUnreachable("undefined (1) has thrown");
-}
-
-var original_undef = undefined;
-var undefined = 1; // Should be silently ignored.
-assertEquals(original_undef, undefined, "undefined got overwritten");
-undefined = original_undef;
-
-const e = 1; eval('var e = 2');
-assertEquals(1, e, "e has wrong value");
-
-const h; eval('var h = 1');
-assertEquals(undefined, h, "h has wrong value");
-
-eval("Object.defineProperty(this, 'i', { writable: true });"
- + "const i = 7;"
- + "assertEquals(7, i, \"i has wrong value\");");
-
-var global = this;
-Object.defineProperty(global, 'j', { value: 100, writable: true });
-assertEquals(100, j);
-// The const declaration stays configurable, so the declaration above goes
-// through even though the const declaration is hoisted above.
-const j = 2;
-assertEquals(2, j, "j has wrong value");
-
-var k = 1;
-try { eval('const k'); } catch(e) { }
-assertEquals(1, k, "k has wrong value");
-try { eval('const k = 10'); } catch(e) { }
-assertEquals(1, k, "k has wrong value");
diff --git a/test/mjsunit/const.js b/test/mjsunit/const.js
deleted file mode 100644
index f00932f..0000000
--- a/test/mjsunit/const.js
+++ /dev/null
@@ -1,72 +0,0 @@
-// Copyright 2008 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// Flags: --legacy-const
-
-// Test const properties and pre/postfix operation.
-function f() {
- const x = 1;
- x++;
- assertEquals(1, x);
- x--;
- assertEquals(1, x);
- ++x;
- assertEquals(1, x);
- --x;
- assertEquals(1, x);
- assertEquals(1, x++);
- assertEquals(1, x--);
- assertEquals(2, ++x);
- assertEquals(0, --x);
-}
-
-f();
-
-// Test that the value is read eventhough assignment is disallowed.
-// Spidermonkey does not do this, but it seems like the right thing to
-// do so that 'o++' is equivalent to 'o = o + 1'.
-var valueOfCount = 0;
-
-function g() {
- const o = { valueOf: function() { valueOfCount++; return 42; } };
- assertEquals(42, +o);
- assertEquals(1, valueOfCount);
- o++;
- assertEquals(42, +o);
- assertEquals(3, valueOfCount);
- ++o;
- assertEquals(42, +o);
- assertEquals(5, valueOfCount);
- o--;
- assertEquals(42, +o);
- assertEquals(7, valueOfCount);
- --o;
- assertEquals(42, +o);
- assertEquals(9, valueOfCount);
-}
-
-g();
diff --git a/test/mjsunit/constant-folding.js b/test/mjsunit/constant-folding.js
index 148928a..d6ac9fe 100644
--- a/test/mjsunit/constant-folding.js
+++ b/test/mjsunit/constant-folding.js
@@ -29,8 +29,6 @@
// The code generator now handles compile-time constants specially.
// Test the code generated when operands are known at compile time
-// Flags: --legacy-const
-
// Test count operations involving constants
function test_count() {
var x = "foo";
@@ -69,11 +67,6 @@
z = y;
y++;
assertEquals(z, 20);
-
- const w = 30;
- assertEquals(w++, 30);
- assertEquals(++w, 31);
- assertEquals(++w, 31);
}
test_count();
diff --git a/test/mjsunit/debug-backtrace.js b/test/mjsunit/debug-backtrace.js
index 01775f5..3a72384 100644
--- a/test/mjsunit/debug-backtrace.js
+++ b/test/mjsunit/debug-backtrace.js
@@ -32,9 +32,9 @@
a=1;
};
-var m = function() {
+var m = (0, function() {
new f(1);
-};
+});
function g() {
m();
diff --git a/test/mjsunit/debug-evaluate-closure.js b/test/mjsunit/debug-evaluate-closure.js
index 541dec9..ebd42f3 100644
--- a/test/mjsunit/debug-evaluate-closure.js
+++ b/test/mjsunit/debug-evaluate-closure.js
@@ -26,7 +26,6 @@
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
// Flags: --expose-debug-as debug --allow-natives-syntax
-// Flags: --debug-eval-readonly-locals
Debug = debug.Debug;
var listened = false;
@@ -35,7 +34,7 @@
if (event != Debug.DebugEvent.Break) return;
try {
assertEquals("goo", exec_state.frame(0).evaluate("goo").value());
- exec_state.frame(0).evaluate("goo = 'goo foo'"); // no effect
+ exec_state.frame(0).evaluate("goo = 'goo foo'");
assertEquals("bar return", exec_state.frame(0).evaluate("bar()").value());
assertEquals("inner bar", exec_state.frame(0).evaluate("inner").value());
assertEquals("outer bar", exec_state.frame(0).evaluate("outer").value());
@@ -43,10 +42,10 @@
assertEquals("baz inner", exec_state.frame(0).evaluate("baz").value());
assertEquals("baz outer", exec_state.frame(1).evaluate("baz").value());
exec_state.frame(0).evaluate("w = 'w foo'");
- exec_state.frame(0).evaluate("inner = 'inner foo'"); // no effect
- exec_state.frame(0).evaluate("outer = 'outer foo'"); // has effect
- exec_state.frame(0).evaluate("baz = 'baz inner foo'"); // no effect
- exec_state.frame(1).evaluate("baz = 'baz outer foo'"); // has effect
+ exec_state.frame(0).evaluate("inner = 'inner foo'");
+ exec_state.frame(0).evaluate("outer = 'outer foo'");
+ exec_state.frame(0).evaluate("baz = 'baz inner foo'");
+ exec_state.frame(1).evaluate("baz = 'baz outer foo'");
listened = true;
} catch (e) {
print(e);
@@ -68,7 +67,7 @@
with (withv) {
var bar = function bar() {
- assertEquals("goo", goo);
+ assertEquals("goo foo", goo);
inner = "inner bar";
outer = "outer bar";
v = "v bar";
@@ -80,8 +79,8 @@
debugger;
}
- assertEquals("inner bar", inner);
- assertEquals("baz inner", baz);
+ assertEquals("inner foo", inner);
+ assertEquals("baz inner foo", baz);
assertEquals("w foo", withw.w);
assertEquals("v bar", withv.v);
}
diff --git a/test/mjsunit/debug-evaluate-const.js b/test/mjsunit/debug-evaluate-const.js
deleted file mode 100644
index 6ffddbb..0000000
--- a/test/mjsunit/debug-evaluate-const.js
+++ /dev/null
@@ -1,118 +0,0 @@
-// Copyright 2013 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// Flags: --expose-debug-as debug --debug-eval-readonly-locals --legacy-const
-
-Debug = debug.Debug
-
-listenerComplete = false;
-exception = false;
-
-// var0: init after break point, changed by debug eval.
-// const0: init before break point, changed by debug eval.
-// const1: init after break point, materialized but untouched by debug eval.
-// const2: init after break point, materialized and changed by debug eval.
-// const3: context allocated const, init before break point, changed by eval.
-function f() {
- var var1 = 21;
- const const3 = 3;
-
- function g() {
- const const0 = 0;
- assertEquals(undefined, const1);
- assertEquals(undefined, const2);
- assertEquals(3, const3);
- assertEquals(21, var1);
-
- debugger; // Break point.
-
- assertEquals(undefined, var0);
- assertEquals(0, const0);
- assertEquals(undefined, const1);
- assertEquals(undefined, const2);
- var var0 = 20;
- const const1 = 1;
- const const2 = 2;
- assertEquals(20, var0);
- assertEquals(1, const1);
- assertEquals(2, const2);
- }
-
- g();
-
- assertEquals(21, var1);
- assertEquals(3, const3);
-}
-
-
-function listener(event, exec_state, event_data, data) {
- if (event != Debug.DebugEvent.Break) return;
- try {
- var frame = exec_state.frame(0);
- var evaluate = function(something) {
- return frame.evaluate(something).value()
- }
-
- var count = frame.localCount();
- assertEquals(4, count);
- var expectation = { "const0" : 0,
- "const1" : undefined,
- "const2" : undefined,
- "const3" : 3,
- "var0" : undefined,
- "var1" : 21 };
- for (var i = 0; i < frame.localCount(); ++i) {
- var name = frame.localName(i);
- var value = frame.localValue(i).value();
- assertEquals(expectation[name], value);
- }
-
- evaluate('const0 = 10');
- evaluate('const2 = 12');
- evaluate('const3 = 13');
- evaluate('var0 = 30');
- evaluate('var1 = 31');
-
- // Indicate that all was processed.
- listenerComplete = true;
- } catch (e) {
- exception = e;
- print("Caught something. " + e + " " + e.stack);
- };
-};
-
-// Run and compile before debugger is active.
-try { f(); } catch (e) { }
-
-Debug.setListener(listener);
-
-f();
-
-Debug.setListener(null);
-
-assertFalse(exception, "exception in listener")
-assertTrue(listenerComplete);
diff --git a/test/mjsunit/debug-evaluate-locals-capturing.js b/test/mjsunit/debug-evaluate-locals-capturing.js
index 6d65861..5fdacba 100644
--- a/test/mjsunit/debug-evaluate-locals-capturing.js
+++ b/test/mjsunit/debug-evaluate-locals-capturing.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --expose-debug-as debug --debug-eval-readonly-locals
+// Flags: --expose-debug-as debug
Debug = debug.Debug
var exception = null;
@@ -35,7 +35,7 @@
} catch (e) {
assertEquals(0, i);
debugger;
- assertEquals(0, i);
+ assertEquals(5, i);
}
}());
diff --git a/test/mjsunit/debug-evaluate-locals.js b/test/mjsunit/debug-evaluate-locals.js
index 642e0c0..1788bd8 100644
--- a/test/mjsunit/debug-evaluate-locals.js
+++ b/test/mjsunit/debug-evaluate-locals.js
@@ -25,7 +25,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --expose-debug-as debug --debug-eval-readonly-locals
+// Flags: --expose-debug-as debug
// Get the Debug object exposed from the debug context global object.
Debug = debug.Debug
@@ -89,18 +89,17 @@
}
function checkFrame2(frame) {
- // Frame 2 (f) has normal variables a and b (and arguments).
+ // Frame 2 (f) has normal variables a and b.
var count = frame.localCount();
- assertEquals(3, count);
+ assertEquals(2, count);
for (var i = 0; i < count; ++i) {
var name = frame.localName(i);
var value = frame.localValue(i).value();
if (name == 'a') {
assertEquals(5, value);
- } else if (name == 'b') {
- assertEquals(0, value);
} else {
- assertEquals('arguments', name);
+ assertEquals('b', name);
+ assertEquals(0, value);
}
}
}
@@ -114,20 +113,17 @@
checkFrame1(exec_state.frame(1));
checkFrame2(exec_state.frame(2));
- // Evaluating a and b on frames 0, 1 and 2 produces 1, 2, 3, 4, 5 and 6.
assertEquals(1, exec_state.frame(0).evaluate('a').value());
assertEquals(2, exec_state.frame(0).evaluate('b').value());
assertEquals(5, exec_state.frame(0).evaluate('eval').value());
assertEquals(3, exec_state.frame(1).evaluate('a').value());
- // Reference error because g does not reference b.
- assertThrows(() => exec_state.frame(1).evaluate('b'), ReferenceError);
+ assertEquals(4, exec_state.frame(1).evaluate('b').value());
assertEquals("function",
typeof exec_state.frame(1).evaluate('eval').value());
assertEquals(5, exec_state.frame(2).evaluate('a').value());
assertEquals(6, exec_state.frame(2).evaluate('b').value());
assertEquals("function",
typeof exec_state.frame(2).evaluate('eval').value());
- // Assignments to local variables only have temporary effect.
assertEquals("foo",
exec_state.frame(0).evaluate('a = "foo"').value());
assertEquals("bar",
@@ -146,7 +142,7 @@
var f_result = f();
-assertEquals(4, f_result);
+assertEquals("foobar", f_result);
// Make sure that the debug event listener was invoked.
assertFalse(exception, "exception in listener")
diff --git a/test/mjsunit/debug-evaluate-modify-catch-block-scope.js b/test/mjsunit/debug-evaluate-modify-catch-block-scope.js
index 07d6ccb..676f782 100644
--- a/test/mjsunit/debug-evaluate-modify-catch-block-scope.js
+++ b/test/mjsunit/debug-evaluate-modify-catch-block-scope.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --expose-debug-as debug --debug-eval-readonly-locals
+// Flags: --expose-debug-as debug
Debug = debug.Debug
@@ -10,7 +10,11 @@
function listener(event, exec_state, event_data, data) {
if (event != Debug.DebugEvent.Break) return;
try {
+ exec_state.frame(0).evaluate("a = 2");
+ exec_state.frame(0).evaluate("e = 3");
exec_state.frame(0).evaluate("bar()");
+ exec_state.frame(0).evaluate("a++");
+ exec_state.frame(0).evaluate("e++");
} catch (e) {
exception = e;
print(e + e.stack);
@@ -26,12 +30,12 @@
} catch (e) {
let a = 1;
function bar() {
- a = 2;
- e = 2;
+ a *= 2;
+ e *= 2;
}
debugger;
- assertEquals(2, a);
- assertEquals(2, e);
+ assertEquals(5, a);
+ assertEquals(7, e);
}
})();
diff --git a/test/mjsunit/debug-evaluate-modify-this.js b/test/mjsunit/debug-evaluate-modify-this.js
new file mode 100644
index 0000000..930f6ed
--- /dev/null
+++ b/test/mjsunit/debug-evaluate-modify-this.js
@@ -0,0 +1,33 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-debug-as debug
+
+Debug = debug.Debug
+
+var exception = null;
+
+var f = () => { debugger; }
+var g = function() { debugger; }
+var h = (function() { return () => { debugger; }; }).call({});
+
+function listener(event, exec_state, event_data, data) {
+ if (event != Debug.DebugEvent.Break) return;
+ try {
+ assertThrows(() => exec_state.frame(0).evaluate("this = 2"));
+ } catch (e) {
+ exception = e;
+ print("Caught something. " + e + " " + e.stack);
+ };
+};
+
+Debug.setListener(listener);
+
+f();
+g();
+g.call({});
+h();
+
+Debug.setListener(null);
+assertNull(exception);
diff --git a/test/mjsunit/debug-evaluate-nested-let.js b/test/mjsunit/debug-evaluate-nested-let.js
new file mode 100644
index 0000000..8e9f8c1
--- /dev/null
+++ b/test/mjsunit/debug-evaluate-nested-let.js
@@ -0,0 +1,52 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-debug-as debug --allow-natives-syntax
+
+Debug = debug.Debug
+
+var exception = null;
+
+function f() {
+ let a = 0;
+ function g() {
+ let a = 1;
+ {
+ let a = 2;
+ debugger; // Breakpoint.
+ if (a !== 3) {
+ // We cannot change stack locals in optimized frames.
+ assertEquals(2, a);
+ assertOptimized(g);
+ }
+ }
+ assertEquals(1, a);
+ }
+ g.call(1);
+ if (a !== 4) {
+ // We cannot change stack locals in optimized frames.
+ assertEquals(0, a);
+ assertOptimized(f);
+ }
+}
+
+
+function listener(event, exec_state, event_data, data) {
+ if (event != Debug.DebugEvent.Break) return;
+ try {
+ exec_state.frame(0).evaluate("a = 3");
+ exec_state.frame(1).evaluate("a = 4");
+ assertThrows(() => exec_state.frame(0).evaluate("this = 2"));
+ } catch (e) {
+ exception = e;
+ print("Caught something. " + e + " " + e.stack);
+ };
+};
+
+Debug.setListener(listener);
+
+f();
+
+Debug.setListener(null);
+assertNull(exception);
diff --git a/test/mjsunit/debug-evaluate-nested.js b/test/mjsunit/debug-evaluate-nested.js
new file mode 100644
index 0000000..da11b90
--- /dev/null
+++ b/test/mjsunit/debug-evaluate-nested.js
@@ -0,0 +1,49 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-debug-as debug
+
+Debug = debug.Debug;
+ScopeType = debug.ScopeType;
+var exception = null;
+var nested = false;
+
+function bar() {
+ let a = 1;
+ (function foo() {
+ let b = a;
+ with (new Proxy({}, {})) {
+ debugger;
+ }
+ })();
+}
+
+function checkScopes(scopes, expectation) {
+ assertEquals(scopes.map(s => s.scopeType()), expectation);
+}
+
+function listener(event, exec_state, event_data, data) {
+ if (event != Debug.DebugEvent.Break) return;
+ try {
+ if (!nested) {
+ nested = true;
+ checkScopes(exec_state.frame(0).allScopes(),
+ [ ScopeType.With, ScopeType.Local, ScopeType.Closure,
+ ScopeType.Script, ScopeType.Global ]);
+ exec_state.frame(0).evaluate("debugger;");
+ } else {
+ checkScopes(exec_state.frame(0).allScopes(),
+ [ ScopeType.With, ScopeType.Closure,
+ ScopeType.Script, ScopeType.Global ]);
+ }
+ } catch (e) {
+ exception = e;
+ print(e + e.stack);
+ }
+}
+
+Debug.setListener(listener);
+bar();
+Debug.setListener(null);
+assertNull(exception);
diff --git a/test/mjsunit/debug-function-scopes.js b/test/mjsunit/debug-function-scopes.js
index fac3b16..f63d7b2 100644
--- a/test/mjsunit/debug-function-scopes.js
+++ b/test/mjsunit/debug-function-scopes.js
@@ -73,7 +73,7 @@
CheckScope(mirror.scope(0), { a: 4, b: 5 }, ScopeType.Closure);
CheckScope(mirror.scope(1), { w: 5, v: "Capybara" }, ScopeType.With);
-CheckScope(mirror.scope(2), { y: 17, z: 22 }, ScopeType.Closure);
+CheckScope(mirror.scope(2), { z: 22 }, ScopeType.Closure);
CheckScope(mirror.scope(3), { x: 5 }, ScopeType.Closure);
CheckScope(mirror.scope(4), {}, ScopeType.Script);
CheckScope(mirror.scope(5), {}, ScopeType.Global);
diff --git a/test/mjsunit/debug-multiple-var-decl.js b/test/mjsunit/debug-multiple-var-decl.js
new file mode 100644
index 0000000..b27b03d
--- /dev/null
+++ b/test/mjsunit/debug-multiple-var-decl.js
@@ -0,0 +1,74 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-debug-as debug
+
+// Test we break at every assignment in a var-statement with multiple
+// variable declarations.
+
+var exception = null;
+var log = []
+
+function f() {
+ var l1 = 1, // l
+ l2, // m
+ l3 = 3; // n
+ let l4, // o
+ l5 = 5, // p
+ l6 = 6; // q
+ const l7 = 7, // r
+ l8 = 8, // s
+ l9 = 9; // t
+ return 0; // u
+} // v
+
+function listener(event, exec_state, event_data, data) {
+ if (event != Debug.DebugEvent.Break) return;
+ try {
+ var line = exec_state.frame(0).sourceLineText();
+ var col = exec_state.frame(0).sourceColumn();
+ print(line);
+ var match = line.match(/\/\/ (\w)$/);
+ assertEquals(2, match.length);
+ log.push(match[1] + col);
+ if (match[1] != "v") {
+ exec_state.prepareStep(Debug.StepAction.StepIn);
+ }
+ } catch (e) {
+ exception = e;
+ }
+}
+
+var Debug = debug.Debug;
+Debug.setListener(listener);
+
+debugger; // a
+var g1 = 1, // b
+ g2 = 2, // c
+ g3; // d
+let g4 = 4, // e
+ g5, // f
+ g6 = 6; // g
+const g7 = 7, // h
+ g8 = 8, // i
+ g9 = f(); // j
+
+Debug.setListener(null);
+
+assertNull(exception);
+
+// Note that let declarations, if not explicitly initialized, implicitly
+// initialize to undefined.
+
+var expected = [
+ "a0", // debugger statement
+ "b9","c9", // global var
+ "e9","f4","g9", // global let
+ "h11","i11","j11", // global const
+ "l11","n11", // local var
+ "o6","p11","q11", // local let
+ "r13","s13","t13", // local const
+ "u2","v0", // return
+];
+assertEquals(expected, log);
diff --git a/test/mjsunit/debug-scopes.js b/test/mjsunit/debug-scopes.js
index 8cde951..3659d4e 100644
--- a/test/mjsunit/debug-scopes.js
+++ b/test/mjsunit/debug-scopes.js
@@ -152,7 +152,7 @@
for (var i = 0; i < names.length; i++) {
var scope = exec_state.frame().scope(i);
assertTrue(scope.isScope());
- assertEquals(scope.details().name(), names[i])
+ assertEquals(names[i], scope.details().name())
}
}
@@ -223,6 +223,21 @@
assertTrue(found, "Scope object " + response.body.object.ref + " not found");
}
+// Check that the scopes have positions as expected.
+function CheckScopeChainPositions(positions, exec_state) {
+ var all_scopes = exec_state.frame().allScopes();
+ assertEquals(positions.length, all_scopes.length, "FrameMirror.allScopes length");
+ for (var i = 0; i < positions.length; i++) {
+ var scope = exec_state.frame().scope(i);
+ assertTrue(scope.isScope());
+ var position = positions[i];
+ if (!position)
+ continue;
+
+ assertEquals(position.start, scope.details().startPosition())
+ assertEquals(position.end, scope.details().endPosition())
+ }
+}
// Simple empty local scope.
BeginTest("Local 1");
@@ -529,7 +544,7 @@
debug.ScopeType.Script,
debug.ScopeType.Global], exec_state);
CheckScopeContent({a:1}, 1, exec_state);
- CheckScopeChainNames([undefined, "closure_1", undefined, undefined], exec_state)
+ CheckScopeChainNames(["f", "closure_1", undefined, undefined], exec_state)
};
closure_1(1)();
EndTest();
@@ -556,7 +571,7 @@
debug.ScopeType.Script,
debug.ScopeType.Global], exec_state);
CheckScopeContent({a:1,x:3}, 1, exec_state);
- CheckScopeChainNames([undefined, "closure_2", undefined, undefined], exec_state)
+ CheckScopeChainNames(["f", "closure_2", undefined, undefined], exec_state)
};
closure_2(1, 2)();
EndTest();
@@ -584,7 +599,7 @@
debug.ScopeType.Script,
debug.ScopeType.Global], exec_state);
CheckScopeContent({a:1,b:2,x:3,y:4}, 1, exec_state);
- CheckScopeChainNames([undefined, "closure_3", undefined, undefined], exec_state)
+ CheckScopeChainNames(["f", "closure_3", undefined, undefined], exec_state)
};
closure_3(1, 2)();
EndTest();
@@ -615,7 +630,7 @@
debug.ScopeType.Script,
debug.ScopeType.Global], exec_state);
CheckScopeContent({a:1,b:2,x:3,y:4,f:function(){}}, 1, exec_state);
- CheckScopeChainNames([undefined, "closure_4", undefined, undefined], exec_state)
+ CheckScopeChainNames(["f", "closure_4", undefined, undefined], exec_state)
};
closure_4(1, 2)();
EndTest();
@@ -733,7 +748,7 @@
debug.ScopeType.Script,
debug.ScopeType.Global], exec_state);
CheckScopeContent({x: 2}, 0, exec_state);
- CheckScopeChainNames([undefined, undefined, undefined], exec_state)
+ CheckScopeChainNames(["inner", undefined, undefined], exec_state)
};
closure_8();
EndTest();
@@ -755,7 +770,7 @@
debug.ScopeType.Closure,
debug.ScopeType.Script,
debug.ScopeType.Global], exec_state);
- CheckScopeChainNames([undefined, "closure_9", undefined, undefined], exec_state)
+ CheckScopeChainNames(["inner", "closure_9", undefined, undefined], exec_state)
};
closure_9();
EndTest();
@@ -822,10 +837,10 @@
listener_delegate = function(exec_state) {
CheckScopeChain([debug.ScopeType.Local,
debug.ScopeType.With,
- debug.ScopeType.Closure,
debug.ScopeType.Script,
debug.ScopeType.Global], exec_state);
CheckScopeContent({x: 2}, 0, exec_state);
+ CheckScopeContent({x: 1}, 1, exec_state);
};
closure_in_with_1();
EndTest();
@@ -846,13 +861,12 @@
CheckScopeChain([debug.ScopeType.With,
debug.ScopeType.Local,
debug.ScopeType.With,
- debug.ScopeType.Closure,
debug.ScopeType.Script,
debug.ScopeType.Global], exec_state);
CheckScopeContent({x: 3}, 0, exec_state);
CheckScopeContent({x: 2}, 1, exec_state);
CheckScopeContent({x: 1}, 2, exec_state);
- CheckScopeChainNames(["inner", "inner", "closure_in_with_2", "closure_in_with_2", undefined, undefined], exec_state)
+ CheckScopeChainNames(["inner", "inner", "closure_in_with_2", undefined, undefined], exec_state)
};
closure_in_with_2();
EndTest();
@@ -934,7 +948,7 @@
debug.ScopeType.Script,
debug.ScopeType.Global], exec_state);
CheckScopeContent({e:'Exception'}, 0, exec_state);
- CheckScopeChainNames(["catch_block_1", undefined, undefined, undefined], exec_state)
+ CheckScopeChainNames(["catch_block_1", "catch_block_1", undefined, undefined], exec_state)
};
catch_block_1();
EndTest();
@@ -1080,7 +1094,7 @@
debug.ScopeType.Script,
debug.ScopeType.Global], exec_state);
CheckScopeContent({e:'Exception'}, 0, exec_state);
- CheckScopeChainNames(["catch_block_7", undefined, undefined, undefined], exec_state)
+ CheckScopeChainNames(["catch_block_7", "catch_block_7", undefined, undefined], exec_state)
};
catch_block_7();
EndTest();
@@ -1094,7 +1108,7 @@
debug.ScopeType.Script,
debug.ScopeType.Global], exec_state);
CheckScopeContent({}, 1, exec_state);
- CheckScopeChainNames([undefined, undefined, undefined], exec_state)
+ CheckScopeChainNames(["m", undefined, undefined], exec_state)
};
(function() {
@@ -1109,6 +1123,70 @@
EndTest();
+BeginTest("Scope positions");
+var code1 = "function f() { \n" +
+ " var a = 1; \n" +
+ " function b() { \n" +
+ " debugger; \n" +
+ " return a + 1; \n" +
+ " } \n" +
+ " b(); \n" +
+ "} \n" +
+ "f(); \n";
+
+listener_delegate = function(exec_state) {
+ CheckScopeChainPositions([{start: 58, end: 118}, {start: 10, end: 162}, {}, {}], exec_state);
+}
+eval(code1);
+EndTest();
+
+
+function catch_block_2() {
+ try {
+ throw 'Exception';
+ } catch (e) {
+ with({n:10}) {
+ debugger;
+ }
+ }
+};
+
+BeginTest("Scope positions in catch and 'with' statement");
+var code2 = "function catch_block() { \n" +
+ " try { \n" +
+ " throw 'Exception'; \n" +
+ " } catch (e) { \n" +
+ " with({n : 10}) { \n" +
+ " debugger; \n" +
+ " } \n" +
+ " } \n" +
+ "} \n" +
+ "catch_block(); \n";
+
+listener_delegate = function(exec_state) {
+ CheckScopeChainPositions([{start: 131, end: 173}, {start: 94, end: 199}, {start: 20, end: 225}, {}, {}], exec_state);
+}
+eval(code2);
+EndTest();
+
+BeginTest("Scope positions in for statement");
+var code3 = "function for_statement() { \n" +
+ " for (let i = 0; i < 1; i++) { \n" +
+ " debugger; \n" +
+ " } \n" +
+ "} \n" +
+ "for_statement(); \n";
+
+listener_delegate = function(exec_state) {
+ CheckScopeChain([debug.ScopeType.Block,
+ debug.ScopeType.Block,
+ debug.ScopeType.Local,
+ debug.ScopeType.Script,
+ debug.ScopeType.Global], exec_state);
+ CheckScopeChainPositions([{start: 52, end: 111}, {start: 42, end: 111}, {start: 22, end: 145}, {}, {}], exec_state);
+}
+eval(code3);
+EndTest();
assertEquals(begin_test_count, break_count,
'one or more tests did not enter the debugger');
diff --git a/test/mjsunit/debug-step-end-of-script.js b/test/mjsunit/debug-step-end-of-script.js
index ded58d1..e8ffcc8 100644
--- a/test/mjsunit/debug-step-end-of-script.js
+++ b/test/mjsunit/debug-step-end-of-script.js
@@ -5,7 +5,7 @@
// Flags: --expose-debug-as debug --allow-natives-syntax
var Debug = debug.Debug;
-var expected = ["debugger;", "", "debugger;"];
+var expected = ["debugger;", "debugger;"];
function listener(event, exec_state, event_data, data) {
if (event != Debug.DebugEvent.Break) return;
diff --git a/test/mjsunit/debug-step.js b/test/mjsunit/debug-step.js
index bfbea16..6f5c8f4 100644
--- a/test/mjsunit/debug-step.js
+++ b/test/mjsunit/debug-step.js
@@ -64,9 +64,9 @@
// Set a breakpoint on the for statement (line 1).
bp1 = Debug.setBreakPoint(f, 1);
-// Check that performing 1000 steps will make i 499.
+// Check that performing 1000 steps will make i 333.
var step_count = 1000;
result = -1;
f();
-assertEquals(332, result);
+assertEquals(333, result);
Debug.setListener(null);
diff --git a/test/mjsunit/debug-stepin-accessor.js b/test/mjsunit/debug-stepin-accessor.js
index daf86a3..8513ca0 100644
--- a/test/mjsunit/debug-stepin-accessor.js
+++ b/test/mjsunit/debug-stepin-accessor.js
@@ -96,21 +96,21 @@
};
function testGetter1_1() {
- expected_function_name = 'getter1';
+ expected_function_name = 'get getter1';
expected_source_line_text = ' return this.name; // getter 1';
debugger;
var x = c.getter1;
}
function testGetter1_2() {
- expected_function_name = 'getter1';
+ expected_function_name = 'get getter1';
expected_source_line_text = ' return this.name; // getter 1';
debugger;
var x = c['getter1'];
}
function testGetter1_3() {
- expected_function_name = 'getter1';
+ expected_function_name = 'get getter1';
expected_source_line_text = ' return this.name; // getter 1';
for (var i = 1; i < 2; i++) {
debugger;
@@ -119,14 +119,14 @@
}
function testGetter1_4() {
- expected_function_name = 'getter1';
+ expected_function_name = 'get getter1';
expected_source_line_text = ' return this.name; // getter 1';
debugger;
var x = d.c.getter1;
}
function testGetter1_5() {
- expected_function_name = 'getter1';
+ expected_function_name = 'get getter1';
expected_source_line_text = ' return this.name; // getter 1';
for (var i = 2; i != 1; i--);
debugger;
@@ -134,7 +134,7 @@
}
function testGetter2_1() {
- expected_function_name = 'getter2';
+ expected_function_name = 'get getter2';
expected_source_line_text = ' return { // getter 2';
for (var i = 2; i != 1; i--);
debugger;
@@ -172,21 +172,21 @@
}
function testSetter1_1() {
- expected_function_name = 'setter1';
+ expected_function_name = 'set setter1';
expected_source_line_text = ' this.name = n; // setter 1';
debugger;
d.c.setter1 = 'aa';
}
function testSetter1_2() {
- expected_function_name = 'setter1';
+ expected_function_name = 'set setter1';
expected_source_line_text = ' this.name = n; // setter 1';
debugger;
d.c['setter1'] = 'bb';
}
function testSetter1_3() {
- expected_function_name = 'setter1';
+ expected_function_name = 'set setter1';
expected_source_line_text = ' this.name = n; // setter 1';
for (var i = 2; i != 1; i--);
debugger;
@@ -199,14 +199,14 @@
e.__proto__ = c;
function testProtoGetter1_1() {
- expected_function_name = 'getter1';
+ expected_function_name = 'get getter1';
expected_source_line_text = ' return this.name; // getter 1';
debugger;
var x = e.getter1;
}
function testProtoSetter1_1() {
- expected_function_name = 'setter1';
+ expected_function_name = 'set setter1';
expected_source_line_text = ' this.name = n; // setter 1';
debugger;
e.setter1 = 'aa';
@@ -227,7 +227,7 @@
}
function testProtoSetter1_2() {
- expected_function_name = 'setter1';
+ expected_function_name = 'set setter1';
expected_source_line_text = ' this.name = n; // setter 1';
for (var i = 2; i != 1; i--);
debugger;
@@ -240,7 +240,7 @@
}
state = 1;
this[n]();
- assertNull(exception);
+ if (exception) throw exception;
assertEquals(4, state);
}
diff --git a/test/mjsunit/debug-stepin-positions.js b/test/mjsunit/debug-stepin-positions.js
deleted file mode 100644
index ac010aa..0000000
--- a/test/mjsunit/debug-stepin-positions.js
+++ /dev/null
@@ -1,227 +0,0 @@
-// Copyright 2008 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// Flags: --expose-debug-as debug --nocrankshaft
-// Get the Debug object exposed from the debug context global object.
-Debug = debug.Debug
-
-function DebuggerStatement() {
- debugger; /*pause*/
-}
-
-function TestCase(fun, frame_number, line_number) {
- var exception = false;
- var codeSnippet = undefined;
- var resultPositions = undefined;
- var step = 0;
-
- function listener(event, exec_state, event_data, data) {
- try {
- if (event == Debug.DebugEvent.Break ||
- event == Debug.DebugEvent.Exception) {
- if (step++ > 0) return;
- assertHasLineMark(/pause/, exec_state.frame(0));
- assertHasLineMark(/positions/, exec_state.frame(frame_number));
- var frame = exec_state.frame(frame_number);
- codeSnippet = frame.sourceLineText();
- resultPositions = frame.stepInPositions();
- }
- } catch (e) {
- exception = e
- }
-
- function assertHasLineMark(mark, frame) {
- var line = frame.sourceLineText();
- if (!mark.exec(frame.sourceLineText())) {
- throw new Error("Line " + line + " should contain mark " + mark);
- }
- }
- }
-
- Debug.setListener(listener);
-
- var breakpointId;
- if (line_number) breakpointId = Debug.setBreakPoint(fun, line_number);
-
- fun();
-
- if (line_number) Debug.clearBreakPoint(breakpointId);
-
- Debug.setListener(null);
-
- assertTrue(!exception, exception);
-
- var expectedPositions = {};
- var markPattern = new RegExp("/\\*#\\*/", "g");
-
- var matchResult;
- while ( (matchResult = markPattern.exec(codeSnippet)) ) {
- expectedPositions[matchResult.index] = true;
- }
-
- print(codeSnippet);
-
- var decoratedResult = codeSnippet;
-
- function replaceStringRange(s, pos, substitute) {
- return s.substring(0, pos) + substitute +
- s.substring(pos + substitute.length);
- }
-
- var markLength = 5;
- var unexpectedPositionFound = false;
-
- for (var i = 0; i < resultPositions.length; i++) {
- var col = resultPositions[i].position.column - markLength;
- if (expectedPositions[col]) {
- delete expectedPositions[col];
- decoratedResult = replaceStringRange(decoratedResult, col, "*YES*");
- } else {
- decoratedResult = replaceStringRange(decoratedResult, col, "!BAD!");
- unexpectedPositionFound = true;
- }
- }
-
- print(decoratedResult);
-
- for (var n in expectedPositions) {
- assertTrue(false, "Some positions are not reported: " + decoratedResult);
- break;
- }
- assertFalse(unexpectedPositionFound, "Found unexpected position: " +
- decoratedResult);
-}
-
-function TestCaseWithDebugger(fun) {
- TestCase(fun, 1);
-}
-
-function TestCaseWithBreakpoint(fun, line_number, frame_number) {
- TestCase(fun, frame_number, line_number);
-}
-
-function TestCaseWithException(fun, frame_number) {
- Debug.setBreakOnException();
- TestCase(fun, frame_number);
- Debug.clearBreakOnException();
-}
-
-
-// Test cases.
-
-// Step in position, when the function call that we are standing at is already
-// being executed.
-var fun = function() {
- function g(p) {
- throw String(p); /*pause*/
- }
- try {
- var res = [ g(1), /*#*/g(2) ]; /*positions*/
- } catch (e) {
- }
-};
-TestCaseWithBreakpoint(fun, 2, 1);
-TestCaseWithException(fun, 1);
-
-
-// Step in position, when the function call that we are standing at is raising
-// an exception.
-var fun = function() {
- var o = {
- g: function(p) {
- throw p;
- }
- };
- try {
- var res = [ /*#*/f(1), /*#*/g(2) ]; /*pause, positions*/
- } catch (e) {
- }
-};
-TestCaseWithException(fun, 0);
-
-
-// Step-in position, when already paused almost on the first call site.
-var fun = function() {
- function g(p) {
- throw p;
- }
- try {
- var res = [ /*#*/g(Math.rand), /*#*/g(2) ]; /*pause, positions*/
- } catch (e) {
- }
-};
-TestCaseWithBreakpoint(fun, 5, 0);
-
-// Step-in position, when already paused on the first call site.
-var fun = function() {
- function g() {
- throw "Debug";
- }
- try {
- var res = [ /*#*/g(), /*#*/g() ]; /*pause, positions*/
- } catch (e) {
- }
-};
-TestCaseWithBreakpoint(fun, 5, 0);
-
-
-// Method calls.
-var fun = function() {
- var data = {
- a: function() {}
- };
- var res = [ DebuggerStatement(), data./*#*/a(), data[/*#*/String("a")]/*#*/(), data["a"]/*#*/(), data.a, data["a"] ]; /*positions*/
-};
-TestCaseWithDebugger(fun);
-
-// Function call on a value.
-var fun = function() {
- function g(p) {
- return g;
- }
- var res = [ DebuggerStatement(), /*#*/g(2), /*#*/g(2)/*#*/(3), /*#*/g(0)/*#*/(0)/*#*/(g) ]; /*positions*/
-};
-TestCaseWithDebugger(fun);
-
-// Local function call, closure function call,
-// local function construction call.
-var fun = (function(p) {
- return function() {
- function f(a, b) {
- }
- var res = /*#*/f(DebuggerStatement(), /*#*/p(/*#*/new f())); /*positions*/
- };
-})(Object);
-TestCaseWithDebugger(fun);
-
-// Global function, global object construction, calls before pause point.
-var fun = (function(p) {
- return function() {
- var res = [ Math.abs(new Object()), DebuggerStatement(), Math./*#*/abs(4), /*#*/new Object()./*#*/toString() ]; /*positions*/
- };
-})(Object);
-TestCaseWithDebugger(fun);
diff --git a/test/mjsunit/declare-locally.js b/test/mjsunit/declare-locally.js
index 45d30e0..f03217e 100644
--- a/test/mjsunit/declare-locally.js
+++ b/test/mjsunit/declare-locally.js
@@ -27,19 +27,13 @@
// Make sure that we're not overwriting global
// properties defined in the prototype chain too
-// early when shadowing them with var/const
+// early when shadowing them with var
// declarations.
// This exercises the code in runtime.cc in
// DeclareGlobal...Locally().
-// Flags: --legacy-const
-
this.__proto__.foo = 42;
-this.__proto__.bar = 87;
eval("assertEquals(undefined, foo); var foo = 87;");
assertEquals(87, foo);
-
-eval("assertEquals(undefined, bar); const bar = 42;");
-assertEquals(42, bar);
diff --git a/test/mjsunit/es6/array-concat.js b/test/mjsunit/es6/array-concat.js
index bc9e1a0..fe320d6 100644
--- a/test/mjsunit/es6/array-concat.js
+++ b/test/mjsunit/es6/array-concat.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies --harmony-reflect
-
(function testArrayConcatArity() {
"use strict";
assertEquals(1, Array.prototype.concat.length);
@@ -803,9 +801,10 @@
log.length = 0;
assertEquals([obj], Array.prototype.concat.apply(obj));
- assertEquals(1, log.length);
+ assertEquals(2, log.length); // An extra read for the constructor
for (var i in log) assertSame(target, log[i][1]);
- assertEquals(["get", target, Symbol.isConcatSpreadable, obj], log[0]);
+ assertEquals(["get", target, "constructor", obj], log[0]);
+ assertEquals(["get", target, Symbol.isConcatSpreadable, obj], log[1]);
})();
@@ -827,14 +826,15 @@
log.length = 0;
assertEquals(["a", "b"], Array.prototype.concat.apply(obj));
- assertEquals(6, log.length);
+ assertEquals(7, log.length);
for (var i in log) assertSame(target, log[i][1]);
- assertEquals(["get", target, Symbol.isConcatSpreadable, obj], log[0]);
- assertEquals(["get", target, "length", obj], log[1]);
- assertEquals(["has", target, "0"], log[2]);
- assertEquals(["get", target, "0", obj], log[3]);
- assertEquals(["has", target, "1"], log[4]);
- assertEquals(["get", target, "1", obj], log[5]);
+ assertEquals(["get", target, "constructor", obj], log[0]);
+ assertEquals(["get", target, Symbol.isConcatSpreadable, obj], log[1]);
+ assertEquals(["get", target, "length", obj], log[2]);
+ assertEquals(["has", target, "0"], log[3]);
+ assertEquals(["get", target, "0", obj], log[4]);
+ assertEquals(["has", target, "1"], log[5]);
+ assertEquals(["get", target, "1", obj], log[6]);
})();
diff --git a/test/mjsunit/es6/array-iterator.js b/test/mjsunit/es6/array-iterator.js
index 5fab0fb..d2d19b0 100644
--- a/test/mjsunit/es6/array-iterator.js
+++ b/test/mjsunit/es6/array-iterator.js
@@ -25,7 +25,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --allow-natives-syntax --harmony-tostring
+// Flags: --allow-natives-syntax
var NONE = 0;
@@ -160,7 +160,7 @@
assertArrayEquals(['next'],
Object.getOwnPropertyNames(ArrayIteratorPrototype));
assertHasOwnProperty(ArrayIteratorPrototype, 'next', DONT_ENUM);
- assertHasOwnProperty(ArrayIteratorPrototype, Symbol.iterator, DONT_ENUM);
+ assertFalse(ArrayIteratorPrototype.hasOwnProperty(Symbol.iterator));
assertEquals("[object Array Iterator]",
Object.prototype.toString.call(iterator));
diff --git a/test/mjsunit/es6/array-prototype-values.js b/test/mjsunit/es6/array-prototype-values.js
new file mode 100644
index 0000000..64162c4
--- /dev/null
+++ b/test/mjsunit/es6/array-prototype-values.js
@@ -0,0 +1,15 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --harmony-array-prototype-values
+
+// Functionality of the values iterator is tested elsewhere; this test
+// merely verifies that the 'values' property is set up correctly.
+var valuesDesc = Object.getOwnPropertyDescriptor(Array.prototype, 'values');
+assertEquals('object', typeof valuesDesc);
+assertSame(Array.prototype[Symbol.iterator], valuesDesc.value);
+assertTrue(valuesDesc.configurable);
+assertTrue(valuesDesc.writable);
+assertFalse(valuesDesc.enumerable);
+assertTrue(Array.prototype[Symbol.unscopables].values);
diff --git a/test/mjsunit/es6/array-tostring.js b/test/mjsunit/es6/array-tostring.js
index 397fde4..973b3c3 100644
--- a/test/mjsunit/es6/array-tostring.js
+++ b/test/mjsunit/es6/array-tostring.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-tostring
-
var global = this;
var funs = {
diff --git a/test/mjsunit/es6/block-eval-var-over-legacy-const.js b/test/mjsunit/es6/block-eval-var-over-legacy-const.js
deleted file mode 100644
index be1687b..0000000
--- a/test/mjsunit/es6/block-eval-var-over-legacy-const.js
+++ /dev/null
@@ -1,86 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --harmony-sloppy --harmony-sloppy-let --harmony-sloppy-function
-// Flags: --legacy-const
-
-// Legacy-const-let conflict in a function throws, even if the legacy const
-// is in an eval
-
-// Throws at the top level of a function
-assertThrows(function() {
- let x = 1;
- eval('const x = 2');
-}, TypeError);
-
-// If the eval is in its own block scope, throws
-assertThrows(function() {
- let y = 1;
- { eval('const y = 2'); }
-}, TypeError);
-
-// If the let is in its own block scope, with the eval, throws
-assertThrows(function() {
- {
- let x = 1;
- eval('const x = 2');
- }
-}, TypeError);
-
-// Legal if the let is no longer visible
-assertDoesNotThrow(function() {
- {
- let x = 1;
- }
- eval('const x = 2');
-});
-
-// In global scope
-let caught = false;
-try {
- let z = 1;
- eval('const z = 2');
-} catch (e) {
- caught = true;
-}
-assertTrue(caught);
-
-// Let declarations beyond a function boundary don't conflict
-caught = false;
-try {
- let a = 1;
- (function() {
- eval('const a');
- })();
-} catch (e) {
- caught = true;
-}
-assertFalse(caught);
-
-// legacy const across with doesn't conflict
-caught = false;
-try {
- (function() {
- with ({x: 1}) {
- eval("const x = 2;");
- }
- })();
-} catch (e) {
- caught = true;
-}
-assertFalse(caught);
-
-// legacy const can still conflict with let across a with
-caught = false;
-try {
- (function() {
- let x;
- with ({x: 1}) {
- eval("const x = 2;");
- }
- })();
-} catch (e) {
- caught = true;
-}
-assertTrue(caught);
diff --git a/test/mjsunit/es6/block-let-contextual-sloppy.js b/test/mjsunit/es6/block-let-contextual-sloppy.js
index 20ca107..ac7bca1 100644
--- a/test/mjsunit/es6/block-let-contextual-sloppy.js
+++ b/test/mjsunit/es6/block-let-contextual-sloppy.js
@@ -2,10 +2,9 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-sloppy --harmony-sloppy-let --harmony-destructuring-bind
-// Flags: --legacy-const
+// Flags: --harmony-sloppy --harmony-sloppy-let
-// let is usable as a variable with var or legacy const, not let or ES6 const
+// let is usable as a variable with var, but not let or ES6 const
(function (){
assertEquals(undefined, let);
@@ -50,13 +49,6 @@
assertEquals(1, obj.x);
})();
-(function () {
- let obj = {};
- const [let] = [function() { return obj; }];
- let().x = 1;
- assertEquals(1, obj.x);
-})();
-
(function() {
function let() {
return 1;
diff --git a/test/mjsunit/es6/built-in-accessor-names.js b/test/mjsunit/es6/built-in-accessor-names.js
index c5f8cec..8c29d36 100644
--- a/test/mjsunit/es6/built-in-accessor-names.js
+++ b/test/mjsunit/es6/built-in-accessor-names.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-tostring
-
'use strict';
function assertGetterName(expected, object, name) {
diff --git a/test/mjsunit/es6/classes-proxy.js b/test/mjsunit/es6/classes-proxy.js
index 09d12c2..4642df8 100644
--- a/test/mjsunit/es6/classes-proxy.js
+++ b/test/mjsunit/es6/classes-proxy.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --allow-natives-syntax --harmony-proxies --harmony-reflect
+// Flags: --allow-natives-syntax
function CreateConstructableProxy(handler) {
return new Proxy(function(){}, handler);
diff --git a/test/mjsunit/es6/classes-subclass-builtins.js b/test/mjsunit/es6/classes-subclass-builtins.js
index 313aad1..7669ef3 100644
--- a/test/mjsunit/es6/classes-subclass-builtins.js
+++ b/test/mjsunit/es6/classes-subclass-builtins.js
@@ -2,8 +2,8 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --allow-natives-syntax --harmony-reflect --harmony-regexp-subclass
-// Flags: --expose-gc --strong-mode
+// Flags: --allow-natives-syntax --harmony-regexp-subclass
+// Flags: --expose-gc
"use strict";
@@ -78,11 +78,6 @@
constructor(...args) {
assertFalse(new.target === undefined);
super(...args);
- // Strong functions are not extensible, so don't add fields.
- if (args[args.length - 1].indexOf("use strong") >= 0) {
- assertThrows(()=>{ this.a = 10; }, TypeError);
- return;
- }
this.a = 42;
this.d = 4.2;
this.o = {foo:153};
@@ -95,26 +90,24 @@
assertNull(Object.getOwnPropertyDescriptor(sloppy_func, "caller").value);
assertEquals(undefined, Object.getOwnPropertyDescriptor(strict_func, "caller"));
- function CheckFunction(func, is_strong) {
+ function CheckFunction(func) {
assertEquals("function", typeof func);
assertTrue(func instanceof Object);
assertTrue(func instanceof Function);
assertTrue(func instanceof A);
checkPrototypeChain(func, [A, Function, Object]);
- if (!is_strong) {
- assertEquals(42, func.a);
- assertEquals(4.2, func.d);
- assertEquals(153, func.o.foo);
- assertTrue(undefined !== func.prototype);
- func.prototype.bar = "func.bar";
- var obj = new func();
- assertTrue(obj instanceof Object);
- assertTrue(obj instanceof func);
- assertEquals("object", typeof obj);
- assertEquals(113, obj.foo);
- assertEquals("func.bar", obj.bar);
- delete func.prototype.bar;
- }
+ assertEquals(42, func.a);
+ assertEquals(4.2, func.d);
+ assertEquals(153, func.o.foo);
+ assertTrue(undefined !== func.prototype);
+ func.prototype.bar = "func.bar";
+ var obj = new func();
+ assertTrue(obj instanceof Object);
+ assertTrue(obj instanceof func);
+ assertEquals("object", typeof obj);
+ assertEquals(113, obj.foo);
+ assertEquals("func.bar", obj.bar);
+ delete func.prototype.bar;
}
var source = "this.foo = 113;";
@@ -135,15 +128,6 @@
var strict_func1 = new A("'use strict'; return 312;");
assertTrue(%HaveSameMap(strict_func, strict_func1));
- // Strong function
- var strong_func = new A("'use strong'; " + source);
- assertFalse(%HaveSameMap(strong_func, sloppy_func));
- assertFalse(%HaveSameMap(strong_func, strict_func));
- CheckFunction(strong_func, true);
-
- var strong_func1 = new A("'use strong'; return 312;");
- assertTrue(%HaveSameMap(strong_func, strong_func1));
-
gc();
})();
@@ -592,11 +576,6 @@
constructor(...args) {
assertFalse(new.target === undefined);
super(...args);
- // Strong functions are not extensible, so don't add fields.
- if (args[args.length - 1].indexOf("use strong") >= 0) {
- assertThrows(()=>{ this.a = 10; }, TypeError);
- return;
- }
this.a = 42;
this.d = 4.2;
this.o = {foo:153};
@@ -610,35 +589,34 @@
assertEquals(undefined, Object.getOwnPropertyDescriptor(sloppy_func, "caller"));
assertEquals(undefined, Object.getOwnPropertyDescriptor(strict_func, "caller"));
- function CheckFunction(func, is_strong) {
+ function CheckFunction(func) {
assertEquals("function", typeof func);
assertTrue(func instanceof Object);
assertTrue(func instanceof Function);
assertTrue(func instanceof GeneratorFunction);
assertTrue(func instanceof A);
checkPrototypeChain(func, [A, GeneratorFunction, Function, Object]);
- if (!is_strong) {
- assertEquals(42, func.a);
- assertEquals(4.2, func.d);
- assertEquals(153, func.o.foo);
- assertTrue(undefined !== func.prototype);
- func.prototype.bar = "func.bar";
- var obj = func(); // Generator object.
- assertTrue(obj instanceof Object);
- assertTrue(obj instanceof func);
- assertEquals("object", typeof obj);
- assertEquals("func.bar", obj.bar);
- delete func.prototype.bar;
+ assertEquals(42, func.a);
+ assertEquals(4.2, func.d);
+ assertEquals(153, func.o.foo);
- assertPropertiesEqual({done: false, value: 1}, obj.next());
- assertPropertiesEqual({done: false, value: 1}, obj.next());
- assertPropertiesEqual({done: false, value: 2}, obj.next());
- assertPropertiesEqual({done: false, value: 3}, obj.next());
- assertPropertiesEqual({done: false, value: 5}, obj.next());
- assertPropertiesEqual({done: false, value: 8}, obj.next());
- assertPropertiesEqual({done: true, value: undefined}, obj.next());
- }
+ assertTrue(undefined !== func.prototype);
+ func.prototype.bar = "func.bar";
+ var obj = func(); // Generator object.
+ assertTrue(obj instanceof Object);
+ assertTrue(obj instanceof func);
+ assertEquals("object", typeof obj);
+ assertEquals("func.bar", obj.bar);
+ delete func.prototype.bar;
+
+ assertPropertiesEqual({done: false, value: 1}, obj.next());
+ assertPropertiesEqual({done: false, value: 1}, obj.next());
+ assertPropertiesEqual({done: false, value: 2}, obj.next());
+ assertPropertiesEqual({done: false, value: 3}, obj.next());
+ assertPropertiesEqual({done: false, value: 5}, obj.next());
+ assertPropertiesEqual({done: false, value: 8}, obj.next());
+ assertPropertiesEqual({done: true, value: undefined}, obj.next());
}
var source = "yield 1; yield 1; yield 2; yield 3; yield 5; yield 8;";
@@ -659,15 +637,6 @@
var strict_func1 = new A("'use strict'; yield 312;");
assertTrue(%HaveSameMap(strict_func, strict_func1));
- // Strong generator function
- var strong_func = new A("'use strong'; " + source);
- assertFalse(%HaveSameMap(strong_func, sloppy_func));
- assertFalse(%HaveSameMap(strong_func, strict_func));
- CheckFunction(strong_func, true);
-
- var strong_func1 = new A("'use strong'; yield 312;");
- assertTrue(%HaveSameMap(strong_func, strong_func1));
-
gc();
})();
@@ -950,7 +919,13 @@
var o = Reflect.construct(RegExp, [pattern], f);
assertEquals(["match", "tostring"], log);
- assertEquals(/biep/, o);
+ // TODO(littledan): Is the RegExp constructor correct to create
+ // the internal slots and do these type checks this way?
+ assertEquals("biep", %_RegExpSource(o));
+ assertThrows(() => Object.getOwnPropertyDescriptor(RegExp.prototype,
+ 'source').get(o),
+ TypeError);
+ assertEquals("/undefined/undefined", RegExp.prototype.toString.call(o));
assertTrue(o.__proto__ === p2);
assertTrue(f.prototype === p3);
})();
diff --git a/test/mjsunit/es6/classes.js b/test/mjsunit/es6/classes.js
index ac10f0e..4dabda8 100644
--- a/test/mjsunit/es6/classes.js
+++ b/test/mjsunit/es6/classes.js
@@ -2,7 +2,8 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-sloppy --allow-natives-syntax
+// Flags: --harmony-sloppy --harmony-function-name --allow-natives-syntax
+// Flags: --harmony-do-expressions
(function TestBasics() {
var C = class C {}
@@ -22,13 +23,11 @@
class D2 { constructor() {} }
assertEquals('D2', D2.name);
- // TODO(arv): The logic for the name of anonymous functions in ES6 requires
- // the below to be 'E';
var E = class {}
- assertEquals('', E.name); // Should be 'E'.
+ assertEquals('E', E.name); // Should be 'E'.
var F = class { constructor() {} };
- assertEquals('', F.name); // Should be 'F'.
+ assertEquals('F', F.name); // Should be 'F'.
})();
@@ -996,3 +995,55 @@
testClassRestrictedProperties(
class extends Class { constructor() { super(); } });
})();
+
+
+(function testReturnFromClassLiteral() {
+
+ function usingDoExpressionInBody() {
+ let x = 42;
+ let dummy = function() {x};
+ try {
+ class C {
+ dummy() {C}
+ [do {return}]() {}
+ };
+ } finally {
+ return x;
+ }
+ }
+ assertEquals(42, usingDoExpressionInBody());
+
+ function usingDoExpressionInExtends() {
+ let x = 42;
+ let dummy = function() {x};
+ try {
+ class C extends (do {return}) { dummy() {C} };
+ } finally {
+ return x;
+ }
+ }
+ assertEquals(42, usingDoExpressionInExtends());
+
+ function usingYieldInBody() {
+ function* foo() {
+ class C {
+ [yield]() {}
+ }
+ }
+ var g = foo();
+ g.next();
+ return g.return(42).value;
+ }
+ assertEquals(42, usingYieldInBody());
+
+ function usingYieldInExtends() {
+ function* foo() {
+ class C extends (yield) {};
+ }
+ var g = foo();
+ g.next();
+ return g.return(42).value;
+ }
+ assertEquals(42, usingYieldInExtends());
+
+})();
diff --git a/test/mjsunit/es6/classof-proxy.js b/test/mjsunit/es6/classof-proxy.js
index c3bc985..0204361 100644
--- a/test/mjsunit/es6/classof-proxy.js
+++ b/test/mjsunit/es6/classof-proxy.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --allow-natives-syntax --harmony-proxies
+// Flags: --allow-natives-syntax
function test_function(o) {
if (%_ClassOf(o) === "Function") {
diff --git a/test/mjsunit/es6/collection-iterator.js b/test/mjsunit/es6/collection-iterator.js
index 18b3f1a..a92c9ae 100644
--- a/test/mjsunit/es6/collection-iterator.js
+++ b/test/mjsunit/es6/collection-iterator.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --allow-natives-syntax --harmony-tostring
+// Flags: --allow-natives-syntax
(function TestSetIterator() {
diff --git a/test/mjsunit/es6/collections.js b/test/mjsunit/es6/collections.js
index e410e22..1664a93 100644
--- a/test/mjsunit/es6/collections.js
+++ b/test/mjsunit/es6/collections.js
@@ -25,7 +25,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --expose-gc --allow-natives-syntax --harmony-tostring
+// Flags: --expose-gc --allow-natives-syntax
function assertSize(expected, collection) {
diff --git a/test/mjsunit/es6/completion.js b/test/mjsunit/es6/completion.js
index 05565bf..7559514 100644
--- a/test/mjsunit/es6/completion.js
+++ b/test/mjsunit/es6/completion.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-sloppy-let --no-legacy-const
+// Flags: --harmony-sloppy-let
function assertUndef(x) {
diff --git a/test/mjsunit/es6/debug-blockscopes.js b/test/mjsunit/es6/debug-blockscopes.js
index d3c3620..193ad70 100644
--- a/test/mjsunit/es6/debug-blockscopes.js
+++ b/test/mjsunit/es6/debug-blockscopes.js
@@ -26,7 +26,6 @@
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
// Flags: --expose-debug-as debug --allow-natives-syntax
-// Flags: --debug-eval-readonly-locals
// The functions used for testing backtraces. They are at the top to make the
// testing of source line/column easier.
diff --git a/test/mjsunit/es6/debug-liveedit-new-target-1.js b/test/mjsunit/es6/debug-liveedit-new-target-1.js
index 043c5f1..8855742 100644
--- a/test/mjsunit/es6/debug-liveedit-new-target-1.js
+++ b/test/mjsunit/es6/debug-liveedit-new-target-1.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-reflect --expose-debug-as debug --allow-natives-syntax
+// Flags: --expose-debug-as debug --allow-natives-syntax
// Test that live-editing a frame that uses new.target fails.
diff --git a/test/mjsunit/es6/debug-promises/events.js b/test/mjsunit/es6/debug-promises/events.js
deleted file mode 100644
index 3fcb22f..0000000
--- a/test/mjsunit/es6/debug-promises/events.js
+++ /dev/null
@@ -1,122 +0,0 @@
-// Copyright 2014 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --allow-natives-syntax --expose-debug-as debug
-
-Debug = debug.Debug;
-
-var eventsExpected = 16;
-var exception = null;
-var result = [];
-
-function updatePromise(promise, parentPromise, status, value) {
- var i;
- for (i = 0; i < result.length; ++i) {
- if (result[i].promise === promise) {
- result[i].parentPromise = parentPromise || result[i].parentPromise;
- result[i].status = status || result[i].status;
- result[i].value = value || result[i].value;
- break;
- }
- }
- assertTrue(i < result.length);
-}
-
-function listener(event, exec_state, event_data, data) {
- if (event != Debug.DebugEvent.PromiseEvent) return;
- try {
- eventsExpected--;
- assertTrue(event_data.promise().isPromise());
- if (event_data.status() === 0) {
- // New promise.
- assertEquals("pending", event_data.promise().status());
- result.push({ promise: event_data.promise().value(), status: 0 });
- assertTrue(exec_state.frame(0).sourceLineText().indexOf("// event") > 0);
- } else if (event_data.status() !== undefined) {
- // Resolve/reject promise.
- updatePromise(event_data.promise().value(),
- undefined,
- event_data.status(),
- event_data.value().value());
- } else {
- // Chain promises.
- assertTrue(event_data.parentPromise().isPromise());
- updatePromise(event_data.promise().value(),
- event_data.parentPromise().value());
- assertTrue(exec_state.frame(0).sourceLineText().indexOf("// event") > 0);
- }
- } catch (e) {
- print(e + e.stack)
- exception = e;
- }
-}
-
-Debug.setListener(listener);
-
-function resolver(resolve, reject) { resolve(); }
-
-var p1 = new Promise(resolver); // event
-var p2 = p1.then().then(); // event
-var p3 = new Promise(function(resolve, reject) { // event
- reject("rejected");
-});
-var p4 = p3.then(); // event
-var p5 = p1.then(); // event
-
-function assertAsync(b, s) {
- if (b) {
- print(s, "succeeded");
- } else {
- %AbortJS(s + " FAILED!");
- }
-}
-
-function testDone(iteration) {
- function checkResult() {
- if (eventsExpected === 0) {
- assertAsync(result.length === 6, "result.length");
-
- assertAsync(result[0].promise === p1, "result[0].promise");
- assertAsync(result[0].parentPromise === undefined,
- "result[0].parentPromise");
- assertAsync(result[0].status === 1, "result[0].status");
- assertAsync(result[0].value === undefined, "result[0].value");
-
- assertAsync(result[1].parentPromise === p1,
- "result[1].parentPromise");
- assertAsync(result[1].status === 1, "result[1].status");
-
- assertAsync(result[2].promise === p2, "result[2].promise");
-
- assertAsync(result[3].promise === p3, "result[3].promise");
- assertAsync(result[3].parentPromise === undefined,
- "result[3].parentPromise");
- assertAsync(result[3].status === -1, "result[3].status");
- assertAsync(result[3].value === "rejected", "result[3].value");
-
- assertAsync(result[4].promise === p4, "result[4].promise");
- assertAsync(result[4].parentPromise === p3,
- "result[4].parentPromise");
- assertAsync(result[4].status === -1, "result[4].status");
- assertAsync(result[4].value === "rejected", "result[4].value");
-
- assertAsync(result[5].promise === p5, "result[5].promise");
- assertAsync(result[5].parentPromise === p1,
- "result[5].parentPromise");
- assertAsync(result[5].status === 1, "result[5].status");
-
- assertAsync(exception === null, "exception === null");
- Debug.setListener(null);
- } else if (iteration > 10) {
- %AbortJS("Not all events were received!");
- } else {
- testDone(iteration + 1);
- }
- }
-
- var iteration = iteration || 0;
- %EnqueueMicrotask(checkResult);
-}
-
-testDone();
diff --git a/test/mjsunit/es6/debug-promises/resolve-after-aborted-try-finally.js b/test/mjsunit/es6/debug-promises/resolve-after-aborted-try-finally.js
deleted file mode 100644
index 918ae2a..0000000
--- a/test/mjsunit/es6/debug-promises/resolve-after-aborted-try-finally.js
+++ /dev/null
@@ -1,32 +0,0 @@
-// Copyright 2014 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --expose-debug-as debug --allow-natives-syntax
-
-// Test debug events when we listen to all exceptions and
-// there is a catch handler for the exception thrown in a Promise.
-// We expect a normal Exception debug event to be triggered.
-
-Debug = debug.Debug;
-
-var events = [];
-
-function listener(event, exec_state, event_data, data) {
- if (event == Debug.DebugEvent.PromiseEvent) events.push(event_data.status());
-}
-
-Debug.setListener(listener);
-
-var p = new Promise(function(resolve, reject) {
- do {
- try {
- throw new Error("reject");
- } finally {
- break; // No rethrow.
- }
- } while (false);
- resolve();
-});
-
-assertEquals([0 /* create */, 1 /* resolve */], events);
diff --git a/test/mjsunit/es6/debug-promises/resolve-after-try-catch.js b/test/mjsunit/es6/debug-promises/resolve-after-try-catch.js
deleted file mode 100644
index 298201f..0000000
--- a/test/mjsunit/es6/debug-promises/resolve-after-try-catch.js
+++ /dev/null
@@ -1,29 +0,0 @@
-// Copyright 2014 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --expose-debug-as debug --allow-natives-syntax
-
-// Test debug events when we listen to all exceptions and
-// there is a catch handler for the exception thrown in a Promise.
-// We expect a normal Exception debug event to be triggered.
-
-Debug = debug.Debug;
-
-var events = [];
-
-function listener(event, exec_state, event_data, data) {
- if (event == Debug.DebugEvent.PromiseEvent) events.push(event_data.status());
-}
-
-Debug.setListener(listener);
-
-var p = new Promise(function (resolve, reject) {
- try {
- throw new Error("reject");
- } catch (e) {
- }
- resolve();
-});
-
-assertEquals([0 /* create */, 1 /* resolve */], events);
diff --git a/test/mjsunit/es6/debug-promises/rethrow-in-try-finally.js b/test/mjsunit/es6/debug-promises/rethrow-in-try-finally.js
deleted file mode 100644
index b1e2ff9..0000000
--- a/test/mjsunit/es6/debug-promises/rethrow-in-try-finally.js
+++ /dev/null
@@ -1,30 +0,0 @@
-// Copyright 2014 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --expose-debug-as debug --allow-natives-syntax
-
-// Test debug events when we listen to all exceptions and
-// there is a catch handler for the exception thrown in a Promise.
-// We expect a normal Exception debug event to be triggered.
-
-Debug = debug.Debug;
-
-var events = [];
-
-function listener(event, exec_state, event_data, data) {
- if (event == Debug.DebugEvent.PromiseEvent) events.push(event_data.status());
-}
-
-Debug.setListener(listener);
-
-var p = new Promise(function(resolve, reject) {
- try {
- throw new Error("reject");
- } finally {
- // Implicit rethrow.
- }
- resolve();
-});
-
-assertEquals([0 /* create */, -1 /* rethrown */], events);
diff --git a/test/mjsunit/es6/debug-promises/throw-with-throw-in-reject.js b/test/mjsunit/es6/debug-promises/throw-with-throw-in-reject.js
index 349d014..5cf49f2 100644
--- a/test/mjsunit/es6/debug-promises/throw-with-throw-in-reject.js
+++ b/test/mjsunit/es6/debug-promises/throw-with-throw-in-reject.js
@@ -31,6 +31,7 @@
};
MyPromise.prototype = new Promise(function() {});
+MyPromise.__proto__ = Promise;
p.constructor = MyPromise;
var q = p.chain(
diff --git a/test/mjsunit/es6/debug-promises/throw-with-undefined-reject.js b/test/mjsunit/es6/debug-promises/throw-with-undefined-reject.js
index 69ee01e..6fe3b17 100644
--- a/test/mjsunit/es6/debug-promises/throw-with-undefined-reject.js
+++ b/test/mjsunit/es6/debug-promises/throw-with-undefined-reject.js
@@ -2,18 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --expose-debug-as debug --allow-natives-syntax --promise-extra
-
-// Test debug events when an exception is thrown inside a Promise, which is
-// caught by a custom promise, which has no reject handler.
-// We expect two Exception debug events:
-// 1) when the exception is thrown in the promise q.
-// 2) when calling the undefined custom reject closure in MyPromise throws.
-
-Debug = debug.Debug;
-
-var expected_events = 2;
-var log = [];
+// A non-callable reject function throws eagerly
var p = new Promise(function(resolve, reject) {
log.push("resolve");
@@ -23,63 +12,11 @@
function MyPromise(resolver) {
var reject = undefined;
var resolve = function() { };
- log.push("construct");
resolver(resolve, reject);
};
MyPromise.prototype = new Promise(function() {});
+MyPromise.__proto__ = Promise;
p.constructor = MyPromise;
-var q = p.chain(
- function() {
- log.push("throw caught");
- throw new Error("caught"); // event
- });
-
-function listener(event, exec_state, event_data, data) {
- try {
- if (event == Debug.DebugEvent.Exception) {
- expected_events--;
- assertTrue(expected_events >= 0);
- if (expected_events == 1) {
- assertTrue(
- exec_state.frame(0).sourceLineText().indexOf('// event') > 0);
- assertEquals("caught", event_data.exception().message);
- } else if (expected_events == 0) {
- // All of the frames on the stack are from native Javascript.
- assertEquals(0, exec_state.frameCount());
- assertEquals("(var).reject is not a function",
- event_data.exception().message);
- } else {
- assertUnreachable();
- }
- assertSame(q, event_data.promise());
- }
- } catch (e) {
- %AbortJS(e + "\n" + e.stack);
- }
-}
-
-Debug.setBreakOnUncaughtException();
-Debug.setListener(listener);
-
-log.push("end main");
-
-function testDone(iteration) {
- function checkResult() {
- try {
- assertTrue(iteration < 10);
- if (expected_events === 0) {
- assertEquals(["resolve", "construct", "end main", "throw caught"], log);
- } else {
- testDone(iteration + 1);
- }
- } catch (e) {
- %AbortJS(e + "\n" + e.stack);
- }
- }
-
- %EnqueueMicrotask(checkResult);
-}
-
-testDone(0);
+assertThrows(()=> p.then(function() { }), TypeError);
diff --git a/test/mjsunit/es6/debug-step-destructuring-assignment.js b/test/mjsunit/es6/debug-step-destructuring-assignment.js
new file mode 100644
index 0000000..4fde928
--- /dev/null
+++ b/test/mjsunit/es6/debug-step-destructuring-assignment.js
@@ -0,0 +1,85 @@
+// Copyright 2015 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-debug-as debug
+
+var exception = null;
+var Debug = debug.Debug;
+var break_count = 0;
+
+function listener(event, exec_state, event_data, data) {
+ if (event != Debug.DebugEvent.Break) return;
+ try {
+ var source = exec_state.frame(0).sourceLineText();
+ print(source);
+ assertTrue(source.indexOf(`// B${break_count++}`) > 0);
+ if (source.indexOf("assertEquals") > 0) {
+ exec_state.prepareStep(Debug.StepAction.StepNext);
+ } else {
+ exec_state.prepareStep(Debug.StepAction.StepIn);
+ }
+ } catch (e) {
+ exception = e;
+ print(e);
+ }
+};
+
+Debug.setListener(listener);
+
+function f() {
+ var a, b, c, d;
+ debugger; // B0
+ [ // B1
+ a, // B2
+ b, // B3
+ c = 3 // B4
+ ] = [1, 2];
+ assertEquals({a:1,b:2,c:3}, {a, b, c}); // B5
+
+ [ // B6
+ a, // B7
+ [
+ b, // B8
+ c // B9
+ ],
+ d // B10
+ ] = [5, [6, 7], 8];
+ assertEquals({a:5,b:6,c:7,d:8}, {a, b, c, d}); // B11
+
+ [ // B12
+ a, // B13
+ b, // B14
+ ...c // B15
+ ] = [1, 2, 3, 4];
+ assertEquals({a:1,b:2,c:[3,4]}, {a, b, c}); // B16
+
+ ({ // B17
+ a, // B18
+ b, // B19
+ c = 7 // B20
+ } = {a: 5, b: 6});
+ assertEquals({a:5,b:6,c:7}, {a, b, c}); // B21
+
+ ({ // B22
+ a, // B23
+ b = return1(), // B24
+ c = return1() // B25
+ } = {a: 5, b: 6});
+ assertEquals({a:5,b:6,c:1}, {a, b, c}); // B28
+
+ ({ // B29
+ x : a, // B30
+ y : b, // B31
+ z : c = 3 // B32
+ } = {x: 1, y: 2});
+ assertEquals({a:1,b:2,c:3}, {a, b, c}); // B33
+} // B34
+
+function return1() {
+ return 1; // B26
+} // B27
+
+f();
+Debug.setListener(null); // B35
+assertNull(exception);
diff --git a/test/mjsunit/harmony/debug-step-destructuring-bind.js b/test/mjsunit/es6/debug-step-destructuring-bind.js
similarity index 89%
rename from test/mjsunit/harmony/debug-step-destructuring-bind.js
rename to test/mjsunit/es6/debug-step-destructuring-bind.js
index a78431b..f670f52 100644
--- a/test/mjsunit/harmony/debug-step-destructuring-bind.js
+++ b/test/mjsunit/es6/debug-step-destructuring-bind.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --expose-debug-as debug --harmony-destructuring-bind
+// Flags: --expose-debug-as debug
var exception = null;
var Debug = debug.Debug;
@@ -98,13 +98,13 @@
assertEquals([3, 4, 6], [a, b, c]); // B45
}
- var { // B46
- x: a, // B47
- y: b = 9 // B48
+ var {
+ x: a, // B46
+ y: b = 9 // B47
} = { x: 4 };
- assertEquals([4, 9], [a, b]); // B49
-} // B50
+ assertEquals([4, 9], [a, b]); // B48
+} // B49
test();
-Debug.setListener(null); // B51
+Debug.setListener(null); // B50
assertNull(exception);
diff --git a/test/mjsunit/harmony/debug-stepin-default-parameters.js b/test/mjsunit/es6/debug-stepin-default-parameters.js
similarity index 88%
rename from test/mjsunit/harmony/debug-stepin-default-parameters.js
rename to test/mjsunit/es6/debug-stepin-default-parameters.js
index 6ebf7ba..aaac9f0 100644
--- a/test/mjsunit/harmony/debug-stepin-default-parameters.js
+++ b/test/mjsunit/es6/debug-stepin-default-parameters.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --expose-debug-as debug --harmony-default-parameters
+// Flags: --expose-debug-as debug
Debug = debug.Debug
@@ -42,5 +42,5 @@
assertNull(exception);
assertEquals("default", result);
-assertEquals(["a0","b0","f18b13","d2f18b13","e0f18b13","g2b13","h0b13","c0"],
+assertEquals(["a0","b13","f18b13","d2f18b13","e0f18b13","g2b13","h0b13","c0"],
log);
diff --git a/test/mjsunit/harmony/debug-stepin-proxies.js b/test/mjsunit/es6/debug-stepin-proxies.js
similarity index 85%
rename from test/mjsunit/harmony/debug-stepin-proxies.js
rename to test/mjsunit/es6/debug-stepin-proxies.js
index 8595f40..4e71c79 100644
--- a/test/mjsunit/harmony/debug-stepin-proxies.js
+++ b/test/mjsunit/es6/debug-stepin-proxies.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --expose-debug-as debug --harmony-proxies
+// Flags: --expose-debug-as debug
Debug = debug.Debug
@@ -54,8 +54,8 @@
assertEquals([
"a0",
- "b0", "h4b20", "i2b20", // [[Has]]
- "c0", "j4c15", "k2c15", // [[Get]]
- "d0", "l4d11", "m2d11", // [[Set]]
+ "b17", "h4b20", "i2b20", // [[Has]]
+ "c15", "j4c15", "k2c15", // [[Get]]
+ "d0", "l4d11", "m2d11", // [[Set]]
"g0"
], log);
diff --git a/test/mjsunit/es6/debug-stepin-string-template.js b/test/mjsunit/es6/debug-stepin-string-template.js
index f500fae..2d8c394 100644
--- a/test/mjsunit/es6/debug-stepin-string-template.js
+++ b/test/mjsunit/es6/debug-stepin-string-template.js
@@ -48,7 +48,8 @@
assertEquals([
"a0",
- "b0",
+ "b44",
+ "b13",
"d2b13",
"e0b13",
"b25",
diff --git a/test/mjsunit/es6/debug-stepin-tailcalls.js b/test/mjsunit/es6/debug-stepin-tailcalls.js
new file mode 100644
index 0000000..6020ba9
--- /dev/null
+++ b/test/mjsunit/es6/debug-stepin-tailcalls.js
@@ -0,0 +1,46 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-debug-as debug --harmony-tailcalls
+
+"use strict";
+
+var Debug = debug.Debug
+var exception = null;
+var breaks = 0;
+
+function f(x) {
+ if (x > 0) { // B3 B5 B7 B9
+ return f(x - 1); // B4 B6 B8
+ }
+} // B10
+
+function g(x) {
+ return f(x); // B2
+}
+
+function h(x) {
+ debugger; // B0
+ g(x); // B1
+} // B11
+
+
+function listener(event, exec_state, event_data, data) {
+ if (event != Debug.DebugEvent.Break) return;
+ try {
+ print(event_data.sourceLineText());
+ assertTrue(event_data.sourceLineText().indexOf(`B${breaks++}`) > 0);
+ exec_state.prepareStep(Debug.StepAction.StepIn);
+ } catch (e) {
+ exception = e;
+ };
+};
+
+Debug.setListener(listener);
+
+h(3);
+
+Debug.setListener(null); // B12
+assertNull(exception);
+assertEquals(13, breaks);
diff --git a/test/mjsunit/es6/debug-stepnext-for.js b/test/mjsunit/es6/debug-stepnext-for.js
index 932840a..9d5641a 100644
--- a/test/mjsunit/es6/debug-stepnext-for.js
+++ b/test/mjsunit/es6/debug-stepnext-for.js
@@ -91,7 +91,7 @@
// based on other values.
var expected = [
// Entry
- "a2","b2",
+ "a2",
// Empty for-in-var: get enumerable
"c16",
// Empty for-in: get enumerable
@@ -108,12 +108,12 @@
"i12","i10","i11","I4","i11","I4","i11","I4","i11",
// For-of-let: [Symbol.iterator](), next(), body, next(), ...
"j16","j14","j15","J4","j15","J4","j15","J4","j15",
- // For-var: var decl, condition, body, next, condition, body, ...
- "k7","k20","K4","k26","k20","K4","k26","k20","K4","k26","k20",
+ // For-var: init, condition, body, next, condition, body, ...
+ "k15","k20","K4","k26","k20","K4","k26","k20","K4","k26","k20",
// For: init, condition, body, next, condition, body, ...
"l7","l16","L4","l22","l16","L4","l22","l16","L4","l22","l16",
// For-let: init, condition, body, next, condition, body, ...
- "m7","m20","M4","m26","m20","M4","m26","m20","M4","m26","m20",
+ "m15","m20","M4","m26","m20","M4","m26","m20","M4","m26","m20",
// Exit.
"y0","z0",
]
diff --git a/test/mjsunit/es6/debug-stepout-tailcalls.js b/test/mjsunit/es6/debug-stepout-tailcalls.js
new file mode 100644
index 0000000..db0878d
--- /dev/null
+++ b/test/mjsunit/es6/debug-stepout-tailcalls.js
@@ -0,0 +1,45 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-debug-as debug --harmony-tailcalls
+
+"use strict";
+
+var Debug = debug.Debug
+var exception = null;
+var breaks = 0;
+
+function f(x) {
+ if (x > 0) {
+ return f(x - 1); // Tail call
+ }
+ debugger; // Break 0
+}
+
+function g(x) {
+ return f(x); // Tail call
+}
+
+function h(x) {
+ g(x); // Not tail call
+} // Break 1
+
+
+function listener(event, exec_state, event_data, data) {
+ if (event != Debug.DebugEvent.Break) return;
+ try {
+ assertTrue(event_data.sourceLineText().indexOf(`Break ${breaks++}`) > 0);
+ exec_state.prepareStep(Debug.StepAction.StepOut);
+ } catch (e) {
+ exception = e;
+ };
+};
+
+Debug.setListener(listener);
+
+h(3);
+
+Debug.setListener(null); // Break 2
+assertNull(exception);
+assertEquals(3, breaks);
diff --git a/test/mjsunit/harmony/default-parameters-debug.js b/test/mjsunit/es6/default-parameters-debug.js
similarity index 96%
rename from test/mjsunit/harmony/default-parameters-debug.js
rename to test/mjsunit/es6/default-parameters-debug.js
index ce9e626..30e19c4 100644
--- a/test/mjsunit/harmony/default-parameters-debug.js
+++ b/test/mjsunit/es6/default-parameters-debug.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --expose-debug-as debug --harmony-default-parameters
+// Flags: --expose-debug-as debug
// Get the Debug object exposed from the debug context global object.
Debug = debug.Debug
diff --git a/test/mjsunit/harmony/default-parameters-destructuring.js b/test/mjsunit/es6/default-parameters-destructuring.js
similarity index 98%
rename from test/mjsunit/harmony/default-parameters-destructuring.js
rename to test/mjsunit/es6/default-parameters-destructuring.js
index 47cca5c..50071f0 100644
--- a/test/mjsunit/harmony/default-parameters-destructuring.js
+++ b/test/mjsunit/es6/default-parameters-destructuring.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-default-parameters --harmony-destructuring-bind
-
(function TestSloppyEvalScoping() {
var x = 1;
diff --git a/test/mjsunit/harmony/default-parameters.js b/test/mjsunit/es6/default-parameters.js
similarity index 99%
rename from test/mjsunit/harmony/default-parameters.js
rename to test/mjsunit/es6/default-parameters.js
index 8d1eb8b..4e0bf54 100644
--- a/test/mjsunit/harmony/default-parameters.js
+++ b/test/mjsunit/es6/default-parameters.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-default-parameters
-
(function TestDefaults() {
function f1(x = 1) { return x }
diff --git a/test/mjsunit/harmony/destructuring-assignment-lazy.js b/test/mjsunit/es6/destructuring-assignment-lazy.js
similarity index 80%
rename from test/mjsunit/harmony/destructuring-assignment-lazy.js
rename to test/mjsunit/es6/destructuring-assignment-lazy.js
index 8915eb9..fdae30e 100644
--- a/test/mjsunit/harmony/destructuring-assignment-lazy.js
+++ b/test/mjsunit/es6/destructuring-assignment-lazy.js
@@ -2,7 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-destructuring-assignment --harmony-destructuring-bind
// Flags: --min-preparse-length=0
function f() {
diff --git a/test/mjsunit/harmony/destructuring-assignment.js b/test/mjsunit/es6/destructuring-assignment.js
similarity index 99%
rename from test/mjsunit/harmony/destructuring-assignment.js
rename to test/mjsunit/es6/destructuring-assignment.js
index bc8c424..df9bb0e 100644
--- a/test/mjsunit/harmony/destructuring-assignment.js
+++ b/test/mjsunit/es6/destructuring-assignment.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-destructuring-assignment --harmony-destructuring-bind
-
// script-level tests
var ox, oy = {}, oz;
({
diff --git a/test/mjsunit/harmony/destructuring-parameters-literalcount-nolazy.js b/test/mjsunit/es6/destructuring-parameters-literalcount-nolazy.js
similarity index 95%
rename from test/mjsunit/harmony/destructuring-parameters-literalcount-nolazy.js
rename to test/mjsunit/es6/destructuring-parameters-literalcount-nolazy.js
index 5b90fb1..0317509 100644
--- a/test/mjsunit/harmony/destructuring-parameters-literalcount-nolazy.js
+++ b/test/mjsunit/es6/destructuring-parameters-literalcount-nolazy.js
@@ -2,7 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
-// Flags: --harmony-destructuring-bind
// Flags: --no-lazy --allow-natives-syntax
diff --git a/test/mjsunit/harmony/destructuring-parameters-literalcount.js b/test/mjsunit/es6/destructuring-parameters-literalcount.js
similarity index 95%
rename from test/mjsunit/harmony/destructuring-parameters-literalcount.js
rename to test/mjsunit/es6/destructuring-parameters-literalcount.js
index 140ed9d..77a3226 100644
--- a/test/mjsunit/harmony/destructuring-parameters-literalcount.js
+++ b/test/mjsunit/es6/destructuring-parameters-literalcount.js
@@ -2,7 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
-// Flags: --harmony-destructuring-bind
// Flags: --allow-natives-syntax
diff --git a/test/mjsunit/harmony/destructuring.js b/test/mjsunit/es6/destructuring.js
similarity index 99%
rename from test/mjsunit/harmony/destructuring.js
rename to test/mjsunit/es6/destructuring.js
index e84abd1..1f16c45 100644
--- a/test/mjsunit/harmony/destructuring.js
+++ b/test/mjsunit/es6/destructuring.js
@@ -1,9 +1,6 @@
// Copyright 2015 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-//
-// Flags: --harmony-destructuring-bind
-// Flags: --harmony-default-parameters
(function TestObjectLiteralPattern() {
var { x : x, y : y, get, set } = { x : 1, y : 2, get: 3, set: 4 };
@@ -1188,4 +1185,7 @@
assertEquals("hello", foo);
assertEquals("world", bar);
assertEquals(42, baz);
+
+ assertEquals(undefined, eval('try {throw {foo: 1, bar: 2}} catch({foo}) {}'));
+ assertEquals(undefined, eval('try {throw [1, 2, 3]} catch([x]) {}'));
})();
diff --git a/test/mjsunit/es6/generators-objects.js b/test/mjsunit/es6/generators-objects.js
index f304738..a0c3b80 100644
--- a/test/mjsunit/es6/generators-objects.js
+++ b/test/mjsunit/es6/generators-objects.js
@@ -25,7 +25,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --allow-natives-syntax --harmony-tostring
+// Flags: --allow-natives-syntax
// Test instantations of generators.
diff --git a/test/mjsunit/es6/instanceof-proxies.js b/test/mjsunit/es6/instanceof-proxies.js
index cc720ad..86b104c 100644
--- a/test/mjsunit/es6/instanceof-proxies.js
+++ b/test/mjsunit/es6/instanceof-proxies.js
@@ -3,7 +3,7 @@
// found in the LICENSE file.
-// Flags: --harmony-proxies --allow-natives-syntax
+// Flags: --allow-natives-syntax
// Test instanceof with proxies.
diff --git a/test/mjsunit/es6/iteration-semantics.js b/test/mjsunit/es6/iteration-semantics.js
index 6466ac5..558fb83 100644
--- a/test/mjsunit/es6/iteration-semantics.js
+++ b/test/mjsunit/es6/iteration-semantics.js
@@ -25,8 +25,6 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --harmony-proxies
-
// Test for-of semantics.
"use strict";
diff --git a/test/mjsunit/es6/json.js b/test/mjsunit/es6/json.js
index 3fad083..4c1ada8 100644
--- a/test/mjsunit/es6/json.js
+++ b/test/mjsunit/es6/json.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-tostring
-
function testJSONToString() {
assertEquals('[object JSON]', "" + JSON);
assertEquals("JSON", JSON[Symbol.toStringTag]);
diff --git a/test/mjsunit/es6/math-trunc.js b/test/mjsunit/es6/math-trunc.js
index 9231576..c925b5b 100644
--- a/test/mjsunit/es6/math-trunc.js
+++ b/test/mjsunit/es6/math-trunc.js
@@ -25,25 +25,78 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-assertEquals("Infinity", String(1/Math.trunc(0)));
-assertEquals("-Infinity", String(1/Math.trunc(-0)));
-assertEquals("Infinity", String(1/Math.trunc(Math.PI/4)));
-assertEquals("-Infinity", String(1/Math.trunc(-Math.sqrt(2)/2)));
-assertEquals(100, Math.trunc(100));
-assertEquals(-199, Math.trunc(-199));
-assertEquals(100, Math.trunc(100.1));
-assertTrue(isNaN(Math.trunc("abc")));
-assertTrue(isNaN(Math.trunc({})));
-assertEquals(0, Math.trunc([]));
-assertEquals(1, Math.trunc([1]));
-assertEquals(-100, Math.trunc([-100.1]));
-assertTrue(isNaN(Math.trunc([1, 1])));
-assertEquals(-100, Math.trunc({ toString: function() { return "-100.3"; } }));
-assertEquals(10, Math.trunc({ toString: function() { return 10.1; } }));
-assertEquals(-1, Math.trunc({ valueOf: function() { return -1.1; } }));
-assertEquals("-Infinity",
- String(1/Math.trunc({ valueOf: function() { return "-0.1"; } })));
-assertEquals("-Infinity", String(Math.trunc(-Infinity)));
-assertEquals("Infinity", String(Math.trunc(Infinity)));
-assertEquals("-Infinity", String(Math.trunc("-Infinity")));
-assertEquals("Infinity", String(Math.trunc("Infinity")));
+// Flags: --allow-natives-syntax
+
+var test_id = 0;
+
+function testTrunc(expected, input) {
+ var test = new Function('n',
+ '"' + (test_id++) + '";return Math.trunc(n)');
+ assertEquals(expected, test(input));
+ assertEquals(expected, test(input));
+ assertEquals(expected, test(input));
+ %OptimizeFunctionOnNextCall(test);
+ assertEquals(expected, test(input));
+
+ var test_double_input = new Function(
+ 'n',
+ '"' + (test_id++) + '";return Math.trunc(+n)');
+ assertEquals(expected, test_double_input(input));
+ assertEquals(expected, test_double_input(input));
+ assertEquals(expected, test_double_input(input));
+ %OptimizeFunctionOnNextCall(test_double_input);
+ assertEquals(expected, test_double_input(input));
+
+ var test_double_output = new Function(
+ 'n',
+ '"' + (test_id++) + '";return Math.trunc(n) + -0.0');
+ assertEquals(expected, test_double_output(input));
+ assertEquals(expected, test_double_output(input));
+ assertEquals(expected, test_double_output(input));
+ %OptimizeFunctionOnNextCall(test_double_output);
+ assertEquals(expected, test_double_output(input));
+}
+
+function test() {
+ // Ensure that a negative zero coming from Math.trunc is properly handled
+ // by other operations.
+ function itrunc(x) {
+ return 1 / Math.trunc(x);
+ }
+ assertEquals(Infinity, itrunc(0));
+ assertEquals(-Infinity, itrunc(-0));
+ assertEquals(Infinity, itrunc(Math.PI / 4));
+ assertEquals(-Infinity, itrunc(-Math.sqrt(2) / 2));
+ assertEquals(-Infinity, itrunc({valueOf: function() { return "-0.1"; }}));
+ %OptimizeFunctionOnNextCall(itrunc);
+
+ testTrunc(100, 100);
+ testTrunc(-199, -199);
+ testTrunc(100, 100.1);
+ testTrunc(4503599627370495.0, 4503599627370495.0);
+ testTrunc(4503599627370496.0, 4503599627370496.0);
+ testTrunc(-4503599627370495.0, -4503599627370495.0);
+ testTrunc(-4503599627370496.0, -4503599627370496.0);
+ testTrunc(9007199254740991.0, 9007199254740991.0);
+ testTrunc(-9007199254740991.0, -9007199254740991.0);
+ testTrunc(0, []);
+ testTrunc(1, [1]);
+ testTrunc(-100, [-100.1]);
+ testTrunc(-100, {toString: function() { return "-100.3"; }});
+ testTrunc(10, {toString: function() { return 10.1; }});
+ testTrunc(-1, {valueOf: function() { return -1.1; }});
+ testTrunc(-Infinity, -Infinity);
+ testTrunc(Infinity, Infinity);
+ testTrunc(-Infinity, "-Infinity");
+ testTrunc(Infinity, "Infinity");
+
+ assertTrue(isNaN(Math.trunc("abc")));
+ assertTrue(isNaN(Math.trunc({})));
+ assertTrue(isNaN(Math.trunc([1, 1])));
+}
+
+// Test in a loop to cover the custom IC and GC-related issues.
+for (var i = 0; i < 10; i++) {
+ test();
+ new Array(i * 10000);
+}
diff --git a/test/mjsunit/es6/math.js b/test/mjsunit/es6/math.js
index 3f76f11..cb43bd5 100644
--- a/test/mjsunit/es6/math.js
+++ b/test/mjsunit/es6/math.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-tostring
-
function testMathToString() {
assertEquals('[object Math]', "" + Math);
assertEquals("Math", Math[Symbol.toStringTag]);
diff --git a/test/mjsunit/es6/new-target.js b/test/mjsunit/es6/new-target.js
index 8a06ff6..4be1254 100644
--- a/test/mjsunit/es6/new-target.js
+++ b/test/mjsunit/es6/new-target.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-reflect --harmony-destructuring-bind
-
(function TestClass() {
'use strict';
diff --git a/test/mjsunit/es6/no-unicode-regexp-flag.js b/test/mjsunit/es6/no-unicode-regexp-flag.js
index 035627c..82d070e 100644
--- a/test/mjsunit/es6/no-unicode-regexp-flag.js
+++ b/test/mjsunit/es6/no-unicode-regexp-flag.js
@@ -7,7 +7,7 @@
// mjsunit/es6/regexp-flags tests that the property is there when the
// flag is on.
-// Flags: --harmony-regexps --no-harmony-unicode-regexps
+// Flags: --no-harmony-unicode-regexps
'use strict';
diff --git a/test/mjsunit/es6/object-tostring.js b/test/mjsunit/es6/object-tostring.js
index 4d6090f..29d07f2 100644
--- a/test/mjsunit/es6/object-tostring.js
+++ b/test/mjsunit/es6/object-tostring.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-tostring --harmony-proxies
-
var global = this;
var funs = {
diff --git a/test/mjsunit/es6/pattern-brand-check.js b/test/mjsunit/es6/pattern-brand-check.js
new file mode 100644
index 0000000..9b0c011
--- /dev/null
+++ b/test/mjsunit/es6/pattern-brand-check.js
@@ -0,0 +1,54 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-regexp-subclass
+
+function createNonRegExp(calls) {
+ return {
+ get [Symbol.match]() {
+ calls.push("@@match");
+ return undefined;
+ },
+ get [Symbol.replace]() {
+ calls.push("@@replace");
+ return undefined;
+ },
+ get [Symbol.search]() {
+ calls.push("@@search");
+ return undefined;
+ },
+ get [Symbol.split]() {
+ calls.push("@@split");
+ return undefined;
+ },
+ [Symbol.toPrimitive]() {
+ calls.push("@@toPrimitive");
+ return "";
+ }
+ };
+}
+
+(function testStringMatchBrandCheck() {
+ var calls = [];
+ "".match(createNonRegExp(calls));
+ assertEquals(["@@match", "@@toPrimitive"], calls);
+})();
+
+(function testStringSearchBrandCheck() {
+ var calls = [];
+ "".search(createNonRegExp(calls));
+ assertEquals(["@@search", "@@toPrimitive"], calls);
+})();
+
+(function testStringSplitBrandCheck() {
+ var calls = [];
+ "".split(createNonRegExp(calls));
+ assertEquals(["@@split", "@@toPrimitive"], calls);
+})();
+
+(function testStringReplaceBrandCheck() {
+ var calls = [];
+ "".replace(createNonRegExp(calls), "");
+ assertEquals(["@@replace", "@@toPrimitive"], calls);
+})();
diff --git a/test/mjsunit/es6/promises.js b/test/mjsunit/es6/promises.js
index e4c8b38..4eb539c 100644
--- a/test/mjsunit/es6/promises.js
+++ b/test/mjsunit/es6/promises.js
@@ -25,7 +25,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --allow-natives-syntax --harmony-tostring --promise-extra
+// Flags: --allow-natives-syntax --promise-extra
// Make sure we don't rely on functions patchable by monkeys.
var call = Function.prototype.call.call.bind(Function.prototype.call)
diff --git a/test/mjsunit/harmony/proxies-accesschecks.js b/test/mjsunit/es6/proxies-accesschecks.js
similarity index 93%
rename from test/mjsunit/harmony/proxies-accesschecks.js
rename to test/mjsunit/es6/proxies-accesschecks.js
index 209d432..f5b90dc 100644
--- a/test/mjsunit/harmony/proxies-accesschecks.js
+++ b/test/mjsunit/es6/proxies-accesschecks.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies
-
var realm = Realm.create();
this.__proto__ = new Proxy({}, {
diff --git a/test/mjsunit/harmony/proxies-apply.js b/test/mjsunit/es6/proxies-apply.js
similarity index 98%
rename from test/mjsunit/harmony/proxies-apply.js
rename to test/mjsunit/es6/proxies-apply.js
index dae362a..a94541c 100644
--- a/test/mjsunit/harmony/proxies-apply.js
+++ b/test/mjsunit/es6/proxies-apply.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies --harmony-reflect
-
(function testNonCallable() {
var proxy = new Proxy({},{});
assertThrows(function(){ proxy() }, TypeError);
diff --git a/test/mjsunit/harmony/proxies-bind.js b/test/mjsunit/es6/proxies-bind.js
similarity index 98%
rename from test/mjsunit/harmony/proxies-bind.js
rename to test/mjsunit/es6/proxies-bind.js
index 9e4c5b7..83876a0 100644
--- a/test/mjsunit/harmony/proxies-bind.js
+++ b/test/mjsunit/es6/proxies-bind.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies --harmony-reflect
-
// Tests the interaction of Function.prototype.bind with proxies.
diff --git a/test/mjsunit/harmony/proxies-construct.js b/test/mjsunit/es6/proxies-construct.js
similarity index 98%
rename from test/mjsunit/harmony/proxies-construct.js
rename to test/mjsunit/es6/proxies-construct.js
index 6e02a47..344c50a 100644
--- a/test/mjsunit/harmony/proxies-construct.js
+++ b/test/mjsunit/es6/proxies-construct.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies --harmony-reflect
-
(function testNonConstructable() {
var proxy = new Proxy({},{});
assertThrows(function(){ new proxy() }, TypeError);
diff --git a/test/mjsunit/harmony/proxies-cross-realm-exception.js b/test/mjsunit/es6/proxies-cross-realm-exception.js
similarity index 95%
rename from test/mjsunit/harmony/proxies-cross-realm-exception.js
rename to test/mjsunit/es6/proxies-cross-realm-exception.js
index 5530a60..ffba5c2 100644
--- a/test/mjsunit/harmony/proxies-cross-realm-exception.js
+++ b/test/mjsunit/es6/proxies-cross-realm-exception.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies --harmony-reflect --allow-natives-syntax
+// Flags: --allow-natives-syntax
// Do not read out the prototype from a cross-realm object.
var realm = Realm.create();
diff --git a/test/mjsunit/harmony/proxies-define-property.js b/test/mjsunit/es6/proxies-define-property.js
similarity index 98%
rename from test/mjsunit/harmony/proxies-define-property.js
rename to test/mjsunit/es6/proxies-define-property.js
index 27f23be..14c95bf 100644
--- a/test/mjsunit/harmony/proxies-define-property.js
+++ b/test/mjsunit/es6/proxies-define-property.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies
-
// Check basic call to trap.
var g_target, g_name, g_desc;
diff --git a/test/mjsunit/harmony/proxies-delete-property.js b/test/mjsunit/es6/proxies-delete-property.js
similarity index 98%
rename from test/mjsunit/harmony/proxies-delete-property.js
rename to test/mjsunit/es6/proxies-delete-property.js
index 27f9c05..7a46b9b 100644
--- a/test/mjsunit/harmony/proxies-delete-property.js
+++ b/test/mjsunit/es6/proxies-delete-property.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies --harmony-reflect
-
var properties =
["bla", "0", 1, Symbol(), {[Symbol.toPrimitive]() {return "a"}}];
diff --git a/test/mjsunit/es6/proxies-example-membrane.js b/test/mjsunit/es6/proxies-example-membrane.js
new file mode 100644
index 0000000..dd373b7
--- /dev/null
+++ b/test/mjsunit/es6/proxies-example-membrane.js
@@ -0,0 +1,308 @@
+// Copyright 2011 the V8 project authors. All rights reserved.
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are
+// met:
+//
+// * Redistributions of source code must retain the above copyright
+// notice, this list of conditions and the following disclaimer.
+// * Redistributions in binary form must reproduce the above
+// copyright notice, this list of conditions and the following
+// disclaimer in the documentation and/or other materials provided
+// with the distribution.
+// * Neither the name of Google Inc. nor the names of its
+// contributors may be used to endorse or promote products derived
+// from this software without specific prior written permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+
+// A simple membrane. Adapted from:
+// http://wiki.ecmascript.org/doku.php?id=harmony:proxies#a_simple_membrane
+
+function createSimpleMembrane(target) {
+ let enabled = true;
+
+ function wrap(obj) {
+ if (obj !== Object(obj)) return obj;
+
+ let handler = new Proxy({}, {get: function(_, key) {
+ if (!enabled) throw new Error("disabled");
+ switch (key) {
+ case "apply":
+ return (_, that, args) => {
+ try {
+ return wrap(Reflect.apply(
+ obj, wrap(that), args.map((x) => wrap(x))));
+ } catch(e) {
+ throw wrap(e);
+ }
+ }
+ case "construct":
+ return (_, args, newt) => {
+ try {
+ return wrap(Reflect.construct(
+ obj, args.map((x) => wrap(x)), wrap(newt)));
+ } catch(e) {
+ throw wrap(e);
+ }
+ }
+ default:
+ return (_, ...args) => {
+ try {
+ return wrap(Reflect[key](obj, ...(args.map(wrap))));
+ } catch(e) {
+ throw wrap(e);
+ }
+ }
+ }
+ }});
+
+ return new Proxy(obj, handler);
+ }
+
+ const gate = Object.freeze({
+ enable: () => enabled = true,
+ disable: () => enabled = false
+ });
+
+ return Object.freeze({
+ wrapper: wrap(target),
+ gate: gate
+ });
+}
+
+
+// Test the simple membrane.
+{
+ var o = {
+ a: 6,
+ b: {bb: 8},
+ f: function(x) { return x },
+ g: function(x) { return x.a },
+ h: function(x) { this.q = x }
+ };
+ o[2] = {c: 7};
+ var m = createSimpleMembrane(o);
+ var w = m.wrapper;
+ var f = w.f;
+ var x = f(66);
+ var x = f({a: 1});
+ var x = w.f({a: 1});
+ var a = x.a;
+ assertEquals(6, w.a);
+ assertEquals(8, w.b.bb);
+ assertEquals(7, w[2]["c"]);
+ assertEquals(undefined, w.c);
+ assertEquals(1, w.f(1));
+ assertEquals(1, w.f({a: 1}).a);
+ assertEquals(2, w.g({a: 2}));
+ assertEquals(3, (w.r = {a: 3}).a);
+ assertEquals(3, w.r.a);
+ assertEquals(3, o.r.a);
+ w.h(3);
+ assertEquals(3, w.q);
+ assertEquals(3, o.q);
+ assertEquals(4, (new w.h(4)).q);
+
+ var wb = w.b;
+ var wr = w.r;
+ var wf = w.f;
+ var wf3 = w.f(3);
+ var wfx = w.f({a: 6});
+ var wgx = w.g({a: {aa: 7}});
+ var wh4 = new w.h(4);
+ m.gate.disable();
+ assertEquals(3, wf3);
+ assertThrows(function() { w.a }, Error);
+ assertThrows(function() { w.r }, Error);
+ assertThrows(function() { w.r = {a: 4} }, Error);
+ assertThrows(function() { o.r.a }, Error);
+ assertEquals("object", typeof o.r);
+ assertEquals(5, (o.r = {a: 5}).a);
+ assertEquals(5, o.r.a);
+ assertThrows(function() { w[1] }, Error);
+ assertThrows(function() { w.c }, Error);
+ assertThrows(function() { wb.bb }, Error);
+ assertThrows(function() { wr.a }, Error);
+ assertThrows(function() { wf(4) }, Error);
+ assertThrows(function() { wfx.a }, Error);
+ assertThrows(function() { wgx.aa }, Error);
+ assertThrows(function() { wh4.q }, Error);
+
+ m.gate.enable();
+ assertEquals(6, w.a);
+ assertEquals(5, w.r.a);
+ assertEquals(5, o.r.a);
+ assertEquals(7, w.r = 7);
+ assertEquals(7, w.r);
+ assertEquals(7, o.r);
+ assertEquals(8, w.b.bb);
+ assertEquals(7, w[2]["c"]);
+ assertEquals(undefined, w.c);
+ assertEquals(8, wb.bb);
+ assertEquals(3, wr.a);
+ assertEquals(4, wf(4));
+ assertEquals(3, wf3);
+ assertEquals(6, wfx.a);
+ assertEquals(7, wgx.aa);
+ assertEquals(4, wh4.q);
+}
+
+
+
+// An identity-preserving membrane. Adapted from:
+// http://wiki.ecmascript.org/doku.php?id=harmony:proxies#an_identity-preserving_membrane
+
+function createMembrane(target) {
+ const wet2dry = 0;
+ const dry2wet = 1;
+
+ function flip(dir) { return (dir + 1) % 2 }
+
+ let maps = [new WeakMap(), new WeakMap()];
+
+ let revoked = false;
+
+ function wrap(dir, obj) {
+ if (obj !== Object(obj)) return obj;
+
+ let wrapper = maps[dir].get(obj);
+ if (wrapper) return wrapper;
+
+ let handler = new Proxy({}, {get: function(_, key) {
+ if (revoked) throw new Error("revoked");
+ switch (key) {
+ case "apply":
+ return (_, that, args) => {
+ try {
+ return wrap(dir, Reflect.apply(
+ obj, wrap(flip(dir), that),
+ args.map((x) => wrap(flip(dir), x))));
+ } catch(e) {
+ throw wrap(dir, e);
+ }
+ }
+ case "construct":
+ return (_, args, newt) => {
+ try {
+ return wrap(dir, Reflect.construct(
+ obj, args.map((x) => wrap(flip(dir), x)),
+ wrap(flip(dir), newt)));
+ } catch(e) {
+ throw wrap(dir, e);
+ }
+ }
+ default:
+ return (_, ...args) => {
+ try {
+ return wrap(dir, Reflect[key](
+ obj, ...(args.map((x) => wrap(flip(dir), x)))))
+ } catch(e) {
+ throw wrap(dir, e);
+ }
+ }
+ }
+ }});
+
+ wrapper = new Proxy(obj, handler);
+ maps[dir].set(obj, wrapper);
+ maps[flip(dir)].set(wrapper, obj);
+ return wrapper;
+ }
+
+ const gate = Object.freeze({
+ revoke: () => revoked = true
+ });
+
+ return Object.freeze({
+ wrapper: wrap(wet2dry, target),
+ gate: gate
+ });
+}
+
+
+// Test the identity-preserving membrane.
+{
+ var receiver
+ var argument
+ var o = {
+ a: 6,
+ b: {bb: 8},
+ f: function(x) {receiver = this; argument = x; return x},
+ g: function(x) {receiver = this; argument = x; return x.a},
+ h: function(x) {receiver = this; argument = x; this.q = x},
+ s: function(x) {receiver = this; argument = x; this.x = {y: x}; return this}
+ }
+ o[2] = {c: 7}
+ var m = createMembrane(o)
+ var w = m.wrapper
+ var f = w.f
+ var x = f(66)
+ var x = f({a: 1})
+ var x = w.f({a: 1})
+ var a = x.a
+ assertEquals(6, w.a)
+ assertEquals(8, w.b.bb)
+ assertEquals(7, w[2]["c"])
+ assertEquals(undefined, w.c)
+ assertEquals(1, w.f(1))
+ assertSame(o, receiver)
+ assertEquals(1, w.f({a: 1}).a)
+ assertSame(o, receiver)
+ assertEquals(2, w.g({a: 2}))
+ assertSame(o, receiver)
+ assertSame(w, w.f(w))
+ assertSame(o, receiver)
+ assertSame(o, argument)
+ assertSame(o, w.f(o))
+ assertSame(o, receiver)
+ // Note that argument !== o, since o isn't dry, so gets wrapped wet again.
+ assertEquals(3, (w.r = {a: 3}).a)
+ assertEquals(3, w.r.a)
+ assertEquals(3, o.r.a)
+ w.h(3)
+ assertEquals(3, w.q)
+ assertEquals(3, o.q)
+ assertEquals(4, (new w.h(4)).q)
+ assertEquals(5, w.s(5).x.y)
+ assertSame(o, receiver)
+
+ var wb = w.b
+ var wr = w.r
+ var wf = w.f
+ var wf3 = w.f(3)
+ var wfx = w.f({a: 6})
+ var wgx = w.g({a: {aa: 7}})
+ var wh4 = new w.h(4)
+ var ws5 = w.s(5)
+ var ws5x = ws5.x
+ m.gate.revoke()
+ assertEquals(3, wf3)
+ assertThrows(function() { w.a }, Error)
+ assertThrows(function() { w.r }, Error)
+ assertThrows(function() { w.r = {a: 4} }, Error)
+ assertThrows(function() { o.r.a }, Error)
+ assertEquals("object", typeof o.r)
+ assertEquals(5, (o.r = {a: 5}).a)
+ assertEquals(5, o.r.a)
+ assertThrows(function() { w[1] }, Error)
+ assertThrows(function() { w.c }, Error)
+ assertThrows(function() { wb.bb }, Error)
+ assertEquals(3, wr.a)
+ assertThrows(function() { wf(4) }, Error)
+ assertEquals(6, wfx.a)
+ assertEquals(7, wgx.aa)
+ assertThrows(function() { wh4.q }, Error)
+ assertThrows(function() { ws5.x }, Error)
+ assertThrows(function() { ws5x.y }, Error)
+}
diff --git a/test/mjsunit/harmony/proxies-for.js b/test/mjsunit/es6/proxies-for.js
similarity index 64%
rename from test/mjsunit/harmony/proxies-for.js
rename to test/mjsunit/es6/proxies-for.js
index e52ee43..5b81845 100644
--- a/test/mjsunit/harmony/proxies-for.js
+++ b/test/mjsunit/es6/proxies-for.js
@@ -25,8 +25,6 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --harmony-proxies
-
// Helper.
function TestWithProxies(test, x, y, z) {
@@ -125,16 +123,96 @@
}
}));
-(function() {
- var p = new Proxy({}, {ownKeys:function() { return ["0"]; }});
+
+function keys(object) {
+ var keys = [];
+ for (var k in object) {
+ keys.push(k);
+ }
+ return keys;
+}
+
+(function testKeysProxyOnProtoEmpty() {
+ var p = new Proxy({}, {
+ ownKeys() { return []; },
+ });
var o = [0];
o.__proto__ = p;
- var keys = [];
- for (var k in o) { keys.push(k); };
- assertEquals(["0"], keys);
+ assertEquals(["0"], keys(o));
+
+ delete o[0];
+ assertEquals([], keys(o));
})();
+(function testKeysProxyOnProto() {
+ var handler = {ownKeys() { return ["0"]; }};
+ var proxy = new Proxy({}, handler);
+ var object = [0];
+ object.__proto__ = proxy;
+ assertEquals(["0"], keys(object));
+
+ // The Proxy doesn't set his ownKeys enumerable.
+ delete object[0];
+ assertEquals([], keys(object));
+
+ // The [[Has]] trap has no influence on which are enumerable properties are
+ // shown in for-in.
+ handler.has = function() { return true };
+ assertEquals([], keys(object));
+
+ handler.getOwnPropertyDescriptor = function() {
+ return {enumerable: true, configurable: true}
+ }
+ assertEquals(["0"], keys(object));
+})();
+
+(function testKeysProxyProto() {
+ var target = {t1:true, t2:true};
+ var handler = {};
+ var proxy = new Proxy(target, handler);
+
+ assertEquals(["t1", "t2"], keys(proxy));
+
+ target.__proto__ = {p1:true, p2:true};
+ assertEquals(["t1", "t2", "p1", "p2"], keys(proxy));
+
+ handler.getPrototypeOf = function(target) {
+ return {p3:true, p4:true};
+ };
+ // for-in walks the prototype chain for the [[Has]] / Enumerable check.
+ assertEquals(["t1", "t2", "p3", "p4"], keys(proxy));
+
+ // [[Has]] is not used in for-in.
+ handler.has = function() { return false };
+ assertEquals(["t1", "t2", "p3", "p4"], keys(proxy));
+
+ // Proxy intercepts enumerability check.
+ handler.getOwnPropertyDescriptor = function() {
+ return {enumerable: false, configurable: true}
+ }
+ assertEquals([], keys(proxy));
+
+ handler.getOwnPropertyDescriptor = function() {
+ return {enumerable: true, configurable: true}
+ }
+ assertEquals(["t1", "t2", "p3", "p4"], keys(proxy));
+
+ handler.getOwnPropertyDescriptor = function(target, key) {
+ return {
+ enumerable: key in target,
+ configurable: true
+ }
+ }
+ assertEquals(["t1", "t2"], keys(proxy));
+
+ handler.getPrototypeOf = function() { throw "error" };
+ assertThrowsEquals(() => {keys(proxy)}, "error");
+})();
+
+
(function () {
- var p = new Proxy({}, {ownKeys: function() { return ["1", Symbol(), "2"] }});
+ var symbol = Symbol();
+ var p = new Proxy({}, {ownKeys() { return ["1", symbol, "2"] }});
assertEquals(["1","2"], Object.getOwnPropertyNames(p));
+ assertEquals([symbol], Object.getOwnPropertySymbols(p));
})();
diff --git a/test/mjsunit/es6/proxies-function.js b/test/mjsunit/es6/proxies-function.js
new file mode 100644
index 0000000..cb3a26c
--- /dev/null
+++ b/test/mjsunit/es6/proxies-function.js
@@ -0,0 +1,630 @@
+// Copyright 2011 the V8 project authors. All rights reserved.
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are
+// met:
+//
+// * Redistributions of source code must retain the above copyright
+// notice, this list of conditions and the following disclaimer.
+// * Redistributions in binary form must reproduce the above
+// copyright notice, this list of conditions and the following
+// disclaimer in the documentation and/or other materials provided
+// with the distribution.
+// * Neither the name of Google Inc. nor the names of its
+// contributors may be used to endorse or promote products derived
+// from this software without specific prior written permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+// Flags: --allow-natives-syntax
+
+
+var handler = {
+ get : function(r, n) { return n == "length" ? 2 : undefined }
+}
+
+
+// Calling (call, Function.prototype.call, Function.prototype.apply,
+// Function.prototype.bind).
+
+var global_object = this
+var receiver
+
+function TestCall(isStrict, callTrap) {
+ assertEquals(42, callTrap(undefined, undefined, [5, 37]))
+
+ var handler = {
+ get: function(r, k) {
+ return k == "length" ? 2 : Function.prototype[k]
+ },
+ apply: callTrap
+ }
+ var f = new Proxy(()=>{}, handler)
+ var o = {f: f}
+ global_object.f = f
+
+ receiver = 333
+ assertEquals(42, f(11, 31))
+ receiver = 333
+ assertEquals(42, o.f(10, 32))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(42, o["f"](9, 33))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(42, (1, o).f(8, 34))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(42, (1, o)["f"](7, 35))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(42, f.call(o, 32, 10))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(42, f.call(undefined, 33, 9))
+ receiver = 333
+ assertEquals(42, f.call(null, 33, 9))
+ receiver = 333
+ assertEquals(44, f.call(2, 21, 23))
+ assertSame(2, receiver.valueOf())
+ receiver = 333
+ assertEquals(42, Function.prototype.call.call(f, o, 20, 22))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(43, Function.prototype.call.call(f, null, 20, 23))
+ assertEquals(44, Function.prototype.call.call(f, 2, 21, 23))
+ assertEquals(2, receiver.valueOf())
+ receiver = 333
+ assertEquals(32, f.apply(o, [16, 16]))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(32, Function.prototype.apply.call(f, o, [17, 15]))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(42, %Call(f, o, 11, 31));
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(42, %Call(f, null, 11, 31));
+ receiver = 333
+ assertEquals(42, %_Call(f, o, 11, 31))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(42, %_Call(f, null, 11, 31))
+
+ var ff = Function.prototype.bind.call(f, o, 12)
+ assertTrue(ff.length <= 1) // TODO(rossberg): Not spec'ed yet, be lax.
+ receiver = 333
+ assertEquals(42, ff(30))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(33, Function.prototype.call.call(ff, {}, 21))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(32, Function.prototype.apply.call(ff, {}, [20]))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(23, %Call(ff, {}, 11));
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(23, %Call(ff, {}, 11, 3));
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(34, %_Call(ff, {}, 22))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(34, %_Call(ff, {}, 22, 3))
+ assertSame(o, receiver)
+
+ var fff = Function.prototype.bind.call(ff, o, 30)
+ assertEquals(0, fff.length)
+ receiver = 333
+ assertEquals(42, fff())
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(42, Function.prototype.call.call(fff, {}))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(42, Function.prototype.apply.call(fff, {}))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(42, %Call(fff, {}));
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(42, %Call(fff, {}, 11, 3))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(42, %_Call(fff, {}))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(42, %_Call(fff, {}, 3, 4, 5))
+ assertSame(o, receiver)
+
+ var f = new Proxy(()=>{}, {apply: callTrap})
+ receiver = 333
+ assertEquals(42, f(11, 31))
+ var o = {f: f}
+ receiver = 333
+ assertEquals(42, o.f(10, 32))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(42, o["f"](9, 33))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(42, (1, o).f(8, 34))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(42, (1, o)["f"](7, 35))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(42, Function.prototype.call.call(f, o, 20, 22))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(32, Function.prototype.apply.call(f, o, [17, 15]))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(23, %Call(f, o, 11, 12))
+ assertSame(o, receiver)
+ receiver = 333
+ assertEquals(42, %_Call(f, o, 18, 24))
+ assertSame(o, receiver)
+}
+
+TestCall(false, function(_, that, [x, y]) {
+ receiver = that
+ return x + y
+})
+
+TestCall(true, function(_, that, args) {
+ "use strict"
+ receiver = that
+ return args[0] + args[1]
+})
+
+TestCall(false, function() {
+ receiver = arguments[1]
+ return arguments[2][0] + arguments[2][1]
+})
+
+TestCall(false, new Proxy(function(_, that, [x, y]) {
+ receiver = that
+ return x + y
+ }, handler))
+
+TestCall(true, new Proxy(function(_, that, args) {
+ "use strict"
+ receiver = that
+ return args[0] + args[1]
+ }, handler))
+
+TestCall(false, Object.freeze(new Proxy(function(_, that, [x, y]) {
+ receiver = that
+ return x + y
+ }, handler)))
+
+
+
+// Using intrinsics as call traps.
+
+function TestCallIntrinsic(type, callTrap) {
+ var f = new Proxy(()=>{}, {apply: (_, that, args) => callTrap(...args)})
+ var x = f()
+ assertTrue(typeof x == type)
+}
+
+TestCallIntrinsic("boolean", Boolean)
+TestCallIntrinsic("number", Number)
+TestCallIntrinsic("string", String)
+TestCallIntrinsic("object", Object)
+TestCallIntrinsic("function", Function)
+
+
+
+// Throwing from call trap.
+
+function TestCallThrow(callTrap) {
+ var f = new Proxy(()=>{}, {apply: callTrap})
+ assertThrowsEquals(() => f(11), "myexn")
+ assertThrowsEquals(() => ({x: f}).x(11), "myexn")
+ assertThrowsEquals(() => ({x: f})["x"](11), "myexn")
+ assertThrowsEquals(() => Function.prototype.call.call(f, {}, 2), "myexn")
+ assertThrowsEquals(() => Function.prototype.apply.call(f, {}, [1]), "myexn")
+ assertThrowsEquals(() => %Call(f, {}), "myexn")
+ assertThrowsEquals(() => %Call(f, {}, 1, 2), "myexn")
+ assertThrowsEquals(() => %_Call(f, {}), "myexn")
+ assertThrowsEquals(() => %_Call(f, {}, 1, 2), "myexn")
+
+ var f = Object.freeze(new Proxy(()=>{}, {apply: callTrap}))
+ assertThrowsEquals(() => f(11), "myexn")
+ assertThrowsEquals(() => ({x: f}).x(11), "myexn")
+ assertThrowsEquals(() => ({x: f})["x"](11), "myexn")
+ assertThrowsEquals(() => Function.prototype.call.call(f, {}, 2), "myexn")
+ assertThrowsEquals(() => Function.prototype.apply.call(f, {}, [1]), "myexn")
+ assertThrowsEquals(() => %Call(f, {}), "myexn")
+ assertThrowsEquals(() => %Call(f, {}, 1, 2), "myexn")
+ assertThrowsEquals(() => %_Call(f, {}), "myexn")
+ assertThrowsEquals(() => %_Call(f, {}, 1, 2), "myexn")
+}
+
+TestCallThrow(function() { throw "myexn" })
+TestCallThrow(new Proxy(() => {throw "myexn"}, {}))
+TestCallThrow(Object.freeze(new Proxy(() => {throw "myexn"}, {})))
+
+
+
+// Construction (new).
+
+var prototype = {myprop: 0}
+var receiver
+
+var handlerWithPrototype = {
+ get: function(r, n) {
+ if (n == "length") return 2;
+ assertEquals("prototype", n);
+ return prototype;
+ }
+}
+
+var handlerSansPrototype = {
+ get: function(r, n) {
+ if (n == "length") return 2;
+ assertEquals("prototype", n);
+ return undefined;
+ }
+}
+
+function ReturnUndef(_, args, newt) {
+ "use strict";
+ newt.sum = args[0] + args[1];
+}
+
+function ReturnThis(x, y) {
+ "use strict";
+ receiver = this;
+ this.sum = x + y;
+ return this;
+}
+
+function ReturnNew(_, args, newt) {
+ "use strict";
+ return {sum: args[0] + args[1]};
+}
+
+function ReturnNewWithProto(_, args, newt) {
+ "use strict";
+ var result = Object.create(prototype);
+ result.sum = args[0] + args[1];
+ return result;
+}
+
+function TestConstruct(proto, constructTrap) {
+ TestConstruct2(proto, constructTrap, handlerWithPrototype)
+ TestConstruct2(proto, constructTrap, handlerSansPrototype)
+}
+
+function TestConstruct2(proto, constructTrap, handler) {
+ var f = new Proxy(function(){}, {construct: constructTrap})
+ var o = new f(11, 31)
+ assertEquals(42, o.sum)
+ assertSame(proto, Object.getPrototypeOf(o))
+
+ var f = Object.freeze(new Proxy(function(){}, {construct: constructTrap}))
+ var o = new f(11, 32)
+ assertEquals(43, o.sum)
+ assertSame(proto, Object.getPrototypeOf(o))
+}
+
+TestConstruct(Object.prototype, ReturnNew)
+TestConstruct(prototype, ReturnNewWithProto)
+
+TestConstruct(Object.prototype, new Proxy(ReturnNew, {}))
+TestConstruct(prototype, new Proxy(ReturnNewWithProto, {}))
+
+TestConstruct(Object.prototype, Object.freeze(new Proxy(ReturnNew, {})))
+TestConstruct(prototype, Object.freeze(new Proxy(ReturnNewWithProto, {})))
+
+
+
+// Throwing from the construct trap.
+
+function TestConstructThrow(trap) {
+ var f = new Proxy(function(){}, {construct: trap});
+ assertThrowsEquals(() => new f(11), "myexn")
+ Object.freeze(f)
+ assertThrowsEquals(() => new f(11), "myexn")
+}
+
+TestConstructThrow(function() { throw "myexn" })
+TestConstructThrow(new Proxy(function() { throw "myexn" }, {}))
+TestConstructThrow(Object.freeze(new Proxy(function() { throw "myexn" }, {})))
+
+
+
+// Using function proxies as getters and setters.
+
+var value
+var receiver
+
+function TestAccessorCall(getterCallTrap, setterCallTrap) {
+ var pgetter = new Proxy(()=>{}, {apply: getterCallTrap})
+ var psetter = new Proxy(()=>{}, {apply: setterCallTrap})
+
+ var o = {}
+ var oo = Object.create(o)
+ Object.defineProperty(o, "a", {get: pgetter, set: psetter})
+ Object.defineProperty(o, "b", {get: pgetter})
+ Object.defineProperty(o, "c", {set: psetter})
+ Object.defineProperty(o, "3", {get: pgetter, set: psetter})
+ Object.defineProperty(oo, "a", {value: 43})
+
+ receiver = ""
+ assertEquals(42, o.a)
+ assertSame(o, receiver)
+ receiver = ""
+ assertEquals(42, o.b)
+ assertSame(o, receiver)
+ receiver = ""
+ assertEquals(undefined, o.c)
+ assertEquals("", receiver)
+ receiver = ""
+ assertEquals(42, o["a"])
+ assertSame(o, receiver)
+ receiver = ""
+ assertEquals(42, o[3])
+ assertSame(o, receiver)
+
+ receiver = ""
+ assertEquals(43, oo.a)
+ assertEquals("", receiver)
+ receiver = ""
+ assertEquals(42, oo.b)
+ assertSame(oo, receiver)
+ receiver = ""
+ assertEquals(undefined, oo.c)
+ assertEquals("", receiver)
+ receiver = ""
+ assertEquals(43, oo["a"])
+ assertEquals("", receiver)
+ receiver = ""
+ assertEquals(42, oo[3])
+ assertSame(oo, receiver)
+
+ receiver = ""
+ assertEquals(50, o.a = 50)
+ assertSame(o, receiver)
+ assertEquals(50, value)
+ receiver = ""
+ assertEquals(51, o.b = 51)
+ assertEquals("", receiver)
+ assertEquals(50, value) // no setter
+ assertThrows(function() { "use strict"; o.b = 51 }, TypeError)
+ receiver = ""
+ assertEquals(52, o.c = 52)
+ assertSame(o, receiver)
+ assertEquals(52, value)
+ receiver = ""
+ assertEquals(53, o["a"] = 53)
+ assertSame(o, receiver)
+ assertEquals(53, value)
+ receiver = ""
+ assertEquals(54, o[3] = 54)
+ assertSame(o, receiver)
+ assertEquals(54, value)
+
+ value = 0
+ receiver = ""
+ assertEquals(60, oo.a = 60)
+ assertEquals("", receiver)
+ assertEquals(0, value) // oo has own 'a'
+ assertEquals(61, oo.b = 61)
+ assertSame("", receiver)
+ assertEquals(0, value) // no setter
+ assertThrows(function() { "use strict"; oo.b = 61 }, TypeError)
+ receiver = ""
+ assertEquals(62, oo.c = 62)
+ assertSame(oo, receiver)
+ assertEquals(62, value)
+ receiver = ""
+ assertEquals(63, oo["c"] = 63)
+ assertSame(oo, receiver)
+ assertEquals(63, value)
+ receiver = ""
+ assertEquals(64, oo[3] = 64)
+ assertSame(oo, receiver)
+ assertEquals(64, value)
+}
+
+TestAccessorCall(
+ function(_, that) { receiver = that; return 42 },
+ function(_, that, [x]) { receiver = that; value = x }
+)
+
+TestAccessorCall(
+ function(_, that) { "use strict"; receiver = that; return 42 },
+ function(_, that, args) { "use strict"; receiver = that; value = args[0] }
+)
+
+TestAccessorCall(
+ new Proxy(function(_, that) { receiver = that; return 42 }, {}),
+ new Proxy(function(_, that, [x]) { receiver = that; value = x }, {})
+)
+
+TestAccessorCall(
+ Object.freeze(
+ new Proxy(function(_, that) { receiver = that; return 42 }, {})),
+ Object.freeze(
+ new Proxy(function(_, that, [x]) { receiver = that; value = x }, {}))
+)
+
+
+// Passing a proxy function to higher-order library functions.
+
+function TestHigherOrder(f) {
+ assertEquals(6, [6, 2].map(f)[0])
+ assertEquals(4, [5, 2].reduce(f, 4))
+ assertTrue([1, 2].some(f))
+ assertEquals("a.b.c", "a.b.c".replace(".", f))
+}
+
+TestHigherOrder(function(x) { return x })
+TestHigherOrder(function(x) { "use strict"; return x })
+TestHigherOrder(new Proxy(function(x) { return x }, {}))
+TestHigherOrder(Object.freeze(new Proxy(function(x) { return x }, {})))
+
+
+
+// TODO(rossberg): Ultimately, I want to have the following test function
+// run through, but it currently fails on so many cases (some not even
+// involving proxies), that I leave that for later...
+/*
+function TestCalls() {
+ var handler = {
+ get: function(r, k) {
+ return k == "length" ? 2 : Function.prototype[k]
+ }
+ }
+ var bind = Function.prototype.bind
+ var o = {}
+
+ var traps = [
+ function(x, y) {
+ return {receiver: this, result: x + y, strict: false}
+ },
+ function(x, y) { "use strict";
+ return {receiver: this, result: x + y, strict: true}
+ },
+ function() {
+ var x = arguments[0], y = arguments[1]
+ return {receiver: this, result: x + y, strict: false}
+ },
+ Proxy.createFunction(handler, function(x, y) {
+ return {receiver: this, result: x + y, strict: false}
+ }),
+ Proxy.createFunction(handler, function() {
+ var x = arguments[0], y = arguments[1]
+ return {receiver: this, result: x + y, strict: false}
+ }),
+ Proxy.createFunction(handler, function(x, y) { "use strict"
+ return {receiver: this, result: x + y, strict: true}
+ }),
+ CreateFrozen(handler, function(x, y) {
+ return {receiver: this, result: x + y, strict: false}
+ }),
+ CreateFrozen(handler, function(x, y) { "use strict"
+ return {receiver: this, result: x + y, strict: true}
+ }),
+ ]
+ var creates = [
+ function(trap) { return trap },
+ function(trap) { return CreateFrozen({}, callTrap) },
+ function(trap) { return Proxy.createFunction(handler, callTrap) },
+ function(trap) {
+ return Proxy.createFunction(handler, CreateFrozen({}, callTrap))
+ },
+ function(trap) {
+ return Proxy.createFunction(handler, Proxy.createFunction(handler, callTrap))
+ },
+ ]
+ var binds = [
+ function(f, o, x, y) { return f },
+ function(f, o, x, y) { return bind.call(f, o) },
+ function(f, o, x, y) { return bind.call(f, o, x) },
+ function(f, o, x, y) { return bind.call(f, o, x, y) },
+ function(f, o, x, y) { return bind.call(f, o, x, y, 5) },
+ function(f, o, x, y) { return bind.call(bind.call(f, o), {}, x, y) },
+ function(f, o, x, y) { return bind.call(bind.call(f, o, x), {}, y) },
+ function(f, o, x, y) { return bind.call(bind.call(f, o, x, y), {}, 5) },
+ ]
+ var calls = [
+ function(f, x, y) { return f(x, y) },
+ function(f, x, y) { var g = f; return g(x, y) },
+ function(f, x, y) { with ({}) return f(x, y) },
+ function(f, x, y) { var g = f; with ({}) return g(x, y) },
+ function(f, x, y, o) { with (o) return f(x, y) },
+ function(f, x, y, o) { return f.call(o, x, y) },
+ function(f, x, y, o) { return f.apply(o, [x, y]) },
+ function(f, x, y, o) { return Function.prototype.call.call(f, o, x, y) },
+ function(f, x, y, o) { return Function.prototype.apply.call(f, o, [x, y]) },
+ function(f, x, y, o) { return %_Call(f, o, x, y) },
+ function(f, x, y, o) { return %Call(f, o, x, y) },
+ function(f, x, y, o) { return %Apply(f, o, [null, x, y, null], 1, 2) },
+ function(f, x, y, o) { return %Apply(f, o, arguments, 2, 2) },
+ function(f, x, y, o) { if (typeof o == "object") return o.f(x, y) },
+ function(f, x, y, o) { if (typeof o == "object") return o["f"](x, y) },
+ function(f, x, y, o) { if (typeof o == "object") return (1, o).f(x, y) },
+ function(f, x, y, o) { if (typeof o == "object") return (1, o)["f"](x, y) },
+ ]
+ var receivers = [o, global_object, undefined, null, 2, "bla", true]
+ var expectedSloppies = [o, global_object, global_object, global_object]
+
+ for (var t = 0; t < traps.length; ++t) {
+ for (var i = 0; i < creates.length; ++i) {
+ for (var j = 0; j < binds.length; ++j) {
+ for (var k = 0; k < calls.length; ++k) {
+ for (var m = 0; m < receivers.length; ++m) {
+ for (var n = 0; n < receivers.length; ++n) {
+ var bound = receivers[m]
+ var receiver = receivers[n]
+ var func = binds[j](creates[i](traps[t]), bound, 31, 11)
+ var expected = j > 0 ? bound : receiver
+ var expectedSloppy = expectedSloppies[j > 0 ? m : n]
+ o.f = func
+ global_object.f = func
+ var x = calls[k](func, 11, 31, receiver)
+ if (x !== undefined) {
+ assertEquals(42, x.result)
+ if (calls[k].length < 4)
+ assertSame(x.strict ? undefined : global_object, x.receiver)
+ else if (x.strict)
+ assertSame(expected, x.receiver)
+ else if (expectedSloppy === undefined)
+ assertSame(expected, x.receiver.valueOf())
+ else
+ assertSame(expectedSloppy, x.receiver)
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+}
+
+TestCalls()
+*/
+
+var realms = [Realm.create(), Realm.create()];
+Realm.shared = {};
+
+Realm.eval(realms[0], "function f(_, that) { return that; };");
+Realm.eval(realms[0], "Realm.shared.f = f;");
+Realm.eval(realms[0], "Realm.shared.fg = this;");
+Realm.eval(realms[1], "function g(_, that) { return that; };");
+Realm.eval(realms[1], "Realm.shared.g = g;");
+Realm.eval(realms[1], "Realm.shared.gg = this;");
+
+var fp = new Proxy(()=>{}, {apply: Realm.shared.f});
+var gp = new Proxy(()=>{}, {apply: Realm.shared.g});
+
+for (var i = 0; i < 10; i++) {
+ assertEquals(undefined, fp());
+ assertEquals(undefined, gp());
+
+ with (this) {
+ assertEquals(this, fp());
+ assertEquals(this, gp());
+ }
+
+ with ({}) {
+ assertEquals(undefined, fp());
+ assertEquals(undefined, gp());
+ }
+}
diff --git a/test/mjsunit/harmony/proxies-get-own-property-descriptor.js b/test/mjsunit/es6/proxies-get-own-property-descriptor.js
similarity index 99%
rename from test/mjsunit/harmony/proxies-get-own-property-descriptor.js
rename to test/mjsunit/es6/proxies-get-own-property-descriptor.js
index f7dff61..441ff16 100644
--- a/test/mjsunit/harmony/proxies-get-own-property-descriptor.js
+++ b/test/mjsunit/es6/proxies-get-own-property-descriptor.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies
-
var target = {};
var configurable_desc = {
value: 123,
diff --git a/test/mjsunit/harmony/proxies-get-prototype-of.js b/test/mjsunit/es6/proxies-get-prototype-of.js
similarity index 98%
rename from test/mjsunit/harmony/proxies-get-prototype-of.js
rename to test/mjsunit/es6/proxies-get-prototype-of.js
index 36f6735..a628f3f 100644
--- a/test/mjsunit/harmony/proxies-get-prototype-of.js
+++ b/test/mjsunit/es6/proxies-get-prototype-of.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies
-
var target = { target: 1 };
target.__proto__ = {};
var handler = { handler: 1 };
diff --git a/test/mjsunit/harmony/proxies-get.js b/test/mjsunit/es6/proxies-get.js
similarity index 97%
rename from test/mjsunit/harmony/proxies-get.js
rename to test/mjsunit/es6/proxies-get.js
index 04ebd31..b1b92db 100644
--- a/test/mjsunit/harmony/proxies-get.js
+++ b/test/mjsunit/es6/proxies-get.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies --harmony-reflect --allow-natives-syntax
+// Flags: --allow-natives-syntax
(function testBasicFunctionality() {
var target = {
diff --git a/test/mjsunit/harmony/proxies-global-reference.js b/test/mjsunit/es6/proxies-global-reference.js
similarity index 93%
rename from test/mjsunit/harmony/proxies-global-reference.js
rename to test/mjsunit/es6/proxies-global-reference.js
index 1b77e66..975d7f7 100644
--- a/test/mjsunit/harmony/proxies-global-reference.js
+++ b/test/mjsunit/es6/proxies-global-reference.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies
-
var failing_proxy = new Proxy({}, new Proxy({}, {
get() { throw "No trap should fire" }}));
diff --git a/test/mjsunit/harmony/proxies-has-own-property.js b/test/mjsunit/es6/proxies-has-own-property.js
similarity index 97%
rename from test/mjsunit/harmony/proxies-has-own-property.js
rename to test/mjsunit/es6/proxies-has-own-property.js
index 1455d2b..5b9ddbc 100644
--- a/test/mjsunit/harmony/proxies-has-own-property.js
+++ b/test/mjsunit/es6/proxies-has-own-property.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies
-
var handler = {};
var target = {a:1};
var proxy = new Proxy(target, handler);
diff --git a/test/mjsunit/harmony/proxies-has.js b/test/mjsunit/es6/proxies-has.js
similarity index 98%
rename from test/mjsunit/harmony/proxies-has.js
rename to test/mjsunit/es6/proxies-has.js
index b7848e8..7294196 100644
--- a/test/mjsunit/harmony/proxies-has.js
+++ b/test/mjsunit/es6/proxies-has.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies
-
var target = {
"target_one": 1
};
diff --git a/test/mjsunit/harmony/proxies-hash.js b/test/mjsunit/es6/proxies-hash.js
similarity index 98%
rename from test/mjsunit/harmony/proxies-hash.js
rename to test/mjsunit/es6/proxies-hash.js
index 830facb..05433f0 100644
--- a/test/mjsunit/harmony/proxies-hash.js
+++ b/test/mjsunit/es6/proxies-hash.js
@@ -25,8 +25,6 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --harmony-proxies
-
// Helper.
diff --git a/test/mjsunit/harmony/proxies-integrity.js b/test/mjsunit/es6/proxies-integrity.js
similarity index 98%
rename from test/mjsunit/harmony/proxies-integrity.js
rename to test/mjsunit/es6/proxies-integrity.js
index 9ed6005..4cdf770 100644
--- a/test/mjsunit/harmony/proxies-integrity.js
+++ b/test/mjsunit/es6/proxies-integrity.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies --harmony-reflect
-
function toKey(x) {
diff --git a/test/mjsunit/harmony/proxies-is-extensible.js b/test/mjsunit/es6/proxies-is-extensible.js
similarity index 97%
rename from test/mjsunit/harmony/proxies-is-extensible.js
rename to test/mjsunit/es6/proxies-is-extensible.js
index f597d0d..9ab2c05 100644
--- a/test/mjsunit/harmony/proxies-is-extensible.js
+++ b/test/mjsunit/es6/proxies-is-extensible.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies --harmony-reflect
-
(function () {
// No trap.
diff --git a/test/mjsunit/harmony/proxies-json.js b/test/mjsunit/es6/proxies-json.js
similarity index 97%
rename from test/mjsunit/harmony/proxies-json.js
rename to test/mjsunit/es6/proxies-json.js
index 19a1329..d48d539 100644
--- a/test/mjsunit/harmony/proxies-json.js
+++ b/test/mjsunit/es6/proxies-json.js
@@ -25,8 +25,6 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --harmony-proxies --harmony-reflect
-
///////////////////////////////////////////////////////////////////////////////
@@ -129,9 +127,6 @@
get: function(target, name) {
return 0;
},
- enumerate: function(target) {
- return [][Symbol.iterator]();
- },
has: function() {
return true;
},
@@ -152,8 +147,8 @@
if (name == 'z') return 97000;
return function(key) { return key.charCodeAt(0) + this.z; };
},
- enumerate: function(target) {
- return ['toJSON', 'z'][Symbol.iterator]();
+ ownKeys: function(target) {
+ return ['toJSON', 'z'];
},
has: function() {
return true;
@@ -173,8 +168,8 @@
get: function(target, name) {
return function(key) { return undefined; };
},
- enumerate: function(target) {
- return ['toJSON'][Symbol.iterator]();
+ ownKeys: function(target) {
+ return ['toJSON'];
},
has: function() {
return true;
diff --git a/test/mjsunit/harmony/proxies-keys.js b/test/mjsunit/es6/proxies-keys.js
similarity index 97%
rename from test/mjsunit/harmony/proxies-keys.js
rename to test/mjsunit/es6/proxies-keys.js
index 61a39f4..7344032 100644
--- a/test/mjsunit/harmony/proxies-keys.js
+++ b/test/mjsunit/es6/proxies-keys.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies
-
var target = {
target: 1
};
diff --git a/test/mjsunit/harmony/proxies-object-assign.js b/test/mjsunit/es6/proxies-object-assign.js
similarity index 95%
rename from test/mjsunit/harmony/proxies-object-assign.js
rename to test/mjsunit/es6/proxies-object-assign.js
index 154f8c1..c350f4e 100644
--- a/test/mjsunit/harmony/proxies-object-assign.js
+++ b/test/mjsunit/es6/proxies-object-assign.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies
-
var handler = {
ownKeys: function(t) { return ["a", "b"]; },
getOwnPropertyDescriptor: function(t, p) {
diff --git a/test/mjsunit/harmony/proxies-ownkeys.js b/test/mjsunit/es6/proxies-ownkeys.js
similarity index 98%
rename from test/mjsunit/harmony/proxies-ownkeys.js
rename to test/mjsunit/es6/proxies-ownkeys.js
index 88350cc..7cc0a87 100644
--- a/test/mjsunit/harmony/proxies-ownkeys.js
+++ b/test/mjsunit/es6/proxies-ownkeys.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies --harmony-reflect
-
var target = {
"target_one": 1
};
diff --git a/test/mjsunit/harmony/proxies-prevent-extensions.js b/test/mjsunit/es6/proxies-prevent-extensions.js
similarity index 97%
rename from test/mjsunit/harmony/proxies-prevent-extensions.js
rename to test/mjsunit/es6/proxies-prevent-extensions.js
index 0d6ae4c..dc3c42e 100644
--- a/test/mjsunit/harmony/proxies-prevent-extensions.js
+++ b/test/mjsunit/es6/proxies-prevent-extensions.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies --harmony-reflect
-
(function () {
// No trap.
diff --git a/test/mjsunit/harmony/proxies-property-is-enumerable.js b/test/mjsunit/es6/proxies-property-is-enumerable.js
similarity index 96%
rename from test/mjsunit/harmony/proxies-property-is-enumerable.js
rename to test/mjsunit/es6/proxies-property-is-enumerable.js
index b1742e2..0d4a92f 100644
--- a/test/mjsunit/harmony/proxies-property-is-enumerable.js
+++ b/test/mjsunit/es6/proxies-property-is-enumerable.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies
-
var handler = {};
var target = { a: 1 };
var proxy = new Proxy(target, handler);
diff --git a/test/mjsunit/harmony/proxies-prototype-handler-stackoverflow.js b/test/mjsunit/es6/proxies-prototype-handler-stackoverflow.js
similarity index 97%
rename from test/mjsunit/harmony/proxies-prototype-handler-stackoverflow.js
rename to test/mjsunit/es6/proxies-prototype-handler-stackoverflow.js
index e88476d..3da36c4 100644
--- a/test/mjsunit/harmony/proxies-prototype-handler-stackoverflow.js
+++ b/test/mjsunit/es6/proxies-prototype-handler-stackoverflow.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies --harmony-reflect --stack-size=100
+// Flags: --stack-size=100
// Test that traps that involve walking the target object's prototype chain
// don't overflow the stack when the original proxy is on that chain.
diff --git a/test/mjsunit/harmony/proxies-prototype-target-stackoverflow.js b/test/mjsunit/es6/proxies-prototype-target-stackoverflow.js
similarity index 97%
rename from test/mjsunit/harmony/proxies-prototype-target-stackoverflow.js
rename to test/mjsunit/es6/proxies-prototype-target-stackoverflow.js
index ba55f6a..741a8b0 100644
--- a/test/mjsunit/harmony/proxies-prototype-target-stackoverflow.js
+++ b/test/mjsunit/es6/proxies-prototype-target-stackoverflow.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies --harmony-reflect
-
// Test that traps that involve walking the target object's prototype chain
// don't overflow the stack when the original proxy is on that chain.
diff --git a/test/mjsunit/harmony/proxies-revocable.js b/test/mjsunit/es6/proxies-revocable.js
similarity index 89%
rename from test/mjsunit/harmony/proxies-revocable.js
rename to test/mjsunit/es6/proxies-revocable.js
index d0d0f78..1f61174 100644
--- a/test/mjsunit/harmony/proxies-revocable.js
+++ b/test/mjsunit/es6/proxies-revocable.js
@@ -2,15 +2,12 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies --harmony-reflect
-
traps = [
"getPrototypeOf", "setPrototypeOf", "isExtensible", "preventExtensions",
"getOwnPropertyDescriptor", "has", "get", "set", "deleteProperty",
"defineProperty", "ownKeys", "apply", "construct"
];
-// TODO(neis): Fix enumerate.
var {proxy, revoke} = Proxy.revocable({}, {});
assertEquals(0, revoke.length);
diff --git a/test/mjsunit/harmony/proxies-set-prototype-of.js b/test/mjsunit/es6/proxies-set-prototype-of.js
similarity index 98%
rename from test/mjsunit/harmony/proxies-set-prototype-of.js
rename to test/mjsunit/es6/proxies-set-prototype-of.js
index 810c219..9d9e73f 100644
--- a/test/mjsunit/harmony/proxies-set-prototype-of.js
+++ b/test/mjsunit/es6/proxies-set-prototype-of.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies --harmony-reflect
-
var target = { target: 1 };
target.__proto__ = {};
var handler = { handler: 1 };
diff --git a/test/mjsunit/harmony/proxies-set.js b/test/mjsunit/es6/proxies-set.js
similarity index 99%
rename from test/mjsunit/harmony/proxies-set.js
rename to test/mjsunit/es6/proxies-set.js
index 2fec115..19f39f9 100644
--- a/test/mjsunit/harmony/proxies-set.js
+++ b/test/mjsunit/es6/proxies-set.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies --harmony-reflect
-
function sloppyDefaultSet(o, p, v) { return o[p] = v }
function sloppyReflectSet(o, p, v) { return Reflect.set(o, p, v) }
diff --git a/test/mjsunit/harmony/proxies-with-unscopables.js b/test/mjsunit/es6/proxies-with-unscopables.js
similarity index 98%
rename from test/mjsunit/harmony/proxies-with-unscopables.js
rename to test/mjsunit/es6/proxies-with-unscopables.js
index c87492c..b9a7ad8 100644
--- a/test/mjsunit/harmony/proxies-with-unscopables.js
+++ b/test/mjsunit/es6/proxies-with-unscopables.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies
-
function TestBasics() {
var log = [];
diff --git a/test/mjsunit/harmony/proxies-with.js b/test/mjsunit/es6/proxies-with.js
similarity index 99%
rename from test/mjsunit/harmony/proxies-with.js
rename to test/mjsunit/es6/proxies-with.js
index 1aa13ad..710e8b5 100644
--- a/test/mjsunit/harmony/proxies-with.js
+++ b/test/mjsunit/es6/proxies-with.js
@@ -25,8 +25,6 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --harmony-proxies
-
// Helper.
diff --git a/test/mjsunit/harmony/proxies.js b/test/mjsunit/es6/proxies.js
similarity index 98%
rename from test/mjsunit/harmony/proxies.js
rename to test/mjsunit/es6/proxies.js
index 8f24d4d..3b9a4c5 100644
--- a/test/mjsunit/harmony/proxies.js
+++ b/test/mjsunit/es6/proxies.js
@@ -29,7 +29,7 @@
// test enters an infinite recursion which goes through the runtime and we
// overflow the system stack before the simulator stack.
-// Flags: --harmony-proxies --sim-stack-size=500 --allow-natives-syntax
+// Flags: --sim-stack-size=500 --allow-natives-syntax
// Helper.
@@ -1018,7 +1018,19 @@
var o4 = Object.create(o2)
var o5 = Object.create(o3)
- function handler(o) { return {get: function() { return o } } }
+ function handler(o) {
+ return {
+ get: function(r, p) {
+ // We want to test prototype lookup, so ensure the proxy
+ // offers OrdinaryHasInstance behavior.
+ if (p === Symbol.hasInstance) {
+ return undefined;
+ }
+ return o;
+ }
+ }
+ }
+
var f0 = new Proxy(function() {}, handler(o0))
var f1 = new Proxy(function() {}, handler(o1))
var f2 = new Proxy(function() {}, handler(o2))
diff --git a/test/mjsunit/harmony/reflect-apply.js b/test/mjsunit/es6/reflect-apply.js
similarity index 99%
rename from test/mjsunit/harmony/reflect-apply.js
rename to test/mjsunit/es6/reflect-apply.js
index 2cfb982..fa38013 100644
--- a/test/mjsunit/harmony/reflect-apply.js
+++ b/test/mjsunit/es6/reflect-apply.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-reflect
-
(function testReflectApplyArity() {
assertEquals(3, Reflect.apply.length);
diff --git a/test/mjsunit/harmony/reflect-construct.js b/test/mjsunit/es6/reflect-construct.js
similarity index 99%
rename from test/mjsunit/harmony/reflect-construct.js
rename to test/mjsunit/es6/reflect-construct.js
index c136957..b37f876 100644
--- a/test/mjsunit/harmony/reflect-construct.js
+++ b/test/mjsunit/es6/reflect-construct.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-reflect
-
(function testReflectConstructArity() {
assertEquals(2, Reflect.construct.length);
diff --git a/test/mjsunit/harmony/reflect-define-property.js b/test/mjsunit/es6/reflect-define-property.js
similarity index 99%
rename from test/mjsunit/harmony/reflect-define-property.js
rename to test/mjsunit/es6/reflect-define-property.js
index afd3ff6..b19c5aa 100644
--- a/test/mjsunit/harmony/reflect-define-property.js
+++ b/test/mjsunit/es6/reflect-define-property.js
@@ -28,7 +28,7 @@
// Tests the Reflect.defineProperty method - ES6 26.1.3
// This is adapted from mjsunit/object-define-property.js.
-// Flags: --allow-natives-syntax --harmony-reflect
+// Flags: --allow-natives-syntax
// Check that an exception is thrown when null is passed as object.
diff --git a/test/mjsunit/harmony/reflect-get-own-property-descriptor.js b/test/mjsunit/es6/reflect-get-own-property-descriptor.js
similarity index 99%
rename from test/mjsunit/harmony/reflect-get-own-property-descriptor.js
rename to test/mjsunit/es6/reflect-get-own-property-descriptor.js
index 3cbffea..5e96899 100644
--- a/test/mjsunit/harmony/reflect-get-own-property-descriptor.js
+++ b/test/mjsunit/es6/reflect-get-own-property-descriptor.js
@@ -30,8 +30,6 @@
// This is adapted from mjsunit/get-own-property-descriptor.js.
-// Flags: --harmony-reflect
-
function get() { return x; }
function set(x) { this.x = x; }
diff --git a/test/mjsunit/harmony/reflect-get-prototype-of.js b/test/mjsunit/es6/reflect-get-prototype-of.js
similarity index 98%
rename from test/mjsunit/harmony/reflect-get-prototype-of.js
rename to test/mjsunit/es6/reflect-get-prototype-of.js
index 4dee91b..9fd1559 100644
--- a/test/mjsunit/harmony/reflect-get-prototype-of.js
+++ b/test/mjsunit/es6/reflect-get-prototype-of.js
@@ -28,8 +28,6 @@
// Tests the Reflect.getPrototypeOf - ES6 26.1.8.
// This is adapted from mjsunit/get-prototype-of.js.
-// Flags: --harmony-reflect
-
function assertPrototypeOf(func, expected) {
diff --git a/test/mjsunit/harmony/reflect-own-keys.js b/test/mjsunit/es6/reflect-own-keys.js
similarity index 98%
rename from test/mjsunit/harmony/reflect-own-keys.js
rename to test/mjsunit/es6/reflect-own-keys.js
index 6f5dacf..5f51f40 100644
--- a/test/mjsunit/harmony/reflect-own-keys.js
+++ b/test/mjsunit/es6/reflect-own-keys.js
@@ -27,8 +27,6 @@
// This is adapted from mjsunit/object-get-own-property-names.js.
-// Flags: --harmony-reflect
-
// Check simple cases.
var obj = { a: 1, b: 2};
diff --git a/test/mjsunit/harmony/reflect-prevent-extensions.js b/test/mjsunit/es6/reflect-prevent-extensions.js
similarity index 98%
rename from test/mjsunit/harmony/reflect-prevent-extensions.js
rename to test/mjsunit/es6/reflect-prevent-extensions.js
index a964ed7..c6f3749 100644
--- a/test/mjsunit/harmony/reflect-prevent-extensions.js
+++ b/test/mjsunit/es6/reflect-prevent-extensions.js
@@ -28,7 +28,7 @@
// Tests the Reflect.preventExtensions method - ES6 26.1.12.
// This is adapted from object-prevent-extensions.js.
-// Flags: --allow-natives-syntax --harmony-reflect
+// Flags: --allow-natives-syntax
var obj1 = {};
diff --git a/test/mjsunit/harmony/reflect-set-prototype-of.js b/test/mjsunit/es6/reflect-set-prototype-of.js
similarity index 99%
rename from test/mjsunit/harmony/reflect-set-prototype-of.js
rename to test/mjsunit/es6/reflect-set-prototype-of.js
index 0e5554e..8f2a00a 100644
--- a/test/mjsunit/harmony/reflect-set-prototype-of.js
+++ b/test/mjsunit/es6/reflect-set-prototype-of.js
@@ -27,8 +27,6 @@
// This is adapted from mjsunit/harmony/set-prototype-of.js.
-// Flags: --harmony-reflect
-
function getObjects() {
diff --git a/test/mjsunit/harmony/reflect.js b/test/mjsunit/es6/reflect.js
similarity index 99%
rename from test/mjsunit/harmony/reflect.js
rename to test/mjsunit/es6/reflect.js
index 6449eb8..ee272b0 100644
--- a/test/mjsunit/harmony/reflect.js
+++ b/test/mjsunit/es6/reflect.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-reflect
-
// TODO(neis): Test with proxies.
diff --git a/test/mjsunit/es6/regexp-constructor.js b/test/mjsunit/es6/regexp-constructor.js
index e3b7efa..559ac00 100644
--- a/test/mjsunit/es6/regexp-constructor.js
+++ b/test/mjsunit/es6/regexp-constructor.js
@@ -21,32 +21,47 @@
})();
(function() {
+ let allow = false;
class A extends RegExp {
- get source() { throw new Error("should not be called") }
- get flags() { throw new Error("should not be called") }
+ get source() {
+ if (!allow) throw new Error("should not be called");
+ return super.source;
+ }
+ get flags() {
+ if (!allow) throw new Error("should not be called");
+ return super.flags
+ }
}
var r = new A("biep");
var r2 = RegExp(r);
assertFalse(r === r2);
+ allow = true;
assertEquals(r, r2);
+ allow = false;
assertTrue(A.prototype === r.__proto__);
assertTrue(RegExp.prototype === r2.__proto__);
var r3 = RegExp(r);
assertFalse(r3 === r);
+ allow = true;
assertEquals(r3, r);
+ allow = false;
var r4 = new A(r2);
assertFalse(r4 === r2);
+ allow = true;
assertEquals(r4, r2);
+ allow = false;
assertTrue(A.prototype === r4.__proto__);
r[Symbol.match] = false;
var r5 = new A(r);
assertFalse(r5 === r);
+ allow = true;
assertEquals(r5, r);
+ allow = false;
assertTrue(A.prototype === r5.__proto__);
})();
diff --git a/test/mjsunit/es6/regexp-flags.js b/test/mjsunit/es6/regexp-flags.js
index 79b0197..480222d 100644
--- a/test/mjsunit/es6/regexp-flags.js
+++ b/test/mjsunit/es6/regexp-flags.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-regexps --harmony-unicode-regexps
+// Flags: --harmony-unicode-regexps
var r1 = /abc/gi;
assertEquals("abc", r1.source);
@@ -44,15 +44,18 @@
// Overridden flag getters affects the flags getter.
assertEquals("gi", r3.flags);
assertEquals(4, get_count);
-// Overridden flag getters do not affect the internal flags.
+// Overridden flag getters affect string.replace
+// TODO(adamk): Add more tests here once we've switched
+// to use [[OriginalFlags]] in more cases.
assertEquals(expected, string.replace(r3, "X"));
-assertEquals(4, get_count);
+assertEquals(5, get_count);
function testName(name) {
- // TODO(littledan): For web compatibility, we don't throw an exception,
- // but ES2015 expects an exception to be thrown from this getter.
- assertEquals(undefined, RegExp.prototype[name]);
+ // Test for ES2017 RegExp web compatibility semantics
+ // https://github.com/tc39/ecma262/pull/511
+ assertEquals(name === "source" ? "(?:)" : undefined,
+ RegExp.prototype[name]);
assertEquals(
"get " + name,
Object.getOwnPropertyDescriptor(RegExp.prototype, name).get.name);
@@ -64,3 +67,55 @@
testName("source");
testName("sticky");
testName("unicode");
+
+
+RegExp.prototype.flags = 'setter should be undefined';
+
+assertEquals('', RegExp('').flags);
+assertEquals('', /./.flags);
+assertEquals('gimuy', RegExp('', 'yugmi').flags);
+assertEquals('gimuy', /foo/yumig.flags);
+
+var descriptor = Object.getOwnPropertyDescriptor(RegExp.prototype, 'flags');
+assertTrue(descriptor.configurable);
+assertFalse(descriptor.enumerable);
+assertInstanceof(descriptor.get, Function);
+assertEquals(undefined, descriptor.set);
+
+function testGenericFlags(object) {
+ return descriptor.get.call(object);
+}
+
+assertEquals('', testGenericFlags({}));
+assertEquals('i', testGenericFlags({ ignoreCase: true }));
+assertEquals('uy', testGenericFlags({ global: 0, sticky: 1, unicode: 1 }));
+assertEquals('m', testGenericFlags({ __proto__: { multiline: true } }));
+assertThrows(function() { testGenericFlags(); }, TypeError);
+assertThrows(function() { testGenericFlags(undefined); }, TypeError);
+assertThrows(function() { testGenericFlags(null); }, TypeError);
+assertThrows(function() { testGenericFlags(true); }, TypeError);
+assertThrows(function() { testGenericFlags(false); }, TypeError);
+assertThrows(function() { testGenericFlags(''); }, TypeError);
+assertThrows(function() { testGenericFlags(42); }, TypeError);
+
+var counter = 0;
+var map = {};
+var object = {
+ get global() {
+ map.g = counter++;
+ },
+ get ignoreCase() {
+ map.i = counter++;
+ },
+ get multiline() {
+ map.m = counter++;
+ },
+ get unicode() {
+ map.u = counter++;
+ },
+ get sticky() {
+ map.y = counter++;
+ }
+};
+testGenericFlags(object);
+assertEquals({ g: 0, i: 1, m: 2, u: 3, y: 4 }, map);
diff --git a/test/mjsunit/harmony/regexp-sticky.js b/test/mjsunit/es6/regexp-sticky.js
similarity index 99%
rename from test/mjsunit/harmony/regexp-sticky.js
rename to test/mjsunit/es6/regexp-sticky.js
index 971adb7..c0633f9 100644
--- a/test/mjsunit/harmony/regexp-sticky.js
+++ b/test/mjsunit/es6/regexp-sticky.js
@@ -25,8 +25,6 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --harmony-regexps
-
var re = /foo.bar/;
assertTrue(!!"foo*bar".match(re));
diff --git a/test/mjsunit/es6/regexp-tostring.js b/test/mjsunit/es6/regexp-tostring.js
index 3deeeb7..23e137c 100644
--- a/test/mjsunit/es6/regexp-tostring.js
+++ b/test/mjsunit/es6/regexp-tostring.js
@@ -44,3 +44,14 @@
assertEquals("/pattern/flags", RegExp.prototype.toString.call(fake));
assertEquals(["p", "ps", "f", "fs"], log);
+
+// Monkey-patching is also possible on RegExp instances
+
+let weird = /foo/;
+Object.defineProperty(weird, 'flags', {value: 'bar'});
+Object.defineProperty(weird, 'source', {value: 'baz'});
+assertEquals('/baz/bar', weird.toString());
+
+assertEquals('/(?:)/', RegExp.prototype.toString());
+assertEquals('(?:)', RegExp.prototype.source);
+assertEquals('', RegExp.prototype.flags);
diff --git a/test/mjsunit/harmony/regress/regress-2219.js b/test/mjsunit/es6/regress/regress-2219.js
similarity index 97%
rename from test/mjsunit/harmony/regress/regress-2219.js
rename to test/mjsunit/es6/regress/regress-2219.js
index 29e0860..79f5bfb 100644
--- a/test/mjsunit/harmony/regress/regress-2219.js
+++ b/test/mjsunit/es6/regress/regress-2219.js
@@ -25,7 +25,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --harmony-proxies --expose-gc
+// Flags: --expose-gc
var p = new Proxy({}, {getOwnPropertyDescriptor: function() { gc() }});
var o = Object.create(p);
diff --git a/test/mjsunit/harmony/regress/regress-2225.js b/test/mjsunit/es6/regress/regress-2225.js
similarity index 98%
rename from test/mjsunit/harmony/regress/regress-2225.js
rename to test/mjsunit/es6/regress/regress-2225.js
index 7577875..cb5cd8c 100644
--- a/test/mjsunit/harmony/regress/regress-2225.js
+++ b/test/mjsunit/es6/regress/regress-2225.js
@@ -25,8 +25,6 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --harmony-proxies
-
var proxy_has_x = false;
var proxy = new Proxy({}, {
get(t, key, receiver) {
diff --git a/test/mjsunit/harmony/regress/regress-4395-global-eval.js b/test/mjsunit/es6/regress/regress-4395-global-eval.js
similarity index 79%
rename from test/mjsunit/harmony/regress/regress-4395-global-eval.js
rename to test/mjsunit/es6/regress/regress-4395-global-eval.js
index b4579b1..72a0ece 100644
--- a/test/mjsunit/harmony/regress/regress-4395-global-eval.js
+++ b/test/mjsunit/es6/regress/regress-4395-global-eval.js
@@ -1,8 +1,6 @@
// Copyright 2015 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-//
-// Flags: --harmony-default-parameters --harmony-destructuring-bind
((x, y = eval('x')) => assertEquals(42, y))(42);
((x, {y = eval('x')}) => assertEquals(42, y))(42, {});
diff --git a/test/mjsunit/harmony/regress/regress-4395.js b/test/mjsunit/es6/regress/regress-4395.js
similarity index 96%
rename from test/mjsunit/harmony/regress/regress-4395.js
rename to test/mjsunit/es6/regress/regress-4395.js
index fcc6784..bdf8443 100644
--- a/test/mjsunit/harmony/regress/regress-4395.js
+++ b/test/mjsunit/es6/regress/regress-4395.js
@@ -1,8 +1,6 @@
// Copyright 2015 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-//
-// Flags: --harmony-destructuring-bind --harmony-default-parameters
(function testExpressionTypes() {
"use strict";
diff --git a/test/mjsunit/harmony/regress/regress-4400.js b/test/mjsunit/es6/regress/regress-4400.js
similarity index 77%
rename from test/mjsunit/harmony/regress/regress-4400.js
rename to test/mjsunit/es6/regress/regress-4400.js
index 7c42e4f..98ad269 100644
--- a/test/mjsunit/harmony/regress/regress-4400.js
+++ b/test/mjsunit/es6/regress/regress-4400.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-default-parameters --min-preparse-length=0
+// Flags: --min-preparse-length=0
function borked(a = [], b = {}, c) {}
borked();
diff --git a/test/mjsunit/harmony/regress/regress-4585.js b/test/mjsunit/es6/regress/regress-4585.js
similarity index 94%
rename from test/mjsunit/harmony/regress/regress-4585.js
rename to test/mjsunit/es6/regress/regress-4585.js
index ada91c6..8ded646 100644
--- a/test/mjsunit/harmony/regress/regress-4585.js
+++ b/test/mjsunit/es6/regress/regress-4585.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-destructuring-bind
-
assertThrows(`for(const { method() {} } = this) {}`, SyntaxError);
assertThrows(`var { method() {} } = this;`, SyntaxError);
assertThrows(`for(const { *method() {} } = this) {}`, SyntaxError);
diff --git a/test/mjsunit/es6/regress/regress-4759.js b/test/mjsunit/es6/regress/regress-4759.js
new file mode 100644
index 0000000..5f8ee68
--- /dev/null
+++ b/test/mjsunit/es6/regress/regress-4759.js
@@ -0,0 +1,23 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+function iterable(done) {
+ return {
+ [Symbol.iterator]: function() {
+ return {
+ next: function() {
+ if (done) return { done: true };
+ done = true;
+ return { value: 42, done: false };
+ }
+ }
+ }
+ }
+}
+
+var [...result] = iterable(true);
+assertEquals([], result);
+
+var [...result] = iterable(false);
+assertEquals([42], result);
diff --git a/test/mjsunit/harmony/regress/regress-517455.js b/test/mjsunit/es6/regress/regress-517455.js
similarity index 82%
rename from test/mjsunit/harmony/regress/regress-517455.js
rename to test/mjsunit/es6/regress/regress-517455.js
index f07e8fe..9c1dfd7 100644
--- a/test/mjsunit/harmony/regress/regress-517455.js
+++ b/test/mjsunit/es6/regress/regress-517455.js
@@ -1,8 +1,6 @@
// Copyright 2015 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-//
-// Flags: --harmony-destructuring-bind
function f({x = ""}) { eval(x) }
f({})
diff --git a/test/mjsunit/harmony/regress/regress-576662.js b/test/mjsunit/es6/regress/regress-576662.js
similarity index 92%
rename from test/mjsunit/harmony/regress/regress-576662.js
rename to test/mjsunit/es6/regress/regress-576662.js
index 5541b79..ad582d6 100644
--- a/test/mjsunit/harmony/regress/regress-576662.js
+++ b/test/mjsunit/es6/regress/regress-576662.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies
-
// https://code.google.com/p/chromium/issues/detail?id=576662 (simplified)
Realm.create();
diff --git a/test/mjsunit/es6/regress/regress-cr493566.js b/test/mjsunit/es6/regress/regress-cr493566.js
index 2b0b7ea..7fbbd7d 100644
--- a/test/mjsunit/es6/regress/regress-cr493566.js
+++ b/test/mjsunit/es6/regress/regress-cr493566.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies --harmony-reflect
-
"use strict";
var global = this;
diff --git a/test/mjsunit/es6/regress/regress-cr512574.js b/test/mjsunit/es6/regress/regress-cr512574.js
index 8d843ee..2bff763 100644
--- a/test/mjsunit/es6/regress/regress-cr512574.js
+++ b/test/mjsunit/es6/regress/regress-cr512574.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-destructuring-bind
-
function f({}) {
for (var v in []);
};
diff --git a/test/mjsunit/harmony/regress/regress-crbug-448730.js b/test/mjsunit/es6/regress/regress-crbug-448730.js
similarity index 86%
rename from test/mjsunit/harmony/regress/regress-crbug-448730.js
rename to test/mjsunit/es6/regress/regress-crbug-448730.js
index cf26127..a3c70ac 100644
--- a/test/mjsunit/harmony/regress/regress-crbug-448730.js
+++ b/test/mjsunit/es6/regress/regress-crbug-448730.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --allow-natives-syntax --harmony-proxies
+// Flags: --allow-natives-syntax
function bar() {}
bar({ a: new Proxy({}, {}) });
diff --git a/test/mjsunit/harmony/regress/regress-crbug-461520.js b/test/mjsunit/es6/regress/regress-crbug-461520.js
similarity index 94%
rename from test/mjsunit/harmony/regress/regress-crbug-461520.js
rename to test/mjsunit/es6/regress/regress-crbug-461520.js
index 7ef9e20..d12ec53 100644
--- a/test/mjsunit/harmony/regress/regress-crbug-461520.js
+++ b/test/mjsunit/es6/regress/regress-crbug-461520.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies
-
var fuse = 1;
var handler = {
diff --git a/test/mjsunit/harmony/regress/regress-lookup-transition.js b/test/mjsunit/es6/regress/regress-lookup-transition.js
similarity index 88%
rename from test/mjsunit/harmony/regress/regress-lookup-transition.js
rename to test/mjsunit/es6/regress/regress-lookup-transition.js
index 9a440b6..c6da9bd 100644
--- a/test/mjsunit/harmony/regress/regress-lookup-transition.js
+++ b/test/mjsunit/es6/regress/regress-lookup-transition.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies --expose-gc
+// Flags: --expose-gc
var proxy = new Proxy({}, { getOwnPropertyDescriptor:function() {
gc();
diff --git a/test/mjsunit/es6/string-endswith.js b/test/mjsunit/es6/string-endswith.js
index cbf2ed8..4246f16 100644
--- a/test/mjsunit/es6/string-endswith.js
+++ b/test/mjsunit/es6/string-endswith.js
@@ -408,3 +408,11 @@
"toString": function() { return "abc"; }
}, [/./]);
}, TypeError);
+
+// endsWith does its brand checks with Symbol.match
+var re = /./;
+assertThrows(function() {
+ "".startsWith(re);
+}, TypeError);
+re[Symbol.match] = false;
+assertEquals(false, "".startsWith(re));
diff --git a/test/mjsunit/es6/string-includes.js b/test/mjsunit/es6/string-includes.js
index 61bf779..c825ffd 100644
--- a/test/mjsunit/es6/string-includes.js
+++ b/test/mjsunit/es6/string-includes.js
@@ -162,3 +162,11 @@
"throw RangeError(); } }, [/./])", RangeError);
assertThrows("String.prototype.includes.apply({ 'toString': function() { " +
"return 'abc'; } }, [/./])", TypeError);
+
+// includes does its brand checks with Symbol.match
+var re = /./;
+assertThrows(function() {
+ "".includes(re);
+}, TypeError);
+re[Symbol.match] = false;
+assertEquals(false, "".includes(re));
diff --git a/test/mjsunit/es6/string-iterator.js b/test/mjsunit/es6/string-iterator.js
index 769f549..8eb27b1 100644
--- a/test/mjsunit/es6/string-iterator.js
+++ b/test/mjsunit/es6/string-iterator.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-tostring
-
function TestStringPrototypeIterator() {
assertTrue(String.prototype.hasOwnProperty(Symbol.iterator));
assertFalse("".hasOwnProperty(Symbol.iterator));
diff --git a/test/mjsunit/es6/string-startswith.js b/test/mjsunit/es6/string-startswith.js
index 887db99..f38f7b9 100644
--- a/test/mjsunit/es6/string-startswith.js
+++ b/test/mjsunit/es6/string-startswith.js
@@ -399,3 +399,11 @@
"toString": function() { return "abc"; }
}, [/./]);
}, TypeError);
+
+// startsWith does its brand checks with Symbol.match
+var re = /./;
+assertThrows(function() {
+ "".startsWith(re);
+}, TypeError);
+re[Symbol.match] = false;
+assertEquals(false, "".startsWith(re));
diff --git a/test/mjsunit/es6/super.js b/test/mjsunit/es6/super.js
index 67cb45f..a2ba1e8 100644
--- a/test/mjsunit/es6/super.js
+++ b/test/mjsunit/es6/super.js
@@ -3,7 +3,7 @@
// found in the LICENSE file.
// Flags: --allow-natives-syntax
-// Flags: --harmony-destructuring-bind --harmony-sloppy
+// Flags: --harmony-sloppy
(function TestSuperNamedLoads() {
function Base() { }
diff --git a/test/mjsunit/es6/symbols.js b/test/mjsunit/es6/symbols.js
index 3833857..9bac41f 100644
--- a/test/mjsunit/es6/symbols.js
+++ b/test/mjsunit/es6/symbols.js
@@ -25,7 +25,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --expose-gc --allow-natives-syntax --harmony-tostring
+// Flags: --expose-gc --allow-natives-syntax
var symbols = []
@@ -86,6 +86,7 @@
function TestConstructor() {
+ assertEquals(0, Symbol.length);
assertSame(Function.prototype, Symbol.__proto__)
assertFalse(Object === Symbol.prototype.constructor)
assertFalse(Symbol === Object.prototype.constructor)
diff --git a/test/mjsunit/es6/tail-call-megatest-shard0.js b/test/mjsunit/es6/tail-call-megatest-shard0.js
new file mode 100644
index 0000000..87fe29e
--- /dev/null
+++ b/test/mjsunit/es6/tail-call-megatest-shard0.js
@@ -0,0 +1,13 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-tailcalls
+
+try {
+ load("mjsunit/es6/tail-call-megatest.js");
+} catch(e) {
+ load("test/mjsunit/es6/tail-call-megatest.js");
+}
+
+run_tests(0);
diff --git a/test/mjsunit/es6/tail-call-megatest-shard1.js b/test/mjsunit/es6/tail-call-megatest-shard1.js
new file mode 100644
index 0000000..10deb28
--- /dev/null
+++ b/test/mjsunit/es6/tail-call-megatest-shard1.js
@@ -0,0 +1,13 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-tailcalls
+
+try {
+ load("mjsunit/es6/tail-call-megatest.js");
+} catch(e) {
+ load("test/mjsunit/es6/tail-call-megatest.js");
+}
+
+run_tests(1);
diff --git a/test/mjsunit/es6/tail-call-megatest-shard2.js b/test/mjsunit/es6/tail-call-megatest-shard2.js
new file mode 100644
index 0000000..7d2bd97
--- /dev/null
+++ b/test/mjsunit/es6/tail-call-megatest-shard2.js
@@ -0,0 +1,13 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-tailcalls
+
+try {
+ load("mjsunit/es6/tail-call-megatest.js");
+} catch(e) {
+ load("test/mjsunit/es6/tail-call-megatest.js");
+}
+
+run_tests(2);
diff --git a/test/mjsunit/es6/tail-call-megatest-shard3.js b/test/mjsunit/es6/tail-call-megatest-shard3.js
new file mode 100644
index 0000000..7bce6c4
--- /dev/null
+++ b/test/mjsunit/es6/tail-call-megatest-shard3.js
@@ -0,0 +1,13 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-tailcalls
+
+try {
+ load("mjsunit/es6/tail-call-megatest.js");
+} catch(e) {
+ load("test/mjsunit/es6/tail-call-megatest.js");
+}
+
+run_tests(3);
diff --git a/test/mjsunit/es6/tail-call-megatest-shard4.js b/test/mjsunit/es6/tail-call-megatest-shard4.js
new file mode 100644
index 0000000..6c43d3e
--- /dev/null
+++ b/test/mjsunit/es6/tail-call-megatest-shard4.js
@@ -0,0 +1,13 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-tailcalls
+
+try {
+ load("mjsunit/es6/tail-call-megatest.js");
+} catch(e) {
+ load("test/mjsunit/es6/tail-call-megatest.js");
+}
+
+run_tests(4);
diff --git a/test/mjsunit/es6/tail-call-megatest-shard5.js b/test/mjsunit/es6/tail-call-megatest-shard5.js
new file mode 100644
index 0000000..a91bd3f
--- /dev/null
+++ b/test/mjsunit/es6/tail-call-megatest-shard5.js
@@ -0,0 +1,13 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-tailcalls
+
+try {
+ load("mjsunit/es6/tail-call-megatest.js");
+} catch(e) {
+ load("test/mjsunit/es6/tail-call-megatest.js");
+}
+
+run_tests(5);
diff --git a/test/mjsunit/es6/tail-call-megatest-shard6.js b/test/mjsunit/es6/tail-call-megatest-shard6.js
new file mode 100644
index 0000000..0d70a42
--- /dev/null
+++ b/test/mjsunit/es6/tail-call-megatest-shard6.js
@@ -0,0 +1,13 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-tailcalls
+
+try {
+ load("mjsunit/es6/tail-call-megatest.js");
+} catch(e) {
+ load("test/mjsunit/es6/tail-call-megatest.js");
+}
+
+run_tests(6);
diff --git a/test/mjsunit/es6/tail-call-megatest-shard7.js b/test/mjsunit/es6/tail-call-megatest-shard7.js
new file mode 100644
index 0000000..63477af
--- /dev/null
+++ b/test/mjsunit/es6/tail-call-megatest-shard7.js
@@ -0,0 +1,13 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-tailcalls
+
+try {
+ load("mjsunit/es6/tail-call-megatest.js");
+} catch(e) {
+ load("test/mjsunit/es6/tail-call-megatest.js");
+}
+
+run_tests(7);
diff --git a/test/mjsunit/es6/tail-call-megatest-shard8.js b/test/mjsunit/es6/tail-call-megatest-shard8.js
new file mode 100644
index 0000000..0c68827
--- /dev/null
+++ b/test/mjsunit/es6/tail-call-megatest-shard8.js
@@ -0,0 +1,13 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-tailcalls
+
+try {
+ load("mjsunit/es6/tail-call-megatest.js");
+} catch(e) {
+ load("test/mjsunit/es6/tail-call-megatest.js");
+}
+
+run_tests(8);
diff --git a/test/mjsunit/es6/tail-call-megatest-shard9.js b/test/mjsunit/es6/tail-call-megatest-shard9.js
new file mode 100644
index 0000000..82f991a
--- /dev/null
+++ b/test/mjsunit/es6/tail-call-megatest-shard9.js
@@ -0,0 +1,13 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-tailcalls
+
+try {
+ load("mjsunit/es6/tail-call-megatest.js");
+} catch(e) {
+ load("test/mjsunit/es6/tail-call-megatest.js");
+}
+
+run_tests(9);
diff --git a/test/mjsunit/es6/tail-call-megatest.js b/test/mjsunit/es6/tail-call-megatest.js
index 0057961..1de8ec6 100644
--- a/test/mjsunit/es6/tail-call-megatest.js
+++ b/test/mjsunit/es6/tail-call-megatest.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --allow-natives-syntax --harmony-tailcalls --no-turbo-inlining
+// Flags: --allow-natives-syntax --harmony-tailcalls
Error.prepareStackTrace = (error,stack) => {
@@ -11,23 +11,15 @@
}
-function CheckStackTrace(expected) {
+function checkStackTrace(expected) {
var e = new Error();
e.stack; // prepare stack trace
var stack = e.strace;
- assertEquals("CheckStackTrace", stack[0].getFunctionName());
+ assertEquals("checkStackTrace", stack[0].getFunctionName());
for (var i = 0; i < expected.length; i++) {
assertEquals(expected[i].name, stack[i + 1].getFunctionName());
}
}
-%NeverOptimizeFunction(CheckStackTrace);
-
-
-function CheckArguments(expected, args) {
- args = Array.prototype.slice.call(args);
- assertEquals(expected, args);
-}
-%NeverOptimizeFunction(CheckArguments);
var CAN_INLINE_COMMENT = "// Let it be inlined.";
@@ -45,28 +37,59 @@
return ident + source.replace(/\n/gi, "\n" + ident);
}
-var global = Function('return this')();
-var the_receiver = {receiver: 1};
+var SHARDS_COUNT = 10;
-function run_tests() {
+function run_tests(shard) {
function inlinable_comment(inlinable) {
return inlinable ? CAN_INLINE_COMMENT : DONT_INLINE_COMMENT;
}
+ // Check arguments manually to avoid bailing out with reason "bad value
+ // context for arguments value".
+ function check_arguments_template(expected_name) {
+ var lines = [
+ ` assertEquals_(${expected_name}.length, arguments.length);`,
+ ` for (var i = 0; i < ${expected_name}.length; i++) {`,
+ ` assertEquals_(${expected_name}[i], arguments[i]);`,
+ ` }`,
+ ];
+ return lines.join("\n");
+ }
+ var check_arguments = check_arguments_template("expected_args");
+
+ function deopt_template(deopt_mode) {
+ switch(deopt_mode) {
+ case "none":
+ return " // Don't deoptimize";
+ case "f":
+ case "g":
+ case "test":
+ return ` %DeoptimizeFunction(${deopt_mode});`;
+ default:
+ assertUnreachable();
+ }
+ }
+
var f_cfg_sloppy = {
func_name: 'f',
source_template: function(cfg) {
var receiver = cfg.f_receiver != undefined ? cfg.f_receiver
: "global";
+ var do_checks = [
+ ` assertEquals_(${receiver}, this);`,
+ ` ${!cfg.check_new_target ? "// " : ""}assertEquals_(undefined, new.target);`,
+ check_arguments,
+ ` checkStackTrace_([f, test]);`,
+ ].join("\n");
+
var lines = [
`function f(a) {`,
` ${inlinable_comment(cfg.f_inlinable)}`,
- ` assertEquals(${receiver}, this);`,
- ` CheckArguments([${cfg.f_args}], arguments);`,
- ` CheckStackTrace([f, test]);`,
- ` %DeoptimizeNow();`,
- ` CheckArguments([${cfg.f_args}], arguments);`,
- ` CheckStackTrace([f, test]);`,
+ ` counter++;`,
+ ` var expected_args = [${cfg.f_args}];`,
+ do_checks,
+ deopt_template(cfg.deopt_mode),
+ do_checks,
` return 42;`,
`}`,
];
@@ -79,16 +102,22 @@
source_template: function(cfg) {
var receiver = cfg.f_receiver != undefined ? cfg.f_receiver
: "undefined";
+ var do_checks = [
+ ` assertEquals_(${receiver}, this);`,
+ ` ${!cfg.check_new_target ? "// " : ""}assertEquals_(undefined, new.target);`,
+ check_arguments,
+ ` checkStackTrace_([f, test]);`,
+ ].join("\n");
+
var lines = [
`function f(a) {`,
` "use strict";`,
` ${inlinable_comment(cfg.f_inlinable)}`,
- ` assertEquals(${receiver}, this);`,
- ` CheckArguments([${cfg.f_args}], arguments);`,
- ` CheckStackTrace([f, test]);`,
- ` %DeoptimizeNow();`,
- ` CheckArguments([${cfg.f_args}], arguments);`,
- ` CheckStackTrace([f, test]);`,
+ ` counter++;`,
+ ` var expected_args = [${cfg.f_args}];`,
+ do_checks,
+ deopt_template(cfg.deopt_mode),
+ do_checks,
` return 42;`,
`}`,
];
@@ -101,15 +130,21 @@
source_template: function(cfg) {
var receiver = cfg.f_receiver != undefined ? cfg.f_receiver
: "global";
+ var do_checks = [
+ ` assertEquals_(${receiver}, this);`,
+ ` ${!cfg.check_new_target ? "// " : ""}assertEquals_(undefined, new.target);`,
+ check_arguments,
+ ` checkStackTrace_([f, test]);`,
+ ].join("\n");
+
var lines = [
`function f(a) {`,
` ${inlinable_comment(cfg.f_inlinable)}`,
- ` assertEquals(${receiver}, this);`,
- ` CheckArguments([${cfg.f_args}], arguments);`,
- ` CheckStackTrace([f, test]);`,
- ` %DeoptimizeNow();`,
- ` CheckArguments([${cfg.f_args}], arguments);`,
- ` CheckStackTrace([f, test]);`,
+ ` counter++;`,
+ ` var expected_args = [${cfg.f_args}];`,
+ do_checks,
+ deopt_template(cfg.deopt_mode),
+ do_checks,
` return 42;`,
`}`,
`var eval = f;`,
@@ -121,16 +156,22 @@
var f_cfg_bound = {
func_name: 'bound',
source_template: function(cfg) {
+ var do_checks = [
+ ` assertEquals_(receiver, this);`,
+ ` ${!cfg.check_new_target ? "// " : ""}assertEquals_(undefined, new.target);`,
+ check_arguments,
+ ` checkStackTrace_([f, test]);`,
+ ].join("\n");
+
var lines = [
`function f(a) {`,
` "use strict";`,
` ${inlinable_comment(cfg.f_inlinable)}`,
- ` assertEquals(receiver, this);`,
- ` CheckArguments([${cfg.f_args}], arguments);`,
- ` CheckStackTrace([f, test]);`,
- ` %DeoptimizeNow();`,
- ` CheckArguments([${cfg.f_args}], arguments);`,
- ` CheckStackTrace([f, test]);`,
+ ` counter++;`,
+ ` var expected_args = [${cfg.f_args}];`,
+ do_checks,
+ deopt_template(cfg.deopt_mode),
+ do_checks,
` return 42;`,
`}`,
`var receiver = {a: 153};`,
@@ -145,15 +186,21 @@
source_template: function(cfg) {
var receiver = cfg.f_receiver != undefined ? cfg.f_receiver
: "global";
+ var do_checks = [
+ ` assertEquals_(${receiver}, this);`,
+ ` ${!cfg.check_new_target ? "// " : ""}assertEquals_(undefined, new.target);`,
+ check_arguments,
+ ` checkStackTrace_([f, test]);`,
+ ].join("\n");
+
var lines = [
`function f(a) {`,
` ${inlinable_comment(cfg.f_inlinable)}`,
- ` assertEquals(${receiver}, this);`,
- ` CheckArguments([${cfg.f_args}], arguments);`,
- ` CheckStackTrace([f, test]);`,
- ` %DeoptimizeNow();`,
- ` CheckArguments([${cfg.f_args}], arguments);`,
- ` CheckStackTrace([f, test]);`,
+ ` counter++;`,
+ ` var expected_args = [${cfg.f_args}];`,
+ do_checks,
+ deopt_template(cfg.deopt_mode),
+ do_checks,
` return 42;`,
`}`,
`var p = new Proxy(f, {});`,
@@ -169,7 +216,8 @@
`function g(a) {`,
` "use strict";`,
` ${inlinable_comment(cfg.g_inlinable)}`,
- ` CheckArguments([${cfg.g_args}], arguments);`,
+ ` var expected_args = [${cfg.g_args}];`,
+ check_arguments,
` return ${cfg.f_name}(${cfg.f_args});`,
`}`,
];
@@ -178,6 +226,23 @@
};
+ var g_cfg_reflect_apply = {
+ receiver: "the_receiver",
+ source_template: function(cfg) {
+ var lines = [
+ `function g(a) {`,
+ ` "use strict";`,
+ ` ${inlinable_comment(cfg.g_inlinable)}`,
+ ` var expected_args = [${cfg.g_args}];`,
+ check_arguments,
+ ` return Reflect.apply(${cfg.f_name}, the_receiver, [${cfg.f_args}]);`,
+ `}`,
+ ];
+ return lines.join("\n");
+ },
+ };
+
+
var g_cfg_function_apply = {
receiver: "the_receiver",
source_template: function(cfg) {
@@ -185,7 +250,8 @@
`function g(a) {`,
` "use strict";`,
` ${inlinable_comment(cfg.g_inlinable)}`,
- ` CheckArguments([${cfg.g_args}], arguments);`,
+ ` var expected_args = [${cfg.g_args}];`,
+ check_arguments,
` return ${cfg.f_name}.apply(the_receiver, [${cfg.f_args}]);`,
`}`,
];
@@ -194,6 +260,24 @@
};
+ var g_cfg_function_apply_arguments_object = {
+ receiver: "the_receiver",
+ source_template: function(cfg) {
+ cfg.f_args = cfg.g_args;
+ var lines = [
+ `function g(a) {`,
+ ` "use strict";`,
+ ` ${inlinable_comment(cfg.g_inlinable)}`,
+ ` var expected_args = [${cfg.g_args}];`,
+ check_arguments,
+ ` return ${cfg.f_name}.apply(the_receiver, arguments);`,
+ `}`,
+ ];
+ return lines.join("\n");
+ },
+ };
+
+
var g_cfg_function_call = {
receiver: "the_receiver",
source_template: function(cfg) {
@@ -205,7 +289,8 @@
`function g(a) {`,
` "use strict";`,
` ${inlinable_comment(cfg.g_inlinable)}`,
- ` CheckArguments([${cfg.g_args}], arguments);`,
+ ` var expected_args = [${cfg.g_args}];`,
+ check_arguments,
` return ${cfg.f_name}.call(${f_args});`,
`}`,
];
@@ -215,27 +300,39 @@
function test_template(cfg) {
- var f_source = cfg.f_source_template(cfg);
+ // Note: g_source_template modifies cfg.f_args in some cases.
var g_source = cfg.g_source_template(cfg);
- f_source = ident_source(f_source, 2);
g_source = ident_source(g_source, 2);
+ var f_source = cfg.f_source_template(cfg);
+ f_source = ident_source(f_source, 2);
+
var lines = [
`(function() {`,
+ ` // Avoid bailing out because of "Reference to a variable which requires dynamic lookup".`,
+ ` var assertEquals_ = assertEquals;`,
+ ` var checkStackTrace_ = checkStackTrace;`,
+ ` var undefined = void 0;`,
+ ` var global = Function('return this')();`,
+ ` var the_receiver = {receiver: 1};`,
+ ` var counter = 0;`,
+ ``,
+ ` // Don't inline helper functions`,
+ ` %NeverOptimizeFunction(assertEquals);`,
+ ` %NeverOptimizeFunction(checkStackTrace);`,
+ ``,
f_source,
g_source,
` function test() {`,
` "use strict";`,
- ` assertEquals(42, g(${cfg.g_args}));`,
+ ` assertEquals_(42, g(${cfg.g_args}));`,
` }`,
- ` ${cfg.f_inlinable ? "%SetForceInlineFlag(f)" : ""};`,
- ` ${cfg.g_inlinable ? "%SetForceInlineFlag(g)" : ""};`,
- ``,
- ` test();`,
+ ` ${"test();".repeat(cfg.test_warmup_count)}`,
+ ` ${cfg.f_inlinable ? "%SetForceInlineFlag(f)" : "%OptimizeFunctionOnNextCall(f)"};`,
+ ` ${cfg.g_inlinable ? "%SetForceInlineFlag(g)" : "%OptimizeFunctionOnNextCall(g)"};`,
` %OptimizeFunctionOnNextCall(test);`,
- ` %OptimizeFunctionOnNextCall(f);`,
- ` %OptimizeFunctionOnNextCall(g);`,
` test();`,
+ ` assertEquals(${1 + cfg.test_warmup_count}, counter);`,
`})();`,
``,
];
@@ -243,11 +340,13 @@
return source;
}
- // TODO(v8:4698), TODO(ishell): support all commented cases.
var f_args_variants = ["", "1", "1, 2"];
- var g_args_variants = [/*"",*/ "10", /*"10, 20"*/];
- var f_inlinable_variants = [/*true,*/ false];
+ var g_args_variants = ["", "10", "10, 20"];
+ var f_inlinable_variants = [true, false];
var g_inlinable_variants = [true, false];
+ // This is to avoid bailing out because of referencing new.target.
+ var check_new_target_variants = [true, false];
+ var deopt_mode_variants = ["none", "f", "g", "test"];
var f_variants = [
f_cfg_sloppy,
f_cfg_strict,
@@ -257,36 +356,60 @@
];
var g_variants = [
g_cfg_normal,
- g_cfg_function_call,
+ g_cfg_reflect_apply,
g_cfg_function_apply,
+ g_cfg_function_apply_arguments_object,
+ g_cfg_function_call,
];
+ var test_warmup_counts = [0, 1, 2];
+ var iter = 0;
+ var tests_executed = 0;
+ if (shard !== undefined) {
+ print("Running shard #" + shard);
+ }
f_variants.forEach((f_cfg) => {
- g_variants.forEach((g_cfg) => {
- f_args_variants.forEach((f_args) => {
- g_args_variants.forEach((g_args) => {
- f_inlinable_variants.forEach((f_inlinable) => {
- g_inlinable_variants.forEach((g_inlinable) => {
- var cfg = {
- f_source_template: f_cfg.source_template,
- f_inlinable,
- f_args,
- f_name: f_cfg.func_name,
- f_receiver: g_cfg.receiver,
- g_source_template: g_cfg.source_template,
- g_inlinable,
- g_args,
- };
- var source = test_template(cfg);
- print("====================");
- print(source);
- eval(source);
+ check_new_target_variants.forEach((check_new_target) => {
+ deopt_mode_variants.forEach((deopt_mode) => {
+ g_variants.forEach((g_cfg) => {
+ f_args_variants.forEach((f_args) => {
+ g_args_variants.forEach((g_args) => {
+ f_inlinable_variants.forEach((f_inlinable) => {
+ g_inlinable_variants.forEach((g_inlinable) => {
+ test_warmup_counts.forEach((test_warmup_count) => {
+ if (shard !== undefined && (iter++) % SHARDS_COUNT != shard) {
+ print("skipping...");
+ return;
+ }
+ tests_executed++;
+ var cfg = {
+ f_source_template: f_cfg.source_template,
+ f_inlinable,
+ f_args,
+ f_name: f_cfg.func_name,
+ f_receiver: g_cfg.receiver,
+ g_source_template: g_cfg.source_template,
+ g_inlinable,
+ g_args,
+ test_warmup_count,
+ check_new_target,
+ deopt_mode,
+ };
+ var source = test_template(cfg);
+ print("====================");
+ print(source);
+ eval(source);
+ });
+ });
+ });
});
});
});
});
});
});
+ print("Number of tests executed: " + tests_executed);
}
-run_tests();
+// Uncomment to run all the tests at once or use shard runners.
+//run_tests();
diff --git a/test/mjsunit/es6/tail-call-proxies.js b/test/mjsunit/es6/tail-call-proxies.js
index 25f9fcf..251ac0c 100644
--- a/test/mjsunit/es6/tail-call-proxies.js
+++ b/test/mjsunit/es6/tail-call-proxies.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --allow-natives-syntax --harmony-tailcalls --harmony-proxies
+// Flags: --allow-natives-syntax --harmony-tailcalls
"use strict";
Error.prepareStackTrace = (e,s) => s;
diff --git a/test/mjsunit/es6/tail-call-simple.js b/test/mjsunit/es6/tail-call-simple.js
index d2890b0..cc63808 100644
--- a/test/mjsunit/es6/tail-call-simple.js
+++ b/test/mjsunit/es6/tail-call-simple.js
@@ -10,7 +10,7 @@
(function() {
function f(n) {
if (n <= 0) {
- return "foo";
+ return "foo";
}
return f(n - 1);
}
@@ -27,7 +27,7 @@
"use strict";
function f(n) {
if (n <= 0) {
- return "foo";
+ return "foo";
}
return f(n - 1);
}
@@ -39,6 +39,20 @@
(function() {
"use strict";
+ function f(n) {
+ if (n <= 0) {
+ return "foo";
+ }
+ return f(n - 1, 42); // Call with arguments adaptor.
+ }
+ assertEquals("foo", f(1e5));
+ %OptimizeFunctionOnNextCall(f);
+ assertEquals("foo", f(1e5));
+})();
+
+
+(function() {
+ "use strict";
function f(n){
if (n <= 0) {
return "foo";
@@ -59,6 +73,28 @@
})();
+(function() {
+ "use strict";
+ function f(n){
+ if (n <= 0) {
+ return "foo";
+ }
+ return g(n - 1, 42); // Call with arguments adaptor.
+ }
+ function g(n){
+ if (n <= 0) {
+ return "bar";
+ }
+ return f(n - 1, 42); // Call with arguments adaptor.
+ }
+ assertEquals("foo", f(1e5));
+ assertEquals("bar", f(1e5 + 1));
+ %OptimizeFunctionOnNextCall(f);
+ assertEquals("foo", f(1e5));
+ assertEquals("bar", f(1e5 + 1));
+})();
+
+
//
// Tail call bound functions.
//
diff --git a/test/mjsunit/es6/tail-call.js b/test/mjsunit/es6/tail-call.js
index e9539c3..d0d00f4 100644
--- a/test/mjsunit/es6/tail-call.js
+++ b/test/mjsunit/es6/tail-call.js
@@ -20,6 +20,8 @@
assertEquals(expected[i].name, stack[i + 1].getFunctionName());
}
}
+%NeverOptimizeFunction(CheckStackTrace);
+
function f(expected_call_stack, a, b) {
CheckStackTrace(expected_call_stack);
@@ -69,6 +71,7 @@
assertEquals(12, g4(1));
}
test();
+ test();
%OptimizeFunctionOnNextCall(test);
test();
})();
@@ -111,6 +114,7 @@
assertEquals(12, g4());
}
test();
+ test();
%OptimizeFunctionOnNextCall(test);
test();
})();
@@ -162,6 +166,7 @@
assertEquals(12, g4(1));
}
test();
+ test();
%OptimizeFunctionOnNextCall(test);
test();
})();
@@ -212,6 +217,89 @@
assertEquals(12, g4());
}
test();
+ test();
+ %OptimizeFunctionOnNextCall(test);
+ test();
+})();
+
+
+// Tail calling from getter.
+(function() {
+ function g(v) {
+ CheckStackTrace([g, test]);
+ %DeoptimizeFunction(test);
+ return 153;
+ }
+ %NeverOptimizeFunction(g);
+
+ function f(v) {
+ return g();
+ }
+ %SetForceInlineFlag(f);
+
+ function test() {
+ var o = {};
+ o.__defineGetter__('p', f);
+ assertEquals(153, o.p);
+ }
+
+ test();
+ test();
+ %OptimizeFunctionOnNextCall(test);
+ test();
+})();
+
+
+// Tail calling from setter.
+(function() {
+ function g() {
+ CheckStackTrace([g, test]);
+ %DeoptimizeFunction(test);
+ return 153;
+ }
+ %NeverOptimizeFunction(g);
+
+ var context = 10;
+ function f(v) {
+ return g(context);
+ }
+ %SetForceInlineFlag(f);
+
+ function test() {
+ var o = {};
+ o.__defineSetter__('q', f);
+ assertEquals(1, o.q = 1);
+ }
+
+ test();
+ test();
+ %OptimizeFunctionOnNextCall(test);
+ test();
+})();
+
+
+// Tail calling from constructor.
+(function() {
+ function g(context) {
+ CheckStackTrace([g, test]);
+ %DeoptimizeFunction(test);
+ return {x: 153};
+ }
+ %NeverOptimizeFunction(g);
+
+ function A() {
+ this.x = 42;
+ return g();
+ }
+
+ function test() {
+ var o = new A();
+ %DebugPrint(o);
+ assertEquals(153, o.x);
+ }
+
+ test();
+ test();
%OptimizeFunctionOnNextCall(test);
test();
})();
@@ -237,6 +325,53 @@
assertEquals(153, g3());
}
test();
+ test();
+ %OptimizeFunctionOnNextCall(test);
+ test();
+})();
+
+
+// Tail calling from various statements.
+(function() {
+ function g1() {
+ for (var v in {a:0}) {
+ return f_153([f_153, g1, test]);
+ }
+ }
+
+ function g2() {
+ for (var v of [1, 2, 3]) {
+ return f_153([f_153, g2, test]);
+ }
+ }
+
+ function g3() {
+ for (var i = 0; i < 10; i++) {
+ return f_153([f_153, test]);
+ }
+ }
+
+ function g4() {
+ while (true) {
+ return f_153([f_153, test]);
+ }
+ }
+
+ function g5() {
+ do {
+ return f_153([f_153, test]);
+ } while (true);
+ }
+
+ function test() {
+ assertEquals(153, g1());
+ assertEquals(153, g2());
+ assertEquals(153, g3());
+ assertEquals(153, g4());
+ assertEquals(153, g5());
+ }
+ test();
+ test();
%OptimizeFunctionOnNextCall(test);
test();
})();
@@ -280,6 +415,7 @@
assertEquals(153, tc3());
}
test();
+ test();
%OptimizeFunctionOnNextCall(test);
test();
})();
@@ -321,6 +457,7 @@
assertEquals(153, tf3());
}
test();
+ test();
%OptimizeFunctionOnNextCall(test);
test();
})();
@@ -381,6 +518,28 @@
assertEquals(153, tcf4());
}
test();
+ test();
+ %OptimizeFunctionOnNextCall(test);
+ test();
+})();
+
+
+// Test tail calls from arrow functions.
+(function () {
+ function g1(a) {
+ return (() => { return f_153([f_153, test]); })();
+ }
+
+ function g2(a) {
+ return (() => f_153([f_153, test]))();
+ }
+
+ function test() {
+ assertEquals(153, g1());
+ assertEquals(153, g2());
+ }
+ test();
+ test();
%OptimizeFunctionOnNextCall(test);
test();
})();
diff --git a/test/mjsunit/es6/typed-array-iterator.js b/test/mjsunit/es6/typed-array-iterator.js
index 0b27625..7970bba 100644
--- a/test/mjsunit/es6/typed-array-iterator.js
+++ b/test/mjsunit/es6/typed-array-iterator.js
@@ -21,10 +21,10 @@
assertFalse(TypedArrayPrototype.propertyIsEnumerable('keys'));
assertFalse(TypedArrayPrototype.propertyIsEnumerable(Symbol.iterator));
-assertEquals(Array.prototype.entries, TypedArrayPrototype.entries);
-assertEquals(Array.prototype[Symbol.iterator], TypedArrayPrototype.values);
-assertEquals(Array.prototype.keys, TypedArrayPrototype.keys);
-assertEquals(Array.prototype[Symbol.iterator], TypedArrayPrototype[Symbol.iterator]);
+assertFalse(Array.prototype.entries === TypedArrayPrototype.entries);
+assertFalse(Array.prototype[Symbol.iterator] === TypedArrayPrototype.values);
+assertFalse(Array.prototype.keys === TypedArrayPrototype.keys);
+assertFalse(Array.prototype[Symbol.iterator] === TypedArrayPrototype[Symbol.iterator]);
function TestTypedArrayValues(constructor) {
diff --git a/test/mjsunit/es6/typedarray-of.js b/test/mjsunit/es6/typedarray-of.js
index a6df29a..eaa7bde 100644
--- a/test/mjsunit/es6/typedarray-of.js
+++ b/test/mjsunit/es6/typedarray-of.js
@@ -115,9 +115,9 @@
// Check superficial features of %TypedArray%.of.
var desc = Object.getOwnPropertyDescriptor(constructor.__proto__, "of");
- assertEquals(desc.configurable, false);
+ assertEquals(desc.configurable, true);
assertEquals(desc.enumerable, false);
- assertEquals(desc.writable, false);
+ assertEquals(desc.writable, true);
assertEquals(constructor.of.length, 0);
// %TypedArray%.of is not a constructor.
diff --git a/test/mjsunit/es6/typedarray-proto.js b/test/mjsunit/es6/typedarray-proto.js
index 346b2ea..0bd90d1 100644
--- a/test/mjsunit/es6/typedarray-proto.js
+++ b/test/mjsunit/es6/typedarray-proto.js
@@ -28,17 +28,13 @@
let classProperties = new Set([
"length", "name", "arguments", "caller", "prototype", "BYTES_PER_ELEMENT"
]);
-let instanceProperties = new Set([
- "BYTES_PER_ELEMENT", "constructor", "prototype",
- // length is also an instance property as a temporary workaround to
- // BUG(chromium:579905). TODO(littledan): remove the workaround
- "length"
-]);
+let instanceProperties = new Set(["BYTES_PER_ELEMENT", "constructor", "prototype"]);
function functionProperties(object) {
return Object.getOwnPropertyNames(object).filter(function(name) {
return typeof Object.getOwnPropertyDescriptor(object, name).value
- == "function" && name != 'constructor';
+ == "function"
+ && name != 'constructor' && name != 'subarray';
});
}
diff --git a/test/mjsunit/es6/typedarray.js b/test/mjsunit/es6/typedarray.js
index e6a949c..4bdf822 100644
--- a/test/mjsunit/es6/typedarray.js
+++ b/test/mjsunit/es6/typedarray.js
@@ -25,8 +25,6 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --harmony-tostring
-
// ArrayBuffer
function TestByteLength(param, expectedByteLength) {
diff --git a/test/mjsunit/es7/object-observe.js b/test/mjsunit/es7/object-observe.js
index 712f5a6..a558c51 100644
--- a/test/mjsunit/es7/object-observe.js
+++ b/test/mjsunit/es7/object-observe.js
@@ -25,7 +25,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --harmony-proxies --harmony-object-observe
+// Flags: --harmony-object-observe
// Flags: --allow-natives-syntax
var allObservers = [];
diff --git a/test/mjsunit/for-in-opt.js b/test/mjsunit/for-in-opt.js
index 8f73539..bc59a1b 100644
--- a/test/mjsunit/for-in-opt.js
+++ b/test/mjsunit/for-in-opt.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies --allow-natives-syntax --expose-debug-as debug
+// Flags: --allow-natives-syntax --expose-debug-as debug
"use strict";
@@ -23,9 +23,9 @@
// Test the lazy deopt points.
var keys = ["a", "b", "c", "d"];
-var has_keys = [];
-var deopt_has = false;
+var property_descriptor_keys = [];
var deopt_enum = false;
+var deopt_property_descriptor = false;
var handler = {
ownKeys() {
@@ -35,16 +35,14 @@
}
return keys;
},
- getOwnPropertyDescriptor() { return { enumerable: true, configurable: true }},
-
- has(target, k) {
- if (deopt_has) {
+ getOwnPropertyDescriptor(target, k) {
+ if (deopt_property_descriptor) {
%DeoptimizeFunction(f2);
- deopt_has = false;
+ deopt_property_descriptor = false;
}
- has_keys.push(k);
- return true;
- }
+ property_descriptor_keys.push(k);
+ return { enumerable: true, configurable: true }
+ },
};
@@ -61,8 +59,8 @@
function check_f2() {
assertEquals(keys, f2(o));
- assertEquals(keys, has_keys);
- has_keys.length = 0;
+ assertEquals(keys, property_descriptor_keys);
+ property_descriptor_keys.length = 0;
}
check_f2();
@@ -75,9 +73,10 @@
// Test lazy deopt after FILTER_KEY
%OptimizeFunctionOnNextCall(f2);
-deopt_has = true;
+deopt_property_descriptor = true;
check_f2();
+
function f3(o) {
for (var i in o) {
}
@@ -91,14 +90,6 @@
f3(null);
// Reliable repro for an issue previously flushed out by GC stress.
-var handler2 = {
- getPropertyDescriptor(target, k) {
- has_keys.push(k);
- return {value: 10, configurable: true, writable: false, enumerable: true};
- }
-}
-var proxy2 = new Proxy({}, handler2);
-var o2 = {__proto__: proxy2};
var p = {x: "x"}
function f4(o, p) {
@@ -112,8 +103,8 @@
function check_f4() {
assertEquals(keys, f4(o, p));
- assertEquals(keys, has_keys);
- has_keys.length = 0;
+ assertEquals(keys, property_descriptor_keys);
+ property_descriptor_keys.length = 0;
}
check_f4();
@@ -138,12 +129,10 @@
var handler3 = {
ownKeys() { return ["a", "b"] },
- getOwnPropertyDescriptor() { return { enumerable: true, configurable: true }},
-
- has(target, k) {
+ getOwnPropertyDescriptor(target, k) {
if (k == "a") count++;
- if (x) %ScheduleBreak();
- return true;
+ if (x) %ScheduleBreak()
+ return { enumerable: true, configurable: true }
}
};
diff --git a/test/mjsunit/for-in.js b/test/mjsunit/for-in.js
index 644c27a..bece37a 100644
--- a/test/mjsunit/for-in.js
+++ b/test/mjsunit/for-in.js
@@ -120,7 +120,23 @@
assertEquals("undefined", typeof y[0], "y[0]");
}
-(function() {
+(function testLargeElementKeys() {
+ // Key out of SMI range but well within safe double representaion.
+ var large_key = 2147483650;
+ var o = [];
+ // Trigger dictionary elements with HeapNumber keys.
+ o[large_key] = 0;
+ o[large_key+1] = 1;
+ o[large_key+2] = 2;
+ o[large_key+3] = 3;
+ var keys = [];
+ for (var k in o) {
+ keys.push(k);
+ }
+ assertEquals(["2147483650", "2147483651", "2147483652", "2147483653"], keys);
+})();
+
+(function testLargeElementKeysWithProto() {
var large_key = 2147483650;
var o = {__proto__: {}};
o[large_key] = 1;
@@ -131,3 +147,17 @@
}
assertEquals(["2147483650"], keys);
})();
+
+(function testNonEnumerableArgumentsIndex() {
+ Object.defineProperty(arguments, 0, {enumerable:false});
+ for (var k in arguments) {
+ assertUnreachable();
+ }
+})();
+
+(function testNonEnumerableSloppyArgumentsIndex(a) {
+ Object.defineProperty(arguments, 0, {enumerable:false});
+ for (var k in arguments) {
+ assertUnreachable();
+ }
+})(true);
diff --git a/test/mjsunit/function-caller.js b/test/mjsunit/function-caller.js
index 84f3cbe..7443cf7 100644
--- a/test/mjsunit/function-caller.js
+++ b/test/mjsunit/function-caller.js
@@ -47,7 +47,7 @@
eval('f(null)');
// Check called from strict builtin functions.
-// [null, null].sort(f); // Does not work because sort tail calls.
+[null, null].sort(f);
[null].forEach(f, null);
// Check called from sloppy builtin functions.
diff --git a/test/mjsunit/global-const-var-conflicts.js b/test/mjsunit/global-const-var-conflicts.js
deleted file mode 100644
index 960b3d3..0000000
--- a/test/mjsunit/global-const-var-conflicts.js
+++ /dev/null
@@ -1,62 +0,0 @@
-// Copyright 2008 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// Check that dynamically introducing conflicting consts/vars
-// is silently ignored (and does not lead to exceptions).
-
-// Flags: --legacy-const
-
-var caught = 0;
-
-eval("const a");
-try { eval("var a"); } catch (e) { caught++; assertTrue(e instanceof TypeError); }
-assertTrue(typeof a == 'undefined');
-try { eval("var a = 1"); } catch (e) { caught++; assertTrue(e instanceof TypeError); }
-assertTrue(typeof a == 'undefined');
-
-eval("const b = 0");
-try { eval("var b"); } catch (e) { caught++; assertTrue(e instanceof TypeError); }
-assertEquals(0, b);
-try { eval("var b = 1"); } catch (e) { caught++; assertTrue(e instanceof TypeError); }
-assertEquals(0, b);
-assertEquals(0, caught);
-
-eval("var c");
-try { eval("const c"); } catch (e) { caught++; assertTrue(e instanceof TypeError); }
-assertTrue(typeof c == 'undefined');
-assertEquals(1, caught);
-try { eval("const c = 1"); } catch (e) { caught++; assertTrue(e instanceof TypeError); }
-assertEquals(undefined, c);
-assertEquals(2, caught);
-
-eval("var d = 0");
-try { eval("const d"); } catch (e) { caught++; assertTrue(e instanceof TypeError); }
-assertEquals(0, d);
-assertEquals(3, caught);
-try { eval("const d = 1"); } catch (e) { caught++; assertTrue(e instanceof TypeError); }
-assertEquals(0, d);
-assertEquals(4, caught);
diff --git a/test/mjsunit/harmony/array-species-constructor-accessor.js b/test/mjsunit/harmony/array-species-constructor-accessor.js
new file mode 100644
index 0000000..4c852f0
--- /dev/null
+++ b/test/mjsunit/harmony/array-species-constructor-accessor.js
@@ -0,0 +1,28 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-species --allow-natives-syntax
+
+// Overwriting the constructor of an instance updates the protector
+
+let x = [];
+
+assertEquals(Array, x.map(()=>{}).constructor);
+assertEquals(Array, x.filter(()=>{}).constructor);
+assertEquals(Array, x.slice().constructor);
+assertEquals(Array, x.splice().constructor);
+assertEquals(Array, x.concat([1]).constructor);
+assertEquals(1, x.concat([1])[0]);
+
+class MyArray extends Array { }
+
+Object.defineProperty(x, 'constructor', {get() { return MyArray; }});
+assertFalse(%SpeciesProtector());
+
+assertEquals(MyArray, x.map(()=>{}).constructor);
+assertEquals(MyArray, x.filter(()=>{}).constructor);
+assertEquals(MyArray, x.slice().constructor);
+assertEquals(MyArray, x.splice().constructor);
+assertEquals(MyArray, x.concat([1]).constructor);
+assertEquals(1, x.concat([1])[0]);
diff --git a/test/mjsunit/harmony/array-species-constructor-delete.js b/test/mjsunit/harmony/array-species-constructor-delete.js
index e61d0dd..f341282 100644
--- a/test/mjsunit/harmony/array-species-constructor-delete.js
+++ b/test/mjsunit/harmony/array-species-constructor-delete.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-species
+// Flags: --harmony-species --allow-natives-syntax
// Overwriting the constructor of an instance updates the protector
@@ -19,6 +19,7 @@
Object.prototype.constructor = MyArray;
delete Array.prototype.constructor;
+assertFalse(%SpeciesProtector());
assertEquals(MyArray, x.map(()=>{}).constructor);
assertEquals(MyArray, x.filter(()=>{}).constructor);
diff --git a/test/mjsunit/harmony/array-species-constructor.js b/test/mjsunit/harmony/array-species-constructor.js
index d4eeefa..d766e09 100644
--- a/test/mjsunit/harmony/array-species-constructor.js
+++ b/test/mjsunit/harmony/array-species-constructor.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-species
+// Flags: --harmony-species --allow-natives-syntax
// Overwriting the constructor of an instance updates the protector
@@ -18,6 +18,7 @@
class MyArray extends Array { }
x.constructor = MyArray;
+assertFalse(%SpeciesProtector());
assertEquals(MyArray, x.map(()=>{}).constructor);
assertEquals(MyArray, x.filter(()=>{}).constructor);
diff --git a/test/mjsunit/harmony/array-species-delete.js b/test/mjsunit/harmony/array-species-delete.js
index bccf3a4..ba49414 100644
--- a/test/mjsunit/harmony/array-species-delete.js
+++ b/test/mjsunit/harmony/array-species-delete.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-species
+// Flags: --harmony-species --allow-natives-syntax
// Overwriting the constructor of an instance updates the protector
@@ -19,6 +19,7 @@
Object.prototype[Symbol.species] = MyArray;
delete Array[Symbol.species];
+assertFalse(%SpeciesProtector());
assertEquals(MyArray, x.map(()=>{}).constructor);
assertEquals(MyArray, x.filter(()=>{}).constructor);
diff --git a/test/mjsunit/harmony/array-species-modified.js b/test/mjsunit/harmony/array-species-modified.js
index b5c5c16..73c52b9 100644
--- a/test/mjsunit/harmony/array-species-modified.js
+++ b/test/mjsunit/harmony/array-species-modified.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-species
+// Flags: --harmony-species --allow-natives-syntax
// Overwriting Array[Symbol.species] updates the protector
@@ -18,6 +18,7 @@
class MyArray extends Array { }
Object.defineProperty(Array, Symbol.species, {value: MyArray});
+assertFalse(%SpeciesProtector());
assertEquals(MyArray, x.map(()=>{}).constructor);
assertEquals(MyArray, x.filter(()=>{}).constructor);
diff --git a/test/mjsunit/harmony/array-species-parent-constructor.js b/test/mjsunit/harmony/array-species-parent-constructor.js
index 8ea59bc..347732e 100644
--- a/test/mjsunit/harmony/array-species-parent-constructor.js
+++ b/test/mjsunit/harmony/array-species-parent-constructor.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-species
+// Flags: --harmony-species --allow-natives-syntax
// Overwriting Array.prototype.constructor updates the protector
@@ -18,6 +18,7 @@
class MyArray extends Array { }
Array.prototype.constructor = MyArray;
+assertFalse(%SpeciesProtector());
assertEquals(MyArray, x.map(()=>{}).constructor);
assertEquals(MyArray, x.filter(()=>{}).constructor);
diff --git a/test/mjsunit/harmony/array-species-proto.js b/test/mjsunit/harmony/array-species-proto.js
index 077b3f5..70db751 100644
--- a/test/mjsunit/harmony/array-species-proto.js
+++ b/test/mjsunit/harmony/array-species-proto.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-species
+// Flags: --harmony-species --allow-natives-syntax
// Overwriting an array instance's __proto__ updates the protector
@@ -18,6 +18,7 @@
class MyArray extends Array { }
x.__proto__ = MyArray.prototype;
+assertTrue(%SpeciesProtector());
assertEquals(MyArray, x.map(()=>{}).constructor);
assertEquals(MyArray, x.filter(()=>{}).constructor);
diff --git a/test/mjsunit/harmony/array-species.js b/test/mjsunit/harmony/array-species.js
index 3cef50c..19ed1d8 100644
--- a/test/mjsunit/harmony/array-species.js
+++ b/test/mjsunit/harmony/array-species.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-species --harmony-proxies
+// Flags: --harmony-species
// Test the ES2015 @@species feature
diff --git a/test/mjsunit/harmony/atomics.js b/test/mjsunit/harmony/atomics.js
index 4b9c9f6..bf27eb4 100644
--- a/test/mjsunit/harmony/atomics.js
+++ b/test/mjsunit/harmony/atomics.js
@@ -60,83 +60,65 @@
});
})();
-function testAtomicOp(op, ia, index, expectedIndex, name) {
- for (var i = 0; i < ia.length; ++i)
- ia[i] = 22;
-
- ia[expectedIndex] = 0;
- assertEquals(0, op(ia, index, 0, 0), name);
- assertEquals(0, ia[expectedIndex], name);
-
- for (var i = 0; i < ia.length; ++i) {
- if (i == expectedIndex) continue;
- assertEquals(22, ia[i], name);
- }
-}
-
(function TestBadIndex() {
var sab = new SharedArrayBuffer(8);
var si32a = new Int32Array(sab);
var si32a2 = new Int32Array(sab, 4);
- // Non-integer indexes are converted to an integer first, so they should all
- // operate on index 0.
- [undefined, null, false, 'hi', {}].forEach(function(i) {
+ // Non-integer indexes should throw RangeError.
+ var nonInteger = [1.4, '1.4', NaN, -Infinity, Infinity, undefined, 'hi', {}];
+ nonInteger.forEach(function(i) {
+ assertThrows(function() { Atomics.compareExchange(si32a, i, 0); },
+ RangeError);
+ assertThrows(function() { Atomics.load(si32a, i, 0); }, RangeError);
+ assertThrows(function() { Atomics.store(si32a, i, 0); }, RangeError);
+ assertThrows(function() { Atomics.add(si32a, i, 0); }, RangeError);
+ assertThrows(function() { Atomics.sub(si32a, i, 0); }, RangeError);
+ assertThrows(function() { Atomics.and(si32a, i, 0); }, RangeError);
+ assertThrows(function() { Atomics.or(si32a, i, 0); }, RangeError);
+ assertThrows(function() { Atomics.xor(si32a, i, 0); }, RangeError);
+ assertThrows(function() { Atomics.exchange(si32a, i, 0); }, RangeError);
+ }, RangeError);
- var name = String(i);
- testAtomicOp(Atomics.compareExchange, si32a, i, 0, name);
- testAtomicOp(Atomics.load, si32a, i, 0, name);
- testAtomicOp(Atomics.store, si32a, i, 0, name);
- testAtomicOp(Atomics.add, si32a, i, 0, name);
- testAtomicOp(Atomics.sub, si32a, i, 0, name);
- testAtomicOp(Atomics.and, si32a, i, 0, name);
- testAtomicOp(Atomics.or, si32a, i, 0, name);
- testAtomicOp(Atomics.xor, si32a, i, 0, name);
- testAtomicOp(Atomics.exchange, si32a, i, 0, name);
- });
-
- // Out-of-bounds indexes should return undefined.
- // TODO(binji): Should these throw RangeError instead?
+ // Out-of-bounds indexes should throw RangeError.
[-1, 2, 100].forEach(function(i) {
- var name = String(i);
- assertEquals(undefined, Atomics.compareExchange(si32a, i, 0, 0), name);
- assertEquals(undefined, Atomics.load(si32a, i), name);
- assertEquals(undefined, Atomics.store(si32a, i, 0), name);
- assertEquals(undefined, Atomics.add(si32a, i, 0), name);
- assertEquals(undefined, Atomics.sub(si32a, i, 0), name);
- assertEquals(undefined, Atomics.and(si32a, i, 0), name);
- assertEquals(undefined, Atomics.or(si32a, i, 0), name);
- assertEquals(undefined, Atomics.xor(si32a, i, 0), name);
- assertEquals(undefined, Atomics.exchange(si32a, i, 0), name);
- });
+ assertThrows(function() { Atomics.compareExchange(si32a, i, 0, 0); },
+ RangeError);
+ assertThrows(function() { Atomics.load(si32a, i); }, RangeError);
+ assertThrows(function() { Atomics.store(si32a, i, 0); }, RangeError);
+ assertThrows(function() { Atomics.add(si32a, i, 0); }, RangeError);
+ assertThrows(function() { Atomics.sub(si32a, i, 0); }, RangeError);
+ assertThrows(function() { Atomics.and(si32a, i, 0); }, RangeError);
+ assertThrows(function() { Atomics.or(si32a, i, 0); }, RangeError);
+ assertThrows(function() { Atomics.xor(si32a, i, 0); }, RangeError);
+ assertThrows(function() { Atomics.exchange(si32a, i, 0); }, RangeError);
+ }, RangeError);
- // Out-of-bounds indexes for offset-array
+ // Out-of-bounds indexes for array with offset should throw RangeError.
[-1, 1, 100].forEach(function(i) {
- var name = String(i);
- assertEquals(undefined, Atomics.compareExchange(si32a2, i, 0, 0), name);
- assertEquals(undefined, Atomics.load(si32a2, i), name);
- assertEquals(undefined, Atomics.store(si32a2, i, 0), name);
- assertEquals(undefined, Atomics.add(si32a2, i, 0), name);
- assertEquals(undefined, Atomics.sub(si32a2, i, 0), name);
- assertEquals(undefined, Atomics.and(si32a2, i, 0), name);
- assertEquals(undefined, Atomics.or(si32a2, i, 0), name);
- assertEquals(undefined, Atomics.xor(si32a2, i, 0), name);
- assertEquals(undefined, Atomics.exchange(si32a2, i, 0), name);
+ assertThrows(function() { Atomics.compareExchange(si32a2, i, 0, 0); });
+ assertThrows(function() { Atomics.load(si32a2, i); }, RangeError);
+ assertThrows(function() { Atomics.store(si32a2, i, 0); }, RangeError);
+ assertThrows(function() { Atomics.add(si32a2, i, 0); }, RangeError);
+ assertThrows(function() { Atomics.sub(si32a2, i, 0); }, RangeError);
+ assertThrows(function() { Atomics.and(si32a2, i, 0); }, RangeError);
+ assertThrows(function() { Atomics.or(si32a2, i, 0); }, RangeError);
+ assertThrows(function() { Atomics.xor(si32a2, i, 0); }, RangeError);
+ assertThrows(function() { Atomics.exchange(si32a2, i, 0); }, RangeError);
});
- // Monkey-patch length and make sure these functions still return undefined.
+ // Monkey-patch length and make sure these functions still throw.
Object.defineProperty(si32a, 'length', {get: function() { return 1000; }});
[2, 100].forEach(function(i) {
- var name = String(i);
- assertEquals(undefined, Atomics.compareExchange(si32a, i, 0, 0), name);
- assertEquals(undefined, Atomics.load(si32a, i), name);
- assertEquals(undefined, Atomics.store(si32a, i, 0), name);
- assertEquals(undefined, Atomics.add(si32a, i, 0), name);
- assertEquals(undefined, Atomics.sub(si32a, i, 0), name);
- assertEquals(undefined, Atomics.and(si32a, i, 0), name);
- assertEquals(undefined, Atomics.or(si32a, i, 0), name);
- assertEquals(undefined, Atomics.xor(si32a, i, 0), name);
- assertEquals(undefined, Atomics.exchange(si32a, i, 0), name);
+ assertThrows(function() { Atomics.compareExchange(si32a, i, 0, 0); });
+ assertThrows(function() { Atomics.load(si32a, i); });
+ assertThrows(function() { Atomics.store(si32a, i, 0); });
+ assertThrows(function() { Atomics.add(si32a, i, 0); });
+ assertThrows(function() { Atomics.sub(si32a, i, 0); });
+ assertThrows(function() { Atomics.and(si32a, i, 0); });
+ assertThrows(function() { Atomics.or(si32a, i, 0); });
+ assertThrows(function() { Atomics.xor(si32a, i, 0); });
+ assertThrows(function() { Atomics.exchange(si32a, i, 0); });
});
})();
@@ -145,22 +127,52 @@
var si32a = new Int32Array(sab);
var si32a2 = new Int32Array(sab, 32);
- var valueOf = {valueOf: function(){ return 3;}};
- var toString = {toString: function(){ return '3';}};
+ var testOp = function(op, ia, index, expectedIndex, name) {
+ for (var i = 0; i < ia.length; ++i)
+ ia[i] = 22;
- [3, 3.5, '3', '3.5', valueOf, toString].forEach(function(i) {
+ ia[expectedIndex] = 0;
+ assertEquals(0, op(ia, index, 0, 0), name);
+ assertEquals(0, ia[expectedIndex], name);
+
+ for (var i = 0; i < ia.length; ++i) {
+ if (i == expectedIndex) continue;
+ assertEquals(22, ia[i], name);
+ }
+ };
+
+ // These values all map to index 0
+ [-0, 0, 0.0, null, false].forEach(function(i) {
var name = String(i);
[si32a, si32a2].forEach(function(array) {
- testAtomicOp(Atomics.compareExchange, array, i, 3, name);
- testAtomicOp(Atomics.load, array, i, 3, name);
- testAtomicOp(Atomics.store, array, i, 3, name);
- testAtomicOp(Atomics.add, array, i, 3, name);
- testAtomicOp(Atomics.sub, array, i, 3, name);
- testAtomicOp(Atomics.and, array, i, 3, name);
- testAtomicOp(Atomics.or, array, i, 3, name);
- testAtomicOp(Atomics.xor, array, i, 3, name);
- testAtomicOp(Atomics.exchange, array, i, 3, name);
- })
+ testOp(Atomics.compareExchange, array, i, 0, name);
+ testOp(Atomics.load, array, i, 0, name);
+ testOp(Atomics.store, array, i, 0, name);
+ testOp(Atomics.add, array, i, 0, name);
+ testOp(Atomics.sub, array, i, 0, name);
+ testOp(Atomics.and, array, i, 0, name);
+ testOp(Atomics.or, array, i, 0, name);
+ testOp(Atomics.xor, array, i, 0, name);
+ testOp(Atomics.exchange, array, i, 0, name);
+ });
+ });
+
+ // These values all map to index 3
+ var valueOf = {valueOf: function(){ return 3;}};
+ var toString = {toString: function(){ return '3';}};
+ [3, 3.0, '3', '3.0', valueOf, toString].forEach(function(i) {
+ var name = String(i);
+ [si32a, si32a2].forEach(function(array) {
+ testOp(Atomics.compareExchange, array, i, 3, name);
+ testOp(Atomics.load, array, i, 3, name);
+ testOp(Atomics.store, array, i, 3, name);
+ testOp(Atomics.add, array, i, 3, name);
+ testOp(Atomics.sub, array, i, 3, name);
+ testOp(Atomics.and, array, i, 3, name);
+ testOp(Atomics.or, array, i, 3, name);
+ testOp(Atomics.xor, array, i, 3, name);
+ testOp(Atomics.exchange, array, i, 3, name);
+ });
});
})();
diff --git a/test/mjsunit/harmony/block-conflicts-sloppy.js b/test/mjsunit/harmony/block-conflicts-sloppy.js
index ad94770..8908ce4 100644
--- a/test/mjsunit/harmony/block-conflicts-sloppy.js
+++ b/test/mjsunit/harmony/block-conflicts-sloppy.js
@@ -4,7 +4,7 @@
// Test for conflicting variable bindings.
-// Flags: --no-legacy-const --harmony-sloppy --harmony-sloppy-let --harmony-sloppy-function
+// Flags: --harmony-sloppy --harmony-sloppy-let --harmony-sloppy-function
function CheckException(e) {
var string = e.toString();
diff --git a/test/mjsunit/harmony/block-const-assign-sloppy.js b/test/mjsunit/harmony/block-const-assign-sloppy.js
index 506847c..5dde82c 100644
--- a/test/mjsunit/harmony/block-const-assign-sloppy.js
+++ b/test/mjsunit/harmony/block-const-assign-sloppy.js
@@ -25,7 +25,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --no-legacy-const --harmony-sloppy --harmony-sloppy-let
+// Flags: --harmony-sloppy --harmony-sloppy-let
// Test that we throw early syntax errors in harmony mode
// when using an immutable binding in an assigment or with
diff --git a/test/mjsunit/harmony/block-eval-var-over-let.js b/test/mjsunit/harmony/block-eval-var-over-let.js
index c951231..98091b4 100644
--- a/test/mjsunit/harmony/block-eval-var-over-let.js
+++ b/test/mjsunit/harmony/block-eval-var-over-let.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-sloppy --harmony-sloppy-let --harmony-sloppy-function --no-legacy-const
+// Flags: --harmony-sloppy --harmony-sloppy-let --harmony-sloppy-function
// Var-let conflict in a function throws, even if the var is in an eval
diff --git a/test/mjsunit/harmony/block-for-sloppy.js b/test/mjsunit/harmony/block-for-sloppy.js
index 051d2b1..261c46a 100644
--- a/test/mjsunit/harmony/block-for-sloppy.js
+++ b/test/mjsunit/harmony/block-for-sloppy.js
@@ -25,7 +25,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --no-legacy-const --harmony-sloppy --harmony-sloppy-let
+// Flags: --harmony-sloppy --harmony-sloppy-let
function props(x) {
var array = [];
diff --git a/test/mjsunit/harmony/block-leave-sloppy.js b/test/mjsunit/harmony/block-leave-sloppy.js
index fe21341..0023fa0 100644
--- a/test/mjsunit/harmony/block-leave-sloppy.js
+++ b/test/mjsunit/harmony/block-leave-sloppy.js
@@ -25,7 +25,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --no-legacy-const --harmony-sloppy --harmony-sloppy-let
+// Flags: --harmony-sloppy --harmony-sloppy-let
// We want to test the context chain shape. In each of the tests cases
// below, the outer with is to force a runtime lookup of the identifier 'x'
diff --git a/test/mjsunit/harmony/block-let-crankshaft-sloppy.js b/test/mjsunit/harmony/block-let-crankshaft-sloppy.js
index dc5cdfb..4f29c05 100644
--- a/test/mjsunit/harmony/block-let-crankshaft-sloppy.js
+++ b/test/mjsunit/harmony/block-let-crankshaft-sloppy.js
@@ -26,7 +26,7 @@
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
// Flags: --allow-natives-syntax
-// Flags: --no-legacy-const --harmony-sloppy --harmony-sloppy-let
+// Flags: --harmony-sloppy --harmony-sloppy-let
// Check that the following functions are optimizable.
var functions = [ f1, f2, f3, f4, f5, f6, f7, f8, f9, f10, f11, f12, f13, f14,
diff --git a/test/mjsunit/harmony/block-let-declaration-sloppy.js b/test/mjsunit/harmony/block-let-declaration-sloppy.js
index b94576c..af95553 100644
--- a/test/mjsunit/harmony/block-let-declaration-sloppy.js
+++ b/test/mjsunit/harmony/block-let-declaration-sloppy.js
@@ -27,7 +27,7 @@
// Test let declarations in various settings.
-// Flags: --no-legacy-const --harmony-sloppy --harmony-sloppy-let
+// Flags: --harmony-sloppy --harmony-sloppy-let
// Global
let x;
diff --git a/test/mjsunit/harmony/block-let-semantics-sloppy.js b/test/mjsunit/harmony/block-let-semantics-sloppy.js
index 8ec1eea..a55ff8f 100644
--- a/test/mjsunit/harmony/block-let-semantics-sloppy.js
+++ b/test/mjsunit/harmony/block-let-semantics-sloppy.js
@@ -25,7 +25,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --harmony-sloppy --no-legacy-const --harmony-sloppy-let --harmony-sloppy-function
+// Flags: --harmony-sloppy --harmony-sloppy-let --harmony-sloppy-function
// Test temporal dead zone semantics of let bound variables in
// function and block scopes.
diff --git a/test/mjsunit/harmony/block-scoping-sloppy.js b/test/mjsunit/harmony/block-scoping-sloppy.js
index 36a07f1..1785901 100644
--- a/test/mjsunit/harmony/block-scoping-sloppy.js
+++ b/test/mjsunit/harmony/block-scoping-sloppy.js
@@ -25,7 +25,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --allow-natives-syntax --harmony-sloppy --no-legacy-const --harmony-sloppy-let --harmony-sloppy-function
+// Flags: --allow-natives-syntax --harmony-sloppy --harmony-sloppy-let --harmony-sloppy-function
// Test functionality of block scopes.
// Hoisting of var declarations.
diff --git a/test/mjsunit/harmony/block-scoping-top-level-sloppy.js b/test/mjsunit/harmony/block-scoping-top-level-sloppy.js
index 74492c4..6f6a8fe 100644
--- a/test/mjsunit/harmony/block-scoping-top-level-sloppy.js
+++ b/test/mjsunit/harmony/block-scoping-top-level-sloppy.js
@@ -3,7 +3,7 @@
// found in the LICENSE file.
// Flags: --min-preparse-length=0
-// Flags: --no-legacy-const --harmony-sloppy --harmony-sloppy-let
+// Flags: --harmony-sloppy --harmony-sloppy-let
let xxx = 1;
let f = undefined;
diff --git a/test/mjsunit/harmony/block-sloppy-function.js b/test/mjsunit/harmony/block-sloppy-function.js
index 4fa79c2..2bea147 100644
--- a/test/mjsunit/harmony/block-sloppy-function.js
+++ b/test/mjsunit/harmony/block-sloppy-function.js
@@ -2,8 +2,8 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --no-legacy-const --harmony-sloppy --harmony-sloppy-let
-// Flags: --harmony-sloppy-function --harmony-destructuring-bind
+// Flags: --harmony-sloppy --harmony-sloppy-let
+// Flags: --harmony-sloppy-function
// Test Annex B 3.3 semantics for functions declared in blocks in sloppy mode.
// http://www.ecma-international.org/ecma-262/6.0/#sec-block-level-function-declarations-web-legacy-compatibility-semantics
diff --git a/test/mjsunit/harmony/debug-step-destructuring-assignment.js b/test/mjsunit/harmony/debug-step-destructuring-assignment.js
deleted file mode 100644
index bfc75bd..0000000
--- a/test/mjsunit/harmony/debug-step-destructuring-assignment.js
+++ /dev/null
@@ -1,86 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --expose-debug-as debug --harmony-destructuring-assignment
-// Flags: --harmony-destructuring-bind
-
-var exception = null;
-var Debug = debug.Debug;
-var break_count = 0;
-
-function listener(event, exec_state, event_data, data) {
- if (event != Debug.DebugEvent.Break) return;
- try {
- var source = exec_state.frame(0).sourceLineText();
- print(source);
- assertTrue(source.indexOf(`// B${break_count++}`) > 0);
- if (source.indexOf("assertEquals") > 0) {
- exec_state.prepareStep(Debug.StepAction.StepNext);
- } else {
- exec_state.prepareStep(Debug.StepAction.StepIn);
- }
- } catch (e) {
- exception = e;
- print(e);
- }
-};
-
-Debug.setListener(listener);
-
-function f() {
- var a, b, c, d;
- debugger; // B0
- [ // B1
- a, // B3
- b, // B4
- c = 3 // B5
- ] = [1, 2]; // B2
- assertEquals({a:1,b:2,c:3}, {a, b, c}); // B6
-
- [ // B7
- a, // B9
- [
- b, // B10
- c // B11
- ],
- d // B12
- ] = [5, [6, 7], 8]; // B8
- assertEquals({a:5,b:6,c:7,d:8}, {a, b, c, d}); // B13
-
- [ // B14
- a, // B16
- b, // B17
- ...c // B18
- ] = [1, 2, 3, 4]; // B15
- assertEquals({a:1,b:2,c:[3,4]}, {a, b, c}); // B19
-
- ({ // B20
- a, // B22
- b, // B23
- c = 7 // B24
- } = {a: 5, b: 6}); // B21
- assertEquals({a:5,b:6,c:7}, {a, b, c}); // B25
-
- ({ // B26
- a, // B28
- b = return1(), // B29
- c = return1() // B30
- } = {a: 5, b: 6}); // B27
- assertEquals({a:5,b:6,c:1}, {a, b, c}); // B33
-
- ({ // B34
- x : a, // B36
- y : b, // B37
- z : c = 3 // B38
- } = {x: 1, y: 2}); // B35
- assertEquals({a:1,b:2,c:3}, {a, b, c}); // B39
-} // B40
-
-function return1() {
- return 1; // B31
-} // B32
-
-f();
-Debug.setListener(null); // B41
-assertNull(exception);
diff --git a/test/mjsunit/harmony/do-expressions-control.js b/test/mjsunit/harmony/do-expressions-control.js
new file mode 100644
index 0000000..12c5429
--- /dev/null
+++ b/test/mjsunit/harmony/do-expressions-control.js
@@ -0,0 +1,109 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-do-expressions
+
+(function TestDoForInDoBreak() {
+ function f(o, i) {
+ var a = "result@" + do {
+ var r = "(";
+ for (var x in o) {
+ var b = "end@" + do {
+ if (x == i) { break } else { r += o[x]; x }
+ }
+ }
+ r + ")";
+ }
+ return a + "," + b;
+ }
+ assertEquals("result@(3),end@0", f([3], 2));
+ assertEquals("result@(35),end@1", f([3,5], 2));
+ assertEquals("result@(35),end@1", f([3,5,7], 2));
+ assertEquals("result@(35),end@1", f([3,5,7,9], 2));
+ %OptimizeFunctionOnNextCall(f);
+ assertEquals("result@(3),end@0", f([3], 2));
+ assertEquals("result@(35),end@1", f([3,5], 2));
+ assertEquals("result@(35),end@1", f([3,5,7], 2));
+ assertEquals("result@(35),end@1", f([3,5,7,9], 2));
+})();
+
+(function TestDoForInDoContinue() {
+ function f(o, i) {
+ var a = "result@" + do {
+ var r = "("
+ for (var x in o) {
+ var b = "end@" + do {
+ if (x == i) { continue } else { r += o[x]; x }
+ }
+ }
+ r + ")"
+ }
+ return a + "," + b
+ }
+ assertEquals("result@(3),end@0", f([3], 2));
+ assertEquals("result@(35),end@1", f([3,5], 2));
+ assertEquals("result@(35),end@1", f([3,5,7], 2));
+ assertEquals("result@(359),end@3", f([3,5,7,9], 2));
+ %OptimizeFunctionOnNextCall(f);
+ assertEquals("result@(3),end@0", f([3], 2));
+ assertEquals("result@(35),end@1", f([3,5], 2));
+ assertEquals("result@(35),end@1", f([3,5,7], 2));
+ assertEquals("result@(359),end@3", f([3,5,7,9], 2));
+})();
+
+(function TestDoForNestedWithTargetLabels() {
+ function f(mode) {
+ var loop = true;
+ var head = "<";
+ var tail = ">";
+ var middle =
+ "1" + do { loop1: for(; loop; head += "A") {
+ "2" + do { loop2: for(; loop; head += "B") {
+ "3" + do { loop3: for(; loop; head += "C") {
+ "4" + do { loop4: for(; loop; head += "D") {
+ "5" + do { loop5: for(; loop; head += "E") {
+ "6" + do { loop6: for(; loop; head += "F") {
+ loop = false;
+ switch (mode) {
+ case "b1": break loop1;
+ case "b2": break loop2;
+ case "b3": break loop3;
+ case "b4": break loop4;
+ case "b5": break loop5;
+ case "b6": break loop6;
+ case "c1": continue loop1;
+ case "c2": continue loop2;
+ case "c3": continue loop3;
+ case "c4": continue loop4;
+ case "c5": continue loop5;
+ case "c6": continue loop6;
+ default: "7";
+ }
+ }}
+ }}
+ }}
+ }}
+ }}
+ }}
+ return head + middle + tail;
+ }
+ function test() {
+ assertEquals( "<1undefined>", f("b1"));
+ assertEquals( "<A1undefined>", f("c1"));
+ assertEquals( "<A12undefined>", f("b2"));
+ assertEquals( "<BA12undefined>", f("c2"));
+ assertEquals( "<BA123undefined>", f("b3"));
+ assertEquals( "<CBA123undefined>", f("c3"));
+ assertEquals( "<CBA1234undefined>", f("b4"));
+ assertEquals( "<DCBA1234undefined>", f("c4"));
+ assertEquals( "<DCBA12345undefined>", f("b5"));
+ assertEquals( "<EDCBA12345undefined>", f("c5"));
+ assertEquals( "<EDCBA123456undefined>", f("b6"));
+ assertEquals("<FEDCBA123456undefined>", f("c6"));
+ assertEquals("<FEDCBA1234567>", f("xx"));
+ }
+ test();
+ %OptimizeFunctionOnNextCall(f);
+ test();
+})();
diff --git a/test/mjsunit/harmony/do-expressions.js b/test/mjsunit/harmony/do-expressions.js
index 3aace57..b3be4ec 100644
--- a/test/mjsunit/harmony/do-expressions.js
+++ b/test/mjsunit/harmony/do-expressions.js
@@ -3,7 +3,6 @@
// found in the LICENSE file.
// Flags: --harmony-do-expressions --harmony-sloppy-let --allow-natives-syntax
-// Flags: --harmony-default-parameters --harmony-destructuring-bind
function returnValue(v) { return v; }
function MyError() {}
diff --git a/test/mjsunit/harmony/exponentiation-operator.js b/test/mjsunit/harmony/exponentiation-operator.js
new file mode 100644
index 0000000..543e104
--- /dev/null
+++ b/test/mjsunit/harmony/exponentiation-operator.js
@@ -0,0 +1,278 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-exponentiation-operator
+
+function TestBasic() {
+ assertEquals(-(8 ** 2), -64);
+ assertEquals(+(8 ** 2), 64);
+ assertEquals(~(8 ** 2), -65);
+ assertEquals(!(8 ** 2), false);
+
+ assertEquals(2 ** -2, 0.25);
+
+ var o = { p: 1 };
+ assertEquals(2 ** delete o.p, 2);
+
+ assertEquals(2 ** void 1, NaN);
+
+ assertEquals(2 ** typeof 1, NaN);
+
+ var s = "2";
+ var n = 2;
+
+ assertEquals(2 ** "2", 4);
+ assertEquals(2 ** +"2", 4);
+ assertEquals(2 ** +s, 4);
+ assertEquals(2 ** s, 4);
+ assertEquals(2 ** 2, 4);
+ assertEquals(2 ** +2, 4);
+ assertEquals(2 ** +n, 4);
+ assertEquals(2 ** n, 4);
+
+ assertEquals(2 ** -"2", 0.25);
+ assertEquals(2 ** -s, 0.25);
+ assertEquals(2 ** -2, 0.25);
+ assertEquals(2 ** -n, 0.25);
+
+ assertEquals(2 ** ~"2", 0.125);
+ assertEquals(2 ** ~s, 0.125);
+ assertEquals(2 ** ~2, 0.125);
+ assertEquals(2 ** ~n, 0.125);
+
+ assertEquals(2 ** !"2", 1);
+ assertEquals(2 ** !s, 1);
+ assertEquals(2 ** !2, 1);
+ assertEquals(2 ** !n, 1);
+
+ var exponent = 2;
+ assertEquals(2 ** 3, 8);
+ assertEquals(3 * 2 ** 3, 24);
+ assertEquals(2 ** ++exponent, 8);
+ assertEquals(2 ** -1 * 2, 1);
+ assertEquals(2 ** 2 * 4, 16);
+ assertEquals(2 ** 2 / 2, 2);
+ assertEquals(2 ** (3 ** 2), 512);
+ assertEquals(2 ** 3 ** 2, 512);
+ assertEquals(2 * 3 ** 2, 18);
+ assertEquals(16 / 2 ** 2, 4);
+}
+TestBasic();
+
+
+function TestAssignment() {
+ var base = -5;
+ assertEquals(base **= 3, -125);
+ assertEquals(base, -125);
+}
+TestAssignment();
+
+
+function TestPrecedence() {
+ var base = 4;
+ assertEquals(--base ** 2, 9); // 3 ** 2
+ assertEquals(++base ** 2, 16); // 4 ** 2
+ assertEquals(base++ ** 2, 16); // 4 ** 2
+ assertEquals(base-- ** 2, 25); // 5 ** 2
+
+ assertEquals(4, base);
+ assertEquals(--base ** --base ** 2,
+ Math.pow(3, Math.pow(2, 2)));
+
+ assertEquals(2, base);
+ assertEquals(++base ** ++base ** 2,
+ Math.pow(3, Math.pow(4, 2)));
+
+ base = 4;
+ assertEquals(base-- ** base-- ** 2,
+ Math.pow(4, Math.pow(3, 2)));
+
+ assertEquals(2, base);
+ assertEquals(base++ ** base++ ** 2,
+ Math.pow(2, Math.pow(3, 2)));
+}
+TestPrecedence();
+
+
+function TestInvariants() {
+ assertEquals(NaN, 2 ** NaN);
+ assertEquals(NaN, (+0) ** NaN);
+ assertEquals(NaN, (-0) ** NaN);
+ assertEquals(NaN, Infinity ** NaN);
+ assertEquals(NaN, (-Infinity) ** NaN);
+
+ assertEquals(1, NaN ** +0);
+ assertEquals(1, NaN ** -0);
+
+ assertEquals(NaN, NaN ** NaN);
+ assertEquals(NaN, NaN ** 2.2);
+ assertEquals(NaN, NaN ** 1);
+ assertEquals(NaN, NaN ** -1);
+ assertEquals(NaN, NaN ** -2.2);
+ assertEquals(NaN, NaN ** Infinity);
+ assertEquals(NaN, NaN ** -Infinity);
+
+ assertEquals(Infinity, 1.1 ** Infinity);
+ assertEquals(Infinity, (-1.1) ** Infinity);
+ assertEquals(Infinity, 2 ** Infinity);
+ assertEquals(Infinity, (-2) ** Infinity);
+
+ // Because +0 == -0, we need to compare 1/{+,-}0 to {+,-}Infinity
+ assertEquals(+Infinity, 1/1.1 ** -Infinity);
+ assertEquals(+Infinity, 1/(-1.1) ** -Infinity);
+ assertEquals(+Infinity, 1/2 ** -Infinity);
+ assertEquals(+Infinity, 1/(-2) ** -Infinity);
+
+ assertEquals(NaN, 1 ** Infinity);
+ assertEquals(NaN, 1 ** -Infinity);
+ assertEquals(NaN, (-1) ** Infinity);
+ assertEquals(NaN, (-1) ** -Infinity);
+
+ assertEquals(+0, 0.1 ** Infinity);
+ assertEquals(+0, (-0.1) ** Infinity);
+ assertEquals(+0, 0.999 ** Infinity);
+ assertEquals(+0, (-0.999) ** Infinity);
+
+ assertEquals(Infinity, 0.1 ** -Infinity);
+ assertEquals(Infinity, (-0.1) ** -Infinity);
+ assertEquals(Infinity, 0.999 ** -Infinity);
+ assertEquals(Infinity, (-0.999) ** -Infinity);
+
+ assertEquals(Infinity, Infinity ** 0.1);
+ assertEquals(Infinity, Infinity ** 2);
+
+ assertEquals(+Infinity, 1/Infinity ** -0.1);
+ assertEquals(+Infinity, 1/Infinity ** -2);
+
+ assertEquals(-Infinity, (-Infinity) ** 3);
+ assertEquals(-Infinity, (-Infinity) ** 13);
+
+ assertEquals(Infinity, (-Infinity) ** 3.1);
+ assertEquals(Infinity, (-Infinity) ** 2);
+
+ assertEquals(-Infinity, 1/(-Infinity) ** -3);
+ assertEquals(-Infinity, 1/(-Infinity) ** -13);
+
+ assertEquals(+Infinity, 1/(-Infinity) ** -3.1);
+ assertEquals(+Infinity, 1/(-Infinity) ** -2);
+
+ assertEquals(+Infinity, 1/(+0) ** 1.1);
+ assertEquals(+Infinity, 1/(+0) ** 2);
+
+ assertEquals(Infinity, (+0) ** -1.1);
+ assertEquals(Infinity, (+0) ** -2);
+
+ assertEquals(-Infinity, 1/(-0) ** 3);
+ assertEquals(-Infinity, 1/(-0) ** 13);
+
+ assertEquals(+Infinity, 1/(-0) ** 3.1);
+ assertEquals(+Infinity, 1/(-0) ** 2);
+
+ assertEquals(-Infinity, (-0) ** -3);
+ assertEquals(-Infinity, (-0) ** -13);
+
+ assertEquals(Infinity, (-0) ** -3.1);
+ assertEquals(Infinity, (-0) ** -2);
+
+ assertEquals(NaN, (-0.00001) ** 1.1);
+ assertEquals(NaN, (-0.00001) ** -1.1);
+ assertEquals(NaN, (-1.1) ** 1.1);
+ assertEquals(NaN, (-1.1) ** -1.1);
+ assertEquals(NaN, (-2) ** 1.1);
+ assertEquals(NaN, (-2) ** -1.1);
+ assertEquals(NaN, (-1000) ** 1.1);
+ assertEquals(NaN, (-1000) ** -1.1);
+
+ assertEquals(+Infinity, 1/(-0) ** 0.5);
+ assertEquals(+Infinity, 1/(-0) ** 0.6);
+ assertEquals(-Infinity, 1/(-0) ** 1);
+ assertEquals(-Infinity, 1/(-0) ** 10000000001);
+
+ assertEquals(+Infinity, (-0) ** -0.5);
+ assertEquals(+Infinity, (-0) ** -0.6);
+ assertEquals(-Infinity, (-0) ** -1);
+ assertEquals(-Infinity, (-0) ** -10000000001);
+
+ assertEquals(4, 16 ** 0.5);
+ assertEquals(NaN, (-16) ** 0.5);
+ assertEquals(0.25, 16 ** -0.5);
+ assertEquals(NaN, (-16) ** -0.5);
+}
+TestInvariants();
+
+
+function TestOperationOrder() {
+ var log = [];
+ var handler = {
+ get(t, n) {
+ var result = Reflect.get(t, n);
+ var str = typeof result === "object" ? "[object Object]" : String(result);
+ log.push(`[[Get]](${String(n)}) -> ${str}`);
+ return result;
+ },
+ set(t, n, v) {
+ var result = Reflect.set(t, n, v);
+ log.push(`[[Set]](${String(n)}, ${String(v)}) -> ${String(result)}`);
+ return result;
+ },
+ has() { assertUnreachable("trap 'has' invoked"); },
+ deleteProperty() { assertUnreachable("trap 'deleteProperty' invoked"); },
+ ownKeys() { assertUnreachable("trap 'ownKeys' invoked"); },
+ apply() { assertUnreachable("trap 'apply' invoked"); },
+ construct() { assertUnreachable("trap 'construct' invoked"); },
+ getPrototypeOf() { assertUnreachable("trap 'getPrototypeOf' invoked"); },
+ setPrototypeOf() { assertUnreachable("trap 'setPrototypeOf' invoked"); },
+ isExtensible() { assertUnreachable("trap 'isExtensible' invoked"); },
+ preventExtensions() {
+ assertUnreachable("trap 'preventExtensions' invoked"); },
+ getOwnPropertyDescriptor() {
+ assertUnreachable("trap 'getOwnPropertyDescriptor' invoked"); },
+ defineProperty() { assertUnreachable("trap 'defineProperty' invoked"); },
+ };
+ var P = new Proxy({ x: 2 }, handler);
+
+ assertEquals(256, P.x **= "8");
+ assertEquals([
+ "[[Get]](x) -> 2",
+ "[[Set]](x, 256) -> true"
+ ], log);
+
+ log = [];
+ var O = new Proxy({ p: P }, handler);
+ assertEquals(65536, O.p.x **= 2 );
+ assertEquals([
+ "[[Get]](p) -> [object Object]",
+ "[[Get]](x) -> 256",
+ "[[Set]](x, 65536) -> true"
+ ], log);
+}
+TestOperationOrder();
+
+
+function TestOverrideMathPow() {
+ var MathPow = MathPow;
+ Math.pow = function(a, b) {
+ assertUnreachable(`Math.pow(${String(a)}, ${String(b)}) invoked`);
+ }
+
+ TestBasic();
+ TestAssignment();
+ TestInvariants();
+ TestOperationOrder();
+
+ Math.pow = MathPow;
+}
+TestOverrideMathPow();
+
+function TestBadAssignmentLHS() {
+ assertThrows("if (false) { 17 **= 10; }", ReferenceError);
+ assertThrows("if (false) { '17' **= 10; }", ReferenceError);
+ assertThrows("if (false) { /17/ **= 10; }", ReferenceError);
+ assertThrows("if (false) { ({ valueOf() { return 17; } } **= 10); }",
+ ReferenceError);
+ // TODO(caitp): a Call expression as LHS should be an early ReferenceError!
+ // assertThrows("if (false) { Array() **= 10; }", ReferenceError);
+ assertThrows(() => Array() **= 10, ReferenceError);
+}
+TestBadAssignmentLHS();
diff --git a/test/mjsunit/harmony/function-name.js b/test/mjsunit/harmony/function-name.js
index 7bb1f6a..66a69e0 100644
--- a/test/mjsunit/harmony/function-name.js
+++ b/test/mjsunit/harmony/function-name.js
@@ -3,7 +3,6 @@
// found in the LICENSE file.
//
// Flags: --harmony-function-name
-// Flags: --harmony-destructuring-bind --harmony-destructuring-assignment
(function testVariableDeclarationsFunction() {
'use strict';
diff --git a/test/mjsunit/harmony/futex.js b/test/mjsunit/harmony/futex.js
index 3a73e0a..626cff5 100644
--- a/test/mjsunit/harmony/futex.js
+++ b/test/mjsunit/harmony/futex.js
@@ -51,24 +51,36 @@
// Valid indexes are 0-3.
[-1, 4, 100].forEach(function(invalidIndex) {
- assertEquals(undefined, Atomics.futexWait(i32a, invalidIndex, 0));
- assertEquals(undefined, Atomics.futexWake(i32a, invalidIndex, 0));
+ assertThrows(function() {
+ Atomics.futexWait(i32a, invalidIndex, 0);
+ }, RangeError);
+ assertThrows(function() {
+ Atomics.futexWake(i32a, invalidIndex, 0);
+ }, RangeError);
var validIndex = 0;
- assertEquals(undefined, Atomics.futexWakeOrRequeue(i32a, invalidIndex, 0, 0,
- validIndex));
- assertEquals(undefined, Atomics.futexWakeOrRequeue(i32a, validIndex, 0, 0,
- invalidIndex));
+ assertThrows(function() {
+ Atomics.futexWakeOrRequeue(i32a, invalidIndex, 0, 0, validIndex);
+ }, RangeError);
+ assertThrows(function() {
+ Atomics.futexWakeOrRequeue(i32a, validIndex, 0, 0, invalidIndex);
+ }, RangeError);
});
i32a = new Int32Array(sab, 8);
[-1, 2, 100].forEach(function(invalidIndex) {
- assertEquals(undefined, Atomics.futexWait(i32a, invalidIndex, 0));
- assertEquals(undefined, Atomics.futexWake(i32a, invalidIndex, 0));
+ assertThrows(function() {
+ Atomics.futexWait(i32a, invalidIndex, 0);
+ }, RangeError);
+ assertThrows(function() {
+ Atomics.futexWake(i32a, invalidIndex, 0);
+ }, RangeError);
var validIndex = 0;
- assertEquals(undefined, Atomics.futexWakeOrRequeue(i32a, invalidIndex, 0, 0,
- validIndex));
- assertEquals(undefined, Atomics.futexWakeOrRequeue(i32a, validIndex, 0, 0,
- invalidIndex));
+ assertThrows(function() {
+ Atomics.futexWakeOrRequeue(i32a, invalidIndex, 0, 0, validIndex);
+ }, RangeError);
+ assertThrows(function() {
+ Atomics.futexWakeOrRequeue(i32a, validIndex, 0, 0, invalidIndex);
+ }, RangeError);
});
})();
diff --git a/test/mjsunit/harmony/generators.js b/test/mjsunit/harmony/generators.js
index 5b04504..df6cec8 100644
--- a/test/mjsunit/harmony/generators.js
+++ b/test/mjsunit/harmony/generators.js
@@ -237,8 +237,8 @@
let x = g();
assertEquals({value: 1, done: false}, x.next());
assertEquals({value: 42, done: false}, x.next());
- assertEquals({value: 43, done: false}, x.return(666));
- assertEquals({value: undefined, done: false}, x.next());
+ assertEquals({value: 43, done: false}, x.return(44));
+ assertEquals({value: 44, done: false}, x.next());
assertEquals({value: undefined, done: true}, x.next());
}
@@ -250,3 +250,23 @@
assertThrowsEquals(() => x.next(), 666);
}
}
+
+
+{ // yield*, .return argument is final result
+
+ function* inner() {
+ yield 2;
+ }
+
+ function* g() {
+ yield 1;
+ return yield* inner();
+ }
+
+ {
+ let x = g();
+ assertEquals({value: 1, done: false}, x.next());
+ assertEquals({value: 2, done: false}, x.next());
+ assertEquals({value: 42, done: true}, x.return(42));
+ }
+}
diff --git a/test/mjsunit/harmony/harmony-string-pad-end.js b/test/mjsunit/harmony/harmony-string-pad-end.js
new file mode 100644
index 0000000..3292e94
--- /dev/null
+++ b/test/mjsunit/harmony/harmony-string-pad-end.js
@@ -0,0 +1,87 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-string-padding
+
+(function TestMeta() {
+ assertEquals(1, String.prototype.padEnd.length);
+ assertEquals("function", typeof String.prototype.padEnd);
+ assertEquals(Object.getPrototypeOf(Function),
+ Object.getPrototypeOf(String.prototype.padEnd));
+ assertEquals("padEnd", String.prototype.padEnd.name);
+
+ var desc = Object.getOwnPropertyDescriptor(String.prototype, "padEnd");
+ assertFalse(desc.enumerable);
+ assertTrue(desc.configurable);
+ assertTrue(desc.writable);
+ assertEquals(undefined, desc.get);
+ assertEquals(undefined, desc.set);
+
+ assertThrows(() => new Function(`${String.prototype.padEnd}`), SyntaxError);
+})();
+
+
+(function TestRequireObjectCoercible() {
+ var padEnd = String.prototype.padEnd;
+ assertThrows(() => padEnd.call(null, 4, "test"), TypeError);
+ assertThrows(() => padEnd.call(undefined, 4, "test"), TypeError);
+ assertEquals("123 ", padEnd.call({
+ __proto__: null,
+ valueOf() { return 123; }
+ }, 6, " "));
+
+ var proxy = new Proxy({}, {
+ get(t, name) {
+ if (name === Symbol.toPrimitive || name === "toString") return;
+ if (name === "valueOf") return () => 6.7;
+ assertUnreachable();
+ }
+ });
+ assertEquals("6.7 ", padEnd.call(proxy, 6, " "));
+
+ proxy = new Proxy({}, {
+ get(t, name) {
+ if (name === Symbol.toPrimitive || name === "valueOf") return;
+ if (name === "toString") return () => 6.7;
+ assertUnreachable();
+ }
+ });
+ assertEquals("6.7 ", padEnd.call(proxy, 6, " "));
+})();
+
+
+(function TestToLength() {
+ assertThrows(() => "123".padEnd(Symbol("16")), TypeError);
+ assertEquals("123", "123".padEnd(-1));
+ assertEquals("123", "123".padEnd({ toString() { return -1; } }));
+ assertEquals("123", "123".padEnd(-0));
+ assertEquals("123", "123".padEnd({ toString() { return -0; } }));
+ assertEquals("123", "123".padEnd(+0));
+ assertEquals("123", "123".padEnd({ toString() { return +0; } }));
+ assertEquals("123", "123".padEnd(NaN));
+ assertEquals("123", "123".padEnd({ toString() { return NaN; } }));
+})();
+
+
+(function TestFillerToString() {
+ assertEquals(". ", ".".padEnd(10));
+ assertEquals(". ", ".".padEnd(10, undefined));
+ assertEquals(". ", ".".padEnd(10, { toString() { return ""; } }));
+ assertEquals(".nullnulln", ".".padEnd(10, null));
+})();
+
+
+(function TestFillerRepetition() {
+ for (var i = 2000; i > 0; --i) {
+ var expected = "123" + "xoxo".repeat(i / 4).slice(0, i - 3);
+ var actual = "123".padEnd(i, "xoxo");
+ assertEquals(expected, actual);
+ assertEquals(i > "123".length ? i : 3, actual.length);
+ }
+})();
+
+
+(function TestTruncation() {
+ assertEquals("ab", "a".padEnd(2, "bc"));
+})();
diff --git a/test/mjsunit/harmony/harmony-string-pad-start.js b/test/mjsunit/harmony/harmony-string-pad-start.js
new file mode 100644
index 0000000..2b2d004
--- /dev/null
+++ b/test/mjsunit/harmony/harmony-string-pad-start.js
@@ -0,0 +1,87 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-string-padding
+
+(function TestMeta() {
+ assertEquals(1, String.prototype.padStart.length);
+ assertEquals("function", typeof String.prototype.padStart);
+ assertEquals(Object.getPrototypeOf(Function),
+ Object.getPrototypeOf(String.prototype.padStart));
+ assertEquals("padStart", String.prototype.padStart.name);
+
+ var desc = Object.getOwnPropertyDescriptor(String.prototype, "padStart");
+ assertFalse(desc.enumerable);
+ assertTrue(desc.configurable);
+ assertTrue(desc.writable);
+ assertEquals(undefined, desc.get);
+ assertEquals(undefined, desc.set);
+
+ assertThrows(() => new Function(`${String.prototype.padStart}`), SyntaxError);
+})();
+
+
+(function TestRequireObjectCoercible() {
+ var padStart = String.prototype.padStart;
+ assertThrows(() => padStart.call(null, 4, "test"), TypeError);
+ assertThrows(() => padStart.call(undefined, 4, "test"), TypeError);
+ assertEquals(" 123", padStart.call({
+ __proto__: null,
+ valueOf() { return 123; }
+ }, 6, " "));
+
+ var proxy = new Proxy({}, {
+ get(t, name) {
+ if (name === Symbol.toPrimitive || name === "toString") return;
+ if (name === "valueOf") return () => 6.7;
+ assertUnreachable();
+ }
+ });
+ assertEquals(" 6.7", padStart.call(proxy, 6, " "));
+
+ proxy = new Proxy({}, {
+ get(t, name) {
+ if (name === Symbol.toPrimitive || name === "valueOf") return;
+ if (name === "toString") return () => 6.7;
+ assertUnreachable();
+ }
+ });
+ assertEquals(" 6.7", padStart.call(proxy, 6, " "));
+})();
+
+
+(function TestToLength() {
+ assertThrows(() => "123".padStart(Symbol("16")), TypeError);
+ assertEquals("123", "123".padStart(-1));
+ assertEquals("123", "123".padStart({ toString() { return -1; } }));
+ assertEquals("123", "123".padStart(-0));
+ assertEquals("123", "123".padStart({ toString() { return -0; } }));
+ assertEquals("123", "123".padStart(+0));
+ assertEquals("123", "123".padStart({ toString() { return +0; } }));
+ assertEquals("123", "123".padStart(NaN));
+ assertEquals("123", "123".padStart({ toString() { return NaN; } }));
+})();
+
+
+(function TestFillerToString() {
+ assertEquals(" .", ".".padStart(10));
+ assertEquals(" .", ".".padStart(10, undefined));
+ assertEquals(" .", ".".padStart(10, { toString() { return ""; } }));
+ assertEquals("nullnulln.", ".".padStart(10, null));
+})();
+
+
+(function TestFillerRepetition() {
+ for (var i = 2000; i > 0; --i) {
+ var expected = "xoxo".repeat(i / 4).slice(0, i - 3) + "123";
+ var actual = "123".padStart(i, "xoxo");
+ assertEquals(expected, actual);
+ assertEquals(i > "123".length ? i : 3, actual.length);
+ }
+})();
+
+
+(function TestTruncation() {
+ assertEquals("ba", "a".padStart(2, "bc"));
+})();
diff --git a/test/mjsunit/harmony/iterator-close.js b/test/mjsunit/harmony/iterator-close.js
index 94785de..09e0153 100644
--- a/test/mjsunit/harmony/iterator-close.js
+++ b/test/mjsunit/harmony/iterator-close.js
@@ -4,6 +4,7 @@
// Flags: --harmony-iterator-close
+
function* g() { yield 42; return 88 };
@@ -11,33 +12,86 @@
{
g.prototype.return = null;
+
+ assertEquals(undefined, (() => {
+ for (var x of g()) { break; }
+ })());
+
assertEquals(undefined, (() => {
for (let x of g()) { break; }
})());
assertEquals(undefined, (() => {
+ for (const x of g()) { break; }
+ })());
+
+ assertEquals(undefined, (() => {
for (x of g()) { break; }
})());
+
+ assertThrowsEquals(() => {
+ for (var x of g()) { throw 42; }
+ }, 42);
+
assertThrowsEquals(() => {
for (let x of g()) { throw 42; }
}, 42);
assertThrowsEquals(() => {
+ for (const x of g()) { throw 42; }
+ }, 42);
+
+ assertThrowsEquals(() => {
for (x of g()) { throw 42; }
}, 42);
+
+ assertEquals(42, (() => {
+ for (var x of g()) { return 42; }
+ })());
+
assertEquals(42, (() => {
for (let x of g()) { return 42; }
})());
assertEquals(42, (() => {
+ for (const x of g()) { return 42; }
+ })());
+
+ assertEquals(42, (() => {
for (x of g()) { return 42; }
})());
- assertEquals(42, eval('for (let x of g()) { x; }'));
+
+ assertEquals(42, eval('for (var x of g()) { x; }'));
assertEquals(42, eval('for (let x of g()) { x; }'));
+
+ assertEquals(42, eval('for (const x of g()) { x; }'));
+
+ assertEquals(42, eval('for (x of g()) { x; }'));
+
+
+ assertEquals(42, (() => {
+ var [x] = g(); return x;
+ })());
+
+ assertEquals(42, (() => {
+ let [x] = g(); return x;
+ })());
+
+ assertEquals(42, (() => {
+ const [x] = g(); return x;
+ })());
+
+ assertEquals(42, (() => {
+ [x] = g(); return x;
+ })());
+
+ assertEquals(42,
+ (([x]) => x)(g())
+ );
}
@@ -45,33 +99,86 @@
{
g.prototype.return = 666;
+
+ assertThrows(() => {
+ for (var x of g()) { break; }
+ }, TypeError);
+
assertThrows(() => {
for (let x of g()) { break; }
}, TypeError);
assertThrows(() => {
+ for (const x of g()) { break; }
+ }, TypeError);
+
+ assertThrows(() => {
for (x of g()) { break; }
}, TypeError);
+
+ assertThrows(() => {
+ for (var x of g()) { throw 666; }
+ }, TypeError);
+
assertThrows(() => {
for (let x of g()) { throw 666; }
}, TypeError);
assertThrows(() => {
+ for (const x of g()) { throw 666; }
+ }, TypeError);
+
+ assertThrows(() => {
for (x of g()) { throw 666; }
}, TypeError);
+
+ assertThrows(() => {
+ for (var x of g()) { return 666; }
+ }, TypeError);
+
assertThrows(() => {
for (let x of g()) { return 666; }
}, TypeError);
assertThrows(() => {
+ for (const x of g()) { return 666; }
+ }, TypeError);
+
+ assertThrows(() => {
for (x of g()) { return 666; }
}, TypeError);
- assertEquals(42, eval('for (let x of g()) { x; }'));
+
+ assertEquals(42, eval('for (var x of g()) { x; }'));
assertEquals(42, eval('for (let x of g()) { x; }'));
+
+ assertEquals(42, eval('for (const x of g()) { x; }'));
+
+ assertEquals(42, eval('for (x of g()) { x; }'));
+
+
+ assertThrows(() => {
+ var [x] = g(); return x;
+ }, TypeError);
+
+ assertThrows(() => {
+ let [x] = g(); return x;
+ }, TypeError);
+
+ assertThrows(() => {
+ const [x] = g(); return x;
+ }, TypeError);
+
+ assertThrows(() => {
+ [x] = g(); return x;
+ }, TypeError);
+
+ assertThrows(() => {
+ (([x]) => x)(g());
+ }, TypeError);
}
@@ -79,20 +186,46 @@
{
g.prototype.return = () => 666;
+
+ assertThrows(() => {
+ for (var x of g()) { break; }
+ }, TypeError);
+
assertThrows(() => {
for (let x of g()) { break; }
}, TypeError);
assertThrows(() => {
+ for (const x of g()) { break; }
+ }, TypeError);
+
+ assertThrows(() => {
for (x of g()) { break; }
}, TypeError);
- assertThrows(() => {
+
+ // Throw from the body of a for loop 'wins' vs throw
+ // originating from a bad 'return' value.
+
+ assertThrowsEquals(() => {
+ for (var x of g()) { throw 666; }
+ }, 666);
+
+ assertThrowsEquals(() => {
for (let x of g()) { throw 666; }
- }, TypeError);
+ }, 666);
+
+ assertThrowsEquals(() => {
+ for (const x of g()) { throw 666; }
+ }, 666);
+
+ assertThrowsEquals(() => {
+ for (x of g()) { throw 666; }
+ }, 666);
+
assertThrows(() => {
- for (x of g()) { throw 666; }
+ for (var x of g()) { return 666; }
}, TypeError);
assertThrows(() => {
@@ -100,12 +233,42 @@
}, TypeError);
assertThrows(() => {
+ for (const x of g()) { return 666; }
+ }, TypeError);
+
+ assertThrows(() => {
for (x of g()) { return 666; }
}, TypeError);
+
+ assertEquals(42, eval('for (var x of g()) { x; }'));
+
assertEquals(42, eval('for (let x of g()) { x; }'));
+ assertEquals(42, eval('for (const x of g()) { x; }'));
+
assertEquals(42, eval('for (x of g()) { x; }'));
+
+
+ assertThrows(() => {
+ var [x] = g(); return x;
+ }, TypeError);
+
+ assertThrows(() => {
+ let [x] = g(); return x;
+ }, TypeError);
+
+ assertThrows(() => {
+ const [x] = g(); return x;
+ }, TypeError);
+
+ assertThrows(() => {
+ [x] = g(); return x;
+ }, TypeError);
+
+ assertThrows(() => {
+ (([x]) => x)(g());
+ }, TypeError);
}
@@ -114,14 +277,30 @@
let log = [];
g.prototype.return = (...args) => { log.push(args); return {} };
+
+ log = [];
+ for (var x of g()) { break; }
+ assertEquals([[]], log);
+
log = [];
for (let x of g()) { break; }
assertEquals([[]], log);
log = [];
+ for (const x of g()) { break; }
+ assertEquals([[]], log);
+
+ log = [];
for (x of g()) { break; }
assertEquals([[]], log);
+
+ log = [];
+ assertThrowsEquals(() => {
+ for (var x of g()) { throw 42; }
+ }, 42);
+ assertEquals([[]], log);
+
log = [];
assertThrowsEquals(() => {
for (let x of g()) { throw 42; }
@@ -130,10 +309,23 @@
log = [];
assertThrowsEquals(() => {
+ for (const x of g()) { throw 42; }
+ }, 42);
+ assertEquals([[]], log);
+
+ log = [];
+ assertThrowsEquals(() => {
for (x of g()) { throw 42; }
}, 42);
assertEquals([[]], log);
+
+ log = [];
+ assertEquals(42, (() => {
+ for (var x of g()) { return 42; }
+ })());
+ assertEquals([[]], log);
+
log = [];
assertEquals(42, (() => {
for (let x of g()) { return 42; }
@@ -142,17 +334,505 @@
log = [];
assertEquals(42, (() => {
+ for (const x of g()) { return 42; }
+ })());
+ assertEquals([[]], log);
+
+ log = [];
+ assertEquals(42, (() => {
for (x of g()) { return 42; }
})());
assertEquals([[]], log);
+
+ log = [];
+ assertEquals(42, eval('for (var x of g()) { x; }'));
+ assertEquals([], log);
+
log = [];
assertEquals(42, eval('for (let x of g()) { x; }'));
assertEquals([], log);
log = [];
+ assertEquals(42, eval('for (const x of g()) { x; }'));
+ assertEquals([], log);
+
+ log = [];
assertEquals(42, eval('for (x of g()) { x; }'));
assertEquals([], log);
+
+
+ // Even if doing the assignment throws, still call return
+ log = [];
+ x = { set attr(_) { throw 1234; } };
+ assertThrowsEquals(() => {
+ for (x.attr of g()) { throw 456; }
+ }, 1234);
+ assertEquals([[]], log);
+
+
+ log = [];
+ assertEquals(42, (() => {
+ var [x] = g(); return x;
+ })());
+ assertEquals([[]], log);
+
+ log = [];
+ assertEquals(42, (() => {
+ let [x] = g(); return x;
+ })());
+ assertEquals([[]], log);
+
+ log = [];
+ assertEquals(42, (() => {
+ const [x] = g(); return x;
+ })());
+ assertEquals([[]], log);
+
+ log = [];
+ assertEquals(42, (() => {
+ [x] = g(); return x;
+ })());
+ assertEquals([[]], log);
+
+ log = []
+ assertEquals(42,
+ (([x]) => x)(g())
+ );
+ assertEquals([[]], log);
+
+
+ log = [];
+ assertEquals(42, (() => {
+ var [x,] = g(); return x;
+ })());
+ assertEquals([[]], log);
+
+ log = [];
+ assertEquals(42, (() => {
+ let [x,] = g(); return x;
+ })());
+ assertEquals([[]], log);
+
+ log = [];
+ assertEquals(42, (() => {
+ const [x,] = g(); return x;
+ })());
+ assertEquals([[]], log);
+
+ log = [];
+ assertEquals(42, (() => {
+ [x,] = g(); return x;
+ })());
+ assertEquals([[]], log);
+
+ log = []
+ assertEquals(42,
+ (([x,]) => x)(g())
+ );
+ assertEquals([[]], log);
+
+
+ log = [];
+ assertEquals(42, (() => {
+ var [x,,] = g(); return x;
+ })());
+ assertEquals([], log);
+
+ log = [];
+ assertEquals(42, (() => {
+ let [x,,] = g(); return x;
+ })());
+ assertEquals([], log);
+
+ log = [];
+ assertEquals(42, (() => {
+ const [x,,] = g(); return x;
+ })());
+ assertEquals([], log);
+
+ log = [];
+ assertEquals(42, (() => {
+ [x,,] = g(); return x;
+ })());
+ assertEquals([], log);
+
+ log = []
+ assertEquals(42,
+ (([x,,]) => x)(g())
+ );
+ assertEquals([], log);
+
+
+ log = [];
+ assertEquals([42, undefined], (() => {
+ var [x, y] = g(); return [x, y];
+ })());
+ assertEquals([], log);
+
+ log = [];
+ assertEquals([42, undefined], (() => {
+ let [x, y] = g(); return [x, y];
+ })());
+ assertEquals([], log);
+
+ log = [];
+ assertEquals([42, undefined], (() => {
+ const [x, y] = g(); return [x, y];
+ })());
+ assertEquals([], log);
+
+ log = [];
+ assertEquals([42, undefined], (() => {
+ [x, y] = g(); return [x, y];
+ })());
+ assertEquals([], log);
+
+ log = []
+ assertEquals([42, undefined],
+ (([x, y]) => [x, y])(g())
+ );
+ assertEquals([], log);
+
+
+ log = [];
+ assertEquals([42], (() => {
+ var [...x] = g(); return x;
+ })());
+ assertEquals([], log);
+
+ log = [];
+ assertEquals([42], (() => {
+ let [...x] = g(); return x;
+ })());
+ assertEquals([], log);
+
+ log = [];
+ assertEquals([42], (() => {
+ const [...x] = g(); return x;
+ })());
+ assertEquals([], log);
+
+ log = [];
+ assertEquals([42], (() => {
+ [...x] = g(); return x;
+ })());
+ assertEquals([], log);
+
+ log = []
+ assertEquals([42],
+ (([...x]) => x)(g())
+ );
+ assertEquals([], log);
+
+
+ log = [];
+ assertEquals([42, []], (() => {
+ var [x, ...y] = g(); return [x, y];
+ })());
+ assertEquals([], log);
+
+ log = [];
+ assertEquals([42, []], (() => {
+ let [x, ...y] = g(); return [x, y];
+ })());
+ assertEquals([], log);
+
+ log = [];
+ assertEquals([42, []], (() => {
+ const [x, ...y] = g(); return [x, y];
+ })());
+ assertEquals([], log);
+
+ log = [];
+ assertEquals([42, []], (() => {
+ [x, ...y] = g(); return [x, y];
+ })());
+ assertEquals([], log);
+
+ log = []
+ assertEquals([42, []],
+ (([x, ...y]) => [x, y])(g())
+ );
+ assertEquals([], log);
+
+
+ log = [];
+ assertEquals([], (() => {
+ var [] = g(); return [];
+ })());
+ assertEquals([[]], log);
+
+ log = [];
+ assertEquals([], (() => {
+ let [] = g(); return [];
+ })());
+ assertEquals([[]], log);
+
+ log = [];
+ assertEquals([], (() => {
+ const [] = g(); return [];
+ })());
+ assertEquals([[]], log);
+
+ log = [];
+ assertEquals([], (() => {
+ [] = g(); return [];
+ })());
+ assertEquals([[]], log);
+
+ log = []
+ assertEquals([],
+ (([]) => [])(g())
+ );
+ assertEquals([[]], log);
+
+
+ log = [];
+ assertEquals([], (() => {
+ var [...[]] = g(); return [];
+ })());
+ assertEquals([], log);
+
+ log = [];
+ assertEquals([], (() => {
+ let [...[]] = g(); return [];
+ })());
+ assertEquals([], log);
+
+ log = [];
+ assertEquals([], (() => {
+ const [...[]] = g(); return [];
+ })());
+ assertEquals([], log);
+
+ log = [];
+ assertEquals([], (() => {
+ [...[]] = g(); return [];
+ })());
+ assertEquals([], log);
+
+ log = []
+ assertEquals([],
+ (([...[]]) => [])(g())
+ );
+ assertEquals([], log);
+
+
+ log = [];
+ assertEquals([42], (() => {
+ var [...[x]] = g(); return [x];
+ })());
+ assertEquals([], log);
+
+ log = [];
+ assertEquals([42], (() => {
+ let [...[x]] = g(); return [x];
+ })());
+ assertEquals([], log);
+
+ log = [];
+ assertEquals([42], (() => {
+ const [...[x]] = g(); return [x];
+ })());
+ assertEquals([], log);
+
+ log = [];
+ assertEquals([42], (() => {
+ [...[x]] = g(); return [x];
+ })());
+ assertEquals([], log);
+
+ log = []
+ assertEquals([42],
+ (([...[x]]) => [x])(g())
+ );
+ assertEquals([], log);
+
+
+ log = [];
+ assertEquals([42, undefined], (() => {
+ var [...[x, y]] = g(); return [x, y];
+ })());
+ assertEquals([], log);
+
+ log = [];
+ assertEquals([42, undefined], (() => {
+ let [...[x, y]] = g(); return [x, y];
+ })());
+ assertEquals([], log);
+
+ log = [];
+ assertEquals([42, undefined], (() => {
+ const [...[x, y]] = g(); return [x, y];
+ })());
+ assertEquals([], log);
+
+ log = [];
+ assertEquals([42, undefined], (() => {
+ [...[x, y]] = g(); return [x, y];
+ })());
+ assertEquals([], log);
+
+ log = []
+ assertEquals([42, undefined],
+ (([...[x, y]]) => [x, y])(g())
+ );
+ assertEquals([], log);
+
+
+ log = []
+ assertThrowsEquals(() => {
+ let x = { set foo(_) { throw 666; } };
+ [x.foo] = g();
+ }, 666);
+ assertEquals([[]], log);
+
+
+ log = []
+ assertThrows(() => {
+ var [[]] = g();
+ }, TypeError);
+ assertEquals([[]], log);
+
+ log = []
+ assertThrows(() => {
+ let [[]] = g();
+ }, TypeError);
+ assertEquals([[]], log);
+
+ log = []
+ assertThrows(() => {
+ const [[]] = g();
+ }, TypeError);
+ assertEquals([[]], log);
+
+ log = []
+ assertThrows(() => {
+ [[]] = g();
+ }, TypeError);
+ assertEquals([[]], log);
+
+ log = []
+ assertThrows(() => {
+ (([[]]) => 0)(g());
+ }, TypeError);
+ assertEquals([[]], log);
+
+
+ log = []
+ assertThrows(() => {
+ var [...[[]]] = g();
+ }, TypeError);
+ assertEquals([], log);
+
+ log = []
+ assertThrows(() => {
+ let [...[[]]] = g();
+ }, TypeError);
+ assertEquals([], log);
+
+ log = []
+ assertThrows(() => {
+ const [...[[]]] = g();
+ }, TypeError);
+ assertEquals([], log);
+
+ log = []
+ assertThrows(() => {
+ [...[[]]] = g();
+ }, TypeError);
+ assertEquals([], log);
+
+ log = []
+ assertThrows(() => {
+ (([...[[]]]) => 0)(g());
+ }, TypeError);
+ assertEquals([], log);
+
+
+ {
+ let backup = Array.prototype[Symbol.iterator];
+ Array.prototype[Symbol.iterator] = () => g();
+
+
+ log = [];
+ assertDoesNotThrow(() => {
+ var [x, ...[y]] = [1, 2, 3]
+ });
+ assertEquals(log, [[]]);
+
+ log = [];
+ assertDoesNotThrow(() => {
+ let [x, ...[y]] = [1, 2, 3];
+ });
+ assertEquals(log, [[]]);
+
+ log = [];
+ assertDoesNotThrow(() => {
+ const [x, ...[y]] = [1, 2, 3];
+ });
+ assertEquals(log, [[]]);
+
+ log = [];
+ assertDoesNotThrow(() => {
+ (([x, ...[y]]) => {})([1, 2, 3]);
+ });
+ assertEquals(log, [[]]);
+
+
+ log = [];
+ assertThrows(() => {
+ var [x, ...[[]]] = [1, 2, 3];
+ }, TypeError);
+ assertEquals(log, [[]]);
+
+ log = [];
+ assertThrows(() => {
+ let [x, ...[[]]] = [1, 2, 3];
+ }, TypeError);
+ assertEquals(log, [[]]);
+
+ log = [];
+ assertThrows(() => {
+ const [x, ...[[]]] = [1, 2, 3];
+ }, TypeError);
+ assertEquals(log, [[]]);
+
+ log = [];
+ assertThrows(() => {
+ (([x, ...[[]]]) => {})([1, 2, 3]);
+ }, TypeError);
+ assertEquals(log, [[]]);
+
+
+ log = [];
+ assertDoesNotThrow(() => {
+ var [x, ...[...y]] = [1, 2, 3];
+ });
+ assertEquals(log, []);
+
+ log = [];
+ assertDoesNotThrow(() => {
+ let [x, ...[...y]] = [1, 2, 3];
+ });
+ assertEquals(log, []);
+
+ log = [];
+ assertDoesNotThrow(() => {
+ const [x, ...[...y]] = [1, 2, 3];
+ });
+ assertEquals(log, []);
+
+ log = [];
+ assertDoesNotThrow(() => {
+ (([x, ...[...y]]) => {})([1, 2, 3]);
+ });
+ assertEquals(log, []);
+
+
+ Array.prototype[Symbol.iterator] = backup;
+ }
}
@@ -161,6 +841,13 @@
let log = [];
g.prototype.return = (...args) => { log.push(args); throw 23 };
+
+ log = [];
+ assertThrowsEquals(() => {
+ for (var x of g()) { break; }
+ }, 23);
+ assertEquals([[]], log);
+
log = [];
assertThrowsEquals(() => {
for (let x of g()) { break; }
@@ -169,10 +856,23 @@
log = [];
assertThrowsEquals(() => {
+ for (const x of g()) { break; }
+ }, 23);
+ assertEquals([[]], log);
+
+ log = [];
+ assertThrowsEquals(() => {
for (x of g()) { break; }
}, 23);
assertEquals([[]], log);
+
+ log = [];
+ assertThrowsEquals(() => {
+ for (var x of g()) { throw 42; }
+ }, 42);
+ assertEquals([[]], log);
+
log = [];
assertThrowsEquals(() => {
for (let x of g()) { throw 42; }
@@ -181,10 +881,23 @@
log = [];
assertThrowsEquals(() => {
+ for (const x of g()) { throw 42; }
+ }, 42);
+ assertEquals([[]], log);
+
+ log = [];
+ assertThrowsEquals(() => {
for (x of g()) { throw 42; }
}, 42);
assertEquals([[]], log);
+
+ log = [];
+ assertThrowsEquals(() => {
+ for (var x of g()) { return 42; }
+ }, 23);
+ assertEquals([[]], log);
+
log = [];
assertThrowsEquals(() => {
for (let x of g()) { return 42; }
@@ -193,17 +906,63 @@
log = [];
assertThrowsEquals(() => {
+ for (const x of g()) { return 42; }
+ }, 23);
+ assertEquals([[]], log);
+
+ log = [];
+ assertThrowsEquals(() => {
for (x of g()) { return 42; }
}, 23);
assertEquals([[]], log);
+
+ log = [];
+ assertEquals(42, eval('for (var x of g()) { x; }'));
+ assertEquals([], log);
+
log = [];
assertEquals(42, eval('for (let x of g()) { x; }'));
assertEquals([], log);
log = [];
+ assertEquals(42, eval('for (const x of g()) { x; }'));
+ assertEquals([], log);
+
+ log = [];
assertEquals(42, eval('for (x of g()) { x; }'));
assertEquals([], log);
+
+
+ log = [];
+ assertThrowsEquals(() => {
+ var [x] = g(); return x;
+ }, 23);
+ assertEquals([[]], log);
+
+ log = [];
+ assertThrowsEquals(() => {
+ let [x] = g(); return x;
+ }, 23);
+ assertEquals([[]], log);
+
+ log = [];
+ assertThrowsEquals(() => {
+ const [x] = g(); return x;
+ }, 23);
+ assertEquals([[]], log);
+
+ log = [];
+ assertThrowsEquals(() => {
+ [x] = g(); return x;
+ }, 23);
+ assertEquals([[]], log);
+
+ log = [];
+ assertThrowsEquals(() => {
+ (([x]) => x)(g())
+ }, 23);
+ assertEquals([[]], log);
}
@@ -212,13 +971,130 @@
g.prototype.next = () => { throw 666; };
g.prototype.return = () => { assertUnreachable() };
+
+ assertThrowsEquals(() => {
+ for (var x of g()) {}
+ }, 666);
+
assertThrowsEquals(() => {
for (let x of g()) {}
}, 666);
assertThrowsEquals(() => {
+ for (const x of g()) {}
+ }, 666);
+
+ assertThrowsEquals(() => {
for (x of g()) {}
}, 666);
+
+ assertThrowsEquals(() => {
+ var [x] = g();
+ }, 666);
+
+ assertThrowsEquals(() => {
+ let [x] = g();
+ }, 666);
+
+ assertThrowsEquals(() => {
+ const [x] = g();
+ }, 666);
+
+ assertThrowsEquals(() => {
+ [x] = g();
+ }, 666);
+
+ assertThrowsEquals(() => {
+ (([x]) => x)(g());
+ }, 666);
+}
+
+
+// Value throws.
+{
+ g.prototype.next = () => ({get value() {throw 666}});
+ g.prototype.return = () => { assertUnreachable() };
+
+
+ assertThrowsEquals(() => {
+ for (var x of g()) {}
+ }, 666);
+
+ assertThrowsEquals(() => {
+ for (let x of g()) {}
+ }, 666);
+
+ assertThrowsEquals(() => {
+ for (const x of g()) {}
+ }, 666);
+
+ assertThrowsEquals(() => {
+ for (x of g()) {}
+ }, 666);
+
+ assertThrowsEquals(() => {
+ var [x] = g();
+ }, 666);
+
+ assertThrowsEquals(() => {
+ let [x] = g();
+ }, 666);
+
+ assertThrowsEquals(() => {
+ const [x] = g();
+ }, 666);
+
+ assertThrowsEquals(() => {
+ [x] = g();
+ }, 666);
+
+ assertThrowsEquals(() => {
+ (([x]) => x)(g());
+ }, 666);
+}
+
+
+// Done throws.
+{
+ g.prototype.next = () => ({get done() {throw 666}});
+ g.prototype.return = () => { assertUnreachable() };
+
+
+ assertThrowsEquals(() => {
+ for (var x of g()) {}
+ }, 666);
+
+ assertThrowsEquals(() => {
+ for (let x of g()) {}
+ }, 666);
+
+ assertThrowsEquals(() => {
+ for (const x of g()) {}
+ }, 666);
+
+ assertThrowsEquals(() => {
+ for (x of g()) {}
+ }, 666);
+
+ assertThrowsEquals(() => {
+ var [x] = g();
+ }, 666);
+
+ assertThrowsEquals(() => {
+ let [x] = g();
+ }, 666);
+
+ assertThrowsEquals(() => {
+ const [x] = g();
+ }, 666);
+
+ assertThrowsEquals(() => {
+ [x] = g();
+ }, 666);
+
+ assertThrowsEquals(() => {
+ (([x]) => x)(g());
+ }, 666);
}
diff --git a/test/mjsunit/harmony/module-linking.js b/test/mjsunit/harmony/module-linking.js
deleted file mode 100644
index faaf7f2..0000000
--- a/test/mjsunit/harmony/module-linking.js
+++ /dev/null
@@ -1,298 +0,0 @@
-// Copyright 2012 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// Flags: --harmony-modules
-
-// Test basic module linking and initialization.
-
-"use strict";
-
-module R {
- // At this point, only functions and modules are initialized.
- assertEquals(undefined, v)
- assertEquals(undefined, vv)
- assertEquals(undefined, R.v)
- assertEquals(undefined, M.v)
- assertEquals(undefined, MM.v)
- assertEquals(undefined, F.v)
- assertEquals(undefined, G.v)
- assertThrows(function() { l }, ReferenceError)
- assertThrows(function() { ll }, ReferenceError)
- assertThrows(function() { R.l }, ReferenceError)
- assertThrows(function() { M.l }, ReferenceError)
- assertThrows(function() { MM.l }, ReferenceError)
- assertThrows(function() { F.l }, ReferenceError)
- assertThrows(function() { G.l }, ReferenceError)
- assertThrows(function() { c }, ReferenceError)
- assertThrows(function() { cc }, ReferenceError)
- assertThrows(function() { R.c }, ReferenceError)
- assertThrows(function() { M.c }, ReferenceError)
- assertThrows(function() { MM.c }, ReferenceError)
- assertThrows(function() { F.c }, ReferenceError)
- assertThrows(function() { G.c }, ReferenceError)
- assertEquals(4, f())
- assertEquals(24, ff())
- assertEquals(4, R.f())
- assertEquals(14, M.f())
- assertEquals(34, MM.f())
- assertEquals(44, F.f())
- assertEquals(14, G.f())
-
- // All properties should already exist on the instance objects, though.
- assertTrue("v" in R)
- assertTrue("v" in RR)
- assertTrue("v" in M)
- assertTrue("v" in MM)
- assertTrue("v" in F)
- assertTrue("v" in G)
- assertTrue("l" in R)
- assertTrue("l" in RR)
- assertTrue("l" in M)
- assertTrue("l" in MM)
- assertTrue("l" in F)
- assertTrue("l" in G)
- assertTrue("c" in R)
- assertTrue("c" in RR)
- assertTrue("c" in M)
- assertTrue("c" in MM)
- assertTrue("c" in F)
- assertTrue("c" in G)
- assertTrue("f" in R)
- assertTrue("f" in RR)
- assertTrue("f" in M)
- assertTrue("f" in MM)
- assertTrue("f" in F)
- assertTrue("f" in G)
- assertTrue("M" in R)
- assertTrue("M" in RR)
- assertTrue("RR" in R)
- assertTrue("RR" in RR)
-
- // And aliases should be identical.
- assertSame(R, RR)
- assertSame(R, R.RR)
- assertSame(M, R.M)
- assertSame(M, G)
-
- // We can only assign to var.
- assertEquals(-1, v = -1)
- assertEquals(-2, R.v = -2)
- assertEquals(-2, v)
- assertEquals(-2, R.v)
-
- assertThrows(function() { l = -1 }, ReferenceError)
- assertThrows(function() { R.l = -2 }, ReferenceError)
- assertThrows(function() { l }, ReferenceError)
- assertThrows(function() { R.l }, ReferenceError)
-
- assertThrows(function() { eval("c = -1") }, TypeError)
- assertThrows(function() { R.c = -2 }, TypeError)
-
- // Initialize first bunch of variables.
- export var v = 1
- export let l = 2
- export const c = 3
- export function f() { return 4 }
-
- assertEquals(1, v)
- assertEquals(1, R.v)
- assertEquals(2, l)
- assertEquals(2, R.l)
- assertEquals(3, c)
- assertEquals(3, R.c)
-
- assertEquals(-3, v = -3)
- assertEquals(-4, R.v = -4)
- assertEquals(-3, l = -3)
- assertEquals(-4, R.l = -4)
- assertThrows(function() { eval("c = -3") }, TypeError)
- assertThrows(function() { R.c = -4 }, TypeError)
-
- assertEquals(-4, v)
- assertEquals(-4, R.v)
- assertEquals(-4, l)
- assertEquals(-4, R.l)
- assertEquals(3, c)
- assertEquals(3, R.c)
-
- // Initialize nested module.
- export module M {
- export var v = 11
- export let l = 12
- export const c = 13
- export function f() { return 14 }
- }
-
- assertEquals(11, M.v)
- assertEquals(11, G.v)
- assertEquals(12, M.l)
- assertEquals(12, G.l)
- assertEquals(13, M.c)
- assertEquals(13, G.c)
-
- // Initialize non-exported variables.
- var vv = 21
- let ll = 22
- const cc = 23
- function ff() { return 24 }
-
- assertEquals(21, vv)
- assertEquals(22, ll)
- assertEquals(23, cc)
-
- // Initialize non-exported module.
- module MM {
- export var v = 31
- export let l = 32
- export const c = 33
- export function f() { return 34 }
- }
-
- assertEquals(31, MM.v)
- assertEquals(32, MM.l)
- assertEquals(33, MM.c)
-
- // Recursive self reference.
- export module RR = R
-}
-
-// Initialize sibling module that was forward-used.
-module F {
- assertEquals(undefined, v)
- assertEquals(undefined, F.v)
- assertThrows(function() { l }, ReferenceError)
- assertThrows(function() { F.l }, ReferenceError)
- assertThrows(function() { c }, ReferenceError)
- assertThrows(function() { F.c }, ReferenceError)
-
- export var v = 41
- export let l = 42
- export const c = 43
- export function f() { return 44 }
-
- assertEquals(41, v)
- assertEquals(41, F.v)
- assertEquals(42, l)
- assertEquals(42, F.l)
- assertEquals(43, c)
- assertEquals(43, F.c)
-}
-
-// Define recursive module alias.
-module G = R.M
-
-
-
-// Second test with side effects and more module nesting.
-
-let log = "";
-
-export let x = (log += "1");
-
-export module B = A.B
-
-export module A {
- export let x = (log += "2");
- let y = (log += "3");
- export function f() { log += "5" };
- export module B {
- module BB = B;
- export BB, x;
- let x = (log += "4");
- f();
- let y = (log += "6");
- }
- export let z = (log += "7");
- export module C {
- export let z = (log += "8");
- export module D = B
- export module C = A.C
- }
- module D {}
-}
-
-export module M1 {
- export module A2 = M2;
- export let x = (log += "9");
-}
-export module M2 {
- export module A1 = M1;
- export let x = (log += "0");
-}
-
-assertEquals("object", typeof A);
-assertTrue('x' in A);
-assertFalse('y' in A);
-assertTrue('f' in A);
-assertTrue('B' in A);
-assertTrue('z' in A);
-assertTrue('C' in A);
-assertFalse('D' in A);
-
-assertEquals("object", typeof B);
-assertTrue('BB' in B);
-assertTrue('x' in B);
-assertFalse('y' in B);
-
-assertEquals("object", typeof A.B);
-assertTrue('BB' in A.B);
-assertTrue('x' in A.B);
-assertFalse('y' in A.B);
-
-assertEquals("object", typeof A.B.BB);
-assertTrue('BB' in A.B.BB);
-assertTrue('x' in A.B.BB);
-assertFalse('y' in A.B.BB);
-
-assertEquals("object", typeof A.C);
-assertTrue('z' in A.C);
-assertTrue('D' in A.C);
-assertTrue('C' in A.C);
-
-assertEquals("object", typeof M1);
-assertEquals("object", typeof M2);
-assertTrue('A2' in M1);
-assertTrue('A1' in M2);
-assertEquals("object", typeof M1.A2);
-assertEquals("object", typeof M2.A1);
-assertTrue('A1' in M1.A2);
-assertTrue('A2' in M2.A1);
-assertEquals("object", typeof M1.A2.A1);
-assertEquals("object", typeof M2.A1.A2);
-
-assertSame(B, A.B);
-assertSame(B, B.BB);
-assertSame(B, A.C.D);
-assertSame(A.C, A.C.C);
-assertFalse(A.D === A.C.D);
-
-assertSame(M1, M2.A1);
-assertSame(M2, M1.A2);
-assertSame(M1, M1.A2.A1);
-assertSame(M2, M2.A1.A2);
-
-assertEquals("1234567890", log);
diff --git a/test/mjsunit/harmony/module-parsing-eval.js b/test/mjsunit/harmony/module-parsing-eval.js
index fa9e5ec..6c080db 100644
--- a/test/mjsunit/harmony/module-parsing-eval.js
+++ b/test/mjsunit/harmony/module-parsing-eval.js
@@ -25,8 +25,6 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --harmony-modules
-
// Check that import/export declarations are rejected in eval or local scope.
assertThrows("export let x;", SyntaxError);
assertThrows("import x from 'http://url';", SyntaxError);
diff --git a/test/mjsunit/harmony/module-recompile.js b/test/mjsunit/harmony/module-recompile.js
deleted file mode 100644
index 23f5bfc..0000000
--- a/test/mjsunit/harmony/module-recompile.js
+++ /dev/null
@@ -1,87 +0,0 @@
-// Copyright 2012 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// Flags: --harmony-modules
-
-// Test that potential recompilation of the global scope does not screw up.
-
-"use strict";
-
-var N = 1e5; // Number of loop iterations that trigger optimization.
-
-module A {
- export var x = 1
- export function f() { return x }
-}
-var f = A.f
-
-assertEquals(1, A.x)
-assertEquals(1, A.f())
-assertEquals(1, f())
-
-A.x = 2
-
-assertEquals(2, A.x)
-assertEquals(2, A.f())
-assertEquals(2, f())
-
-for (var i = 0; i < N; i++) {
- if (i > N) print("impossible");
-}
-
-assertEquals(2, A.x)
-assertEquals(2, A.f())
-assertEquals(2, f())
-
-
-// Same test with loop inside a module.
-
-module B {
- module A {
- export var x = 1
- export function f() { return x }
- }
- var f = A.f
-
- assertEquals(1, A.x)
- assertEquals(1, A.f())
- assertEquals(1, f())
-
- A.x = 2
-
- assertEquals(2, A.x)
- assertEquals(2, A.f())
- assertEquals(2, f())
-
- for (var i = 0; i < N; i++) {
- if (i > N) print("impossible");
- }
-
- assertEquals(2, A.x)
- assertEquals(2, A.f())
- assertEquals(2, f())
-}
diff --git a/test/mjsunit/harmony/module-resolution.js b/test/mjsunit/harmony/module-resolution.js
deleted file mode 100644
index 7f1e431..0000000
--- a/test/mjsunit/harmony/module-resolution.js
+++ /dev/null
@@ -1,152 +0,0 @@
-// Copyright 2012 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// Flags: --harmony-modules
-
-// Test basic module interface inference.
-
-"use strict";
-
-print("begin.")
-
-
-export let x = print("0")
-
-export module B = A.B
-
-export module A {
- export let x = print("1")
- export let f = function() { return B.x }
- export module B {
- module BB = B
- export BB, x
- let x = print("2")
- var y = print("3")
- let Ax = A.x
- try { A.y } catch (e) {} // throws
- let Az = A.z // undefined
- let Az2 = z // undefined
- A.g() // hoisted
- g() // hoisted
- let ABx = A.B.x
- let ABy = A.B.y
- let Bx = B.x
- let By = B.y
- let BBx = BB.x
- let BBy = BB.y
- let Af = A.f
- function f(x,y) { return x }
- }
- export let y = print("4")
- export var z = print("4.1")
- export function g() {}
- let Ax = A.x
- let Bx = B.x
- let ABx = A.B.x
- module C {
- export let z = print("5")
- export module D = B
- // TODO(rossberg): turn these into proper negative test cases once we have
- // suitable error messages.
- // import C.z // multiple declarations
- import x from B
- }
- module D {
- // TODO(rossberg): Handle import *.
- // import A.* // invalid forward import
- }
- module M {}
- // TODO(rossberg): Handle import *.
- // import M.* // invalid forward import
- let Cz = C.z
- let CDx = C.D.x
-}
-
-export module Imports {
- module A1 {
- export module A2 {}
- }
- module B {
- // TODO(rossberg): Handle import *.
- // import A1.*
- // import A2.* // unbound variable A2
- }
-}
-
-export module E {
- export let xx = x
- export y, B
- let Bx = B.x
- // TODO(rossberg): Handle import *.
- // import A.*
- module B = A.B
- let y = A.y
-}
-
-export module M1 {
- export module A2 = M2
-}
-export module M2 {
- export module A1 = M1
-}
-
-// TODO(rossberg): turn these into proper negative test cases once we have
-// suitable error messages.
-// module W1 = W2.W
-// module W2 = { export module W = W3 }
-// module W3 = W1 // cyclic module definition
-
-// module W1 = W2.W3
-// module W2 = {
-// export module W3 = W4
-// export module W4 = W1
-// } // cyclic module definition
-
-// TODO(rossberg): Handle import *.
-//module M3B = M3.B
-//export module M3 {
-// export module B { export let x = "" }
-// module C1 = { import M3.* }
-// module C2 = { import M3.B.* }
-// module C3 = { import M3B.* }
-// module C4 = { export x import B.* }
-//// TODO(rossberg): turn these into proper negative test cases once we have
-//// suitable error messages.
-//// export module C5 = { import C5.* } // invalid forward import
-//// export module C6 = { import M3.C6.* } // invalid forward import
-//}
-
-export module External at "external.js"
-export module External1 = External
-//export module ExternalA = External.A
-export module InnerExternal {
- export module E at "external.js"
-}
-export module External2 = InnerExternal.E
-//export let xxx = InnerExternal.E.A.x
-
-print("end.")
diff --git a/test/mjsunit/harmony/object-entries.js b/test/mjsunit/harmony/object-entries.js
index 58af4d6..101988a 100644
--- a/test/mjsunit/harmony/object-entries.js
+++ b/test/mjsunit/harmony/object-entries.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-object-values-entries --harmony-proxies --harmony-reflect
+// Flags: --harmony-object-values-entries
// Flags: --allow-natives-syntax
function TestMeta() {
@@ -247,3 +247,69 @@
assertEquals([ [ "a", 1 ], [ "b", 2 ] ], Object.entries(aMakesBEnumerable));
}
TestMutateDuringEnumeration();
+
+
+(function TestElementKinds() {
+ var O1 = { name: "1" }, O2 = { name: "2" }, O3 = { name: "3" };
+ var PI = 3.141592653589793;
+ var E = 2.718281828459045;
+ function fastSloppyArguments(a, b, c) {
+ delete arguments[0];
+ arguments[0] = a;
+ return arguments;
+ }
+
+ function slowSloppyArguments(a, b, c) {
+ delete arguments[0];
+ arguments[0] = a;
+ Object.defineProperties(arguments, {
+ 0: {
+ enumerable: true,
+ value: a
+ },
+ 9999: {
+ enumerable: false,
+ value: "Y"
+ }
+ });
+ arguments[10000] = "X";
+ return arguments;
+ }
+
+ var element_kinds = {
+ FAST_SMI_ELEMENTS: [ [1, 2, 3], [ ["0", 1], ["1", 2], ["2", 3] ] ],
+ FAST_HOLEY_SMI_ELEMENTS: [ [, , 3], [ ["2", 3] ] ],
+ FAST_ELEMENTS: [ [O1, O2, O3], [ ["0", O1], ["1", O2], ["2", O3] ] ],
+ FAST_HOLEY_ELEMENTS: [ [, , O3], [ ["2", O3] ] ],
+ FAST_DOUBLE_ELEMENTS: [ [E, NaN, PI], [ ["0", E], ["1", NaN], ["2", PI] ] ],
+ FAST_HOLEY_DOUBLE_ELEMENTS: [ [, , NaN], [ ["2", NaN] ] ],
+
+ DICTIONARY_ELEMENTS: [ Object.defineProperties({ 10000: "world" }, {
+ 100: { enumerable: true, value: "hello" },
+ 99: { enumerable: false, value: "nope" }
+ }), [ ["100", "hello"], ["10000", "world" ] ] ],
+ FAST_SLOPPY_ARGUMENTS_ELEMENTS: [
+ fastSloppyArguments("a", "b", "c"),
+ [ ["0", "a"], ["1", "b"], ["2", "c"] ] ],
+ SLOW_SLOPPY_ARGUMENTS_ELEMENTS: [
+ slowSloppyArguments("a", "b", "c"),
+ [ ["0", "a"], ["1", "b"], ["2", "c"], ["10000", "X"] ] ],
+
+ FAST_STRING_WRAPPER_ELEMENTS: [ new String("str"),
+ [ ["0", "s"], ["1", "t"], ["2", "r"]] ],
+ SLOW_STRING_WRAPPER_ELEMENTS: [
+ Object.defineProperties(new String("str"), {
+ 10000: { enumerable: false, value: "X" },
+ 9999: { enumerable: true, value: "Y" }
+ }), [["0", "s"], ["1", "t"], ["2", "r"], ["9999", "Y"]] ],
+ };
+
+ for (let [kind, [object, expected]] of Object.entries(element_kinds)) {
+ let result1 = Object.entries(object);
+ assertEquals(expected, result1, `fast Object.entries() with ${kind}`);
+
+ let proxy = new Proxy(object, {});
+ let result2 = Object.entries(proxy);
+ assertEquals(result1, result2, `slow Object.entries() with ${kind}`);
+ }
+})();
diff --git a/test/mjsunit/harmony/object-get-own-property-descriptors.js b/test/mjsunit/harmony/object-get-own-property-descriptors.js
index b23e7d6..7f631d8 100644
--- a/test/mjsunit/harmony/object-get-own-property-descriptors.js
+++ b/test/mjsunit/harmony/object-get-own-property-descriptors.js
@@ -3,7 +3,7 @@
// found in the LICENSE file.
// Flags: --harmony-object-own-property-descriptors
-// Flags: --harmony-proxies --harmony-reflect --allow-natives-syntax
+// Flags: --allow-natives-syntax
function DataDescriptor(value) {
return { "enumerable": true, "configurable": true, "writable": true, value };
diff --git a/test/mjsunit/harmony/object-values.js b/test/mjsunit/harmony/object-values.js
index f56fe8a..141070d 100644
--- a/test/mjsunit/harmony/object-values.js
+++ b/test/mjsunit/harmony/object-values.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-object-values-entries --harmony-proxies --harmony-reflect
+// Flags: --harmony-object-values-entries
// Flags: --allow-natives-syntax
function TestMeta() {
@@ -227,3 +227,66 @@
assertEquals([1, 2], Object.values(aMakesBEnumerable));
}
TestMutateDuringEnumeration();
+
+
+(function TestElementKinds() {
+ var O1 = { name: "1" }, O2 = { name: "2" }, O3 = { name: "3" };
+ var PI = 3.141592653589793;
+ var E = 2.718281828459045;
+ function fastSloppyArguments(a, b, c) {
+ delete arguments[0];
+ arguments[0] = a;
+ return arguments;
+ }
+
+ function slowSloppyArguments(a, b, c) {
+ delete arguments[0];
+ arguments[0] = a;
+ Object.defineProperties(arguments, {
+ 0: {
+ enumerable: true,
+ value: a
+ },
+ 9999: {
+ enumerable: false,
+ value: "Y"
+ }
+ });
+ arguments[10000] = "X";
+ return arguments;
+ }
+
+ var element_kinds = {
+ FAST_SMI_ELEMENTS: [ [1, 2, 3], [1, 2, 3] ],
+ FAST_HOLEY_SMI_ELEMENTS: [ [, , 3], [ 3 ] ],
+ FAST_ELEMENTS: [ [O1, O2, O3], [O1, O2, O3] ],
+ FAST_HOLEY_ELEMENTS: [ [, , O3], [O3] ],
+ FAST_DOUBLE_ELEMENTS: [ [E, NaN, PI], [E, NaN, PI] ],
+ FAST_HOLEY_DOUBLE_ELEMENTS: [ [, , NaN], [NaN] ],
+
+ DICTIONARY_ELEMENTS: [ Object.defineProperties({ 10000: "world" }, {
+ 100: { enumerable: true, value: "hello" },
+ 99: { enumerable: false, value: "nope" }
+ }), [ "hello", "world" ] ],
+ FAST_SLOPPY_ARGUMENTS_ELEMENTS: [
+ fastSloppyArguments("a", "b", "c"), ["a", "b", "c"] ],
+ SLOW_SLOPPY_ARGUMENTS_ELEMENTS: [
+ slowSloppyArguments("a", "b", "c"), [ "a", "b", "c", "X"]],
+
+ FAST_STRING_WRAPPER_ELEMENTS: [ new String("str"), ["s", "t", "r"] ],
+ SLOW_STRING_WRAPPER_ELEMENTS: [
+ Object.defineProperties(new String("str"), {
+ 10000: { enumerable: false, value: "X" },
+ 9999: { enumerable: true, value: "Y" }
+ }), ["s", "t", "r", "Y"] ],
+ };
+
+ for (let [kind, [object, expected]] of Object.entries(element_kinds)) {
+ let result1 = Object.values(object);
+ assertEquals(expected, result1, `fast Object.values() with ${kind}`);
+
+ let proxy = new Proxy(object, {});
+ let result2 = Object.values(proxy);
+ assertEquals(result1, result2, `slow Object.values() with ${kind}`);
+ }
+})();
diff --git a/test/mjsunit/harmony/private-symbols.js b/test/mjsunit/harmony/private-symbols.js
index 18a2e4c..4006359 100644
--- a/test/mjsunit/harmony/private-symbols.js
+++ b/test/mjsunit/harmony/private-symbols.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies --harmony-reflect --allow-natives-syntax
+// Flags: --allow-natives-syntax
var symbol = %CreatePrivateSymbol("private");
diff --git a/test/mjsunit/harmony/proxies-example-membrane.js b/test/mjsunit/harmony/proxies-example-membrane.js
deleted file mode 100644
index 72ab092..0000000
--- a/test/mjsunit/harmony/proxies-example-membrane.js
+++ /dev/null
@@ -1,512 +0,0 @@
-// Copyright 2011 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// Flags: --harmony --harmony-proxies
-
-
-// A simple no-op handler. Adapted from:
-// http://wiki.ecmascript.org/doku.php?id=harmony:proxies#examplea_no-op_forwarding_proxy
-
-function createHandler(obj) {
- return {
- getOwnPropertyDescriptor: function(name) {
- var desc = Object.getOwnPropertyDescriptor(obj, name);
- if (desc !== undefined) desc.configurable = true;
- return desc;
- },
- getPropertyDescriptor: function(name) {
- var desc = Object.getOwnPropertyDescriptor(obj, name);
- //var desc = Object.getPropertyDescriptor(obj, name); // not in ES5
- if (desc !== undefined) desc.configurable = true;
- return desc;
- },
- getOwnPropertyNames: function() {
- return Object.getOwnPropertyNames(obj);
- },
- getPropertyNames: function() {
- return Object.getOwnPropertyNames(obj);
- //return Object.getPropertyNames(obj); // not in ES5
- },
- defineProperty: function(name, desc) {
- Object.defineProperty(obj, name, desc);
- },
- delete: function(name) {
- return delete obj[name];
- },
- fix: function() {
- if (Object.isFrozen(obj)) {
- var result = {};
- Object.getOwnPropertyNames(obj).forEach(function(name) {
- result[name] = Object.getOwnPropertyDescriptor(obj, name);
- });
- return result;
- }
- // As long as obj is not frozen, the proxy won't allow itself to be fixed
- return undefined; // will cause a TypeError to be thrown
- },
- has: function(name) { return name in obj; },
- hasOwn: function(name) { return ({}).hasOwnProperty.call(obj, name); },
- get: function(receiver, name) { return obj[name]; },
- set: function(receiver, name, val) {
- obj[name] = val; // bad behavior when set fails in sloppy mode
- return true;
- },
- enumerate: function() {
- var result = [];
- for (var name in obj) { result.push(name); };
- return result;
- },
- keys: function() { return Object.keys(obj); }
- };
-}
-
-
-
-// Auxiliary definitions enabling tracking of object identity in output.
-
-var objectMap = new WeakMap;
-var objectCounter = 0;
-
-function registerObject(x, s) {
- if (x === Object(x) && !objectMap.has(x))
- objectMap.set(x, ++objectCounter + (s == undefined ? "" : ":" + s));
-}
-
-registerObject(this, "global");
-registerObject(Object.prototype, "Object.prototype");
-
-function str(x) {
- if (x === Object(x)) return "[" + typeof x + " " + objectMap.get(x) + "]";
- if (typeof x == "string") return "\"" + x + "\"";
- return "" + x;
-}
-
-
-
-// A simple membrane. Adapted from:
-// http://wiki.ecmascript.org/doku.php?id=harmony:proxies#a_simple_membrane
-
-function createSimpleMembrane(target) {
- var enabled = true;
-
- function wrap(obj) {
- registerObject(obj);
- print("wrap enter", str(obj));
- try {
- var x = wrap2(obj);
- registerObject(x, "wrapped");
- print("wrap exit", str(obj), "as", str(x));
- return x;
- } catch(e) {
- print("wrap exception", str(e));
- throw e;
- }
- }
-
- function wrap2(obj) {
- if (obj !== Object(obj)) {
- return obj;
- }
-
- function wrapCall(fun, that, args) {
- registerObject(that);
- print("wrapCall enter", fun, str(that));
- try {
- var x = wrapCall2(fun, that, args);
- print("wrapCall exit", fun, str(that), "returning", str(x));
- return x;
- } catch(e) {
- print("wrapCall exception", fun, str(that), str(e));
- throw e;
- }
- }
-
- function wrapCall2(fun, that, args) {
- if (!enabled) { throw new Error("disabled"); }
- try {
- return wrap(fun.apply(that, Array.prototype.map.call(args, wrap)));
- } catch (e) {
- throw wrap(e);
- }
- }
-
- var baseHandler = createHandler(obj);
- var handler = new Proxy({}, Object.freeze({
- get: function(receiver, name) {
- return function() {
- var arg = (name === "get" || name == "set") ? arguments[1] : "";
- print("handler enter", name, arg);
- var x = wrapCall(baseHandler[name], baseHandler, arguments);
- print("handler exit", name, arg, "returning", str(x));
- return x;
- }
- }
- }));
- registerObject(baseHandler, "basehandler");
- registerObject(handler, "handler");
-
- if (typeof obj === "function") {
- function callTrap() {
- print("call trap enter", str(obj), str(this));
- var x = wrapCall(obj, wrap(this), arguments);
- print("call trap exit", str(obj), str(this), "returning", str(x));
- return x;
- }
- function constructTrap() {
- if (!enabled) { throw new Error("disabled"); }
- try {
- function forward(args) { return obj.apply(this, args) }
- return wrap(new forward(Array.prototype.map.call(arguments, wrap)));
- } catch (e) {
- throw wrap(e);
- }
- }
- return Proxy.createFunction(handler, callTrap, constructTrap);
- } else {
- var prototype = wrap(Object.getPrototypeOf(obj));
- return new Proxy(prototype, handler);
- }
- }
-
- var gate = Object.freeze({
- enable: function() { enabled = true; },
- disable: function() { enabled = false; }
- });
-
- return Object.freeze({
- wrapper: wrap(target),
- gate: gate
- });
-}
-
-
-var o = {
- a: 6,
- b: {bb: 8},
- f: function(x) { return x },
- g: function(x) { return x.a },
- h: function(x) { this.q = x }
-};
-o[2] = {c: 7};
-var m = createSimpleMembrane(o);
-var w = m.wrapper;
-print("o =", str(o))
-print("w =", str(w));
-
-var f = w.f;
-var x = f(66);
-var x = f({a: 1});
-var x = w.f({a: 1});
-var a = x.a;
-assertEquals(6, w.a);
-assertEquals(8, w.b.bb);
-assertEquals(7, w[2]["c"]);
-assertEquals(undefined, w.c);
-assertEquals(1, w.f(1));
-assertEquals(1, w.f({a: 1}).a);
-assertEquals(2, w.g({a: 2}));
-assertEquals(3, (w.r = {a: 3}).a);
-assertEquals(3, w.r.a);
-assertEquals(3, o.r.a);
-w.h(3);
-assertEquals(3, w.q);
-assertEquals(3, o.q);
-assertEquals(4, (new w.h(4)).q);
-
-var wb = w.b;
-var wr = w.r;
-var wf = w.f;
-var wf3 = w.f(3);
-var wfx = w.f({a: 6});
-var wgx = w.g({a: {aa: 7}});
-var wh4 = new w.h(4);
-m.gate.disable();
-assertEquals(3, wf3);
-assertThrows(function() { w.a }, Error);
-assertThrows(function() { w.r }, Error);
-assertThrows(function() { w.r = {a: 4} }, Error);
-assertThrows(function() { o.r.a }, Error);
-assertEquals("object", typeof o.r);
-assertEquals(5, (o.r = {a: 5}).a);
-assertEquals(5, o.r.a);
-assertThrows(function() { w[1] }, Error);
-assertThrows(function() { w.c }, Error);
-assertThrows(function() { wb.bb }, Error);
-assertThrows(function() { wr.a }, Error);
-assertThrows(function() { wf(4) }, Error);
-assertThrows(function() { wfx.a }, Error);
-assertThrows(function() { wgx.aa }, Error);
-assertThrows(function() { wh4.q }, Error);
-
-m.gate.enable();
-assertEquals(6, w.a);
-assertEquals(5, w.r.a);
-assertEquals(5, o.r.a);
-assertEquals(7, w.r = 7);
-assertEquals(7, w.r);
-assertEquals(7, o.r);
-assertEquals(8, w.b.bb);
-assertEquals(7, w[2]["c"]);
-assertEquals(undefined, w.c);
-assertEquals(8, wb.bb);
-assertEquals(3, wr.a);
-assertEquals(4, wf(4));
-assertEquals(3, wf3);
-assertEquals(6, wfx.a);
-assertEquals(7, wgx.aa);
-assertEquals(4, wh4.q);
-
-
-// An identity-preserving membrane. Adapted from:
-// http://wiki.ecmascript.org/doku.php?id=harmony:proxies#an_identity-preserving_membrane
-
-function createMembrane(wetTarget) {
- var wet2dry = new WeakMap();
- var dry2wet = new WeakMap();
-
- function asDry(obj) {
- registerObject(obj)
- print("asDry enter", str(obj))
- try {
- var x = asDry2(obj);
- registerObject(x, "dry");
- print("asDry exit", str(obj), "as", str(x));
- return x;
- } catch(e) {
- print("asDry exception", str(e));
- throw e;
- }
- }
- function asDry2(wet) {
- if (wet !== Object(wet)) {
- // primitives provide only irrevocable knowledge, so don't
- // bother wrapping it.
- return wet;
- }
- var dryResult = wet2dry.get(wet);
- if (dryResult) { return dryResult; }
-
- var wetHandler = createHandler(wet);
- var dryRevokeHandler = new Proxy({}, Object.freeze({
- get: function(receiver, name) {
- return function() {
- var arg = (name === "get" || name == "set") ? arguments[1] : "";
- print("dry handler enter", name, arg);
- var optWetHandler = dry2wet.get(dryRevokeHandler);
- try {
- var x = asDry(optWetHandler[name].apply(
- optWetHandler, Array.prototype.map.call(arguments, asWet)));
- print("dry handler exit", name, arg, "returning", str(x));
- return x;
- } catch (eWet) {
- var x = asDry(eWet);
- print("dry handler exception", name, arg, "throwing", str(x));
- throw x;
- }
- };
- }
- }));
- dry2wet.set(dryRevokeHandler, wetHandler);
-
- if (typeof wet === "function") {
- function callTrap() {
- print("dry call trap enter", str(this));
- var x = asDry(wet.apply(
- asWet(this), Array.prototype.map.call(arguments, asWet)));
- print("dry call trap exit", str(this), "returning", str(x));
- return x;
- }
- function constructTrap() {
- function forward(args) { return wet.apply(this, args) }
- return asDry(new forward(Array.prototype.map.call(arguments, asWet)));
- }
- dryResult =
- Proxy.createFunction(dryRevokeHandler, callTrap, constructTrap);
- } else {
- dryResult =
- new Proxy(asDry(Object.getPrototypeOf(wet)), dryRevokeHandler);
- }
- wet2dry.set(wet, dryResult);
- dry2wet.set(dryResult, wet);
- return dryResult;
- }
-
- function asWet(obj) {
- registerObject(obj)
- print("asWet enter", str(obj))
- try {
- var x = asWet2(obj)
- registerObject(x, "wet")
- print("asWet exit", str(obj), "as", str(x))
- return x
- } catch(e) {
- print("asWet exception", str(e))
- throw e
- }
- }
- function asWet2(dry) {
- if (dry !== Object(dry)) {
- // primitives provide only irrevocable knowledge, so don't
- // bother wrapping it.
- return dry;
- }
- var wetResult = dry2wet.get(dry);
- if (wetResult) { return wetResult; }
-
- var dryHandler = createHandler(dry);
- var wetRevokeHandler = new Proxy({}, Object.freeze({
- get: function(receiver, name) {
- return function() {
- var arg = (name === "get" || name == "set") ? arguments[1] : "";
- print("wet handler enter", name, arg);
- var optDryHandler = wet2dry.get(wetRevokeHandler);
- try {
- var x = asWet(optDryHandler[name].apply(
- optDryHandler, Array.prototype.map.call(arguments, asDry)));
- print("wet handler exit", name, arg, "returning", str(x));
- return x;
- } catch (eDry) {
- var x = asWet(eDry);
- print("wet handler exception", name, arg, "throwing", str(x));
- throw x;
- }
- };
- }
- }));
- wet2dry.set(wetRevokeHandler, dryHandler);
-
- if (typeof dry === "function") {
- function callTrap() {
- print("wet call trap enter", str(this));
- var x = asWet(dry.apply(
- asDry(this), Array.prototype.map.call(arguments, asDry)));
- print("wet call trap exit", str(this), "returning", str(x));
- return x;
- }
- function constructTrap() {
- function forward(args) { return dry.apply(this, args) }
- return asWet(new forward(Array.prototype.map.call(arguments, asDry)));
- }
- wetResult =
- Proxy.createFunction(wetRevokeHandler, callTrap, constructTrap);
- } else {
- wetResult =
- new Proxy(asWet(Object.getPrototypeOf(dry)), wetRevokeHandler);
- }
- dry2wet.set(dry, wetResult);
- wet2dry.set(wetResult, dry);
- return wetResult;
- }
-
- var gate = Object.freeze({
- revoke: function() {
- dry2wet = wet2dry = Object.freeze({
- get: function(key) { throw new Error("revoked"); },
- set: function(key, val) { throw new Error("revoked"); }
- });
- }
- });
-
- return Object.freeze({ wrapper: asDry(wetTarget), gate: gate });
-}
-
-
-var receiver
-var argument
-var o = {
- a: 6,
- b: {bb: 8},
- f: function(x) { receiver = this; argument = x; return x },
- g: function(x) { receiver = this; argument = x; return x.a },
- h: function(x) { receiver = this; argument = x; this.q = x },
- s: function(x) { receiver = this; argument = x; this.x = {y: x}; return this }
-}
-o[2] = {c: 7}
-var m = createMembrane(o)
-var w = m.wrapper
-print("o =", str(o))
-print("w =", str(w))
-
-var f = w.f
-var x = f(66)
-var x = f({a: 1})
-var x = w.f({a: 1})
-var a = x.a
-assertEquals(6, w.a)
-assertEquals(8, w.b.bb)
-assertEquals(7, w[2]["c"])
-assertEquals(undefined, w.c)
-assertEquals(1, w.f(1))
-assertSame(o, receiver)
-assertEquals(1, w.f({a: 1}).a)
-assertSame(o, receiver)
-assertEquals(2, w.g({a: 2}))
-assertSame(o, receiver)
-assertSame(w, w.f(w))
-assertSame(o, receiver)
-assertSame(o, argument)
-assertSame(o, w.f(o))
-assertSame(o, receiver)
-// Note that argument !== o, since o isn't dry, so gets wrapped wet again.
-assertEquals(3, (w.r = {a: 3}).a)
-assertEquals(3, w.r.a)
-assertEquals(3, o.r.a)
-w.h(3)
-assertEquals(3, w.q)
-assertEquals(3, o.q)
-assertEquals(4, (new w.h(4)).q)
-assertEquals(5, w.s(5).x.y)
-assertSame(o, receiver)
-
-var wb = w.b
-var wr = w.r
-var wf = w.f
-var wf3 = w.f(3)
-var wfx = w.f({a: 6})
-var wgx = w.g({a: {aa: 7}})
-var wh4 = new w.h(4)
-var ws5 = w.s(5)
-var ws5x = ws5.x
-m.gate.revoke()
-assertEquals(3, wf3)
-assertThrows(function() { w.a }, Error)
-assertThrows(function() { w.r }, Error)
-assertThrows(function() { w.r = {a: 4} }, Error)
-assertThrows(function() { o.r.a }, Error)
-assertEquals("object", typeof o.r)
-assertEquals(5, (o.r = {a: 5}).a)
-assertEquals(5, o.r.a)
-assertThrows(function() { w[1] }, Error)
-assertThrows(function() { w.c }, Error)
-assertThrows(function() { wb.bb }, Error)
-assertEquals(3, wr.a)
-assertThrows(function() { wf(4) }, Error)
-assertEquals(6, wfx.a)
-assertEquals(7, wgx.aa)
-assertThrows(function() { wh4.q }, Error)
-assertThrows(function() { ws5.x }, Error)
-assertThrows(function() { ws5x.y }, Error)
diff --git a/test/mjsunit/harmony/proxies-function.js b/test/mjsunit/harmony/proxies-function.js
deleted file mode 100644
index b2498b8..0000000
--- a/test/mjsunit/harmony/proxies-function.js
+++ /dev/null
@@ -1,768 +0,0 @@
-// Copyright 2011 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// Flags: --harmony-proxies --allow-natives-syntax
-
-
-// TODO(neis): These tests are temporarily commented out because of ongoing
-// changes to the implementation of proxies.
-
-
-//// Ensures that checking the "length" property of a function proxy doesn't
-//// crash due to lack of a [[Get]] method.
-//var handler = {
-// get : function(r, n) { return n == "length" ? 2 : undefined }
-//}
-//
-//
-//// Calling (call, Function.prototype.call, Function.prototype.apply,
-//// Function.prototype.bind).
-//
-//var global_object = this
-//var receiver
-//
-//function TestCall(isStrict, callTrap) {
-// assertEquals(42, callTrap(5, 37))
-// assertSame(isStrict ? undefined : global_object, receiver)
-//
-// var handler = {
-// get: function(r, k) {
-// return k == "length" ? 2 : Function.prototype[k]
-// }
-// }
-// var f = Proxy.createFunction(handler, callTrap)
-// var o = {f: f}
-// global_object.f = f
-//
-// receiver = 333
-// assertEquals(42, f(11, 31))
-// assertSame(isStrict ? undefined : global_object, receiver)
-// receiver = 333
-// assertEquals(42, o.f(10, 32))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(42, o["f"](9, 33))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(42, (1, o).f(8, 34))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(42, (1, o)["f"](7, 35))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(42, f.call(o, 32, 10))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(42, f.call(undefined, 33, 9))
-// assertSame(isStrict ? undefined : global_object, receiver)
-// receiver = 333
-// assertEquals(42, f.call(null, 33, 9))
-// assertSame(isStrict ? null : global_object, receiver)
-// receiver = 333
-// assertEquals(44, f.call(2, 21, 23))
-// assertSame(2, receiver.valueOf())
-// receiver = 333
-// assertEquals(42, Function.prototype.call.call(f, o, 20, 22))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(43, Function.prototype.call.call(f, null, 20, 23))
-// assertSame(isStrict ? null : global_object, receiver)
-// assertEquals(44, Function.prototype.call.call(f, 2, 21, 23))
-// assertEquals(2, receiver.valueOf())
-// receiver = 333
-// assertEquals(32, f.apply(o, [16, 16]))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(32, Function.prototype.apply.call(f, o, [17, 15]))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(42, %Call(f, o, 11, 31));
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(42, %Call(f, null, 11, 31));
-// assertSame(isStrict ? null : global_object, receiver)
-// receiver = 333
-// assertEquals(42, %Apply(f, o, [11, 31], 0, 2))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(42, %Apply(f, null, [11, 31], 0, 2))
-// assertSame(isStrict ? null : global_object, receiver)
-// receiver = 333
-// assertEquals(42, %_Call(f, o, 11, 31))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(42, %_Call(f, null, 11, 31))
-// assertSame(isStrict ? null : global_object, receiver)
-//
-// var ff = Function.prototype.bind.call(f, o, 12)
-// assertTrue(ff.length <= 1) // TODO(rossberg): Not spec'ed yet, be lax.
-// receiver = 333
-// assertEquals(42, ff(30))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(33, Function.prototype.call.call(ff, {}, 21))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(32, Function.prototype.apply.call(ff, {}, [20]))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(23, %Call(ff, {}, 11));
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(23, %Call(ff, {}, 11, 3));
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(24, %Apply(ff, {}, [12, 13], 0, 1))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(24, %Apply(ff, {}, [12, 13], 0, 2))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(34, %_Call(ff, {}, 22))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(34, %_Call(ff, {}, 22, 3))
-// assertSame(o, receiver)
-//
-// var fff = Function.prototype.bind.call(ff, o, 30)
-// assertEquals(0, fff.length)
-// receiver = 333
-// assertEquals(42, fff())
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(42, Function.prototype.call.call(fff, {}))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(42, Function.prototype.apply.call(fff, {}))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(42, %Call(fff, {}));
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(42, %Call(fff, {}, 11, 3))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(42, %Apply(fff, {}, [], 0, 0))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(42, %Apply(fff, {}, [12, 13], 0, 0))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(42, %Apply(fff, {}, [12, 13], 0, 2))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(42, %_Call(fff, {}))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(42, %_Call(fff, {}, 3, 4, 5))
-// assertSame(o, receiver)
-//
-// var f = CreateFrozen({}, callTrap)
-// receiver = 333
-// assertEquals(42, f(11, 31))
-// assertSame(isStrict ? undefined : global_object, receiver)
-// var o = {f: f}
-// receiver = 333
-// assertEquals(42, o.f(10, 32))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(42, o["f"](9, 33))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(42, (1, o).f(8, 34))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(42, (1, o)["f"](7, 35))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(42, Function.prototype.call.call(f, o, 20, 22))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(32, Function.prototype.apply.call(f, o, [17, 15]))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(23, %Call(f, o, 11, 12))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(27, %Apply(f, o, [12, 13, 14], 1, 2))
-// assertSame(o, receiver)
-// receiver = 333
-// assertEquals(42, %_Call(f, o, 18, 24))
-// assertSame(o, receiver)
-//}
-//
-//TestCall(false, function(x, y) {
-// receiver = this
-// return x + y
-//})
-//
-//TestCall(true, function(x, y) {
-// "use strict"
-// receiver = this
-// return x + y
-//})
-//
-//TestCall(false, function() {
-// receiver = this
-// return arguments[0] + arguments[1]
-//})
-//
-//TestCall(false, Proxy.createFunction(handler, function(x, y) {
-// receiver = this
-// return x + y
-//}))
-//
-//TestCall(true, Proxy.createFunction(handler, function(x, y) {
-// "use strict"
-// receiver = this
-// return x + y
-//}))
-//
-//TestCall(false, CreateFrozen(handler, function(x, y) {
-// receiver = this
-// return x + y
-//}))
-//
-//
-//
-//// Using intrinsics as call traps.
-//
-//function TestCallIntrinsic(type, callTrap) {
-// var f = Proxy.createFunction({}, callTrap)
-// var x = f()
-// assertTrue(typeof x == type)
-//}
-//
-//TestCallIntrinsic("boolean", Boolean)
-//TestCallIntrinsic("number", Number)
-//TestCallIntrinsic("string", String)
-//TestCallIntrinsic("object", Object)
-//TestCallIntrinsic("function", Function)
-//
-//
-//
-//// Throwing from call trap.
-//
-//function TestCallThrow(callTrap) {
-// var f = Proxy.createFunction({}, callTrap)
-// assertThrows(function(){ f(11) }, "myexn")
-// assertThrows(function(){ ({x: f}).x(11) }, "myexn")
-// assertThrows(function(){ ({x: f})["x"](11) }, "myexn")
-// assertThrows(function(){ Function.prototype.call.call(f, {}, 2) }, "myexn")
-// assertThrows(function(){ Function.prototype.apply.call(f, {}, [1]) }, "myexn")
-// assertThrows(function(){ %Call(f, {}) }, "myexn")
-// assertThrows(function(){ %Call(f, {}, 1, 2) }, "myexn")
-// assertThrows(function(){ %Apply({}, f, [], 3, 0) }, "myexn")
-// assertThrows(function(){ %Apply({}, f, [3, 4], 0, 1) }, "myexn")
-// assertThrows(function(){ %_Call(f, {}) }, "myexn")
-// assertThrows(function(){ %_Call(f, {}, 1, 2) }, "myexn")
-//
-// var f = CreateFrozen({}, callTrap)
-// assertThrows(function(){ f(11) }, "myexn")
-// assertThrows(function(){ ({x: f}).x(11) }, "myexn")
-// assertThrows(function(){ ({x: f})["x"](11) }, "myexn")
-// assertThrows(function(){ Function.prototype.call.call(f, {}, 2) }, "myexn")
-// assertThrows(function(){ Function.prototype.apply.call(f, {}, [1]) }, "myexn")
-// assertThrows(function(){ %Call(f, {}) }, "myexn")
-// assertThrows(function(){ %Call(f, {}, 1, 2) }, "myexn")
-// assertThrows(function(){ %Apply({}, f, [], 3, 0) }, "myexn")
-// assertThrows(function(){ %Apply({}, f, [3, 4], 0, 1) }, "myexn")
-// assertThrows(function(){ %_Call(f, {}) }, "myexn")
-// assertThrows(function(){ %_Call(f, {}, 1, 2) }, "myexn")
-//}
-//
-//TestCallThrow(function() { throw "myexn" })
-//TestCallThrow(Proxy.createFunction({}, function() { throw "myexn" }))
-//TestCallThrow(CreateFrozen({}, function() { throw "myexn" }))
-//
-//
-//
-//// Construction (new).
-//
-//var prototype = {myprop: 0}
-//var receiver
-//
-//var handlerWithPrototype = {
-// fix: function() { return { prototype: { value: prototype } }; },
-// get: function(r, n) {
-// if (n == "length") return 2;
-// assertEquals("prototype", n);
-// return prototype;
-// }
-//}
-//
-//var handlerSansPrototype = {
-// fix: function() { return { length: { value: 2 } } },
-// get: function(r, n) {
-// if (n == "length") return 2;
-// assertEquals("prototype", n);
-// return undefined;
-// }
-//}
-//
-//function ReturnUndef(x, y) {
-// "use strict";
-// receiver = this;
-// this.sum = x + y;
-//}
-//
-//function ReturnThis(x, y) {
-// "use strict";
-// receiver = this;
-// this.sum = x + y;
-// return this;
-//}
-//
-//function ReturnNew(x, y) {
-// "use strict";
-// receiver = this;
-// return {sum: x + y};
-//}
-//
-//function ReturnNewWithProto(x, y) {
-// "use strict";
-// receiver = this;
-// var result = Object.create(prototype);
-// result.sum = x + y;
-// return result;
-//}
-//
-//function TestConstruct(proto, constructTrap) {
-// TestConstruct2(proto, constructTrap, handlerWithPrototype)
-// TestConstruct2(proto, constructTrap, handlerSansPrototype)
-//}
-//
-//function TestConstruct2(proto, constructTrap, handler) {
-// var f = Proxy.createFunction(handler, function() {}, constructTrap)
-// var o = new f(11, 31)
-// assertEquals(undefined, receiver)
-// assertEquals(42, o.sum)
-// assertSame(proto, Object.getPrototypeOf(o))
-//
-// var f = CreateFrozen(handler, function() {}, constructTrap)
-// var o = new f(11, 32)
-// assertEquals(undefined, receiver)
-// assertEquals(43, o.sum)
-// assertSame(proto, Object.getPrototypeOf(o))
-//}
-//
-//TestConstruct(Object.prototype, ReturnNew)
-//TestConstruct(prototype, ReturnNewWithProto)
-//
-//TestConstruct(Object.prototype, Proxy.createFunction(handler, ReturnNew))
-//TestConstruct(prototype, Proxy.createFunction(handler, ReturnNewWithProto))
-//
-//TestConstruct(Object.prototype, CreateFrozen(handler, ReturnNew))
-//TestConstruct(prototype, CreateFrozen(handler, ReturnNewWithProto))
-//
-//
-//
-//// Construction with derived construct trap.
-//
-//function TestConstructFromCall(proto, returnsThis, callTrap) {
-// TestConstructFromCall2(prototype, returnsThis, callTrap, handlerWithPrototype)
-// TestConstructFromCall2(proto, returnsThis, callTrap, handlerSansPrototype)
-//}
-//
-//function TestConstructFromCall2(proto, returnsThis, callTrap, handler) {
-// // TODO(rossberg): handling of prototype for derived construct trap will be
-// // fixed in a separate change. Commenting out checks below for now.
-// var f = Proxy.createFunction(handler, callTrap)
-// var o = new f(11, 31)
-// if (returnsThis) assertEquals(o, receiver)
-// assertEquals(42, o.sum)
-// // assertSame(proto, Object.getPrototypeOf(o))
-//
-// var g = CreateFrozen(handler, callTrap)
-// // assertSame(f.prototype, g.prototype)
-// var o = new g(11, 32)
-// if (returnsThis) assertEquals(o, receiver)
-// assertEquals(43, o.sum)
-// // assertSame(proto, Object.getPrototypeOf(o))
-//}
-//
-//TestConstructFromCall(Object.prototype, true, ReturnUndef)
-//TestConstructFromCall(Object.prototype, true, ReturnThis)
-//TestConstructFromCall(Object.prototype, false, ReturnNew)
-//TestConstructFromCall(prototype, false, ReturnNewWithProto)
-//
-//TestConstructFromCall(Object.prototype, true,
-// Proxy.createFunction(handler, ReturnUndef))
-//TestConstructFromCall(Object.prototype, true,
-// Proxy.createFunction(handler, ReturnThis))
-//TestConstructFromCall(Object.prototype, false,
-// Proxy.createFunction(handler, ReturnNew))
-//TestConstructFromCall(prototype, false,
-// Proxy.createFunction(handler, ReturnNewWithProto))
-//
-//TestConstructFromCall(Object.prototype, true, CreateFrozen({}, ReturnUndef))
-//TestConstructFromCall(Object.prototype, true, CreateFrozen({}, ReturnThis))
-//TestConstructFromCall(Object.prototype, false, CreateFrozen({}, ReturnNew))
-//TestConstructFromCall(prototype, false, CreateFrozen({}, ReturnNewWithProto))
-//
-//ReturnUndef.prototype = prototype
-//ReturnThis.prototype = prototype
-//ReturnNew.prototype = prototype
-//ReturnNewWithProto.prototype = prototype
-//
-//TestConstructFromCall(prototype, true, ReturnUndef)
-//TestConstructFromCall(prototype, true, ReturnThis)
-//TestConstructFromCall(Object.prototype, false, ReturnNew)
-//TestConstructFromCall(prototype, false, ReturnNewWithProto)
-//
-//TestConstructFromCall(Object.prototype, true,
-// Proxy.createFunction(handler, ReturnUndef))
-//TestConstructFromCall(Object.prototype, true,
-// Proxy.createFunction(handler, ReturnThis))
-//TestConstructFromCall(Object.prototype, false,
-// Proxy.createFunction(handler, ReturnNew))
-//TestConstructFromCall(prototype, false,
-// Proxy.createFunction(handler, ReturnNewWithProto))
-//
-//TestConstructFromCall(prototype, true,
-// Proxy.createFunction(handlerWithPrototype, ReturnUndef))
-//TestConstructFromCall(prototype, true,
-// Proxy.createFunction(handlerWithPrototype, ReturnThis))
-//TestConstructFromCall(Object.prototype, false,
-// Proxy.createFunction(handlerWithPrototype, ReturnNew))
-//TestConstructFromCall(prototype, false,
-// Proxy.createFunction(handlerWithPrototype,
-// ReturnNewWithProto))
-//
-//TestConstructFromCall(prototype, true,
-// CreateFrozen(handlerWithPrototype, ReturnUndef))
-//TestConstructFromCall(prototype, true,
-// CreateFrozen(handlerWithPrototype, ReturnThis))
-//TestConstructFromCall(Object.prototype, false,
-// CreateFrozen(handlerWithPrototype, ReturnNew))
-//TestConstructFromCall(prototype, false,
-// CreateFrozen(handlerWithPrototype, ReturnNewWithProto))
-//
-//
-//
-//// Throwing from the construct trap.
-//
-//function TestConstructThrow(trap) {
-// TestConstructThrow2(Proxy.createFunction({ fix: function() {return {};} },
-// trap))
-// TestConstructThrow2(Proxy.createFunction({ fix: function() {return {};} },
-// function() {},
-// trap))
-//}
-//
-//function TestConstructThrow2(f) {
-// assertThrows(function(){ new f(11) }, "myexn")
-// Object.freeze(f)
-// assertThrows(function(){ new f(11) }, "myexn")
-//}
-//
-//TestConstructThrow(function() { throw "myexn" })
-//TestConstructThrow(Proxy.createFunction({}, function() { throw "myexn" }))
-//TestConstructThrow(CreateFrozen({}, function() { throw "myexn" }))
-//
-//
-//
-//// Using function proxies as getters and setters.
-//
-//var value
-//var receiver
-//
-//function TestAccessorCall(getterCallTrap, setterCallTrap) {
-// var handler = { fix: function() { return {} } }
-// var pgetter = Proxy.createFunction(handler, getterCallTrap)
-// var psetter = Proxy.createFunction(handler, setterCallTrap)
-//
-// var o = {}
-// var oo = Object.create(o)
-// Object.defineProperty(o, "a", {get: pgetter, set: psetter})
-// Object.defineProperty(o, "b", {get: pgetter})
-// Object.defineProperty(o, "c", {set: psetter})
-// Object.defineProperty(o, "3", {get: pgetter, set: psetter})
-// Object.defineProperty(oo, "a", {value: 43})
-//
-// receiver = ""
-// assertEquals(42, o.a)
-// assertSame(o, receiver)
-// receiver = ""
-// assertEquals(42, o.b)
-// assertSame(o, receiver)
-// receiver = ""
-// assertEquals(undefined, o.c)
-// assertEquals("", receiver)
-// receiver = ""
-// assertEquals(42, o["a"])
-// assertSame(o, receiver)
-// receiver = ""
-// assertEquals(42, o[3])
-// assertSame(o, receiver)
-//
-// receiver = ""
-// assertEquals(43, oo.a)
-// assertEquals("", receiver)
-// receiver = ""
-// assertEquals(42, oo.b)
-// assertSame(oo, receiver)
-// receiver = ""
-// assertEquals(undefined, oo.c)
-// assertEquals("", receiver)
-// receiver = ""
-// assertEquals(43, oo["a"])
-// assertEquals("", receiver)
-// receiver = ""
-// assertEquals(42, oo[3])
-// assertSame(oo, receiver)
-//
-// receiver = ""
-// assertEquals(50, o.a = 50)
-// assertSame(o, receiver)
-// assertEquals(50, value)
-// receiver = ""
-// assertEquals(51, o.b = 51)
-// assertEquals("", receiver)
-// assertEquals(50, value) // no setter
-// assertThrows(function() { "use strict"; o.b = 51 }, TypeError)
-// receiver = ""
-// assertEquals(52, o.c = 52)
-// assertSame(o, receiver)
-// assertEquals(52, value)
-// receiver = ""
-// assertEquals(53, o["a"] = 53)
-// assertSame(o, receiver)
-// assertEquals(53, value)
-// receiver = ""
-// assertEquals(54, o[3] = 54)
-// assertSame(o, receiver)
-// assertEquals(54, value)
-//
-// value = 0
-// receiver = ""
-// assertEquals(60, oo.a = 60)
-// assertEquals("", receiver)
-// assertEquals(0, value) // oo has own 'a'
-// assertEquals(61, oo.b = 61)
-// assertSame("", receiver)
-// assertEquals(0, value) // no setter
-// assertThrows(function() { "use strict"; oo.b = 61 }, TypeError)
-// receiver = ""
-// assertEquals(62, oo.c = 62)
-// assertSame(oo, receiver)
-// assertEquals(62, value)
-// receiver = ""
-// assertEquals(63, oo["c"] = 63)
-// assertSame(oo, receiver)
-// assertEquals(63, value)
-// receiver = ""
-// assertEquals(64, oo[3] = 64)
-// assertSame(oo, receiver)
-// assertEquals(64, value)
-//}
-//
-//TestAccessorCall(
-// function() { receiver = this; return 42 },
-// function(x) { receiver = this; value = x }
-//)
-//
-//TestAccessorCall(
-// function() { "use strict"; receiver = this; return 42 },
-// function(x) { "use strict"; receiver = this; value = x }
-//)
-//
-//TestAccessorCall(
-// Proxy.createFunction({}, function() { receiver = this; return 42 }),
-// Proxy.createFunction({}, function(x) { receiver = this; value = x })
-//)
-//
-//TestAccessorCall(
-// CreateFrozen({}, function() { receiver = this; return 42 }),
-// CreateFrozen({}, function(x) { receiver = this; value = x })
-//)
-//
-//
-//
-//// Passing a proxy function to higher-order library functions.
-//
-//function TestHigherOrder(f) {
-// assertEquals(6, [6, 2].map(f)[0])
-// assertEquals(4, [5, 2].reduce(f, 4))
-// assertTrue([1, 2].some(f))
-// assertEquals("a.b.c", "a.b.c".replace(".", f))
-//}
-//
-//TestHigherOrder(function(x) { return x })
-//TestHigherOrder(function(x) { "use strict"; return x })
-//TestHigherOrder(Proxy.createFunction({}, function(x) { return x }))
-//TestHigherOrder(CreateFrozen({}, function(x) { return x }))
-//
-//
-//
-//// TODO(rossberg): Ultimately, I want to have the following test function
-//// run through, but it currently fails on so many cases (some not even
-//// involving proxies), that I leave that for later...
-///*
-//function TestCalls() {
-// var handler = {
-// get: function(r, k) {
-// return k == "length" ? 2 : Function.prototype[k]
-// }
-// }
-// var bind = Function.prototype.bind
-// var o = {}
-//
-// var traps = [
-// function(x, y) {
-// return {receiver: this, result: x + y, strict: false}
-// },
-// function(x, y) { "use strict";
-// return {receiver: this, result: x + y, strict: true}
-// },
-// function() {
-// var x = arguments[0], y = arguments[1]
-// return {receiver: this, result: x + y, strict: false}
-// },
-// Proxy.createFunction(handler, function(x, y) {
-// return {receiver: this, result: x + y, strict: false}
-// }),
-// Proxy.createFunction(handler, function() {
-// var x = arguments[0], y = arguments[1]
-// return {receiver: this, result: x + y, strict: false}
-// }),
-// Proxy.createFunction(handler, function(x, y) { "use strict"
-// return {receiver: this, result: x + y, strict: true}
-// }),
-// CreateFrozen(handler, function(x, y) {
-// return {receiver: this, result: x + y, strict: false}
-// }),
-// CreateFrozen(handler, function(x, y) { "use strict"
-// return {receiver: this, result: x + y, strict: true}
-// }),
-// ]
-// var creates = [
-// function(trap) { return trap },
-// function(trap) { return CreateFrozen({}, callTrap) },
-// function(trap) { return Proxy.createFunction(handler, callTrap) },
-// function(trap) {
-// return Proxy.createFunction(handler, CreateFrozen({}, callTrap))
-// },
-// function(trap) {
-// return Proxy.createFunction(handler, Proxy.createFunction(handler, callTrap))
-// },
-// ]
-// var binds = [
-// function(f, o, x, y) { return f },
-// function(f, o, x, y) { return bind.call(f, o) },
-// function(f, o, x, y) { return bind.call(f, o, x) },
-// function(f, o, x, y) { return bind.call(f, o, x, y) },
-// function(f, o, x, y) { return bind.call(f, o, x, y, 5) },
-// function(f, o, x, y) { return bind.call(bind.call(f, o), {}, x, y) },
-// function(f, o, x, y) { return bind.call(bind.call(f, o, x), {}, y) },
-// function(f, o, x, y) { return bind.call(bind.call(f, o, x, y), {}, 5) },
-// ]
-// var calls = [
-// function(f, x, y) { return f(x, y) },
-// function(f, x, y) { var g = f; return g(x, y) },
-// function(f, x, y) { with ({}) return f(x, y) },
-// function(f, x, y) { var g = f; with ({}) return g(x, y) },
-// function(f, x, y, o) { with (o) return f(x, y) },
-// function(f, x, y, o) { return f.call(o, x, y) },
-// function(f, x, y, o) { return f.apply(o, [x, y]) },
-// function(f, x, y, o) { return Function.prototype.call.call(f, o, x, y) },
-// function(f, x, y, o) { return Function.prototype.apply.call(f, o, [x, y]) },
-// function(f, x, y, o) { return %_Call(f, o, x, y) },
-// function(f, x, y, o) { return %Call(f, o, x, y) },
-// function(f, x, y, o) { return %Apply(f, o, [null, x, y, null], 1, 2) },
-// function(f, x, y, o) { return %Apply(f, o, arguments, 2, 2) },
-// function(f, x, y, o) { if (typeof o == "object") return o.f(x, y) },
-// function(f, x, y, o) { if (typeof o == "object") return o["f"](x, y) },
-// function(f, x, y, o) { if (typeof o == "object") return (1, o).f(x, y) },
-// function(f, x, y, o) { if (typeof o == "object") return (1, o)["f"](x, y) },
-// ]
-// var receivers = [o, global_object, undefined, null, 2, "bla", true]
-// var expectedSloppies = [o, global_object, global_object, global_object]
-//
-// for (var t = 0; t < traps.length; ++t) {
-// for (var i = 0; i < creates.length; ++i) {
-// for (var j = 0; j < binds.length; ++j) {
-// for (var k = 0; k < calls.length; ++k) {
-// for (var m = 0; m < receivers.length; ++m) {
-// for (var n = 0; n < receivers.length; ++n) {
-// var bound = receivers[m]
-// var receiver = receivers[n]
-// var func = binds[j](creates[i](traps[t]), bound, 31, 11)
-// var expected = j > 0 ? bound : receiver
-// var expectedSloppy = expectedSloppies[j > 0 ? m : n]
-// o.f = func
-// global_object.f = func
-// var x = calls[k](func, 11, 31, receiver)
-// if (x !== undefined) {
-// assertEquals(42, x.result)
-// if (calls[k].length < 4)
-// assertSame(x.strict ? undefined : global_object, x.receiver)
-// else if (x.strict)
-// assertSame(expected, x.receiver)
-// else if (expectedSloppy === undefined)
-// assertSame(expected, x.receiver.valueOf())
-// else
-// assertSame(expectedSloppy, x.receiver)
-// }
-// }
-// }
-// }
-// }
-// }
-// }
-//}
-//
-//TestCalls()
-//*/
-//
-//var realms = [Realm.create(), Realm.create()];
-//Realm.shared = {};
-//
-//Realm.eval(realms[0], "function f() { return this; };");
-//Realm.eval(realms[0], "Realm.shared.f = f;");
-//Realm.eval(realms[0], "Realm.shared.fg = this;");
-//Realm.eval(realms[1], "function g() { return this; };");
-//Realm.eval(realms[1], "Realm.shared.g = g;");
-//Realm.eval(realms[1], "Realm.shared.gg = this;");
-//
-//var fp = Proxy.createFunction({}, Realm.shared.f);
-//var gp = Proxy.createFunction({}, Realm.shared.g);
-//
-//for (var i = 0; i < 10; i++) {
-// assertEquals(Realm.shared.fg, fp());
-// assertEquals(Realm.shared.gg, gp());
-//
-// with (this) {
-// assertEquals(this, fp());
-// assertEquals(this, gp());
-// }
-//
-// with ({}) {
-// assertEquals(Realm.shared.fg, fp());
-// assertEquals(Realm.shared.gg, gp());
-// }
-//}
diff --git a/test/mjsunit/harmony/regexp-change-exec.js b/test/mjsunit/harmony/regexp-change-exec.js
new file mode 100644
index 0000000..4c9757e
--- /dev/null
+++ b/test/mjsunit/harmony/regexp-change-exec.js
@@ -0,0 +1,9 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-regexp-exec
+
+class MyError extends Error { }
+RegExp.prototype.exec = () => { throw new MyError() };
+assertThrows(() => "foo".match(/bar/), MyError);
diff --git a/test/mjsunit/harmony/regexp-flags.js b/test/mjsunit/harmony/regexp-flags.js
deleted file mode 100644
index fae8861..0000000
--- a/test/mjsunit/harmony/regexp-flags.js
+++ /dev/null
@@ -1,56 +0,0 @@
-// Copyright 2014 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --harmony-regexps --harmony-unicode-regexps
-
-RegExp.prototype.flags = 'setter should be undefined';
-
-assertEquals('', RegExp('').flags);
-assertEquals('', /./.flags);
-assertEquals('gimuy', RegExp('', 'yugmi').flags);
-assertEquals('gimuy', /foo/yumig.flags);
-
-var descriptor = Object.getOwnPropertyDescriptor(RegExp.prototype, 'flags');
-assertTrue(descriptor.configurable);
-assertFalse(descriptor.enumerable);
-assertInstanceof(descriptor.get, Function);
-assertEquals(undefined, descriptor.set);
-
-function testGenericFlags(object) {
- return descriptor.get.call(object);
-}
-
-assertEquals('', testGenericFlags({}));
-assertEquals('i', testGenericFlags({ ignoreCase: true }));
-assertEquals('uy', testGenericFlags({ global: 0, sticky: 1, unicode: 1 }));
-assertEquals('m', testGenericFlags({ __proto__: { multiline: true } }));
-assertThrows(function() { testGenericFlags(); }, TypeError);
-assertThrows(function() { testGenericFlags(undefined); }, TypeError);
-assertThrows(function() { testGenericFlags(null); }, TypeError);
-assertThrows(function() { testGenericFlags(true); }, TypeError);
-assertThrows(function() { testGenericFlags(false); }, TypeError);
-assertThrows(function() { testGenericFlags(''); }, TypeError);
-assertThrows(function() { testGenericFlags(42); }, TypeError);
-
-var counter = 0;
-var map = {};
-var object = {
- get global() {
- map.g = counter++;
- },
- get ignoreCase() {
- map.i = counter++;
- },
- get multiline() {
- map.m = counter++;
- },
- get unicode() {
- map.u = counter++;
- },
- get sticky() {
- map.y = counter++;
- }
-};
-testGenericFlags(object);
-assertEquals({ g: 0, i: 1, m: 2, u: 3, y: 4 }, map);
diff --git a/test/mjsunit/harmony/regexp-no-change-exec.js b/test/mjsunit/harmony/regexp-no-change-exec.js
new file mode 100644
index 0000000..30b5050
--- /dev/null
+++ b/test/mjsunit/harmony/regexp-no-change-exec.js
@@ -0,0 +1,9 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --no-harmony-regexp-exec
+
+class MyError extends Error { }
+RegExp.prototype.exec = () => { throw new MyError() };
+assertEquals(null, "foo".match(/bar/));
diff --git a/test/mjsunit/harmony/regexp-property-blocks.js b/test/mjsunit/harmony/regexp-property-blocks.js
new file mode 100644
index 0000000..d186e98
--- /dev/null
+++ b/test/mjsunit/harmony/regexp-property-blocks.js
@@ -0,0 +1,36 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-regexp-property --harmony-unicode-regexps
+
+function t(re, s) { assertTrue(re.test(s)); }
+function f(re, s) { assertFalse(re.test(s)); }
+
+t(/\p{InASCII}+/u, ".");
+t(/\p{InASCII}+/u, "supercalifragilisticexpialidocious");
+t(/\p{InBasic_Latin}+/u, ".");
+t(/\p{InBasic_Latin}+/u, "supercalifragilisticexpialidocious");
+
+t(/\p{InCJK}+/u, "话说天下大势，分久必合，合久必分");
+t(/\p{InCJK_Unified_Ideographs}+/u, "吾庄后有一桃园，花开正盛");
+f(/\p{InCJK}+/u, "おはようございます");
+f(/\p{InCJK_Unified_Ideographs}+/u,
+ "Something is rotten in the state of Denmark");
+
+t(/\p{InLatin_1}+/u, "Wie froh bin ich, daß ich weg bin!");
+f(/\p{InLatin_1_Supplement}+/u, "奔腾千里荡尘埃，渡水登山紫雾开");
+f(/\p{InLatin_1_Sup}+/u, "いただきます");
+
+t(/\p{InHiragana}/u, "いただきます");
+t(/\p{Hiragana}/u, "\u{1b001}"); // This refers to the script "Hiragana".
+f(/\p{InHiragana}/u, "\u{1b001}"); // This refers to the block "Hiragana".
+
+t(/\p{InGreek_And_Coptic}/u,
+ "ἄνδρα μοι ἔννεπε, μοῦσα, πολύτροπον, ὃς μάλα πολλὰ");
+t(/\p{InGreek}/u, "μῆνιν ἄειδε θεὰ Πηληϊάδεω Ἀχιλῆος");
+
+assertThrows("/\\p{In}/u");
+assertThrows("/\\pI/u");
+assertThrows("/\\p{I}/u");
+assertThrows("/\\p{CJK}/u");
diff --git a/test/mjsunit/harmony/regexp-property-char-class.js b/test/mjsunit/harmony/regexp-property-char-class.js
new file mode 100644
index 0000000..76774cb
--- /dev/null
+++ b/test/mjsunit/harmony/regexp-property-char-class.js
@@ -0,0 +1,27 @@
+// Copyright 2011 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-unicode-regexps --harmony-regexp-property
+
+assertThrows("/[\\p]/u");
+assertThrows("/[\\p{garbage}]/u");
+assertThrows("/[\\p{}]/u");
+assertThrows("/[\\p{]/u");
+assertThrows("/[\\p}]/u");
+assertThrows("/[\\p{Math}]/u");
+assertThrows("/[\\p{Bidi_M}]/u");
+assertThrows("/[\\p{Hex}]/u");
+
+assertTrue(/^[\p{Lu}\p{Ll}]+$/u.test("ABCabc"));
+assertTrue(/^[\p{Lu}-\p{Ll}]+$/u.test("ABC-abc"));
+assertFalse(/^[\P{Lu}\p{Ll}]+$/u.test("ABCabc"));
+assertTrue(/^[\P{Lu}\p{Ll}]+$/u.test("abc"));
+assertTrue(/^[\P{Lu}]+$/u.test("abc123"));
+assertFalse(/^[\P{Lu}]+$/u.test("XYZ"));
+
+assertTrue(/^[^\P{Lu}]+$/u.test("XYZ"));
+assertFalse(/^[^\p{Lu}\p{Ll}]+$/u.test("abc"));
+assertFalse(/^[^\p{Lu}\p{Ll}]+$/u.test("ABC"));
+assertTrue(/^[^\p{Lu}\p{Ll}]+$/u.test("123"));
+assertTrue(/^[^\p{Lu}\P{Ll}]+$/u.test("abc"));
diff --git a/test/mjsunit/harmony/regexp-property-disabled.js b/test/mjsunit/harmony/regexp-property-disabled.js
new file mode 100644
index 0000000..7a3158c
--- /dev/null
+++ b/test/mjsunit/harmony/regexp-property-disabled.js
@@ -0,0 +1,18 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-unicode-regexps --no-harmony-regexp-property
+
+function test(source, message) {
+ try {
+ eval(source);
+ } catch (e) {
+ assertEquals(message, e.message);
+ return;
+ }
+ assertUnreachable();
+}
+
+test("/\\pL/u", "Invalid regular expression: /\\pL/: Invalid escape");
+test("/[\\p{L}]/u", "Invalid regular expression: /[\\p{L}]/: Invalid escape");
diff --git a/test/mjsunit/harmony/regexp-property-exact-match.js b/test/mjsunit/harmony/regexp-property-exact-match.js
new file mode 100644
index 0000000..4dfcc5f
--- /dev/null
+++ b/test/mjsunit/harmony/regexp-property-exact-match.js
@@ -0,0 +1,33 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-regexp-property --harmony-unicode-regexps
+
+assertThrows("/\\p{In CJK}/u");
+assertThrows("/\\p{InCJKUnifiedIdeographs}/u");
+assertDoesNotThrow("/\\p{InCJK}/u");
+assertDoesNotThrow("/\\p{InCJK_Unified_Ideographs}/u");
+
+assertDoesNotThrow("/\\p{InCyrillic_Sup}/u");
+assertDoesNotThrow("/\\p{InCyrillic_Supplement}/u");
+assertDoesNotThrow("/\\p{InCyrillic_Supplementary}/u");
+assertThrows("/\\p{InCyrillicSupplementary}/u");
+assertThrows("/\\p{InCyrillic_supplementary}/u");
+
+assertDoesNotThrow("/\\pC/u");
+assertDoesNotThrow("/\\p{Other}/u");
+assertDoesNotThrow("/\\p{Cc}/u");
+assertDoesNotThrow("/\\p{Control}/u");
+assertDoesNotThrow("/\\p{cntrl}/u");
+assertDoesNotThrow("/\\p{M}/u");
+assertDoesNotThrow("/\\p{Mark}/u");
+assertDoesNotThrow("/\\p{Combining_Mark}/u");
+assertThrows("/\\p{Combining Mark}/u");
+
+assertDoesNotThrow("/\\p{Copt}/u");
+assertDoesNotThrow("/\\p{Coptic}/u");
+assertDoesNotThrow("/\\p{Qaac}/u");
+assertDoesNotThrow("/\\p{Egyp}/u");
+assertDoesNotThrow("/\\p{Egyptian_Hieroglyphs}/u");
+assertThrows("/\\p{EgyptianHieroglyphs}/u");
diff --git a/test/mjsunit/harmony/unicode-regexp-property-class.js b/test/mjsunit/harmony/regexp-property-general-category.js
similarity index 95%
rename from test/mjsunit/harmony/unicode-regexp-property-class.js
rename to test/mjsunit/harmony/regexp-property-general-category.js
index 323873a..e2015ad 100644
--- a/test/mjsunit/harmony/unicode-regexp-property-class.js
+++ b/test/mjsunit/harmony/regexp-property-general-category.js
@@ -62,3 +62,6 @@
assertFalse(/\PL/u.test("\u1FAB"));
assertFalse(/\p{L}/u.test("\uA6EE"));
assertTrue(/\P{L}/u.test("\uA6EE"));
+
+assertTrue(/\p{Lowercase_Letter}/u.test("a"));
+assertTrue(/\p{Math_Symbol}/u.test("+"));
diff --git a/test/mjsunit/harmony/regexp-property-scripts.js b/test/mjsunit/harmony/regexp-property-scripts.js
new file mode 100644
index 0000000..19b50ee
--- /dev/null
+++ b/test/mjsunit/harmony/regexp-property-scripts.js
@@ -0,0 +1,39 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-regexp-property --harmony-unicode-regexps
+
+function t(re, s) { assertTrue(re.test(s)); }
+function f(re, s) { assertFalse(re.test(s)); }
+
+t(/\p{Common}+/u, ".");
+f(/\p{Common}+/u, "supercalifragilisticexpialidocious");
+
+t(/\p{Han}+/u, "话说天下大势，分久必合，合久必分");
+t(/\p{Hani}+/u, "吾庄后有一桃园，花开正盛");
+f(/\p{Han}+/u, "おはようございます");
+f(/\p{Hani}+/u, "Something is rotten in the state of Denmark");
+
+t(/\p{Latin}+/u, "Wie froh bin ich, daß ich weg bin!");
+t(/\p{Latn}+/u,
+ "It was a bright day in April, and the clocks were striking thirteen");
+f(/\p{Latin}+/u, "奔腾千里荡尘埃，渡水登山紫雾开");
+f(/\p{Latn}+/u, "いただきます");
+
+t(/\p{Hiragana}/u, "いただきます");
+t(/\p{Hira}/u, "ありがとうございました");
+f(/\p{Hiragana}/u,
+ "Als Gregor Samsa eines Morgens aus unruhigen Träumen erwachte");
+f(/\p{Hira}/u, "Call me Ishmael");
+
+t(/\p{Phoenician}/u, "\u{10900}\u{1091a}");
+t(/\p{Phnx}/u, "\u{1091f}\u{10916}");
+f(/\p{Phoenician}/u, "Arthur est un perroquet");
+f(/\p{Phnx}/u, "设心狠毒非良士，操卓原来一路人");
+
+t(/\p{Grek}/u, "ἄνδρα μοι ἔννεπε, μοῦσα, πολύτροπον, ὃς μάλα πολλὰ");
+t(/\p{Greek}/u, "μῆνιν ἄειδε θεὰ Πηληϊάδεω Ἀχιλῆος");
+f(/\p{Greek}/u, "高贤未服英雄志，屈节偏生杰士疑");
+f(/\p{Greek}/u,
+ "Mr. Jones, of the Manor Farm, had locked the hen-houses for the night");
diff --git a/test/mjsunit/harmony/regress/regress-343928.js b/test/mjsunit/harmony/regress/regress-343928.js
deleted file mode 100644
index f2ff371..0000000
--- a/test/mjsunit/harmony/regress/regress-343928.js
+++ /dev/null
@@ -1,22 +0,0 @@
-// Copyright 2014 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --harmony-modules --expose-debug-as=debug
-
-(function () { // Scope for utility functions.
- escaping_function = function(object) {
- // Argument must not be null or undefined.
- var string = Object.prototype.toString.call(object);
- // String has format [object <ClassName>].
- return string.substring(8, string.length - 1);
- }
-})();
-
-module B {
- var stuff = 3
-}
-
-var __v_0 = {};
-var __v_4 = debug.MakeMirror(__v_0);
-print(__v_4.referencedBy().length); // core dump here if not fixed.
diff --git a/test/mjsunit/harmony/regress/regress-4482.js b/test/mjsunit/harmony/regress/regress-4482.js
index bffca42..2472b46 100644
--- a/test/mjsunit/harmony/regress/regress-4482.js
+++ b/test/mjsunit/harmony/regress/regress-4482.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
-// Flags: --harmony-sloppy --nolegacy-const
+// Flags: --harmony-sloppy
assertEquals("function", (function f() { f = 42; return typeof f })());
assertEquals("function",
diff --git a/test/mjsunit/harmony/sharedarraybuffer.js b/test/mjsunit/harmony/sharedarraybuffer.js
index 7f7f8fb..7bd4e5b 100644
--- a/test/mjsunit/harmony/sharedarraybuffer.js
+++ b/test/mjsunit/harmony/sharedarraybuffer.js
@@ -25,7 +25,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --harmony-sharedarraybuffer --harmony-tostring
+// Flags: --harmony-sharedarraybuffer
// SharedArrayBuffer
diff --git a/test/mjsunit/harmony/simd.js b/test/mjsunit/harmony/simd.js
index ff81506..1868050 100644
--- a/test/mjsunit/harmony/simd.js
+++ b/test/mjsunit/harmony/simd.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-simd --harmony-tostring --harmony-reflect
+// Flags: --harmony-simd
// Flags: --allow-natives-syntax --expose-natives-as natives --noalways-opt
function lanesForType(typeName) {
diff --git a/test/mjsunit/harmony/sloppy-implicit-block-function.js b/test/mjsunit/harmony/sloppy-implicit-block-function.js
new file mode 100644
index 0000000..0702320
--- /dev/null
+++ b/test/mjsunit/harmony/sloppy-implicit-block-function.js
@@ -0,0 +1,97 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --no-harmony-restrictive-declarations
+
+// ES#sec-functiondeclarations-in-ifstatement-statement-clauses
+// Annex B 3.4 FunctionDeclarations in IfStatement Statement Clauses
+// In sloppy mode, function declarations in if statements act like
+// they have a block around them. Prohibited in strict mode.
+(function() {
+ assertEquals(undefined, f);
+ if (false) function f() { };
+ assertEquals(undefined, f);
+})();
+
+(function() {
+ assertEquals(undefined, f);
+ if (true) function f() { };
+ assertEquals('function', typeof f);
+})();
+
+(function() {
+ assertEquals(undefined, f);
+ if (true) {} else function f() { };
+ assertEquals(undefined, f);
+})();
+
+(function() {
+ assertEquals(undefined, f);
+ if (false) {} else function f() { };
+ assertEquals('function', typeof f);
+})();
+
+// For legacy reasons, we also support these types of semantics as
+// the body of a for or with statement.
+(function() {
+ for (;false;) function f() { };
+ assertEquals(undefined, f);
+})();
+
+(function() {
+ for (var x in {}) function f() { };
+ assertEquals(undefined, f);
+})();
+
+(function() {
+ var x;
+ for (x in {}) function f() { };
+ assertEquals(undefined, f);
+})();
+
+(function() {
+ for (var i = 0; i < 1; i++) function f() { };
+ assertEquals('function', typeof f);
+})();
+
+(function() {
+ for (var x in {a: 1}) function f() { };
+ assertEquals('function', typeof f);
+})();
+
+(function() {
+ var x;
+ for (x in {a: 1}) function f() { };
+ assertEquals('function', typeof f);
+})();
+
+(function() {
+ with ({}) function f() { };
+ assertEquals('function', typeof f);
+})();
+
+(function() {
+ do function f() {} while (0);
+ assertEquals('function', typeof f);
+})();
+
+// Labeled function declarations undergo the same hoisting/FiB semantics as if
+// they were unalbeled.
+(function() {
+ function bar() {
+ return f;
+ x: function f() {}
+ }
+ assertEquals('function', typeof bar());
+})();
+
+(function() {
+ function bar() {
+ return f;
+ {
+ x: function f() {}
+ }
+ }
+ assertEquals(undefined, bar());
+})();
diff --git a/test/mjsunit/harmony/sloppy-restrictive-block-function.js b/test/mjsunit/harmony/sloppy-restrictive-block-function.js
new file mode 100644
index 0000000..07ce64b
--- /dev/null
+++ b/test/mjsunit/harmony/sloppy-restrictive-block-function.js
@@ -0,0 +1,52 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-restrictive-declarations
+
+// ES#sec-functiondeclarations-in-ifstatement-statement-clauses
+// Annex B 3.4 FunctionDeclarations in IfStatement Statement Clauses
+// In sloppy mode, function declarations in if statements act like
+// they have a block around them. Prohibited in strict mode.
+(function() {
+ if (false) function f() { };
+ assertEquals(undefined, f);
+})();
+
+(function() {
+ assertEquals(undefined, f);
+ if (true) function f() { };
+ assertEquals('function', typeof f);
+})();
+
+(function() {
+ assertEquals(undefined, f);
+ if (true) {} else function f() { };
+ assertEquals(undefined, f);
+})();
+
+(function() {
+ assertEquals(undefined, f);
+ if (false) {} else function f() { };
+ assertEquals('function', typeof f);
+})();
+
+// Labeled function declarations undergo the same hoisting/FiB semantics as if
+// they were unalbeled.
+(function() {
+ function bar() {
+ return f;
+ x: function f() {}
+ }
+ assertEquals('function', typeof bar());
+})();
+
+(function() {
+ function bar() {
+ return f;
+ {
+ x: function f() {}
+ }
+ }
+ assertEquals(undefined, bar());
+})();
diff --git a/test/mjsunit/harmony/unicode-escapes-in-regexps.js b/test/mjsunit/harmony/unicode-escapes-in-regexps.js
index 895e0c6..7ea6f62 100644
--- a/test/mjsunit/harmony/unicode-escapes-in-regexps.js
+++ b/test/mjsunit/harmony/unicode-escapes-in-regexps.js
@@ -4,7 +4,7 @@
// ES6 extends the \uxxxx escape and also allows \u{xxxxx}.
-// Flags: --harmony-unicode-regexps --harmony-regexps
+// Flags: --harmony-unicode-regexps
function testRegexpHelper(r) {
assertTrue(r.test("foo"));
diff --git a/test/mjsunit/ignition/debug-scope-on-return.js b/test/mjsunit/ignition/debug-scope-on-return.js
new file mode 100644
index 0000000..5be6de6
--- /dev/null
+++ b/test/mjsunit/ignition/debug-scope-on-return.js
@@ -0,0 +1,31 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-debug-as debug
+
+// Check that the we are still in function context when we break on return.
+
+var Debug = debug.Debug;
+
+function listener(event, exec_state, event_data, data) {
+ if (event == Debug.DebugEvent.Break) {
+ // Access scope details to check the context is correct.
+ var scope_count = exec_state.frame().scopeCount();
+ // Do steps until we reach the global scope again.
+ exec_state.prepareStep(Debug.StepAction.StepIn);
+ }
+}
+
+Debug.setListener(listener);
+
+function f() {
+ debugger;
+
+ L: with ({x:12}) {
+ break L;
+ }
+
+ return;
+}
+f();
diff --git a/test/mjsunit/ignition/debug-step-prefix-bytecodes.js b/test/mjsunit/ignition/debug-step-prefix-bytecodes.js
new file mode 100644
index 0000000..819fdf8
--- /dev/null
+++ b/test/mjsunit/ignition/debug-step-prefix-bytecodes.js
@@ -0,0 +1,375 @@
+// Copyright 2011 the V8 project authors. All rights reserved.
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are
+// met:
+//
+// * Redistributions of source code must retain the above copyright
+// notice, this list of conditions and the following disclaimer.
+// * Redistributions in binary form must reproduce the above
+// copyright notice, this list of conditions and the following
+// disclaimer in the documentation and/or other materials provided
+// with the distribution.
+// * Neither the name of Google Inc. nor the names of its
+// contributors may be used to endorse or promote products derived
+// from this software without specific prior written permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+// Flags: --ignition-filter=f --expose-debug-as debug
+
+// This test tests that full code compiled without debug break slots
+// is recompiled with debug break slots when debugging is started.
+
+// Get the Debug object exposed from the debug context global object.
+Debug = debug.Debug
+
+var done = false;
+var step_count = 0;
+var values = [];
+
+// Debug event listener which steps until the global variable done is true.
+function listener(event, exec_state, event_data, data) {
+ if (event == Debug.DebugEvent.Break) {
+ if (!done) exec_state.prepareStep(Debug.StepAction.StepNext);
+ step_count++;
+ }
+};
+
+// Set the global variables state to prpare the stepping test.
+function prepare_step_test() {
+ done = false;
+ step_count = 0;
+}
+
+// Test function to step through, uses widended bytecodes.
+function f() {
+var x = 10000000;
+var y = x + 1;
+var _aa = 0; values[_aa] = _aa;
+var _ab = 1; values[_ab] = _ab;
+var _ac = 2; values[_ac] = _ac;
+var _ad = 3; values[_ad] = _ad;
+var _ae = 4; values[_ae] = _ae;
+var _af = 5; values[_af] = _af;
+var _ag = 6; values[_ag] = _ag;
+var _ah = 7; values[_ah] = _ah;
+var _ai = 8; values[_ai] = _ai;
+var _aj = 9; values[_aj] = _aj;
+var _ak = 10; values[_ak] = _ak;
+var _al = 11; values[_al] = _al;
+var _am = 12; values[_am] = _am;
+var _an = 13; values[_an] = _an;
+var _ao = 14; values[_ao] = _ao;
+var _ap = 15; values[_ap] = _ap;
+var _ba = 16; values[_ba] = _ba;
+var _bb = 17; values[_bb] = _bb;
+var _bc = 18; values[_bc] = _bc;
+var _bd = 19; values[_bd] = _bd;
+var _be = 20; values[_be] = _be;
+var _bf = 21; values[_bf] = _bf;
+var _bg = 22; values[_bg] = _bg;
+var _bh = 23; values[_bh] = _bh;
+var _bi = 24; values[_bi] = _bi;
+var _bj = 25; values[_bj] = _bj;
+var _bk = 26; values[_bk] = _bk;
+var _bl = 27; values[_bl] = _bl;
+var _bm = 28; values[_bm] = _bm;
+var _bn = 29; values[_bn] = _bn;
+var _bo = 30; values[_bo] = _bo;
+var _bp = 31; values[_bp] = _bp;
+var _ca = 32; values[_ca] = _ca;
+var _cb = 33; values[_cb] = _cb;
+var _cc = 34; values[_cc] = _cc;
+var _cd = 35; values[_cd] = _cd;
+var _ce = 36; values[_ce] = _ce;
+var _cf = 37; values[_cf] = _cf;
+var _cg = 38; values[_cg] = _cg;
+var _ch = 39; values[_ch] = _ch;
+var _ci = 40; values[_ci] = _ci;
+var _cj = 41; values[_cj] = _cj;
+var _ck = 42; values[_ck] = _ck;
+var _cl = 43; values[_cl] = _cl;
+var _cm = 44; values[_cm] = _cm;
+var _cn = 45; values[_cn] = _cn;
+var _co = 46; values[_co] = _co;
+var _cp = 47; values[_cp] = _cp;
+var _da = 48; values[_da] = _da;
+var _db = 49; values[_db] = _db;
+var _dc = 50; values[_dc] = _dc;
+var _dd = 51; values[_dd] = _dd;
+var _de = 52; values[_de] = _de;
+var _df = 53; values[_df] = _df;
+var _dg = 54; values[_dg] = _dg;
+var _dh = 55; values[_dh] = _dh;
+var _di = 56; values[_di] = _di;
+var _dj = 57; values[_dj] = _dj;
+var _dk = 58; values[_dk] = _dk;
+var _dl = 59; values[_dl] = _dl;
+var _dm = 60; values[_dm] = _dm;
+var _dn = 61; values[_dn] = _dn;
+var _do = 62; values[_do] = _do;
+var _dp = 63; values[_dp] = _dp;
+var _ea = 64; values[_ea] = _ea;
+var _eb = 65; values[_eb] = _eb;
+var _ec = 66; values[_ec] = _ec;
+var _ed = 67; values[_ed] = _ed;
+var _ee = 68; values[_ee] = _ee;
+var _ef = 69; values[_ef] = _ef;
+var _eg = 70; values[_eg] = _eg;
+var _eh = 71; values[_eh] = _eh;
+var _ei = 72; values[_ei] = _ei;
+var _ej = 73; values[_ej] = _ej;
+var _ek = 74; values[_ek] = _ek;
+var _el = 75; values[_el] = _el;
+var _em = 76; values[_em] = _em;
+var _en = 77; values[_en] = _en;
+var _eo = 78; values[_eo] = _eo;
+var _ep = 79; values[_ep] = _ep;
+var _fa = 80; values[_fa] = _fa;
+var _fb = 81; values[_fb] = _fb;
+var _fc = 82; values[_fc] = _fc;
+var _fd = 83; values[_fd] = _fd;
+var _fe = 84; values[_fe] = _fe;
+var _ff = 85; values[_ff] = _ff;
+var _fg = 86; values[_fg] = _fg;
+var _fh = 87; values[_fh] = _fh;
+var _fi = 88; values[_fi] = _fi;
+var _fj = 89; values[_fj] = _fj;
+var _fk = 90; values[_fk] = _fk;
+var _fl = 91; values[_fl] = _fl;
+var _fm = 92; values[_fm] = _fm;
+var _fn = 93; values[_fn] = _fn;
+var _fo = 94; values[_fo] = _fo;
+var _fp = 95; values[_fp] = _fp;
+var _ga = 96; values[_ga] = _ga;
+var _gb = 97; values[_gb] = _gb;
+var _gc = 98; values[_gc] = _gc;
+var _gd = 99; values[_gd] = _gd;
+var _ge = 100; values[_ge] = _ge;
+var _gf = 101; values[_gf] = _gf;
+var _gg = 102; values[_gg] = _gg;
+var _gh = 103; values[_gh] = _gh;
+var _gi = 104; values[_gi] = _gi;
+var _gj = 105; values[_gj] = _gj;
+var _gk = 106; values[_gk] = _gk;
+var _gl = 107; values[_gl] = _gl;
+var _gm = 108; values[_gm] = _gm;
+var _gn = 109; values[_gn] = _gn;
+var _go = 110; values[_go] = _go;
+var _gp = 111; values[_gp] = _gp;
+var _ha = 112; values[_ha] = _ha;
+var _hb = 113; values[_hb] = _hb;
+var _hc = 114; values[_hc] = _hc;
+var _hd = 115; values[_hd] = _hd;
+var _he = 116; values[_he] = _he;
+var _hf = 117; values[_hf] = _hf;
+var _hg = 118; values[_hg] = _hg;
+var _hh = 119; values[_hh] = _hh;
+var _hi = 120; values[_hi] = _hi;
+var _hj = 121; values[_hj] = _hj;
+var _hk = 122; values[_hk] = _hk;
+var _hl = 123; values[_hl] = _hl;
+var _hm = 124; values[_hm] = _hm;
+var _hn = 125; values[_hn] = _hn;
+var _ho = 126; values[_ho] = _ho;
+var _hp = 127; values[_hp] = _hp;
+var _ia = 128; values[_ia] = _ia;
+var _ib = 129; values[_ib] = _ib;
+var _ic = 130; values[_ic] = _ic;
+var _id = 131; values[_id] = _id;
+var _ie = 132; values[_ie] = _ie;
+var _if = 133; values[_if] = _if;
+var _ig = 134; values[_ig] = _ig;
+var _ih = 135; values[_ih] = _ih;
+var _ii = 136; values[_ii] = _ii;
+var _ij = 137; values[_ij] = _ij;
+var _ik = 138; values[_ik] = _ik;
+var _il = 139; values[_il] = _il;
+var _im = 140; values[_im] = _im;
+var _in = 141; values[_in] = _in;
+var _io = 142; values[_io] = _io;
+var _ip = 143; values[_ip] = _ip;
+var _ja = 144; values[_ja] = _ja;
+var _jb = 145; values[_jb] = _jb;
+var _jc = 146; values[_jc] = _jc;
+var _jd = 147; values[_jd] = _jd;
+var _je = 148; values[_je] = _je;
+var _jf = 149; values[_jf] = _jf;
+var _jg = 150; values[_jg] = _jg;
+var _jh = 151; values[_jh] = _jh;
+var _ji = 152; values[_ji] = _ji;
+var _jj = 153; values[_jj] = _jj;
+var _jk = 154; values[_jk] = _jk;
+var _jl = 155; values[_jl] = _jl;
+var _jm = 156; values[_jm] = _jm;
+var _jn = 157; values[_jn] = _jn;
+var _jo = 158; values[_jo] = _jo;
+var _jp = 159; values[_jp] = _jp;
+var _ka = 160; values[_ka] = _ka;
+var _kb = 161; values[_kb] = _kb;
+var _kc = 162; values[_kc] = _kc;
+var _kd = 163; values[_kd] = _kd;
+var _ke = 164; values[_ke] = _ke;
+var _kf = 165; values[_kf] = _kf;
+var _kg = 166; values[_kg] = _kg;
+var _kh = 167; values[_kh] = _kh;
+var _ki = 168; values[_ki] = _ki;
+var _kj = 169; values[_kj] = _kj;
+var _kk = 170; values[_kk] = _kk;
+var _kl = 171; values[_kl] = _kl;
+var _km = 172; values[_km] = _km;
+var _kn = 173; values[_kn] = _kn;
+var _ko = 174; values[_ko] = _ko;
+var _kp = 175; values[_kp] = _kp;
+var _la = 176; values[_la] = _la;
+var _lb = 177; values[_lb] = _lb;
+var _lc = 178; values[_lc] = _lc;
+var _ld = 179; values[_ld] = _ld;
+var _le = 180; values[_le] = _le;
+var _lf = 181; values[_lf] = _lf;
+var _lg = 182; values[_lg] = _lg;
+var _lh = 183; values[_lh] = _lh;
+var _li = 184; values[_li] = _li;
+var _lj = 185; values[_lj] = _lj;
+var _lk = 186; values[_lk] = _lk;
+var _ll = 187; values[_ll] = _ll;
+var _lm = 188; values[_lm] = _lm;
+var _ln = 189; values[_ln] = _ln;
+var _lo = 190; values[_lo] = _lo;
+var _lp = 191; values[_lp] = _lp;
+var _ma = 192; values[_ma] = _ma;
+var _mb = 193; values[_mb] = _mb;
+var _mc = 194; values[_mc] = _mc;
+var _md = 195; values[_md] = _md;
+var _me = 196; values[_me] = _me;
+var _mf = 197; values[_mf] = _mf;
+var _mg = 198; values[_mg] = _mg;
+var _mh = 199; values[_mh] = _mh;
+var _mi = 200; values[_mi] = _mi;
+var _mj = 201; values[_mj] = _mj;
+var _mk = 202; values[_mk] = _mk;
+var _ml = 203; values[_ml] = _ml;
+var _mm = 204; values[_mm] = _mm;
+var _mn = 205; values[_mn] = _mn;
+var _mo = 206; values[_mo] = _mo;
+var _mp = 207; values[_mp] = _mp;
+var _na = 208; values[_na] = _na;
+var _nb = 209; values[_nb] = _nb;
+var _nc = 210; values[_nc] = _nc;
+var _nd = 211; values[_nd] = _nd;
+var _ne = 212; values[_ne] = _ne;
+var _nf = 213; values[_nf] = _nf;
+var _ng = 214; values[_ng] = _ng;
+var _nh = 215; values[_nh] = _nh;
+var _ni = 216; values[_ni] = _ni;
+var _nj = 217; values[_nj] = _nj;
+var _nk = 218; values[_nk] = _nk;
+var _nl = 219; values[_nl] = _nl;
+var _nm = 220; values[_nm] = _nm;
+var _nn = 221; values[_nn] = _nn;
+var _no = 222; values[_no] = _no;
+var _np = 223; values[_np] = _np;
+var _oa = 224; values[_oa] = _oa;
+var _ob = 225; values[_ob] = _ob;
+var _oc = 226; values[_oc] = _oc;
+var _od = 227; values[_od] = _od;
+var _oe = 228; values[_oe] = _oe;
+var _of = 229; values[_of] = _of;
+var _og = 230; values[_og] = _og;
+var _oh = 231; values[_oh] = _oh;
+var _oi = 232; values[_oi] = _oi;
+var _oj = 233; values[_oj] = _oj;
+var _ok = 234; values[_ok] = _ok;
+var _ol = 235; values[_ol] = _ol;
+var _om = 236; values[_om] = _om;
+var _on = 237; values[_on] = _on;
+var _oo = 238; values[_oo] = _oo;
+var _op = 239; values[_op] = _op;
+var _pa = 240; values[_pa] = _pa;
+var _pb = 241; values[_pb] = _pb;
+var _pc = 242; values[_pc] = _pc;
+var _pd = 243; values[_pd] = _pd;
+var _pe = 244; values[_pe] = _pe;
+var _pf = 245; values[_pf] = _pf;
+var _pg = 246; values[_pg] = _pg;
+var _ph = 247; values[_ph] = _ph;
+var _pi = 248; values[_pi] = _pi;
+var _pj = 249; values[_pj] = _pj;
+var _pk = 250; values[_pk] = _pk;
+var _pl = 251; values[_pl] = _pl;
+var _pm = 252; values[_pm] = _pm;
+var _pn = 253; values[_pn] = _pn;
+var _po = 254; values[_po] = _po;
+var _pp = 255; values[_pp] = _pp;
+var _qa = 256; values[_qa] = _qa;
+var _qb = 257; values[_qb] = _qb;
+var _qc = 258; values[_qc] = _qc;
+var _qd = 259; values[_qd] = _qd;
+var _qe = 260; values[_qe] = _qe;
+var _qf = 261; values[_qf] = _qf;
+var _qg = 262; values[_qg] = _qg;
+var _qh = 263; values[_qh] = _qh;
+var _qi = 264; values[_qi] = _qi;
+var _qj = 265; values[_qj] = _qj;
+var _qk = 266; values[_qk] = _qk;
+var _ql = 267; values[_ql] = _ql;
+var _qm = 268; values[_qm] = _qm;
+var _qn = 269; values[_qn] = _qn;
+var _qo = 270; values[_qo] = _qo;
+var _qp = 271; values[_qp] = _qp;
+var _ra = 272; values[_ra] = _ra;
+var _rb = 273; values[_rb] = _rb;
+var _rc = 274; values[_rc] = _rc;
+var _rd = 275; values[_rd] = _rd;
+var _re = 276; values[_re] = _re;
+var _rf = 277; values[_rf] = _rf;
+var _rg = 278; values[_rg] = _rg;
+var _rh = 279; values[_rh] = _rh;
+var _ri = 280; values[_ri] = _ri;
+var _rj = 281; values[_rj] = _rj;
+var _rk = 282; values[_rk] = _rk;
+var _rl = 283; values[_rl] = _rl;
+var _rm = 284; values[_rm] = _rm;
+var _rn = 285; values[_rn] = _rn;
+var _ro = 286; values[_ro] = _ro;
+var _rp = 287; values[_rp] = _rp;
+ done = true;
+};
+
+function check_values() {
+ for (var i = 0; i < values.length; i++) {
+ assertEquals(values[i], i);
+ values[i] = -i;
+ }
+}
+
+// Pass 1 - no debugger, no steps seen
+prepare_step_test();
+f();
+check_values();
+assertEquals(0, step_count);
+
+// Pass 2 - debugger attached and stepping from BP
+Debug.setListener(listener);
+var bp = Debug.setBreakPoint(f, 1);
+prepare_step_test();
+f();
+check_values();
+assertEquals(580, step_count);
+Debug.clearBreakPoint(bp);
+
+// Pass 3 - debugger attached and no BP
+prepare_step_test();
+f();
+check_values();
+assertEquals(0, step_count);
diff --git a/test/mjsunit/ignition/elided-instruction-no-ignition.js b/test/mjsunit/ignition/elided-instruction-no-ignition.js
new file mode 100644
index 0000000..d31150b
--- /dev/null
+++ b/test/mjsunit/ignition/elided-instruction-no-ignition.js
@@ -0,0 +1,37 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-debug-as debug
+
+Debug = debug.Debug
+
+var exception = null;
+var break_count = 0;
+
+function listener(event, exec_state, event_data, data) {
+ if (event != Debug.DebugEvent.Break) return;
+ try {
+ print(event_data.sourceLineText());
+ var column = event_data.sourceColumn();
+ assertTrue(event_data.sourceLineText().indexOf(
+ `Break ${break_count++}. ${column}.`) > 0);
+ exec_state.prepareStep(Debug.StepAction.StepIn);
+ } catch (e) {
+ print(e + e.stack);
+ exception = e;
+ }
+};
+
+function f() {
+ var a = 1; // Break 2. 10.
+ return a; // Break 3. 2.
+} // Break 4. 0.
+
+Debug.setListener(listener);
+debugger; // Break 0. 0.
+f(); // Break 1. 0.
+Debug.setListener(null); // Break 5. 0.
+
+assertNull(exception);
+assertEquals(6, break_count);
diff --git a/test/mjsunit/ignition/elided-instruction.js b/test/mjsunit/ignition/elided-instruction.js
new file mode 100644
index 0000000..807974b
--- /dev/null
+++ b/test/mjsunit/ignition/elided-instruction.js
@@ -0,0 +1,41 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-debug-as debug
+
+Debug = debug.Debug
+
+var exception = null;
+var break_count = 0;
+
+function listener(event, exec_state, event_data, data) {
+ if (event != Debug.DebugEvent.Break) return;
+ try {
+ print(event_data.sourceLineText());
+ var column = event_data.sourceColumn();
+ assertTrue(event_data.sourceLineText().indexOf(
+ `Break ${break_count++}. ${column}.`) > 0);
+ exec_state.prepareStep(Debug.StepAction.StepIn);
+ } catch (e) {
+ print(e + e.stack);
+ exception = e;
+ }
+};
+
+function f() {
+ var a = 1; // Break 2. 10.
+ // This return statement emits no bytecode instruction for the evaluation of
+ // the to-be-returned expression. Therefore we cannot set a break location
+ // before the statement and a second break location immediately before
+ // returning to the caller.
+ return a;
+} // Break 3. 0.
+
+Debug.setListener(listener);
+debugger; // Break 0. 0.
+f(); // Break 1. 0.
+Debug.setListener(null); // Break 4. 0.
+
+assertNull(exception);
+assertEquals(5, break_count);
diff --git a/test/mjsunit/ignition/optimized-debug-frame.js b/test/mjsunit/ignition/optimized-debug-frame.js
new file mode 100644
index 0000000..be316ad
--- /dev/null
+++ b/test/mjsunit/ignition/optimized-debug-frame.js
@@ -0,0 +1,38 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --expose-debug-as debug
+
+// Test that PC in optimized frame would correctly translate into
+// unoptimized frame when retrieving frame information in the debugger.
+
+function f() {
+ debugger;
+}
+
+function g(x) {
+ return f();
+}
+
+var break_count = 0;
+
+function listener(event, exec_state, event_data, data) {
+ if (event != Debug.DebugEvent.Break) return;
+ assertEquals(14, exec_state.frame(1).sourceLine());
+ assertEquals(9, exec_state.frame(1).sourceColumn());
+ break_count++;
+}
+
+g();
+g();
+%OptimizeFunctionOnNextCall(g);
+
+var Debug = debug.Debug;
+Debug.setListener(listener);
+
+g();
+
+Debug.setListener(null);
+
+assertEquals(1, break_count);
diff --git a/test/mjsunit/ignition/optimized-stack-trace.js b/test/mjsunit/ignition/optimized-stack-trace.js
new file mode 100644
index 0000000..77f9acf
--- /dev/null
+++ b/test/mjsunit/ignition/optimized-stack-trace.js
@@ -0,0 +1,22 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+// Test that PC in optimized frame would correctly translate into
+// unoptimized frame when collecting stack trace.
+
+function f() {
+ return new Error().stack;
+}
+
+function g(x) {
+ return f();
+}
+
+g();
+g();
+%OptimizeFunctionOnNextCall(g);
+print(g());
+assertTrue(/g \(.*?\.js:15:10\)/.test(g()));
diff --git a/test/mjsunit/ignition/regress-597565-double-to-object-transition.js b/test/mjsunit/ignition/regress-597565-double-to-object-transition.js
new file mode 100644
index 0000000..7bf8e83
--- /dev/null
+++ b/test/mjsunit/ignition/regress-597565-double-to-object-transition.js
@@ -0,0 +1,18 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --no-inline-new
+
+function __f_2(b, value) {
+ b[1] = value;
+}
+function __f_9() {
+ var arr = [1.5, 0, 0];
+ // Call with a double, so the expected element type is double.
+ __f_2(1.5);
+ // Call with an object, which triggers transition from FAST_double
+ // to Object for the elements type.
+ __f_2(arr);
+}
+__f_9();
diff --git a/test/mjsunit/ignition/regress-599001-verifyheap.js b/test/mjsunit/ignition/regress-599001-verifyheap.js
new file mode 100644
index 0000000..5aa2efd
--- /dev/null
+++ b/test/mjsunit/ignition/regress-599001-verifyheap.js
@@ -0,0 +1,17 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --verify-heap --expose-gc
+
+// Tests that verify heap works for BytecodeArrays in the large object space.
+
+// Creates a list of variable declarations and calls it through eval to
+// generate a large BytecodeArray.
+var s = "";
+for (var i = 0; i < 65535; i++) {
+ s += ("var a" + i + ";");
+}
+
+(function() { eval(s); })();
+gc();
diff --git a/test/mjsunit/ignition/tracing.js b/test/mjsunit/ignition/tracing.js
new file mode 100644
index 0000000..70fb092
--- /dev/null
+++ b/test/mjsunit/ignition/tracing.js
@@ -0,0 +1,325 @@
+// Copyright 2011 the V8 project authors. All rights reserved.
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are
+// met:
+//
+// * Redistributions of source code must retain the above copyright
+// notice, this list of conditions and the following disclaimer.
+// * Redistributions in binary form must reproduce the above
+// copyright notice, this list of conditions and the following
+// disclaimer in the documentation and/or other materials provided
+// with the distribution.
+// * Neither the name of Google Inc. nor the names of its
+// contributors may be used to endorse or promote products derived
+// from this software without specific prior written permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+// Flags: --trace-ignition
+
+// Test tracing doesn't crash or leak. Not explicitly pattern matching.
+function f() {
+ var values = [];
+ var x = 10000000;
+ var y = x + 1;
+ var _aa;
+ var _ab;
+ var _ac;
+ var _ad;
+ var _ae;
+ var _af;
+ var _ag;
+ var _ah;
+ var _ai;
+ var _aj;
+ var _ak;
+ var _al;
+ var _am;
+ var _an;
+ var _ao;
+ var _ap;
+ var _ba;
+ var _bb;
+ var _bc;
+ var _bd;
+ var _be;
+ var _bf;
+ var _bg;
+ var _bh;
+ var _bi;
+ var _bj;
+ var _bk;
+ var _bl;
+ var _bm;
+ var _bn;
+ var _bo;
+ var _bp;
+ var _ca;
+ var _cb;
+ var _cc;
+ var _cd;
+ var _ce;
+ var _cf;
+ var _cg;
+ var _ch;
+ var _ci;
+ var _cj;
+ var _ck;
+ var _cl;
+ var _cm;
+ var _cn;
+ var _co;
+ var _cp;
+ var _da;
+ var _db;
+ var _dc;
+ var _dd;
+ var _de;
+ var _df;
+ var _dg;
+ var _dh;
+ var _di;
+ var _dj;
+ var _dk;
+ var _dl;
+ var _dm;
+ var _dn;
+ var _do;
+ var _dp;
+ var _ea;
+ var _eb;
+ var _ec;
+ var _ed;
+ var _ee;
+ var _ef;
+ var _eg;
+ var _eh;
+ var _ei;
+ var _ej;
+ var _ek;
+ var _el;
+ var _em;
+ var _en;
+ var _eo;
+ var _ep;
+ var _fa;
+ var _fb;
+ var _fc;
+ var _fd;
+ var _fe;
+ var _ff;
+ var _fg;
+ var _fh;
+ var _fi;
+ var _fj;
+ var _fk;
+ var _fl;
+ var _fm;
+ var _fn;
+ var _fo;
+ var _fp;
+ var _ga;
+ var _gb;
+ var _gc;
+ var _gd;
+ var _ge;
+ var _gf;
+ var _gg;
+ var _gh;
+ var _gi;
+ var _gj;
+ var _gk;
+ var _gl;
+ var _gm;
+ var _gn;
+ var _go;
+ var _gp;
+ var _ha;
+ var _hb;
+ var _hc;
+ var _hd;
+ var _he;
+ var _hf;
+ var _hg;
+ var _hh;
+ var _hi;
+ var _hj;
+ var _hk;
+ var _hl;
+ var _hm;
+ var _hn;
+ var _ho;
+ var _hp;
+ var _ia;
+ var _ib;
+ var _ic;
+ var _id;
+ var _ie;
+ var _if;
+ var _ig;
+ var _ih;
+ var _ii;
+ var _ij;
+ var _ik;
+ var _il;
+ var _im;
+ var _in;
+ var _io;
+ var _ip;
+ var _ja;
+ var _jb;
+ var _jc;
+ var _jd;
+ var _je;
+ var _jf;
+ var _jg;
+ var _jh;
+ var _ji;
+ var _jj;
+ var _jk;
+ var _jl;
+ var _jm;
+ var _jn;
+ var _jo;
+ var _jp;
+ var _ka;
+ var _kb;
+ var _kc;
+ var _kd;
+ var _ke;
+ var _kf;
+ var _kg;
+ var _kh;
+ var _ki;
+ var _kj;
+ var _kk;
+ var _kl;
+ var _km;
+ var _kn;
+ var _ko;
+ var _kp;
+ var _la;
+ var _lb;
+ var _lc;
+ var _ld;
+ var _le;
+ var _lf;
+ var _lg;
+ var _lh;
+ var _li;
+ var _lj;
+ var _lk;
+ var _ll;
+ var _lm;
+ var _ln;
+ var _lo;
+ var _lp;
+ var _ma;
+ var _mb;
+ var _mc;
+ var _md;
+ var _me;
+ var _mf;
+ var _mg;
+ var _mh;
+ var _mi;
+ var _mj;
+ var _mk;
+ var _ml;
+ var _mm;
+ var _mn;
+ var _mo;
+ var _mp;
+ var _na;
+ var _nb;
+ var _nc;
+ var _nd;
+ var _ne;
+ var _nf;
+ var _ng;
+ var _nh;
+ var _ni;
+ var _nj;
+ var _nk;
+ var _nl;
+ var _nm;
+ var _nn;
+ var _no;
+ var _np;
+ var _oa;
+ var _ob;
+ var _oc;
+ var _od;
+ var _oe;
+ var _of;
+ var _og;
+ var _oh;
+ var _oi;
+ var _oj;
+ var _ok;
+ var _ol;
+ var _om;
+ var _on;
+ var _oo;
+ var _op;
+ var _pa;
+ var _pb;
+ var _pc;
+ var _pd;
+ var _pe;
+ var _pf;
+ var _pg;
+ var _ph;
+ var _pi;
+ var _pj;
+ var _pk;
+ var _pl;
+ var _pm;
+ var _pn;
+ var _po;
+ var _pp;
+ var _qa;
+ var _qb;
+ var _qc;
+ var _qd;
+ var _qe;
+ var _qf;
+ var _qg;
+ var _qh;
+ var _qi;
+ var _qj;
+ var _qk;
+ var _ql;
+ var _qm;
+ var _qn;
+ var _qo;
+ var _qp;
+ var _ra;
+ var _rb;
+ var _rc;
+ var _rd;
+ var _re;
+ var _rf;
+ var _rg;
+ var _rh;
+ var _ri;
+ var _rj;
+ var _rk;
+ var _rl;
+ var _rm;
+ var _rn;
+ var _ro;
+ var _rp = 287; values[_rp] = _rp;
+};
+
+f();
diff --git a/test/mjsunit/json-stringify-stack.js b/test/mjsunit/json-stringify-stack.js
new file mode 100644
index 0000000..3048f89
--- /dev/null
+++ b/test/mjsunit/json-stringify-stack.js
@@ -0,0 +1,8 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+Object.defineProperty(Object.prototype, "length", {set() { throw "error" }});
+Object.defineProperty(Object.prototype, "values", {set() { throw "error" }});
+
+JSON.stringify({}, v=>v);
diff --git a/test/mjsunit/lookup-behind-property.js b/test/mjsunit/lookup-behind-property.js
new file mode 100644
index 0000000..abf1a52
--- /dev/null
+++ b/test/mjsunit/lookup-behind-property.js
@@ -0,0 +1,6 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+var g = Realm.global(Realm.create());
+assertThrows(()=>g.toString());
diff --git a/test/mjsunit/math-ceil.js b/test/mjsunit/math-ceil.js
new file mode 100644
index 0000000..05794f4
--- /dev/null
+++ b/test/mjsunit/math-ceil.js
@@ -0,0 +1,78 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --max-semi-space-size=1 --allow-natives-syntax
+
+var test_id = 0;
+
+function testCeil(expect, input) {
+ var test = new Function('n',
+ '"' + (test_id++) + '";return Math.ceil(n)');
+ assertEquals(expect, test(input));
+ assertEquals(expect, test(input));
+ assertEquals(expect, test(input));
+ %OptimizeFunctionOnNextCall(test);
+ assertEquals(expect, test(input));
+
+ var test_double_input = new Function(
+ 'n',
+ '"' + (test_id++) + '";return Math.ceil(+n)');
+ assertEquals(expect, test_double_input(input));
+ assertEquals(expect, test_double_input(input));
+ assertEquals(expect, test_double_input(input));
+ %OptimizeFunctionOnNextCall(test_double_input);
+ assertEquals(expect, test_double_input(input));
+
+ var test_double_output = new Function(
+ 'n',
+ '"' + (test_id++) + '";return Math.ceil(n) + -0.0');
+ assertEquals(expect, test_double_output(input));
+ assertEquals(expect, test_double_output(input));
+ assertEquals(expect, test_double_output(input));
+ %OptimizeFunctionOnNextCall(test_double_output);
+ assertEquals(expect, test_double_output(input));
+
+ var test_via_floor = new Function(
+ 'n',
+ '"' + (test_id++) + '";return -Math.floor(-n)');
+ assertEquals(expect, test_via_floor(input));
+ assertEquals(expect, test_via_floor(input));
+ assertEquals(expect, test_via_floor(input));
+ %OptimizeFunctionOnNextCall(test_via_floor);
+ assertEquals(expect, test_via_floor(input));
+
+ if (input <= 0) {
+ var test_via_trunc = new Function(
+ 'n',
+ '"' + (test_id++) + '";return Math.trunc(n)');
+ assertEquals(expect, test_via_trunc(input));
+ assertEquals(expect, test_via_trunc(input));
+ assertEquals(expect, test_via_trunc(input));
+ %OptimizeFunctionOnNextCall(test_via_trunc);
+ assertEquals(expect, test_via_trunc(input));
+ }
+}
+
+function test() {
+ testCeil(0, 0);
+ testCeil(+0, +0);
+ testCeil(-0, -0);
+ testCeil(1, 0.49999);
+ testCeil(1, 0.6);
+ testCeil(1, 0.5);
+ testCeil(-0, -0.1);
+ testCeil(-0, -0.5);
+ testCeil(-0, -0.6);
+ testCeil(-1, -1.6);
+ testCeil(-0, -0.50001);
+ testCeil(Infinity, Infinity);
+ testCeil(-Infinity, -Infinity);
+}
+
+
+// Test in a loop to cover the custom IC and GC-related issues.
+for (var i = 0; i < 10; i++) {
+ test();
+ new Array(i * 10000);
+}
diff --git a/test/mjsunit/math-floor-part1.js b/test/mjsunit/math-floor-part1.js
index 65ae3c6..bad1edd 100644
--- a/test/mjsunit/math-floor-part1.js
+++ b/test/mjsunit/math-floor-part1.js
@@ -38,6 +38,15 @@
%OptimizeFunctionOnNextCall(test);
assertEquals(expect, test(input));
+ var test_double_input = new Function(
+ 'n',
+ '"' + (test_id++) + '";return Math.floor(+n)');
+ assertEquals(expect, test_double_input(input));
+ assertEquals(expect, test_double_input(input));
+ assertEquals(expect, test_double_input(input));
+ %OptimizeFunctionOnNextCall(test_double_input);
+ assertEquals(expect, test_double_input(input));
+
var test_double_output = new Function(
'n',
'"' + (test_id++) + '";return Math.floor(n) + -0.0');
@@ -46,6 +55,26 @@
assertEquals(expect, test_double_output(input));
%OptimizeFunctionOnNextCall(test_double_output);
assertEquals(expect, test_double_output(input));
+
+ var test_via_ceil = new Function(
+ 'n',
+ '"' + (test_id++) + '";return -Math.ceil(-n)');
+ assertEquals(expect, test_via_ceil(input));
+ assertEquals(expect, test_via_ceil(input));
+ assertEquals(expect, test_via_ceil(input));
+ %OptimizeFunctionOnNextCall(test_via_ceil);
+ assertEquals(expect, test_via_ceil(input));
+
+ if (input >= 0) {
+ var test_via_trunc = new Function(
+ 'n',
+ '"' + (test_id++) + '";return Math.trunc(n)');
+ assertEquals(expect, test_via_trunc(input));
+ assertEquals(expect, test_via_trunc(input));
+ assertEquals(expect, test_via_trunc(input));
+ %OptimizeFunctionOnNextCall(test_via_trunc);
+ assertEquals(expect, test_via_trunc(input));
+ }
}
function zero() {
diff --git a/test/mjsunit/math-floor-part2.js b/test/mjsunit/math-floor-part2.js
index 6004570..eab3ab3 100644
--- a/test/mjsunit/math-floor-part2.js
+++ b/test/mjsunit/math-floor-part2.js
@@ -38,6 +38,15 @@
%OptimizeFunctionOnNextCall(test);
assertEquals(expect, test(input));
+ var test_double_input = new Function(
+ 'n',
+ '"' + (test_id++) + '";return Math.floor(+n)');
+ assertEquals(expect, test_double_input(input));
+ assertEquals(expect, test_double_input(input));
+ assertEquals(expect, test_double_input(input));
+ %OptimizeFunctionOnNextCall(test_double_input);
+ assertEquals(expect, test_double_input(input));
+
var test_double_output = new Function(
'n',
'"' + (test_id++) + '";return Math.floor(n) + -0.0');
@@ -46,6 +55,26 @@
assertEquals(expect, test_double_output(input));
%OptimizeFunctionOnNextCall(test_double_output);
assertEquals(expect, test_double_output(input));
+
+ var test_via_ceil = new Function(
+ 'n',
+ '"' + (test_id++) + '";return -Math.ceil(-n)');
+ assertEquals(expect, test_via_ceil(input));
+ assertEquals(expect, test_via_ceil(input));
+ assertEquals(expect, test_via_ceil(input));
+ %OptimizeFunctionOnNextCall(test_via_ceil);
+ assertEquals(expect, test_via_ceil(input));
+
+ if (input >= 0) {
+ var test_via_trunc = new Function(
+ 'n',
+ '"' + (test_id++) + '";return Math.trunc(n)');
+ assertEquals(expect, test_via_trunc(input));
+ assertEquals(expect, test_via_trunc(input));
+ assertEquals(expect, test_via_trunc(input));
+ %OptimizeFunctionOnNextCall(test_via_trunc);
+ assertEquals(expect, test_via_trunc(input));
+ }
}
function zero() {
diff --git a/test/mjsunit/math-floor-part3.js b/test/mjsunit/math-floor-part3.js
index 9225c38..6a53665 100644
--- a/test/mjsunit/math-floor-part3.js
+++ b/test/mjsunit/math-floor-part3.js
@@ -38,6 +38,15 @@
%OptimizeFunctionOnNextCall(test);
assertEquals(expect, test(input));
+ var test_double_input = new Function(
+ 'n',
+ '"' + (test_id++) + '";return Math.floor(+n)');
+ assertEquals(expect, test_double_input(input));
+ assertEquals(expect, test_double_input(input));
+ assertEquals(expect, test_double_input(input));
+ %OptimizeFunctionOnNextCall(test_double_input);
+ assertEquals(expect, test_double_input(input));
+
var test_double_output = new Function(
'n',
'"' + (test_id++) + '";return Math.floor(n) + -0.0');
@@ -46,6 +55,26 @@
assertEquals(expect, test_double_output(input));
%OptimizeFunctionOnNextCall(test_double_output);
assertEquals(expect, test_double_output(input));
+
+ var test_via_ceil = new Function(
+ 'n',
+ '"' + (test_id++) + '";return -Math.ceil(-n)');
+ assertEquals(expect, test_via_ceil(input));
+ assertEquals(expect, test_via_ceil(input));
+ assertEquals(expect, test_via_ceil(input));
+ %OptimizeFunctionOnNextCall(test_via_ceil);
+ assertEquals(expect, test_via_ceil(input));
+
+ if (input >= 0) {
+ var test_via_trunc = new Function(
+ 'n',
+ '"' + (test_id++) + '";return Math.trunc(n)');
+ assertEquals(expect, test_via_trunc(input));
+ assertEquals(expect, test_via_trunc(input));
+ assertEquals(expect, test_via_trunc(input));
+ %OptimizeFunctionOnNextCall(test_via_trunc);
+ assertEquals(expect, test_via_trunc(input));
+ }
}
function zero() {
diff --git a/test/mjsunit/math-floor-part4.js b/test/mjsunit/math-floor-part4.js
index ade36a9..9ae83d8 100644
--- a/test/mjsunit/math-floor-part4.js
+++ b/test/mjsunit/math-floor-part4.js
@@ -38,6 +38,15 @@
%OptimizeFunctionOnNextCall(test);
assertEquals(expect, test(input));
+ var test_double_input = new Function(
+ 'n',
+ '"' + (test_id++) + '";return Math.floor(+n)');
+ assertEquals(expect, test_double_input(input));
+ assertEquals(expect, test_double_input(input));
+ assertEquals(expect, test_double_input(input));
+ %OptimizeFunctionOnNextCall(test_double_input);
+ assertEquals(expect, test_double_input(input));
+
var test_double_output = new Function(
'n',
'"' + (test_id++) + '";return Math.floor(n) + -0.0');
@@ -46,6 +55,26 @@
assertEquals(expect, test_double_output(input));
%OptimizeFunctionOnNextCall(test_double_output);
assertEquals(expect, test_double_output(input));
+
+ var test_via_ceil = new Function(
+ 'n',
+ '"' + (test_id++) + '";return -Math.ceil(-n)');
+ assertEquals(expect, test_via_ceil(input));
+ assertEquals(expect, test_via_ceil(input));
+ assertEquals(expect, test_via_ceil(input));
+ %OptimizeFunctionOnNextCall(test_via_ceil);
+ assertEquals(expect, test_via_ceil(input));
+
+ if (input >= 0) {
+ var test_via_trunc = new Function(
+ 'n',
+ '"' + (test_id++) + '";return Math.trunc(n)');
+ assertEquals(expect, test_via_trunc(input));
+ assertEquals(expect, test_via_trunc(input));
+ assertEquals(expect, test_via_trunc(input));
+ %OptimizeFunctionOnNextCall(test_via_trunc);
+ assertEquals(expect, test_via_trunc(input));
+ }
}
function zero() {
diff --git a/test/mjsunit/messages.js b/test/mjsunit/messages.js
index 7deef02..8796d05 100644
--- a/test/mjsunit/messages.js
+++ b/test/mjsunit/messages.js
@@ -2,8 +2,8 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --stack-size=100 --harmony --harmony-reflect --harmony-regexps
-// Flags: --harmony-simd
+// Flags: --stack-size=100 --harmony
+// Flags: --harmony-simd --harmony-instanceof
function test(f, expected, type) {
try {
@@ -150,7 +150,7 @@
// kInstanceofFunctionExpected
test(function() {
1 instanceof 1;
-}, "Expecting an object in instanceof check", TypeError);
+}, "Right-hand side of 'instanceof' is not an object", TypeError);
// kInstanceofNonobjectProto
test(function() {
@@ -339,6 +339,11 @@
eval("/a/x.test(\"a\");");
}, "Invalid regular expression flags", SyntaxError);
+// kInvalidOrUnexpectedToken
+test(function() {
+ eval("'\n'");
+}, "Invalid or unexpected token", SyntaxError);
+
//kJsonParseUnexpectedEOS
test(function() {
JSON.parse("{")
diff --git a/test/mjsunit/mirror-function.js b/test/mjsunit/mirror-function.js
index cda815d..88106a2 100644
--- a/test/mjsunit/mirror-function.js
+++ b/test/mjsunit/mirror-function.js
@@ -88,3 +88,4 @@
testFunctionMirror(function(){});
testFunctionMirror(function a(){return 1;});
testFunctionMirror(Math.sin);
+testFunctionMirror((function(){}).bind({}), "Object");
diff --git a/test/mjsunit/mirror-regexp.js b/test/mjsunit/mirror-regexp.js
index 882af8d..7aae1c6 100644
--- a/test/mjsunit/mirror-regexp.js
+++ b/test/mjsunit/mirror-regexp.js
@@ -25,7 +25,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --expose-debug-as debug --harmony-regexps --harmony-unicode-regexps
+// Flags: --expose-debug-as debug --harmony-unicode-regexps
// Test the mirror object for regular expression values
var dont_enum = debug.PropertyAttribute.DontEnum;
diff --git a/test/mjsunit/mirror-script.js b/test/mjsunit/mirror-script.js
index 7642839..ed0dd12 100644
--- a/test/mjsunit/mirror-script.js
+++ b/test/mjsunit/mirror-script.js
@@ -84,7 +84,7 @@
// Test the script mirror for different functions.
testScriptMirror(function(){}, 'mirror-script.js', 99, 2, 0);
-testScriptMirror(Math.round, 'native math.js', -1, 0, 0);
+testScriptMirror(Math.abs, 'native math.js', -1, 0, 0);
testScriptMirror(eval('(function(){})'), null, 1, 2, 1, '(function(){})', 87);
testScriptMirror(eval('(function(){\n })'), null, 2, 2, 1, '(function(){\n })', 88);
diff --git a/test/mjsunit/mjsunit.status b/test/mjsunit/mjsunit.status
index cbeee7f..6d786f9 100644
--- a/test/mjsunit/mjsunit.status
+++ b/test/mjsunit/mjsunit.status
@@ -43,9 +43,6 @@
# This test non-deterministically runs out of memory on Windows ia32.
'regress/regress-crbug-160010': [SKIP],
- # Issue 4698: not fully supported by Turbofan yet
- 'es6/tail-call': [PASS, NO_VARIANTS],
-
# Issue 3389: deopt_every_n_garbage_collections is unsafe
'regress/regress-2653': [SKIP],
@@ -83,17 +80,6 @@
'regress/regress-2185-2': [PASS, NO_VARIANTS],
'regress/regress-2612': [PASS, NO_VARIANTS],
- # Modules are busted
- 'harmony/module-linking': [SKIP],
- 'harmony/module-recompile': [SKIP],
- 'harmony/module-resolution': [SKIP],
- 'harmony/regress/regress-343928': [SKIP],
-
- # Proxy tests rely on non ES6 version of Proxies
- # TODO(neis,cbruni): figure out which Proxy tests can be reused
- 'harmony/proxies-example-membrane': [SKIP],
- 'strong/load-proxy': [SKIP],
-
# Issue 3660: Replacing activated TurboFan frames by unoptimized code does
# not work, but we expect it to not crash.
'debug-step-turbofan': [PASS, FAIL],
@@ -121,20 +107,6 @@
'debug-listbreakpoints': [PASS, NO_VARIANTS], # arm64 nosnap with turbofan
'debug-enable-disable-breakpoints': [PASS, NO_VARIANTS], #arm64 nosnap with turbofan.
- # Issue 3956: Strong mode is deprecating. The expectations inside the
- # following tests should be updated once deprecation is complete.
- 'strong/destructuring': [SKIP],
- 'strong/implicit-conversions': [SKIP],
- 'strong/implicit-conversions-count': [SKIP],
- 'strong/implicit-conversions-inlining': [SKIP],
- 'strong/load-builtins': [SKIP],
- 'strong/load-element': [SKIP],
- 'strong/load-element-mutate-backing-store': [SKIP],
- 'strong/load-property': [SKIP],
- 'strong/load-property-mutate-backing-store': [SKIP],
- 'strong/load-super': [SKIP],
- 'strong/literals': [SKIP], # Rest arguments do not respect strongness in Turbofan.
-
# Issue 4035: unexpected frame->context() in debugger
'regress/regress-crbug-107996': [PASS, NO_VARIANTS],
'regress/regress-crbug-171715': [PASS, NO_VARIANTS],
@@ -177,6 +149,10 @@
# issue 4078:
'allocation-site-info': [PASS, NO_VARIANTS],
+ # TODO(turbofan): The escape analysis needs some investigation.
+ 'compiler/escape-analysis-deopt-5': [PASS, NO_VARIANTS],
+ 'compiler/escape-analysis-9': [PASS, NO_VARIANTS],
+
##############################################################################
# Too slow in debug mode with --stress-opt mode.
'compiler/regress-stacktrace-methods': [PASS, ['mode == debug', SKIP]],
@@ -277,17 +253,10 @@
'asm/poppler/*': [PASS, SLOW, FAST_VARIANTS],
'asm/sqlite3/*': [PASS, SLOW, FAST_VARIANTS],
- # BUG(v8:3838).
- 'regress/regress-3116': [PASS, ['isolates', FLAKY]],
-
# BUG(v8:4458). TODO(mvstanton): reenable the test once --vector-stores is
# prermanently enabled.
'call-counts': [SKIP],
- # BUG(chromium:508074). Remove this once the issue is fixed.
- 'harmony/arrow-rest-params': [PASS, NO_VARIANTS],
- 'harmony/rest-params': [PASS, ['no_snap == True', NO_VARIANTS]],
-
# Slow tests.
'copy-on-write-assert': [PASS, SLOW],
'debug-scopes': [PASS, SLOW],
@@ -296,16 +265,30 @@
'readonly': [PASS, SLOW],
'regress/regress-1200351': [PASS, ['mode == debug', SLOW]],
'regress/regress-crbug-474297': [PASS, ['mode == debug', SLOW]],
+ 'es6/tail-call-megatest*': [PASS, FAST_VARIANTS],
- # TODO(titzer): correct WASM adapter frame alignment on arm64
- 'wasm/*': [PASS, ['arch == arm64', SKIP]],
- 'wasm/asm-wasm': [PASS, ['arch == arm or arch == arm64', SKIP]],
+ # TODO(titzer): ASM->WASM tests on these platforms
+ 'wasm/asm-wasm': [PASS, ['arch in [arm, arm64, mips, mipsel, mips64, mips64el]', SKIP]],
+ # TODO(branelson): Figure out why ignition + asm-wasm-stdlib fails.
+ 'wasm/asm-wasm-stdlib': [PASS, ['arch in [arm, arm64, mips, mipsel, mips64, mips64el] or ignition == True', SKIP]],
+ 'wasm/asm-wasm-literals': [PASS, ['arch in [arm, arm64, mips, mipsel, mips64, mips64el] or ignition == True', SKIP]],
+ 'wasm/asm-wasm-copy': [PASS, ['arch in [arm, arm64, mips, mipsel, mips64, mips64el]', SKIP]],
+ 'wasm/asm-wasm-deopt': [PASS, ['arch in [arm, arm64, mips, mipsel, mips64, mips64el]', SKIP]],
+
+ # TODO(branelson): Figure out why ignition + asm->wasm fails embenchen.
+ 'wasm/embenchen/*': [PASS, ['arch == arm64', SKIP], ['ignition == True', SKIP]],
+
+ # TODO(bradnelson) Fix and re-enable.
+ 'wasm/embenchen/box2d': [SKIP], # hang
+ 'wasm/embenchen/lua_binarytrees': [SKIP], # fails decode
+ #'wasm/embenchen/zlib': [SKIP], # fails gc-stress
# case-insensitive unicode regexp relies on case mapping provided by ICU.
'harmony/unicode-regexp-ignore-case': [PASS, ['no_i18n == True', FAIL]],
'harmony/unicode-regexp-ignore-case-noi18n': [FAIL, ['no_i18n == True', PASS]],
+ 'regress/regress-5036': [PASS, ['no_i18n == True', FAIL]],
# desugaring regexp property class relies on ICU.
- 'harmony/unicode-regexp-property-class': [PASS, ['no_i18n == True', FAIL]],
+ 'harmony/regexp-property-*': [PASS, ['no_i18n == True', FAIL]],
}], # ALWAYS
['novfp3 == True', {
@@ -371,9 +354,6 @@
# BUG(v8:4237)
'regress/regress-3976': [SKIP],
- # BUG(v8:4359)
- 'strong/load-proxy': [SKIP],
-
# Slow tests.
'array-constructor': [PASS, SLOW],
'json': [PASS, SLOW],
@@ -385,6 +365,9 @@
# BUG(v8:4754).
'debug-referenced-by': [PASS, NO_VARIANTS],
+
+ # BUG(v8:4779): Crashes flakily with stress mode on arm64.
+ 'array-splice': [PASS, SLOW, ['arch == arm64', FAST_VARIANTS]],
}], # 'gc_stress == True'
##############################################################################
@@ -401,6 +384,8 @@
'asm/sqlite3/*': [SKIP],
# TODO(mips-team): Fix Wasm for big-endian.
'wasm/*': [SKIP],
+ 'regress/regress-599717': [SKIP],
+ 'regress/regress-599719': [SKIP],
}], # 'byteorder == big'
##############################################################################
@@ -484,7 +469,6 @@
'packed-elements': [SKIP],
'regexp-global': [SKIP],
'compiler/alloc-numbers': [SKIP],
- 'harmony/symbols': [SKIP],
'math-floor-of-div': [PASS, TIMEOUT],
'math-floor-of-div-nosudiv': [PASS, TIMEOUT],
'unicodelctest': [PASS, TIMEOUT],
@@ -688,7 +672,6 @@
'debug-liveedit-stack-padding': [SKIP],
'debug-liveedit-restart-frame': [SKIP],
'debug-liveedit-double-call': [SKIP],
- 'harmony/generators-debug-liveedit': [SKIP],
# NaCl builds have problems with this test since Pepper_28.
# V8 Issue 2786
@@ -725,10 +708,19 @@
# Crashes.
'harmony/private': [SKIP],
- 'harmony/symbols': [SKIP],
}], # 'arch == nacl_ia32 or arch == nacl_x64'
##############################################################################
+['arch == s390 or arch == s390x', {
+
+ # Stack manipulations in LiveEdit is not implemented for this arch.
+ 'debug-liveedit-check-stack': [SKIP],
+ 'debug-liveedit-stack-padding': [SKIP],
+ 'debug-liveedit-restart-frame': [SKIP],
+ 'debug-liveedit-double-call': [SKIP],
+}], # 'arch == s390 or arch == s390x'
+
+##############################################################################
['deopt_fuzzer == True', {
# Skip tests that are not suitable for deoptimization fuzzing.
@@ -746,6 +738,9 @@
# Deopt every n garbage collections collides with deopt every n times.
'regress/regress-2653': [SKIP],
+
+ # Too slow.
+ 'es6/tail-call-megatest*': [SKIP],
}], # 'deopt_fuzzer == True'
##############################################################################
@@ -763,160 +758,160 @@
'regress/regress-1132': [SKIP],
}], # 'arch == ppc and simulator_run == True'
+##############################################################################
['ignition == True', {
- # Skip strong mode tests since strong mode is unsupported on ignition.
- 'strong/*': [SKIP],
-
- # TODO(yangguo,4690): Requires debugger support.
- 'es6/debug*': [SKIP],
- 'harmony/debug*': [SKIP],
- 'regress/debug*': [SKIP],
- 'regress/regress-debug*': [SKIP],
-
# TODO(yangguo,4690): assertion failures in debugger tests.
'debug-allscopes-on-debugger': [FAIL],
+ 'es6/debug-stepnext-for': [FAIL],
+ 'es6/debug-promises/stepin-constructor': [FAIL],
+ 'es6/debug-stepin-proxies': [FAIL],
+ 'regress/regress-crbug-119800': [FAIL],
+ 'regress/regress-opt-after-debug-deopt': [FAIL],
+
+ # TODO(yangguo,4690): flaky failures on the bots.
+ 'debug-stepin-builtin-callback-opt': [SKIP],
+
+ # TODO(rmcilroy,4765): assertion failures in LiveEdit tests.
'debug-liveedit-restart-frame': [FAIL],
- 'debug-return-value': [FAIL],
'debug-liveedit-literals': [FAIL],
'debug-liveedit-3': [FAIL],
'debug-liveedit-1': [FAIL],
- 'debug-step-into-json': [FAIL],
+ 'debug-liveedit-2': [FAIL],
'debug-liveedit-patch-positions-replace': [FAIL],
- 'debug-step-into-valueof': [FAIL],
'debug-liveedit-patch-positions': [FAIL],
'debug-liveedit-stepin': [FAIL],
- 'debug-step-4': [FAIL],
'debug-liveedit-newsource': [FAIL],
'debug-liveedit-stack-padding': [FAIL],
- 'debug-stepframe': [FAIL],
- 'debug-negative-break-points': [FAIL],
- 'debug-stepin-accessor': [FAIL],
- 'debug-step-stub-callfunction': [FAIL],
'debug-liveedit-breakpoints': [FAIL],
- 'debug-stepin-accessor-ic': [FAIL],
- 'debug-stepin-builtin': [FAIL],
- 'debug-stepin-foreach': [FAIL],
- 'debug-stepnext-do-while': [FAIL],
- 'debug-stepin-builtin-callback-opt': [FAIL],
- 'debug-stepin-function-call': [FAIL],
-
- # TODO(yangguo,4690): Check failure in debug.cc BreakLocation::SetBreakPoint
- # DCHECK(IsDebugBreak() || IsDebuggerStatement());
- 'regress/regress-1523': [FAIL],
- 'regress/regress-102153': [FAIL],
- 'regress/regress-2825': [FAIL],
- 'regress/regress-crbug-119800': [FAIL],
- 'regress/regress-crbug-467180': [FAIL],
- 'regress/regress-opt-after-debug-deopt': [FAIL],
-
- # TODO(rmcilroy,4681): Requires support for generators.
- 'messages': [FAIL],
- 'es6/array-from': [FAIL],
- 'regress-3225': [FAIL],
- 'es6/classes-subclass-builtins': [FAIL],
- 'es6/computed-property-names-classes': [FAIL],
- 'es6/computed-property-names-object-literals-methods': [FAIL],
- 'es6/function-length-configurable': [FAIL],
- 'es6/generators-poisoned-properties': [FAIL],
- 'es6/generators-runtime': [FAIL],
- 'es6/generators-objects': [FAIL],
- 'es6/generators-parsing': [FAIL],
- 'es6/generators-iteration': [FAIL],
- 'es6/generators-states': [FAIL],
- 'es6/iteration-semantics': [FAIL],
- 'es6/iterator-prototype': [FAIL],
- 'es6/generators-mirror': [FAIL],
- 'es6/object-literals-method': [FAIL],
- 'es6/object-literals-super': [FAIL],
- 'es6/generators-relocation': [FAIL],
- 'es6/spread-array': [FAIL],
+ 'es6/debug-liveedit-new-target-1': [FAIL],
+ 'es6/debug-liveedit-new-target-2': [FAIL],
+ 'es6/debug-liveedit-new-target-3': [FAIL],
'es6/generators-debug-liveedit': [FAIL],
- 'es6/spread-call': [FAIL],
- 'es6/typedarray-from': [FAIL],
- 'es6/typedarray': [FAIL],
- 'es6/regress/regress-2681': [FAIL],
- 'es6/regress/regress-2691': [FAIL],
- 'es6/regress/regress-3280': [FAIL],
- 'harmony/destructuring-assignment': [FAIL],
- 'harmony/function-sent': [FAIL],
- 'harmony/reflect-enumerate-delete': [FAIL],
- 'harmony/reflect-enumerate-special-cases': [FAIL],
- 'harmony/proxies-enumerate': [FAIL],
- 'harmony/reflect-enumerate-opt': [FAIL],
- 'harmony/reflect-enumerate': [FAIL],
- 'harmony/destructuring': [FAIL],
- 'harmony/regress/regress-4482': [FAIL],
- 'harmony/generators': [FAIL],
- 'harmony/iterator-close': [FAIL],
- 'harmony/reflect-construct': [FAIL],
- 'es6/promises': [FAIL],
- # TODO(rmcilroy,4680): Check failed in
- # BytecodeGenerator::VisitFunctionLiteral - !shared_info.is_null().
- 'regress/regress-crbug-429159': [FAIL],
-
- # TODO(rmcilroy,4680): Pass on debug, fail on release.
- 'compiler/regress-stacktrace-methods': [PASS, ['mode == release', FAIL]],
-
- # TODO(rmcilroy,4680): Test assert failures.
+ # TODO(mythria, 4780): Related to type feedback for calls in interpreter.
'array-literal-feedback': [FAIL],
- 'undetectable-compare': [FAIL],
- 'debug-liveedit-2': [FAIL],
- 'es6/string-search': [FAIL],
- 'es6/mirror-collections': [FAIL],
- 'es6/regress/regress-468661': [FAIL],
- 'harmony/string-replace': [FAIL],
- 'harmony/string-match': [FAIL],
- 'harmony/string-split': [FAIL],
- 'regress/regress-2618': [FAIL],
'regress/regress-4121': [FAIL],
- 'regress/regress-4266': [FAIL],
- 'harmony/simd': [FAIL],
- 'regress/regress-crbug-109362': [FAIL],
- 'regress/regress-crbug-568477-2': [FAIL],
- 'regress/regress-crbug-568477-3': [FAIL],
- 'regress/regress-crbug-568477-1': [FAIL],
- 'regress/regress-2318': [FAIL],
- # TODO(rmcilroy, 4680): new ES6 instanceof support
- 'harmony/instanceof-es6': [SKIP],
-
- # TODO(rmcilroy,4680): Test timeouts.
+ # TODO(mythria, 4764): lack of osr support.
+ 'regress/regress-2618': [FAIL],
+ # TODO(mythria, 4764): lack of osr support. The tests waits in a loop
+ # till it is optimized. So test timeouts.
'array-literal-transitions': [SKIP],
- 'regress/regress-crbug-517592': [SKIP],
- 'regress/regress-crbug-568477-4': [SKIP],
- 'regress/regress-crbug-409614': [SKIP],
- 'regress/regress-crbug-42414': [SKIP],
- 'regress/regress-1853': [SKIP],
- 'regress/regress-crbug-424142': [SKIP],
+
+ # TODO(mythria, 4680): Relate to GC and ignition holding references to
+ # objects.
+ 'es6/mirror-collections': [FAIL],
+
+ # TODO(mythria, 4680): Fails with context_register_count_ > 0 (0 vs. 0) when
+ # trying to get a context register in BytecodeGenerator.
+ 'harmony/regress/regress-4658': [FAIL, ['mode == release and dcheck_always_on == False', PASS],],
+
+ # TODO(rmcilroy, 4680): Script throws RangeError as expected, but does so during
+ # eager compile of the whole script instead of during lazy compile of the function
+ # f(), so we can't catch the exception in the try/catch. Skip because on some
+ # platforms the stack limit is different and the exception doesn't fire.
+ 'regress/regress-crbug-589472': [SKIP],
+
+ # Debugger test cases that pass with ignition, but not full-codegen.
+ # These differences between full-codegen and ignition are deliberate.
+ 'ignition/elided-instruction-no-ignition': [FAIL],
+
+ 'wasm/asm-wasm-f32': [PASS, ['arch in [arm64]', SKIP]],
+ 'wasm/asm-wasm-f64': [PASS, ['arch in [arm64]', SKIP]],
}], # ignition == True
+['ignition == True and system == windows', {
+ # TODO(rmcilroy,4680): Crash on windows nosnap shared.
+ 'regress/regress-crbug-352058': [PASS, ['no_snap == True', SKIP]],
+
+ # TODO(513471): Attempting to optimize generator hits unreachable path.
+ 'regress/regress-crbug-513471': [PASS, ['no_snap == True', SKIP]],
+
+ # TODO(rmcilroy,4680): Fails on win32 debug.
+ 'div-mod': [PASS, ['arch == ia32', SKIP]],
+}], # ignition == True and system == windows
+
['ignition == True and arch == arm64', {
- # TODO(rmcilroy,4680): Fails on Arm64 due to expecting to take less than 3
- # seconds.
- 'regress/regress-165637': [FAIL],
+ # TODO(rmcilroy,4680): Arm64 specific timeouts.
+ 'asm/construct-double': [SKIP],
+ 'compiler/osr-one': [SKIP],
+ 'compiler/osr-two': [SKIP],
+ 'wasm/asm-wasm-i32': [SKIP],
+ 'wasm/asm-wasm-u32': [SKIP],
}], # ignition == True and arch == arm64
-['ignition == True and (arch == arm or arch == arm64)', {
- # TODO(rmcilroy,4680): Arm / Arm64 specific timeouts.
- 'asm/construct-double': [SKIP],
- 'compiler/osr-nested': [SKIP],
+['ignition == True and arch == arm', {
+ # TODO(rmcilroy,4680): Arm specific timeouts.
'compiler/osr-one': [SKIP],
'compiler/osr-two': [SKIP],
'regress/regress-1257': [SKIP],
- 'regress/regress-165637': [SKIP],
- 'regress/regress-2185': [SKIP],
- 'regress/regress-91008': [SKIP],
- 'unicodelctest': [SKIP],
- 'unicodelctest-no-optimization': [SKIP],
-}], # ignition == True and (arch == arm or arch == arm64)
+}], # ignition == True and arch == arm
+
+['ignition == True and msan', {
+ # TODO(mythria,4680): All of these tests have large loops and hence slow
+ # and timeout.
+ 'compiler/osr-big': [SKIP],
+ 'compiler/osr-nested': [SKIP],
+ 'regress/regress-298269': [SKIP],
+ 'regress/regress-crbug-319860': [SKIP],
+ 'regress/regress-deep-proto': [SKIP],
+ 'try': [SKIP],
+ # Too slow for interpreter and msan.
+ 'es6/tail-call-megatest*': [SKIP],
+}], # ignition == True and msan
+
+['ignition == True and gc_stress == True', {
+ # TODO(oth,4680): failures from the bots.
+ 'es6/debug-step-destructuring-bind': [SKIP],
+ 'es6/debug-stepin-collections-foreach': [SKIP],
+ 'ignition/elided-instruction': [SKIP],
+ 'regress/regress-269': [SKIP],
+}], # ignition == True and gc_stress == True
+
+['ignition == False', {
+ # Debugger test cases that pass with full-codegen, but not ignition.
+ # These differences between full-codegen and ignition are deliberate.
+ 'ignition/elided-instruction': [FAIL],
+}], # ignition == False
+
+['ignition == True and system == windows and no_snap', {
+ # TODO(rmcilroy): Fail with nosnap and shared libraries.
+ 'es6/array-from': [FAIL],
+ 'es6/classes-subclass-builtins': [FAIL],
+ 'es6/computed-property-names-classes': [FAIL],
+ 'es6/computed-property-names-object-literals-methods': [FAIL],
+ 'es6/debug-stepin-generators': [FAIL],
+ 'es6/destructuring': [FAIL],
+ 'es6/destructuring-assignment': [FAIL],
+ 'es6/generators-iteration': [FAIL],
+ 'es6/generators-mirror': [FAIL],
+ 'es6/generators-parsing': [FAIL],
+ 'es6/generators-poisoned-properties': [FAIL],
+ 'es6/generators-relocation': [FAIL],
+ 'es6/generators-states': [FAIL],
+ 'es6/iteration-semantics': [FAIL],
+ 'es6/object-literals-method': [FAIL],
+ 'es6/object-literals-super': [FAIL],
+ 'es6/promises': [FAIL],
+ 'es6/regress/regress-2681': [FAIL],
+ 'es6/regress/regress-2691': [FAIL],
+ 'es6/regress/regress-3280': [FAIL],
+ 'es6/spread-array': [FAIL],
+ 'es6/spread-call': [FAIL],
+ 'es6/typedarray': [FAIL],
+ 'es6/typedarray-from': [FAIL],
+ 'harmony/function-sent': [FAIL],
+ 'harmony/generators': [FAIL],
+ 'harmony/iterator-close': [FAIL],
+ 'harmony/regress/regress-4482': [FAIL],
+ 'messages': [FAIL],
+ 'regress-3225': [FAIL],
+}], # ignition == True and system == windows and no_snap
##############################################################################
['gcov_coverage', {
# Tests taking too long.
'array-functions-prototype-misc': [SKIP],
- 'strong/implicit-conversions': [SKIP],
- 'strong/load-element-mutate-backing-store': [SKIP],
# Stack overflow.
'big-array-literal': [SKIP],
diff --git a/test/mjsunit/object-literal.js b/test/mjsunit/object-literal.js
index 53188d1..19860ff 100644
--- a/test/mjsunit/object-literal.js
+++ b/test/mjsunit/object-literal.js
@@ -24,6 +24,8 @@
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+//
+// Flags: --harmony-function-name
var obj = {
a: 7,
@@ -218,7 +220,7 @@
assertEquals(expectedKeys, Object.keys(object));
expectedKeys.forEach(function(key) {
var descr = Object.getOwnPropertyDescriptor(object, key);
- assertEquals(key, descr.get.name);
+ assertEquals('get ' + key, descr.get.name);
});
}
TestNumericNamesGetter(['1', '2', '3', '4', '5', '6', '7', '8', '9'], {
@@ -242,7 +244,7 @@
assertEquals(expectedKeys, Object.keys(object));
expectedKeys.forEach(function(key) {
var descr = Object.getOwnPropertyDescriptor(object, key);
- assertEquals(key, descr.set.name);
+ assertEquals('set ' + key, descr.set.name);
});
}
TestNumericNamesSetter(['1', '2', '3', '4', '5', '6', '7', '8', '9'], {
diff --git a/test/mjsunit/parallel-optimize-disabled.js b/test/mjsunit/parallel-optimize-disabled.js
index 1dbce06..f8d5848 100644
--- a/test/mjsunit/parallel-optimize-disabled.js
+++ b/test/mjsunit/parallel-optimize-disabled.js
@@ -26,7 +26,7 @@
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
// Flags: --nodead-code-elimination --concurrent-recompilation
-// Flags: --allow-natives-syntax --legacy-const
+// Flags: --allow-natives-syntax
if (!%IsConcurrentRecompilationSupported()) {
print("Concurrent recompilation is disabled. Skipping this test.");
@@ -35,7 +35,8 @@
function g() { // g() cannot be optimized.
const x = 1;
- x++;
+ // TODO(adamk): Is this test still testing anything?
+ // x++;
}
function f(x) {
diff --git a/test/mjsunit/property-load-across-eval.js b/test/mjsunit/property-load-across-eval.js
index 222c0e9..808ac58 100644
--- a/test/mjsunit/property-load-across-eval.js
+++ b/test/mjsunit/property-load-across-eval.js
@@ -25,21 +25,15 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --legacy-const
-
// Tests loading of properties across eval calls.
var x = 1;
function global_function() { return 'global'; }
-const const_uninitialized;
-const const_initialized = function() { return "const_global"; }
// Test loading across an eval call that does not shadow variables.
function testNoShadowing() {
var y = 2;
function local_function() { return 'local'; }
- const local_const_uninitialized;
- const local_const_initialized = function() { return "const_local"; }
function f() {
eval('1');
assertEquals(1, x);
@@ -47,44 +41,12 @@
assertEquals(2, y);
assertEquals('global', global_function());
assertEquals('local', local_function());
- var exception = false;
- try {
- const_uninitialized();
- } catch(e) {
- exception = true;
- }
- assertTrue(exception);
- assertEquals('const_global', const_initialized());
- exception = false;
- try {
- local_const_uninitialized();
- } catch(e) {
- exception = true;
- }
- assertTrue(exception);
- assertEquals('const_local', local_const_initialized());
function g() {
assertEquals(1, x);
try { typeof(asdf); } catch(e) { assertUnreachable(); }
assertEquals(2, y);
assertEquals('global', global_function());
assertEquals('local', local_function());
- var exception = false;
- try {
- const_uninitialized();
- } catch(e) {
- exception = true;
- }
- assertTrue(exception);
- assertEquals('const_global', const_initialized());
- exception = false;
- try {
- local_const_uninitialized();
- } catch(e) {
- exception = true;
- }
- assertTrue(exception);
- assertEquals('const_local', local_const_initialized());
}
g();
}
diff --git a/test/mjsunit/readonly.js b/test/mjsunit/readonly.js
index 3b090ce..3839731 100644
--- a/test/mjsunit/readonly.js
+++ b/test/mjsunit/readonly.js
@@ -25,7 +25,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --allow-natives-syntax --harmony-proxies
+// Flags: --allow-natives-syntax
// Different ways to create an object.
diff --git a/test/mjsunit/regexp-lastIndex.js b/test/mjsunit/regexp-lastIndex.js
new file mode 100644
index 0000000..1445b9b
--- /dev/null
+++ b/test/mjsunit/regexp-lastIndex.js
@@ -0,0 +1,18 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// lastIndex is set according to funny rules. It is typically set only
+// for global or sticky RegExps, but on a failure to find a match, it is
+// set unconditionally. If a set fails, then it acts as if in strict mode
+// and throws.
+
+var re = /x/;
+Object.defineProperty(re, 'lastIndex', {writable: false});
+assertThrows(() => re.exec(""), TypeError);
+assertEquals(["x"], re.exec("x"));
+
+var re = /x/y;
+Object.defineProperty(re, 'lastIndex', {writable: false});
+assertThrows(() => re.exec(""), TypeError);
+assertThrows(() => re.exec("x"), TypeError);
diff --git a/test/mjsunit/regexp-not-sticky-yet.js b/test/mjsunit/regexp-not-sticky-yet.js
deleted file mode 100644
index 2002509..0000000
--- a/test/mjsunit/regexp-not-sticky-yet.js
+++ /dev/null
@@ -1,66 +0,0 @@
-// Copyright 2014 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// Flags: --no-harmony-regexps
-// Test that sticky regexp support is not affecting V8 when the
-// --harmony-regexps flag is not on.
-
-assertThrows(function() { eval("/foo.bar/y"); }, SyntaxError);
-assertThrows(function() { eval("/foobar/y"); }, SyntaxError);
-assertThrows(function() { eval("/foo.bar/gy"); }, SyntaxError);
-assertThrows(function() { eval("/foobar/gy"); }, SyntaxError);
-assertThrows(function() { new RegExp("foo.bar", "y"); }, SyntaxError);
-assertThrows(function() { new RegExp("foobar", "y"); }, SyntaxError);
-assertThrows(function() { new RegExp("foo.bar", "gy"); }, SyntaxError);
-assertThrows(function() { new RegExp("foobar", "gy"); }, SyntaxError);
-
-var re = /foo.bar/;
-assertEquals("/foo.bar/", "" + re);
-var plain = /foobar/;
-assertEquals("/foobar/", "" + plain);
-
-re.compile("foo.bar");
-assertEquals(void 0, re.sticky);
-
-var global = /foo.bar/g;
-assertEquals("/foo.bar/g", "" + global);
-var plainglobal = /foobar/g;
-assertEquals("/foobar/g", "" + plainglobal);
-
-assertEquals(void 0, re.sticky);
-re.sticky = true; // Has no effect on the regexp, just sets a property.
-assertTrue(re.sticky);
-
-assertTrue(re.test("..foo.bar"));
-
-re.lastIndex = -1; // Ignored for non-global, non-sticky.
-assertTrue(re.test("..foo.bar"));
-assertEquals(-1, re.lastIndex);
-
-re.lastIndex = -1; // Ignored for non-global, non-sticky.
-assertTrue(!!re.exec("..foo.bar"));
-assertEquals(-1, re.lastIndex);
diff --git a/test/mjsunit/regexp-string-methods.js b/test/mjsunit/regexp-string-methods.js
index 56604a6..fa01a33 100644
--- a/test/mjsunit/regexp-string-methods.js
+++ b/test/mjsunit/regexp-string-methods.js
@@ -25,6 +25,8 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+// Flags: --no-harmony-regexp-exec
+
// Regexp shouldn't use String.prototype.slice()
var s = new String("foo");
assertEquals("f", s.slice(0,1));
diff --git a/test/mjsunit/regress-3225.js b/test/mjsunit/regress-3225.js
index 97165a8..51fac89 100644
--- a/test/mjsunit/regress-3225.js
+++ b/test/mjsunit/regress-3225.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --expose-debug-as debug --debug-eval-readonly-locals
+// Flags: --expose-debug-as debug
Debug = debug.Debug
@@ -15,13 +15,13 @@
if (debug_step == 0) {
assertEquals(1, exec_state.frame(0).evaluate('a').value());
assertEquals(3, exec_state.frame(0).evaluate('b').value());
- exec_state.frame(0).evaluate("a = 4").value(); // no effect.
+ exec_state.frame(0).evaluate("a = 4").value();
debug_step++;
} else {
- assertEquals(1, exec_state.frame(0).evaluate('a').value());
+ assertEquals(4, exec_state.frame(0).evaluate('a').value());
assertEquals(3, exec_state.frame(0).evaluate('b').value());
exec_state.frame(0).evaluate("set_a_to_5()");
- exec_state.frame(0).evaluate("b = 5").value(); // no effect.
+ exec_state.frame(0).evaluate("b = 5").value();
}
} catch (e) {
failure = e;
@@ -43,10 +43,10 @@
var foo = generator(1, 2);
-assertEquals(1, foo.next().value);
+assertEquals(4, foo.next().value);
assertEquals(3, foo.next().value);
assertEquals(5, foo.next().value);
-assertEquals(3, foo.next().value);
+assertEquals(5, foo.next().value);
assertNull(failure);
Debug.setListener(null);
diff --git a/test/mjsunit/regress-sync-optimized-lists.js b/test/mjsunit/regress-sync-optimized-lists.js
index 2ce60aa..0f7eeba 100644
--- a/test/mjsunit/regress-sync-optimized-lists.js
+++ b/test/mjsunit/regress-sync-optimized-lists.js
@@ -3,7 +3,6 @@
// found in the LICENSE file.
// Flags: --allow-natives-syntax --block-concurrent-recompilation
-// Flags: --no-concurrent-osr
function Ctor() {
this.a = 1;
diff --git a/test/mjsunit/regress/get-array-keys-oob.js b/test/mjsunit/regress/get-array-keys-oob.js
new file mode 100644
index 0000000..22a59e8
--- /dev/null
+++ b/test/mjsunit/regress/get-array-keys-oob.js
@@ -0,0 +1,6 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+Array.prototype[10000000] = 1;
+Array(1000).join();
diff --git a/test/mjsunit/regress/regress-1178598.js b/test/mjsunit/regress/regress-1178598.js
index 2056a9d..cca5016 100644
--- a/test/mjsunit/regress/regress-1178598.js
+++ b/test/mjsunit/regress/regress-1178598.js
@@ -25,27 +25,8 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --legacy-const
-
// Regression test cases for issue 1178598.
-// Make sure const-initialization doesn't conflict
-// with heap-allocated locals for catch variables.
-var value = (function(){
- try { } catch(e) {
- // Force the 'e' variable to be heap-allocated
- // by capturing it in a function closure.
- (function() { e; });
- }
- // Make sure the two definitions of 'e' do
- // not conflict in any way.
- eval("const e=1");
- return e;
-})();
-
-assertEquals(1, value);
-
-
// Make sure that catch variables can be accessed using eval.
var value = (function() {
diff --git a/test/mjsunit/regress/regress-1182832.js b/test/mjsunit/regress/regress-1182832.js
deleted file mode 100644
index 4d21469..0000000
--- a/test/mjsunit/regress/regress-1182832.js
+++ /dev/null
@@ -1,40 +0,0 @@
-// Copyright 2008 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// Flags: --legacy-const
-
-var caught = false;
-try {
- (function () {
- var e = 0;
- eval("const e = 1;");
- })();
-} catch (e) {
- caught = true;
- assertTrue(e instanceof TypeError);
-}
-assertTrue(caught);
diff --git a/test/mjsunit/regress/regress-1199637.js b/test/mjsunit/regress/regress-1199637.js
index 34ab514..ae7c5e0 100644
--- a/test/mjsunit/regress/regress-1199637.js
+++ b/test/mjsunit/regress/regress-1199637.js
@@ -25,13 +25,12 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --allow-natives-syntax --legacy-const
+// Flags: --allow-natives-syntax
-// Make sure that we can introduce global variables (using
-// both var and const) that shadow even READ_ONLY variables
-// in the prototype chain.
-const NONE = 0;
-const READ_ONLY = 1;
+// Make sure that we can introduce global variables that shadow even
+// READ_ONLY variables in the prototype chain.
+var NONE = 0;
+var READ_ONLY = 1;
// Use DeclareGlobal...
%AddNamedProperty(this.__proto__, "a", 1234, NONE);
@@ -41,7 +40,7 @@
%AddNamedProperty(this.__proto__, "b", 1234, NONE);
assertEquals(1234, b);
-eval("const b = 5678;");
+eval("var b = 5678;");
assertEquals(5678, b);
%AddNamedProperty(this.__proto__, "c", 1234, READ_ONLY);
@@ -51,7 +50,7 @@
%AddNamedProperty(this.__proto__, "d", 1234, READ_ONLY);
assertEquals(1234, d);
-eval("const d = 5678;");
+eval("var d = 5678;");
assertEquals(5678, d);
// Use DeclareContextSlot...
@@ -62,7 +61,7 @@
%AddNamedProperty(this.__proto__, "y", 1234, NONE);
assertEquals(1234, y);
-eval("with({}) { const y = 5678; }");
+eval("with({}) { var y = 5678; }");
assertEquals(5678, y);
%AddNamedProperty(this.__proto__, "z", 1234, READ_ONLY);
@@ -72,5 +71,5 @@
%AddNamedProperty(this.__proto__, "w", 1234, READ_ONLY);
assertEquals(1234, w);
-eval("with({}) { const w = 5678; }");
+eval("with({}) { var w = 5678; }");
assertEquals(5678, w);
diff --git a/test/mjsunit/regress/regress-1201933.js b/test/mjsunit/regress/regress-1201933.js
deleted file mode 100644
index 4a7c65a..0000000
--- a/test/mjsunit/regress/regress-1201933.js
+++ /dev/null
@@ -1,42 +0,0 @@
-// Copyright 2008 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// Flags: --legacy-const
-
-// Make sure this doesn't fail with an assertion
-// failure during lazy compilation.
-
-var caught = false;
-try {
- (function() {
- const a;
- var a;
- })();
-} catch (e) {
- caught = true;
-}
-assertTrue(caught);
diff --git a/test/mjsunit/regress/regress-1207276.js b/test/mjsunit/regress/regress-1207276.js
deleted file mode 100644
index b5d0181..0000000
--- a/test/mjsunit/regress/regress-1207276.js
+++ /dev/null
@@ -1,38 +0,0 @@
-// Copyright 2008 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// Flags: --legacy-const
-
-try {
- const x=n,Glo0al;
-} catch(e){}
-
-delete Date;
-function X(){String(Glo0al)}
-X();
-X();
-X();
diff --git a/test/mjsunit/regress/regress-1213575.js b/test/mjsunit/regress/regress-1213575.js
deleted file mode 100644
index fc35b88..0000000
--- a/test/mjsunit/regress/regress-1213575.js
+++ /dev/null
@@ -1,42 +0,0 @@
-// Copyright 2008 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// Make sure that a const definition does not try
-// to pass 'the hole' to a defined setter.
-
-// Flags: --legacy-const
-
-this.__defineSetter__('x', function(value) { assertTrue(value === 1); });
-
-var caught = false;
-try {
- eval('const x = 1');
-} catch(e) {
- assertTrue(e instanceof TypeError);
- caught = true;
-}
-assertTrue(caught);
diff --git a/test/mjsunit/regress/regress-186.js b/test/mjsunit/regress/regress-186.js
index e10ed8f..0c2dbc6 100644
--- a/test/mjsunit/regress/regress-186.js
+++ b/test/mjsunit/regress/regress-186.js
@@ -25,8 +25,6 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --legacy-const
-
// Make sure that eval can introduce a local variable called __proto__.
// See http://code.google.com/p/v8/issues/detail?id=186
@@ -49,15 +47,6 @@
assertEquals(o, eval("__proto__"));
}
-function testConstLocal() {
- // Add const property called __proto__ to the extension object.
- eval("const __proto__ = o");
- // Check that the extension object's prototype did not change.
- eval("var x = 27");
- assertFalse(setterCalled, "prototype of extension object changed");
- assertEquals(o, eval("__proto__"));
-}
-
function testGlobal() {
// Assign to the global __proto__ property.
eval("__proto__ = o");
@@ -69,5 +58,4 @@
}
runTest(testLocal);
-runTest(testConstLocal);
runTest(testGlobal);
diff --git a/test/mjsunit/regress/regress-220.js b/test/mjsunit/regress/regress-220.js
index 32c6471..cd38a47 100644
--- a/test/mjsunit/regress/regress-220.js
+++ b/test/mjsunit/regress/regress-220.js
@@ -25,6 +25,8 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+// Flags: --no-harmony-restrictive-declarations
+
function foo(f) { eval(f); }
// Ensure that compiling a declaration of a function does not crash.
diff --git a/test/mjsunit/regress/regress-2618.js b/test/mjsunit/regress/regress-2618.js
index b3cfffd..6e52bca 100644
--- a/test/mjsunit/regress/regress-2618.js
+++ b/test/mjsunit/regress/regress-2618.js
@@ -25,7 +25,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --use-osr --allow-natives-syntax --no-concurrent-osr
+// Flags: --use-osr --allow-natives-syntax
function f() {
do {
diff --git a/test/mjsunit/regress/regress-3138.js b/test/mjsunit/regress/regress-3138.js
index 6f0430c..4f607ed 100644
--- a/test/mjsunit/regress/regress-3138.js
+++ b/test/mjsunit/regress/regress-3138.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --legacy-const
-
(function f(){
assertEquals("function", typeof f);
})();
@@ -30,13 +28,3 @@
assertEquals("undefined", typeof a);
assertEquals(2, o.a);
})();
-
-// const initialization is not intercepted by with scope.
-(function() {
- var o = { a: 1 };
- with (o) {
- const a = 2;
- }
- assertEquals(2, a);
- assertEquals(1, o.a);
-})();
diff --git a/test/mjsunit/regress/regress-325676.js b/test/mjsunit/regress/regress-325676.js
index 7aae0cd..6c23d0a 100644
--- a/test/mjsunit/regress/regress-325676.js
+++ b/test/mjsunit/regress/regress-325676.js
@@ -25,7 +25,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --expose-debug-as debug --debug-eval-readonly-locals
+// Flags: --expose-debug-as debug
// If a function parameter is forced to be context allocated,
// debug evaluate need to resolve it to a context slot instead of
@@ -51,12 +51,12 @@
function f(arg) {
expected = arg;
debugger;
- assertEquals(expected, arg);
+ assertEquals("evaluated", arg);
arg = "value";
expected = arg;
debugger;
- assertEquals(expected, arg);
+ assertEquals("evaluated", arg);
// Forces arg to be context allocated even though a parameter.
function g() { arg; }
diff --git a/test/mjsunit/regress/regress-343609.js b/test/mjsunit/regress/regress-343609.js
index 5205ca1..520b54e 100644
--- a/test/mjsunit/regress/regress-343609.js
+++ b/test/mjsunit/regress/regress-343609.js
@@ -3,7 +3,7 @@
// found in the LICENSE file.
// Flags: --allow-natives-syntax --block-concurrent-recompilation
-// Flags: --no-concurrent-osr --expose-gc
+// Flags: --expose-gc
function Ctor() {
this.a = 1;
diff --git a/test/mjsunit/regress/regress-436896.js b/test/mjsunit/regress/regress-436896.js
deleted file mode 100644
index fee44de..0000000
--- a/test/mjsunit/regress/regress-436896.js
+++ /dev/null
@@ -1,17 +0,0 @@
-// Copyright 2014 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --allow-natives-syntax --legacy-const
-
-function f(x) {
- const x = 0;
- return x;
-}
-
-function g(x) {
- return f(x);
-}
-
-%OptimizeFunctionOnNextCall(g);
-assertThrows(function() { g(42); }, SyntaxError);
diff --git a/test/mjsunit/regress/regress-4576.js b/test/mjsunit/regress/regress-4576.js
deleted file mode 100644
index c55c695..0000000
--- a/test/mjsunit/regress/regress-4576.js
+++ /dev/null
@@ -1,12 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-//
-// Flags: --harmony-sloppy --legacy-const
-
-// Should trigger a runtime error, not an early error.
-function f() {
- const x;
- var x;
-}
-assertThrows(f, SyntaxError);
diff --git a/test/mjsunit/regress/regress-4693.js b/test/mjsunit/regress/regress-4693.js
index 6145964..13b4e2b 100644
--- a/test/mjsunit/regress/regress-4693.js
+++ b/test/mjsunit/regress/regress-4693.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
-// Flags: --harmony-sloppy-function --nolegacy-const
+// Flags: --harmony-sloppy-function
// In sloppy mode we allow function redeclarations within blocks for webcompat.
(function() {
diff --git a/test/mjsunit/regress/regress-4769.js b/test/mjsunit/regress/regress-4769.js
new file mode 100644
index 0000000..6fbd01f
--- /dev/null
+++ b/test/mjsunit/regress/regress-4769.js
@@ -0,0 +1,12 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// https://bugs.chromium.org/p/v8/issues/detail?id=4769
+
+Object.getPrototypeOf([])[Symbol.iterator] = () => assertUnreachable();
+
+JSON.stringify({foo: [42]});
+JSON.stringify({foo: [42]}, []);
+JSON.stringify({foo: [42]}, undefined, ' ');
+JSON.stringify({foo: [42]}, [], ' ');
diff --git a/test/mjsunit/regress/regress-4825.js b/test/mjsunit/regress/regress-4825.js
new file mode 100644
index 0000000..5ad096f
--- /dev/null
+++ b/test/mjsunit/regress/regress-4825.js
@@ -0,0 +1,95 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+function enumerate(o) {
+ var keys = [];
+ for (var key in o) keys.push(key);
+ return keys;
+}
+
+(function testSlowSloppyArgumentsElements() {
+ function slowSloppyArguments(a, b, c) {
+ arguments[10000] = "last";
+ arguments[4000] = "first";
+ arguments[6000] = "second";
+ arguments[5999] = "x";
+ arguments[3999] = "y";
+ return arguments;
+ }
+ assertEquals(["0", "1", "2", "3999", "4000", "5999", "6000", "10000"],
+ Object.keys(slowSloppyArguments(1, 2, 3)));
+
+ assertEquals(["0", "1", "2", "3999", "4000", "5999", "6000", "10000"],
+ enumerate(slowSloppyArguments(1,2,3)));
+})();
+
+(function testSlowSloppyArgumentsElementsNotEnumerable() {
+ function slowSloppyArguments(a, b, c) {
+ Object.defineProperty(arguments, 10000, {
+ enumerable: false, configurable: false, value: "NOPE"
+ });
+ arguments[4000] = "first";
+ arguments[6000] = "second";
+ arguments[5999] = "x";
+ arguments[3999] = "y";
+ return arguments;
+ }
+
+ assertEquals(["0", "1", "2", "3999", "4000", "5999", "6000"],
+ Object.keys(slowSloppyArguments(1, 2, 3)));
+
+ assertEquals(["0", "1", "2", "3999", "4000", "5999", "6000"],
+ enumerate(slowSloppyArguments(1,2,3)));
+})();
+
+(function testFastSloppyArgumentsElements() {
+ function fastSloppyArguments(a, b, c) {
+ arguments[5] = 1;
+ arguments[7] = 0;
+ arguments[3] = 2;
+ return arguments;
+ }
+ assertEquals(["0", "1", "2", "3", "5", "7"],
+ Object.keys(fastSloppyArguments(1, 2, 3)));
+
+ assertEquals(
+ ["0", "1", "2", "3", "5", "7"], enumerate(fastSloppyArguments(1, 2, 3)));
+
+ function fastSloppyArguments2(a, b, c) {
+ delete arguments[0];
+ arguments[0] = "test";
+ return arguments;
+ }
+
+ assertEquals(["0", "1", "2"], Object.keys(fastSloppyArguments2(1, 2, 3)));
+ assertEquals(["0", "1", "2"], enumerate(fastSloppyArguments2(1, 2, 3)));
+})();
+
+(function testFastSloppyArgumentsElementsNotEnumerable() {
+ function fastSloppyArguments(a, b, c) {
+ Object.defineProperty(arguments, 5, {
+ enumerable: false, configurable: false, value: "NOPE"
+ });
+ arguments[7] = 0;
+ arguments[3] = 2;
+ return arguments;
+ }
+ assertEquals(
+ ["0", "1", "2", "3", "7"], Object.keys(fastSloppyArguments(1, 2, 3)));
+
+ assertEquals(
+ ["0", "1", "2", "3", "7"], enumerate(fastSloppyArguments(1,2,3)));
+
+ function fastSloppyArguments2(a, b, c) {
+ delete arguments[0];
+ Object.defineProperty(arguments, 1, {
+ enumerable: false, configurable: false, value: "NOPE"
+ });
+ arguments[0] = "test";
+ return arguments;
+ }
+
+ assertEquals(["0", "2"], Object.keys(fastSloppyArguments2(1, 2, 3)));
+ assertEquals(["0", "2"], enumerate(fastSloppyArguments2(1, 2, 3)));
+})();
diff --git a/test/mjsunit/regress/regress-4970.js b/test/mjsunit/regress/regress-4970.js
new file mode 100644
index 0000000..da0033b
--- /dev/null
+++ b/test/mjsunit/regress/regress-4970.js
@@ -0,0 +1,15 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax
+
+function g() {
+ var f;
+ class C extends eval("f = () => delete C; Array") {}
+ f();
+}
+
+assertThrows(g, SyntaxError);
+%OptimizeFunctionOnNextCall(g);
+assertThrows(g, SyntaxError);
diff --git a/test/mjsunit/regress/regress-5006.js b/test/mjsunit/regress/regress-5006.js
new file mode 100644
index 0000000..29f145d
--- /dev/null
+++ b/test/mjsunit/regress/regress-5006.js
@@ -0,0 +1,11 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+function foo(x) { return Math.imul(x|0, 2); }
+print(foo(1));
+print(foo(1));
+%OptimizeFunctionOnNextCall(foo);
+print(foo(1));
diff --git a/test/mjsunit/regress/regress-5010.js b/test/mjsunit/regress/regress-5010.js
new file mode 100644
index 0000000..ecd4026
--- /dev/null
+++ b/test/mjsunit/regress/regress-5010.js
@@ -0,0 +1,9 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+var bound = (function(){}).bind({});
+assertEquals("Function", %_ClassOf(bound));
+assertEquals("Function", %ClassOf(bound));
diff --git a/test/mjsunit/regress/regress-5036.js b/test/mjsunit/regress/regress-5036.js
new file mode 100644
index 0000000..036edd9
--- /dev/null
+++ b/test/mjsunit/regress/regress-5036.js
@@ -0,0 +1,7 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-unicode-regexps
+
+assertEquals(["1\u212a"], /\d\w/ui.exec("1\u212a"));
diff --git a/test/mjsunit/regress/regress-536751.js b/test/mjsunit/regress/regress-536751.js
index b2d19e4..0707e00 100644
--- a/test/mjsunit/regress/regress-536751.js
+++ b/test/mjsunit/regress/regress-536751.js
@@ -3,6 +3,7 @@
// found in the LICENSE file.
// Flags: --harmony-sloppy --harmony-sloppy-function --harmony-sloppy-let
+// Flags: --no-harmony-restrictive-declarations
// At some point, this code led to DCHECK errors in debug mode
diff --git a/test/mjsunit/regress/regress-542099.js b/test/mjsunit/regress/regress-542099.js
index f3655da..eef4953 100644
--- a/test/mjsunit/regress/regress-542099.js
+++ b/test/mjsunit/regress/regress-542099.js
@@ -3,6 +3,7 @@
// found in the LICENSE file.
// Flags: --harmony-sloppy --harmony-sloppy-function
+// Flags: --no-harmony-restrictive-declarations
// Previously, this caused a CHECK fail in debug mode
// https://code.google.com/p/chromium/issues/detail?id=542099
diff --git a/test/mjsunit/regress/regress-542100.js b/test/mjsunit/regress/regress-542100.js
index bc03e6f..70fb5dc 100644
--- a/test/mjsunit/regress/regress-542100.js
+++ b/test/mjsunit/regress/regress-542100.js
@@ -3,6 +3,7 @@
// found in the LICENSE file.
// Flags: --harmony-sloppy --harmony-sloppy-function
+// Flags: --no-harmony-restrictive-declarations
(function() {
var x = {a: 1}
diff --git a/test/mjsunit/regress/regress-552302.js b/test/mjsunit/regress/regress-552302.js
index b9f712a..87c4718 100644
--- a/test/mjsunit/regress/regress-552302.js
+++ b/test/mjsunit/regress/regress-552302.js
@@ -2,6 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
-// Flags: --harmony-destructuring-bind --allow-natives-syntax
+// Flags: --allow-natives-syntax
assertThrows('var %OptimizeFunctionOnNextCall()', SyntaxError);
diff --git a/test/mjsunit/regress/regress-554865.js b/test/mjsunit/regress/regress-554865.js
index 9b66d79..d16ac91 100644
--- a/test/mjsunit/regress/regress-554865.js
+++ b/test/mjsunit/regress/regress-554865.js
@@ -1,8 +1,6 @@
// Copyright 2015 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-//
-// Flags: --harmony-default-parameters
(function() {
var x = {};
diff --git a/test/mjsunit/regress/regress-572589.js b/test/mjsunit/regress/regress-572589.js
index 36092a2..1fd755a 100644
--- a/test/mjsunit/regress/regress-572589.js
+++ b/test/mjsunit/regress/regress-572589.js
@@ -3,7 +3,6 @@
// found in the LICENSE file.
//
// Flags: --allow-natives-syntax --no-lazy
-// Flags: --harmony-destructuring-bind
"use strict";
eval();
diff --git a/test/mjsunit/regress/regress-575364.js b/test/mjsunit/regress/regress-575364.js
index 73136c5..c065205 100644
--- a/test/mjsunit/regress/regress-575364.js
+++ b/test/mjsunit/regress/regress-575364.js
@@ -8,5 +8,5 @@
"use asm";
}
-assertFalse(_WASMEXP_ == undefined);
-assertThrows(function() { _WASMEXP_.instantiateModuleFromAsm(f.toString()); });
+assertFalse(Wasm == undefined);
+assertThrows(function() { Wasm.instantiateModuleFromAsm(f.toString()); });
diff --git a/test/mjsunit/regress/regress-590074.js b/test/mjsunit/regress/regress-590074.js
new file mode 100644
index 0000000..80ae41b
--- /dev/null
+++ b/test/mjsunit/regress/regress-590074.js
@@ -0,0 +1,29 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --expose-gc
+
+var __v_5 = {};
+
+function __f_10() {
+ var __v_2 = [0, 0, 0];
+ __v_2[0] = 0;
+ gc();
+ return __v_2;
+}
+
+function __f_2(array) {
+ array[1] = undefined;
+}
+
+function __f_9() {
+ var __v_4 = __f_10();
+ __f_2(__f_10());
+ __v_5 = __f_10();
+ __v_4 = __f_10();
+ __f_2(__v_5);
+}
+__f_9();
+%OptimizeFunctionOnNextCall(__f_9);
+__f_9();
diff --git a/test/mjsunit/regress/regress-592341.js b/test/mjsunit/regress/regress-592341.js
new file mode 100644
index 0000000..2fa4752
--- /dev/null
+++ b/test/mjsunit/regress/regress-592341.js
@@ -0,0 +1,36 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+function id(a) {
+ return a;
+}
+
+(function LiteralCompareNullDeopt() {
+ function f() {
+ return id(null == %DeoptimizeNow());
+ }
+
+ %OptimizeFunctionOnNextCall(f);
+ assertTrue(f());
+})();
+
+(function LiteralCompareUndefinedDeopt() {
+ function f() {
+ return id(undefined == %DeoptimizeNow());
+ }
+
+ %OptimizeFunctionOnNextCall(f);
+ assertTrue(f());
+})();
+
+(function LiteralCompareTypeofDeopt() {
+ function f() {
+ return id("undefined" == typeof(%DeoptimizeNow()));
+ }
+
+ %OptimizeFunctionOnNextCall(f);
+ assertTrue(f());
+})();
diff --git a/test/mjsunit/regress/regress-592353.js b/test/mjsunit/regress/regress-592353.js
new file mode 100644
index 0000000..f4e3b68
--- /dev/null
+++ b/test/mjsunit/regress/regress-592353.js
@@ -0,0 +1,10 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax --no-lazy
+
+with ({}) {}
+f = ({x}) => { };
+%OptimizeFunctionOnNextCall(f);
+f({});
diff --git a/test/mjsunit/regress/regress-593299.js b/test/mjsunit/regress/regress-593299.js
new file mode 100644
index 0000000..255a033
--- /dev/null
+++ b/test/mjsunit/regress/regress-593299.js
@@ -0,0 +1,17 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-tailcalls
+
+"use strict";
+
+function h(global) { return global.boom(); }
+function g() { var r = h({}); return r; }
+function f() {
+ var o = {};
+ o.__defineGetter__('prop1', g);
+ o.prop1;
+}
+
+assertThrows(f);
diff --git a/test/mjsunit/regress/regress-595319.js b/test/mjsunit/regress/regress-595319.js
new file mode 100644
index 0000000..46ca274
--- /dev/null
+++ b/test/mjsunit/regress/regress-595319.js
@@ -0,0 +1,39 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// https://bugs.chromium.org/p/chromium/issues/detail?id=595319
+// Ensure exceptions are checked for by Array.prototype.concat from adding
+// an element, and that elements are added to array subclasses appropriately
+
+// If adding a property does throw, the exception is propagated
+class MyException extends Error { }
+class NoDefinePropertyArray extends Array {
+ constructor(...args) {
+ super(...args);
+ return new Proxy(this, {
+ defineProperty() { throw new MyException(); }
+ });
+ }
+}
+assertThrows(() => new NoDefinePropertyArray().concat([1]), MyException);
+
+// Ensure elements are added to the instance, rather than calling [[Set]].
+class ZeroGetterArray extends Array { get 0() {} };
+assertArrayEquals([1], new ZeroGetterArray().concat(1));
+
+// Frozen arrays lead to throwing
+
+class FrozenArray extends Array {
+ constructor(...args) { super(...args); Object.freeze(this); }
+}
+assertThrows(() => new FrozenArray().concat([1]), TypeError);
+
+// Non-configurable non-writable zero leads to throwing
+class ZeroFrozenArray extends Array {
+ constructor(...args) {
+ super(...args);
+ Object.defineProperty(this, 0, {value: 1});
+ }
+}
+assertThrows(() => new ZeroFrozenArray().concat([1]), TypeError);
diff --git a/test/mjsunit/regress/regress-596718.js b/test/mjsunit/regress/regress-596718.js
new file mode 100644
index 0000000..6116427
--- /dev/null
+++ b/test/mjsunit/regress/regress-596718.js
@@ -0,0 +1,12 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+Error.prepareStackTrace = function(e, frames) { return frames; }
+assertThrows(() => new Error().stack[0].getMethodName.call({}), TypeError);
+
+Error.prepareStackTrace = function(e, frames) { return frames.map(frame => new Proxy(frame, {})); }
+assertThrows(() => new Error().stack[0].getMethodName(), TypeError);
+
+Error.prepareStackTrace = function(e, frames) { return frames; }
+assertEquals(null, new Error().stack[0].getMethodName());
diff --git a/test/mjsunit/regress/regress-599089-array-push.js b/test/mjsunit/regress/regress-599089-array-push.js
new file mode 100644
index 0000000..9049a4b
--- /dev/null
+++ b/test/mjsunit/regress/regress-599089-array-push.js
@@ -0,0 +1,10 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+
+var array = [1.2, 1.2];
+array.length = 0;
+array.push(undefined);
+assertEquals(1, array.length);
+assertEquals([undefined], array);
diff --git a/test/mjsunit/regress/regress-599412.js b/test/mjsunit/regress/regress-599412.js
new file mode 100644
index 0000000..d5c411d
--- /dev/null
+++ b/test/mjsunit/regress/regress-599412.js
@@ -0,0 +1,22 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+function h(a) {
+ if (!a) return false;
+ print();
+}
+
+function g(a) { return a.length; }
+g('0');
+g('1');
+
+function f() {
+ h(g([]));
+}
+
+f();
+%OptimizeFunctionOnNextCall(f);
+f();
diff --git a/test/mjsunit/regress/regress-599414-array-concat-fast-path.js b/test/mjsunit/regress/regress-599414-array-concat-fast-path.js
new file mode 100644
index 0000000..3819233
--- /dev/null
+++ b/test/mjsunit/regress/regress-599414-array-concat-fast-path.js
@@ -0,0 +1,11 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+var largeArray = 'x'.repeat(999).split('');
+var a = largeArray;
+
+assertThrows(() => {
+ for (;;) {
+ a = a.concat(a, a, a, a, a, a);
+ }}, RangeError);
diff --git a/test/mjsunit/regress/regress-599710.js b/test/mjsunit/regress/regress-599710.js
new file mode 100644
index 0000000..dd1ba8d
--- /dev/null
+++ b/test/mjsunit/regress/regress-599710.js
@@ -0,0 +1,49 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+var f1 = function() { while (1) { } }
+
+function g1() {
+ var s = "hey";
+ f1 = function() { return true; }
+ if (f1()) { return s; }
+}
+
+%OptimizeFunctionOnNextCall(g1);
+assertEquals("hey", g1());
+
+var f2 = function() { do { } while (1); }
+
+function g2() {
+ var s = "hey";
+ f2 = function() { return true; }
+ if (f2()) { return s; }
+}
+
+%OptimizeFunctionOnNextCall(g2);
+assertEquals("hey", g2());
+
+var f3 = function() { for (;;); }
+
+function g3() {
+ var s = "hey";
+ f3 = function() { return true; }
+ if (f3()) { return s; }
+}
+
+%OptimizeFunctionOnNextCall(g3);
+assertEquals("hey", g3());
+
+var f4 = function() { for (;;); }
+
+function g4() {
+ var s = "hey";
+ f4 = function() { return true; }
+ while (f4()) { return s; }
+}
+
+%OptimizeFunctionOnNextCall(g4);
+assertEquals("hey", g4());
diff --git a/test/mjsunit/regress/regress-599825.js b/test/mjsunit/regress/regress-599825.js
new file mode 100644
index 0000000..83075ee
--- /dev/null
+++ b/test/mjsunit/regress/regress-599825.js
@@ -0,0 +1,17 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-wasm
+
+function __f_97(stdlib, buffer) {
+ "use asm";
+ var __v_30 = new stdlib.Int32Array(buffer);
+ function __f_74() {
+ var __v_27 = 4;
+ __v_30[__v_27 >> __v_2] = ((__v_30[-1073741825]|-10) + 2) | 0;
+ }
+}
+assertThrows(function() {
+ var module = Wasm.instantiateModuleFromAsm( __f_97.toString());
+});
diff --git a/test/mjsunit/regress/regress-602970.js b/test/mjsunit/regress/regress-602970.js
new file mode 100644
index 0000000..927d3bf
--- /dev/null
+++ b/test/mjsunit/regress/regress-602970.js
@@ -0,0 +1,17 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --debug-code
+
+// flag --debug-code ensures that we'll abort with a failed smi check without
+// the fix.
+
+var num = new Number(10);
+Array.prototype.__defineGetter__(0,function(){
+ return num;
+})
+Array.prototype.__defineSetter__(0,function(value){
+})
+var str=decodeURI("%E7%9A%84");
+assertEquals(0x7684, str.charCodeAt(0));
diff --git a/test/mjsunit/regress/regress-641.js b/test/mjsunit/regress/regress-641.js
deleted file mode 100644
index c29b2af..0000000
--- a/test/mjsunit/regress/regress-641.js
+++ /dev/null
@@ -1,37 +0,0 @@
-// Copyright 2010 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// Regression test for http://code.google.com/p/v8/issues/detail?id=641.
-
-// Flags: --legacy-const
-
- function f(){
- while (window + 1) {
- const window=[,];
- }
-}
-f()
diff --git a/test/mjsunit/regress/regress-799761.js b/test/mjsunit/regress/regress-799761.js
deleted file mode 100644
index 7d09da5..0000000
--- a/test/mjsunit/regress/regress-799761.js
+++ /dev/null
@@ -1,94 +0,0 @@
-// Copyright 2008 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// Flags: --legacy-const
-
-// const variables should be read-only
-const c = 42;
-c = 87;
-assertEquals(42, c);
-
-
-// const variables are not behaving like other JS variables when it comes
-// to scoping - in fact they behave more sanely. Inside a 'with' they do
-// not interfere with the 'with' scopes.
-
-(function () {
- with ({ x: 42 }) {
- const x = 7;
- }
- x = 5;
- assertEquals(7, x);
-})();
-
-
-// const variables may be declared but never initialized, in which case
-// their value is undefined.
-
-(function (sel) {
- if (sel == 0)
- with ({ x: 42 }) {
- const x;
- }
- else
- x = 3;
- x = 5;
- assertTrue(typeof x == 'undefined');
-})(1);
-
-
-// const variables may be initialized to undefined.
-(function () {
- with ({ x: 42 }) {
- const x = undefined;
- }
- x = 5;
- assertTrue(typeof x == 'undefined');
-})();
-
-
-// const variables may be accessed in inner scopes like any other variable.
-(function () {
- function bar() {
- assertEquals(7, x);
- }
- with ({ x: 42 }) {
- const x = 7;
- }
- x = 5
- bar();
-})();
-
-
-// const variables may be declared via 'eval'
-(function () {
- with ({ x: 42 }) {
- eval('const x = 7');
- }
- x = 5;
- assertEquals(7, x);
-})();
diff --git a/test/mjsunit/regress/regress-88591.js b/test/mjsunit/regress/regress-88591.js
index e7f410d..878e791 100644
--- a/test/mjsunit/regress/regress-88591.js
+++ b/test/mjsunit/regress/regress-88591.js
@@ -25,8 +25,6 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --legacy-const
-
// Regression test for a crash. A data property in the global object's
// prototype shadowed by a setter in the global object's prototype's
// prototype would crash or assert when seen by Runtime_DeclareContextSlot.
@@ -36,9 +34,9 @@
this.__proto__ = { x: 1 };
-try { fail; } catch (e) { eval('const x = 2'); }
+try { fail; } catch (e) { eval('var x = 2'); }
var o = Object.getOwnPropertyDescriptor(this, 'x');
assertFalse(called);
assertEquals(2, o.value);
-assertEquals(false, o.writable);
+assertEquals(true, o.writable);
diff --git a/test/mjsunit/regress/regress-crbug-323936.js b/test/mjsunit/regress/regress-crbug-323936.js
index 6e75729..ca543b0 100644
--- a/test/mjsunit/regress/regress-crbug-323936.js
+++ b/test/mjsunit/regress/regress-crbug-323936.js
@@ -2,7 +2,7 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --expose-debug-as debug --debug-eval-readonly-locals
+// Flags: --expose-debug-as debug
Debug = debug.Debug;
diff --git a/test/mjsunit/regress/regress-crbug-476477-1.js b/test/mjsunit/regress/regress-crbug-476477-1.js
new file mode 100644
index 0000000..881c602
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-476477-1.js
@@ -0,0 +1,21 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+var obj = {
+ _leftTime: 12345678,
+ _divider: function() {
+ var s = Math.floor(this._leftTime / 3600);
+ var e = Math.floor(s / 24);
+ var i = s % 24;
+ return {
+ s: s,
+ e: e,
+ i: i,
+ }
+ }
+}
+
+for (var i = 0; i < 1000; i++) {
+ obj._divider();
+}
diff --git a/test/mjsunit/regress/regress-crbug-476477-2.js b/test/mjsunit/regress/regress-crbug-476477-2.js
new file mode 100644
index 0000000..4dbb41b
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-476477-2.js
@@ -0,0 +1,16 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+function foo(x) {
+ var s = Math.floor(x / 3600);
+ Math.floor(s);
+ return s % 24;
+}
+
+foo(12345678);
+foo(12345678);
+%OptimizeFunctionOnNextCall(foo);
+foo(12345678);
diff --git a/test/mjsunit/regress/regress-crbug-501809.js b/test/mjsunit/regress/regress-crbug-501809.js
index 855b36a..aa235bc 100644
--- a/test/mjsunit/regress/regress-crbug-501809.js
+++ b/test/mjsunit/regress/regress-crbug-501809.js
@@ -6,4 +6,6 @@
var sab = new SharedArrayBuffer(8);
var ta = new Int32Array(sab);
ta.__defineSetter__('length', function() {;});
-Atomics.compareExchange(ta, 4294967295, 0, 0);
+assertThrows(function() {
+ Atomics.compareExchange(ta, 4294967295, 0, 0);
+}, RangeError);
diff --git a/test/mjsunit/regress/regress-crbug-505907.js b/test/mjsunit/regress/regress-crbug-505907.js
index c8d4bac..ec7b80b 100644
--- a/test/mjsunit/regress/regress-crbug-505907.js
+++ b/test/mjsunit/regress/regress-crbug-505907.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies
-
try {
var p = new Proxy({}, {
getPropertyDescriptor: function() { return [] }
diff --git a/test/mjsunit/regress/regress-crbug-506956.js b/test/mjsunit/regress/regress-crbug-506956.js
index 73eb2f2..8bca708 100644
--- a/test/mjsunit/regress/regress-crbug-506956.js
+++ b/test/mjsunit/regress/regress-crbug-506956.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-proxies
-
try {
var p = new Proxy({}, {
getPropertyDescriptor: function() { throw "boom"; }
diff --git a/test/mjsunit/regress/regress-crbug-513471.js b/test/mjsunit/regress/regress-crbug-513471.js
new file mode 100644
index 0000000..48c793e
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-513471.js
@@ -0,0 +1,10 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+var g = (function*(){});
+var f = g();
+%OptimizeFunctionOnNextCall(g);
+f.next();
diff --git a/test/mjsunit/regress/regress-crbug-537444.js b/test/mjsunit/regress/regress-crbug-537444.js
new file mode 100644
index 0000000..1cb1f9a
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-537444.js
@@ -0,0 +1,28 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-tailcalls --allow-natives-syntax
+
+"use strict";
+
+function f(x) {
+ return x;
+}
+
+function g(x) {
+ return false ? 0 : f(x, 1);
+}
+
+function h(x) {
+ var z = g(x, 1);
+ return z + 1;
+}
+
+%SetForceInlineFlag(g);
+%SetForceInlineFlag(f);
+
+h(1);
+h(1);
+%OptimizeFunctionOnNextCall(h);
+h("a");
diff --git a/test/mjsunit/regress/regress-crbug-548580.js b/test/mjsunit/regress/regress-crbug-548580.js
index 4a2f5e1..cf0afff 100644
--- a/test/mjsunit/regress/regress-crbug-548580.js
+++ b/test/mjsunit/regress/regress-crbug-548580.js
@@ -2,8 +2,6 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-// Flags: --harmony-regexps
-
function store(v) {
var re = /(?=[d#.])/;
re.a = v;
diff --git a/test/mjsunit/regress/regress-crbug-568477-2.js b/test/mjsunit/regress/regress-crbug-568477-2.js
index 64dd677..31f7e6e 100644
--- a/test/mjsunit/regress/regress-crbug-568477-2.js
+++ b/test/mjsunit/regress/regress-crbug-568477-2.js
@@ -8,7 +8,7 @@
var expected = ["debugger;",
"var x = y;",
"new Promise(f).catch(call_f_with_deeper_stack);",
- "var a = 1;", "", "var a = 1;",
+ "var a = 1;", "var a = 1;",
"debugger;",
"var x = y;"];
diff --git a/test/mjsunit/regress/regress-crbug-573858.js b/test/mjsunit/regress/regress-crbug-573858.js
index 37a9eb8..270df5a 100644
--- a/test/mjsunit/regress/regress-crbug-573858.js
+++ b/test/mjsunit/regress/regress-crbug-573858.js
@@ -9,7 +9,7 @@
function create_initial_map() { this instanceof throw_type_error }
%OptimizeFunctionOnNextCall(create_initial_map);
-create_initial_map();
+assertThrows(create_initial_map);
function test() { new throw_type_error }
%OptimizeFunctionOnNextCall(test);
diff --git a/test/mjsunit/regress/regress-crbug-587068.js b/test/mjsunit/regress/regress-crbug-587068.js
new file mode 100644
index 0000000..4cdd3ff
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-587068.js
@@ -0,0 +1,14 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+// The Crankshaft fast case for String.fromCharCode used to unconditionally
+// deoptimize on non int32 indices.
+function foo(i) { return String.fromCharCode(i); }
+foo(33);
+foo(33);
+%OptimizeFunctionOnNextCall(foo);
+foo(33.3);
+assertOptimized(foo);
diff --git a/test/mjsunit/regress/regress-crbug-589472.js b/test/mjsunit/regress/regress-crbug-589472.js
new file mode 100644
index 0000000..41a5bd6
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-589472.js
@@ -0,0 +1,94 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --stack-size=100
+
+// Not guaranteed to throw because the stack limits are different on all
+// architectures, hence we use try-catch instead of assertThrows here.
+try { f() } catch(e) { assertInstanceof(e, RangeError) }
+
+function f() {
+ return Math.max(
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" + "a" +
+ "boom", 1, 2, 3, 4, 5, 6, 7, 8, 9);
+};
diff --git a/test/mjsunit/regress/regress-crbug-592340.js b/test/mjsunit/regress/regress-crbug-592340.js
new file mode 100644
index 0000000..49794b8
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-592340.js
@@ -0,0 +1,13 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+class MyArray extends Array { }
+Object.prototype[Symbol.species] = MyArray;
+delete Array[Symbol.species];
+__v_1 = Math.pow(2, 31);
+__v_2 = [];
+__v_2[__v_1] = 31;
+__v_4 = [];
+__v_4[__v_1 - 2] = 33;
+assertThrows(() => __v_2.concat(__v_4), RangeError);
diff --git a/test/mjsunit/regress/regress-crbug-593697-2.js b/test/mjsunit/regress/regress-crbug-593697-2.js
new file mode 100644
index 0000000..1fcbaeb
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-593697-2.js
@@ -0,0 +1,18 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-tailcalls
+
+"use strict";
+
+%SetForceInlineFlag(Math.cos);
+
+var f5 = (function f6(stdlib) {
+ "use asm";
+ var cos = stdlib.Math.cos;
+ function f5() {
+ return cos();
+ }
+ return { f5: f5 };
+})(this, {}).f5();
diff --git a/test/mjsunit/regress/regress-crbug-594955.js b/test/mjsunit/regress/regress-crbug-594955.js
new file mode 100644
index 0000000..69db053
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-594955.js
@@ -0,0 +1,11 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+function g(s, key) { return s[key]; }
+
+assertEquals(g(new String("a"), "length"), 1);
+assertEquals(g(new String("a"), "length"), 1);
+assertEquals(g("a", 32), undefined);
+assertEquals(g("a", "length"), 1);
+assertEquals(g(new String("a"), "length"), 1);
diff --git a/test/mjsunit/regress/regress-crbug-595615.js b/test/mjsunit/regress/regress-crbug-595615.js
new file mode 100644
index 0000000..3309501
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-595615.js
@@ -0,0 +1,15 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-tailcalls
+
+"use strict";
+
+function f(o) {
+ return o.x();
+}
+try { f({ x: 1 }); } catch(e) {}
+try { f({ x: 1 }); } catch(e) {}
+%OptimizeFunctionOnNextCall(f);
+try { f({ x: 1 }); } catch(e) {}
diff --git a/test/mjsunit/regress/regress-crbug-595738.js b/test/mjsunit/regress/regress-crbug-595738.js
new file mode 100644
index 0000000..d2409ab
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-595738.js
@@ -0,0 +1,7 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+function foo() { return 1; }
+var x = {toJSON: foo.bind()};
+assertEquals("1", JSON.stringify(x));
diff --git a/test/mjsunit/regress/regress-crbug-596394.js b/test/mjsunit/regress/regress-crbug-596394.js
new file mode 100644
index 0000000..37c8d27
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-596394.js
@@ -0,0 +1,13 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// In ES#sec-array.prototype.concat
+// When concat makes a new integer-indexed exotic object, the resulting properties
+// are non-configurable and cannot have CreateDataPropertyOrThrow called on them,
+// so it throws a TypeError on failure to make a new property.
+
+__v_0 = new Uint8Array(100);
+array = new Array(10);
+array.__proto__ = __v_0;
+assertThrows(() => Array.prototype.concat.call(array), TypeError);
diff --git a/test/mjsunit/regress/regress-crbug-598998.js b/test/mjsunit/regress/regress-crbug-598998.js
new file mode 100644
index 0000000..4cfe1a1
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-598998.js
@@ -0,0 +1,32 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-tailcalls --allow-natives-syntax
+
+"use strict";
+
+function deopt_function(func) {
+ %DeoptimizeFunction(func);
+}
+
+function f(x) {
+ return deopt_function(h);
+}
+
+function g(x) {
+ return f(x, 1);
+}
+
+function h(x) {
+ g(x, 1);
+}
+
+%SetForceInlineFlag(g);
+%SetForceInlineFlag(f);
+%NeverOptimizeFunction(deopt_function);
+
+h(1);
+h(1);
+%OptimizeFunctionOnNextCall(h);
+h(1);
diff --git a/test/mjsunit/regress/regress-crbug-599067.js b/test/mjsunit/regress/regress-crbug-599067.js
new file mode 100644
index 0000000..bc10aa4
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-599067.js
@@ -0,0 +1,11 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+try {
+ var o = {};
+ var p = new Proxy({}, o);
+ Error.captureStackTrace(p);
+} catch(e) {
+ assertEquals("Cannot pass private property name to proxy trap", e.message);
+}
diff --git a/test/mjsunit/regress/regress-crbug-599073-1.js b/test/mjsunit/regress/regress-crbug-599073-1.js
new file mode 100644
index 0000000..fc89fe4
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-599073-1.js
@@ -0,0 +1,11 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+Object.defineProperty(Boolean.prototype, "v", {get:constructor});
+
+function foo(b) { return b.v; }
+
+foo(true);
+foo(true);
+foo(true);
diff --git a/test/mjsunit/regress/regress-crbug-599073-2.js b/test/mjsunit/regress/regress-crbug-599073-2.js
new file mode 100644
index 0000000..947468a
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-599073-2.js
@@ -0,0 +1,11 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+Object.defineProperty(Boolean.prototype, "v", {set:constructor});
+
+function foo(b) { b.v = 1; }
+
+foo(true);
+foo(true);
+foo(true);
diff --git a/test/mjsunit/regress/regress-crbug-599073-3.js b/test/mjsunit/regress/regress-crbug-599073-3.js
new file mode 100644
index 0000000..2892f56
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-599073-3.js
@@ -0,0 +1,11 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+Object.defineProperty(Number.prototype, "v", {get:constructor});
+
+function foo(b) { return b.v; }
+
+foo(2);
+foo(3);
+foo(4);
diff --git a/test/mjsunit/regress/regress-crbug-599073-4.js b/test/mjsunit/regress/regress-crbug-599073-4.js
new file mode 100644
index 0000000..0d6854c
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-599073-4.js
@@ -0,0 +1,11 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+Object.defineProperty(Number.prototype, "v", {set:constructor});
+
+function foo(b) { b.v = 1; }
+
+foo(2);
+foo(3);
+foo(4);
diff --git a/test/mjsunit/regress/regress-crbug-599714.js b/test/mjsunit/regress/regress-crbug-599714.js
new file mode 100644
index 0000000..98de340
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-599714.js
@@ -0,0 +1,13 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+var custom_toString = function() {
+ var boom = custom_toString.caller;
+ return boom;
+}
+
+var object = {};
+object.toString = custom_toString;
+
+try { Object.hasOwnProperty(object); } catch (e) {}
diff --git a/test/mjsunit/regress/regress-crbug-600995.js b/test/mjsunit/regress/regress-crbug-600995.js
new file mode 100644
index 0000000..c532608
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-600995.js
@@ -0,0 +1,10 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --noharmony-iterator-close
+
+// The {Set} function will produce a different type feedback vector layout
+// depending on whether Harmony iterator finalization is enabled or not.
+
+new Set();
diff --git a/test/mjsunit/regress/regress-crbug-601617.js b/test/mjsunit/regress/regress-crbug-601617.js
new file mode 100644
index 0000000..7d03fef
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-601617.js
@@ -0,0 +1,32 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-tailcalls
+
+function h() {
+ var res = g.arguments[0].x;
+ return res;
+}
+
+function g(o) {
+ var res = h();
+ return res;
+}
+
+function f1() {
+ var o = { x : 1 };
+ var res = g(o);
+ return res;
+}
+
+function f0() {
+ "use strict";
+ return f1(5);
+}
+
+%NeverOptimizeFunction(h);
+f0();
+f0();
+%OptimizeFunctionOnNextCall(f0);
+assertEquals(1, f0());
diff --git a/test/mjsunit/regress/regress-crbug-604680.js b/test/mjsunit/regress/regress-crbug-604680.js
new file mode 100644
index 0000000..3df2f20
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-604680.js
@@ -0,0 +1,45 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-tailcalls
+
+function h() {
+ var res = g.arguments;
+ return res;
+}
+
+function g(o) {
+ var res = h();
+ return res;
+}
+
+function f1() {
+ var o = { x : 42 };
+ var res = g(o);
+ return 1;
+}
+
+function f0(a, b) {
+ "use strict";
+ return f1(5);
+}
+
+function boom(b) {
+ if (b) throw new Error("boom!");
+}
+
+%NeverOptimizeFunction(h);
+f0();
+f0();
+%OptimizeFunctionOnNextCall(f0);
+
+boom(false);
+boom(false);
+%OptimizeFunctionOnNextCall(boom);
+
+try {
+ f0(1, 2, 3);
+ boom(true, 1, 2, 3);
+} catch (e) {
+}
diff --git a/test/mjsunit/regress/regress-crbug-605581.js b/test/mjsunit/regress/regress-crbug-605581.js
deleted file mode 100644
index 0f1daab..0000000
--- a/test/mjsunit/regress/regress-crbug-605581.js
+++ /dev/null
@@ -1,28 +0,0 @@
-// Copyright 2016 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --expose-debug-as debug
-
-var Debug = debug.Debug;
-var exception = null;
-
-function listener(event, exec_state, event_data, data) {
- if (event != Debug.DebugEvent.Break) return;
- try {
- assertThrows(() => exec_state.frame(0).evaluate("bar.baz"), ReferenceError);
- } catch (e) {
- exception = e;
- }
-}
-
-Debug.setListener(listener);
-
-(function() {
- debugger; // bar is still in TDZ at this point.
- let bar = 1;
- (x => bar); // force bar to be context-allocated.
-})();
-
-Debug.setListener(null);
-assertNull(exception);
diff --git a/test/mjsunit/regress/regress-crbug-608278.js b/test/mjsunit/regress/regress-crbug-608278.js
new file mode 100644
index 0000000..6840159
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-608278.js
@@ -0,0 +1,62 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-tailcalls --allow-natives-syntax
+
+"use strict";
+
+function h() {
+ var stack = (new Error("boom")).stack;
+ print(stack);
+ %DeoptimizeFunction(f1);
+ %DeoptimizeFunction(f2);
+ %DeoptimizeFunction(f3);
+ %DeoptimizeFunction(g);
+ %DeoptimizeFunction(h);
+ return 1;
+}
+%NeverOptimizeFunction(h);
+
+function g(v) {
+ return h();
+}
+%SetForceInlineFlag(g);
+
+
+function f1() {
+ var o = {};
+ o.__defineGetter__('p', g);
+ o.p;
+}
+
+f1();
+f1();
+%OptimizeFunctionOnNextCall(f1);
+f1();
+
+
+function f2() {
+ var o = {};
+ o.__defineSetter__('q', g);
+ o.q = 1;
+}
+
+f2();
+f2();
+%OptimizeFunctionOnNextCall(f2);
+f2();
+
+
+function A() {
+ return h();
+}
+
+function f3() {
+ new A();
+}
+
+f3();
+f3();
+%OptimizeFunctionOnNextCall(f3);
+f3();
diff --git a/test/mjsunit/regress/regress-crbug-610228.js b/test/mjsunit/regress/regress-crbug-610228.js
new file mode 100644
index 0000000..ca077d5
--- /dev/null
+++ b/test/mjsunit/regress/regress-crbug-610228.js
@@ -0,0 +1,11 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+function foo() { return JSON.stringify({a: 0.1}); }
+assertEquals('{"a":0.1}', foo());
+assertEquals('{"a":0.1}', foo());
+%OptimizeFunctionOnNextCall(foo);
+assertEquals('{"a":0.1}', foo());
diff --git a/test/mjsunit/regress/regress-debug-deopt-while-recompile.js b/test/mjsunit/regress/regress-debug-deopt-while-recompile.js
index 52c32e9..e1d6ff2 100644
--- a/test/mjsunit/regress/regress-debug-deopt-while-recompile.js
+++ b/test/mjsunit/regress/regress-debug-deopt-while-recompile.js
@@ -77,8 +77,8 @@
g();
// Assert that break point is set at expected location.
-assertTrue(Debug.showBreakPoints(f).indexOf("[B0]var baz = bar;") > 0);
-assertTrue(Debug.showBreakPoints(g).indexOf("[B0]var baz = bar;") > 0);
+assertTrue(Debug.showBreakPoints(f).indexOf("var baz = [B0]bar;") > 0);
+assertTrue(Debug.showBreakPoints(g).indexOf("var baz = [B0]bar;") > 0);
assertEquals(2, listened);
assertNull(exception);
diff --git a/test/mjsunit/regress/regress-debugger-redirect.js b/test/mjsunit/regress/regress-debugger-redirect.js
deleted file mode 100644
index daa6fa7..0000000
--- a/test/mjsunit/regress/regress-debugger-redirect.js
+++ /dev/null
@@ -1,37 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --expose-debug-as debug --legacy-const
-
-function f(x) {
- // This function compiles into code that only throws a redeclaration
- // error. It contains no stack check and has no function body.
- const x = 0;
- return x;
-}
-
-function g() {
- f(0);
-}
-
-var exception = null;
-var called = false;
-var Debug = debug.Debug;
-Debug.setBreakOnException();
-
-function listener(event, exec_state, event_data, data) {
- if (event != Debug.DebugEvent.Exception) return;
- try {
- called = true;
- Debug.setBreakPoint(f, 1);
- } catch (e) {
- exception = e;
- }
-}
-
-Debug.setListener(listener);
-
-assertThrows(g);
-assertNull(exception);
-assertTrue(called);
diff --git a/test/mjsunit/regress/regress-handle-illegal-redeclaration.js b/test/mjsunit/regress/regress-handle-illegal-redeclaration.js
deleted file mode 100644
index fc4ba90..0000000
--- a/test/mjsunit/regress/regress-handle-illegal-redeclaration.js
+++ /dev/null
@@ -1,15 +0,0 @@
-// Copyright 2014 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --always-opt --legacy-const
-
-var x = 0;
-
-function f() {
- const c;
- var c;
- return 0 + x;
-}
-
-assertThrows(f);
diff --git a/test/mjsunit/regress/regress-inline-strong-as-construct.js b/test/mjsunit/regress/regress-inline-strong-as-construct.js
deleted file mode 100644
index 2fa5001..0000000
--- a/test/mjsunit/regress/regress-inline-strong-as-construct.js
+++ /dev/null
@@ -1,21 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --allow-natives-syntax --strong-mode
-
-// This tests that inlining a constructor call to a function which cannot be
-// used as a constructor (e.g. strong mode function) still throws correctly.
-
-function g() {
- "use strong";
-}
-
-function f() {
- return new g();
-}
-
-assertThrows(f);
-assertThrows(f);
-%OptimizeFunctionOnNextCall(f);
-assertThrows(f);
diff --git a/test/mjsunit/regress/regress-seqstrsetchar-ex2.js b/test/mjsunit/regress/regress-seqstrsetchar-ex2.js
deleted file mode 100644
index 6a5ba91..0000000
--- a/test/mjsunit/regress/regress-seqstrsetchar-ex2.js
+++ /dev/null
@@ -1,34 +0,0 @@
-// Copyright 2013 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// Flags: --allow-natives-syntax
-
-String.fromCharCode(0xFFF, 0xFFF);
-String.fromCharCode(0x7C, 0x7C);
-%OptimizeFunctionOnNextCall(String.fromCharCode);
-String.fromCharCode(0x7C, 0x7C);
-String.fromCharCode(0xFFF, 0xFFF);
diff --git a/test/mjsunit/stack-traces-custom.js b/test/mjsunit/stack-traces-custom.js
index fbf650d..75fad63 100644
--- a/test/mjsunit/stack-traces-custom.js
+++ b/test/mjsunit/stack-traces-custom.js
@@ -2,19 +2,25 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
-var o = { f: function() { throw new Error(); } };
+var o = {
+ f: function() { throw new Error(); },
+ get j() { o.h(); },
+ set k(_) { o.j; },
+};
o.g1 = function() { o.f() }
o.g2 = o.g1;
o.h = function() { o.g1() }
-Error.prepareStackTrace = function(e, frames) { return frames; }
-
try {
- o.h();
+ o.k = 42;
} catch (e) {
+ Error.prepareStackTrace = function(e, frames) { return frames; };
var frames = e.stack;
+ Error.prepareStackTrace = undefined;
assertEquals("f", frames[0].getMethodName());
assertEquals(null, frames[1].getMethodName());
assertEquals("h", frames[2].getMethodName());
- assertEquals(null, frames[3].getMethodName());
+ assertEquals("j", frames[3].getMethodName());
+ assertEquals("k", frames[4].getMethodName());
+ assertEquals(null, frames[5].getMethodName());
}
diff --git a/test/mjsunit/strict-mode.js b/test/mjsunit/strict-mode.js
index 63dc9d0..f7f95da 100644
--- a/test/mjsunit/strict-mode.js
+++ b/test/mjsunit/strict-mode.js
@@ -1149,7 +1149,7 @@
function strict() {
"use strict";
- // Returning result via local variable to avoid tail call optimization.
+ // Returning result via local variable to avoid tail call elimination.
var res = return_my_caller();
return res;
}
@@ -1165,7 +1165,7 @@
(function TestNonStrictFunctionCallerPill() {
function strict(n) {
"use strict";
- // Returning result via local variable to avoid tail call optimization.
+ // Returning result via local variable to avoid tail call elimination.
var res = non_strict(n);
return res;
}
@@ -1195,7 +1195,7 @@
(function TestNonStrictFunctionCallerDescriptorPill() {
function strict(n) {
"use strict";
- // Returning result via local variable to avoid tail call optimization.
+ // Returning result via local variable to avoid tail call elimination.
var res = non_strict(n);
return res;
}
diff --git a/test/mjsunit/string-fromcharcode.js b/test/mjsunit/string-fromcharcode.js
index ad3f7a9..ac51682 100644
--- a/test/mjsunit/string-fromcharcode.js
+++ b/test/mjsunit/string-fromcharcode.js
@@ -103,11 +103,6 @@
test(i);
}
-assertEquals("AAAA", String.fromCharCode(65, 65, 65, 65));
-assertEquals("AAAA", String.fromCharCode(65, 65, 65, 65));
-%OptimizeFunctionOnNextCall(String.fromCharCode);
-assertEquals("AAAA", String.fromCharCode(65, 65, 65, 65));
-
// Test the custom IC works correctly when the map changes.
for (var i = 0; i < 10; i++) {
var expected = (i < 5) ? " " : 42;
diff --git a/test/mjsunit/strong/arrays.js b/test/mjsunit/strong/arrays.js
deleted file mode 100644
index b9e4fad..0000000
--- a/test/mjsunit/strong/arrays.js
+++ /dev/null
@@ -1,12 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode
-
-(function NoEllisions() {
- assertThrows("'use strong'; [,]", SyntaxError);
- assertThrows("'use strong'; [,3]", SyntaxError);
- assertThrows("'use strong'; [3,,4]", SyntaxError);
- assertTrue(eval("'use strong'; [3,] !== [3,4,]"));
-})();
diff --git a/test/mjsunit/strong/class-extend-null.js b/test/mjsunit/strong/class-extend-null.js
deleted file mode 100644
index 3ed7b36..0000000
--- a/test/mjsunit/strong/class-extend-null.js
+++ /dev/null
@@ -1,97 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode --allow-natives-syntax
-
-(function() {
-"use strict";
-
-let foo = null;
-
-function nullLiteral() {
- class Class1 extends null {
- constructor() {
- super();
- }
- }
-}
-
-function nullVariable() {
- class Class2 extends foo {
- constructor() {
- super();
- }
- }
-}
-
-function nullLiteralClassExpr() {
- (class extends null {});
-}
-
-function nullVariableClassExpr() {
- (class extends foo {});
-}
-
-assertDoesNotThrow(nullLiteral);
-%OptimizeFunctionOnNextCall(nullLiteral);
-assertDoesNotThrow(nullLiteral);
-
-assertDoesNotThrow(nullVariable);
-%OptimizeFunctionOnNextCall(nullVariable);
-assertDoesNotThrow(nullVariable);
-
-assertDoesNotThrow(nullLiteralClassExpr);
-%OptimizeFunctionOnNextCall(nullLiteralClassExpr);
-assertDoesNotThrow(nullLiteralClassExpr);
-
-assertDoesNotThrow(nullVariableClassExpr);
-%OptimizeFunctionOnNextCall(nullVariableClassExpr);
-assertDoesNotThrow(nullVariableClassExpr);
-})();
-
-(function() {
-"use strong";
-
-let foo = null;
-
-function nullLiteral() {
- class Class1 extends null {
- constructor() {
- super();
- }
- }
-}
-
-function nullVariable() {
- class Class2 extends foo {
- constructor() {
- super();
- }
- }
-}
-
-function nullLiteralClassExpr() {
- (class extends null {});
-}
-
-function nullVariableClassExpr() {
- (class extends foo {});
-}
-
-assertThrows(nullLiteral, TypeError);
-%OptimizeFunctionOnNextCall(nullLiteral);
-assertThrows(nullLiteral, TypeError);
-
-assertThrows(nullVariable, TypeError);
-%OptimizeFunctionOnNextCall(nullVariable);
-assertThrows(nullVariable, TypeError);
-
-assertThrows(nullLiteralClassExpr, TypeError);
-%OptimizeFunctionOnNextCall(nullLiteralClassExpr);
-assertThrows(nullLiteralClassExpr, TypeError);
-
-assertThrows(nullVariableClassExpr, TypeError);
-%OptimizeFunctionOnNextCall(nullVariableClassExpr);
-assertThrows(nullVariableClassExpr, TypeError);
-})();
diff --git a/test/mjsunit/strong/class-literals.js b/test/mjsunit/strong/class-literals.js
deleted file mode 100644
index a0e7280..0000000
--- a/test/mjsunit/strong/class-literals.js
+++ /dev/null
@@ -1,159 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode --allow-natives-syntax
-
-'use strict';
-
-function assertWeakClassWeakInstances(x) {
- assertFalse(%IsStrong(x));
- assertFalse(%IsStrong(x.prototype));
- assertFalse(%IsStrong(new x));
-}
-
-function assertWeakClassStrongInstances(x) {
- assertFalse(%IsStrong(x));
- assertFalse(%IsStrong(x.prototype));
- assertTrue(%IsStrong(new x));
-}
-
-function assertStrongClassWeakInstances(x) {
- assertTrue(%IsStrong(x));
- assertTrue(%IsStrong(x.prototype));
- assertFalse(%IsStrong(new x));
-}
-
-function assertStrongClassStrongInstances(x) {
- assertTrue(%IsStrong(x));
- assertTrue(%IsStrong(x.prototype));
- assertTrue(%IsStrong(new x));
-}
-
-function getWeakClass() {
- return (class {});
-}
-
-function getWeakClassExtends(x) {
- return (class extends x {});
-}
-
-function getStrongClass() {
- "use strong";
- return (class {});
-}
-
-function getStrongClassExtends(x) {
- "use strong";
- return (class extends x {});
-}
-
-(function SimpleWeakClassLiterals() {
- class C {};
- class D extends C {};
- class E extends Object {};
-
- assertWeakClassWeakInstances(C);
- assertWeakClassWeakInstances(D);
- assertWeakClassWeakInstances(E);
-
- assertWeakClassWeakInstances(class {});
- assertWeakClassWeakInstances(class extends Object {});
- assertWeakClassWeakInstances(class extends C {});
- assertWeakClassWeakInstances(class extends class {} {});
-})();
-
-(function SimpleStrongClassLiterals() {
- 'use strong';
- class C {};
- class D extends C {};
-
- assertStrongClassStrongInstances(C);
- assertStrongClassStrongInstances(D);
-
- assertStrongClassStrongInstances(class {});
- assertStrongClassStrongInstances(class extends C {});
- assertStrongClassStrongInstances(class extends class {} {});
-})();
-
-(function MixedWeakClassLiterals() {
- class C extends getStrongClass() {};
- class D extends getStrongClassExtends((class {})) {};
- class E extends getStrongClassExtends(C) {};
-
- assertWeakClassStrongInstances(C);
- assertWeakClassStrongInstances(class extends getStrongClass() {});
-
- assertWeakClassWeakInstances(D);
- assertWeakClassWeakInstances(
- class extends getStrongClassExtends((class {})) {});
-
- assertWeakClassStrongInstances(E);
- assertWeakClassStrongInstances(
- class extends getStrongClassExtends(class extends getStrongClass() {}) {});
-})();
-
-(function MixedStrongClassLiterals() {
- 'use strong';
- class C extends getWeakClass() {};
- class D extends getWeakClassExtends((class {})) {};
- class E extends getWeakClassExtends(C) {};
- class F extends Object {};
-
- assertStrongClassWeakInstances(C);
- assertStrongClassWeakInstances(class extends getWeakClass() {});
-
- assertStrongClassStrongInstances(D);
- assertStrongClassStrongInstances(
- class extends getWeakClassExtends((class {})) {});
-
- assertStrongClassWeakInstances(E);
- assertStrongClassWeakInstances(
- class extends getWeakClassExtends(class extends getWeakClass() {}) {});
-
- assertStrongClassWeakInstances(F);
- assertStrongClassWeakInstances(class extends Object {});
-})();
-
-(function WeakMonkeyPatchedClassLiterals() {
- class C {};
- assertWeakClassWeakInstances(C);
- C.__proto__ = getStrongClass();
- // C's default constructor doesn't call super.
- assertWeakClassWeakInstances(C);
-
- class D extends Object {};
- assertWeakClassWeakInstances(D);
- D.__proto__ = getStrongClass();
- // D is a derived class, so its default constructor calls super.
- assertWeakClassStrongInstances(D);
-
- class E extends (class {}) {};
- E.__proto__ = C;
- assertWeakClassWeakInstances(E);
-
- class F extends (class {}) {};
- F.__proto__ = D;
- assertWeakClassStrongInstances(F);
-
- class G extends getStrongClass() {};
- G.__proto__ = getWeakClass();
- assertWeakClassWeakInstances(G);
-})();
-
-(function StrongMonkeyPatchedClassLiterals() {
- let C = getStrongClassExtends(getWeakClassExtends(getStrongClass()));
- let D = getStrongClassExtends(getWeakClassExtends(getWeakClass()));
-
- assertStrongClassStrongInstances(C);
- C.__proto__.__proto__ = getWeakClass();
- assertStrongClassWeakInstances(C);
- C.__proto__.__proto__ = getStrongClass();
- assertStrongClassStrongInstances(C);
-
- assertStrongClassWeakInstances(D);
- D.__proto__.__proto__ = getStrongClass();
- assertStrongClassStrongInstances(D);
- D.__proto__.__proto__ = getWeakClass();
- assertStrongClassWeakInstances(D);
-})();
diff --git a/test/mjsunit/strong/class-object-frozen.js b/test/mjsunit/strong/class-object-frozen.js
deleted file mode 100644
index 2c442c0..0000000
--- a/test/mjsunit/strong/class-object-frozen.js
+++ /dev/null
@@ -1,98 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode
-
-"use strict";
-
-function getClass() {
- class Foo {
- static get bar() { return 0 }
- get bar() { return 0 }
- }
- return Foo;
-}
-
-function getClassExpr() {
- return (class { static get bar() { return 0 } get bar() { return 0 } });
-}
-
-function getClassStrong() {
- "use strong";
- class Foo {
- static get bar() { return 0 }
- get bar() { return 0 }
- }
- return Foo;
-}
-
-function getClassExprStrong() {
- "use strong";
- return (class { static get bar() { return 0 } get bar() { return 0 } });
-}
-
-function addProperty(o) {
- o.baz = 1;
-}
-
-function convertPropertyToData(o) {
- assertTrue(o.hasOwnProperty("bar"));
- Object.defineProperty(o, "bar", { value: 1 });
-}
-
-function testWeakClass(classFunc) {
- assertDoesNotThrow(function(){addProperty(classFunc())});
- assertDoesNotThrow(function(){addProperty(classFunc().prototype)});
- assertDoesNotThrow(function(){convertPropertyToData(classFunc())});
- assertDoesNotThrow(function(){convertPropertyToData(classFunc().prototype)});
-}
-
-function testStrongClass(classFunc) {
- assertThrows(function(){addProperty(classFunc())}, TypeError);
- assertThrows(function(){addProperty(classFunc().prototype)}, TypeError);
- assertThrows(function(){convertPropertyToData(classFunc())}, TypeError);
- assertThrows(function(){convertPropertyToData(classFunc().prototype)},
- TypeError);
-}
-
-testWeakClass(getClass);
-testWeakClass(getClassExpr);
-
-testStrongClass(getClassStrong);
-testStrongClass(getClassExprStrong);
-
-// Check strong classes don't freeze their parents.
-(function() {
- let parent = getClass();
-
- let classFunc = function() {
- "use strong";
- class Foo extends parent {
- static get bar() { return 0 }
- get bar() { return 0 }
- }
- return Foo;
- }
-
- testStrongClass(classFunc);
- assertDoesNotThrow(function(){addProperty(parent)});
- assertDoesNotThrow(function(){convertPropertyToData(parent)});
-})();
-
-// Check strong classes don't freeze their children.
-(function() {
- let parent = getClassStrong();
-
- let classFunc = function() {
- class Foo extends parent {
- static get bar() { return 0 }
- get bar() { return 0 }
- }
- return Foo;
- }
-
- assertThrows(function(){addProperty(parent)}, TypeError);
- assertThrows(function(){convertPropertyToData(parent)}, TypeError);
- testWeakClass(classFunc);
-})();
diff --git a/test/mjsunit/strong/classes.js b/test/mjsunit/strong/classes.js
deleted file mode 100644
index 92dea0f..0000000
--- a/test/mjsunit/strong/classes.js
+++ /dev/null
@@ -1,118 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode
-
-'use strong';
-
-class C {}
-
-let indirect_eval = eval;
-
-function assertTypeError(script) { assertThrows(script, TypeError) }
-function assertSyntaxError(script) { assertThrows(script, SyntaxError) }
-function assertReferenceError(script) { assertThrows(script, ReferenceError) }
-
-(function ImmutableClassBindings() {
- class D {}
- assertTypeError(function(){ indirect_eval("C = 0") });
- assertEquals('function', typeof C);
- assertEquals('function', typeof D);
- assertTypeError("'use strong'; (function f() {class E {}; E = 0})()");
-})();
-
-function constructor(body) {
- return "'use strong'; " +
- "(class extends Object { constructor() { " + body + " } })";
-}
-
-(function NoSuperExceptCall() {
- assertSyntaxError(constructor("super.a;"));
- assertSyntaxError(constructor("super['a'];"));
- assertSyntaxError(constructor("super.f();"));
- assertSyntaxError(constructor("super.a;"));
- assertSyntaxError(constructor("{ super.a }"));
- assertSyntaxError(constructor("if (0) super.a;"));
- // TODO(rossberg): arrow functions do not handle 'super' yet.
- // assertSyntaxError(constructor("() => super.a;"));
- // assertSyntaxError(constructor("() => () => super.a;"));
- // assertSyntaxError(constructor("() => { () => if (0) { super.a; } }"));
-})();
-
-(function NoMissingSuper() {
- assertReferenceError(constructor(""));
- assertReferenceError(constructor("1"));
-})();
-
-(function NoNestedSuper() {
- assertSyntaxError(constructor("super(), 0;"));
- assertSyntaxError(constructor("(super());"));
- assertSyntaxError(constructor("super().a;"));
- assertSyntaxError(constructor("(() => super())();"));
- assertSyntaxError(constructor("{ super(); }"));
- assertSyntaxError(constructor("if (1) super();"));
- assertSyntaxError(constructor("label: super();"));
-})();
-
-(function NoDuplicateSuper() {
- assertSyntaxError(constructor("super(), super();"));
- assertSyntaxError(constructor("super(); super();"));
- assertSyntaxError(constructor("super(); (super());"));
- assertSyntaxError(constructor("super(); { super() }"));
- assertSyntaxError(constructor("super(); (() => super())();"));
-})();
-
-(function NoSuperAfterThis() {
- assertSyntaxError(constructor("this.a = 0, super();"));
- assertSyntaxError(constructor("this.a = 0; super();"));
- assertSyntaxError(constructor("this.a = 0; super(); this.b = 0;"));
- assertSyntaxError(constructor("this.a = 0; (super());"));
- assertSyntaxError(constructor("super(this.a = 0);"));
-})();
-
-(function NoReturnValue() {
- assertSyntaxError(constructor("return {};"));
- assertSyntaxError(constructor("return undefined;"));
- assertSyntaxError(constructor("return this;"));
- assertSyntaxError(constructor("return this.a = 0;"));
- assertSyntaxError(constructor("{ return {}; }"));
- assertSyntaxError(constructor("if (1) return {};"));
-})();
-
-(function NoReturnBeforeSuper() {
- assertSyntaxError(constructor("return; super();"));
- assertSyntaxError(constructor("if (0) return; super();"));
- assertSyntaxError(constructor("{ return; } super();"));
-})();
-
-(function NoReturnBeforeThis() {
- assertSyntaxError(constructor("return; this.a = 0;"));
- assertSyntaxError(constructor("if (0) return; this.a = 0;"));
- assertSyntaxError(constructor("{ return; } this.a = 0;"));
-})();
-
-(function NoThisExceptInitialization() {
- assertSyntaxError(constructor("this;"));
- assertSyntaxError(constructor("this.a;"));
- assertSyntaxError(constructor("this['a'];"));
- assertSyntaxError(constructor("this();"));
- assertSyntaxError(constructor("this.a();"));
- assertSyntaxError(constructor("this.a.b = 0;"));
- assertSyntaxError(constructor("{ this }"));
- assertSyntaxError(constructor("if (0) this;"));
- // TODO(rossberg): this does not handle arrow functions yet.
- // assertSyntaxError(constructor("() => this;"));
- // assertSyntaxError(constructor("() => () => this;"));
- // assertSyntaxError(constructor("() => { () => if (0) { this; } }"));
-})();
-
-(function NoNestedThis() {
- assertSyntaxError(constructor("(this.a = 0);"));
- assertSyntaxError(constructor("{ this.a = 0; }"));
- assertSyntaxError(constructor("if (0) this.a = 0;"));
- // TODO(rossberg): this does not handle arrow functions yet.
- // assertSyntaxError(constructor("() => this.a = 0;"));
- // assertSyntaxError(constructor("() => { this.a = 0; }"));
- assertSyntaxError(constructor("label: this.a = 0;"));
-})();
diff --git a/test/mjsunit/strong/delete.js b/test/mjsunit/strong/delete.js
deleted file mode 100644
index 349af0b..0000000
--- a/test/mjsunit/strong/delete.js
+++ /dev/null
@@ -1,11 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode
-
-(function NoDelete() {
- const o = {a: 0};
- assertThrows("'use strong'; delete o.a", SyntaxError);
- assertThrows("'use strong'; delete o", SyntaxError);
-})();
diff --git a/test/mjsunit/strong/destructuring.js b/test/mjsunit/strong/destructuring.js
deleted file mode 100644
index 30f6183..0000000
--- a/test/mjsunit/strong/destructuring.js
+++ /dev/null
@@ -1,31 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-//
-// Flags: --harmony-destructuring-bind
-// Flags: --strong-mode --allow-natives-syntax
-
-(function() {
- var f = (function() {
- "use strong";
- return function f({ x = function() { return []; } }) { return x(); };
- })();
- var a = f({ x: undefined });
- assertTrue(%IsStrong(a));
-
- // TODO(rossberg): Loading non-existent properties during destructuring should
- // not throw in strong mode.
- assertThrows(function() { f({}); }, TypeError);
-
- function weakf({ x = function() { return []; } }) { return x(); }
- a = weakf({});
- assertFalse(%IsStrong(a));
-
- function outerf() { return []; }
- var f2 = (function() {
- "use strong";
- return function f2({ x = outerf }) { return x(); };
- })();
- a = f2({ x: undefined });
- assertFalse(%IsStrong(a));
-})();
diff --git a/test/mjsunit/strong/empty-statement.js b/test/mjsunit/strong/empty-statement.js
deleted file mode 100644
index 65edf74..0000000
--- a/test/mjsunit/strong/empty-statement.js
+++ /dev/null
@@ -1,18 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode
-
-(function NoEmptySubStatement() {
- assertThrows("'use strong'; if (1);", SyntaxError);
- assertThrows("'use strong'; if (1) {} else;", SyntaxError);
- assertThrows("'use strong'; while (1);", SyntaxError);
- assertThrows("'use strong'; do; while (1);", SyntaxError);
- assertThrows("'use strong'; for (;;);", SyntaxError);
- assertThrows("'use strong'; for (x in []);", SyntaxError);
- assertThrows("'use strong'; for (x of []);", SyntaxError);
- assertThrows("'use strong'; for (let x;;);", SyntaxError);
- assertThrows("'use strong'; for (let x in []);", SyntaxError);
- assertThrows("'use strong'; for (let x of []);", SyntaxError);
-})();
diff --git a/test/mjsunit/strong/equality.js b/test/mjsunit/strong/equality.js
deleted file mode 100644
index 5e2464c..0000000
--- a/test/mjsunit/strong/equality.js
+++ /dev/null
@@ -1,10 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode
-
-(function NoSloppyEquality() {
- assertThrows("'use strong'; 0 == 0", SyntaxError);
- assertThrows("'use strong'; 0 != 0", SyntaxError);
-})();
diff --git a/test/mjsunit/strong/eval-direct.js b/test/mjsunit/strong/eval-direct.js
deleted file mode 100644
index bb5387e..0000000
--- a/test/mjsunit/strong/eval-direct.js
+++ /dev/null
@@ -1,22 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode
-
-// In strong mode, direct calls to eval are forbidden
-
-assertThrows("'use strong'; eval();", SyntaxError);
-assertThrows("'use strong'; (eval)();", SyntaxError);
-assertThrows("'use strong'; (((eval)))();", SyntaxError);
-assertThrows("'use strong'; eval([]);", SyntaxError);
-assertThrows("'use strong'; eval('function f() {}');", SyntaxError);
-assertThrows("'use strong'; function f() {eval()}", SyntaxError);
-
-assertDoesNotThrow("'use strong'; eval;");
-assertDoesNotThrow("'use strong'; let foo = eval; foo();");
-assertDoesNotThrow("'use strong'; (1, eval)();");
-
-// TODO(neis): The tagged template triggers %ObjectFreeze on an array, which
-// throws when trying to redefine 'length'.
-// assertDoesNotThrow("'use strong'; eval`foo`;");
diff --git a/test/mjsunit/strong/for-in.js b/test/mjsunit/strong/for-in.js
deleted file mode 100644
index 641248c..0000000
--- a/test/mjsunit/strong/for-in.js
+++ /dev/null
@@ -1,11 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode
-
-(function NoForInStatement() {
- assertThrows("'use strong'; for (x in []) {}", SyntaxError);
- assertThrows("'use strong'; for (let x in []) {}", SyntaxError);
- assertThrows("'use strong'; for (const x in []) {}", SyntaxError);
-})();
diff --git a/test/mjsunit/strong/function-arity.js b/test/mjsunit/strong/function-arity.js
deleted file mode 100644
index 11ee212..0000000
--- a/test/mjsunit/strong/function-arity.js
+++ /dev/null
@@ -1,341 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode --harmony-reflect
-// Flags: --allow-natives-syntax
-
-'use strict';
-
-
-function generateArguments(n, prefix) {
- let a = [];
- if (prefix) {
- a.push(prefix);
- }
- for (let i = 0; i < n; i++) {
- a.push(String(i));
- }
-
- return a.join(', ');
-}
-
-
-function generateParams(n, directive_in_body) {
- let a = [];
- for (let i = 0; i < n; i++) {
- a[i] = `p${i}`;
- }
- return a.join(', ');
-}
-
-function generateParamsWithRest(n, directive_in_body) {
- let a = [];
- let i = 0;
- for (; i < n; i++) {
- a[i] = `p${i}`;
- }
- if (!directive_in_body) {
- // If language mode directive occurs in body, rest parameters will trigger
- // an early error regardless of language mode.
- a.push(`...p${i}`);
- }
- return a.join(', ');
-}
-
-
-function generateSpread(n) {
- return `...[${generateArguments(n)}]`;
-}
-
-
-(function FunctionCall() {
- for (let parameterCount = 0; parameterCount < 3; parameterCount++) {
- let defs = [
- `'use strong'; function f(${generateParams(parameterCount)}) {}`,
- `'use strong'; function f(${generateParamsWithRest(parameterCount)}) {}`,
- `'use strong'; function* f(${generateParams(parameterCount)}) {}`,
- `'use strong'; function* f(${generateParamsWithRest(parameterCount)}) {}`,
- `'use strong'; let f = (${generateParams(parameterCount)}) => {}`,
- `function f(${generateParams(parameterCount)}) { 'use strong'; }`,
- `function* f(${generateParams(parameterCount)}) { 'use strong'; }`,
- `let f = (${generateParams(parameterCount)}) => { 'use strong'; }`,
- ];
- for (let def of defs) {
- for (let argumentCount = 0; argumentCount < 3; argumentCount++) {
- let calls = [
- `f(${generateArguments(argumentCount)})`,
- `f(${generateSpread(argumentCount)})`,
- `f.call(${generateArguments(argumentCount, 'undefined')})`,
- `f.call(undefined, ${generateSpread(argumentCount)})`,
- `f.apply(undefined, [${generateArguments(argumentCount)}])`,
- `f.bind(undefined)(${generateArguments(argumentCount)})`,
- `%_Call(f, ${generateArguments(argumentCount, 'undefined')})`,
- `%Call(f, ${generateArguments(argumentCount, 'undefined')})`,
- `%Apply(f, undefined, [${generateArguments(argumentCount)}], 0,
- ${argumentCount})`,
- ];
-
- for (let call of calls) {
- let code = `'use strict'; ${def}; ${call};`;
- if (argumentCount < parameterCount) {
- print(code);
- assertThrows(code, TypeError);
- } else {
- assertDoesNotThrow(code);
- }
- }
- }
-
- let calls = [
- `f.call()`,
- `f.apply()`,
- `f.apply(undefined)`,
- ];
- for (let call of calls) {
- let code = `'use strict'; ${def}; ${call};`;
- if (parameterCount > 0) {
- assertThrows(code, TypeError);
- } else {
- assertDoesNotThrow(code);
- }
- }
- }
- }
-})();
-
-
-(function MethodCall() {
- for (let genParams of [generateParams, generateParamsWithRest]) {
- for (let parameterCount = 0; parameterCount < 3; parameterCount++) {
- let defs = [
- `let o = new class {
- m(${genParams(parameterCount, true)}) { 'use strong'; }
- }`,
- `let o = new class {
- *m(${genParams(parameterCount, true)}) { 'use strong'; }
- }`,
- `let o = { m(${genParams(parameterCount, true)}) { 'use strong'; } }`,
- `let o = { *m(${genParams(parameterCount, true)}) { 'use strong'; } }`,
- `'use strong';
- let o = new class { m(${genParams(parameterCount)}) {} }`,
- `'use strong';
- let o = new class { *m(${genParams(parameterCount)}) {} }`,
- `'use strong'; let o = { m(${genParams(parameterCount)}) {} }`,
- `'use strong'; let o = { *m(${genParams(parameterCount)}) {} }`,
- ];
- for (let def of defs) {
- for (let argumentCount = 0; argumentCount < 3; argumentCount++) {
- let calls = [
- `o.m(${generateArguments(argumentCount)})`,
- `o.m(${generateSpread(argumentCount)})`,
- `o.m.call(${generateArguments(argumentCount, 'o')})`,
- `o.m.call(o, ${generateSpread(argumentCount)})`,
- `o.m.apply(o, [${generateArguments(argumentCount)}])`,
- `o.m.bind(o)(${generateArguments(argumentCount)})`,
- `%_Call(o.m, ${generateArguments(argumentCount, 'o')})`,
- `%Call(o.m, ${generateArguments(argumentCount, 'o')})`,
- `%Apply(o.m, o, [${generateArguments(argumentCount)}], 0,
- ${argumentCount})`,
- ];
-
- for (let call of calls) {
- let code = `'use strict'; ${def}; ${call};`;
- if (argumentCount < parameterCount) {
- assertThrows(code, TypeError);
- } else {
- assertDoesNotThrow(code);
- }
- }
- }
-
- let calls = [
- `o.m.call()`,
- `o.m.apply()`,
- `o.m.apply(o)`,
- ];
- for (let call of calls) {
- let code = `'use strict'; ${def}; ${call};`;
- if (parameterCount > 0) {
- assertThrows(code, TypeError);
- } else {
- assertDoesNotThrow(code);
- }
- }
- }
- }
- }
-})();
-
-
-(function Constructor() {
- for (let genParams of [generateParams, generateParamsWithRest]) {
- for (let argumentCount = 0; argumentCount < 3; argumentCount++) {
- for (let parameterCount = 0; parameterCount < 3; parameterCount++) {
- let defs = [
- `'use strong';
- class C { constructor(${genParams(parameterCount)}) {} }`,
- ];
- for (let def of defs) {
- let calls = [
- `new C(${generateArguments(argumentCount)})`,
- `new C(${generateSpread(argumentCount)})`,
- `Reflect.construct(C, [${generateArguments(argumentCount)}])`,
- ];
- for (let call of calls) {
- let code = `${def}; ${call};`;
- if (argumentCount < parameterCount) {
- assertThrows(code, TypeError);
- } else {
- assertDoesNotThrow(code);
- }
- }
- }
- }
- }
- }
-})();
-
-
-(function DerivedConstructor() {
- for (let genParams of [generateParams, generateParamsWithRest]) {
- for (let genArgs of [generateArguments, generateSpread]) {
- for (let argumentCount = 0; argumentCount < 3; argumentCount++) {
- for (let parameterCount = 0; parameterCount < 3; parameterCount++) {
- let defs = [
- `'use strong';
- class B {
- constructor(${genParams(parameterCount)}) {}
- }
- class C extends B {
- constructor() {
- super(${genArgs(argumentCount)});
- }
- }`,
- ];
- for (let def of defs) {
- let code = `${def}; new C();`;
- if (argumentCount < parameterCount) {
- assertThrows(code, TypeError);
- } else {
- assertDoesNotThrow(code);
- }
- }
- }
- }
- }
- }
-})();
-
-
-(function DerivedConstructorDefaultConstructorInDerivedClass() {
- for (let genParams of [generateParams, generateParamsWithRest]) {
- for (let genArgs of [generateArguments, generateSpread]) {
- for (let argumentCount = 0; argumentCount < 3; argumentCount++) {
- for (let parameterCount = 0; parameterCount < 3; parameterCount++) {
- let defs = [
- `'use strong';
- class B {
- constructor(${genParams(parameterCount)}) {}
- }
- class C extends B {}`,
- ];
- for (let def of defs) {
- let code = `${def}; new C(${genArgs(argumentCount)})`;
- if (argumentCount < parameterCount) {
- assertThrows(code, TypeError);
- } else {
- assertDoesNotThrow(code);
- }
- }
- }
- }
- }
- }
-})();
-
-
-(function TestOptimized() {
- function f(x, y) { 'use strong'; }
-
- assertThrows(f, TypeError);
- %OptimizeFunctionOnNextCall(f);
- assertThrows(f, TypeError);
-
- function g() {
- f(1);
- }
- assertThrows(g, TypeError);
- %OptimizeFunctionOnNextCall(g);
- assertThrows(g, TypeError);
-
- f(1, 2);
- %OptimizeFunctionOnNextCall(f);
- f(1, 2);
-})();
-
-
-(function TestOptimized2() {
- 'use strong';
- function f(x, y) {}
-
- assertThrows(f, TypeError);
- %OptimizeFunctionOnNextCall(f);
- assertThrows(f, TypeError);
-
- function g() {
- f(1);
- }
- assertThrows(g, TypeError);
- %OptimizeFunctionOnNextCall(g);
- assertThrows(g, TypeError);
-
- f(1, 2);
- %OptimizeFunctionOnNextCall(f);
- f(1, 2);
-})();
-
-
-(function TestOptimized3() {
- function f(x, y) {}
- function g() {
- 'use strong';
- f(1);
- }
-
- g();
- %OptimizeFunctionOnNextCall(f);
- g();
-})();
-
-
-(function ParametersSuper() {
- for (let genArgs of [generateArguments, generateSpread]) {
- for (let argumentCount = 0; argumentCount < 3; argumentCount++) {
- for (let parameterCount = 0; parameterCount < 3; parameterCount++) {
- let defs = [
- `'use strict';
- class B {
- m(${generateParams(parameterCount)} ){ 'use strong' }
- }`,
- `'use strong'; class B { m(${generateParams(parameterCount)}) {} }`,
- ];
- for (let def of defs) {
- let code = `${def};
- class D extends B {
- m() {
- super.m(${genArgs(argumentCount)});
- }
- }
- new D().m()`;
- print('\n\n' + code);
- if (argumentCount < parameterCount) {
- assertThrows(code, TypeError);
- } else {
- assertDoesNotThrow(code);
- }
- }
- }
- }
- }
-})();
diff --git a/test/mjsunit/strong/functions.js b/test/mjsunit/strong/functions.js
deleted file mode 100644
index a237270..0000000
--- a/test/mjsunit/strong/functions.js
+++ /dev/null
@@ -1,87 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode
-
-'use strong';
-
-function f() {}
-function* g() {}
-
-(function NoArguments() {
- assertThrows("'use strong'; arguments", SyntaxError);
- assertThrows("'use strong'; function f() { arguments }", SyntaxError);
- assertThrows("'use strong'; function* g() { arguments }", SyntaxError);
- assertThrows("'use strong'; let f = function() { arguments }", SyntaxError);
- assertThrows("'use strong'; let g = function*() { arguments }", SyntaxError);
- assertThrows("'use strong'; let f = () => arguments", SyntaxError);
- // The following are strict mode errors already.
- assertThrows("'use strong'; let arguments", SyntaxError);
- assertThrows("'use strong'; function f(arguments) {}", SyntaxError);
- assertThrows("'use strong'; function* g(arguments) {}", SyntaxError);
- assertThrows("'use strong'; let f = (arguments) => {}", SyntaxError);
-})();
-
-(function NoArgumentsProperty() {
- assertFalse(f.hasOwnProperty("arguments"));
- assertFalse(g.hasOwnProperty("arguments"));
- assertThrows(function(){ f.arguments = 0 }, TypeError);
- assertThrows(function(){ g.arguments = 0 }, TypeError);
-})();
-
-(function NoCaller() {
- assertFalse(f.hasOwnProperty("caller"));
- assertFalse(g.hasOwnProperty("caller"));
- assertThrows(function(){ f.caller = 0 }, TypeError);
- assertThrows(function(){ g.caller = 0 }, TypeError);
-})();
-
-(function NoCallee() {
- assertFalse("callee" in f);
- assertFalse("callee" in g);
- assertThrows(function(){ f.callee = 0 }, TypeError);
- assertThrows(function(){ g.callee = 0 }, TypeError);
-})();
-
-(function LexicalBindings(global) {
- assertEquals('function', typeof f);
- assertEquals('function', typeof g);
- assertFalse(global.hasOwnProperty("f"));
- assertFalse(global.hasOwnProperty("g"));
-})(this);
-
-(function ImmutableBindings() {
- function f2() {}
- function* g2() {}
- assertThrows(function(){ f = 0 }, TypeError);
- assertThrows(function(){ g = 0 }, TypeError);
- assertThrows(function(){ f2 = 0 }, TypeError);
- assertThrows(function(){ g2 = 0 }, TypeError);
- assertEquals('function', typeof f);
- assertEquals('function', typeof g);
- assertEquals('function', typeof f2);
- assertEquals('function', typeof g2);
-})();
-
-(function NonExtensible() {
- assertThrows(function(){ f.a = 0 }, TypeError);
- assertThrows(function(){ g.a = 0 }, TypeError);
- assertThrows(function(){ Object.defineProperty(f, "a", {value: 0}) }, TypeError);
- assertThrows(function(){ Object.defineProperty(g, "a", {value: 0}) }, TypeError);
- assertThrows(function(){ Object.setPrototypeOf(f, {}) }, TypeError);
- assertThrows(function(){ Object.setPrototypeOf(g, {}) }, TypeError);
-})();
-
-(function NoPrototype() {
- assertFalse("prototype" in f);
- assertFalse(g.hasOwnProperty("prototype"));
- assertThrows(function(){ f.prototype = 0 }, TypeError);
- assertThrows(function(){ g.prototype = 0 }, TypeError);
- assertThrows(function(){ f.prototype.a = 0 }, TypeError);
-})();
-
-(function NonConstructor() {
- assertThrows(function(){ new f }, TypeError);
- assertThrows(function(){ new g }, TypeError);
-})();
diff --git a/test/mjsunit/strong/implicit-conversions-constants.js b/test/mjsunit/strong/implicit-conversions-constants.js
deleted file mode 100644
index c240562..0000000
--- a/test/mjsunit/strong/implicit-conversions-constants.js
+++ /dev/null
@@ -1,203 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode --allow-natives-syntax
-
-"use strict";
-
-function getTestFuncs() {
- "use strong";
- return [
- function(x){return 1 + true;},
- function(x){return 1 - true;},
- function(x){return 1 * true;},
- function(x){return 1 / true;},
- function(x){return 1 % true;},
- function(x){return 1 | true;},
- function(x){return 1 & true;},
- function(x){return 1 ^ true;},
- function(x){return 1 << true;},
- function(x){return 1 >> true;},
- function(x){return 1 >>> true;},
- function(x){return 1 < true;},
- function(x){return 1 > true;},
- function(x){return 1 <= true;},
- function(x){return 1 >= true;},
- function(x){return 1 + undefined;},
- function(x){return 1 - undefined;},
- function(x){return 1 * undefined;},
- function(x){return 1 / undefined;},
- function(x){return 1 % undefined;},
- function(x){return 1 | undefined;},
- function(x){return 1 & undefined;},
- function(x){return 1 ^ undefined;},
- function(x){return 1 << undefined;},
- function(x){return 1 >> undefined;},
- function(x){return 1 >>> undefined;},
- function(x){return 1 < undefined;},
- function(x){return 1 > undefined;},
- function(x){return 1 <= undefined;},
- function(x){return 1 >= undefined;},
- function(x){return 1 + null;},
- function(x){return 1 - null;},
- function(x){return 1 * null;},
- function(x){return 1 / null;},
- function(x){return 1 % null;},
- function(x){return 1 | null;},
- function(x){return 1 & null;},
- function(x){return 1 ^ null;},
- function(x){return 1 << null;},
- function(x){return 1 >> null;},
- function(x){return 1 >>> null;},
- function(x){return 1 < null;},
- function(x){return 1 > null;},
- function(x){return 1 <= null;},
- function(x){return 1 >= null;},
- function(x){return NaN + true;},
- function(x){return NaN - true;},
- function(x){return NaN * true;},
- function(x){return NaN / true;},
- function(x){return NaN % true;},
- function(x){return NaN | true;},
- function(x){return NaN & true;},
- function(x){return NaN ^ true;},
- function(x){return NaN << true;},
- function(x){return NaN >> true;},
- function(x){return NaN >>> true;},
- function(x){return NaN < true;},
- function(x){return NaN > true;},
- function(x){return NaN <= true;},
- function(x){return NaN >= true;},
- function(x){return NaN + undefined;},
- function(x){return NaN - undefined;},
- function(x){return NaN * undefined;},
- function(x){return NaN / undefined;},
- function(x){return NaN % undefined;},
- function(x){return NaN | undefined;},
- function(x){return NaN & undefined;},
- function(x){return NaN ^ undefined;},
- function(x){return NaN << undefined;},
- function(x){return NaN >> undefined;},
- function(x){return NaN >>> undefined;},
- function(x){return NaN < undefined;},
- function(x){return NaN > undefined;},
- function(x){return NaN <= undefined;},
- function(x){return NaN >= undefined;},
- function(x){return NaN + null;},
- function(x){return NaN - null;},
- function(x){return NaN * null;},
- function(x){return NaN / null;},
- function(x){return NaN % null;},
- function(x){return NaN | null;},
- function(x){return NaN & null;},
- function(x){return NaN ^ null;},
- function(x){return NaN << null;},
- function(x){return NaN >> null;},
- function(x){return NaN >>> null;},
- function(x){return NaN < null;},
- function(x){return NaN > null;},
- function(x){return NaN <= null;},
- function(x){return NaN >= null;},
- function(x){return true + 1;},
- function(x){return true - 1;},
- function(x){return true * 1;},
- function(x){return true / 1;},
- function(x){return true % 1;},
- function(x){return true | 1;},
- function(x){return true & 1;},
- function(x){return true ^ 1;},
- function(x){return true << 1;},
- function(x){return true >> 1;},
- function(x){return true >>> 1;},
- function(x){return true < 1;},
- function(x){return true > 1;},
- function(x){return true <= 1;},
- function(x){return true >= 1;},
- function(x){return undefined + 1;},
- function(x){return undefined - 1;},
- function(x){return undefined * 1;},
- function(x){return undefined / 1;},
- function(x){return undefined % 1;},
- function(x){return undefined | 1;},
- function(x){return undefined & 1;},
- function(x){return undefined ^ 1;},
- function(x){return undefined << 1;},
- function(x){return undefined >> 1;},
- function(x){return undefined >>> 1;},
- function(x){return undefined < 1;},
- function(x){return undefined > 1;},
- function(x){return undefined <= 1;},
- function(x){return undefined >= 1;},
- function(x){return null + 1;},
- function(x){return null - 1;},
- function(x){return null * 1;},
- function(x){return null / 1;},
- function(x){return null % 1;},
- function(x){return null | 1;},
- function(x){return null & 1;},
- function(x){return null ^ 1;},
- function(x){return null << 1;},
- function(x){return null >> 1;},
- function(x){return null >>> 1;},
- function(x){return null < 1;},
- function(x){return null > 1;},
- function(x){return null <= 1;},
- function(x){return null >= 1;},
- function(x){return true + NaN;},
- function(x){return true - NaN;},
- function(x){return true * NaN;},
- function(x){return true / NaN;},
- function(x){return true % NaN;},
- function(x){return true | NaN;},
- function(x){return true & NaN;},
- function(x){return true ^ NaN;},
- function(x){return true << NaN;},
- function(x){return true >> NaN;},
- function(x){return true >>> NaN;},
- function(x){return true < NaN;},
- function(x){return true > NaN;},
- function(x){return true <= NaN;},
- function(x){return true >= NaN;},
- function(x){return undefined + NaN;},
- function(x){return undefined - NaN;},
- function(x){return undefined * NaN;},
- function(x){return undefined / NaN;},
- function(x){return undefined % NaN;},
- function(x){return undefined | NaN;},
- function(x){return undefined & NaN;},
- function(x){return undefined ^ NaN;},
- function(x){return undefined << NaN;},
- function(x){return undefined >> NaN;},
- function(x){return undefined >>> NaN;},
- function(x){return undefined < NaN;},
- function(x){return undefined > NaN;},
- function(x){return undefined <= NaN;},
- function(x){return undefined >= NaN;},
- function(x){return null + NaN;},
- function(x){return null - NaN;},
- function(x){return null * NaN;},
- function(x){return null / NaN;},
- function(x){return null % NaN;},
- function(x){return null | NaN;},
- function(x){return null & NaN;},
- function(x){return null ^ NaN;},
- function(x){return null << NaN;},
- function(x){return null >> NaN;},
- function(x){return null >>> NaN;},
- function(x){return null < NaN;},
- function(x){return null > NaN;},
- function(x){return null <= NaN;},
- function(x){return null >= NaN;}
- ];
-}
-
-for (let func of getTestFuncs()) {
- assertThrows(func, TypeError);
- assertThrows(func, TypeError);
- assertThrows(func, TypeError);
- %OptimizeFunctionOnNextCall(func);
- assertThrows(func, TypeError);
- %DeoptimizeFunction(func);
- assertThrows(func, TypeError);
-}
diff --git a/test/mjsunit/strong/implicit-conversions-count.js b/test/mjsunit/strong/implicit-conversions-count.js
deleted file mode 100644
index 88ed3c2..0000000
--- a/test/mjsunit/strong/implicit-conversions-count.js
+++ /dev/null
@@ -1,168 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode --allow-natives-syntax
-
-"use strict";
-
-function pre_inc(x) {
- return ++x;
-}
-
-function post_inc(x) {
- return x++;
-}
-
-function pre_dec(x) {
- return --x;
-}
-
-function post_dec(x) {
- return x--;
-}
-
-function getTestFuncs() {
- return [
- function(x){
- "use strong";
- let y = x;
- assertEquals(++y, pre_inc(x));
- try {
- assertEquals(x+1, y)
- } catch (e) {
- assertUnreachable();
- }
- },
- function(x){
- "use strong";
- let y = x;
- assertEquals(y++, post_inc(x));
- try {
- assertEquals(x+1, y)
- } catch (e) {
- assertUnreachable();
- }
- },
- function(x){
- "use strong";
- let y = x;
- assertEquals(--y, pre_dec(x));
- try {
- assertEquals(x-1, y)
- } catch (e) {
- assertUnreachable();
- }
- },
- function(x){
- "use strong";
- let y = x;
- assertEquals(y--, post_dec(x));
- try {
- assertEquals(x-1, y)
- } catch (e) {
- assertUnreachable();
- }
- },
- function(x){
- "use strong";
- let obj = { foo: x };
- let y = ++obj.foo;
- assertEquals(y, pre_inc(x));
- try {
- assertEquals(x+1, obj.foo)
- } catch (e) {
- assertUnreachable();
- }
- },
- function(x){
- "use strong";
- let obj = { foo: x };
- let y = obj.foo++;
- assertEquals(y, post_inc(x));
- try {
- assertEquals(x+1, obj.foo)
- } catch (e) {
- assertUnreachable();
- }
- },
- function(x){
- "use strong";
- let obj = { foo: x };
- let y = --obj.foo;
- assertEquals(y, pre_dec(x));
- try {
- assertEquals(x-1, obj.foo)
- } catch (e) {
- assertUnreachable();
- }
- },
- function(x){
- "use strong";
- let obj = { foo: x };
- let y = obj.foo--;
- assertEquals(y, post_dec(x));
- try {
- assertEquals(x-1, obj.foo)
- } catch (e) {
- assertUnreachable();
- }
- },
- ];
-}
-
-let nonNumberValues = [
- {},
- (function(){}),
- [],
- (class Foo {}),
- "",
- "foo",
- "NaN",
- Object(""),
- false,
- null,
- undefined
-];
-
-// Check prior input of None works
-for (let func of getTestFuncs()) {
- for (let value of nonNumberValues) {
- assertThrows(function(){func(value)}, TypeError);
- assertThrows(function(){func(value)}, TypeError);
- assertThrows(function(){func(value)}, TypeError);
- %OptimizeFunctionOnNextCall(func);
- assertThrows(function(){func(value)}, TypeError);
- %DeoptimizeFunction(func);
- }
-}
-
-// Check prior input of Smi works
-for (let func of getTestFuncs()) {
- func(1);
- func(1);
- func(1);
- for (let value of nonNumberValues) {
- assertThrows(function(){func(value)}, TypeError);
- assertThrows(function(){func(value)}, TypeError);
- assertThrows(function(){func(value)}, TypeError);
- %OptimizeFunctionOnNextCall(func);
- assertThrows(function(){func(value)}, TypeError);
- %DeoptimizeFunction(func);
- }
-}
-
-// Check prior input of Number works
-for (let func of getTestFuncs()) {
- func(9999999999999);
- func(9999999999999);
- func(9999999999999);
- for (let value of nonNumberValues) {
- assertThrows(function(){func(value)}, TypeError);
- assertThrows(function(){func(value)}, TypeError);
- assertThrows(function(){func(value)}, TypeError);
- %OptimizeFunctionOnNextCall(func);
- assertThrows(function(){func(value)}, TypeError);
- %DeoptimizeFunction(func);
- }
-}
diff --git a/test/mjsunit/strong/implicit-conversions-inlining.js b/test/mjsunit/strong/implicit-conversions-inlining.js
deleted file mode 100644
index 15997a3..0000000
--- a/test/mjsunit/strong/implicit-conversions-inlining.js
+++ /dev/null
@@ -1,442 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode --allow-natives-syntax
-
-"use strict";
-
-//******************************************************************************
-// Number function declarations
-function inline_add_strong(x, y) {
- "use strong";
- return x + y;
-}
-
-function inline_add_strong_outer(x, y) {
- return inline_add_strong(x, y);
-}
-
-function inline_sub_strong(x, y) {
- "use strong";
- return x - y;
-}
-
-function inline_sub_strong_outer(x, y) {
- return inline_sub_strong(x, y);
-}
-
-function inline_mul_strong(x, y) {
- "use strong";
- return x * y;
-}
-
-function inline_mul_strong_outer(x, y) {
- return inline_mul_strong(x, y);
-}
-
-function inline_div_strong(x, y) {
- "use strong";
- return x / y;
-}
-
-function inline_div_strong_outer(x, y) {
- return inline_div_strong(x, y);
-}
-
-function inline_mod_strong(x, y) {
- "use strong";
- return x % y;
-}
-
-function inline_mod_strong_outer(x, y) {
- return inline_mod_strong(x, y);
-}
-
-function inline_or_strong(x, y) {
- "use strong";
- return x | y;
-}
-
-function inline_or_strong_outer(x, y) {
- return inline_or_strong(x, y);
-}
-
-function inline_and_strong(x, y) {
- "use strong";
- return x & y;
-}
-
-function inline_and_strong_outer(x, y) {
- return inline_and_strong(x, y);
-}
-
-function inline_xor_strong(x, y) {
- "use strong";
- return x ^ y;
-}
-
-function inline_xor_strong_outer(x, y) {
- return inline_xor_strong(x, y);
-}
-
-function inline_shl_strong(x, y) {
- "use strong";
- return x << y;
-}
-
-function inline_shl_strong_outer(x, y) {
- return inline_shl_strong(x, y);
-}
-
-function inline_shr_strong(x, y) {
- "use strong";
- return x >> y;
-}
-
-function inline_shr_strong_outer(x, y) {
- return inline_shr_strong(x, y);
-}
-
-function inline_sar_strong(x, y) {
- "use strong";
- return x >>> y;
-}
-
-function inline_sar_strong_outer(x, y) {
- return inline_sar_strong(x, y);
-}
-
-function inline_less_strong(x, y) {
- "use strong";
- return x < y;
-}
-
-function inline_less_strong_outer(x, y) {
- return inline_less_strong(x, y);
-}
-
-function inline_greater_strong(x, y) {
- "use strong";
- return x > y;
-}
-
-function inline_greater_strong_outer(x, y) {
- return inline_greater_strong(x, y);
-}
-
-function inline_less_equal_strong(x, y) {
- "use strong";
- return x <= y;
-}
-
-function inline_less_equal_strong_outer(x, y) {
- return inline_less_equal_strong(x, y);
-}
-
-function inline_greater_equal_strong(x, y) {
- "use strong";
- return x >= y;
-}
-
-function inline_greater_equal_strong_outer(x, y) {
- return inline_greater_equal_strong(x, y);
-}
-
-function inline_add(x, y) {
- return x + y;
-}
-
-function inline_add_outer_strong(x, y) {
- "use strong";
- return inline_add(x, y);
-}
-
-function inline_sub(x, y) {
- return x - y;
-}
-
-function inline_sub_outer_strong(x, y) {
- "use strong";
- return inline_sub(x, y);
-}
-
-function inline_mul(x, y) {
- return x * y;
-}
-
-function inline_mul_outer_strong(x, y) {
- "use strong";
- return inline_mul(x, y);
-}
-
-function inline_div(x, y) {
- return x / y;
-}
-
-function inline_div_outer_strong(x, y) {
- "use strong";
- return inline_div(x, y);
-}
-
-function inline_mod(x, y) {
- return x % y;
-}
-
-function inline_mod_outer_strong(x, y) {
- "use strong";
- return inline_mod(x, y);
-}
-
-function inline_or(x, y) {
- return x | y;
-}
-
-function inline_or_outer_strong(x, y) {
- "use strong";
- return inline_or(x, y);
-}
-
-function inline_and(x, y) {
- return x & y;
-}
-
-function inline_and_outer_strong(x, y) {
- "use strong";
- return inline_and(x, y);
-}
-
-function inline_xor(x, y) {
- return x ^ y;
-}
-
-function inline_xor_outer_strong(x, y) {
- "use strong";
- return inline_xor(x, y);
-}
-
-function inline_shl(x, y) {
- return x << y;
-}
-
-function inline_shl_outer_strong(x, y) {
- "use strong";
- return inline_shl(x, y);
-}
-
-function inline_shr(x, y) {
- return x >> y;
-}
-
-function inline_shr_outer_strong(x, y) {
- "use strong";
- return inline_shr(x, y);
-}
-
-function inline_sar(x, y) {
- return x >>> y;
-}
-
-function inline_sar_outer_strong(x, y) {
- "use strong";
- return inline_sar(x, y);
-}
-
-function inline_less(x, y) {
- return x < y;
-}
-
-function inline_less_outer_strong(x, y) {
- "use strong";
- return inline_less(x, y);
-}
-
-function inline_greater(x, y) {
- return x > y;
-}
-
-function inline_greater_outer_strong(x, y) {
- "use strong";
- return inline_greater(x, y);
-}
-
-function inline_less_equal(x, y) {
- return x <= y;
-}
-
-function inline_less_equal_outer_strong(x, y) {
- "use strong";
- return inline_less_equal(x, y);
-}
-
-function inline_greater_equal(x, y) {
- return x >>> y;
-}
-
-function inline_greater_equal_outer_strong(x, y) {
- "use strong";
- return inline_greater_equal(x, y);
-}
-
-//******************************************************************************
-// String function declarations
-function inline_add_string_strong(x, y) {
- "use strong";
- return x + y;
-}
-
-function inline_add_string_strong_outer(x, y) {
- return inline_add_string_strong(x, y);
-}
-
-function inline_less_string_strong(x, y) {
- "use strong";
- return x < y;
-}
-
-function inline_less_string_strong_outer(x, y) {
- return inline_less_string_strong(x, y);
-}
-
-function inline_greater_string_strong(x, y) {
- "use strong";
- return x > y;
-}
-
-function inline_greater_string_strong_outer(x, y) {
- return inline_greater_string_strong(x, y);
-}
-
-function inline_less_equal_string_strong(x, y) {
- "use strong";
- return x <= y;
-}
-
-function inline_less_equal_string_strong_outer(x, y) {
- return inline_less_equal_string_strong(x, y);
-}
-
-function inline_greater_equal_string_strong(x, y) {
- "use strong";
- return x >= y;
-}
-
-function inline_greater_equal_string_strong_outer(x, y) {
- return inline_greater_equal_string_strong(x, y);
-}
-
-function inline_add_string(x, y) {
- return x + y;
-}
-
-function inline_add_string_outer_strong(x, y) {
- "use strong";
- return inline_add_string(x, y);
-}
-
-function inline_less_string(x, y) {
- return x < y;
-}
-
-function inline_less_string_outer_strong(x, y) {
- "use strong";
- return inline_less_string(x, y);
-}
-
-function inline_greater_string(x, y) {
- return x > y;
-}
-
-function inline_greater_string_outer_strong(x, y) {
- "use strong";
- return inline_greater_string(x, y);
-}
-
-function inline_less_equal_string(x, y) {
- return x <= y;
-}
-
-function inline_less_equal_string_outer_strong(x, y) {
- "use strong";
- return inline_less_equal_string(x, y);
-}
-
-function inline_greater_equal_string(x, y) {
- return x >= y;
-}
-
-function inline_greater_equal_string_outer_strong(x, y) {
- "use strong";
- return inline_greater_equal_string(x, y);
-}
-
-
-//******************************************************************************
-// Testing
-let strong_inner_funcs_num = [inline_add_strong_outer, inline_sub_strong_outer,
- inline_mul_strong_outer, inline_div_strong_outer,
- inline_mod_strong_outer, inline_or_strong_outer,
- inline_and_strong_outer, inline_xor_strong_outer,
- inline_shl_strong_outer, inline_shr_strong_outer,
- inline_less_strong_outer,
- inline_greater_strong_outer,
- inline_less_equal_strong_outer,
- inline_greater_equal_strong_outer];
-
-let strong_outer_funcs_num = [inline_add_outer_strong, inline_sub_outer_strong,
- inline_mul_outer_strong, inline_div_outer_strong,
- inline_mod_outer_strong, inline_or_outer_strong,
- inline_and_outer_strong, inline_xor_outer_strong,
- inline_shl_outer_strong, inline_shr_outer_strong,
- inline_less_outer_strong,
- inline_greater_outer_strong,
- inline_less_equal_outer_strong,
- inline_greater_equal_outer_strong];
-
-let strong_inner_funcs_string = [inline_add_string_strong_outer,
- inline_less_string_strong_outer,
- inline_greater_string_strong_outer,
- inline_less_equal_string_strong_outer,
- inline_greater_equal_string_strong_outer];
-
-let strong_outer_funcs_string = [inline_add_string_outer_strong,
- inline_less_string_outer_strong,
- inline_greater_string_outer_strong,
- inline_less_equal_string_outer_strong,
- inline_greater_equal_string_outer_strong];
-
-for (let strong_inner_func of strong_inner_funcs_num) {
- assertThrows(function(){strong_inner_func(1, {})}, TypeError);
- for (var i = 0; i < 100; i++) {
- strong_inner_func(1, 2);
- }
- %OptimizeFunctionOnNextCall(strong_inner_func);
- assertThrows(function(){strong_inner_func(1, {})}, TypeError);
-}
-
-for (let strong_outer_func of strong_outer_funcs_num) {
- assertDoesNotThrow(function(){strong_outer_func(1, {})});
- for (var i = 0; i < 100; i++) {
- strong_outer_func(1, 2);
- }
- %OptimizeFunctionOnNextCall(strong_outer_func);
- assertDoesNotThrow(function(){strong_outer_func(1, {})});
-}
-
-for (let strong_inner_func of strong_inner_funcs_string) {
- assertThrows(function(){strong_inner_func("foo", {})}, TypeError);
- for (var i = 0; i < 100; i++) {
- strong_inner_func("foo", "bar");
- }
- %OptimizeFunctionOnNextCall(strong_inner_func);
- assertThrows(function(){strong_inner_func("foo", {})}, TypeError);
-}
-
-for (let strong_outer_func of strong_outer_funcs_string) {
- assertDoesNotThrow(function(){strong_outer_func("foo", {})});
- for (var i = 0; i < 100; i++) {
- strong_outer_func("foo", "bar");
- }
- %OptimizeFunctionOnNextCall(strong_outer_func);
- assertDoesNotThrow(function(){strong_outer_func("foo", {})});
-}
diff --git a/test/mjsunit/strong/implicit-conversions.js b/test/mjsunit/strong/implicit-conversions.js
deleted file mode 100644
index cd8acf7..0000000
--- a/test/mjsunit/strong/implicit-conversions.js
+++ /dev/null
@@ -1,412 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode --allow-natives-syntax
-
-"use strict";
-
-// Boolean indicates whether an operator can be part of a compound assignment.
-let strongNumberBinops = [
- ["-", true],
- ["*", true],
- ["/", true],
- ["%", true],
- ["|", true],
- ["&", true],
- ["^", true],
- ["<<", true],
- [">>", true],
- [">>>", true]
-];
-
-let strongStringOrNumberBinops = [
- ["+", true],
- ["<", false],
- [">", false],
- ["<=", false],
- [">=", false]
-];
-
-let strongBinops = strongNumberBinops.concat(strongStringOrNumberBinops);
-
-let strongUnops = [
- "~",
- "+",
- "-"
-];
-
-let nonStringOrNumberValues = [
- "null",
- "undefined",
- "{}",
- "false",
- "(function(){})",
- "[]",
- "(class Foo {})"
-];
-
-let stringValues = [
- "''",
- "' '",
- "'foo'",
- "'f\\u006F\\u006F'",
- "'0'",
- "'NaN'"
-];
-
-let nonNumberValues = nonStringOrNumberValues.concat(stringValues);
-
-let numberValues = [
- "0",
- "(-0)",
- "1",
- "(-4294967295)",
- "(-4294967296)",
- "9999999999999",
- "(-9999999999999)",
- "NaN",
- "Infinity",
- "(-Infinity)"
-];
-
-//******************************************************************************
-// Relational comparison function declarations
-function add_strong(x, y) {
- "use strong";
- return x + y;
-}
-
-function add_num_strong(x, y) {
- "use strong";
- return x + y;
-}
-
-function sub_strong(x, y) {
- "use strong";
- return x - y;
-}
-
-function mul_strong(x, y) {
- "use strong";
- return x * y;
-}
-
-function div_strong(x, y) {
- "use strong";
- return x / y;
-}
-
-function mod_strong(x, y) {
- "use strong";
- return x % y;
-}
-
-function or_strong(x, y) {
- "use strong";
- return x | y;
-}
-
-function and_strong(x, y) {
- "use strong";
- return x & y;
-}
-
-function xor_strong(x, y) {
- "use strong";
- return x ^ y;
-}
-
-function shl_strong(x, y) {
- "use strong";
- return x << y;
-}
-
-function shr_strong(x, y) {
- "use strong";
- return x >> y;
-}
-
-function sar_strong(x, y) {
- "use strong";
- return x >>> y;
-}
-
-function less_strong(x, y) {
- "use strong";
- return x < y;
-}
-
-function less_num_strong(x, y) {
- "use strong";
- return x < y;
-}
-
-function greater_strong(x, y) {
- "use strong";
- return x > y;
-}
-
-function greater_num_strong(x, y) {
- "use strong";
- return x > y;
-}
-
-function less_equal_strong(x, y) {
- "use strong";
- return x <= y;
-}
-
-function less_equal_num_strong(x, y) {
- "use strong";
- return x <= y;
-}
-
-function greater_equal_strong(x, y) {
- "use strong";
- return x >= y;
-}
-
-function greater_equal_num_strong(x, y) {
- "use strong";
- return x >= y;
-}
-
-function typed_add_strong(x, y) {
- "use strong";
- return (+x) + (+y);
-}
-
-function typed_sub_strong(x, y) {
- "use strong";
- return (+x) - (+y);
-}
-
-function typed_mul_strong(x, y) {
- "use strong";
- return (+x) * (+y);
-}
-
-function typed_div_strong(x, y) {
- "use strong";
- return (+x) / (+y);
-}
-
-function typed_mod_strong(x, y) {
- "use strong";
- return (+x) % (+y);
-}
-
-function typed_or_strong(x, y) {
- "use strong";
- return (+x) | (+y);
-}
-
-function typed_and_strong(x, y) {
- "use strong";
- return (+x) & (+y);
-}
-
-function typed_xor_strong(x, y) {
- "use strong";
- return (+x) ^ (+y);
-}
-
-function typed_shl_strong(x, y) {
- "use strong";
- return (+x) << (+y);
-}
-
-function typed_shr_strong(x, y) {
- "use strong";
- return (+x) >> (+y);
-}
-
-function typed_sar_strong(x, y) {
- "use strong";
- return (+x) >>> (+y);
-}
-
-function typed_less_strong(x, y) {
- "use strong";
- return (+x) < (+y);
-}
-
-function typed_greater_strong(x, y) {
- "use strong";
- return (+x) > (+y);
-}
-
-function typed_less_equal_strong(x, y) {
- "use strong";
- return (+x) <= (+y);
-}
-
-function typed_greater_equal_strong(x, y) {
- "use strong";
- return (+x) >= (+y);
-}
-
-//******************************************************************************
-// (in)equality function declarations
-function str_equal_strong(x, y) {
- "use strong";
- return x === y;
-}
-
-function str_ineq_strong(x, y) {
- "use strong";
- return x !== y;
-}
-
-let strongNumberFuncs = [add_num_strong, sub_strong, mul_strong, div_strong,
- mod_strong, or_strong, and_strong, xor_strong,
- shl_strong, shr_strong, sar_strong, less_num_strong,
- greater_num_strong, less_equal_num_strong,
- greater_equal_num_strong, typed_add_strong,
- typed_sub_strong, typed_mul_strong, typed_div_strong,
- typed_mod_strong, typed_or_strong, typed_and_strong,
- typed_xor_strong, typed_shl_strong, typed_shr_strong,
- typed_sar_strong, typed_less_strong,
- typed_greater_strong, typed_less_equal_strong,
- typed_greater_equal_strong];
-
-let strongStringOrNumberFuncs = [add_strong, less_strong, greater_strong,
- less_equal_strong, greater_equal_strong];
-
-let strongFuncs = strongNumberFuncs.concat(strongStringOrNumberFuncs);
-
-function assertStrongNonThrowBehaviour(expr) {
- assertEquals(eval(expr), eval("'use strong';" + expr));
- assertDoesNotThrow("'use strong'; " + expr + ";");
- assertDoesNotThrow("'use strong'; let v = " + expr + ";");
-}
-
-function assertStrongThrowBehaviour(expr) {
- assertDoesNotThrow("'use strict'; " + expr + ";");
- assertDoesNotThrow("'use strict'; let v = " + expr + ";");
- assertThrows("'use strong'; " + expr + ";", TypeError);
- assertThrows("'use strong'; let v = " + expr + ";", TypeError);
-}
-
-function checkArgumentCombinations(op, leftList, rightList, willThrow) {
- for (let v1 of leftList) {
- let assignExpr = "foo " + op[0] + "= " + v1 + ";";
- for (let v2 of rightList) {
- let compoundAssignment = "'use strong'; let foo = " + v2 + "; " +
- assignExpr;
- if (willThrow) {
- if (op[1]) {
- assertThrows(compoundAssignment, TypeError);
- }
- assertStrongThrowBehaviour("(" + v1 + op[0] + v2 + ")");
- } else {
- if (op[1]) {
- assertDoesNotThrow(compoundAssignment);
- }
- assertStrongNonThrowBehaviour("(" + v1 + op[0] + v2 + ")");
- }
- }
- }
-}
-
-for (let op of strongBinops) {
- checkArgumentCombinations(op, numberValues, numberValues, false);
- checkArgumentCombinations(op, numberValues, nonNumberValues, true);
-}
-
-for (let op of strongNumberBinops) {
- checkArgumentCombinations(op, nonNumberValues,
- numberValues.concat(nonNumberValues), true);
-}
-
-for (let op of strongStringOrNumberBinops) {
- checkArgumentCombinations(op, nonNumberValues,
- numberValues.concat(nonStringOrNumberValues), true);
- checkArgumentCombinations(op, nonStringOrNumberValues, stringValues, true);
- checkArgumentCombinations(op, stringValues, stringValues, false);
-}
-
-for (let op of strongUnops) {
- for (let value of numberValues) {
- assertStrongNonThrowBehaviour("(" + op + value + ")");
- }
- for (let value of nonNumberValues) {
- assertStrongThrowBehaviour("(" + op + value + ")");
- }
-}
-
-for (let func of strongNumberFuncs) {
- // Check IC None*None->None throws
- for (let v of nonNumberValues) {
- let value = eval(v);
- assertThrows(function(){func(2, value);}, TypeError);
- %OptimizeFunctionOnNextCall(func);
- assertThrows(function(){func(2, value);}, TypeError);
- %DeoptimizeFunction(func);
- }
- func(4, 5);
- func(4, 5);
- // Check IC Smi*Smi->Smi throws
- for (let v of nonNumberValues) {
- let value = eval(v);
- assertThrows(function(){func(2, value);}, TypeError);
- %OptimizeFunctionOnNextCall(func);
- assertThrows(function(){func(2, value);}, TypeError);
- %DeoptimizeFunction(func);
- }
- func(NaN, NaN);
- func(NaN, NaN);
- // Check IC Number*Number->Number throws
- for (let v of nonNumberValues) {
- let value = eval(v);
- assertThrows(function(){func(2, value);}, TypeError);
- %OptimizeFunctionOnNextCall(func);
- assertThrows(function(){func(2, value);}, TypeError);
- %DeoptimizeFunction(func);
- }
-}
-
-for (let func of strongStringOrNumberFuncs) {
- // Check IC None*None->None throws
- for (let v of nonNumberValues) {
- let value = eval(v);
- assertThrows(function(){func(2, value);}, TypeError);
- %OptimizeFunctionOnNextCall(func);
- assertThrows(function(){func(2, value);}, TypeError);
- %DeoptimizeFunction(func);
- }
- func("foo", "bar");
- func("foo", "bar");
- // Check IC String*String->String throws
- for (let v of nonNumberValues) {
- let value = eval(v);
- assertThrows(function(){func(2, value);}, TypeError);
- %OptimizeFunctionOnNextCall(func);
- assertThrows(function(){func(2, value);}, TypeError);
- %DeoptimizeFunction(func);
- }
- func(NaN, NaN);
- func(NaN, NaN);
- // Check IC Generic*Generic->Generic throws
- for (let v of nonNumberValues) {
- let value = eval(v);
- assertThrows(function(){func(2, value);}, TypeError);
- %OptimizeFunctionOnNextCall(func);
- assertThrows(function(){func(2, value);}, TypeError);
- %DeoptimizeFunction(func);
- }
-}
-
-for (let func of [str_equal_strong, str_ineq_strong]) {
- assertDoesNotThrow(function(){func(2, undefined)});
- assertDoesNotThrow(function(){func(2, undefined)});
- %OptimizeFunctionOnNextCall(func);
- assertDoesNotThrow(function(){func(2, undefined)});
- %DeoptimizeFunction(func);
- assertDoesNotThrow(function(){func(true, {})});
- assertDoesNotThrow(function(){func(true, {})});
- %OptimizeFunctionOnNextCall(func);
- assertDoesNotThrow(function(){func(true, {})});
- %DeoptimizeFunction(func);
-}
diff --git a/test/mjsunit/strong/literals.js b/test/mjsunit/strong/literals.js
deleted file mode 100644
index 6bdf0f0..0000000
--- a/test/mjsunit/strong/literals.js
+++ /dev/null
@@ -1,291 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode --allow-natives-syntax
-// Flags: --harmony-destructuring-bind
-
-'use strict';
-
-(function WeakObjectLiterals() {
- function assertWeakObject(x) {
- assertFalse(%IsStrong(x));
- assertSame(Object.prototype, Object.getPrototypeOf(x));
- }
- assertWeakObject({});
- assertWeakObject({a: 0, b: 0});
- assertWeakObject({a: [], b: {}});
- assertWeakObject({a: [], b: {}}.b);
- assertWeakObject({a: {b: {c: {}}}}.a);
- assertWeakObject({a: {b: {c: {}}}}.a.b);
- assertWeakObject({a: {b: {c: {}}}}.a.b.c);
- assertWeakObject([[1], {}, [[3]]][1]);
- assertWeakObject({f: function(){}});
- assertWeakObject(
- Realm.eval(Realm.current(), "({f: function(){}})"));
-})();
-
-(function StrongObjectLiterals() {
- 'use strong';
- function assertStrongObject(x) {
- assertTrue(%IsStrong(x));
- assertSame(Object.prototype, Object.getPrototypeOf(x));
- }
- assertStrongObject({});
- assertStrongObject({a: 0, b: 0});
- assertStrongObject({a: [], b: {}});
- assertStrongObject({a: [], b: {}}.b);
- assertStrongObject({a: {b: {c: {}}}}.a);
- assertStrongObject({a: {b: {c: {}}}}.a.b);
- assertStrongObject({a: {b: {c: {}}}}.a.b.c);
- // Maps for literals with too many properties are not cached.
- assertStrongObject({
- x001: 0, x002: 0, x003: 0, x004: 0, x005: 0,
- x006: 0, x007: 0, x008: 0, x009: 0, x010: 0,
- x011: 0, x012: 0, x013: 0, x014: 0, x015: 0,
- x016: 0, x017: 0, x018: 0, x019: 0, x020: 0,
- x021: 0, x022: 0, x023: 0, x024: 0, x025: 0,
- x026: 0, x027: 0, x028: 0, x029: 0, x030: 0,
- x031: 0, x032: 0, x033: 0, x034: 0, x035: 0,
- x036: 0, x037: 0, x038: 0, x039: 0, x040: 0,
- x041: 0, x042: 0, x043: 0, x044: 0, x045: 0,
- x046: 0, x047: 0, x048: 0, x049: 0, x050: 0,
- x051: 0, x052: 0, x053: 0, x054: 0, x055: 0,
- x056: 0, x057: 0, x058: 0, x059: 0, x060: 0,
- x061: 0, x062: 0, x063: 0, x064: 0, x065: 0,
- x066: 0, x067: 0, x068: 0, x069: 0, x070: 0,
- x071: 0, x072: 0, x073: 0, x074: 0, x075: 0,
- x076: 0, x077: 0, x078: 0, x079: 0, x080: 0,
- x081: 0, x082: 0, x083: 0, x084: 0, x085: 0,
- x086: 0, x087: 0, x088: 0, x089: 0, x090: 0,
- x091: 0, x092: 0, x093: 0, x094: 0, x095: 0,
- x096: 0, x097: 0, x098: 0, x099: 0, x100: 0,
- x101: 0, x102: 0, x103: 0, x104: 0, x105: 0,
- x106: 0, x107: 0, x108: 0, x109: 0, x110: 0,
- x111: 0, x112: 0, x113: 0, x114: 0, x115: 0,
- x116: 0, x117: 0, x118: 0, x119: 0, x120: 0,
- x121: 0, x122: 0, x123: 0, x124: 0, x125: 0,
- x126: 0, x127: 0, x128: 0, x129: 0, x130: 0,
- x131: 0, x132: 0, x133: 0, x134: 0, x135: 0,
- x136: 0, x137: 0, x138: 0, x139: 0, x140: 0,
- x141: 0, x142: 0, x143: 0, x144: 0, x145: 0,
- x146: 0, x147: 0, x148: 0, x149: 0, x150: 0,
- x151: 0, x152: 0, x153: 0, x154: 0, x155: 0,
- x156: 0, x157: 0, x158: 0, x159: 0, x160: 0,
- x161: 0, x162: 0, x163: 0, x164: 0, x165: 0,
- x166: 0, x167: 0, x168: 0, x169: 0, x170: 0,
- x171: 0, x172: 0, x173: 0, x174: 0, x175: 0,
- x176: 0, x177: 0, x178: 0, x179: 0, x180: 0,
- x181: 0, x182: 0, x183: 0, x184: 0, x185: 0,
- x186: 0, x187: 0, x188: 0, x189: 0, x190: 0,
- x191: 0, x192: 0, x193: 0, x194: 0, x195: 0,
- x196: 0, x197: 0, x198: 0, x199: 0, x200: 0,
- });
- assertStrongObject([[1], {}, [[3]]][1]);
- assertStrongObject({[Date() + ""]: 0, [Symbol()]: 0});
- assertStrongObject({m() { super.m() }});
- assertTrue(%IsStrong({__proto__: {}, get a() {}, set b(x) {}}));
- // Object literals with constant functions are treated specially,
- // but currently only on the toplevel (using Realm.eval to emulate that).
- assertStrongObject({f: function(){}});
- assertStrongObject(
- Realm.eval(Realm.current(), "'use strong'; ({f: function(){}})"));
-})();
-
-(function WeakArrayLiterals(...args) {
- function assertWeakArray(x) {
- assertFalse(%IsStrong(x));
- assertSame(Array.prototype, Object.getPrototypeOf(x));
- }
- let [...r] = [];
- assertWeakArray(args);
- assertWeakArray(r);
- assertWeakArray([]);
- assertWeakArray([1, 2, 3]);
- assertWeakArray([1, 2, ...[3, 4], 5]);
- assertWeakArray([[[]]]);
- assertWeakArray([[1], {}, [[3]]]);
- assertWeakArray([[1], {}, [[3]]][0]);
- assertWeakArray([[1], {}, [[3]]][2]);
- assertWeakArray([[1], {}, [[3]]][2][0]);
- assertWeakArray({a: [], b: {}}.a);
-})();
-
-(function StrongArrayLiterals() {
- 'use strong';
- function assertStrongArray(x) {
- assertTrue(%IsStrong(x));
- assertSame(Array.prototype, Object.getPrototypeOf(x));
- }
- let [...r] = [];
- assertStrongArray((function(...a) { return a; })());
- assertStrongArray(r);
- assertStrongArray([]);
- assertStrongArray([1, 2, 3]);
- assertStrongArray([1, 2, ...[3, 4], 5]);
- assertStrongArray([[[]]]);
- assertStrongArray([[1], {}, [[3]]]);
- assertStrongArray([[1], {}, [[3]]][0]);
- assertStrongArray([[1], {}, [[3]]][2]);
- assertStrongArray([[1], {}, [[3]]][2][0]);
- assertStrongArray({a: [], b: {}}.a);
-})();
-
-(function WeakFunctionLiterals() {
- function assertWeakFunction(x) {
- assertFalse(%IsStrong(x));
- assertFalse(%IsStrong(x.prototype));
- assertSame(Function.prototype, Object.getPrototypeOf(x));
- }
- function f() {}
- assertWeakFunction(f);
- assertWeakFunction(function(){});
- assertWeakFunction(function f(){});
- assertWeakFunction(() => {});
- assertWeakFunction(x => x);
- assertWeakFunction({m(){}}.m);
- assertWeakFunction(Object.getOwnPropertyDescriptor(
- {get a(){}}, 'a').get);
- assertWeakFunction(Object.getOwnPropertyDescriptor(
- {set a(x){}}, 'a').set);
- assertWeakFunction((class {static m(){}}).m);
- assertWeakFunction(Object.getOwnPropertyDescriptor(
- class {static get a(){}}, 'a').get);
- assertWeakFunction(Object.getOwnPropertyDescriptor(
- class {static set a(x){}}, 'a').set);
- assertWeakFunction((new class {m(){}}).m);
- assertWeakFunction(Object.getOwnPropertyDescriptor(
- (class {get a(){}}).prototype, 'a').get);
- assertWeakFunction(Object.getOwnPropertyDescriptor(
- (class {set a(x){}}).prototype, 'a').set);
-})();
-
-(function StrongFunctionLiterals() {
- 'use strong';
- function assertStrongFunction(x) {
- assertTrue(%IsStrong(x));
- assertFalse('prototype' in x);
- assertSame(Function.prototype, Object.getPrototypeOf(x));
- }
- function f() {}
- assertStrongFunction(f);
- assertStrongFunction(function(){});
- assertStrongFunction(function f(){});
- assertStrongFunction(() => {});
- assertStrongFunction(x => x);
- assertStrongFunction({m(){}}.m);
- assertStrongFunction(Object.getOwnPropertyDescriptor(
- {get a(){}}, 'a').get);
- assertStrongFunction(Object.getOwnPropertyDescriptor(
- {set a(x){}}, 'a').set);
- assertStrongFunction((class {static m(){}}).m);
- assertStrongFunction(Object.getOwnPropertyDescriptor(
- class {static get a(){}}, 'a').get);
- assertStrongFunction(Object.getOwnPropertyDescriptor(
- class {static set a(x){}}, 'a').set);
- assertStrongFunction((new class {m(){}}).m);
- assertStrongFunction(Object.getOwnPropertyDescriptor(
- (class {get a(){}}).prototype, 'a').get);
- assertStrongFunction(Object.getOwnPropertyDescriptor(
- (class {set a(x){}}).prototype, 'a').set);
-})();
-
-(function SelfStrongFunctionLiterals() {
- function assertStrongFunction(x) {
- assertTrue(%IsStrong(x));
- assertFalse('prototype' in x);
- assertSame(Function.prototype, Object.getPrototypeOf(x));
- }
- function f() {'use strong'}
- assertStrongFunction(f);
- assertStrongFunction(function(){'use strong'});
- assertStrongFunction(function f(){'use strong'});
- assertStrongFunction(() => {'use strong'});
- assertStrongFunction(x => {'use strong'});
- assertStrongFunction({m(){'use strong'}}.m);
- assertStrongFunction(Object.getOwnPropertyDescriptor(
- {get a(){'use strong'}}, 'a').get);
- assertStrongFunction(Object.getOwnPropertyDescriptor(
- {set a(x){'use strong'}}, 'a').set);
- assertStrongFunction((class {static m(){'use strong'}}).m);
- assertStrongFunction(Object.getOwnPropertyDescriptor(
- class {static get a(){'use strong'}}, 'a').get);
- assertStrongFunction(Object.getOwnPropertyDescriptor(
- class {static set a(x){'use strong'}}, 'a').set);
- assertStrongFunction((new class {m(){'use strong'}}).m);
- assertStrongFunction(Object.getOwnPropertyDescriptor(
- (class {get a(){'use strong'}}).prototype, 'a').get);
- assertStrongFunction(Object.getOwnPropertyDescriptor(
- (class {set a(x){'use strong'}}).prototype, 'a').set);
-})();
-
-let GeneratorPrototype = (function*(){}).__proto__;
-
-(function WeakGeneratorLiterals() {
- function assertWeakGenerator(x) {
- assertFalse(%IsStrong(x));
- assertFalse(%IsStrong(x.prototype));
- assertSame(GeneratorPrototype, Object.getPrototypeOf(x));
- assertFalse(%IsStrong(x()));
- }
- function* g() {}
- assertWeakGenerator(g);
- assertWeakGenerator(function*(){});
- assertWeakGenerator(function* g(){});
- assertWeakGenerator({*m(){}}.m);
- assertWeakGenerator((class {static *m(){}}).m);
- assertWeakGenerator((new class {*m(){}}).m);
-})();
-
-(function StrongGeneratorLiterals() {
- 'use strong';
- function assertStrongGenerator(x) {
- assertTrue(%IsStrong(x));
- // TODO(rossberg): strongify generator prototypes
- // assertTrue(%IsStrong(x.prototype));
- assertSame(GeneratorPrototype, Object.getPrototypeOf(x));
- // TODO(rossberg): strongify generator instances
- // assertTrue(%IsStrong(x()));
- }
- function* g() {}
- assertStrongGenerator(g);
- assertStrongGenerator(function*(){});
- assertStrongGenerator(function* g(){});
- assertStrongGenerator({*m(){}}.m);
- assertStrongGenerator((class {static *m(){}}).m);
- assertStrongGenerator((new class {*m(){}}).m);
-})();
-
-(function SelfStrongGeneratorLiterals() {
- function assertStrongGenerator(x) {
- assertTrue(%IsStrong(x));
- // TODO(rossberg): strongify generator prototypes
- // assertTrue(%IsStrong(x.prototype));
- assertSame(GeneratorPrototype, Object.getPrototypeOf(x));
- // TODO(rossberg): strongify generator instances
- // assertTrue(%IsStrong(x()));
- }
- function* g() {'use strong'}
- assertStrongGenerator(g);
- assertStrongGenerator(function*(){'use strong'});
- assertStrongGenerator(function* g(){'use strong'});
- assertStrongGenerator({*m(){'use strong'}}.m);
- assertStrongGenerator((class {static *m(){'use strong'}}).m);
- assertStrongGenerator((new class {*m(){'use strong'}}).m);
-})();
-
-(function WeakRegExpLiterals() {
- function assertWeakRegExp(x) {
- assertFalse(%IsStrong(x));
- }
- assertWeakRegExp(/abc/);
-})();
-
-(function StrongRegExpLiterals() {
- 'use strong';
- function assertStrongRegExp(x) {
- // TODO(rossberg): strongify regexps
- // assertTrue(%IsStrong(x));
- }
- assertStrongRegExp(/abc/);
-})();
diff --git a/test/mjsunit/strong/load-builtins.js b/test/mjsunit/strong/load-builtins.js
deleted file mode 100644
index 6638ff3..0000000
--- a/test/mjsunit/strong/load-builtins.js
+++ /dev/null
@@ -1,42 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode
-
-function getGlobal() {
- return this;
-}
-
-function polluteGlobal() {
- bar = 0;
-}
-
-(function() {
- "use strict";
-
- let builtins = [
- Array,
- Object,
- Function,
- getGlobal()
- ];
-
- for (let builtin of builtins) {
- assertThrows(function(){"use strong"; builtin.foo}, TypeError);
- assertThrows(function(){"use strong"; builtin[0]}, TypeError);
- assertThrows(function(){"use strong"; builtin[10000]}, TypeError);
- builtin.foo = 1;
- assertDoesNotThrow(function(){"use strong"; builtin.foo});
- assertThrows(function(){"use strong"; builtin.bar});
- assertThrows(function(){"use strong"; builtin[0]}, TypeError);
- assertThrows(function(){"use strong"; builtin[10000]}, TypeError);
- builtin[0] = 1;
- assertDoesNotThrow(function(){"use strong"; builtin.foo});
- assertThrows(function(){"use strong"; builtin.bar});
- assertDoesNotThrow(function(){"use strong"; builtin[0]});
- assertThrows(function(){"use strong"; builtin[10000]}, TypeError);
- }
- polluteGlobal();
- assertDoesNotThrow(function(){"use strong"; getGlobal().bar});
-})();
diff --git a/test/mjsunit/strong/load-element-mutate-backing-store.js b/test/mjsunit/strong/load-element-mutate-backing-store.js
deleted file mode 100644
index f346502..0000000
--- a/test/mjsunit/strong/load-element-mutate-backing-store.js
+++ /dev/null
@@ -1,239 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode --allow-natives-syntax
-
-function getSloppyArguments() {
- return arguments;
-}
-
-function getObjects() {
- "use strict";
- return [
- {},
- Object(""),
- [],
- (function(){}),
- (class Foo {}),
- getSloppyArguments(),
- arguments,
- new Date(),
- ];
-}
-
-// TODO(conradw): add tests for non-inheritance once semantics are implemented.
-function getNonInheritingObjects() {
- "use strong";
- return [
- Object(""),
- [],
- // TODO(conradw): uncomment and correct test once Object.defineProperty is
- // fixed.
- // new Uint32Array(0)
- ];
-}
-
-function readFromObjectElementSloppy(o) {
- return o[0];
-}
-
-function readFromObjectElementSparseSloppy(o) {
- return o[100000];
-}
-
-function readFromObjectElementNonSmiSloppy(o) {
- return o[3000000000];
-}
-
-function readFromObjectNonIndexSloppy(o) {
- return o[5000000000];
-}
-
-function readFromObjectElementVarSloppy(o) {
- var a = 0;
- return o[a];
-}
-
-function readFromObjectElementSparseVarSloppy(o) {
- var a = 100000;
- return o[a];
-}
-
-function readFromObjectElementNonSmiVarSloppy(o) {
- var a = 3000000000;
- return o[a];
-}
-
-function readFromObjectNonIndexVarSloppy(o) {
- var a = 5000000000;
- return o[a];
-}
-
-function readFromObjectElementStrong(o) {
- "use strong";
- return o[0];
-}
-
-function readFromObjectElementSparseStrong(o) {
- "use strong";
- return o[100000];
-}
-
-function readFromObjectElementNonSmiStrong(o) {
- "use strong";
- return o[3000000000];
-}
-
-function readFromObjectNonIndexStrong(o) {
- "use strong";
- return o[5000000000];
-}
-
-function readFromObjectElementLetStrong(o) {
- "use strong";
- let a = 0;
- return o[a];
-}
-
-function readFromObjectElementSparseLetStrong(o) {
- "use strong";
- let a = 100000;
- return o[a];
-}
-
-function readFromObjectElementNonSmiLetStrong(o) {
- "use strong";
- let a = 3000000000;
- return o[a];
-}
-
-function readFromObjectNonIndexLetStrong(o) {
- "use strong";
- let a = 5000000000;
- return o[a];
-}
-
-function getDescs(x) {
- return [
- {value: x},
- {configurable: true, enumerable: true, writable: true, value: x},
- {configurable: true, enumerable: true, get: (function() {return x}) },
- ];
-}
-
-function assertStrongSemantics(func, object) {
- %DeoptimizeFunction(func);
- %ClearFunctionTypeFeedback(func);
- assertThrows(function(){func(object)}, TypeError);
- assertThrows(function(){func(object)}, TypeError);
- assertThrows(function(){func(object)}, TypeError);
- %OptimizeFunctionOnNextCall(func);
- assertThrows(function(){func(object)}, TypeError);
- %DeoptimizeFunction(func);
- assertThrows(function(){func(object)}, TypeError);
-}
-
-function assertSloppySemantics(func, object) {
- %DeoptimizeFunction(func);
- %ClearFunctionTypeFeedback(func);
- assertDoesNotThrow(function(){func(object)});
- assertDoesNotThrow(function(){func(object)});
- assertDoesNotThrow(function(){func(object)});
- %OptimizeFunctionOnNextCall(func);
- assertDoesNotThrow(function(){func(object)});
- %DeoptimizeFunction(func);
- assertDoesNotThrow(function(){func(object)});
-}
-
-(function () {
- "use strict";
-
- let goodKeys = [
- "0",
- "100000",
- "3000000000",
- "5000000000"
- ]
-
- let badKeys = [
- "bar",
- "1",
- "100001",
- "3000000001",
- "5000000001"
- ];
-
- let values = [
- "string",
- 1,
- 100001,
- 30000000001,
- 50000000001,
- NaN,
- {},
- undefined
- ];
-
- let badAccessorDescs = [
- { set: (function(){}) },
- { configurable: true, enumerable: true, set: (function(){}) }
- ];
-
- let readSloppy = [
- readFromObjectElementSloppy,
- readFromObjectElementSparseSloppy,
- readFromObjectElementNonSmiSloppy,
- readFromObjectNonIndexSloppy,
- readFromObjectElementVarSloppy,
- readFromObjectElementSparseVarSloppy,
- readFromObjectElementNonSmiVarSloppy,
- readFromObjectNonIndexVarSloppy
- ];
-
- let readStrong = [
- readFromObjectElementStrong,
- readFromObjectElementSparseStrong,
- readFromObjectElementNonSmiStrong,
- readFromObjectNonIndexStrong,
- readFromObjectElementLetStrong,
- readFromObjectElementSparseLetStrong,
- readFromObjectElementNonSmiLetStrong,
- readFromObjectNonIndexLetStrong
- ];
-
- let dummyProto = {};
- for (let key of goodKeys) {
- Object.defineProperty(dummyProto, key, { value: undefined });
- }
-
- // After altering the backing store, accessing a missing property should still
- // throw.
- for (let key of badKeys) {
- for (let value of values) {
- for (let desc of getDescs(value)) {
- let objects = getObjects();
- let nonInheritingObjects = getNonInheritingObjects();
- for (let object of objects.concat(nonInheritingObjects)) {
- Object.defineProperty(object, key, desc);
- for (let func of readStrong) {
- assertStrongSemantics(func, object);
- }
- for (let func of readSloppy) {
- assertSloppySemantics(func, object);
- }
- }
- for (let object of objects) {
- // Accessing a property which is on the prototype chain of the object
- // should not throw.
- object.__proto__ = dummyProto;
- for (let key of goodKeys) {
- for (let func of readStrong.concat(readSloppy)) {
- assertSloppySemantics(func, object);
- }
- }
- }
- }
- }
- }
-})();
diff --git a/test/mjsunit/strong/load-element.js b/test/mjsunit/strong/load-element.js
deleted file mode 100644
index 4007b7d..0000000
--- a/test/mjsunit/strong/load-element.js
+++ /dev/null
@@ -1,267 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode --allow-natives-syntax
-
-function getSloppyArguments() {
- return arguments;
-}
-
-function getObjects() {
- "use strict";
- return [
- {},
- Object(""),
- [],
- (function(){}),
- (class Foo {}),
- getSloppyArguments(),
- arguments,
- new Date()
- ];
-}
-
-//TODO(conradw): add tests for non-inheritance once semantics are implemented.
-function getNonInheritingObjects() {
- "use strong";
- return [
- Object(""),
- [],
- new Uint32Array(0)
- ];
-}
-
-function readFromObjectElementSloppy(o) {
- return o[0];
-}
-
-function readFromObjectElementSparseSloppy(o) {
- return o[100000];
-}
-
-function readFromObjectElementNonSmiSloppy(o) {
- return o[3000000000];
-}
-
-function readFromObjectNonIndexSloppy(o) {
- return o[5000000000];
-}
-
-function readFromObjectElementVarSloppy(o) {
- var a = 0;
- return o[a];
-}
-
-function readFromObjectElementSparseVarSloppy(o) {
- var a = 100000;
- return o[a];
-}
-
-function readFromObjectElementNonSmiVarSloppy(o) {
- var a = 3000000000;
- return o[a];
-}
-
-function readFromObjectNonIndexVarSloppy(o) {
- var a = 5000000000;
- return o[a];
-}
-
-function readFromObjectElementStrong(o) {
- "use strong";
- return o[0];
-}
-
-function readFromObjectElementSparseStrong(o) {
- "use strong";
- return o[100000];
-}
-
-function readFromObjectElementNonSmiStrong(o) {
- "use strong";
- return o[3000000000];
-}
-
-function readFromObjectNonIndexStrong(o) {
- "use strong";
- return o[5000000000];
-}
-
-function readFromObjectElementLetStrong(o) {
- "use strong";
- let a = 0;
- return o[a];
-}
-
-function readFromObjectElementSparseLetStrong(o) {
- "use strong";
- let a = 100000;
- return o[a];
-}
-
-function readFromObjectElementNonSmiLetStrong(o) {
- "use strong";
- let a = 3000000000;
- return o[a];
-}
-
-function readFromObjectNonIndexLetStrong(o) {
- "use strong";
- let a = 5000000000;
- return o[a];
-}
-
-function getDescs(x) {
- return [
- {value: x},
- {configurable: true, enumerable: true, writable: true, value: x},
- {configurable: true, enumerable: true, get: (function() {return x}) },
- ];
-}
-
-function assertStrongSemantics(func, object) {
- %DeoptimizeFunction(func);
- %ClearFunctionTypeFeedback(func);
- assertThrows(function(){func(object)}, TypeError);
- assertThrows(function(){func(object)}, TypeError);
- assertThrows(function(){func(object)}, TypeError);
- %OptimizeFunctionOnNextCall(func);
- assertThrows(function(){func(object)}, TypeError);
- %DeoptimizeFunction(func);
- assertThrows(function(){func(object)}, TypeError);
-}
-
-function assertSloppySemantics(func, object) {
- %DeoptimizeFunction(func);
- %ClearFunctionTypeFeedback(func);
- assertDoesNotThrow(function(){func(object)});
- assertDoesNotThrow(function(){func(object)});
- assertDoesNotThrow(function(){func(object)});
- %OptimizeFunctionOnNextCall(func);
- assertDoesNotThrow(function(){func(object)});
- %DeoptimizeFunction(func);
- assertDoesNotThrow(function(){func(object)});
-}
-
-(function () {
- "use strict";
-
- let goodKeys = [
- "0",
- "100000",
- "3000000000",
- "5000000000"
- ]
-
- let badKeys = [
- "bar",
- "1",
- "100001",
- "3000000001",
- "5000000001"
- ];
-
- let values = [
- "string",
- 1,
- 100001,
- 30000000001,
- 50000000001,
- NaN,
- {},
- undefined
- ];
-
- let literals = [0, NaN, true, ""];
-
- let badAccessorDescs = [
- { set: (function(){}) },
- { configurable: true, enumerable: true, set: (function(){}) }
- ];
-
- let readSloppy = [
- readFromObjectElementSloppy,
- readFromObjectElementSparseSloppy,
- readFromObjectElementNonSmiSloppy,
- readFromObjectNonIndexSloppy,
- readFromObjectElementVarSloppy,
- readFromObjectElementSparseVarSloppy,
- readFromObjectElementNonSmiVarSloppy,
- readFromObjectNonIndexVarSloppy
- ];
-
- let readStrong = [
- readFromObjectElementStrong,
- readFromObjectElementSparseStrong,
- readFromObjectElementNonSmiStrong,
- readFromObjectNonIndexStrong,
- readFromObjectElementLetStrong,
- readFromObjectElementSparseLetStrong,
- readFromObjectElementNonSmiLetStrong,
- readFromObjectNonIndexLetStrong
- ];
-
- let dummyProto = {};
- for (let key of goodKeys) {
- Object.defineProperty(dummyProto, key, { value: undefined });
- }
-
- let dummyAccessorProto = {};
- for (let key of goodKeys) {
- Object.defineProperty(dummyAccessorProto, key, { set: (function(){}) })
- }
-
- // String literals/objects should not throw on character index access
- assertDoesNotThrow(function() {"use strong"; return "string"[0]; });
- assertDoesNotThrow(function() {"use strong"; return Object("string")[0]; });
-
- // Attempting to access a property on an object with no defined properties
- // should throw.
- for (let object of getObjects().concat(getNonInheritingObjects(), literals)) {
- for (let func of readStrong) {
- assertStrongSemantics(func, object);
- }
- for (let func of readSloppy) {
- assertSloppySemantics(func, object);
- }
- }
- for (let object of getObjects()) {
- // Accessing a property which is on the prototype chain of the object should
- // not throw.
- object.__proto__ = dummyProto;
- for (let key of goodKeys) {
- for (let func of readStrong.concat(readSloppy)) {
- assertSloppySemantics(func, object);
- }
- }
- }
- // Properties with accessor descriptors missing 'get' should throw on access.
- for (let desc of badAccessorDescs) {
- for (let key of goodKeys) {
- for (let object of getObjects()) {
- Object.defineProperty(object, key, desc);
- for (let func of readStrong) {
- assertStrongSemantics(func, object);
- }
- for (let func of readSloppy) {
- assertSloppySemantics(func, object);
- }
- }
- }
- }
- // The same behaviour should be expected for bad accessor properties on the
- // prototype chain.
- for (let object of getObjects()) {
- object.__proto__ = dummyAccessorProto;
- for (let func of readStrong) {
- assertStrongSemantics(func, object);
- }
- for (let func of readSloppy) {
- assertSloppySemantics(func, object);
- }
- }
- assertThrows(function(){"use strong"; typeof ({})[1];}, TypeError);
- assertThrows(
- function(){"use strong"; typeof ({})[1] === "undefined"}, TypeError);
-})();
diff --git a/test/mjsunit/strong/load-property-mutate-backing-store.js b/test/mjsunit/strong/load-property-mutate-backing-store.js
deleted file mode 100644
index 5ed4553..0000000
--- a/test/mjsunit/strong/load-property-mutate-backing-store.js
+++ /dev/null
@@ -1,174 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode --allow-natives-syntax
-
-function getSloppyArguments() {
- return arguments;
-}
-
-function getObjects() {
- "use strict";
- return [
- {},
- Object(""),
- [],
- (function(){}),
- (class Foo {}),
- getSloppyArguments(),
- arguments,
- new Date(),
- // TODO(conradw): uncomment once Object.defineProperty is fixed.
- // new Uint32Array(0)
- ];
-}
-
-function readFromObjectSloppy(o) {
- return o.foo;
-}
-
-function readFromObjectKeyedSloppy(o) {
- return o["foo"];
-}
-
-function readFromObjectKeyedVarSloppy(o) {
- var a = "foo";
- return o[a];
-}
-
-function readFromObjectKeyedComputedSloppy(o) {
- var a = "o";
- return o["fo" + a];
-}
-
-function readFromObjectStrong(o) {
- "use strong";
- return o.foo;
-}
-
-function readFromObjectKeyedStrong(o) {
- "use strong";
- return o["foo"];
-}
-
-function readFromObjectKeyedLetStrong(o) {
- "use strong";
- let a = "foo";
- return o[a];
-}
-
-function readFromObjectKeyedComputedStrong(o) {
- "use strong";
- let a = "o";
- return o["fo" + a];
-}
-
-function getDescs(x) {
- return [
- {value: x},
- {configurable: true, enumerable: true, writable: true, value: x},
- {configurable: true, enumerable: true, get: (function() {return x}) },
- ];
-}
-
-function assertStrongSemantics(func, object) {
- %DeoptimizeFunction(func);
- %ClearFunctionTypeFeedback(func);
- assertThrows(function(){func(object)}, TypeError);
- assertThrows(function(){func(object)}, TypeError);
- assertThrows(function(){func(object)}, TypeError);
- %OptimizeFunctionOnNextCall(func);
- assertThrows(function(){func(object)}, TypeError);
- %DeoptimizeFunction(func);
- assertThrows(function(){func(object)}, TypeError);
-}
-
-function assertSloppySemantics(func, object) {
- %DeoptimizeFunction(func);
- %ClearFunctionTypeFeedback(func);
- assertDoesNotThrow(function(){func(object)});
- assertDoesNotThrow(function(){func(object)});
- assertDoesNotThrow(function(){func(object)});
- %OptimizeFunctionOnNextCall(func);
- assertDoesNotThrow(function(){func(object)});
- %DeoptimizeFunction(func);
- assertDoesNotThrow(function(){func(object)});
-}
-
-(function () {
- "use strict";
-
- let goodKeys = [
- "foo"
- ]
-
- let badKeys = [
- "bar",
- "1",
- "100001",
- "3000000001",
- "5000000001"
- ];
-
- let values = [
- "string",
- 1,
- 100001,
- 30000000001,
- 50000000001,
- NaN,
- {},
- undefined
- ];
-
- let badAccessorDescs = [
- { set: (function(){}) },
- { configurable: true, enumerable: true, set: (function(){}) }
- ];
-
- let readSloppy = [
- readFromObjectSloppy,
- readFromObjectKeyedSloppy,
- readFromObjectKeyedVarSloppy,
- readFromObjectKeyedComputedSloppy
- ];
-
- let readStrong = [
- readFromObjectStrong,
- readFromObjectKeyedStrong,
- readFromObjectKeyedLetStrong,
- readFromObjectKeyedComputedStrong
- ];
-
- let dummyProto = {};
- for (let key of goodKeys) {
- Object.defineProperty(dummyProto, key, { value: undefined });
- }
-
- // After altering the backing store, accessing a missing property should still
- // throw.
- for (let key of badKeys) {
- for (let value of values) {
- for (let desc of getDescs(value)) {
- for (let object of getObjects()) {
- Object.defineProperty(object, key, desc);
- for (let func of readStrong) {
- assertStrongSemantics(func, object);
- }
- for (let func of readSloppy) {
- assertSloppySemantics(func, object);
- }
- // Accessing a property which is on the prototype chain of the object
- // should not throw.
- object.__proto__ = dummyProto;
- for (let key of goodKeys) {
- for (let func of readStrong.concat(readSloppy)) {
- assertSloppySemantics(func, object);
- }
- }
- }
- }
- }
- }
-})();
diff --git a/test/mjsunit/strong/load-property.js b/test/mjsunit/strong/load-property.js
deleted file mode 100644
index ddbcbb6..0000000
--- a/test/mjsunit/strong/load-property.js
+++ /dev/null
@@ -1,203 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode --allow-natives-syntax
-
-function getSloppyArguments() {
- return arguments;
-}
-
-function getObjects() {
- "use strict";
- return [
- {},
- Object(""),
- [],
- (function(){}),
- (class Foo {}),
- getSloppyArguments(),
- arguments,
- new Date(),
- new Uint32Array(0)
- ];
-}
-
-function readFromObjectSloppy(o) {
- return o.foo;
-}
-
-function readFromObjectKeyedSloppy(o) {
- return o["foo"];
-}
-
-function readFromObjectKeyedVarSloppy(o) {
- var a = "foo";
- return o[a];
-}
-
-function readFromObjectKeyedComputedSloppy(o) {
- var a = "o";
- return o["fo" + a];
-}
-
-function readFromObjectStrong(o) {
- "use strong";
- return o.foo;
-}
-
-function readFromObjectKeyedStrong(o) {
- "use strong";
- return o["foo"];
-}
-
-function readFromObjectKeyedLetStrong(o) {
- "use strong";
- let a = "foo";
- return o[a];
-}
-
-function readFromObjectKeyedComputedStrong(o) {
- "use strong";
- let a = "o";
- return o["fo" + a];
-}
-
-function getDescs(x) {
- return [
- {value: x},
- {configurable: true, enumerable: true, writable: true, value: x},
- {configurable: true, enumerable: true, get: (function() {return x}) },
- ];
-}
-
-function assertStrongSemantics(func, object) {
- %DeoptimizeFunction(func);
- %ClearFunctionTypeFeedback(func);
- assertThrows(function(){func(object)}, TypeError);
- assertThrows(function(){func(object)}, TypeError);
- assertThrows(function(){func(object)}, TypeError);
- %OptimizeFunctionOnNextCall(func);
- assertThrows(function(){func(object)}, TypeError);
- %DeoptimizeFunction(func);
- assertThrows(function(){func(object)}, TypeError);
-}
-
-function assertSloppySemantics(func, object) {
- %DeoptimizeFunction(func);
- %ClearFunctionTypeFeedback(func);
- assertDoesNotThrow(function(){func(object)});
- assertDoesNotThrow(function(){func(object)});
- assertDoesNotThrow(function(){func(object)});
- %OptimizeFunctionOnNextCall(func);
- assertDoesNotThrow(function(){func(object)});
- %DeoptimizeFunction(func);
- assertDoesNotThrow(function(){func(object)});
-}
-
-(function () {
- "use strict";
-
- let goodKeys = [
- "foo"
- ]
-
- let badKeys = [
- "bar",
- "1",
- "100001",
- "3000000001",
- "5000000001"
- ];
-
- let values = [
- "string",
- 1,
- 100001,
- 30000000001,
- 50000000001,
- NaN,
- {},
- undefined
- ];
-
- let literals = [0, NaN, true, "string"];
-
- let badAccessorDescs = [
- { set: (function(){}) },
- { configurable: true, enumerable: true, set: (function(){}) }
- ];
-
- let readSloppy = [
- readFromObjectSloppy,
- readFromObjectKeyedSloppy,
- readFromObjectKeyedVarSloppy,
- readFromObjectKeyedComputedSloppy
- ];
-
- let readStrong = [
- readFromObjectStrong,
- readFromObjectKeyedStrong,
- readFromObjectKeyedLetStrong,
- readFromObjectKeyedComputedStrong
- ];
-
- let dummyProto = {};
- for (let key of goodKeys) {
- Object.defineProperty(dummyProto, key, { value: undefined });
- }
-
- let dummyAccessorProto = {};
- for (let key of goodKeys) {
- Object.defineProperty(dummyAccessorProto, key, { set: (function(){}) })
- }
-
- // Attempting to access a property on an object with no defined properties
- // should throw.
- for (let object of getObjects().concat(literals)) {
- for (let func of readStrong) {
- assertStrongSemantics(func, object);
- }
- for (let func of readSloppy) {
- assertSloppySemantics(func, object);
- }
- }
- for (let object of getObjects()) {
- // Accessing a property which is on the prototype chain of the object should
- // not throw.
- object.__proto__ = dummyProto;
- for (let key of goodKeys) {
- for (let func of readStrong.concat(readSloppy)) {
- assertSloppySemantics(func, object);
- }
- }
- }
- // Properties with accessor descriptors missing 'get' should throw on access.
- for (let desc of badAccessorDescs) {
- for (let key of goodKeys) {
- for (let object of getObjects()) {
- Object.defineProperty(object, key, desc);
- for (let func of readStrong) {
- assertStrongSemantics(func, object);
- }
- for (let func of readSloppy) {
- assertSloppySemantics(func, object);
- }
- }
- }
- }
- // The same behaviour should be expected for bad accessor properties on the
- // prototype chain.
- for (let object of getObjects()) {
- object.__proto__ = dummyAccessorProto;
- for (let func of readStrong) {
- assertStrongSemantics(func, object);
- }
- for (let func of readSloppy) {
- assertSloppySemantics(func, object);
- }
- }
- assertThrows(function(){"use strong"; typeof ({}).foo;}, TypeError);
- assertThrows(
- function(){"use strong"; typeof ({}).foo === "undefined"}, TypeError);
-})();
diff --git a/test/mjsunit/strong/load-proxy.js b/test/mjsunit/strong/load-proxy.js
deleted file mode 100644
index 417a41f..0000000
--- a/test/mjsunit/strong/load-proxy.js
+++ /dev/null
@@ -1,100 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --harmony-proxies --strong-mode
-
-// Forwarding proxies adapted from proposal definition
-function handlerMaker1(obj) {
- return {
- getPropertyDescriptor: function(name) {
- var desc;
- var searchObj = obj;
- while (desc === undefined && searchObj != null) {
- desc = Object.getOwnPropertyDescriptor(searchObj, name);
- searchObj = searchObj.__proto__;
- }
- // a trapping proxy's properties must always be configurable
- if (desc !== undefined) { desc.configurable = true; }
- return desc;
- },
- fix: function() {
- if (Object.isFrozen(obj)) {
- var result = {};
- Object.getOwnPropertyNames(obj).forEach(function(name) {
- result[name] = Object.getOwnPropertyDescriptor(obj, name);
- });
- return result;
- }
- // As long as obj is not frozen, the proxy won't allow itself to be fixed
- return undefined; // will cause a TypeError to be thrown
- }
- };
-}
-function handlerMaker2(obj) {
- return {
- get: function(receiver, name) {
- return obj[name];
- },
- fix: function() {
- if (Object.isFrozen(obj)) {
- var result = {};
- Object.getOwnPropertyNames(obj).forEach(function(name) {
- result[name] = Object.getOwnPropertyDescriptor(obj, name);
- });
- return result;
- }
- // As long as obj is not frozen, the proxy won't allow itself to be fixed
- return undefined; // will cause a TypeError to be thrown
- }
- };
-}
-var baseObj = {};
-var proxy1 = new Proxy({}, handlerMaker1(baseObj));
-var proxy2 = new Proxy({}, handlerMaker2(baseObj));
-var childObj1 = { __proto__: proxy1 };
-var childObj2 = { __proto__: proxy2 };
-var childObjAccessor1 = { set foo(_){}, set "1"(_){}, __proto__: proxy1 };
-var childObjAccessor2 = { set foo(_){}, set "1"(_){}, __proto__: proxy2 };
-
-(function() {
- "use strong";
- // TODO(conradw): These asserts are sanity checking V8's proxy implementation.
- // Strong mode semantics for ES6 proxies still need to be explored.
- assertDoesNotThrow(function(){proxy1.foo});
- assertDoesNotThrow(function(){proxy1[1]});
- assertDoesNotThrow(function(){proxy2.foo});
- assertDoesNotThrow(function(){proxy2[1]});
- assertDoesNotThrow(function(){childObj1.foo});
- assertDoesNotThrow(function(){childObj1[1]});
- assertDoesNotThrow(function(){childObj2.foo});
- assertDoesNotThrow(function(){childObj2[1]});
- assertThrows(function(){baseObj.foo}, TypeError);
- assertThrows(function(){baseObj[1]}, TypeError);
- assertThrows(function(){childObjAccessor1.foo}, TypeError);
- assertThrows(function(){childObjAccessor1[1]}, TypeError);
- assertThrows(function(){childObjAccessor2.foo}, TypeError);
- assertThrows(function(){childObjAccessor2[1]}, TypeError);
-
- // Once the proxy is no longer trapping, property access should have strong
- // semantics.
- Object.freeze(baseObj);
-
- // TODO(neis): Reenable once proxies properly support freeze.
- //
- // Object.freeze(proxy1);
- // assertThrows(function(){proxy1.foo}, TypeError);
- // assertThrows(function(){proxy1[1]}, TypeError);
- // assertThrows(function(){childObj1.foo}, TypeError);
- // assertThrows(function(){childObj1[1]}, TypeError);
- // assertThrows(function(){childObjAccessor1.foo}, TypeError);
- // assertThrows(function(){childObjAccessor1[1]}, TypeError);
- //
- // Object.freeze(proxy2);
- // assertThrows(function(){proxy2.foo}, TypeError);
- // assertThrows(function(){proxy2[1]}, TypeError);
- // assertThrows(function(){childObj2.foo}, TypeError);
- // assertThrows(function(){childObj2[1]}, TypeError);
- // assertThrows(function(){childObjAccessor2.foo}, TypeError);
- // assertThrows(function(){childObjAccessor2[1]}, TypeError);
-})();
diff --git a/test/mjsunit/strong/load-super.js b/test/mjsunit/strong/load-super.js
deleted file mode 100644
index 4aa91c2..0000000
--- a/test/mjsunit/strong/load-super.js
+++ /dev/null
@@ -1,102 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode
-
-"use strong";
-
-function testSuper(object) {
- assertEquals(0, object.validLoad());
- assertThrows(function(){ return object.propertyLoad() }, TypeError);
- assertThrows(function(){ return object.elementLoad() }, TypeError);
- assertThrows(function(){ return object.accessorLoad() }, TypeError);
-}
-
-class A {
- constructor() {}
- foo() {
- return 0;
- }
- get bar() {
- return 0;
- }
- set baz(_) {
- return;
- }
-}
-
-class B extends A {
- constructor() {
- super();
- }
- validLoad() {
- return super.foo() + super.bar;
- }
- propertyLoad() {
- return super.x;
- }
- elementLoad() {
- return super[1];
- }
- accessorLoad() {
- return super.baz;
- }
-}
-
-class C extends A {
- constructor() {
- super();
- this[1] = 0;
- this.x = 0;
- }
- get baz() {
- return 0;
- }
- validLoad() {
- return super.foo() + super.bar;
- }
- propertyLoad() {
- return super.x;
- }
- elementLoad() {
- return super[1];
- }
- accessorLoad() {
- return super.baz;
- }
-}
-
-let b = new B();
-let c = new C();
-testSuper(b);
-testSuper(c);
-
-let d = {
- "0": 0,
- foo: 0,
- bar: (function(){return 0}),
- get baz(){return 0},
- set qux(_){return}
-}
-
-let e = {
- __proto__: d,
- "1": 0,
- x: 0,
- get baz(){return 0},
- validLoad() {
- return super[0] + super.foo + super.bar() + super.baz;
- },
- propertyLoad() {
- return super.x;
- },
- elementLoad() {
- return super[1];
- },
- accessorLoad() {
- return super.qux;
- }
-}
-
-testSuper(e);
diff --git a/test/mjsunit/strong/mutually-recursive-funcs.js b/test/mjsunit/strong/mutually-recursive-funcs.js
deleted file mode 100644
index 726eed8..0000000
--- a/test/mjsunit/strong/mutually-recursive-funcs.js
+++ /dev/null
@@ -1,25 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode
-
-"use strong";
-
-function foo(param, fooCount, barCount) {
- if (param === 0)
- return {'foo': fooCount, 'bar': barCount};
- return bar(param - 1, fooCount + 1, barCount);
-}
-
-function bar(param, fooCount, barCount) {
- if (param === 0)
- return {'foo': fooCount, 'bar': barCount};
- return foo(param - 1, fooCount, barCount + 1);
-}
-
-(function TestMutuallyRecursiveFunctions() {
- let obj = foo(10, 0, 0);
- assertEquals(obj.foo, 5);
- assertEquals(obj.bar, 5);
-})();
diff --git a/test/mjsunit/strong/object-delete.js b/test/mjsunit/strong/object-delete.js
deleted file mode 100644
index a655b65..0000000
--- a/test/mjsunit/strong/object-delete.js
+++ /dev/null
@@ -1,255 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode --allow-natives-syntax
-
-// TODO(conradw): Track implementation of strong bit for other objects, add
-// tests.
-
-function getSloppyObjects() {
- return [(function(){}), ({})];
-}
-
-function getStrictObjects() {
- "use strict";
- return [(function(){}), ({})];
-}
-
-function getWeakObjects() {
- return getSloppyObjects().concat(getStrictObjects());
-}
-
-function getStrongObjects() {
- "use strong";
-// Strong functions can't have properties added to them, and will be tested as a
-// special case.
- return [({})];
-}
-
-function strongFunction() {
- "use strong";
-}
-
-function deleteFromObjectSloppy(o) {
- return delete o.foo;
-}
-
-function deleteFromObjectKeyedSloppy(o) {
- return delete o["foo"];
-}
-
-function deleteFromObjectKeyedVarSloppy(o) {
- var a = "foo";
- return delete o[a];
-}
-
-function deleteFromObjectKeyedComputedSloppy(o) {
- var a = "o";
- return delete o["fo" + a];
-}
-
-function deleteFromObjectWith(o) {
- with (o) {
- return delete foo;
- }
-}
-
-function deleteFromObjectElementSloppy(o) {
- return delete o[0];
-}
-
-function deleteFromObjectElementVarSloppy(o) {
- var a = 0;
- return delete o[a];
-}
-
-function deleteFromObjectElementSparseSloppy(o) {
- return delete o[100000];
-}
-
-function deleteFromObjectElementVarSloppy(o) {
- var a = 0;
- return delete o[a];
-}
-
-function deleteFromObjectElementSparseVarSloppy(o) {
- var a = 100000;
- return delete o[a];
-}
-
-function deleteFromObjectStrict(o) {
- "use strict";
- return delete o.foo;
-}
-
-function deleteFromObjectKeyedStrict(o) {
- "use strict";
- return delete o["foo"];
-}
-
-function deleteFromObjectKeyedVarStrict(o) {
- "use strict";
- var a = "foo";
- return delete o[a];
-}
-
-function deleteFromObjectKeyedComputedStrict(o) {
- "use strict";
- var a = "o";
- return delete o["fo" + a];
-}
-
-function deleteFromObjectElementStrict(o) {
- "use strict";
- return delete o[0];
-}
-
-function deleteFromObjectElementSparseStrict(o) {
- "use strict";
- return delete o[100000];
-}
-
-function deleteFromObjectElementVarStrict(o) {
- "use strict";
- var a = 0;
- return delete o[a];
-}
-
-function deleteFromObjectElementSparseVarStrict(o) {
- "use strict";
- var a = 100000;
- return delete o[a];
-}
-
-function testStrongObjectDelete() {
- "use strict";
-
- let deletePropertyFuncsSloppy = [
- deleteFromObjectSloppy,
- deleteFromObjectKeyedSloppy,
- deleteFromObjectKeyedVarSloppy,
- deleteFromObjectKeyedComputedSloppy,
- deleteFromObjectWith
- ];
- let deletePropertyFuncsStrict = [
- deleteFromObjectStrict,
- deleteFromObjectKeyedStrict,
- deleteFromObjectKeyedVarStrict,
- deleteFromObjectKeyedComputedStrict
- ];
- let deleteElementFuncsSloppy = [
- deleteFromObjectElementSloppy,
- deleteFromObjectElementVarSloppy
- ];
- let deleteElementSparseFuncsSloppy = [
- deleteFromObjectElementSparseSloppy,
- deleteFromObjectElementSparseVarSloppy
- ];
- let deleteElementFuncsStrict = [
- deleteFromObjectElementStrict,
- deleteFromObjectElementVarStrict
- ];
- let deleteElementSparseFuncsStrict = [
- deleteFromObjectElementSparseStrict,
- deleteFromObjectElementSparseVarStrict
- ];
- let deleteFuncs = deletePropertyFuncsSloppy.concat(
- deletePropertyFuncsStrict, deleteElementFuncsSloppy,
- deleteElementSparseFuncsSloppy, deleteElementFuncsStrict,
- deleteElementSparseFuncsStrict);
-
- for (let deleteFunc of deleteFuncs) {
- assertTrue(deleteFunc(strongFunction));
- }
-
- let testCasesSloppy = [
- [deletePropertyFuncsSloppy, "foo"],
- [deleteElementFuncsSloppy, "0"],
- [deleteElementSparseFuncsSloppy, "100000"]
- ];
-
- let testCasesStrict = [
- [deletePropertyFuncsStrict, "foo"],
- [deleteElementFuncsStrict, "0"],
- [deleteElementSparseFuncsStrict, "100000"]
- ];
-
- let propDescs = [
- {configurable: true, value: "bar"},
- {configurable: true, value: 1},
- {configurable: true, enumerable: true, writable: true, value: "bar"},
- {configurable: true, enumerable: true, writable: true, value: 1},
- {configurable: true, get: (function(){return 0}), set: (function(x){})}
- ];
-
- for (let propDesc of propDescs) {
- for (let testCase of testCasesSloppy) {
- let name = testCase[1];
- for (let deleteFunc of testCase[0]) {
- for (let o of getWeakObjects()) {
- Object.defineProperty(o, name, propDesc);
- assertTrue(delete o["bar"]);
- assertTrue(delete o[5000]);
- assertTrue(deleteFunc(o));
- assertFalse(o.hasOwnProperty(name));
- %OptimizeFunctionOnNextCall(deleteFunc);
- Object.defineProperty(o, name, propDesc);
- assertTrue(deleteFunc(o));
- assertFalse(o.hasOwnProperty(name));
- %DeoptimizeFunction(deleteFunc);
- Object.defineProperty(o, name, propDesc);
- assertTrue(deleteFunc(o));
- assertFalse(o.hasOwnProperty(name));
- }
- for (let o of getStrongObjects()) {
- Object.defineProperty(o, name, propDesc);
- assertTrue(delete o["bar"]);
- assertTrue(delete o[5000]);
- assertFalse(deleteFunc(o));
- assertTrue(o.hasOwnProperty(name));
- %OptimizeFunctionOnNextCall(deleteFunc);
- assertFalse(deleteFunc(o));
- assertTrue(o.hasOwnProperty(name));
- %DeoptimizeFunction(deleteFunc);
- assertFalse(deleteFunc(o));
- assertTrue(o.hasOwnProperty(name));
- }
- }
- }
- for (let testCase of testCasesStrict) {
- let name = testCase[1];
- for (let deleteFunc of testCase[0]) {
- for (let o of getWeakObjects()) {
- Object.defineProperty(o, name, propDesc);
- assertTrue(delete o["bar"]);
- assertTrue(delete o[5000]);
- assertTrue(deleteFunc(o));
- assertFalse(o.hasOwnProperty(name));
- %OptimizeFunctionOnNextCall(deleteFunc);
- Object.defineProperty(o, name, propDesc);
- assertTrue(deleteFunc(o));
- assertFalse(o.hasOwnProperty(name));
- %DeoptimizeFunction(deleteFunc);
- Object.defineProperty(o, name, propDesc);
- assertTrue(deleteFunc(o));
- assertFalse(o.hasOwnProperty(name));
- }
- for (let o of getStrongObjects()) {
- Object.defineProperty(o, name, propDesc);
- assertTrue(delete o["bar"]);
- assertTrue(delete o[5000]);
- assertThrows(function(){deleteFunc(o)}, TypeError);
- assertTrue(o.hasOwnProperty(name));
- %OptimizeFunctionOnNextCall(deleteFunc);
- assertThrows(function(){deleteFunc(o)}, TypeError);
- assertTrue(o.hasOwnProperty(name));
- %DeoptimizeFunction(deleteFunc);
- assertThrows(function(){deleteFunc(o)}, TypeError);
- assertTrue(o.hasOwnProperty(name));
- }
- }
- }
- }
-}
-testStrongObjectDelete();
diff --git a/test/mjsunit/strong/object-freeze-property.js b/test/mjsunit/strong/object-freeze-property.js
deleted file mode 100644
index e76af1b..0000000
--- a/test/mjsunit/strong/object-freeze-property.js
+++ /dev/null
@@ -1,75 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode --allow-natives-syntax
-
-// TODO(conradw): Track implementation of strong bit for other objects, add
-// tests.
-
-function getSloppyObjects() {
- return [(function(){}), ({})];
-}
-
-function getStrictObjects() {
- "use strict";
- return [(function(){}), ({})];
-}
-
-function getStrongObjects() {
- "use strong";
- // Strong functions can't have properties added to them.
- return [{}];
-}
-
-(function testStrongObjectFreezePropValid() {
- "use strict";
- let strongObjects = getStrongObjects();
-
- for (let o of strongObjects) {
- Object.defineProperty(o, "foo", { configurable: true, writable: true });
- assertDoesNotThrow(
- function() {
- "use strong";
- Object.defineProperty(o, "foo", {configurable: true, writable: false });
- });
- }
-})();
-
-(function testStrongObjectFreezePropInvalid() {
- "use strict";
- let sloppyObjects = getSloppyObjects();
- let strictObjects = getStrictObjects();
- let strongObjects = getStrongObjects();
- let weakObjects = sloppyObjects.concat(strictObjects);
-
- for (let o of weakObjects) {
- Object.defineProperty(o, "foo", { writable: true });
- assertDoesNotThrow(
- function() {
- "use strong";
- Object.defineProperty(o, "foo", { writable: false });
- });
- }
- for (let o of strongObjects) {
- function defProp(o) {
- Object.defineProperty(o, "foo", { writable: false });
- }
- function defProps(o) {
- Object.defineProperties(o, { "foo": { writable: false } });
- }
- function freezeProp(o) {
- Object.freeze(o);
- }
- Object.defineProperty(o, "foo", { writable: true });
- for (let func of [defProp, defProps, freezeProp]) {
- assertThrows(function(){func(o)}, TypeError);
- assertThrows(function(){func(o)}, TypeError);
- assertThrows(function(){func(o)}, TypeError);
- %OptimizeFunctionOnNextCall(func);
- assertThrows(function(){func(o)}, TypeError);
- %DeoptimizeFunction(func);
- assertThrows(function(){func(o)}, TypeError);
- }
- }
-})();
diff --git a/test/mjsunit/strong/object-set-prototype.js b/test/mjsunit/strong/object-set-prototype.js
deleted file mode 100644
index 53706df..0000000
--- a/test/mjsunit/strong/object-set-prototype.js
+++ /dev/null
@@ -1,83 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode --allow-natives-syntax
-
-// TODO(conradw): Track implementation of strong bit for other objects, add
-// tests.
-
-function getSloppyObjects() {
- return [(function(){}), ({})];
-}
-
-function getStrictObjects() {
- "use strict";
- return [(function(){}), ({})];
-}
-
-function getStrongObjects() {
- "use strong";
- return [(function(){}), ({})];
-}
-
-function declareObjectLiteralWithProtoSloppy() {
- return {__proto__: {}};
-}
-
-function declareObjectLiteralWithProtoStrong() {
- "use strong";
- return {__proto__: {}};
-}
-
-function testStrongObjectSetProto() {
- "use strict";
- let sloppyObjects = getSloppyObjects();
- let strictObjects = getStrictObjects();
- let strongObjects = getStrongObjects();
- let weakObjects = sloppyObjects.concat(strictObjects);
-
- for (let o of weakObjects) {
- let setProtoBuiltin = function(o){Object.setPrototypeOf(o, {})};
- let setProtoProperty = function(o){o.__proto__ = {}};
- for (let setProtoFunc of [setProtoBuiltin, setProtoProperty]) {
- assertDoesNotThrow(function(){setProtoFunc(o)});
- assertDoesNotThrow(function(){setProtoFunc(o)});
- assertDoesNotThrow(function(){setProtoFunc(o)});
- %OptimizeFunctionOnNextCall(setProtoFunc);
- assertDoesNotThrow(function(){setProtoFunc(o)});
- %DeoptimizeFunction(setProtoFunc);
- assertDoesNotThrow(function(){setProtoFunc(o)});
- }
- }
- for (let o of strongObjects) {
- let setProtoBuiltin = function(o){Object.setPrototypeOf(o, {})};
- let setProtoProperty = function(o){o.__proto__ = {}};
- for (let setProtoFunc of [setProtoBuiltin, setProtoProperty]) {
- assertThrows(function(){setProtoFunc(o)}, TypeError);
- assertThrows(function(){setProtoFunc(o)}, TypeError);
- assertThrows(function(){setProtoFunc(o)}, TypeError);
- %OptimizeFunctionOnNextCall(setProtoFunc);
- assertThrows(function(){setProtoFunc(o)}, TypeError);
- %DeoptimizeFunction(setProtoFunc);
- assertThrows(function(){setProtoFunc(o)}, TypeError);
- }
- }
-
- assertDoesNotThrow(declareObjectLiteralWithProtoSloppy);
- assertDoesNotThrow(declareObjectLiteralWithProtoSloppy);
- assertDoesNotThrow(declareObjectLiteralWithProtoSloppy);
- %OptimizeFunctionOnNextCall(declareObjectLiteralWithProtoSloppy);
- assertDoesNotThrow(declareObjectLiteralWithProtoSloppy);
- %DeoptimizeFunction(declareObjectLiteralWithProtoSloppy);
- assertDoesNotThrow(declareObjectLiteralWithProtoSloppy);
-
- assertDoesNotThrow(declareObjectLiteralWithProtoStrong);
- assertDoesNotThrow(declareObjectLiteralWithProtoStrong);
- assertDoesNotThrow(declareObjectLiteralWithProtoStrong);
- %OptimizeFunctionOnNextCall(declareObjectLiteralWithProtoStrong);
- assertDoesNotThrow(declareObjectLiteralWithProtoStrong);
- %DeoptimizeFunction(declareObjectLiteralWithProtoStrong);
- assertDoesNotThrow(declareObjectLiteralWithProtoStrong);
-}
-testStrongObjectSetProto();
diff --git a/test/mjsunit/strong/super.js b/test/mjsunit/strong/super.js
deleted file mode 100644
index bd289f2..0000000
--- a/test/mjsunit/strong/super.js
+++ /dev/null
@@ -1,62 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode --allow-natives-syntax
-
-'use strong';
-
-
-function desc(obj, n) {
- return Object.getOwnPropertyDescriptor(obj, n);
-}
-
-
-(function TestClass() {
- class C {
- m() {
- super.x;
- }
- get x() {
- super.x;
- }
- set y(_) {
- super.x;
- }
- static m() {
- super.x;
- }
- static get x() {
- super.x;
- }
- static set y(_) {
- super.x;
- }
- }
-
- assertEquals(C.prototype, C.prototype.m[%HomeObjectSymbol()]);
- assertEquals(C.prototype, desc(C.prototype, 'x').get[%HomeObjectSymbol()]);
- assertEquals(C.prototype, desc(C.prototype, 'y').set[%HomeObjectSymbol()]);
- assertEquals(C, C.m[%HomeObjectSymbol()]);
- assertEquals(C, desc(C, 'x').get[%HomeObjectSymbol()]);
- assertEquals(C, desc(C, 'y').set[%HomeObjectSymbol()]);
-})();
-
-
-(function TestObjectLiteral() {
- let o = {
- m() {
- super.x;
- },
- get x() {
- super.x;
- },
- set y(_) {
- super.x;
- }
- };
-
- assertEquals(o, o.m[%HomeObjectSymbol()]);
- assertEquals(o, desc(o, 'x').get[%HomeObjectSymbol()]);
- assertEquals(o, desc(o, 'y').set[%HomeObjectSymbol()]);
-})();
diff --git a/test/mjsunit/strong/switch.js b/test/mjsunit/strong/switch.js
deleted file mode 100644
index 96ee1ee..0000000
--- a/test/mjsunit/strong/switch.js
+++ /dev/null
@@ -1,110 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode
-
-"use strict";
-
-function CheckSwitch() {
- let jumpStatements = [
- "break; ",
- "continue; ",
- "break foo; ",
- "continue foo; ",
- "return; ",
- "throw new TypeError(); ",
- "if(1) break; else continue; ",
- "if(1) {1+1; {break;}} else continue; "
- ]
-
- let otherStatements = [
- "null; ",
- "1+1; ",
- "{} ",
- "for(;false;) {break;} ",
- "for(;false;) {1+1; {throw new TypeError();}} ",
- "(function(){return});",
- "(function(){throw new TypeError();});",
- "{break; 1+1;} ",
- "if(1) break; ",
- "if(1) break; else 1+1; ",
- "if(1) 1+1; else break; ",
- ]
-
- let successContexts = [
- ["switch(1) {case 1: ", "case 2: }"],
- ["switch(1) {case 1: case 2: ", "default: }"],
- ["switch(1) {case 1: case 2: ", "default: {}}"],
- ["switch(1) {case 1: case 2: ", "default: 1+1}"],
- ["switch(1) {case 1: break; case 2: ", "default: }"],
- ["switch(1) {case 1: case 2: break; case 3: ", "case 4: default: }"],
- ["switch(1) {case 1: if(1) break; else {", "} default: break;}"]
- ]
-
- let strongThrowContexts = [
- ["switch(1) {case 1: 1+1; case 2: ", "}"],
- ["switch(1) {case 1: bar: break foo; case 2: ", "}"],
- ["switch(1) {case 1: bar:", " case 2: }"],
- ["switch(1) {case 1: bar:{ ", "} case 2: }"],
- ["switch(1) {case 1: bar:{ ", "} default: break;}"],
- ["switch(1) {case 1: { bar:{ { ", "} } } default: break;}"],
- ["switch(1) {case 1: { { { ", "} 1+1;} } default: break;}"],
- ["switch(1) {case 1: if(1) {", "} default: break;}"],
- ["switch(1) {case 1: bar:if(1) break; else {", "} default: break;}"]
- ]
-
- let sloppy_wrap = ["function f() { foo:for(;;) {", "}}"];
- let strong_wrap = ["function f() { 'use strong'; foo:for(;;) {", "}}"];
-
- for (let context of successContexts) {
- let sloppy_prefix = sloppy_wrap[0] + context[0];
- let sloppy_suffix = context[1] + sloppy_wrap[1];
- let strong_prefix = strong_wrap[0] + context[0];
- let strong_suffix = context[1] + strong_wrap[1];
-
- for (let code of jumpStatements) {
- assertDoesNotThrow(strong_wrap[0] + "switch(1) {case 1: " + code + "}}}");
- assertDoesNotThrow(strong_prefix + code + strong_suffix);
- assertDoesNotThrow(strong_prefix + "{ 1+1; " + code + "}" +
- strong_suffix);
- assertDoesNotThrow(strong_prefix + "{ 1+1; { 1+1; " + code + "}}" +
- strong_suffix);
- assertDoesNotThrow(strong_prefix + "if(1) " + code + "else break;" +
- strong_suffix);
- assertDoesNotThrow(strong_prefix + "if(1) " + code +
- "else if (1) break; else " + code + strong_suffix);
- }
- for (let code of otherStatements) {
- assertDoesNotThrow(sloppy_prefix + code + sloppy_suffix);
- assertThrows(strong_prefix + code + strong_suffix, SyntaxError);
- }
- }
-
- for (let context of strongThrowContexts) {
- let sloppy_prefix = sloppy_wrap[0] + context[0];
- let sloppy_suffix = context[1] + sloppy_wrap[1];
- let strong_prefix = strong_wrap[0] + context[0];
- let strong_suffix = context[1] + strong_wrap[1];
-
- for (let code of jumpStatements.concat(otherStatements)) {
- assertDoesNotThrow(sloppy_prefix + code + sloppy_suffix);
- assertThrows(strong_prefix + code + strong_suffix, SyntaxError);
- }
- }
-
- for (let code of otherStatements) {
- assertDoesNotThrow("switch(1) {default: " + code + "}");
- assertDoesNotThrow("switch(1) {case 1: " + code + "}");
- assertDoesNotThrow("switch(1) {case 1: default: " + code + "}");
- assertDoesNotThrow("switch(1) {case 1: break; default: " + code + "}");
- assertDoesNotThrow("switch(1) {case 1: " + code + "break; default: }");
- }
-}
-
-CheckSwitch();
-
-assertDoesNotThrow("'use strong'; switch(1) {}");
-assertDoesNotThrow("'use strong'; switch(1) {case 1:}");
-assertDoesNotThrow("'use strong'; switch(1) {default:}");
-assertDoesNotThrow("'use strong'; switch(1) {case 1: case 2: default:}");
diff --git a/test/mjsunit/strong/undefined.js b/test/mjsunit/strong/undefined.js
deleted file mode 100644
index 218547a..0000000
--- a/test/mjsunit/strong/undefined.js
+++ /dev/null
@@ -1,200 +0,0 @@
-// Copyright 2014 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode --harmony-sloppy
-
-// Repurposing the strict mode 'eval' and 'arguments' tests to test for correct
-// behaviour of 'undefined' as an identifier in strong mode.
-"use strict";
-
-function CheckStrongMode(code) {
- let strictContexts = [
- ["'use strict';", ""],
- ["function outer() { 'use strict';", "}"],
- ["function outer() { 'use strict'; function inner() {", "}}"],
- ["class C { m() {", "} }"]
- ]
- let strongContexts = [
- ["'use strong';", ""],
- ["function outer() { 'use strong';", "}"],
- ["function outer() { 'use strong'; function inner() {", "}}"],
- ["class C { m() { 'use strong';", "} }"]
- ]
-
- for (let context of strictContexts) {
- assertThrows(context[0] + code + context[1] + "; throw new TypeError();",
- TypeError);
- }
- for (let context of strongContexts) {
- assertThrows(context[0] + code + context[1], SyntaxError);
- }
-}
-
-// Binding 'undefined'
-CheckStrongMode("var undefined;");
-CheckStrongMode("let undefined;");
-CheckStrongMode("var undefined = 0;");
-CheckStrongMode("let undefined = 0;");
-CheckStrongMode("const undefined = 0;");
-CheckStrongMode("var x, y = 0, undefined;");
-CheckStrongMode("let x, y = 0, undefined;");
-
-// Function identifier is 'undefined'
-// Function declaration
-CheckStrongMode("function undefined() {}");
-assertThrows("function undefined() {'use strong';}", SyntaxError);
-
-// Generator function
-CheckStrongMode("function* undefined() {}");
-assertThrows("function* undefined() {'use strong';}", SyntaxError);
-
-// Function expression
-CheckStrongMode("(function undefined() {});");
-assertThrows("(function undefined() {'use strong';});", SyntaxError);
-CheckStrongMode("{foo: (function undefined(){})};");
-assertThrows("{foo: (function undefined(){'use strong';})};", SyntaxError);
-
-//Generator function expression
-CheckStrongMode("(function* undefined() {})");
-assertThrows("(function* undefined() {'use strong';})", SyntaxError);
-CheckStrongMode("{foo: (function* undefined(){})};");
-assertThrows("{foo: (function* undefined(){'use strong';})};", SyntaxError);
-
-// Function parameter named 'undefined'
-// Function declaration
-CheckStrongMode("function foo(a, b, undefined, c, d) {}");
-assertThrows("function foo(a, b, undefined, c, d) {'use strong';}",
- SyntaxError);
-
-// Generator function declaration
-CheckStrongMode("function* foo(a, b, undefined, c, d) {}");
-assertThrows("function* foo(a, b, undefined, c, d) {'use strong';}",
- SyntaxError);
-
-// Function expression
-CheckStrongMode("(function foo(a, b, undefined, c, d) {});");
-assertThrows("(function foo(a, b, undefined, c, d) {'use strong';})",
- SyntaxError);
-CheckStrongMode("{foo: (function foo(a, b, undefined, c, d) {})};");
-assertThrows("{foo: (function foo(a, b, undefined, c, d) {'use strong';})};",
- SyntaxError);
-
-// Generator function expression
-CheckStrongMode("(function* foo(a, b, undefined, c, d) {});");
-assertThrows("(function* foo(a, b, undefined, c, d) {'use strong';})",
- SyntaxError);
-CheckStrongMode("{foo: (function* foo(a, b, undefined, c, d) {})};");
-assertThrows("{foo: (function* foo(a, b, undefined, c, d) {'use strong';})};",
- SyntaxError);
-
-// Method parameter named 'undefined'
-// Class method
-CheckStrongMode("class C { foo(a, b, undefined, c, d) {} }");
-assertThrows("class C { foo(a, b, undefined, c, d) {'use strong';} }",
- SyntaxError);
-
-//Class generator method
-CheckStrongMode("class C { *foo(a, b, undefined, c, d) {} }");
-assertThrows("class C { *foo(a, b, undefined, c, d) {'use strong';} }",
- SyntaxError);
-
-//Object literal method
-CheckStrongMode("({ foo(a, b, undefined, c, d) {} });");
-assertThrows("({ foo(a, b, undefined, c, d) {'use strong';} });", SyntaxError);
-
-//Object literal generator method
-CheckStrongMode("({ *foo(a, b, undefined, c, d) {} });");
-assertThrows("({ *foo(a, b, undefined, c, d) {'use strong';} });", SyntaxError);
-
-// Class declaration named 'undefined'
-CheckStrongMode("class undefined {}");
-assertThrows("class undefined {'use strong'}", SyntaxError);
-
-// Class expression named 'undefined'
-CheckStrongMode("(class undefined {});");
-assertThrows("(class undefined {'use strong'});", SyntaxError);
-
-// Binding/assigning to 'undefined' in for
-CheckStrongMode("for(undefined = 0;false;);");
-CheckStrongMode("for(var undefined = 0;false;);");
-CheckStrongMode("for(let undefined = 0;false;);");
-CheckStrongMode("for(const undefined = 0;false;);");
-
-// Binding/assigning to 'undefined' in for-in
-CheckStrongMode("for(undefined in {});");
-CheckStrongMode("for(var undefined in {});");
-CheckStrongMode("for(let undefined in {});");
-CheckStrongMode("for(const undefined in {});");
-
-// Binding/assigning to 'undefined' in for-of
-CheckStrongMode("for(undefined of []);");
-CheckStrongMode("for(var undefined of []);");
-CheckStrongMode("for(let undefined of []);");
-CheckStrongMode("for(const undefined of []);");
-
-// Property accessor parameter named 'undefined'.
-CheckStrongMode("let o = { set foo(undefined) {} }");
-assertThrows("let o = { set foo(undefined) {'use strong';} }", SyntaxError);
-
-// catch(undefined)
-CheckStrongMode("try {} catch(undefined) {};");
-
-// Assignment to undefined
-CheckStrongMode("undefined = 0;");
-CheckStrongMode("print(undefined = 0);");
-CheckStrongMode("let x = undefined = 0;");
-
-// Compound assignment to undefined
-CheckStrongMode("undefined *= 0;");
-CheckStrongMode("undefined /= 0;");
-CheckStrongMode("print(undefined %= 0);");
-CheckStrongMode("let x = undefined += 0;");
-CheckStrongMode("let x = undefined -= 0;");
-CheckStrongMode("undefined <<= 0;");
-CheckStrongMode("undefined >>= 0;");
-CheckStrongMode("print(undefined >>>= 0);");
-CheckStrongMode("print(undefined &= 0);");
-CheckStrongMode("let x = undefined ^= 0;");
-CheckStrongMode("let x = undefined |= 0;");
-
-// Postfix increment with undefined
-CheckStrongMode("undefined++;");
-CheckStrongMode("print(undefined++);");
-CheckStrongMode("let x = undefined++;");
-
-// Postfix decrement with undefined
-CheckStrongMode("undefined--;");
-CheckStrongMode("print(undefined--);");
-CheckStrongMode("let x = undefined--;");
-
-// Prefix increment with undefined
-CheckStrongMode("++undefined;");
-CheckStrongMode("print(++undefined);");
-CheckStrongMode("let x = ++undefined;");
-
-// Prefix decrement with undefined
-CheckStrongMode("--undefined;");
-CheckStrongMode("print(--undefined);");
-CheckStrongMode("let x = --undefined;");
-
-// Function constructor: 'undefined' parameter name
-assertDoesNotThrow(function() {
- Function("undefined", "");
-});
-assertThrows(function() {
- Function("undefined", "'use strong';");
-}, SyntaxError);
-
-// Arrow functions with undefined parameters
-CheckStrongMode("(undefined => {return});");
-assertThrows("(undefined => {'use strong';});");
-
-CheckStrongMode("((undefined, b, c) => {return});");
-assertThrows("((undefined, b, c) => {'use strong';});");
-
-CheckStrongMode("((a, undefined, c) => {return});");
-assertThrows("((a, undefined, c) => {'use strong';});");
-
-CheckStrongMode("((a, b, undefined) => {return});");
-assertThrows("((a, b, undefined) => {'use strong';});");
diff --git a/test/mjsunit/strong/use-strong.js b/test/mjsunit/strong/use-strong.js
deleted file mode 100644
index 127dc35..0000000
--- a/test/mjsunit/strong/use-strong.js
+++ /dev/null
@@ -1,26 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode
-
-(function UseStrongScoping() {
- assertThrows("'use strong'; 0 == 0", SyntaxError);
- assertThrows("'use strong'; try {} catch(e) { { 0 == 0 } }", SyntaxError);
- assertThrows("function f() { 'use strong'; 0 == 0 }", SyntaxError);
- assertThrows("'use strong'; function f() { 0 == 0 }", SyntaxError);
- assertThrows("'use strong'; function f() { function g() { 0 == 0 } }", SyntaxError);
- assertTrue(eval("function f() { 'use strong' } 0 == 0"));
- assertTrue(eval("eval('\\\'use strong\\\''); 0 == 0"));
-})();
-
-(function UseStrongMixed() {
- assertThrows("'use strict'; 'use strong'; 0 == 0", SyntaxError);
- assertThrows("'use strong'; 'use strict'; 0 == 0", SyntaxError);
- assertThrows("'use strong'; 'use strong'; 0 == 0", SyntaxError);
- assertThrows("'use strict'; function f() { 'use strong'; 0 == 0 }", SyntaxError);
- assertThrows("'use strong'; function f() { 'use strict'; 0 == 0 }", SyntaxError);
- assertTrue(eval("'use strict'; function f() { 'use strong' } 0 == 0"));
- assertTrue(eval("var x; function f() { 'use strong' } delete x"));
- assertThrows("'use strict'; var x; function f() { 'use strong' } delete x", SyntaxError);
-})();
diff --git a/test/mjsunit/strong/var-let-const.js b/test/mjsunit/strong/var-let-const.js
deleted file mode 100644
index 5545ccf..0000000
--- a/test/mjsunit/strong/var-let-const.js
+++ /dev/null
@@ -1,22 +0,0 @@
-// Copyright 2014 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --strong-mode
-
-(function NoVar() {
- assertThrows("'use strong'; var x = 0;", SyntaxError);
- assertThrows("'use strong'; for(var i = 0; i < 10; ++i) { };", SyntaxError);
-})();
-
-
-(function LetIsOkay() {
- assertTrue(eval("'use strong'; let x = 0; x === 0;"));
- assertTrue(eval("'use strong'; for(let i = 0; i < 10; ++i) { } 0 === 0;"));
-})();
-
-
-(function ConstIsOkay() {
- assertTrue(eval("'use strong'; const x = 0; x === 0;"));
- assertTrue(eval("'use strong'; for(const i = 0; false;) { } 0 === 0;"));
-})();
diff --git a/test/mjsunit/tail-call-intrinsic.js b/test/mjsunit/tail-call-intrinsic.js
deleted file mode 100644
index a74f153..0000000
--- a/test/mjsunit/tail-call-intrinsic.js
+++ /dev/null
@@ -1,108 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --allow-natives-syntax --nostress-opt --turbo
-// Flags: --nonative-context-specialization
-
-var p0 = new Object();
-var p1 = new Object();
-var p2 = new Object();
-
-// Ensure 1 parameter passed straight-through is handled correctly
-var count1 = 100000;
-tailee1 = function() {
- "use strict";
- if (count1-- == 0) {
- return this;
- }
- return %_TailCall(tailee1, this);
-};
-
-%OptimizeFunctionOnNextCall(tailee1);
-assertEquals(p0, tailee1.call(p0));
-
-// Ensure 2 parameters passed straight-through trigger a tail call are handled
-// correctly and don't cause a stack overflow.
-var count2 = 100000;
-tailee2 = function(px) {
- "use strict";
- assertEquals(p2, px);
- assertEquals(p1, this);
- count2 = ((count2 | 0) - 1) | 0;
- if ((count2 | 0) === 0) {
- return this;
- }
- return %_TailCall(tailee2, this, px);
-};
-
-%OptimizeFunctionOnNextCall(tailee2);
-assertEquals(p1, tailee2.call(p1, p2));
-
-// Ensure swapped 2 parameters trigger a tail call and do the appropriate
-// parameters swapping
-var count3 = 999999;
-tailee3 = function(px) {
- "use strict";
- if (count3-- == 0) {
- return this;
- }
- return %_TailCall(tailee3, px, this);
-};
-
-%OptimizeFunctionOnNextCall(tailee3);
-assertEquals(p2, tailee3.call(p1, p2));
-
-// Ensure too many parameters defeats the tail call optimization (currently
-// unsupported).
-var count4 = 1000000;
-tailee4 = function(px) {
- "use strict";
- if (count4-- == 0) {
- return this;
- }
- return %_TailCall(tailee4, this, px, undefined);
-};
-
-%OptimizeFunctionOnNextCall(tailee4);
-assertThrows(function() { tailee4.call(p1, p2); });
-
-// Ensure that calling the arguments adapter defeats the tail call optimization.
-var count5 = 1000000;
-tailee5 = function(px) {
- "use strict";
- if (count5-- == 0) {
- return this;
- }
- return %_TailCall(tailee5, this);
-};
-
-%OptimizeFunctionOnNextCall(tailee5);
-assertThrows(function() { tailee5.call(p1, p2); });
-
-// Ensure tail calls with fewer stack parameters properly re-arranges the stack.
-tailee6 = function(px) {
- return px;
-}
-
-tailee7 = function(px, py, pz, pa, pb, pc) {
- "use strict";
- return %_TailCall(tailee6, this, pc);
-};
-
-%OptimizeFunctionOnNextCall(tailee6);
-%OptimizeFunctionOnNextCall(tailee7);
-assertEquals(110, tailee7.call(null, 15, 16, 17, 18, 0, 110));
-
-tailee8 = function(px, py, pz, pa, pb) {
- return pb + pz + px;
-}
-
-tailee9 = function(px, py, pz, pa, pb, pc) {
- "use strict";
- return %_TailCall(tailee8, this, pb, py, px, pa, pz);
-};
-
-%OptimizeFunctionOnNextCall(tailee8);
-%OptimizeFunctionOnNextCall(tailee9);
-assertEquals(32, tailee9.call(null, 15, 16, 17, 18, 0, 110));
diff --git a/test/mjsunit/tools/tickprocessor.js b/test/mjsunit/tools/tickprocessor.js
index 4ea25f9..73af098 100644
--- a/test/mjsunit/tools/tickprocessor.js
+++ b/test/mjsunit/tools/tickprocessor.js
@@ -384,7 +384,6 @@
TickProcessor.CALL_GRAPH_SIZE,
ignoreUnknown,
stateFilter,
- undefined,
"0",
"auto,auto",
false,
diff --git a/test/mjsunit/undetectable-compare.js b/test/mjsunit/undetectable-compare.js
index 3b97f5e..c785934 100644
--- a/test/mjsunit/undetectable-compare.js
+++ b/test/mjsunit/undetectable-compare.js
@@ -92,4 +92,16 @@
}
+assertFalse(undetectable == %GetUndetectable());
assertFalse(undetectable === %GetUndetectable());
+
+
+function test2(a, b) {
+ return a == b;
+}
+test2(0, 1);
+test2(undetectable, {});
+%OptimizeFunctionOnNextCall(test2);
+for (var i = 0; i < 5; ++i) {
+ assertFalse(test2(undetectable, %GetUndetectable()));
+}
diff --git a/test/mjsunit/wasm/adapter-frame.js b/test/mjsunit/wasm/adapter-frame.js
new file mode 100644
index 0000000..0e5d4b8
--- /dev/null
+++ b/test/mjsunit/wasm/adapter-frame.js
@@ -0,0 +1,321 @@
+// Copyright 2015 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-wasm
+
+load("test/mjsunit/wasm/wasm-constants.js");
+load("test/mjsunit/wasm/wasm-module-builder.js");
+
+const JS = false; // for testing the tests.
+const WRONG1 = 0x0DEDFACE;
+const WRONG2 = 0x0DEDBABE;
+const WRONG3 = 0x0DEDD011
+
+function makeSelect(type, args, which) {
+ if (JS) {
+ // For testing the tests.
+ return function() {
+ var val = +arguments[which];
+ print(" " + val);
+ if (type == kAstI32) return val | 0;
+ if (type == kAstF32) return Math.fround(val);
+ if (type == kAstF64) return val;
+ return undefined;
+ }
+ }
+
+ var builder = new WasmModuleBuilder();
+ var sig = new Array();
+ sig.push(type);
+ for (var i = 0; i < args; i++) sig.push(type);
+ builder.addFunction("select", sig)
+ .addBody([kExprGetLocal, which])
+ .exportFunc();
+
+ return builder.instantiate().exports.select;
+}
+
+const inputs = [
+ -1, 0, 2.2, 3.3, 3000.11, Infinity, -Infinity, NaN
+];
+
+(function TestInt1() {
+ print("i32 1(0)...");
+ var C = function(v) { return v | 0; }
+ var select1 = makeSelect(kAstI32, 1, 0);
+
+ for (val of inputs) {
+ assertEquals(C(val), select1(val));
+
+ // under args
+ assertEquals(C(undefined), select1());
+ // over args
+ assertEquals(C(val), select1(val, WRONG1));
+ assertEquals(C(val), select1(val, WRONG1, WRONG2));
+ }
+})();
+
+(function TestInt2() {
+ print("i32 2(0)...");
+ var C = function(v) { return v | 0; }
+ var select = makeSelect(kAstI32, 2, 0);
+
+ for (val of inputs) {
+ assertEquals(C(val), select(val, WRONG1));
+
+ // under args
+ assertEquals(C(undefined), select());
+ assertEquals(C(val), select(val));
+ // over args
+ assertEquals(C(val), select(val, WRONG1, WRONG2));
+ assertEquals(C(val), select(val, WRONG1, WRONG2, WRONG3));
+ }
+
+ print("i32 2(1)...");
+ var select = makeSelect(kAstI32, 2, 1);
+
+ for (val of inputs) {
+ assertEquals(C(val), select(WRONG1, val));
+
+ // under args
+ assertEquals(C(undefined), select());
+ assertEquals(C(undefined), select(val));
+ // over args
+ assertEquals(C(val), select(WRONG1, val));
+ assertEquals(C(val), select(WRONG1, val, WRONG2));
+ assertEquals(C(val), select(WRONG1, val, WRONG2, WRONG3));
+ }
+})();
+
+(function TestInt3() {
+ print("i32 3(0)...");
+ var C = function(v) { return v | 0; }
+ var select = makeSelect(kAstI32, 3, 0);
+
+ for (val of inputs) {
+ assertEquals(C(val), select(val, WRONG1, WRONG2));
+
+ // under args
+ assertEquals(C(undefined), select());
+ assertEquals(C(val), select(val));
+ assertEquals(C(val), select(val, WRONG1));
+ // over args
+ assertEquals(C(val), select(val, WRONG1, WRONG2, WRONG3));
+ }
+
+ print("i32 3(1)...");
+ var select = makeSelect(kAstI32, 3, 1);
+
+ for (val of inputs) {
+ assertEquals(val | 0, select(WRONG1, val, WRONG2));
+
+ // under args
+ assertEquals(C(undefined), select());
+ assertEquals(C(undefined), select(0xDEDFACE));
+ assertEquals(C(val), select(WRONG1, val));
+ // over args
+ assertEquals(C(val), select(WRONG1, val, WRONG2, WRONG3));
+ }
+
+ print("i32 3(2)...");
+ var select = makeSelect(kAstI32, 3, 2);
+
+ for (val of inputs) {
+ assertEquals(C(val), select(WRONG1, WRONG2, val));
+
+ // under args
+ assertEquals(C(undefined), select());
+ assertEquals(C(undefined), select(0xDEDFACE));
+ assertEquals(C(undefined), select(WRONG1, WRONG2));
+ // over args
+ assertEquals(C(val), select(WRONG1, WRONG2, val, WRONG3));
+ }
+})();
+
+(function TestFloat32_1() {
+ print("f32 1(0)...");
+ var C = function(v) { return Math.fround(v); }
+ var select1 = makeSelect(kAstF32, 1, 0);
+
+ for (val of inputs) {
+ assertEquals(C(val), select1(val));
+
+ // under args
+ assertEquals(C(undefined), select1());
+ // over args
+ assertEquals(C(val), select1(val, WRONG1));
+ assertEquals(C(val), select1(val, WRONG1, WRONG2));
+ }
+})();
+
+(function TestFloat32_2() {
+ print("f32 2(0)...");
+ var C = function(v) { return Math.fround(v); }
+ var select = makeSelect(kAstF32, 2, 0);
+
+ for (val of inputs) {
+ assertEquals(C(val), select(val, WRONG1));
+
+ // under args
+ assertEquals(C(undefined), select());
+ assertEquals(C(val), select(val));
+ // over args
+ assertEquals(C(val), select(val, WRONG1, WRONG2));
+ assertEquals(C(val), select(val, WRONG1, WRONG2, WRONG3));
+ }
+
+ print("f32 2(1)...");
+ var select = makeSelect(kAstF32, 2, 1);
+
+ for (val of inputs) {
+ assertEquals(C(val), select(WRONG1, val));
+
+ // under args
+ assertEquals(C(undefined), select());
+ assertEquals(C(undefined), select(val));
+ // over args
+ assertEquals(C(val), select(WRONG1, val));
+ assertEquals(C(val), select(WRONG1, val, WRONG2));
+ assertEquals(C(val), select(WRONG1, val, WRONG2, WRONG3));
+ }
+})();
+
+(function TestFloat32_2() {
+ print("f32 3(0)...");
+ var C = function(v) { return Math.fround(v); }
+ var select = makeSelect(kAstF32, 3, 0);
+
+ for (val of inputs) {
+ assertEquals(C(val), select(val, WRONG1, WRONG2));
+
+ // under args
+ assertEquals(C(undefined), select());
+ assertEquals(C(val), select(val));
+ assertEquals(C(val), select(val, WRONG1));
+ // over args
+ assertEquals(C(val), select(val, WRONG1, WRONG2, WRONG3));
+ }
+
+ print("f32 3(1)...");
+ var select = makeSelect(kAstF32, 3, 1);
+
+ for (val of inputs) {
+ assertEquals(C(val), select(WRONG1, val, WRONG2));
+
+ // under args
+ assertEquals(C(undefined), select());
+ assertEquals(C(undefined), select(0xDEDFACE));
+ assertEquals(C(val), select(WRONG1, val));
+ // over args
+ assertEquals(C(val), select(WRONG1, val, WRONG2, WRONG3));
+ }
+
+ print("f32 3(2)...");
+ var select = makeSelect(kAstF32, 3, 2);
+
+ for (val of inputs) {
+ assertEquals(C(val), select(WRONG1, WRONG2, val));
+
+ // under args
+ assertEquals(C(undefined), select());
+ assertEquals(C(undefined), select(0xDEDFACE));
+ assertEquals(C(undefined), select(WRONG1, WRONG2));
+ // over args
+ assertEquals(C(val), select(WRONG1, WRONG2, val, WRONG3));
+ }
+})();
+
+
+(function TestFloat64_1() {
+ print("f64 1(0)...");
+ var C = function(v) { return +v; }
+ var select1 = makeSelect(kAstF64, 1, 0);
+
+ for (val of inputs) {
+ assertEquals(C(val), select1(val));
+
+ // under args
+ assertEquals(C(undefined), select1());
+ // over args
+ assertEquals(C(val), select1(val, WRONG1));
+ assertEquals(C(val), select1(val, WRONG1, WRONG2));
+ }
+})();
+
+(function TestFloat64_2() {
+ print("f64 2(0)...");
+ var C = function(v) { return +v; }
+ var select = makeSelect(kAstF64, 2, 0);
+
+ for (val of inputs) {
+ assertEquals(C(val), select(val, WRONG1));
+
+ // under args
+ assertEquals(C(undefined), select());
+ assertEquals(C(val), select(val));
+ // over args
+ assertEquals(C(val), select(val, WRONG1, WRONG2));
+ assertEquals(C(val), select(val, WRONG1, WRONG2, WRONG3));
+ }
+
+ print("f64 2(1)...");
+ var select = makeSelect(kAstF64, 2, 1);
+
+ for (val of inputs) {
+ assertEquals(C(val), select(WRONG1, val));
+
+ // under args
+ assertEquals(C(undefined), select());
+ assertEquals(C(undefined), select(val));
+ // over args
+ assertEquals(C(val), select(WRONG1, val));
+ assertEquals(C(val), select(WRONG1, val, WRONG2));
+ assertEquals(C(val), select(WRONG1, val, WRONG2, WRONG3));
+ }
+})();
+
+(function TestFloat64_2() {
+ print("f64 3(0)...");
+ var C = function(v) { return +v; }
+ var select = makeSelect(kAstF64, 3, 0);
+
+ for (val of inputs) {
+ assertEquals(C(val), select(val, WRONG1, WRONG2));
+
+ // under args
+ assertEquals(C(undefined), select());
+ assertEquals(C(val), select(val));
+ assertEquals(C(val), select(val, WRONG1));
+ // over args
+ assertEquals(C(val), select(val, WRONG1, WRONG2, WRONG3));
+ }
+
+ print("f64 3(1)...");
+ var select = makeSelect(kAstF64, 3, 1);
+
+ for (val of inputs) {
+ assertEquals(C(val), select(WRONG1, val, WRONG2));
+
+ // under args
+ assertEquals(C(undefined), select());
+ assertEquals(C(undefined), select(0xDEDFACE));
+ assertEquals(C(val), select(WRONG1, val));
+ // over args
+ assertEquals(C(val), select(WRONG1, val, WRONG2, WRONG3));
+ }
+
+ print("f64 3(2)...");
+ var select = makeSelect(kAstF64, 3, 2);
+
+ for (val of inputs) {
+ assertEquals(C(val), select(WRONG1, WRONG2, val));
+
+ // under args
+ assertEquals(C(undefined), select());
+ assertEquals(C(undefined), select(0xDEDFACE));
+ assertEquals(C(undefined), select(WRONG1, WRONG2));
+ // over args
+ assertEquals(C(val), select(WRONG1, WRONG2, val, WRONG3));
+ }
+})();
diff --git a/test/mjsunit/wasm/asm-wasm-copy.js b/test/mjsunit/wasm/asm-wasm-copy.js
new file mode 100644
index 0000000..35c5f76
--- /dev/null
+++ b/test/mjsunit/wasm/asm-wasm-copy.js
@@ -0,0 +1,27 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-wasm
+
+(function TestCopyBug() {
+ // This was tickling a register allocation issue with
+ // idiv in embenchen/copy.
+ function asmModule(){
+ 'use asm';
+ function func() {
+ var ret = 0;
+ var x = 1, y = 0, z = 0;
+ var a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, g = 0;
+ do {
+ y = (x + 0) | 0;
+ z = (y | 0) % 2 | 0;
+ ret = (y + z + a + b + c + d + e + f + g) | 0;
+ } while(0);
+ return ret | 0;
+ }
+ return { func: func };
+ }
+ var wasm = Wasm.instantiateModuleFromAsm(asmModule.toString());
+ assertEquals(asmModule().func(), wasm.func());
+})();
diff --git a/test/mjsunit/wasm/asm-wasm-deopt.js b/test/mjsunit/wasm/asm-wasm-deopt.js
new file mode 100644
index 0000000..4b16b71
--- /dev/null
+++ b/test/mjsunit/wasm/asm-wasm-deopt.js
@@ -0,0 +1,29 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-wasm
+// Flags: --allow-natives-syntax
+
+(function TestDeoptimizeArgMismatch() {
+ function deopt() {
+ %DeoptimizeFunction(test);
+ }
+ function Module(global, env, buffer) {
+ "use asm";
+ var deopt = env.deopt;
+ function _main(i4, i5) {
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ deopt();
+ return i5 | 0;
+ }
+ return {'_main': _main}
+ }
+ function test() {
+ var wasm = Wasm.instantiateModuleFromAsm(
+ Module.toString(), {'deopt': deopt});
+ wasm._main(0, 0, 0);
+ }
+ test();
+})();
diff --git a/test/mjsunit/wasm/asm-wasm-f32.js b/test/mjsunit/wasm/asm-wasm-f32.js
new file mode 100644
index 0000000..a94994d
--- /dev/null
+++ b/test/mjsunit/wasm/asm-wasm-f32.js
@@ -0,0 +1,242 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-wasm
+
+function WrapInAsmModule(func) {
+ function MODULE_NAME(stdlib) {
+ "use asm";
+ var fround = stdlib.Math.fround;
+ var Math_ceil = stdlib.Math.ceil;
+ var Math_floor = stdlib.Math.floor;
+ var Math_sqrt = stdlib.Math.sqrt;
+ var Math_abs = stdlib.Math.abs;
+ var Math_min = stdlib.Math.min;
+ var Math_max = stdlib.Math.max;
+
+ FUNC_BODY
+ return {main: FUNC_NAME};
+ }
+
+ var source = MODULE_NAME.toString()
+ .replace(/MODULE_NAME/g, func.name + "_module")
+ .replace(/FUNC_BODY/g, func.toString())
+ .replace(/FUNC_NAME/g, func.name);
+ return eval("(" + source + ")");
+}
+
+function RunThreeWayTest(asmfunc, expect) {
+ var asm_source = asmfunc.toString();
+ var nonasm_source = asm_source.replace(new RegExp("use asm"), "");
+ var stdlib = {Math: Math};
+
+ var js_module = eval("(" + nonasm_source + ")")(stdlib);
+ print("Testing " + asmfunc.name + " (js)...");
+ expect(js_module);
+
+ print("Testing " + asmfunc.name + " (asm.js)...");
+ var asm_module = asmfunc(stdlib);
+ expect(asm_module);
+
+ print("Testing " + asmfunc.name + " (wasm)...");
+ var wasm_module = Wasm.instantiateModuleFromAsm(asm_source, stdlib);
+ expect(wasm_module);
+}
+
+const fround = Math.fround;
+const Math_ceil = Math.ceil;
+const Math_floor = Math.floor;
+const Math_sqrt = Math.sqrt;
+const Math_abs = Math.abs;
+const Math_min = Math.min;
+const Math_max = Math.max;
+
+function f32_add(a, b) {
+ a = fround(a);
+ b = fround(b);
+ return fround(fround(a) + fround(b));
+}
+
+function f32_sub(a, b) {
+ a = fround(a);
+ b = fround(b);
+ return fround(fround(a) - fround(b));
+}
+
+function f32_mul(a, b) {
+ a = fround(a);
+ b = fround(b);
+ return fround(fround(a) * fround(b));
+}
+
+function f32_div(a, b) {
+ a = fround(a);
+ b = fround(b);
+ return fround(fround(a) / fround(b));
+}
+
+function f32_ceil(a) {
+ a = fround(a);
+ return fround(Math_ceil(fround(a)));
+}
+
+function f32_floor(a) {
+ a = fround(a);
+ return fround(Math_floor(fround(a)));
+}
+
+function f32_sqrt(a) {
+ a = fround(a);
+ return fround(Math_sqrt(fround(a)));
+}
+
+function f32_abs(a) {
+ a = fround(a);
+ return fround(Math_abs(fround(a)));
+}
+
+function f32_min(a, b) {
+ a = fround(a);
+ b = fround(b);
+ return fround(Math_min(fround(a), fround(b)));
+}
+
+function f32_max(a, b) {
+ a = fround(a);
+ b = fround(b);
+ return fround(Math_max(fround(a), fround(b)));
+}
+
+function f32_eq(a, b) {
+ a = fround(a);
+ b = fround(b);
+ if (fround(a) == fround(b)) {
+ return 1;
+ }
+ return 0;
+}
+
+function f32_ne(a, b) {
+ a = fround(a);
+ b = fround(b);
+ if (fround(a) != fround(b)) {
+ return 1;
+ }
+ return 0;
+}
+
+function f32_lt(a, b) {
+ a = fround(a);
+ b = fround(b);
+ if (fround(a) < fround(b)) {
+ return 1;
+ }
+ return 0;
+}
+
+function f32_lteq(a, b) {
+ a = fround(a);
+ b = fround(b);
+ if (fround(a) <= fround(b)) {
+ return 1;
+ }
+ return 0;
+}
+
+function f32_gt(a, b) {
+ a = fround(a);
+ b = fround(b);
+ if (fround(a) > fround(b)) {
+ return 1;
+ }
+ return 0;
+}
+
+function f32_gteq(a, b) {
+ a = fround(a);
+ b = fround(b);
+ if (fround(a) >= fround(b)) {
+ return 1;
+ }
+ return 0;
+}
+
+
+var inputs = [
+ 0, 1, 2, 3, 4,
+ NaN,
+ Infinity,
+ -Infinity,
+ 10, 20, 30, 31, 32, 33, 100, 2000,
+ 30000, 400000, 5000000,
+ 100000000, 2000000000,
+ 2147483646,
+ 2147483647,
+ 2147483648,
+ 2147483649,
+ 0x273a798e, 0x187937a3, 0xece3af83, 0x5495a16b, 0x0b668ecc, 0x11223344,
+ 0x0000af73, 0x0000116b, 0x00658ecc, 0x002b3b4c,
+ 0x88776655, 0x70000000, 0x07200000, 0x7fffffff, 0x56123761, 0x7fffff00,
+ 0xeeeeeeee, 0xfffffffd, 0xf0000000, 0x007fffff, 0x003fffff, 0x001fffff,
+ -0,
+ -1, -2, -3, -4,
+ -10, -20, -30, -31, -32, -33, -100, -2000,
+ -30000, -400000, -5000000,
+ -100000000, -2000000000,
+ -2147483646,
+ -2147483647,
+ -2147483648,
+ -2147483649,
+ 0.1,
+ 1.1e-2,
+ 1.2e-4,
+ 1.3e-8,
+ 1.4e-11,
+ 1.5e-12,
+ 1.6e-13
+];
+
+var funcs = [
+ f32_add,
+ f32_sub,
+ f32_mul,
+ f32_div,
+ f32_ceil,
+ f32_floor,
+// TODO(bradnelson) f32_sqrt,
+// TODO(bradnelson) f32_abs,
+// TODO(bradnelson) f32_min is wrong for -0
+// TODO(bradnelson) f32_max is wrong for -0
+ f32_eq,
+ f32_ne,
+ f32_lt,
+ f32_lteq,
+ f32_gt,
+ f32_gteq,
+];
+
+(function () {
+ for (func of funcs) {
+ RunThreeWayTest(WrapInAsmModule(func), function (module) {
+ if (func.length == 1) {
+ for (a of inputs) {
+ assertEquals(func(a), module.main(a));
+ assertEquals(func(a / 11), module.main(a / 11));
+ assertEquals(func(a / 430.9), module.main(a / 430.9));
+ assertEquals(func(a / -31.1), module.main(a / -31.1));
+ }
+ } else {
+ for (a of inputs) {
+ for (b of inputs) {
+ assertEquals(func(a, b), module.main(a, b));
+ assertEquals(func(a / 11, b), module.main(a / 11, b));
+ assertEquals(func(a, b / 420.9), module.main(a, b / 420.9));
+ assertEquals(func(a / -31.1, b), module.main(a / -31.1, b));
+ }
+ }
+ }
+ });
+ }
+
+})();
diff --git a/test/mjsunit/wasm/asm-wasm-f64.js b/test/mjsunit/wasm/asm-wasm-f64.js
new file mode 100644
index 0000000..11f9da3
--- /dev/null
+++ b/test/mjsunit/wasm/asm-wasm-f64.js
@@ -0,0 +1,313 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-wasm
+
+function WrapInAsmModule(func) {
+ function MODULE_NAME(stdlib) {
+ "use asm";
+ var Math_ceil = stdlib.Math.ceil;
+ var Math_floor = stdlib.Math.floor;
+ var Math_sqrt = stdlib.Math.sqrt;
+ var Math_abs = stdlib.Math.abs;
+ var Math_min = stdlib.Math.min;
+ var Math_max = stdlib.Math.max;
+ var Math_acos = stdlib.Math.acos;
+ var Math_asin = stdlib.Math.asin;
+ var Math_atan = stdlib.Math.atan;
+ var Math_cos = stdlib.Math.cos;
+ var Math_sin = stdlib.Math.sin;
+ var Math_tan = stdlib.Math.tan;
+ var Math_exp = stdlib.Math.exp;
+ var Math_log = stdlib.Math.log;
+ var Math_atan2 = stdlib.Math.atan2;
+
+ FUNC_BODY
+ return {main: FUNC_NAME};
+ }
+
+ var source = MODULE_NAME.toString()
+ .replace(/MODULE_NAME/g, func.name + "_module")
+ .replace(/FUNC_BODY/g, func.toString())
+ .replace(/FUNC_NAME/g, func.name);
+ return eval("(" + source + ")");
+}
+
+function RunThreeWayTest(asmfunc, expect) {
+ var asm_source = asmfunc.toString();
+ var nonasm_source = asm_source.replace(new RegExp("use asm"), "");
+ var stdlib = {Math: Math};
+
+ var js_module = eval("(" + nonasm_source + ")")(stdlib);
+ print("Testing " + asmfunc.name + " (js)...");
+ expect(js_module);
+
+ print("Testing " + asmfunc.name + " (asm.js)...");
+ var asm_module = asmfunc(stdlib);
+ expect(asm_module);
+
+ print("Testing " + asmfunc.name + " (wasm)...");
+ var wasm_module = Wasm.instantiateModuleFromAsm(asm_source, stdlib);
+ expect(wasm_module);
+}
+
+const Math_ceil = Math.ceil;
+const Math_floor = Math.floor;
+const Math_sqrt = Math.sqrt;
+const Math_abs = Math.abs;
+const Math_min = Math.min;
+const Math_max = Math.max;
+const Math_acos = Math.acos;
+const Math_asin = Math.asin;
+const Math_atan = Math.atan;
+const Math_cos = Math.cos;
+const Math_sin = Math.sin;
+const Math_tan = Math.tan;
+const Math_exp = Math.exp;
+const Math_log = Math.log;
+const Math_atan2 = Math.atan2;
+
+function f64_add(a, b) {
+ a = +a;
+ b = +b;
+ return +(+a + +b);
+}
+
+function f64_sub(a, b) {
+ a = +a;
+ b = +b;
+ return +(+a - +b);
+}
+
+function f64_mul(a, b) {
+ a = +a;
+ b = +b;
+ return +(+a * +b);
+}
+
+function f64_div(a, b) {
+ a = +a;
+ b = +b;
+ return +(+a / +b);
+}
+
+function f64_eq(a, b) {
+ a = +a;
+ b = +b;
+ if (+a == +b) {
+ return 1;
+ }
+ return 0;
+}
+
+function f64_ne(a, b) {
+ a = +a;
+ b = +b;
+ if (+a != +b) {
+ return 1;
+ }
+ return 0;
+}
+
+function f64_lt(a, b) {
+ a = +a;
+ b = +b;
+ if (+a < +b) {
+ return 1;
+ }
+ return 0;
+}
+
+function f64_lteq(a, b) {
+ a = +a;
+ b = +b;
+ if (+a <= +b) {
+ return 1;
+ }
+ return 0;
+}
+
+function f64_gt(a, b) {
+ a = +a;
+ b = +b;
+ if (+a > +b) {
+ return 1;
+ }
+ return 0;
+}
+
+function f64_gteq(a, b) {
+ a = +a;
+ b = +b;
+ if (+a >= +b) {
+ return 1;
+ }
+ return 0;
+}
+
+function f64_ceil(a) {
+ a = +a;
+ return +(Math_ceil(+a));
+}
+
+function f64_floor(a) {
+ a = +a;
+ return +(Math_floor(+a));
+}
+
+function f64_sqrt(a) {
+ a = +a;
+ return +(Math_sqrt(+a));
+}
+
+function f64_abs(a) {
+ a = +a;
+ return +(Math_abs(+a));
+}
+
+function f64_min(a, b) {
+ a = +a;
+ b = +b;
+ return +(Math_min(+a, +b));
+}
+
+function f64_max(a, b) {
+ a = +a;
+ b = +b;
+ return +(Math_max(+a, +b));
+}
+
+function f64_acos(a) {
+ a = +a;
+ return +Math_acos(+a);
+}
+
+function f64_asin(a) {
+ a = +a;
+ return +Math_asin(+a);
+}
+
+function f64_atan(a) {
+ a = +a;
+ return +Math_atan(+a);
+}
+
+function f64_cos(a) {
+ a = +a;
+ return +Math_cos(+a);
+}
+
+function f64_sin(a) {
+ a = +a;
+ return +Math_sin(+a);
+}
+
+function f64_tan(a) {
+ a = +a;
+ return +Math_tan(+a);
+}
+
+function f64_exp(a, b) {
+ a = +a;
+ b = +b;
+ return +Math_exp(+a, +b);
+}
+
+function f64_log(a, b) {
+ a = +a;
+ b = +b;
+ return +Math_log(+a, +b);
+}
+
+function f64_atan2(a) {
+ a = +a;
+ return +Math_atan2(+a);
+}
+
+
+var inputs = [
+ 0, 1, 2, 3, 4,
+ NaN,
+ Infinity,
+ -Infinity,
+ 10, 20, 30, 31, 32, 33, 100, 2000,
+ 30000, 400000, 5000000,
+ 100000000, 2000000000,
+ 2147483646,
+ 2147483647,
+ 2147483648,
+ 2147483649,
+ 0x273a798e, 0x187937a3, 0xece3af83, 0x5495a16b, 0x0b668ecc, 0x11223344,
+ 0x0000af73, 0x0000116b, 0x00658ecc, 0x002b3b4c,
+ 0x88776655, 0x70000000, 0x07200000, 0x7fffffff, 0x56123761, 0x7fffff00,
+ 0xeeeeeeee, 0xfffffffd, 0xf0000000, 0x007fffff, 0x003fffff, 0x001fffff,
+ -0,
+ -1, -2, -3, -4,
+ -10, -20, -30, -31, -32, -33, -100, -2000,
+ -30000, -400000, -5000000,
+ -100000000, -2000000000,
+ -2147483646,
+ -2147483647,
+ -2147483648,
+ -2147483649,
+ 0.1,
+ 1.1e-2,
+ 1.2e-4,
+ 1.3e-8,
+ 1.4e-11,
+ 1.5e-12,
+ 1.6e-13
+];
+
+var funcs = [
+ f64_add,
+ f64_sub,
+ f64_mul,
+ f64_div,
+ f64_eq,
+ f64_ne,
+ f64_lt,
+ f64_lteq,
+ f64_gt,
+ f64_gteq,
+ f64_ceil,
+ f64_floor,
+// TODO(bradnelson) f64_sqrt,
+ f64_abs,
+// TODO(bradnelson) f64_min is wrong for -0
+// TODO(bradnelson) f64_max is wrong for -0
+// TODO(bradnelson) f64_acos,
+// TODO(bradnelson) f64_asin,
+// TODO(bradnelson) f64_atan,
+// TODO(bradnelson) f64_cos,
+// TODO(bradnelson) f64_sin,
+// TODO(bradnelson) f64_tan,
+// TODO(bradnelson) f64_exp,
+// TODO(bradnelson) f64_log,
+// TODO(bradnelson) f64_atan2,
+];
+
+(function () {
+ for (func of funcs) {
+ RunThreeWayTest(WrapInAsmModule(func), function (module) {
+ if (func.length == 1) {
+ for (a of inputs) {
+ assertEquals(func(a), module.main(a));
+ assertEquals(func(a / 10), module.main(a / 10));
+ assertEquals(func(a / 440.9), module.main(a / 440.9));
+ assertEquals(func(a / -33.1), module.main(a / -33.1));
+ }
+ } else {
+ for (a of inputs) {
+ for (b of inputs) {
+ assertEquals(func(a, b), module.main(a, b));
+ assertEquals(func(a / 10, b), module.main(a / 10, b));
+ assertEquals(func(a, b / 440.9), module.main(a, b / 440.9));
+ assertEquals(func(a / -33.1, b), module.main(a / -33.1, b));
+ }
+ }
+ }
+ });
+ }
+})();
diff --git a/test/mjsunit/wasm/asm-wasm-heap.js b/test/mjsunit/wasm/asm-wasm-heap.js
new file mode 100644
index 0000000..055b1e9
--- /dev/null
+++ b/test/mjsunit/wasm/asm-wasm-heap.js
@@ -0,0 +1,239 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-wasm
+
+const stdlib = {
+ Math: Math,
+ Int8Array: Int8Array,
+ Int16Array: Int16Array,
+ Int32Array: Int32Array,
+ Uint8Array: Uint8Array,
+ Uint16Array: Uint16Array,
+ Uint32Array: Uint32Array,
+ Float32Array: Float32Array,
+ Float64Array: Float64Array,
+};
+
+const buffer = new ArrayBuffer(65536);
+const BASE = 1000000000;
+
+const OOB_INDEXES = [
+ buffer.byteLength,
+ buffer.byteLength + 1,
+ buffer.byteLength + 2,
+ buffer.byteLength + 3,
+ buffer.byteLength + 4,
+ buffer.byteLength + 5,
+ buffer.byteLength + 6,
+ buffer.byteLength + 7,
+ buffer.byteLength + 8,
+ buffer.byteLength + 9,
+ buffer.byteLength + 10,
+ 0x80000000,
+ 0x80000004,
+ 0xF0000000,
+ 0xFFFFFFFF,
+ 0xFFFFFFFE,
+ -1, -2, -3, -4, -5, -6, -7, -8
+];
+
+function resetBuffer() {
+ var view = new Int32Array(buffer);
+ for (var i = 0; i < view.length; i++) {
+ view[i] = BASE | (i << 2);
+ }
+}
+resetBuffer();
+
+
+function checkView(view, load, shift) {
+ for (var i = 0; i < 300; i++) {
+ assertEquals(view[i >> shift], load(i));
+ }
+}
+
+function RunThreeWayTest(asmfunc, expect) {
+ var asm_source = asmfunc.toString();
+ var nonasm_source = asm_source.replace(new RegExp("use asm"), "");
+
+ var js_module = eval("(" + nonasm_source + ")")(stdlib, {}, buffer);
+ print("Testing " + asmfunc.name + " (js)...");
+ expect(js_module);
+
+ print("Testing " + asmfunc.name + " (asm.js)...");
+ var asm_module = asmfunc(stdlib, {}, buffer);
+ expect(asm_module);
+
+ print("Testing " + asmfunc.name + " (wasm)...");
+ var wasm_module = Wasm.instantiateModuleFromAsm(asm_source, null, buffer);
+ expect(wasm_module);
+}
+
+function LoadAt_i32(stdlib, foreign, buffer) {
+ "use asm";
+ var HEAP32 = new stdlib.Int32Array(buffer);
+ function load(a) {
+ a = a | 0;
+ return HEAP32[a >> 2] | 0;
+ }
+ return {load: load};
+}
+
+RunThreeWayTest(LoadAt_i32, function(module) {
+ var load = module.load;
+ assertEquals(BASE, load(0));
+ assertEquals(BASE | 0x30, load(0x30));
+ assertEquals(BASE | 0x704, load(0x704));
+ assertEquals(BASE | 0x704, load(0x705));
+ assertEquals(BASE | 0x704, load(0x706));
+ assertEquals(BASE | 0x704, load(0x707));
+
+ var length = buffer.byteLength;
+ assertEquals(BASE | (length - 4), load(length - 4));
+ assertEquals(BASE | (length - 4), load(length - 4 + 1));
+ assertEquals(BASE | (length - 4), load(length - 4 + 2));
+ assertEquals(BASE | (length - 4), load(length - 4 + 3));
+
+ for (index of OOB_INDEXES) assertEquals(0, load(index));
+ checkView(new Int32Array(buffer), load, 2);
+});
+
+function LoadAt_i16(stdlib, foreign, buffer) {
+ "use asm";
+ var HEAP16 = new stdlib.Int16Array(buffer);
+ function load(a) {
+ a = a | 0;
+ return HEAP16[a >> 1] | 0;
+ }
+ return {load: load};
+}
+
+RunThreeWayTest(LoadAt_i16, function(module) {
+ var load = module.load;
+ var LOWER = (BASE << 16) >> 16;
+ var UPPER = BASE >> 16;
+ assertEquals(LOWER, load(0));
+ assertEquals(UPPER, load(2));
+
+ assertEquals(LOWER | 0x30, load(0x30));
+ assertEquals(UPPER, load(0x32));
+
+ assertEquals(LOWER | 0x504, load(0x504));
+ assertEquals(LOWER | 0x504, load(0x505));
+
+ assertEquals(UPPER, load(0x706));
+ assertEquals(UPPER, load(0x707));
+
+ var length = buffer.byteLength;
+ assertEquals(LOWER | (length - 4), load(length - 4));
+ assertEquals(LOWER | (length - 4), load(length - 4 + 1));
+ assertEquals(UPPER, load(length - 4 + 2));
+ assertEquals(UPPER, load(length - 4 + 3));
+
+ for (index of OOB_INDEXES) assertEquals(0, load(index));
+ checkView(new Int16Array(buffer), load, 1);
+});
+
+function LoadAt_u16(stdlib, foreign, buffer) {
+ "use asm";
+ var HEAP16 = new stdlib.Uint16Array(buffer);
+ function load(a) {
+ a = a | 0;
+ return HEAP16[a >> 1] | 0;
+ }
+ return {load: load};
+}
+
+RunThreeWayTest(LoadAt_u16, function(module) {
+ var load = module.load;
+ for (index of OOB_INDEXES) assertEquals(0, load(index));
+ checkView(new Uint16Array(buffer), load, 1);
+});
+
+function LoadAt_i8(stdlib, foreign, buffer) {
+ "use asm";
+ var HEAP8 = new stdlib.Int8Array(buffer);
+ function load(a) {
+ a = a | 0;
+ return HEAP8[a >> 0] | 0;
+ }
+ return {load: load};
+}
+
+RunThreeWayTest(LoadAt_i8, function(module) {
+ var load = module.load;
+ for (index of OOB_INDEXES) assertEquals(0, load(index));
+ checkView(new Int8Array(buffer), load, 0);
+});
+
+function LoadAt_u8(stdlib, foreign, buffer) {
+ "use asm";
+ var HEAP8 = new stdlib.Uint8Array(buffer);
+ function load(a) {
+ a = a | 0;
+ return HEAP8[a >> 0] | 0;
+ }
+ return {load: load};
+}
+
+RunThreeWayTest(LoadAt_u8, function(module) {
+ var load = module.load;
+ for (index of OOB_INDEXES) assertEquals(0, load(index));
+ checkView(new Uint8Array(buffer), load, 0);
+});
+
+
+function LoadAt_u32(stdlib, foreign, buffer) {
+ "use asm";
+ var HEAP32 = new stdlib.Uint32Array(buffer);
+ function load(a) {
+ a = a | 0;
+ return +(HEAP32[a >> 2] >>> 0);
+ }
+ return {load: load};
+}
+
+RunThreeWayTest(LoadAt_u32, function(module) {
+ var load = module.load;
+ for (index of OOB_INDEXES) assertEquals(0, load(index));
+ checkView(new Uint32Array(buffer), load, 2);
+});
+
+function LoadAt_f32(stdlib, foreign, buffer) {
+ "use asm";
+ var HEAP32 = new stdlib.Float32Array(buffer);
+ var fround = stdlib.Math.fround;
+ function load(a) {
+ a = a | 0;
+ return fround(HEAP32[a >> 2]);
+ }
+ return {load: load};
+}
+
+RunThreeWayTest(LoadAt_f32, function(module) {
+ var load = module.load;
+ for (index of OOB_INDEXES) assertEquals(NaN, load(index));
+ checkView(new Float32Array(buffer), load, 2);
+});
+
+function LoadAt_f64(stdlib, foreign, buffer) {
+ "use asm";
+ var HEAP64 = new stdlib.Float64Array(buffer);
+ function load(a) {
+ a = a | 0;
+ return +HEAP64[a >> 3];
+ }
+ return {load: load};
+}
+
+RunThreeWayTest(LoadAt_f64, function(module) {
+ var load = module.load;
+ for (index of OOB_INDEXES) assertEquals(NaN, load(index));
+ checkView(new Float64Array(buffer), load, 3);
+});
+
+// TODO(titzer): constant heap indexes
+// TODO(titzer): heap accesses with offsets and arithmetic
+// TODO(titzer): [i >> K] where K is greater than log(size)
diff --git a/test/mjsunit/wasm/asm-wasm-i32.js b/test/mjsunit/wasm/asm-wasm-i32.js
new file mode 100644
index 0000000..6224e8f
--- /dev/null
+++ b/test/mjsunit/wasm/asm-wasm-i32.js
@@ -0,0 +1,252 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-wasm
+
+function WrapInAsmModule(func) {
+ function MODULE_NAME(stdlib) {
+ "use asm";
+ var imul = stdlib.Math.imul;
+ var Math_max = stdlib.Math.max;
+ var Math_min = stdlib.Math.min;
+ var Math_abs = stdlib.Math.abs;
+
+ FUNC_BODY
+ return {main: FUNC_NAME};
+ }
+
+ var source = MODULE_NAME.toString()
+ .replace(/MODULE_NAME/g, func.name + "_module")
+ .replace(/FUNC_BODY/g, func.toString())
+ .replace(/FUNC_NAME/g, func.name);
+ return eval("(" + source + ")");
+}
+
+function RunThreeWayTest(asmfunc, expect) {
+ var asm_source = asmfunc.toString();
+ var nonasm_source = asm_source.replace(new RegExp("use asm"), "");
+ var stdlib = {Math: Math};
+
+ var js_module = eval("(" + nonasm_source + ")")(stdlib);
+ print("Testing " + asmfunc.name + " (js)...");
+ expect(js_module);
+
+ print("Testing " + asmfunc.name + " (asm.js)...");
+ var asm_module = asmfunc(stdlib);
+ expect(asm_module);
+
+ print("Testing " + asmfunc.name + " (wasm)...");
+ var wasm_module = Wasm.instantiateModuleFromAsm(asm_source, stdlib);
+ expect(wasm_module);
+}
+
+const imul = Math.imul;
+const Math_max = Math.max;
+const Math_min = Math.min;
+const Math_abs = Math.abs;
+
+function i32_add(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return (a + b) | 0;
+}
+
+function i32_sub(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return (a - b) | 0;
+}
+
+function i32_mul(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return imul(a, b) | 0;
+}
+
+function i32_div(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return (a / b) | 0;
+}
+
+function i32_mod(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return (a % b) | 0;
+}
+
+function i32_and(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return (a & b) | 0;
+}
+
+function i32_or(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return (a | b) | 0;
+}
+
+function i32_xor(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return (a ^ b) | 0;
+}
+
+function i32_shl(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return (a << b) | 0;
+}
+
+function i32_shr(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return (a >> b) | 0;
+}
+
+function i32_sar(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return (a >>> b) | 0;
+}
+
+function i32_eq(a, b) {
+ a = a | 0;
+ b = b | 0;
+ if ((a | 0) == (b | 0)) {
+ return 1;
+ }
+ return 0;
+}
+
+function i32_ne(a, b) {
+ a = a | 0;
+ b = b | 0;
+ if ((a | 0) < (b | 0)) {
+ return 1;
+ }
+ return 0;
+}
+
+function i32_lt(a, b) {
+ a = a | 0;
+ b = b | 0;
+ if ((a | 0) < (b | 0)) {
+ return 1;
+ }
+ return 0;
+}
+
+function i32_lteq(a, b) {
+ a = a | 0;
+ b = b | 0;
+ if ((a | 0) <= (b | 0)) {
+ return 1;
+ }
+ return 0;
+}
+
+function i32_gt(a, b) {
+ a = a | 0;
+ b = b | 0;
+ if ((a | 0) > (b | 0)) {
+ return 1;
+ }
+ return 0;
+}
+
+function i32_gteq(a, b) {
+ a = a | 0;
+ b = b | 0;
+ if ((a | 0) >= (b | 0)) {
+ return 1;
+ }
+ return 0;
+}
+
+function i32_min(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return Math_min(a | 0, b | 0) | 0;
+}
+
+function i32_max(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return Math_max(a | 0, b | 0) | 0;
+}
+
+function i32_abs(a) {
+ a = a | 0;
+ return Math_abs(a | 0) | 0;
+}
+
+var inputs = [
+ 0, 1, 2, 3, 4,
+ 10, 20, 30, 31, 32, 33, 100, 2000,
+ 30000, 400000, 5000000,
+ 100000000, 2000000000,
+ 2147483646,
+ 2147483647,
+ 2147483648,
+ 2147483649,
+ 0x273a798e, 0x187937a3, 0xece3af83, 0x5495a16b, 0x0b668ecc, 0x11223344,
+ 0x0000009e, 0x00000043, 0x0000af73, 0x0000116b, 0x00658ecc, 0x002b3b4c,
+ 0x88776655, 0x70000000, 0x07200000, 0x7fffffff, 0x56123761, 0x7fffff00,
+ 0x761c4761, 0x80000000, 0x88888888, 0xa0000000, 0xdddddddd, 0xe0000000,
+ 0xeeeeeeee, 0xfffffffd, 0xf0000000, 0x007fffff, 0x003fffff, 0x001fffff,
+ 0x000fffff, 0x0007ffff, 0x0003ffff, 0x0001ffff, 0x0000ffff, 0x00007fff,
+ 0x00003fff, 0x00001fff, 0x00000fff, 0x000007ff, 0x000003ff, 0x000001ff,
+ -1, -2, -3, -4,
+ -10, -20, -30, -31, -32, -33, -100, -2000,
+ -30000, -400000, -5000000,
+ -100000000, -2000000000,
+ -2147483646,
+ -2147483647,
+ -2147483648,
+ -2147483649,
+];
+
+var funcs = [
+ i32_add,
+ i32_sub,
+ i32_mul,
+ i32_div,
+ i32_mod,
+ i32_and,
+ i32_or,
+ i32_xor,
+ i32_shl,
+ i32_shr,
+ i32_sar,
+ i32_eq,
+ i32_ne,
+ i32_lt,
+ i32_lteq,
+ i32_gt,
+ i32_gteq,
+ i32_min,
+ i32_max,
+ i32_abs
+];
+
+(function () {
+ for (func of funcs) {
+ RunThreeWayTest(WrapInAsmModule(func), function (module) {
+ if (func.length == 1) {
+ for (a of inputs) {
+ assertEquals(func(a), module.main(a));
+ }
+ } else {
+ for (a of inputs) {
+ for (b of inputs) {
+ assertEquals(func(a, b), module.main(a, b));
+ }
+ }
+ }
+ });
+ }
+
+})();
diff --git a/test/mjsunit/wasm/asm-wasm-literals.js b/test/mjsunit/wasm/asm-wasm-literals.js
new file mode 100644
index 0000000..e4e312f
--- /dev/null
+++ b/test/mjsunit/wasm/asm-wasm-literals.js
@@ -0,0 +1,261 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-wasm
+
+function RunThreeWayTest(asmfunc, expect) {
+ var asm_source = asmfunc.toString();
+ var nonasm_source = asm_source.replace(new RegExp("use asm"), "");
+ var stdlib = {Math: Math};
+
+ var js_module = eval("(" + nonasm_source + ")")(stdlib);
+ print("Testing " + asmfunc.name + " (js)...");
+ expect(js_module);
+
+ print("Testing " + asmfunc.name + " (asm.js)...");
+ var asm_module = asmfunc(stdlib);
+ expect(asm_module);
+
+ print("Testing " + asmfunc.name + " (wasm)...");
+ var wasm_module = Wasm.instantiateModuleFromAsm(asm_source, stdlib);
+ expect(wasm_module);
+}
+
+function PositiveIntLiterals() {
+ "use asm";
+ function f0() { return 0; }
+ function f1() { return 1; }
+ function f4() { return 4; }
+ function f64() { return 64; }
+ function f127() { return 127; }
+ function f128() { return 128; }
+ function f256() { return 256; }
+ function f1000() { return 1000; }
+ function f2000000() { return 2000000; }
+ function fmax() { return 2147483647; }
+ return {f0: f0, f1: f1, f4: f4, f64: f64, f127: f127, f128: f128,
+ f256: f256, f1000: f1000, f2000000, fmax: fmax};
+}
+
+RunThreeWayTest(PositiveIntLiterals, function(module) {
+ assertEquals(0, module.f0());
+ assertEquals(1, module.f1());
+ assertEquals(4, module.f4());
+ assertEquals(64, module.f64());
+ assertEquals(128, module.f128());
+ assertEquals(256, module.f256());
+ assertEquals(1000, module.f1000());
+ assertEquals(2000000, module.f2000000());
+ assertEquals(2147483647, module.fmax());
+});
+
+function NegativeIntLiterals() {
+ "use asm";
+ function f1() { return -1; }
+ function f4() { return -4; }
+ function f64() { return -64; }
+ function f127() { return -127; }
+ function f128() { return -128; }
+ function f256() { return -256; }
+ function f1000() { return -1000; }
+ function f2000000() { return -2000000; }
+ function fmin() { return -2147483648; }
+ return {f1: f1, f4: f4, f64: f64, f127: f127, f128: f128,
+ f256: f256, f1000: f1000, f2000000, fmin: fmin};
+}
+
+RunThreeWayTest(NegativeIntLiterals, function (module) {
+ assertEquals(-1, module.f1());
+ assertEquals(-4, module.f4());
+ assertEquals(-64, module.f64());
+ assertEquals(-127, module.f127());
+ assertEquals(-128, module.f128());
+ assertEquals(-256, module.f256());
+ assertEquals(-1000, module.f1000());
+ assertEquals(-2000000, module.f2000000());
+ assertEquals(-2147483648, module.fmin());
+});
+
+function PositiveUnsignedLiterals() {
+ "use asm";
+ function f0() { return 0 >>> 0; }
+ function f1() { return 1 >>> 0; }
+ function f4() { return 4 >>> 0; }
+ function f64() { return 64 >>> 0; }
+ function f127() { return 127 >>> 0; }
+ function f128() { return 128 >>> 0; }
+ function f256() { return 256 >>> 0; }
+ function f1000() { return 1000 >>> 0; }
+ function f2000000() { return 2000000 >>> 0; }
+ function fmax() { return 2147483647 >>> 0; }
+ return {f0: f0, f1: f1, f4: f4, f64: f64, f127: f127, f128: f128,
+ f256: f256, f1000: f1000, f2000000, fmax: fmax};
+}
+
+RunThreeWayTest(PositiveUnsignedLiterals, function (module) {
+ assertEquals(0, module.f0());
+ assertEquals(1, module.f1());
+ assertEquals(4, module.f4());
+ assertEquals(64, module.f64());
+ assertEquals(128, module.f128());
+ assertEquals(256, module.f256());
+ assertEquals(1000, module.f1000());
+ assertEquals(2000000, module.f2000000());
+ assertEquals(2147483647, module.fmax());
+});
+
+function LargeUnsignedLiterals() {
+ "use asm";
+ function a() {
+ var x = 2147483648;
+ return +(x >>> 0);
+ }
+ function b() {
+ var x = 2147483649;
+ return +(x >>> 0);
+ }
+ function c() {
+ var x = 0x80000000;
+ return +(x >>> 0);
+ }
+ function d() {
+ var x = 0x80000001;
+ return +(x >>> 0);
+ }
+ function e() {
+ var x = 0xffffffff;
+ return +(x >>> 0);
+ }
+ return {a: a, b: b, c: c, d: d, e: e};
+}
+
+RunThreeWayTest(LargeUnsignedLiterals, function(module) {
+ assertEquals(2147483648, module.a());
+ assertEquals(2147483649, module.b());
+ assertEquals(0x80000000, module.c());
+ assertEquals(0x80000001, module.d());
+ assertEquals(0xffffffff, module.e());
+});
+
+function ManyI32() {
+ "use asm";
+ function main() {
+ var a = 1 + -2 + 3 + -4 | 0;
+ var b = 11 + -22 + 33 + -44 | 0;
+ var c = 111 + -222 + 333 + -444 | 0;
+ var d = 1111 + -2222 + 3333 + -4444 | 0;
+ var e = 11111 + -22222 + 33333 + -44444 | 0;
+ var f = 155555 + -266666 + 377777 + -488888 | 0;
+ var g = 1155555 + -2266666 + 3377777 + -4488888 | 0;
+ var h = 11155555 + -22266666 + 33377777 + -44488888 | 0;
+ var i = 111155555 + -222266666 + 333377777 + -444488888 | 0;
+ var j = (
+ 0x1 + 0x2 + 0x4 + 0x8 +
+ 0x10 + 0x20 + 0x40 + 0x80 +
+ 0x10F + 0x200 + 0x400 + 0x800 +
+ 0x10E0 + 0x20F0 + 0x4000 + 0x8000 +
+ 0x10D00 + 0x20E00 + 0x400F0 + 0x80002 +
+ 0x10C000 + 0x20D000 + 0x400E00 + 0x800030 +
+ 0x10B0000 + 0x20C0000 + 0x400D000 + 0x8000400 +
+ 0x10A00000 + 0x20B00000 + 0x400C0000 + 0x80005000
+ ) | 0;
+ return (a + b + c + d + e + f + g + h + i + j) | 0;
+ }
+ return {main: main};
+}
+
+RunThreeWayTest(ManyI32, function(module) {
+ assertEquals(-222411306, module.main());
+});
+
+
+function ManyF64a() {
+ "use asm";
+ function main() {
+ var a = +( 0.1 + -0.2 + 0.3 + -0.4);
+ var b = +( 1.1 + -2.2 + 0.33 + -4.4);
+ var c = +( 11.1 + -22.2 + 3.33 + -4.44);
+ var d = +( 111.1 + -222.2 + 33.33 + -4.444);
+ var e = +( 1111.1 + -2222.2 + 333.33 + -4.4444);
+ var f = +( 15555.5 + -26666.6 + 3777.77 + -4.88888);
+ var g = +( 115555.5 + -226666.6 + 33777.77 + -4.488888);
+ var h = +( 1115555.5 + -2226666.6 + 333777.77 + -4.4488888);
+ var i = +(11115555.5 + -22226666.6 + 3333777.77 + -4.44488888);
+ return +(a + b + c + d + e + f + g + h + i);
+ }
+ return {main: main};
+}
+
+RunThreeWayTest(ManyF64a, function(module) {
+ assertEquals(-8640233.599945681, module.main());
+});
+
+function ManyF64b() {
+ "use asm";
+ function k1() { return +(1.0e-25 + 3.0e-25 + 5.0e-25 + 6.0e-25 + 9.0e-25); }
+ function k2() { return +(1.0e-20 + 3.0e-20 + 5.0e-20 + 6.0e-20 + 9.0e-20); }
+ function k3() { return +(1.0e-15 + 3.0e-15 + 5.0e-15 + 6.0e-15 + 9.0e-15); }
+ function k4() { return +(1.0e-10 + 3.0e-10 + 5.0e-10 + 6.0e-10 + 9.0e-10); }
+ function k5() { return +(1.0e-5 + 3.0e-5 + 5.0e-5 + 6.0e-5 + 9.0e-5); }
+ function k6() { return +(1.1e+0 + 3.1e+0 + 5.1e+0 + 6.1e+0 + 9.1e+0); }
+
+ return {k1: k1, k2: k2, k3: k3, k4: k4, k5: k5, k6: k6};
+}
+
+RunThreeWayTest(ManyF64b, function(module) {
+ assertEquals(2.4e-24, module.k1());
+ assertEquals(2.4e-19, module.k2());
+ assertEquals(2.4e-14, module.k3());
+ assertEquals(2.4e-9, module.k4());
+ assertEquals(0.00024000000000000003, module.k5());
+ assertEquals(24.5, module.k6());
+});
+
+
+function ManyF64c() {
+ "use asm";
+ function k1() { return +(1.0e+25 + 3.0e+25 + 5.0e+25 + 6.0e+25 + 9.0e+25); }
+ function k2() { return +(1.0e+20 + 3.0e+20 + 5.0e+20 + 6.0e+20 + 9.0e+20); }
+ function k3() { return +(1.0e+15 + 3.0e+15 + 5.0e+15 + 6.0e+15 + 9.0e+15); }
+ function k4() { return +(1.0e+10 + 3.0e+10 + 5.0e+10 + 6.0e+10 + 9.0e+10); }
+ function k5() { return +(1.0e+5 + 3.0e+5 + 5.0e+5 + 6.0e+5 + 9.0e+5); }
+ function k6() { return +(1.4e+0 + 3.4e+0 + 5.4e+0 + 6.4e+0 + 9.4e+0); }
+
+ return {k1: k1, k2: k2, k3: k3, k4: k4, k5: k5, k6: k6};
+}
+
+RunThreeWayTest(ManyF64c, function(module) {
+ assertEquals(2.4000000000000004e+26, module.k1());
+ assertEquals(2.4e+21, module.k2());
+ assertEquals(2.4e+16, module.k3());
+ assertEquals(2.4e+11, module.k4());
+ assertEquals(2.4e+6, module.k5());
+ assertEquals(26, module.k6());
+});
+
+function ManyF32a(stdlib) {
+ "use asm";
+ var F = stdlib.Math.fround;
+
+ function k1() { return F(F(1.0e-25) + F(5.0e-25) + F(6.0e-25) + F(9.0e-25)); }
+ function k2() { return F(F(1.0e-20) + F(5.0e-20) + F(6.0e-20) + F(9.0e-20)); }
+ function k3() { return F(F(1.0e-15) + F(5.0e-15) + F(6.0e-15) + F(9.0e-15)); }
+ function k4() { return F(F(1.0e-10) + F(5.0e-10) + F(6.0e-10) + F(9.0e-10)); }
+ function k5() { return F(F(1.0e-5) + F(5.0e-5) + F(6.0e-5) + F(9.0e-5)); }
+ function k6() { return F(F(1.1e+0) + F(5.1e+0) + F(6.1e+0) + F(9.1e+0)); }
+
+ return {k1: k1, k2: k2, k3: k3, k4: k4, k5: k5, k6: k6};
+}
+
+if (false) {
+ // TODO(bradnelson): fails validation of F32 literals somehow.
+RunThreeWayTest(ManyF32a, function(module) {
+ assertEquals(2.0999999917333043e-24, module.k1());
+ assertEquals(2.099999868734112e-19, module.k2());
+ assertEquals(2.099999997029825e-14, module.k3());
+ assertEquals(2.099999951710174e-9, module.k4());
+ assertEquals(0.0002099999983329326, module.k5());
+ assertEquals(21.399999618530273, module.k6());
+});
+}
diff --git a/test/mjsunit/wasm/asm-wasm-stdlib.js b/test/mjsunit/wasm/asm-wasm-stdlib.js
new file mode 100644
index 0000000..fe39a30
--- /dev/null
+++ b/test/mjsunit/wasm/asm-wasm-stdlib.js
@@ -0,0 +1,358 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-wasm
+
+(function TestStdlibConstants() {
+ function Module(stdlib) {
+ "use asm";
+
+ var StdlibInfinity = stdlib.Infinity;
+ var StdlibNaN = stdlib.NaN;
+ var StdlibMathE = stdlib.Math.E;
+ var StdlibMathLN10 = stdlib.Math.LN10;
+ var StdlibMathLN2 = stdlib.Math.LN2;
+ var StdlibMathLOG2E = stdlib.Math.LOG2E;
+ var StdlibMathLOG10E = stdlib.Math.LOG10E;
+ var StdlibMathPI = stdlib.Math.PI;
+ var StdlibMathSQRT1_2 = stdlib.Math.SQRT1_2;
+ var StdlibMathSQRT2 = stdlib.Math.SQRT2;
+
+ function caller() {
+ if (StdlibInfinity != 1.0 / 0.0) return 0;
+ if (StdlibMathE != 2.718281828459045) return 0;
+ if (StdlibMathLN10 != 2.302585092994046) return 0;
+ if (StdlibMathLN2 != 0.6931471805599453) return 0;
+ if (StdlibMathLOG2E != 1.4426950408889634) return 0;
+ if (StdlibMathLOG10E != 0.4342944819032518) return 0;
+ if (StdlibMathPI != 3.141592653589793) return 0;
+ if (StdlibMathSQRT1_2 != 0.7071067811865476) return 0;
+ if (StdlibMathSQRT2 != 1.4142135623730951) return 0;
+ return 1;
+ }
+
+ function nanCheck() {
+ return +StdlibNaN;
+ }
+
+ return {caller:caller, nanCheck:nanCheck};
+ }
+
+ var m =Wasm.instantiateModuleFromAsm(Module.toString());
+ assertEquals(1, m.caller());
+ assertTrue(isNaN(m.nanCheck()));
+})();
+
+
+(function TestStdlibFunctionsInside() {
+ function Module(stdlib) {
+ "use asm";
+
+ var StdlibMathCeil = stdlib.Math.ceil;
+ var StdlibMathFloor = stdlib.Math.floor;
+ var StdlibMathSqrt = stdlib.Math.sqrt;
+ var StdlibMathAbs = stdlib.Math.abs;
+ var StdlibMathMin = stdlib.Math.min;
+ var StdlibMathMax = stdlib.Math.max;
+
+ var StdlibMathAcos = stdlib.Math.acos;
+ var StdlibMathAsin = stdlib.Math.asin;
+ var StdlibMathAtan = stdlib.Math.atan;
+ var StdlibMathCos = stdlib.Math.cos;
+ var StdlibMathSin = stdlib.Math.sin;
+ var StdlibMathTan = stdlib.Math.tan;
+ var StdlibMathExp = stdlib.Math.exp;
+ var StdlibMathLog = stdlib.Math.log;
+
+ var StdlibMathAtan2 = stdlib.Math.atan2;
+ var StdlibMathPow = stdlib.Math.pow;
+ var StdlibMathImul = stdlib.Math.imul;
+
+ var fround = stdlib.Math.fround;
+
+ function deltaEqual(x, y) {
+ x = +x;
+ y = +y;
+ var t = 0.0;
+ t = x - y;
+ if (t < 0.0) {
+ t = t * -1.0;
+ }
+ return (t < 1.0e-13) | 0;
+ }
+
+ function caller() {
+ if (!deltaEqual(StdlibMathSqrt(123.0), 11.090536506409418)) return 0;
+ if (StdlibMathSqrt(fround(256.0)) != fround(16.0)) return 0;
+ if (StdlibMathCeil(123.7) != 124.0) return 0;
+ if (StdlibMathCeil(fround(123.7)) != fround(124.0)) return 0;
+ if (StdlibMathFloor(123.7) != 123.0) return 0;
+ if (StdlibMathFloor(fround(123.7)) != fround(123.0)) return 0;
+ if (StdlibMathAbs(-123.0) != 123.0) return 0;
+ if (StdlibMathAbs(fround(-123.0)) != fround(123.0)) return 0;
+ if (StdlibMathMin(123.4, 1236.4) != 123.4) return 0;
+ if (StdlibMathMin(fround(123.4),
+ fround(1236.4)) != fround(123.4)) return 0;
+ if (StdlibMathMax(123.4, 1236.4) != 1236.4) return 0;
+ if (StdlibMathMax(fround(123.4), fround(1236.4))
+ != fround(1236.4)) return 0;
+
+ if (!deltaEqual(StdlibMathAcos(0.1), 1.4706289056333368)) return 0;
+ if (!deltaEqual(StdlibMathAsin(0.2), 0.2013579207903308)) return 0;
+ if (!deltaEqual(StdlibMathAtan(0.2), 0.19739555984988078)) return 0;
+ if (!deltaEqual(StdlibMathCos(0.2), 0.9800665778412416)) return 0;
+ if (!deltaEqual(StdlibMathSin(0.2), 0.19866933079506122)) return 0;
+ if (!deltaEqual(StdlibMathTan(0.2), 0.20271003550867250)) return 0;
+ if (!deltaEqual(StdlibMathExp(0.2), 1.2214027581601699)) return 0;
+ if (!deltaEqual(StdlibMathLog(0.2), -1.6094379124341003)) return 0;
+
+ if (StdlibMathImul(6, 7) != 42) return 0;
+ if (!deltaEqual(StdlibMathAtan2(6.0, 7.0), 0.7086262721276703)) return 0;
+ if (StdlibMathPow(6.0, 7.0) != 279936.0) return 0;
+
+ return 1;
+ }
+
+ return {caller:caller};
+ }
+
+ var m = Wasm.instantiateModuleFromAsm(Module.toString());
+ assertEquals(1, m.caller());
+})();
+
+
+(function TestStdlibFunctionOutside() {
+ function looseEqual(x, y, delta) {
+ if (delta === undefined) {
+ delta = 1.0e-10;
+ }
+ if (isNaN(x) && isNaN(y)) {
+ return true;
+ }
+ if (!isFinite(x) && !isFinite(y)) {
+ return true;
+ }
+ x = +x;
+ y = +y;
+ var t = 0.0;
+ t = x - y;
+ if (t < 0.0) {
+ t = t * -1.0;
+ }
+ return (t < delta) | 0;
+ }
+
+ function plainEqual(x, y) {
+ if (isNaN(x) && isNaN(y)) {
+ return true;
+ }
+ return x === y;
+ }
+
+ function Module(stdlib) {
+ "use asm";
+ var ceil = stdlib.Math.ceil;
+ var floor = stdlib.Math.floor;
+ var sqrt = stdlib.Math.sqrt;
+ var abs = stdlib.Math.abs;
+ var fround = stdlib.Math.fround;
+ var fround2 = stdlib.Math.fround;
+
+ var acos = stdlib.Math.acos;
+ var asin = stdlib.Math.asin;
+ var atan = stdlib.Math.atan;
+ var cos = stdlib.Math.cos;
+ var sin = stdlib.Math.sin;
+ var tan = stdlib.Math.tan;
+ var exp = stdlib.Math.exp;
+ var log = stdlib.Math.log;
+
+ var atan2 = stdlib.Math.atan2;
+ var pow = stdlib.Math.pow;
+ var imul = stdlib.Math.imul;
+ var min = stdlib.Math.min;
+ var max = stdlib.Math.max;
+
+ function ceil_f64(x) { x = +x; return +ceil(x); }
+ function ceil_f32(x) { x = fround(x); return fround(ceil(x)); }
+
+ function floor_f64(x) { x = +x; return +floor(x); }
+ function floor_f32(x) { x = fround(x); return fround(floor(x)); }
+
+ function sqrt_f64(x) { x = +x; return +sqrt(x); }
+ function sqrt_f32(x) { x = fround(x); return fround(sqrt(x)); }
+
+ function abs_f64(x) { x = +x; return +abs(x); }
+ function abs_f32(x) { x = fround(x); return fround(abs(x)); }
+ function abs_i32(x) { x = x | 0; return abs(x|0) | 0; }
+
+ function acos_f64(x) { x = +x; return +acos(x); }
+ function asin_f64(x) { x = +x; return +asin(x); }
+ function atan_f64(x) { x = +x; return +atan(x); }
+ function cos_f64(x) { x = +x; return +cos(x); }
+ function sin_f64(x) { x = +x; return +sin(x); }
+ function tan_f64(x) { x = +x; return +tan(x); }
+ function exp_f64(x) { x = +x; return +exp(x); }
+ function log_f64(x) { x = +x; return +log(x); }
+
+ function atan2_f64(x, y) { x = +x; y = +y; return +atan2(x, y); }
+ function pow_f64(x, y) { x = +x; y = +y; return +atan2(x, y); }
+
+ function imul_i32(x, y) { x = x | 0; y = y | 0; return imul(x, y) | 0; }
+ function imul_u32(x, y) {
+ x = x | 0; y = y | 0; return imul(x>>>0, y>>>0) | 0; }
+
+ // type -> f32
+ function fround_i32(x) { x = x | 0; return fround(x|0); }
+ function fround_u32(x) { x = x | 0; return fround(x>>>0); }
+ function fround_f32(x) { x = fround(x); return fround(x); }
+ function fround_f64(x) { x = +x; return fround(x); }
+
+ // type -> f32 -> type
+ function fround2_i32(x) { x = x | 0; return ~~fround2(x|0) | 0; }
+ function fround2_u32(x) { x = x | 0; return ~~fround2(x>>>0) | 0; }
+ function fround2_f32(x) { x = fround2(x); return fround2(x); }
+ function fround2_f64(x) { x = +x; return +fround2(x); }
+
+ function min_i32(x, y) { x = x | 0; y = y | 0; return min(x|0, y|0) | 0; }
+ function min_f32(x, y) {
+ x = fround(x); y = fround(y); return fround(min(x, y)); }
+ function min_f64(x, y) { x = +x; y = +y; return +min(x, y); }
+
+ function max_i32(x, y) { x = x | 0; y = y | 0; return max(x|0, y|0) | 0; }
+ function max_f32(x, y) {
+ x = fround(x); y = fround(y); return fround(max(x, y)); }
+ function max_f64(x, y) { x = +x; y = +y; return +max(x, y); }
+
+ return {
+ ceil_f64: ceil_f64,
+ ceil_f32: ceil_f32,
+ floor_f64: floor_f64,
+ floor_f32: floor_f32,
+ sqrt_f64: sqrt_f64,
+ sqrt_f32: sqrt_f32,
+ abs_f64: abs_f64,
+ abs_f32: abs_f32,
+ abs_i32: abs_i32,
+ acos_f64: acos_f64,
+ asin_f64: asin_f64,
+ atan_f64: atan_f64,
+ cos_f64: cos_f64,
+ sin_f64: sin_f64,
+ tan_f64: tan_f64,
+ exp_f64: exp_f64,
+ log_f64: log_f64,
+ imul_i32: imul_i32,
+ imul_u32: imul_u32,
+ fround_i32: fround_i32,
+ fround_u32: fround_u32,
+ fround_f32: fround_f32,
+ fround_f64: fround_f64,
+ fround2_i32: fround2_i32,
+ fround2_u32: fround2_u32,
+ fround2_f32: fround2_f32,
+ fround2_f64: fround2_f64,
+ min_i32: min_i32,
+ min_f32: min_f32,
+ min_f64: min_f64,
+ max_i32: max_i32,
+ max_f32: max_f32,
+ max_f64: max_f64,
+ };
+ }
+ var m = Wasm.instantiateModuleFromAsm(Module.toString());
+ var values = {
+ i32: [
+ 0, 1, -1, 123, 456, -123, -456,
+ 0x40000000, 0x7FFFFFFF, -0x80000000,
+ ],
+ u32: [
+ 0, 1, 123, 456,
+ 0x40000000, 0x7FFFFFFF, 0xFFFFFFFF, 0x80000000,
+ ],
+ f32: [
+ 0, -0, 1, -1, 0.25, 0.125, 0.9, -0.9, 1.414,
+ 0x7F, -0x80, -0x8000, -0x80000000,
+ 0x7FFF, 0x7FFFFFFF, Infinity, -Infinity, NaN,
+ ],
+ f64: [
+ 0, -0, 1, -1, 0.25, 0.125, 0.9, -0.9, 1.414,
+ 0x7F, -0x80, -0x8000, -0x80000000,
+ 0x7FFF, 0x7FFFFFFF, Infinity, -Infinity, NaN,
+ ],
+ };
+ var converts = {
+ i32: function(x) { return x | 0; },
+ u32: function(x) { return x >>> 0; },
+ f32: function(x) { return Math.fround(x); },
+ f64: function(x) { return x; },
+ };
+ var two_args = {atan2: true, pow: true, imul: true,
+ min: true, max: true};
+ var funcs = {
+ ceil: ['f32', 'f64'],
+ floor: ['f32', 'f64'],
+ sqrt: ['f32', 'f64'],
+ abs: ['i32', 'f32', 'f64'],
+ acos: ['f64'],
+ asin: ['f64'],
+ atan: ['f64'],
+ cos: ['f64'],
+ sin: ['f64'],
+ tan: ['f64'],
+ exp: ['f64'],
+ log: ['f64'],
+ imul: ['i32', 'u32'],
+ fround: ['i32', 'u32', 'f32', 'f64'],
+ min: ['i32', 'f32', 'f64'],
+ max: ['i32', 'f32', 'f64'],
+ };
+ var per_func_equals = {
+ // JS uses fdlib for these, so they may not match.
+ // ECMAscript does not required them to have a particular precision.
+ exp_f64: function(x, y) { return looseEqual(x, y, 1e55); },
+ sqrt_f32: function(x, y) { return looseEqual(x, y, 1e-5); },
+ cos_f64: looseEqual,
+ sin_f64: looseEqual,
+ tan_f64: looseEqual,
+ // TODO(bradnelson):
+ // Figure out why some builds (avx2, rel_ng) return a uint.
+ imul_u32: function(x, y) { return (x | 0) === (y | 0); },
+ };
+ for (var func in funcs) {
+ var types = funcs[func];
+ for (var i = 0; i < types.length; i++) {
+ var type = types[i];
+ var interesting = values[type];
+ for (var j = 0; j < interesting.length; j++) {
+ for (var k = 0; k < interesting.length; k++) {
+ var val0 = interesting[j];
+ var val1 = interesting[k];
+ var name = func + '_' + type;
+ if (func === 'fround') {
+ // fround returns f32 regardless of input.
+ var expected = Math[func](val0);
+ var actual = m[name](val0);
+ } else if (two_args[func]) {
+ var expected = converts[type](Math[func](val0, val1));
+ var actual = m[name](val0, val1);
+ } else {
+ var expected = converts[type](Math[func](val0, val1));
+ var actual = m[name](val0, val1);
+ }
+ var compare = per_func_equals[name];
+ if (compare === undefined) {
+ compare = plainEqual;
+ }
+ assertTrue(typeof(compare) === 'function');
+ if (!compare(expected, actual)) {
+ print(expected + ' !== ' + actual + ' for ' + name +
+ ' with input ' + val0 + ' ' + val1);
+ assertTrue(false);
+ }
+ }
+ }
+ }
+ }
+})();
diff --git a/test/mjsunit/wasm/asm-wasm-u32.js b/test/mjsunit/wasm/asm-wasm-u32.js
new file mode 100644
index 0000000..514ddef
--- /dev/null
+++ b/test/mjsunit/wasm/asm-wasm-u32.js
@@ -0,0 +1,225 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-wasm
+
+function WrapInAsmModule(func) {
+ function MODULE_NAME(stdlib) {
+ "use asm";
+ var imul = stdlib.Math.imul;
+
+ FUNC_BODY
+ return {main: FUNC_NAME};
+ }
+
+ var source = MODULE_NAME.toString()
+ .replace(/MODULE_NAME/g, func.name + "_module")
+ .replace(/FUNC_BODY/g, func.toString())
+ .replace(/FUNC_NAME/g, func.name);
+ return eval("(" + source + ")");
+}
+
+function RunThreeWayTest(asmfunc, expect) {
+ var asm_source = asmfunc.toString();
+ var nonasm_source = asm_source.replace(new RegExp("use asm"), "");
+ var stdlib = {Math: Math};
+
+ var js_module = eval("(" + nonasm_source + ")")(stdlib);
+ print("Testing " + asmfunc.name + " (js)...");
+ expect(js_module);
+
+ print("Testing " + asmfunc.name + " (asm.js)...");
+ var asm_module = asmfunc(stdlib);
+ expect(asm_module);
+
+ print("Testing " + asmfunc.name + " (wasm)...");
+ var wasm_module = Wasm.instantiateModuleFromAsm(asm_source, stdlib);
+ expect(wasm_module);
+}
+
+const imul = Math.imul;
+
+function u32_add(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return +(((a >>> 0) + (b >>> 0)) >>> 0);
+}
+
+function u32_sub(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return +(((a >>> 0) - (b >>> 0)) >>> 0);
+}
+
+function u32_mul(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return +imul(a >>> 0, b >>> 0);
+}
+
+function u32_div(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return +(((a >>> 0) / (b >>> 0)) >>> 0);
+}
+
+function u32_mod(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return +(((a >>> 0) % (b >>> 0)) >>> 0);
+}
+
+function u32_and(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return +((a >>> 0) & (b >>> 0));
+}
+
+function u32_or(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return +((a >>> 0) | (b >>> 0));
+}
+
+function u32_xor(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return +((a >>> 0) ^ (b >>> 0));
+}
+
+function u32_shl(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return +((a >>> 0) << (b >>> 0));
+}
+
+function u32_shr(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return +((a >>> 0) >> (b >>> 0));
+}
+
+function u32_sar(a, b) {
+ a = a | 0;
+ b = b | 0;
+ return ((a >>> 0) >>> (b >>> 0)) | 0;
+}
+
+function u32_eq(a, b) {
+ a = a | 0;
+ b = b | 0;
+ if ((a >>> 0) == (b >>> 0)) {
+ return 1;
+ }
+ return 0;
+}
+
+function u32_ne(a, b) {
+ a = a | 0;
+ b = b | 0;
+ if ((a >>> 0) < (b >>> 0)) {
+ return 1;
+ }
+ return 0;
+}
+
+function u32_lt(a, b) {
+ a = a | 0;
+ b = b | 0;
+ if ((a >>> 0) < (b >>> 0)) {
+ return 1;
+ }
+ return 0;
+}
+
+function u32_lteq(a, b) {
+ a = a | 0;
+ b = b | 0;
+ if ((a >>> 0) <= (b >>> 0)) {
+ return 1;
+ }
+ return 0;
+}
+
+function u32_gt(a, b) {
+ a = a | 0;
+ b = b | 0;
+ if ((a >>> 0) > (b >>> 0)) {
+ return 1;
+ }
+ return 0;
+}
+
+function u32_gteq(a, b) {
+ a = a | 0;
+ b = b | 0;
+ if ((a >>> 0) >= (b >>> 0)) {
+ return 1;
+ }
+ return 0;
+}
+
+
+var inputs = [
+ 0, 1, 2, 3, 4,
+ 10, 20, 30, 31, 32, 33, 100, 2000,
+ 30000, 400000, 5000000,
+ 100000000, 2000000000,
+ 2147483646,
+ 2147483647,
+ 2147483648,
+ 2147483649,
+ 0x273a798e, 0x187937a3, 0xece3af83, 0x5495a16b, 0x0b668ecc, 0x11223344,
+ 0x0000009e, 0x00000043, 0x0000af73, 0x0000116b, 0x00658ecc, 0x002b3b4c,
+ 0x88776655, 0x70000000, 0x07200000, 0x7fffffff, 0x56123761, 0x7fffff00,
+ 0x761c4761, 0x80000000, 0x88888888, 0xa0000000, 0xdddddddd, 0xe0000000,
+ 0xeeeeeeee, 0xfffffffd, 0xf0000000, 0x007fffff, 0x003fffff, 0x001fffff,
+ 0x000fffff, 0x0007ffff, 0x0003ffff, 0x0001ffff, 0x0000ffff, 0x00007fff,
+ 0x00003fff, 0x00001fff, 0x00000fff, 0x000007ff, 0x000003ff, 0x000001ff,
+ -1, -2, -3, -4,
+ -10, -20, -30, -31, -32, -33, -100, -2000,
+ -30000, -400000, -5000000,
+ -100000000, -2000000000,
+ -2147483646,
+ -2147483647,
+ -2147483648,
+ -2147483649,
+];
+
+var funcs = [
+ u32_add,
+ u32_sub,
+ u32_div,
+ u32_mod,
+// TODO(titzer): u32_mul crashes turbofan in asm.js mode
+ u32_and,
+ u32_or,
+ u32_xor,
+ u32_shl,
+ u32_shr,
+ u32_sar,
+ u32_eq,
+ u32_ne,
+ u32_lt,
+ u32_lteq,
+ u32_gt,
+ u32_gteq,
+ // TODO(titzer): u32_min
+ // TODO(titzer): u32_max
+ // TODO(titzer): u32_abs
+];
+
+(function () {
+ for (func of funcs) {
+ RunThreeWayTest(WrapInAsmModule(func), function (module) {
+ for (a of inputs) {
+ for (b of inputs) {
+ var expected = func(a, b);
+ assertEquals(expected, module.main(a, b));
+ }
+ }
+ });
+ }
+
+})();
diff --git a/test/mjsunit/wasm/asm-wasm.js b/test/mjsunit/wasm/asm-wasm.js
index 3f936f5..2efb006 100644
--- a/test/mjsunit/wasm/asm-wasm.js
+++ b/test/mjsunit/wasm/asm-wasm.js
@@ -4,6 +4,12 @@
// Flags: --expose-wasm
+function assertWasm(expected, func, ffi) {
+ print("Testing " + func.name + "...");
+ assertEquals(expected, Wasm.instantiateModuleFromAsm(
+ func.toString(), ffi).caller());
+}
+
function EmptyTest() {
"use asm";
function caller() {
@@ -15,8 +21,7 @@
return {caller: caller};
}
-assertEquals(11, _WASMEXP_.instantiateModuleFromAsm(
- EmptyTest.toString()).caller());
+assertWasm(11, EmptyTest);
function IntTest() {
@@ -37,8 +42,7 @@
return {caller: caller};
}
-assertEquals(101, _WASMEXP_.instantiateModuleFromAsm(
- IntTest.toString()).caller());
+assertWasm(101,IntTest);
function Float64Test() {
@@ -63,8 +67,7 @@
return {caller: caller};
}
-assertEquals(1, _WASMEXP_.instantiateModuleFromAsm(
- Float64Test.toString()).caller());
+assertWasm(1, Float64Test);
function BadModule() {
@@ -84,7 +87,7 @@
}
assertThrows(function() {
- _WASMEXP_.instantiateModuleFromAsm(BadModule.toString()).caller();
+ Wasm.instantiateModuleFromAsm(BadModule.toString()).caller();
});
@@ -105,8 +108,22 @@
return {caller: caller};
}
-assertEquals(1, _WASMEXP_.instantiateModuleFromAsm(
- TestReturnInBlock.toString()).caller());
+assertWasm(1, TestReturnInBlock);
+
+
+function TestAddSimple() {
+ "use asm";
+
+ function caller() {
+ var x = 0;
+ x = (x + 1)|0;
+ return x|0;
+ }
+
+ return {caller: caller};
+}
+
+assertWasm(1, TestAddSimple);
function TestWhileSimple() {
@@ -123,8 +140,7 @@
return {caller: caller};
}
-assertEquals(5, _WASMEXP_.instantiateModuleFromAsm(
- TestWhileSimple.toString()).caller());
+assertWasm(5, TestWhileSimple);
function TestWhileWithoutBraces() {
@@ -140,8 +156,7 @@
return {caller: caller};
}
-assertEquals(4, _WASMEXP_.instantiateModuleFromAsm(
- TestWhileWithoutBraces.toString()).caller());
+assertWasm(4, TestWhileWithoutBraces);
function TestReturnInWhile() {
@@ -159,8 +174,7 @@
return {caller: caller};
}
-assertEquals(6, _WASMEXP_.instantiateModuleFromAsm(
- TestReturnInWhile.toString()).caller());
+assertWasm(6, TestReturnInWhile);
function TestReturnInWhileWithoutBraces() {
@@ -176,9 +190,7 @@
return {caller: caller};
}
-assertEquals(
- 7, _WASMEXP_.instantiateModuleFromAsm(
- TestReturnInWhileWithoutBraces.toString()).caller());
+assertWasm(7, TestReturnInWhileWithoutBraces);
function TestBreakInWhile() {
@@ -194,8 +206,7 @@
return {caller: caller};
}
-assertEquals(8, _WASMEXP_.instantiateModuleFromAsm(
- TestBreakInWhile.toString()).caller());
+assertWasm(8, TestBreakInWhile);
function TestBreakInNestedWhile() {
@@ -218,8 +229,7 @@
return {caller: caller};
}
-assertEquals(9, _WASMEXP_.instantiateModuleFromAsm(
- TestBreakInNestedWhile.toString()).caller());
+assertWasm(9, TestBreakInNestedWhile);
function TestBreakInBlock() {
@@ -240,8 +250,7 @@
return {caller: caller};
}
-assertEquals(10, _WASMEXP_.instantiateModuleFromAsm(
- TestBreakInBlock.toString()).caller());
+assertWasm(10, TestBreakInBlock);
function TestBreakInNamedWhile() {
@@ -261,8 +270,7 @@
return {caller: caller};
}
-assertEquals(11, _WASMEXP_.instantiateModuleFromAsm(
- TestBreakInNamedWhile.toString()).caller());
+assertWasm(11, TestBreakInNamedWhile);
function TestContinue() {
@@ -284,8 +292,7 @@
return {caller: caller};
}
-assertEquals(-5, _WASMEXP_.instantiateModuleFromAsm(
- TestContinue.toString()).caller());
+assertWasm(-5, TestContinue);
function TestContinueInNamedWhile() {
@@ -312,8 +319,7 @@
return {caller: caller};
}
-assertEquals(20, _WASMEXP_.instantiateModuleFromAsm(
- TestContinueInNamedWhile.toString()).caller());
+assertWasm(20, TestContinueInNamedWhile);
function TestNot() {
@@ -327,8 +333,7 @@
return {caller:caller};
}
-assertEquals(1, _WASMEXP_.instantiateModuleFromAsm(
- TestNot.toString()).caller());
+assertWasm(1, TestNot);
function TestNotEquals() {
@@ -345,8 +350,7 @@
return {caller:caller};
}
-assertEquals(21, _WASMEXP_.instantiateModuleFromAsm(
- TestNotEquals.toString()).caller());
+assertWasm(21, TestNotEquals);
function TestUnsignedComparison() {
@@ -363,8 +367,7 @@
return {caller:caller};
}
-assertEquals(22, _WASMEXP_.instantiateModuleFromAsm(
- TestUnsignedComparison.toString()).caller());
+assertWasm(22, TestUnsignedComparison);
function TestMixedAdd() {
@@ -386,8 +389,7 @@
return {caller:caller};
}
-assertEquals(23, _WASMEXP_.instantiateModuleFromAsm(
- TestMixedAdd.toString()).caller());
+assertWasm(23, TestMixedAdd);
function TestInt32HeapAccess(stdlib, foreign, buffer) {
@@ -406,16 +408,14 @@
return {caller: caller};
}
-assertEquals(7, _WASMEXP_.instantiateModuleFromAsm(
- TestInt32HeapAccess.toString()).caller());
+assertWasm(7, TestInt32HeapAccess);
function TestInt32HeapAccessExternal() {
var memory = new ArrayBuffer(1024);
var memory_int32 = new Int32Array(memory);
- var module = _WASMEXP_.instantiateModuleFromAsm(
+ var module = Wasm.instantiateModuleFromAsm(
TestInt32HeapAccess.toString(), null, memory);
- module.__init__();
assertEquals(7, module.caller());
assertEquals(7, memory_int32[2]);
}
@@ -438,11 +438,10 @@
code = code.replace(/>> 2/g, types[i][2]);
var memory = new ArrayBuffer(1024);
var memory_view = new types[i][0](memory);
- var module = _WASMEXP_.instantiateModuleFromAsm(code, null, memory);
- module.__init__();
+ var module = Wasm.instantiateModuleFromAsm(code, null, memory);
assertEquals(7, module.caller());
assertEquals(7, memory_view[2]);
- assertEquals(7, _WASMEXP_.instantiateModuleFromAsm(code).caller());
+ assertEquals(7, Wasm.instantiateModuleFromAsm(code).caller());
}
}
@@ -460,7 +459,6 @@
var j = 8;
var v = 6.0;
- // TODO(bradnelson): Add float32 when asm-wasm supports it.
f64[2] = v + 1.0;
f64[i >> 3] = +f64[2] + 1.0;
f64[j >> 3] = +f64[j >> 3] + 1.0;
@@ -471,16 +469,15 @@
return {caller: caller};
}
-assertEquals(1, _WASMEXP_.instantiateModuleFromAsm(
+assertEquals(1, Wasm.instantiateModuleFromAsm(
TestFloatHeapAccess.toString()).caller());
function TestFloatHeapAccessExternal() {
var memory = new ArrayBuffer(1024);
var memory_float64 = new Float64Array(memory);
- var module = _WASMEXP_.instantiateModuleFromAsm(
+ var module = Wasm.instantiateModuleFromAsm(
TestFloatHeapAccess.toString(), null, memory);
- module.__init__();
assertEquals(1, module.caller());
assertEquals(9.0, memory_float64[1]);
}
@@ -502,8 +499,7 @@
return {caller:caller};
}
-assertEquals(24, _WASMEXP_.instantiateModuleFromAsm(
- TestConvertI32.toString()).caller());
+assertWasm(24, TestConvertI32);
function TestConvertF64FromInt() {
@@ -511,7 +507,7 @@
function caller() {
var a = 1;
- if ((+(a + a)) > 1.5) {
+ if ((+((a + a)|0)) > 1.5) {
return 25;
}
return 0;
@@ -520,8 +516,7 @@
return {caller:caller};
}
-assertEquals(25, _WASMEXP_.instantiateModuleFromAsm(
- TestConvertF64FromInt.toString()).caller());
+assertWasm(25, TestConvertF64FromInt);
function TestConvertF64FromUnsigned() {
@@ -530,7 +525,7 @@
function caller() {
var a = 0xffffffff;
if ((+(a>>>0)) > 0.0) {
- if((+a) < 0.0) {
+ if((+(a|0)) < 0.0) {
return 26;
}
}
@@ -540,8 +535,7 @@
return {caller:caller};
}
-assertEquals(26, _WASMEXP_.instantiateModuleFromAsm(
- TestConvertF64FromUnsigned.toString()).caller());
+assertWasm(26, TestConvertF64FromUnsigned);
function TestModInt() {
@@ -556,8 +550,7 @@
return {caller:caller};
}
-assertEquals(-27, _WASMEXP_.instantiateModuleFromAsm(
- TestModInt.toString()).caller());
+assertWasm(-27,TestModInt);
function TestModUnsignedInt() {
@@ -572,8 +565,7 @@
return {caller:caller};
}
-assertEquals(8, _WASMEXP_.instantiateModuleFromAsm(
- TestModUnsignedInt.toString()).caller());
+assertWasm(8, TestModUnsignedInt);
function TestModDouble() {
@@ -591,13 +583,9 @@
return {caller:caller};
}
-assertEquals(28, _WASMEXP_.instantiateModuleFromAsm(
- TestModDouble.toString()).caller());
+assertWasm(28, TestModDouble);
-/*
-TODO: Fix parsing of negative doubles
- Fix code to use trunc instead of casts
function TestModDoubleNegative() {
"use asm";
@@ -613,11 +601,9 @@
return {caller:caller};
}
-assertEquals(28, _WASMEXP_.instantiateModuleFromAsm(
- TestModDoubleNegative.toString()).caller());
-*/
+assertWasm(28, TestModDoubleNegative);
-
+(function () {
function TestNamedFunctions() {
"use asm";
@@ -637,11 +623,12 @@
add:add};
}
-var module = _WASMEXP_.instantiateModuleFromAsm(TestNamedFunctions.toString());
+var module = Wasm.instantiateModuleFromAsm(TestNamedFunctions.toString());
module.init();
assertEquals(77.5, module.add());
+})();
-
+(function () {
function TestGlobalsWithInit() {
"use asm";
@@ -655,10 +642,9 @@
return {add:add};
}
-var module = _WASMEXP_.instantiateModuleFromAsm(TestGlobalsWithInit.toString());
-module.__init__();
+var module = Wasm.instantiateModuleFromAsm(TestGlobalsWithInit.toString());
assertEquals(77.5, module.add());
-
+})();
function TestForLoop() {
"use asm"
@@ -675,8 +661,7 @@
return {caller:caller};
}
-assertEquals(54, _WASMEXP_.instantiateModuleFromAsm(
- TestForLoop.toString()).caller());
+assertWasm(54, TestForLoop);
function TestForLoopWithoutInit() {
@@ -694,8 +679,7 @@
return {caller:caller};
}
-assertEquals(100, _WASMEXP_.instantiateModuleFromAsm(
- TestForLoopWithoutInit.toString()).caller());
+assertWasm(100,TestForLoopWithoutInit);
function TestForLoopWithoutCondition() {
@@ -716,8 +700,7 @@
return {caller:caller};
}
-assertEquals(66, _WASMEXP_.instantiateModuleFromAsm(
- TestForLoopWithoutCondition.toString()).caller());
+assertWasm(66, TestForLoopWithoutCondition);
function TestForLoopWithoutNext() {
@@ -734,8 +717,7 @@
return {caller:caller};
}
-assertEquals(41, _WASMEXP_.instantiateModuleFromAsm(
- TestForLoopWithoutNext.toString()).caller());
+assertWasm(41, TestForLoopWithoutNext);
function TestForLoopWithoutBody() {
@@ -751,8 +733,7 @@
return {caller:caller};
}
-assertEquals(45, _WASMEXP_.instantiateModuleFromAsm(
- TestForLoopWithoutBody.toString()).caller());
+assertWasm(45, TestForLoopWithoutBody);
function TestDoWhile() {
@@ -771,8 +752,7 @@
return {caller:caller};
}
-assertEquals(84, _WASMEXP_.instantiateModuleFromAsm(
- TestDoWhile.toString()).caller());
+assertWasm(84, TestDoWhile);
function TestConditional() {
@@ -786,8 +766,7 @@
return {caller:caller};
}
-assertEquals(41, _WASMEXP_.instantiateModuleFromAsm(
- TestConditional.toString()).caller());
+assertWasm(41, TestConditional);
function TestSwitch() {
@@ -815,8 +794,7 @@
return {caller:caller};
}
-assertEquals(23, _WASMEXP_.instantiateModuleFromAsm(
- TestSwitch.toString()).caller());
+assertWasm(23, TestSwitch);
function TestSwitchFallthrough() {
@@ -838,8 +816,7 @@
return {caller:caller};
}
-assertEquals(42, _WASMEXP_.instantiateModuleFromAsm(
- TestSwitchFallthrough.toString()).caller());
+assertWasm(42, TestSwitchFallthrough);
function TestNestedSwitch() {
@@ -865,10 +842,10 @@
return {caller:caller};
}
-assertEquals(43, _WASMEXP_.instantiateModuleFromAsm(
- TestNestedSwitch.toString()).caller());
+assertWasm(43, TestNestedSwitch);
+(function () {
function TestInitFunctionWithNoGlobals() {
"use asm";
function caller() {
@@ -877,12 +854,12 @@
return {caller};
}
-var module = _WASMEXP_.instantiateModuleFromAsm(
+var module = Wasm.instantiateModuleFromAsm(
TestInitFunctionWithNoGlobals.toString());
-module.__init__();
assertEquals(51, module.caller());
+})();
-
+(function () {
function TestExportNameDifferentFromFunctionName() {
"use asm";
function caller() {
@@ -891,11 +868,10 @@
return {alt_caller:caller};
}
-var module = _WASMEXP_.instantiateModuleFromAsm(
+var module = Wasm.instantiateModuleFromAsm(
TestExportNameDifferentFromFunctionName.toString());
-module.__init__();
assertEquals(55, module.alt_caller());
-
+})();
function TestFunctionTableSingleFunction() {
"use asm";
@@ -913,8 +889,7 @@
return {caller:caller};
}
-assertEquals(71, _WASMEXP_.instantiateModuleFromAsm(
- TestFunctionTableSingleFunction.toString()).caller());
+assertWasm(71, TestFunctionTableSingleFunction);
function TestFunctionTableMultipleFunctions() {
@@ -944,10 +919,10 @@
return {caller:caller};
}
-assertEquals(73, _WASMEXP_.instantiateModuleFromAsm(
- TestFunctionTableMultipleFunctions.toString()).caller());
+assertWasm(73, TestFunctionTableMultipleFunctions);
+(function () {
function TestFunctionTable() {
"use asm";
@@ -987,14 +962,14 @@
return {caller:caller};
}
-var module = _WASMEXP_.instantiateModuleFromAsm(TestFunctionTable.toString());
-module.__init__();
+var module = Wasm.instantiateModuleFromAsm(TestFunctionTable.toString());
assertEquals(55, module.caller(0, 0, 33, 22));
assertEquals(11, module.caller(0, 1, 33, 22));
assertEquals(9, module.caller(0, 2, 54, 45));
assertEquals(99, module.caller(0, 3, 54, 45));
assertEquals(23, module.caller(0, 4, 12, 11));
assertEquals(31, module.caller(1, 0, 30, 11));
+})();
function TestForeignFunctions() {
@@ -1033,10 +1008,9 @@
var foreign = new ffi(23);
- var module = _WASMEXP_.instantiateModuleFromAsm(AsmModule.toString(),
+ var module = Wasm.instantiateModuleFromAsm(AsmModule.toString(),
foreign, null);
- module.__init__();
assertEquals(103, module.caller(23, 103));
}
@@ -1073,10 +1047,9 @@
var foreign = new ffi();
- var module = _WASMEXP_.instantiateModuleFromAsm(AsmModule.toString(),
+ var module = Wasm.instantiateModuleFromAsm(AsmModule.toString(),
foreign, null);
- module.__init__();
assertEquals(89, module.caller(83, 83.25));
}
@@ -1112,9 +1085,9 @@
}
function TestCase(env, i1, f1, i2, f2) {
- var module = _WASMEXP_.instantiateModuleFromAsm(
+ print("Testing foreign variables...");
+ var module = Wasm.instantiateModuleFromAsm(
AsmModule.toString(), env);
- module.__init__();
assertEquals(i1, module.geti1());
assertEquals(f1, module.getf1());
assertEquals(i2, module.geti2());
@@ -1205,7 +1178,7 @@
return {load: load, iload: iload, store: store, storeb: storeb};
}
- var m = _WASMEXP_.instantiateModuleFromAsm(
+ var m = Wasm.instantiateModuleFromAsm(
TestByteHeapAccessCompat.toString());
m.store(0, 20);
m.store(4, 21);
@@ -1222,25 +1195,19 @@
})();
-(function TestGlobalBlock() {
- function Module(stdlib, foreign, buffer) {
- "use asm";
+function TestGlobalBlock(stdlib, foreign, buffer) {
+ "use asm";
- var x = foreign.x | 0, y = foreign.y | 0;
+ var x = foreign.x | 0, y = foreign.y | 0;
- function test() {
- return (x + y) | 0;
- }
-
- return {test: test};
+ function test() {
+ return (x + y) | 0;
}
- var m = _WASMEXP_.instantiateModuleFromAsm(
- Module.toString(), { x: 4, y: 11 });
- m.__init__();
- assertEquals(15, m.test());
-})();
+ return {caller: test};
+}
+assertWasm(15, TestGlobalBlock, { x: 4, y: 11 });
(function TestComma() {
function CommaModule() {
@@ -1261,58 +1228,61 @@
return {ifunc: ifunc, dfunc: dfunc};
}
- var m = _WASMEXP_.instantiateModuleFromAsm(CommaModule.toString());
+ var m = Wasm.instantiateModuleFromAsm(CommaModule.toString());
assertEquals(123, m.ifunc(456.7, 123));
assertEquals(123.4, m.dfunc(456, 123.4));
})();
-(function TestOr() {
- function Module() {
- "use asm";
- function func() {
- var x = 1;
- var y = 2;
- return (x | y) | 0;
- }
- return {func: func};
+function TestFloatAsDouble(stdlib) {
+ "use asm";
+ var fround = stdlib.Math.fround;
+ function func() {
+ var x = fround(1.0);
+ return +fround(x);
}
-
- var m = _WASMEXP_.instantiateModuleFromAsm(Module.toString());
- assertEquals(3, m.func());
-})();
+ return {caller: func};
+}
+assertWasm(1, TestFloatAsDouble);
-(function TestAnd() {
- function Module() {
- "use asm";
- function func() {
- var x = 3;
- var y = 2;
- return (x & y) | 0;
- }
- return {func: func};
+function TestOr() {
+ "use asm";
+ function func() {
+ var x = 1;
+ var y = 2;
+ return (x | y) | 0;
}
+ return {caller: func};
+}
- var m = _WASMEXP_.instantiateModuleFromAsm(Module.toString());
- assertEquals(2, m.func());
-})();
+assertWasm(3, TestOr);
-(function TestXor() {
- function Module() {
- "use asm";
- function func() {
- var x = 3;
- var y = 2;
- return (x ^ y) | 0;
- }
- return {func: func};
+function TestAnd() {
+ "use asm";
+ function func() {
+ var x = 3;
+ var y = 2;
+ return (x & y) | 0;
}
+ return {caller: func};
+}
- var m = _WASMEXP_.instantiateModuleFromAsm(Module.toString());
- assertEquals(1, m.func());
-})();
+assertWasm(2, TestAnd);
+
+
+function TestXor() {
+ "use asm";
+ function func() {
+ var x = 3;
+ var y = 2;
+ return (x ^ y) | 0;
+ }
+ return {caller: func};
+}
+
+assertWasm(1, TestXor);
(function TestIntishAssignment() {
@@ -1328,7 +1298,7 @@
return {func: func};
}
- var m = _WASMEXP_.instantiateModuleFromAsm(Module.toString());
+ var m = Wasm.instantiateModuleFromAsm(Module.toString());
assertEquals(3, m.func());
})();
@@ -1347,6 +1317,179 @@
return {func: func};
}
- var m = _WASMEXP_.instantiateModuleFromAsm(Module.toString());
+ var m = Wasm.instantiateModuleFromAsm(Module.toString());
assertEquals(3, m.func());
-}) // TODO(bradnelson): Enable when Math.fround implementation lands.
+})();
+
+
+(function TestDoubleToFloatAssignment() {
+ function Module(stdlib, foreign, heap) {
+ "use asm";
+ var HEAPF32 = new stdlib.Float32Array(heap);
+ var fround = stdlib.Math.fround;
+ function func() {
+ var a = 1.23;
+ HEAPF32[0] = a;
+ return +HEAPF32[0];
+ }
+ return {func: func};
+ }
+
+ var m = Wasm.instantiateModuleFromAsm(Module.toString());
+ assertEquals(1.23, m.func());
+});
+
+
+(function TestIntegerMultiplyBothWays() {
+ function Module(stdlib, foreign, heap) {
+ "use asm";
+ function func() {
+ var a = 1;
+ return ((a * 3) + (4 * a)) | 0;
+ }
+ return {func: func};
+ }
+
+ var m = Wasm.instantiateModuleFromAsm(Module.toString());
+ assertEquals(7, m.func());
+})();
+
+
+(function TestBadMultiplyIntish() {
+ function Module(stdlib, foreign, heap) {
+ "use asm";
+ function func() {
+ var a = 1;
+ return ((a + a) * 4) | 0;
+ }
+ return {func: func};
+ }
+ assertThrows(function() {
+ Wasm.instantiateModuleFromAsm(Module.toString());
+ });
+})();
+
+
+(function TestBadCastFromInt() {
+ function Module(stdlib, foreign, heap) {
+ "use asm";
+ function func() {
+ var a = 1;
+ return +a;
+ }
+ return {func: func};
+ }
+ assertThrows(function() {
+ Wasm.instantiateModuleFromAsm(Module.toString());
+ });
+})();
+
+
+(function TestAndNegative() {
+ function Module() {
+ "use asm";
+ function func() {
+ var x = 1;
+ var y = 2;
+ var z = 0;
+ z = x + y & -1;
+ return z | 0;
+ }
+ return {func: func};
+ }
+
+ var m = Wasm.instantiateModuleFromAsm(Module.toString());
+ assertEquals(3, m.func());
+})();
+
+
+(function TestNegativeDouble() {
+ function Module() {
+ "use asm";
+ function func() {
+ var x = -(34359738368.25);
+ var y = -2.5;
+ return +(x + y);
+ }
+ return {func: func};
+ }
+
+ var m = Wasm.instantiateModuleFromAsm(Module.toString());
+ assertEquals(-34359738370.75, m.func());
+})();
+
+
+(function TestBadAndDouble() {
+ function Module() {
+ "use asm";
+ function func() {
+ var x = 1.0;
+ var y = 2.0;
+ return (x & y) | 0;
+ }
+ return {func: func};
+ }
+
+ assertThrows(function() {
+ Wasm.instantiateModuleFromAsm(Module.toString());
+ });
+})();
+
+
+(function TestAndIntAndHeapValue() {
+ function Module(stdlib, foreign, buffer) {
+ "use asm";
+ var HEAP32 = new stdlib.Int32Array(buffer);
+ function func() {
+ var x = 0;
+ x = HEAP32[0] & -1;
+ return x | 0;
+ }
+ return {func: func};
+ }
+
+ var m = Wasm.instantiateModuleFromAsm(Module.toString());
+ assertEquals(0, m.func());
+})();
+
+(function TestOutOfBoundsConversion() {
+ function asmModule($a,$b,$c){'use asm';
+ function aaa() {
+ var f = 0.0;
+ var a = 0;
+ f = 5616315000.000001;
+ a = ~~f >>>0;
+ return a | 0;
+ }
+ return { main : aaa };
+ }
+ var wasm = Wasm.instantiateModuleFromAsm(asmModule.toString());
+ assertEquals(1321347704, wasm.main());
+})();
+
+(function TestUnsignedLiterals() {
+ function asmModule() {
+ "use asm";
+ function u0xffffffff() {
+ var f = 0xffffffff;
+ return +(f >>> 0);
+ }
+ function u0x80000000() {
+ var f = 0x80000000;
+ return +(f >>> 0);
+ }
+ function u0x87654321() {
+ var f = 0x87654321;
+ return +(f >>> 0);
+ }
+ return {
+ u0xffffffff: u0xffffffff,
+ u0x80000000: u0x80000000,
+ u0x87654321: u0x87654321,
+ };
+ }
+ var wasm = Wasm.instantiateModuleFromAsm(asmModule.toString());
+ assertEquals(0xffffffff, wasm.u0xffffffff());
+ assertEquals(0x80000000, wasm.u0x80000000());
+ assertEquals(0x87654321, wasm.u0x87654321());
+})();
diff --git a/test/mjsunit/wasm/calls.js b/test/mjsunit/wasm/calls.js
index 98ad657..11cc92a 100644
--- a/test/mjsunit/wasm/calls.js
+++ b/test/mjsunit/wasm/calls.js
@@ -5,141 +5,100 @@
// Flags: --expose-wasm
load("test/mjsunit/wasm/wasm-constants.js");
+load("test/mjsunit/wasm/wasm-module-builder.js");
-var module = (function () {
- var kBodySize = 5;
- var kNameOffset = 21 + kBodySize + 1;
+function assertModule(module, memsize) {
+ // Check the module exists.
+ assertFalse(module === undefined);
+ assertFalse(module === null);
+ assertFalse(module === 0);
+ assertEquals("object", typeof module);
- return _WASMEXP_.instantiateModule(bytes(
- // -- memory
- kDeclMemory,
- 12, 12, 1,
- // -- signatures
- kDeclSignatures, 1,
- 2, kAstI32, kAstI32, kAstI32, // int, int -> int
- // -- functions
- kDeclFunctions, 1,
- kDeclFunctionName | kDeclFunctionExport,
- 0, 0,
- kNameOffset, 0, 0, 0, // name offset
- kBodySize, 0,
- // -- body
- kExprI32Sub, // --
- kExprGetLocal, 0, // --
- kExprGetLocal, 1, // --
- kDeclEnd,
- 's', 'u', 'b', 0 // name
- ));
-})();
+ // Check the memory is an ArrayBuffer.
+ var mem = module.exports.memory;
+ assertFalse(mem === undefined);
+ assertFalse(mem === null);
+ assertFalse(mem === 0);
+ assertEquals("object", typeof mem);
+ assertTrue(mem instanceof ArrayBuffer);
+ for (var i = 0; i < 4; i++) {
+ module.exports.memory = 0; // should be ignored
+ assertEquals(mem, module.exports.memory);
+ }
-// Check the module exists.
-assertFalse(module === undefined);
-assertFalse(module === null);
-assertFalse(module === 0);
-assertEquals("object", typeof module);
-
-// Check the memory is an ArrayBuffer.
-var mem = module.memory;
-assertFalse(mem === undefined);
-assertFalse(mem === null);
-assertFalse(mem === 0);
-assertEquals("object", typeof mem);
-assertTrue(mem instanceof ArrayBuffer);
-for (var i = 0; i < 4; i++) {
- module.memory = 0; // should be ignored
- assertEquals(mem, module.memory);
+ assertEquals(memsize, module.exports.memory.byteLength);
}
-assertEquals(4096, module.memory.byteLength);
+function assertFunction(module, func) {
+ assertEquals("object", typeof module.exports);
-// Check the properties of the sub function.
-assertEquals("function", typeof module.sub);
+ var exp = module.exports[func];
+ assertFalse(exp === undefined);
+ assertFalse(exp === null);
+ assertFalse(exp === 0);
+ assertEquals("function", typeof exp);
-assertEquals(-55, module.sub(33, 88));
-assertEquals(-55555, module.sub(33333, 88888));
-assertEquals(-5555555, module.sub(3333333, 8888888));
-
-
-var module = (function() {
- var kBodySize = 1;
- var kNameOffset2 = 19 + kBodySize + 1;
-
- return _WASMEXP_.instantiateModule(bytes(
- // -- memory
- kDeclMemory,
- 12, 12, 1,
- // -- signatures
- kDeclSignatures, 1,
- 0, kAstStmt, // signature: void -> void
- // -- functions
- kDeclFunctions, 1,
- kDeclFunctionName | kDeclFunctionExport,
- 0, 0, // signature index
- kNameOffset2, 0, 0, 0, // name offset
- kBodySize, 0,
- kExprNop, // body
- kDeclEnd,
- 'n', 'o', 'p', 0 // name
- ));
-})();
-
-// Check the module exists.
-assertFalse(module === undefined);
-assertFalse(module === null);
-assertFalse(module === 0);
-assertEquals("object", typeof module);
-
-// Check the memory is an ArrayBuffer.
-var mem = module.memory;
-assertFalse(mem === undefined);
-assertFalse(mem === null);
-assertFalse(mem === 0);
-assertEquals("object", typeof mem);
-assertTrue(mem instanceof ArrayBuffer);
-for (var i = 0; i < 4; i++) {
- module.memory = 0; // should be ignored
- assertEquals(mem, module.memory);
+ return exp;
}
-assertEquals(4096, module.memory.byteLength);
+(function SubTest() {
-// Check the properties of the sub function.
-assertFalse(module.nop === undefined);
-assertFalse(module.nop === null);
-assertFalse(module.nop === 0);
-assertEquals("function", typeof module.nop);
+ var builder = new WasmModuleBuilder();
-assertEquals(undefined, module.nop());
+ builder.addMemory(1, 1, true);
+ builder.addFunction("sub", [kAstI32, kAstI32, kAstI32])
+ .addBody([
+ kExprI32Sub, // --
+ kExprGetLocal, 0, // --
+ kExprGetLocal, 1]) // --
+ .exportFunc()
+
+ var module = builder.instantiate();
+ assertModule(module, kPageSize);
+
+ // Check the properties of the sub function.
+ var sub = assertFunction(module, "sub");
+ assertEquals(-55, sub(33, 88));
+ assertEquals(-55555, sub(33333, 88888));
+ assertEquals(-5555555, sub(3333333, 8888888));
+})();
+
+
+(function NopTest() {
+
+ var builder = new WasmModuleBuilder();
+
+ var kPages = 2;
+ builder.addMemory(kPages, kPages, true);
+ builder.addFunction("nop", [kAstStmt])
+ .addBody([kExprNop])
+ .exportFunc();
+
+ var module = builder.instantiate();
+ assertModule(module, kPageSize * kPages);
+
+ var nop = assertFunction(module, "nop");
+ assertEquals(undefined, nop());
+})();
+
(function testLt() {
- var kBodySize = 5;
- var kNameOffset = 21 + kBodySize + 1;
+ var builder = new WasmModuleBuilder();
- var data = bytes(
- // -- memory
- kDeclMemory,
- 12, 12, 1,
- // -- signatures
- kDeclSignatures, 1,
- 2, kAstI32, kAstF64, kAstF64, // (f64,f64)->int
- // -- functions
- kDeclFunctions, 1,
- kDeclFunctionName | kDeclFunctionExport,
- 0, 0, // signature index
- kNameOffset, 0, 0, 0, // name offset
- kBodySize, 0,
- // -- body
- kExprF64Lt, // --
- kExprGetLocal, 0, // --
- kExprGetLocal, 1, // --
- kDeclEnd,
- 'f', 'l', 't', 0 // name
- );
+ var kPages = 3;
+ builder.addMemory(kPages, kPages, true);
+ builder.addFunction("flt", [kAstI32, kAstF64, kAstF64])
+ .addBody([
+ kExprF64Lt, // --
+ kExprGetLocal, 0, // --
+ kExprGetLocal, 1]) // --
+ .exportFunc();
- var module = _WASMEXP_.instantiateModule(data);
+ var module = builder.instantiate();
+ assertModule(module, kPageSize * kPages);
- assertEquals("function", typeof module.flt);
- assertEquals(1, module.flt(-2, -1));
- assertEquals(0, module.flt(7.3, 7.1));
- assertEquals(1, module.flt(7.1, 7.3));
+ var flt = assertFunction(module, "flt");
+ assertEquals(1, flt(-2, -1));
+ assertEquals(0, flt(7.3, 7.1));
+ assertEquals(1, flt(7.1, 7.3));
})();
diff --git a/test/mjsunit/wasm/divrem-trap.js b/test/mjsunit/wasm/divrem-trap.js
index 9787ae3..976e473 100644
--- a/test/mjsunit/wasm/divrem-trap.js
+++ b/test/mjsunit/wasm/divrem-trap.js
@@ -5,6 +5,7 @@
// Flags: --expose-wasm --expose-gc --allow-natives-syntax
load("test/mjsunit/wasm/wasm-constants.js");
+load("test/mjsunit/wasm/wasm-module-builder.js");
function assertTraps(code, msg) {
var threwException = true;
@@ -29,38 +30,18 @@
}
-function makeDivRem(opcode) {
- var kBodySize = 5;
- var kNameMainOffset = 6 + 11 + kBodySize + 1;
+function makeBinop(opcode) {
+ var builder = new WasmModuleBuilder();
- var data = bytes(
- // signatures
- kDeclSignatures, 1,
- 2, kAstI32, kAstI32, kAstI32, // (int,int) -> int
- // -- main function
- kDeclFunctions, 1,
- kDeclFunctionName | kDeclFunctionExport,
- 0, 0,
- kNameMainOffset, 0, 0, 0, // name offset
- kBodySize, 0,
- // main body
- opcode, // --
- kExprGetLocal, 0, // --
- kExprGetLocal, 1, // --
- // names
- kDeclEnd,
- 'm', 'a', 'i', 'n', 0 // --
- );
+ builder.addFunction("main", [kAstI32, kAstI32, kAstI32])
+ .addBody([opcode, kExprGetLocal, 0, kExprGetLocal, 1])
+ .exportFunc();
- var module = _WASMEXP_.instantiateModule(data);
-
- assertEquals("function", typeof module.main);
-
- return module.main;
+ return builder.instantiate().exports.main;
}
-var divs = makeDivRem(kExprI32DivS);
-var divu = makeDivRem(kExprI32DivU);
+var divs = makeBinop(kExprI32DivS);
+var divu = makeBinop(kExprI32DivU);
assertEquals( 33, divs( 333, 10));
assertEquals(-33, divs(-336, 10));
@@ -78,8 +59,8 @@
assertEquals(0, divu(0x80000000, -1));
-var rems = makeDivRem(kExprI32RemS);
-var remu = makeDivRem(kExprI32RemU);
+var rems = makeBinop(kExprI32RemS);
+var remu = makeBinop(kExprI32RemU);
assertEquals( 3, rems( 333, 10));
assertEquals(-6, rems(-336, 10));
diff --git a/test/mjsunit/wasm/embenchen/README b/test/mjsunit/wasm/embenchen/README
new file mode 100644
index 0000000..7bce3f4
--- /dev/null
+++ b/test/mjsunit/wasm/embenchen/README
@@ -0,0 +1,3 @@
+This directory contains versions of test/mjsunit/asm/embenchen
+modified to work with the current state of the asm->wasm
+conversion plumbing.
diff --git a/test/mjsunit/wasm/embenchen/box2d.js b/test/mjsunit/wasm/embenchen/box2d.js
new file mode 100644
index 0000000..d9c7812
--- /dev/null
+++ b/test/mjsunit/wasm/embenchen/box2d.js
@@ -0,0 +1,20325 @@
+// Modified embenchen to direct to asm-wasm.
+// Flags: --expose-wasm
+
+var EXPECTED_OUTPUT =
+ /frame averages: .+ \+- .+, range: .+ to .+ \n/;
+var Module = {
+ arguments: [1],
+ print: function(x) {Module.printBuffer += x + '\n';},
+ preRun: [function() {Module.printBuffer = ''}],
+ postRun: [function() {
+ assertTrue(EXPECTED_OUTPUT.test(Module.printBuffer));
+ }],
+};
+// The Module object: Our interface to the outside world. We import
+// and export values on it, and do the work to get that through
+// closure compiler if necessary. There are various ways Module can be used:
+// 1. Not defined. We create it here
+// 2. A function parameter, function(Module) { ..generated code.. }
+// 3. pre-run appended it, var Module = {}; ..generated code..
+// 4. External script tag defines var Module.
+// We need to do an eval in order to handle the closure compiler
+// case, where this code here is minified but Module was defined
+// elsewhere (e.g. case 4 above). We also need to check if Module
+// already exists (e.g. case 3 above).
+// Note that if you want to run closure, and also to use Module
+// after the generated code, you will need to define var Module = {};
+// before the code. Then that object will be used in the code, and you
+// can continue to use Module afterwards as well.
+var Module;
+if (!Module) Module = (typeof Module !== 'undefined' ? Module : null) || {};
+
+// Sometimes an existing Module object exists with properties
+// meant to overwrite the default module functionality. Here
+// we collect those properties and reapply _after_ we configure
+// the current environment's defaults to avoid having to be so
+// defensive during initialization.
+var moduleOverrides = {};
+for (var key in Module) {
+ if (Module.hasOwnProperty(key)) {
+ moduleOverrides[key] = Module[key];
+ }
+}
+
+// The environment setup code below is customized to use Module.
+// *** Environment setup code ***
+var ENVIRONMENT_IS_NODE = typeof process === 'object' && typeof require === 'function';
+var ENVIRONMENT_IS_WEB = typeof window === 'object';
+var ENVIRONMENT_IS_WORKER = typeof importScripts === 'function';
+var ENVIRONMENT_IS_SHELL = !ENVIRONMENT_IS_WEB && !ENVIRONMENT_IS_NODE && !ENVIRONMENT_IS_WORKER;
+
+if (ENVIRONMENT_IS_NODE) {
+ // Expose functionality in the same simple way that the shells work
+ // Note that we pollute the global namespace here, otherwise we break in node
+ if (!Module['print']) Module['print'] = function print(x) {
+ process['stdout'].write(x + '\n');
+ };
+ if (!Module['printErr']) Module['printErr'] = function printErr(x) {
+ process['stderr'].write(x + '\n');
+ };
+
+ var nodeFS = require('fs');
+ var nodePath = require('path');
+
+ Module['read'] = function read(filename, binary) {
+ filename = nodePath['normalize'](filename);
+ var ret = nodeFS['readFileSync'](filename);
+ // The path is absolute if the normalized version is the same as the resolved.
+ if (!ret && filename != nodePath['resolve'](filename)) {
+ filename = path.join(__dirname, '..', 'src', filename);
+ ret = nodeFS['readFileSync'](filename);
+ }
+ if (ret && !binary) ret = ret.toString();
+ return ret;
+ };
+
+ Module['readBinary'] = function readBinary(filename) { return Module['read'](filename, true) };
+
+ Module['load'] = function load(f) {
+ globalEval(read(f));
+ };
+
+ Module['arguments'] = process['argv'].slice(2);
+
+ module['exports'] = Module;
+}
+else if (ENVIRONMENT_IS_SHELL) {
+ if (!Module['print']) Module['print'] = print;
+ if (typeof printErr != 'undefined') Module['printErr'] = printErr; // not present in v8 or older sm
+
+ if (typeof read != 'undefined') {
+ Module['read'] = read;
+ } else {
+ Module['read'] = function read() { throw 'no read() available (jsc?)' };
+ }
+
+ Module['readBinary'] = function readBinary(f) {
+ return read(f, 'binary');
+ };
+
+ if (typeof scriptArgs != 'undefined') {
+ Module['arguments'] = scriptArgs;
+ } else if (typeof arguments != 'undefined') {
+ Module['arguments'] = arguments;
+ }
+
+ this['Module'] = Module;
+
+ eval("if (typeof gc === 'function' && gc.toString().indexOf('[native code]') > 0) var gc = undefined"); // wipe out the SpiderMonkey shell 'gc' function, which can confuse closure (uses it as a minified name, and it is then initted to a non-falsey value unexpectedly)
+}
+else if (ENVIRONMENT_IS_WEB || ENVIRONMENT_IS_WORKER) {
+ Module['read'] = function read(url) {
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, false);
+ xhr.send(null);
+ return xhr.responseText;
+ };
+
+ if (typeof arguments != 'undefined') {
+ Module['arguments'] = arguments;
+ }
+
+ if (typeof console !== 'undefined') {
+ if (!Module['print']) Module['print'] = function print(x) {
+ console.log(x);
+ };
+ if (!Module['printErr']) Module['printErr'] = function printErr(x) {
+ console.log(x);
+ };
+ } else {
+ // Probably a worker, and without console.log. We can do very little here...
+ var TRY_USE_DUMP = false;
+ if (!Module['print']) Module['print'] = (TRY_USE_DUMP && (typeof(dump) !== "undefined") ? (function(x) {
+ dump(x);
+ }) : (function(x) {
+ // self.postMessage(x); // enable this if you want stdout to be sent as messages
+ }));
+ }
+
+ if (ENVIRONMENT_IS_WEB) {
+ window['Module'] = Module;
+ } else {
+ Module['load'] = importScripts;
+ }
+}
+else {
+ // Unreachable because SHELL is dependant on the others
+ throw 'Unknown runtime environment. Where are we?';
+}
+
+function globalEval(x) {
+ eval.call(null, x);
+}
+if (!Module['load'] == 'undefined' && Module['read']) {
+ Module['load'] = function load(f) {
+ globalEval(Module['read'](f));
+ };
+}
+if (!Module['print']) {
+ Module['print'] = function(){};
+}
+if (!Module['printErr']) {
+ Module['printErr'] = Module['print'];
+}
+if (!Module['arguments']) {
+ Module['arguments'] = [];
+}
+// *** Environment setup code ***
+
+// Closure helpers
+Module.print = Module['print'];
+Module.printErr = Module['printErr'];
+
+// Callbacks
+Module['preRun'] = [];
+Module['postRun'] = [];
+
+// Merge back in the overrides
+for (var key in moduleOverrides) {
+ if (moduleOverrides.hasOwnProperty(key)) {
+ Module[key] = moduleOverrides[key];
+ }
+}
+
+
+
+// === Auto-generated preamble library stuff ===
+
+//========================================
+// Runtime code shared with compiler
+//========================================
+
+var Runtime = {
+ stackSave: function () {
+ return STACKTOP;
+ },
+ stackRestore: function (stackTop) {
+ STACKTOP = stackTop;
+ },
+ forceAlign: function (target, quantum) {
+ quantum = quantum || 4;
+ if (quantum == 1) return target;
+ if (isNumber(target) && isNumber(quantum)) {
+ return Math.ceil(target/quantum)*quantum;
+ } else if (isNumber(quantum) && isPowerOfTwo(quantum)) {
+ return '(((' +target + ')+' + (quantum-1) + ')&' + -quantum + ')';
+ }
+ return 'Math.ceil((' + target + ')/' + quantum + ')*' + quantum;
+ },
+ isNumberType: function (type) {
+ return type in Runtime.INT_TYPES || type in Runtime.FLOAT_TYPES;
+ },
+ isPointerType: function isPointerType(type) {
+ return type[type.length-1] == '*';
+},
+ isStructType: function isStructType(type) {
+ if (isPointerType(type)) return false;
+ if (isArrayType(type)) return true;
+ if (/<?\{ ?[^}]* ?\}>?/.test(type)) return true; // { i32, i8 } etc. - anonymous struct types
+ // See comment in isStructPointerType()
+ return type[0] == '%';
+},
+ INT_TYPES: {"i1":0,"i8":0,"i16":0,"i32":0,"i64":0},
+ FLOAT_TYPES: {"float":0,"double":0},
+ or64: function (x, y) {
+ var l = (x | 0) | (y | 0);
+ var h = (Math.round(x / 4294967296) | Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ and64: function (x, y) {
+ var l = (x | 0) & (y | 0);
+ var h = (Math.round(x / 4294967296) & Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ xor64: function (x, y) {
+ var l = (x | 0) ^ (y | 0);
+ var h = (Math.round(x / 4294967296) ^ Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ getNativeTypeSize: function (type) {
+ switch (type) {
+ case 'i1': case 'i8': return 1;
+ case 'i16': return 2;
+ case 'i32': return 4;
+ case 'i64': return 8;
+ case 'float': return 4;
+ case 'double': return 8;
+ default: {
+ if (type[type.length-1] === '*') {
+ return Runtime.QUANTUM_SIZE; // A pointer
+ } else if (type[0] === 'i') {
+ var bits = parseInt(type.substr(1));
+ assert(bits % 8 === 0);
+ return bits/8;
+ } else {
+ return 0;
+ }
+ }
+ }
+ },
+ getNativeFieldSize: function (type) {
+ return Math.max(Runtime.getNativeTypeSize(type), Runtime.QUANTUM_SIZE);
+ },
+ dedup: function dedup(items, ident) {
+ var seen = {};
+ if (ident) {
+ return items.filter(function(item) {
+ if (seen[item[ident]]) return false;
+ seen[item[ident]] = true;
+ return true;
+ });
+ } else {
+ return items.filter(function(item) {
+ if (seen[item]) return false;
+ seen[item] = true;
+ return true;
+ });
+ }
+},
+ set: function set() {
+ var args = typeof arguments[0] === 'object' ? arguments[0] : arguments;
+ var ret = {};
+ for (var i = 0; i < args.length; i++) {
+ ret[args[i]] = 0;
+ }
+ return ret;
+},
+ STACK_ALIGN: 8,
+ getAlignSize: function (type, size, vararg) {
+ // we align i64s and doubles on 64-bit boundaries, unlike x86
+ if (!vararg && (type == 'i64' || type == 'double')) return 8;
+ if (!type) return Math.min(size, 8); // align structures internally to 64 bits
+ return Math.min(size || (type ? Runtime.getNativeFieldSize(type) : 0), Runtime.QUANTUM_SIZE);
+ },
+ calculateStructAlignment: function calculateStructAlignment(type) {
+ type.flatSize = 0;
+ type.alignSize = 0;
+ var diffs = [];
+ var prev = -1;
+ var index = 0;
+ type.flatIndexes = type.fields.map(function(field) {
+ index++;
+ var size, alignSize;
+ if (Runtime.isNumberType(field) || Runtime.isPointerType(field)) {
+ size = Runtime.getNativeTypeSize(field); // pack char; char; in structs, also char[X]s.
+ alignSize = Runtime.getAlignSize(field, size);
+ } else if (Runtime.isStructType(field)) {
+ if (field[1] === '0') {
+ // this is [0 x something]. When inside another structure like here, it must be at the end,
+ // and it adds no size
+ // XXX this happens in java-nbody for example... assert(index === type.fields.length, 'zero-length in the middle!');
+ size = 0;
+ if (Types.types[field]) {
+ alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
+ } else {
+ alignSize = type.alignSize || QUANTUM_SIZE;
+ }
+ } else {
+ size = Types.types[field].flatSize;
+ alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
+ }
+ } else if (field[0] == 'b') {
+ // bN, large number field, like a [N x i8]
+ size = field.substr(1)|0;
+ alignSize = 1;
+ } else if (field[0] === '<') {
+ // vector type
+ size = alignSize = Types.types[field].flatSize; // fully aligned
+ } else if (field[0] === 'i') {
+ // illegal integer field, that could not be legalized because it is an internal structure field
+ // it is ok to have such fields, if we just use them as markers of field size and nothing more complex
+ size = alignSize = parseInt(field.substr(1))/8;
+ assert(size % 1 === 0, 'cannot handle non-byte-size field ' + field);
+ } else {
+ assert(false, 'invalid type for calculateStructAlignment');
+ }
+ if (type.packed) alignSize = 1;
+ type.alignSize = Math.max(type.alignSize, alignSize);
+ var curr = Runtime.alignMemory(type.flatSize, alignSize); // if necessary, place this on aligned memory
+ type.flatSize = curr + size;
+ if (prev >= 0) {
+ diffs.push(curr-prev);
+ }
+ prev = curr;
+ return curr;
+ });
+ if (type.name_ && type.name_[0] === '[') {
+ // arrays have 2 elements, so we get the proper difference. then we scale here. that way we avoid
+ // allocating a potentially huge array for [999999 x i8] etc.
+ type.flatSize = parseInt(type.name_.substr(1))*type.flatSize/2;
+ }
+ type.flatSize = Runtime.alignMemory(type.flatSize, type.alignSize);
+ if (diffs.length == 0) {
+ type.flatFactor = type.flatSize;
+ } else if (Runtime.dedup(diffs).length == 1) {
+ type.flatFactor = diffs[0];
+ }
+ type.needsFlattening = (type.flatFactor != 1);
+ return type.flatIndexes;
+ },
+ generateStructInfo: function (struct, typeName, offset) {
+ var type, alignment;
+ if (typeName) {
+ offset = offset || 0;
+ type = (typeof Types === 'undefined' ? Runtime.typeInfo : Types.types)[typeName];
+ if (!type) return null;
+ if (type.fields.length != struct.length) {
+ printErr('Number of named fields must match the type for ' + typeName + ': possibly duplicate struct names. Cannot return structInfo');
+ return null;
+ }
+ alignment = type.flatIndexes;
+ } else {
+ var type = { fields: struct.map(function(item) { return item[0] }) };
+ alignment = Runtime.calculateStructAlignment(type);
+ }
+ var ret = {
+ __size__: type.flatSize
+ };
+ if (typeName) {
+ struct.forEach(function(item, i) {
+ if (typeof item === 'string') {
+ ret[item] = alignment[i] + offset;
+ } else {
+ // embedded struct
+ var key;
+ for (var k in item) key = k;
+ ret[key] = Runtime.generateStructInfo(item[key], type.fields[i], alignment[i]);
+ }
+ });
+ } else {
+ struct.forEach(function(item, i) {
+ ret[item[1]] = alignment[i];
+ });
+ }
+ return ret;
+ },
+ dynCall: function (sig, ptr, args) {
+ if (args && args.length) {
+ if (!args.splice) args = Array.prototype.slice.call(args);
+ args.splice(0, 0, ptr);
+ return Module['dynCall_' + sig].apply(null, args);
+ } else {
+ return Module['dynCall_' + sig].call(null, ptr);
+ }
+ },
+ functionPointers: [],
+ addFunction: function (func) {
+ for (var i = 0; i < Runtime.functionPointers.length; i++) {
+ if (!Runtime.functionPointers[i]) {
+ Runtime.functionPointers[i] = func;
+ return 2*(1 + i);
+ }
+ }
+ throw 'Finished up all reserved function pointers. Use a higher value for RESERVED_FUNCTION_POINTERS.';
+ },
+ removeFunction: function (index) {
+ Runtime.functionPointers[(index-2)/2] = null;
+ },
+ getAsmConst: function (code, numArgs) {
+ // code is a constant string on the heap, so we can cache these
+ if (!Runtime.asmConstCache) Runtime.asmConstCache = {};
+ var func = Runtime.asmConstCache[code];
+ if (func) return func;
+ var args = [];
+ for (var i = 0; i < numArgs; i++) {
+ args.push(String.fromCharCode(36) + i); // $0, $1 etc
+ }
+ var source = Pointer_stringify(code);
+ if (source[0] === '"') {
+ // tolerate EM_ASM("..code..") even though EM_ASM(..code..) is correct
+ if (source.indexOf('"', 1) === source.length-1) {
+ source = source.substr(1, source.length-2);
+ } else {
+ // something invalid happened, e.g. EM_ASM("..code($0)..", input)
+ abort('invalid EM_ASM input |' + source + '|. Please use EM_ASM(..code..) (no quotes) or EM_ASM({ ..code($0).. }, input) (to input values)');
+ }
+ }
+ try {
+ var evalled = eval('(function(' + args.join(',') + '){ ' + source + ' })'); // new Function does not allow upvars in node
+ } catch(e) {
+ Module.printErr('error in executing inline EM_ASM code: ' + e + ' on: \n\n' + source + '\n\nwith args |' + args + '| (make sure to use the right one out of EM_ASM, EM_ASM_ARGS, etc.)');
+ throw e;
+ }
+ return Runtime.asmConstCache[code] = evalled;
+ },
+ warnOnce: function (text) {
+ if (!Runtime.warnOnce.shown) Runtime.warnOnce.shown = {};
+ if (!Runtime.warnOnce.shown[text]) {
+ Runtime.warnOnce.shown[text] = 1;
+ Module.printErr(text);
+ }
+ },
+ funcWrappers: {},
+ getFuncWrapper: function (func, sig) {
+ assert(sig);
+ if (!Runtime.funcWrappers[func]) {
+ Runtime.funcWrappers[func] = function dynCall_wrapper() {
+ return Runtime.dynCall(sig, func, arguments);
+ };
+ }
+ return Runtime.funcWrappers[func];
+ },
+ UTF8Processor: function () {
+ var buffer = [];
+ var needed = 0;
+ this.processCChar = function (code) {
+ code = code & 0xFF;
+
+ if (buffer.length == 0) {
+ if ((code & 0x80) == 0x00) { // 0xxxxxxx
+ return String.fromCharCode(code);
+ }
+ buffer.push(code);
+ if ((code & 0xE0) == 0xC0) { // 110xxxxx
+ needed = 1;
+ } else if ((code & 0xF0) == 0xE0) { // 1110xxxx
+ needed = 2;
+ } else { // 11110xxx
+ needed = 3;
+ }
+ return '';
+ }
+
+ if (needed) {
+ buffer.push(code);
+ needed--;
+ if (needed > 0) return '';
+ }
+
+ var c1 = buffer[0];
+ var c2 = buffer[1];
+ var c3 = buffer[2];
+ var c4 = buffer[3];
+ var ret;
+ if (buffer.length == 2) {
+ ret = String.fromCharCode(((c1 & 0x1F) << 6) | (c2 & 0x3F));
+ } else if (buffer.length == 3) {
+ ret = String.fromCharCode(((c1 & 0x0F) << 12) | ((c2 & 0x3F) << 6) | (c3 & 0x3F));
+ } else {
+ // http://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae
+ var codePoint = ((c1 & 0x07) << 18) | ((c2 & 0x3F) << 12) |
+ ((c3 & 0x3F) << 6) | (c4 & 0x3F);
+ ret = String.fromCharCode(
+ Math.floor((codePoint - 0x10000) / 0x400) + 0xD800,
+ (codePoint - 0x10000) % 0x400 + 0xDC00);
+ }
+ buffer.length = 0;
+ return ret;
+ }
+ this.processJSString = function processJSString(string) {
+ /* TODO: use TextEncoder when present,
+ var encoder = new TextEncoder();
+ encoder['encoding'] = "utf-8";
+ var utf8Array = encoder['encode'](aMsg.data);
+ */
+ string = unescape(encodeURIComponent(string));
+ var ret = [];
+ for (var i = 0; i < string.length; i++) {
+ ret.push(string.charCodeAt(i));
+ }
+ return ret;
+ }
+ },
+ getCompilerSetting: function (name) {
+ throw 'You must build with -s RETAIN_COMPILER_SETTINGS=1 for Runtime.getCompilerSetting or emscripten_get_compiler_setting to work';
+ },
+ stackAlloc: function (size) { var ret = STACKTOP;STACKTOP = (STACKTOP + size)|0;STACKTOP = (((STACKTOP)+7)&-8); return ret; },
+ staticAlloc: function (size) { var ret = STATICTOP;STATICTOP = (STATICTOP + size)|0;STATICTOP = (((STATICTOP)+7)&-8); return ret; },
+ dynamicAlloc: function (size) { var ret = DYNAMICTOP;DYNAMICTOP = (DYNAMICTOP + size)|0;DYNAMICTOP = (((DYNAMICTOP)+7)&-8); if (DYNAMICTOP >= TOTAL_MEMORY) enlargeMemory();; return ret; },
+ alignMemory: function (size,quantum) { var ret = size = Math.ceil((size)/(quantum ? quantum : 8))*(quantum ? quantum : 8); return ret; },
+ makeBigInt: function (low,high,unsigned) { var ret = (unsigned ? ((+((low>>>0)))+((+((high>>>0)))*(+4294967296))) : ((+((low>>>0)))+((+((high|0)))*(+4294967296)))); return ret; },
+ GLOBAL_BASE: 8,
+ QUANTUM_SIZE: 4,
+ __dummy__: 0
+}
+
+
+Module['Runtime'] = Runtime;
+
+
+
+
+
+
+
+
+
+//========================================
+// Runtime essentials
+//========================================
+
+var __THREW__ = 0; // Used in checking for thrown exceptions.
+
+var ABORT = false; // whether we are quitting the application. no code should run after this. set in exit() and abort()
+var EXITSTATUS = 0;
+
+var undef = 0;
+// tempInt is used for 32-bit signed values or smaller. tempBigInt is used
+// for 32-bit unsigned values or more than 32 bits. TODO: audit all uses of tempInt
+var tempValue, tempInt, tempBigInt, tempInt2, tempBigInt2, tempPair, tempBigIntI, tempBigIntR, tempBigIntS, tempBigIntP, tempBigIntD, tempDouble, tempFloat;
+var tempI64, tempI64b;
+var tempRet0, tempRet1, tempRet2, tempRet3, tempRet4, tempRet5, tempRet6, tempRet7, tempRet8, tempRet9;
+
+function assert(condition, text) {
+ if (!condition) {
+ abort('Assertion failed: ' + text);
+ }
+}
+
+var globalScope = this;
+
+// C calling interface. A convenient way to call C functions (in C files, or
+// defined with extern "C").
+//
+// Note: LLVM optimizations can inline and remove functions, after which you will not be
+// able to call them. Closure can also do so. To avoid that, add your function to
+// the exports using something like
+//
+// -s EXPORTED_FUNCTIONS='["_main", "_myfunc"]'
+//
+// @param ident The name of the C function (note that C++ functions will be name-mangled - use extern "C")
+// @param returnType The return type of the function, one of the JS types 'number', 'string' or 'array' (use 'number' for any C pointer, and
+// 'array' for JavaScript arrays and typed arrays; note that arrays are 8-bit).
+// @param argTypes An array of the types of arguments for the function (if there are no arguments, this can be ommitted). Types are as in returnType,
+// except that 'array' is not possible (there is no way for us to know the length of the array)
+// @param args An array of the arguments to the function, as native JS values (as in returnType)
+// Note that string arguments will be stored on the stack (the JS string will become a C string on the stack).
+// @return The return value, as a native JS value (as in returnType)
+function ccall(ident, returnType, argTypes, args) {
+ return ccallFunc(getCFunc(ident), returnType, argTypes, args);
+}
+Module["ccall"] = ccall;
+
+// Returns the C function with a specified identifier (for C++, you need to do manual name mangling)
+function getCFunc(ident) {
+ try {
+ var func = Module['_' + ident]; // closure exported function
+ if (!func) func = eval('_' + ident); // explicit lookup
+ } catch(e) {
+ }
+ assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');
+ return func;
+}
+
+// Internal function that does a C call using a function, not an identifier
+function ccallFunc(func, returnType, argTypes, args) {
+ var stack = 0;
+ function toC(value, type) {
+ if (type == 'string') {
+ if (value === null || value === undefined || value === 0) return 0; // null string
+ value = intArrayFromString(value);
+ type = 'array';
+ }
+ if (type == 'array') {
+ if (!stack) stack = Runtime.stackSave();
+ var ret = Runtime.stackAlloc(value.length);
+ writeArrayToMemory(value, ret);
+ return ret;
+ }
+ return value;
+ }
+ function fromC(value, type) {
+ if (type == 'string') {
+ return Pointer_stringify(value);
+ }
+ assert(type != 'array');
+ return value;
+ }
+ var i = 0;
+ var cArgs = args ? args.map(function(arg) {
+ return toC(arg, argTypes[i++]);
+ }) : [];
+ var ret = fromC(func.apply(null, cArgs), returnType);
+ if (stack) Runtime.stackRestore(stack);
+ return ret;
+}
+
+// Returns a native JS wrapper for a C function. This is similar to ccall, but
+// returns a function you can call repeatedly in a normal way. For example:
+//
+// var my_function = cwrap('my_c_function', 'number', ['number', 'number']);
+// alert(my_function(5, 22));
+// alert(my_function(99, 12));
+//
+function cwrap(ident, returnType, argTypes) {
+ var func = getCFunc(ident);
+ return function() {
+ return ccallFunc(func, returnType, argTypes, Array.prototype.slice.call(arguments));
+ }
+}
+Module["cwrap"] = cwrap;
+
+// Sets a value in memory in a dynamic way at run-time. Uses the
+// type data. This is the same as makeSetValue, except that
+// makeSetValue is done at compile-time and generates the needed
+// code then, whereas this function picks the right code at
+// run-time.
+// Note that setValue and getValue only do *aligned* writes and reads!
+// Note that ccall uses JS types as for defining types, while setValue and
+// getValue need LLVM types ('i8', 'i32') - this is a lower-level operation
+function setValue(ptr, value, type, noSafe) {
+ type = type || 'i8';
+ if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
+ switch(type) {
+ case 'i1': HEAP8[(ptr)]=value; break;
+ case 'i8': HEAP8[(ptr)]=value; break;
+ case 'i16': HEAP16[((ptr)>>1)]=value; break;
+ case 'i32': HEAP32[((ptr)>>2)]=value; break;
+ case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;
+ case 'float': HEAPF32[((ptr)>>2)]=value; break;
+ case 'double': HEAPF64[((ptr)>>3)]=value; break;
+ default: abort('invalid type for setValue: ' + type);
+ }
+}
+Module['setValue'] = setValue;
+
+// Parallel to setValue.
+function getValue(ptr, type, noSafe) {
+ type = type || 'i8';
+ if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
+ switch(type) {
+ case 'i1': return HEAP8[(ptr)];
+ case 'i8': return HEAP8[(ptr)];
+ case 'i16': return HEAP16[((ptr)>>1)];
+ case 'i32': return HEAP32[((ptr)>>2)];
+ case 'i64': return HEAP32[((ptr)>>2)];
+ case 'float': return HEAPF32[((ptr)>>2)];
+ case 'double': return HEAPF64[((ptr)>>3)];
+ default: abort('invalid type for setValue: ' + type);
+ }
+ return null;
+}
+Module['getValue'] = getValue;
+
+var ALLOC_NORMAL = 0; // Tries to use _malloc()
+var ALLOC_STACK = 1; // Lives for the duration of the current function call
+var ALLOC_STATIC = 2; // Cannot be freed
+var ALLOC_DYNAMIC = 3; // Cannot be freed except through sbrk
+var ALLOC_NONE = 4; // Do not allocate
+Module['ALLOC_NORMAL'] = ALLOC_NORMAL;
+Module['ALLOC_STACK'] = ALLOC_STACK;
+Module['ALLOC_STATIC'] = ALLOC_STATIC;
+Module['ALLOC_DYNAMIC'] = ALLOC_DYNAMIC;
+Module['ALLOC_NONE'] = ALLOC_NONE;
+
+// allocate(): This is for internal use. You can use it yourself as well, but the interface
+// is a little tricky (see docs right below). The reason is that it is optimized
+// for multiple syntaxes to save space in generated code. So you should
+// normally not use allocate(), and instead allocate memory using _malloc(),
+// initialize it with setValue(), and so forth.
+// @slab: An array of data, or a number. If a number, then the size of the block to allocate,
+// in *bytes* (note that this is sometimes confusing: the next parameter does not
+// affect this!)
+// @types: Either an array of types, one for each byte (or 0 if no type at that position),
+// or a single type which is used for the entire block. This only matters if there
+// is initial data - if @slab is a number, then this does not matter at all and is
+// ignored.
+// @allocator: How to allocate memory, see ALLOC_*
+function allocate(slab, types, allocator, ptr) {
+ var zeroinit, size;
+ if (typeof slab === 'number') {
+ zeroinit = true;
+ size = slab;
+ } else {
+ zeroinit = false;
+ size = slab.length;
+ }
+
+ var singleType = typeof types === 'string' ? types : null;
+
+ var ret;
+ if (allocator == ALLOC_NONE) {
+ ret = ptr;
+ } else {
+ ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));
+ }
+
+ if (zeroinit) {
+ var ptr = ret, stop;
+ assert((ret & 3) == 0);
+ stop = ret + (size & ~3);
+ for (; ptr < stop; ptr += 4) {
+ HEAP32[((ptr)>>2)]=0;
+ }
+ stop = ret + size;
+ while (ptr < stop) {
+ HEAP8[((ptr++)|0)]=0;
+ }
+ return ret;
+ }
+
+ if (singleType === 'i8') {
+ if (slab.subarray || slab.slice) {
+ HEAPU8.set(slab, ret);
+ } else {
+ HEAPU8.set(new Uint8Array(slab), ret);
+ }
+ return ret;
+ }
+
+ var i = 0, type, typeSize, previousType;
+ while (i < size) {
+ var curr = slab[i];
+
+ if (typeof curr === 'function') {
+ curr = Runtime.getFunctionIndex(curr);
+ }
+
+ type = singleType || types[i];
+ if (type === 0) {
+ i++;
+ continue;
+ }
+
+ if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later
+
+ setValue(ret+i, curr, type);
+
+ // no need to look up size unless type changes, so cache it
+ if (previousType !== type) {
+ typeSize = Runtime.getNativeTypeSize(type);
+ previousType = type;
+ }
+ i += typeSize;
+ }
+
+ return ret;
+}
+Module['allocate'] = allocate;
+
+function Pointer_stringify(ptr, /* optional */ length) {
+ // TODO: use TextDecoder
+ // Find the length, and check for UTF while doing so
+ var hasUtf = false;
+ var t;
+ var i = 0;
+ while (1) {
+ t = HEAPU8[(((ptr)+(i))|0)];
+ if (t >= 128) hasUtf = true;
+ else if (t == 0 && !length) break;
+ i++;
+ if (length && i == length) break;
+ }
+ if (!length) length = i;
+
+ var ret = '';
+
+ if (!hasUtf) {
+ var MAX_CHUNK = 1024; // split up into chunks, because .apply on a huge string can overflow the stack
+ var curr;
+ while (length > 0) {
+ curr = String.fromCharCode.apply(String, HEAPU8.subarray(ptr, ptr + Math.min(length, MAX_CHUNK)));
+ ret = ret ? ret + curr : curr;
+ ptr += MAX_CHUNK;
+ length -= MAX_CHUNK;
+ }
+ return ret;
+ }
+
+ var utf8 = new Runtime.UTF8Processor();
+ for (i = 0; i < length; i++) {
+ t = HEAPU8[(((ptr)+(i))|0)];
+ ret += utf8.processCChar(t);
+ }
+ return ret;
+}
+Module['Pointer_stringify'] = Pointer_stringify;
+
+// Given a pointer 'ptr' to a null-terminated UTF16LE-encoded string in the emscripten HEAP, returns
+// a copy of that string as a Javascript String object.
+function UTF16ToString(ptr) {
+ var i = 0;
+
+ var str = '';
+ while (1) {
+ var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];
+ if (codeUnit == 0)
+ return str;
+ ++i;
+ // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.
+ str += String.fromCharCode(codeUnit);
+ }
+}
+Module['UTF16ToString'] = UTF16ToString;
+
+// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
+// null-terminated and encoded in UTF16LE form. The copy will require at most (str.length*2+1)*2 bytes of space in the HEAP.
+function stringToUTF16(str, outPtr) {
+ for(var i = 0; i < str.length; ++i) {
+ // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.
+ var codeUnit = str.charCodeAt(i); // possibly a lead surrogate
+ HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;
+ }
+ // Null-terminate the pointer to the HEAP.
+ HEAP16[(((outPtr)+(str.length*2))>>1)]=0;
+}
+Module['stringToUTF16'] = stringToUTF16;
+
+// Given a pointer 'ptr' to a null-terminated UTF32LE-encoded string in the emscripten HEAP, returns
+// a copy of that string as a Javascript String object.
+function UTF32ToString(ptr) {
+ var i = 0;
+
+ var str = '';
+ while (1) {
+ var utf32 = HEAP32[(((ptr)+(i*4))>>2)];
+ if (utf32 == 0)
+ return str;
+ ++i;
+ // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.
+ if (utf32 >= 0x10000) {
+ var ch = utf32 - 0x10000;
+ str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));
+ } else {
+ str += String.fromCharCode(utf32);
+ }
+ }
+}
+Module['UTF32ToString'] = UTF32ToString;
+
+// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
+// null-terminated and encoded in UTF32LE form. The copy will require at most (str.length+1)*4 bytes of space in the HEAP,
+// but can use less, since str.length does not return the number of characters in the string, but the number of UTF-16 code units in the string.
+function stringToUTF32(str, outPtr) {
+ var iChar = 0;
+ for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {
+ // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.
+ var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate
+ if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {
+ var trailSurrogate = str.charCodeAt(++iCodeUnit);
+ codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);
+ }
+ HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;
+ ++iChar;
+ }
+ // Null-terminate the pointer to the HEAP.
+ HEAP32[(((outPtr)+(iChar*4))>>2)]=0;
+}
+Module['stringToUTF32'] = stringToUTF32;
+
+function demangle(func) {
+ var i = 3;
+ // params, etc.
+ var basicTypes = {
+ 'v': 'void',
+ 'b': 'bool',
+ 'c': 'char',
+ 's': 'short',
+ 'i': 'int',
+ 'l': 'long',
+ 'f': 'float',
+ 'd': 'double',
+ 'w': 'wchar_t',
+ 'a': 'signed char',
+ 'h': 'unsigned char',
+ 't': 'unsigned short',
+ 'j': 'unsigned int',
+ 'm': 'unsigned long',
+ 'x': 'long long',
+ 'y': 'unsigned long long',
+ 'z': '...'
+ };
+ var subs = [];
+ var first = true;
+ function dump(x) {
+ //return;
+ if (x) Module.print(x);
+ Module.print(func);
+ var pre = '';
+ for (var a = 0; a < i; a++) pre += ' ';
+ Module.print (pre + '^');
+ }
+ function parseNested() {
+ i++;
+ if (func[i] === 'K') i++; // ignore const
+ var parts = [];
+ while (func[i] !== 'E') {
+ if (func[i] === 'S') { // substitution
+ i++;
+ var next = func.indexOf('_', i);
+ var num = func.substring(i, next) || 0;
+ parts.push(subs[num] || '?');
+ i = next+1;
+ continue;
+ }
+ if (func[i] === 'C') { // constructor
+ parts.push(parts[parts.length-1]);
+ i += 2;
+ continue;
+ }
+ var size = parseInt(func.substr(i));
+ var pre = size.toString().length;
+ if (!size || !pre) { i--; break; } // counter i++ below us
+ var curr = func.substr(i + pre, size);
+ parts.push(curr);
+ subs.push(curr);
+ i += pre + size;
+ }
+ i++; // skip E
+ return parts;
+ }
+ function parse(rawList, limit, allowVoid) { // main parser
+ limit = limit || Infinity;
+ var ret = '', list = [];
+ function flushList() {
+ return '(' + list.join(', ') + ')';
+ }
+ var name;
+ if (func[i] === 'N') {
+ // namespaced N-E
+ name = parseNested().join('::');
+ limit--;
+ if (limit === 0) return rawList ? [name] : name;
+ } else {
+ // not namespaced
+ if (func[i] === 'K' || (first && func[i] === 'L')) i++; // ignore const and first 'L'
+ var size = parseInt(func.substr(i));
+ if (size) {
+ var pre = size.toString().length;
+ name = func.substr(i + pre, size);
+ i += pre + size;
+ }
+ }
+ first = false;
+ if (func[i] === 'I') {
+ i++;
+ var iList = parse(true);
+ var iRet = parse(true, 1, true);
+ ret += iRet[0] + ' ' + name + '<' + iList.join(', ') + '>';
+ } else {
+ ret = name;
+ }
+ paramLoop: while (i < func.length && limit-- > 0) {
+ //dump('paramLoop');
+ var c = func[i++];
+ if (c in basicTypes) {
+ list.push(basicTypes[c]);
+ } else {
+ switch (c) {
+ case 'P': list.push(parse(true, 1, true)[0] + '*'); break; // pointer
+ case 'R': list.push(parse(true, 1, true)[0] + '&'); break; // reference
+ case 'L': { // literal
+ i++; // skip basic type
+ var end = func.indexOf('E', i);
+ var size = end - i;
+ list.push(func.substr(i, size));
+ i += size + 2; // size + 'EE'
+ break;
+ }
+ case 'A': { // array
+ var size = parseInt(func.substr(i));
+ i += size.toString().length;
+ if (func[i] !== '_') throw '?';
+ i++; // skip _
+ list.push(parse(true, 1, true)[0] + ' [' + size + ']');
+ break;
+ }
+ case 'E': break paramLoop;
+ default: ret += '?' + c; break paramLoop;
+ }
+ }
+ }
+ if (!allowVoid && list.length === 1 && list[0] === 'void') list = []; // avoid (void)
+ if (rawList) {
+ if (ret) {
+ list.push(ret + '?');
+ }
+ return list;
+ } else {
+ return ret + flushList();
+ }
+ }
+ try {
+ // Special-case the entry point, since its name differs from other name mangling.
+ if (func == 'Object._main' || func == '_main') {
+ return 'main()';
+ }
+ if (typeof func === 'number') func = Pointer_stringify(func);
+ if (func[0] !== '_') return func;
+ if (func[1] !== '_') return func; // C function
+ if (func[2] !== 'Z') return func;
+ switch (func[3]) {
+ case 'n': return 'operator new()';
+ case 'd': return 'operator delete()';
+ }
+ return parse();
+ } catch(e) {
+ return func;
+ }
+}
+
+function demangleAll(text) {
+ return text.replace(/__Z[\w\d_]+/g, function(x) { var y = demangle(x); return x === y ? x : (x + ' [' + y + ']') });
+}
+
+function stackTrace() {
+ var stack = new Error().stack;
+ return stack ? demangleAll(stack) : '(no stack trace available)'; // Stack trace is not available at least on IE10 and Safari 6.
+}
+
+// Memory management
+
+var PAGE_SIZE = 4096;
+function alignMemoryPage(x) {
+ return (x+4095)&-4096;
+}
+
+var HEAP;
+var HEAP8, HEAPU8, HEAP16, HEAPU16, HEAP32, HEAPU32, HEAPF32, HEAPF64;
+
+var STATIC_BASE = 0, STATICTOP = 0, staticSealed = false; // static area
+var STACK_BASE = 0, STACKTOP = 0, STACK_MAX = 0; // stack area
+var DYNAMIC_BASE = 0, DYNAMICTOP = 0; // dynamic area handled by sbrk
+
+function enlargeMemory() {
+ abort('Cannot enlarge memory arrays. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value ' + TOTAL_MEMORY + ', (2) compile with ALLOW_MEMORY_GROWTH which adjusts the size at runtime but prevents some optimizations, or (3) set Module.TOTAL_MEMORY before the program runs.');
+}
+
+var TOTAL_STACK = Module['TOTAL_STACK'] || 5242880;
+var TOTAL_MEMORY = Module['TOTAL_MEMORY'] || 134217728;
+var FAST_MEMORY = Module['FAST_MEMORY'] || 2097152;
+
+var totalMemory = 4096;
+while (totalMemory < TOTAL_MEMORY || totalMemory < 2*TOTAL_STACK) {
+ if (totalMemory < 16*1024*1024) {
+ totalMemory *= 2;
+ } else {
+ totalMemory += 16*1024*1024
+ }
+}
+if (totalMemory !== TOTAL_MEMORY) {
+ Module.printErr('increasing TOTAL_MEMORY to ' + totalMemory + ' to be more reasonable');
+ TOTAL_MEMORY = totalMemory;
+}
+
+// Initialize the runtime's memory
+// check for full engine support (use string 'subarray' to avoid closure compiler confusion)
+assert(typeof Int32Array !== 'undefined' && typeof Float64Array !== 'undefined' && !!(new Int32Array(1)['subarray']) && !!(new Int32Array(1)['set']),
+ 'JS engine does not provide full typed array support');
+
+var buffer = new ArrayBuffer(TOTAL_MEMORY);
+HEAP8 = new Int8Array(buffer);
+HEAP16 = new Int16Array(buffer);
+HEAP32 = new Int32Array(buffer);
+HEAPU8 = new Uint8Array(buffer);
+HEAPU16 = new Uint16Array(buffer);
+HEAPU32 = new Uint32Array(buffer);
+HEAPF32 = new Float32Array(buffer);
+HEAPF64 = new Float64Array(buffer);
+
+// Endianness check (note: assumes compiler arch was little-endian)
+HEAP32[0] = 255;
+assert(HEAPU8[0] === 255 && HEAPU8[3] === 0, 'Typed arrays 2 must be run on a little-endian system');
+
+Module['HEAP'] = HEAP;
+Module['HEAP8'] = HEAP8;
+Module['HEAP16'] = HEAP16;
+Module['HEAP32'] = HEAP32;
+Module['HEAPU8'] = HEAPU8;
+Module['HEAPU16'] = HEAPU16;
+Module['HEAPU32'] = HEAPU32;
+Module['HEAPF32'] = HEAPF32;
+Module['HEAPF64'] = HEAPF64;
+
+function callRuntimeCallbacks(callbacks) {
+ while(callbacks.length > 0) {
+ var callback = callbacks.shift();
+ if (typeof callback == 'function') {
+ callback();
+ continue;
+ }
+ var func = callback.func;
+ if (typeof func === 'number') {
+ if (callback.arg === undefined) {
+ Runtime.dynCall('v', func);
+ } else {
+ Runtime.dynCall('vi', func, [callback.arg]);
+ }
+ } else {
+ func(callback.arg === undefined ? null : callback.arg);
+ }
+ }
+}
+
+var __ATPRERUN__ = []; // functions called before the runtime is initialized
+var __ATINIT__ = []; // functions called during startup
+var __ATMAIN__ = []; // functions called when main() is to be run
+var __ATEXIT__ = []; // functions called during shutdown
+var __ATPOSTRUN__ = []; // functions called after the runtime has exited
+
+var runtimeInitialized = false;
+
+function preRun() {
+ // compatibility - merge in anything from Module['preRun'] at this time
+ if (Module['preRun']) {
+ if (typeof Module['preRun'] == 'function') Module['preRun'] = [Module['preRun']];
+ while (Module['preRun'].length) {
+ addOnPreRun(Module['preRun'].shift());
+ }
+ }
+ callRuntimeCallbacks(__ATPRERUN__);
+}
+
+function ensureInitRuntime() {
+ if (runtimeInitialized) return;
+ runtimeInitialized = true;
+ callRuntimeCallbacks(__ATINIT__);
+}
+
+function preMain() {
+ callRuntimeCallbacks(__ATMAIN__);
+}
+
+function exitRuntime() {
+ callRuntimeCallbacks(__ATEXIT__);
+}
+
+function postRun() {
+ // compatibility - merge in anything from Module['postRun'] at this time
+ if (Module['postRun']) {
+ if (typeof Module['postRun'] == 'function') Module['postRun'] = [Module['postRun']];
+ while (Module['postRun'].length) {
+ addOnPostRun(Module['postRun'].shift());
+ }
+ }
+ callRuntimeCallbacks(__ATPOSTRUN__);
+}
+
+function addOnPreRun(cb) {
+ __ATPRERUN__.unshift(cb);
+}
+Module['addOnPreRun'] = Module.addOnPreRun = addOnPreRun;
+
+function addOnInit(cb) {
+ __ATINIT__.unshift(cb);
+}
+Module['addOnInit'] = Module.addOnInit = addOnInit;
+
+function addOnPreMain(cb) {
+ __ATMAIN__.unshift(cb);
+}
+Module['addOnPreMain'] = Module.addOnPreMain = addOnPreMain;
+
+function addOnExit(cb) {
+ __ATEXIT__.unshift(cb);
+}
+Module['addOnExit'] = Module.addOnExit = addOnExit;
+
+function addOnPostRun(cb) {
+ __ATPOSTRUN__.unshift(cb);
+}
+Module['addOnPostRun'] = Module.addOnPostRun = addOnPostRun;
+
+// Tools
+
+// This processes a JS string into a C-line array of numbers, 0-terminated.
+// For LLVM-originating strings, see parser.js:parseLLVMString function
+function intArrayFromString(stringy, dontAddNull, length /* optional */) {
+ var ret = (new Runtime.UTF8Processor()).processJSString(stringy);
+ if (length) {
+ ret.length = length;
+ }
+ if (!dontAddNull) {
+ ret.push(0);
+ }
+ return ret;
+}
+Module['intArrayFromString'] = intArrayFromString;
+
+function intArrayToString(array) {
+ var ret = [];
+ for (var i = 0; i < array.length; i++) {
+ var chr = array[i];
+ if (chr > 0xFF) {
+ chr &= 0xFF;
+ }
+ ret.push(String.fromCharCode(chr));
+ }
+ return ret.join('');
+}
+Module['intArrayToString'] = intArrayToString;
+
+// Write a Javascript array to somewhere in the heap
+function writeStringToMemory(string, buffer, dontAddNull) {
+ var array = intArrayFromString(string, dontAddNull);
+ var i = 0;
+ while (i < array.length) {
+ var chr = array[i];
+ HEAP8[(((buffer)+(i))|0)]=chr;
+ i = i + 1;
+ }
+}
+Module['writeStringToMemory'] = writeStringToMemory;
+
+function writeArrayToMemory(array, buffer) {
+ for (var i = 0; i < array.length; i++) {
+ HEAP8[(((buffer)+(i))|0)]=array[i];
+ }
+}
+Module['writeArrayToMemory'] = writeArrayToMemory;
+
+function writeAsciiToMemory(str, buffer, dontAddNull) {
+ for (var i = 0; i < str.length; i++) {
+ HEAP8[(((buffer)+(i))|0)]=str.charCodeAt(i);
+ }
+ if (!dontAddNull) HEAP8[(((buffer)+(str.length))|0)]=0;
+}
+Module['writeAsciiToMemory'] = writeAsciiToMemory;
+
+function unSign(value, bits, ignore) {
+ if (value >= 0) {
+ return value;
+ }
+ return bits <= 32 ? 2*Math.abs(1 << (bits-1)) + value // Need some trickery, since if bits == 32, we are right at the limit of the bits JS uses in bitshifts
+ : Math.pow(2, bits) + value;
+}
+function reSign(value, bits, ignore) {
+ if (value <= 0) {
+ return value;
+ }
+ var half = bits <= 32 ? Math.abs(1 << (bits-1)) // abs is needed if bits == 32
+ : Math.pow(2, bits-1);
+ if (value >= half && (bits <= 32 || value > half)) { // for huge values, we can hit the precision limit and always get true here. so don't do that
+ // but, in general there is no perfect solution here. With 64-bit ints, we get rounding and errors
+ // TODO: In i64 mode 1, resign the two parts separately and safely
+ value = -2*half + value; // Cannot bitshift half, as it may be at the limit of the bits JS uses in bitshifts
+ }
+ return value;
+}
+
+// check for imul support, and also for correctness ( https://bugs.webkit.org/show_bug.cgi?id=126345 )
+if (!Math['imul'] || Math['imul'](0xffffffff, 5) !== -5) Math['imul'] = function imul(a, b) {
+ var ah = a >>> 16;
+ var al = a & 0xffff;
+ var bh = b >>> 16;
+ var bl = b & 0xffff;
+ return (al*bl + ((ah*bl + al*bh) << 16))|0;
+};
+Math.imul = Math['imul'];
+
+
+var Math_abs = Math.abs;
+var Math_cos = Math.cos;
+var Math_sin = Math.sin;
+var Math_tan = Math.tan;
+var Math_acos = Math.acos;
+var Math_asin = Math.asin;
+var Math_atan = Math.atan;
+var Math_atan2 = Math.atan2;
+var Math_exp = Math.exp;
+var Math_log = Math.log;
+var Math_sqrt = Math.sqrt;
+var Math_ceil = Math.ceil;
+var Math_floor = Math.floor;
+var Math_pow = Math.pow;
+var Math_imul = Math.imul;
+var Math_fround = Math.fround;
+var Math_min = Math.min;
+
+// A counter of dependencies for calling run(). If we need to
+// do asynchronous work before running, increment this and
+// decrement it. Incrementing must happen in a place like
+// PRE_RUN_ADDITIONS (used by emcc to add file preloading).
+// Note that you can add dependencies in preRun, even though
+// it happens right before run - run will be postponed until
+// the dependencies are met.
+var runDependencies = 0;
+var runDependencyWatcher = null;
+var dependenciesFulfilled = null; // overridden to take different actions when all run dependencies are fulfilled
+
+function addRunDependency(id) {
+ runDependencies++;
+ if (Module['monitorRunDependencies']) {
+ Module['monitorRunDependencies'](runDependencies);
+ }
+}
+Module['addRunDependency'] = addRunDependency;
+function removeRunDependency(id) {
+ runDependencies--;
+ if (Module['monitorRunDependencies']) {
+ Module['monitorRunDependencies'](runDependencies);
+ }
+ if (runDependencies == 0) {
+ if (runDependencyWatcher !== null) {
+ clearInterval(runDependencyWatcher);
+ runDependencyWatcher = null;
+ }
+ if (dependenciesFulfilled) {
+ var callback = dependenciesFulfilled;
+ dependenciesFulfilled = null;
+ callback(); // can add another dependenciesFulfilled
+ }
+ }
+}
+Module['removeRunDependency'] = removeRunDependency;
+
+Module["preloadedImages"] = {}; // maps url to image data
+Module["preloadedAudios"] = {}; // maps url to audio data
+
+
+var memoryInitializer = null;
+
+// === Body ===
+var __ZTVN10__cxxabiv117__class_type_infoE = 7024;
+var __ZTVN10__cxxabiv120__si_class_type_infoE = 7064;
+
+
+
+
+STATIC_BASE = 8;
+
+STATICTOP = STATIC_BASE + Runtime.alignMemory(7731);
+/* global initializers */ __ATINIT__.push();
+
+
+/* memory initializer */ allocate([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,232,118,72,0,0,0,0,255,255,255,255,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,101,114,114,111,114,58,32,37,100,92,110,0,0,0,0,0,102,114,97,109,101,32,97,118,101,114,97,103,101,115,58,32,37,46,51,102,32,43,45,32,37,46,51,102,44,32,114,97,110,103,101,58,32,37,46,51,102,32,116,111,32,37,46,51,102,32,10,0,0,0,0,0,105,102,32,40,77,111,100,117,108,101,46,114,101,112,111,114,116,67,111,109,112,108,101,116,105,111,110,41,32,77,111,100,117,108,101,46,114,101,112,111,114,116,67,111,109,112,108,101,116,105,111,110,40,41,0,0,114,101,115,112,111,110,115,105,118,101,32,109,97,105,110,32,108,111,111,112,0,0,0,0,0,0,0,0,56,1,0,0,1,0,0,0,2,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,49,49,98,50,69,100,103,101,83,104,97,112,101,0,0,0,55,98,50,83,104,97,112,101,0,0,0,0,0,0,0,0,120,27,0,0,32,1,0,0,160,27,0,0,16,1,0,0,48,1,0,0,0,0,0,0,66,111,120,50,68,47,67,111,108,108,105,115,105,111,110,47,83,104,97,112,101,115,47,98,50,80,111,108,121,103,111,110,83,104,97,112,101,46,99,112,112,0,0,0,0,0,0,0,48,46,48,102,32,60,61,32,108,111,119,101,114,32,38,38,32,108,111,119,101,114,32,60,61,32,105,110,112,117,116,46,109,97,120,70,114,97,99,116,105,111,110,0,0,0,0,0,82,97,121,67,97,115,116,0,109,95,118,101,114,116,101,120,67,111,117,110,116,32,62,61,32,51,0,0,0,0,0,0,67,111,109,112,117,116,101,77,97,115,115,0,0,0,0,0,97,114,101,97,32,62,32,49,46,49,57,50,48,57,50,57,48,101,45,48,55,70,0,0,0,0,0,0,48,2,0,0,3,0,0,0,4,0,0,0,2,0,0,0,2,0,0,0,2,0,0,0,2,0,0,0,2,0,0,0,2,0,0,0,49,52,98,50,80,111,108,121,103,111,110,83,104,97,112,101,0,0,0,0,0,0,0,0,160,27,0,0,24,2,0,0,48,1,0,0,0,0,0,0,16,0,0,0,32,0,0,0,64,0,0,0,96,0,0,0,128,0,0,0,160,0,0,0,192,0,0,0,224,0,0,0,0,1,0,0,64,1,0,0,128,1,0,0,192,1,0,0,0,2,0,0,128,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,106,32,60,32,98,50,95,98,108,111,99,107,83,105,122,101,115,0,0,0,0,0,0,0,66,111,120,50,68,47,67,111,109,109,111,110,47,98,50,66,108,111,99,107,65,108,108,111,99,97,116,111,114,46,99,112,112,0,0,0,0,0,0,0,98,50,66,108,111,99,107,65,108,108,111,99,97,116,111,114,0,0,0,0,0,0,0,0,48,32,60,32,115,105,122,101,0,0,0,0,0,0,0,0,65,108,108,111,99,97,116,101,0,0,0,0,0,0,0,0,48,32,60,61,32,105,110,100,101,120,32,38,38,32,105,110,100,101,120,32,60,32,98,50,95,98,108,111,99,107,83,105,122,101,115,0,0,0,0,0,98,108,111,99,107,67,111,117,110,116,32,42,32,98,108,111,99,107,83,105,122,101,32,60,61,32,98,50,95,99,104,117,110,107,83,105,122,101,0,0,70,114,101,101,0,0,0,0,98,100,45,62,112,111,115,105,116,105,111,110,46,73,115,86,97,108,105,100,40,41,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,98,50,66,111,100,121,46,99,112,112,0,0,0,0,0,0,0,98,50,66,111,100,121,0,0,98,100,45,62,108,105,110,101,97,114,86,101,108,111,99,105,116,121,46,73,115,86,97,108,105,100,40,41,0,0,0,0,98,50,73,115,86,97,108,105,100,40,98,100,45,62,97,110,103,108,101,41,0,0,0,0,98,50,73,115,86,97,108,105,100,40,98,100,45,62,97,110,103,117,108,97,114,86,101,108,111,99,105,116,121,41,0,0,98,50,73,115,86,97,108,105,100,40,98,100,45,62,97,110,103,117,108,97,114,68,97,109,112,105,110,103,41,32,38,38,32,98,100,45,62,97,110,103,117,108,97,114,68,97,109,112,105,110,103,32,62,61,32,48,46,48,102,0,0,0,0,0,98,50,73,115,86,97,108,105,100,40,98,100,45,62,108,105,110,101,97,114,68,97,109,112,105,110,103,41,32,38,38,32,98,100,45,62,108,105,110,101,97,114,68,97,109,112,105,110,103,32,62,61,32,48,46,48,102,0,0,0,0,0,0,0,109,95,119,111,114,108,100,45,62,73,115,76,111,99,107,101,100,40,41,32,61,61,32,102,97,108,115,101,0,0,0,0,67,114,101,97,116,101,70,105,120,116,117,114,101,0,0,0,109,95,116,121,112,101,32,61,61,32,98,50,95,100,121,110,97,109,105,99,66,111,100,121,0,0,0,0,0,0,0,0,82,101,115,101,116,77,97,115,115,68,97,116,97,0,0,0,109,95,73,32,62,32,48,46,48,102,0,0,0,0,0,0,0,10,0,0,0,0,0,0,240,7,0,0,0,0,0,0,48,32,60,61,32,112,114,111,120,121,73,100,32,38,38,32,112,114,111,120,121,73,100,32,60,32,109,95,110,111,100,101,67,97,112,97,99,105,116,121,0,0,0,0,0,0,0,0,46,47,66,111,120,50,68,47,67,111,108,108,105,115,105,111,110,47,98,50,68,121,110,97,109,105,99,84,114,101,101,46,104,0,0,0,0,0,0,0,71,101,116,85,115,101,114,68,97,116,97,0,0,0,0,0,71,101,116,70,97,116,65,65,66,66,0,0,0,0,0,0,0,0,0,0,32,8,0,0,5,0,0,0,6,0,0,0,1,0,0,0,2,0,0,0,1,0,0,0,2,0,0,0,49,55,98,50,67,111,110,116,97,99,116,76,105,115,116,101,110,101,114,0,0,0,0,0,120,27,0,0,8,8,0,0,109,95,112,114,111,120,121,67,111,117,110,116,32,61,61,32,48,0,0,0,0,0,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,98,50,70,105,120,116,117,114,101,46,99,112,112,0,0,0,0,67,114,101,97,116,101,80,114,111,120,105,101,115,0,0,0,73,115,76,111,99,107,101,100,40,41,32,61,61,32,102,97,108,115,101,0,0,0,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,98,50,87,111,114,108,100,46,99,112,112,0,0,0,0,0,0,67,114,101,97,116,101,66,111,100,121,0,0,0,0,0,0,98,45,62,73,115,65,99,116,105,118,101,40,41,32,61,61,32,116,114,117,101,0,0,0,83,111,108,118,101,0,0,0,115,116,97,99,107,67,111,117,110,116,32,60,32,115,116,97,99,107,83,105,122,101,0,0,116,121,112,101,65,32,61,61,32,98,50,95,100,121,110,97,109,105,99,66,111,100,121,32,124,124,32,116,121,112,101,66,32,61,61,32,98,50,95,100,121,110,97,109,105,99,66,111,100,121,0,0,0,0,0,0,83,111,108,118,101,84,79,73,0,0,0,0,0,0,0,0,97,108,112,104,97,48,32,60,32,49,46,48,102,0,0,0,46,47,66,111,120,50,68,47,67,111,109,109,111,110,47,98,50,77,97,116,104,46,104,0,65,100,118,97,110,99,101,0,109,95,106,111,105,110,116,67,111,117,110,116,32,60,32,109,95,106,111,105,110,116,67,97,112,97,99,105,116,121,0,0,46,47,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,98,50,73,115,108,97,110,100,46,104,0,0,0,0,0,65,100,100,0,0,0,0,0,109,95,99,111,110,116,97,99,116,67,111,117,110,116,32,60,32,109,95,99,111,110,116,97,99,116,67,97,112,97,99,105,116,121,0,0,0,0,0,0,109,95,98,111,100,121,67,111,117,110,116,32,60,32,109,95,98,111,100,121,67,97,112,97,99,105,116,121,0,0,0,0,0,0,0,0,40,10,0,0,7,0,0,0,8,0,0,0,3,0,0,0,0,0,0,0,49,53,98,50,67,111,110,116,97,99,116,70,105,108,116,101,114,0,0,0,0,0,0,0,120,27,0,0,16,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,48,32,60,61,32,105,110,100,101,120,32,38,38,32,105,110,100,101,120,32,60,32,99,104,97,105,110,45,62,109,95,99,111,117,110,116,0,0,0,0,66,111,120,50,68,47,67,111,108,108,105,115,105,111,110,47,98,50,68,105,115,116,97,110,99,101,46,99,112,112,0,0,83,101,116,0,0,0,0,0,102,97,108,115,101,0,0,0,98,50,68,105,115,116,97,110,99,101,0,0,0,0,0,0,71,101,116,77,101,116,114,105,99,0,0,0,0,0,0,0,71,101,116,87,105,116,110,101,115,115,80,111,105,110,116,115,0,0,0,0,0,0,0,0,48,32,60,61,32,105,110,100,101,120,32,38,38,32,105,110,100,101,120,32,60,32,109,95,99,111,117,110,116,0,0,0,46,47,66,111,120,50,68,47,67,111,108,108,105,115,105,111,110,47,98,50,68,105,115,116,97,110,99,101,46,104,0,0,71,101,116,86,101,114,116,101,120,0,0,0,0,0,0,0,71,101,116,67,108,111,115,101,115,116,80,111,105,110,116,0,99,97,99,104,101,45,62,99,111,117,110,116,32,60,61,32,51,0,0,0,0,0,0,0,82,101,97,100,67,97,99,104,101,0,0,0,0,0,0,0,109,95,110,111,100,101,67,111,117,110,116,32,61,61,32,109,95,110,111,100,101,67,97,112,97,99,105,116,121,0,0,0,66,111,120,50,68,47,67,111,108,108,105,115,105,111,110,47,98,50,68,121,110,97,109,105,99,84,114,101,101,46,99,112,112,0,0,0,0,0,0,0,65,108,108,111,99,97,116,101,78,111,100,101,0,0,0,0,48,32,60,61,32,110,111,100,101,73,100,32,38,38,32,110,111,100,101,73,100,32,60,32,109,95,110,111,100,101,67,97,112,97,99,105,116,121,0,0,70,114,101,101,78,111,100,101,0,0,0,0,0,0,0,0,48,32,60,32,109,95,110,111,100,101,67,111,117,110,116,0,48,32,60,61,32,112,114,111,120,121,73,100,32,38,38,32,112,114,111,120,121,73,100,32,60,32,109,95,110,111,100,101,67,97,112,97,99,105,116,121,0,0,0,0,0,0,0,0,109,95,110,111,100,101,115,91,112,114,111,120,121,73,100,93,46,73,115,76,101,97,102,40,41,0,0,0,0,0,0,0,77,111,118,101,80,114,111,120,121,0,0,0,0,0,0,0,99,104,105,108,100,49,32,33,61,32,40,45,49,41,0,0,73,110,115,101,114,116,76,101,97,102,0,0,0,0,0,0,99,104,105,108,100,50,32,33,61,32,40,45,49,41,0,0,105,65,32,33,61,32,40,45,49,41,0,0,0,0,0,0,66,97,108,97,110,99,101,0,48,32,60,61,32,105,66,32,38,38,32,105,66,32,60,32,109,95,110,111,100,101,67,97,112,97,99,105,116,121,0,0,48,32,60,61,32,105,67,32,38,38,32,105,67,32,60,32,109,95,110,111,100,101,67,97,112,97,99,105,116,121,0,0,48,32,60,61,32,105,70,32,38,38,32,105,70,32,60,32,109,95,110,111,100,101,67,97,112,97,99,105,116,121,0,0,48,32,60,61,32,105,71,32,38,38,32,105,71,32,60,32,109,95,110,111,100,101,67,97,112,97,99,105,116,121,0,0,109,95,110,111,100,101,115,91,67,45,62,112,97,114,101,110,116,93,46,99,104,105,108,100,50,32,61,61,32,105,65,0,48,32,60,61,32,105,68,32,38,38,32,105,68,32,60,32,109,95,110,111,100,101,67,97,112,97,99,105,116,121,0,0,48,32,60,61,32,105,69,32,38,38,32,105,69,32,60,32,109,95,110,111,100,101,67,97,112,97,99,105,116,121,0,0,109,95,110,111,100,101,115,91,66,45,62,112,97,114,101,110,116,93,46,99,104,105,108,100,50,32,61,61,32,105,65,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,116,97,114,103,101,116,32,62,32,116,111,108,101,114,97,110,99,101,0,0,0,0,0,0,66,111,120,50,68,47,67,111,108,108,105,115,105,111,110,47,98,50,84,105,109,101,79,102,73,109,112,97,99,116,46,99,112,112,0,0,0,0,0,0,98,50,84,105,109,101,79,102,73,109,112,97,99,116,0,0,102,97,108,115,101,0,0,0,69,118,97,108,117,97,116,101,0,0,0,0,0,0,0,0,48,32,60,61,32,105,110,100,101,120,32,38,38,32,105,110,100,101,120,32,60,32,109,95,99,111,117,110,116,0,0,0,46,47,66,111,120,50,68,47,67,111,108,108,105,115,105,111,110,47,98,50,68,105,115,116,97,110,99,101,46,104,0,0,71,101,116,86,101,114,116,101,120,0,0,0,0,0,0,0,70,105,110,100,77,105,110,83,101,112,97,114,97,116,105,111,110,0,0,0,0,0,0,0,48,32,60,32,99,111,117,110,116,32,38,38,32,99,111,117,110,116,32,60,32,51,0,0,73,110,105,116,105,97,108,105,122,101,0,0,0,0,0,0,0,0,0,0,0,0,0,0,109,95,105,110,100,101,120,32,61,61,32,48,0,0,0,0,66,111,120,50,68,47,67,111,109,109,111,110,47,98,50,83,116,97,99,107,65,108,108,111,99,97,116,111,114,46,99,112,112,0,0,0,0,0,0,0,126,98,50,83,116,97,99,107,65,108,108,111,99,97,116,111,114,0,0,0,0,0,0,0,109,95,101,110,116,114,121,67,111,117,110,116,32,61,61,32,48,0,0,0,0,0,0,0,109,95,101,110,116,114,121,67,111,117,110,116,32,60,32,98,50,95,109,97,120,83,116,97,99,107,69,110,116,114,105,101,115,0,0,0,0,0,0,0,65,108,108,111,99,97,116,101,0,0,0,0,0,0,0,0,109,95,101,110,116,114,121,67,111,117,110,116,32,62,32,48,0,0,0,0,0,0,0,0,70,114,101,101,0,0,0,0,112,32,61,61,32,101,110,116,114,121,45,62,100,97,116,97,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,48,32,60,61,32,116,121,112,101,49,32,38,38,32,116,121,112,101,49,32,60,32,98,50,83,104,97,112,101,58,58,101,95,116,121,112,101,67,111,117,110,116,0,0,0,0,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,67,111,110,116,97,99,116,115,47,98,50,67,111,110,116,97,99,116,46,99,112,112,0,0,0,48,32,60,61,32,116,121,112,101,50,32,38,38,32,116,121,112,101,50,32,60,32,98,50,83,104,97,112,101,58,58,101,95,116,121,112,101,67,111,117,110,116,0,0,0,0,0,0,67,114,101,97,116,101,0,0,115,95,105,110,105,116,105,97,108,105,122,101,100,32,61,61,32,116,114,117,101,0,0,0,68,101,115,116,114,111,121,0,48,32,60,61,32,116,121,112,101,65,32,38,38,32,116,121,112,101,66,32,60,32,98,50,83,104,97,112,101,58,58,101,95,116,121,112,101,67,111,117,110,116,0,0,0,0,0,0,0,0,0,0,120,17,0,0,1,0,0,0,9,0,0,0,10,0,0,0,0,0,0,0,57,98,50,67,111,110,116,97,99,116,0,0,0,0,0,0,120,27,0,0,104,17,0,0,0,0,0,0,104,18,0,0,3,0,0,0,11,0,0,0,12,0,0,0,0,0,0,0,109,95,102,105,120,116,117,114,101,65,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,101,100,103,101,0,0,0,0,0,0,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,67,111,110,116,97,99,116,115,47,98,50,69,100,103,101,65,110,100,67,105,114,99,108,101,67,111,110,116,97,99,116,46,99,112,112,0,0,0,0,0,0,98,50,69,100,103,101,65,110,100,67,105,114,99,108,101,67,111,110,116,97,99,116,0,0,109,95,102,105,120,116,117,114,101,66,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,99,105,114,99,108,101,0,0,0,0,0,0,50,50,98,50,69,100,103,101,65,110,100,67,105,114,99,108,101,67,111,110,116,97,99,116,0,0,0,0,0,0,0,0,160,27,0,0,72,18,0,0,120,17,0,0,0,0,0,0,0,0,0,0,96,19,0,0,4,0,0,0,13,0,0,0,14,0,0,0,0,0,0,0,109,95,102,105,120,116,117,114,101,65,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,101,100,103,101,0,0,0,0,0,0,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,67,111,110,116,97,99,116,115,47,98,50,69,100,103,101,65,110,100,80,111,108,121,103,111,110,67,111,110,116,97,99,116,46,99,112,112,0,0,0,0,0,98,50,69,100,103,101,65,110,100,80,111,108,121,103,111,110,67,111,110,116,97,99,116,0,109,95,102,105,120,116,117,114,101,66,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,112,111,108,121,103,111,110,0,0,0,0,0,50,51,98,50,69,100,103,101,65,110,100,80,111,108,121,103,111,110,67,111,110,116,97,99,116,0,0,0,0,0,0,0,160,27,0,0,64,19,0,0,120,17,0,0,0,0,0,0,0,0,0,0,96,20,0,0,5,0,0,0,15,0,0,0,16,0,0,0,0,0,0,0,109,95,102,105,120,116,117,114,101,65,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,112,111,108,121,103,111,110,0,0,0,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,67,111,110,116,97,99,116,115,47,98,50,80,111,108,121,103,111,110,65,110,100,67,105,114,99,108,101,67,111,110,116,97,99,116,46,99,112,112,0,0,0,98,50,80,111,108,121,103,111,110,65,110,100,67,105,114,99,108,101,67,111,110,116,97,99,116,0,0,0,0,0,0,0,109,95,102,105,120,116,117,114,101,66,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,99,105,114,99,108,101,0,0,0,0,0,0,50,53,98,50,80,111,108,121,103,111,110,65,110,100,67,105,114,99,108,101,67,111,110,116,97,99,116,0,0,0,0,0,160,27,0,0,64,20,0,0,120,17,0,0,0,0,0,0,0,0,0,0,72,21,0,0,6,0,0,0,17,0,0,0,18,0,0,0,0,0,0,0,109,95,102,105,120,116,117,114,101,65,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,112,111,108,121,103,111,110,0,0,0,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,67,111,110,116,97,99,116,115,47,98,50,80,111,108,121,103,111,110,67,111,110,116,97,99,116,46,99,112,112,0,0,0,0,98,50,80,111,108,121,103,111,110,67,111,110,116,97,99,116,0,0,0,0,0,0,0,0,109,95,102,105,120,116,117,114,101,66,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,112,111,108,121,103,111,110,0,0,0,0,0,49,54,98,50,80,111,108,121,103,111,110,67,111,110,116,97,99,116,0,0,0,0,0,0,160,27,0,0,48,21,0,0,120,17,0,0,0,0,0,0,116,111,105,73,110,100,101,120,65,32,60,32,109,95,98,111,100,121,67,111,117,110,116,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,98,50,73,115,108,97,110,100,46,99,112,112,0,0,0,0,0,83,111,108,118,101,84,79,73,0,0,0,0,0,0,0,0,116,111,105,73,110,100,101,120,66,32,60,32,109,95,98,111,100,121,67,111,117,110,116,0,100,101,110,32,62,32,48,46,48,102,0,0,0,0,0,0,66,111,120,50,68,47,67,111,108,108,105,115,105,111,110,47,98,50,67,111,108,108,105,100,101,69,100,103,101,46,99,112,112,0,0,0,0,0,0,0,98,50,67,111,108,108,105,100,101,69,100,103,101,65,110,100,67,105,114,99,108,101,0,0,48,32,60,61,32,101,100,103,101,49,32,38,38,32,101,100,103,101,49,32,60,32,112,111,108,121,49,45,62,109,95,118,101,114,116,101,120,67,111,117,110,116,0,0,0,0,0,0,66,111,120,50,68,47,67,111,108,108,105,115,105,111,110,47,98,50,67,111,108,108,105,100,101,80,111,108,121,103,111,110,46,99,112,112,0,0,0,0,98,50,70,105,110,100,73,110,99,105,100,101,110,116,69,100,103,101,0,0,0,0,0,0,98,50,69,100,103,101,83,101,112,97,114,97,116,105,111,110,0,0,0,0,0,0,0,0,0,0,0,0,120,23,0,0,7,0,0,0,19,0,0,0,20,0,0,0,0,0,0,0,109,95,102,105,120,116,117,114,101,65,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,99,104,97,105,110,0,0,0,0,0,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,67,111,110,116,97,99,116,115,47,98,50,67,104,97,105,110,65,110,100,67,105,114,99,108,101,67,111,110,116,97,99,116,46,99,112,112,0,0,0,0,0,98,50,67,104,97,105,110,65,110,100,67,105,114,99,108,101,67,111,110,116,97,99,116,0,109,95,102,105,120,116,117,114,101,66,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,99,105,114,99,108,101,0,0,0,0,0,0,50,51,98,50,67,104,97,105,110,65,110,100,67,105,114,99,108,101,67,111,110,116,97,99,116,0,0,0,0,0,0,0,160,27,0,0,88,23,0,0,120,17,0,0,0,0,0,0,0,0,0,0,120,24,0,0,8,0,0,0,21,0,0,0,22,0,0,0,0,0,0,0,109,95,102,105,120,116,117,114,101,65,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,99,104,97,105,110,0,0,0,0,0,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,67,111,110,116,97,99,116,115,47,98,50,67,104,97,105,110,65,110,100,80,111,108,121,103,111,110,67,111,110,116,97,99,116,46,99,112,112,0,0,0,0,98,50,67,104,97,105,110,65,110,100,80,111,108,121,103,111,110,67,111,110,116,97,99,116,0,0,0,0,0,0,0,0,109,95,102,105,120,116,117,114,101,66,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,112,111,108,121,103,111,110,0,0,0,0,0,50,52,98,50,67,104,97,105,110,65,110,100,80,111,108,121,103,111,110,67,111,110,116,97,99,116,0,0,0,0,0,0,160,27,0,0,88,24,0,0,120,17,0,0,0,0,0,0,0,0,0,0,88,25,0,0,9,0,0,0,23,0,0,0,24,0,0,0,0,0,0,0,109,95,102,105,120,116,117,114,101,65,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,99,105,114,99,108,101,0,0,0,0,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,67,111,110,116,97,99,116,115,47,98,50,67,105,114,99,108,101,67,111,110,116,97,99,116,46,99,112,112,0,0,0,0,0,98,50,67,105,114,99,108,101,67,111,110,116,97,99,116,0,109,95,102,105,120,116,117,114,101,66,45,62,71,101,116,84,121,112,101,40,41,32,61,61,32,98,50,83,104,97,112,101,58,58,101,95,99,105,114,99,108,101,0,0,0,0,0,0,49,53,98,50,67,105,114,99,108,101,67,111,110,116,97,99,116,0,0,0,0,0,0,0,160,27,0,0,64,25,0,0,120,17,0,0,0,0,0,0,112,111,105,110,116,67,111,117,110,116,32,62,32,48,0,0,66,111,120,50,68,47,68,121,110,97,109,105,99,115,47,67,111,110,116,97,99,116,115,47,98,50,67,111,110,116,97,99,116,83,111,108,118,101,114,46,99,112,112,0,0,0,0,0,98,50,67,111,110,116,97,99,116,83,111,108,118,101,114,0,109,97,110,105,102,111,108,100,45,62,112,111,105,110,116,67,111,117,110,116,32,62,32,48,0,0,0,0,0,0,0,0,73,110,105,116,105,97,108,105,122,101,86,101,108,111,99,105,116,121,67,111,110,115,116,114,97,105,110,116,115,0,0,0,112,111,105,110,116,67,111,117,110,116,32,61,61,32,49,32,124,124,32,112,111,105,110,116,67,111,117,110,116,32,61,61,32,50,0,0,0,0,0,0,83,111,108,118,101,86,101,108,111,99,105,116,121,67,111,110,115,116,114,97,105,110,116,115,0,0,0,0,0,0,0,0,97,46,120,32,62,61,32,48,46,48,102,32,38,38,32,97,46,121,32,62,61,32,48,46,48,102,0,0,0,0,0,0,112,99,45,62,112,111,105,110,116,67,111,117,110,116,32,62,32,48,0,0,0,0,0,0,73,110,105,116,105,97,108,105,122,101,0,0,0,0,0,0,66,111,120,50,68,47,67,111,108,108,105,115,105,111,110,47,83,104,97,112,101,115,47,98,50,67,104,97,105,110,83,104,97,112,101,46,99,112,112,0,48,32,60,61,32,105,110,100,101,120,32,38,38,32,105,110,100,101,120,32,60,32,109,95,99,111,117,110,116,32,45,32,49,0,0,0,0,0,0,0,71,101,116,67,104,105,108,100,69,100,103,101,0,0,0,0,83,116,57,116,121,112,101,95,105,110,102,111,0,0,0,0,120,27,0,0,232,26,0,0,78,49,48,95,95,99,120,120,97,98,105,118,49,49,54,95,95,115,104,105,109,95,116,121,112,101,95,105,110,102,111,69,0,0,0,0,0,0,0,0,160,27,0,0,0,27,0,0,248,26,0,0,0,0,0,0,78,49,48,95,95,99,120,120,97,98,105,118,49,49,55,95,95,99,108,97,115,115,95,116,121,112,101,95,105,110,102,111,69,0,0,0,0,0,0,0,160,27,0,0,56,27,0,0,40,27,0,0,0,0,0,0,0,0,0,0,96,27,0,0,25,0,0,0,26,0,0,0,27,0,0,0,28,0,0,0,4,0,0,0,1,0,0,0,1,0,0,0,10,0,0,0,0,0,0,0,232,27,0,0,25,0,0,0,29,0,0,0,27,0,0,0,28,0,0,0,4,0,0,0,2,0,0,0,2,0,0,0,11,0,0,0,78,49,48,95,95,99,120,120,97,98,105,118,49,50,48,95,95,115,105,95,99,108,97,115,115,95,116,121,112,101,95,105,110,102,111,69,0,0,0,0,160,27,0,0,192,27,0,0,96,27,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,40,30,0,0,30,0,0,0,31,0,0,0,3,0,0,0,0,0,0,0,115,116,100,58,58,98,97,100,95,97,108,108,111,99,0,0,83,116,57,98,97,100,95,97,108,108,111,99,0,0,0,0,160,27,0,0,24,30,0,0,0,0,0,0,0,0,0,0], "i8", ALLOC_NONE, Runtime.GLOBAL_BASE);
+
+
+
+
+var tempDoublePtr = Runtime.alignMemory(allocate(12, "i8", ALLOC_STATIC), 8);
+
+assert(tempDoublePtr % 8 == 0);
+
+function copyTempFloat(ptr) { // functions, because inlining this code increases code size too much
+
+ HEAP8[tempDoublePtr] = HEAP8[ptr];
+
+ HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
+
+ HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
+
+ HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
+
+}
+
+function copyTempDouble(ptr) {
+
+ HEAP8[tempDoublePtr] = HEAP8[ptr];
+
+ HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
+
+ HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
+
+ HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
+
+ HEAP8[tempDoublePtr+4] = HEAP8[ptr+4];
+
+ HEAP8[tempDoublePtr+5] = HEAP8[ptr+5];
+
+ HEAP8[tempDoublePtr+6] = HEAP8[ptr+6];
+
+ HEAP8[tempDoublePtr+7] = HEAP8[ptr+7];
+
+}
+
+
+ function _emscripten_set_main_loop(func, fps, simulateInfiniteLoop, arg) {
+ Module['noExitRuntime'] = true;
+
+ Browser.mainLoop.runner = function Browser_mainLoop_runner() {
+ if (ABORT) return;
+ if (Browser.mainLoop.queue.length > 0) {
+ var start = Date.now();
+ var blocker = Browser.mainLoop.queue.shift();
+ blocker.func(blocker.arg);
+ if (Browser.mainLoop.remainingBlockers) {
+ var remaining = Browser.mainLoop.remainingBlockers;
+ var next = remaining%1 == 0 ? remaining-1 : Math.floor(remaining);
+ if (blocker.counted) {
+ Browser.mainLoop.remainingBlockers = next;
+ } else {
+ // not counted, but move the progress along a tiny bit
+ next = next + 0.5; // do not steal all the next one's progress
+ Browser.mainLoop.remainingBlockers = (8*remaining + next)/9;
+ }
+ }
+ console.log('main loop blocker "' + blocker.name + '" took ' + (Date.now() - start) + ' ms'); //, left: ' + Browser.mainLoop.remainingBlockers);
+ Browser.mainLoop.updateStatus();
+ setTimeout(Browser.mainLoop.runner, 0);
+ return;
+ }
+ if (Browser.mainLoop.shouldPause) {
+ // catch pauses from non-main loop sources
+ Browser.mainLoop.paused = true;
+ Browser.mainLoop.shouldPause = false;
+ return;
+ }
+
+ // Signal GL rendering layer that processing of a new frame is about to start. This helps it optimize
+ // VBO double-buffering and reduce GPU stalls.
+
+ if (Browser.mainLoop.method === 'timeout' && Module.ctx) {
+ Module.printErr('Looks like you are rendering without using requestAnimationFrame for the main loop. You should use 0 for the frame rate in emscripten_set_main_loop in order to use requestAnimationFrame, as that can greatly improve your frame rates!');
+ Browser.mainLoop.method = ''; // just warn once per call to set main loop
+ }
+
+ if (Module['preMainLoop']) {
+ Module['preMainLoop']();
+ }
+
+ try {
+ if (typeof arg !== 'undefined') {
+ Runtime.dynCall('vi', func, [arg]);
+ } else {
+ Runtime.dynCall('v', func);
+ }
+ } catch (e) {
+ if (e instanceof ExitStatus) {
+ return;
+ } else {
+ if (e && typeof e === 'object' && e.stack) Module.printErr('exception thrown: ' + [e, e.stack]);
+ throw e;
+ }
+ }
+
+ if (Module['postMainLoop']) {
+ Module['postMainLoop']();
+ }
+
+ if (Browser.mainLoop.shouldPause) {
+ // catch pauses from the main loop itself
+ Browser.mainLoop.paused = true;
+ Browser.mainLoop.shouldPause = false;
+ return;
+ }
+ Browser.mainLoop.scheduler();
+ }
+ if (fps && fps > 0) {
+ Browser.mainLoop.scheduler = function Browser_mainLoop_scheduler() {
+ setTimeout(Browser.mainLoop.runner, 1000/fps); // doing this each time means that on exception, we stop
+ };
+ Browser.mainLoop.method = 'timeout';
+ } else {
+ Browser.mainLoop.scheduler = function Browser_mainLoop_scheduler() {
+ Browser.requestAnimationFrame(Browser.mainLoop.runner);
+ };
+ Browser.mainLoop.method = 'rAF';
+ }
+ Browser.mainLoop.scheduler();
+
+ if (simulateInfiniteLoop) {
+ throw 'SimulateInfiniteLoop';
+ }
+ }
+
+ var _cosf=Math_cos;
+
+ function ___cxa_pure_virtual() {
+ ABORT = true;
+ throw 'Pure virtual function called!';
+ }
+
+ function _time(ptr) {
+ var ret = Math.floor(Date.now()/1000);
+ if (ptr) {
+ HEAP32[((ptr)>>2)]=ret;
+ }
+ return ret;
+ }
+
+ function ___assert_fail(condition, filename, line, func) {
+ ABORT = true;
+ throw 'Assertion failed: ' + Pointer_stringify(condition) + ', at: ' + [filename ? Pointer_stringify(filename) : 'unknown filename', line, func ? Pointer_stringify(func) : 'unknown function'] + ' at ' + stackTrace();
+ }
+
+
+ function __ZSt18uncaught_exceptionv() { // std::uncaught_exception()
+ return !!__ZSt18uncaught_exceptionv.uncaught_exception;
+ }
+
+
+
+ function ___cxa_is_number_type(type) {
+ var isNumber = false;
+ try { if (type == __ZTIi) isNumber = true } catch(e){}
+ try { if (type == __ZTIj) isNumber = true } catch(e){}
+ try { if (type == __ZTIl) isNumber = true } catch(e){}
+ try { if (type == __ZTIm) isNumber = true } catch(e){}
+ try { if (type == __ZTIx) isNumber = true } catch(e){}
+ try { if (type == __ZTIy) isNumber = true } catch(e){}
+ try { if (type == __ZTIf) isNumber = true } catch(e){}
+ try { if (type == __ZTId) isNumber = true } catch(e){}
+ try { if (type == __ZTIe) isNumber = true } catch(e){}
+ try { if (type == __ZTIc) isNumber = true } catch(e){}
+ try { if (type == __ZTIa) isNumber = true } catch(e){}
+ try { if (type == __ZTIh) isNumber = true } catch(e){}
+ try { if (type == __ZTIs) isNumber = true } catch(e){}
+ try { if (type == __ZTIt) isNumber = true } catch(e){}
+ return isNumber;
+ }function ___cxa_does_inherit(definiteType, possibilityType, possibility) {
+ if (possibility == 0) return false;
+ if (possibilityType == 0 || possibilityType == definiteType)
+ return true;
+ var possibility_type_info;
+ if (___cxa_is_number_type(possibilityType)) {
+ possibility_type_info = possibilityType;
+ } else {
+ var possibility_type_infoAddr = HEAP32[((possibilityType)>>2)] - 8;
+ possibility_type_info = HEAP32[((possibility_type_infoAddr)>>2)];
+ }
+ switch (possibility_type_info) {
+ case 0: // possibility is a pointer
+ // See if definite type is a pointer
+ var definite_type_infoAddr = HEAP32[((definiteType)>>2)] - 8;
+ var definite_type_info = HEAP32[((definite_type_infoAddr)>>2)];
+ if (definite_type_info == 0) {
+ // Also a pointer; compare base types of pointers
+ var defPointerBaseAddr = definiteType+8;
+ var defPointerBaseType = HEAP32[((defPointerBaseAddr)>>2)];
+ var possPointerBaseAddr = possibilityType+8;
+ var possPointerBaseType = HEAP32[((possPointerBaseAddr)>>2)];
+ return ___cxa_does_inherit(defPointerBaseType, possPointerBaseType, possibility);
+ } else
+ return false; // one pointer and one non-pointer
+ case 1: // class with no base class
+ return false;
+ case 2: // class with base class
+ var parentTypeAddr = possibilityType + 8;
+ var parentType = HEAP32[((parentTypeAddr)>>2)];
+ return ___cxa_does_inherit(definiteType, parentType, possibility);
+ default:
+ return false; // some unencountered type
+ }
+ }
+
+
+
+ var ___cxa_last_thrown_exception=0;function ___resumeException(ptr) {
+ if (!___cxa_last_thrown_exception) { ___cxa_last_thrown_exception = ptr; }
+ throw ptr + " - Exception catching is disabled, this exception cannot be caught. Compile with -s DISABLE_EXCEPTION_CATCHING=0 or DISABLE_EXCEPTION_CATCHING=2 to catch.";
+ }
+
+ var ___cxa_exception_header_size=8;function ___cxa_find_matching_catch(thrown, throwntype) {
+ if (thrown == -1) thrown = ___cxa_last_thrown_exception;
+ header = thrown - ___cxa_exception_header_size;
+ if (throwntype == -1) throwntype = HEAP32[((header)>>2)];
+ var typeArray = Array.prototype.slice.call(arguments, 2);
+
+ // If throwntype is a pointer, this means a pointer has been
+ // thrown. When a pointer is thrown, actually what's thrown
+ // is a pointer to the pointer. We'll dereference it.
+ if (throwntype != 0 && !___cxa_is_number_type(throwntype)) {
+ var throwntypeInfoAddr= HEAP32[((throwntype)>>2)] - 8;
+ var throwntypeInfo= HEAP32[((throwntypeInfoAddr)>>2)];
+ if (throwntypeInfo == 0)
+ thrown = HEAP32[((thrown)>>2)];
+ }
+ // The different catch blocks are denoted by different types.
+ // Due to inheritance, those types may not precisely match the
+ // type of the thrown object. Find one which matches, and
+ // return the type of the catch block which should be called.
+ for (var i = 0; i < typeArray.length; i++) {
+ if (___cxa_does_inherit(typeArray[i], throwntype, thrown))
+ return ((asm["setTempRet0"](typeArray[i]),thrown)|0);
+ }
+ // Shouldn't happen unless we have bogus data in typeArray
+ // or encounter a type for which emscripten doesn't have suitable
+ // typeinfo defined. Best-efforts match just in case.
+ return ((asm["setTempRet0"](throwntype),thrown)|0);
+ }function ___cxa_throw(ptr, type, destructor) {
+ if (!___cxa_throw.initialized) {
+ try {
+ HEAP32[((__ZTVN10__cxxabiv119__pointer_type_infoE)>>2)]=0; // Workaround for libcxxabi integration bug
+ } catch(e){}
+ try {
+ HEAP32[((__ZTVN10__cxxabiv117__class_type_infoE)>>2)]=1; // Workaround for libcxxabi integration bug
+ } catch(e){}
+ try {
+ HEAP32[((__ZTVN10__cxxabiv120__si_class_type_infoE)>>2)]=2; // Workaround for libcxxabi integration bug
+ } catch(e){}
+ ___cxa_throw.initialized = true;
+ }
+ var header = ptr - ___cxa_exception_header_size;
+ HEAP32[((header)>>2)]=type;
+ HEAP32[(((header)+(4))>>2)]=destructor;
+ ___cxa_last_thrown_exception = ptr;
+ if (!("uncaught_exception" in __ZSt18uncaught_exceptionv)) {
+ __ZSt18uncaught_exceptionv.uncaught_exception = 1;
+ } else {
+ __ZSt18uncaught_exceptionv.uncaught_exception++;
+ }
+ throw ptr + " - Exception catching is disabled, this exception cannot be caught. Compile with -s DISABLE_EXCEPTION_CATCHING=0 or DISABLE_EXCEPTION_CATCHING=2 to catch.";
+ }
+
+
+ Module["_memset"] = _memset;
+
+
+
+ function __exit(status) {
+ // void _exit(int status);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/exit.html
+ Module['exit'](status);
+ }function _exit(status) {
+ __exit(status);
+ }function __ZSt9terminatev() {
+ _exit(-1234);
+ }
+
+ function _abort() {
+ Module['abort']();
+ }
+
+
+
+
+
+ var ERRNO_CODES={EPERM:1,ENOENT:2,ESRCH:3,EINTR:4,EIO:5,ENXIO:6,E2BIG:7,ENOEXEC:8,EBADF:9,ECHILD:10,EAGAIN:11,EWOULDBLOCK:11,ENOMEM:12,EACCES:13,EFAULT:14,ENOTBLK:15,EBUSY:16,EEXIST:17,EXDEV:18,ENODEV:19,ENOTDIR:20,EISDIR:21,EINVAL:22,ENFILE:23,EMFILE:24,ENOTTY:25,ETXTBSY:26,EFBIG:27,ENOSPC:28,ESPIPE:29,EROFS:30,EMLINK:31,EPIPE:32,EDOM:33,ERANGE:34,ENOMSG:42,EIDRM:43,ECHRNG:44,EL2NSYNC:45,EL3HLT:46,EL3RST:47,ELNRNG:48,EUNATCH:49,ENOCSI:50,EL2HLT:51,EDEADLK:35,ENOLCK:37,EBADE:52,EBADR:53,EXFULL:54,ENOANO:55,EBADRQC:56,EBADSLT:57,EDEADLOCK:35,EBFONT:59,ENOSTR:60,ENODATA:61,ETIME:62,ENOSR:63,ENONET:64,ENOPKG:65,EREMOTE:66,ENOLINK:67,EADV:68,ESRMNT:69,ECOMM:70,EPROTO:71,EMULTIHOP:72,EDOTDOT:73,EBADMSG:74,ENOTUNIQ:76,EBADFD:77,EREMCHG:78,ELIBACC:79,ELIBBAD:80,ELIBSCN:81,ELIBMAX:82,ELIBEXEC:83,ENOSYS:38,ENOTEMPTY:39,ENAMETOOLONG:36,ELOOP:40,EOPNOTSUPP:95,EPFNOSUPPORT:96,ECONNRESET:104,ENOBUFS:105,EAFNOSUPPORT:97,EPROTOTYPE:91,ENOTSOCK:88,ENOPROTOOPT:92,ESHUTDOWN:108,ECONNREFUSED:111,EADDRINUSE:98,ECONNABORTED:103,ENETUNREACH:101,ENETDOWN:100,ETIMEDOUT:110,EHOSTDOWN:112,EHOSTUNREACH:113,EINPROGRESS:115,EALREADY:114,EDESTADDRREQ:89,EMSGSIZE:90,EPROTONOSUPPORT:93,ESOCKTNOSUPPORT:94,EADDRNOTAVAIL:99,ENETRESET:102,EISCONN:106,ENOTCONN:107,ETOOMANYREFS:109,EUSERS:87,EDQUOT:122,ESTALE:116,ENOTSUP:95,ENOMEDIUM:123,EILSEQ:84,EOVERFLOW:75,ECANCELED:125,ENOTRECOVERABLE:131,EOWNERDEAD:130,ESTRPIPE:86};
+
+ var ERRNO_MESSAGES={0:"Success",1:"Not super-user",2:"No such file or directory",3:"No such process",4:"Interrupted system call",5:"I/O error",6:"No such device or address",7:"Arg list too long",8:"Exec format error",9:"Bad file number",10:"No children",11:"No more processes",12:"Not enough core",13:"Permission denied",14:"Bad address",15:"Block device required",16:"Mount device busy",17:"File exists",18:"Cross-device link",19:"No such device",20:"Not a directory",21:"Is a directory",22:"Invalid argument",23:"Too many open files in system",24:"Too many open files",25:"Not a typewriter",26:"Text file busy",27:"File too large",28:"No space left on device",29:"Illegal seek",30:"Read only file system",31:"Too many links",32:"Broken pipe",33:"Math arg out of domain of func",34:"Math result not representable",35:"File locking deadlock error",36:"File or path name too long",37:"No record locks available",38:"Function not implemented",39:"Directory not empty",40:"Too many symbolic links",42:"No message of desired type",43:"Identifier removed",44:"Channel number out of range",45:"Level 2 not synchronized",46:"Level 3 halted",47:"Level 3 reset",48:"Link number out of range",49:"Protocol driver not attached",50:"No CSI structure available",51:"Level 2 halted",52:"Invalid exchange",53:"Invalid request descriptor",54:"Exchange full",55:"No anode",56:"Invalid request code",57:"Invalid slot",59:"Bad font file fmt",60:"Device not a stream",61:"No data (for no delay io)",62:"Timer expired",63:"Out of streams resources",64:"Machine is not on the network",65:"Package not installed",66:"The object is remote",67:"The link has been severed",68:"Advertise error",69:"Srmount error",70:"Communication error on send",71:"Protocol error",72:"Multihop attempted",73:"Cross mount point (not really error)",74:"Trying to read unreadable message",75:"Value too large for defined data type",76:"Given log. name not unique",77:"f.d. invalid for this operation",78:"Remote address changed",79:"Can access a needed shared lib",80:"Accessing a corrupted shared lib",81:".lib section in a.out corrupted",82:"Attempting to link in too many libs",83:"Attempting to exec a shared library",84:"Illegal byte sequence",86:"Streams pipe error",87:"Too many users",88:"Socket operation on non-socket",89:"Destination address required",90:"Message too long",91:"Protocol wrong type for socket",92:"Protocol not available",93:"Unknown protocol",94:"Socket type not supported",95:"Not supported",96:"Protocol family not supported",97:"Address family not supported by protocol family",98:"Address already in use",99:"Address not available",100:"Network interface is not configured",101:"Network is unreachable",102:"Connection reset by network",103:"Connection aborted",104:"Connection reset by peer",105:"No buffer space available",106:"Socket is already connected",107:"Socket is not connected",108:"Can't send after socket shutdown",109:"Too many references",110:"Connection timed out",111:"Connection refused",112:"Host is down",113:"Host is unreachable",114:"Socket already connected",115:"Connection already in progress",116:"Stale file handle",122:"Quota exceeded",123:"No medium (in tape drive)",125:"Operation canceled",130:"Previous owner died",131:"State not recoverable"};
+
+
+ var ___errno_state=0;function ___setErrNo(value) {
+ // For convenient setting and returning of errno.
+ HEAP32[((___errno_state)>>2)]=value;
+ return value;
+ }
+
+ var PATH={splitPath:function (filename) {
+ var splitPathRe = /^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/;
+ return splitPathRe.exec(filename).slice(1);
+ },normalizeArray:function (parts, allowAboveRoot) {
+ // if the path tries to go above the root, `up` ends up > 0
+ var up = 0;
+ for (var i = parts.length - 1; i >= 0; i--) {
+ var last = parts[i];
+ if (last === '.') {
+ parts.splice(i, 1);
+ } else if (last === '..') {
+ parts.splice(i, 1);
+ up++;
+ } else if (up) {
+ parts.splice(i, 1);
+ up--;
+ }
+ }
+ // if the path is allowed to go above the root, restore leading ..s
+ if (allowAboveRoot) {
+ for (; up--; up) {
+ parts.unshift('..');
+ }
+ }
+ return parts;
+ },normalize:function (path) {
+ var isAbsolute = path.charAt(0) === '/',
+ trailingSlash = path.substr(-1) === '/';
+ // Normalize the path
+ path = PATH.normalizeArray(path.split('/').filter(function(p) {
+ return !!p;
+ }), !isAbsolute).join('/');
+ if (!path && !isAbsolute) {
+ path = '.';
+ }
+ if (path && trailingSlash) {
+ path += '/';
+ }
+ return (isAbsolute ? '/' : '') + path;
+ },dirname:function (path) {
+ var result = PATH.splitPath(path),
+ root = result[0],
+ dir = result[1];
+ if (!root && !dir) {
+ // No dirname whatsoever
+ return '.';
+ }
+ if (dir) {
+ // It has a dirname, strip trailing slash
+ dir = dir.substr(0, dir.length - 1);
+ }
+ return root + dir;
+ },basename:function (path) {
+ // EMSCRIPTEN return '/'' for '/', not an empty string
+ if (path === '/') return '/';
+ var lastSlash = path.lastIndexOf('/');
+ if (lastSlash === -1) return path;
+ return path.substr(lastSlash+1);
+ },extname:function (path) {
+ return PATH.splitPath(path)[3];
+ },join:function () {
+ var paths = Array.prototype.slice.call(arguments, 0);
+ return PATH.normalize(paths.join('/'));
+ },join2:function (l, r) {
+ return PATH.normalize(l + '/' + r);
+ },resolve:function () {
+ var resolvedPath = '',
+ resolvedAbsolute = false;
+ for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {
+ var path = (i >= 0) ? arguments[i] : FS.cwd();
+ // Skip empty and invalid entries
+ if (typeof path !== 'string') {
+ throw new TypeError('Arguments to path.resolve must be strings');
+ } else if (!path) {
+ continue;
+ }
+ resolvedPath = path + '/' + resolvedPath;
+ resolvedAbsolute = path.charAt(0) === '/';
+ }
+ // At this point the path should be resolved to a full absolute path, but
+ // handle relative paths to be safe (might happen when process.cwd() fails)
+ resolvedPath = PATH.normalizeArray(resolvedPath.split('/').filter(function(p) {
+ return !!p;
+ }), !resolvedAbsolute).join('/');
+ return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.';
+ },relative:function (from, to) {
+ from = PATH.resolve(from).substr(1);
+ to = PATH.resolve(to).substr(1);
+ function trim(arr) {
+ var start = 0;
+ for (; start < arr.length; start++) {
+ if (arr[start] !== '') break;
+ }
+ var end = arr.length - 1;
+ for (; end >= 0; end--) {
+ if (arr[end] !== '') break;
+ }
+ if (start > end) return [];
+ return arr.slice(start, end - start + 1);
+ }
+ var fromParts = trim(from.split('/'));
+ var toParts = trim(to.split('/'));
+ var length = Math.min(fromParts.length, toParts.length);
+ var samePartsLength = length;
+ for (var i = 0; i < length; i++) {
+ if (fromParts[i] !== toParts[i]) {
+ samePartsLength = i;
+ break;
+ }
+ }
+ var outputParts = [];
+ for (var i = samePartsLength; i < fromParts.length; i++) {
+ outputParts.push('..');
+ }
+ outputParts = outputParts.concat(toParts.slice(samePartsLength));
+ return outputParts.join('/');
+ }};
+
+ var TTY={ttys:[],init:function () {
+ // https://github.com/kripken/emscripten/pull/1555
+ // if (ENVIRONMENT_IS_NODE) {
+ // // currently, FS.init does not distinguish if process.stdin is a file or TTY
+ // // device, it always assumes it's a TTY device. because of this, we're forcing
+ // // process.stdin to UTF8 encoding to at least make stdin reading compatible
+ // // with text files until FS.init can be refactored.
+ // process['stdin']['setEncoding']('utf8');
+ // }
+ },shutdown:function () {
+ // https://github.com/kripken/emscripten/pull/1555
+ // if (ENVIRONMENT_IS_NODE) {
+ // // inolen: any idea as to why node -e 'process.stdin.read()' wouldn't exit immediately (with process.stdin being a tty)?
+ // // isaacs: because now it's reading from the stream, you've expressed interest in it, so that read() kicks off a _read() which creates a ReadReq operation
+ // // inolen: I thought read() in that case was a synchronous operation that just grabbed some amount of buffered data if it exists?
+ // // isaacs: it is. but it also triggers a _read() call, which calls readStart() on the handle
+ // // isaacs: do process.stdin.pause() and i'd think it'd probably close the pending call
+ // process['stdin']['pause']();
+ // }
+ },register:function (dev, ops) {
+ TTY.ttys[dev] = { input: [], output: [], ops: ops };
+ FS.registerDevice(dev, TTY.stream_ops);
+ },stream_ops:{open:function (stream) {
+ var tty = TTY.ttys[stream.node.rdev];
+ if (!tty) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ stream.tty = tty;
+ stream.seekable = false;
+ },close:function (stream) {
+ // flush any pending line data
+ if (stream.tty.output.length) {
+ stream.tty.ops.put_char(stream.tty, 10);
+ }
+ },read:function (stream, buffer, offset, length, pos /* ignored */) {
+ if (!stream.tty || !stream.tty.ops.get_char) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
+ }
+ var bytesRead = 0;
+ for (var i = 0; i < length; i++) {
+ var result;
+ try {
+ result = stream.tty.ops.get_char(stream.tty);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ if (result === undefined && bytesRead === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ if (result === null || result === undefined) break;
+ bytesRead++;
+ buffer[offset+i] = result;
+ }
+ if (bytesRead) {
+ stream.node.timestamp = Date.now();
+ }
+ return bytesRead;
+ },write:function (stream, buffer, offset, length, pos) {
+ if (!stream.tty || !stream.tty.ops.put_char) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
+ }
+ for (var i = 0; i < length; i++) {
+ try {
+ stream.tty.ops.put_char(stream.tty, buffer[offset+i]);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ }
+ if (length) {
+ stream.node.timestamp = Date.now();
+ }
+ return i;
+ }},default_tty_ops:{get_char:function (tty) {
+ if (!tty.input.length) {
+ var result = null;
+ if (ENVIRONMENT_IS_NODE) {
+ result = process['stdin']['read']();
+ if (!result) {
+ if (process['stdin']['_readableState'] && process['stdin']['_readableState']['ended']) {
+ return null; // EOF
+ }
+ return undefined; // no data available
+ }
+ } else if (typeof window != 'undefined' &&
+ typeof window.prompt == 'function') {
+ // Browser.
+ result = window.prompt('Input: '); // returns null on cancel
+ if (result !== null) {
+ result += '\n';
+ }
+ } else if (typeof readline == 'function') {
+ // Command line.
+ result = readline();
+ if (result !== null) {
+ result += '\n';
+ }
+ }
+ if (!result) {
+ return null;
+ }
+ tty.input = intArrayFromString(result, true);
+ }
+ return tty.input.shift();
+ },put_char:function (tty, val) {
+ if (val === null || val === 10) {
+ Module['print'](tty.output.join(''));
+ tty.output = [];
+ } else {
+ tty.output.push(TTY.utf8.processCChar(val));
+ }
+ }},default_tty1_ops:{put_char:function (tty, val) {
+ if (val === null || val === 10) {
+ Module['printErr'](tty.output.join(''));
+ tty.output = [];
+ } else {
+ tty.output.push(TTY.utf8.processCChar(val));
+ }
+ }}};
+
+ var MEMFS={ops_table:null,CONTENT_OWNING:1,CONTENT_FLEXIBLE:2,CONTENT_FIXED:3,mount:function (mount) {
+ return MEMFS.createNode(null, '/', 16384 | 511 /* 0777 */, 0);
+ },createNode:function (parent, name, mode, dev) {
+ if (FS.isBlkdev(mode) || FS.isFIFO(mode)) {
+ // no supported
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (!MEMFS.ops_table) {
+ MEMFS.ops_table = {
+ dir: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr,
+ lookup: MEMFS.node_ops.lookup,
+ mknod: MEMFS.node_ops.mknod,
+ rename: MEMFS.node_ops.rename,
+ unlink: MEMFS.node_ops.unlink,
+ rmdir: MEMFS.node_ops.rmdir,
+ readdir: MEMFS.node_ops.readdir,
+ symlink: MEMFS.node_ops.symlink
+ },
+ stream: {
+ llseek: MEMFS.stream_ops.llseek
+ }
+ },
+ file: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr
+ },
+ stream: {
+ llseek: MEMFS.stream_ops.llseek,
+ read: MEMFS.stream_ops.read,
+ write: MEMFS.stream_ops.write,
+ allocate: MEMFS.stream_ops.allocate,
+ mmap: MEMFS.stream_ops.mmap
+ }
+ },
+ link: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr,
+ readlink: MEMFS.node_ops.readlink
+ },
+ stream: {}
+ },
+ chrdev: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr
+ },
+ stream: FS.chrdev_stream_ops
+ },
+ };
+ }
+ var node = FS.createNode(parent, name, mode, dev);
+ if (FS.isDir(node.mode)) {
+ node.node_ops = MEMFS.ops_table.dir.node;
+ node.stream_ops = MEMFS.ops_table.dir.stream;
+ node.contents = {};
+ } else if (FS.isFile(node.mode)) {
+ node.node_ops = MEMFS.ops_table.file.node;
+ node.stream_ops = MEMFS.ops_table.file.stream;
+ node.contents = [];
+ node.contentMode = MEMFS.CONTENT_FLEXIBLE;
+ } else if (FS.isLink(node.mode)) {
+ node.node_ops = MEMFS.ops_table.link.node;
+ node.stream_ops = MEMFS.ops_table.link.stream;
+ } else if (FS.isChrdev(node.mode)) {
+ node.node_ops = MEMFS.ops_table.chrdev.node;
+ node.stream_ops = MEMFS.ops_table.chrdev.stream;
+ }
+ node.timestamp = Date.now();
+ // add the new node to the parent
+ if (parent) {
+ parent.contents[name] = node;
+ }
+ return node;
+ },ensureFlexible:function (node) {
+ if (node.contentMode !== MEMFS.CONTENT_FLEXIBLE) {
+ var contents = node.contents;
+ node.contents = Array.prototype.slice.call(contents);
+ node.contentMode = MEMFS.CONTENT_FLEXIBLE;
+ }
+ },node_ops:{getattr:function (node) {
+ var attr = {};
+ // device numbers reuse inode numbers.
+ attr.dev = FS.isChrdev(node.mode) ? node.id : 1;
+ attr.ino = node.id;
+ attr.mode = node.mode;
+ attr.nlink = 1;
+ attr.uid = 0;
+ attr.gid = 0;
+ attr.rdev = node.rdev;
+ if (FS.isDir(node.mode)) {
+ attr.size = 4096;
+ } else if (FS.isFile(node.mode)) {
+ attr.size = node.contents.length;
+ } else if (FS.isLink(node.mode)) {
+ attr.size = node.link.length;
+ } else {
+ attr.size = 0;
+ }
+ attr.atime = new Date(node.timestamp);
+ attr.mtime = new Date(node.timestamp);
+ attr.ctime = new Date(node.timestamp);
+ // NOTE: In our implementation, st_blocks = Math.ceil(st_size/st_blksize),
+ // but this is not required by the standard.
+ attr.blksize = 4096;
+ attr.blocks = Math.ceil(attr.size / attr.blksize);
+ return attr;
+ },setattr:function (node, attr) {
+ if (attr.mode !== undefined) {
+ node.mode = attr.mode;
+ }
+ if (attr.timestamp !== undefined) {
+ node.timestamp = attr.timestamp;
+ }
+ if (attr.size !== undefined) {
+ MEMFS.ensureFlexible(node);
+ var contents = node.contents;
+ if (attr.size < contents.length) contents.length = attr.size;
+ else while (attr.size > contents.length) contents.push(0);
+ }
+ },lookup:function (parent, name) {
+ throw FS.genericErrors[ERRNO_CODES.ENOENT];
+ },mknod:function (parent, name, mode, dev) {
+ return MEMFS.createNode(parent, name, mode, dev);
+ },rename:function (old_node, new_dir, new_name) {
+ // if we're overwriting a directory at new_name, make sure it's empty.
+ if (FS.isDir(old_node.mode)) {
+ var new_node;
+ try {
+ new_node = FS.lookupNode(new_dir, new_name);
+ } catch (e) {
+ }
+ if (new_node) {
+ for (var i in new_node.contents) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ }
+ }
+ // do the internal rewiring
+ delete old_node.parent.contents[old_node.name];
+ old_node.name = new_name;
+ new_dir.contents[new_name] = old_node;
+ old_node.parent = new_dir;
+ },unlink:function (parent, name) {
+ delete parent.contents[name];
+ },rmdir:function (parent, name) {
+ var node = FS.lookupNode(parent, name);
+ for (var i in node.contents) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ delete parent.contents[name];
+ },readdir:function (node) {
+ var entries = ['.', '..']
+ for (var key in node.contents) {
+ if (!node.contents.hasOwnProperty(key)) {
+ continue;
+ }
+ entries.push(key);
+ }
+ return entries;
+ },symlink:function (parent, newname, oldpath) {
+ var node = MEMFS.createNode(parent, newname, 511 /* 0777 */ | 40960, 0);
+ node.link = oldpath;
+ return node;
+ },readlink:function (node) {
+ if (!FS.isLink(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ return node.link;
+ }},stream_ops:{read:function (stream, buffer, offset, length, position) {
+ var contents = stream.node.contents;
+ if (position >= contents.length)
+ return 0;
+ var size = Math.min(contents.length - position, length);
+ assert(size >= 0);
+ if (size > 8 && contents.subarray) { // non-trivial, and typed array
+ buffer.set(contents.subarray(position, position + size), offset);
+ } else
+ {
+ for (var i = 0; i < size; i++) {
+ buffer[offset + i] = contents[position + i];
+ }
+ }
+ return size;
+ },write:function (stream, buffer, offset, length, position, canOwn) {
+ var node = stream.node;
+ node.timestamp = Date.now();
+ var contents = node.contents;
+ if (length && contents.length === 0 && position === 0 && buffer.subarray) {
+ // just replace it with the new data
+ if (canOwn && offset === 0) {
+ node.contents = buffer; // this could be a subarray of Emscripten HEAP, or allocated from some other source.
+ node.contentMode = (buffer.buffer === HEAP8.buffer) ? MEMFS.CONTENT_OWNING : MEMFS.CONTENT_FIXED;
+ } else {
+ node.contents = new Uint8Array(buffer.subarray(offset, offset+length));
+ node.contentMode = MEMFS.CONTENT_FIXED;
+ }
+ return length;
+ }
+ MEMFS.ensureFlexible(node);
+ var contents = node.contents;
+ while (contents.length < position) contents.push(0);
+ for (var i = 0; i < length; i++) {
+ contents[position + i] = buffer[offset + i];
+ }
+ return length;
+ },llseek:function (stream, offset, whence) {
+ var position = offset;
+ if (whence === 1) { // SEEK_CUR.
+ position += stream.position;
+ } else if (whence === 2) { // SEEK_END.
+ if (FS.isFile(stream.node.mode)) {
+ position += stream.node.contents.length;
+ }
+ }
+ if (position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ stream.ungotten = [];
+ stream.position = position;
+ return position;
+ },allocate:function (stream, offset, length) {
+ MEMFS.ensureFlexible(stream.node);
+ var contents = stream.node.contents;
+ var limit = offset + length;
+ while (limit > contents.length) contents.push(0);
+ },mmap:function (stream, buffer, offset, length, position, prot, flags) {
+ if (!FS.isFile(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ var ptr;
+ var allocated;
+ var contents = stream.node.contents;
+ // Only make a new copy when MAP_PRIVATE is specified.
+ if ( !(flags & 2) &&
+ (contents.buffer === buffer || contents.buffer === buffer.buffer) ) {
+ // We can't emulate MAP_SHARED when the file is not backed by the buffer
+ // we're mapping to (e.g. the HEAP buffer).
+ allocated = false;
+ ptr = contents.byteOffset;
+ } else {
+ // Try to avoid unnecessary slices.
+ if (position > 0 || position + length < contents.length) {
+ if (contents.subarray) {
+ contents = contents.subarray(position, position + length);
+ } else {
+ contents = Array.prototype.slice.call(contents, position, position + length);
+ }
+ }
+ allocated = true;
+ ptr = _malloc(length);
+ if (!ptr) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOMEM);
+ }
+ buffer.set(contents, ptr);
+ }
+ return { ptr: ptr, allocated: allocated };
+ }}};
+
+ var IDBFS={dbs:{},indexedDB:function () {
+ return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
+ },DB_VERSION:21,DB_STORE_NAME:"FILE_DATA",mount:function (mount) {
+ // reuse all of the core MEMFS functionality
+ return MEMFS.mount.apply(null, arguments);
+ },syncfs:function (mount, populate, callback) {
+ IDBFS.getLocalSet(mount, function(err, local) {
+ if (err) return callback(err);
+
+ IDBFS.getRemoteSet(mount, function(err, remote) {
+ if (err) return callback(err);
+
+ var src = populate ? remote : local;
+ var dst = populate ? local : remote;
+
+ IDBFS.reconcile(src, dst, callback);
+ });
+ });
+ },getDB:function (name, callback) {
+ // check the cache first
+ var db = IDBFS.dbs[name];
+ if (db) {
+ return callback(null, db);
+ }
+
+ var req;
+ try {
+ req = IDBFS.indexedDB().open(name, IDBFS.DB_VERSION);
+ } catch (e) {
+ return callback(e);
+ }
+ req.onupgradeneeded = function(e) {
+ var db = e.target.result;
+ var transaction = e.target.transaction;
+
+ var fileStore;
+
+ if (db.objectStoreNames.contains(IDBFS.DB_STORE_NAME)) {
+ fileStore = transaction.objectStore(IDBFS.DB_STORE_NAME);
+ } else {
+ fileStore = db.createObjectStore(IDBFS.DB_STORE_NAME);
+ }
+
+ fileStore.createIndex('timestamp', 'timestamp', { unique: false });
+ };
+ req.onsuccess = function() {
+ db = req.result;
+
+ // add to the cache
+ IDBFS.dbs[name] = db;
+ callback(null, db);
+ };
+ req.onerror = function() {
+ callback(this.error);
+ };
+ },getLocalSet:function (mount, callback) {
+ var entries = {};
+
+ function isRealDir(p) {
+ return p !== '.' && p !== '..';
+ };
+ function toAbsolute(root) {
+ return function(p) {
+ return PATH.join2(root, p);
+ }
+ };
+
+ var check = FS.readdir(mount.mountpoint).filter(isRealDir).map(toAbsolute(mount.mountpoint));
+
+ while (check.length) {
+ var path = check.pop();
+ var stat;
+
+ try {
+ stat = FS.stat(path);
+ } catch (e) {
+ return callback(e);
+ }
+
+ if (FS.isDir(stat.mode)) {
+ check.push.apply(check, FS.readdir(path).filter(isRealDir).map(toAbsolute(path)));
+ }
+
+ entries[path] = { timestamp: stat.mtime };
+ }
+
+ return callback(null, { type: 'local', entries: entries });
+ },getRemoteSet:function (mount, callback) {
+ var entries = {};
+
+ IDBFS.getDB(mount.mountpoint, function(err, db) {
+ if (err) return callback(err);
+
+ var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readonly');
+ transaction.onerror = function() { callback(this.error); };
+
+ var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
+ var index = store.index('timestamp');
+
+ index.openKeyCursor().onsuccess = function(event) {
+ var cursor = event.target.result;
+
+ if (!cursor) {
+ return callback(null, { type: 'remote', db: db, entries: entries });
+ }
+
+ entries[cursor.primaryKey] = { timestamp: cursor.key };
+
+ cursor.continue();
+ };
+ });
+ },loadLocalEntry:function (path, callback) {
+ var stat, node;
+
+ try {
+ var lookup = FS.lookupPath(path);
+ node = lookup.node;
+ stat = FS.stat(path);
+ } catch (e) {
+ return callback(e);
+ }
+
+ if (FS.isDir(stat.mode)) {
+ return callback(null, { timestamp: stat.mtime, mode: stat.mode });
+ } else if (FS.isFile(stat.mode)) {
+ return callback(null, { timestamp: stat.mtime, mode: stat.mode, contents: node.contents });
+ } else {
+ return callback(new Error('node type not supported'));
+ }
+ },storeLocalEntry:function (path, entry, callback) {
+ try {
+ if (FS.isDir(entry.mode)) {
+ FS.mkdir(path, entry.mode);
+ } else if (FS.isFile(entry.mode)) {
+ FS.writeFile(path, entry.contents, { encoding: 'binary', canOwn: true });
+ } else {
+ return callback(new Error('node type not supported'));
+ }
+
+ FS.utime(path, entry.timestamp, entry.timestamp);
+ } catch (e) {
+ return callback(e);
+ }
+
+ callback(null);
+ },removeLocalEntry:function (path, callback) {
+ try {
+ var lookup = FS.lookupPath(path);
+ var stat = FS.stat(path);
+
+ if (FS.isDir(stat.mode)) {
+ FS.rmdir(path);
+ } else if (FS.isFile(stat.mode)) {
+ FS.unlink(path);
+ }
+ } catch (e) {
+ return callback(e);
+ }
+
+ callback(null);
+ },loadRemoteEntry:function (store, path, callback) {
+ var req = store.get(path);
+ req.onsuccess = function(event) { callback(null, event.target.result); };
+ req.onerror = function() { callback(this.error); };
+ },storeRemoteEntry:function (store, path, entry, callback) {
+ var req = store.put(entry, path);
+ req.onsuccess = function() { callback(null); };
+ req.onerror = function() { callback(this.error); };
+ },removeRemoteEntry:function (store, path, callback) {
+ var req = store.delete(path);
+ req.onsuccess = function() { callback(null); };
+ req.onerror = function() { callback(this.error); };
+ },reconcile:function (src, dst, callback) {
+ var total = 0;
+
+ var create = [];
+ Object.keys(src.entries).forEach(function (key) {
+ var e = src.entries[key];
+ var e2 = dst.entries[key];
+ if (!e2 || e.timestamp > e2.timestamp) {
+ create.push(key);
+ total++;
+ }
+ });
+
+ var remove = [];
+ Object.keys(dst.entries).forEach(function (key) {
+ var e = dst.entries[key];
+ var e2 = src.entries[key];
+ if (!e2) {
+ remove.push(key);
+ total++;
+ }
+ });
+
+ if (!total) {
+ return callback(null);
+ }
+
+ var errored = false;
+ var completed = 0;
+ var db = src.type === 'remote' ? src.db : dst.db;
+ var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readwrite');
+ var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
+
+ function done(err) {
+ if (err) {
+ if (!done.errored) {
+ done.errored = true;
+ return callback(err);
+ }
+ return;
+ }
+ if (++completed >= total) {
+ return callback(null);
+ }
+ };
+
+ transaction.onerror = function() { done(this.error); };
+
+ // sort paths in ascending order so directory entries are created
+ // before the files inside them
+ create.sort().forEach(function (path) {
+ if (dst.type === 'local') {
+ IDBFS.loadRemoteEntry(store, path, function (err, entry) {
+ if (err) return done(err);
+ IDBFS.storeLocalEntry(path, entry, done);
+ });
+ } else {
+ IDBFS.loadLocalEntry(path, function (err, entry) {
+ if (err) return done(err);
+ IDBFS.storeRemoteEntry(store, path, entry, done);
+ });
+ }
+ });
+
+ // sort paths in descending order so files are deleted before their
+ // parent directories
+ remove.sort().reverse().forEach(function(path) {
+ if (dst.type === 'local') {
+ IDBFS.removeLocalEntry(path, done);
+ } else {
+ IDBFS.removeRemoteEntry(store, path, done);
+ }
+ });
+ }};
+
+ var NODEFS={isWindows:false,staticInit:function () {
+ NODEFS.isWindows = !!process.platform.match(/^win/);
+ },mount:function (mount) {
+ assert(ENVIRONMENT_IS_NODE);
+ return NODEFS.createNode(null, '/', NODEFS.getMode(mount.opts.root), 0);
+ },createNode:function (parent, name, mode, dev) {
+ if (!FS.isDir(mode) && !FS.isFile(mode) && !FS.isLink(mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var node = FS.createNode(parent, name, mode);
+ node.node_ops = NODEFS.node_ops;
+ node.stream_ops = NODEFS.stream_ops;
+ return node;
+ },getMode:function (path) {
+ var stat;
+ try {
+ stat = fs.lstatSync(path);
+ if (NODEFS.isWindows) {
+ // On Windows, directories return permission bits 'rw-rw-rw-', even though they have 'rwxrwxrwx', so
+ // propagate write bits to execute bits.
+ stat.mode = stat.mode | ((stat.mode & 146) >> 1);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return stat.mode;
+ },realPath:function (node) {
+ var parts = [];
+ while (node.parent !== node) {
+ parts.push(node.name);
+ node = node.parent;
+ }
+ parts.push(node.mount.opts.root);
+ parts.reverse();
+ return PATH.join.apply(null, parts);
+ },flagsToPermissionStringMap:{0:"r",1:"r+",2:"r+",64:"r",65:"r+",66:"r+",129:"rx+",193:"rx+",514:"w+",577:"w",578:"w+",705:"wx",706:"wx+",1024:"a",1025:"a",1026:"a+",1089:"a",1090:"a+",1153:"ax",1154:"ax+",1217:"ax",1218:"ax+",4096:"rs",4098:"rs+"},flagsToPermissionString:function (flags) {
+ if (flags in NODEFS.flagsToPermissionStringMap) {
+ return NODEFS.flagsToPermissionStringMap[flags];
+ } else {
+ return flags;
+ }
+ },node_ops:{getattr:function (node) {
+ var path = NODEFS.realPath(node);
+ var stat;
+ try {
+ stat = fs.lstatSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ // node.js v0.10.20 doesn't report blksize and blocks on Windows. Fake them with default blksize of 4096.
+ // See http://support.microsoft.com/kb/140365
+ if (NODEFS.isWindows && !stat.blksize) {
+ stat.blksize = 4096;
+ }
+ if (NODEFS.isWindows && !stat.blocks) {
+ stat.blocks = (stat.size+stat.blksize-1)/stat.blksize|0;
+ }
+ return {
+ dev: stat.dev,
+ ino: stat.ino,
+ mode: stat.mode,
+ nlink: stat.nlink,
+ uid: stat.uid,
+ gid: stat.gid,
+ rdev: stat.rdev,
+ size: stat.size,
+ atime: stat.atime,
+ mtime: stat.mtime,
+ ctime: stat.ctime,
+ blksize: stat.blksize,
+ blocks: stat.blocks
+ };
+ },setattr:function (node, attr) {
+ var path = NODEFS.realPath(node);
+ try {
+ if (attr.mode !== undefined) {
+ fs.chmodSync(path, attr.mode);
+ // update the common node structure mode as well
+ node.mode = attr.mode;
+ }
+ if (attr.timestamp !== undefined) {
+ var date = new Date(attr.timestamp);
+ fs.utimesSync(path, date, date);
+ }
+ if (attr.size !== undefined) {
+ fs.truncateSync(path, attr.size);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },lookup:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ var mode = NODEFS.getMode(path);
+ return NODEFS.createNode(parent, name, mode);
+ },mknod:function (parent, name, mode, dev) {
+ var node = NODEFS.createNode(parent, name, mode, dev);
+ // create the backing node for this in the fs root as well
+ var path = NODEFS.realPath(node);
+ try {
+ if (FS.isDir(node.mode)) {
+ fs.mkdirSync(path, node.mode);
+ } else {
+ fs.writeFileSync(path, '', { mode: node.mode });
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return node;
+ },rename:function (oldNode, newDir, newName) {
+ var oldPath = NODEFS.realPath(oldNode);
+ var newPath = PATH.join2(NODEFS.realPath(newDir), newName);
+ try {
+ fs.renameSync(oldPath, newPath);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },unlink:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ try {
+ fs.unlinkSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },rmdir:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ try {
+ fs.rmdirSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },readdir:function (node) {
+ var path = NODEFS.realPath(node);
+ try {
+ return fs.readdirSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },symlink:function (parent, newName, oldPath) {
+ var newPath = PATH.join2(NODEFS.realPath(parent), newName);
+ try {
+ fs.symlinkSync(oldPath, newPath);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },readlink:function (node) {
+ var path = NODEFS.realPath(node);
+ try {
+ return fs.readlinkSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ }},stream_ops:{open:function (stream) {
+ var path = NODEFS.realPath(stream.node);
+ try {
+ if (FS.isFile(stream.node.mode)) {
+ stream.nfd = fs.openSync(path, NODEFS.flagsToPermissionString(stream.flags));
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },close:function (stream) {
+ try {
+ if (FS.isFile(stream.node.mode) && stream.nfd) {
+ fs.closeSync(stream.nfd);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },read:function (stream, buffer, offset, length, position) {
+ // FIXME this is terrible.
+ var nbuffer = new Buffer(length);
+ var res;
+ try {
+ res = fs.readSync(stream.nfd, nbuffer, 0, length, position);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ if (res > 0) {
+ for (var i = 0; i < res; i++) {
+ buffer[offset + i] = nbuffer[i];
+ }
+ }
+ return res;
+ },write:function (stream, buffer, offset, length, position) {
+ // FIXME this is terrible.
+ var nbuffer = new Buffer(buffer.subarray(offset, offset + length));
+ var res;
+ try {
+ res = fs.writeSync(stream.nfd, nbuffer, 0, length, position);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return res;
+ },llseek:function (stream, offset, whence) {
+ var position = offset;
+ if (whence === 1) { // SEEK_CUR.
+ position += stream.position;
+ } else if (whence === 2) { // SEEK_END.
+ if (FS.isFile(stream.node.mode)) {
+ try {
+ var stat = fs.fstatSync(stream.nfd);
+ position += stat.size;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ }
+ }
+
+ if (position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+
+ stream.position = position;
+ return position;
+ }}};
+
+ var _stdin=allocate(1, "i32*", ALLOC_STATIC);
+
+ var _stdout=allocate(1, "i32*", ALLOC_STATIC);
+
+ var _stderr=allocate(1, "i32*", ALLOC_STATIC);
+
+ function _fflush(stream) {
+ // int fflush(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fflush.html
+ // we don't currently perform any user-space buffering of data
+ }var FS={root:null,mounts:[],devices:[null],streams:[],nextInode:1,nameTable:null,currentPath:"/",initialized:false,ignorePermissions:true,ErrnoError:null,genericErrors:{},handleFSError:function (e) {
+ if (!(e instanceof FS.ErrnoError)) throw e + ' : ' + stackTrace();
+ return ___setErrNo(e.errno);
+ },lookupPath:function (path, opts) {
+ path = PATH.resolve(FS.cwd(), path);
+ opts = opts || {};
+
+ var defaults = {
+ follow_mount: true,
+ recurse_count: 0
+ };
+ for (var key in defaults) {
+ if (opts[key] === undefined) {
+ opts[key] = defaults[key];
+ }
+ }
+
+ if (opts.recurse_count > 8) { // max recursive lookup of 8
+ throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
+ }
+
+ // split the path
+ var parts = PATH.normalizeArray(path.split('/').filter(function(p) {
+ return !!p;
+ }), false);
+
+ // start at the root
+ var current = FS.root;
+ var current_path = '/';
+
+ for (var i = 0; i < parts.length; i++) {
+ var islast = (i === parts.length-1);
+ if (islast && opts.parent) {
+ // stop resolving
+ break;
+ }
+
+ current = FS.lookupNode(current, parts[i]);
+ current_path = PATH.join2(current_path, parts[i]);
+
+ // jump to the mount's root node if this is a mountpoint
+ if (FS.isMountpoint(current)) {
+ if (!islast || (islast && opts.follow_mount)) {
+ current = current.mounted.root;
+ }
+ }
+
+ // by default, lookupPath will not follow a symlink if it is the final path component.
+ // setting opts.follow = true will override this behavior.
+ if (!islast || opts.follow) {
+ var count = 0;
+ while (FS.isLink(current.mode)) {
+ var link = FS.readlink(current_path);
+ current_path = PATH.resolve(PATH.dirname(current_path), link);
+
+ var lookup = FS.lookupPath(current_path, { recurse_count: opts.recurse_count });
+ current = lookup.node;
+
+ if (count++ > 40) { // limit max consecutive symlinks to 40 (SYMLOOP_MAX).
+ throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
+ }
+ }
+ }
+ }
+
+ return { path: current_path, node: current };
+ },getPath:function (node) {
+ var path;
+ while (true) {
+ if (FS.isRoot(node)) {
+ var mount = node.mount.mountpoint;
+ if (!path) return mount;
+ return mount[mount.length-1] !== '/' ? mount + '/' + path : mount + path;
+ }
+ path = path ? node.name + '/' + path : node.name;
+ node = node.parent;
+ }
+ },hashName:function (parentid, name) {
+ var hash = 0;
+
+
+ for (var i = 0; i < name.length; i++) {
+ hash = ((hash << 5) - hash + name.charCodeAt(i)) | 0;
+ }
+ return ((parentid + hash) >>> 0) % FS.nameTable.length;
+ },hashAddNode:function (node) {
+ var hash = FS.hashName(node.parent.id, node.name);
+ node.name_next = FS.nameTable[hash];
+ FS.nameTable[hash] = node;
+ },hashRemoveNode:function (node) {
+ var hash = FS.hashName(node.parent.id, node.name);
+ if (FS.nameTable[hash] === node) {
+ FS.nameTable[hash] = node.name_next;
+ } else {
+ var current = FS.nameTable[hash];
+ while (current) {
+ if (current.name_next === node) {
+ current.name_next = node.name_next;
+ break;
+ }
+ current = current.name_next;
+ }
+ }
+ },lookupNode:function (parent, name) {
+ var err = FS.mayLookup(parent);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ var hash = FS.hashName(parent.id, name);
+ for (var node = FS.nameTable[hash]; node; node = node.name_next) {
+ var nodeName = node.name;
+ if (node.parent.id === parent.id && nodeName === name) {
+ return node;
+ }
+ }
+ // if we failed to find it in the cache, call into the VFS
+ return FS.lookup(parent, name);
+ },createNode:function (parent, name, mode, rdev) {
+ if (!FS.FSNode) {
+ FS.FSNode = function(parent, name, mode, rdev) {
+ if (!parent) {
+ parent = this; // root node sets parent to itself
+ }
+ this.parent = parent;
+ this.mount = parent.mount;
+ this.mounted = null;
+ this.id = FS.nextInode++;
+ this.name = name;
+ this.mode = mode;
+ this.node_ops = {};
+ this.stream_ops = {};
+ this.rdev = rdev;
+ };
+
+ FS.FSNode.prototype = {};
+
+ // compatibility
+ var readMode = 292 | 73;
+ var writeMode = 146;
+
+ // NOTE we must use Object.defineProperties instead of individual calls to
+ // Object.defineProperty in order to make closure compiler happy
+ Object.defineProperties(FS.FSNode.prototype, {
+ read: {
+ get: function() { return (this.mode & readMode) === readMode; },
+ set: function(val) { val ? this.mode |= readMode : this.mode &= ~readMode; }
+ },
+ write: {
+ get: function() { return (this.mode & writeMode) === writeMode; },
+ set: function(val) { val ? this.mode |= writeMode : this.mode &= ~writeMode; }
+ },
+ isFolder: {
+ get: function() { return FS.isDir(this.mode); },
+ },
+ isDevice: {
+ get: function() { return FS.isChrdev(this.mode); },
+ },
+ });
+ }
+
+ var node = new FS.FSNode(parent, name, mode, rdev);
+
+ FS.hashAddNode(node);
+
+ return node;
+ },destroyNode:function (node) {
+ FS.hashRemoveNode(node);
+ },isRoot:function (node) {
+ return node === node.parent;
+ },isMountpoint:function (node) {
+ return !!node.mounted;
+ },isFile:function (mode) {
+ return (mode & 61440) === 32768;
+ },isDir:function (mode) {
+ return (mode & 61440) === 16384;
+ },isLink:function (mode) {
+ return (mode & 61440) === 40960;
+ },isChrdev:function (mode) {
+ return (mode & 61440) === 8192;
+ },isBlkdev:function (mode) {
+ return (mode & 61440) === 24576;
+ },isFIFO:function (mode) {
+ return (mode & 61440) === 4096;
+ },isSocket:function (mode) {
+ return (mode & 49152) === 49152;
+ },flagModes:{"r":0,"rs":1052672,"r+":2,"w":577,"wx":705,"xw":705,"w+":578,"wx+":706,"xw+":706,"a":1089,"ax":1217,"xa":1217,"a+":1090,"ax+":1218,"xa+":1218},modeStringToFlags:function (str) {
+ var flags = FS.flagModes[str];
+ if (typeof flags === 'undefined') {
+ throw new Error('Unknown file open mode: ' + str);
+ }
+ return flags;
+ },flagsToPermissionString:function (flag) {
+ var accmode = flag & 2097155;
+ var perms = ['r', 'w', 'rw'][accmode];
+ if ((flag & 512)) {
+ perms += 'w';
+ }
+ return perms;
+ },nodePermissions:function (node, perms) {
+ if (FS.ignorePermissions) {
+ return 0;
+ }
+ // return 0 if any user, group or owner bits are set.
+ if (perms.indexOf('r') !== -1 && !(node.mode & 292)) {
+ return ERRNO_CODES.EACCES;
+ } else if (perms.indexOf('w') !== -1 && !(node.mode & 146)) {
+ return ERRNO_CODES.EACCES;
+ } else if (perms.indexOf('x') !== -1 && !(node.mode & 73)) {
+ return ERRNO_CODES.EACCES;
+ }
+ return 0;
+ },mayLookup:function (dir) {
+ return FS.nodePermissions(dir, 'x');
+ },mayCreate:function (dir, name) {
+ try {
+ var node = FS.lookupNode(dir, name);
+ return ERRNO_CODES.EEXIST;
+ } catch (e) {
+ }
+ return FS.nodePermissions(dir, 'wx');
+ },mayDelete:function (dir, name, isdir) {
+ var node;
+ try {
+ node = FS.lookupNode(dir, name);
+ } catch (e) {
+ return e.errno;
+ }
+ var err = FS.nodePermissions(dir, 'wx');
+ if (err) {
+ return err;
+ }
+ if (isdir) {
+ if (!FS.isDir(node.mode)) {
+ return ERRNO_CODES.ENOTDIR;
+ }
+ if (FS.isRoot(node) || FS.getPath(node) === FS.cwd()) {
+ return ERRNO_CODES.EBUSY;
+ }
+ } else {
+ if (FS.isDir(node.mode)) {
+ return ERRNO_CODES.EISDIR;
+ }
+ }
+ return 0;
+ },mayOpen:function (node, flags) {
+ if (!node) {
+ return ERRNO_CODES.ENOENT;
+ }
+ if (FS.isLink(node.mode)) {
+ return ERRNO_CODES.ELOOP;
+ } else if (FS.isDir(node.mode)) {
+ if ((flags & 2097155) !== 0 || // opening for write
+ (flags & 512)) {
+ return ERRNO_CODES.EISDIR;
+ }
+ }
+ return FS.nodePermissions(node, FS.flagsToPermissionString(flags));
+ },MAX_OPEN_FDS:4096,nextfd:function (fd_start, fd_end) {
+ fd_start = fd_start || 0;
+ fd_end = fd_end || FS.MAX_OPEN_FDS;
+ for (var fd = fd_start; fd <= fd_end; fd++) {
+ if (!FS.streams[fd]) {
+ return fd;
+ }
+ }
+ throw new FS.ErrnoError(ERRNO_CODES.EMFILE);
+ },getStream:function (fd) {
+ return FS.streams[fd];
+ },createStream:function (stream, fd_start, fd_end) {
+ if (!FS.FSStream) {
+ FS.FSStream = function(){};
+ FS.FSStream.prototype = {};
+ // compatibility
+ Object.defineProperties(FS.FSStream.prototype, {
+ object: {
+ get: function() { return this.node; },
+ set: function(val) { this.node = val; }
+ },
+ isRead: {
+ get: function() { return (this.flags & 2097155) !== 1; }
+ },
+ isWrite: {
+ get: function() { return (this.flags & 2097155) !== 0; }
+ },
+ isAppend: {
+ get: function() { return (this.flags & 1024); }
+ }
+ });
+ }
+ if (0) {
+ // reuse the object
+ stream.__proto__ = FS.FSStream.prototype;
+ } else {
+ var newStream = new FS.FSStream();
+ for (var p in stream) {
+ newStream[p] = stream[p];
+ }
+ stream = newStream;
+ }
+ var fd = FS.nextfd(fd_start, fd_end);
+ stream.fd = fd;
+ FS.streams[fd] = stream;
+ return stream;
+ },closeStream:function (fd) {
+ FS.streams[fd] = null;
+ },getStreamFromPtr:function (ptr) {
+ return FS.streams[ptr - 1];
+ },getPtrForStream:function (stream) {
+ return stream ? stream.fd + 1 : 0;
+ },chrdev_stream_ops:{open:function (stream) {
+ var device = FS.getDevice(stream.node.rdev);
+ // override node's stream ops with the device's
+ stream.stream_ops = device.stream_ops;
+ // forward the open call
+ if (stream.stream_ops.open) {
+ stream.stream_ops.open(stream);
+ }
+ },llseek:function () {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }},major:function (dev) {
+ return ((dev) >> 8);
+ },minor:function (dev) {
+ return ((dev) & 0xff);
+ },makedev:function (ma, mi) {
+ return ((ma) << 8 | (mi));
+ },registerDevice:function (dev, ops) {
+ FS.devices[dev] = { stream_ops: ops };
+ },getDevice:function (dev) {
+ return FS.devices[dev];
+ },getMounts:function (mount) {
+ var mounts = [];
+ var check = [mount];
+
+ while (check.length) {
+ var m = check.pop();
+
+ mounts.push(m);
+
+ check.push.apply(check, m.mounts);
+ }
+
+ return mounts;
+ },syncfs:function (populate, callback) {
+ if (typeof(populate) === 'function') {
+ callback = populate;
+ populate = false;
+ }
+
+ var mounts = FS.getMounts(FS.root.mount);
+ var completed = 0;
+
+ function done(err) {
+ if (err) {
+ if (!done.errored) {
+ done.errored = true;
+ return callback(err);
+ }
+ return;
+ }
+ if (++completed >= mounts.length) {
+ callback(null);
+ }
+ };
+
+ // sync all mounts
+ mounts.forEach(function (mount) {
+ if (!mount.type.syncfs) {
+ return done(null);
+ }
+ mount.type.syncfs(mount, populate, done);
+ });
+ },mount:function (type, opts, mountpoint) {
+ var root = mountpoint === '/';
+ var pseudo = !mountpoint;
+ var node;
+
+ if (root && FS.root) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ } else if (!root && !pseudo) {
+ var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
+
+ mountpoint = lookup.path; // use the absolute path
+ node = lookup.node;
+
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+
+ if (!FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ }
+
+ var mount = {
+ type: type,
+ opts: opts,
+ mountpoint: mountpoint,
+ mounts: []
+ };
+
+ // create a root node for the fs
+ var mountRoot = type.mount(mount);
+ mountRoot.mount = mount;
+ mount.root = mountRoot;
+
+ if (root) {
+ FS.root = mountRoot;
+ } else if (node) {
+ // set as a mountpoint
+ node.mounted = mount;
+
+ // add the new mount to the current mount's children
+ if (node.mount) {
+ node.mount.mounts.push(mount);
+ }
+ }
+
+ return mountRoot;
+ },unmount:function (mountpoint) {
+ var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
+
+ if (!FS.isMountpoint(lookup.node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+
+ // destroy the nodes for this mount, and all its child mounts
+ var node = lookup.node;
+ var mount = node.mounted;
+ var mounts = FS.getMounts(mount);
+
+ Object.keys(FS.nameTable).forEach(function (hash) {
+ var current = FS.nameTable[hash];
+
+ while (current) {
+ var next = current.name_next;
+
+ if (mounts.indexOf(current.mount) !== -1) {
+ FS.destroyNode(current);
+ }
+
+ current = next;
+ }
+ });
+
+ // no longer a mountpoint
+ node.mounted = null;
+
+ // remove this mount from the child mounts
+ var idx = node.mount.mounts.indexOf(mount);
+ assert(idx !== -1);
+ node.mount.mounts.splice(idx, 1);
+ },lookup:function (parent, name) {
+ return parent.node_ops.lookup(parent, name);
+ },mknod:function (path, mode, dev) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var err = FS.mayCreate(parent, name);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.mknod) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return parent.node_ops.mknod(parent, name, mode, dev);
+ },create:function (path, mode) {
+ mode = mode !== undefined ? mode : 438 /* 0666 */;
+ mode &= 4095;
+ mode |= 32768;
+ return FS.mknod(path, mode, 0);
+ },mkdir:function (path, mode) {
+ mode = mode !== undefined ? mode : 511 /* 0777 */;
+ mode &= 511 | 512;
+ mode |= 16384;
+ return FS.mknod(path, mode, 0);
+ },mkdev:function (path, mode, dev) {
+ if (typeof(dev) === 'undefined') {
+ dev = mode;
+ mode = 438 /* 0666 */;
+ }
+ mode |= 8192;
+ return FS.mknod(path, mode, dev);
+ },symlink:function (oldpath, newpath) {
+ var lookup = FS.lookupPath(newpath, { parent: true });
+ var parent = lookup.node;
+ var newname = PATH.basename(newpath);
+ var err = FS.mayCreate(parent, newname);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.symlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return parent.node_ops.symlink(parent, newname, oldpath);
+ },rename:function (old_path, new_path) {
+ var old_dirname = PATH.dirname(old_path);
+ var new_dirname = PATH.dirname(new_path);
+ var old_name = PATH.basename(old_path);
+ var new_name = PATH.basename(new_path);
+ // parents must exist
+ var lookup, old_dir, new_dir;
+ try {
+ lookup = FS.lookupPath(old_path, { parent: true });
+ old_dir = lookup.node;
+ lookup = FS.lookupPath(new_path, { parent: true });
+ new_dir = lookup.node;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ // need to be part of the same mount
+ if (old_dir.mount !== new_dir.mount) {
+ throw new FS.ErrnoError(ERRNO_CODES.EXDEV);
+ }
+ // source must exist
+ var old_node = FS.lookupNode(old_dir, old_name);
+ // old path should not be an ancestor of the new path
+ var relative = PATH.relative(old_path, new_dirname);
+ if (relative.charAt(0) !== '.') {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ // new path should not be an ancestor of the old path
+ relative = PATH.relative(new_path, old_dirname);
+ if (relative.charAt(0) !== '.') {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ // see if the new path already exists
+ var new_node;
+ try {
+ new_node = FS.lookupNode(new_dir, new_name);
+ } catch (e) {
+ // not fatal
+ }
+ // early out if nothing needs to change
+ if (old_node === new_node) {
+ return;
+ }
+ // we'll need to delete the old entry
+ var isdir = FS.isDir(old_node.mode);
+ var err = FS.mayDelete(old_dir, old_name, isdir);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ // need delete permissions if we'll be overwriting.
+ // need create permissions if new doesn't already exist.
+ err = new_node ?
+ FS.mayDelete(new_dir, new_name, isdir) :
+ FS.mayCreate(new_dir, new_name);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!old_dir.node_ops.rename) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(old_node) || (new_node && FS.isMountpoint(new_node))) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ // if we are going to change the parent, check write permissions
+ if (new_dir !== old_dir) {
+ err = FS.nodePermissions(old_dir, 'w');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ }
+ // remove the node from the lookup hash
+ FS.hashRemoveNode(old_node);
+ // do the underlying fs rename
+ try {
+ old_dir.node_ops.rename(old_node, new_dir, new_name);
+ } catch (e) {
+ throw e;
+ } finally {
+ // add the node back to the hash (in case node_ops.rename
+ // changed its name)
+ FS.hashAddNode(old_node);
+ }
+ },rmdir:function (path) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var node = FS.lookupNode(parent, name);
+ var err = FS.mayDelete(parent, name, true);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.rmdir) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ parent.node_ops.rmdir(parent, name);
+ FS.destroyNode(node);
+ },readdir:function (path) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ var node = lookup.node;
+ if (!node.node_ops.readdir) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ return node.node_ops.readdir(node);
+ },unlink:function (path) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var node = FS.lookupNode(parent, name);
+ var err = FS.mayDelete(parent, name, false);
+ if (err) {
+ // POSIX says unlink should set EPERM, not EISDIR
+ if (err === ERRNO_CODES.EISDIR) err = ERRNO_CODES.EPERM;
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.unlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ parent.node_ops.unlink(parent, name);
+ FS.destroyNode(node);
+ },readlink:function (path) {
+ var lookup = FS.lookupPath(path);
+ var link = lookup.node;
+ if (!link.node_ops.readlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ return link.node_ops.readlink(link);
+ },stat:function (path, dontFollow) {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ var node = lookup.node;
+ if (!node.node_ops.getattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return node.node_ops.getattr(node);
+ },lstat:function (path) {
+ return FS.stat(path, true);
+ },chmod:function (path, mode, dontFollow) {
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ node.node_ops.setattr(node, {
+ mode: (mode & 4095) | (node.mode & ~4095),
+ timestamp: Date.now()
+ });
+ },lchmod:function (path, mode) {
+ FS.chmod(path, mode, true);
+ },fchmod:function (fd, mode) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ FS.chmod(stream.node, mode);
+ },chown:function (path, uid, gid, dontFollow) {
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ node.node_ops.setattr(node, {
+ timestamp: Date.now()
+ // we ignore the uid / gid for now
+ });
+ },lchown:function (path, uid, gid) {
+ FS.chown(path, uid, gid, true);
+ },fchown:function (fd, uid, gid) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ FS.chown(stream.node, uid, gid);
+ },truncate:function (path, len) {
+ if (len < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: true });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!FS.isFile(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var err = FS.nodePermissions(node, 'w');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ node.node_ops.setattr(node, {
+ size: len,
+ timestamp: Date.now()
+ });
+ },ftruncate:function (fd, len) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ FS.truncate(stream.node, len);
+ },utime:function (path, atime, mtime) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ var node = lookup.node;
+ node.node_ops.setattr(node, {
+ timestamp: Math.max(atime, mtime)
+ });
+ },open:function (path, flags, mode, fd_start, fd_end) {
+ flags = typeof flags === 'string' ? FS.modeStringToFlags(flags) : flags;
+ mode = typeof mode === 'undefined' ? 438 /* 0666 */ : mode;
+ if ((flags & 64)) {
+ mode = (mode & 4095) | 32768;
+ } else {
+ mode = 0;
+ }
+ var node;
+ if (typeof path === 'object') {
+ node = path;
+ } else {
+ path = PATH.normalize(path);
+ try {
+ var lookup = FS.lookupPath(path, {
+ follow: !(flags & 131072)
+ });
+ node = lookup.node;
+ } catch (e) {
+ // ignore
+ }
+ }
+ // perhaps we need to create the node
+ if ((flags & 64)) {
+ if (node) {
+ // if O_CREAT and O_EXCL are set, error out if the node already exists
+ if ((flags & 128)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EEXIST);
+ }
+ } else {
+ // node doesn't exist, try to create it
+ node = FS.mknod(path, mode, 0);
+ }
+ }
+ if (!node) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
+ }
+ // can't truncate a device
+ if (FS.isChrdev(node.mode)) {
+ flags &= ~512;
+ }
+ // check permissions
+ var err = FS.mayOpen(node, flags);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ // do truncation if necessary
+ if ((flags & 512)) {
+ FS.truncate(node, 0);
+ }
+ // we've already handled these, don't pass down to the underlying vfs
+ flags &= ~(128 | 512);
+
+ // register the stream with the filesystem
+ var stream = FS.createStream({
+ node: node,
+ path: FS.getPath(node), // we want the absolute path to the node
+ flags: flags,
+ seekable: true,
+ position: 0,
+ stream_ops: node.stream_ops,
+ // used by the file family libc calls (fopen, fwrite, ferror, etc.)
+ ungotten: [],
+ error: false
+ }, fd_start, fd_end);
+ // call the new stream's open function
+ if (stream.stream_ops.open) {
+ stream.stream_ops.open(stream);
+ }
+ if (Module['logReadFiles'] && !(flags & 1)) {
+ if (!FS.readFiles) FS.readFiles = {};
+ if (!(path in FS.readFiles)) {
+ FS.readFiles[path] = 1;
+ Module['printErr']('read file: ' + path);
+ }
+ }
+ return stream;
+ },close:function (stream) {
+ try {
+ if (stream.stream_ops.close) {
+ stream.stream_ops.close(stream);
+ }
+ } catch (e) {
+ throw e;
+ } finally {
+ FS.closeStream(stream.fd);
+ }
+ },llseek:function (stream, offset, whence) {
+ if (!stream.seekable || !stream.stream_ops.llseek) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ return stream.stream_ops.llseek(stream, offset, whence);
+ },read:function (stream, buffer, offset, length, position) {
+ if (length < 0 || position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 1) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (FS.isDir(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!stream.stream_ops.read) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var seeking = true;
+ if (typeof position === 'undefined') {
+ position = stream.position;
+ seeking = false;
+ } else if (!stream.seekable) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ var bytesRead = stream.stream_ops.read(stream, buffer, offset, length, position);
+ if (!seeking) stream.position += bytesRead;
+ return bytesRead;
+ },write:function (stream, buffer, offset, length, position, canOwn) {
+ if (length < 0 || position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (FS.isDir(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!stream.stream_ops.write) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var seeking = true;
+ if (typeof position === 'undefined') {
+ position = stream.position;
+ seeking = false;
+ } else if (!stream.seekable) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ if (stream.flags & 1024) {
+ // seek to the end before writing in append mode
+ FS.llseek(stream, 0, 2);
+ }
+ var bytesWritten = stream.stream_ops.write(stream, buffer, offset, length, position, canOwn);
+ if (!seeking) stream.position += bytesWritten;
+ return bytesWritten;
+ },allocate:function (stream, offset, length) {
+ if (offset < 0 || length <= 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (!FS.isFile(stream.node.mode) && !FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ if (!stream.stream_ops.allocate) {
+ throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
+ }
+ stream.stream_ops.allocate(stream, offset, length);
+ },mmap:function (stream, buffer, offset, length, position, prot, flags) {
+ // TODO if PROT is PROT_WRITE, make sure we have write access
+ if ((stream.flags & 2097155) === 1) {
+ throw new FS.ErrnoError(ERRNO_CODES.EACCES);
+ }
+ if (!stream.stream_ops.mmap) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ return stream.stream_ops.mmap(stream, buffer, offset, length, position, prot, flags);
+ },ioctl:function (stream, cmd, arg) {
+ if (!stream.stream_ops.ioctl) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTTY);
+ }
+ return stream.stream_ops.ioctl(stream, cmd, arg);
+ },readFile:function (path, opts) {
+ opts = opts || {};
+ opts.flags = opts.flags || 'r';
+ opts.encoding = opts.encoding || 'binary';
+ if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
+ throw new Error('Invalid encoding type "' + opts.encoding + '"');
+ }
+ var ret;
+ var stream = FS.open(path, opts.flags);
+ var stat = FS.stat(path);
+ var length = stat.size;
+ var buf = new Uint8Array(length);
+ FS.read(stream, buf, 0, length, 0);
+ if (opts.encoding === 'utf8') {
+ ret = '';
+ var utf8 = new Runtime.UTF8Processor();
+ for (var i = 0; i < length; i++) {
+ ret += utf8.processCChar(buf[i]);
+ }
+ } else if (opts.encoding === 'binary') {
+ ret = buf;
+ }
+ FS.close(stream);
+ return ret;
+ },writeFile:function (path, data, opts) {
+ opts = opts || {};
+ opts.flags = opts.flags || 'w';
+ opts.encoding = opts.encoding || 'utf8';
+ if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
+ throw new Error('Invalid encoding type "' + opts.encoding + '"');
+ }
+ var stream = FS.open(path, opts.flags, opts.mode);
+ if (opts.encoding === 'utf8') {
+ var utf8 = new Runtime.UTF8Processor();
+ var buf = new Uint8Array(utf8.processJSString(data));
+ FS.write(stream, buf, 0, buf.length, 0, opts.canOwn);
+ } else if (opts.encoding === 'binary') {
+ FS.write(stream, data, 0, data.length, 0, opts.canOwn);
+ }
+ FS.close(stream);
+ },cwd:function () {
+ return FS.currentPath;
+ },chdir:function (path) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ if (!FS.isDir(lookup.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ var err = FS.nodePermissions(lookup.node, 'x');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ FS.currentPath = lookup.path;
+ },createDefaultDirectories:function () {
+ FS.mkdir('/tmp');
+ },createDefaultDevices:function () {
+ // create /dev
+ FS.mkdir('/dev');
+ // setup /dev/null
+ FS.registerDevice(FS.makedev(1, 3), {
+ read: function() { return 0; },
+ write: function() { return 0; }
+ });
+ FS.mkdev('/dev/null', FS.makedev(1, 3));
+ // setup /dev/tty and /dev/tty1
+ // stderr needs to print output using Module['printErr']
+ // so we register a second tty just for it.
+ TTY.register(FS.makedev(5, 0), TTY.default_tty_ops);
+ TTY.register(FS.makedev(6, 0), TTY.default_tty1_ops);
+ FS.mkdev('/dev/tty', FS.makedev(5, 0));
+ FS.mkdev('/dev/tty1', FS.makedev(6, 0));
+ // we're not going to emulate the actual shm device,
+ // just create the tmp dirs that reside in it commonly
+ FS.mkdir('/dev/shm');
+ FS.mkdir('/dev/shm/tmp');
+ },createStandardStreams:function () {
+ // TODO deprecate the old functionality of a single
+ // input / output callback and that utilizes FS.createDevice
+ // and instead require a unique set of stream ops
+
+ // by default, we symlink the standard streams to the
+ // default tty devices. however, if the standard streams
+ // have been overwritten we create a unique device for
+ // them instead.
+ if (Module['stdin']) {
+ FS.createDevice('/dev', 'stdin', Module['stdin']);
+ } else {
+ FS.symlink('/dev/tty', '/dev/stdin');
+ }
+ if (Module['stdout']) {
+ FS.createDevice('/dev', 'stdout', null, Module['stdout']);
+ } else {
+ FS.symlink('/dev/tty', '/dev/stdout');
+ }
+ if (Module['stderr']) {
+ FS.createDevice('/dev', 'stderr', null, Module['stderr']);
+ } else {
+ FS.symlink('/dev/tty1', '/dev/stderr');
+ }
+
+ // open default streams for the stdin, stdout and stderr devices
+ var stdin = FS.open('/dev/stdin', 'r');
+ HEAP32[((_stdin)>>2)]=FS.getPtrForStream(stdin);
+ assert(stdin.fd === 0, 'invalid handle for stdin (' + stdin.fd + ')');
+
+ var stdout = FS.open('/dev/stdout', 'w');
+ HEAP32[((_stdout)>>2)]=FS.getPtrForStream(stdout);
+ assert(stdout.fd === 1, 'invalid handle for stdout (' + stdout.fd + ')');
+
+ var stderr = FS.open('/dev/stderr', 'w');
+ HEAP32[((_stderr)>>2)]=FS.getPtrForStream(stderr);
+ assert(stderr.fd === 2, 'invalid handle for stderr (' + stderr.fd + ')');
+ },ensureErrnoError:function () {
+ if (FS.ErrnoError) return;
+ FS.ErrnoError = function ErrnoError(errno) {
+ this.errno = errno;
+ for (var key in ERRNO_CODES) {
+ if (ERRNO_CODES[key] === errno) {
+ this.code = key;
+ break;
+ }
+ }
+ this.message = ERRNO_MESSAGES[errno];
+ };
+ FS.ErrnoError.prototype = new Error();
+ FS.ErrnoError.prototype.constructor = FS.ErrnoError;
+ // Some errors may happen quite a bit, to avoid overhead we reuse them (and suffer a lack of stack info)
+ [ERRNO_CODES.ENOENT].forEach(function(code) {
+ FS.genericErrors[code] = new FS.ErrnoError(code);
+ FS.genericErrors[code].stack = '<generic error, no stack>';
+ });
+ },staticInit:function () {
+ FS.ensureErrnoError();
+
+ FS.nameTable = new Array(4096);
+
+ FS.mount(MEMFS, {}, '/');
+
+ FS.createDefaultDirectories();
+ FS.createDefaultDevices();
+ },init:function (input, output, error) {
+ assert(!FS.init.initialized, 'FS.init was previously called. If you want to initialize later with custom parameters, remove any earlier calls (note that one is automatically added to the generated code)');
+ FS.init.initialized = true;
+
+ FS.ensureErrnoError();
+
+ // Allow Module.stdin etc. to provide defaults, if none explicitly passed to us here
+ Module['stdin'] = input || Module['stdin'];
+ Module['stdout'] = output || Module['stdout'];
+ Module['stderr'] = error || Module['stderr'];
+
+ FS.createStandardStreams();
+ },quit:function () {
+ FS.init.initialized = false;
+ for (var i = 0; i < FS.streams.length; i++) {
+ var stream = FS.streams[i];
+ if (!stream) {
+ continue;
+ }
+ FS.close(stream);
+ }
+ },getMode:function (canRead, canWrite) {
+ var mode = 0;
+ if (canRead) mode |= 292 | 73;
+ if (canWrite) mode |= 146;
+ return mode;
+ },joinPath:function (parts, forceRelative) {
+ var path = PATH.join.apply(null, parts);
+ if (forceRelative && path[0] == '/') path = path.substr(1);
+ return path;
+ },absolutePath:function (relative, base) {
+ return PATH.resolve(base, relative);
+ },standardizePath:function (path) {
+ return PATH.normalize(path);
+ },findObject:function (path, dontResolveLastLink) {
+ var ret = FS.analyzePath(path, dontResolveLastLink);
+ if (ret.exists) {
+ return ret.object;
+ } else {
+ ___setErrNo(ret.error);
+ return null;
+ }
+ },analyzePath:function (path, dontResolveLastLink) {
+ // operate from within the context of the symlink's target
+ try {
+ var lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
+ path = lookup.path;
+ } catch (e) {
+ }
+ var ret = {
+ isRoot: false, exists: false, error: 0, name: null, path: null, object: null,
+ parentExists: false, parentPath: null, parentObject: null
+ };
+ try {
+ var lookup = FS.lookupPath(path, { parent: true });
+ ret.parentExists = true;
+ ret.parentPath = lookup.path;
+ ret.parentObject = lookup.node;
+ ret.name = PATH.basename(path);
+ lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
+ ret.exists = true;
+ ret.path = lookup.path;
+ ret.object = lookup.node;
+ ret.name = lookup.node.name;
+ ret.isRoot = lookup.path === '/';
+ } catch (e) {
+ ret.error = e.errno;
+ };
+ return ret;
+ },createFolder:function (parent, name, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(canRead, canWrite);
+ return FS.mkdir(path, mode);
+ },createPath:function (parent, path, canRead, canWrite) {
+ parent = typeof parent === 'string' ? parent : FS.getPath(parent);
+ var parts = path.split('/').reverse();
+ while (parts.length) {
+ var part = parts.pop();
+ if (!part) continue;
+ var current = PATH.join2(parent, part);
+ try {
+ FS.mkdir(current);
+ } catch (e) {
+ // ignore EEXIST
+ }
+ parent = current;
+ }
+ return current;
+ },createFile:function (parent, name, properties, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(canRead, canWrite);
+ return FS.create(path, mode);
+ },createDataFile:function (parent, name, data, canRead, canWrite, canOwn) {
+ var path = name ? PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name) : parent;
+ var mode = FS.getMode(canRead, canWrite);
+ var node = FS.create(path, mode);
+ if (data) {
+ if (typeof data === 'string') {
+ var arr = new Array(data.length);
+ for (var i = 0, len = data.length; i < len; ++i) arr[i] = data.charCodeAt(i);
+ data = arr;
+ }
+ // make sure we can write to the file
+ FS.chmod(node, mode | 146);
+ var stream = FS.open(node, 'w');
+ FS.write(stream, data, 0, data.length, 0, canOwn);
+ FS.close(stream);
+ FS.chmod(node, mode);
+ }
+ return node;
+ },createDevice:function (parent, name, input, output) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(!!input, !!output);
+ if (!FS.createDevice.major) FS.createDevice.major = 64;
+ var dev = FS.makedev(FS.createDevice.major++, 0);
+ // Create a fake device that a set of stream ops to emulate
+ // the old behavior.
+ FS.registerDevice(dev, {
+ open: function(stream) {
+ stream.seekable = false;
+ },
+ close: function(stream) {
+ // flush any pending line data
+ if (output && output.buffer && output.buffer.length) {
+ output(10);
+ }
+ },
+ read: function(stream, buffer, offset, length, pos /* ignored */) {
+ var bytesRead = 0;
+ for (var i = 0; i < length; i++) {
+ var result;
+ try {
+ result = input();
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ if (result === undefined && bytesRead === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ if (result === null || result === undefined) break;
+ bytesRead++;
+ buffer[offset+i] = result;
+ }
+ if (bytesRead) {
+ stream.node.timestamp = Date.now();
+ }
+ return bytesRead;
+ },
+ write: function(stream, buffer, offset, length, pos) {
+ for (var i = 0; i < length; i++) {
+ try {
+ output(buffer[offset+i]);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ }
+ if (length) {
+ stream.node.timestamp = Date.now();
+ }
+ return i;
+ }
+ });
+ return FS.mkdev(path, mode, dev);
+ },createLink:function (parent, name, target, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ return FS.symlink(target, path);
+ },forceLoadFile:function (obj) {
+ if (obj.isDevice || obj.isFolder || obj.link || obj.contents) return true;
+ var success = true;
+ if (typeof XMLHttpRequest !== 'undefined') {
+ throw new Error("Lazy loading should have been performed (contents set) in createLazyFile, but it was not. Lazy loading only works in web workers. Use --embed-file or --preload-file in emcc on the main thread.");
+ } else if (Module['read']) {
+ // Command-line.
+ try {
+ // WARNING: Can't read binary files in V8's d8 or tracemonkey's js, as
+ // read() will try to parse UTF8.
+ obj.contents = intArrayFromString(Module['read'](obj.url), true);
+ } catch (e) {
+ success = false;
+ }
+ } else {
+ throw new Error('Cannot load without read() or XMLHttpRequest.');
+ }
+ if (!success) ___setErrNo(ERRNO_CODES.EIO);
+ return success;
+ },createLazyFile:function (parent, name, url, canRead, canWrite) {
+ // Lazy chunked Uint8Array (implements get and length from Uint8Array). Actual getting is abstracted away for eventual reuse.
+ function LazyUint8Array() {
+ this.lengthKnown = false;
+ this.chunks = []; // Loaded chunks. Index is the chunk number
+ }
+ LazyUint8Array.prototype.get = function LazyUint8Array_get(idx) {
+ if (idx > this.length-1 || idx < 0) {
+ return undefined;
+ }
+ var chunkOffset = idx % this.chunkSize;
+ var chunkNum = Math.floor(idx / this.chunkSize);
+ return this.getter(chunkNum)[chunkOffset];
+ }
+ LazyUint8Array.prototype.setDataGetter = function LazyUint8Array_setDataGetter(getter) {
+ this.getter = getter;
+ }
+ LazyUint8Array.prototype.cacheLength = function LazyUint8Array_cacheLength() {
+ // Find length
+ var xhr = new XMLHttpRequest();
+ xhr.open('HEAD', url, false);
+ xhr.send(null);
+ if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
+ var datalength = Number(xhr.getResponseHeader("Content-length"));
+ var header;
+ var hasByteServing = (header = xhr.getResponseHeader("Accept-Ranges")) && header === "bytes";
+ var chunkSize = 1024*1024; // Chunk size in bytes
+
+ if (!hasByteServing) chunkSize = datalength;
+
+ // Function to get a range from the remote URL.
+ var doXHR = (function(from, to) {
+ if (from > to) throw new Error("invalid range (" + from + ", " + to + ") or no bytes requested!");
+ if (to > datalength-1) throw new Error("only " + datalength + " bytes available! programmer error!");
+
+ // TODO: Use mozResponseArrayBuffer, responseStream, etc. if available.
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, false);
+ if (datalength !== chunkSize) xhr.setRequestHeader("Range", "bytes=" + from + "-" + to);
+
+ // Some hints to the browser that we want binary data.
+ if (typeof Uint8Array != 'undefined') xhr.responseType = 'arraybuffer';
+ if (xhr.overrideMimeType) {
+ xhr.overrideMimeType('text/plain; charset=x-user-defined');
+ }
+
+ xhr.send(null);
+ if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
+ if (xhr.response !== undefined) {
+ return new Uint8Array(xhr.response || []);
+ } else {
+ return intArrayFromString(xhr.responseText || '', true);
+ }
+ });
+ var lazyArray = this;
+ lazyArray.setDataGetter(function(chunkNum) {
+ var start = chunkNum * chunkSize;
+ var end = (chunkNum+1) * chunkSize - 1; // including this byte
+ end = Math.min(end, datalength-1); // if datalength-1 is selected, this is the last block
+ if (typeof(lazyArray.chunks[chunkNum]) === "undefined") {
+ lazyArray.chunks[chunkNum] = doXHR(start, end);
+ }
+ if (typeof(lazyArray.chunks[chunkNum]) === "undefined") throw new Error("doXHR failed!");
+ return lazyArray.chunks[chunkNum];
+ });
+
+ this._length = datalength;
+ this._chunkSize = chunkSize;
+ this.lengthKnown = true;
+ }
+ if (typeof XMLHttpRequest !== 'undefined') {
+ if (!ENVIRONMENT_IS_WORKER) throw 'Cannot do synchronous binary XHRs outside webworkers in modern browsers. Use --embed-file or --preload-file in emcc';
+ var lazyArray = new LazyUint8Array();
+ Object.defineProperty(lazyArray, "length", {
+ get: function() {
+ if(!this.lengthKnown) {
+ this.cacheLength();
+ }
+ return this._length;
+ }
+ });
+ Object.defineProperty(lazyArray, "chunkSize", {
+ get: function() {
+ if(!this.lengthKnown) {
+ this.cacheLength();
+ }
+ return this._chunkSize;
+ }
+ });
+
+ var properties = { isDevice: false, contents: lazyArray };
+ } else {
+ var properties = { isDevice: false, url: url };
+ }
+
+ var node = FS.createFile(parent, name, properties, canRead, canWrite);
+ // This is a total hack, but I want to get this lazy file code out of the
+ // core of MEMFS. If we want to keep this lazy file concept I feel it should
+ // be its own thin LAZYFS proxying calls to MEMFS.
+ if (properties.contents) {
+ node.contents = properties.contents;
+ } else if (properties.url) {
+ node.contents = null;
+ node.url = properties.url;
+ }
+ // override each stream op with one that tries to force load the lazy file first
+ var stream_ops = {};
+ var keys = Object.keys(node.stream_ops);
+ keys.forEach(function(key) {
+ var fn = node.stream_ops[key];
+ stream_ops[key] = function forceLoadLazyFile() {
+ if (!FS.forceLoadFile(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ return fn.apply(null, arguments);
+ };
+ });
+ // use a custom read function
+ stream_ops.read = function stream_ops_read(stream, buffer, offset, length, position) {
+ if (!FS.forceLoadFile(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ var contents = stream.node.contents;
+ if (position >= contents.length)
+ return 0;
+ var size = Math.min(contents.length - position, length);
+ assert(size >= 0);
+ if (contents.slice) { // normal array
+ for (var i = 0; i < size; i++) {
+ buffer[offset + i] = contents[position + i];
+ }
+ } else {
+ for (var i = 0; i < size; i++) { // LazyUint8Array from sync binary XHR
+ buffer[offset + i] = contents.get(position + i);
+ }
+ }
+ return size;
+ };
+ node.stream_ops = stream_ops;
+ return node;
+ },createPreloadedFile:function (parent, name, url, canRead, canWrite, onload, onerror, dontCreateFile, canOwn) {
+ Browser.init();
+ // TODO we should allow people to just pass in a complete filename instead
+ // of parent and name being that we just join them anyways
+ var fullname = name ? PATH.resolve(PATH.join2(parent, name)) : parent;
+ function processData(byteArray) {
+ function finish(byteArray) {
+ if (!dontCreateFile) {
+ FS.createDataFile(parent, name, byteArray, canRead, canWrite, canOwn);
+ }
+ if (onload) onload();
+ removeRunDependency('cp ' + fullname);
+ }
+ var handled = false;
+ Module['preloadPlugins'].forEach(function(plugin) {
+ if (handled) return;
+ if (plugin['canHandle'](fullname)) {
+ plugin['handle'](byteArray, fullname, finish, function() {
+ if (onerror) onerror();
+ removeRunDependency('cp ' + fullname);
+ });
+ handled = true;
+ }
+ });
+ if (!handled) finish(byteArray);
+ }
+ addRunDependency('cp ' + fullname);
+ if (typeof url == 'string') {
+ Browser.asyncLoad(url, function(byteArray) {
+ processData(byteArray);
+ }, onerror);
+ } else {
+ processData(url);
+ }
+ },indexedDB:function () {
+ return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
+ },DB_NAME:function () {
+ return 'EM_FS_' + window.location.pathname;
+ },DB_VERSION:20,DB_STORE_NAME:"FILE_DATA",saveFilesToDB:function (paths, onload, onerror) {
+ onload = onload || function(){};
+ onerror = onerror || function(){};
+ var indexedDB = FS.indexedDB();
+ try {
+ var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
+ } catch (e) {
+ return onerror(e);
+ }
+ openRequest.onupgradeneeded = function openRequest_onupgradeneeded() {
+ console.log('creating db');
+ var db = openRequest.result;
+ db.createObjectStore(FS.DB_STORE_NAME);
+ };
+ openRequest.onsuccess = function openRequest_onsuccess() {
+ var db = openRequest.result;
+ var transaction = db.transaction([FS.DB_STORE_NAME], 'readwrite');
+ var files = transaction.objectStore(FS.DB_STORE_NAME);
+ var ok = 0, fail = 0, total = paths.length;
+ function finish() {
+ if (fail == 0) onload(); else onerror();
+ }
+ paths.forEach(function(path) {
+ var putRequest = files.put(FS.analyzePath(path).object.contents, path);
+ putRequest.onsuccess = function putRequest_onsuccess() { ok++; if (ok + fail == total) finish() };
+ putRequest.onerror = function putRequest_onerror() { fail++; if (ok + fail == total) finish() };
+ });
+ transaction.onerror = onerror;
+ };
+ openRequest.onerror = onerror;
+ },loadFilesFromDB:function (paths, onload, onerror) {
+ onload = onload || function(){};
+ onerror = onerror || function(){};
+ var indexedDB = FS.indexedDB();
+ try {
+ var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
+ } catch (e) {
+ return onerror(e);
+ }
+ openRequest.onupgradeneeded = onerror; // no database to load from
+ openRequest.onsuccess = function openRequest_onsuccess() {
+ var db = openRequest.result;
+ try {
+ var transaction = db.transaction([FS.DB_STORE_NAME], 'readonly');
+ } catch(e) {
+ onerror(e);
+ return;
+ }
+ var files = transaction.objectStore(FS.DB_STORE_NAME);
+ var ok = 0, fail = 0, total = paths.length;
+ function finish() {
+ if (fail == 0) onload(); else onerror();
+ }
+ paths.forEach(function(path) {
+ var getRequest = files.get(path);
+ getRequest.onsuccess = function getRequest_onsuccess() {
+ if (FS.analyzePath(path).exists) {
+ FS.unlink(path);
+ }
+ FS.createDataFile(PATH.dirname(path), PATH.basename(path), getRequest.result, true, true, true);
+ ok++;
+ if (ok + fail == total) finish();
+ };
+ getRequest.onerror = function getRequest_onerror() { fail++; if (ok + fail == total) finish() };
+ });
+ transaction.onerror = onerror;
+ };
+ openRequest.onerror = onerror;
+ }};
+
+
+
+
+ function _mkport() { throw 'TODO' }var SOCKFS={mount:function (mount) {
+ return FS.createNode(null, '/', 16384 | 511 /* 0777 */, 0);
+ },createSocket:function (family, type, protocol) {
+ var streaming = type == 1;
+ if (protocol) {
+ assert(streaming == (protocol == 6)); // if SOCK_STREAM, must be tcp
+ }
+
+ // create our internal socket structure
+ var sock = {
+ family: family,
+ type: type,
+ protocol: protocol,
+ server: null,
+ peers: {},
+ pending: [],
+ recv_queue: [],
+ sock_ops: SOCKFS.websocket_sock_ops
+ };
+
+ // create the filesystem node to store the socket structure
+ var name = SOCKFS.nextname();
+ var node = FS.createNode(SOCKFS.root, name, 49152, 0);
+ node.sock = sock;
+
+ // and the wrapping stream that enables library functions such
+ // as read and write to indirectly interact with the socket
+ var stream = FS.createStream({
+ path: name,
+ node: node,
+ flags: FS.modeStringToFlags('r+'),
+ seekable: false,
+ stream_ops: SOCKFS.stream_ops
+ });
+
+ // map the new stream to the socket structure (sockets have a 1:1
+ // relationship with a stream)
+ sock.stream = stream;
+
+ return sock;
+ },getSocket:function (fd) {
+ var stream = FS.getStream(fd);
+ if (!stream || !FS.isSocket(stream.node.mode)) {
+ return null;
+ }
+ return stream.node.sock;
+ },stream_ops:{poll:function (stream) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.poll(sock);
+ },ioctl:function (stream, request, varargs) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.ioctl(sock, request, varargs);
+ },read:function (stream, buffer, offset, length, position /* ignored */) {
+ var sock = stream.node.sock;
+ var msg = sock.sock_ops.recvmsg(sock, length);
+ if (!msg) {
+ // socket is closed
+ return 0;
+ }
+ buffer.set(msg.buffer, offset);
+ return msg.buffer.length;
+ },write:function (stream, buffer, offset, length, position /* ignored */) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.sendmsg(sock, buffer, offset, length);
+ },close:function (stream) {
+ var sock = stream.node.sock;
+ sock.sock_ops.close(sock);
+ }},nextname:function () {
+ if (!SOCKFS.nextname.current) {
+ SOCKFS.nextname.current = 0;
+ }
+ return 'socket[' + (SOCKFS.nextname.current++) + ']';
+ },websocket_sock_ops:{createPeer:function (sock, addr, port) {
+ var ws;
+
+ if (typeof addr === 'object') {
+ ws = addr;
+ addr = null;
+ port = null;
+ }
+
+ if (ws) {
+ // for sockets that've already connected (e.g. we're the server)
+ // we can inspect the _socket property for the address
+ if (ws._socket) {
+ addr = ws._socket.remoteAddress;
+ port = ws._socket.remotePort;
+ }
+ // if we're just now initializing a connection to the remote,
+ // inspect the url property
+ else {
+ var result = /ws[s]?:\/\/([^:]+):(\d+)/.exec(ws.url);
+ if (!result) {
+ throw new Error('WebSocket URL must be in the format ws(s)://address:port');
+ }
+ addr = result[1];
+ port = parseInt(result[2], 10);
+ }
+ } else {
+ // create the actual websocket object and connect
+ try {
+ // runtimeConfig gets set to true if WebSocket runtime configuration is available.
+ var runtimeConfig = (Module['websocket'] && ('object' === typeof Module['websocket']));
+
+ // The default value is 'ws://' the replace is needed because the compiler replaces "//" comments with '#'
+ // comments without checking context, so we'd end up with ws:#, the replace swaps the "#" for "//" again.
+ var url = 'ws:#'.replace('#', '//');
+
+ if (runtimeConfig) {
+ if ('string' === typeof Module['websocket']['url']) {
+ url = Module['websocket']['url']; // Fetch runtime WebSocket URL config.
+ }
+ }
+
+ if (url === 'ws://' || url === 'wss://') { // Is the supplied URL config just a prefix, if so complete it.
+ url = url + addr + ':' + port;
+ }
+
+ // Make the WebSocket subprotocol (Sec-WebSocket-Protocol) default to binary if no configuration is set.
+ var subProtocols = 'binary'; // The default value is 'binary'
+
+ if (runtimeConfig) {
+ if ('string' === typeof Module['websocket']['subprotocol']) {
+ subProtocols = Module['websocket']['subprotocol']; // Fetch runtime WebSocket subprotocol config.
+ }
+ }
+
+ // The regex trims the string (removes spaces at the beginning and end, then splits the string by
+ // <any space>,<any space> into an Array. Whitespace removal is important for Websockify and ws.
+ subProtocols = subProtocols.replace(/^ +| +$/g,"").split(/ *, */);
+
+ // The node ws library API for specifying optional subprotocol is slightly different than the browser's.
+ var opts = ENVIRONMENT_IS_NODE ? {'protocol': subProtocols.toString()} : subProtocols;
+
+ // If node we use the ws library.
+ var WebSocket = ENVIRONMENT_IS_NODE ? require('ws') : window['WebSocket'];
+ ws = new WebSocket(url, opts);
+ ws.binaryType = 'arraybuffer';
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EHOSTUNREACH);
+ }
+ }
+
+
+ var peer = {
+ addr: addr,
+ port: port,
+ socket: ws,
+ dgram_send_queue: []
+ };
+
+ SOCKFS.websocket_sock_ops.addPeer(sock, peer);
+ SOCKFS.websocket_sock_ops.handlePeerEvents(sock, peer);
+
+ // if this is a bound dgram socket, send the port number first to allow
+ // us to override the ephemeral port reported to us by remotePort on the
+ // remote end.
+ if (sock.type === 2 && typeof sock.sport !== 'undefined') {
+ peer.dgram_send_queue.push(new Uint8Array([
+ 255, 255, 255, 255,
+ 'p'.charCodeAt(0), 'o'.charCodeAt(0), 'r'.charCodeAt(0), 't'.charCodeAt(0),
+ ((sock.sport & 0xff00) >> 8) , (sock.sport & 0xff)
+ ]));
+ }
+
+ return peer;
+ },getPeer:function (sock, addr, port) {
+ return sock.peers[addr + ':' + port];
+ },addPeer:function (sock, peer) {
+ sock.peers[peer.addr + ':' + peer.port] = peer;
+ },removePeer:function (sock, peer) {
+ delete sock.peers[peer.addr + ':' + peer.port];
+ },handlePeerEvents:function (sock, peer) {
+ var first = true;
+
+ var handleOpen = function () {
+ try {
+ var queued = peer.dgram_send_queue.shift();
+ while (queued) {
+ peer.socket.send(queued);
+ queued = peer.dgram_send_queue.shift();
+ }
+ } catch (e) {
+ // not much we can do here in the way of proper error handling as we've already
+ // lied and said this data was sent. shut it down.
+ peer.socket.close();
+ }
+ };
+
+ function handleMessage(data) {
+ assert(typeof data !== 'string' && data.byteLength !== undefined); // must receive an ArrayBuffer
+ data = new Uint8Array(data); // make a typed array view on the array buffer
+
+
+ // if this is the port message, override the peer's port with it
+ var wasfirst = first;
+ first = false;
+ if (wasfirst &&
+ data.length === 10 &&
+ data[0] === 255 && data[1] === 255 && data[2] === 255 && data[3] === 255 &&
+ data[4] === 'p'.charCodeAt(0) && data[5] === 'o'.charCodeAt(0) && data[6] === 'r'.charCodeAt(0) && data[7] === 't'.charCodeAt(0)) {
+ // update the peer's port and it's key in the peer map
+ var newport = ((data[8] << 8) | data[9]);
+ SOCKFS.websocket_sock_ops.removePeer(sock, peer);
+ peer.port = newport;
+ SOCKFS.websocket_sock_ops.addPeer(sock, peer);
+ return;
+ }
+
+ sock.recv_queue.push({ addr: peer.addr, port: peer.port, data: data });
+ };
+
+ if (ENVIRONMENT_IS_NODE) {
+ peer.socket.on('open', handleOpen);
+ peer.socket.on('message', function(data, flags) {
+ if (!flags.binary) {
+ return;
+ }
+ handleMessage((new Uint8Array(data)).buffer); // copy from node Buffer -> ArrayBuffer
+ });
+ peer.socket.on('error', function() {
+ // don't throw
+ });
+ } else {
+ peer.socket.onopen = handleOpen;
+ peer.socket.onmessage = function peer_socket_onmessage(event) {
+ handleMessage(event.data);
+ };
+ }
+ },poll:function (sock) {
+ if (sock.type === 1 && sock.server) {
+ // listen sockets should only say they're available for reading
+ // if there are pending clients.
+ return sock.pending.length ? (64 | 1) : 0;
+ }
+
+ var mask = 0;
+ var dest = sock.type === 1 ? // we only care about the socket state for connection-based sockets
+ SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport) :
+ null;
+
+ if (sock.recv_queue.length ||
+ !dest || // connection-less sockets are always ready to read
+ (dest && dest.socket.readyState === dest.socket.CLOSING) ||
+ (dest && dest.socket.readyState === dest.socket.CLOSED)) { // let recv return 0 once closed
+ mask |= (64 | 1);
+ }
+
+ if (!dest || // connection-less sockets are always ready to write
+ (dest && dest.socket.readyState === dest.socket.OPEN)) {
+ mask |= 4;
+ }
+
+ if ((dest && dest.socket.readyState === dest.socket.CLOSING) ||
+ (dest && dest.socket.readyState === dest.socket.CLOSED)) {
+ mask |= 16;
+ }
+
+ return mask;
+ },ioctl:function (sock, request, arg) {
+ switch (request) {
+ case 21531:
+ var bytes = 0;
+ if (sock.recv_queue.length) {
+ bytes = sock.recv_queue[0].data.length;
+ }
+ HEAP32[((arg)>>2)]=bytes;
+ return 0;
+ default:
+ return ERRNO_CODES.EINVAL;
+ }
+ },close:function (sock) {
+ // if we've spawned a listen server, close it
+ if (sock.server) {
+ try {
+ sock.server.close();
+ } catch (e) {
+ }
+ sock.server = null;
+ }
+ // close any peer connections
+ var peers = Object.keys(sock.peers);
+ for (var i = 0; i < peers.length; i++) {
+ var peer = sock.peers[peers[i]];
+ try {
+ peer.socket.close();
+ } catch (e) {
+ }
+ SOCKFS.websocket_sock_ops.removePeer(sock, peer);
+ }
+ return 0;
+ },bind:function (sock, addr, port) {
+ if (typeof sock.saddr !== 'undefined' || typeof sock.sport !== 'undefined') {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL); // already bound
+ }
+ sock.saddr = addr;
+ sock.sport = port || _mkport();
+ // in order to emulate dgram sockets, we need to launch a listen server when
+ // binding on a connection-less socket
+ // note: this is only required on the server side
+ if (sock.type === 2) {
+ // close the existing server if it exists
+ if (sock.server) {
+ sock.server.close();
+ sock.server = null;
+ }
+ // swallow error operation not supported error that occurs when binding in the
+ // browser where this isn't supported
+ try {
+ sock.sock_ops.listen(sock, 0);
+ } catch (e) {
+ if (!(e instanceof FS.ErrnoError)) throw e;
+ if (e.errno !== ERRNO_CODES.EOPNOTSUPP) throw e;
+ }
+ }
+ },connect:function (sock, addr, port) {
+ if (sock.server) {
+ throw new FS.ErrnoError(ERRNO_CODS.EOPNOTSUPP);
+ }
+
+ // TODO autobind
+ // if (!sock.addr && sock.type == 2) {
+ // }
+
+ // early out if we're already connected / in the middle of connecting
+ if (typeof sock.daddr !== 'undefined' && typeof sock.dport !== 'undefined') {
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
+ if (dest) {
+ if (dest.socket.readyState === dest.socket.CONNECTING) {
+ throw new FS.ErrnoError(ERRNO_CODES.EALREADY);
+ } else {
+ throw new FS.ErrnoError(ERRNO_CODES.EISCONN);
+ }
+ }
+ }
+
+ // add the socket to our peer list and set our
+ // destination address / port to match
+ var peer = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
+ sock.daddr = peer.addr;
+ sock.dport = peer.port;
+
+ // always "fail" in non-blocking mode
+ throw new FS.ErrnoError(ERRNO_CODES.EINPROGRESS);
+ },listen:function (sock, backlog) {
+ if (!ENVIRONMENT_IS_NODE) {
+ throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
+ }
+ if (sock.server) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL); // already listening
+ }
+ var WebSocketServer = require('ws').Server;
+ var host = sock.saddr;
+ sock.server = new WebSocketServer({
+ host: host,
+ port: sock.sport
+ // TODO support backlog
+ });
+
+ sock.server.on('connection', function(ws) {
+ if (sock.type === 1) {
+ var newsock = SOCKFS.createSocket(sock.family, sock.type, sock.protocol);
+
+ // create a peer on the new socket
+ var peer = SOCKFS.websocket_sock_ops.createPeer(newsock, ws);
+ newsock.daddr = peer.addr;
+ newsock.dport = peer.port;
+
+ // push to queue for accept to pick up
+ sock.pending.push(newsock);
+ } else {
+ // create a peer on the listen socket so calling sendto
+ // with the listen socket and an address will resolve
+ // to the correct client
+ SOCKFS.websocket_sock_ops.createPeer(sock, ws);
+ }
+ });
+ sock.server.on('closed', function() {
+ sock.server = null;
+ });
+ sock.server.on('error', function() {
+ // don't throw
+ });
+ },accept:function (listensock) {
+ if (!listensock.server) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var newsock = listensock.pending.shift();
+ newsock.stream.flags = listensock.stream.flags;
+ return newsock;
+ },getname:function (sock, peer) {
+ var addr, port;
+ if (peer) {
+ if (sock.daddr === undefined || sock.dport === undefined) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+ addr = sock.daddr;
+ port = sock.dport;
+ } else {
+ // TODO saddr and sport will be set for bind()'d UDP sockets, but what
+ // should we be returning for TCP sockets that've been connect()'d?
+ addr = sock.saddr || 0;
+ port = sock.sport || 0;
+ }
+ return { addr: addr, port: port };
+ },sendmsg:function (sock, buffer, offset, length, addr, port) {
+ if (sock.type === 2) {
+ // connection-less sockets will honor the message address,
+ // and otherwise fall back to the bound destination address
+ if (addr === undefined || port === undefined) {
+ addr = sock.daddr;
+ port = sock.dport;
+ }
+ // if there was no address to fall back to, error out
+ if (addr === undefined || port === undefined) {
+ throw new FS.ErrnoError(ERRNO_CODES.EDESTADDRREQ);
+ }
+ } else {
+ // connection-based sockets will only use the bound
+ addr = sock.daddr;
+ port = sock.dport;
+ }
+
+ // find the peer for the destination address
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, addr, port);
+
+ // early out if not connected with a connection-based socket
+ if (sock.type === 1) {
+ if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ } else if (dest.socket.readyState === dest.socket.CONNECTING) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ }
+
+ // create a copy of the incoming data to send, as the WebSocket API
+ // doesn't work entirely with an ArrayBufferView, it'll just send
+ // the entire underlying buffer
+ var data;
+ if (buffer instanceof Array || buffer instanceof ArrayBuffer) {
+ data = buffer.slice(offset, offset + length);
+ } else { // ArrayBufferView
+ data = buffer.buffer.slice(buffer.byteOffset + offset, buffer.byteOffset + offset + length);
+ }
+
+ // if we're emulating a connection-less dgram socket and don't have
+ // a cached connection, queue the buffer to send upon connect and
+ // lie, saying the data was sent now.
+ if (sock.type === 2) {
+ if (!dest || dest.socket.readyState !== dest.socket.OPEN) {
+ // if we're not connected, open a new connection
+ if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ dest = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
+ }
+ dest.dgram_send_queue.push(data);
+ return length;
+ }
+ }
+
+ try {
+ // send the actual data
+ dest.socket.send(data);
+ return length;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ },recvmsg:function (sock, length) {
+ // http://pubs.opengroup.org/onlinepubs/7908799/xns/recvmsg.html
+ if (sock.type === 1 && sock.server) {
+ // tcp servers should not be recv()'ing on the listen socket
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+
+ var queued = sock.recv_queue.shift();
+ if (!queued) {
+ if (sock.type === 1) {
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
+
+ if (!dest) {
+ // if we have a destination address but are not connected, error out
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+ else if (dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ // return null if the socket has closed
+ return null;
+ }
+ else {
+ // else, our socket is in a valid state but truly has nothing available
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ } else {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ }
+
+ // queued.data will be an ArrayBuffer if it's unadulterated, but if it's
+ // requeued TCP data it'll be an ArrayBufferView
+ var queuedLength = queued.data.byteLength || queued.data.length;
+ var queuedOffset = queued.data.byteOffset || 0;
+ var queuedBuffer = queued.data.buffer || queued.data;
+ var bytesRead = Math.min(length, queuedLength);
+ var res = {
+ buffer: new Uint8Array(queuedBuffer, queuedOffset, bytesRead),
+ addr: queued.addr,
+ port: queued.port
+ };
+
+
+ // push back any unread data for TCP connections
+ if (sock.type === 1 && bytesRead < queuedLength) {
+ var bytesRemaining = queuedLength - bytesRead;
+ queued.data = new Uint8Array(queuedBuffer, queuedOffset + bytesRead, bytesRemaining);
+ sock.recv_queue.unshift(queued);
+ }
+
+ return res;
+ }}};function _send(fd, buf, len, flags) {
+ var sock = SOCKFS.getSocket(fd);
+ if (!sock) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ // TODO honor flags
+ return _write(fd, buf, len);
+ }
+
+ function _pwrite(fildes, buf, nbyte, offset) {
+ // ssize_t pwrite(int fildes, const void *buf, size_t nbyte, off_t offset);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
+ var stream = FS.getStream(fildes);
+ if (!stream) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ try {
+ var slab = HEAP8;
+ return FS.write(stream, slab, buf, nbyte, offset);
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }function _write(fildes, buf, nbyte) {
+ // ssize_t write(int fildes, const void *buf, size_t nbyte);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
+ var stream = FS.getStream(fildes);
+ if (!stream) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+
+
+ try {
+ var slab = HEAP8;
+ return FS.write(stream, slab, buf, nbyte);
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }
+
+ function _fileno(stream) {
+ // int fileno(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fileno.html
+ stream = FS.getStreamFromPtr(stream);
+ if (!stream) return -1;
+ return stream.fd;
+ }function _fwrite(ptr, size, nitems, stream) {
+ // size_t fwrite(const void *restrict ptr, size_t size, size_t nitems, FILE *restrict stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fwrite.html
+ var bytesToWrite = nitems * size;
+ if (bytesToWrite == 0) return 0;
+ var fd = _fileno(stream);
+ var bytesWritten = _write(fd, ptr, bytesToWrite);
+ if (bytesWritten == -1) {
+ var streamObj = FS.getStreamFromPtr(stream);
+ if (streamObj) streamObj.error = true;
+ return 0;
+ } else {
+ return Math.floor(bytesWritten / size);
+ }
+ }
+
+
+
+ Module["_strlen"] = _strlen;
+
+ function __reallyNegative(x) {
+ return x < 0 || (x === 0 && (1/x) === -Infinity);
+ }function __formatString(format, varargs) {
+ var textIndex = format;
+ var argIndex = 0;
+ function getNextArg(type) {
+ // NOTE: Explicitly ignoring type safety. Otherwise this fails:
+ // int x = 4; printf("%c\n", (char)x);
+ var ret;
+ if (type === 'double') {
+ ret = HEAPF64[(((varargs)+(argIndex))>>3)];
+ } else if (type == 'i64') {
+ ret = [HEAP32[(((varargs)+(argIndex))>>2)],
+ HEAP32[(((varargs)+(argIndex+4))>>2)]];
+
+ } else {
+ type = 'i32'; // varargs are always i32, i64, or double
+ ret = HEAP32[(((varargs)+(argIndex))>>2)];
+ }
+ argIndex += Runtime.getNativeFieldSize(type);
+ return ret;
+ }
+
+ var ret = [];
+ var curr, next, currArg;
+ while(1) {
+ var startTextIndex = textIndex;
+ curr = HEAP8[(textIndex)];
+ if (curr === 0) break;
+ next = HEAP8[((textIndex+1)|0)];
+ if (curr == 37) {
+ // Handle flags.
+ var flagAlwaysSigned = false;
+ var flagLeftAlign = false;
+ var flagAlternative = false;
+ var flagZeroPad = false;
+ var flagPadSign = false;
+ flagsLoop: while (1) {
+ switch (next) {
+ case 43:
+ flagAlwaysSigned = true;
+ break;
+ case 45:
+ flagLeftAlign = true;
+ break;
+ case 35:
+ flagAlternative = true;
+ break;
+ case 48:
+ if (flagZeroPad) {
+ break flagsLoop;
+ } else {
+ flagZeroPad = true;
+ break;
+ }
+ case 32:
+ flagPadSign = true;
+ break;
+ default:
+ break flagsLoop;
+ }
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ }
+
+ // Handle width.
+ var width = 0;
+ if (next == 42) {
+ width = getNextArg('i32');
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ } else {
+ while (next >= 48 && next <= 57) {
+ width = width * 10 + (next - 48);
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ }
+ }
+
+ // Handle precision.
+ var precisionSet = false, precision = -1;
+ if (next == 46) {
+ precision = 0;
+ precisionSet = true;
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ if (next == 42) {
+ precision = getNextArg('i32');
+ textIndex++;
+ } else {
+ while(1) {
+ var precisionChr = HEAP8[((textIndex+1)|0)];
+ if (precisionChr < 48 ||
+ precisionChr > 57) break;
+ precision = precision * 10 + (precisionChr - 48);
+ textIndex++;
+ }
+ }
+ next = HEAP8[((textIndex+1)|0)];
+ }
+ if (precision < 0) {
+ precision = 6; // Standard default.
+ precisionSet = false;
+ }
+
+ // Handle integer sizes. WARNING: These assume a 32-bit architecture!
+ var argSize;
+ switch (String.fromCharCode(next)) {
+ case 'h':
+ var nextNext = HEAP8[((textIndex+2)|0)];
+ if (nextNext == 104) {
+ textIndex++;
+ argSize = 1; // char (actually i32 in varargs)
+ } else {
+ argSize = 2; // short (actually i32 in varargs)
+ }
+ break;
+ case 'l':
+ var nextNext = HEAP8[((textIndex+2)|0)];
+ if (nextNext == 108) {
+ textIndex++;
+ argSize = 8; // long long
+ } else {
+ argSize = 4; // long
+ }
+ break;
+ case 'L': // long long
+ case 'q': // int64_t
+ case 'j': // intmax_t
+ argSize = 8;
+ break;
+ case 'z': // size_t
+ case 't': // ptrdiff_t
+ case 'I': // signed ptrdiff_t or unsigned size_t
+ argSize = 4;
+ break;
+ default:
+ argSize = null;
+ }
+ if (argSize) textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+
+ // Handle type specifier.
+ switch (String.fromCharCode(next)) {
+ case 'd': case 'i': case 'u': case 'o': case 'x': case 'X': case 'p': {
+ // Integer.
+ var signed = next == 100 || next == 105;
+ argSize = argSize || 4;
+ var currArg = getNextArg('i' + (argSize * 8));
+ var argText;
+ // Flatten i64-1 [low, high] into a (slightly rounded) double
+ if (argSize == 8) {
+ currArg = Runtime.makeBigInt(currArg[0], currArg[1], next == 117);
+ }
+ // Truncate to requested size.
+ if (argSize <= 4) {
+ var limit = Math.pow(256, argSize) - 1;
+ currArg = (signed ? reSign : unSign)(currArg & limit, argSize * 8);
+ }
+ // Format the number.
+ var currAbsArg = Math.abs(currArg);
+ var prefix = '';
+ if (next == 100 || next == 105) {
+ argText = reSign(currArg, 8 * argSize, 1).toString(10);
+ } else if (next == 117) {
+ argText = unSign(currArg, 8 * argSize, 1).toString(10);
+ currArg = Math.abs(currArg);
+ } else if (next == 111) {
+ argText = (flagAlternative ? '0' : '') + currAbsArg.toString(8);
+ } else if (next == 120 || next == 88) {
+ prefix = (flagAlternative && currArg != 0) ? '0x' : '';
+ if (currArg < 0) {
+ // Represent negative numbers in hex as 2's complement.
+ currArg = -currArg;
+ argText = (currAbsArg - 1).toString(16);
+ var buffer = [];
+ for (var i = 0; i < argText.length; i++) {
+ buffer.push((0xF - parseInt(argText[i], 16)).toString(16));
+ }
+ argText = buffer.join('');
+ while (argText.length < argSize * 2) argText = 'f' + argText;
+ } else {
+ argText = currAbsArg.toString(16);
+ }
+ if (next == 88) {
+ prefix = prefix.toUpperCase();
+ argText = argText.toUpperCase();
+ }
+ } else if (next == 112) {
+ if (currAbsArg === 0) {
+ argText = '(nil)';
+ } else {
+ prefix = '0x';
+ argText = currAbsArg.toString(16);
+ }
+ }
+ if (precisionSet) {
+ while (argText.length < precision) {
+ argText = '0' + argText;
+ }
+ }
+
+ // Add sign if needed
+ if (currArg >= 0) {
+ if (flagAlwaysSigned) {
+ prefix = '+' + prefix;
+ } else if (flagPadSign) {
+ prefix = ' ' + prefix;
+ }
+ }
+
+ // Move sign to prefix so we zero-pad after the sign
+ if (argText.charAt(0) == '-') {
+ prefix = '-' + prefix;
+ argText = argText.substr(1);
+ }
+
+ // Add padding.
+ while (prefix.length + argText.length < width) {
+ if (flagLeftAlign) {
+ argText += ' ';
+ } else {
+ if (flagZeroPad) {
+ argText = '0' + argText;
+ } else {
+ prefix = ' ' + prefix;
+ }
+ }
+ }
+
+ // Insert the result into the buffer.
+ argText = prefix + argText;
+ argText.split('').forEach(function(chr) {
+ ret.push(chr.charCodeAt(0));
+ });
+ break;
+ }
+ case 'f': case 'F': case 'e': case 'E': case 'g': case 'G': {
+ // Float.
+ var currArg = getNextArg('double');
+ var argText;
+ if (isNaN(currArg)) {
+ argText = 'nan';
+ flagZeroPad = false;
+ } else if (!isFinite(currArg)) {
+ argText = (currArg < 0 ? '-' : '') + 'inf';
+ flagZeroPad = false;
+ } else {
+ var isGeneral = false;
+ var effectivePrecision = Math.min(precision, 20);
+
+ // Convert g/G to f/F or e/E, as per:
+ // http://pubs.opengroup.org/onlinepubs/9699919799/functions/printf.html
+ if (next == 103 || next == 71) {
+ isGeneral = true;
+ precision = precision || 1;
+ var exponent = parseInt(currArg.toExponential(effectivePrecision).split('e')[1], 10);
+ if (precision > exponent && exponent >= -4) {
+ next = ((next == 103) ? 'f' : 'F').charCodeAt(0);
+ precision -= exponent + 1;
+ } else {
+ next = ((next == 103) ? 'e' : 'E').charCodeAt(0);
+ precision--;
+ }
+ effectivePrecision = Math.min(precision, 20);
+ }
+
+ if (next == 101 || next == 69) {
+ argText = currArg.toExponential(effectivePrecision);
+ // Make sure the exponent has at least 2 digits.
+ if (/[eE][-+]\d$/.test(argText)) {
+ argText = argText.slice(0, -1) + '0' + argText.slice(-1);
+ }
+ } else if (next == 102 || next == 70) {
+ argText = currArg.toFixed(effectivePrecision);
+ if (currArg === 0 && __reallyNegative(currArg)) {
+ argText = '-' + argText;
+ }
+ }
+
+ var parts = argText.split('e');
+ if (isGeneral && !flagAlternative) {
+ // Discard trailing zeros and periods.
+ while (parts[0].length > 1 && parts[0].indexOf('.') != -1 &&
+ (parts[0].slice(-1) == '0' || parts[0].slice(-1) == '.')) {
+ parts[0] = parts[0].slice(0, -1);
+ }
+ } else {
+ // Make sure we have a period in alternative mode.
+ if (flagAlternative && argText.indexOf('.') == -1) parts[0] += '.';
+ // Zero pad until required precision.
+ while (precision > effectivePrecision++) parts[0] += '0';
+ }
+ argText = parts[0] + (parts.length > 1 ? 'e' + parts[1] : '');
+
+ // Capitalize 'E' if needed.
+ if (next == 69) argText = argText.toUpperCase();
+
+ // Add sign.
+ if (currArg >= 0) {
+ if (flagAlwaysSigned) {
+ argText = '+' + argText;
+ } else if (flagPadSign) {
+ argText = ' ' + argText;
+ }
+ }
+ }
+
+ // Add padding.
+ while (argText.length < width) {
+ if (flagLeftAlign) {
+ argText += ' ';
+ } else {
+ if (flagZeroPad && (argText[0] == '-' || argText[0] == '+')) {
+ argText = argText[0] + '0' + argText.slice(1);
+ } else {
+ argText = (flagZeroPad ? '0' : ' ') + argText;
+ }
+ }
+ }
+
+ // Adjust case.
+ if (next < 97) argText = argText.toUpperCase();
+
+ // Insert the result into the buffer.
+ argText.split('').forEach(function(chr) {
+ ret.push(chr.charCodeAt(0));
+ });
+ break;
+ }
+ case 's': {
+ // String.
+ var arg = getNextArg('i8*');
+ var argLength = arg ? _strlen(arg) : '(null)'.length;
+ if (precisionSet) argLength = Math.min(argLength, precision);
+ if (!flagLeftAlign) {
+ while (argLength < width--) {
+ ret.push(32);
+ }
+ }
+ if (arg) {
+ for (var i = 0; i < argLength; i++) {
+ ret.push(HEAPU8[((arg++)|0)]);
+ }
+ } else {
+ ret = ret.concat(intArrayFromString('(null)'.substr(0, argLength), true));
+ }
+ if (flagLeftAlign) {
+ while (argLength < width--) {
+ ret.push(32);
+ }
+ }
+ break;
+ }
+ case 'c': {
+ // Character.
+ if (flagLeftAlign) ret.push(getNextArg('i8'));
+ while (--width > 0) {
+ ret.push(32);
+ }
+ if (!flagLeftAlign) ret.push(getNextArg('i8'));
+ break;
+ }
+ case 'n': {
+ // Write the length written so far to the next parameter.
+ var ptr = getNextArg('i32*');
+ HEAP32[((ptr)>>2)]=ret.length;
+ break;
+ }
+ case '%': {
+ // Literal percent sign.
+ ret.push(curr);
+ break;
+ }
+ default: {
+ // Unknown specifiers remain untouched.
+ for (var i = startTextIndex; i < textIndex + 2; i++) {
+ ret.push(HEAP8[(i)]);
+ }
+ }
+ }
+ textIndex += 2;
+ // TODO: Support a/A (hex float) and m (last error) specifiers.
+ // TODO: Support %1${specifier} for arg selection.
+ } else {
+ ret.push(curr);
+ textIndex += 1;
+ }
+ }
+ return ret;
+ }function _fprintf(stream, format, varargs) {
+ // int fprintf(FILE *restrict stream, const char *restrict format, ...);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
+ var result = __formatString(format, varargs);
+ var stack = Runtime.stackSave();
+ var ret = _fwrite(allocate(result, 'i8', ALLOC_STACK), 1, result.length, stream);
+ Runtime.stackRestore(stack);
+ return ret;
+ }function _printf(format, varargs) {
+ // int printf(const char *restrict format, ...);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
+ var stdout = HEAP32[((_stdout)>>2)];
+ return _fprintf(stdout, format, varargs);
+ }
+
+ var _sinf=Math_sin;
+
+
+ var _sqrtf=Math_sqrt;
+
+ var _floorf=Math_floor;
+
+
+ function _fputs(s, stream) {
+ // int fputs(const char *restrict s, FILE *restrict stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fputs.html
+ var fd = _fileno(stream);
+ return _write(fd, s, _strlen(s));
+ }
+
+ function _fputc(c, stream) {
+ // int fputc(int c, FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fputc.html
+ var chr = unSign(c & 0xFF);
+ HEAP8[((_fputc.ret)|0)]=chr;
+ var fd = _fileno(stream);
+ var ret = _write(fd, _fputc.ret, 1);
+ if (ret == -1) {
+ var streamObj = FS.getStreamFromPtr(stream);
+ if (streamObj) streamObj.error = true;
+ return -1;
+ } else {
+ return chr;
+ }
+ }function _puts(s) {
+ // int puts(const char *s);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/puts.html
+ // NOTE: puts() always writes an extra newline.
+ var stdout = HEAP32[((_stdout)>>2)];
+ var ret = _fputs(s, stdout);
+ if (ret < 0) {
+ return ret;
+ } else {
+ var newlineRet = _fputc(10, stdout);
+ return (newlineRet < 0) ? -1 : ret + 1;
+ }
+ }
+
+ function _clock() {
+ if (_clock.start === undefined) _clock.start = Date.now();
+ return Math.floor((Date.now() - _clock.start) * (1000000/1000));
+ }
+
+
+ var ___cxa_caught_exceptions=[];function ___cxa_begin_catch(ptr) {
+ __ZSt18uncaught_exceptionv.uncaught_exception--;
+ ___cxa_caught_exceptions.push(___cxa_last_thrown_exception);
+ return ptr;
+ }
+
+ function ___errno_location() {
+ return ___errno_state;
+ }
+
+
+ function _emscripten_memcpy_big(dest, src, num) {
+ HEAPU8.set(HEAPU8.subarray(src, src+num), dest);
+ return dest;
+ }
+ Module["_memcpy"] = _memcpy;
+
+ function __ZNSt9exceptionD2Ev() {}
+
+ var Browser={mainLoop:{scheduler:null,method:"",shouldPause:false,paused:false,queue:[],pause:function () {
+ Browser.mainLoop.shouldPause = true;
+ },resume:function () {
+ if (Browser.mainLoop.paused) {
+ Browser.mainLoop.paused = false;
+ Browser.mainLoop.scheduler();
+ }
+ Browser.mainLoop.shouldPause = false;
+ },updateStatus:function () {
+ if (Module['setStatus']) {
+ var message = Module['statusMessage'] || 'Please wait...';
+ var remaining = Browser.mainLoop.remainingBlockers;
+ var expected = Browser.mainLoop.expectedBlockers;
+ if (remaining) {
+ if (remaining < expected) {
+ Module['setStatus'](message + ' (' + (expected - remaining) + '/' + expected + ')');
+ } else {
+ Module['setStatus'](message);
+ }
+ } else {
+ Module['setStatus']('');
+ }
+ }
+ }},isFullScreen:false,pointerLock:false,moduleContextCreatedCallbacks:[],workers:[],init:function () {
+ if (!Module["preloadPlugins"]) Module["preloadPlugins"] = []; // needs to exist even in workers
+
+ if (Browser.initted || ENVIRONMENT_IS_WORKER) return;
+ Browser.initted = true;
+
+ try {
+ new Blob();
+ Browser.hasBlobConstructor = true;
+ } catch(e) {
+ Browser.hasBlobConstructor = false;
+ console.log("warning: no blob constructor, cannot create blobs with mimetypes");
+ }
+ Browser.BlobBuilder = typeof MozBlobBuilder != "undefined" ? MozBlobBuilder : (typeof WebKitBlobBuilder != "undefined" ? WebKitBlobBuilder : (!Browser.hasBlobConstructor ? console.log("warning: no BlobBuilder") : null));
+ Browser.URLObject = typeof window != "undefined" ? (window.URL ? window.URL : window.webkitURL) : undefined;
+ if (!Module.noImageDecoding && typeof Browser.URLObject === 'undefined') {
+ console.log("warning: Browser does not support creating object URLs. Built-in browser image decoding will not be available.");
+ Module.noImageDecoding = true;
+ }
+
+ // Support for plugins that can process preloaded files. You can add more of these to
+ // your app by creating and appending to Module.preloadPlugins.
+ //
+ // Each plugin is asked if it can handle a file based on the file's name. If it can,
+ // it is given the file's raw data. When it is done, it calls a callback with the file's
+ // (possibly modified) data. For example, a plugin might decompress a file, or it
+ // might create some side data structure for use later (like an Image element, etc.).
+
+ var imagePlugin = {};
+ imagePlugin['canHandle'] = function imagePlugin_canHandle(name) {
+ return !Module.noImageDecoding && /\.(jpg|jpeg|png|bmp)$/i.test(name);
+ };
+ imagePlugin['handle'] = function imagePlugin_handle(byteArray, name, onload, onerror) {
+ var b = null;
+ if (Browser.hasBlobConstructor) {
+ try {
+ b = new Blob([byteArray], { type: Browser.getMimetype(name) });
+ if (b.size !== byteArray.length) { // Safari bug #118630
+ // Safari's Blob can only take an ArrayBuffer
+ b = new Blob([(new Uint8Array(byteArray)).buffer], { type: Browser.getMimetype(name) });
+ }
+ } catch(e) {
+ Runtime.warnOnce('Blob constructor present but fails: ' + e + '; falling back to blob builder');
+ }
+ }
+ if (!b) {
+ var bb = new Browser.BlobBuilder();
+ bb.append((new Uint8Array(byteArray)).buffer); // we need to pass a buffer, and must copy the array to get the right data range
+ b = bb.getBlob();
+ }
+ var url = Browser.URLObject.createObjectURL(b);
+ var img = new Image();
+ img.onload = function img_onload() {
+ assert(img.complete, 'Image ' + name + ' could not be decoded');
+ var canvas = document.createElement('canvas');
+ canvas.width = img.width;
+ canvas.height = img.height;
+ var ctx = canvas.getContext('2d');
+ ctx.drawImage(img, 0, 0);
+ Module["preloadedImages"][name] = canvas;
+ Browser.URLObject.revokeObjectURL(url);
+ if (onload) onload(byteArray);
+ };
+ img.onerror = function img_onerror(event) {
+ console.log('Image ' + url + ' could not be decoded');
+ if (onerror) onerror();
+ };
+ img.src = url;
+ };
+ Module['preloadPlugins'].push(imagePlugin);
+
+ var audioPlugin = {};
+ audioPlugin['canHandle'] = function audioPlugin_canHandle(name) {
+ return !Module.noAudioDecoding && name.substr(-4) in { '.ogg': 1, '.wav': 1, '.mp3': 1 };
+ };
+ audioPlugin['handle'] = function audioPlugin_handle(byteArray, name, onload, onerror) {
+ var done = false;
+ function finish(audio) {
+ if (done) return;
+ done = true;
+ Module["preloadedAudios"][name] = audio;
+ if (onload) onload(byteArray);
+ }
+ function fail() {
+ if (done) return;
+ done = true;
+ Module["preloadedAudios"][name] = new Audio(); // empty shim
+ if (onerror) onerror();
+ }
+ if (Browser.hasBlobConstructor) {
+ try {
+ var b = new Blob([byteArray], { type: Browser.getMimetype(name) });
+ } catch(e) {
+ return fail();
+ }
+ var url = Browser.URLObject.createObjectURL(b); // XXX we never revoke this!
+ var audio = new Audio();
+ audio.addEventListener('canplaythrough', function() { finish(audio) }, false); // use addEventListener due to chromium bug 124926
+ audio.onerror = function audio_onerror(event) {
+ if (done) return;
+ console.log('warning: browser could not fully decode audio ' + name + ', trying slower base64 approach');
+ function encode64(data) {
+ var BASE = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
+ var PAD = '=';
+ var ret = '';
+ var leftchar = 0;
+ var leftbits = 0;
+ for (var i = 0; i < data.length; i++) {
+ leftchar = (leftchar << 8) | data[i];
+ leftbits += 8;
+ while (leftbits >= 6) {
+ var curr = (leftchar >> (leftbits-6)) & 0x3f;
+ leftbits -= 6;
+ ret += BASE[curr];
+ }
+ }
+ if (leftbits == 2) {
+ ret += BASE[(leftchar&3) << 4];
+ ret += PAD + PAD;
+ } else if (leftbits == 4) {
+ ret += BASE[(leftchar&0xf) << 2];
+ ret += PAD;
+ }
+ return ret;
+ }
+ audio.src = 'data:audio/x-' + name.substr(-3) + ';base64,' + encode64(byteArray);
+ finish(audio); // we don't wait for confirmation this worked - but it's worth trying
+ };
+ audio.src = url;
+ // workaround for chrome bug 124926 - we do not always get oncanplaythrough or onerror
+ Browser.safeSetTimeout(function() {
+ finish(audio); // try to use it even though it is not necessarily ready to play
+ }, 10000);
+ } else {
+ return fail();
+ }
+ };
+ Module['preloadPlugins'].push(audioPlugin);
+
+ // Canvas event setup
+
+ var canvas = Module['canvas'];
+
+ // forced aspect ratio can be enabled by defining 'forcedAspectRatio' on Module
+ // Module['forcedAspectRatio'] = 4 / 3;
+
+ canvas.requestPointerLock = canvas['requestPointerLock'] ||
+ canvas['mozRequestPointerLock'] ||
+ canvas['webkitRequestPointerLock'] ||
+ canvas['msRequestPointerLock'] ||
+ function(){};
+ canvas.exitPointerLock = document['exitPointerLock'] ||
+ document['mozExitPointerLock'] ||
+ document['webkitExitPointerLock'] ||
+ document['msExitPointerLock'] ||
+ function(){}; // no-op if function does not exist
+ canvas.exitPointerLock = canvas.exitPointerLock.bind(document);
+
+ function pointerLockChange() {
+ Browser.pointerLock = document['pointerLockElement'] === canvas ||
+ document['mozPointerLockElement'] === canvas ||
+ document['webkitPointerLockElement'] === canvas ||
+ document['msPointerLockElement'] === canvas;
+ }
+
+ document.addEventListener('pointerlockchange', pointerLockChange, false);
+ document.addEventListener('mozpointerlockchange', pointerLockChange, false);
+ document.addEventListener('webkitpointerlockchange', pointerLockChange, false);
+ document.addEventListener('mspointerlockchange', pointerLockChange, false);
+
+ if (Module['elementPointerLock']) {
+ canvas.addEventListener("click", function(ev) {
+ if (!Browser.pointerLock && canvas.requestPointerLock) {
+ canvas.requestPointerLock();
+ ev.preventDefault();
+ }
+ }, false);
+ }
+ },createContext:function (canvas, useWebGL, setInModule, webGLContextAttributes) {
+ var ctx;
+ var errorInfo = '?';
+ function onContextCreationError(event) {
+ errorInfo = event.statusMessage || errorInfo;
+ }
+ try {
+ if (useWebGL) {
+ var contextAttributes = {
+ antialias: false,
+ alpha: false
+ };
+
+ if (webGLContextAttributes) {
+ for (var attribute in webGLContextAttributes) {
+ contextAttributes[attribute] = webGLContextAttributes[attribute];
+ }
+ }
+
+
+ canvas.addEventListener('webglcontextcreationerror', onContextCreationError, false);
+ try {
+ ['experimental-webgl', 'webgl'].some(function(webglId) {
+ return ctx = canvas.getContext(webglId, contextAttributes);
+ });
+ } finally {
+ canvas.removeEventListener('webglcontextcreationerror', onContextCreationError, false);
+ }
+ } else {
+ ctx = canvas.getContext('2d');
+ }
+ if (!ctx) throw ':(';
+ } catch (e) {
+ Module.print('Could not create canvas: ' + [errorInfo, e]);
+ return null;
+ }
+ if (useWebGL) {
+ // Set the background of the WebGL canvas to black
+ canvas.style.backgroundColor = "black";
+
+ // Warn on context loss
+ canvas.addEventListener('webglcontextlost', function(event) {
+ alert('WebGL context lost. You will need to reload the page.');
+ }, false);
+ }
+ if (setInModule) {
+ GLctx = Module.ctx = ctx;
+ Module.useWebGL = useWebGL;
+ Browser.moduleContextCreatedCallbacks.forEach(function(callback) { callback() });
+ Browser.init();
+ }
+ return ctx;
+ },destroyContext:function (canvas, useWebGL, setInModule) {},fullScreenHandlersInstalled:false,lockPointer:undefined,resizeCanvas:undefined,requestFullScreen:function (lockPointer, resizeCanvas) {
+ Browser.lockPointer = lockPointer;
+ Browser.resizeCanvas = resizeCanvas;
+ if (typeof Browser.lockPointer === 'undefined') Browser.lockPointer = true;
+ if (typeof Browser.resizeCanvas === 'undefined') Browser.resizeCanvas = false;
+
+ var canvas = Module['canvas'];
+ function fullScreenChange() {
+ Browser.isFullScreen = false;
+ var canvasContainer = canvas.parentNode;
+ if ((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
+ document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
+ document['fullScreenElement'] || document['fullscreenElement'] ||
+ document['msFullScreenElement'] || document['msFullscreenElement'] ||
+ document['webkitCurrentFullScreenElement']) === canvasContainer) {
+ canvas.cancelFullScreen = document['cancelFullScreen'] ||
+ document['mozCancelFullScreen'] ||
+ document['webkitCancelFullScreen'] ||
+ document['msExitFullscreen'] ||
+ document['exitFullscreen'] ||
+ function() {};
+ canvas.cancelFullScreen = canvas.cancelFullScreen.bind(document);
+ if (Browser.lockPointer) canvas.requestPointerLock();
+ Browser.isFullScreen = true;
+ if (Browser.resizeCanvas) Browser.setFullScreenCanvasSize();
+ } else {
+
+ // remove the full screen specific parent of the canvas again to restore the HTML structure from before going full screen
+ canvasContainer.parentNode.insertBefore(canvas, canvasContainer);
+ canvasContainer.parentNode.removeChild(canvasContainer);
+
+ if (Browser.resizeCanvas) Browser.setWindowedCanvasSize();
+ }
+ if (Module['onFullScreen']) Module['onFullScreen'](Browser.isFullScreen);
+ Browser.updateCanvasDimensions(canvas);
+ }
+
+ if (!Browser.fullScreenHandlersInstalled) {
+ Browser.fullScreenHandlersInstalled = true;
+ document.addEventListener('fullscreenchange', fullScreenChange, false);
+ document.addEventListener('mozfullscreenchange', fullScreenChange, false);
+ document.addEventListener('webkitfullscreenchange', fullScreenChange, false);
+ document.addEventListener('MSFullscreenChange', fullScreenChange, false);
+ }
+
+ // create a new parent to ensure the canvas has no siblings. this allows browsers to optimize full screen performance when its parent is the full screen root
+ var canvasContainer = document.createElement("div");
+ canvas.parentNode.insertBefore(canvasContainer, canvas);
+ canvasContainer.appendChild(canvas);
+
+ // use parent of canvas as full screen root to allow aspect ratio correction (Firefox stretches the root to screen size)
+ canvasContainer.requestFullScreen = canvasContainer['requestFullScreen'] ||
+ canvasContainer['mozRequestFullScreen'] ||
+ canvasContainer['msRequestFullscreen'] ||
+ (canvasContainer['webkitRequestFullScreen'] ? function() { canvasContainer['webkitRequestFullScreen'](Element['ALLOW_KEYBOARD_INPUT']) } : null);
+ canvasContainer.requestFullScreen();
+ },requestAnimationFrame:function requestAnimationFrame(func) {
+ if (typeof window === 'undefined') { // Provide fallback to setTimeout if window is undefined (e.g. in Node.js)
+ setTimeout(func, 1000/60);
+ } else {
+ if (!window.requestAnimationFrame) {
+ window.requestAnimationFrame = window['requestAnimationFrame'] ||
+ window['mozRequestAnimationFrame'] ||
+ window['webkitRequestAnimationFrame'] ||
+ window['msRequestAnimationFrame'] ||
+ window['oRequestAnimationFrame'] ||
+ window['setTimeout'];
+ }
+ window.requestAnimationFrame(func);
+ }
+ },safeCallback:function (func) {
+ return function() {
+ if (!ABORT) return func.apply(null, arguments);
+ };
+ },safeRequestAnimationFrame:function (func) {
+ return Browser.requestAnimationFrame(function() {
+ if (!ABORT) func();
+ });
+ },safeSetTimeout:function (func, timeout) {
+ return setTimeout(function() {
+ if (!ABORT) func();
+ }, timeout);
+ },safeSetInterval:function (func, timeout) {
+ return setInterval(function() {
+ if (!ABORT) func();
+ }, timeout);
+ },getMimetype:function (name) {
+ return {
+ 'jpg': 'image/jpeg',
+ 'jpeg': 'image/jpeg',
+ 'png': 'image/png',
+ 'bmp': 'image/bmp',
+ 'ogg': 'audio/ogg',
+ 'wav': 'audio/wav',
+ 'mp3': 'audio/mpeg'
+ }[name.substr(name.lastIndexOf('.')+1)];
+ },getUserMedia:function (func) {
+ if(!window.getUserMedia) {
+ window.getUserMedia = navigator['getUserMedia'] ||
+ navigator['mozGetUserMedia'];
+ }
+ window.getUserMedia(func);
+ },getMovementX:function (event) {
+ return event['movementX'] ||
+ event['mozMovementX'] ||
+ event['webkitMovementX'] ||
+ 0;
+ },getMovementY:function (event) {
+ return event['movementY'] ||
+ event['mozMovementY'] ||
+ event['webkitMovementY'] ||
+ 0;
+ },getMouseWheelDelta:function (event) {
+ return Math.max(-1, Math.min(1, event.type === 'DOMMouseScroll' ? event.detail : -event.wheelDelta));
+ },mouseX:0,mouseY:0,mouseMovementX:0,mouseMovementY:0,calculateMouseEvent:function (event) { // event should be mousemove, mousedown or mouseup
+ if (Browser.pointerLock) {
+ // When the pointer is locked, calculate the coordinates
+ // based on the movement of the mouse.
+ // Workaround for Firefox bug 764498
+ if (event.type != 'mousemove' &&
+ ('mozMovementX' in event)) {
+ Browser.mouseMovementX = Browser.mouseMovementY = 0;
+ } else {
+ Browser.mouseMovementX = Browser.getMovementX(event);
+ Browser.mouseMovementY = Browser.getMovementY(event);
+ }
+
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ Browser.mouseX = SDL.mouseX + Browser.mouseMovementX;
+ Browser.mouseY = SDL.mouseY + Browser.mouseMovementY;
+ } else {
+ // just add the mouse delta to the current absolut mouse position
+ // FIXME: ideally this should be clamped against the canvas size and zero
+ Browser.mouseX += Browser.mouseMovementX;
+ Browser.mouseY += Browser.mouseMovementY;
+ }
+ } else {
+ // Otherwise, calculate the movement based on the changes
+ // in the coordinates.
+ var rect = Module["canvas"].getBoundingClientRect();
+ var x, y;
+
+ // Neither .scrollX or .pageXOffset are defined in a spec, but
+ // we prefer .scrollX because it is currently in a spec draft.
+ // (see: http://www.w3.org/TR/2013/WD-cssom-view-20131217/)
+ var scrollX = ((typeof window.scrollX !== 'undefined') ? window.scrollX : window.pageXOffset);
+ var scrollY = ((typeof window.scrollY !== 'undefined') ? window.scrollY : window.pageYOffset);
+ if (event.type == 'touchstart' ||
+ event.type == 'touchend' ||
+ event.type == 'touchmove') {
+ var t = event.touches.item(0);
+ if (t) {
+ x = t.pageX - (scrollX + rect.left);
+ y = t.pageY - (scrollY + rect.top);
+ } else {
+ return;
+ }
+ } else {
+ x = event.pageX - (scrollX + rect.left);
+ y = event.pageY - (scrollY + rect.top);
+ }
+
+ // the canvas might be CSS-scaled compared to its backbuffer;
+ // SDL-using content will want mouse coordinates in terms
+ // of backbuffer units.
+ var cw = Module["canvas"].width;
+ var ch = Module["canvas"].height;
+ x = x * (cw / rect.width);
+ y = y * (ch / rect.height);
+
+ Browser.mouseMovementX = x - Browser.mouseX;
+ Browser.mouseMovementY = y - Browser.mouseY;
+ Browser.mouseX = x;
+ Browser.mouseY = y;
+ }
+ },xhrLoad:function (url, onload, onerror) {
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, true);
+ xhr.responseType = 'arraybuffer';
+ xhr.onload = function xhr_onload() {
+ if (xhr.status == 200 || (xhr.status == 0 && xhr.response)) { // file URLs can return 0
+ onload(xhr.response);
+ } else {
+ onerror();
+ }
+ };
+ xhr.onerror = onerror;
+ xhr.send(null);
+ },asyncLoad:function (url, onload, onerror, noRunDep) {
+ Browser.xhrLoad(url, function(arrayBuffer) {
+ assert(arrayBuffer, 'Loading data file "' + url + '" failed (no arrayBuffer).');
+ onload(new Uint8Array(arrayBuffer));
+ if (!noRunDep) removeRunDependency('al ' + url);
+ }, function(event) {
+ if (onerror) {
+ onerror();
+ } else {
+ throw 'Loading data file "' + url + '" failed.';
+ }
+ });
+ if (!noRunDep) addRunDependency('al ' + url);
+ },resizeListeners:[],updateResizeListeners:function () {
+ var canvas = Module['canvas'];
+ Browser.resizeListeners.forEach(function(listener) {
+ listener(canvas.width, canvas.height);
+ });
+ },setCanvasSize:function (width, height, noUpdates) {
+ var canvas = Module['canvas'];
+ Browser.updateCanvasDimensions(canvas, width, height);
+ if (!noUpdates) Browser.updateResizeListeners();
+ },windowedWidth:0,windowedHeight:0,setFullScreenCanvasSize:function () {
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
+ flags = flags | 0x00800000; // set SDL_FULLSCREEN flag
+ HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
+ }
+ Browser.updateResizeListeners();
+ },setWindowedCanvasSize:function () {
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
+ flags = flags & ~0x00800000; // clear SDL_FULLSCREEN flag
+ HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
+ }
+ Browser.updateResizeListeners();
+ },updateCanvasDimensions:function (canvas, wNative, hNative) {
+ if (wNative && hNative) {
+ canvas.widthNative = wNative;
+ canvas.heightNative = hNative;
+ } else {
+ wNative = canvas.widthNative;
+ hNative = canvas.heightNative;
+ }
+ var w = wNative;
+ var h = hNative;
+ if (Module['forcedAspectRatio'] && Module['forcedAspectRatio'] > 0) {
+ if (w/h < Module['forcedAspectRatio']) {
+ w = Math.round(h * Module['forcedAspectRatio']);
+ } else {
+ h = Math.round(w / Module['forcedAspectRatio']);
+ }
+ }
+ if (((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
+ document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
+ document['fullScreenElement'] || document['fullscreenElement'] ||
+ document['msFullScreenElement'] || document['msFullscreenElement'] ||
+ document['webkitCurrentFullScreenElement']) === canvas.parentNode) && (typeof screen != 'undefined')) {
+ var factor = Math.min(screen.width / w, screen.height / h);
+ w = Math.round(w * factor);
+ h = Math.round(h * factor);
+ }
+ if (Browser.resizeCanvas) {
+ if (canvas.width != w) canvas.width = w;
+ if (canvas.height != h) canvas.height = h;
+ if (typeof canvas.style != 'undefined') {
+ canvas.style.removeProperty( "width");
+ canvas.style.removeProperty("height");
+ }
+ } else {
+ if (canvas.width != wNative) canvas.width = wNative;
+ if (canvas.height != hNative) canvas.height = hNative;
+ if (typeof canvas.style != 'undefined') {
+ if (w != wNative || h != hNative) {
+ canvas.style.setProperty( "width", w + "px", "important");
+ canvas.style.setProperty("height", h + "px", "important");
+ } else {
+ canvas.style.removeProperty( "width");
+ canvas.style.removeProperty("height");
+ }
+ }
+ }
+ }};
+
+ function _sbrk(bytes) {
+ // Implement a Linux-like 'memory area' for our 'process'.
+ // Changes the size of the memory area by |bytes|; returns the
+ // address of the previous top ('break') of the memory area
+ // We control the "dynamic" memory - DYNAMIC_BASE to DYNAMICTOP
+ var self = _sbrk;
+ if (!self.called) {
+ DYNAMICTOP = alignMemoryPage(DYNAMICTOP); // make sure we start out aligned
+ self.called = true;
+ assert(Runtime.dynamicAlloc);
+ self.alloc = Runtime.dynamicAlloc;
+ Runtime.dynamicAlloc = function() { abort('cannot dynamically allocate, sbrk now has control') };
+ }
+ var ret = DYNAMICTOP;
+ if (bytes != 0) self.alloc(bytes);
+ return ret; // Previous break location.
+ }
+
+ function _sysconf(name) {
+ // long sysconf(int name);
+ // http://pubs.opengroup.org/onlinepubs/009695399/functions/sysconf.html
+ switch(name) {
+ case 30: return PAGE_SIZE;
+ case 132:
+ case 133:
+ case 12:
+ case 137:
+ case 138:
+ case 15:
+ case 235:
+ case 16:
+ case 17:
+ case 18:
+ case 19:
+ case 20:
+ case 149:
+ case 13:
+ case 10:
+ case 236:
+ case 153:
+ case 9:
+ case 21:
+ case 22:
+ case 159:
+ case 154:
+ case 14:
+ case 77:
+ case 78:
+ case 139:
+ case 80:
+ case 81:
+ case 79:
+ case 82:
+ case 68:
+ case 67:
+ case 164:
+ case 11:
+ case 29:
+ case 47:
+ case 48:
+ case 95:
+ case 52:
+ case 51:
+ case 46:
+ return 200809;
+ case 27:
+ case 246:
+ case 127:
+ case 128:
+ case 23:
+ case 24:
+ case 160:
+ case 161:
+ case 181:
+ case 182:
+ case 242:
+ case 183:
+ case 184:
+ case 243:
+ case 244:
+ case 245:
+ case 165:
+ case 178:
+ case 179:
+ case 49:
+ case 50:
+ case 168:
+ case 169:
+ case 175:
+ case 170:
+ case 171:
+ case 172:
+ case 97:
+ case 76:
+ case 32:
+ case 173:
+ case 35:
+ return -1;
+ case 176:
+ case 177:
+ case 7:
+ case 155:
+ case 8:
+ case 157:
+ case 125:
+ case 126:
+ case 92:
+ case 93:
+ case 129:
+ case 130:
+ case 131:
+ case 94:
+ case 91:
+ return 1;
+ case 74:
+ case 60:
+ case 69:
+ case 70:
+ case 4:
+ return 1024;
+ case 31:
+ case 42:
+ case 72:
+ return 32;
+ case 87:
+ case 26:
+ case 33:
+ return 2147483647;
+ case 34:
+ case 1:
+ return 47839;
+ case 38:
+ case 36:
+ return 99;
+ case 43:
+ case 37:
+ return 2048;
+ case 0: return 2097152;
+ case 3: return 65536;
+ case 28: return 32768;
+ case 44: return 32767;
+ case 75: return 16384;
+ case 39: return 1000;
+ case 89: return 700;
+ case 71: return 256;
+ case 40: return 255;
+ case 2: return 100;
+ case 180: return 64;
+ case 25: return 20;
+ case 5: return 16;
+ case 6: return 6;
+ case 73: return 4;
+ case 84: return 1;
+ }
+ ___setErrNo(ERRNO_CODES.EINVAL);
+ return -1;
+ }
+
+ function _emscripten_run_script(ptr) {
+ eval(Pointer_stringify(ptr));
+ }
+
+
+ function _malloc(bytes) {
+ /* Over-allocate to make sure it is byte-aligned by 8.
+ * This will leak memory, but this is only the dummy
+ * implementation (replaced by dlmalloc normally) so
+ * not an issue.
+ */
+ var ptr = Runtime.dynamicAlloc(bytes + 8);
+ return (ptr+8) & 0xFFFFFFF8;
+ }
+ Module["_malloc"] = _malloc;function ___cxa_allocate_exception(size) {
+ var ptr = _malloc(size + ___cxa_exception_header_size);
+ return ptr + ___cxa_exception_header_size;
+ }
+
+ function _emscripten_cancel_main_loop() {
+ Browser.mainLoop.scheduler = null;
+ Browser.mainLoop.shouldPause = true;
+ }
+
+ var __ZTISt9exception=allocate([allocate([1,0,0,0,0,0,0], "i8", ALLOC_STATIC)+8, 0], "i32", ALLOC_STATIC);
+FS.staticInit();__ATINIT__.unshift({ func: function() { if (!Module["noFSInit"] && !FS.init.initialized) FS.init() } });__ATMAIN__.push({ func: function() { FS.ignorePermissions = false } });__ATEXIT__.push({ func: function() { FS.quit() } });Module["FS_createFolder"] = FS.createFolder;Module["FS_createPath"] = FS.createPath;Module["FS_createDataFile"] = FS.createDataFile;Module["FS_createPreloadedFile"] = FS.createPreloadedFile;Module["FS_createLazyFile"] = FS.createLazyFile;Module["FS_createLink"] = FS.createLink;Module["FS_createDevice"] = FS.createDevice;
+___errno_state = Runtime.staticAlloc(4); HEAP32[((___errno_state)>>2)]=0;
+__ATINIT__.unshift({ func: function() { TTY.init() } });__ATEXIT__.push({ func: function() { TTY.shutdown() } });TTY.utf8 = new Runtime.UTF8Processor();
+if (ENVIRONMENT_IS_NODE) { var fs = require("fs"); NODEFS.staticInit(); }
+__ATINIT__.push({ func: function() { SOCKFS.root = FS.mount(SOCKFS, {}, null); } });
+_fputc.ret = allocate([0], "i8", ALLOC_STATIC);
+Module["requestFullScreen"] = function Module_requestFullScreen(lockPointer, resizeCanvas) { Browser.requestFullScreen(lockPointer, resizeCanvas) };
+ Module["requestAnimationFrame"] = function Module_requestAnimationFrame(func) { Browser.requestAnimationFrame(func) };
+ Module["setCanvasSize"] = function Module_setCanvasSize(width, height, noUpdates) { Browser.setCanvasSize(width, height, noUpdates) };
+ Module["pauseMainLoop"] = function Module_pauseMainLoop() { Browser.mainLoop.pause() };
+ Module["resumeMainLoop"] = function Module_resumeMainLoop() { Browser.mainLoop.resume() };
+ Module["getUserMedia"] = function Module_getUserMedia() { Browser.getUserMedia() }
+STACK_BASE = STACKTOP = Runtime.alignMemory(STATICTOP);
+
+staticSealed = true; // seal the static portion of memory
+
+STACK_MAX = STACK_BASE + 5242880;
+
+DYNAMIC_BASE = DYNAMICTOP = Runtime.alignMemory(STACK_MAX);
+
+assert(DYNAMIC_BASE < TOTAL_MEMORY, "TOTAL_MEMORY not big enough for stack");
+
+
+var Math_min = Math.min;
+function invoke_iiii(index,a1,a2,a3) {
+ try {
+ return Module["dynCall_iiii"](index,a1,a2,a3);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function invoke_viiiii(index,a1,a2,a3,a4,a5) {
+ try {
+ Module["dynCall_viiiii"](index,a1,a2,a3,a4,a5);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function invoke_vi(index,a1) {
+ try {
+ Module["dynCall_vi"](index,a1);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function invoke_vii(index,a1,a2) {
+ try {
+ Module["dynCall_vii"](index,a1,a2);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function invoke_ii(index,a1) {
+ try {
+ return Module["dynCall_ii"](index,a1);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function invoke_viii(index,a1,a2,a3) {
+ try {
+ Module["dynCall_viii"](index,a1,a2,a3);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function invoke_v(index) {
+ try {
+ Module["dynCall_v"](index);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function invoke_viid(index,a1,a2,a3) {
+ try {
+ Module["dynCall_viid"](index,a1,a2,a3);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function invoke_viiiiii(index,a1,a2,a3,a4,a5,a6) {
+ try {
+ Module["dynCall_viiiiii"](index,a1,a2,a3,a4,a5,a6);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function invoke_iii(index,a1,a2) {
+ try {
+ return Module["dynCall_iii"](index,a1,a2);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function invoke_iiiiii(index,a1,a2,a3,a4,a5) {
+ try {
+ return Module["dynCall_iiiiii"](index,a1,a2,a3,a4,a5);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function invoke_viiii(index,a1,a2,a3,a4) {
+ try {
+ Module["dynCall_viiii"](index,a1,a2,a3,a4);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function asmPrintInt(x, y) {
+ Module.print('int ' + x + ',' + y);// + ' ' + new Error().stack);
+}
+function asmPrintFloat(x, y) {
+ Module.print('float ' + x + ',' + y);// + ' ' + new Error().stack);
+}
+// EMSCRIPTEN_START_ASM
+var asm = Wasm.instantiateModuleFromAsm((function Module(global, env, buffer) {
+ 'use asm';
+ var HEAP8 = new global.Int8Array(buffer);
+ var HEAP16 = new global.Int16Array(buffer);
+ var HEAP32 = new global.Int32Array(buffer);
+ var HEAPU8 = new global.Uint8Array(buffer);
+ var HEAPU16 = new global.Uint16Array(buffer);
+ var HEAPU32 = new global.Uint32Array(buffer);
+ var HEAPF32 = new global.Float32Array(buffer);
+ var HEAPF64 = new global.Float64Array(buffer);
+
+ var STACKTOP=env.STACKTOP|0;
+ var STACK_MAX=env.STACK_MAX|0;
+ var tempDoublePtr=env.tempDoublePtr|0;
+ var ABORT=env.ABORT|0;
+ var __ZTISt9exception=env.__ZTISt9exception|0;
+
+ var __THREW__ = 0;
+ var threwValue = 0;
+ var setjmpId = 0;
+ var undef = 0;
+ var nan = +env.NaN, inf = +env.Infinity;
+ var tempInt = 0, tempBigInt = 0, tempBigIntP = 0, tempBigIntS = 0, tempBigIntR = 0.0, tempBigIntI = 0, tempBigIntD = 0, tempValue = 0, tempDouble = 0.0;
+
+ var tempRet0 = 0;
+ var tempRet1 = 0;
+ var tempRet2 = 0;
+ var tempRet3 = 0;
+ var tempRet4 = 0;
+ var tempRet5 = 0;
+ var tempRet6 = 0;
+ var tempRet7 = 0;
+ var tempRet8 = 0;
+ var tempRet9 = 0;
+ var Math_floor=global.Math.floor;
+ var Math_abs=global.Math.abs;
+ var Math_sqrt=global.Math.sqrt;
+ var Math_pow=global.Math.pow;
+ var Math_cos=global.Math.cos;
+ var Math_sin=global.Math.sin;
+ var Math_tan=global.Math.tan;
+ var Math_acos=global.Math.acos;
+ var Math_asin=global.Math.asin;
+ var Math_atan=global.Math.atan;
+ var Math_atan2=global.Math.atan2;
+ var Math_exp=global.Math.exp;
+ var Math_log=global.Math.log;
+ var Math_ceil=global.Math.ceil;
+ var Math_imul=global.Math.imul;
+ var abort=env.abort;
+ var assert=env.assert;
+ var asmPrintInt=env.asmPrintInt;
+ var asmPrintFloat=env.asmPrintFloat;
+ var Math_min=env.min;
+ var invoke_iiii=env.invoke_iiii;
+ var invoke_viiiii=env.invoke_viiiii;
+ var invoke_vi=env.invoke_vi;
+ var invoke_vii=env.invoke_vii;
+ var invoke_ii=env.invoke_ii;
+ var invoke_viii=env.invoke_viii;
+ var invoke_v=env.invoke_v;
+ var invoke_viid=env.invoke_viid;
+ var invoke_viiiiii=env.invoke_viiiiii;
+ var invoke_iii=env.invoke_iii;
+ var invoke_iiiiii=env.invoke_iiiiii;
+ var invoke_viiii=env.invoke_viiii;
+ var ___cxa_throw=env.___cxa_throw;
+ var _emscripten_run_script=env._emscripten_run_script;
+ var _cosf=env._cosf;
+ var _send=env._send;
+ var __ZSt9terminatev=env.__ZSt9terminatev;
+ var __reallyNegative=env.__reallyNegative;
+ var ___cxa_is_number_type=env.___cxa_is_number_type;
+ var ___assert_fail=env.___assert_fail;
+ var ___cxa_allocate_exception=env.___cxa_allocate_exception;
+ var ___cxa_find_matching_catch=env.___cxa_find_matching_catch;
+ var _fflush=env._fflush;
+ var _pwrite=env._pwrite;
+ var ___setErrNo=env.___setErrNo;
+ var _sbrk=env._sbrk;
+ var ___cxa_begin_catch=env.___cxa_begin_catch;
+ var _sinf=env._sinf;
+ var _fileno=env._fileno;
+ var ___resumeException=env.___resumeException;
+ var __ZSt18uncaught_exceptionv=env.__ZSt18uncaught_exceptionv;
+ var _sysconf=env._sysconf;
+ var _clock=env._clock;
+ var _emscripten_memcpy_big=env._emscripten_memcpy_big;
+ var _puts=env._puts;
+ var _mkport=env._mkport;
+ var _floorf=env._floorf;
+ var _sqrtf=env._sqrtf;
+ var _write=env._write;
+ var _emscripten_set_main_loop=env._emscripten_set_main_loop;
+ var ___errno_location=env.___errno_location;
+ var __ZNSt9exceptionD2Ev=env.__ZNSt9exceptionD2Ev;
+ var _printf=env._printf;
+ var ___cxa_does_inherit=env.___cxa_does_inherit;
+ var __exit=env.__exit;
+ var _fputc=env._fputc;
+ var _abort=env._abort;
+ var _fwrite=env._fwrite;
+ var _time=env._time;
+ var _fprintf=env._fprintf;
+ var _emscripten_cancel_main_loop=env._emscripten_cancel_main_loop;
+ var __formatString=env.__formatString;
+ var _fputs=env._fputs;
+ var _exit=env._exit;
+ var ___cxa_pure_virtual=env.___cxa_pure_virtual;
+ var tempFloat = 0.0;
+
+// EMSCRIPTEN_START_FUNCS
+function _malloc(i12) {
+ i12 = i12 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0, i30 = 0, i31 = 0, i32 = 0;
+ i1 = STACKTOP;
+ do {
+ if (i12 >>> 0 < 245) {
+ if (i12 >>> 0 < 11) {
+ i12 = 16;
+ } else {
+ i12 = i12 + 11 & -8;
+ }
+ i20 = i12 >>> 3;
+ i18 = HEAP32[1790] | 0;
+ i21 = i18 >>> i20;
+ if ((i21 & 3 | 0) != 0) {
+ i6 = (i21 & 1 ^ 1) + i20 | 0;
+ i5 = i6 << 1;
+ i3 = 7200 + (i5 << 2) | 0;
+ i5 = 7200 + (i5 + 2 << 2) | 0;
+ i7 = HEAP32[i5 >> 2] | 0;
+ i2 = i7 + 8 | 0;
+ i4 = HEAP32[i2 >> 2] | 0;
+ do {
+ if ((i3 | 0) != (i4 | 0)) {
+ if (i4 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i8 = i4 + 12 | 0;
+ if ((HEAP32[i8 >> 2] | 0) == (i7 | 0)) {
+ HEAP32[i8 >> 2] = i3;
+ HEAP32[i5 >> 2] = i4;
+ break;
+ } else {
+ _abort();
+ }
+ } else {
+ HEAP32[1790] = i18 & ~(1 << i6);
+ }
+ } while (0);
+ i32 = i6 << 3;
+ HEAP32[i7 + 4 >> 2] = i32 | 3;
+ i32 = i7 + (i32 | 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ i32 = i2;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ if (i12 >>> 0 > (HEAP32[7168 >> 2] | 0) >>> 0) {
+ if ((i21 | 0) != 0) {
+ i7 = 2 << i20;
+ i7 = i21 << i20 & (i7 | 0 - i7);
+ i7 = (i7 & 0 - i7) + -1 | 0;
+ i2 = i7 >>> 12 & 16;
+ i7 = i7 >>> i2;
+ i6 = i7 >>> 5 & 8;
+ i7 = i7 >>> i6;
+ i5 = i7 >>> 2 & 4;
+ i7 = i7 >>> i5;
+ i4 = i7 >>> 1 & 2;
+ i7 = i7 >>> i4;
+ i3 = i7 >>> 1 & 1;
+ i3 = (i6 | i2 | i5 | i4 | i3) + (i7 >>> i3) | 0;
+ i7 = i3 << 1;
+ i4 = 7200 + (i7 << 2) | 0;
+ i7 = 7200 + (i7 + 2 << 2) | 0;
+ i5 = HEAP32[i7 >> 2] | 0;
+ i2 = i5 + 8 | 0;
+ i6 = HEAP32[i2 >> 2] | 0;
+ do {
+ if ((i4 | 0) != (i6 | 0)) {
+ if (i6 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i8 = i6 + 12 | 0;
+ if ((HEAP32[i8 >> 2] | 0) == (i5 | 0)) {
+ HEAP32[i8 >> 2] = i4;
+ HEAP32[i7 >> 2] = i6;
+ break;
+ } else {
+ _abort();
+ }
+ } else {
+ HEAP32[1790] = i18 & ~(1 << i3);
+ }
+ } while (0);
+ i6 = i3 << 3;
+ i4 = i6 - i12 | 0;
+ HEAP32[i5 + 4 >> 2] = i12 | 3;
+ i3 = i5 + i12 | 0;
+ HEAP32[i5 + (i12 | 4) >> 2] = i4 | 1;
+ HEAP32[i5 + i6 >> 2] = i4;
+ i6 = HEAP32[7168 >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ i5 = HEAP32[7180 >> 2] | 0;
+ i8 = i6 >>> 3;
+ i9 = i8 << 1;
+ i6 = 7200 + (i9 << 2) | 0;
+ i7 = HEAP32[1790] | 0;
+ i8 = 1 << i8;
+ if ((i7 & i8 | 0) != 0) {
+ i7 = 7200 + (i9 + 2 << 2) | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ if (i8 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i28 = i7;
+ i27 = i8;
+ }
+ } else {
+ HEAP32[1790] = i7 | i8;
+ i28 = 7200 + (i9 + 2 << 2) | 0;
+ i27 = i6;
+ }
+ HEAP32[i28 >> 2] = i5;
+ HEAP32[i27 + 12 >> 2] = i5;
+ HEAP32[i5 + 8 >> 2] = i27;
+ HEAP32[i5 + 12 >> 2] = i6;
+ }
+ HEAP32[7168 >> 2] = i4;
+ HEAP32[7180 >> 2] = i3;
+ i32 = i2;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i18 = HEAP32[7164 >> 2] | 0;
+ if ((i18 | 0) != 0) {
+ i2 = (i18 & 0 - i18) + -1 | 0;
+ i31 = i2 >>> 12 & 16;
+ i2 = i2 >>> i31;
+ i30 = i2 >>> 5 & 8;
+ i2 = i2 >>> i30;
+ i32 = i2 >>> 2 & 4;
+ i2 = i2 >>> i32;
+ i6 = i2 >>> 1 & 2;
+ i2 = i2 >>> i6;
+ i3 = i2 >>> 1 & 1;
+ i3 = HEAP32[7464 + ((i30 | i31 | i32 | i6 | i3) + (i2 >>> i3) << 2) >> 2] | 0;
+ i2 = (HEAP32[i3 + 4 >> 2] & -8) - i12 | 0;
+ i6 = i3;
+ while (1) {
+ i5 = HEAP32[i6 + 16 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ i5 = HEAP32[i6 + 20 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ }
+ i6 = (HEAP32[i5 + 4 >> 2] & -8) - i12 | 0;
+ i4 = i6 >>> 0 < i2 >>> 0;
+ i2 = i4 ? i6 : i2;
+ i6 = i5;
+ i3 = i4 ? i5 : i3;
+ }
+ i6 = HEAP32[7176 >> 2] | 0;
+ if (i3 >>> 0 < i6 >>> 0) {
+ _abort();
+ }
+ i4 = i3 + i12 | 0;
+ if (!(i3 >>> 0 < i4 >>> 0)) {
+ _abort();
+ }
+ i5 = HEAP32[i3 + 24 >> 2] | 0;
+ i7 = HEAP32[i3 + 12 >> 2] | 0;
+ do {
+ if ((i7 | 0) == (i3 | 0)) {
+ i8 = i3 + 20 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ if ((i7 | 0) == 0) {
+ i8 = i3 + 16 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ if ((i7 | 0) == 0) {
+ i26 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i10 = i7 + 20 | 0;
+ i9 = HEAP32[i10 >> 2] | 0;
+ if ((i9 | 0) != 0) {
+ i7 = i9;
+ i8 = i10;
+ continue;
+ }
+ i10 = i7 + 16 | 0;
+ i9 = HEAP32[i10 >> 2] | 0;
+ if ((i9 | 0) == 0) {
+ break;
+ } else {
+ i7 = i9;
+ i8 = i10;
+ }
+ }
+ if (i8 >>> 0 < i6 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i8 >> 2] = 0;
+ i26 = i7;
+ break;
+ }
+ } else {
+ i8 = HEAP32[i3 + 8 >> 2] | 0;
+ if (i8 >>> 0 < i6 >>> 0) {
+ _abort();
+ }
+ i6 = i8 + 12 | 0;
+ if ((HEAP32[i6 >> 2] | 0) != (i3 | 0)) {
+ _abort();
+ }
+ i9 = i7 + 8 | 0;
+ if ((HEAP32[i9 >> 2] | 0) == (i3 | 0)) {
+ HEAP32[i6 >> 2] = i7;
+ HEAP32[i9 >> 2] = i8;
+ i26 = i7;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ do {
+ if ((i5 | 0) != 0) {
+ i7 = HEAP32[i3 + 28 >> 2] | 0;
+ i6 = 7464 + (i7 << 2) | 0;
+ if ((i3 | 0) == (HEAP32[i6 >> 2] | 0)) {
+ HEAP32[i6 >> 2] = i26;
+ if ((i26 | 0) == 0) {
+ HEAP32[7164 >> 2] = HEAP32[7164 >> 2] & ~(1 << i7);
+ break;
+ }
+ } else {
+ if (i5 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i6 = i5 + 16 | 0;
+ if ((HEAP32[i6 >> 2] | 0) == (i3 | 0)) {
+ HEAP32[i6 >> 2] = i26;
+ } else {
+ HEAP32[i5 + 20 >> 2] = i26;
+ }
+ if ((i26 | 0) == 0) {
+ break;
+ }
+ }
+ if (i26 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i26 + 24 >> 2] = i5;
+ i5 = HEAP32[i3 + 16 >> 2] | 0;
+ do {
+ if ((i5 | 0) != 0) {
+ if (i5 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i26 + 16 >> 2] = i5;
+ HEAP32[i5 + 24 >> 2] = i26;
+ break;
+ }
+ }
+ } while (0);
+ i5 = HEAP32[i3 + 20 >> 2] | 0;
+ if ((i5 | 0) != 0) {
+ if (i5 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i26 + 20 >> 2] = i5;
+ HEAP32[i5 + 24 >> 2] = i26;
+ break;
+ }
+ }
+ }
+ } while (0);
+ if (i2 >>> 0 < 16) {
+ i32 = i2 + i12 | 0;
+ HEAP32[i3 + 4 >> 2] = i32 | 3;
+ i32 = i3 + (i32 + 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ } else {
+ HEAP32[i3 + 4 >> 2] = i12 | 3;
+ HEAP32[i3 + (i12 | 4) >> 2] = i2 | 1;
+ HEAP32[i3 + (i2 + i12) >> 2] = i2;
+ i6 = HEAP32[7168 >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ i5 = HEAP32[7180 >> 2] | 0;
+ i8 = i6 >>> 3;
+ i9 = i8 << 1;
+ i6 = 7200 + (i9 << 2) | 0;
+ i7 = HEAP32[1790] | 0;
+ i8 = 1 << i8;
+ if ((i7 & i8 | 0) != 0) {
+ i7 = 7200 + (i9 + 2 << 2) | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ if (i8 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i25 = i7;
+ i24 = i8;
+ }
+ } else {
+ HEAP32[1790] = i7 | i8;
+ i25 = 7200 + (i9 + 2 << 2) | 0;
+ i24 = i6;
+ }
+ HEAP32[i25 >> 2] = i5;
+ HEAP32[i24 + 12 >> 2] = i5;
+ HEAP32[i5 + 8 >> 2] = i24;
+ HEAP32[i5 + 12 >> 2] = i6;
+ }
+ HEAP32[7168 >> 2] = i2;
+ HEAP32[7180 >> 2] = i4;
+ }
+ i32 = i3 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ }
+ } else {
+ if (!(i12 >>> 0 > 4294967231)) {
+ i24 = i12 + 11 | 0;
+ i12 = i24 & -8;
+ i26 = HEAP32[7164 >> 2] | 0;
+ if ((i26 | 0) != 0) {
+ i25 = 0 - i12 | 0;
+ i24 = i24 >>> 8;
+ if ((i24 | 0) != 0) {
+ if (i12 >>> 0 > 16777215) {
+ i27 = 31;
+ } else {
+ i31 = (i24 + 1048320 | 0) >>> 16 & 8;
+ i32 = i24 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i27 = (i32 + 245760 | 0) >>> 16 & 2;
+ i27 = 14 - (i30 | i31 | i27) + (i32 << i27 >>> 15) | 0;
+ i27 = i12 >>> (i27 + 7 | 0) & 1 | i27 << 1;
+ }
+ } else {
+ i27 = 0;
+ }
+ i30 = HEAP32[7464 + (i27 << 2) >> 2] | 0;
+ L126 : do {
+ if ((i30 | 0) == 0) {
+ i29 = 0;
+ i24 = 0;
+ } else {
+ if ((i27 | 0) == 31) {
+ i24 = 0;
+ } else {
+ i24 = 25 - (i27 >>> 1) | 0;
+ }
+ i29 = 0;
+ i28 = i12 << i24;
+ i24 = 0;
+ while (1) {
+ i32 = HEAP32[i30 + 4 >> 2] & -8;
+ i31 = i32 - i12 | 0;
+ if (i31 >>> 0 < i25 >>> 0) {
+ if ((i32 | 0) == (i12 | 0)) {
+ i25 = i31;
+ i29 = i30;
+ i24 = i30;
+ break L126;
+ } else {
+ i25 = i31;
+ i24 = i30;
+ }
+ }
+ i31 = HEAP32[i30 + 20 >> 2] | 0;
+ i30 = HEAP32[i30 + (i28 >>> 31 << 2) + 16 >> 2] | 0;
+ i29 = (i31 | 0) == 0 | (i31 | 0) == (i30 | 0) ? i29 : i31;
+ if ((i30 | 0) == 0) {
+ break;
+ } else {
+ i28 = i28 << 1;
+ }
+ }
+ }
+ } while (0);
+ if ((i29 | 0) == 0 & (i24 | 0) == 0) {
+ i32 = 2 << i27;
+ i26 = i26 & (i32 | 0 - i32);
+ if ((i26 | 0) == 0) {
+ break;
+ }
+ i32 = (i26 & 0 - i26) + -1 | 0;
+ i28 = i32 >>> 12 & 16;
+ i32 = i32 >>> i28;
+ i27 = i32 >>> 5 & 8;
+ i32 = i32 >>> i27;
+ i30 = i32 >>> 2 & 4;
+ i32 = i32 >>> i30;
+ i31 = i32 >>> 1 & 2;
+ i32 = i32 >>> i31;
+ i29 = i32 >>> 1 & 1;
+ i29 = HEAP32[7464 + ((i27 | i28 | i30 | i31 | i29) + (i32 >>> i29) << 2) >> 2] | 0;
+ }
+ if ((i29 | 0) != 0) {
+ while (1) {
+ i27 = (HEAP32[i29 + 4 >> 2] & -8) - i12 | 0;
+ i26 = i27 >>> 0 < i25 >>> 0;
+ i25 = i26 ? i27 : i25;
+ i24 = i26 ? i29 : i24;
+ i26 = HEAP32[i29 + 16 >> 2] | 0;
+ if ((i26 | 0) != 0) {
+ i29 = i26;
+ continue;
+ }
+ i29 = HEAP32[i29 + 20 >> 2] | 0;
+ if ((i29 | 0) == 0) {
+ break;
+ }
+ }
+ }
+ if ((i24 | 0) != 0 ? i25 >>> 0 < ((HEAP32[7168 >> 2] | 0) - i12 | 0) >>> 0 : 0) {
+ i4 = HEAP32[7176 >> 2] | 0;
+ if (i24 >>> 0 < i4 >>> 0) {
+ _abort();
+ }
+ i2 = i24 + i12 | 0;
+ if (!(i24 >>> 0 < i2 >>> 0)) {
+ _abort();
+ }
+ i3 = HEAP32[i24 + 24 >> 2] | 0;
+ i6 = HEAP32[i24 + 12 >> 2] | 0;
+ do {
+ if ((i6 | 0) == (i24 | 0)) {
+ i6 = i24 + 20 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ i6 = i24 + 16 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ i22 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i8 = i5 + 20 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ if ((i7 | 0) != 0) {
+ i5 = i7;
+ i6 = i8;
+ continue;
+ }
+ i7 = i5 + 16 | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ if ((i8 | 0) == 0) {
+ break;
+ } else {
+ i5 = i8;
+ i6 = i7;
+ }
+ }
+ if (i6 >>> 0 < i4 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i6 >> 2] = 0;
+ i22 = i5;
+ break;
+ }
+ } else {
+ i5 = HEAP32[i24 + 8 >> 2] | 0;
+ if (i5 >>> 0 < i4 >>> 0) {
+ _abort();
+ }
+ i7 = i5 + 12 | 0;
+ if ((HEAP32[i7 >> 2] | 0) != (i24 | 0)) {
+ _abort();
+ }
+ i4 = i6 + 8 | 0;
+ if ((HEAP32[i4 >> 2] | 0) == (i24 | 0)) {
+ HEAP32[i7 >> 2] = i6;
+ HEAP32[i4 >> 2] = i5;
+ i22 = i6;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ do {
+ if ((i3 | 0) != 0) {
+ i4 = HEAP32[i24 + 28 >> 2] | 0;
+ i5 = 7464 + (i4 << 2) | 0;
+ if ((i24 | 0) == (HEAP32[i5 >> 2] | 0)) {
+ HEAP32[i5 >> 2] = i22;
+ if ((i22 | 0) == 0) {
+ HEAP32[7164 >> 2] = HEAP32[7164 >> 2] & ~(1 << i4);
+ break;
+ }
+ } else {
+ if (i3 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i4 = i3 + 16 | 0;
+ if ((HEAP32[i4 >> 2] | 0) == (i24 | 0)) {
+ HEAP32[i4 >> 2] = i22;
+ } else {
+ HEAP32[i3 + 20 >> 2] = i22;
+ }
+ if ((i22 | 0) == 0) {
+ break;
+ }
+ }
+ if (i22 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i22 + 24 >> 2] = i3;
+ i3 = HEAP32[i24 + 16 >> 2] | 0;
+ do {
+ if ((i3 | 0) != 0) {
+ if (i3 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i22 + 16 >> 2] = i3;
+ HEAP32[i3 + 24 >> 2] = i22;
+ break;
+ }
+ }
+ } while (0);
+ i3 = HEAP32[i24 + 20 >> 2] | 0;
+ if ((i3 | 0) != 0) {
+ if (i3 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i22 + 20 >> 2] = i3;
+ HEAP32[i3 + 24 >> 2] = i22;
+ break;
+ }
+ }
+ }
+ } while (0);
+ L204 : do {
+ if (!(i25 >>> 0 < 16)) {
+ HEAP32[i24 + 4 >> 2] = i12 | 3;
+ HEAP32[i24 + (i12 | 4) >> 2] = i25 | 1;
+ HEAP32[i24 + (i25 + i12) >> 2] = i25;
+ i4 = i25 >>> 3;
+ if (i25 >>> 0 < 256) {
+ i6 = i4 << 1;
+ i3 = 7200 + (i6 << 2) | 0;
+ i5 = HEAP32[1790] | 0;
+ i4 = 1 << i4;
+ if ((i5 & i4 | 0) != 0) {
+ i5 = 7200 + (i6 + 2 << 2) | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ if (i4 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i21 = i5;
+ i20 = i4;
+ }
+ } else {
+ HEAP32[1790] = i5 | i4;
+ i21 = 7200 + (i6 + 2 << 2) | 0;
+ i20 = i3;
+ }
+ HEAP32[i21 >> 2] = i2;
+ HEAP32[i20 + 12 >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i20;
+ HEAP32[i24 + (i12 + 12) >> 2] = i3;
+ break;
+ }
+ i3 = i25 >>> 8;
+ if ((i3 | 0) != 0) {
+ if (i25 >>> 0 > 16777215) {
+ i3 = 31;
+ } else {
+ i31 = (i3 + 1048320 | 0) >>> 16 & 8;
+ i32 = i3 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i3 = (i32 + 245760 | 0) >>> 16 & 2;
+ i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
+ i3 = i25 >>> (i3 + 7 | 0) & 1 | i3 << 1;
+ }
+ } else {
+ i3 = 0;
+ }
+ i6 = 7464 + (i3 << 2) | 0;
+ HEAP32[i24 + (i12 + 28) >> 2] = i3;
+ HEAP32[i24 + (i12 + 20) >> 2] = 0;
+ HEAP32[i24 + (i12 + 16) >> 2] = 0;
+ i4 = HEAP32[7164 >> 2] | 0;
+ i5 = 1 << i3;
+ if ((i4 & i5 | 0) == 0) {
+ HEAP32[7164 >> 2] = i4 | i5;
+ HEAP32[i6 >> 2] = i2;
+ HEAP32[i24 + (i12 + 24) >> 2] = i6;
+ HEAP32[i24 + (i12 + 12) >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i2;
+ break;
+ }
+ i4 = HEAP32[i6 >> 2] | 0;
+ if ((i3 | 0) == 31) {
+ i3 = 0;
+ } else {
+ i3 = 25 - (i3 >>> 1) | 0;
+ }
+ L225 : do {
+ if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i25 | 0)) {
+ i3 = i25 << i3;
+ while (1) {
+ i6 = i4 + (i3 >>> 31 << 2) + 16 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) == (i25 | 0)) {
+ i18 = i5;
+ break L225;
+ } else {
+ i3 = i3 << 1;
+ i4 = i5;
+ }
+ }
+ if (i6 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i6 >> 2] = i2;
+ HEAP32[i24 + (i12 + 24) >> 2] = i4;
+ HEAP32[i24 + (i12 + 12) >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i2;
+ break L204;
+ }
+ } else {
+ i18 = i4;
+ }
+ } while (0);
+ i4 = i18 + 8 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ i5 = HEAP32[7176 >> 2] | 0;
+ if (i18 >>> 0 < i5 >>> 0) {
+ _abort();
+ }
+ if (i3 >>> 0 < i5 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i3 + 12 >> 2] = i2;
+ HEAP32[i4 >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i3;
+ HEAP32[i24 + (i12 + 12) >> 2] = i18;
+ HEAP32[i24 + (i12 + 24) >> 2] = 0;
+ break;
+ }
+ } else {
+ i32 = i25 + i12 | 0;
+ HEAP32[i24 + 4 >> 2] = i32 | 3;
+ i32 = i24 + (i32 + 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ }
+ } while (0);
+ i32 = i24 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ }
+ } else {
+ i12 = -1;
+ }
+ }
+ } while (0);
+ i18 = HEAP32[7168 >> 2] | 0;
+ if (!(i12 >>> 0 > i18 >>> 0)) {
+ i3 = i18 - i12 | 0;
+ i2 = HEAP32[7180 >> 2] | 0;
+ if (i3 >>> 0 > 15) {
+ HEAP32[7180 >> 2] = i2 + i12;
+ HEAP32[7168 >> 2] = i3;
+ HEAP32[i2 + (i12 + 4) >> 2] = i3 | 1;
+ HEAP32[i2 + i18 >> 2] = i3;
+ HEAP32[i2 + 4 >> 2] = i12 | 3;
+ } else {
+ HEAP32[7168 >> 2] = 0;
+ HEAP32[7180 >> 2] = 0;
+ HEAP32[i2 + 4 >> 2] = i18 | 3;
+ i32 = i2 + (i18 + 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ }
+ i32 = i2 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i18 = HEAP32[7172 >> 2] | 0;
+ if (i12 >>> 0 < i18 >>> 0) {
+ i31 = i18 - i12 | 0;
+ HEAP32[7172 >> 2] = i31;
+ i32 = HEAP32[7184 >> 2] | 0;
+ HEAP32[7184 >> 2] = i32 + i12;
+ HEAP32[i32 + (i12 + 4) >> 2] = i31 | 1;
+ HEAP32[i32 + 4 >> 2] = i12 | 3;
+ i32 = i32 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ do {
+ if ((HEAP32[1908] | 0) == 0) {
+ i18 = _sysconf(30) | 0;
+ if ((i18 + -1 & i18 | 0) == 0) {
+ HEAP32[7640 >> 2] = i18;
+ HEAP32[7636 >> 2] = i18;
+ HEAP32[7644 >> 2] = -1;
+ HEAP32[7648 >> 2] = -1;
+ HEAP32[7652 >> 2] = 0;
+ HEAP32[7604 >> 2] = 0;
+ HEAP32[1908] = (_time(0) | 0) & -16 ^ 1431655768;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ i20 = i12 + 48 | 0;
+ i25 = HEAP32[7640 >> 2] | 0;
+ i21 = i12 + 47 | 0;
+ i22 = i25 + i21 | 0;
+ i25 = 0 - i25 | 0;
+ i18 = i22 & i25;
+ if (!(i18 >>> 0 > i12 >>> 0)) {
+ i32 = 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i24 = HEAP32[7600 >> 2] | 0;
+ if ((i24 | 0) != 0 ? (i31 = HEAP32[7592 >> 2] | 0, i32 = i31 + i18 | 0, i32 >>> 0 <= i31 >>> 0 | i32 >>> 0 > i24 >>> 0) : 0) {
+ i32 = 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ L269 : do {
+ if ((HEAP32[7604 >> 2] & 4 | 0) == 0) {
+ i26 = HEAP32[7184 >> 2] | 0;
+ L271 : do {
+ if ((i26 | 0) != 0) {
+ i24 = 7608 | 0;
+ while (1) {
+ i27 = HEAP32[i24 >> 2] | 0;
+ if (!(i27 >>> 0 > i26 >>> 0) ? (i23 = i24 + 4 | 0, (i27 + (HEAP32[i23 >> 2] | 0) | 0) >>> 0 > i26 >>> 0) : 0) {
+ break;
+ }
+ i24 = HEAP32[i24 + 8 >> 2] | 0;
+ if ((i24 | 0) == 0) {
+ i13 = 182;
+ break L271;
+ }
+ }
+ if ((i24 | 0) != 0) {
+ i25 = i22 - (HEAP32[7172 >> 2] | 0) & i25;
+ if (i25 >>> 0 < 2147483647) {
+ i13 = _sbrk(i25 | 0) | 0;
+ i26 = (i13 | 0) == ((HEAP32[i24 >> 2] | 0) + (HEAP32[i23 >> 2] | 0) | 0);
+ i22 = i13;
+ i24 = i25;
+ i23 = i26 ? i13 : -1;
+ i25 = i26 ? i25 : 0;
+ i13 = 191;
+ } else {
+ i25 = 0;
+ }
+ } else {
+ i13 = 182;
+ }
+ } else {
+ i13 = 182;
+ }
+ } while (0);
+ do {
+ if ((i13 | 0) == 182) {
+ i23 = _sbrk(0) | 0;
+ if ((i23 | 0) != (-1 | 0)) {
+ i24 = i23;
+ i22 = HEAP32[7636 >> 2] | 0;
+ i25 = i22 + -1 | 0;
+ if ((i25 & i24 | 0) == 0) {
+ i25 = i18;
+ } else {
+ i25 = i18 - i24 + (i25 + i24 & 0 - i22) | 0;
+ }
+ i24 = HEAP32[7592 >> 2] | 0;
+ i26 = i24 + i25 | 0;
+ if (i25 >>> 0 > i12 >>> 0 & i25 >>> 0 < 2147483647) {
+ i22 = HEAP32[7600 >> 2] | 0;
+ if ((i22 | 0) != 0 ? i26 >>> 0 <= i24 >>> 0 | i26 >>> 0 > i22 >>> 0 : 0) {
+ i25 = 0;
+ break;
+ }
+ i22 = _sbrk(i25 | 0) | 0;
+ i13 = (i22 | 0) == (i23 | 0);
+ i24 = i25;
+ i23 = i13 ? i23 : -1;
+ i25 = i13 ? i25 : 0;
+ i13 = 191;
+ } else {
+ i25 = 0;
+ }
+ } else {
+ i25 = 0;
+ }
+ }
+ } while (0);
+ L291 : do {
+ if ((i13 | 0) == 191) {
+ i13 = 0 - i24 | 0;
+ if ((i23 | 0) != (-1 | 0)) {
+ i17 = i23;
+ i14 = i25;
+ i13 = 202;
+ break L269;
+ }
+ do {
+ if ((i22 | 0) != (-1 | 0) & i24 >>> 0 < 2147483647 & i24 >>> 0 < i20 >>> 0 ? (i19 = HEAP32[7640 >> 2] | 0, i19 = i21 - i24 + i19 & 0 - i19, i19 >>> 0 < 2147483647) : 0) {
+ if ((_sbrk(i19 | 0) | 0) == (-1 | 0)) {
+ _sbrk(i13 | 0) | 0;
+ break L291;
+ } else {
+ i24 = i19 + i24 | 0;
+ break;
+ }
+ }
+ } while (0);
+ if ((i22 | 0) != (-1 | 0)) {
+ i17 = i22;
+ i14 = i24;
+ i13 = 202;
+ break L269;
+ }
+ }
+ } while (0);
+ HEAP32[7604 >> 2] = HEAP32[7604 >> 2] | 4;
+ i13 = 199;
+ } else {
+ i25 = 0;
+ i13 = 199;
+ }
+ } while (0);
+ if ((((i13 | 0) == 199 ? i18 >>> 0 < 2147483647 : 0) ? (i17 = _sbrk(i18 | 0) | 0, i16 = _sbrk(0) | 0, (i16 | 0) != (-1 | 0) & (i17 | 0) != (-1 | 0) & i17 >>> 0 < i16 >>> 0) : 0) ? (i15 = i16 - i17 | 0, i14 = i15 >>> 0 > (i12 + 40 | 0) >>> 0, i14) : 0) {
+ i14 = i14 ? i15 : i25;
+ i13 = 202;
+ }
+ if ((i13 | 0) == 202) {
+ i15 = (HEAP32[7592 >> 2] | 0) + i14 | 0;
+ HEAP32[7592 >> 2] = i15;
+ if (i15 >>> 0 > (HEAP32[7596 >> 2] | 0) >>> 0) {
+ HEAP32[7596 >> 2] = i15;
+ }
+ i15 = HEAP32[7184 >> 2] | 0;
+ L311 : do {
+ if ((i15 | 0) != 0) {
+ i21 = 7608 | 0;
+ while (1) {
+ i16 = HEAP32[i21 >> 2] | 0;
+ i19 = i21 + 4 | 0;
+ i20 = HEAP32[i19 >> 2] | 0;
+ if ((i17 | 0) == (i16 + i20 | 0)) {
+ i13 = 214;
+ break;
+ }
+ i18 = HEAP32[i21 + 8 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ break;
+ } else {
+ i21 = i18;
+ }
+ }
+ if (((i13 | 0) == 214 ? (HEAP32[i21 + 12 >> 2] & 8 | 0) == 0 : 0) ? i15 >>> 0 >= i16 >>> 0 & i15 >>> 0 < i17 >>> 0 : 0) {
+ HEAP32[i19 >> 2] = i20 + i14;
+ i2 = (HEAP32[7172 >> 2] | 0) + i14 | 0;
+ i3 = i15 + 8 | 0;
+ if ((i3 & 7 | 0) == 0) {
+ i3 = 0;
+ } else {
+ i3 = 0 - i3 & 7;
+ }
+ i32 = i2 - i3 | 0;
+ HEAP32[7184 >> 2] = i15 + i3;
+ HEAP32[7172 >> 2] = i32;
+ HEAP32[i15 + (i3 + 4) >> 2] = i32 | 1;
+ HEAP32[i15 + (i2 + 4) >> 2] = 40;
+ HEAP32[7188 >> 2] = HEAP32[7648 >> 2];
+ break;
+ }
+ if (i17 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ HEAP32[7176 >> 2] = i17;
+ }
+ i19 = i17 + i14 | 0;
+ i16 = 7608 | 0;
+ while (1) {
+ if ((HEAP32[i16 >> 2] | 0) == (i19 | 0)) {
+ i13 = 224;
+ break;
+ }
+ i18 = HEAP32[i16 + 8 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ break;
+ } else {
+ i16 = i18;
+ }
+ }
+ if ((i13 | 0) == 224 ? (HEAP32[i16 + 12 >> 2] & 8 | 0) == 0 : 0) {
+ HEAP32[i16 >> 2] = i17;
+ i6 = i16 + 4 | 0;
+ HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + i14;
+ i6 = i17 + 8 | 0;
+ if ((i6 & 7 | 0) == 0) {
+ i6 = 0;
+ } else {
+ i6 = 0 - i6 & 7;
+ }
+ i7 = i17 + (i14 + 8) | 0;
+ if ((i7 & 7 | 0) == 0) {
+ i13 = 0;
+ } else {
+ i13 = 0 - i7 & 7;
+ }
+ i15 = i17 + (i13 + i14) | 0;
+ i8 = i6 + i12 | 0;
+ i7 = i17 + i8 | 0;
+ i10 = i15 - (i17 + i6) - i12 | 0;
+ HEAP32[i17 + (i6 + 4) >> 2] = i12 | 3;
+ L348 : do {
+ if ((i15 | 0) != (HEAP32[7184 >> 2] | 0)) {
+ if ((i15 | 0) == (HEAP32[7180 >> 2] | 0)) {
+ i32 = (HEAP32[7168 >> 2] | 0) + i10 | 0;
+ HEAP32[7168 >> 2] = i32;
+ HEAP32[7180 >> 2] = i7;
+ HEAP32[i17 + (i8 + 4) >> 2] = i32 | 1;
+ HEAP32[i17 + (i32 + i8) >> 2] = i32;
+ break;
+ }
+ i12 = i14 + 4 | 0;
+ i18 = HEAP32[i17 + (i12 + i13) >> 2] | 0;
+ if ((i18 & 3 | 0) == 1) {
+ i11 = i18 & -8;
+ i16 = i18 >>> 3;
+ do {
+ if (!(i18 >>> 0 < 256)) {
+ i9 = HEAP32[i17 + ((i13 | 24) + i14) >> 2] | 0;
+ i19 = HEAP32[i17 + (i14 + 12 + i13) >> 2] | 0;
+ do {
+ if ((i19 | 0) == (i15 | 0)) {
+ i19 = i13 | 16;
+ i18 = i17 + (i12 + i19) | 0;
+ i16 = HEAP32[i18 >> 2] | 0;
+ if ((i16 | 0) == 0) {
+ i18 = i17 + (i19 + i14) | 0;
+ i16 = HEAP32[i18 >> 2] | 0;
+ if ((i16 | 0) == 0) {
+ i5 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i20 = i16 + 20 | 0;
+ i19 = HEAP32[i20 >> 2] | 0;
+ if ((i19 | 0) != 0) {
+ i16 = i19;
+ i18 = i20;
+ continue;
+ }
+ i19 = i16 + 16 | 0;
+ i20 = HEAP32[i19 >> 2] | 0;
+ if ((i20 | 0) == 0) {
+ break;
+ } else {
+ i16 = i20;
+ i18 = i19;
+ }
+ }
+ if (i18 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i18 >> 2] = 0;
+ i5 = i16;
+ break;
+ }
+ } else {
+ i18 = HEAP32[i17 + ((i13 | 8) + i14) >> 2] | 0;
+ if (i18 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i18 + 12 | 0;
+ if ((HEAP32[i16 >> 2] | 0) != (i15 | 0)) {
+ _abort();
+ }
+ i20 = i19 + 8 | 0;
+ if ((HEAP32[i20 >> 2] | 0) == (i15 | 0)) {
+ HEAP32[i16 >> 2] = i19;
+ HEAP32[i20 >> 2] = i18;
+ i5 = i19;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ if ((i9 | 0) != 0) {
+ i16 = HEAP32[i17 + (i14 + 28 + i13) >> 2] | 0;
+ i18 = 7464 + (i16 << 2) | 0;
+ if ((i15 | 0) == (HEAP32[i18 >> 2] | 0)) {
+ HEAP32[i18 >> 2] = i5;
+ if ((i5 | 0) == 0) {
+ HEAP32[7164 >> 2] = HEAP32[7164 >> 2] & ~(1 << i16);
+ break;
+ }
+ } else {
+ if (i9 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i9 + 16 | 0;
+ if ((HEAP32[i16 >> 2] | 0) == (i15 | 0)) {
+ HEAP32[i16 >> 2] = i5;
+ } else {
+ HEAP32[i9 + 20 >> 2] = i5;
+ }
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ }
+ if (i5 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i5 + 24 >> 2] = i9;
+ i15 = i13 | 16;
+ i9 = HEAP32[i17 + (i15 + i14) >> 2] | 0;
+ do {
+ if ((i9 | 0) != 0) {
+ if (i9 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i5 + 16 >> 2] = i9;
+ HEAP32[i9 + 24 >> 2] = i5;
+ break;
+ }
+ }
+ } while (0);
+ i9 = HEAP32[i17 + (i12 + i15) >> 2] | 0;
+ if ((i9 | 0) != 0) {
+ if (i9 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i5 + 20 >> 2] = i9;
+ HEAP32[i9 + 24 >> 2] = i5;
+ break;
+ }
+ }
+ }
+ } else {
+ i5 = HEAP32[i17 + ((i13 | 8) + i14) >> 2] | 0;
+ i12 = HEAP32[i17 + (i14 + 12 + i13) >> 2] | 0;
+ i18 = 7200 + (i16 << 1 << 2) | 0;
+ if ((i5 | 0) != (i18 | 0)) {
+ if (i5 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ if ((HEAP32[i5 + 12 >> 2] | 0) != (i15 | 0)) {
+ _abort();
+ }
+ }
+ if ((i12 | 0) == (i5 | 0)) {
+ HEAP32[1790] = HEAP32[1790] & ~(1 << i16);
+ break;
+ }
+ if ((i12 | 0) != (i18 | 0)) {
+ if (i12 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i12 + 8 | 0;
+ if ((HEAP32[i16 >> 2] | 0) == (i15 | 0)) {
+ i9 = i16;
+ } else {
+ _abort();
+ }
+ } else {
+ i9 = i12 + 8 | 0;
+ }
+ HEAP32[i5 + 12 >> 2] = i12;
+ HEAP32[i9 >> 2] = i5;
+ }
+ } while (0);
+ i15 = i17 + ((i11 | i13) + i14) | 0;
+ i10 = i11 + i10 | 0;
+ }
+ i5 = i15 + 4 | 0;
+ HEAP32[i5 >> 2] = HEAP32[i5 >> 2] & -2;
+ HEAP32[i17 + (i8 + 4) >> 2] = i10 | 1;
+ HEAP32[i17 + (i10 + i8) >> 2] = i10;
+ i5 = i10 >>> 3;
+ if (i10 >>> 0 < 256) {
+ i10 = i5 << 1;
+ i2 = 7200 + (i10 << 2) | 0;
+ i9 = HEAP32[1790] | 0;
+ i5 = 1 << i5;
+ if ((i9 & i5 | 0) != 0) {
+ i9 = 7200 + (i10 + 2 << 2) | 0;
+ i5 = HEAP32[i9 >> 2] | 0;
+ if (i5 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i3 = i9;
+ i4 = i5;
+ }
+ } else {
+ HEAP32[1790] = i9 | i5;
+ i3 = 7200 + (i10 + 2 << 2) | 0;
+ i4 = i2;
+ }
+ HEAP32[i3 >> 2] = i7;
+ HEAP32[i4 + 12 >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i4;
+ HEAP32[i17 + (i8 + 12) >> 2] = i2;
+ break;
+ }
+ i3 = i10 >>> 8;
+ if ((i3 | 0) != 0) {
+ if (i10 >>> 0 > 16777215) {
+ i3 = 31;
+ } else {
+ i31 = (i3 + 1048320 | 0) >>> 16 & 8;
+ i32 = i3 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i3 = (i32 + 245760 | 0) >>> 16 & 2;
+ i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
+ i3 = i10 >>> (i3 + 7 | 0) & 1 | i3 << 1;
+ }
+ } else {
+ i3 = 0;
+ }
+ i4 = 7464 + (i3 << 2) | 0;
+ HEAP32[i17 + (i8 + 28) >> 2] = i3;
+ HEAP32[i17 + (i8 + 20) >> 2] = 0;
+ HEAP32[i17 + (i8 + 16) >> 2] = 0;
+ i9 = HEAP32[7164 >> 2] | 0;
+ i5 = 1 << i3;
+ if ((i9 & i5 | 0) == 0) {
+ HEAP32[7164 >> 2] = i9 | i5;
+ HEAP32[i4 >> 2] = i7;
+ HEAP32[i17 + (i8 + 24) >> 2] = i4;
+ HEAP32[i17 + (i8 + 12) >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i7;
+ break;
+ }
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((i3 | 0) == 31) {
+ i3 = 0;
+ } else {
+ i3 = 25 - (i3 >>> 1) | 0;
+ }
+ L444 : do {
+ if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i10 | 0)) {
+ i3 = i10 << i3;
+ while (1) {
+ i5 = i4 + (i3 >>> 31 << 2) + 16 | 0;
+ i9 = HEAP32[i5 >> 2] | 0;
+ if ((i9 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i9 + 4 >> 2] & -8 | 0) == (i10 | 0)) {
+ i2 = i9;
+ break L444;
+ } else {
+ i3 = i3 << 1;
+ i4 = i9;
+ }
+ }
+ if (i5 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i5 >> 2] = i7;
+ HEAP32[i17 + (i8 + 24) >> 2] = i4;
+ HEAP32[i17 + (i8 + 12) >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i7;
+ break L348;
+ }
+ } else {
+ i2 = i4;
+ }
+ } while (0);
+ i4 = i2 + 8 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ i5 = HEAP32[7176 >> 2] | 0;
+ if (i2 >>> 0 < i5 >>> 0) {
+ _abort();
+ }
+ if (i3 >>> 0 < i5 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i3 + 12 >> 2] = i7;
+ HEAP32[i4 >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i3;
+ HEAP32[i17 + (i8 + 12) >> 2] = i2;
+ HEAP32[i17 + (i8 + 24) >> 2] = 0;
+ break;
+ }
+ } else {
+ i32 = (HEAP32[7172 >> 2] | 0) + i10 | 0;
+ HEAP32[7172 >> 2] = i32;
+ HEAP32[7184 >> 2] = i7;
+ HEAP32[i17 + (i8 + 4) >> 2] = i32 | 1;
+ }
+ } while (0);
+ i32 = i17 + (i6 | 8) | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i3 = 7608 | 0;
+ while (1) {
+ i2 = HEAP32[i3 >> 2] | 0;
+ if (!(i2 >>> 0 > i15 >>> 0) ? (i11 = HEAP32[i3 + 4 >> 2] | 0, i10 = i2 + i11 | 0, i10 >>> 0 > i15 >>> 0) : 0) {
+ break;
+ }
+ i3 = HEAP32[i3 + 8 >> 2] | 0;
+ }
+ i3 = i2 + (i11 + -39) | 0;
+ if ((i3 & 7 | 0) == 0) {
+ i3 = 0;
+ } else {
+ i3 = 0 - i3 & 7;
+ }
+ i2 = i2 + (i11 + -47 + i3) | 0;
+ i2 = i2 >>> 0 < (i15 + 16 | 0) >>> 0 ? i15 : i2;
+ i3 = i2 + 8 | 0;
+ i4 = i17 + 8 | 0;
+ if ((i4 & 7 | 0) == 0) {
+ i4 = 0;
+ } else {
+ i4 = 0 - i4 & 7;
+ }
+ i32 = i14 + -40 - i4 | 0;
+ HEAP32[7184 >> 2] = i17 + i4;
+ HEAP32[7172 >> 2] = i32;
+ HEAP32[i17 + (i4 + 4) >> 2] = i32 | 1;
+ HEAP32[i17 + (i14 + -36) >> 2] = 40;
+ HEAP32[7188 >> 2] = HEAP32[7648 >> 2];
+ HEAP32[i2 + 4 >> 2] = 27;
+ HEAP32[i3 + 0 >> 2] = HEAP32[7608 >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[7612 >> 2];
+ HEAP32[i3 + 8 >> 2] = HEAP32[7616 >> 2];
+ HEAP32[i3 + 12 >> 2] = HEAP32[7620 >> 2];
+ HEAP32[7608 >> 2] = i17;
+ HEAP32[7612 >> 2] = i14;
+ HEAP32[7620 >> 2] = 0;
+ HEAP32[7616 >> 2] = i3;
+ i4 = i2 + 28 | 0;
+ HEAP32[i4 >> 2] = 7;
+ if ((i2 + 32 | 0) >>> 0 < i10 >>> 0) {
+ while (1) {
+ i3 = i4 + 4 | 0;
+ HEAP32[i3 >> 2] = 7;
+ if ((i4 + 8 | 0) >>> 0 < i10 >>> 0) {
+ i4 = i3;
+ } else {
+ break;
+ }
+ }
+ }
+ if ((i2 | 0) != (i15 | 0)) {
+ i2 = i2 - i15 | 0;
+ i3 = i15 + (i2 + 4) | 0;
+ HEAP32[i3 >> 2] = HEAP32[i3 >> 2] & -2;
+ HEAP32[i15 + 4 >> 2] = i2 | 1;
+ HEAP32[i15 + i2 >> 2] = i2;
+ i3 = i2 >>> 3;
+ if (i2 >>> 0 < 256) {
+ i4 = i3 << 1;
+ i2 = 7200 + (i4 << 2) | 0;
+ i5 = HEAP32[1790] | 0;
+ i3 = 1 << i3;
+ if ((i5 & i3 | 0) != 0) {
+ i4 = 7200 + (i4 + 2 << 2) | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ if (i3 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i7 = i4;
+ i8 = i3;
+ }
+ } else {
+ HEAP32[1790] = i5 | i3;
+ i7 = 7200 + (i4 + 2 << 2) | 0;
+ i8 = i2;
+ }
+ HEAP32[i7 >> 2] = i15;
+ HEAP32[i8 + 12 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i8;
+ HEAP32[i15 + 12 >> 2] = i2;
+ break;
+ }
+ i3 = i2 >>> 8;
+ if ((i3 | 0) != 0) {
+ if (i2 >>> 0 > 16777215) {
+ i3 = 31;
+ } else {
+ i31 = (i3 + 1048320 | 0) >>> 16 & 8;
+ i32 = i3 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i3 = (i32 + 245760 | 0) >>> 16 & 2;
+ i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
+ i3 = i2 >>> (i3 + 7 | 0) & 1 | i3 << 1;
+ }
+ } else {
+ i3 = 0;
+ }
+ i7 = 7464 + (i3 << 2) | 0;
+ HEAP32[i15 + 28 >> 2] = i3;
+ HEAP32[i15 + 20 >> 2] = 0;
+ HEAP32[i15 + 16 >> 2] = 0;
+ i4 = HEAP32[7164 >> 2] | 0;
+ i5 = 1 << i3;
+ if ((i4 & i5 | 0) == 0) {
+ HEAP32[7164 >> 2] = i4 | i5;
+ HEAP32[i7 >> 2] = i15;
+ HEAP32[i15 + 24 >> 2] = i7;
+ HEAP32[i15 + 12 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i15;
+ break;
+ }
+ i4 = HEAP32[i7 >> 2] | 0;
+ if ((i3 | 0) == 31) {
+ i3 = 0;
+ } else {
+ i3 = 25 - (i3 >>> 1) | 0;
+ }
+ L499 : do {
+ if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i2 | 0)) {
+ i3 = i2 << i3;
+ while (1) {
+ i7 = i4 + (i3 >>> 31 << 2) + 16 | 0;
+ i5 = HEAP32[i7 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) == (i2 | 0)) {
+ i6 = i5;
+ break L499;
+ } else {
+ i3 = i3 << 1;
+ i4 = i5;
+ }
+ }
+ if (i7 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i7 >> 2] = i15;
+ HEAP32[i15 + 24 >> 2] = i4;
+ HEAP32[i15 + 12 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i15;
+ break L311;
+ }
+ } else {
+ i6 = i4;
+ }
+ } while (0);
+ i4 = i6 + 8 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ i2 = HEAP32[7176 >> 2] | 0;
+ if (i6 >>> 0 < i2 >>> 0) {
+ _abort();
+ }
+ if (i3 >>> 0 < i2 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i3 + 12 >> 2] = i15;
+ HEAP32[i4 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i3;
+ HEAP32[i15 + 12 >> 2] = i6;
+ HEAP32[i15 + 24 >> 2] = 0;
+ break;
+ }
+ }
+ } else {
+ i32 = HEAP32[7176 >> 2] | 0;
+ if ((i32 | 0) == 0 | i17 >>> 0 < i32 >>> 0) {
+ HEAP32[7176 >> 2] = i17;
+ }
+ HEAP32[7608 >> 2] = i17;
+ HEAP32[7612 >> 2] = i14;
+ HEAP32[7620 >> 2] = 0;
+ HEAP32[7196 >> 2] = HEAP32[1908];
+ HEAP32[7192 >> 2] = -1;
+ i2 = 0;
+ do {
+ i32 = i2 << 1;
+ i31 = 7200 + (i32 << 2) | 0;
+ HEAP32[7200 + (i32 + 3 << 2) >> 2] = i31;
+ HEAP32[7200 + (i32 + 2 << 2) >> 2] = i31;
+ i2 = i2 + 1 | 0;
+ } while ((i2 | 0) != 32);
+ i2 = i17 + 8 | 0;
+ if ((i2 & 7 | 0) == 0) {
+ i2 = 0;
+ } else {
+ i2 = 0 - i2 & 7;
+ }
+ i32 = i14 + -40 - i2 | 0;
+ HEAP32[7184 >> 2] = i17 + i2;
+ HEAP32[7172 >> 2] = i32;
+ HEAP32[i17 + (i2 + 4) >> 2] = i32 | 1;
+ HEAP32[i17 + (i14 + -36) >> 2] = 40;
+ HEAP32[7188 >> 2] = HEAP32[7648 >> 2];
+ }
+ } while (0);
+ i2 = HEAP32[7172 >> 2] | 0;
+ if (i2 >>> 0 > i12 >>> 0) {
+ i31 = i2 - i12 | 0;
+ HEAP32[7172 >> 2] = i31;
+ i32 = HEAP32[7184 >> 2] | 0;
+ HEAP32[7184 >> 2] = i32 + i12;
+ HEAP32[i32 + (i12 + 4) >> 2] = i31 | 1;
+ HEAP32[i32 + 4 >> 2] = i12 | 3;
+ i32 = i32 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ }
+ HEAP32[(___errno_location() | 0) >> 2] = 12;
+ i32 = 0;
+ STACKTOP = i1;
+ return i32 | 0;
+}
+function __ZN12b2EPCollider7CollideEP10b2ManifoldPK11b2EdgeShapeRK11b2TransformPK14b2PolygonShapeS7_(i12, i2, i16, i5, i8, i6) {
+ i12 = i12 | 0;
+ i2 = i2 | 0;
+ i16 = i16 | 0;
+ i5 = i5 | 0;
+ i8 = i8 | 0;
+ i6 = i6 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i7 = 0, i9 = 0, i10 = 0, i11 = 0, i13 = 0, i14 = 0, i15 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, d22 = 0.0, d23 = 0.0, d24 = 0.0, d25 = 0.0, d26 = 0.0, d27 = 0.0, d28 = 0.0, i29 = 0, d30 = 0.0, d31 = 0.0, d32 = 0.0, d33 = 0.0, i34 = 0, i35 = 0, d36 = 0.0, d37 = 0.0, i38 = 0, d39 = 0.0, i40 = 0, i41 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 144 | 0;
+ i18 = i1 + 128 | 0;
+ i11 = i1 + 24 | 0;
+ i9 = i1 + 72 | 0;
+ i10 = i1 + 48 | 0;
+ i3 = i1;
+ i4 = i12 + 132 | 0;
+ d28 = +HEAPF32[i5 + 12 >> 2];
+ d37 = +HEAPF32[i6 + 8 >> 2];
+ d23 = +HEAPF32[i5 + 8 >> 2];
+ d27 = +HEAPF32[i6 + 12 >> 2];
+ d22 = d28 * d37 - d23 * d27;
+ d27 = d37 * d23 + d28 * d27;
+ d37 = +d22;
+ d26 = +d27;
+ d25 = +HEAPF32[i6 >> 2] - +HEAPF32[i5 >> 2];
+ d36 = +HEAPF32[i6 + 4 >> 2] - +HEAPF32[i5 + 4 >> 2];
+ d24 = d28 * d25 + d23 * d36;
+ d25 = d28 * d36 - d23 * d25;
+ d23 = +d24;
+ d36 = +d25;
+ i5 = i4;
+ HEAPF32[i5 >> 2] = d23;
+ HEAPF32[i5 + 4 >> 2] = d36;
+ i5 = i12 + 140 | 0;
+ HEAPF32[i5 >> 2] = d37;
+ HEAPF32[i5 + 4 >> 2] = d26;
+ i5 = i12 + 144 | 0;
+ d26 = +HEAPF32[i8 + 12 >> 2];
+ i7 = i12 + 140 | 0;
+ d37 = +HEAPF32[i8 + 16 >> 2];
+ d24 = d24 + (d27 * d26 - d22 * d37);
+ i6 = i12 + 136 | 0;
+ d25 = d26 * d22 + d27 * d37 + d25;
+ d37 = +d24;
+ d27 = +d25;
+ i34 = i12 + 148 | 0;
+ HEAPF32[i34 >> 2] = d37;
+ HEAPF32[i34 + 4 >> 2] = d27;
+ i34 = i16 + 28 | 0;
+ i29 = HEAP32[i34 >> 2] | 0;
+ i34 = HEAP32[i34 + 4 >> 2] | 0;
+ i14 = i12 + 156 | 0;
+ HEAP32[i14 >> 2] = i29;
+ HEAP32[i14 + 4 >> 2] = i34;
+ i14 = i12 + 164 | 0;
+ i17 = i16 + 12 | 0;
+ i40 = HEAP32[i17 >> 2] | 0;
+ i17 = HEAP32[i17 + 4 >> 2] | 0;
+ i13 = i14;
+ HEAP32[i13 >> 2] = i40;
+ HEAP32[i13 + 4 >> 2] = i17;
+ i13 = i12 + 172 | 0;
+ i20 = i16 + 20 | 0;
+ i41 = HEAP32[i20 >> 2] | 0;
+ i20 = HEAP32[i20 + 4 >> 2] | 0;
+ i38 = i13;
+ HEAP32[i38 >> 2] = i41;
+ HEAP32[i38 + 4 >> 2] = i20;
+ i38 = i16 + 36 | 0;
+ i35 = HEAP32[i38 >> 2] | 0;
+ i38 = HEAP32[i38 + 4 >> 2] | 0;
+ i19 = i12 + 180 | 0;
+ HEAP32[i19 >> 2] = i35;
+ HEAP32[i19 + 4 >> 2] = i38;
+ i19 = (HEAP8[i16 + 44 | 0] | 0) != 0;
+ i21 = (HEAP8[i16 + 45 | 0] | 0) != 0;
+ d27 = (HEAP32[tempDoublePtr >> 2] = i41, +HEAPF32[tempDoublePtr >> 2]);
+ d37 = (HEAP32[tempDoublePtr >> 2] = i40, +HEAPF32[tempDoublePtr >> 2]);
+ d22 = d27 - d37;
+ d26 = (HEAP32[tempDoublePtr >> 2] = i20, +HEAPF32[tempDoublePtr >> 2]);
+ i20 = i12 + 168 | 0;
+ d36 = (HEAP32[tempDoublePtr >> 2] = i17, +HEAPF32[tempDoublePtr >> 2]);
+ d23 = d26 - d36;
+ d28 = +Math_sqrt(+(d22 * d22 + d23 * d23));
+ d33 = (HEAP32[tempDoublePtr >> 2] = i29, +HEAPF32[tempDoublePtr >> 2]);
+ d32 = (HEAP32[tempDoublePtr >> 2] = i34, +HEAPF32[tempDoublePtr >> 2]);
+ d31 = (HEAP32[tempDoublePtr >> 2] = i35, +HEAPF32[tempDoublePtr >> 2]);
+ d30 = (HEAP32[tempDoublePtr >> 2] = i38, +HEAPF32[tempDoublePtr >> 2]);
+ if (!(d28 < 1.1920928955078125e-7)) {
+ d39 = 1.0 / d28;
+ d22 = d22 * d39;
+ d23 = d23 * d39;
+ }
+ i16 = i12 + 196 | 0;
+ d28 = -d22;
+ HEAPF32[i16 >> 2] = d23;
+ i17 = i12 + 200 | 0;
+ HEAPF32[i17 >> 2] = d28;
+ d28 = (d24 - d37) * d23 + (d25 - d36) * d28;
+ if (i19) {
+ d37 = d37 - d33;
+ d36 = d36 - d32;
+ d39 = +Math_sqrt(+(d37 * d37 + d36 * d36));
+ if (!(d39 < 1.1920928955078125e-7)) {
+ d39 = 1.0 / d39;
+ d37 = d37 * d39;
+ d36 = d36 * d39;
+ }
+ d39 = -d37;
+ HEAPF32[i12 + 188 >> 2] = d36;
+ HEAPF32[i12 + 192 >> 2] = d39;
+ i29 = d23 * d37 - d22 * d36 >= 0.0;
+ d32 = (d24 - d33) * d36 + (d25 - d32) * d39;
+ } else {
+ i29 = 0;
+ d32 = 0.0;
+ }
+ L10 : do {
+ if (!i21) {
+ if (!i19) {
+ i41 = d28 >= 0.0;
+ HEAP8[i12 + 248 | 0] = i41 & 1;
+ i19 = i12 + 212 | 0;
+ if (i41) {
+ i15 = 64;
+ break;
+ } else {
+ i15 = 65;
+ break;
+ }
+ }
+ i19 = d32 >= 0.0;
+ if (i29) {
+ if (!i19) {
+ i41 = d28 >= 0.0;
+ HEAP8[i12 + 248 | 0] = i41 & 1;
+ i19 = i12 + 212 | 0;
+ if (!i41) {
+ d37 = +-d23;
+ d39 = +d22;
+ i38 = i19;
+ HEAPF32[i38 >> 2] = d37;
+ HEAPF32[i38 + 4 >> 2] = d39;
+ i38 = i16;
+ i40 = HEAP32[i38 >> 2] | 0;
+ i38 = HEAP32[i38 + 4 >> 2] | 0;
+ i41 = i12 + 228 | 0;
+ HEAP32[i41 >> 2] = i40;
+ HEAP32[i41 + 4 >> 2] = i38;
+ i41 = i12 + 236 | 0;
+ HEAPF32[i41 >> 2] = -(HEAP32[tempDoublePtr >> 2] = i40, +HEAPF32[tempDoublePtr >> 2]);
+ HEAPF32[i41 + 4 >> 2] = d39;
+ break;
+ }
+ } else {
+ HEAP8[i12 + 248 | 0] = 1;
+ i19 = i12 + 212 | 0;
+ }
+ i41 = i16;
+ i40 = HEAP32[i41 + 4 >> 2] | 0;
+ i38 = i19;
+ HEAP32[i38 >> 2] = HEAP32[i41 >> 2];
+ HEAP32[i38 + 4 >> 2] = i40;
+ i38 = i12 + 188 | 0;
+ i40 = HEAP32[i38 + 4 >> 2] | 0;
+ i41 = i12 + 228 | 0;
+ HEAP32[i41 >> 2] = HEAP32[i38 >> 2];
+ HEAP32[i41 + 4 >> 2] = i40;
+ d37 = +-+HEAPF32[i16 >> 2];
+ d39 = +-+HEAPF32[i17 >> 2];
+ i41 = i12 + 236 | 0;
+ HEAPF32[i41 >> 2] = d37;
+ HEAPF32[i41 + 4 >> 2] = d39;
+ break;
+ } else {
+ if (i19) {
+ i41 = d28 >= 0.0;
+ HEAP8[i12 + 248 | 0] = i41 & 1;
+ i19 = i12 + 212 | 0;
+ if (i41) {
+ i38 = i16;
+ i41 = HEAP32[i38 >> 2] | 0;
+ i38 = HEAP32[i38 + 4 >> 2] | 0;
+ i40 = i19;
+ HEAP32[i40 >> 2] = i41;
+ HEAP32[i40 + 4 >> 2] = i38;
+ i40 = i12 + 228 | 0;
+ HEAP32[i40 >> 2] = i41;
+ HEAP32[i40 + 4 >> 2] = i38;
+ d37 = +-(HEAP32[tempDoublePtr >> 2] = i41, +HEAPF32[tempDoublePtr >> 2]);
+ d39 = +d22;
+ i41 = i12 + 236 | 0;
+ HEAPF32[i41 >> 2] = d37;
+ HEAPF32[i41 + 4 >> 2] = d39;
+ break;
+ }
+ } else {
+ HEAP8[i12 + 248 | 0] = 0;
+ i19 = i12 + 212 | 0;
+ }
+ d39 = +-d23;
+ d37 = +d22;
+ i38 = i19;
+ HEAPF32[i38 >> 2] = d39;
+ HEAPF32[i38 + 4 >> 2] = d37;
+ i38 = i16;
+ i40 = HEAP32[i38 + 4 >> 2] | 0;
+ i41 = i12 + 228 | 0;
+ HEAP32[i41 >> 2] = HEAP32[i38 >> 2];
+ HEAP32[i41 + 4 >> 2] = i40;
+ d37 = +-+HEAPF32[i12 + 188 >> 2];
+ d39 = +-+HEAPF32[i12 + 192 >> 2];
+ i41 = i12 + 236 | 0;
+ HEAPF32[i41 >> 2] = d37;
+ HEAPF32[i41 + 4 >> 2] = d39;
+ break;
+ }
+ } else {
+ d33 = d31 - d27;
+ d31 = d30 - d26;
+ d30 = +Math_sqrt(+(d33 * d33 + d31 * d31));
+ if (d30 < 1.1920928955078125e-7) {
+ d30 = d33;
+ } else {
+ d39 = 1.0 / d30;
+ d30 = d33 * d39;
+ d31 = d31 * d39;
+ }
+ d39 = -d30;
+ i34 = i12 + 204 | 0;
+ HEAPF32[i34 >> 2] = d31;
+ i35 = i12 + 208 | 0;
+ HEAPF32[i35 >> 2] = d39;
+ i38 = d22 * d31 - d23 * d30 > 0.0;
+ d24 = (d24 - d27) * d31 + (d25 - d26) * d39;
+ if (!i19) {
+ i19 = d28 >= 0.0;
+ if (!i21) {
+ HEAP8[i12 + 248 | 0] = i19 & 1;
+ i15 = i12 + 212 | 0;
+ if (i19) {
+ i19 = i15;
+ i15 = 64;
+ break;
+ } else {
+ i19 = i15;
+ i15 = 65;
+ break;
+ }
+ }
+ if (i38) {
+ if (!i19) {
+ i41 = d24 >= 0.0;
+ HEAP8[i12 + 248 | 0] = i41 & 1;
+ i19 = i12 + 212 | 0;
+ if (!i41) {
+ d37 = +-d23;
+ d39 = +d22;
+ i38 = i19;
+ HEAPF32[i38 >> 2] = d37;
+ HEAPF32[i38 + 4 >> 2] = d39;
+ i38 = i12 + 228 | 0;
+ HEAPF32[i38 >> 2] = d37;
+ HEAPF32[i38 + 4 >> 2] = d39;
+ i38 = i16;
+ i40 = HEAP32[i38 + 4 >> 2] | 0;
+ i41 = i12 + 236 | 0;
+ HEAP32[i41 >> 2] = HEAP32[i38 >> 2];
+ HEAP32[i41 + 4 >> 2] = i40;
+ break;
+ }
+ } else {
+ HEAP8[i12 + 248 | 0] = 1;
+ i19 = i12 + 212 | 0;
+ }
+ i41 = i16;
+ i40 = HEAP32[i41 + 4 >> 2] | 0;
+ i38 = i19;
+ HEAP32[i38 >> 2] = HEAP32[i41 >> 2];
+ HEAP32[i38 + 4 >> 2] = i40;
+ d37 = +-+HEAPF32[i16 >> 2];
+ d39 = +-+HEAPF32[i17 >> 2];
+ i38 = i12 + 228 | 0;
+ HEAPF32[i38 >> 2] = d37;
+ HEAPF32[i38 + 4 >> 2] = d39;
+ i38 = i12 + 204 | 0;
+ i40 = HEAP32[i38 + 4 >> 2] | 0;
+ i41 = i12 + 236 | 0;
+ HEAP32[i41 >> 2] = HEAP32[i38 >> 2];
+ HEAP32[i41 + 4 >> 2] = i40;
+ break;
+ } else {
+ if (i19) {
+ i41 = d24 >= 0.0;
+ HEAP8[i12 + 248 | 0] = i41 & 1;
+ i19 = i12 + 212 | 0;
+ if (i41) {
+ i40 = i16;
+ i38 = HEAP32[i40 >> 2] | 0;
+ i40 = HEAP32[i40 + 4 >> 2] | 0;
+ i41 = i19;
+ HEAP32[i41 >> 2] = i38;
+ HEAP32[i41 + 4 >> 2] = i40;
+ d37 = +-(HEAP32[tempDoublePtr >> 2] = i38, +HEAPF32[tempDoublePtr >> 2]);
+ d39 = +d22;
+ i41 = i12 + 228 | 0;
+ HEAPF32[i41 >> 2] = d37;
+ HEAPF32[i41 + 4 >> 2] = d39;
+ i41 = i12 + 236 | 0;
+ HEAP32[i41 >> 2] = i38;
+ HEAP32[i41 + 4 >> 2] = i40;
+ break;
+ }
+ } else {
+ HEAP8[i12 + 248 | 0] = 0;
+ i19 = i12 + 212 | 0;
+ }
+ d39 = +-d23;
+ d37 = +d22;
+ i38 = i19;
+ HEAPF32[i38 >> 2] = d39;
+ HEAPF32[i38 + 4 >> 2] = d37;
+ d37 = +-+HEAPF32[i12 + 204 >> 2];
+ d39 = +-+HEAPF32[i12 + 208 >> 2];
+ i38 = i12 + 228 | 0;
+ HEAPF32[i38 >> 2] = d37;
+ HEAPF32[i38 + 4 >> 2] = d39;
+ i38 = i16;
+ i40 = HEAP32[i38 + 4 >> 2] | 0;
+ i41 = i12 + 236 | 0;
+ HEAP32[i41 >> 2] = HEAP32[i38 >> 2];
+ HEAP32[i41 + 4 >> 2] = i40;
+ break;
+ }
+ }
+ if (i29 & i38) {
+ if (!(d32 >= 0.0) & !(d28 >= 0.0)) {
+ i41 = d24 >= 0.0;
+ HEAP8[i12 + 248 | 0] = i41 & 1;
+ i19 = i12 + 212 | 0;
+ if (!i41) {
+ d37 = +-d23;
+ d39 = +d22;
+ i41 = i19;
+ HEAPF32[i41 >> 2] = d37;
+ HEAPF32[i41 + 4 >> 2] = d39;
+ i41 = i12 + 228 | 0;
+ HEAPF32[i41 >> 2] = d37;
+ HEAPF32[i41 + 4 >> 2] = d39;
+ i41 = i12 + 236 | 0;
+ HEAPF32[i41 >> 2] = d37;
+ HEAPF32[i41 + 4 >> 2] = d39;
+ break;
+ }
+ } else {
+ HEAP8[i12 + 248 | 0] = 1;
+ i19 = i12 + 212 | 0;
+ }
+ i38 = i16;
+ i40 = HEAP32[i38 + 4 >> 2] | 0;
+ i41 = i19;
+ HEAP32[i41 >> 2] = HEAP32[i38 >> 2];
+ HEAP32[i41 + 4 >> 2] = i40;
+ i41 = i12 + 188 | 0;
+ i40 = HEAP32[i41 + 4 >> 2] | 0;
+ i38 = i12 + 228 | 0;
+ HEAP32[i38 >> 2] = HEAP32[i41 >> 2];
+ HEAP32[i38 + 4 >> 2] = i40;
+ i38 = i12 + 204 | 0;
+ i40 = HEAP32[i38 + 4 >> 2] | 0;
+ i41 = i12 + 236 | 0;
+ HEAP32[i41 >> 2] = HEAP32[i38 >> 2];
+ HEAP32[i41 + 4 >> 2] = i40;
+ break;
+ }
+ if (i29) {
+ do {
+ if (!(d32 >= 0.0)) {
+ if (d28 >= 0.0) {
+ i41 = d24 >= 0.0;
+ HEAP8[i12 + 248 | 0] = i41 & 1;
+ i19 = i12 + 212 | 0;
+ if (i41) {
+ break;
+ }
+ } else {
+ HEAP8[i12 + 248 | 0] = 0;
+ i19 = i12 + 212 | 0;
+ }
+ d37 = +-d23;
+ d39 = +d22;
+ i41 = i19;
+ HEAPF32[i41 >> 2] = d37;
+ HEAPF32[i41 + 4 >> 2] = d39;
+ d39 = +-+HEAPF32[i34 >> 2];
+ d37 = +-+HEAPF32[i35 >> 2];
+ i41 = i12 + 228 | 0;
+ HEAPF32[i41 >> 2] = d39;
+ HEAPF32[i41 + 4 >> 2] = d37;
+ d37 = +-+HEAPF32[i16 >> 2];
+ d39 = +-+HEAPF32[i17 >> 2];
+ i41 = i12 + 236 | 0;
+ HEAPF32[i41 >> 2] = d37;
+ HEAPF32[i41 + 4 >> 2] = d39;
+ break L10;
+ } else {
+ HEAP8[i12 + 248 | 0] = 1;
+ i19 = i12 + 212 | 0;
+ }
+ } while (0);
+ i38 = i16;
+ i40 = HEAP32[i38 + 4 >> 2] | 0;
+ i41 = i19;
+ HEAP32[i41 >> 2] = HEAP32[i38 >> 2];
+ HEAP32[i41 + 4 >> 2] = i40;
+ i41 = i12 + 188 | 0;
+ i40 = HEAP32[i41 + 4 >> 2] | 0;
+ i38 = i12 + 228 | 0;
+ HEAP32[i38 >> 2] = HEAP32[i41 >> 2];
+ HEAP32[i38 + 4 >> 2] = i40;
+ i38 = i16;
+ i40 = HEAP32[i38 + 4 >> 2] | 0;
+ i41 = i12 + 236 | 0;
+ HEAP32[i41 >> 2] = HEAP32[i38 >> 2];
+ HEAP32[i41 + 4 >> 2] = i40;
+ break;
+ }
+ if (!i38) {
+ if (!(!(d32 >= 0.0) | !(d28 >= 0.0))) {
+ i41 = d24 >= 0.0;
+ HEAP8[i12 + 248 | 0] = i41 & 1;
+ i19 = i12 + 212 | 0;
+ if (i41) {
+ i40 = i16;
+ i38 = HEAP32[i40 >> 2] | 0;
+ i40 = HEAP32[i40 + 4 >> 2] | 0;
+ i41 = i19;
+ HEAP32[i41 >> 2] = i38;
+ HEAP32[i41 + 4 >> 2] = i40;
+ i41 = i12 + 228 | 0;
+ HEAP32[i41 >> 2] = i38;
+ HEAP32[i41 + 4 >> 2] = i40;
+ i41 = i12 + 236 | 0;
+ HEAP32[i41 >> 2] = i38;
+ HEAP32[i41 + 4 >> 2] = i40;
+ break;
+ }
+ } else {
+ HEAP8[i12 + 248 | 0] = 0;
+ i19 = i12 + 212 | 0;
+ }
+ d37 = +-d23;
+ d39 = +d22;
+ i41 = i19;
+ HEAPF32[i41 >> 2] = d37;
+ HEAPF32[i41 + 4 >> 2] = d39;
+ d39 = +-+HEAPF32[i34 >> 2];
+ d37 = +-+HEAPF32[i35 >> 2];
+ i41 = i12 + 228 | 0;
+ HEAPF32[i41 >> 2] = d39;
+ HEAPF32[i41 + 4 >> 2] = d37;
+ d37 = +-+HEAPF32[i12 + 188 >> 2];
+ d39 = +-+HEAPF32[i12 + 192 >> 2];
+ i41 = i12 + 236 | 0;
+ HEAPF32[i41 >> 2] = d37;
+ HEAPF32[i41 + 4 >> 2] = d39;
+ break;
+ }
+ do {
+ if (!(d24 >= 0.0)) {
+ if (d32 >= 0.0) {
+ i41 = d28 >= 0.0;
+ HEAP8[i12 + 248 | 0] = i41 & 1;
+ i19 = i12 + 212 | 0;
+ if (i41) {
+ break;
+ }
+ } else {
+ HEAP8[i12 + 248 | 0] = 0;
+ i19 = i12 + 212 | 0;
+ }
+ d37 = +-d23;
+ d39 = +d22;
+ i41 = i19;
+ HEAPF32[i41 >> 2] = d37;
+ HEAPF32[i41 + 4 >> 2] = d39;
+ d39 = +-+HEAPF32[i16 >> 2];
+ d37 = +-+HEAPF32[i17 >> 2];
+ i41 = i12 + 228 | 0;
+ HEAPF32[i41 >> 2] = d39;
+ HEAPF32[i41 + 4 >> 2] = d37;
+ d37 = +-+HEAPF32[i12 + 188 >> 2];
+ d39 = +-+HEAPF32[i12 + 192 >> 2];
+ i41 = i12 + 236 | 0;
+ HEAPF32[i41 >> 2] = d37;
+ HEAPF32[i41 + 4 >> 2] = d39;
+ break L10;
+ } else {
+ HEAP8[i12 + 248 | 0] = 1;
+ i19 = i12 + 212 | 0;
+ }
+ } while (0);
+ i38 = i16;
+ i40 = HEAP32[i38 + 4 >> 2] | 0;
+ i41 = i19;
+ HEAP32[i41 >> 2] = HEAP32[i38 >> 2];
+ HEAP32[i41 + 4 >> 2] = i40;
+ i41 = i16;
+ i40 = HEAP32[i41 + 4 >> 2] | 0;
+ i38 = i12 + 228 | 0;
+ HEAP32[i38 >> 2] = HEAP32[i41 >> 2];
+ HEAP32[i38 + 4 >> 2] = i40;
+ i38 = i12 + 204 | 0;
+ i40 = HEAP32[i38 + 4 >> 2] | 0;
+ i41 = i12 + 236 | 0;
+ HEAP32[i41 >> 2] = HEAP32[i38 >> 2];
+ HEAP32[i41 + 4 >> 2] = i40;
+ }
+ } while (0);
+ if ((i15 | 0) == 64) {
+ i38 = i16;
+ i41 = HEAP32[i38 >> 2] | 0;
+ i38 = HEAP32[i38 + 4 >> 2] | 0;
+ i40 = i19;
+ HEAP32[i40 >> 2] = i41;
+ HEAP32[i40 + 4 >> 2] = i38;
+ d37 = +-(HEAP32[tempDoublePtr >> 2] = i41, +HEAPF32[tempDoublePtr >> 2]);
+ d39 = +d22;
+ i41 = i12 + 228 | 0;
+ HEAPF32[i41 >> 2] = d37;
+ HEAPF32[i41 + 4 >> 2] = d39;
+ i41 = i12 + 236 | 0;
+ HEAPF32[i41 >> 2] = d37;
+ HEAPF32[i41 + 4 >> 2] = d39;
+ } else if ((i15 | 0) == 65) {
+ d37 = +-d23;
+ d39 = +d22;
+ i40 = i19;
+ HEAPF32[i40 >> 2] = d37;
+ HEAPF32[i40 + 4 >> 2] = d39;
+ i40 = i16;
+ i38 = HEAP32[i40 >> 2] | 0;
+ i40 = HEAP32[i40 + 4 >> 2] | 0;
+ i41 = i12 + 228 | 0;
+ HEAP32[i41 >> 2] = i38;
+ HEAP32[i41 + 4 >> 2] = i40;
+ i41 = i12 + 236 | 0;
+ HEAP32[i41 >> 2] = i38;
+ HEAP32[i41 + 4 >> 2] = i40;
+ }
+ i21 = i8 + 148 | 0;
+ i34 = i12 + 128 | 0;
+ HEAP32[i34 >> 2] = HEAP32[i21 >> 2];
+ if ((HEAP32[i21 >> 2] | 0) > 0) {
+ i19 = 0;
+ do {
+ d33 = +HEAPF32[i5 >> 2];
+ d37 = +HEAPF32[i8 + (i19 << 3) + 20 >> 2];
+ d39 = +HEAPF32[i7 >> 2];
+ d36 = +HEAPF32[i8 + (i19 << 3) + 24 >> 2];
+ d32 = +(+HEAPF32[i4 >> 2] + (d33 * d37 - d39 * d36));
+ d36 = +(d37 * d39 + d33 * d36 + +HEAPF32[i6 >> 2]);
+ i41 = i12 + (i19 << 3) | 0;
+ HEAPF32[i41 >> 2] = d32;
+ HEAPF32[i41 + 4 >> 2] = d36;
+ d36 = +HEAPF32[i5 >> 2];
+ d32 = +HEAPF32[i8 + (i19 << 3) + 84 >> 2];
+ d33 = +HEAPF32[i7 >> 2];
+ d39 = +HEAPF32[i8 + (i19 << 3) + 88 >> 2];
+ d37 = +(d36 * d32 - d33 * d39);
+ d39 = +(d32 * d33 + d36 * d39);
+ i41 = i12 + (i19 << 3) + 64 | 0;
+ HEAPF32[i41 >> 2] = d37;
+ HEAPF32[i41 + 4 >> 2] = d39;
+ i19 = i19 + 1 | 0;
+ } while ((i19 | 0) < (HEAP32[i21 >> 2] | 0));
+ }
+ i21 = i12 + 244 | 0;
+ HEAPF32[i21 >> 2] = .019999999552965164;
+ i19 = i2 + 60 | 0;
+ HEAP32[i19 >> 2] = 0;
+ i29 = i12 + 248 | 0;
+ i35 = HEAP32[i34 >> 2] | 0;
+ if ((i35 | 0) <= 0) {
+ STACKTOP = i1;
+ return;
+ }
+ d23 = +HEAPF32[i12 + 164 >> 2];
+ d26 = +HEAPF32[i20 >> 2];
+ d24 = +HEAPF32[i12 + 212 >> 2];
+ d27 = +HEAPF32[i12 + 216 >> 2];
+ d22 = 3.4028234663852886e+38;
+ i20 = 0;
+ do {
+ d25 = d24 * (+HEAPF32[i12 + (i20 << 3) >> 2] - d23) + d27 * (+HEAPF32[i12 + (i20 << 3) + 4 >> 2] - d26);
+ d22 = d25 < d22 ? d25 : d22;
+ i20 = i20 + 1 | 0;
+ } while ((i20 | 0) != (i35 | 0));
+ if (d22 > .019999999552965164) {
+ STACKTOP = i1;
+ return;
+ }
+ __ZN12b2EPCollider24ComputePolygonSeparationEv(i18, i12);
+ i20 = HEAP32[i18 >> 2] | 0;
+ if ((i20 | 0) != 0) {
+ d23 = +HEAPF32[i18 + 8 >> 2];
+ if (d23 > +HEAPF32[i21 >> 2]) {
+ STACKTOP = i1;
+ return;
+ }
+ if (d23 > d22 * .9800000190734863 + .0010000000474974513) {
+ i18 = HEAP32[i18 + 4 >> 2] | 0;
+ i35 = i2 + 56 | 0;
+ if ((i20 | 0) == 1) {
+ i18 = i11;
+ i15 = 77;
+ } else {
+ HEAP32[i35 >> 2] = 2;
+ i40 = i14;
+ i41 = HEAP32[i40 + 4 >> 2] | 0;
+ i38 = i11;
+ HEAP32[i38 >> 2] = HEAP32[i40 >> 2];
+ HEAP32[i38 + 4 >> 2] = i41;
+ i38 = i11 + 8 | 0;
+ HEAP8[i38] = 0;
+ i41 = i18 & 255;
+ HEAP8[i38 + 1 | 0] = i41;
+ HEAP8[i38 + 2 | 0] = 0;
+ HEAP8[i38 + 3 | 0] = 1;
+ i38 = i13;
+ i40 = HEAP32[i38 + 4 >> 2] | 0;
+ i13 = i11 + 12 | 0;
+ HEAP32[i13 >> 2] = HEAP32[i38 >> 2];
+ HEAP32[i13 + 4 >> 2] = i40;
+ i13 = i11 + 20 | 0;
+ HEAP8[i13] = 0;
+ HEAP8[i13 + 1 | 0] = i41;
+ HEAP8[i13 + 2 | 0] = 0;
+ HEAP8[i13 + 3 | 0] = 1;
+ HEAP32[i9 >> 2] = i18;
+ i13 = i18 + 1 | 0;
+ i16 = (i13 | 0) < (HEAP32[i34 >> 2] | 0) ? i13 : 0;
+ HEAP32[i9 + 4 >> 2] = i16;
+ i17 = i12 + (i18 << 3) | 0;
+ i13 = HEAP32[i17 >> 2] | 0;
+ i17 = HEAP32[i17 + 4 >> 2] | 0;
+ i29 = i9 + 8 | 0;
+ HEAP32[i29 >> 2] = i13;
+ HEAP32[i29 + 4 >> 2] = i17;
+ i16 = i12 + (i16 << 3) | 0;
+ i29 = HEAP32[i16 >> 2] | 0;
+ i16 = HEAP32[i16 + 4 >> 2] | 0;
+ i20 = i9 + 16 | 0;
+ HEAP32[i20 >> 2] = i29;
+ HEAP32[i20 + 4 >> 2] = i16;
+ i20 = i12 + (i18 << 3) + 64 | 0;
+ i12 = HEAP32[i20 >> 2] | 0;
+ i20 = HEAP32[i20 + 4 >> 2] | 0;
+ i14 = i9 + 24 | 0;
+ HEAP32[i14 >> 2] = i12;
+ HEAP32[i14 + 4 >> 2] = i20;
+ i14 = 0;
+ }
+ } else {
+ i15 = 75;
+ }
+ } else {
+ i15 = 75;
+ }
+ if ((i15 | 0) == 75) {
+ i18 = i11;
+ i35 = i2 + 56 | 0;
+ i15 = 77;
+ }
+ do {
+ if ((i15 | 0) == 77) {
+ HEAP32[i35 >> 2] = 1;
+ i15 = HEAP32[i34 >> 2] | 0;
+ if ((i15 | 0) > 1) {
+ d23 = +HEAPF32[i12 + 216 >> 2];
+ d22 = +HEAPF32[i12 + 212 >> 2];
+ i34 = 0;
+ d24 = d22 * +HEAPF32[i12 + 64 >> 2] + d23 * +HEAPF32[i12 + 68 >> 2];
+ i35 = 1;
+ while (1) {
+ d25 = d22 * +HEAPF32[i12 + (i35 << 3) + 64 >> 2] + d23 * +HEAPF32[i12 + (i35 << 3) + 68 >> 2];
+ i20 = d25 < d24;
+ i34 = i20 ? i35 : i34;
+ i35 = i35 + 1 | 0;
+ if ((i35 | 0) < (i15 | 0)) {
+ d24 = i20 ? d25 : d24;
+ } else {
+ break;
+ }
+ }
+ } else {
+ i34 = 0;
+ }
+ i20 = i34 + 1 | 0;
+ i40 = (i20 | 0) < (i15 | 0) ? i20 : 0;
+ i41 = i12 + (i34 << 3) | 0;
+ i38 = HEAP32[i41 + 4 >> 2] | 0;
+ i35 = i11;
+ HEAP32[i35 >> 2] = HEAP32[i41 >> 2];
+ HEAP32[i35 + 4 >> 2] = i38;
+ i35 = i11 + 8 | 0;
+ HEAP8[i35] = 0;
+ HEAP8[i35 + 1 | 0] = i34;
+ HEAP8[i35 + 2 | 0] = 1;
+ HEAP8[i35 + 3 | 0] = 0;
+ i35 = i12 + (i40 << 3) | 0;
+ i38 = HEAP32[i35 + 4 >> 2] | 0;
+ i41 = i11 + 12 | 0;
+ HEAP32[i41 >> 2] = HEAP32[i35 >> 2];
+ HEAP32[i41 + 4 >> 2] = i38;
+ i41 = i11 + 20 | 0;
+ HEAP8[i41] = 0;
+ HEAP8[i41 + 1 | 0] = i40;
+ HEAP8[i41 + 2 | 0] = 1;
+ HEAP8[i41 + 3 | 0] = 0;
+ if ((HEAP8[i29] | 0) == 0) {
+ HEAP32[i9 >> 2] = 1;
+ HEAP32[i9 + 4 >> 2] = 0;
+ i11 = i13;
+ i13 = HEAP32[i11 >> 2] | 0;
+ i11 = HEAP32[i11 + 4 >> 2] | 0;
+ i29 = i9 + 8 | 0;
+ HEAP32[i29 >> 2] = i13;
+ HEAP32[i29 + 4 >> 2] = i11;
+ i29 = HEAP32[i14 >> 2] | 0;
+ i14 = HEAP32[i14 + 4 >> 2] | 0;
+ i12 = i9 + 16 | 0;
+ HEAP32[i12 >> 2] = i29;
+ HEAP32[i12 + 4 >> 2] = i14;
+ i12 = (HEAPF32[tempDoublePtr >> 2] = -+HEAPF32[i16 >> 2], HEAP32[tempDoublePtr >> 2] | 0);
+ i20 = (HEAPF32[tempDoublePtr >> 2] = -+HEAPF32[i17 >> 2], HEAP32[tempDoublePtr >> 2] | 0);
+ i16 = i9 + 24 | 0;
+ HEAP32[i16 >> 2] = i12;
+ HEAP32[i16 + 4 >> 2] = i20;
+ i16 = i14;
+ i17 = i11;
+ i11 = i18;
+ i18 = 1;
+ i14 = 1;
+ break;
+ } else {
+ HEAP32[i9 >> 2] = 0;
+ HEAP32[i9 + 4 >> 2] = 1;
+ i17 = i14;
+ i11 = HEAP32[i17 >> 2] | 0;
+ i17 = HEAP32[i17 + 4 >> 2] | 0;
+ i29 = i9 + 8 | 0;
+ HEAP32[i29 >> 2] = i11;
+ HEAP32[i29 + 4 >> 2] = i17;
+ i29 = HEAP32[i13 >> 2] | 0;
+ i13 = HEAP32[i13 + 4 >> 2] | 0;
+ i20 = i9 + 16 | 0;
+ HEAP32[i20 >> 2] = i29;
+ HEAP32[i20 + 4 >> 2] = i13;
+ i20 = i16;
+ i12 = HEAP32[i20 >> 2] | 0;
+ i20 = HEAP32[i20 + 4 >> 2] | 0;
+ i16 = i9 + 24 | 0;
+ HEAP32[i16 >> 2] = i12;
+ HEAP32[i16 + 4 >> 2] = i20;
+ i16 = i13;
+ i13 = i11;
+ i11 = i18;
+ i18 = 0;
+ i14 = 1;
+ break;
+ }
+ }
+ } while (0);
+ d30 = (HEAP32[tempDoublePtr >> 2] = i20, +HEAPF32[tempDoublePtr >> 2]);
+ d39 = (HEAP32[tempDoublePtr >> 2] = i12, +HEAPF32[tempDoublePtr >> 2]);
+ d31 = (HEAP32[tempDoublePtr >> 2] = i13, +HEAPF32[tempDoublePtr >> 2]);
+ d32 = (HEAP32[tempDoublePtr >> 2] = i17, +HEAPF32[tempDoublePtr >> 2]);
+ d33 = (HEAP32[tempDoublePtr >> 2] = i29, +HEAPF32[tempDoublePtr >> 2]);
+ d37 = (HEAP32[tempDoublePtr >> 2] = i16, +HEAPF32[tempDoublePtr >> 2]);
+ i41 = i9 + 32 | 0;
+ i16 = i9 + 24 | 0;
+ i13 = i9 + 28 | 0;
+ d39 = -d39;
+ HEAPF32[i41 >> 2] = d30;
+ HEAPF32[i9 + 36 >> 2] = d39;
+ i20 = i9 + 44 | 0;
+ d36 = -d30;
+ i17 = i20;
+ HEAPF32[i17 >> 2] = d36;
+ HEAP32[i17 + 4 >> 2] = i12;
+ i17 = i9 + 8 | 0;
+ i15 = i9 + 12 | 0;
+ d39 = d30 * d31 + d32 * d39;
+ HEAPF32[i9 + 40 >> 2] = d39;
+ i29 = i9 + 52 | 0;
+ HEAPF32[i29 >> 2] = d33 * d36 + (HEAP32[tempDoublePtr >> 2] = i12, +HEAPF32[tempDoublePtr >> 2]) * d37;
+ if ((__Z19b2ClipSegmentToLineP12b2ClipVertexPKS_RK6b2Vec2fi(i10, i11, i41, d39, i18) | 0) < 2) {
+ STACKTOP = i1;
+ return;
+ }
+ if ((__Z19b2ClipSegmentToLineP12b2ClipVertexPKS_RK6b2Vec2fi(i3, i10, i20, +HEAPF32[i29 >> 2], HEAP32[i9 + 4 >> 2] | 0) | 0) < 2) {
+ STACKTOP = i1;
+ return;
+ }
+ i10 = i2 + 40 | 0;
+ if (i14) {
+ i40 = i16;
+ i41 = HEAP32[i40 >> 2] | 0;
+ i40 = HEAP32[i40 + 4 >> 2] | 0;
+ i35 = i10;
+ HEAP32[i35 >> 2] = i41;
+ HEAP32[i35 + 4 >> 2] = i40;
+ i35 = i17;
+ i40 = HEAP32[i35 >> 2] | 0;
+ i35 = HEAP32[i35 + 4 >> 2] | 0;
+ i38 = i2 + 48 | 0;
+ HEAP32[i38 >> 2] = i40;
+ HEAP32[i38 + 4 >> 2] = i35;
+ d23 = (HEAP32[tempDoublePtr >> 2] = i40, +HEAPF32[tempDoublePtr >> 2]);
+ d22 = (HEAP32[tempDoublePtr >> 2] = i41, +HEAPF32[tempDoublePtr >> 2]);
+ d24 = +HEAPF32[i15 >> 2];
+ d25 = +HEAPF32[i13 >> 2];
+ d28 = +HEAPF32[i3 >> 2];
+ d27 = +HEAPF32[i3 + 4 >> 2];
+ d26 = +HEAPF32[i21 >> 2];
+ if (!((d28 - d23) * d22 + (d27 - d24) * d25 <= d26)) {
+ d28 = d26;
+ i8 = 0;
+ } else {
+ d37 = d28 - +HEAPF32[i4 >> 2];
+ d36 = d27 - +HEAPF32[i6 >> 2];
+ d33 = +HEAPF32[i5 >> 2];
+ d28 = +HEAPF32[i7 >> 2];
+ d39 = +(d37 * d33 + d36 * d28);
+ d28 = +(d33 * d36 - d37 * d28);
+ i8 = i2;
+ HEAPF32[i8 >> 2] = d39;
+ HEAPF32[i8 + 4 >> 2] = d28;
+ HEAP32[i2 + 16 >> 2] = HEAP32[i3 + 8 >> 2];
+ d28 = +HEAPF32[i21 >> 2];
+ i8 = 1;
+ }
+ d26 = +HEAPF32[i3 + 12 >> 2];
+ d27 = +HEAPF32[i3 + 16 >> 2];
+ if ((d26 - d23) * d22 + (d27 - d24) * d25 <= d28) {
+ d36 = d26 - +HEAPF32[i4 >> 2];
+ d33 = d27 - +HEAPF32[i6 >> 2];
+ d32 = +HEAPF32[i5 >> 2];
+ d39 = +HEAPF32[i7 >> 2];
+ d37 = +(d36 * d32 + d33 * d39);
+ d39 = +(d32 * d33 - d36 * d39);
+ i41 = i2 + (i8 * 20 | 0) | 0;
+ HEAPF32[i41 >> 2] = d37;
+ HEAPF32[i41 + 4 >> 2] = d39;
+ HEAP32[i2 + (i8 * 20 | 0) + 16 >> 2] = HEAP32[i3 + 20 >> 2];
+ i8 = i8 + 1 | 0;
+ }
+ } else {
+ i38 = HEAP32[i9 >> 2] | 0;
+ i35 = i8 + (i38 << 3) + 84 | 0;
+ i41 = HEAP32[i35 + 4 >> 2] | 0;
+ i40 = i10;
+ HEAP32[i40 >> 2] = HEAP32[i35 >> 2];
+ HEAP32[i40 + 4 >> 2] = i41;
+ i38 = i8 + (i38 << 3) + 20 | 0;
+ i40 = HEAP32[i38 + 4 >> 2] | 0;
+ i41 = i2 + 48 | 0;
+ HEAP32[i41 >> 2] = HEAP32[i38 >> 2];
+ HEAP32[i41 + 4 >> 2] = i40;
+ d22 = +HEAPF32[i17 >> 2];
+ d23 = +HEAPF32[i16 >> 2];
+ d24 = +HEAPF32[i15 >> 2];
+ d25 = +HEAPF32[i13 >> 2];
+ d26 = +HEAPF32[i21 >> 2];
+ if (!((+HEAPF32[i3 >> 2] - d22) * d23 + (+HEAPF32[i3 + 4 >> 2] - d24) * d25 <= d26)) {
+ i8 = 0;
+ } else {
+ i40 = i3;
+ i8 = HEAP32[i40 + 4 >> 2] | 0;
+ i41 = i2;
+ HEAP32[i41 >> 2] = HEAP32[i40 >> 2];
+ HEAP32[i41 + 4 >> 2] = i8;
+ i41 = i3 + 8 | 0;
+ i8 = i2 + 16 | 0;
+ HEAP8[i8 + 2 | 0] = HEAP8[i41 + 3 | 0] | 0;
+ HEAP8[i8 + 3 | 0] = HEAP8[i41 + 2 | 0] | 0;
+ HEAP8[i8] = HEAP8[i41 + 1 | 0] | 0;
+ HEAP8[i8 + 1 | 0] = HEAP8[i41] | 0;
+ d26 = +HEAPF32[i21 >> 2];
+ i8 = 1;
+ }
+ i4 = i3 + 12 | 0;
+ if ((+HEAPF32[i4 >> 2] - d22) * d23 + (+HEAPF32[i3 + 16 >> 2] - d24) * d25 <= d26) {
+ i38 = i4;
+ i41 = HEAP32[i38 + 4 >> 2] | 0;
+ i40 = i2 + (i8 * 20 | 0) | 0;
+ HEAP32[i40 >> 2] = HEAP32[i38 >> 2];
+ HEAP32[i40 + 4 >> 2] = i41;
+ i40 = i3 + 20 | 0;
+ i41 = i2 + (i8 * 20 | 0) + 16 | 0;
+ HEAP8[i41 + 2 | 0] = HEAP8[i40 + 3 | 0] | 0;
+ HEAP8[i41 + 3 | 0] = HEAP8[i40 + 2 | 0] | 0;
+ HEAP8[i41] = HEAP8[i40 + 1 | 0] | 0;
+ HEAP8[i41 + 1 | 0] = HEAP8[i40] | 0;
+ i8 = i8 + 1 | 0;
+ }
+ }
+ HEAP32[i19 >> 2] = i8;
+ STACKTOP = i1;
+ return;
+}
+function __ZN7b2World8SolveTOIERK10b2TimeStep(i30, i11) {
+ i30 = i30 | 0;
+ i11 = i11 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0, i31 = 0, i32 = 0, i33 = 0, i34 = 0, i35 = 0, i36 = 0, i37 = 0, i38 = 0, i39 = 0, i40 = 0, i41 = 0, d42 = 0.0, i43 = 0, i44 = 0, i45 = 0, i46 = 0, i47 = 0, i48 = 0, i49 = 0, i50 = 0, i51 = 0, i52 = 0, i53 = 0, i54 = 0, i55 = 0, i56 = 0, i57 = 0, i58 = 0, i59 = 0, i60 = 0, i61 = 0, i62 = 0, i63 = 0, i64 = 0, i65 = 0, i66 = 0, d67 = 0.0, d68 = 0.0, d69 = 0.0, d70 = 0.0, d71 = 0.0, d72 = 0.0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 336 | 0;
+ i3 = i1 + 284 | 0;
+ i6 = i1 + 152 | 0;
+ i5 = i1 + 144 | 0;
+ i4 = i1 + 108 | 0;
+ i8 = i1 + 72 | 0;
+ i7 = i1 + 64 | 0;
+ i14 = i1 + 24 | 0;
+ i9 = i1;
+ i10 = i30 + 102872 | 0;
+ i13 = i30 + 102944 | 0;
+ __ZN8b2IslandC2EiiiP16b2StackAllocatorP17b2ContactListener(i3, 64, 32, 0, i30 + 68 | 0, HEAP32[i13 >> 2] | 0);
+ i2 = i30 + 102995 | 0;
+ if ((HEAP8[i2] | 0) != 0) {
+ i15 = HEAP32[i30 + 102952 >> 2] | 0;
+ if ((i15 | 0) != 0) {
+ do {
+ i66 = i15 + 4 | 0;
+ HEAP16[i66 >> 1] = HEAP16[i66 >> 1] & 65534;
+ HEAPF32[i15 + 60 >> 2] = 0.0;
+ i15 = HEAP32[i15 + 96 >> 2] | 0;
+ } while ((i15 | 0) != 0);
+ }
+ i15 = i30 + 102932 | 0;
+ i16 = HEAP32[i15 >> 2] | 0;
+ if ((i16 | 0) != 0) {
+ do {
+ i66 = i16 + 4 | 0;
+ HEAP32[i66 >> 2] = HEAP32[i66 >> 2] & -34;
+ HEAP32[i16 + 128 >> 2] = 0;
+ HEAPF32[i16 + 132 >> 2] = 1.0;
+ i16 = HEAP32[i16 + 12 >> 2] | 0;
+ } while ((i16 | 0) != 0);
+ }
+ } else {
+ i15 = i30 + 102932 | 0;
+ }
+ i25 = i3 + 28 | 0;
+ i26 = i3 + 36 | 0;
+ i27 = i3 + 32 | 0;
+ i28 = i3 + 40 | 0;
+ i29 = i3 + 8 | 0;
+ i24 = i3 + 44 | 0;
+ i23 = i3 + 12 | 0;
+ i22 = i7 + 4 | 0;
+ i21 = i9 + 4 | 0;
+ i20 = i9 + 8 | 0;
+ i19 = i9 + 16 | 0;
+ i18 = i11 + 12 | 0;
+ i17 = i9 + 12 | 0;
+ i16 = i9 + 20 | 0;
+ i39 = i30 + 102994 | 0;
+ i37 = i6 + 16 | 0;
+ i36 = i6 + 20 | 0;
+ i35 = i6 + 24 | 0;
+ i34 = i6 + 44 | 0;
+ i33 = i6 + 48 | 0;
+ i32 = i6 + 52 | 0;
+ i41 = i6 + 28 | 0;
+ i31 = i6 + 56 | 0;
+ i40 = i6 + 92 | 0;
+ i30 = i6 + 128 | 0;
+ i38 = i5 + 4 | 0;
+ L11 : while (1) {
+ i47 = HEAP32[i15 >> 2] | 0;
+ if ((i47 | 0) == 0) {
+ i4 = 36;
+ break;
+ } else {
+ d42 = 1.0;
+ i44 = 0;
+ }
+ do {
+ i48 = i47 + 4 | 0;
+ i43 = HEAP32[i48 >> 2] | 0;
+ do {
+ if ((i43 & 4 | 0) != 0 ? (HEAP32[i47 + 128 >> 2] | 0) <= 8 : 0) {
+ if ((i43 & 32 | 0) == 0) {
+ i43 = HEAP32[i47 + 48 >> 2] | 0;
+ i45 = HEAP32[i47 + 52 >> 2] | 0;
+ if ((HEAP8[i43 + 38 | 0] | 0) != 0) {
+ break;
+ }
+ if ((HEAP8[i45 + 38 | 0] | 0) != 0) {
+ break;
+ }
+ i46 = HEAP32[i43 + 8 >> 2] | 0;
+ i50 = HEAP32[i45 + 8 >> 2] | 0;
+ i53 = HEAP32[i46 >> 2] | 0;
+ i52 = HEAP32[i50 >> 2] | 0;
+ if (!((i53 | 0) == 2 | (i52 | 0) == 2)) {
+ i4 = 16;
+ break L11;
+ }
+ i51 = HEAP16[i46 + 4 >> 1] | 0;
+ i49 = HEAP16[i50 + 4 >> 1] | 0;
+ if (!((i51 & 2) != 0 & (i53 | 0) != 0 | (i49 & 2) != 0 & (i52 | 0) != 0)) {
+ break;
+ }
+ if (!((i51 & 8) != 0 | (i53 | 0) != 2 | ((i49 & 8) != 0 | (i52 | 0) != 2))) {
+ break;
+ }
+ i51 = i46 + 28 | 0;
+ i52 = i46 + 60 | 0;
+ d68 = +HEAPF32[i52 >> 2];
+ i49 = i50 + 28 | 0;
+ i53 = i50 + 60 | 0;
+ d67 = +HEAPF32[i53 >> 2];
+ if (!(d68 < d67)) {
+ if (d67 < d68) {
+ if (!(d67 < 1.0)) {
+ i4 = 25;
+ break L11;
+ }
+ d67 = (d68 - d67) / (1.0 - d67);
+ i66 = i50 + 36 | 0;
+ d69 = 1.0 - d67;
+ d71 = +(+HEAPF32[i66 >> 2] * d69 + d67 * +HEAPF32[i50 + 44 >> 2]);
+ d70 = +(d69 * +HEAPF32[i50 + 40 >> 2] + d67 * +HEAPF32[i50 + 48 >> 2]);
+ HEAPF32[i66 >> 2] = d71;
+ HEAPF32[i66 + 4 >> 2] = d70;
+ i66 = i50 + 52 | 0;
+ HEAPF32[i66 >> 2] = d69 * +HEAPF32[i66 >> 2] + d67 * +HEAPF32[i50 + 56 >> 2];
+ HEAPF32[i53 >> 2] = d68;
+ d67 = d68;
+ } else {
+ d67 = d68;
+ }
+ } else {
+ if (!(d68 < 1.0)) {
+ i4 = 21;
+ break L11;
+ }
+ d71 = (d67 - d68) / (1.0 - d68);
+ i66 = i46 + 36 | 0;
+ d70 = 1.0 - d71;
+ d68 = +(+HEAPF32[i66 >> 2] * d70 + d71 * +HEAPF32[i46 + 44 >> 2]);
+ d69 = +(d70 * +HEAPF32[i46 + 40 >> 2] + d71 * +HEAPF32[i46 + 48 >> 2]);
+ HEAPF32[i66 >> 2] = d68;
+ HEAPF32[i66 + 4 >> 2] = d69;
+ i66 = i46 + 52 | 0;
+ HEAPF32[i66 >> 2] = d70 * +HEAPF32[i66 >> 2] + d71 * +HEAPF32[i46 + 56 >> 2];
+ HEAPF32[i52 >> 2] = d67;
+ }
+ if (!(d67 < 1.0)) {
+ i4 = 28;
+ break L11;
+ }
+ i66 = HEAP32[i47 + 56 >> 2] | 0;
+ i46 = HEAP32[i47 + 60 >> 2] | 0;
+ HEAP32[i37 >> 2] = 0;
+ HEAP32[i36 >> 2] = 0;
+ HEAPF32[i35 >> 2] = 0.0;
+ HEAP32[i34 >> 2] = 0;
+ HEAP32[i33 >> 2] = 0;
+ HEAPF32[i32 >> 2] = 0.0;
+ __ZN15b2DistanceProxy3SetEPK7b2Shapei(i6, HEAP32[i43 + 12 >> 2] | 0, i66);
+ __ZN15b2DistanceProxy3SetEPK7b2Shapei(i41, HEAP32[i45 + 12 >> 2] | 0, i46);
+ i43 = i31 + 0 | 0;
+ i45 = i51 + 0 | 0;
+ i46 = i43 + 36 | 0;
+ do {
+ HEAP32[i43 >> 2] = HEAP32[i45 >> 2];
+ i43 = i43 + 4 | 0;
+ i45 = i45 + 4 | 0;
+ } while ((i43 | 0) < (i46 | 0));
+ i43 = i40 + 0 | 0;
+ i45 = i49 + 0 | 0;
+ i46 = i43 + 36 | 0;
+ do {
+ HEAP32[i43 >> 2] = HEAP32[i45 >> 2];
+ i43 = i43 + 4 | 0;
+ i45 = i45 + 4 | 0;
+ } while ((i43 | 0) < (i46 | 0));
+ HEAPF32[i30 >> 2] = 1.0;
+ __Z14b2TimeOfImpactP11b2TOIOutputPK10b2TOIInput(i5, i6);
+ if ((HEAP32[i5 >> 2] | 0) == 3) {
+ d67 = d67 + (1.0 - d67) * +HEAPF32[i38 >> 2];
+ d67 = d67 < 1.0 ? d67 : 1.0;
+ } else {
+ d67 = 1.0;
+ }
+ HEAPF32[i47 + 132 >> 2] = d67;
+ HEAP32[i48 >> 2] = HEAP32[i48 >> 2] | 32;
+ } else {
+ d67 = +HEAPF32[i47 + 132 >> 2];
+ }
+ if (d67 < d42) {
+ d42 = d67;
+ i44 = i47;
+ }
+ }
+ } while (0);
+ i47 = HEAP32[i47 + 12 >> 2] | 0;
+ } while ((i47 | 0) != 0);
+ if ((i44 | 0) == 0 | d42 > .9999988079071045) {
+ i4 = 36;
+ break;
+ }
+ i47 = HEAP32[(HEAP32[i44 + 48 >> 2] | 0) + 8 >> 2] | 0;
+ i48 = HEAP32[(HEAP32[i44 + 52 >> 2] | 0) + 8 >> 2] | 0;
+ i49 = i47 + 28 | 0;
+ i43 = i4 + 0 | 0;
+ i45 = i49 + 0 | 0;
+ i46 = i43 + 36 | 0;
+ do {
+ HEAP32[i43 >> 2] = HEAP32[i45 >> 2];
+ i43 = i43 + 4 | 0;
+ i45 = i45 + 4 | 0;
+ } while ((i43 | 0) < (i46 | 0));
+ i50 = i48 + 28 | 0;
+ i43 = i8 + 0 | 0;
+ i45 = i50 + 0 | 0;
+ i46 = i43 + 36 | 0;
+ do {
+ HEAP32[i43 >> 2] = HEAP32[i45 >> 2];
+ i43 = i43 + 4 | 0;
+ i45 = i45 + 4 | 0;
+ } while ((i43 | 0) < (i46 | 0));
+ i43 = i47 + 60 | 0;
+ d67 = +HEAPF32[i43 >> 2];
+ if (!(d67 < 1.0)) {
+ i4 = 38;
+ break;
+ }
+ d70 = (d42 - d67) / (1.0 - d67);
+ i57 = i47 + 36 | 0;
+ d67 = 1.0 - d70;
+ i52 = i47 + 44 | 0;
+ i53 = i47 + 48 | 0;
+ d71 = +HEAPF32[i57 >> 2] * d67 + d70 * +HEAPF32[i52 >> 2];
+ d72 = d67 * +HEAPF32[i47 + 40 >> 2] + d70 * +HEAPF32[i53 >> 2];
+ d69 = +d71;
+ d68 = +d72;
+ HEAPF32[i57 >> 2] = d69;
+ HEAPF32[i57 + 4 >> 2] = d68;
+ i57 = i47 + 52 | 0;
+ i51 = i47 + 56 | 0;
+ d70 = d67 * +HEAPF32[i57 >> 2] + d70 * +HEAPF32[i51 >> 2];
+ HEAPF32[i57 >> 2] = d70;
+ HEAPF32[i43 >> 2] = d42;
+ i57 = i47 + 44 | 0;
+ HEAPF32[i57 >> 2] = d69;
+ HEAPF32[i57 + 4 >> 2] = d68;
+ HEAPF32[i51 >> 2] = d70;
+ d68 = +Math_sin(+d70);
+ i57 = i47 + 20 | 0;
+ HEAPF32[i57 >> 2] = d68;
+ d70 = +Math_cos(+d70);
+ i56 = i47 + 24 | 0;
+ HEAPF32[i56 >> 2] = d70;
+ i58 = i47 + 12 | 0;
+ i55 = i47 + 28 | 0;
+ d69 = +HEAPF32[i55 >> 2];
+ i54 = i47 + 32 | 0;
+ d67 = +HEAPF32[i54 >> 2];
+ d71 = +(d71 - (d70 * d69 - d68 * d67));
+ d67 = +(d72 - (d68 * d69 + d70 * d67));
+ i43 = i58;
+ HEAPF32[i43 >> 2] = d71;
+ HEAPF32[i43 + 4 >> 2] = d67;
+ i43 = i48 + 60 | 0;
+ d67 = +HEAPF32[i43 >> 2];
+ if (!(d67 < 1.0)) {
+ i4 = 40;
+ break;
+ }
+ d70 = (d42 - d67) / (1.0 - d67);
+ i64 = i48 + 36 | 0;
+ d72 = 1.0 - d70;
+ i61 = i48 + 44 | 0;
+ i60 = i48 + 48 | 0;
+ d71 = +HEAPF32[i64 >> 2] * d72 + d70 * +HEAPF32[i61 >> 2];
+ d67 = d72 * +HEAPF32[i48 + 40 >> 2] + d70 * +HEAPF32[i60 >> 2];
+ d69 = +d71;
+ d68 = +d67;
+ HEAPF32[i64 >> 2] = d69;
+ HEAPF32[i64 + 4 >> 2] = d68;
+ i64 = i48 + 52 | 0;
+ i59 = i48 + 56 | 0;
+ d70 = d72 * +HEAPF32[i64 >> 2] + d70 * +HEAPF32[i59 >> 2];
+ HEAPF32[i64 >> 2] = d70;
+ HEAPF32[i43 >> 2] = d42;
+ i64 = i48 + 44 | 0;
+ HEAPF32[i64 >> 2] = d69;
+ HEAPF32[i64 + 4 >> 2] = d68;
+ HEAPF32[i59 >> 2] = d70;
+ d68 = +Math_sin(+d70);
+ i64 = i48 + 20 | 0;
+ HEAPF32[i64 >> 2] = d68;
+ d70 = +Math_cos(+d70);
+ i63 = i48 + 24 | 0;
+ HEAPF32[i63 >> 2] = d70;
+ i65 = i48 + 12 | 0;
+ i62 = i48 + 28 | 0;
+ d69 = +HEAPF32[i62 >> 2];
+ i66 = i48 + 32 | 0;
+ d72 = +HEAPF32[i66 >> 2];
+ d71 = +(d71 - (d70 * d69 - d68 * d72));
+ d72 = +(d67 - (d68 * d69 + d70 * d72));
+ i43 = i65;
+ HEAPF32[i43 >> 2] = d71;
+ HEAPF32[i43 + 4 >> 2] = d72;
+ __ZN9b2Contact6UpdateEP17b2ContactListener(i44, HEAP32[i13 >> 2] | 0);
+ i43 = i44 + 4 | 0;
+ i45 = HEAP32[i43 >> 2] | 0;
+ HEAP32[i43 >> 2] = i45 & -33;
+ i46 = i44 + 128 | 0;
+ HEAP32[i46 >> 2] = (HEAP32[i46 >> 2] | 0) + 1;
+ if ((i45 & 6 | 0) != 6) {
+ HEAP32[i43 >> 2] = i45 & -37;
+ i43 = i49 + 0 | 0;
+ i45 = i4 + 0 | 0;
+ i46 = i43 + 36 | 0;
+ do {
+ HEAP32[i43 >> 2] = HEAP32[i45 >> 2];
+ i43 = i43 + 4 | 0;
+ i45 = i45 + 4 | 0;
+ } while ((i43 | 0) < (i46 | 0));
+ i43 = i50 + 0 | 0;
+ i45 = i8 + 0 | 0;
+ i46 = i43 + 36 | 0;
+ do {
+ HEAP32[i43 >> 2] = HEAP32[i45 >> 2];
+ i43 = i43 + 4 | 0;
+ i45 = i45 + 4 | 0;
+ } while ((i43 | 0) < (i46 | 0));
+ d69 = +HEAPF32[i51 >> 2];
+ d71 = +Math_sin(+d69);
+ HEAPF32[i57 >> 2] = d71;
+ d69 = +Math_cos(+d69);
+ HEAPF32[i56 >> 2] = d69;
+ d72 = +HEAPF32[i55 >> 2];
+ d70 = +HEAPF32[i54 >> 2];
+ d68 = +(+HEAPF32[i52 >> 2] - (d69 * d72 - d71 * d70));
+ d70 = +(+HEAPF32[i53 >> 2] - (d71 * d72 + d69 * d70));
+ HEAPF32[i58 >> 2] = d68;
+ HEAPF32[i58 + 4 >> 2] = d70;
+ d70 = +HEAPF32[i59 >> 2];
+ d68 = +Math_sin(+d70);
+ HEAPF32[i64 >> 2] = d68;
+ d70 = +Math_cos(+d70);
+ HEAPF32[i63 >> 2] = d70;
+ d69 = +HEAPF32[i62 >> 2];
+ d72 = +HEAPF32[i66 >> 2];
+ d71 = +(+HEAPF32[i61 >> 2] - (d70 * d69 - d68 * d72));
+ d72 = +(+HEAPF32[i60 >> 2] - (d68 * d69 + d70 * d72));
+ i66 = i65;
+ HEAPF32[i66 >> 2] = d71;
+ HEAPF32[i66 + 4 >> 2] = d72;
+ continue;
+ }
+ i45 = i47 + 4 | 0;
+ i46 = HEAPU16[i45 >> 1] | 0;
+ if ((i46 & 2 | 0) == 0) {
+ HEAP16[i45 >> 1] = i46 | 2;
+ HEAPF32[i47 + 144 >> 2] = 0.0;
+ }
+ i46 = i48 + 4 | 0;
+ i49 = HEAPU16[i46 >> 1] | 0;
+ if ((i49 & 2 | 0) == 0) {
+ HEAP16[i46 >> 1] = i49 | 2;
+ HEAPF32[i48 + 144 >> 2] = 0.0;
+ }
+ HEAP32[i25 >> 2] = 0;
+ HEAP32[i26 >> 2] = 0;
+ HEAP32[i27 >> 2] = 0;
+ if ((HEAP32[i28 >> 2] | 0) <= 0) {
+ i4 = 48;
+ break;
+ }
+ i49 = i47 + 8 | 0;
+ HEAP32[i49 >> 2] = 0;
+ i51 = HEAP32[i25 >> 2] | 0;
+ HEAP32[(HEAP32[i29 >> 2] | 0) + (i51 << 2) >> 2] = i47;
+ i51 = i51 + 1 | 0;
+ HEAP32[i25 >> 2] = i51;
+ if ((i51 | 0) >= (HEAP32[i28 >> 2] | 0)) {
+ i4 = 50;
+ break;
+ }
+ i50 = i48 + 8 | 0;
+ HEAP32[i50 >> 2] = i51;
+ i51 = HEAP32[i25 >> 2] | 0;
+ HEAP32[(HEAP32[i29 >> 2] | 0) + (i51 << 2) >> 2] = i48;
+ HEAP32[i25 >> 2] = i51 + 1;
+ i51 = HEAP32[i26 >> 2] | 0;
+ if ((i51 | 0) >= (HEAP32[i24 >> 2] | 0)) {
+ i4 = 52;
+ break;
+ }
+ HEAP32[i26 >> 2] = i51 + 1;
+ HEAP32[(HEAP32[i23 >> 2] | 0) + (i51 << 2) >> 2] = i44;
+ HEAP16[i45 >> 1] = HEAPU16[i45 >> 1] | 1;
+ HEAP16[i46 >> 1] = HEAPU16[i46 >> 1] | 1;
+ HEAP32[i43 >> 2] = HEAP32[i43 >> 2] | 1;
+ HEAP32[i7 >> 2] = i47;
+ HEAP32[i22 >> 2] = i48;
+ i44 = 1;
+ while (1) {
+ L58 : do {
+ if ((HEAP32[i47 >> 2] | 0) == 2 ? (i12 = HEAP32[i47 + 112 >> 2] | 0, (i12 | 0) != 0) : 0) {
+ i47 = i47 + 4 | 0;
+ i51 = i12;
+ do {
+ if ((HEAP32[i25 >> 2] | 0) == (HEAP32[i28 >> 2] | 0)) {
+ break L58;
+ }
+ if ((HEAP32[i26 >> 2] | 0) == (HEAP32[i24 >> 2] | 0)) {
+ break L58;
+ }
+ i52 = HEAP32[i51 + 4 >> 2] | 0;
+ i53 = i52 + 4 | 0;
+ do {
+ if ((HEAP32[i53 >> 2] & 1 | 0) == 0) {
+ i48 = HEAP32[i51 >> 2] | 0;
+ if (((HEAP32[i48 >> 2] | 0) == 2 ? (HEAP16[i47 >> 1] & 8) == 0 : 0) ? (HEAP16[i48 + 4 >> 1] & 8) == 0 : 0) {
+ break;
+ }
+ if ((HEAP8[(HEAP32[i52 + 48 >> 2] | 0) + 38 | 0] | 0) == 0 ? (HEAP8[(HEAP32[i52 + 52 >> 2] | 0) + 38 | 0] | 0) == 0 : 0) {
+ i54 = i48 + 28 | 0;
+ i43 = i14 + 0 | 0;
+ i45 = i54 + 0 | 0;
+ i46 = i43 + 36 | 0;
+ do {
+ HEAP32[i43 >> 2] = HEAP32[i45 >> 2];
+ i43 = i43 + 4 | 0;
+ i45 = i45 + 4 | 0;
+ } while ((i43 | 0) < (i46 | 0));
+ i43 = i48 + 4 | 0;
+ if ((HEAP16[i43 >> 1] & 1) == 0) {
+ i45 = i48 + 60 | 0;
+ d67 = +HEAPF32[i45 >> 2];
+ if (!(d67 < 1.0)) {
+ i4 = 67;
+ break L11;
+ }
+ d70 = (d42 - d67) / (1.0 - d67);
+ i65 = i48 + 36 | 0;
+ d72 = 1.0 - d70;
+ d71 = +HEAPF32[i65 >> 2] * d72 + d70 * +HEAPF32[i48 + 44 >> 2];
+ d67 = d72 * +HEAPF32[i48 + 40 >> 2] + d70 * +HEAPF32[i48 + 48 >> 2];
+ d69 = +d71;
+ d68 = +d67;
+ HEAPF32[i65 >> 2] = d69;
+ HEAPF32[i65 + 4 >> 2] = d68;
+ i65 = i48 + 52 | 0;
+ i66 = i48 + 56 | 0;
+ d70 = d72 * +HEAPF32[i65 >> 2] + d70 * +HEAPF32[i66 >> 2];
+ HEAPF32[i65 >> 2] = d70;
+ HEAPF32[i45 >> 2] = d42;
+ i65 = i48 + 44 | 0;
+ HEAPF32[i65 >> 2] = d69;
+ HEAPF32[i65 + 4 >> 2] = d68;
+ HEAPF32[i66 >> 2] = d70;
+ d68 = +Math_sin(+d70);
+ HEAPF32[i48 + 20 >> 2] = d68;
+ d70 = +Math_cos(+d70);
+ HEAPF32[i48 + 24 >> 2] = d70;
+ d69 = +HEAPF32[i48 + 28 >> 2];
+ d72 = +HEAPF32[i48 + 32 >> 2];
+ d71 = +(d71 - (d70 * d69 - d68 * d72));
+ d72 = +(d67 - (d68 * d69 + d70 * d72));
+ i66 = i48 + 12 | 0;
+ HEAPF32[i66 >> 2] = d71;
+ HEAPF32[i66 + 4 >> 2] = d72;
+ }
+ __ZN9b2Contact6UpdateEP17b2ContactListener(i52, HEAP32[i13 >> 2] | 0);
+ i45 = HEAP32[i53 >> 2] | 0;
+ if ((i45 & 4 | 0) == 0) {
+ i43 = i54 + 0 | 0;
+ i45 = i14 + 0 | 0;
+ i46 = i43 + 36 | 0;
+ do {
+ HEAP32[i43 >> 2] = HEAP32[i45 >> 2];
+ i43 = i43 + 4 | 0;
+ i45 = i45 + 4 | 0;
+ } while ((i43 | 0) < (i46 | 0));
+ d70 = +HEAPF32[i48 + 56 >> 2];
+ d68 = +Math_sin(+d70);
+ HEAPF32[i48 + 20 >> 2] = d68;
+ d70 = +Math_cos(+d70);
+ HEAPF32[i48 + 24 >> 2] = d70;
+ d69 = +HEAPF32[i48 + 28 >> 2];
+ d72 = +HEAPF32[i48 + 32 >> 2];
+ d71 = +(+HEAPF32[i48 + 44 >> 2] - (d70 * d69 - d68 * d72));
+ d72 = +(+HEAPF32[i48 + 48 >> 2] - (d68 * d69 + d70 * d72));
+ i66 = i48 + 12 | 0;
+ HEAPF32[i66 >> 2] = d71;
+ HEAPF32[i66 + 4 >> 2] = d72;
+ break;
+ }
+ if ((i45 & 2 | 0) == 0) {
+ i43 = i54 + 0 | 0;
+ i45 = i14 + 0 | 0;
+ i46 = i43 + 36 | 0;
+ do {
+ HEAP32[i43 >> 2] = HEAP32[i45 >> 2];
+ i43 = i43 + 4 | 0;
+ i45 = i45 + 4 | 0;
+ } while ((i43 | 0) < (i46 | 0));
+ d70 = +HEAPF32[i48 + 56 >> 2];
+ d68 = +Math_sin(+d70);
+ HEAPF32[i48 + 20 >> 2] = d68;
+ d70 = +Math_cos(+d70);
+ HEAPF32[i48 + 24 >> 2] = d70;
+ d69 = +HEAPF32[i48 + 28 >> 2];
+ d72 = +HEAPF32[i48 + 32 >> 2];
+ d71 = +(+HEAPF32[i48 + 44 >> 2] - (d70 * d69 - d68 * d72));
+ d72 = +(+HEAPF32[i48 + 48 >> 2] - (d68 * d69 + d70 * d72));
+ i66 = i48 + 12 | 0;
+ HEAPF32[i66 >> 2] = d71;
+ HEAPF32[i66 + 4 >> 2] = d72;
+ break;
+ }
+ HEAP32[i53 >> 2] = i45 | 1;
+ i45 = HEAP32[i26 >> 2] | 0;
+ if ((i45 | 0) >= (HEAP32[i24 >> 2] | 0)) {
+ i4 = 74;
+ break L11;
+ }
+ HEAP32[i26 >> 2] = i45 + 1;
+ HEAP32[(HEAP32[i23 >> 2] | 0) + (i45 << 2) >> 2] = i52;
+ i45 = HEAPU16[i43 >> 1] | 0;
+ if ((i45 & 1 | 0) == 0) {
+ HEAP16[i43 >> 1] = i45 | 1;
+ if ((HEAP32[i48 >> 2] | 0) != 0 ? (i45 & 2 | 0) == 0 : 0) {
+ HEAP16[i43 >> 1] = i45 | 3;
+ HEAPF32[i48 + 144 >> 2] = 0.0;
+ }
+ i43 = HEAP32[i25 >> 2] | 0;
+ if ((i43 | 0) >= (HEAP32[i28 >> 2] | 0)) {
+ i4 = 80;
+ break L11;
+ }
+ HEAP32[i48 + 8 >> 2] = i43;
+ i66 = HEAP32[i25 >> 2] | 0;
+ HEAP32[(HEAP32[i29 >> 2] | 0) + (i66 << 2) >> 2] = i48;
+ HEAP32[i25 >> 2] = i66 + 1;
+ }
+ }
+ }
+ } while (0);
+ i51 = HEAP32[i51 + 12 >> 2] | 0;
+ } while ((i51 | 0) != 0);
+ }
+ } while (0);
+ if ((i44 | 0) >= 2) {
+ break;
+ }
+ i47 = HEAP32[i7 + (i44 << 2) >> 2] | 0;
+ i44 = i44 + 1 | 0;
+ }
+ d72 = (1.0 - d42) * +HEAPF32[i11 >> 2];
+ HEAPF32[i9 >> 2] = d72;
+ HEAPF32[i21 >> 2] = 1.0 / d72;
+ HEAPF32[i20 >> 2] = 1.0;
+ HEAP32[i19 >> 2] = 20;
+ HEAP32[i17 >> 2] = HEAP32[i18 >> 2];
+ HEAP8[i16] = 0;
+ __ZN8b2Island8SolveTOIERK10b2TimeStepii(i3, i9, HEAP32[i49 >> 2] | 0, HEAP32[i50 >> 2] | 0);
+ i44 = HEAP32[i25 >> 2] | 0;
+ if ((i44 | 0) > 0) {
+ i43 = 0;
+ do {
+ i45 = HEAP32[(HEAP32[i29 >> 2] | 0) + (i43 << 2) >> 2] | 0;
+ i66 = i45 + 4 | 0;
+ HEAP16[i66 >> 1] = HEAP16[i66 >> 1] & 65534;
+ if ((HEAP32[i45 >> 2] | 0) == 2) {
+ __ZN6b2Body19SynchronizeFixturesEv(i45);
+ i44 = HEAP32[i45 + 112 >> 2] | 0;
+ if ((i44 | 0) != 0) {
+ do {
+ i66 = (HEAP32[i44 + 4 >> 2] | 0) + 4 | 0;
+ HEAP32[i66 >> 2] = HEAP32[i66 >> 2] & -34;
+ i44 = HEAP32[i44 + 12 >> 2] | 0;
+ } while ((i44 | 0) != 0);
+ }
+ i44 = HEAP32[i25 >> 2] | 0;
+ }
+ i43 = i43 + 1 | 0;
+ } while ((i43 | 0) < (i44 | 0));
+ }
+ __ZN16b2ContactManager15FindNewContactsEv(i10);
+ if ((HEAP8[i39] | 0) != 0) {
+ i4 = 92;
+ break;
+ }
+ }
+ if ((i4 | 0) == 16) {
+ ___assert_fail(2288, 2184, 641, 2344);
+ } else if ((i4 | 0) == 21) {
+ ___assert_fail(2360, 2376, 723, 2400);
+ } else if ((i4 | 0) == 25) {
+ ___assert_fail(2360, 2376, 723, 2400);
+ } else if ((i4 | 0) == 28) {
+ ___assert_fail(2360, 2184, 676, 2344);
+ } else if ((i4 | 0) == 36) {
+ HEAP8[i2] = 1;
+ __ZN8b2IslandD2Ev(i3);
+ STACKTOP = i1;
+ return;
+ } else if ((i4 | 0) == 38) {
+ ___assert_fail(2360, 2376, 723, 2400);
+ } else if ((i4 | 0) == 40) {
+ ___assert_fail(2360, 2376, 723, 2400);
+ } else if ((i4 | 0) == 48) {
+ ___assert_fail(2520, 2440, 54, 2472);
+ } else if ((i4 | 0) == 50) {
+ ___assert_fail(2520, 2440, 54, 2472);
+ } else if ((i4 | 0) == 52) {
+ ___assert_fail(2480, 2440, 62, 2472);
+ } else if ((i4 | 0) == 67) {
+ ___assert_fail(2360, 2376, 723, 2400);
+ } else if ((i4 | 0) == 74) {
+ ___assert_fail(2480, 2440, 62, 2472);
+ } else if ((i4 | 0) == 80) {
+ ___assert_fail(2520, 2440, 54, 2472);
+ } else if ((i4 | 0) == 92) {
+ HEAP8[i2] = 0;
+ __ZN8b2IslandD2Ev(i3);
+ STACKTOP = i1;
+ return;
+ }
+}
+function __ZNSt3__16__sortIRPFbRK6b2PairS3_EPS1_EEvT0_S8_T_(i5, i8, i1) {
+ i5 = i5 | 0;
+ i8 = i8 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i6 = 0, i7 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i2 = i3;
+ L1 : while (1) {
+ i7 = i8;
+ i4 = i8 + -12 | 0;
+ L3 : while (1) {
+ i9 = i5;
+ i11 = i7 - i9 | 0;
+ switch ((i11 | 0) / 12 | 0 | 0) {
+ case 4:
+ {
+ i6 = 14;
+ break L1;
+ }
+ case 2:
+ {
+ i6 = 4;
+ break L1;
+ }
+ case 3:
+ {
+ i6 = 6;
+ break L1;
+ }
+ case 5:
+ {
+ i6 = 15;
+ break L1;
+ }
+ case 1:
+ case 0:
+ {
+ i6 = 67;
+ break L1;
+ }
+ default:
+ {}
+ }
+ if ((i11 | 0) < 372) {
+ i6 = 21;
+ break L1;
+ }
+ i12 = (i11 | 0) / 24 | 0;
+ i10 = i5 + (i12 * 12 | 0) | 0;
+ do {
+ if ((i11 | 0) > 11988) {
+ i14 = (i11 | 0) / 48 | 0;
+ i11 = i5 + (i14 * 12 | 0) | 0;
+ i14 = i5 + ((i14 + i12 | 0) * 12 | 0) | 0;
+ i12 = __ZNSt3__17__sort4IRPFbRK6b2PairS3_EPS1_EEjT0_S8_S8_S8_T_(i5, i11, i10, i14, i1) | 0;
+ if (FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i4, i14) | 0) {
+ HEAP32[i2 + 0 >> 2] = HEAP32[i14 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i14 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i14 + 8 >> 2];
+ HEAP32[i14 + 0 >> 2] = HEAP32[i4 + 0 >> 2];
+ HEAP32[i14 + 4 >> 2] = HEAP32[i4 + 4 >> 2];
+ HEAP32[i14 + 8 >> 2] = HEAP32[i4 + 8 >> 2];
+ HEAP32[i4 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i4 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i4 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ i13 = i12 + 1 | 0;
+ if (FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i14, i10) | 0) {
+ HEAP32[i2 + 0 >> 2] = HEAP32[i10 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i10 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i10 + 8 >> 2];
+ HEAP32[i10 + 0 >> 2] = HEAP32[i14 + 0 >> 2];
+ HEAP32[i10 + 4 >> 2] = HEAP32[i14 + 4 >> 2];
+ HEAP32[i10 + 8 >> 2] = HEAP32[i14 + 8 >> 2];
+ HEAP32[i14 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i14 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i14 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ i13 = i12 + 2 | 0;
+ if (FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i10, i11) | 0) {
+ HEAP32[i2 + 0 >> 2] = HEAP32[i11 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i11 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i11 + 8 >> 2];
+ HEAP32[i11 + 0 >> 2] = HEAP32[i10 + 0 >> 2];
+ HEAP32[i11 + 4 >> 2] = HEAP32[i10 + 4 >> 2];
+ HEAP32[i11 + 8 >> 2] = HEAP32[i10 + 8 >> 2];
+ HEAP32[i10 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i10 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i10 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ if (FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i11, i5) | 0) {
+ HEAP32[i2 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i11 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i11 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i11 + 8 >> 2];
+ HEAP32[i11 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i11 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i11 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ i12 = i12 + 4 | 0;
+ } else {
+ i12 = i12 + 3 | 0;
+ }
+ } else {
+ i12 = i13;
+ }
+ } else {
+ i12 = i13;
+ }
+ }
+ } else {
+ i15 = FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i10, i5) | 0;
+ i11 = FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i4, i10) | 0;
+ if (!i15) {
+ if (!i11) {
+ i12 = 0;
+ break;
+ }
+ HEAP32[i2 + 0 >> 2] = HEAP32[i10 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i10 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i10 + 8 >> 2];
+ HEAP32[i10 + 0 >> 2] = HEAP32[i4 + 0 >> 2];
+ HEAP32[i10 + 4 >> 2] = HEAP32[i4 + 4 >> 2];
+ HEAP32[i10 + 8 >> 2] = HEAP32[i4 + 8 >> 2];
+ HEAP32[i4 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i4 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i4 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ if (!(FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i10, i5) | 0)) {
+ i12 = 1;
+ break;
+ }
+ HEAP32[i2 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i10 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i10 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i10 + 8 >> 2];
+ HEAP32[i10 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i10 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i10 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ i12 = 2;
+ break;
+ }
+ if (i11) {
+ HEAP32[i2 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i4 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i4 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i4 + 8 >> 2];
+ HEAP32[i4 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i4 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i4 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ i12 = 1;
+ break;
+ }
+ HEAP32[i2 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i10 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i10 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i10 + 8 >> 2];
+ HEAP32[i10 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i10 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i10 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ if (FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i4, i10) | 0) {
+ HEAP32[i2 + 0 >> 2] = HEAP32[i10 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i10 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i10 + 8 >> 2];
+ HEAP32[i10 + 0 >> 2] = HEAP32[i4 + 0 >> 2];
+ HEAP32[i10 + 4 >> 2] = HEAP32[i4 + 4 >> 2];
+ HEAP32[i10 + 8 >> 2] = HEAP32[i4 + 8 >> 2];
+ HEAP32[i4 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i4 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i4 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ i12 = 2;
+ } else {
+ i12 = 1;
+ }
+ }
+ } while (0);
+ do {
+ if (FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i5, i10) | 0) {
+ i13 = i4;
+ } else {
+ i13 = i4;
+ while (1) {
+ i13 = i13 + -12 | 0;
+ if ((i5 | 0) == (i13 | 0)) {
+ break;
+ }
+ if (FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i13, i10) | 0) {
+ i6 = 50;
+ break;
+ }
+ }
+ if ((i6 | 0) == 50) {
+ i6 = 0;
+ HEAP32[i2 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i13 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i13 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i13 + 8 >> 2];
+ HEAP32[i13 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i13 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i13 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ i12 = i12 + 1 | 0;
+ break;
+ }
+ i10 = i5 + 12 | 0;
+ if (!(FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i5, i4) | 0)) {
+ if ((i10 | 0) == (i4 | 0)) {
+ i6 = 67;
+ break L1;
+ }
+ while (1) {
+ i9 = i10 + 12 | 0;
+ if (FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i5, i10) | 0) {
+ break;
+ }
+ if ((i9 | 0) == (i4 | 0)) {
+ i6 = 67;
+ break L1;
+ } else {
+ i10 = i9;
+ }
+ }
+ HEAP32[i2 + 0 >> 2] = HEAP32[i10 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i10 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i10 + 8 >> 2];
+ HEAP32[i10 + 0 >> 2] = HEAP32[i4 + 0 >> 2];
+ HEAP32[i10 + 4 >> 2] = HEAP32[i4 + 4 >> 2];
+ HEAP32[i10 + 8 >> 2] = HEAP32[i4 + 8 >> 2];
+ HEAP32[i4 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i4 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i4 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ i10 = i9;
+ }
+ if ((i10 | 0) == (i4 | 0)) {
+ i6 = 67;
+ break L1;
+ } else {
+ i9 = i4;
+ }
+ while (1) {
+ while (1) {
+ i11 = i10 + 12 | 0;
+ if (FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i5, i10) | 0) {
+ break;
+ } else {
+ i10 = i11;
+ }
+ }
+ do {
+ i9 = i9 + -12 | 0;
+ } while (FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i5, i9) | 0);
+ if (!(i10 >>> 0 < i9 >>> 0)) {
+ i5 = i10;
+ continue L3;
+ }
+ HEAP32[i2 + 0 >> 2] = HEAP32[i10 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i10 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i10 + 8 >> 2];
+ HEAP32[i10 + 0 >> 2] = HEAP32[i9 + 0 >> 2];
+ HEAP32[i10 + 4 >> 2] = HEAP32[i9 + 4 >> 2];
+ HEAP32[i10 + 8 >> 2] = HEAP32[i9 + 8 >> 2];
+ HEAP32[i9 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i9 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i9 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ i10 = i11;
+ }
+ }
+ } while (0);
+ i11 = i5 + 12 | 0;
+ L47 : do {
+ if (i11 >>> 0 < i13 >>> 0) {
+ while (1) {
+ i15 = i11;
+ while (1) {
+ i11 = i15 + 12 | 0;
+ if (FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i15, i10) | 0) {
+ i15 = i11;
+ } else {
+ i14 = i13;
+ break;
+ }
+ }
+ do {
+ i14 = i14 + -12 | 0;
+ } while (!(FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i14, i10) | 0));
+ if (i15 >>> 0 > i14 >>> 0) {
+ i11 = i15;
+ break L47;
+ }
+ HEAP32[i2 + 0 >> 2] = HEAP32[i15 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i15 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i15 + 8 >> 2];
+ HEAP32[i15 + 0 >> 2] = HEAP32[i14 + 0 >> 2];
+ HEAP32[i15 + 4 >> 2] = HEAP32[i14 + 4 >> 2];
+ HEAP32[i15 + 8 >> 2] = HEAP32[i14 + 8 >> 2];
+ HEAP32[i14 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i14 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i14 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ i13 = i14;
+ i10 = (i10 | 0) == (i15 | 0) ? i14 : i10;
+ i12 = i12 + 1 | 0;
+ }
+ }
+ } while (0);
+ if ((i11 | 0) != (i10 | 0) ? FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i10, i11) | 0 : 0) {
+ HEAP32[i2 + 0 >> 2] = HEAP32[i11 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i11 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i11 + 8 >> 2];
+ HEAP32[i11 + 0 >> 2] = HEAP32[i10 + 0 >> 2];
+ HEAP32[i11 + 4 >> 2] = HEAP32[i10 + 4 >> 2];
+ HEAP32[i11 + 8 >> 2] = HEAP32[i10 + 8 >> 2];
+ HEAP32[i10 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i10 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i10 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ i12 = i12 + 1 | 0;
+ }
+ if ((i12 | 0) == 0) {
+ i12 = __ZNSt3__127__insertion_sort_incompleteIRPFbRK6b2PairS3_EPS1_EEbT0_S8_T_(i5, i11, i1) | 0;
+ i10 = i11 + 12 | 0;
+ if (__ZNSt3__127__insertion_sort_incompleteIRPFbRK6b2PairS3_EPS1_EEbT0_S8_T_(i10, i8, i1) | 0) {
+ i6 = 62;
+ break;
+ }
+ if (i12) {
+ i5 = i10;
+ continue;
+ }
+ }
+ i15 = i11;
+ if ((i15 - i9 | 0) >= (i7 - i15 | 0)) {
+ i6 = 66;
+ break;
+ }
+ __ZNSt3__16__sortIRPFbRK6b2PairS3_EPS1_EEvT0_S8_T_(i5, i11, i1);
+ i5 = i11 + 12 | 0;
+ }
+ if ((i6 | 0) == 62) {
+ i6 = 0;
+ if (i12) {
+ i6 = 67;
+ break;
+ } else {
+ i8 = i11;
+ continue;
+ }
+ } else if ((i6 | 0) == 66) {
+ i6 = 0;
+ __ZNSt3__16__sortIRPFbRK6b2PairS3_EPS1_EEvT0_S8_T_(i11 + 12 | 0, i8, i1);
+ i8 = i11;
+ continue;
+ }
+ }
+ if ((i6 | 0) == 4) {
+ if (!(FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i4, i5) | 0)) {
+ STACKTOP = i3;
+ return;
+ }
+ HEAP32[i2 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i4 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i4 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i4 + 8 >> 2];
+ HEAP32[i4 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i4 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i4 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ STACKTOP = i3;
+ return;
+ } else if ((i6 | 0) == 6) {
+ i6 = i5 + 12 | 0;
+ i15 = FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i6, i5) | 0;
+ i7 = FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i4, i6) | 0;
+ if (!i15) {
+ if (!i7) {
+ STACKTOP = i3;
+ return;
+ }
+ HEAP32[i2 + 0 >> 2] = HEAP32[i6 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i6 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ HEAP32[i6 + 0 >> 2] = HEAP32[i4 + 0 >> 2];
+ HEAP32[i6 + 4 >> 2] = HEAP32[i4 + 4 >> 2];
+ HEAP32[i6 + 8 >> 2] = HEAP32[i4 + 8 >> 2];
+ HEAP32[i4 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i4 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i4 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ if (!(FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i6, i5) | 0)) {
+ STACKTOP = i3;
+ return;
+ }
+ HEAP32[i2 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i6 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i6 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ HEAP32[i6 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i6 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i6 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ STACKTOP = i3;
+ return;
+ }
+ if (i7) {
+ HEAP32[i2 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i4 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i4 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i4 + 8 >> 2];
+ HEAP32[i4 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i4 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i4 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ STACKTOP = i3;
+ return;
+ }
+ HEAP32[i2 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i6 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i6 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ HEAP32[i6 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i6 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i6 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ if (!(FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i4, i6) | 0)) {
+ STACKTOP = i3;
+ return;
+ }
+ HEAP32[i2 + 0 >> 2] = HEAP32[i6 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i6 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ HEAP32[i6 + 0 >> 2] = HEAP32[i4 + 0 >> 2];
+ HEAP32[i6 + 4 >> 2] = HEAP32[i4 + 4 >> 2];
+ HEAP32[i6 + 8 >> 2] = HEAP32[i4 + 8 >> 2];
+ HEAP32[i4 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i4 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i4 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ STACKTOP = i3;
+ return;
+ } else if ((i6 | 0) == 14) {
+ __ZNSt3__17__sort4IRPFbRK6b2PairS3_EPS1_EEjT0_S8_S8_S8_T_(i5, i5 + 12 | 0, i5 + 24 | 0, i4, i1) | 0;
+ STACKTOP = i3;
+ return;
+ } else if ((i6 | 0) == 15) {
+ i6 = i5 + 12 | 0;
+ i7 = i5 + 24 | 0;
+ i8 = i5 + 36 | 0;
+ __ZNSt3__17__sort4IRPFbRK6b2PairS3_EPS1_EEjT0_S8_S8_S8_T_(i5, i6, i7, i8, i1) | 0;
+ if (!(FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i4, i8) | 0)) {
+ STACKTOP = i3;
+ return;
+ }
+ HEAP32[i2 + 0 >> 2] = HEAP32[i8 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i8 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i8 + 8 >> 2];
+ HEAP32[i8 + 0 >> 2] = HEAP32[i4 + 0 >> 2];
+ HEAP32[i8 + 4 >> 2] = HEAP32[i4 + 4 >> 2];
+ HEAP32[i8 + 8 >> 2] = HEAP32[i4 + 8 >> 2];
+ HEAP32[i4 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i4 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i4 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ if (!(FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i8, i7) | 0)) {
+ STACKTOP = i3;
+ return;
+ }
+ HEAP32[i2 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ HEAP32[i7 + 0 >> 2] = HEAP32[i8 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i8 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i8 + 8 >> 2];
+ HEAP32[i8 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i8 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i8 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ if (!(FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i7, i6) | 0)) {
+ STACKTOP = i3;
+ return;
+ }
+ HEAP32[i2 + 0 >> 2] = HEAP32[i6 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i6 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ HEAP32[i6 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i6 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i6 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ HEAP32[i7 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ if (!(FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i6, i5) | 0)) {
+ STACKTOP = i3;
+ return;
+ }
+ HEAP32[i2 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i2 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i6 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i6 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ HEAP32[i6 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i6 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i6 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ STACKTOP = i3;
+ return;
+ } else if ((i6 | 0) == 21) {
+ __ZNSt3__118__insertion_sort_3IRPFbRK6b2PairS3_EPS1_EEvT0_S8_T_(i5, i8, i1);
+ STACKTOP = i3;
+ return;
+ } else if ((i6 | 0) == 67) {
+ STACKTOP = i3;
+ return;
+ }
+}
+function _free(i7) {
+ i7 = i7 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0;
+ i1 = STACKTOP;
+ if ((i7 | 0) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i15 = i7 + -8 | 0;
+ i16 = HEAP32[7176 >> 2] | 0;
+ if (i15 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ i13 = HEAP32[i7 + -4 >> 2] | 0;
+ i12 = i13 & 3;
+ if ((i12 | 0) == 1) {
+ _abort();
+ }
+ i8 = i13 & -8;
+ i6 = i7 + (i8 + -8) | 0;
+ do {
+ if ((i13 & 1 | 0) == 0) {
+ i19 = HEAP32[i15 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i15 = -8 - i19 | 0;
+ i13 = i7 + i15 | 0;
+ i12 = i19 + i8 | 0;
+ if (i13 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ if ((i13 | 0) == (HEAP32[7180 >> 2] | 0)) {
+ i2 = i7 + (i8 + -4) | 0;
+ if ((HEAP32[i2 >> 2] & 3 | 0) != 3) {
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ HEAP32[7168 >> 2] = i12;
+ HEAP32[i2 >> 2] = HEAP32[i2 >> 2] & -2;
+ HEAP32[i7 + (i15 + 4) >> 2] = i12 | 1;
+ HEAP32[i6 >> 2] = i12;
+ STACKTOP = i1;
+ return;
+ }
+ i18 = i19 >>> 3;
+ if (i19 >>> 0 < 256) {
+ i2 = HEAP32[i7 + (i15 + 8) >> 2] | 0;
+ i11 = HEAP32[i7 + (i15 + 12) >> 2] | 0;
+ i14 = 7200 + (i18 << 1 << 2) | 0;
+ if ((i2 | 0) != (i14 | 0)) {
+ if (i2 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ if ((HEAP32[i2 + 12 >> 2] | 0) != (i13 | 0)) {
+ _abort();
+ }
+ }
+ if ((i11 | 0) == (i2 | 0)) {
+ HEAP32[1790] = HEAP32[1790] & ~(1 << i18);
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ if ((i11 | 0) != (i14 | 0)) {
+ if (i11 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ i14 = i11 + 8 | 0;
+ if ((HEAP32[i14 >> 2] | 0) == (i13 | 0)) {
+ i17 = i14;
+ } else {
+ _abort();
+ }
+ } else {
+ i17 = i11 + 8 | 0;
+ }
+ HEAP32[i2 + 12 >> 2] = i11;
+ HEAP32[i17 >> 2] = i2;
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ i17 = HEAP32[i7 + (i15 + 24) >> 2] | 0;
+ i18 = HEAP32[i7 + (i15 + 12) >> 2] | 0;
+ do {
+ if ((i18 | 0) == (i13 | 0)) {
+ i19 = i7 + (i15 + 20) | 0;
+ i18 = HEAP32[i19 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ i19 = i7 + (i15 + 16) | 0;
+ i18 = HEAP32[i19 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ i14 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i21 = i18 + 20 | 0;
+ i20 = HEAP32[i21 >> 2] | 0;
+ if ((i20 | 0) != 0) {
+ i18 = i20;
+ i19 = i21;
+ continue;
+ }
+ i20 = i18 + 16 | 0;
+ i21 = HEAP32[i20 >> 2] | 0;
+ if ((i21 | 0) == 0) {
+ break;
+ } else {
+ i18 = i21;
+ i19 = i20;
+ }
+ }
+ if (i19 >>> 0 < i16 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i19 >> 2] = 0;
+ i14 = i18;
+ break;
+ }
+ } else {
+ i19 = HEAP32[i7 + (i15 + 8) >> 2] | 0;
+ if (i19 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ i16 = i19 + 12 | 0;
+ if ((HEAP32[i16 >> 2] | 0) != (i13 | 0)) {
+ _abort();
+ }
+ i20 = i18 + 8 | 0;
+ if ((HEAP32[i20 >> 2] | 0) == (i13 | 0)) {
+ HEAP32[i16 >> 2] = i18;
+ HEAP32[i20 >> 2] = i19;
+ i14 = i18;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ if ((i17 | 0) != 0) {
+ i18 = HEAP32[i7 + (i15 + 28) >> 2] | 0;
+ i16 = 7464 + (i18 << 2) | 0;
+ if ((i13 | 0) == (HEAP32[i16 >> 2] | 0)) {
+ HEAP32[i16 >> 2] = i14;
+ if ((i14 | 0) == 0) {
+ HEAP32[7164 >> 2] = HEAP32[7164 >> 2] & ~(1 << i18);
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ } else {
+ if (i17 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i17 + 16 | 0;
+ if ((HEAP32[i16 >> 2] | 0) == (i13 | 0)) {
+ HEAP32[i16 >> 2] = i14;
+ } else {
+ HEAP32[i17 + 20 >> 2] = i14;
+ }
+ if ((i14 | 0) == 0) {
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ }
+ if (i14 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i14 + 24 >> 2] = i17;
+ i16 = HEAP32[i7 + (i15 + 16) >> 2] | 0;
+ do {
+ if ((i16 | 0) != 0) {
+ if (i16 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i14 + 16 >> 2] = i16;
+ HEAP32[i16 + 24 >> 2] = i14;
+ break;
+ }
+ }
+ } while (0);
+ i15 = HEAP32[i7 + (i15 + 20) >> 2] | 0;
+ if ((i15 | 0) != 0) {
+ if (i15 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i14 + 20 >> 2] = i15;
+ HEAP32[i15 + 24 >> 2] = i14;
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ } else {
+ i2 = i13;
+ i11 = i12;
+ }
+ } else {
+ i2 = i13;
+ i11 = i12;
+ }
+ } else {
+ i2 = i15;
+ i11 = i8;
+ }
+ } while (0);
+ if (!(i2 >>> 0 < i6 >>> 0)) {
+ _abort();
+ }
+ i12 = i7 + (i8 + -4) | 0;
+ i13 = HEAP32[i12 >> 2] | 0;
+ if ((i13 & 1 | 0) == 0) {
+ _abort();
+ }
+ if ((i13 & 2 | 0) == 0) {
+ if ((i6 | 0) == (HEAP32[7184 >> 2] | 0)) {
+ i21 = (HEAP32[7172 >> 2] | 0) + i11 | 0;
+ HEAP32[7172 >> 2] = i21;
+ HEAP32[7184 >> 2] = i2;
+ HEAP32[i2 + 4 >> 2] = i21 | 1;
+ if ((i2 | 0) != (HEAP32[7180 >> 2] | 0)) {
+ STACKTOP = i1;
+ return;
+ }
+ HEAP32[7180 >> 2] = 0;
+ HEAP32[7168 >> 2] = 0;
+ STACKTOP = i1;
+ return;
+ }
+ if ((i6 | 0) == (HEAP32[7180 >> 2] | 0)) {
+ i21 = (HEAP32[7168 >> 2] | 0) + i11 | 0;
+ HEAP32[7168 >> 2] = i21;
+ HEAP32[7180 >> 2] = i2;
+ HEAP32[i2 + 4 >> 2] = i21 | 1;
+ HEAP32[i2 + i21 >> 2] = i21;
+ STACKTOP = i1;
+ return;
+ }
+ i11 = (i13 & -8) + i11 | 0;
+ i12 = i13 >>> 3;
+ do {
+ if (!(i13 >>> 0 < 256)) {
+ i10 = HEAP32[i7 + (i8 + 16) >> 2] | 0;
+ i15 = HEAP32[i7 + (i8 | 4) >> 2] | 0;
+ do {
+ if ((i15 | 0) == (i6 | 0)) {
+ i13 = i7 + (i8 + 12) | 0;
+ i12 = HEAP32[i13 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ i13 = i7 + (i8 + 8) | 0;
+ i12 = HEAP32[i13 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ i9 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i14 = i12 + 20 | 0;
+ i15 = HEAP32[i14 >> 2] | 0;
+ if ((i15 | 0) != 0) {
+ i12 = i15;
+ i13 = i14;
+ continue;
+ }
+ i14 = i12 + 16 | 0;
+ i15 = HEAP32[i14 >> 2] | 0;
+ if ((i15 | 0) == 0) {
+ break;
+ } else {
+ i12 = i15;
+ i13 = i14;
+ }
+ }
+ if (i13 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i13 >> 2] = 0;
+ i9 = i12;
+ break;
+ }
+ } else {
+ i13 = HEAP32[i7 + i8 >> 2] | 0;
+ if (i13 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i14 = i13 + 12 | 0;
+ if ((HEAP32[i14 >> 2] | 0) != (i6 | 0)) {
+ _abort();
+ }
+ i12 = i15 + 8 | 0;
+ if ((HEAP32[i12 >> 2] | 0) == (i6 | 0)) {
+ HEAP32[i14 >> 2] = i15;
+ HEAP32[i12 >> 2] = i13;
+ i9 = i15;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ if ((i10 | 0) != 0) {
+ i12 = HEAP32[i7 + (i8 + 20) >> 2] | 0;
+ i13 = 7464 + (i12 << 2) | 0;
+ if ((i6 | 0) == (HEAP32[i13 >> 2] | 0)) {
+ HEAP32[i13 >> 2] = i9;
+ if ((i9 | 0) == 0) {
+ HEAP32[7164 >> 2] = HEAP32[7164 >> 2] & ~(1 << i12);
+ break;
+ }
+ } else {
+ if (i10 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i12 = i10 + 16 | 0;
+ if ((HEAP32[i12 >> 2] | 0) == (i6 | 0)) {
+ HEAP32[i12 >> 2] = i9;
+ } else {
+ HEAP32[i10 + 20 >> 2] = i9;
+ }
+ if ((i9 | 0) == 0) {
+ break;
+ }
+ }
+ if (i9 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i9 + 24 >> 2] = i10;
+ i6 = HEAP32[i7 + (i8 + 8) >> 2] | 0;
+ do {
+ if ((i6 | 0) != 0) {
+ if (i6 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i9 + 16 >> 2] = i6;
+ HEAP32[i6 + 24 >> 2] = i9;
+ break;
+ }
+ }
+ } while (0);
+ i6 = HEAP32[i7 + (i8 + 12) >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ if (i6 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i9 + 20 >> 2] = i6;
+ HEAP32[i6 + 24 >> 2] = i9;
+ break;
+ }
+ }
+ }
+ } else {
+ i9 = HEAP32[i7 + i8 >> 2] | 0;
+ i7 = HEAP32[i7 + (i8 | 4) >> 2] | 0;
+ i8 = 7200 + (i12 << 1 << 2) | 0;
+ if ((i9 | 0) != (i8 | 0)) {
+ if (i9 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ if ((HEAP32[i9 + 12 >> 2] | 0) != (i6 | 0)) {
+ _abort();
+ }
+ }
+ if ((i7 | 0) == (i9 | 0)) {
+ HEAP32[1790] = HEAP32[1790] & ~(1 << i12);
+ break;
+ }
+ if ((i7 | 0) != (i8 | 0)) {
+ if (i7 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i8 = i7 + 8 | 0;
+ if ((HEAP32[i8 >> 2] | 0) == (i6 | 0)) {
+ i10 = i8;
+ } else {
+ _abort();
+ }
+ } else {
+ i10 = i7 + 8 | 0;
+ }
+ HEAP32[i9 + 12 >> 2] = i7;
+ HEAP32[i10 >> 2] = i9;
+ }
+ } while (0);
+ HEAP32[i2 + 4 >> 2] = i11 | 1;
+ HEAP32[i2 + i11 >> 2] = i11;
+ if ((i2 | 0) == (HEAP32[7180 >> 2] | 0)) {
+ HEAP32[7168 >> 2] = i11;
+ STACKTOP = i1;
+ return;
+ }
+ } else {
+ HEAP32[i12 >> 2] = i13 & -2;
+ HEAP32[i2 + 4 >> 2] = i11 | 1;
+ HEAP32[i2 + i11 >> 2] = i11;
+ }
+ i6 = i11 >>> 3;
+ if (i11 >>> 0 < 256) {
+ i7 = i6 << 1;
+ i3 = 7200 + (i7 << 2) | 0;
+ i8 = HEAP32[1790] | 0;
+ i6 = 1 << i6;
+ if ((i8 & i6 | 0) != 0) {
+ i6 = 7200 + (i7 + 2 << 2) | 0;
+ i7 = HEAP32[i6 >> 2] | 0;
+ if (i7 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i4 = i6;
+ i5 = i7;
+ }
+ } else {
+ HEAP32[1790] = i8 | i6;
+ i4 = 7200 + (i7 + 2 << 2) | 0;
+ i5 = i3;
+ }
+ HEAP32[i4 >> 2] = i2;
+ HEAP32[i5 + 12 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i5;
+ HEAP32[i2 + 12 >> 2] = i3;
+ STACKTOP = i1;
+ return;
+ }
+ i4 = i11 >>> 8;
+ if ((i4 | 0) != 0) {
+ if (i11 >>> 0 > 16777215) {
+ i4 = 31;
+ } else {
+ i20 = (i4 + 1048320 | 0) >>> 16 & 8;
+ i21 = i4 << i20;
+ i19 = (i21 + 520192 | 0) >>> 16 & 4;
+ i21 = i21 << i19;
+ i4 = (i21 + 245760 | 0) >>> 16 & 2;
+ i4 = 14 - (i19 | i20 | i4) + (i21 << i4 >>> 15) | 0;
+ i4 = i11 >>> (i4 + 7 | 0) & 1 | i4 << 1;
+ }
+ } else {
+ i4 = 0;
+ }
+ i5 = 7464 + (i4 << 2) | 0;
+ HEAP32[i2 + 28 >> 2] = i4;
+ HEAP32[i2 + 20 >> 2] = 0;
+ HEAP32[i2 + 16 >> 2] = 0;
+ i7 = HEAP32[7164 >> 2] | 0;
+ i6 = 1 << i4;
+ L199 : do {
+ if ((i7 & i6 | 0) != 0) {
+ i5 = HEAP32[i5 >> 2] | 0;
+ if ((i4 | 0) == 31) {
+ i4 = 0;
+ } else {
+ i4 = 25 - (i4 >>> 1) | 0;
+ }
+ L204 : do {
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) != (i11 | 0)) {
+ i4 = i11 << i4;
+ i7 = i5;
+ while (1) {
+ i6 = i7 + (i4 >>> 31 << 2) + 16 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) == (i11 | 0)) {
+ i3 = i5;
+ break L204;
+ } else {
+ i4 = i4 << 1;
+ i7 = i5;
+ }
+ }
+ if (i6 >>> 0 < (HEAP32[7176 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i6 >> 2] = i2;
+ HEAP32[i2 + 24 >> 2] = i7;
+ HEAP32[i2 + 12 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i2;
+ break L199;
+ }
+ } else {
+ i3 = i5;
+ }
+ } while (0);
+ i5 = i3 + 8 | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ i6 = HEAP32[7176 >> 2] | 0;
+ if (i3 >>> 0 < i6 >>> 0) {
+ _abort();
+ }
+ if (i4 >>> 0 < i6 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i4 + 12 >> 2] = i2;
+ HEAP32[i5 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i4;
+ HEAP32[i2 + 12 >> 2] = i3;
+ HEAP32[i2 + 24 >> 2] = 0;
+ break;
+ }
+ } else {
+ HEAP32[7164 >> 2] = i7 | i6;
+ HEAP32[i5 >> 2] = i2;
+ HEAP32[i2 + 24 >> 2] = i5;
+ HEAP32[i2 + 12 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i2;
+ }
+ } while (0);
+ i21 = (HEAP32[7192 >> 2] | 0) + -1 | 0;
+ HEAP32[7192 >> 2] = i21;
+ if ((i21 | 0) == 0) {
+ i2 = 7616 | 0;
+ } else {
+ STACKTOP = i1;
+ return;
+ }
+ while (1) {
+ i2 = HEAP32[i2 >> 2] | 0;
+ if ((i2 | 0) == 0) {
+ break;
+ } else {
+ i2 = i2 + 8 | 0;
+ }
+ }
+ HEAP32[7192 >> 2] = -1;
+ STACKTOP = i1;
+ return;
+}
+function __ZNSt3__127__insertion_sort_incompleteIRPFbRK6b2PairS3_EPS1_EEbT0_S8_T_(i3, i4, i2) {
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ i2 = i2 | 0;
+ var i1 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 32 | 0;
+ i7 = i1 + 12 | 0;
+ i6 = i1;
+ switch ((i4 - i3 | 0) / 12 | 0 | 0) {
+ case 5:
+ {
+ i6 = i3 + 12 | 0;
+ i8 = i3 + 24 | 0;
+ i5 = i3 + 36 | 0;
+ i4 = i4 + -12 | 0;
+ __ZNSt3__17__sort4IRPFbRK6b2PairS3_EPS1_EEjT0_S8_S8_S8_T_(i3, i6, i8, i5, i2) | 0;
+ if (!(FUNCTION_TABLE_iii[HEAP32[i2 >> 2] & 3](i4, i5) | 0)) {
+ i10 = 1;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ HEAP32[i7 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i4 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i4 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i4 + 8 >> 2];
+ HEAP32[i4 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i4 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i4 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ if (!(FUNCTION_TABLE_iii[HEAP32[i2 >> 2] & 3](i5, i8) | 0)) {
+ i10 = 1;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ HEAP32[i7 + 0 >> 2] = HEAP32[i8 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i8 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i8 + 8 >> 2];
+ HEAP32[i8 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i8 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i8 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ if (!(FUNCTION_TABLE_iii[HEAP32[i2 >> 2] & 3](i8, i6) | 0)) {
+ i10 = 1;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ HEAP32[i7 + 0 >> 2] = HEAP32[i6 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i6 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ HEAP32[i6 + 0 >> 2] = HEAP32[i8 + 0 >> 2];
+ HEAP32[i6 + 4 >> 2] = HEAP32[i8 + 4 >> 2];
+ HEAP32[i6 + 8 >> 2] = HEAP32[i8 + 8 >> 2];
+ HEAP32[i8 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i8 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i8 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ if (!(FUNCTION_TABLE_iii[HEAP32[i2 >> 2] & 3](i6, i3) | 0)) {
+ i10 = 1;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ HEAP32[i7 + 0 >> 2] = HEAP32[i3 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i3 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i3 + 8 >> 2];
+ HEAP32[i3 + 0 >> 2] = HEAP32[i6 + 0 >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[i6 + 4 >> 2];
+ HEAP32[i3 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ HEAP32[i6 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i6 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i6 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ i10 = 1;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ case 4:
+ {
+ __ZNSt3__17__sort4IRPFbRK6b2PairS3_EPS1_EEjT0_S8_S8_S8_T_(i3, i3 + 12 | 0, i3 + 24 | 0, i4 + -12 | 0, i2) | 0;
+ i10 = 1;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ case 3:
+ {
+ i5 = i3 + 12 | 0;
+ i4 = i4 + -12 | 0;
+ i10 = FUNCTION_TABLE_iii[HEAP32[i2 >> 2] & 3](i5, i3) | 0;
+ i6 = FUNCTION_TABLE_iii[HEAP32[i2 >> 2] & 3](i4, i5) | 0;
+ if (!i10) {
+ if (!i6) {
+ i10 = 1;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ HEAP32[i7 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i4 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i4 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i4 + 8 >> 2];
+ HEAP32[i4 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i4 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i4 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ if (!(FUNCTION_TABLE_iii[HEAP32[i2 >> 2] & 3](i5, i3) | 0)) {
+ i10 = 1;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ HEAP32[i7 + 0 >> 2] = HEAP32[i3 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i3 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i3 + 8 >> 2];
+ HEAP32[i3 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i3 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ i10 = 1;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ if (i6) {
+ HEAP32[i7 + 0 >> 2] = HEAP32[i3 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i3 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i3 + 8 >> 2];
+ HEAP32[i3 + 0 >> 2] = HEAP32[i4 + 0 >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[i4 + 4 >> 2];
+ HEAP32[i3 + 8 >> 2] = HEAP32[i4 + 8 >> 2];
+ HEAP32[i4 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i4 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i4 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ i10 = 1;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ HEAP32[i7 + 0 >> 2] = HEAP32[i3 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i3 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i3 + 8 >> 2];
+ HEAP32[i3 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i3 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ if (!(FUNCTION_TABLE_iii[HEAP32[i2 >> 2] & 3](i4, i5) | 0)) {
+ i10 = 1;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ HEAP32[i7 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i4 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i4 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i4 + 8 >> 2];
+ HEAP32[i4 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i4 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i4 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ i10 = 1;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ case 2:
+ {
+ i4 = i4 + -12 | 0;
+ if (!(FUNCTION_TABLE_iii[HEAP32[i2 >> 2] & 3](i4, i3) | 0)) {
+ i10 = 1;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ HEAP32[i7 + 0 >> 2] = HEAP32[i3 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i3 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i3 + 8 >> 2];
+ HEAP32[i3 + 0 >> 2] = HEAP32[i4 + 0 >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[i4 + 4 >> 2];
+ HEAP32[i3 + 8 >> 2] = HEAP32[i4 + 8 >> 2];
+ HEAP32[i4 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i4 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i4 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ i10 = 1;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ case 1:
+ case 0:
+ {
+ i10 = 1;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ default:
+ {
+ i9 = i3 + 24 | 0;
+ i10 = i3 + 12 | 0;
+ i11 = FUNCTION_TABLE_iii[HEAP32[i2 >> 2] & 3](i10, i3) | 0;
+ i8 = FUNCTION_TABLE_iii[HEAP32[i2 >> 2] & 3](i9, i10) | 0;
+ do {
+ if (i11) {
+ if (i8) {
+ HEAP32[i7 + 0 >> 2] = HEAP32[i3 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i3 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i3 + 8 >> 2];
+ HEAP32[i3 + 0 >> 2] = HEAP32[i9 + 0 >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[i9 + 4 >> 2];
+ HEAP32[i3 + 8 >> 2] = HEAP32[i9 + 8 >> 2];
+ HEAP32[i9 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i9 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i9 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ break;
+ }
+ HEAP32[i7 + 0 >> 2] = HEAP32[i3 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i3 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i3 + 8 >> 2];
+ HEAP32[i3 + 0 >> 2] = HEAP32[i10 + 0 >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[i10 + 4 >> 2];
+ HEAP32[i3 + 8 >> 2] = HEAP32[i10 + 8 >> 2];
+ HEAP32[i10 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i10 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i10 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ if (FUNCTION_TABLE_iii[HEAP32[i2 >> 2] & 3](i9, i10) | 0) {
+ HEAP32[i7 + 0 >> 2] = HEAP32[i10 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i10 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i10 + 8 >> 2];
+ HEAP32[i10 + 0 >> 2] = HEAP32[i9 + 0 >> 2];
+ HEAP32[i10 + 4 >> 2] = HEAP32[i9 + 4 >> 2];
+ HEAP32[i10 + 8 >> 2] = HEAP32[i9 + 8 >> 2];
+ HEAP32[i9 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i9 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i9 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ }
+ } else {
+ if (i8) {
+ HEAP32[i7 + 0 >> 2] = HEAP32[i10 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i10 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i10 + 8 >> 2];
+ HEAP32[i10 + 0 >> 2] = HEAP32[i9 + 0 >> 2];
+ HEAP32[i10 + 4 >> 2] = HEAP32[i9 + 4 >> 2];
+ HEAP32[i10 + 8 >> 2] = HEAP32[i9 + 8 >> 2];
+ HEAP32[i9 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i9 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i9 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ if (FUNCTION_TABLE_iii[HEAP32[i2 >> 2] & 3](i10, i3) | 0) {
+ HEAP32[i7 + 0 >> 2] = HEAP32[i3 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i3 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i3 + 8 >> 2];
+ HEAP32[i3 + 0 >> 2] = HEAP32[i10 + 0 >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[i10 + 4 >> 2];
+ HEAP32[i3 + 8 >> 2] = HEAP32[i10 + 8 >> 2];
+ HEAP32[i10 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i10 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i10 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ }
+ }
+ }
+ } while (0);
+ i7 = i3 + 36 | 0;
+ if ((i7 | 0) == (i4 | 0)) {
+ i11 = 1;
+ STACKTOP = i1;
+ return i11 | 0;
+ }
+ i8 = 0;
+ while (1) {
+ if (FUNCTION_TABLE_iii[HEAP32[i2 >> 2] & 3](i7, i9) | 0) {
+ HEAP32[i6 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i6 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i6 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ i10 = i7;
+ while (1) {
+ HEAP32[i10 + 0 >> 2] = HEAP32[i9 + 0 >> 2];
+ HEAP32[i10 + 4 >> 2] = HEAP32[i9 + 4 >> 2];
+ HEAP32[i10 + 8 >> 2] = HEAP32[i9 + 8 >> 2];
+ if ((i9 | 0) == (i3 | 0)) {
+ break;
+ }
+ i10 = i9 + -12 | 0;
+ if (FUNCTION_TABLE_iii[HEAP32[i2 >> 2] & 3](i6, i10) | 0) {
+ i11 = i9;
+ i9 = i10;
+ i10 = i11;
+ } else {
+ break;
+ }
+ }
+ HEAP32[i9 + 0 >> 2] = HEAP32[i6 + 0 >> 2];
+ HEAP32[i9 + 4 >> 2] = HEAP32[i6 + 4 >> 2];
+ HEAP32[i9 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ i8 = i8 + 1 | 0;
+ if ((i8 | 0) == 8) {
+ break;
+ }
+ }
+ i9 = i7 + 12 | 0;
+ if ((i9 | 0) == (i4 | 0)) {
+ i2 = 1;
+ i5 = 35;
+ break;
+ } else {
+ i11 = i7;
+ i7 = i9;
+ i9 = i11;
+ }
+ }
+ if ((i5 | 0) == 35) {
+ STACKTOP = i1;
+ return i2 | 0;
+ }
+ i11 = (i7 + 12 | 0) == (i4 | 0);
+ STACKTOP = i1;
+ return i11 | 0;
+ }
+ }
+ return 0;
+}
+function __ZN13b2DynamicTree7BalanceEi(i11, i6) {
+ i11 = i11 | 0;
+ i6 = i6 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, d19 = 0.0, i20 = 0, i21 = 0, d22 = 0.0, d23 = 0.0, d24 = 0.0, d25 = 0.0;
+ i1 = STACKTOP;
+ if ((i6 | 0) == -1) {
+ ___assert_fail(3216, 2944, 382, 3232);
+ }
+ i5 = HEAP32[i11 + 4 >> 2] | 0;
+ i13 = i5 + (i6 * 36 | 0) | 0;
+ i18 = i5 + (i6 * 36 | 0) + 24 | 0;
+ i8 = HEAP32[i18 >> 2] | 0;
+ if ((i8 | 0) == -1) {
+ i21 = i6;
+ STACKTOP = i1;
+ return i21 | 0;
+ }
+ i2 = i5 + (i6 * 36 | 0) + 32 | 0;
+ if ((HEAP32[i2 >> 2] | 0) < 2) {
+ i21 = i6;
+ STACKTOP = i1;
+ return i21 | 0;
+ }
+ i20 = i5 + (i6 * 36 | 0) + 28 | 0;
+ i7 = HEAP32[i20 >> 2] | 0;
+ if (!((i8 | 0) > -1)) {
+ ___assert_fail(3240, 2944, 392, 3232);
+ }
+ i12 = HEAP32[i11 + 12 >> 2] | 0;
+ if ((i8 | 0) >= (i12 | 0)) {
+ ___assert_fail(3240, 2944, 392, 3232);
+ }
+ if (!((i7 | 0) > -1 & (i7 | 0) < (i12 | 0))) {
+ ___assert_fail(3272, 2944, 393, 3232);
+ }
+ i9 = i5 + (i8 * 36 | 0) | 0;
+ i10 = i5 + (i7 * 36 | 0) | 0;
+ i3 = i5 + (i7 * 36 | 0) + 32 | 0;
+ i4 = i5 + (i8 * 36 | 0) + 32 | 0;
+ i14 = (HEAP32[i3 >> 2] | 0) - (HEAP32[i4 >> 2] | 0) | 0;
+ if ((i14 | 0) > 1) {
+ i21 = i5 + (i7 * 36 | 0) + 24 | 0;
+ i14 = HEAP32[i21 >> 2] | 0;
+ i18 = i5 + (i7 * 36 | 0) + 28 | 0;
+ i15 = HEAP32[i18 >> 2] | 0;
+ i16 = i5 + (i14 * 36 | 0) | 0;
+ i17 = i5 + (i15 * 36 | 0) | 0;
+ if (!((i14 | 0) > -1 & (i14 | 0) < (i12 | 0))) {
+ ___assert_fail(3304, 2944, 407, 3232);
+ }
+ if (!((i15 | 0) > -1 & (i15 | 0) < (i12 | 0))) {
+ ___assert_fail(3336, 2944, 408, 3232);
+ }
+ HEAP32[i21 >> 2] = i6;
+ i21 = i5 + (i6 * 36 | 0) + 20 | 0;
+ i12 = i5 + (i7 * 36 | 0) + 20 | 0;
+ HEAP32[i12 >> 2] = HEAP32[i21 >> 2];
+ HEAP32[i21 >> 2] = i7;
+ i12 = HEAP32[i12 >> 2] | 0;
+ do {
+ if (!((i12 | 0) == -1)) {
+ i11 = i5 + (i12 * 36 | 0) + 24 | 0;
+ if ((HEAP32[i11 >> 2] | 0) == (i6 | 0)) {
+ HEAP32[i11 >> 2] = i7;
+ break;
+ }
+ i11 = i5 + (i12 * 36 | 0) + 28 | 0;
+ if ((HEAP32[i11 >> 2] | 0) == (i6 | 0)) {
+ HEAP32[i11 >> 2] = i7;
+ break;
+ } else {
+ ___assert_fail(3368, 2944, 424, 3232);
+ }
+ } else {
+ HEAP32[i11 >> 2] = i7;
+ }
+ } while (0);
+ i11 = i5 + (i14 * 36 | 0) + 32 | 0;
+ i12 = i5 + (i15 * 36 | 0) + 32 | 0;
+ if ((HEAP32[i11 >> 2] | 0) > (HEAP32[i12 >> 2] | 0)) {
+ HEAP32[i18 >> 2] = i14;
+ HEAP32[i20 >> 2] = i15;
+ HEAP32[i5 + (i15 * 36 | 0) + 20 >> 2] = i6;
+ d19 = +HEAPF32[i9 >> 2];
+ d22 = +HEAPF32[i17 >> 2];
+ d19 = d19 < d22 ? d19 : d22;
+ d23 = +HEAPF32[i5 + (i8 * 36 | 0) + 4 >> 2];
+ d22 = +HEAPF32[i5 + (i15 * 36 | 0) + 4 >> 2];
+ d24 = +d19;
+ d23 = +(d23 < d22 ? d23 : d22);
+ i21 = i13;
+ HEAPF32[i21 >> 2] = d24;
+ HEAPF32[i21 + 4 >> 2] = d23;
+ d23 = +HEAPF32[i5 + (i8 * 36 | 0) + 8 >> 2];
+ d24 = +HEAPF32[i5 + (i15 * 36 | 0) + 8 >> 2];
+ d22 = +HEAPF32[i5 + (i8 * 36 | 0) + 12 >> 2];
+ d25 = +HEAPF32[i5 + (i15 * 36 | 0) + 12 >> 2];
+ d23 = +(d23 > d24 ? d23 : d24);
+ d24 = +(d22 > d25 ? d22 : d25);
+ i21 = i5 + (i6 * 36 | 0) + 8 | 0;
+ HEAPF32[i21 >> 2] = d23;
+ HEAPF32[i21 + 4 >> 2] = d24;
+ d24 = +HEAPF32[i16 >> 2];
+ d22 = +HEAPF32[i5 + (i6 * 36 | 0) + 4 >> 2];
+ d23 = +HEAPF32[i5 + (i14 * 36 | 0) + 4 >> 2];
+ d19 = +(d19 < d24 ? d19 : d24);
+ d22 = +(d22 < d23 ? d22 : d23);
+ i21 = i10;
+ HEAPF32[i21 >> 2] = d19;
+ HEAPF32[i21 + 4 >> 2] = d22;
+ d22 = +HEAPF32[i5 + (i6 * 36 | 0) + 8 >> 2];
+ d19 = +HEAPF32[i5 + (i14 * 36 | 0) + 8 >> 2];
+ d23 = +HEAPF32[i5 + (i6 * 36 | 0) + 12 >> 2];
+ d24 = +HEAPF32[i5 + (i14 * 36 | 0) + 12 >> 2];
+ d19 = +(d22 > d19 ? d22 : d19);
+ d25 = +(d23 > d24 ? d23 : d24);
+ i5 = i5 + (i7 * 36 | 0) + 8 | 0;
+ HEAPF32[i5 >> 2] = d19;
+ HEAPF32[i5 + 4 >> 2] = d25;
+ i4 = HEAP32[i4 >> 2] | 0;
+ i5 = HEAP32[i12 >> 2] | 0;
+ i4 = ((i4 | 0) > (i5 | 0) ? i4 : i5) + 1 | 0;
+ HEAP32[i2 >> 2] = i4;
+ i2 = HEAP32[i11 >> 2] | 0;
+ i2 = (i4 | 0) > (i2 | 0) ? i4 : i2;
+ } else {
+ HEAP32[i18 >> 2] = i15;
+ HEAP32[i20 >> 2] = i14;
+ HEAP32[i5 + (i14 * 36 | 0) + 20 >> 2] = i6;
+ d19 = +HEAPF32[i9 >> 2];
+ d22 = +HEAPF32[i16 >> 2];
+ d19 = d19 < d22 ? d19 : d22;
+ d23 = +HEAPF32[i5 + (i8 * 36 | 0) + 4 >> 2];
+ d24 = +HEAPF32[i5 + (i14 * 36 | 0) + 4 >> 2];
+ d22 = +d19;
+ d23 = +(d23 < d24 ? d23 : d24);
+ i21 = i13;
+ HEAPF32[i21 >> 2] = d22;
+ HEAPF32[i21 + 4 >> 2] = d23;
+ d23 = +HEAPF32[i5 + (i8 * 36 | 0) + 8 >> 2];
+ d24 = +HEAPF32[i5 + (i14 * 36 | 0) + 8 >> 2];
+ d22 = +HEAPF32[i5 + (i8 * 36 | 0) + 12 >> 2];
+ d25 = +HEAPF32[i5 + (i14 * 36 | 0) + 12 >> 2];
+ d23 = +(d23 > d24 ? d23 : d24);
+ d24 = +(d22 > d25 ? d22 : d25);
+ i21 = i5 + (i6 * 36 | 0) + 8 | 0;
+ HEAPF32[i21 >> 2] = d23;
+ HEAPF32[i21 + 4 >> 2] = d24;
+ d24 = +HEAPF32[i17 >> 2];
+ d22 = +HEAPF32[i5 + (i6 * 36 | 0) + 4 >> 2];
+ d23 = +HEAPF32[i5 + (i15 * 36 | 0) + 4 >> 2];
+ d19 = +(d19 < d24 ? d19 : d24);
+ d23 = +(d22 < d23 ? d22 : d23);
+ i21 = i10;
+ HEAPF32[i21 >> 2] = d19;
+ HEAPF32[i21 + 4 >> 2] = d23;
+ d23 = +HEAPF32[i5 + (i6 * 36 | 0) + 8 >> 2];
+ d19 = +HEAPF32[i5 + (i15 * 36 | 0) + 8 >> 2];
+ d22 = +HEAPF32[i5 + (i6 * 36 | 0) + 12 >> 2];
+ d24 = +HEAPF32[i5 + (i15 * 36 | 0) + 12 >> 2];
+ d19 = +(d23 > d19 ? d23 : d19);
+ d25 = +(d22 > d24 ? d22 : d24);
+ i5 = i5 + (i7 * 36 | 0) + 8 | 0;
+ HEAPF32[i5 >> 2] = d19;
+ HEAPF32[i5 + 4 >> 2] = d25;
+ i4 = HEAP32[i4 >> 2] | 0;
+ i5 = HEAP32[i11 >> 2] | 0;
+ i4 = ((i4 | 0) > (i5 | 0) ? i4 : i5) + 1 | 0;
+ HEAP32[i2 >> 2] = i4;
+ i2 = HEAP32[i12 >> 2] | 0;
+ i2 = (i4 | 0) > (i2 | 0) ? i4 : i2;
+ }
+ HEAP32[i3 >> 2] = i2 + 1;
+ i21 = i7;
+ STACKTOP = i1;
+ return i21 | 0;
+ }
+ if (!((i14 | 0) < -1)) {
+ i21 = i6;
+ STACKTOP = i1;
+ return i21 | 0;
+ }
+ i21 = i5 + (i8 * 36 | 0) + 24 | 0;
+ i14 = HEAP32[i21 >> 2] | 0;
+ i20 = i5 + (i8 * 36 | 0) + 28 | 0;
+ i15 = HEAP32[i20 >> 2] | 0;
+ i17 = i5 + (i14 * 36 | 0) | 0;
+ i16 = i5 + (i15 * 36 | 0) | 0;
+ if (!((i14 | 0) > -1 & (i14 | 0) < (i12 | 0))) {
+ ___assert_fail(3400, 2944, 467, 3232);
+ }
+ if (!((i15 | 0) > -1 & (i15 | 0) < (i12 | 0))) {
+ ___assert_fail(3432, 2944, 468, 3232);
+ }
+ HEAP32[i21 >> 2] = i6;
+ i21 = i5 + (i6 * 36 | 0) + 20 | 0;
+ i12 = i5 + (i8 * 36 | 0) + 20 | 0;
+ HEAP32[i12 >> 2] = HEAP32[i21 >> 2];
+ HEAP32[i21 >> 2] = i8;
+ i12 = HEAP32[i12 >> 2] | 0;
+ do {
+ if (!((i12 | 0) == -1)) {
+ i11 = i5 + (i12 * 36 | 0) + 24 | 0;
+ if ((HEAP32[i11 >> 2] | 0) == (i6 | 0)) {
+ HEAP32[i11 >> 2] = i8;
+ break;
+ }
+ i11 = i5 + (i12 * 36 | 0) + 28 | 0;
+ if ((HEAP32[i11 >> 2] | 0) == (i6 | 0)) {
+ HEAP32[i11 >> 2] = i8;
+ break;
+ } else {
+ ___assert_fail(3464, 2944, 484, 3232);
+ }
+ } else {
+ HEAP32[i11 >> 2] = i8;
+ }
+ } while (0);
+ i12 = i5 + (i14 * 36 | 0) + 32 | 0;
+ i11 = i5 + (i15 * 36 | 0) + 32 | 0;
+ if ((HEAP32[i12 >> 2] | 0) > (HEAP32[i11 >> 2] | 0)) {
+ HEAP32[i20 >> 2] = i14;
+ HEAP32[i18 >> 2] = i15;
+ HEAP32[i5 + (i15 * 36 | 0) + 20 >> 2] = i6;
+ d19 = +HEAPF32[i10 >> 2];
+ d22 = +HEAPF32[i16 >> 2];
+ d19 = d19 < d22 ? d19 : d22;
+ d23 = +HEAPF32[i5 + (i7 * 36 | 0) + 4 >> 2];
+ d22 = +HEAPF32[i5 + (i15 * 36 | 0) + 4 >> 2];
+ d24 = +d19;
+ d23 = +(d23 < d22 ? d23 : d22);
+ i21 = i13;
+ HEAPF32[i21 >> 2] = d24;
+ HEAPF32[i21 + 4 >> 2] = d23;
+ d23 = +HEAPF32[i5 + (i7 * 36 | 0) + 8 >> 2];
+ d22 = +HEAPF32[i5 + (i15 * 36 | 0) + 8 >> 2];
+ d24 = +HEAPF32[i5 + (i7 * 36 | 0) + 12 >> 2];
+ d25 = +HEAPF32[i5 + (i15 * 36 | 0) + 12 >> 2];
+ d22 = +(d23 > d22 ? d23 : d22);
+ d24 = +(d24 > d25 ? d24 : d25);
+ i21 = i5 + (i6 * 36 | 0) + 8 | 0;
+ HEAPF32[i21 >> 2] = d22;
+ HEAPF32[i21 + 4 >> 2] = d24;
+ d24 = +HEAPF32[i17 >> 2];
+ d23 = +HEAPF32[i5 + (i6 * 36 | 0) + 4 >> 2];
+ d22 = +HEAPF32[i5 + (i14 * 36 | 0) + 4 >> 2];
+ d19 = +(d19 < d24 ? d19 : d24);
+ d22 = +(d23 < d22 ? d23 : d22);
+ i21 = i9;
+ HEAPF32[i21 >> 2] = d19;
+ HEAPF32[i21 + 4 >> 2] = d22;
+ d22 = +HEAPF32[i5 + (i6 * 36 | 0) + 8 >> 2];
+ d23 = +HEAPF32[i5 + (i14 * 36 | 0) + 8 >> 2];
+ d19 = +HEAPF32[i5 + (i6 * 36 | 0) + 12 >> 2];
+ d24 = +HEAPF32[i5 + (i14 * 36 | 0) + 12 >> 2];
+ d22 = +(d22 > d23 ? d22 : d23);
+ d25 = +(d19 > d24 ? d19 : d24);
+ i5 = i5 + (i8 * 36 | 0) + 8 | 0;
+ HEAPF32[i5 >> 2] = d22;
+ HEAPF32[i5 + 4 >> 2] = d25;
+ i3 = HEAP32[i3 >> 2] | 0;
+ i5 = HEAP32[i11 >> 2] | 0;
+ i3 = ((i3 | 0) > (i5 | 0) ? i3 : i5) + 1 | 0;
+ HEAP32[i2 >> 2] = i3;
+ i2 = HEAP32[i12 >> 2] | 0;
+ i2 = (i3 | 0) > (i2 | 0) ? i3 : i2;
+ } else {
+ HEAP32[i20 >> 2] = i15;
+ HEAP32[i18 >> 2] = i14;
+ HEAP32[i5 + (i14 * 36 | 0) + 20 >> 2] = i6;
+ d19 = +HEAPF32[i10 >> 2];
+ d22 = +HEAPF32[i17 >> 2];
+ d19 = d19 < d22 ? d19 : d22;
+ d23 = +HEAPF32[i5 + (i7 * 36 | 0) + 4 >> 2];
+ d24 = +HEAPF32[i5 + (i14 * 36 | 0) + 4 >> 2];
+ d22 = +d19;
+ d24 = +(d23 < d24 ? d23 : d24);
+ i21 = i13;
+ HEAPF32[i21 >> 2] = d22;
+ HEAPF32[i21 + 4 >> 2] = d24;
+ d24 = +HEAPF32[i5 + (i7 * 36 | 0) + 8 >> 2];
+ d23 = +HEAPF32[i5 + (i14 * 36 | 0) + 8 >> 2];
+ d22 = +HEAPF32[i5 + (i7 * 36 | 0) + 12 >> 2];
+ d25 = +HEAPF32[i5 + (i14 * 36 | 0) + 12 >> 2];
+ d23 = +(d24 > d23 ? d24 : d23);
+ d24 = +(d22 > d25 ? d22 : d25);
+ i21 = i5 + (i6 * 36 | 0) + 8 | 0;
+ HEAPF32[i21 >> 2] = d23;
+ HEAPF32[i21 + 4 >> 2] = d24;
+ d24 = +HEAPF32[i16 >> 2];
+ d23 = +HEAPF32[i5 + (i6 * 36 | 0) + 4 >> 2];
+ d22 = +HEAPF32[i5 + (i15 * 36 | 0) + 4 >> 2];
+ d19 = +(d19 < d24 ? d19 : d24);
+ d22 = +(d23 < d22 ? d23 : d22);
+ i21 = i9;
+ HEAPF32[i21 >> 2] = d19;
+ HEAPF32[i21 + 4 >> 2] = d22;
+ d22 = +HEAPF32[i5 + (i6 * 36 | 0) + 8 >> 2];
+ d23 = +HEAPF32[i5 + (i15 * 36 | 0) + 8 >> 2];
+ d19 = +HEAPF32[i5 + (i6 * 36 | 0) + 12 >> 2];
+ d24 = +HEAPF32[i5 + (i15 * 36 | 0) + 12 >> 2];
+ d22 = +(d22 > d23 ? d22 : d23);
+ d25 = +(d19 > d24 ? d19 : d24);
+ i5 = i5 + (i8 * 36 | 0) + 8 | 0;
+ HEAPF32[i5 >> 2] = d22;
+ HEAPF32[i5 + 4 >> 2] = d25;
+ i3 = HEAP32[i3 >> 2] | 0;
+ i5 = HEAP32[i12 >> 2] | 0;
+ i3 = ((i3 | 0) > (i5 | 0) ? i3 : i5) + 1 | 0;
+ HEAP32[i2 >> 2] = i3;
+ i2 = HEAP32[i11 >> 2] | 0;
+ i2 = (i3 | 0) > (i2 | 0) ? i3 : i2;
+ }
+ HEAP32[i4 >> 2] = i2 + 1;
+ i21 = i8;
+ STACKTOP = i1;
+ return i21 | 0;
+}
+function __Z10b2DistanceP16b2DistanceOutputP14b2SimplexCachePK15b2DistanceInput(i2, i5, i3) {
+ i2 = i2 | 0;
+ i5 = i5 | 0;
+ i3 = i3 | 0;
+ var i1 = 0, i4 = 0, i6 = 0, d7 = 0.0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, d16 = 0.0, d17 = 0.0, d18 = 0.0, d19 = 0.0, i20 = 0, d21 = 0.0, d22 = 0.0, i23 = 0, d24 = 0.0, d25 = 0.0, i26 = 0, i27 = 0, i28 = 0, i29 = 0, i30 = 0, i31 = 0, i32 = 0, i33 = 0, i34 = 0, i35 = 0, d36 = 0.0, d37 = 0.0, d38 = 0.0, i39 = 0, i40 = 0, i41 = 0, i42 = 0, d43 = 0.0, d44 = 0.0, d45 = 0.0, i46 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 176 | 0;
+ i11 = i1 + 152 | 0;
+ i10 = i1 + 136 | 0;
+ i4 = i1 + 24 | 0;
+ i14 = i1 + 12 | 0;
+ i15 = i1;
+ HEAP32[652] = (HEAP32[652] | 0) + 1;
+ i9 = i3 + 28 | 0;
+ i31 = i3 + 56 | 0;
+ HEAP32[i11 + 0 >> 2] = HEAP32[i31 + 0 >> 2];
+ HEAP32[i11 + 4 >> 2] = HEAP32[i31 + 4 >> 2];
+ HEAP32[i11 + 8 >> 2] = HEAP32[i31 + 8 >> 2];
+ HEAP32[i11 + 12 >> 2] = HEAP32[i31 + 12 >> 2];
+ i31 = i3 + 72 | 0;
+ HEAP32[i10 + 0 >> 2] = HEAP32[i31 + 0 >> 2];
+ HEAP32[i10 + 4 >> 2] = HEAP32[i31 + 4 >> 2];
+ HEAP32[i10 + 8 >> 2] = HEAP32[i31 + 8 >> 2];
+ HEAP32[i10 + 12 >> 2] = HEAP32[i31 + 12 >> 2];
+ __ZN9b2Simplex9ReadCacheEPK14b2SimplexCachePK15b2DistanceProxyRK11b2TransformS5_S8_(i4, i5, i3, i11, i9, i10);
+ i9 = i4 + 108 | 0;
+ i31 = HEAP32[i9 >> 2] | 0;
+ if ((i31 | 0) == 3 | (i31 | 0) == 2 | (i31 | 0) == 1) {
+ i8 = i4 + 16 | 0;
+ i6 = i4 + 20 | 0;
+ d17 = +HEAPF32[i11 + 12 >> 2];
+ d18 = +HEAPF32[i11 + 8 >> 2];
+ i13 = i3 + 16 | 0;
+ i12 = i3 + 20 | 0;
+ d16 = +HEAPF32[i11 >> 2];
+ d21 = +HEAPF32[i11 + 4 >> 2];
+ d19 = +HEAPF32[i10 + 12 >> 2];
+ d22 = +HEAPF32[i10 + 8 >> 2];
+ i23 = i3 + 44 | 0;
+ i20 = i3 + 48 | 0;
+ d24 = +HEAPF32[i10 >> 2];
+ d25 = +HEAPF32[i10 + 4 >> 2];
+ i11 = i4 + 52 | 0;
+ i10 = i4 + 56 | 0;
+ i30 = i4 + 16 | 0;
+ i27 = i4 + 36 | 0;
+ i26 = i4 + 52 | 0;
+ i29 = i4 + 24 | 0;
+ i28 = i4 + 60 | 0;
+ i33 = 0;
+ L3 : while (1) {
+ i32 = (i31 | 0) > 0;
+ if (i32) {
+ i34 = 0;
+ do {
+ HEAP32[i14 + (i34 << 2) >> 2] = HEAP32[i4 + (i34 * 36 | 0) + 28 >> 2];
+ HEAP32[i15 + (i34 << 2) >> 2] = HEAP32[i4 + (i34 * 36 | 0) + 32 >> 2];
+ i34 = i34 + 1 | 0;
+ } while ((i34 | 0) != (i31 | 0));
+ }
+ do {
+ if ((i31 | 0) == 2) {
+ i46 = i30;
+ d45 = +HEAPF32[i46 >> 2];
+ d36 = +HEAPF32[i46 + 4 >> 2];
+ i46 = i26;
+ d38 = +HEAPF32[i46 >> 2];
+ d37 = +HEAPF32[i46 + 4 >> 2];
+ d43 = d38 - d45;
+ d44 = d37 - d36;
+ d36 = d45 * d43 + d36 * d44;
+ if (d36 >= -0.0) {
+ HEAPF32[i29 >> 2] = 1.0;
+ HEAP32[i9 >> 2] = 1;
+ i35 = 17;
+ break;
+ }
+ d37 = d38 * d43 + d37 * d44;
+ if (!(d37 <= 0.0)) {
+ d45 = 1.0 / (d37 - d36);
+ HEAPF32[i29 >> 2] = d37 * d45;
+ HEAPF32[i28 >> 2] = -(d36 * d45);
+ HEAP32[i9 >> 2] = 2;
+ i35 = 18;
+ break;
+ } else {
+ HEAPF32[i28 >> 2] = 1.0;
+ HEAP32[i9 >> 2] = 1;
+ i34 = i4 + 0 | 0;
+ i39 = i27 + 0 | 0;
+ i35 = i34 + 36 | 0;
+ do {
+ HEAP32[i34 >> 2] = HEAP32[i39 >> 2];
+ i34 = i34 + 4 | 0;
+ i39 = i39 + 4 | 0;
+ } while ((i34 | 0) < (i35 | 0));
+ i35 = 17;
+ break;
+ }
+ } else if ((i31 | 0) == 3) {
+ __ZN9b2Simplex6Solve3Ev(i4);
+ i34 = HEAP32[i9 >> 2] | 0;
+ if ((i34 | 0) == 1) {
+ i35 = 17;
+ } else if ((i34 | 0) == 0) {
+ i35 = 15;
+ break L3;
+ } else if ((i34 | 0) == 2) {
+ i35 = 18;
+ } else if ((i34 | 0) == 3) {
+ i35 = 42;
+ break L3;
+ } else {
+ i35 = 16;
+ break L3;
+ }
+ } else if ((i31 | 0) == 1) {
+ i35 = 17;
+ } else {
+ i35 = 13;
+ break L3;
+ }
+ } while (0);
+ do {
+ if ((i35 | 0) == 17) {
+ d36 = -+HEAPF32[i8 >> 2];
+ d37 = -+HEAPF32[i6 >> 2];
+ i34 = 1;
+ } else if ((i35 | 0) == 18) {
+ d44 = +HEAPF32[i8 >> 2];
+ d37 = +HEAPF32[i11 >> 2] - d44;
+ d45 = +HEAPF32[i6 >> 2];
+ d36 = +HEAPF32[i10 >> 2] - d45;
+ if (d44 * d36 - d37 * d45 > 0.0) {
+ d36 = -d36;
+ i34 = 2;
+ break;
+ } else {
+ d37 = -d37;
+ i34 = 2;
+ break;
+ }
+ }
+ } while (0);
+ if (d37 * d37 + d36 * d36 < 1.4210854715202004e-14) {
+ i35 = 42;
+ break;
+ }
+ i39 = i4 + (i34 * 36 | 0) | 0;
+ d44 = -d36;
+ d45 = -d37;
+ d43 = d17 * d44 + d18 * d45;
+ d44 = d17 * d45 - d18 * d44;
+ i40 = HEAP32[i13 >> 2] | 0;
+ i41 = HEAP32[i12 >> 2] | 0;
+ if ((i41 | 0) > 1) {
+ i42 = 0;
+ d45 = d44 * +HEAPF32[i40 + 4 >> 2] + d43 * +HEAPF32[i40 >> 2];
+ i46 = 1;
+ while (1) {
+ d38 = d43 * +HEAPF32[i40 + (i46 << 3) >> 2] + d44 * +HEAPF32[i40 + (i46 << 3) + 4 >> 2];
+ i35 = d38 > d45;
+ i42 = i35 ? i46 : i42;
+ i46 = i46 + 1 | 0;
+ if ((i46 | 0) == (i41 | 0)) {
+ break;
+ } else {
+ d45 = i35 ? d38 : d45;
+ }
+ }
+ i35 = i4 + (i34 * 36 | 0) + 28 | 0;
+ HEAP32[i35 >> 2] = i42;
+ if (!((i42 | 0) > -1)) {
+ i35 = 28;
+ break;
+ }
+ } else {
+ i35 = i4 + (i34 * 36 | 0) + 28 | 0;
+ HEAP32[i35 >> 2] = 0;
+ i42 = 0;
+ }
+ if ((i41 | 0) <= (i42 | 0)) {
+ i35 = 28;
+ break;
+ }
+ d45 = +HEAPF32[i40 + (i42 << 3) >> 2];
+ d43 = +HEAPF32[i40 + (i42 << 3) + 4 >> 2];
+ d38 = d16 + (d17 * d45 - d18 * d43);
+ d44 = +d38;
+ d43 = +(d45 * d18 + d17 * d43 + d21);
+ i40 = i39;
+ HEAPF32[i40 >> 2] = d44;
+ HEAPF32[i40 + 4 >> 2] = d43;
+ d43 = d36 * d19 + d37 * d22;
+ d44 = d37 * d19 - d36 * d22;
+ i40 = HEAP32[i23 >> 2] | 0;
+ i39 = HEAP32[i20 >> 2] | 0;
+ if ((i39 | 0) > 1) {
+ i41 = 0;
+ d37 = d44 * +HEAPF32[i40 + 4 >> 2] + d43 * +HEAPF32[i40 >> 2];
+ i42 = 1;
+ while (1) {
+ d36 = d43 * +HEAPF32[i40 + (i42 << 3) >> 2] + d44 * +HEAPF32[i40 + (i42 << 3) + 4 >> 2];
+ i46 = d36 > d37;
+ i41 = i46 ? i42 : i41;
+ i42 = i42 + 1 | 0;
+ if ((i42 | 0) == (i39 | 0)) {
+ break;
+ } else {
+ d37 = i46 ? d36 : d37;
+ }
+ }
+ i42 = i4 + (i34 * 36 | 0) + 32 | 0;
+ HEAP32[i42 >> 2] = i41;
+ if (!((i41 | 0) > -1)) {
+ i35 = 35;
+ break;
+ }
+ } else {
+ i42 = i4 + (i34 * 36 | 0) + 32 | 0;
+ HEAP32[i42 >> 2] = 0;
+ i41 = 0;
+ }
+ if ((i39 | 0) <= (i41 | 0)) {
+ i35 = 35;
+ break;
+ }
+ d37 = +HEAPF32[i40 + (i41 << 3) >> 2];
+ d45 = +HEAPF32[i40 + (i41 << 3) + 4 >> 2];
+ d44 = d24 + (d19 * d37 - d22 * d45);
+ d43 = +d44;
+ d45 = +(d37 * d22 + d19 * d45 + d25);
+ i46 = i4 + (i34 * 36 | 0) + 8 | 0;
+ HEAPF32[i46 >> 2] = d43;
+ HEAPF32[i46 + 4 >> 2] = d45;
+ d44 = +(d44 - d38);
+ d45 = +(+HEAPF32[i4 + (i34 * 36 | 0) + 12 >> 2] - +HEAPF32[i4 + (i34 * 36 | 0) + 4 >> 2]);
+ i46 = i4 + (i34 * 36 | 0) + 16 | 0;
+ HEAPF32[i46 >> 2] = d44;
+ HEAPF32[i46 + 4 >> 2] = d45;
+ i33 = i33 + 1 | 0;
+ HEAP32[654] = (HEAP32[654] | 0) + 1;
+ if (i32) {
+ i34 = HEAP32[i35 >> 2] | 0;
+ i32 = 0;
+ do {
+ if ((i34 | 0) == (HEAP32[i14 + (i32 << 2) >> 2] | 0) ? (HEAP32[i42 >> 2] | 0) == (HEAP32[i15 + (i32 << 2) >> 2] | 0) : 0) {
+ i35 = 42;
+ break L3;
+ }
+ i32 = i32 + 1 | 0;
+ } while ((i32 | 0) < (i31 | 0));
+ }
+ i31 = (HEAP32[i9 >> 2] | 0) + 1 | 0;
+ HEAP32[i9 >> 2] = i31;
+ if ((i33 | 0) >= 20) {
+ i35 = 42;
+ break;
+ }
+ }
+ if ((i35 | 0) == 13) {
+ ___assert_fail(2712, 2672, 498, 2720);
+ } else if ((i35 | 0) == 15) {
+ ___assert_fail(2712, 2672, 194, 2856);
+ } else if ((i35 | 0) == 16) {
+ ___assert_fail(2712, 2672, 207, 2856);
+ } else if ((i35 | 0) == 28) {
+ ___assert_fail(2776, 2808, 103, 2840);
+ } else if ((i35 | 0) == 35) {
+ ___assert_fail(2776, 2808, 103, 2840);
+ } else if ((i35 | 0) == 42) {
+ i12 = HEAP32[656] | 0;
+ HEAP32[656] = (i12 | 0) > (i33 | 0) ? i12 : i33;
+ i14 = i2 + 8 | 0;
+ __ZNK9b2Simplex16GetWitnessPointsEP6b2Vec2S1_(i4, i2, i14);
+ d44 = +HEAPF32[i2 >> 2] - +HEAPF32[i14 >> 2];
+ i13 = i2 + 4 | 0;
+ i12 = i2 + 12 | 0;
+ d45 = +HEAPF32[i13 >> 2] - +HEAPF32[i12 >> 2];
+ i15 = i2 + 16 | 0;
+ HEAPF32[i15 >> 2] = +Math_sqrt(+(d44 * d44 + d45 * d45));
+ HEAP32[i2 + 20 >> 2] = i33;
+ i9 = HEAP32[i9 >> 2] | 0;
+ if ((i9 | 0) == 2) {
+ d45 = +HEAPF32[i8 >> 2] - +HEAPF32[i11 >> 2];
+ d7 = +HEAPF32[i6 >> 2] - +HEAPF32[i10 >> 2];
+ d7 = +Math_sqrt(+(d45 * d45 + d7 * d7));
+ } else if ((i9 | 0) == 3) {
+ d7 = +HEAPF32[i8 >> 2];
+ d45 = +HEAPF32[i6 >> 2];
+ d7 = (+HEAPF32[i11 >> 2] - d7) * (+HEAPF32[i4 + 92 >> 2] - d45) - (+HEAPF32[i10 >> 2] - d45) * (+HEAPF32[i4 + 88 >> 2] - d7);
+ } else if ((i9 | 0) == 1) {
+ d7 = 0.0;
+ } else if ((i9 | 0) == 0) {
+ ___assert_fail(2712, 2672, 246, 2736);
+ } else {
+ ___assert_fail(2712, 2672, 259, 2736);
+ }
+ HEAPF32[i5 >> 2] = d7;
+ HEAP16[i5 + 4 >> 1] = i9;
+ i6 = 0;
+ do {
+ HEAP8[i5 + i6 + 6 | 0] = HEAP32[i4 + (i6 * 36 | 0) + 28 >> 2];
+ HEAP8[i5 + i6 + 9 | 0] = HEAP32[i4 + (i6 * 36 | 0) + 32 >> 2];
+ i6 = i6 + 1 | 0;
+ } while ((i6 | 0) < (i9 | 0));
+ if ((HEAP8[i3 + 88 | 0] | 0) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ d7 = +HEAPF32[i3 + 24 >> 2];
+ d16 = +HEAPF32[i3 + 52 >> 2];
+ d18 = +HEAPF32[i15 >> 2];
+ d17 = d7 + d16;
+ if (!(d18 > d17 & d18 > 1.1920928955078125e-7)) {
+ d44 = +((+HEAPF32[i2 >> 2] + +HEAPF32[i14 >> 2]) * .5);
+ d45 = +((+HEAPF32[i13 >> 2] + +HEAPF32[i12 >> 2]) * .5);
+ i46 = i2;
+ HEAPF32[i46 >> 2] = d44;
+ HEAPF32[i46 + 4 >> 2] = d45;
+ i46 = i14;
+ HEAPF32[i46 >> 2] = d44;
+ HEAPF32[i46 + 4 >> 2] = d45;
+ HEAPF32[i15 >> 2] = 0.0;
+ STACKTOP = i1;
+ return;
+ }
+ HEAPF32[i15 >> 2] = d18 - d17;
+ d18 = +HEAPF32[i14 >> 2];
+ d21 = +HEAPF32[i2 >> 2];
+ d24 = d18 - d21;
+ d17 = +HEAPF32[i12 >> 2];
+ d19 = +HEAPF32[i13 >> 2];
+ d22 = d17 - d19;
+ d25 = +Math_sqrt(+(d24 * d24 + d22 * d22));
+ if (!(d25 < 1.1920928955078125e-7)) {
+ d45 = 1.0 / d25;
+ d24 = d24 * d45;
+ d22 = d22 * d45;
+ }
+ HEAPF32[i2 >> 2] = d7 * d24 + d21;
+ HEAPF32[i13 >> 2] = d7 * d22 + d19;
+ HEAPF32[i14 >> 2] = d18 - d16 * d24;
+ HEAPF32[i12 >> 2] = d17 - d16 * d22;
+ STACKTOP = i1;
+ return;
+ }
+ } else if ((i31 | 0) == 0) {
+ ___assert_fail(2712, 2672, 194, 2856);
+ } else {
+ ___assert_fail(2712, 2672, 207, 2856);
+ }
+}
+function __ZN8b2Island5SolveEP9b2ProfileRK10b2TimeStepRK6b2Vec2b(i4, i8, i11, i17, i7) {
+ i4 = i4 | 0;
+ i8 = i8 | 0;
+ i11 = i11 | 0;
+ i17 = i17 | 0;
+ i7 = i7 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, d5 = 0.0, i6 = 0, i9 = 0, i10 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i18 = 0, i19 = 0, i20 = 0, d21 = 0.0, i22 = 0, d23 = 0.0, d24 = 0.0, d25 = 0.0, d26 = 0.0, d27 = 0.0, d28 = 0.0, d29 = 0.0, i30 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 160 | 0;
+ i6 = i3 + 128 | 0;
+ i9 = i3 + 148 | 0;
+ i10 = i3 + 96 | 0;
+ i16 = i3 + 52 | 0;
+ i2 = i3;
+ __ZN7b2TimerC2Ev(i9);
+ d5 = +HEAPF32[i11 >> 2];
+ i1 = i4 + 28 | 0;
+ if ((HEAP32[i1 >> 2] | 0) > 0) {
+ i13 = i4 + 8 | 0;
+ i12 = i17 + 4 | 0;
+ i15 = i4 + 20 | 0;
+ i14 = i4 + 24 | 0;
+ i19 = 0;
+ do {
+ i22 = HEAP32[(HEAP32[i13 >> 2] | 0) + (i19 << 2) >> 2] | 0;
+ i18 = i22 + 44 | 0;
+ i20 = HEAP32[i18 >> 2] | 0;
+ i18 = HEAP32[i18 + 4 >> 2] | 0;
+ d21 = +HEAPF32[i22 + 56 >> 2];
+ i30 = i22 + 64 | 0;
+ d27 = +HEAPF32[i30 >> 2];
+ d24 = +HEAPF32[i30 + 4 >> 2];
+ d23 = +HEAPF32[i22 + 72 >> 2];
+ i30 = i22 + 36 | 0;
+ HEAP32[i30 >> 2] = i20;
+ HEAP32[i30 + 4 >> 2] = i18;
+ HEAPF32[i22 + 52 >> 2] = d21;
+ if ((HEAP32[i22 >> 2] | 0) == 2) {
+ d25 = +HEAPF32[i22 + 140 >> 2];
+ d26 = +HEAPF32[i22 + 120 >> 2];
+ d28 = 1.0 - d5 * +HEAPF32[i22 + 132 >> 2];
+ d28 = d28 < 1.0 ? d28 : 1.0;
+ d28 = d28 < 0.0 ? 0.0 : d28;
+ d29 = 1.0 - d5 * +HEAPF32[i22 + 136 >> 2];
+ d29 = d29 < 1.0 ? d29 : 1.0;
+ d27 = (d27 + d5 * (d25 * +HEAPF32[i17 >> 2] + d26 * +HEAPF32[i22 + 76 >> 2])) * d28;
+ d24 = (d24 + d5 * (d25 * +HEAPF32[i12 >> 2] + d26 * +HEAPF32[i22 + 80 >> 2])) * d28;
+ d23 = (d23 + d5 * +HEAPF32[i22 + 128 >> 2] * +HEAPF32[i22 + 84 >> 2]) * (d29 < 0.0 ? 0.0 : d29);
+ }
+ i30 = (HEAP32[i15 >> 2] | 0) + (i19 * 12 | 0) | 0;
+ HEAP32[i30 >> 2] = i20;
+ HEAP32[i30 + 4 >> 2] = i18;
+ HEAPF32[(HEAP32[i15 >> 2] | 0) + (i19 * 12 | 0) + 8 >> 2] = d21;
+ d28 = +d27;
+ d29 = +d24;
+ i30 = (HEAP32[i14 >> 2] | 0) + (i19 * 12 | 0) | 0;
+ HEAPF32[i30 >> 2] = d28;
+ HEAPF32[i30 + 4 >> 2] = d29;
+ HEAPF32[(HEAP32[i14 >> 2] | 0) + (i19 * 12 | 0) + 8 >> 2] = d23;
+ i19 = i19 + 1 | 0;
+ } while ((i19 | 0) < (HEAP32[i1 >> 2] | 0));
+ } else {
+ i14 = i4 + 24 | 0;
+ i15 = i4 + 20 | 0;
+ }
+ HEAP32[i10 + 0 >> 2] = HEAP32[i11 + 0 >> 2];
+ HEAP32[i10 + 4 >> 2] = HEAP32[i11 + 4 >> 2];
+ HEAP32[i10 + 8 >> 2] = HEAP32[i11 + 8 >> 2];
+ HEAP32[i10 + 12 >> 2] = HEAP32[i11 + 12 >> 2];
+ HEAP32[i10 + 16 >> 2] = HEAP32[i11 + 16 >> 2];
+ HEAP32[i10 + 20 >> 2] = HEAP32[i11 + 20 >> 2];
+ i22 = HEAP32[i15 >> 2] | 0;
+ HEAP32[i10 + 24 >> 2] = i22;
+ i30 = HEAP32[i14 >> 2] | 0;
+ HEAP32[i10 + 28 >> 2] = i30;
+ HEAP32[i16 + 0 >> 2] = HEAP32[i11 + 0 >> 2];
+ HEAP32[i16 + 4 >> 2] = HEAP32[i11 + 4 >> 2];
+ HEAP32[i16 + 8 >> 2] = HEAP32[i11 + 8 >> 2];
+ HEAP32[i16 + 12 >> 2] = HEAP32[i11 + 12 >> 2];
+ HEAP32[i16 + 16 >> 2] = HEAP32[i11 + 16 >> 2];
+ HEAP32[i16 + 20 >> 2] = HEAP32[i11 + 20 >> 2];
+ i13 = i4 + 12 | 0;
+ HEAP32[i16 + 24 >> 2] = HEAP32[i13 >> 2];
+ i12 = i4 + 36 | 0;
+ HEAP32[i16 + 28 >> 2] = HEAP32[i12 >> 2];
+ HEAP32[i16 + 32 >> 2] = i22;
+ HEAP32[i16 + 36 >> 2] = i30;
+ HEAP32[i16 + 40 >> 2] = HEAP32[i4 >> 2];
+ __ZN15b2ContactSolverC2EP18b2ContactSolverDef(i2, i16);
+ __ZN15b2ContactSolver29InitializeVelocityConstraintsEv(i2);
+ if ((HEAP8[i11 + 20 | 0] | 0) != 0) {
+ __ZN15b2ContactSolver9WarmStartEv(i2);
+ }
+ i16 = i4 + 32 | 0;
+ if ((HEAP32[i16 >> 2] | 0) > 0) {
+ i18 = i4 + 16 | 0;
+ i17 = 0;
+ do {
+ i30 = HEAP32[(HEAP32[i18 >> 2] | 0) + (i17 << 2) >> 2] | 0;
+ FUNCTION_TABLE_vii[HEAP32[(HEAP32[i30 >> 2] | 0) + 28 >> 2] & 15](i30, i10);
+ i17 = i17 + 1 | 0;
+ } while ((i17 | 0) < (HEAP32[i16 >> 2] | 0));
+ }
+ HEAPF32[i8 + 12 >> 2] = +__ZNK7b2Timer15GetMillisecondsEv(i9);
+ i17 = i11 + 12 | 0;
+ if ((HEAP32[i17 >> 2] | 0) > 0) {
+ i20 = i4 + 16 | 0;
+ i19 = 0;
+ do {
+ if ((HEAP32[i16 >> 2] | 0) > 0) {
+ i18 = 0;
+ do {
+ i30 = HEAP32[(HEAP32[i20 >> 2] | 0) + (i18 << 2) >> 2] | 0;
+ FUNCTION_TABLE_vii[HEAP32[(HEAP32[i30 >> 2] | 0) + 32 >> 2] & 15](i30, i10);
+ i18 = i18 + 1 | 0;
+ } while ((i18 | 0) < (HEAP32[i16 >> 2] | 0));
+ }
+ __ZN15b2ContactSolver24SolveVelocityConstraintsEv(i2);
+ i19 = i19 + 1 | 0;
+ } while ((i19 | 0) < (HEAP32[i17 >> 2] | 0));
+ }
+ __ZN15b2ContactSolver13StoreImpulsesEv(i2);
+ HEAPF32[i8 + 16 >> 2] = +__ZNK7b2Timer15GetMillisecondsEv(i9);
+ if ((HEAP32[i1 >> 2] | 0) > 0) {
+ i19 = HEAP32[i14 >> 2] | 0;
+ i18 = 0;
+ do {
+ i30 = HEAP32[i15 >> 2] | 0;
+ i17 = i30 + (i18 * 12 | 0) | 0;
+ i22 = i17;
+ d23 = +HEAPF32[i22 >> 2];
+ d21 = +HEAPF32[i22 + 4 >> 2];
+ d24 = +HEAPF32[i30 + (i18 * 12 | 0) + 8 >> 2];
+ i30 = i19 + (i18 * 12 | 0) | 0;
+ d26 = +HEAPF32[i30 >> 2];
+ d27 = +HEAPF32[i30 + 4 >> 2];
+ d25 = +HEAPF32[i19 + (i18 * 12 | 0) + 8 >> 2];
+ d29 = d5 * d26;
+ d28 = d5 * d27;
+ d28 = d29 * d29 + d28 * d28;
+ if (d28 > 4.0) {
+ d29 = 2.0 / +Math_sqrt(+d28);
+ d26 = d26 * d29;
+ d27 = d27 * d29;
+ }
+ d28 = d5 * d25;
+ if (d28 * d28 > 2.4674012660980225) {
+ if (!(d28 > 0.0)) {
+ d28 = -d28;
+ }
+ d25 = d25 * (1.5707963705062866 / d28);
+ }
+ d29 = +(d23 + d5 * d26);
+ d28 = +(d21 + d5 * d27);
+ i19 = i17;
+ HEAPF32[i19 >> 2] = d29;
+ HEAPF32[i19 + 4 >> 2] = d28;
+ HEAPF32[(HEAP32[i15 >> 2] | 0) + (i18 * 12 | 0) + 8 >> 2] = d24 + d5 * d25;
+ d28 = +d26;
+ d29 = +d27;
+ i19 = (HEAP32[i14 >> 2] | 0) + (i18 * 12 | 0) | 0;
+ HEAPF32[i19 >> 2] = d28;
+ HEAPF32[i19 + 4 >> 2] = d29;
+ i19 = HEAP32[i14 >> 2] | 0;
+ HEAPF32[i19 + (i18 * 12 | 0) + 8 >> 2] = d25;
+ i18 = i18 + 1 | 0;
+ } while ((i18 | 0) < (HEAP32[i1 >> 2] | 0));
+ }
+ i11 = i11 + 16 | 0;
+ L41 : do {
+ if ((HEAP32[i11 >> 2] | 0) > 0) {
+ i17 = i4 + 16 | 0;
+ i19 = 0;
+ while (1) {
+ i18 = __ZN15b2ContactSolver24SolvePositionConstraintsEv(i2) | 0;
+ if ((HEAP32[i16 >> 2] | 0) > 0) {
+ i20 = 0;
+ i22 = 1;
+ do {
+ i30 = HEAP32[(HEAP32[i17 >> 2] | 0) + (i20 << 2) >> 2] | 0;
+ i22 = i22 & (FUNCTION_TABLE_iii[HEAP32[(HEAP32[i30 >> 2] | 0) + 36 >> 2] & 3](i30, i10) | 0);
+ i20 = i20 + 1 | 0;
+ } while ((i20 | 0) < (HEAP32[i16 >> 2] | 0));
+ } else {
+ i22 = 1;
+ }
+ i19 = i19 + 1 | 0;
+ if (i18 & i22) {
+ i10 = 0;
+ break L41;
+ }
+ if ((i19 | 0) >= (HEAP32[i11 >> 2] | 0)) {
+ i10 = 1;
+ break;
+ }
+ }
+ } else {
+ i10 = 1;
+ }
+ } while (0);
+ if ((HEAP32[i1 >> 2] | 0) > 0) {
+ i11 = i4 + 8 | 0;
+ i16 = 0;
+ do {
+ i30 = HEAP32[(HEAP32[i11 >> 2] | 0) + (i16 << 2) >> 2] | 0;
+ i22 = (HEAP32[i15 >> 2] | 0) + (i16 * 12 | 0) | 0;
+ i20 = HEAP32[i22 >> 2] | 0;
+ i22 = HEAP32[i22 + 4 >> 2] | 0;
+ i17 = i30 + 44 | 0;
+ HEAP32[i17 >> 2] = i20;
+ HEAP32[i17 + 4 >> 2] = i22;
+ d27 = +HEAPF32[(HEAP32[i15 >> 2] | 0) + (i16 * 12 | 0) + 8 >> 2];
+ HEAPF32[i30 + 56 >> 2] = d27;
+ i17 = (HEAP32[i14 >> 2] | 0) + (i16 * 12 | 0) | 0;
+ i18 = HEAP32[i17 + 4 >> 2] | 0;
+ i19 = i30 + 64 | 0;
+ HEAP32[i19 >> 2] = HEAP32[i17 >> 2];
+ HEAP32[i19 + 4 >> 2] = i18;
+ HEAPF32[i30 + 72 >> 2] = +HEAPF32[(HEAP32[i14 >> 2] | 0) + (i16 * 12 | 0) + 8 >> 2];
+ d25 = +Math_sin(+d27);
+ HEAPF32[i30 + 20 >> 2] = d25;
+ d27 = +Math_cos(+d27);
+ HEAPF32[i30 + 24 >> 2] = d27;
+ d26 = +HEAPF32[i30 + 28 >> 2];
+ d29 = +HEAPF32[i30 + 32 >> 2];
+ d28 = (HEAP32[tempDoublePtr >> 2] = i20, +HEAPF32[tempDoublePtr >> 2]) - (d27 * d26 - d25 * d29);
+ d29 = (HEAP32[tempDoublePtr >> 2] = i22, +HEAPF32[tempDoublePtr >> 2]) - (d25 * d26 + d27 * d29);
+ d28 = +d28;
+ d29 = +d29;
+ i30 = i30 + 12 | 0;
+ HEAPF32[i30 >> 2] = d28;
+ HEAPF32[i30 + 4 >> 2] = d29;
+ i16 = i16 + 1 | 0;
+ } while ((i16 | 0) < (HEAP32[i1 >> 2] | 0));
+ }
+ HEAPF32[i8 + 20 >> 2] = +__ZNK7b2Timer15GetMillisecondsEv(i9);
+ i9 = HEAP32[i2 + 40 >> 2] | 0;
+ i8 = i4 + 4 | 0;
+ if ((HEAP32[i8 >> 2] | 0) != 0 ? (HEAP32[i12 >> 2] | 0) > 0 : 0) {
+ i11 = i6 + 16 | 0;
+ i14 = 0;
+ do {
+ i15 = HEAP32[(HEAP32[i13 >> 2] | 0) + (i14 << 2) >> 2] | 0;
+ i16 = HEAP32[i9 + (i14 * 152 | 0) + 144 >> 2] | 0;
+ HEAP32[i11 >> 2] = i16;
+ if ((i16 | 0) > 0) {
+ i17 = 0;
+ do {
+ HEAPF32[i6 + (i17 << 2) >> 2] = +HEAPF32[i9 + (i14 * 152 | 0) + (i17 * 36 | 0) + 16 >> 2];
+ HEAPF32[i6 + (i17 << 2) + 8 >> 2] = +HEAPF32[i9 + (i14 * 152 | 0) + (i17 * 36 | 0) + 20 >> 2];
+ i17 = i17 + 1 | 0;
+ } while ((i17 | 0) != (i16 | 0));
+ }
+ i30 = HEAP32[i8 >> 2] | 0;
+ FUNCTION_TABLE_viii[HEAP32[(HEAP32[i30 >> 2] | 0) + 20 >> 2] & 3](i30, i15, i6);
+ i14 = i14 + 1 | 0;
+ } while ((i14 | 0) < (HEAP32[i12 >> 2] | 0));
+ }
+ if (!i7) {
+ __ZN15b2ContactSolverD2Ev(i2);
+ STACKTOP = i3;
+ return;
+ }
+ i7 = HEAP32[i1 >> 2] | 0;
+ i6 = (i7 | 0) > 0;
+ if (i6) {
+ i8 = HEAP32[i4 + 8 >> 2] | 0;
+ i9 = 0;
+ d21 = 3.4028234663852886e+38;
+ do {
+ i11 = HEAP32[i8 + (i9 << 2) >> 2] | 0;
+ do {
+ if ((HEAP32[i11 >> 2] | 0) != 0) {
+ if ((!((HEAP16[i11 + 4 >> 1] & 4) == 0) ? (d29 = +HEAPF32[i11 + 72 >> 2], !(d29 * d29 > .001218469929881394)) : 0) ? (d28 = +HEAPF32[i11 + 64 >> 2], d29 = +HEAPF32[i11 + 68 >> 2], !(d28 * d28 + d29 * d29 > 9999999747378752.0e-20)) : 0) {
+ i30 = i11 + 144 | 0;
+ d23 = d5 + +HEAPF32[i30 >> 2];
+ HEAPF32[i30 >> 2] = d23;
+ d21 = d21 < d23 ? d21 : d23;
+ break;
+ }
+ HEAPF32[i11 + 144 >> 2] = 0.0;
+ d21 = 0.0;
+ }
+ } while (0);
+ i9 = i9 + 1 | 0;
+ } while ((i9 | 0) < (i7 | 0));
+ } else {
+ d21 = 3.4028234663852886e+38;
+ }
+ if (!(d21 >= .5) | i10 | i6 ^ 1) {
+ __ZN15b2ContactSolverD2Ev(i2);
+ STACKTOP = i3;
+ return;
+ }
+ i4 = i4 + 8 | 0;
+ i6 = 0;
+ do {
+ i30 = HEAP32[(HEAP32[i4 >> 2] | 0) + (i6 << 2) >> 2] | 0;
+ i22 = i30 + 4 | 0;
+ HEAP16[i22 >> 1] = HEAP16[i22 >> 1] & 65533;
+ HEAPF32[i30 + 144 >> 2] = 0.0;
+ i30 = i30 + 64 | 0;
+ HEAP32[i30 + 0 >> 2] = 0;
+ HEAP32[i30 + 4 >> 2] = 0;
+ HEAP32[i30 + 8 >> 2] = 0;
+ HEAP32[i30 + 12 >> 2] = 0;
+ HEAP32[i30 + 16 >> 2] = 0;
+ HEAP32[i30 + 20 >> 2] = 0;
+ i6 = i6 + 1 | 0;
+ } while ((i6 | 0) < (HEAP32[i1 >> 2] | 0));
+ __ZN15b2ContactSolverD2Ev(i2);
+ STACKTOP = i3;
+ return;
+}
+function __ZN15b2ContactSolver24SolveVelocityConstraintsEv(i4) {
+ i4 = i4 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, d9 = 0.0, d10 = 0.0, d11 = 0.0, d12 = 0.0, d13 = 0.0, d14 = 0.0, d15 = 0.0, d16 = 0.0, d17 = 0.0, d18 = 0.0, i19 = 0, d20 = 0.0, d21 = 0.0, i22 = 0, d23 = 0.0, d24 = 0.0, d25 = 0.0, d26 = 0.0, d27 = 0.0, d28 = 0.0, d29 = 0.0, d30 = 0.0, d31 = 0.0, i32 = 0, i33 = 0, d34 = 0.0, d35 = 0.0, d36 = 0.0, d37 = 0.0, d38 = 0.0, d39 = 0.0, d40 = 0.0, i41 = 0, i42 = 0, d43 = 0.0, d44 = 0.0;
+ i1 = STACKTOP;
+ i2 = i4 + 48 | 0;
+ if ((HEAP32[i2 >> 2] | 0) <= 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i3 = i4 + 40 | 0;
+ i4 = i4 + 28 | 0;
+ i42 = HEAP32[i4 >> 2] | 0;
+ i5 = 0;
+ L4 : while (1) {
+ i19 = HEAP32[i3 >> 2] | 0;
+ i22 = i19 + (i5 * 152 | 0) | 0;
+ i8 = HEAP32[i19 + (i5 * 152 | 0) + 112 >> 2] | 0;
+ i6 = HEAP32[i19 + (i5 * 152 | 0) + 116 >> 2] | 0;
+ d12 = +HEAPF32[i19 + (i5 * 152 | 0) + 120 >> 2];
+ d10 = +HEAPF32[i19 + (i5 * 152 | 0) + 128 >> 2];
+ d11 = +HEAPF32[i19 + (i5 * 152 | 0) + 124 >> 2];
+ d9 = +HEAPF32[i19 + (i5 * 152 | 0) + 132 >> 2];
+ i32 = i19 + (i5 * 152 | 0) + 144 | 0;
+ i33 = HEAP32[i32 >> 2] | 0;
+ i7 = i42 + (i8 * 12 | 0) | 0;
+ i41 = i7;
+ d21 = +HEAPF32[i41 >> 2];
+ d20 = +HEAPF32[i41 + 4 >> 2];
+ i41 = i42 + (i6 * 12 | 0) | 0;
+ d14 = +HEAPF32[i41 >> 2];
+ d13 = +HEAPF32[i41 + 4 >> 2];
+ i41 = i19 + (i5 * 152 | 0) + 72 | 0;
+ d17 = +HEAPF32[i41 >> 2];
+ d16 = +HEAPF32[i41 + 4 >> 2];
+ d23 = -d17;
+ d24 = +HEAPF32[i19 + (i5 * 152 | 0) + 136 >> 2];
+ if ((i33 + -1 | 0) >>> 0 < 2) {
+ i41 = 0;
+ d18 = +HEAPF32[i42 + (i8 * 12 | 0) + 8 >> 2];
+ d15 = +HEAPF32[i42 + (i6 * 12 | 0) + 8 >> 2];
+ } else {
+ i2 = 4;
+ break;
+ }
+ do {
+ d30 = +HEAPF32[i19 + (i5 * 152 | 0) + (i41 * 36 | 0) + 12 >> 2];
+ d25 = +HEAPF32[i19 + (i5 * 152 | 0) + (i41 * 36 | 0) + 8 >> 2];
+ d26 = +HEAPF32[i19 + (i5 * 152 | 0) + (i41 * 36 | 0) + 4 >> 2];
+ d27 = +HEAPF32[i19 + (i5 * 152 | 0) + (i41 * 36 | 0) >> 2];
+ d34 = d24 * +HEAPF32[i19 + (i5 * 152 | 0) + (i41 * 36 | 0) + 16 >> 2];
+ i42 = i19 + (i5 * 152 | 0) + (i41 * 36 | 0) + 20 | 0;
+ d28 = +HEAPF32[i42 >> 2];
+ d31 = d28 - +HEAPF32[i19 + (i5 * 152 | 0) + (i41 * 36 | 0) + 28 >> 2] * (d16 * (d14 - d15 * d30 - d21 + d18 * d26) + (d13 + d15 * d25 - d20 - d18 * d27) * d23);
+ d29 = -d34;
+ d31 = d31 < d34 ? d31 : d34;
+ d40 = d31 < d29 ? d29 : d31;
+ d39 = d40 - d28;
+ HEAPF32[i42 >> 2] = d40;
+ d40 = d16 * d39;
+ d39 = d39 * d23;
+ d21 = d21 - d12 * d40;
+ d20 = d20 - d12 * d39;
+ d18 = d18 - d10 * (d27 * d39 - d26 * d40);
+ d14 = d14 + d11 * d40;
+ d13 = d13 + d11 * d39;
+ d15 = d15 + d9 * (d25 * d39 - d30 * d40);
+ i41 = i41 + 1 | 0;
+ } while ((i41 | 0) != (i33 | 0));
+ do {
+ if ((HEAP32[i32 >> 2] | 0) != 1) {
+ i32 = i19 + (i5 * 152 | 0) + 16 | 0;
+ d31 = +HEAPF32[i32 >> 2];
+ i33 = i19 + (i5 * 152 | 0) + 52 | 0;
+ d34 = +HEAPF32[i33 >> 2];
+ if (!(d31 >= 0.0) | !(d34 >= 0.0)) {
+ i2 = 9;
+ break L4;
+ }
+ d23 = +HEAPF32[i19 + (i5 * 152 | 0) + 12 >> 2];
+ d24 = +HEAPF32[i19 + (i5 * 152 | 0) + 8 >> 2];
+ d26 = +HEAPF32[i19 + (i5 * 152 | 0) + 4 >> 2];
+ d30 = +HEAPF32[i22 >> 2];
+ d27 = +HEAPF32[i19 + (i5 * 152 | 0) + 48 >> 2];
+ d25 = +HEAPF32[i19 + (i5 * 152 | 0) + 44 >> 2];
+ d28 = +HEAPF32[i19 + (i5 * 152 | 0) + 40 >> 2];
+ d29 = +HEAPF32[i19 + (i5 * 152 | 0) + 36 >> 2];
+ d37 = +HEAPF32[i19 + (i5 * 152 | 0) + 104 >> 2];
+ d38 = +HEAPF32[i19 + (i5 * 152 | 0) + 100 >> 2];
+ d35 = d17 * (d14 - d15 * d23 - d21 + d18 * d26) + d16 * (d13 + d15 * d24 - d20 - d18 * d30) - +HEAPF32[i19 + (i5 * 152 | 0) + 32 >> 2] - (d31 * +HEAPF32[i19 + (i5 * 152 | 0) + 96 >> 2] + d34 * d37);
+ d36 = d17 * (d14 - d15 * d27 - d21 + d18 * d28) + d16 * (d13 + d15 * d25 - d20 - d18 * d29) - +HEAPF32[i19 + (i5 * 152 | 0) + 68 >> 2] - (d31 * d38 + d34 * +HEAPF32[i19 + (i5 * 152 | 0) + 108 >> 2]);
+ d44 = +HEAPF32[i19 + (i5 * 152 | 0) + 80 >> 2] * d35 + +HEAPF32[i19 + (i5 * 152 | 0) + 88 >> 2] * d36;
+ d43 = d35 * +HEAPF32[i19 + (i5 * 152 | 0) + 84 >> 2] + d36 * +HEAPF32[i19 + (i5 * 152 | 0) + 92 >> 2];
+ d40 = -d44;
+ d39 = -d43;
+ if (!(!(d44 <= -0.0) | !(d43 <= -0.0))) {
+ d37 = d40 - d31;
+ d43 = d39 - d34;
+ d38 = d17 * d37;
+ d37 = d16 * d37;
+ d44 = d17 * d43;
+ d43 = d16 * d43;
+ d35 = d38 + d44;
+ d36 = d37 + d43;
+ HEAPF32[i32 >> 2] = d40;
+ HEAPF32[i33 >> 2] = d39;
+ d21 = d21 - d12 * d35;
+ d20 = d20 - d12 * d36;
+ d14 = d14 + d11 * d35;
+ d13 = d13 + d11 * d36;
+ d18 = d18 - d10 * (d30 * d37 - d26 * d38 + (d29 * d43 - d28 * d44));
+ d15 = d15 + d9 * (d24 * d37 - d23 * d38 + (d25 * d43 - d27 * d44));
+ break;
+ }
+ d44 = d35 * +HEAPF32[i19 + (i5 * 152 | 0) + 24 >> 2];
+ d39 = -d44;
+ if (d44 <= -0.0 ? d36 + d38 * d39 >= 0.0 : 0) {
+ d38 = d39 - d31;
+ d43 = 0.0 - d34;
+ d40 = d17 * d38;
+ d38 = d16 * d38;
+ d44 = d17 * d43;
+ d43 = d16 * d43;
+ d36 = d44 + d40;
+ d37 = d43 + d38;
+ HEAPF32[i32 >> 2] = d39;
+ HEAPF32[i33 >> 2] = 0.0;
+ d21 = d21 - d12 * d36;
+ d20 = d20 - d12 * d37;
+ d14 = d14 + d11 * d36;
+ d13 = d13 + d11 * d37;
+ d18 = d18 - d10 * (d38 * d30 - d40 * d26 + (d43 * d29 - d44 * d28));
+ d15 = d15 + d9 * (d38 * d24 - d40 * d23 + (d43 * d25 - d44 * d27));
+ break;
+ }
+ d44 = d36 * +HEAPF32[i19 + (i5 * 152 | 0) + 60 >> 2];
+ d38 = -d44;
+ if (d44 <= -0.0 ? d35 + d37 * d38 >= 0.0 : 0) {
+ d39 = 0.0 - d31;
+ d43 = d38 - d34;
+ d40 = d17 * d39;
+ d39 = d16 * d39;
+ d44 = d17 * d43;
+ d43 = d16 * d43;
+ d36 = d40 + d44;
+ d37 = d39 + d43;
+ HEAPF32[i32 >> 2] = 0.0;
+ HEAPF32[i33 >> 2] = d38;
+ d21 = d21 - d12 * d36;
+ d20 = d20 - d12 * d37;
+ d14 = d14 + d11 * d36;
+ d13 = d13 + d11 * d37;
+ d18 = d18 - d10 * (d39 * d30 - d40 * d26 + (d43 * d29 - d44 * d28));
+ d15 = d15 + d9 * (d39 * d24 - d40 * d23 + (d43 * d25 - d44 * d27));
+ break;
+ }
+ if (!(!(d35 >= 0.0) | !(d36 >= 0.0))) {
+ d39 = 0.0 - d31;
+ d43 = 0.0 - d34;
+ d40 = d17 * d39;
+ d39 = d16 * d39;
+ d44 = d17 * d43;
+ d43 = d16 * d43;
+ d37 = d40 + d44;
+ d38 = d39 + d43;
+ HEAPF32[i32 >> 2] = 0.0;
+ HEAPF32[i33 >> 2] = 0.0;
+ d21 = d21 - d12 * d37;
+ d20 = d20 - d12 * d38;
+ d14 = d14 + d11 * d37;
+ d13 = d13 + d11 * d38;
+ d18 = d18 - d10 * (d39 * d30 - d40 * d26 + (d43 * d29 - d44 * d28));
+ d15 = d15 + d9 * (d39 * d24 - d40 * d23 + (d43 * d25 - d44 * d27));
+ }
+ } else {
+ d23 = +HEAPF32[i19 + (i5 * 152 | 0) + 12 >> 2];
+ d24 = +HEAPF32[i19 + (i5 * 152 | 0) + 8 >> 2];
+ d25 = +HEAPF32[i19 + (i5 * 152 | 0) + 4 >> 2];
+ d26 = +HEAPF32[i22 >> 2];
+ i22 = i19 + (i5 * 152 | 0) + 16 | 0;
+ d27 = +HEAPF32[i22 >> 2];
+ d28 = d27 - +HEAPF32[i19 + (i5 * 152 | 0) + 24 >> 2] * (d17 * (d14 - d15 * d23 - d21 + d18 * d25) + d16 * (d13 + d15 * d24 - d20 - d18 * d26) - +HEAPF32[i19 + (i5 * 152 | 0) + 32 >> 2]);
+ d44 = d28 > 0.0 ? d28 : 0.0;
+ d43 = d44 - d27;
+ HEAPF32[i22 >> 2] = d44;
+ d44 = d17 * d43;
+ d43 = d16 * d43;
+ d21 = d21 - d12 * d44;
+ d20 = d20 - d12 * d43;
+ d14 = d14 + d11 * d44;
+ d13 = d13 + d11 * d43;
+ d18 = d18 - d10 * (d26 * d43 - d25 * d44);
+ d15 = d15 + d9 * (d24 * d43 - d23 * d44);
+ }
+ } while (0);
+ d44 = +d21;
+ d43 = +d20;
+ i42 = i7;
+ HEAPF32[i42 >> 2] = d44;
+ HEAPF32[i42 + 4 >> 2] = d43;
+ i42 = HEAP32[i4 >> 2] | 0;
+ HEAPF32[i42 + (i8 * 12 | 0) + 8 >> 2] = d18;
+ d43 = +d14;
+ d44 = +d13;
+ i42 = i42 + (i6 * 12 | 0) | 0;
+ HEAPF32[i42 >> 2] = d43;
+ HEAPF32[i42 + 4 >> 2] = d44;
+ i42 = HEAP32[i4 >> 2] | 0;
+ HEAPF32[i42 + (i6 * 12 | 0) + 8 >> 2] = d15;
+ i5 = i5 + 1 | 0;
+ if ((i5 | 0) >= (HEAP32[i2 >> 2] | 0)) {
+ i2 = 21;
+ break;
+ }
+ }
+ if ((i2 | 0) == 4) {
+ ___assert_fail(6648, 6520, 311, 6688);
+ } else if ((i2 | 0) == 9) {
+ ___assert_fail(6720, 6520, 406, 6688);
+ } else if ((i2 | 0) == 21) {
+ STACKTOP = i1;
+ return;
+ }
+}
+function __Z14b2TimeOfImpactP11b2TOIOutputPK10b2TOIInput(i3, i11) {
+ i3 = i3 | 0;
+ i11 = i11 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i12 = 0, i13 = 0, d14 = 0.0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, d28 = 0.0, i29 = 0, d30 = 0.0, d31 = 0.0, i32 = 0, i33 = 0, i34 = 0, i35 = 0, i36 = 0, i37 = 0, i38 = 0, i39 = 0, d40 = 0.0, i41 = 0, d42 = 0.0, d43 = 0.0, i44 = 0, i45 = 0, d46 = 0.0, i47 = 0, d48 = 0.0, d49 = 0.0, d50 = 0.0, d51 = 0.0, i52 = 0, d53 = 0.0, d54 = 0.0, d55 = 0.0, d56 = 0.0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 320 | 0;
+ i12 = i1 + 276 | 0;
+ i10 = i1 + 240 | 0;
+ i13 = i1 + 228 | 0;
+ i5 = i1 + 136 | 0;
+ i7 = i1 + 112 | 0;
+ i8 = i1 + 8 | 0;
+ i9 = i1 + 4 | 0;
+ i4 = i1;
+ HEAP32[874] = (HEAP32[874] | 0) + 1;
+ HEAP32[i3 >> 2] = 0;
+ i19 = i11 + 128 | 0;
+ i2 = i3 + 4 | 0;
+ HEAPF32[i2 >> 2] = +HEAPF32[i19 >> 2];
+ i6 = i11 + 28 | 0;
+ i16 = i12 + 0 | 0;
+ i15 = i11 + 56 | 0;
+ i17 = i16 + 36 | 0;
+ do {
+ HEAP32[i16 >> 2] = HEAP32[i15 >> 2];
+ i16 = i16 + 4 | 0;
+ i15 = i15 + 4 | 0;
+ } while ((i16 | 0) < (i17 | 0));
+ i16 = i10 + 0 | 0;
+ i15 = i11 + 92 | 0;
+ i17 = i16 + 36 | 0;
+ do {
+ HEAP32[i16 >> 2] = HEAP32[i15 >> 2];
+ i16 = i16 + 4 | 0;
+ i15 = i15 + 4 | 0;
+ } while ((i16 | 0) < (i17 | 0));
+ i15 = i12 + 24 | 0;
+ d42 = +HEAPF32[i15 >> 2];
+ d43 = +Math_floor(+(d42 / 6.2831854820251465)) * 6.2831854820251465;
+ d42 = d42 - d43;
+ HEAPF32[i15 >> 2] = d42;
+ i16 = i12 + 28 | 0;
+ d43 = +HEAPF32[i16 >> 2] - d43;
+ HEAPF32[i16 >> 2] = d43;
+ i17 = i10 + 24 | 0;
+ d46 = +HEAPF32[i17 >> 2];
+ d40 = +Math_floor(+(d46 / 6.2831854820251465)) * 6.2831854820251465;
+ d46 = d46 - d40;
+ HEAPF32[i17 >> 2] = d46;
+ i18 = i10 + 28 | 0;
+ d40 = +HEAPF32[i18 >> 2] - d40;
+ HEAPF32[i18 >> 2] = d40;
+ d14 = +HEAPF32[i19 >> 2];
+ d28 = +HEAPF32[i11 + 24 >> 2] + +HEAPF32[i11 + 52 >> 2] + -.014999999664723873;
+ d28 = d28 < .004999999888241291 ? .004999999888241291 : d28;
+ if (!(d28 > .0012499999720603228)) {
+ ___assert_fail(3536, 3560, 280, 3600);
+ }
+ HEAP16[i13 + 4 >> 1] = 0;
+ HEAP32[i5 + 0 >> 2] = HEAP32[i11 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i11 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i11 + 8 >> 2];
+ HEAP32[i5 + 12 >> 2] = HEAP32[i11 + 12 >> 2];
+ HEAP32[i5 + 16 >> 2] = HEAP32[i11 + 16 >> 2];
+ HEAP32[i5 + 20 >> 2] = HEAP32[i11 + 20 >> 2];
+ HEAP32[i5 + 24 >> 2] = HEAP32[i11 + 24 >> 2];
+ i38 = i5 + 28 | 0;
+ HEAP32[i38 + 0 >> 2] = HEAP32[i6 + 0 >> 2];
+ HEAP32[i38 + 4 >> 2] = HEAP32[i6 + 4 >> 2];
+ HEAP32[i38 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ HEAP32[i38 + 12 >> 2] = HEAP32[i6 + 12 >> 2];
+ HEAP32[i38 + 16 >> 2] = HEAP32[i6 + 16 >> 2];
+ HEAP32[i38 + 20 >> 2] = HEAP32[i6 + 20 >> 2];
+ HEAP32[i38 + 24 >> 2] = HEAP32[i6 + 24 >> 2];
+ HEAP8[i5 + 88 | 0] = 0;
+ i38 = i12 + 8 | 0;
+ i27 = i12 + 12 | 0;
+ i29 = i12 + 16 | 0;
+ i22 = i12 + 20 | 0;
+ i32 = i12 + 4 | 0;
+ i34 = i10 + 8 | 0;
+ i36 = i10 + 12 | 0;
+ i35 = i10 + 16 | 0;
+ i37 = i10 + 20 | 0;
+ i33 = i10 + 4 | 0;
+ i26 = i5 + 56 | 0;
+ i25 = i5 + 64 | 0;
+ i24 = i5 + 68 | 0;
+ i23 = i5 + 72 | 0;
+ i20 = i5 + 80 | 0;
+ i19 = i5 + 84 | 0;
+ i21 = i7 + 16 | 0;
+ d30 = d28 + .0012499999720603228;
+ d31 = d28 + -.0012499999720603228;
+ d48 = d40;
+ i39 = 0;
+ d40 = 0.0;
+ L4 : while (1) {
+ d56 = 1.0 - d40;
+ d49 = d56 * d42 + d40 * d43;
+ d43 = +Math_sin(+d49);
+ d49 = +Math_cos(+d49);
+ d55 = +HEAPF32[i12 >> 2];
+ d54 = +HEAPF32[i32 >> 2];
+ d42 = d56 * d46 + d40 * d48;
+ d53 = +Math_sin(+d42);
+ d42 = +Math_cos(+d42);
+ d46 = +HEAPF32[i10 >> 2];
+ d51 = +HEAPF32[i33 >> 2];
+ d50 = d56 * +HEAPF32[i34 >> 2] + d40 * +HEAPF32[i35 >> 2] - (d42 * d46 - d53 * d51);
+ d51 = d56 * +HEAPF32[i36 >> 2] + d40 * +HEAPF32[i37 >> 2] - (d53 * d46 + d42 * d51);
+ d46 = +(d56 * +HEAPF32[i38 >> 2] + d40 * +HEAPF32[i29 >> 2] - (d49 * d55 - d43 * d54));
+ d48 = +(d56 * +HEAPF32[i27 >> 2] + d40 * +HEAPF32[i22 >> 2] - (d43 * d55 + d49 * d54));
+ i52 = i26;
+ HEAPF32[i52 >> 2] = d46;
+ HEAPF32[i52 + 4 >> 2] = d48;
+ HEAPF32[i25 >> 2] = d43;
+ HEAPF32[i24 >> 2] = d49;
+ d50 = +d50;
+ d51 = +d51;
+ i52 = i23;
+ HEAPF32[i52 >> 2] = d50;
+ HEAPF32[i52 + 4 >> 2] = d51;
+ HEAPF32[i20 >> 2] = d53;
+ HEAPF32[i19 >> 2] = d42;
+ __Z10b2DistanceP16b2DistanceOutputP14b2SimplexCachePK15b2DistanceInput(i7, i13, i5);
+ d42 = +HEAPF32[i21 >> 2];
+ if (d42 <= 0.0) {
+ i4 = 5;
+ break;
+ }
+ if (d42 < d30) {
+ i4 = 7;
+ break;
+ }
+ +__ZN20b2SeparationFunction10InitializeEPK14b2SimplexCachePK15b2DistanceProxyRK7b2SweepS5_S8_f(i8, i13, i11, i12, i6, i10, d40);
+ i41 = 0;
+ d42 = d14;
+ do {
+ d50 = +__ZNK20b2SeparationFunction17FindMinSeparationEPiS0_f(i8, i9, i4, d42);
+ if (d50 > d30) {
+ i4 = 10;
+ break L4;
+ }
+ if (d50 > d31) {
+ d40 = d42;
+ break;
+ }
+ i45 = HEAP32[i9 >> 2] | 0;
+ i44 = HEAP32[i4 >> 2] | 0;
+ d48 = +__ZNK20b2SeparationFunction8EvaluateEiif(i8, i45, i44, d40);
+ if (d48 < d31) {
+ i4 = 13;
+ break L4;
+ }
+ if (!(d48 <= d30)) {
+ d43 = d40;
+ d46 = d42;
+ i47 = 0;
+ } else {
+ i4 = 15;
+ break L4;
+ }
+ while (1) {
+ if ((i47 & 1 | 0) == 0) {
+ d49 = (d43 + d46) * .5;
+ } else {
+ d49 = d43 + (d28 - d48) * (d46 - d43) / (d50 - d48);
+ }
+ d51 = +__ZNK20b2SeparationFunction8EvaluateEiif(i8, i45, i44, d49);
+ d53 = d51 - d28;
+ if (!(d53 > 0.0)) {
+ d53 = -d53;
+ }
+ if (d53 < .0012499999720603228) {
+ d42 = d49;
+ break;
+ }
+ i52 = d51 > d28;
+ i47 = i47 + 1 | 0;
+ HEAP32[880] = (HEAP32[880] | 0) + 1;
+ if ((i47 | 0) == 50) {
+ i47 = 50;
+ break;
+ } else {
+ d43 = i52 ? d49 : d43;
+ d46 = i52 ? d46 : d49;
+ d48 = i52 ? d51 : d48;
+ d50 = i52 ? d50 : d51;
+ }
+ }
+ i44 = HEAP32[882] | 0;
+ HEAP32[882] = (i44 | 0) > (i47 | 0) ? i44 : i47;
+ i41 = i41 + 1 | 0;
+ } while ((i41 | 0) != 8);
+ i39 = i39 + 1 | 0;
+ HEAP32[876] = (HEAP32[876] | 0) + 1;
+ if ((i39 | 0) == 20) {
+ i4 = 27;
+ break;
+ }
+ d42 = +HEAPF32[i15 >> 2];
+ d43 = +HEAPF32[i16 >> 2];
+ d46 = +HEAPF32[i17 >> 2];
+ d48 = +HEAPF32[i18 >> 2];
+ }
+ if ((i4 | 0) == 5) {
+ HEAP32[i3 >> 2] = 2;
+ HEAPF32[i2 >> 2] = 0.0;
+ i2 = HEAP32[878] | 0;
+ i52 = (i2 | 0) > (i39 | 0);
+ i52 = i52 ? i2 : i39;
+ HEAP32[878] = i52;
+ STACKTOP = i1;
+ return;
+ } else if ((i4 | 0) == 7) {
+ HEAP32[i3 >> 2] = 3;
+ HEAPF32[i2 >> 2] = d40;
+ i2 = HEAP32[878] | 0;
+ i52 = (i2 | 0) > (i39 | 0);
+ i52 = i52 ? i2 : i39;
+ HEAP32[878] = i52;
+ STACKTOP = i1;
+ return;
+ } else if ((i4 | 0) == 10) {
+ HEAP32[i3 >> 2] = 4;
+ HEAPF32[i2 >> 2] = d14;
+ } else if ((i4 | 0) == 13) {
+ HEAP32[i3 >> 2] = 1;
+ HEAPF32[i2 >> 2] = d40;
+ } else if ((i4 | 0) == 15) {
+ HEAP32[i3 >> 2] = 3;
+ HEAPF32[i2 >> 2] = d40;
+ } else if ((i4 | 0) == 27) {
+ HEAP32[i3 >> 2] = 1;
+ HEAPF32[i2 >> 2] = d40;
+ i39 = 20;
+ i2 = HEAP32[878] | 0;
+ i52 = (i2 | 0) > (i39 | 0);
+ i52 = i52 ? i2 : i39;
+ HEAP32[878] = i52;
+ STACKTOP = i1;
+ return;
+ }
+ HEAP32[876] = (HEAP32[876] | 0) + 1;
+ i39 = i39 + 1 | 0;
+ i2 = HEAP32[878] | 0;
+ i52 = (i2 | 0) > (i39 | 0);
+ i52 = i52 ? i2 : i39;
+ HEAP32[878] = i52;
+ STACKTOP = i1;
+ return;
+}
+function __ZN7b2World5SolveERK10b2TimeStep(i5, i15) {
+ i5 = i5 | 0;
+ i15 = i15 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0, i30 = 0, i31 = 0, i32 = 0, i33 = 0, i34 = 0, i35 = 0, i36 = 0, i37 = 0, i38 = 0, d39 = 0.0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 96 | 0;
+ i4 = i3 + 32 | 0;
+ i9 = i3;
+ i2 = i3 + 84 | 0;
+ i11 = i5 + 103008 | 0;
+ HEAPF32[i11 >> 2] = 0.0;
+ i14 = i5 + 103012 | 0;
+ HEAPF32[i14 >> 2] = 0.0;
+ i8 = i5 + 103016 | 0;
+ HEAPF32[i8 >> 2] = 0.0;
+ i16 = i5 + 102960 | 0;
+ i1 = i5 + 102872 | 0;
+ i6 = i5 + 68 | 0;
+ __ZN8b2IslandC2EiiiP16b2StackAllocatorP17b2ContactListener(i4, HEAP32[i16 >> 2] | 0, HEAP32[i5 + 102936 >> 2] | 0, HEAP32[i5 + 102964 >> 2] | 0, i6, HEAP32[i5 + 102944 >> 2] | 0);
+ i7 = i5 + 102952 | 0;
+ i17 = HEAP32[i7 >> 2] | 0;
+ if ((i17 | 0) != 0) {
+ do {
+ i38 = i17 + 4 | 0;
+ HEAP16[i38 >> 1] = HEAP16[i38 >> 1] & 65534;
+ i17 = HEAP32[i17 + 96 >> 2] | 0;
+ } while ((i17 | 0) != 0);
+ }
+ i17 = HEAP32[i5 + 102932 >> 2] | 0;
+ if ((i17 | 0) != 0) {
+ do {
+ i38 = i17 + 4 | 0;
+ HEAP32[i38 >> 2] = HEAP32[i38 >> 2] & -2;
+ i17 = HEAP32[i17 + 12 >> 2] | 0;
+ } while ((i17 | 0) != 0);
+ }
+ i17 = HEAP32[i5 + 102956 >> 2] | 0;
+ if ((i17 | 0) != 0) {
+ do {
+ HEAP8[i17 + 60 | 0] = 0;
+ i17 = HEAP32[i17 + 12 >> 2] | 0;
+ } while ((i17 | 0) != 0);
+ }
+ i24 = HEAP32[i16 >> 2] | 0;
+ i16 = __ZN16b2StackAllocator8AllocateEi(i6, i24 << 2) | 0;
+ i32 = HEAP32[i7 >> 2] | 0;
+ L13 : do {
+ if ((i32 | 0) != 0) {
+ i18 = i4 + 28 | 0;
+ i30 = i4 + 36 | 0;
+ i27 = i4 + 32 | 0;
+ i17 = i4 + 40 | 0;
+ i23 = i4 + 8 | 0;
+ i29 = i4 + 48 | 0;
+ i28 = i4 + 16 | 0;
+ i26 = i4 + 44 | 0;
+ i31 = i4 + 12 | 0;
+ i25 = i5 + 102968 | 0;
+ i22 = i5 + 102976 | 0;
+ i21 = i9 + 12 | 0;
+ i20 = i9 + 16 | 0;
+ i19 = i9 + 20 | 0;
+ L15 : while (1) {
+ i33 = i32 + 4 | 0;
+ i34 = HEAP16[i33 >> 1] | 0;
+ if ((i34 & 35) == 34 ? (HEAP32[i32 >> 2] | 0) != 0 : 0) {
+ HEAP32[i18 >> 2] = 0;
+ HEAP32[i30 >> 2] = 0;
+ HEAP32[i27 >> 2] = 0;
+ HEAP32[i16 >> 2] = i32;
+ HEAP16[i33 >> 1] = i34 & 65535 | 1;
+ i35 = 1;
+ do {
+ i35 = i35 + -1 | 0;
+ i33 = HEAP32[i16 + (i35 << 2) >> 2] | 0;
+ i34 = i33 + 4 | 0;
+ i36 = HEAP16[i34 >> 1] | 0;
+ if ((i36 & 32) == 0) {
+ i8 = 13;
+ break L15;
+ }
+ i37 = HEAP32[i18 >> 2] | 0;
+ if ((i37 | 0) >= (HEAP32[i17 >> 2] | 0)) {
+ i8 = 15;
+ break L15;
+ }
+ HEAP32[i33 + 8 >> 2] = i37;
+ i38 = HEAP32[i18 >> 2] | 0;
+ HEAP32[(HEAP32[i23 >> 2] | 0) + (i38 << 2) >> 2] = i33;
+ HEAP32[i18 >> 2] = i38 + 1;
+ i36 = i36 & 65535;
+ if ((i36 & 2 | 0) == 0) {
+ HEAP16[i34 >> 1] = i36 | 2;
+ HEAPF32[i33 + 144 >> 2] = 0.0;
+ }
+ if ((HEAP32[i33 >> 2] | 0) != 0) {
+ i34 = HEAP32[i33 + 112 >> 2] | 0;
+ if ((i34 | 0) != 0) {
+ do {
+ i38 = HEAP32[i34 + 4 >> 2] | 0;
+ i36 = i38 + 4 | 0;
+ if (((HEAP32[i36 >> 2] & 7 | 0) == 6 ? (HEAP8[(HEAP32[i38 + 48 >> 2] | 0) + 38 | 0] | 0) == 0 : 0) ? (HEAP8[(HEAP32[i38 + 52 >> 2] | 0) + 38 | 0] | 0) == 0 : 0) {
+ i37 = HEAP32[i30 >> 2] | 0;
+ if ((i37 | 0) >= (HEAP32[i26 >> 2] | 0)) {
+ i8 = 25;
+ break L15;
+ }
+ HEAP32[i30 >> 2] = i37 + 1;
+ HEAP32[(HEAP32[i31 >> 2] | 0) + (i37 << 2) >> 2] = i38;
+ HEAP32[i36 >> 2] = HEAP32[i36 >> 2] | 1;
+ i38 = HEAP32[i34 >> 2] | 0;
+ i36 = i38 + 4 | 0;
+ i37 = HEAP16[i36 >> 1] | 0;
+ if ((i37 & 1) == 0) {
+ if ((i35 | 0) >= (i24 | 0)) {
+ i8 = 28;
+ break L15;
+ }
+ HEAP32[i16 + (i35 << 2) >> 2] = i38;
+ HEAP16[i36 >> 1] = i37 & 65535 | 1;
+ i35 = i35 + 1 | 0;
+ }
+ }
+ i34 = HEAP32[i34 + 12 >> 2] | 0;
+ } while ((i34 | 0) != 0);
+ }
+ i33 = HEAP32[i33 + 108 >> 2] | 0;
+ if ((i33 | 0) != 0) {
+ do {
+ i37 = i33 + 4 | 0;
+ i36 = HEAP32[i37 >> 2] | 0;
+ if ((HEAP8[i36 + 60 | 0] | 0) == 0 ? (i10 = HEAP32[i33 >> 2] | 0, i13 = i10 + 4 | 0, i12 = HEAP16[i13 >> 1] | 0, !((i12 & 32) == 0)) : 0) {
+ i34 = HEAP32[i27 >> 2] | 0;
+ if ((i34 | 0) >= (HEAP32[i29 >> 2] | 0)) {
+ i8 = 35;
+ break L15;
+ }
+ HEAP32[i27 >> 2] = i34 + 1;
+ HEAP32[(HEAP32[i28 >> 2] | 0) + (i34 << 2) >> 2] = i36;
+ HEAP8[(HEAP32[i37 >> 2] | 0) + 60 | 0] = 1;
+ if ((i12 & 1) == 0) {
+ if ((i35 | 0) >= (i24 | 0)) {
+ i8 = 38;
+ break L15;
+ }
+ HEAP32[i16 + (i35 << 2) >> 2] = i10;
+ HEAP16[i13 >> 1] = i12 & 65535 | 1;
+ i35 = i35 + 1 | 0;
+ }
+ }
+ i33 = HEAP32[i33 + 12 >> 2] | 0;
+ } while ((i33 | 0) != 0);
+ }
+ }
+ } while ((i35 | 0) > 0);
+ __ZN8b2Island5SolveEP9b2ProfileRK10b2TimeStepRK6b2Vec2b(i4, i9, i15, i25, (HEAP8[i22] | 0) != 0);
+ HEAPF32[i11 >> 2] = +HEAPF32[i21 >> 2] + +HEAPF32[i11 >> 2];
+ HEAPF32[i14 >> 2] = +HEAPF32[i20 >> 2] + +HEAPF32[i14 >> 2];
+ HEAPF32[i8 >> 2] = +HEAPF32[i19 >> 2] + +HEAPF32[i8 >> 2];
+ i35 = HEAP32[i18 >> 2] | 0;
+ if ((i35 | 0) > 0) {
+ i33 = HEAP32[i23 >> 2] | 0;
+ i36 = 0;
+ do {
+ i34 = HEAP32[i33 + (i36 << 2) >> 2] | 0;
+ if ((HEAP32[i34 >> 2] | 0) == 0) {
+ i38 = i34 + 4 | 0;
+ HEAP16[i38 >> 1] = HEAP16[i38 >> 1] & 65534;
+ }
+ i36 = i36 + 1 | 0;
+ } while ((i36 | 0) < (i35 | 0));
+ }
+ }
+ i32 = HEAP32[i32 + 96 >> 2] | 0;
+ if ((i32 | 0) == 0) {
+ break L13;
+ }
+ }
+ if ((i8 | 0) == 13) {
+ ___assert_fail(2232, 2184, 445, 2256);
+ } else if ((i8 | 0) == 15) {
+ ___assert_fail(2520, 2440, 54, 2472);
+ } else if ((i8 | 0) == 25) {
+ ___assert_fail(2480, 2440, 62, 2472);
+ } else if ((i8 | 0) == 28) {
+ ___assert_fail(2264, 2184, 495, 2256);
+ } else if ((i8 | 0) == 35) {
+ ___assert_fail(2408, 2440, 68, 2472);
+ } else if ((i8 | 0) == 38) {
+ ___assert_fail(2264, 2184, 524, 2256);
+ }
+ }
+ } while (0);
+ __ZN16b2StackAllocator4FreeEPv(i6, i16);
+ __ZN7b2TimerC2Ev(i2);
+ i6 = HEAP32[i7 >> 2] | 0;
+ if ((i6 | 0) == 0) {
+ __ZN16b2ContactManager15FindNewContactsEv(i1);
+ d39 = +__ZNK7b2Timer15GetMillisecondsEv(i2);
+ i38 = i5 + 103020 | 0;
+ HEAPF32[i38 >> 2] = d39;
+ __ZN8b2IslandD2Ev(i4);
+ STACKTOP = i3;
+ return;
+ }
+ do {
+ if (!((HEAP16[i6 + 4 >> 1] & 1) == 0) ? (HEAP32[i6 >> 2] | 0) != 0 : 0) {
+ __ZN6b2Body19SynchronizeFixturesEv(i6);
+ }
+ i6 = HEAP32[i6 + 96 >> 2] | 0;
+ } while ((i6 | 0) != 0);
+ __ZN16b2ContactManager15FindNewContactsEv(i1);
+ d39 = +__ZNK7b2Timer15GetMillisecondsEv(i2);
+ i38 = i5 + 103020 | 0;
+ HEAPF32[i38 >> 2] = d39;
+ __ZN8b2IslandD2Ev(i4);
+ STACKTOP = i3;
+ return;
+}
+function __ZN15b2ContactSolver29InitializeVelocityConstraintsEv(i10) {
+ i10 = i10 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, d17 = 0.0, d18 = 0.0, d19 = 0.0, d20 = 0.0, d21 = 0.0, d22 = 0.0, d23 = 0.0, d24 = 0.0, d25 = 0.0, d26 = 0.0, d27 = 0.0, d28 = 0.0, d29 = 0.0, d30 = 0.0, i31 = 0, d32 = 0.0, i33 = 0, i34 = 0, i35 = 0, i36 = 0, i37 = 0, d38 = 0.0, d39 = 0.0, d40 = 0.0, d41 = 0.0, i42 = 0, d43 = 0.0, d44 = 0.0, d45 = 0.0, d46 = 0.0, d47 = 0.0, d48 = 0.0, i49 = 0, i50 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 64 | 0;
+ i8 = i1 + 40 | 0;
+ i3 = i1 + 24 | 0;
+ i5 = i1;
+ i4 = i10 + 48 | 0;
+ if ((HEAP32[i4 >> 2] | 0) <= 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i9 = i10 + 40 | 0;
+ i2 = i10 + 36 | 0;
+ i7 = i10 + 44 | 0;
+ i6 = i10 + 24 | 0;
+ i13 = i10 + 28 | 0;
+ i14 = i8 + 8 | 0;
+ i12 = i8 + 12 | 0;
+ i11 = i3 + 8 | 0;
+ i10 = i3 + 12 | 0;
+ i16 = 0;
+ while (1) {
+ i15 = HEAP32[i9 >> 2] | 0;
+ i33 = HEAP32[i2 >> 2] | 0;
+ i31 = HEAP32[(HEAP32[i7 >> 2] | 0) + (HEAP32[i15 + (i16 * 152 | 0) + 148 >> 2] << 2) >> 2] | 0;
+ i35 = HEAP32[i15 + (i16 * 152 | 0) + 112 >> 2] | 0;
+ i42 = HEAP32[i15 + (i16 * 152 | 0) + 116 >> 2] | 0;
+ d30 = +HEAPF32[i15 + (i16 * 152 | 0) + 120 >> 2];
+ d24 = +HEAPF32[i15 + (i16 * 152 | 0) + 124 >> 2];
+ d17 = +HEAPF32[i15 + (i16 * 152 | 0) + 128 >> 2];
+ d18 = +HEAPF32[i15 + (i16 * 152 | 0) + 132 >> 2];
+ i36 = i33 + (i16 * 88 | 0) + 48 | 0;
+ d39 = +HEAPF32[i36 >> 2];
+ d40 = +HEAPF32[i36 + 4 >> 2];
+ i36 = i33 + (i16 * 88 | 0) + 56 | 0;
+ d41 = +HEAPF32[i36 >> 2];
+ d43 = +HEAPF32[i36 + 4 >> 2];
+ i36 = HEAP32[i6 >> 2] | 0;
+ i37 = i36 + (i35 * 12 | 0) | 0;
+ d26 = +HEAPF32[i37 >> 2];
+ d27 = +HEAPF32[i37 + 4 >> 2];
+ d32 = +HEAPF32[i36 + (i35 * 12 | 0) + 8 >> 2];
+ i37 = HEAP32[i13 >> 2] | 0;
+ i34 = i37 + (i35 * 12 | 0) | 0;
+ d22 = +HEAPF32[i34 >> 2];
+ d25 = +HEAPF32[i34 + 4 >> 2];
+ d23 = +HEAPF32[i37 + (i35 * 12 | 0) + 8 >> 2];
+ i35 = i36 + (i42 * 12 | 0) | 0;
+ d28 = +HEAPF32[i35 >> 2];
+ d29 = +HEAPF32[i35 + 4 >> 2];
+ d38 = +HEAPF32[i36 + (i42 * 12 | 0) + 8 >> 2];
+ i36 = i37 + (i42 * 12 | 0) | 0;
+ d20 = +HEAPF32[i36 >> 2];
+ d19 = +HEAPF32[i36 + 4 >> 2];
+ d21 = +HEAPF32[i37 + (i42 * 12 | 0) + 8 >> 2];
+ if ((HEAP32[i31 + 124 >> 2] | 0) <= 0) {
+ i2 = 4;
+ break;
+ }
+ d44 = +HEAPF32[i33 + (i16 * 88 | 0) + 80 >> 2];
+ d45 = +HEAPF32[i33 + (i16 * 88 | 0) + 76 >> 2];
+ d47 = +Math_sin(+d32);
+ HEAPF32[i14 >> 2] = d47;
+ d48 = +Math_cos(+d32);
+ HEAPF32[i12 >> 2] = d48;
+ d32 = +Math_sin(+d38);
+ HEAPF32[i11 >> 2] = d32;
+ d38 = +Math_cos(+d38);
+ HEAPF32[i10 >> 2] = d38;
+ d46 = +(d26 - (d39 * d48 - d40 * d47));
+ d40 = +(d27 - (d40 * d48 + d39 * d47));
+ i37 = i8;
+ HEAPF32[i37 >> 2] = d46;
+ HEAPF32[i37 + 4 >> 2] = d40;
+ d40 = +(d28 - (d41 * d38 - d43 * d32));
+ d43 = +(d29 - (d43 * d38 + d41 * d32));
+ i37 = i3;
+ HEAPF32[i37 >> 2] = d40;
+ HEAPF32[i37 + 4 >> 2] = d43;
+ __ZN15b2WorldManifold10InitializeEPK10b2ManifoldRK11b2TransformfS5_f(i5, i31 + 64 | 0, i8, d45, i3, d44);
+ i37 = i15 + (i16 * 152 | 0) + 72 | 0;
+ i42 = i5;
+ i33 = HEAP32[i42 + 4 >> 2] | 0;
+ i31 = i37;
+ HEAP32[i31 >> 2] = HEAP32[i42 >> 2];
+ HEAP32[i31 + 4 >> 2] = i33;
+ i31 = i15 + (i16 * 152 | 0) + 144 | 0;
+ i33 = HEAP32[i31 >> 2] | 0;
+ do {
+ if ((i33 | 0) > 0) {
+ i36 = i15 + (i16 * 152 | 0) + 76 | 0;
+ d32 = d30 + d24;
+ i35 = i15 + (i16 * 152 | 0) + 140 | 0;
+ i34 = 0;
+ do {
+ i49 = i5 + (i34 << 3) + 8 | 0;
+ d41 = +HEAPF32[i49 >> 2] - d26;
+ i42 = i5 + (i34 << 3) + 12 | 0;
+ d39 = +d41;
+ d40 = +(+HEAPF32[i42 >> 2] - d27);
+ i50 = i15 + (i16 * 152 | 0) + (i34 * 36 | 0) | 0;
+ HEAPF32[i50 >> 2] = d39;
+ HEAPF32[i50 + 4 >> 2] = d40;
+ d40 = +HEAPF32[i49 >> 2] - d28;
+ d39 = +d40;
+ d47 = +(+HEAPF32[i42 >> 2] - d29);
+ i42 = i15 + (i16 * 152 | 0) + (i34 * 36 | 0) + 8 | 0;
+ HEAPF32[i42 >> 2] = d39;
+ HEAPF32[i42 + 4 >> 2] = d47;
+ d47 = +HEAPF32[i36 >> 2];
+ d39 = +HEAPF32[i15 + (i16 * 152 | 0) + (i34 * 36 | 0) + 4 >> 2];
+ d43 = +HEAPF32[i37 >> 2];
+ d48 = d41 * d47 - d39 * d43;
+ d38 = +HEAPF32[i15 + (i16 * 152 | 0) + (i34 * 36 | 0) + 12 >> 2];
+ d43 = d47 * d40 - d43 * d38;
+ d43 = d32 + d48 * d17 * d48 + d43 * d18 * d43;
+ if (d43 > 0.0) {
+ d43 = 1.0 / d43;
+ } else {
+ d43 = 0.0;
+ }
+ HEAPF32[i15 + (i16 * 152 | 0) + (i34 * 36 | 0) + 24 >> 2] = d43;
+ d43 = +HEAPF32[i36 >> 2];
+ d47 = -+HEAPF32[i37 >> 2];
+ d48 = d41 * d47 - d43 * d39;
+ d43 = d40 * d47 - d43 * d38;
+ d43 = d32 + d48 * d17 * d48 + d43 * d18 * d43;
+ if (d43 > 0.0) {
+ d43 = 1.0 / d43;
+ } else {
+ d43 = 0.0;
+ }
+ HEAPF32[i15 + (i16 * 152 | 0) + (i34 * 36 | 0) + 28 >> 2] = d43;
+ i42 = i15 + (i16 * 152 | 0) + (i34 * 36 | 0) + 32 | 0;
+ HEAPF32[i42 >> 2] = 0.0;
+ d38 = +HEAPF32[i37 >> 2] * (d20 - d21 * d38 - d22 + d23 * d39) + +HEAPF32[i36 >> 2] * (d19 + d21 * d40 - d25 - d23 * d41);
+ if (d38 < -1.0) {
+ HEAPF32[i42 >> 2] = -(d38 * +HEAPF32[i35 >> 2]);
+ }
+ i34 = i34 + 1 | 0;
+ } while ((i34 | 0) != (i33 | 0));
+ if ((HEAP32[i31 >> 2] | 0) == 2) {
+ d45 = +HEAPF32[i15 + (i16 * 152 | 0) + 76 >> 2];
+ d20 = +HEAPF32[i37 >> 2];
+ d44 = +HEAPF32[i15 + (i16 * 152 | 0) >> 2] * d45 - +HEAPF32[i15 + (i16 * 152 | 0) + 4 >> 2] * d20;
+ d19 = d45 * +HEAPF32[i15 + (i16 * 152 | 0) + 8 >> 2] - d20 * +HEAPF32[i15 + (i16 * 152 | 0) + 12 >> 2];
+ d47 = d45 * +HEAPF32[i15 + (i16 * 152 | 0) + 36 >> 2] - d20 * +HEAPF32[i15 + (i16 * 152 | 0) + 40 >> 2];
+ d20 = d45 * +HEAPF32[i15 + (i16 * 152 | 0) + 44 >> 2] - d20 * +HEAPF32[i15 + (i16 * 152 | 0) + 48 >> 2];
+ d45 = d30 + d24;
+ d46 = d17 * d44;
+ d48 = d18 * d19;
+ d19 = d45 + d44 * d46 + d19 * d48;
+ d18 = d45 + d47 * d17 * d47 + d20 * d18 * d20;
+ d17 = d45 + d46 * d47 + d48 * d20;
+ d20 = d19 * d18 - d17 * d17;
+ if (!(d19 * d19 < d20 * 1.0e3)) {
+ HEAP32[i31 >> 2] = 1;
+ break;
+ }
+ HEAPF32[i15 + (i16 * 152 | 0) + 96 >> 2] = d19;
+ HEAPF32[i15 + (i16 * 152 | 0) + 100 >> 2] = d17;
+ HEAPF32[i15 + (i16 * 152 | 0) + 104 >> 2] = d17;
+ HEAPF32[i15 + (i16 * 152 | 0) + 108 >> 2] = d18;
+ if (d20 != 0.0) {
+ d20 = 1.0 / d20;
+ }
+ d48 = -(d20 * d17);
+ HEAPF32[i15 + (i16 * 152 | 0) + 80 >> 2] = d18 * d20;
+ HEAPF32[i15 + (i16 * 152 | 0) + 84 >> 2] = d48;
+ HEAPF32[i15 + (i16 * 152 | 0) + 88 >> 2] = d48;
+ HEAPF32[i15 + (i16 * 152 | 0) + 92 >> 2] = d19 * d20;
+ }
+ }
+ } while (0);
+ i16 = i16 + 1 | 0;
+ if ((i16 | 0) >= (HEAP32[i4 >> 2] | 0)) {
+ i2 = 21;
+ break;
+ }
+ }
+ if ((i2 | 0) == 4) {
+ ___assert_fail(6584, 6520, 168, 6616);
+ } else if ((i2 | 0) == 21) {
+ STACKTOP = i1;
+ return;
+ }
+}
+function __Z17b2CollidePolygonsP10b2ManifoldPK14b2PolygonShapeRK11b2TransformS3_S6_(i5, i27, i28, i24, i14) {
+ i5 = i5 | 0;
+ i27 = i27 | 0;
+ i28 = i28 | 0;
+ i24 = i24 | 0;
+ i14 = i14 | 0;
+ var i1 = 0, i2 = 0, d3 = 0.0, i4 = 0, d6 = 0.0, d7 = 0.0, d8 = 0.0, d9 = 0.0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, d15 = 0.0, d16 = 0.0, i17 = 0, d18 = 0.0, d19 = 0.0, i20 = 0, d21 = 0.0, d22 = 0.0, d23 = 0.0, d25 = 0.0, d26 = 0.0, d29 = 0.0, d30 = 0.0, i31 = 0, d32 = 0.0, i33 = 0, i34 = 0, d35 = 0.0, d36 = 0.0, d37 = 0.0, d38 = 0.0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 96 | 0;
+ i17 = i1 + 92 | 0;
+ i20 = i1 + 88 | 0;
+ i13 = i1;
+ i11 = i1 + 80 | 0;
+ i12 = i1 + 56 | 0;
+ i4 = i1 + 32 | 0;
+ i10 = i1 + 24 | 0;
+ i2 = i5 + 60 | 0;
+ HEAP32[i2 >> 2] = 0;
+ d3 = +HEAPF32[i27 + 8 >> 2] + +HEAPF32[i24 + 8 >> 2];
+ HEAP32[i17 >> 2] = 0;
+ d7 = +__ZL19b2FindMaxSeparationPiPK14b2PolygonShapeRK11b2TransformS2_S5_(i17, i27, i28, i24, i14);
+ if (d7 > d3) {
+ STACKTOP = i1;
+ return;
+ }
+ HEAP32[i20 >> 2] = 0;
+ d6 = +__ZL19b2FindMaxSeparationPiPK14b2PolygonShapeRK11b2TransformS2_S5_(i20, i24, i14, i27, i28);
+ if (d6 > d3) {
+ STACKTOP = i1;
+ return;
+ }
+ if (d6 > d7 * .9800000190734863 + .0010000000474974513) {
+ d18 = +HEAPF32[i14 >> 2];
+ d19 = +HEAPF32[i14 + 4 >> 2];
+ d15 = +HEAPF32[i14 + 8 >> 2];
+ d16 = +HEAPF32[i14 + 12 >> 2];
+ d9 = +HEAPF32[i28 >> 2];
+ d6 = +HEAPF32[i28 + 4 >> 2];
+ d7 = +HEAPF32[i28 + 8 >> 2];
+ d8 = +HEAPF32[i28 + 12 >> 2];
+ i17 = HEAP32[i20 >> 2] | 0;
+ HEAP32[i5 + 56 >> 2] = 2;
+ i14 = 1;
+ i20 = i24;
+ } else {
+ d18 = +HEAPF32[i28 >> 2];
+ d19 = +HEAPF32[i28 + 4 >> 2];
+ d15 = +HEAPF32[i28 + 8 >> 2];
+ d16 = +HEAPF32[i28 + 12 >> 2];
+ d9 = +HEAPF32[i14 >> 2];
+ d6 = +HEAPF32[i14 + 4 >> 2];
+ d7 = +HEAPF32[i14 + 8 >> 2];
+ d8 = +HEAPF32[i14 + 12 >> 2];
+ i17 = HEAP32[i17 >> 2] | 0;
+ HEAP32[i5 + 56 >> 2] = 1;
+ i14 = 0;
+ i20 = i27;
+ i27 = i24;
+ }
+ i28 = HEAP32[i27 + 148 >> 2] | 0;
+ if (!((i17 | 0) > -1)) {
+ ___assert_fail(5640, 5688, 151, 5728);
+ }
+ i24 = HEAP32[i20 + 148 >> 2] | 0;
+ if ((i24 | 0) <= (i17 | 0)) {
+ ___assert_fail(5640, 5688, 151, 5728);
+ }
+ d21 = +HEAPF32[i20 + (i17 << 3) + 84 >> 2];
+ d36 = +HEAPF32[i20 + (i17 << 3) + 88 >> 2];
+ d22 = d16 * d21 - d15 * d36;
+ d36 = d15 * d21 + d16 * d36;
+ d21 = d8 * d22 + d7 * d36;
+ d22 = d8 * d36 - d7 * d22;
+ if ((i28 | 0) > 0) {
+ i33 = 0;
+ i34 = 0;
+ d23 = 3.4028234663852886e+38;
+ while (1) {
+ d25 = d21 * +HEAPF32[i27 + (i33 << 3) + 84 >> 2] + d22 * +HEAPF32[i27 + (i33 << 3) + 88 >> 2];
+ i31 = d25 < d23;
+ i34 = i31 ? i33 : i34;
+ i33 = i33 + 1 | 0;
+ if ((i33 | 0) == (i28 | 0)) {
+ break;
+ } else {
+ d23 = i31 ? d25 : d23;
+ }
+ }
+ } else {
+ i34 = 0;
+ }
+ i31 = i34 + 1 | 0;
+ i33 = (i31 | 0) < (i28 | 0) ? i31 : 0;
+ d35 = +HEAPF32[i27 + (i34 << 3) + 20 >> 2];
+ d32 = +HEAPF32[i27 + (i34 << 3) + 24 >> 2];
+ d36 = +(d9 + (d8 * d35 - d7 * d32));
+ d32 = +(d6 + (d7 * d35 + d8 * d32));
+ i31 = i13;
+ HEAPF32[i31 >> 2] = d36;
+ HEAPF32[i31 + 4 >> 2] = d32;
+ i31 = i17 & 255;
+ i28 = i13 + 8 | 0;
+ HEAP8[i28] = i31;
+ HEAP8[i28 + 1 | 0] = i34;
+ HEAP8[i28 + 2 | 0] = 1;
+ HEAP8[i28 + 3 | 0] = 0;
+ d32 = +HEAPF32[i27 + (i33 << 3) + 20 >> 2];
+ d36 = +HEAPF32[i27 + (i33 << 3) + 24 >> 2];
+ d35 = +(d9 + (d8 * d32 - d7 * d36));
+ d36 = +(d6 + (d7 * d32 + d8 * d36));
+ i27 = i13 + 12 | 0;
+ HEAPF32[i27 >> 2] = d35;
+ HEAPF32[i27 + 4 >> 2] = d36;
+ i27 = i13 + 20 | 0;
+ HEAP8[i27] = i31;
+ HEAP8[i27 + 1 | 0] = i33;
+ HEAP8[i27 + 2 | 0] = 1;
+ HEAP8[i27 + 3 | 0] = 0;
+ i27 = i17 + 1 | 0;
+ i24 = (i27 | 0) < (i24 | 0) ? i27 : 0;
+ i34 = i20 + (i17 << 3) + 20 | 0;
+ d26 = +HEAPF32[i34 >> 2];
+ d25 = +HEAPF32[i34 + 4 >> 2];
+ i34 = i20 + (i24 << 3) + 20 | 0;
+ d30 = +HEAPF32[i34 >> 2];
+ d29 = +HEAPF32[i34 + 4 >> 2];
+ d32 = d30 - d26;
+ d35 = d29 - d25;
+ d21 = +Math_sqrt(+(d32 * d32 + d35 * d35));
+ if (!(d21 < 1.1920928955078125e-7)) {
+ d36 = 1.0 / d21;
+ d32 = d32 * d36;
+ d35 = d35 * d36;
+ }
+ d36 = d16 * d32 - d15 * d35;
+ d21 = d16 * d35 + d15 * d32;
+ HEAPF32[i11 >> 2] = d36;
+ HEAPF32[i11 + 4 >> 2] = d21;
+ d22 = -d36;
+ d38 = d18 + (d16 * d26 - d15 * d25);
+ d37 = d19 + (d15 * d26 + d16 * d25);
+ d23 = d38 * d21 + d37 * d22;
+ HEAPF32[i10 >> 2] = d22;
+ HEAPF32[i10 + 4 >> 2] = -d21;
+ if ((__Z19b2ClipSegmentToLineP12b2ClipVertexPKS_RK6b2Vec2fi(i12, i13, i10, d3 - (d38 * d36 + d37 * d21), i17) | 0) < 2) {
+ STACKTOP = i1;
+ return;
+ }
+ if ((__Z19b2ClipSegmentToLineP12b2ClipVertexPKS_RK6b2Vec2fi(i4, i12, i11, d3 + ((d18 + (d16 * d30 - d15 * d29)) * d36 + (d19 + (d15 * d30 + d16 * d29)) * d21), i24) | 0) < 2) {
+ STACKTOP = i1;
+ return;
+ }
+ d16 = +d35;
+ d15 = +-d32;
+ i10 = i5 + 40 | 0;
+ HEAPF32[i10 >> 2] = d16;
+ HEAPF32[i10 + 4 >> 2] = d15;
+ d15 = +((d26 + d30) * .5);
+ d16 = +((d25 + d29) * .5);
+ i10 = i5 + 48 | 0;
+ HEAPF32[i10 >> 2] = d15;
+ HEAPF32[i10 + 4 >> 2] = d16;
+ d16 = +HEAPF32[i4 >> 2];
+ d15 = +HEAPF32[i4 + 4 >> 2];
+ i10 = !(d21 * d16 + d15 * d22 - d23 <= d3);
+ if (i14 << 24 >> 24 == 0) {
+ if (i10) {
+ i10 = 0;
+ } else {
+ d38 = d16 - d9;
+ d36 = d15 - d6;
+ d37 = +(d8 * d38 + d7 * d36);
+ d38 = +(d8 * d36 - d7 * d38);
+ i10 = i5;
+ HEAPF32[i10 >> 2] = d37;
+ HEAPF32[i10 + 4 >> 2] = d38;
+ HEAP32[i5 + 16 >> 2] = HEAP32[i4 + 8 >> 2];
+ i10 = 1;
+ }
+ d16 = +HEAPF32[i4 + 12 >> 2];
+ d15 = +HEAPF32[i4 + 16 >> 2];
+ if (d21 * d16 + d15 * d22 - d23 <= d3) {
+ d38 = d16 - d9;
+ d36 = d15 - d6;
+ d37 = +(d8 * d38 + d7 * d36);
+ d38 = +(d8 * d36 - d7 * d38);
+ i34 = i5 + (i10 * 20 | 0) | 0;
+ HEAPF32[i34 >> 2] = d37;
+ HEAPF32[i34 + 4 >> 2] = d38;
+ HEAP32[i5 + (i10 * 20 | 0) + 16 >> 2] = HEAP32[i4 + 20 >> 2];
+ i10 = i10 + 1 | 0;
+ }
+ } else {
+ if (i10) {
+ i10 = 0;
+ } else {
+ d38 = d16 - d9;
+ d36 = d15 - d6;
+ d37 = +(d8 * d38 + d7 * d36);
+ d38 = +(d8 * d36 - d7 * d38);
+ i10 = i5;
+ HEAPF32[i10 >> 2] = d37;
+ HEAPF32[i10 + 4 >> 2] = d38;
+ i10 = i5 + 16 | 0;
+ i34 = HEAP32[i4 + 8 >> 2] | 0;
+ HEAP32[i10 >> 2] = i34;
+ HEAP8[i10] = i34 >>> 8;
+ HEAP8[i10 + 1 | 0] = i34;
+ HEAP8[i10 + 2 | 0] = i34 >>> 24;
+ HEAP8[i10 + 3 | 0] = i34 >>> 16;
+ i10 = 1;
+ }
+ d16 = +HEAPF32[i4 + 12 >> 2];
+ d15 = +HEAPF32[i4 + 16 >> 2];
+ if (d21 * d16 + d15 * d22 - d23 <= d3) {
+ d38 = d16 - d9;
+ d36 = d15 - d6;
+ d37 = +(d8 * d38 + d7 * d36);
+ d38 = +(d8 * d36 - d7 * d38);
+ i34 = i5 + (i10 * 20 | 0) | 0;
+ HEAPF32[i34 >> 2] = d37;
+ HEAPF32[i34 + 4 >> 2] = d38;
+ i34 = i5 + (i10 * 20 | 0) + 16 | 0;
+ i33 = HEAP32[i4 + 20 >> 2] | 0;
+ HEAP32[i34 >> 2] = i33;
+ HEAP8[i34] = i33 >>> 8;
+ HEAP8[i34 + 1 | 0] = i33;
+ HEAP8[i34 + 2 | 0] = i33 >>> 24;
+ HEAP8[i34 + 3 | 0] = i33 >>> 16;
+ i10 = i10 + 1 | 0;
+ }
+ }
+ HEAP32[i2 >> 2] = i10;
+ STACKTOP = i1;
+ return;
+}
+function __ZN8b2Island8SolveTOIERK10b2TimeStepii(i4, i11, i15, i18) {
+ i4 = i4 | 0;
+ i11 = i11 | 0;
+ i15 = i15 | 0;
+ i18 = i18 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, d12 = 0.0, d13 = 0.0, d14 = 0.0, d16 = 0.0, d17 = 0.0, d19 = 0.0, d20 = 0.0, d21 = 0.0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, d26 = 0.0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 128 | 0;
+ i2 = i1 + 96 | 0;
+ i10 = i1 + 52 | 0;
+ i3 = i1;
+ i6 = i4 + 28 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) <= (i15 | 0)) {
+ ___assert_fail(5464, 5488, 386, 5520);
+ }
+ if ((i5 | 0) <= (i18 | 0)) {
+ ___assert_fail(5536, 5488, 387, 5520);
+ }
+ if ((i5 | 0) > 0) {
+ i9 = i4 + 8 | 0;
+ i8 = i4 + 20 | 0;
+ i7 = i4 + 24 | 0;
+ i22 = 0;
+ while (1) {
+ i23 = HEAP32[(HEAP32[i9 >> 2] | 0) + (i22 << 2) >> 2] | 0;
+ i5 = i23 + 44 | 0;
+ i24 = HEAP32[i5 + 4 >> 2] | 0;
+ i25 = (HEAP32[i8 >> 2] | 0) + (i22 * 12 | 0) | 0;
+ HEAP32[i25 >> 2] = HEAP32[i5 >> 2];
+ HEAP32[i25 + 4 >> 2] = i24;
+ HEAPF32[(HEAP32[i8 >> 2] | 0) + (i22 * 12 | 0) + 8 >> 2] = +HEAPF32[i23 + 56 >> 2];
+ i25 = i23 + 64 | 0;
+ i24 = HEAP32[i25 + 4 >> 2] | 0;
+ i5 = (HEAP32[i7 >> 2] | 0) + (i22 * 12 | 0) | 0;
+ HEAP32[i5 >> 2] = HEAP32[i25 >> 2];
+ HEAP32[i5 + 4 >> 2] = i24;
+ i5 = HEAP32[i7 >> 2] | 0;
+ HEAPF32[i5 + (i22 * 12 | 0) + 8 >> 2] = +HEAPF32[i23 + 72 >> 2];
+ i22 = i22 + 1 | 0;
+ if ((i22 | 0) >= (HEAP32[i6 >> 2] | 0)) {
+ i22 = i5;
+ break;
+ }
+ }
+ } else {
+ i8 = i4 + 20 | 0;
+ i22 = HEAP32[i4 + 24 >> 2] | 0;
+ }
+ i5 = i4 + 12 | 0;
+ HEAP32[i10 + 24 >> 2] = HEAP32[i5 >> 2];
+ i7 = i4 + 36 | 0;
+ HEAP32[i10 + 28 >> 2] = HEAP32[i7 >> 2];
+ HEAP32[i10 + 40 >> 2] = HEAP32[i4 >> 2];
+ HEAP32[i10 + 0 >> 2] = HEAP32[i11 + 0 >> 2];
+ HEAP32[i10 + 4 >> 2] = HEAP32[i11 + 4 >> 2];
+ HEAP32[i10 + 8 >> 2] = HEAP32[i11 + 8 >> 2];
+ HEAP32[i10 + 12 >> 2] = HEAP32[i11 + 12 >> 2];
+ HEAP32[i10 + 16 >> 2] = HEAP32[i11 + 16 >> 2];
+ HEAP32[i10 + 20 >> 2] = HEAP32[i11 + 20 >> 2];
+ HEAP32[i10 + 32 >> 2] = HEAP32[i8 >> 2];
+ i9 = i4 + 24 | 0;
+ HEAP32[i10 + 36 >> 2] = i22;
+ __ZN15b2ContactSolverC2EP18b2ContactSolverDef(i3, i10);
+ i10 = i11 + 16 | 0;
+ L13 : do {
+ if ((HEAP32[i10 >> 2] | 0) > 0) {
+ i22 = 0;
+ do {
+ i22 = i22 + 1 | 0;
+ if (__ZN15b2ContactSolver27SolveTOIPositionConstraintsEii(i3, i15, i18) | 0) {
+ break L13;
+ }
+ } while ((i22 | 0) < (HEAP32[i10 >> 2] | 0));
+ }
+ } while (0);
+ i10 = i4 + 8 | 0;
+ i24 = (HEAP32[i8 >> 2] | 0) + (i15 * 12 | 0) | 0;
+ i25 = HEAP32[i24 + 4 >> 2] | 0;
+ i23 = (HEAP32[(HEAP32[i10 >> 2] | 0) + (i15 << 2) >> 2] | 0) + 36 | 0;
+ HEAP32[i23 >> 2] = HEAP32[i24 >> 2];
+ HEAP32[i23 + 4 >> 2] = i25;
+ i23 = HEAP32[i8 >> 2] | 0;
+ i25 = HEAP32[i10 >> 2] | 0;
+ HEAPF32[(HEAP32[i25 + (i15 << 2) >> 2] | 0) + 52 >> 2] = +HEAPF32[i23 + (i15 * 12 | 0) + 8 >> 2];
+ i23 = i23 + (i18 * 12 | 0) | 0;
+ i24 = HEAP32[i23 + 4 >> 2] | 0;
+ i25 = (HEAP32[i25 + (i18 << 2) >> 2] | 0) + 36 | 0;
+ HEAP32[i25 >> 2] = HEAP32[i23 >> 2];
+ HEAP32[i25 + 4 >> 2] = i24;
+ HEAPF32[(HEAP32[(HEAP32[i10 >> 2] | 0) + (i18 << 2) >> 2] | 0) + 52 >> 2] = +HEAPF32[(HEAP32[i8 >> 2] | 0) + (i18 * 12 | 0) + 8 >> 2];
+ __ZN15b2ContactSolver29InitializeVelocityConstraintsEv(i3);
+ i18 = i11 + 12 | 0;
+ if ((HEAP32[i18 >> 2] | 0) > 0) {
+ i15 = 0;
+ do {
+ __ZN15b2ContactSolver24SolveVelocityConstraintsEv(i3);
+ i15 = i15 + 1 | 0;
+ } while ((i15 | 0) < (HEAP32[i18 >> 2] | 0));
+ }
+ d16 = +HEAPF32[i11 >> 2];
+ if ((HEAP32[i6 >> 2] | 0) > 0) {
+ i15 = 0;
+ do {
+ i25 = HEAP32[i8 >> 2] | 0;
+ i11 = i25 + (i15 * 12 | 0) | 0;
+ i24 = i11;
+ d12 = +HEAPF32[i24 >> 2];
+ d14 = +HEAPF32[i24 + 4 >> 2];
+ d13 = +HEAPF32[i25 + (i15 * 12 | 0) + 8 >> 2];
+ i25 = HEAP32[i9 >> 2] | 0;
+ i24 = i25 + (i15 * 12 | 0) | 0;
+ d19 = +HEAPF32[i24 >> 2];
+ d20 = +HEAPF32[i24 + 4 >> 2];
+ d17 = +HEAPF32[i25 + (i15 * 12 | 0) + 8 >> 2];
+ d26 = d16 * d19;
+ d21 = d16 * d20;
+ d21 = d26 * d26 + d21 * d21;
+ if (d21 > 4.0) {
+ d26 = 2.0 / +Math_sqrt(+d21);
+ d19 = d19 * d26;
+ d20 = d20 * d26;
+ }
+ d21 = d16 * d17;
+ if (d21 * d21 > 2.4674012660980225) {
+ if (!(d21 > 0.0)) {
+ d21 = -d21;
+ }
+ d17 = d17 * (1.5707963705062866 / d21);
+ }
+ d21 = d12 + d16 * d19;
+ d14 = d14 + d16 * d20;
+ d26 = d13 + d16 * d17;
+ d12 = +d21;
+ d13 = +d14;
+ i25 = i11;
+ HEAPF32[i25 >> 2] = d12;
+ HEAPF32[i25 + 4 >> 2] = d13;
+ HEAPF32[(HEAP32[i8 >> 2] | 0) + (i15 * 12 | 0) + 8 >> 2] = d26;
+ d19 = +d19;
+ d20 = +d20;
+ i25 = (HEAP32[i9 >> 2] | 0) + (i15 * 12 | 0) | 0;
+ HEAPF32[i25 >> 2] = d19;
+ HEAPF32[i25 + 4 >> 2] = d20;
+ HEAPF32[(HEAP32[i9 >> 2] | 0) + (i15 * 12 | 0) + 8 >> 2] = d17;
+ i25 = HEAP32[(HEAP32[i10 >> 2] | 0) + (i15 << 2) >> 2] | 0;
+ i24 = i25 + 44 | 0;
+ HEAPF32[i24 >> 2] = d12;
+ HEAPF32[i24 + 4 >> 2] = d13;
+ HEAPF32[i25 + 56 >> 2] = d26;
+ i24 = i25 + 64 | 0;
+ HEAPF32[i24 >> 2] = d19;
+ HEAPF32[i24 + 4 >> 2] = d20;
+ HEAPF32[i25 + 72 >> 2] = d17;
+ d17 = +Math_sin(+d26);
+ HEAPF32[i25 + 20 >> 2] = d17;
+ d20 = +Math_cos(+d26);
+ HEAPF32[i25 + 24 >> 2] = d20;
+ d19 = +HEAPF32[i25 + 28 >> 2];
+ d26 = +HEAPF32[i25 + 32 >> 2];
+ d21 = +(d21 - (d20 * d19 - d17 * d26));
+ d26 = +(d14 - (d17 * d19 + d20 * d26));
+ i25 = i25 + 12 | 0;
+ HEAPF32[i25 >> 2] = d21;
+ HEAPF32[i25 + 4 >> 2] = d26;
+ i15 = i15 + 1 | 0;
+ } while ((i15 | 0) < (HEAP32[i6 >> 2] | 0));
+ }
+ i6 = HEAP32[i3 + 40 >> 2] | 0;
+ i4 = i4 + 4 | 0;
+ if ((HEAP32[i4 >> 2] | 0) == 0) {
+ __ZN15b2ContactSolverD2Ev(i3);
+ STACKTOP = i1;
+ return;
+ }
+ if ((HEAP32[i7 >> 2] | 0) <= 0) {
+ __ZN15b2ContactSolverD2Ev(i3);
+ STACKTOP = i1;
+ return;
+ }
+ i8 = i2 + 16 | 0;
+ i9 = 0;
+ do {
+ i10 = HEAP32[(HEAP32[i5 >> 2] | 0) + (i9 << 2) >> 2] | 0;
+ i11 = HEAP32[i6 + (i9 * 152 | 0) + 144 >> 2] | 0;
+ HEAP32[i8 >> 2] = i11;
+ if ((i11 | 0) > 0) {
+ i15 = 0;
+ do {
+ HEAPF32[i2 + (i15 << 2) >> 2] = +HEAPF32[i6 + (i9 * 152 | 0) + (i15 * 36 | 0) + 16 >> 2];
+ HEAPF32[i2 + (i15 << 2) + 8 >> 2] = +HEAPF32[i6 + (i9 * 152 | 0) + (i15 * 36 | 0) + 20 >> 2];
+ i15 = i15 + 1 | 0;
+ } while ((i15 | 0) != (i11 | 0));
+ }
+ i25 = HEAP32[i4 >> 2] | 0;
+ FUNCTION_TABLE_viii[HEAP32[(HEAP32[i25 >> 2] | 0) + 20 >> 2] & 3](i25, i10, i2);
+ i9 = i9 + 1 | 0;
+ } while ((i9 | 0) < (HEAP32[i7 >> 2] | 0));
+ __ZN15b2ContactSolverD2Ev(i3);
+ STACKTOP = i1;
+ return;
+}
+function __ZN20b2SeparationFunction10InitializeEPK14b2SimplexCachePK15b2DistanceProxyRK7b2SweepS5_S8_f(i2, i11, i13, i21, i12, i24, d9) {
+ i2 = i2 | 0;
+ i11 = i11 | 0;
+ i13 = i13 | 0;
+ i21 = i21 | 0;
+ i12 = i12 | 0;
+ i24 = i24 | 0;
+ d9 = +d9;
+ var i1 = 0, d3 = 0.0, d4 = 0.0, d5 = 0.0, d6 = 0.0, d7 = 0.0, d8 = 0.0, d10 = 0.0, i14 = 0, d15 = 0.0, d16 = 0.0, d17 = 0.0, d18 = 0.0, d19 = 0.0, d20 = 0.0, d22 = 0.0, i23 = 0, i25 = 0, i26 = 0, i27 = 0, d28 = 0.0, d29 = 0.0;
+ i1 = STACKTOP;
+ HEAP32[i2 >> 2] = i13;
+ HEAP32[i2 + 4 >> 2] = i12;
+ i14 = HEAP16[i11 + 4 >> 1] | 0;
+ if (!(i14 << 16 >> 16 != 0 & (i14 & 65535) < 3)) {
+ ___assert_fail(3744, 3560, 50, 3768);
+ }
+ i23 = i2 + 8 | 0;
+ i25 = i23 + 0 | 0;
+ i27 = i21 + 0 | 0;
+ i26 = i25 + 36 | 0;
+ do {
+ HEAP32[i25 >> 2] = HEAP32[i27 >> 2];
+ i25 = i25 + 4 | 0;
+ i27 = i27 + 4 | 0;
+ } while ((i25 | 0) < (i26 | 0));
+ i21 = i2 + 44 | 0;
+ i25 = i21 + 0 | 0;
+ i27 = i24 + 0 | 0;
+ i26 = i25 + 36 | 0;
+ do {
+ HEAP32[i25 >> 2] = HEAP32[i27 >> 2];
+ i25 = i25 + 4 | 0;
+ i27 = i27 + 4 | 0;
+ } while ((i25 | 0) < (i26 | 0));
+ d19 = 1.0 - d9;
+ d4 = d19 * +HEAPF32[i2 + 32 >> 2] + +HEAPF32[i2 + 36 >> 2] * d9;
+ d3 = +Math_sin(+d4);
+ d4 = +Math_cos(+d4);
+ d7 = +HEAPF32[i23 >> 2];
+ d5 = +HEAPF32[i2 + 12 >> 2];
+ d8 = d19 * +HEAPF32[i2 + 16 >> 2] + +HEAPF32[i2 + 24 >> 2] * d9 - (d4 * d7 - d3 * d5);
+ d5 = d19 * +HEAPF32[i2 + 20 >> 2] + +HEAPF32[i2 + 28 >> 2] * d9 - (d3 * d7 + d4 * d5);
+ d7 = d19 * +HEAPF32[i2 + 68 >> 2] + +HEAPF32[i2 + 72 >> 2] * d9;
+ d6 = +Math_sin(+d7);
+ d7 = +Math_cos(+d7);
+ d20 = +HEAPF32[i21 >> 2];
+ d22 = +HEAPF32[i2 + 48 >> 2];
+ d10 = d19 * +HEAPF32[i2 + 52 >> 2] + +HEAPF32[i2 + 60 >> 2] * d9 - (d7 * d20 - d6 * d22);
+ d9 = d19 * +HEAPF32[i2 + 56 >> 2] + +HEAPF32[i2 + 64 >> 2] * d9 - (d6 * d20 + d7 * d22);
+ if (i14 << 16 >> 16 == 1) {
+ HEAP32[i2 + 80 >> 2] = 0;
+ i14 = HEAPU8[i11 + 6 | 0] | 0;
+ if ((HEAP32[i13 + 20 >> 2] | 0) <= (i14 | 0)) {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ i27 = (HEAP32[i13 + 16 >> 2] | 0) + (i14 << 3) | 0;
+ d15 = +HEAPF32[i27 >> 2];
+ d16 = +HEAPF32[i27 + 4 >> 2];
+ i11 = HEAPU8[i11 + 9 | 0] | 0;
+ if ((HEAP32[i12 + 20 >> 2] | 0) <= (i11 | 0)) {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ i11 = (HEAP32[i12 + 16 >> 2] | 0) + (i11 << 3) | 0;
+ d20 = +HEAPF32[i11 >> 2];
+ d22 = +HEAPF32[i11 + 4 >> 2];
+ i11 = i2 + 92 | 0;
+ d8 = d10 + (d7 * d20 - d6 * d22) - (d8 + (d4 * d15 - d3 * d16));
+ d4 = d9 + (d6 * d20 + d7 * d22) - (d5 + (d3 * d15 + d4 * d16));
+ d22 = +d8;
+ d3 = +d4;
+ i27 = i11;
+ HEAPF32[i27 >> 2] = d22;
+ HEAPF32[i27 + 4 >> 2] = d3;
+ d3 = +Math_sqrt(+(d8 * d8 + d4 * d4));
+ if (d3 < 1.1920928955078125e-7) {
+ d22 = 0.0;
+ STACKTOP = i1;
+ return +d22;
+ }
+ d22 = 1.0 / d3;
+ HEAPF32[i11 >> 2] = d8 * d22;
+ HEAPF32[i2 + 96 >> 2] = d4 * d22;
+ d22 = d3;
+ STACKTOP = i1;
+ return +d22;
+ }
+ i14 = i11 + 6 | 0;
+ i21 = i11 + 7 | 0;
+ i23 = i2 + 80 | 0;
+ if ((HEAP8[i14] | 0) == (HEAP8[i21] | 0)) {
+ HEAP32[i23 >> 2] = 2;
+ i23 = HEAPU8[i11 + 9 | 0] | 0;
+ i21 = HEAP32[i12 + 20 >> 2] | 0;
+ if ((i21 | 0) <= (i23 | 0)) {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ i12 = HEAP32[i12 + 16 >> 2] | 0;
+ i27 = i12 + (i23 << 3) | 0;
+ d16 = +HEAPF32[i27 >> 2];
+ d15 = +HEAPF32[i27 + 4 >> 2];
+ i11 = HEAPU8[i11 + 10 | 0] | 0;
+ if ((i21 | 0) <= (i11 | 0)) {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ i11 = i12 + (i11 << 3) | 0;
+ d20 = +HEAPF32[i11 >> 2];
+ d18 = +HEAPF32[i11 + 4 >> 2];
+ i11 = i2 + 92 | 0;
+ d22 = d20 - d16;
+ d19 = d18 - d15;
+ d17 = -d22;
+ d29 = +d19;
+ d28 = +d17;
+ i27 = i11;
+ HEAPF32[i27 >> 2] = d29;
+ HEAPF32[i27 + 4 >> 2] = d28;
+ d22 = +Math_sqrt(+(d19 * d19 + d22 * d22));
+ if (!(d22 < 1.1920928955078125e-7)) {
+ d29 = 1.0 / d22;
+ d19 = d19 * d29;
+ HEAPF32[i11 >> 2] = d19;
+ d17 = d29 * d17;
+ HEAPF32[i2 + 96 >> 2] = d17;
+ }
+ d16 = (d16 + d20) * .5;
+ d15 = (d15 + d18) * .5;
+ d28 = +d16;
+ d29 = +d15;
+ i2 = i2 + 84 | 0;
+ HEAPF32[i2 >> 2] = d28;
+ HEAPF32[i2 + 4 >> 2] = d29;
+ i2 = HEAPU8[i14] | 0;
+ if ((HEAP32[i13 + 20 >> 2] | 0) <= (i2 | 0)) {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ i27 = (HEAP32[i13 + 16 >> 2] | 0) + (i2 << 3) | 0;
+ d28 = +HEAPF32[i27 >> 2];
+ d29 = +HEAPF32[i27 + 4 >> 2];
+ d3 = (d7 * d19 - d6 * d17) * (d8 + (d4 * d28 - d3 * d29) - (d10 + (d7 * d16 - d6 * d15))) + (d6 * d19 + d7 * d17) * (d5 + (d3 * d28 + d4 * d29) - (d9 + (d6 * d16 + d7 * d15)));
+ if (!(d3 < 0.0)) {
+ d29 = d3;
+ STACKTOP = i1;
+ return +d29;
+ }
+ d28 = +-d19;
+ d29 = +-d17;
+ i27 = i11;
+ HEAPF32[i27 >> 2] = d28;
+ HEAPF32[i27 + 4 >> 2] = d29;
+ d29 = -d3;
+ STACKTOP = i1;
+ return +d29;
+ } else {
+ HEAP32[i23 >> 2] = 1;
+ i23 = HEAPU8[i14] | 0;
+ i14 = HEAP32[i13 + 20 >> 2] | 0;
+ if ((i14 | 0) <= (i23 | 0)) {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ i13 = HEAP32[i13 + 16 >> 2] | 0;
+ i27 = i13 + (i23 << 3) | 0;
+ d16 = +HEAPF32[i27 >> 2];
+ d15 = +HEAPF32[i27 + 4 >> 2];
+ i21 = HEAPU8[i21] | 0;
+ if ((i14 | 0) <= (i21 | 0)) {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ i13 = i13 + (i21 << 3) | 0;
+ d20 = +HEAPF32[i13 >> 2];
+ d18 = +HEAPF32[i13 + 4 >> 2];
+ i13 = i2 + 92 | 0;
+ d22 = d20 - d16;
+ d19 = d18 - d15;
+ d17 = -d22;
+ d28 = +d19;
+ d29 = +d17;
+ i27 = i13;
+ HEAPF32[i27 >> 2] = d28;
+ HEAPF32[i27 + 4 >> 2] = d29;
+ d22 = +Math_sqrt(+(d19 * d19 + d22 * d22));
+ if (!(d22 < 1.1920928955078125e-7)) {
+ d29 = 1.0 / d22;
+ d19 = d19 * d29;
+ HEAPF32[i13 >> 2] = d19;
+ d17 = d29 * d17;
+ HEAPF32[i2 + 96 >> 2] = d17;
+ }
+ d16 = (d16 + d20) * .5;
+ d15 = (d15 + d18) * .5;
+ d28 = +d16;
+ d29 = +d15;
+ i2 = i2 + 84 | 0;
+ HEAPF32[i2 >> 2] = d28;
+ HEAPF32[i2 + 4 >> 2] = d29;
+ i2 = HEAPU8[i11 + 9 | 0] | 0;
+ if ((HEAP32[i12 + 20 >> 2] | 0) <= (i2 | 0)) {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ i27 = (HEAP32[i12 + 16 >> 2] | 0) + (i2 << 3) | 0;
+ d28 = +HEAPF32[i27 >> 2];
+ d29 = +HEAPF32[i27 + 4 >> 2];
+ d3 = (d4 * d19 - d3 * d17) * (d10 + (d7 * d28 - d6 * d29) - (d8 + (d4 * d16 - d3 * d15))) + (d3 * d19 + d4 * d17) * (d9 + (d6 * d28 + d7 * d29) - (d5 + (d3 * d16 + d4 * d15)));
+ if (!(d3 < 0.0)) {
+ d29 = d3;
+ STACKTOP = i1;
+ return +d29;
+ }
+ d28 = +-d19;
+ d29 = +-d17;
+ i27 = i13;
+ HEAPF32[i27 >> 2] = d28;
+ HEAPF32[i27 + 4 >> 2] = d29;
+ d29 = -d3;
+ STACKTOP = i1;
+ return +d29;
+ }
+ return 0.0;
+}
+function __ZNK20b2SeparationFunction17FindMinSeparationEPiS0_f(i12, i10, i9, d5) {
+ i12 = i12 | 0;
+ i10 = i10 | 0;
+ i9 = i9 | 0;
+ d5 = +d5;
+ var i1 = 0, d2 = 0.0, d3 = 0.0, d4 = 0.0, d6 = 0.0, d7 = 0.0, d8 = 0.0, d11 = 0.0, d13 = 0.0, d14 = 0.0, i15 = 0, i16 = 0, d17 = 0.0, d18 = 0.0, i19 = 0, d20 = 0.0, d21 = 0.0, i22 = 0, d23 = 0.0, d24 = 0.0, i25 = 0, i26 = 0, i27 = 0;
+ i1 = STACKTOP;
+ d21 = 1.0 - d5;
+ d6 = d21 * +HEAPF32[i12 + 32 >> 2] + +HEAPF32[i12 + 36 >> 2] * d5;
+ d7 = +Math_sin(+d6);
+ d6 = +Math_cos(+d6);
+ d3 = +HEAPF32[i12 + 8 >> 2];
+ d8 = +HEAPF32[i12 + 12 >> 2];
+ d11 = d21 * +HEAPF32[i12 + 16 >> 2] + +HEAPF32[i12 + 24 >> 2] * d5 - (d6 * d3 - d7 * d8);
+ d8 = d21 * +HEAPF32[i12 + 20 >> 2] + +HEAPF32[i12 + 28 >> 2] * d5 - (d7 * d3 + d6 * d8);
+ d3 = d21 * +HEAPF32[i12 + 68 >> 2] + +HEAPF32[i12 + 72 >> 2] * d5;
+ d2 = +Math_sin(+d3);
+ d3 = +Math_cos(+d3);
+ d23 = +HEAPF32[i12 + 44 >> 2];
+ d24 = +HEAPF32[i12 + 48 >> 2];
+ d4 = d21 * +HEAPF32[i12 + 52 >> 2] + +HEAPF32[i12 + 60 >> 2] * d5 - (d3 * d23 - d2 * d24);
+ d5 = d21 * +HEAPF32[i12 + 56 >> 2] + +HEAPF32[i12 + 64 >> 2] * d5 - (d2 * d23 + d3 * d24);
+ i19 = HEAP32[i12 + 80 >> 2] | 0;
+ if ((i19 | 0) == 1) {
+ d23 = +HEAPF32[i12 + 92 >> 2];
+ d14 = +HEAPF32[i12 + 96 >> 2];
+ d13 = d6 * d23 - d7 * d14;
+ d14 = d7 * d23 + d6 * d14;
+ d23 = +HEAPF32[i12 + 84 >> 2];
+ d24 = +HEAPF32[i12 + 88 >> 2];
+ d11 = d11 + (d6 * d23 - d7 * d24);
+ d6 = d8 + (d7 * d23 + d6 * d24);
+ d7 = -d13;
+ d24 = -d14;
+ d8 = d3 * d7 + d2 * d24;
+ d7 = d3 * d24 - d2 * d7;
+ HEAP32[i10 >> 2] = -1;
+ i25 = i12 + 4 | 0;
+ i22 = HEAP32[i25 >> 2] | 0;
+ i19 = HEAP32[i22 + 16 >> 2] | 0;
+ i22 = HEAP32[i22 + 20 >> 2] | 0;
+ if ((i22 | 0) > 1) {
+ i10 = 0;
+ d18 = d7 * +HEAPF32[i19 + 4 >> 2] + d8 * +HEAPF32[i19 >> 2];
+ i12 = 1;
+ while (1) {
+ d17 = d8 * +HEAPF32[i19 + (i12 << 3) >> 2] + d7 * +HEAPF32[i19 + (i12 << 3) + 4 >> 2];
+ i16 = d17 > d18;
+ i10 = i16 ? i12 : i10;
+ i12 = i12 + 1 | 0;
+ if ((i12 | 0) == (i22 | 0)) {
+ break;
+ } else {
+ d18 = i16 ? d17 : d18;
+ }
+ }
+ HEAP32[i9 >> 2] = i10;
+ if ((i10 | 0) > -1) {
+ i15 = i10;
+ } else {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ } else {
+ HEAP32[i9 >> 2] = 0;
+ i15 = 0;
+ }
+ i9 = HEAP32[i25 >> 2] | 0;
+ if ((HEAP32[i9 + 20 >> 2] | 0) <= (i15 | 0)) {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ i27 = (HEAP32[i9 + 16 >> 2] | 0) + (i15 << 3) | 0;
+ d23 = +HEAPF32[i27 >> 2];
+ d24 = +HEAPF32[i27 + 4 >> 2];
+ d24 = d13 * (d4 + (d3 * d23 - d2 * d24) - d11) + d14 * (d5 + (d2 * d23 + d3 * d24) - d6);
+ STACKTOP = i1;
+ return +d24;
+ } else if ((i19 | 0) == 0) {
+ d13 = +HEAPF32[i12 + 92 >> 2];
+ d14 = +HEAPF32[i12 + 96 >> 2];
+ d21 = d6 * d13 + d7 * d14;
+ d24 = d6 * d14 - d7 * d13;
+ d17 = -d13;
+ d23 = -d14;
+ d18 = d3 * d17 + d2 * d23;
+ d17 = d3 * d23 - d2 * d17;
+ i15 = HEAP32[i12 >> 2] | 0;
+ i16 = HEAP32[i15 + 16 >> 2] | 0;
+ i15 = i15 + 20 | 0;
+ i19 = HEAP32[i15 >> 2] | 0;
+ if ((i19 | 0) > 1) {
+ i25 = 0;
+ d23 = d24 * +HEAPF32[i16 + 4 >> 2] + d21 * +HEAPF32[i16 >> 2];
+ i26 = 1;
+ while (1) {
+ d20 = d21 * +HEAPF32[i16 + (i26 << 3) >> 2] + d24 * +HEAPF32[i16 + (i26 << 3) + 4 >> 2];
+ i22 = d20 > d23;
+ i25 = i22 ? i26 : i25;
+ i26 = i26 + 1 | 0;
+ if ((i26 | 0) == (i19 | 0)) {
+ break;
+ } else {
+ d23 = i22 ? d20 : d23;
+ }
+ }
+ } else {
+ i25 = 0;
+ }
+ HEAP32[i10 >> 2] = i25;
+ i19 = HEAP32[i12 + 4 >> 2] | 0;
+ i12 = HEAP32[i19 + 16 >> 2] | 0;
+ i19 = i19 + 20 | 0;
+ i25 = HEAP32[i19 >> 2] | 0;
+ if ((i25 | 0) > 1) {
+ i27 = 0;
+ d20 = d17 * +HEAPF32[i12 + 4 >> 2] + d18 * +HEAPF32[i12 >> 2];
+ i26 = 1;
+ while (1) {
+ d21 = d18 * +HEAPF32[i12 + (i26 << 3) >> 2] + d17 * +HEAPF32[i12 + (i26 << 3) + 4 >> 2];
+ i22 = d21 > d20;
+ i27 = i22 ? i26 : i27;
+ i26 = i26 + 1 | 0;
+ if ((i26 | 0) == (i25 | 0)) {
+ break;
+ } else {
+ d20 = i22 ? d21 : d20;
+ }
+ }
+ } else {
+ i27 = 0;
+ }
+ HEAP32[i9 >> 2] = i27;
+ i9 = HEAP32[i10 >> 2] | 0;
+ if (!((i9 | 0) > -1)) {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ if ((HEAP32[i15 >> 2] | 0) <= (i9 | 0)) {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ i26 = i16 + (i9 << 3) | 0;
+ d18 = +HEAPF32[i26 >> 2];
+ d17 = +HEAPF32[i26 + 4 >> 2];
+ if (!((i27 | 0) > -1)) {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ if ((HEAP32[i19 >> 2] | 0) <= (i27 | 0)) {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ i27 = i12 + (i27 << 3) | 0;
+ d23 = +HEAPF32[i27 >> 2];
+ d24 = +HEAPF32[i27 + 4 >> 2];
+ d24 = d13 * (d4 + (d3 * d23 - d2 * d24) - (d11 + (d6 * d18 - d7 * d17))) + d14 * (d5 + (d2 * d23 + d3 * d24) - (d8 + (d7 * d18 + d6 * d17)));
+ STACKTOP = i1;
+ return +d24;
+ } else if ((i19 | 0) == 2) {
+ d23 = +HEAPF32[i12 + 92 >> 2];
+ d13 = +HEAPF32[i12 + 96 >> 2];
+ d14 = d3 * d23 - d2 * d13;
+ d13 = d2 * d23 + d3 * d13;
+ d23 = +HEAPF32[i12 + 84 >> 2];
+ d24 = +HEAPF32[i12 + 88 >> 2];
+ d4 = d4 + (d3 * d23 - d2 * d24);
+ d2 = d5 + (d2 * d23 + d3 * d24);
+ d3 = -d14;
+ d24 = -d13;
+ d5 = d6 * d3 + d7 * d24;
+ d3 = d6 * d24 - d7 * d3;
+ HEAP32[i9 >> 2] = -1;
+ i22 = HEAP32[i12 >> 2] | 0;
+ i15 = HEAP32[i22 + 16 >> 2] | 0;
+ i22 = HEAP32[i22 + 20 >> 2] | 0;
+ if ((i22 | 0) > 1) {
+ i9 = 0;
+ d17 = d3 * +HEAPF32[i15 + 4 >> 2] + d5 * +HEAPF32[i15 >> 2];
+ i19 = 1;
+ while (1) {
+ d18 = d5 * +HEAPF32[i15 + (i19 << 3) >> 2] + d3 * +HEAPF32[i15 + (i19 << 3) + 4 >> 2];
+ i25 = d18 > d17;
+ i9 = i25 ? i19 : i9;
+ i19 = i19 + 1 | 0;
+ if ((i19 | 0) == (i22 | 0)) {
+ break;
+ } else {
+ d17 = i25 ? d18 : d17;
+ }
+ }
+ HEAP32[i10 >> 2] = i9;
+ if ((i9 | 0) > -1) {
+ i16 = i9;
+ } else {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ } else {
+ HEAP32[i10 >> 2] = 0;
+ i16 = 0;
+ }
+ i9 = HEAP32[i12 >> 2] | 0;
+ if ((HEAP32[i9 + 20 >> 2] | 0) <= (i16 | 0)) {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ i27 = (HEAP32[i9 + 16 >> 2] | 0) + (i16 << 3) | 0;
+ d23 = +HEAPF32[i27 >> 2];
+ d24 = +HEAPF32[i27 + 4 >> 2];
+ d24 = d14 * (d11 + (d6 * d23 - d7 * d24) - d4) + d13 * (d8 + (d7 * d23 + d6 * d24) - d2);
+ STACKTOP = i1;
+ return +d24;
+ } else {
+ ___assert_fail(3616, 3560, 183, 3720);
+ }
+ return 0.0;
+}
+function __ZN13b2DynamicTree10InsertLeafEi(i3, i4) {
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i2 = 0, d5 = 0.0, d6 = 0.0, d7 = 0.0, d8 = 0.0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, d13 = 0.0, d14 = 0.0, d15 = 0.0, d16 = 0.0, d17 = 0.0, d18 = 0.0, d19 = 0.0, d20 = 0.0, d21 = 0.0, d22 = 0.0, d23 = 0.0, i24 = 0;
+ i1 = STACKTOP;
+ i11 = i3 + 24 | 0;
+ HEAP32[i11 >> 2] = (HEAP32[i11 >> 2] | 0) + 1;
+ i11 = HEAP32[i3 >> 2] | 0;
+ if ((i11 | 0) == -1) {
+ HEAP32[i3 >> 2] = i4;
+ HEAP32[(HEAP32[i3 + 4 >> 2] | 0) + (i4 * 36 | 0) + 20 >> 2] = -1;
+ STACKTOP = i1;
+ return;
+ }
+ i2 = i3 + 4 | 0;
+ i9 = HEAP32[i2 >> 2] | 0;
+ d8 = +HEAPF32[i9 + (i4 * 36 | 0) >> 2];
+ d7 = +HEAPF32[i9 + (i4 * 36 | 0) + 4 >> 2];
+ d6 = +HEAPF32[i9 + (i4 * 36 | 0) + 8 >> 2];
+ d5 = +HEAPF32[i9 + (i4 * 36 | 0) + 12 >> 2];
+ i10 = HEAP32[i9 + (i11 * 36 | 0) + 24 >> 2] | 0;
+ L5 : do {
+ if (!((i10 | 0) == -1)) {
+ do {
+ i12 = HEAP32[i9 + (i11 * 36 | 0) + 28 >> 2] | 0;
+ d14 = +HEAPF32[i9 + (i11 * 36 | 0) + 8 >> 2];
+ d15 = +HEAPF32[i9 + (i11 * 36 | 0) >> 2];
+ d17 = +HEAPF32[i9 + (i11 * 36 | 0) + 12 >> 2];
+ d16 = +HEAPF32[i9 + (i11 * 36 | 0) + 4 >> 2];
+ d21 = ((d14 > d6 ? d14 : d6) - (d15 < d8 ? d15 : d8) + ((d17 > d5 ? d17 : d5) - (d16 < d7 ? d16 : d7))) * 2.0;
+ d13 = d21 * 2.0;
+ d14 = (d21 - (d14 - d15 + (d17 - d16)) * 2.0) * 2.0;
+ d21 = +HEAPF32[i9 + (i10 * 36 | 0) >> 2];
+ d16 = d8 < d21 ? d8 : d21;
+ d17 = +HEAPF32[i9 + (i10 * 36 | 0) + 4 >> 2];
+ d18 = d7 < d17 ? d7 : d17;
+ d19 = +HEAPF32[i9 + (i10 * 36 | 0) + 8 >> 2];
+ d20 = d6 > d19 ? d6 : d19;
+ d15 = +HEAPF32[i9 + (i10 * 36 | 0) + 12 >> 2];
+ d22 = d5 > d15 ? d5 : d15;
+ if ((HEAP32[i9 + (i10 * 36 | 0) + 24 >> 2] | 0) == -1) {
+ d15 = (d20 - d16 + (d22 - d18)) * 2.0;
+ } else {
+ d15 = (d20 - d16 + (d22 - d18)) * 2.0 - (d19 - d21 + (d15 - d17)) * 2.0;
+ }
+ d15 = d14 + d15;
+ d17 = +HEAPF32[i9 + (i12 * 36 | 0) >> 2];
+ d18 = d8 < d17 ? d8 : d17;
+ d23 = +HEAPF32[i9 + (i12 * 36 | 0) + 4 >> 2];
+ d22 = d7 < d23 ? d7 : d23;
+ d21 = +HEAPF32[i9 + (i12 * 36 | 0) + 8 >> 2];
+ d20 = d6 > d21 ? d6 : d21;
+ d19 = +HEAPF32[i9 + (i12 * 36 | 0) + 12 >> 2];
+ d16 = d5 > d19 ? d5 : d19;
+ if ((HEAP32[i9 + (i12 * 36 | 0) + 24 >> 2] | 0) == -1) {
+ d16 = (d20 - d18 + (d16 - d22)) * 2.0;
+ } else {
+ d16 = (d20 - d18 + (d16 - d22)) * 2.0 - (d21 - d17 + (d19 - d23)) * 2.0;
+ }
+ d14 = d14 + d16;
+ if (d13 < d15 & d13 < d14) {
+ break L5;
+ }
+ i11 = d15 < d14 ? i10 : i12;
+ i10 = HEAP32[i9 + (i11 * 36 | 0) + 24 >> 2] | 0;
+ } while (!((i10 | 0) == -1));
+ }
+ } while (0);
+ i9 = HEAP32[i9 + (i11 * 36 | 0) + 20 >> 2] | 0;
+ i10 = __ZN13b2DynamicTree12AllocateNodeEv(i3) | 0;
+ i12 = HEAP32[i2 >> 2] | 0;
+ HEAP32[i12 + (i10 * 36 | 0) + 20 >> 2] = i9;
+ HEAP32[i12 + (i10 * 36 | 0) + 16 >> 2] = 0;
+ i12 = HEAP32[i2 >> 2] | 0;
+ d14 = +HEAPF32[i12 + (i11 * 36 | 0) >> 2];
+ d13 = +HEAPF32[i12 + (i11 * 36 | 0) + 4 >> 2];
+ d8 = +(d8 < d14 ? d8 : d14);
+ d7 = +(d7 < d13 ? d7 : d13);
+ i24 = i12 + (i10 * 36 | 0) | 0;
+ HEAPF32[i24 >> 2] = d8;
+ HEAPF32[i24 + 4 >> 2] = d7;
+ d8 = +HEAPF32[i12 + (i11 * 36 | 0) + 8 >> 2];
+ d7 = +HEAPF32[i12 + (i11 * 36 | 0) + 12 >> 2];
+ d6 = +(d6 > d8 ? d6 : d8);
+ d23 = +(d5 > d7 ? d5 : d7);
+ i12 = i12 + (i10 * 36 | 0) + 8 | 0;
+ HEAPF32[i12 >> 2] = d6;
+ HEAPF32[i12 + 4 >> 2] = d23;
+ i12 = HEAP32[i2 >> 2] | 0;
+ HEAP32[i12 + (i10 * 36 | 0) + 32 >> 2] = (HEAP32[i12 + (i11 * 36 | 0) + 32 >> 2] | 0) + 1;
+ if ((i9 | 0) == -1) {
+ HEAP32[i12 + (i10 * 36 | 0) + 24 >> 2] = i11;
+ HEAP32[i12 + (i10 * 36 | 0) + 28 >> 2] = i4;
+ HEAP32[i12 + (i11 * 36 | 0) + 20 >> 2] = i10;
+ i24 = i12 + (i4 * 36 | 0) + 20 | 0;
+ HEAP32[i24 >> 2] = i10;
+ HEAP32[i3 >> 2] = i10;
+ i10 = HEAP32[i24 >> 2] | 0;
+ } else {
+ i24 = i12 + (i9 * 36 | 0) + 24 | 0;
+ if ((HEAP32[i24 >> 2] | 0) == (i11 | 0)) {
+ HEAP32[i24 >> 2] = i10;
+ } else {
+ HEAP32[i12 + (i9 * 36 | 0) + 28 >> 2] = i10;
+ }
+ HEAP32[i12 + (i10 * 36 | 0) + 24 >> 2] = i11;
+ HEAP32[i12 + (i10 * 36 | 0) + 28 >> 2] = i4;
+ HEAP32[i12 + (i11 * 36 | 0) + 20 >> 2] = i10;
+ HEAP32[i12 + (i4 * 36 | 0) + 20 >> 2] = i10;
+ }
+ if ((i10 | 0) == -1) {
+ STACKTOP = i1;
+ return;
+ }
+ while (1) {
+ i9 = __ZN13b2DynamicTree7BalanceEi(i3, i10) | 0;
+ i4 = HEAP32[i2 >> 2] | 0;
+ i11 = HEAP32[i4 + (i9 * 36 | 0) + 24 >> 2] | 0;
+ i10 = HEAP32[i4 + (i9 * 36 | 0) + 28 >> 2] | 0;
+ if ((i11 | 0) == -1) {
+ i2 = 20;
+ break;
+ }
+ if ((i10 | 0) == -1) {
+ i2 = 22;
+ break;
+ }
+ i12 = HEAP32[i4 + (i11 * 36 | 0) + 32 >> 2] | 0;
+ i24 = HEAP32[i4 + (i10 * 36 | 0) + 32 >> 2] | 0;
+ HEAP32[i4 + (i9 * 36 | 0) + 32 >> 2] = ((i12 | 0) > (i24 | 0) ? i12 : i24) + 1;
+ d7 = +HEAPF32[i4 + (i11 * 36 | 0) >> 2];
+ d8 = +HEAPF32[i4 + (i10 * 36 | 0) >> 2];
+ d5 = +HEAPF32[i4 + (i11 * 36 | 0) + 4 >> 2];
+ d6 = +HEAPF32[i4 + (i10 * 36 | 0) + 4 >> 2];
+ d7 = +(d7 < d8 ? d7 : d8);
+ d5 = +(d5 < d6 ? d5 : d6);
+ i24 = i4 + (i9 * 36 | 0) | 0;
+ HEAPF32[i24 >> 2] = d7;
+ HEAPF32[i24 + 4 >> 2] = d5;
+ d5 = +HEAPF32[i4 + (i11 * 36 | 0) + 8 >> 2];
+ d6 = +HEAPF32[i4 + (i10 * 36 | 0) + 8 >> 2];
+ d7 = +HEAPF32[i4 + (i11 * 36 | 0) + 12 >> 2];
+ d8 = +HEAPF32[i4 + (i10 * 36 | 0) + 12 >> 2];
+ d5 = +(d5 > d6 ? d5 : d6);
+ d23 = +(d7 > d8 ? d7 : d8);
+ i10 = i4 + (i9 * 36 | 0) + 8 | 0;
+ HEAPF32[i10 >> 2] = d5;
+ HEAPF32[i10 + 4 >> 2] = d23;
+ i10 = HEAP32[(HEAP32[i2 >> 2] | 0) + (i9 * 36 | 0) + 20 >> 2] | 0;
+ if ((i10 | 0) == -1) {
+ i2 = 24;
+ break;
+ }
+ }
+ if ((i2 | 0) == 20) {
+ ___assert_fail(3168, 2944, 307, 3184);
+ } else if ((i2 | 0) == 22) {
+ ___assert_fail(3200, 2944, 308, 3184);
+ } else if ((i2 | 0) == 24) {
+ STACKTOP = i1;
+ return;
+ }
+}
+function __ZN15b2ContactSolverC2EP18b2ContactSolverDef(i7, i5) {
+ i7 = i7 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i6 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, d15 = 0.0, d16 = 0.0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0;
+ i1 = STACKTOP;
+ HEAP32[i7 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i7 + 12 >> 2] = HEAP32[i5 + 12 >> 2];
+ HEAP32[i7 + 16 >> 2] = HEAP32[i5 + 16 >> 2];
+ HEAP32[i7 + 20 >> 2] = HEAP32[i5 + 20 >> 2];
+ i14 = HEAP32[i5 + 40 >> 2] | 0;
+ i9 = i7 + 32 | 0;
+ HEAP32[i9 >> 2] = i14;
+ i2 = HEAP32[i5 + 28 >> 2] | 0;
+ i4 = i7 + 48 | 0;
+ HEAP32[i4 >> 2] = i2;
+ i3 = i7 + 36 | 0;
+ HEAP32[i3 >> 2] = __ZN16b2StackAllocator8AllocateEi(i14, i2 * 88 | 0) | 0;
+ i2 = i7 + 40 | 0;
+ HEAP32[i2 >> 2] = __ZN16b2StackAllocator8AllocateEi(HEAP32[i9 >> 2] | 0, (HEAP32[i4 >> 2] | 0) * 152 | 0) | 0;
+ HEAP32[i7 + 24 >> 2] = HEAP32[i5 + 32 >> 2];
+ HEAP32[i7 + 28 >> 2] = HEAP32[i5 + 36 >> 2];
+ i9 = HEAP32[i5 + 24 >> 2] | 0;
+ i5 = i7 + 44 | 0;
+ HEAP32[i5 >> 2] = i9;
+ if ((HEAP32[i4 >> 2] | 0) <= 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i6 = i7 + 20 | 0;
+ i7 = i7 + 8 | 0;
+ i8 = 0;
+ while (1) {
+ i10 = HEAP32[i9 + (i8 << 2) >> 2] | 0;
+ i11 = HEAP32[i10 + 48 >> 2] | 0;
+ i12 = HEAP32[i10 + 52 >> 2] | 0;
+ i14 = HEAP32[i11 + 8 >> 2] | 0;
+ i13 = HEAP32[i12 + 8 >> 2] | 0;
+ i9 = HEAP32[i10 + 124 >> 2] | 0;
+ if ((i9 | 0) <= 0) {
+ i2 = 4;
+ break;
+ }
+ d15 = +HEAPF32[(HEAP32[i12 + 12 >> 2] | 0) + 8 >> 2];
+ d16 = +HEAPF32[(HEAP32[i11 + 12 >> 2] | 0) + 8 >> 2];
+ i12 = HEAP32[i2 >> 2] | 0;
+ HEAPF32[i12 + (i8 * 152 | 0) + 136 >> 2] = +HEAPF32[i10 + 136 >> 2];
+ HEAPF32[i12 + (i8 * 152 | 0) + 140 >> 2] = +HEAPF32[i10 + 140 >> 2];
+ i22 = i14 + 8 | 0;
+ HEAP32[i12 + (i8 * 152 | 0) + 112 >> 2] = HEAP32[i22 >> 2];
+ i21 = i13 + 8 | 0;
+ HEAP32[i12 + (i8 * 152 | 0) + 116 >> 2] = HEAP32[i21 >> 2];
+ i19 = i14 + 120 | 0;
+ HEAPF32[i12 + (i8 * 152 | 0) + 120 >> 2] = +HEAPF32[i19 >> 2];
+ i20 = i13 + 120 | 0;
+ HEAPF32[i12 + (i8 * 152 | 0) + 124 >> 2] = +HEAPF32[i20 >> 2];
+ i18 = i14 + 128 | 0;
+ HEAPF32[i12 + (i8 * 152 | 0) + 128 >> 2] = +HEAPF32[i18 >> 2];
+ i17 = i13 + 128 | 0;
+ HEAPF32[i12 + (i8 * 152 | 0) + 132 >> 2] = +HEAPF32[i17 >> 2];
+ HEAP32[i12 + (i8 * 152 | 0) + 148 >> 2] = i8;
+ HEAP32[i12 + (i8 * 152 | 0) + 144 >> 2] = i9;
+ i11 = i12 + (i8 * 152 | 0) + 80 | 0;
+ HEAP32[i11 + 0 >> 2] = 0;
+ HEAP32[i11 + 4 >> 2] = 0;
+ HEAP32[i11 + 8 >> 2] = 0;
+ HEAP32[i11 + 12 >> 2] = 0;
+ HEAP32[i11 + 16 >> 2] = 0;
+ HEAP32[i11 + 20 >> 2] = 0;
+ HEAP32[i11 + 24 >> 2] = 0;
+ HEAP32[i11 + 28 >> 2] = 0;
+ i11 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i11 + (i8 * 88 | 0) + 32 >> 2] = HEAP32[i22 >> 2];
+ HEAP32[i11 + (i8 * 88 | 0) + 36 >> 2] = HEAP32[i21 >> 2];
+ HEAPF32[i11 + (i8 * 88 | 0) + 40 >> 2] = +HEAPF32[i19 >> 2];
+ HEAPF32[i11 + (i8 * 88 | 0) + 44 >> 2] = +HEAPF32[i20 >> 2];
+ i20 = i14 + 28 | 0;
+ i14 = HEAP32[i20 + 4 >> 2] | 0;
+ i19 = i11 + (i8 * 88 | 0) + 48 | 0;
+ HEAP32[i19 >> 2] = HEAP32[i20 >> 2];
+ HEAP32[i19 + 4 >> 2] = i14;
+ i19 = i13 + 28 | 0;
+ i14 = HEAP32[i19 + 4 >> 2] | 0;
+ i13 = i11 + (i8 * 88 | 0) + 56 | 0;
+ HEAP32[i13 >> 2] = HEAP32[i19 >> 2];
+ HEAP32[i13 + 4 >> 2] = i14;
+ HEAPF32[i11 + (i8 * 88 | 0) + 64 >> 2] = +HEAPF32[i18 >> 2];
+ HEAPF32[i11 + (i8 * 88 | 0) + 68 >> 2] = +HEAPF32[i17 >> 2];
+ i13 = i10 + 104 | 0;
+ i14 = HEAP32[i13 + 4 >> 2] | 0;
+ i17 = i11 + (i8 * 88 | 0) + 16 | 0;
+ HEAP32[i17 >> 2] = HEAP32[i13 >> 2];
+ HEAP32[i17 + 4 >> 2] = i14;
+ i17 = i10 + 112 | 0;
+ i14 = HEAP32[i17 + 4 >> 2] | 0;
+ i13 = i11 + (i8 * 88 | 0) + 24 | 0;
+ HEAP32[i13 >> 2] = HEAP32[i17 >> 2];
+ HEAP32[i13 + 4 >> 2] = i14;
+ HEAP32[i11 + (i8 * 88 | 0) + 84 >> 2] = i9;
+ HEAPF32[i11 + (i8 * 88 | 0) + 76 >> 2] = d16;
+ HEAPF32[i11 + (i8 * 88 | 0) + 80 >> 2] = d15;
+ HEAP32[i11 + (i8 * 88 | 0) + 72 >> 2] = HEAP32[i10 + 120 >> 2];
+ i13 = 0;
+ do {
+ i14 = i10 + (i13 * 20 | 0) + 64 | 0;
+ if ((HEAP8[i6] | 0) == 0) {
+ HEAPF32[i12 + (i8 * 152 | 0) + (i13 * 36 | 0) + 16 >> 2] = 0.0;
+ HEAPF32[i12 + (i8 * 152 | 0) + (i13 * 36 | 0) + 20 >> 2] = 0.0;
+ } else {
+ HEAPF32[i12 + (i8 * 152 | 0) + (i13 * 36 | 0) + 16 >> 2] = +HEAPF32[i7 >> 2] * +HEAPF32[i10 + (i13 * 20 | 0) + 72 >> 2];
+ HEAPF32[i12 + (i8 * 152 | 0) + (i13 * 36 | 0) + 20 >> 2] = +HEAPF32[i7 >> 2] * +HEAPF32[i10 + (i13 * 20 | 0) + 76 >> 2];
+ }
+ i20 = i12 + (i8 * 152 | 0) + (i13 * 36 | 0) | 0;
+ HEAPF32[i12 + (i8 * 152 | 0) + (i13 * 36 | 0) + 24 >> 2] = 0.0;
+ HEAPF32[i12 + (i8 * 152 | 0) + (i13 * 36 | 0) + 28 >> 2] = 0.0;
+ HEAPF32[i12 + (i8 * 152 | 0) + (i13 * 36 | 0) + 32 >> 2] = 0.0;
+ i22 = i11 + (i8 * 88 | 0) + (i13 << 3) | 0;
+ HEAP32[i20 + 0 >> 2] = 0;
+ HEAP32[i20 + 4 >> 2] = 0;
+ HEAP32[i20 + 8 >> 2] = 0;
+ HEAP32[i20 + 12 >> 2] = 0;
+ i20 = i14;
+ i21 = HEAP32[i20 + 4 >> 2] | 0;
+ HEAP32[i22 >> 2] = HEAP32[i20 >> 2];
+ HEAP32[i22 + 4 >> 2] = i21;
+ i13 = i13 + 1 | 0;
+ } while ((i13 | 0) != (i9 | 0));
+ i8 = i8 + 1 | 0;
+ if ((i8 | 0) >= (HEAP32[i4 >> 2] | 0)) {
+ i2 = 12;
+ break;
+ }
+ i9 = HEAP32[i5 >> 2] | 0;
+ }
+ if ((i2 | 0) == 4) {
+ ___assert_fail(6504, 6520, 71, 6568);
+ } else if ((i2 | 0) == 12) {
+ STACKTOP = i1;
+ return;
+ }
+}
+function __Z25b2CollidePolygonAndCircleP10b2ManifoldPK14b2PolygonShapeRK11b2TransformPK13b2CircleShapeS6_(i1, i4, i11, i9, i10) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i11 = i11 | 0;
+ i9 = i9 | 0;
+ i10 = i10 | 0;
+ var i2 = 0, i3 = 0, i5 = 0, d6 = 0.0, d7 = 0.0, d8 = 0.0, i12 = 0, d13 = 0.0, d14 = 0.0, i15 = 0, d16 = 0.0, d17 = 0.0, d18 = 0.0, d19 = 0.0, d20 = 0.0, d21 = 0.0, i22 = 0;
+ i3 = STACKTOP;
+ i5 = i1 + 60 | 0;
+ HEAP32[i5 >> 2] = 0;
+ i2 = i9 + 12 | 0;
+ d20 = +HEAPF32[i10 + 12 >> 2];
+ d7 = +HEAPF32[i2 >> 2];
+ d6 = +HEAPF32[i10 + 8 >> 2];
+ d21 = +HEAPF32[i9 + 16 >> 2];
+ d8 = +HEAPF32[i10 >> 2] + (d20 * d7 - d6 * d21) - +HEAPF32[i11 >> 2];
+ d21 = d7 * d6 + d20 * d21 + +HEAPF32[i10 + 4 >> 2] - +HEAPF32[i11 + 4 >> 2];
+ d20 = +HEAPF32[i11 + 12 >> 2];
+ d6 = +HEAPF32[i11 + 8 >> 2];
+ d7 = d8 * d20 + d21 * d6;
+ d6 = d20 * d21 - d8 * d6;
+ d8 = +HEAPF32[i4 + 8 >> 2] + +HEAPF32[i9 + 8 >> 2];
+ i12 = HEAP32[i4 + 148 >> 2] | 0;
+ do {
+ if ((i12 | 0) > 0) {
+ i10 = 0;
+ i9 = 0;
+ d13 = -3.4028234663852886e+38;
+ while (1) {
+ d14 = (d7 - +HEAPF32[i4 + (i10 << 3) + 20 >> 2]) * +HEAPF32[i4 + (i10 << 3) + 84 >> 2] + (d6 - +HEAPF32[i4 + (i10 << 3) + 24 >> 2]) * +HEAPF32[i4 + (i10 << 3) + 88 >> 2];
+ if (d14 > d8) {
+ i10 = 19;
+ break;
+ }
+ i11 = d14 > d13;
+ d13 = i11 ? d14 : d13;
+ i9 = i11 ? i10 : i9;
+ i10 = i10 + 1 | 0;
+ if ((i10 | 0) >= (i12 | 0)) {
+ i10 = 4;
+ break;
+ }
+ }
+ if ((i10 | 0) == 4) {
+ i22 = d13 < 1.1920928955078125e-7;
+ break;
+ } else if ((i10 | 0) == 19) {
+ STACKTOP = i3;
+ return;
+ }
+ } else {
+ i9 = 0;
+ i22 = 1;
+ }
+ } while (0);
+ i15 = i9 + 1 | 0;
+ i11 = i4 + (i9 << 3) + 20 | 0;
+ i10 = HEAP32[i11 >> 2] | 0;
+ i11 = HEAP32[i11 + 4 >> 2] | 0;
+ d14 = (HEAP32[tempDoublePtr >> 2] = i10, +HEAPF32[tempDoublePtr >> 2]);
+ d13 = (HEAP32[tempDoublePtr >> 2] = i11, +HEAPF32[tempDoublePtr >> 2]);
+ i12 = i4 + (((i15 | 0) < (i12 | 0) ? i15 : 0) << 3) + 20 | 0;
+ i15 = HEAP32[i12 >> 2] | 0;
+ i12 = HEAP32[i12 + 4 >> 2] | 0;
+ d21 = (HEAP32[tempDoublePtr >> 2] = i15, +HEAPF32[tempDoublePtr >> 2]);
+ d18 = (HEAP32[tempDoublePtr >> 2] = i12, +HEAPF32[tempDoublePtr >> 2]);
+ if (i22) {
+ HEAP32[i5 >> 2] = 1;
+ HEAP32[i1 + 56 >> 2] = 1;
+ i22 = i4 + (i9 << 3) + 84 | 0;
+ i15 = HEAP32[i22 + 4 >> 2] | 0;
+ i12 = i1 + 40 | 0;
+ HEAP32[i12 >> 2] = HEAP32[i22 >> 2];
+ HEAP32[i12 + 4 >> 2] = i15;
+ d20 = +((d14 + d21) * .5);
+ d21 = +((d13 + d18) * .5);
+ i12 = i1 + 48 | 0;
+ HEAPF32[i12 >> 2] = d20;
+ HEAPF32[i12 + 4 >> 2] = d21;
+ i12 = i2;
+ i15 = HEAP32[i12 + 4 >> 2] | 0;
+ i22 = i1;
+ HEAP32[i22 >> 2] = HEAP32[i12 >> 2];
+ HEAP32[i22 + 4 >> 2] = i15;
+ HEAP32[i1 + 16 >> 2] = 0;
+ STACKTOP = i3;
+ return;
+ }
+ d16 = d7 - d14;
+ d20 = d6 - d13;
+ d19 = d7 - d21;
+ d17 = d6 - d18;
+ if (d16 * (d21 - d14) + d20 * (d18 - d13) <= 0.0) {
+ if (d16 * d16 + d20 * d20 > d8 * d8) {
+ STACKTOP = i3;
+ return;
+ }
+ HEAP32[i5 >> 2] = 1;
+ HEAP32[i1 + 56 >> 2] = 1;
+ i4 = i1 + 40 | 0;
+ d21 = +d16;
+ d6 = +d20;
+ i22 = i4;
+ HEAPF32[i22 >> 2] = d21;
+ HEAPF32[i22 + 4 >> 2] = d6;
+ d6 = +Math_sqrt(+(d16 * d16 + d20 * d20));
+ if (!(d6 < 1.1920928955078125e-7)) {
+ d21 = 1.0 / d6;
+ HEAPF32[i4 >> 2] = d16 * d21;
+ HEAPF32[i1 + 44 >> 2] = d20 * d21;
+ }
+ i12 = i1 + 48 | 0;
+ HEAP32[i12 >> 2] = i10;
+ HEAP32[i12 + 4 >> 2] = i11;
+ i12 = i2;
+ i15 = HEAP32[i12 + 4 >> 2] | 0;
+ i22 = i1;
+ HEAP32[i22 >> 2] = HEAP32[i12 >> 2];
+ HEAP32[i22 + 4 >> 2] = i15;
+ HEAP32[i1 + 16 >> 2] = 0;
+ STACKTOP = i3;
+ return;
+ }
+ if (!(d19 * (d14 - d21) + d17 * (d13 - d18) <= 0.0)) {
+ d14 = (d14 + d21) * .5;
+ d13 = (d13 + d18) * .5;
+ i10 = i4 + (i9 << 3) + 84 | 0;
+ if ((d7 - d14) * +HEAPF32[i10 >> 2] + (d6 - d13) * +HEAPF32[i4 + (i9 << 3) + 88 >> 2] > d8) {
+ STACKTOP = i3;
+ return;
+ }
+ HEAP32[i5 >> 2] = 1;
+ HEAP32[i1 + 56 >> 2] = 1;
+ i22 = i10;
+ i15 = HEAP32[i22 + 4 >> 2] | 0;
+ i12 = i1 + 40 | 0;
+ HEAP32[i12 >> 2] = HEAP32[i22 >> 2];
+ HEAP32[i12 + 4 >> 2] = i15;
+ d20 = +d14;
+ d21 = +d13;
+ i12 = i1 + 48 | 0;
+ HEAPF32[i12 >> 2] = d20;
+ HEAPF32[i12 + 4 >> 2] = d21;
+ i12 = i2;
+ i15 = HEAP32[i12 + 4 >> 2] | 0;
+ i22 = i1;
+ HEAP32[i22 >> 2] = HEAP32[i12 >> 2];
+ HEAP32[i22 + 4 >> 2] = i15;
+ HEAP32[i1 + 16 >> 2] = 0;
+ STACKTOP = i3;
+ return;
+ }
+ if (d19 * d19 + d17 * d17 > d8 * d8) {
+ STACKTOP = i3;
+ return;
+ }
+ HEAP32[i5 >> 2] = 1;
+ HEAP32[i1 + 56 >> 2] = 1;
+ i4 = i1 + 40 | 0;
+ d21 = +d19;
+ d6 = +d17;
+ i22 = i4;
+ HEAPF32[i22 >> 2] = d21;
+ HEAPF32[i22 + 4 >> 2] = d6;
+ d6 = +Math_sqrt(+(d19 * d19 + d17 * d17));
+ if (!(d6 < 1.1920928955078125e-7)) {
+ d21 = 1.0 / d6;
+ HEAPF32[i4 >> 2] = d19 * d21;
+ HEAPF32[i1 + 44 >> 2] = d17 * d21;
+ }
+ i22 = i1 + 48 | 0;
+ HEAP32[i22 >> 2] = i15;
+ HEAP32[i22 + 4 >> 2] = i12;
+ i12 = i2;
+ i15 = HEAP32[i12 + 4 >> 2] | 0;
+ i22 = i1;
+ HEAP32[i22 >> 2] = HEAP32[i12 >> 2];
+ HEAP32[i22 + 4 >> 2] = i15;
+ HEAP32[i1 + 16 >> 2] = 0;
+ STACKTOP = i3;
+ return;
+}
+function __ZN15b2WorldManifold10InitializeEPK10b2ManifoldRK11b2TransformfS5_f(i1, i5, i7, d4, i8, d3) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ i7 = i7 | 0;
+ d4 = +d4;
+ i8 = i8 | 0;
+ d3 = +d3;
+ var i2 = 0, i6 = 0, d9 = 0.0, d10 = 0.0, i11 = 0, i12 = 0, i13 = 0, d14 = 0.0, d15 = 0.0, i16 = 0, d17 = 0.0, d18 = 0.0, d19 = 0.0, i20 = 0, d21 = 0.0, d22 = 0.0;
+ i2 = STACKTOP;
+ i6 = i5 + 60 | 0;
+ if ((HEAP32[i6 >> 2] | 0) == 0) {
+ STACKTOP = i2;
+ return;
+ }
+ i11 = HEAP32[i5 + 56 >> 2] | 0;
+ if ((i11 | 0) == 2) {
+ i13 = i8 + 12 | 0;
+ d17 = +HEAPF32[i13 >> 2];
+ d18 = +HEAPF32[i5 + 40 >> 2];
+ i16 = i8 + 8 | 0;
+ d19 = +HEAPF32[i16 >> 2];
+ d15 = +HEAPF32[i5 + 44 >> 2];
+ d14 = d17 * d18 - d19 * d15;
+ d15 = d18 * d19 + d17 * d15;
+ d17 = +d14;
+ d19 = +d15;
+ i12 = i1;
+ HEAPF32[i12 >> 2] = d17;
+ HEAPF32[i12 + 4 >> 2] = d19;
+ d19 = +HEAPF32[i13 >> 2];
+ d17 = +HEAPF32[i5 + 48 >> 2];
+ d18 = +HEAPF32[i16 >> 2];
+ d10 = +HEAPF32[i5 + 52 >> 2];
+ d9 = +HEAPF32[i8 >> 2] + (d19 * d17 - d18 * d10);
+ d10 = d17 * d18 + d19 * d10 + +HEAPF32[i8 + 4 >> 2];
+ if ((HEAP32[i6 >> 2] | 0) > 0) {
+ i8 = i7 + 12 | 0;
+ i11 = i7 + 8 | 0;
+ i12 = i7 + 4 | 0;
+ i13 = i1 + 4 | 0;
+ i16 = 0;
+ do {
+ d18 = +HEAPF32[i8 >> 2];
+ d22 = +HEAPF32[i5 + (i16 * 20 | 0) >> 2];
+ d21 = +HEAPF32[i11 >> 2];
+ d17 = +HEAPF32[i5 + (i16 * 20 | 0) + 4 >> 2];
+ d19 = +HEAPF32[i7 >> 2] + (d18 * d22 - d21 * d17);
+ d17 = d22 * d21 + d18 * d17 + +HEAPF32[i12 >> 2];
+ d18 = d3 - (d14 * (d19 - d9) + (d17 - d10) * d15);
+ d19 = +((d19 - d14 * d4 + (d19 + d14 * d18)) * .5);
+ d14 = +((d17 - d15 * d4 + (d17 + d15 * d18)) * .5);
+ i20 = i1 + (i16 << 3) + 8 | 0;
+ HEAPF32[i20 >> 2] = d19;
+ HEAPF32[i20 + 4 >> 2] = d14;
+ i16 = i16 + 1 | 0;
+ d14 = +HEAPF32[i1 >> 2];
+ d15 = +HEAPF32[i13 >> 2];
+ } while ((i16 | 0) < (HEAP32[i6 >> 2] | 0));
+ }
+ d21 = +-d14;
+ d22 = +-d15;
+ i20 = i1;
+ HEAPF32[i20 >> 2] = d21;
+ HEAPF32[i20 + 4 >> 2] = d22;
+ STACKTOP = i2;
+ return;
+ } else if ((i11 | 0) == 1) {
+ i16 = i7 + 12 | 0;
+ d19 = +HEAPF32[i16 >> 2];
+ d21 = +HEAPF32[i5 + 40 >> 2];
+ i20 = i7 + 8 | 0;
+ d22 = +HEAPF32[i20 >> 2];
+ d15 = +HEAPF32[i5 + 44 >> 2];
+ d14 = d19 * d21 - d22 * d15;
+ d15 = d21 * d22 + d19 * d15;
+ d19 = +d14;
+ d22 = +d15;
+ i13 = i1;
+ HEAPF32[i13 >> 2] = d19;
+ HEAPF32[i13 + 4 >> 2] = d22;
+ d22 = +HEAPF32[i16 >> 2];
+ d19 = +HEAPF32[i5 + 48 >> 2];
+ d21 = +HEAPF32[i20 >> 2];
+ d10 = +HEAPF32[i5 + 52 >> 2];
+ d9 = +HEAPF32[i7 >> 2] + (d22 * d19 - d21 * d10);
+ d10 = d19 * d21 + d22 * d10 + +HEAPF32[i7 + 4 >> 2];
+ if ((HEAP32[i6 >> 2] | 0) <= 0) {
+ STACKTOP = i2;
+ return;
+ }
+ i12 = i8 + 12 | 0;
+ i11 = i8 + 8 | 0;
+ i7 = i8 + 4 | 0;
+ i13 = i1 + 4 | 0;
+ i16 = 0;
+ while (1) {
+ d22 = +HEAPF32[i12 >> 2];
+ d17 = +HEAPF32[i5 + (i16 * 20 | 0) >> 2];
+ d18 = +HEAPF32[i11 >> 2];
+ d19 = +HEAPF32[i5 + (i16 * 20 | 0) + 4 >> 2];
+ d21 = +HEAPF32[i8 >> 2] + (d22 * d17 - d18 * d19);
+ d19 = d17 * d18 + d22 * d19 + +HEAPF32[i7 >> 2];
+ d22 = d4 - (d14 * (d21 - d9) + (d19 - d10) * d15);
+ d21 = +((d21 - d14 * d3 + (d21 + d14 * d22)) * .5);
+ d22 = +((d19 - d15 * d3 + (d19 + d15 * d22)) * .5);
+ i20 = i1 + (i16 << 3) + 8 | 0;
+ HEAPF32[i20 >> 2] = d21;
+ HEAPF32[i20 + 4 >> 2] = d22;
+ i16 = i16 + 1 | 0;
+ if ((i16 | 0) >= (HEAP32[i6 >> 2] | 0)) {
+ break;
+ }
+ d14 = +HEAPF32[i1 >> 2];
+ d15 = +HEAPF32[i13 >> 2];
+ }
+ STACKTOP = i2;
+ return;
+ } else if ((i11 | 0) == 0) {
+ HEAPF32[i1 >> 2] = 1.0;
+ i6 = i1 + 4 | 0;
+ HEAPF32[i6 >> 2] = 0.0;
+ d21 = +HEAPF32[i7 + 12 >> 2];
+ d22 = +HEAPF32[i5 + 48 >> 2];
+ d19 = +HEAPF32[i7 + 8 >> 2];
+ d10 = +HEAPF32[i5 + 52 >> 2];
+ d9 = +HEAPF32[i7 >> 2] + (d21 * d22 - d19 * d10);
+ d10 = d22 * d19 + d21 * d10 + +HEAPF32[i7 + 4 >> 2];
+ d21 = +HEAPF32[i8 + 12 >> 2];
+ d19 = +HEAPF32[i5 >> 2];
+ d22 = +HEAPF32[i8 + 8 >> 2];
+ d15 = +HEAPF32[i5 + 4 >> 2];
+ d14 = +HEAPF32[i8 >> 2] + (d21 * d19 - d22 * d15);
+ d15 = d19 * d22 + d21 * d15 + +HEAPF32[i8 + 4 >> 2];
+ d21 = d9 - d14;
+ d22 = d10 - d15;
+ if (d21 * d21 + d22 * d22 > 1.4210854715202004e-14) {
+ d19 = d14 - d9;
+ d17 = d15 - d10;
+ d22 = +d19;
+ d18 = +d17;
+ i20 = i1;
+ HEAPF32[i20 >> 2] = d22;
+ HEAPF32[i20 + 4 >> 2] = d18;
+ d18 = +Math_sqrt(+(d19 * d19 + d17 * d17));
+ if (!(d18 < 1.1920928955078125e-7)) {
+ d22 = 1.0 / d18;
+ d19 = d19 * d22;
+ HEAPF32[i1 >> 2] = d19;
+ d17 = d17 * d22;
+ HEAPF32[i6 >> 2] = d17;
+ }
+ } else {
+ d19 = 1.0;
+ d17 = 0.0;
+ }
+ d21 = +((d9 + d19 * d4 + (d14 - d19 * d3)) * .5);
+ d22 = +((d10 + d17 * d4 + (d15 - d17 * d3)) * .5);
+ i20 = i1 + 8 | 0;
+ HEAPF32[i20 >> 2] = d21;
+ HEAPF32[i20 + 4 >> 2] = d22;
+ STACKTOP = i2;
+ return;
+ } else {
+ STACKTOP = i2;
+ return;
+ }
+}
+function _main(i3, i2) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ var i1 = 0, i4 = 0, i5 = 0, d6 = 0.0, d7 = 0.0, i8 = 0, i9 = 0, d10 = 0.0, d11 = 0.0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, d22 = 0.0, d23 = 0.0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 240 | 0;
+ i5 = i1;
+ i12 = i1 + 224 | 0;
+ i4 = i1 + 168 | 0;
+ i9 = i1 + 160 | 0;
+ i8 = i1 + 152 | 0;
+ L1 : do {
+ if ((i3 | 0) > 1) {
+ i14 = HEAP8[HEAP32[i2 + 4 >> 2] | 0] | 0;
+ switch (i14 | 0) {
+ case 49:
+ {
+ HEAP32[2] = 5;
+ HEAP32[4] = 35;
+ i15 = 35;
+ i14 = 5;
+ break L1;
+ }
+ case 50:
+ {
+ HEAP32[2] = 32;
+ HEAP32[4] = 161;
+ i15 = 161;
+ i14 = 32;
+ break L1;
+ }
+ case 51:
+ {
+ i13 = 5;
+ break L1;
+ }
+ case 52:
+ {
+ HEAP32[2] = 320;
+ HEAP32[4] = 2331;
+ i15 = 2331;
+ i14 = 320;
+ break L1;
+ }
+ case 53:
+ {
+ HEAP32[2] = 640;
+ HEAP32[4] = 5661;
+ i15 = 5661;
+ i14 = 640;
+ break L1;
+ }
+ case 48:
+ {
+ i20 = 0;
+ STACKTOP = i1;
+ return i20 | 0;
+ }
+ default:
+ {
+ HEAP32[i5 >> 2] = i14 + -48;
+ _printf(80, i5 | 0) | 0;
+ i20 = -1;
+ STACKTOP = i1;
+ return i20 | 0;
+ }
+ }
+ } else {
+ i13 = 5;
+ }
+ } while (0);
+ if ((i13 | 0) == 5) {
+ HEAP32[2] = 64;
+ HEAP32[4] = 333;
+ i15 = 333;
+ i14 = 64;
+ }
+ i13 = i15 + i14 | 0;
+ HEAP32[4] = i13;
+ HEAP32[2] = 0;
+ HEAP32[8] = __Znaj(i13 >>> 0 > 1073741823 ? -1 : i13 << 2) | 0;
+ HEAPF32[i12 >> 2] = 0.0;
+ HEAPF32[i12 + 4 >> 2] = -10.0;
+ i15 = __Znwj(103028) | 0;
+ __ZN7b2WorldC2ERK6b2Vec2(i15, i12);
+ HEAP32[6] = i15;
+ __ZN7b2World16SetAllowSleepingEb(i15, 0);
+ HEAP32[i5 + 44 >> 2] = 0;
+ i15 = i5 + 4 | 0;
+ i14 = i5 + 36 | 0;
+ HEAP32[i15 + 0 >> 2] = 0;
+ HEAP32[i15 + 4 >> 2] = 0;
+ HEAP32[i15 + 8 >> 2] = 0;
+ HEAP32[i15 + 12 >> 2] = 0;
+ HEAP32[i15 + 16 >> 2] = 0;
+ HEAP32[i15 + 20 >> 2] = 0;
+ HEAP32[i15 + 24 >> 2] = 0;
+ HEAP32[i15 + 28 >> 2] = 0;
+ HEAP8[i14] = 1;
+ HEAP8[i5 + 37 | 0] = 1;
+ HEAP8[i5 + 38 | 0] = 0;
+ HEAP8[i5 + 39 | 0] = 0;
+ HEAP32[i5 >> 2] = 0;
+ HEAP8[i5 + 40 | 0] = 1;
+ HEAPF32[i5 + 48 >> 2] = 1.0;
+ i14 = __ZN7b2World10CreateBodyEPK9b2BodyDef(HEAP32[6] | 0, i5) | 0;
+ HEAP32[i4 >> 2] = 240;
+ HEAP32[i4 + 4 >> 2] = 1;
+ HEAPF32[i4 + 8 >> 2] = .009999999776482582;
+ i15 = i4 + 28 | 0;
+ HEAP32[i15 + 0 >> 2] = 0;
+ HEAP32[i15 + 4 >> 2] = 0;
+ HEAP32[i15 + 8 >> 2] = 0;
+ HEAP32[i15 + 12 >> 2] = 0;
+ HEAP16[i15 + 16 >> 1] = 0;
+ HEAPF32[i9 >> 2] = -40.0;
+ HEAPF32[i9 + 4 >> 2] = 0.0;
+ HEAPF32[i8 >> 2] = 40.0;
+ HEAPF32[i8 + 4 >> 2] = 0.0;
+ __ZN11b2EdgeShape3SetERK6b2Vec2S2_(i4, i9, i8);
+ __ZN6b2Body13CreateFixtureEPK7b2Shapef(i14, i4, 0.0) | 0;
+ HEAP32[i5 >> 2] = 504;
+ HEAP32[i5 + 4 >> 2] = 2;
+ HEAPF32[i5 + 8 >> 2] = .009999999776482582;
+ HEAP32[i5 + 148 >> 2] = 0;
+ HEAPF32[i5 + 12 >> 2] = 0.0;
+ HEAPF32[i5 + 16 >> 2] = 0.0;
+ __ZN14b2PolygonShape8SetAsBoxEff(i5, .5, .5);
+ i14 = i4 + 44 | 0;
+ i15 = i4 + 4 | 0;
+ i8 = i4 + 36 | 0;
+ i17 = i4 + 37 | 0;
+ i18 = i4 + 38 | 0;
+ i19 = i4 + 39 | 0;
+ i20 = i4 + 40 | 0;
+ i13 = i4 + 48 | 0;
+ i12 = i4 + 4 | 0;
+ d11 = -7.0;
+ d10 = .75;
+ i9 = 0;
+ while (1) {
+ d7 = d11;
+ d6 = d10;
+ i16 = i9;
+ while (1) {
+ HEAP32[i14 >> 2] = 0;
+ HEAP32[i15 + 0 >> 2] = 0;
+ HEAP32[i15 + 4 >> 2] = 0;
+ HEAP32[i15 + 8 >> 2] = 0;
+ HEAP32[i15 + 12 >> 2] = 0;
+ HEAP32[i15 + 16 >> 2] = 0;
+ HEAP32[i15 + 20 >> 2] = 0;
+ HEAP32[i15 + 24 >> 2] = 0;
+ HEAP32[i15 + 28 >> 2] = 0;
+ HEAP8[i8] = 1;
+ HEAP8[i17] = 1;
+ HEAP8[i18] = 0;
+ HEAP8[i19] = 0;
+ HEAP8[i20] = 1;
+ HEAPF32[i13 >> 2] = 1.0;
+ HEAP32[i4 >> 2] = 2;
+ d23 = +d7;
+ d22 = +d6;
+ i21 = i12;
+ HEAPF32[i21 >> 2] = d23;
+ HEAPF32[i21 + 4 >> 2] = d22;
+ i21 = __ZN7b2World10CreateBodyEPK9b2BodyDef(HEAP32[6] | 0, i4) | 0;
+ __ZN6b2Body13CreateFixtureEPK7b2Shapef(i21, i5, 5.0) | 0;
+ HEAP32[14] = i21;
+ i16 = i16 + 1 | 0;
+ if ((i16 | 0) >= 40) {
+ break;
+ } else {
+ d7 = d7 + 1.125;
+ d6 = d6 + 0.0;
+ }
+ }
+ i9 = i9 + 1 | 0;
+ if ((i9 | 0) >= 40) {
+ break;
+ } else {
+ d11 = d11 + .5625;
+ d10 = d10 + 1.0;
+ }
+ }
+ if ((HEAP32[2] | 0) > 0) {
+ i4 = 0;
+ do {
+ __ZN7b2World4StepEfii(HEAP32[6] | 0, .01666666753590107, 3, 3);
+ i4 = i4 + 1 | 0;
+ } while ((i4 | 0) < (HEAP32[2] | 0));
+ }
+ if ((i3 | 0) > 2) {
+ i21 = (HEAP8[HEAP32[i2 + 8 >> 2] | 0] | 0) + -48 | 0;
+ HEAP32[18] = i21;
+ if ((i21 | 0) != 0) {
+ _puts(208) | 0;
+ _emscripten_set_main_loop(2, 60, 1);
+ i21 = 0;
+ STACKTOP = i1;
+ return i21 | 0;
+ }
+ } else {
+ HEAP32[18] = 0;
+ }
+ while (1) {
+ __Z4iterv();
+ if ((HEAP32[16] | 0) > (HEAP32[4] | 0)) {
+ i2 = 0;
+ break;
+ }
+ }
+ STACKTOP = i1;
+ return i2 | 0;
+}
+function __ZN9b2Simplex9ReadCacheEPK14b2SimplexCachePK15b2DistanceProxyRK11b2TransformS5_S8_(i2, i11, i10, i4, i3, i5) {
+ i2 = i2 | 0;
+ i11 = i11 | 0;
+ i10 = i10 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i6 = 0, i7 = 0, d8 = 0.0, i9 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, d24 = 0.0, d25 = 0.0, i26 = 0, d27 = 0.0, d28 = 0.0, d29 = 0.0, d30 = 0.0, d31 = 0.0, d32 = 0.0;
+ i1 = STACKTOP;
+ i13 = HEAP16[i11 + 4 >> 1] | 0;
+ if (!((i13 & 65535) < 4)) {
+ ___assert_fail(2872, 2672, 102, 2896);
+ }
+ i12 = i13 & 65535;
+ i6 = i2 + 108 | 0;
+ HEAP32[i6 >> 2] = i12;
+ L4 : do {
+ if (!(i13 << 16 >> 16 == 0)) {
+ i17 = i10 + 20 | 0;
+ i21 = i10 + 16 | 0;
+ i13 = i3 + 20 | 0;
+ i14 = i3 + 16 | 0;
+ i15 = i4 + 12 | 0;
+ i16 = i4 + 8 | 0;
+ i12 = i4 + 4 | 0;
+ i18 = i5 + 12 | 0;
+ i19 = i5 + 8 | 0;
+ i20 = i5 + 4 | 0;
+ i22 = 0;
+ while (1) {
+ i26 = HEAPU8[i11 + i22 + 6 | 0] | 0;
+ HEAP32[i2 + (i22 * 36 | 0) + 28 >> 2] = i26;
+ i23 = HEAPU8[i11 + i22 + 9 | 0] | 0;
+ HEAP32[i2 + (i22 * 36 | 0) + 32 >> 2] = i23;
+ if ((HEAP32[i17 >> 2] | 0) <= (i26 | 0)) {
+ i9 = 6;
+ break;
+ }
+ i26 = (HEAP32[i21 >> 2] | 0) + (i26 << 3) | 0;
+ d25 = +HEAPF32[i26 >> 2];
+ d24 = +HEAPF32[i26 + 4 >> 2];
+ if ((HEAP32[i13 >> 2] | 0) <= (i23 | 0)) {
+ i9 = 8;
+ break;
+ }
+ i23 = (HEAP32[i14 >> 2] | 0) + (i23 << 3) | 0;
+ d29 = +HEAPF32[i23 >> 2];
+ d31 = +HEAPF32[i23 + 4 >> 2];
+ d32 = +HEAPF32[i15 >> 2];
+ d30 = +HEAPF32[i16 >> 2];
+ d27 = +HEAPF32[i4 >> 2] + (d25 * d32 - d24 * d30);
+ d28 = +d27;
+ d30 = +(d24 * d32 + d25 * d30 + +HEAPF32[i12 >> 2]);
+ i23 = i2 + (i22 * 36 | 0) | 0;
+ HEAPF32[i23 >> 2] = d28;
+ HEAPF32[i23 + 4 >> 2] = d30;
+ d30 = +HEAPF32[i18 >> 2];
+ d25 = +HEAPF32[i19 >> 2];
+ d24 = +HEAPF32[i5 >> 2] + (d29 * d30 - d31 * d25);
+ d28 = +d24;
+ d25 = +(d31 * d30 + d29 * d25 + +HEAPF32[i20 >> 2]);
+ i23 = i2 + (i22 * 36 | 0) + 8 | 0;
+ HEAPF32[i23 >> 2] = d28;
+ HEAPF32[i23 + 4 >> 2] = d25;
+ d24 = +(d24 - d27);
+ d25 = +(+HEAPF32[i2 + (i22 * 36 | 0) + 12 >> 2] - +HEAPF32[i2 + (i22 * 36 | 0) + 4 >> 2]);
+ i23 = i2 + (i22 * 36 | 0) + 16 | 0;
+ HEAPF32[i23 >> 2] = d24;
+ HEAPF32[i23 + 4 >> 2] = d25;
+ HEAPF32[i2 + (i22 * 36 | 0) + 24 >> 2] = 0.0;
+ i22 = i22 + 1 | 0;
+ i23 = HEAP32[i6 >> 2] | 0;
+ if ((i22 | 0) >= (i23 | 0)) {
+ i7 = i23;
+ break L4;
+ }
+ }
+ if ((i9 | 0) == 6) {
+ ___assert_fail(2776, 2808, 103, 2840);
+ } else if ((i9 | 0) == 8) {
+ ___assert_fail(2776, 2808, 103, 2840);
+ }
+ } else {
+ i7 = i12;
+ }
+ } while (0);
+ do {
+ if ((i7 | 0) > 1) {
+ d24 = +HEAPF32[i11 >> 2];
+ if ((i7 | 0) == 2) {
+ d32 = +HEAPF32[i2 + 16 >> 2] - +HEAPF32[i2 + 52 >> 2];
+ d8 = +HEAPF32[i2 + 20 >> 2] - +HEAPF32[i2 + 56 >> 2];
+ d8 = +Math_sqrt(+(d32 * d32 + d8 * d8));
+ } else if ((i7 | 0) == 3) {
+ d8 = +HEAPF32[i2 + 16 >> 2];
+ d32 = +HEAPF32[i2 + 20 >> 2];
+ d8 = (+HEAPF32[i2 + 52 >> 2] - d8) * (+HEAPF32[i2 + 92 >> 2] - d32) - (+HEAPF32[i2 + 56 >> 2] - d32) * (+HEAPF32[i2 + 88 >> 2] - d8);
+ } else {
+ ___assert_fail(2712, 2672, 259, 2736);
+ }
+ if (!(d8 < d24 * .5) ? !(d24 * 2.0 < d8 | d8 < 1.1920928955078125e-7) : 0) {
+ i9 = 18;
+ break;
+ }
+ HEAP32[i6 >> 2] = 0;
+ } else {
+ i9 = 18;
+ }
+ } while (0);
+ if ((i9 | 0) == 18 ? (i7 | 0) != 0 : 0) {
+ STACKTOP = i1;
+ return;
+ }
+ HEAP32[i2 + 28 >> 2] = 0;
+ HEAP32[i2 + 32 >> 2] = 0;
+ if ((HEAP32[i10 + 20 >> 2] | 0) <= 0) {
+ ___assert_fail(2776, 2808, 103, 2840);
+ }
+ i26 = HEAP32[i10 + 16 >> 2] | 0;
+ d8 = +HEAPF32[i26 >> 2];
+ d24 = +HEAPF32[i26 + 4 >> 2];
+ if ((HEAP32[i3 + 20 >> 2] | 0) <= 0) {
+ ___assert_fail(2776, 2808, 103, 2840);
+ }
+ i26 = HEAP32[i3 + 16 >> 2] | 0;
+ d27 = +HEAPF32[i26 >> 2];
+ d25 = +HEAPF32[i26 + 4 >> 2];
+ d30 = +HEAPF32[i4 + 12 >> 2];
+ d32 = +HEAPF32[i4 + 8 >> 2];
+ d31 = +HEAPF32[i4 >> 2] + (d8 * d30 - d24 * d32);
+ d32 = d24 * d30 + d8 * d32 + +HEAPF32[i4 + 4 >> 2];
+ d30 = +d31;
+ d28 = +d32;
+ i26 = i2;
+ HEAPF32[i26 >> 2] = d30;
+ HEAPF32[i26 + 4 >> 2] = d28;
+ d28 = +HEAPF32[i5 + 12 >> 2];
+ d30 = +HEAPF32[i5 + 8 >> 2];
+ d29 = +HEAPF32[i5 >> 2] + (d27 * d28 - d25 * d30);
+ d30 = d25 * d28 + d27 * d30 + +HEAPF32[i5 + 4 >> 2];
+ d27 = +d29;
+ d28 = +d30;
+ i26 = i2 + 8 | 0;
+ HEAPF32[i26 >> 2] = d27;
+ HEAPF32[i26 + 4 >> 2] = d28;
+ d31 = +(d29 - d31);
+ d32 = +(d30 - d32);
+ i26 = i2 + 16 | 0;
+ HEAPF32[i26 >> 2] = d31;
+ HEAPF32[i26 + 4 >> 2] = d32;
+ HEAP32[i6 >> 2] = 1;
+ STACKTOP = i1;
+ return;
+}
+function __ZNSt3__17__sort4IRPFbRK6b2PairS3_EPS1_EEjT0_S8_S8_S8_T_(i6, i7, i5, i4, i1) {
+ i6 = i6 | 0;
+ i7 = i7 | 0;
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i8 = 0, i9 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i2;
+ i9 = FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i7, i6) | 0;
+ i8 = FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i5, i7) | 0;
+ do {
+ if (i9) {
+ if (i8) {
+ HEAP32[i3 + 0 >> 2] = HEAP32[i6 + 0 >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[i6 + 4 >> 2];
+ HEAP32[i3 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ HEAP32[i6 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i6 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i6 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i3 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i3 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i3 + 8 >> 2];
+ i8 = 1;
+ break;
+ }
+ HEAP32[i3 + 0 >> 2] = HEAP32[i6 + 0 >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[i6 + 4 >> 2];
+ HEAP32[i3 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ HEAP32[i6 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i6 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i6 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ HEAP32[i7 + 0 >> 2] = HEAP32[i3 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i3 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i3 + 8 >> 2];
+ if (FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i5, i7) | 0) {
+ HEAP32[i3 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i3 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ HEAP32[i7 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i3 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i3 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i3 + 8 >> 2];
+ i8 = 2;
+ } else {
+ i8 = 1;
+ }
+ } else {
+ if (i8) {
+ HEAP32[i3 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i3 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ HEAP32[i7 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i3 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i3 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i3 + 8 >> 2];
+ if (FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i7, i6) | 0) {
+ HEAP32[i3 + 0 >> 2] = HEAP32[i6 + 0 >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[i6 + 4 >> 2];
+ HEAP32[i3 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ HEAP32[i6 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i6 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i6 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ HEAP32[i7 + 0 >> 2] = HEAP32[i3 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i3 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i3 + 8 >> 2];
+ i8 = 2;
+ } else {
+ i8 = 1;
+ }
+ } else {
+ i8 = 0;
+ }
+ }
+ } while (0);
+ if (!(FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i4, i5) | 0)) {
+ i9 = i8;
+ STACKTOP = i2;
+ return i9 | 0;
+ }
+ HEAP32[i3 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i3 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i4 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i4 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i4 + 8 >> 2];
+ HEAP32[i4 + 0 >> 2] = HEAP32[i3 + 0 >> 2];
+ HEAP32[i4 + 4 >> 2] = HEAP32[i3 + 4 >> 2];
+ HEAP32[i4 + 8 >> 2] = HEAP32[i3 + 8 >> 2];
+ if (!(FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i5, i7) | 0)) {
+ i9 = i8 + 1 | 0;
+ STACKTOP = i2;
+ return i9 | 0;
+ }
+ HEAP32[i3 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i3 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ HEAP32[i7 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i3 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i3 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i3 + 8 >> 2];
+ if (!(FUNCTION_TABLE_iii[HEAP32[i1 >> 2] & 3](i7, i6) | 0)) {
+ i9 = i8 + 2 | 0;
+ STACKTOP = i2;
+ return i9 | 0;
+ }
+ HEAP32[i3 + 0 >> 2] = HEAP32[i6 + 0 >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[i6 + 4 >> 2];
+ HEAP32[i3 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ HEAP32[i6 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i6 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i6 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ HEAP32[i7 + 0 >> 2] = HEAP32[i3 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i3 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i3 + 8 >> 2];
+ i9 = i8 + 3 | 0;
+ STACKTOP = i2;
+ return i9 | 0;
+}
+function __ZN15b2ContactSolver27SolveTOIPositionConstraintsEii(i9, i2, i5) {
+ i9 = i9 | 0;
+ i2 = i2 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, d21 = 0.0, d22 = 0.0, d23 = 0.0, d24 = 0.0, d25 = 0.0, d26 = 0.0, d27 = 0.0, d28 = 0.0, d29 = 0.0, d30 = 0.0, d31 = 0.0, d32 = 0.0, d33 = 0.0, d34 = 0.0, d35 = 0.0, d36 = 0.0, i37 = 0, d38 = 0.0, d39 = 0.0, d40 = 0.0, d41 = 0.0, d42 = 0.0, d43 = 0.0, d44 = 0.0, d45 = 0.0, i46 = 0, d47 = 0.0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 64 | 0;
+ i8 = i1 + 40 | 0;
+ i3 = i1 + 24 | 0;
+ i4 = i1;
+ i6 = i9 + 48 | 0;
+ if ((HEAP32[i6 >> 2] | 0) <= 0) {
+ d45 = 0.0;
+ i37 = d45 >= -.007499999832361937;
+ STACKTOP = i1;
+ return i37 | 0;
+ }
+ i7 = i9 + 36 | 0;
+ i14 = i9 + 24 | 0;
+ i9 = i8 + 8 | 0;
+ i15 = i8 + 12 | 0;
+ i10 = i3 + 8 | 0;
+ i11 = i3 + 12 | 0;
+ i12 = i4 + 8 | 0;
+ i13 = i4 + 16 | 0;
+ i16 = 0;
+ d34 = 0.0;
+ do {
+ i37 = HEAP32[i7 >> 2] | 0;
+ i19 = i37 + (i16 * 88 | 0) | 0;
+ i17 = HEAP32[i37 + (i16 * 88 | 0) + 32 >> 2] | 0;
+ i18 = HEAP32[i37 + (i16 * 88 | 0) + 36 >> 2] | 0;
+ i20 = i37 + (i16 * 88 | 0) + 48 | 0;
+ d21 = +HEAPF32[i20 >> 2];
+ d22 = +HEAPF32[i20 + 4 >> 2];
+ i20 = i37 + (i16 * 88 | 0) + 56 | 0;
+ d23 = +HEAPF32[i20 >> 2];
+ d24 = +HEAPF32[i20 + 4 >> 2];
+ i20 = HEAP32[i37 + (i16 * 88 | 0) + 84 >> 2] | 0;
+ if ((i17 | 0) == (i2 | 0) | (i17 | 0) == (i5 | 0)) {
+ d26 = +HEAPF32[i37 + (i16 * 88 | 0) + 64 >> 2];
+ d27 = +HEAPF32[i37 + (i16 * 88 | 0) + 40 >> 2];
+ } else {
+ d26 = 0.0;
+ d27 = 0.0;
+ }
+ d25 = +HEAPF32[i37 + (i16 * 88 | 0) + 44 >> 2];
+ d28 = +HEAPF32[i37 + (i16 * 88 | 0) + 68 >> 2];
+ i37 = HEAP32[i14 >> 2] | 0;
+ i46 = i37 + (i17 * 12 | 0) | 0;
+ d33 = +HEAPF32[i46 >> 2];
+ d35 = +HEAPF32[i46 + 4 >> 2];
+ d29 = +HEAPF32[i37 + (i17 * 12 | 0) + 8 >> 2];
+ i46 = i37 + (i18 * 12 | 0) | 0;
+ d32 = +HEAPF32[i46 >> 2];
+ d36 = +HEAPF32[i46 + 4 >> 2];
+ d31 = +HEAPF32[i37 + (i18 * 12 | 0) + 8 >> 2];
+ if ((i20 | 0) > 0) {
+ d30 = d27 + d25;
+ i37 = 0;
+ do {
+ d38 = +Math_sin(+d29);
+ HEAPF32[i9 >> 2] = d38;
+ d44 = +Math_cos(+d29);
+ HEAPF32[i15 >> 2] = d44;
+ d43 = +Math_sin(+d31);
+ HEAPF32[i10 >> 2] = d43;
+ d41 = +Math_cos(+d31);
+ HEAPF32[i11 >> 2] = d41;
+ d40 = +(d33 - (d21 * d44 - d22 * d38));
+ d38 = +(d35 - (d22 * d44 + d21 * d38));
+ i46 = i8;
+ HEAPF32[i46 >> 2] = d40;
+ HEAPF32[i46 + 4 >> 2] = d38;
+ d38 = +(d32 - (d23 * d41 - d24 * d43));
+ d43 = +(d36 - (d24 * d41 + d23 * d43));
+ i46 = i3;
+ HEAPF32[i46 >> 2] = d38;
+ HEAPF32[i46 + 4 >> 2] = d43;
+ __ZN24b2PositionSolverManifold10InitializeEP27b2ContactPositionConstraintRK11b2TransformS4_i(i4, i19, i8, i3, i37);
+ i46 = i4;
+ d43 = +HEAPF32[i46 >> 2];
+ d38 = +HEAPF32[i46 + 4 >> 2];
+ i46 = i12;
+ d41 = +HEAPF32[i46 >> 2];
+ d40 = +HEAPF32[i46 + 4 >> 2];
+ d44 = +HEAPF32[i13 >> 2];
+ d39 = d41 - d33;
+ d42 = d40 - d35;
+ d41 = d41 - d32;
+ d40 = d40 - d36;
+ d34 = d34 < d44 ? d34 : d44;
+ d44 = (d44 + .004999999888241291) * .75;
+ d44 = d44 < 0.0 ? d44 : 0.0;
+ d45 = d38 * d39 - d43 * d42;
+ d47 = d38 * d41 - d43 * d40;
+ d45 = d47 * d28 * d47 + (d30 + d45 * d26 * d45);
+ if (d45 > 0.0) {
+ d44 = -(d44 < -.20000000298023224 ? -.20000000298023224 : d44) / d45;
+ } else {
+ d44 = 0.0;
+ }
+ d47 = d43 * d44;
+ d45 = d38 * d44;
+ d33 = d33 - d27 * d47;
+ d35 = d35 - d27 * d45;
+ d29 = d29 - d26 * (d39 * d45 - d42 * d47);
+ d32 = d32 + d25 * d47;
+ d36 = d36 + d25 * d45;
+ d31 = d31 + d28 * (d41 * d45 - d40 * d47);
+ i37 = i37 + 1 | 0;
+ } while ((i37 | 0) != (i20 | 0));
+ i37 = HEAP32[i14 >> 2] | 0;
+ }
+ d47 = +d33;
+ d45 = +d35;
+ i46 = i37 + (i17 * 12 | 0) | 0;
+ HEAPF32[i46 >> 2] = d47;
+ HEAPF32[i46 + 4 >> 2] = d45;
+ i46 = HEAP32[i14 >> 2] | 0;
+ HEAPF32[i46 + (i17 * 12 | 0) + 8 >> 2] = d29;
+ d45 = +d32;
+ d47 = +d36;
+ i46 = i46 + (i18 * 12 | 0) | 0;
+ HEAPF32[i46 >> 2] = d45;
+ HEAPF32[i46 + 4 >> 2] = d47;
+ HEAPF32[(HEAP32[i14 >> 2] | 0) + (i18 * 12 | 0) + 8 >> 2] = d31;
+ i16 = i16 + 1 | 0;
+ } while ((i16 | 0) < (HEAP32[i6 >> 2] | 0));
+ i46 = d34 >= -.007499999832361937;
+ STACKTOP = i1;
+ return i46 | 0;
+}
+function __ZN15b2ContactSolver24SolvePositionConstraintsEv(i7) {
+ i7 = i7 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, d17 = 0.0, d18 = 0.0, d19 = 0.0, d20 = 0.0, i21 = 0, d22 = 0.0, d23 = 0.0, d24 = 0.0, d25 = 0.0, i26 = 0, d27 = 0.0, d28 = 0.0, d29 = 0.0, d30 = 0.0, d31 = 0.0, d32 = 0.0, d33 = 0.0, d34 = 0.0, i35 = 0, d36 = 0.0, d37 = 0.0, d38 = 0.0, d39 = 0.0, d40 = 0.0, d41 = 0.0, d42 = 0.0, d43 = 0.0, i44 = 0, d45 = 0.0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 64 | 0;
+ i4 = i1 + 40 | 0;
+ i5 = i1 + 24 | 0;
+ i3 = i1;
+ i2 = i7 + 48 | 0;
+ if ((HEAP32[i2 >> 2] | 0) <= 0) {
+ d43 = 0.0;
+ i35 = d43 >= -.014999999664723873;
+ STACKTOP = i1;
+ return i35 | 0;
+ }
+ i6 = i7 + 36 | 0;
+ i9 = i7 + 24 | 0;
+ i13 = i4 + 8 | 0;
+ i7 = i4 + 12 | 0;
+ i8 = i5 + 8 | 0;
+ i12 = i5 + 12 | 0;
+ i10 = i3 + 8 | 0;
+ i11 = i3 + 16 | 0;
+ i35 = HEAP32[i9 >> 2] | 0;
+ i15 = 0;
+ d32 = 0.0;
+ do {
+ i21 = HEAP32[i6 >> 2] | 0;
+ i26 = i21 + (i15 * 88 | 0) | 0;
+ i16 = HEAP32[i21 + (i15 * 88 | 0) + 32 >> 2] | 0;
+ i14 = HEAP32[i21 + (i15 * 88 | 0) + 36 >> 2] | 0;
+ i44 = i21 + (i15 * 88 | 0) + 48 | 0;
+ d22 = +HEAPF32[i44 >> 2];
+ d23 = +HEAPF32[i44 + 4 >> 2];
+ d25 = +HEAPF32[i21 + (i15 * 88 | 0) + 40 >> 2];
+ d18 = +HEAPF32[i21 + (i15 * 88 | 0) + 64 >> 2];
+ i44 = i21 + (i15 * 88 | 0) + 56 | 0;
+ d24 = +HEAPF32[i44 >> 2];
+ d19 = +HEAPF32[i44 + 4 >> 2];
+ d17 = +HEAPF32[i21 + (i15 * 88 | 0) + 44 >> 2];
+ d20 = +HEAPF32[i21 + (i15 * 88 | 0) + 68 >> 2];
+ i21 = HEAP32[i21 + (i15 * 88 | 0) + 84 >> 2] | 0;
+ i44 = i35 + (i16 * 12 | 0) | 0;
+ d28 = +HEAPF32[i44 >> 2];
+ d33 = +HEAPF32[i44 + 4 >> 2];
+ d29 = +HEAPF32[i35 + (i16 * 12 | 0) + 8 >> 2];
+ i44 = i35 + (i14 * 12 | 0) | 0;
+ d30 = +HEAPF32[i44 >> 2];
+ d34 = +HEAPF32[i44 + 4 >> 2];
+ d31 = +HEAPF32[i35 + (i14 * 12 | 0) + 8 >> 2];
+ if ((i21 | 0) > 0) {
+ d27 = d25 + d17;
+ i35 = 0;
+ do {
+ d41 = +Math_sin(+d29);
+ HEAPF32[i13 >> 2] = d41;
+ d42 = +Math_cos(+d29);
+ HEAPF32[i7 >> 2] = d42;
+ d39 = +Math_sin(+d31);
+ HEAPF32[i8 >> 2] = d39;
+ d38 = +Math_cos(+d31);
+ HEAPF32[i12 >> 2] = d38;
+ d40 = +(d28 - (d22 * d42 - d23 * d41));
+ d41 = +(d33 - (d23 * d42 + d22 * d41));
+ i44 = i4;
+ HEAPF32[i44 >> 2] = d40;
+ HEAPF32[i44 + 4 >> 2] = d41;
+ d41 = +(d30 - (d24 * d38 - d19 * d39));
+ d39 = +(d34 - (d19 * d38 + d24 * d39));
+ i44 = i5;
+ HEAPF32[i44 >> 2] = d41;
+ HEAPF32[i44 + 4 >> 2] = d39;
+ __ZN24b2PositionSolverManifold10InitializeEP27b2ContactPositionConstraintRK11b2TransformS4_i(i3, i26, i4, i5, i35);
+ i44 = i3;
+ d39 = +HEAPF32[i44 >> 2];
+ d41 = +HEAPF32[i44 + 4 >> 2];
+ i44 = i10;
+ d38 = +HEAPF32[i44 >> 2];
+ d40 = +HEAPF32[i44 + 4 >> 2];
+ d42 = +HEAPF32[i11 >> 2];
+ d36 = d38 - d28;
+ d37 = d40 - d33;
+ d38 = d38 - d30;
+ d40 = d40 - d34;
+ d32 = d32 < d42 ? d32 : d42;
+ d42 = (d42 + .004999999888241291) * .20000000298023224;
+ d43 = d42 < 0.0 ? d42 : 0.0;
+ d42 = d41 * d36 - d39 * d37;
+ d45 = d41 * d38 - d39 * d40;
+ d42 = d45 * d20 * d45 + (d27 + d42 * d18 * d42);
+ if (d42 > 0.0) {
+ d42 = -(d43 < -.20000000298023224 ? -.20000000298023224 : d43) / d42;
+ } else {
+ d42 = 0.0;
+ }
+ d45 = d39 * d42;
+ d43 = d41 * d42;
+ d28 = d28 - d25 * d45;
+ d33 = d33 - d25 * d43;
+ d29 = d29 - d18 * (d36 * d43 - d37 * d45);
+ d30 = d30 + d17 * d45;
+ d34 = d34 + d17 * d43;
+ d31 = d31 + d20 * (d38 * d43 - d40 * d45);
+ i35 = i35 + 1 | 0;
+ } while ((i35 | 0) != (i21 | 0));
+ i35 = HEAP32[i9 >> 2] | 0;
+ }
+ d45 = +d28;
+ d43 = +d33;
+ i35 = i35 + (i16 * 12 | 0) | 0;
+ HEAPF32[i35 >> 2] = d45;
+ HEAPF32[i35 + 4 >> 2] = d43;
+ i35 = HEAP32[i9 >> 2] | 0;
+ HEAPF32[i35 + (i16 * 12 | 0) + 8 >> 2] = d29;
+ d43 = +d30;
+ d45 = +d34;
+ i35 = i35 + (i14 * 12 | 0) | 0;
+ HEAPF32[i35 >> 2] = d43;
+ HEAPF32[i35 + 4 >> 2] = d45;
+ i35 = HEAP32[i9 >> 2] | 0;
+ HEAPF32[i35 + (i14 * 12 | 0) + 8 >> 2] = d31;
+ i15 = i15 + 1 | 0;
+ } while ((i15 | 0) < (HEAP32[i2 >> 2] | 0));
+ i44 = d32 >= -.014999999664723873;
+ STACKTOP = i1;
+ return i44 | 0;
+}
+function __Z22b2CollideEdgeAndCircleP10b2ManifoldPK11b2EdgeShapeRK11b2TransformPK13b2CircleShapeS6_(i1, i7, i6, i22, i5) {
+ i1 = i1 | 0;
+ i7 = i7 | 0;
+ i6 = i6 | 0;
+ i22 = i22 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, d8 = 0.0, d9 = 0.0, d10 = 0.0, d11 = 0.0, d12 = 0.0, d13 = 0.0, i14 = 0, i15 = 0, d16 = 0.0, d17 = 0.0, d18 = 0.0, d19 = 0.0, d20 = 0.0, d21 = 0.0, d23 = 0.0, d24 = 0.0;
+ i4 = STACKTOP;
+ i2 = i1 + 60 | 0;
+ HEAP32[i2 >> 2] = 0;
+ i3 = i22 + 12 | 0;
+ d9 = +HEAPF32[i5 + 12 >> 2];
+ d23 = +HEAPF32[i3 >> 2];
+ d17 = +HEAPF32[i5 + 8 >> 2];
+ d18 = +HEAPF32[i22 + 16 >> 2];
+ d21 = +HEAPF32[i5 >> 2] + (d9 * d23 - d17 * d18) - +HEAPF32[i6 >> 2];
+ d18 = d23 * d17 + d9 * d18 + +HEAPF32[i5 + 4 >> 2] - +HEAPF32[i6 + 4 >> 2];
+ d9 = +HEAPF32[i6 + 12 >> 2];
+ d17 = +HEAPF32[i6 + 8 >> 2];
+ d23 = d21 * d9 + d18 * d17;
+ d17 = d9 * d18 - d21 * d17;
+ i6 = i7 + 12 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ i6 = HEAP32[i6 + 4 >> 2] | 0;
+ d21 = (HEAP32[tempDoublePtr >> 2] = i5, +HEAPF32[tempDoublePtr >> 2]);
+ d18 = (HEAP32[tempDoublePtr >> 2] = i6, +HEAPF32[tempDoublePtr >> 2]);
+ i15 = i7 + 20 | 0;
+ i14 = HEAP32[i15 >> 2] | 0;
+ i15 = HEAP32[i15 + 4 >> 2] | 0;
+ d9 = (HEAP32[tempDoublePtr >> 2] = i14, +HEAPF32[tempDoublePtr >> 2]);
+ d10 = (HEAP32[tempDoublePtr >> 2] = i15, +HEAPF32[tempDoublePtr >> 2]);
+ d8 = d9 - d21;
+ d16 = d10 - d18;
+ d19 = d8 * (d9 - d23) + d16 * (d10 - d17);
+ d13 = d23 - d21;
+ d12 = d17 - d18;
+ d20 = d13 * d8 + d12 * d16;
+ d11 = +HEAPF32[i7 + 8 >> 2] + +HEAPF32[i22 + 8 >> 2];
+ if (d20 <= 0.0) {
+ if (d13 * d13 + d12 * d12 > d11 * d11) {
+ STACKTOP = i4;
+ return;
+ }
+ if ((HEAP8[i7 + 44 | 0] | 0) != 0 ? (i22 = i7 + 28 | 0, d24 = +HEAPF32[i22 >> 2], (d21 - d23) * (d21 - d24) + (d18 - d17) * (d18 - +HEAPF32[i22 + 4 >> 2]) > 0.0) : 0) {
+ STACKTOP = i4;
+ return;
+ }
+ HEAP32[i2 >> 2] = 1;
+ HEAP32[i1 + 56 >> 2] = 0;
+ HEAPF32[i1 + 40 >> 2] = 0.0;
+ HEAPF32[i1 + 44 >> 2] = 0.0;
+ i14 = i1 + 48 | 0;
+ HEAP32[i14 >> 2] = i5;
+ HEAP32[i14 + 4 >> 2] = i6;
+ i14 = i1 + 16 | 0;
+ HEAP32[i14 >> 2] = 0;
+ HEAP8[i14] = 0;
+ HEAP8[i14 + 1 | 0] = 0;
+ HEAP8[i14 + 2 | 0] = 0;
+ HEAP8[i14 + 3 | 0] = 0;
+ i14 = i3;
+ i15 = HEAP32[i14 + 4 >> 2] | 0;
+ i22 = i1;
+ HEAP32[i22 >> 2] = HEAP32[i14 >> 2];
+ HEAP32[i22 + 4 >> 2] = i15;
+ STACKTOP = i4;
+ return;
+ }
+ if (d19 <= 0.0) {
+ d8 = d23 - d9;
+ d12 = d17 - d10;
+ if (d8 * d8 + d12 * d12 > d11 * d11) {
+ STACKTOP = i4;
+ return;
+ }
+ if ((HEAP8[i7 + 45 | 0] | 0) != 0 ? (i22 = i7 + 36 | 0, d24 = +HEAPF32[i22 >> 2], d8 * (d24 - d9) + d12 * (+HEAPF32[i22 + 4 >> 2] - d10) > 0.0) : 0) {
+ STACKTOP = i4;
+ return;
+ }
+ HEAP32[i2 >> 2] = 1;
+ HEAP32[i1 + 56 >> 2] = 0;
+ HEAPF32[i1 + 40 >> 2] = 0.0;
+ HEAPF32[i1 + 44 >> 2] = 0.0;
+ i22 = i1 + 48 | 0;
+ HEAP32[i22 >> 2] = i14;
+ HEAP32[i22 + 4 >> 2] = i15;
+ i14 = i1 + 16 | 0;
+ HEAP32[i14 >> 2] = 0;
+ HEAP8[i14] = 1;
+ HEAP8[i14 + 1 | 0] = 0;
+ HEAP8[i14 + 2 | 0] = 0;
+ HEAP8[i14 + 3 | 0] = 0;
+ i14 = i3;
+ i15 = HEAP32[i14 + 4 >> 2] | 0;
+ i22 = i1;
+ HEAP32[i22 >> 2] = HEAP32[i14 >> 2];
+ HEAP32[i22 + 4 >> 2] = i15;
+ STACKTOP = i4;
+ return;
+ }
+ d24 = d8 * d8 + d16 * d16;
+ if (!(d24 > 0.0)) {
+ ___assert_fail(5560, 5576, 127, 5616);
+ }
+ d24 = 1.0 / d24;
+ d23 = d23 - (d21 * d19 + d9 * d20) * d24;
+ d24 = d17 - (d18 * d19 + d10 * d20) * d24;
+ if (d23 * d23 + d24 * d24 > d11 * d11) {
+ STACKTOP = i4;
+ return;
+ }
+ d9 = -d16;
+ if (d8 * d12 + d13 * d9 < 0.0) {
+ d8 = -d8;
+ } else {
+ d16 = d9;
+ }
+ d9 = +Math_sqrt(+(d8 * d8 + d16 * d16));
+ if (!(d9 < 1.1920928955078125e-7)) {
+ d24 = 1.0 / d9;
+ d16 = d16 * d24;
+ d8 = d8 * d24;
+ }
+ HEAP32[i2 >> 2] = 1;
+ HEAP32[i1 + 56 >> 2] = 1;
+ d23 = +d16;
+ d24 = +d8;
+ i14 = i1 + 40 | 0;
+ HEAPF32[i14 >> 2] = d23;
+ HEAPF32[i14 + 4 >> 2] = d24;
+ i14 = i1 + 48 | 0;
+ HEAP32[i14 >> 2] = i5;
+ HEAP32[i14 + 4 >> 2] = i6;
+ i14 = i1 + 16 | 0;
+ HEAP32[i14 >> 2] = 0;
+ HEAP8[i14] = 0;
+ HEAP8[i14 + 1 | 0] = 0;
+ HEAP8[i14 + 2 | 0] = 1;
+ HEAP8[i14 + 3 | 0] = 0;
+ i14 = i3;
+ i15 = HEAP32[i14 + 4 >> 2] | 0;
+ i22 = i1;
+ HEAP32[i22 >> 2] = HEAP32[i14 >> 2];
+ HEAP32[i22 + 4 >> 2] = i15;
+ STACKTOP = i4;
+ return;
+}
+function __ZN6b2BodyC2EPK9b2BodyDefP7b2World(i1, i2, i5) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ i5 = i5 | 0;
+ var i3 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, d13 = 0.0;
+ i3 = STACKTOP;
+ i9 = i2 + 4 | 0;
+ d13 = +HEAPF32[i9 >> 2];
+ if (!(d13 == d13 & 0.0 == 0.0 & d13 > -inf & d13 < inf)) {
+ ___assert_fail(1496, 1520, 27, 1552);
+ }
+ d13 = +HEAPF32[i2 + 8 >> 2];
+ if (!(d13 == d13 & 0.0 == 0.0 & d13 > -inf & d13 < inf)) {
+ ___assert_fail(1496, 1520, 27, 1552);
+ }
+ i6 = i2 + 16 | 0;
+ d13 = +HEAPF32[i6 >> 2];
+ if (!(d13 == d13 & 0.0 == 0.0 & d13 > -inf & d13 < inf)) {
+ ___assert_fail(1560, 1520, 28, 1552);
+ }
+ d13 = +HEAPF32[i2 + 20 >> 2];
+ if (!(d13 == d13 & 0.0 == 0.0 & d13 > -inf & d13 < inf)) {
+ ___assert_fail(1560, 1520, 28, 1552);
+ }
+ i7 = i2 + 12 | 0;
+ d13 = +HEAPF32[i7 >> 2];
+ if (!(d13 == d13 & 0.0 == 0.0 & d13 > -inf & d13 < inf)) {
+ ___assert_fail(1592, 1520, 29, 1552);
+ }
+ i8 = i2 + 24 | 0;
+ d13 = +HEAPF32[i8 >> 2];
+ if (!(d13 == d13 & 0.0 == 0.0 & d13 > -inf & d13 < inf)) {
+ ___assert_fail(1616, 1520, 30, 1552);
+ }
+ i4 = i2 + 32 | 0;
+ d13 = +HEAPF32[i4 >> 2];
+ if (!(d13 >= 0.0) | d13 == d13 & 0.0 == 0.0 & d13 > -inf & d13 < inf ^ 1) {
+ ___assert_fail(1648, 1520, 31, 1552);
+ }
+ i10 = i2 + 28 | 0;
+ d13 = +HEAPF32[i10 >> 2];
+ if (!(d13 >= 0.0) | d13 == d13 & 0.0 == 0.0 & d13 > -inf & d13 < inf ^ 1) {
+ ___assert_fail(1712, 1520, 32, 1552);
+ }
+ i11 = i1 + 4 | 0;
+ i12 = (HEAP8[i2 + 39 | 0] | 0) == 0 ? 0 : 8;
+ HEAP16[i11 >> 1] = i12;
+ if ((HEAP8[i2 + 38 | 0] | 0) != 0) {
+ i12 = (i12 & 65535 | 16) & 65535;
+ HEAP16[i11 >> 1] = i12;
+ }
+ if ((HEAP8[i2 + 36 | 0] | 0) != 0) {
+ i12 = (i12 & 65535 | 4) & 65535;
+ HEAP16[i11 >> 1] = i12;
+ }
+ if ((HEAP8[i2 + 37 | 0] | 0) != 0) {
+ i12 = (i12 & 65535 | 2) & 65535;
+ HEAP16[i11 >> 1] = i12;
+ }
+ if ((HEAP8[i2 + 40 | 0] | 0) != 0) {
+ HEAP16[i11 >> 1] = i12 & 65535 | 32;
+ }
+ HEAP32[i1 + 88 >> 2] = i5;
+ i11 = i9;
+ i12 = HEAP32[i11 >> 2] | 0;
+ i11 = HEAP32[i11 + 4 >> 2] | 0;
+ i9 = i1 + 12 | 0;
+ HEAP32[i9 >> 2] = i12;
+ HEAP32[i9 + 4 >> 2] = i11;
+ d13 = +HEAPF32[i7 >> 2];
+ HEAPF32[i1 + 20 >> 2] = +Math_sin(+d13);
+ HEAPF32[i1 + 24 >> 2] = +Math_cos(+d13);
+ HEAPF32[i1 + 28 >> 2] = 0.0;
+ HEAPF32[i1 + 32 >> 2] = 0.0;
+ i9 = i1 + 36 | 0;
+ HEAP32[i9 >> 2] = i12;
+ HEAP32[i9 + 4 >> 2] = i11;
+ i9 = i1 + 44 | 0;
+ HEAP32[i9 >> 2] = i12;
+ HEAP32[i9 + 4 >> 2] = i11;
+ HEAPF32[i1 + 52 >> 2] = +HEAPF32[i7 >> 2];
+ HEAPF32[i1 + 56 >> 2] = +HEAPF32[i7 >> 2];
+ HEAPF32[i1 + 60 >> 2] = 0.0;
+ HEAP32[i1 + 108 >> 2] = 0;
+ HEAP32[i1 + 112 >> 2] = 0;
+ HEAP32[i1 + 92 >> 2] = 0;
+ HEAP32[i1 + 96 >> 2] = 0;
+ i9 = i6;
+ i11 = HEAP32[i9 + 4 >> 2] | 0;
+ i12 = i1 + 64 | 0;
+ HEAP32[i12 >> 2] = HEAP32[i9 >> 2];
+ HEAP32[i12 + 4 >> 2] = i11;
+ HEAPF32[i1 + 72 >> 2] = +HEAPF32[i8 >> 2];
+ HEAPF32[i1 + 132 >> 2] = +HEAPF32[i10 >> 2];
+ HEAPF32[i1 + 136 >> 2] = +HEAPF32[i4 >> 2];
+ HEAPF32[i1 + 140 >> 2] = +HEAPF32[i2 + 48 >> 2];
+ HEAPF32[i1 + 76 >> 2] = 0.0;
+ HEAPF32[i1 + 80 >> 2] = 0.0;
+ HEAPF32[i1 + 84 >> 2] = 0.0;
+ HEAPF32[i1 + 144 >> 2] = 0.0;
+ i12 = HEAP32[i2 >> 2] | 0;
+ HEAP32[i1 >> 2] = i12;
+ i4 = i1 + 116 | 0;
+ if ((i12 | 0) == 2) {
+ HEAPF32[i4 >> 2] = 1.0;
+ HEAPF32[i1 + 120 >> 2] = 1.0;
+ i11 = i1 + 124 | 0;
+ HEAPF32[i11 >> 2] = 0.0;
+ i11 = i1 + 128 | 0;
+ HEAPF32[i11 >> 2] = 0.0;
+ i11 = i2 + 44 | 0;
+ i11 = HEAP32[i11 >> 2] | 0;
+ i12 = i1 + 148 | 0;
+ HEAP32[i12 >> 2] = i11;
+ i12 = i1 + 100 | 0;
+ HEAP32[i12 >> 2] = 0;
+ i12 = i1 + 104 | 0;
+ HEAP32[i12 >> 2] = 0;
+ STACKTOP = i3;
+ return;
+ } else {
+ HEAPF32[i4 >> 2] = 0.0;
+ HEAPF32[i1 + 120 >> 2] = 0.0;
+ i11 = i1 + 124 | 0;
+ HEAPF32[i11 >> 2] = 0.0;
+ i11 = i1 + 128 | 0;
+ HEAPF32[i11 >> 2] = 0.0;
+ i11 = i2 + 44 | 0;
+ i11 = HEAP32[i11 >> 2] | 0;
+ i12 = i1 + 148 | 0;
+ HEAP32[i12 >> 2] = i11;
+ i12 = i1 + 100 | 0;
+ HEAP32[i12 >> 2] = 0;
+ i12 = i1 + 104 | 0;
+ HEAP32[i12 >> 2] = 0;
+ STACKTOP = i3;
+ return;
+ }
+}
+function __ZN24b2PositionSolverManifold10InitializeEP27b2ContactPositionConstraintRK11b2TransformS4_i(i2, i1, i13, i12, i15) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ i13 = i13 | 0;
+ i12 = i12 | 0;
+ i15 = i15 | 0;
+ var i3 = 0, d4 = 0.0, d5 = 0.0, d6 = 0.0, d7 = 0.0, d8 = 0.0, d9 = 0.0, d10 = 0.0, d11 = 0.0, i14 = 0, d16 = 0.0, d17 = 0.0, d18 = 0.0, i19 = 0, i20 = 0;
+ i3 = STACKTOP;
+ if ((HEAP32[i1 + 84 >> 2] | 0) <= 0) {
+ ___assert_fail(6752, 6520, 617, 6776);
+ }
+ i14 = HEAP32[i1 + 72 >> 2] | 0;
+ if ((i14 | 0) == 1) {
+ i19 = i13 + 12 | 0;
+ d5 = +HEAPF32[i19 >> 2];
+ d6 = +HEAPF32[i1 + 16 >> 2];
+ i14 = i13 + 8 | 0;
+ d7 = +HEAPF32[i14 >> 2];
+ d9 = +HEAPF32[i1 + 20 >> 2];
+ d4 = d5 * d6 - d7 * d9;
+ d9 = d6 * d7 + d5 * d9;
+ d5 = +d4;
+ d7 = +d9;
+ i20 = i2;
+ HEAPF32[i20 >> 2] = d5;
+ HEAPF32[i20 + 4 >> 2] = d7;
+ d7 = +HEAPF32[i19 >> 2];
+ d5 = +HEAPF32[i1 + 24 >> 2];
+ d6 = +HEAPF32[i14 >> 2];
+ d8 = +HEAPF32[i1 + 28 >> 2];
+ d16 = +HEAPF32[i12 + 12 >> 2];
+ d18 = +HEAPF32[i1 + (i15 << 3) >> 2];
+ d17 = +HEAPF32[i12 + 8 >> 2];
+ d11 = +HEAPF32[i1 + (i15 << 3) + 4 >> 2];
+ d10 = +HEAPF32[i12 >> 2] + (d16 * d18 - d17 * d11);
+ d11 = d18 * d17 + d16 * d11 + +HEAPF32[i12 + 4 >> 2];
+ HEAPF32[i2 + 16 >> 2] = d4 * (d10 - (+HEAPF32[i13 >> 2] + (d7 * d5 - d6 * d8))) + (d11 - (d5 * d6 + d7 * d8 + +HEAPF32[i13 + 4 >> 2])) * d9 - +HEAPF32[i1 + 76 >> 2] - +HEAPF32[i1 + 80 >> 2];
+ d10 = +d10;
+ d11 = +d11;
+ i15 = i2 + 8 | 0;
+ HEAPF32[i15 >> 2] = d10;
+ HEAPF32[i15 + 4 >> 2] = d11;
+ STACKTOP = i3;
+ return;
+ } else if ((i14 | 0) == 2) {
+ i19 = i12 + 12 | 0;
+ d7 = +HEAPF32[i19 >> 2];
+ d8 = +HEAPF32[i1 + 16 >> 2];
+ i20 = i12 + 8 | 0;
+ d9 = +HEAPF32[i20 >> 2];
+ d18 = +HEAPF32[i1 + 20 >> 2];
+ d17 = d7 * d8 - d9 * d18;
+ d18 = d8 * d9 + d7 * d18;
+ d7 = +d17;
+ d9 = +d18;
+ i14 = i2;
+ HEAPF32[i14 >> 2] = d7;
+ HEAPF32[i14 + 4 >> 2] = d9;
+ d9 = +HEAPF32[i19 >> 2];
+ d7 = +HEAPF32[i1 + 24 >> 2];
+ d8 = +HEAPF32[i20 >> 2];
+ d10 = +HEAPF32[i1 + 28 >> 2];
+ d6 = +HEAPF32[i13 + 12 >> 2];
+ d4 = +HEAPF32[i1 + (i15 << 3) >> 2];
+ d5 = +HEAPF32[i13 + 8 >> 2];
+ d16 = +HEAPF32[i1 + (i15 << 3) + 4 >> 2];
+ d11 = +HEAPF32[i13 >> 2] + (d6 * d4 - d5 * d16);
+ d16 = d4 * d5 + d6 * d16 + +HEAPF32[i13 + 4 >> 2];
+ HEAPF32[i2 + 16 >> 2] = d17 * (d11 - (+HEAPF32[i12 >> 2] + (d9 * d7 - d8 * d10))) + (d16 - (d7 * d8 + d9 * d10 + +HEAPF32[i12 + 4 >> 2])) * d18 - +HEAPF32[i1 + 76 >> 2] - +HEAPF32[i1 + 80 >> 2];
+ d11 = +d11;
+ d16 = +d16;
+ i20 = i2 + 8 | 0;
+ HEAPF32[i20 >> 2] = d11;
+ HEAPF32[i20 + 4 >> 2] = d16;
+ d17 = +-d17;
+ d18 = +-d18;
+ i20 = i2;
+ HEAPF32[i20 >> 2] = d17;
+ HEAPF32[i20 + 4 >> 2] = d18;
+ STACKTOP = i3;
+ return;
+ } else if ((i14 | 0) == 0) {
+ d7 = +HEAPF32[i13 + 12 >> 2];
+ d8 = +HEAPF32[i1 + 24 >> 2];
+ d18 = +HEAPF32[i13 + 8 >> 2];
+ d6 = +HEAPF32[i1 + 28 >> 2];
+ d4 = +HEAPF32[i13 >> 2] + (d7 * d8 - d18 * d6);
+ d6 = d8 * d18 + d7 * d6 + +HEAPF32[i13 + 4 >> 2];
+ d7 = +HEAPF32[i12 + 12 >> 2];
+ d18 = +HEAPF32[i1 >> 2];
+ d8 = +HEAPF32[i12 + 8 >> 2];
+ d9 = +HEAPF32[i1 + 4 >> 2];
+ d5 = +HEAPF32[i12 >> 2] + (d7 * d18 - d8 * d9);
+ d9 = d18 * d8 + d7 * d9 + +HEAPF32[i12 + 4 >> 2];
+ d7 = d5 - d4;
+ d8 = d9 - d6;
+ d18 = +d7;
+ d10 = +d8;
+ i20 = i2;
+ HEAPF32[i20 >> 2] = d18;
+ HEAPF32[i20 + 4 >> 2] = d10;
+ d10 = +Math_sqrt(+(d7 * d7 + d8 * d8));
+ if (d10 < 1.1920928955078125e-7) {
+ d10 = d7;
+ d11 = d8;
+ } else {
+ d11 = 1.0 / d10;
+ d10 = d7 * d11;
+ HEAPF32[i2 >> 2] = d10;
+ d11 = d8 * d11;
+ HEAPF32[i2 + 4 >> 2] = d11;
+ }
+ d17 = +((d4 + d5) * .5);
+ d18 = +((d6 + d9) * .5);
+ i20 = i2 + 8 | 0;
+ HEAPF32[i20 >> 2] = d17;
+ HEAPF32[i20 + 4 >> 2] = d18;
+ HEAPF32[i2 + 16 >> 2] = d7 * d10 + d8 * d11 - +HEAPF32[i1 + 76 >> 2] - +HEAPF32[i1 + 80 >> 2];
+ STACKTOP = i3;
+ return;
+ } else {
+ STACKTOP = i3;
+ return;
+ }
+}
+function __ZNSt3__118__insertion_sort_3IRPFbRK6b2PairS3_EPS1_EEvT0_S8_T_(i5, i1, i2) {
+ i5 = i5 | 0;
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i3 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0;
+ i4 = STACKTOP;
+ STACKTOP = STACKTOP + 32 | 0;
+ i6 = i4 + 12 | 0;
+ i3 = i4;
+ i7 = i5 + 24 | 0;
+ i8 = i5 + 12 | 0;
+ i10 = FUNCTION_TABLE_iii[HEAP32[i2 >> 2] & 3](i8, i5) | 0;
+ i9 = FUNCTION_TABLE_iii[HEAP32[i2 >> 2] & 3](i7, i8) | 0;
+ do {
+ if (i10) {
+ if (i9) {
+ HEAP32[i6 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i6 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i6 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ HEAP32[i7 + 0 >> 2] = HEAP32[i6 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i6 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ break;
+ }
+ HEAP32[i6 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i6 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i6 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i8 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i8 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i8 + 8 >> 2];
+ HEAP32[i8 + 0 >> 2] = HEAP32[i6 + 0 >> 2];
+ HEAP32[i8 + 4 >> 2] = HEAP32[i6 + 4 >> 2];
+ HEAP32[i8 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ if (FUNCTION_TABLE_iii[HEAP32[i2 >> 2] & 3](i7, i8) | 0) {
+ HEAP32[i6 + 0 >> 2] = HEAP32[i8 + 0 >> 2];
+ HEAP32[i6 + 4 >> 2] = HEAP32[i8 + 4 >> 2];
+ HEAP32[i6 + 8 >> 2] = HEAP32[i8 + 8 >> 2];
+ HEAP32[i8 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i8 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i8 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ HEAP32[i7 + 0 >> 2] = HEAP32[i6 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i6 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ }
+ } else {
+ if (i9) {
+ HEAP32[i6 + 0 >> 2] = HEAP32[i8 + 0 >> 2];
+ HEAP32[i6 + 4 >> 2] = HEAP32[i8 + 4 >> 2];
+ HEAP32[i6 + 8 >> 2] = HEAP32[i8 + 8 >> 2];
+ HEAP32[i8 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i8 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i8 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ HEAP32[i7 + 0 >> 2] = HEAP32[i6 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i6 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ if (FUNCTION_TABLE_iii[HEAP32[i2 >> 2] & 3](i8, i5) | 0) {
+ HEAP32[i6 + 0 >> 2] = HEAP32[i5 + 0 >> 2];
+ HEAP32[i6 + 4 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i6 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ HEAP32[i5 + 0 >> 2] = HEAP32[i8 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i8 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i8 + 8 >> 2];
+ HEAP32[i8 + 0 >> 2] = HEAP32[i6 + 0 >> 2];
+ HEAP32[i8 + 4 >> 2] = HEAP32[i6 + 4 >> 2];
+ HEAP32[i8 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ }
+ }
+ }
+ } while (0);
+ i6 = i5 + 36 | 0;
+ if ((i6 | 0) == (i1 | 0)) {
+ STACKTOP = i4;
+ return;
+ }
+ while (1) {
+ if (FUNCTION_TABLE_iii[HEAP32[i2 >> 2] & 3](i6, i7) | 0) {
+ HEAP32[i3 + 0 >> 2] = HEAP32[i6 + 0 >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[i6 + 4 >> 2];
+ HEAP32[i3 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ i8 = i6;
+ while (1) {
+ HEAP32[i8 + 0 >> 2] = HEAP32[i7 + 0 >> 2];
+ HEAP32[i8 + 4 >> 2] = HEAP32[i7 + 4 >> 2];
+ HEAP32[i8 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ if ((i7 | 0) == (i5 | 0)) {
+ break;
+ }
+ i8 = i7 + -12 | 0;
+ if (FUNCTION_TABLE_iii[HEAP32[i2 >> 2] & 3](i3, i8) | 0) {
+ i10 = i7;
+ i7 = i8;
+ i8 = i10;
+ } else {
+ break;
+ }
+ }
+ HEAP32[i7 + 0 >> 2] = HEAP32[i3 + 0 >> 2];
+ HEAP32[i7 + 4 >> 2] = HEAP32[i3 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = HEAP32[i3 + 8 >> 2];
+ }
+ i7 = i6 + 12 | 0;
+ if ((i7 | 0) == (i1 | 0)) {
+ break;
+ } else {
+ i10 = i6;
+ i6 = i7;
+ i7 = i10;
+ }
+ }
+ STACKTOP = i4;
+ return;
+}
+function __ZNK20b2SeparationFunction8EvaluateEiif(i10, i12, i11, d9) {
+ i10 = i10 | 0;
+ i12 = i12 | 0;
+ i11 = i11 | 0;
+ d9 = +d9;
+ var d1 = 0.0, d2 = 0.0, d3 = 0.0, d4 = 0.0, d5 = 0.0, d6 = 0.0, i7 = 0, d8 = 0.0, d13 = 0.0, d14 = 0.0, d15 = 0.0, d16 = 0.0, i17 = 0, d18 = 0.0, d19 = 0.0;
+ i7 = STACKTOP;
+ d14 = 1.0 - d9;
+ d3 = d14 * +HEAPF32[i10 + 32 >> 2] + +HEAPF32[i10 + 36 >> 2] * d9;
+ d4 = +Math_sin(+d3);
+ d3 = +Math_cos(+d3);
+ d5 = +HEAPF32[i10 + 8 >> 2];
+ d6 = +HEAPF32[i10 + 12 >> 2];
+ d2 = d14 * +HEAPF32[i10 + 16 >> 2] + +HEAPF32[i10 + 24 >> 2] * d9 - (d3 * d5 - d4 * d6);
+ d6 = d14 * +HEAPF32[i10 + 20 >> 2] + +HEAPF32[i10 + 28 >> 2] * d9 - (d4 * d5 + d3 * d6);
+ d5 = d14 * +HEAPF32[i10 + 68 >> 2] + +HEAPF32[i10 + 72 >> 2] * d9;
+ d1 = +Math_sin(+d5);
+ d5 = +Math_cos(+d5);
+ d15 = +HEAPF32[i10 + 44 >> 2];
+ d16 = +HEAPF32[i10 + 48 >> 2];
+ d8 = d14 * +HEAPF32[i10 + 52 >> 2] + +HEAPF32[i10 + 60 >> 2] * d9 - (d5 * d15 - d1 * d16);
+ d9 = d14 * +HEAPF32[i10 + 56 >> 2] + +HEAPF32[i10 + 64 >> 2] * d9 - (d1 * d15 + d5 * d16);
+ i17 = HEAP32[i10 + 80 >> 2] | 0;
+ if ((i17 | 0) == 0) {
+ d14 = +HEAPF32[i10 + 92 >> 2];
+ d13 = +HEAPF32[i10 + 96 >> 2];
+ i17 = HEAP32[i10 >> 2] | 0;
+ if (!((i12 | 0) > -1)) {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ if ((HEAP32[i17 + 20 >> 2] | 0) <= (i12 | 0)) {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ i17 = (HEAP32[i17 + 16 >> 2] | 0) + (i12 << 3) | 0;
+ d15 = +HEAPF32[i17 >> 2];
+ d16 = +HEAPF32[i17 + 4 >> 2];
+ i10 = HEAP32[i10 + 4 >> 2] | 0;
+ if (!((i11 | 0) > -1)) {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ if ((HEAP32[i10 + 20 >> 2] | 0) <= (i11 | 0)) {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ i17 = (HEAP32[i10 + 16 >> 2] | 0) + (i11 << 3) | 0;
+ d19 = +HEAPF32[i17 >> 2];
+ d18 = +HEAPF32[i17 + 4 >> 2];
+ d16 = d14 * (d8 + (d5 * d19 - d1 * d18) - (d2 + (d3 * d15 - d4 * d16))) + d13 * (d9 + (d1 * d19 + d5 * d18) - (d6 + (d4 * d15 + d3 * d16)));
+ STACKTOP = i7;
+ return +d16;
+ } else if ((i17 | 0) == 1) {
+ d14 = +HEAPF32[i10 + 92 >> 2];
+ d13 = +HEAPF32[i10 + 96 >> 2];
+ d16 = +HEAPF32[i10 + 84 >> 2];
+ d15 = +HEAPF32[i10 + 88 >> 2];
+ i10 = HEAP32[i10 + 4 >> 2] | 0;
+ if (!((i11 | 0) > -1)) {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ if ((HEAP32[i10 + 20 >> 2] | 0) <= (i11 | 0)) {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ i17 = (HEAP32[i10 + 16 >> 2] | 0) + (i11 << 3) | 0;
+ d18 = +HEAPF32[i17 >> 2];
+ d19 = +HEAPF32[i17 + 4 >> 2];
+ d19 = (d3 * d14 - d4 * d13) * (d8 + (d5 * d18 - d1 * d19) - (d2 + (d3 * d16 - d4 * d15))) + (d4 * d14 + d3 * d13) * (d9 + (d1 * d18 + d5 * d19) - (d6 + (d4 * d16 + d3 * d15)));
+ STACKTOP = i7;
+ return +d19;
+ } else if ((i17 | 0) == 2) {
+ d16 = +HEAPF32[i10 + 92 >> 2];
+ d15 = +HEAPF32[i10 + 96 >> 2];
+ d14 = +HEAPF32[i10 + 84 >> 2];
+ d13 = +HEAPF32[i10 + 88 >> 2];
+ i10 = HEAP32[i10 >> 2] | 0;
+ if (!((i12 | 0) > -1)) {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ if ((HEAP32[i10 + 20 >> 2] | 0) <= (i12 | 0)) {
+ ___assert_fail(3640, 3672, 103, 3704);
+ }
+ i17 = (HEAP32[i10 + 16 >> 2] | 0) + (i12 << 3) | 0;
+ d18 = +HEAPF32[i17 >> 2];
+ d19 = +HEAPF32[i17 + 4 >> 2];
+ d19 = (d5 * d16 - d1 * d15) * (d2 + (d3 * d18 - d4 * d19) - (d8 + (d5 * d14 - d1 * d13))) + (d1 * d16 + d5 * d15) * (d6 + (d4 * d18 + d3 * d19) - (d9 + (d1 * d14 + d5 * d13)));
+ STACKTOP = i7;
+ return +d19;
+ } else {
+ ___assert_fail(3616, 3560, 242, 3624);
+ }
+ return 0.0;
+}
+function __ZN6b2Body13ResetMassDataEv(i2) {
+ i2 = i2 | 0;
+ var d1 = 0.0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, d14 = 0.0, d15 = 0.0, d16 = 0.0, i17 = 0, d18 = 0.0, d19 = 0.0, i20 = 0, d21 = 0.0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i10 = i3;
+ i8 = i2 + 116 | 0;
+ i9 = i2 + 120 | 0;
+ i4 = i2 + 124 | 0;
+ i5 = i2 + 128 | 0;
+ i6 = i2 + 28 | 0;
+ HEAPF32[i6 >> 2] = 0.0;
+ HEAPF32[i2 + 32 >> 2] = 0.0;
+ HEAP32[i8 + 0 >> 2] = 0;
+ HEAP32[i8 + 4 >> 2] = 0;
+ HEAP32[i8 + 8 >> 2] = 0;
+ HEAP32[i8 + 12 >> 2] = 0;
+ i11 = HEAP32[i2 >> 2] | 0;
+ if ((i11 | 0) == 2) {
+ i17 = 3784;
+ d16 = +HEAPF32[i17 >> 2];
+ d18 = +HEAPF32[i17 + 4 >> 2];
+ i17 = HEAP32[i2 + 100 >> 2] | 0;
+ if ((i17 | 0) != 0) {
+ i11 = i10 + 4 | 0;
+ i12 = i10 + 8 | 0;
+ i13 = i10 + 12 | 0;
+ d14 = 0.0;
+ d15 = 0.0;
+ do {
+ d19 = +HEAPF32[i17 >> 2];
+ if (!(d19 == 0.0)) {
+ i20 = HEAP32[i17 + 12 >> 2] | 0;
+ FUNCTION_TABLE_viid[HEAP32[(HEAP32[i20 >> 2] | 0) + 28 >> 2] & 3](i20, i10, d19);
+ d14 = +HEAPF32[i10 >> 2];
+ d15 = d14 + +HEAPF32[i8 >> 2];
+ HEAPF32[i8 >> 2] = d15;
+ d16 = d16 + d14 * +HEAPF32[i11 >> 2];
+ d18 = d18 + d14 * +HEAPF32[i12 >> 2];
+ d14 = +HEAPF32[i13 >> 2] + +HEAPF32[i4 >> 2];
+ HEAPF32[i4 >> 2] = d14;
+ }
+ i17 = HEAP32[i17 + 4 >> 2] | 0;
+ } while ((i17 | 0) != 0);
+ if (d15 > 0.0) {
+ d19 = 1.0 / d15;
+ HEAPF32[i9 >> 2] = d19;
+ d16 = d16 * d19;
+ d18 = d18 * d19;
+ } else {
+ i7 = 11;
+ }
+ } else {
+ d14 = 0.0;
+ i7 = 11;
+ }
+ if ((i7 | 0) == 11) {
+ HEAPF32[i8 >> 2] = 1.0;
+ HEAPF32[i9 >> 2] = 1.0;
+ d15 = 1.0;
+ }
+ do {
+ if (d14 > 0.0 ? (HEAP16[i2 + 4 >> 1] & 16) == 0 : 0) {
+ d14 = d14 - (d18 * d18 + d16 * d16) * d15;
+ HEAPF32[i4 >> 2] = d14;
+ if (d14 > 0.0) {
+ d1 = 1.0 / d14;
+ break;
+ } else {
+ ___assert_fail(1872, 1520, 319, 1856);
+ }
+ } else {
+ i7 = 17;
+ }
+ } while (0);
+ if ((i7 | 0) == 17) {
+ HEAPF32[i4 >> 2] = 0.0;
+ d1 = 0.0;
+ }
+ HEAPF32[i5 >> 2] = d1;
+ i20 = i2 + 44 | 0;
+ i17 = i20;
+ d19 = +HEAPF32[i17 >> 2];
+ d14 = +HEAPF32[i17 + 4 >> 2];
+ d21 = +d16;
+ d1 = +d18;
+ i17 = i6;
+ HEAPF32[i17 >> 2] = d21;
+ HEAPF32[i17 + 4 >> 2] = d1;
+ d1 = +HEAPF32[i2 + 24 >> 2];
+ d21 = +HEAPF32[i2 + 20 >> 2];
+ d15 = +HEAPF32[i2 + 12 >> 2] + (d1 * d16 - d21 * d18);
+ d16 = d16 * d21 + d1 * d18 + +HEAPF32[i2 + 16 >> 2];
+ d1 = +d15;
+ d18 = +d16;
+ HEAPF32[i20 >> 2] = d1;
+ HEAPF32[i20 + 4 >> 2] = d18;
+ i20 = i2 + 36 | 0;
+ HEAPF32[i20 >> 2] = d1;
+ HEAPF32[i20 + 4 >> 2] = d18;
+ d18 = +HEAPF32[i2 + 72 >> 2];
+ i20 = i2 + 64 | 0;
+ HEAPF32[i20 >> 2] = +HEAPF32[i20 >> 2] - d18 * (d16 - d14);
+ i20 = i2 + 68 | 0;
+ HEAPF32[i20 >> 2] = d18 * (d15 - d19) + +HEAPF32[i20 >> 2];
+ STACKTOP = i3;
+ return;
+ } else if ((i11 | 0) == 1 | (i11 | 0) == 0) {
+ i17 = i2 + 12 | 0;
+ i13 = HEAP32[i17 >> 2] | 0;
+ i17 = HEAP32[i17 + 4 >> 2] | 0;
+ i20 = i2 + 36 | 0;
+ HEAP32[i20 >> 2] = i13;
+ HEAP32[i20 + 4 >> 2] = i17;
+ i20 = i2 + 44 | 0;
+ HEAP32[i20 >> 2] = i13;
+ HEAP32[i20 + 4 >> 2] = i17;
+ HEAPF32[i2 + 52 >> 2] = +HEAPF32[i2 + 56 >> 2];
+ STACKTOP = i3;
+ return;
+ } else {
+ ___assert_fail(1824, 1520, 284, 1856);
+ }
+}
+function __ZN9b2Contact6UpdateEP17b2ContactListener(i1, i4) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ var i2 = 0, i3 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 64 | 0;
+ i2 = i3;
+ i10 = i1 + 64 | 0;
+ i6 = i2 + 0 | 0;
+ i7 = i10 + 0 | 0;
+ i5 = i6 + 64 | 0;
+ do {
+ HEAP32[i6 >> 2] = HEAP32[i7 >> 2];
+ i6 = i6 + 4 | 0;
+ i7 = i7 + 4 | 0;
+ } while ((i6 | 0) < (i5 | 0));
+ i6 = i1 + 4 | 0;
+ i11 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i6 >> 2] = i11 | 4;
+ i11 = i11 >>> 1;
+ i14 = HEAP32[i1 + 48 >> 2] | 0;
+ i15 = HEAP32[i1 + 52 >> 2] | 0;
+ i5 = (HEAP8[i15 + 38 | 0] | HEAP8[i14 + 38 | 0]) << 24 >> 24 != 0;
+ i8 = HEAP32[i14 + 8 >> 2] | 0;
+ i7 = HEAP32[i15 + 8 >> 2] | 0;
+ i12 = i8 + 12 | 0;
+ i13 = i7 + 12 | 0;
+ if (!i5) {
+ FUNCTION_TABLE_viiii[HEAP32[HEAP32[i1 >> 2] >> 2] & 15](i1, i10, i12, i13);
+ i12 = i1 + 124 | 0;
+ i10 = (HEAP32[i12 >> 2] | 0) > 0;
+ L4 : do {
+ if (i10) {
+ i19 = HEAP32[i2 + 60 >> 2] | 0;
+ if ((i19 | 0) > 0) {
+ i18 = 0;
+ } else {
+ i9 = 0;
+ while (1) {
+ HEAPF32[i1 + (i9 * 20 | 0) + 72 >> 2] = 0.0;
+ HEAPF32[i1 + (i9 * 20 | 0) + 76 >> 2] = 0.0;
+ i9 = i9 + 1 | 0;
+ if ((i9 | 0) >= (HEAP32[i12 >> 2] | 0)) {
+ break L4;
+ }
+ }
+ }
+ do {
+ i16 = i1 + (i18 * 20 | 0) + 72 | 0;
+ HEAPF32[i16 >> 2] = 0.0;
+ i15 = i1 + (i18 * 20 | 0) + 76 | 0;
+ HEAPF32[i15 >> 2] = 0.0;
+ i14 = HEAP32[i1 + (i18 * 20 | 0) + 80 >> 2] | 0;
+ i17 = 0;
+ while (1) {
+ i13 = i17 + 1 | 0;
+ if ((HEAP32[i2 + (i17 * 20 | 0) + 16 >> 2] | 0) == (i14 | 0)) {
+ i9 = 7;
+ break;
+ }
+ if ((i13 | 0) < (i19 | 0)) {
+ i17 = i13;
+ } else {
+ break;
+ }
+ }
+ if ((i9 | 0) == 7) {
+ i9 = 0;
+ HEAPF32[i16 >> 2] = +HEAPF32[i2 + (i17 * 20 | 0) + 8 >> 2];
+ HEAPF32[i15 >> 2] = +HEAPF32[i2 + (i17 * 20 | 0) + 12 >> 2];
+ }
+ i18 = i18 + 1 | 0;
+ } while ((i18 | 0) < (HEAP32[i12 >> 2] | 0));
+ }
+ } while (0);
+ i9 = i11 & 1;
+ if (i10 ^ (i9 | 0) != 0) {
+ i11 = i8 + 4 | 0;
+ i12 = HEAPU16[i11 >> 1] | 0;
+ if ((i12 & 2 | 0) == 0) {
+ HEAP16[i11 >> 1] = i12 | 2;
+ HEAPF32[i8 + 144 >> 2] = 0.0;
+ }
+ i8 = i7 + 4 | 0;
+ i11 = HEAPU16[i8 >> 1] | 0;
+ if ((i11 & 2 | 0) == 0) {
+ HEAP16[i8 >> 1] = i11 | 2;
+ HEAPF32[i7 + 144 >> 2] = 0.0;
+ }
+ }
+ } else {
+ i10 = __Z13b2TestOverlapPK7b2ShapeiS1_iRK11b2TransformS4_(HEAP32[i14 + 12 >> 2] | 0, HEAP32[i1 + 56 >> 2] | 0, HEAP32[i15 + 12 >> 2] | 0, HEAP32[i1 + 60 >> 2] | 0, i12, i13) | 0;
+ HEAP32[i1 + 124 >> 2] = 0;
+ i9 = i11 & 1;
+ }
+ i7 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i6 >> 2] = i10 ? i7 | 2 : i7 & -3;
+ i8 = (i9 | 0) == 0;
+ i6 = i10 ^ 1;
+ i7 = (i4 | 0) == 0;
+ if (!(i8 ^ 1 | i6 | i7)) {
+ FUNCTION_TABLE_vii[HEAP32[(HEAP32[i4 >> 2] | 0) + 8 >> 2] & 15](i4, i1);
+ }
+ if (!(i8 | i10 | i7)) {
+ FUNCTION_TABLE_vii[HEAP32[(HEAP32[i4 >> 2] | 0) + 12 >> 2] & 15](i4, i1);
+ }
+ if (i5 | i6 | i7) {
+ STACKTOP = i3;
+ return;
+ }
+ FUNCTION_TABLE_viii[HEAP32[(HEAP32[i4 >> 2] | 0) + 16 >> 2] & 3](i4, i1, i2);
+ STACKTOP = i3;
+ return;
+}
+function __ZN13b2DynamicTree10RemoveLeafEi(i1, i12) {
+ i1 = i1 | 0;
+ i12 = i12 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, d8 = 0.0, d9 = 0.0, d10 = 0.0, d11 = 0.0, i13 = 0;
+ i2 = STACKTOP;
+ if ((HEAP32[i1 >> 2] | 0) == (i12 | 0)) {
+ HEAP32[i1 >> 2] = -1;
+ STACKTOP = i2;
+ return;
+ }
+ i3 = i1 + 4 | 0;
+ i5 = HEAP32[i3 >> 2] | 0;
+ i6 = HEAP32[i5 + (i12 * 36 | 0) + 20 >> 2] | 0;
+ i4 = i5 + (i6 * 36 | 0) + 20 | 0;
+ i7 = HEAP32[i4 >> 2] | 0;
+ i13 = HEAP32[i5 + (i6 * 36 | 0) + 24 >> 2] | 0;
+ if ((i13 | 0) == (i12 | 0)) {
+ i13 = HEAP32[i5 + (i6 * 36 | 0) + 28 >> 2] | 0;
+ }
+ if ((i7 | 0) == -1) {
+ HEAP32[i1 >> 2] = i13;
+ HEAP32[i5 + (i13 * 36 | 0) + 20 >> 2] = -1;
+ if (!((i6 | 0) > -1)) {
+ ___assert_fail(3e3, 2944, 97, 3040);
+ }
+ if ((HEAP32[i1 + 12 >> 2] | 0) <= (i6 | 0)) {
+ ___assert_fail(3e3, 2944, 97, 3040);
+ }
+ i3 = i1 + 8 | 0;
+ if ((HEAP32[i3 >> 2] | 0) <= 0) {
+ ___assert_fail(3056, 2944, 98, 3040);
+ }
+ i13 = i1 + 16 | 0;
+ HEAP32[i4 >> 2] = HEAP32[i13 >> 2];
+ HEAP32[i5 + (i6 * 36 | 0) + 32 >> 2] = -1;
+ HEAP32[i13 >> 2] = i6;
+ HEAP32[i3 >> 2] = (HEAP32[i3 >> 2] | 0) + -1;
+ STACKTOP = i2;
+ return;
+ }
+ i12 = i5 + (i7 * 36 | 0) + 24 | 0;
+ if ((HEAP32[i12 >> 2] | 0) == (i6 | 0)) {
+ HEAP32[i12 >> 2] = i13;
+ } else {
+ HEAP32[i5 + (i7 * 36 | 0) + 28 >> 2] = i13;
+ }
+ HEAP32[i5 + (i13 * 36 | 0) + 20 >> 2] = i7;
+ if (!((i6 | 0) > -1)) {
+ ___assert_fail(3e3, 2944, 97, 3040);
+ }
+ if ((HEAP32[i1 + 12 >> 2] | 0) <= (i6 | 0)) {
+ ___assert_fail(3e3, 2944, 97, 3040);
+ }
+ i12 = i1 + 8 | 0;
+ if ((HEAP32[i12 >> 2] | 0) <= 0) {
+ ___assert_fail(3056, 2944, 98, 3040);
+ }
+ i13 = i1 + 16 | 0;
+ HEAP32[i4 >> 2] = HEAP32[i13 >> 2];
+ HEAP32[i5 + (i6 * 36 | 0) + 32 >> 2] = -1;
+ HEAP32[i13 >> 2] = i6;
+ HEAP32[i12 >> 2] = (HEAP32[i12 >> 2] | 0) + -1;
+ do {
+ i4 = __ZN13b2DynamicTree7BalanceEi(i1, i7) | 0;
+ i7 = HEAP32[i3 >> 2] | 0;
+ i6 = HEAP32[i7 + (i4 * 36 | 0) + 24 >> 2] | 0;
+ i5 = HEAP32[i7 + (i4 * 36 | 0) + 28 >> 2] | 0;
+ d10 = +HEAPF32[i7 + (i6 * 36 | 0) >> 2];
+ d11 = +HEAPF32[i7 + (i5 * 36 | 0) >> 2];
+ d9 = +HEAPF32[i7 + (i6 * 36 | 0) + 4 >> 2];
+ d8 = +HEAPF32[i7 + (i5 * 36 | 0) + 4 >> 2];
+ d10 = +(d10 < d11 ? d10 : d11);
+ d11 = +(d9 < d8 ? d9 : d8);
+ i13 = i7 + (i4 * 36 | 0) | 0;
+ HEAPF32[i13 >> 2] = d10;
+ HEAPF32[i13 + 4 >> 2] = d11;
+ d11 = +HEAPF32[i7 + (i6 * 36 | 0) + 8 >> 2];
+ d10 = +HEAPF32[i7 + (i5 * 36 | 0) + 8 >> 2];
+ d9 = +HEAPF32[i7 + (i6 * 36 | 0) + 12 >> 2];
+ d8 = +HEAPF32[i7 + (i5 * 36 | 0) + 12 >> 2];
+ d10 = +(d11 > d10 ? d11 : d10);
+ d11 = +(d9 > d8 ? d9 : d8);
+ i7 = i7 + (i4 * 36 | 0) + 8 | 0;
+ HEAPF32[i7 >> 2] = d10;
+ HEAPF32[i7 + 4 >> 2] = d11;
+ i7 = HEAP32[i3 >> 2] | 0;
+ i6 = HEAP32[i7 + (i6 * 36 | 0) + 32 >> 2] | 0;
+ i5 = HEAP32[i7 + (i5 * 36 | 0) + 32 >> 2] | 0;
+ HEAP32[i7 + (i4 * 36 | 0) + 32 >> 2] = ((i6 | 0) > (i5 | 0) ? i6 : i5) + 1;
+ i7 = HEAP32[i7 + (i4 * 36 | 0) + 20 >> 2] | 0;
+ } while (!((i7 | 0) == -1));
+ STACKTOP = i2;
+ return;
+}
+function __ZN9b2Simplex6Solve3Ev(i7) {
+ i7 = i7 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, d4 = 0.0, d5 = 0.0, d6 = 0.0, d8 = 0.0, d9 = 0.0, d10 = 0.0, d11 = 0.0, d12 = 0.0, d13 = 0.0, d14 = 0.0, d15 = 0.0, d16 = 0.0, d17 = 0.0, d18 = 0.0, d19 = 0.0, d20 = 0.0, d21 = 0.0, i22 = 0;
+ i1 = STACKTOP;
+ i2 = i7 + 16 | 0;
+ d17 = +HEAPF32[i2 >> 2];
+ d15 = +HEAPF32[i2 + 4 >> 2];
+ i2 = i7 + 36 | 0;
+ i3 = i7 + 52 | 0;
+ d14 = +HEAPF32[i3 >> 2];
+ d16 = +HEAPF32[i3 + 4 >> 2];
+ i3 = i7 + 72 | 0;
+ i22 = i7 + 88 | 0;
+ d18 = +HEAPF32[i22 >> 2];
+ d11 = +HEAPF32[i22 + 4 >> 2];
+ d20 = d14 - d17;
+ d10 = d16 - d15;
+ d9 = d17 * d20 + d15 * d10;
+ d8 = d14 * d20 + d16 * d10;
+ d4 = d18 - d17;
+ d19 = d11 - d15;
+ d6 = d17 * d4 + d15 * d19;
+ d5 = d18 * d4 + d11 * d19;
+ d21 = d18 - d14;
+ d12 = d11 - d16;
+ d13 = d14 * d21 + d16 * d12;
+ d12 = d18 * d21 + d11 * d12;
+ d4 = d20 * d19 - d10 * d4;
+ d10 = (d14 * d11 - d16 * d18) * d4;
+ d11 = (d15 * d18 - d17 * d11) * d4;
+ d4 = (d17 * d16 - d15 * d14) * d4;
+ if (!(!(d9 >= -0.0) | !(d6 >= -0.0))) {
+ HEAPF32[i7 + 24 >> 2] = 1.0;
+ HEAP32[i7 + 108 >> 2] = 1;
+ STACKTOP = i1;
+ return;
+ }
+ if (!(!(d9 < -0.0) | !(d8 > 0.0) | !(d4 <= 0.0))) {
+ d21 = 1.0 / (d8 - d9);
+ HEAPF32[i7 + 24 >> 2] = d8 * d21;
+ HEAPF32[i7 + 60 >> 2] = -(d9 * d21);
+ HEAP32[i7 + 108 >> 2] = 2;
+ STACKTOP = i1;
+ return;
+ }
+ if (!(!(d6 < -0.0) | !(d5 > 0.0) | !(d11 <= 0.0))) {
+ d21 = 1.0 / (d5 - d6);
+ HEAPF32[i7 + 24 >> 2] = d5 * d21;
+ HEAPF32[i7 + 96 >> 2] = -(d6 * d21);
+ HEAP32[i7 + 108 >> 2] = 2;
+ i7 = i2 + 0 | 0;
+ i3 = i3 + 0 | 0;
+ i2 = i7 + 36 | 0;
+ do {
+ HEAP32[i7 >> 2] = HEAP32[i3 >> 2];
+ i7 = i7 + 4 | 0;
+ i3 = i3 + 4 | 0;
+ } while ((i7 | 0) < (i2 | 0));
+ STACKTOP = i1;
+ return;
+ }
+ if (!(!(d8 <= 0.0) | !(d13 >= -0.0))) {
+ HEAPF32[i7 + 60 >> 2] = 1.0;
+ HEAP32[i7 + 108 >> 2] = 1;
+ i7 = i7 + 0 | 0;
+ i3 = i2 + 0 | 0;
+ i2 = i7 + 36 | 0;
+ do {
+ HEAP32[i7 >> 2] = HEAP32[i3 >> 2];
+ i7 = i7 + 4 | 0;
+ i3 = i3 + 4 | 0;
+ } while ((i7 | 0) < (i2 | 0));
+ STACKTOP = i1;
+ return;
+ }
+ if (!(!(d5 <= 0.0) | !(d12 <= 0.0))) {
+ HEAPF32[i7 + 96 >> 2] = 1.0;
+ HEAP32[i7 + 108 >> 2] = 1;
+ i7 = i7 + 0 | 0;
+ i3 = i3 + 0 | 0;
+ i2 = i7 + 36 | 0;
+ do {
+ HEAP32[i7 >> 2] = HEAP32[i3 >> 2];
+ i7 = i7 + 4 | 0;
+ i3 = i3 + 4 | 0;
+ } while ((i7 | 0) < (i2 | 0));
+ STACKTOP = i1;
+ return;
+ }
+ if (!(d13 < -0.0) | !(d12 > 0.0) | !(d10 <= 0.0)) {
+ d21 = 1.0 / (d4 + (d10 + d11));
+ HEAPF32[i7 + 24 >> 2] = d10 * d21;
+ HEAPF32[i7 + 60 >> 2] = d11 * d21;
+ HEAPF32[i7 + 96 >> 2] = d4 * d21;
+ HEAP32[i7 + 108 >> 2] = 3;
+ STACKTOP = i1;
+ return;
+ } else {
+ d21 = 1.0 / (d12 - d13);
+ HEAPF32[i7 + 60 >> 2] = d12 * d21;
+ HEAPF32[i7 + 96 >> 2] = -(d13 * d21);
+ HEAP32[i7 + 108 >> 2] = 2;
+ i7 = i7 + 0 | 0;
+ i3 = i3 + 0 | 0;
+ i2 = i7 + 36 | 0;
+ do {
+ HEAP32[i7 >> 2] = HEAP32[i3 >> 2];
+ i7 = i7 + 4 | 0;
+ i3 = i3 + 4 | 0;
+ } while ((i7 | 0) < (i2 | 0));
+ STACKTOP = i1;
+ return;
+ }
+}
+function __ZN16b2ContactManager7CollideEv(i3) {
+ i3 = i3 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0;
+ i2 = STACKTOP;
+ i8 = HEAP32[i3 + 60 >> 2] | 0;
+ if ((i8 | 0) == 0) {
+ STACKTOP = i2;
+ return;
+ }
+ i7 = i3 + 12 | 0;
+ i6 = i3 + 4 | 0;
+ i5 = i3 + 72 | 0;
+ i4 = i3 + 68 | 0;
+ L4 : while (1) {
+ i12 = HEAP32[i8 + 48 >> 2] | 0;
+ i10 = HEAP32[i8 + 52 >> 2] | 0;
+ i11 = HEAP32[i8 + 56 >> 2] | 0;
+ i9 = HEAP32[i8 + 60 >> 2] | 0;
+ i15 = HEAP32[i12 + 8 >> 2] | 0;
+ i13 = HEAP32[i10 + 8 >> 2] | 0;
+ i16 = i8 + 4 | 0;
+ do {
+ if ((HEAP32[i16 >> 2] & 8 | 0) == 0) {
+ i1 = 11;
+ } else {
+ if (!(__ZNK6b2Body13ShouldCollideEPKS_(i13, i15) | 0)) {
+ i16 = HEAP32[i8 + 12 >> 2] | 0;
+ __ZN16b2ContactManager7DestroyEP9b2Contact(i3, i8);
+ i8 = i16;
+ break;
+ }
+ i14 = HEAP32[i4 >> 2] | 0;
+ if ((i14 | 0) != 0 ? !(FUNCTION_TABLE_iiii[HEAP32[(HEAP32[i14 >> 2] | 0) + 8 >> 2] & 7](i14, i12, i10) | 0) : 0) {
+ i16 = HEAP32[i8 + 12 >> 2] | 0;
+ __ZN16b2ContactManager7DestroyEP9b2Contact(i3, i8);
+ i8 = i16;
+ break;
+ }
+ HEAP32[i16 >> 2] = HEAP32[i16 >> 2] & -9;
+ i1 = 11;
+ }
+ } while (0);
+ do {
+ if ((i1 | 0) == 11) {
+ i1 = 0;
+ if ((HEAP16[i15 + 4 >> 1] & 2) == 0) {
+ i14 = 0;
+ } else {
+ i14 = (HEAP32[i15 >> 2] | 0) != 0;
+ }
+ if ((HEAP16[i13 + 4 >> 1] & 2) == 0) {
+ i13 = 0;
+ } else {
+ i13 = (HEAP32[i13 >> 2] | 0) != 0;
+ }
+ if (!(i14 | i13)) {
+ i8 = HEAP32[i8 + 12 >> 2] | 0;
+ break;
+ }
+ i11 = HEAP32[(HEAP32[i12 + 24 >> 2] | 0) + (i11 * 28 | 0) + 24 >> 2] | 0;
+ i9 = HEAP32[(HEAP32[i10 + 24 >> 2] | 0) + (i9 * 28 | 0) + 24 >> 2] | 0;
+ if (!((i11 | 0) > -1)) {
+ i1 = 19;
+ break L4;
+ }
+ i10 = HEAP32[i7 >> 2] | 0;
+ if ((i10 | 0) <= (i11 | 0)) {
+ i1 = 19;
+ break L4;
+ }
+ i12 = HEAP32[i6 >> 2] | 0;
+ if (!((i9 | 0) > -1 & (i10 | 0) > (i9 | 0))) {
+ i1 = 21;
+ break L4;
+ }
+ if (+HEAPF32[i12 + (i9 * 36 | 0) >> 2] - +HEAPF32[i12 + (i11 * 36 | 0) + 8 >> 2] > 0.0 | +HEAPF32[i12 + (i9 * 36 | 0) + 4 >> 2] - +HEAPF32[i12 + (i11 * 36 | 0) + 12 >> 2] > 0.0 | +HEAPF32[i12 + (i11 * 36 | 0) >> 2] - +HEAPF32[i12 + (i9 * 36 | 0) + 8 >> 2] > 0.0 | +HEAPF32[i12 + (i11 * 36 | 0) + 4 >> 2] - +HEAPF32[i12 + (i9 * 36 | 0) + 12 >> 2] > 0.0) {
+ i16 = HEAP32[i8 + 12 >> 2] | 0;
+ __ZN16b2ContactManager7DestroyEP9b2Contact(i3, i8);
+ i8 = i16;
+ break;
+ } else {
+ __ZN9b2Contact6UpdateEP17b2ContactListener(i8, HEAP32[i5 >> 2] | 0);
+ i8 = HEAP32[i8 + 12 >> 2] | 0;
+ break;
+ }
+ }
+ } while (0);
+ if ((i8 | 0) == 0) {
+ i1 = 25;
+ break;
+ }
+ }
+ if ((i1 | 0) == 19) {
+ ___assert_fail(1904, 1952, 159, 2008);
+ } else if ((i1 | 0) == 21) {
+ ___assert_fail(1904, 1952, 159, 2008);
+ } else if ((i1 | 0) == 25) {
+ STACKTOP = i2;
+ return;
+ }
+}
+function __ZN16b2ContactManager7AddPairEPvS0_(i1, i5, i6) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ i6 = i6 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0;
+ i2 = STACKTOP;
+ i4 = HEAP32[i5 + 16 >> 2] | 0;
+ i3 = HEAP32[i6 + 16 >> 2] | 0;
+ i5 = HEAP32[i5 + 20 >> 2] | 0;
+ i6 = HEAP32[i6 + 20 >> 2] | 0;
+ i8 = HEAP32[i4 + 8 >> 2] | 0;
+ i7 = HEAP32[i3 + 8 >> 2] | 0;
+ if ((i8 | 0) == (i7 | 0)) {
+ STACKTOP = i2;
+ return;
+ }
+ i10 = HEAP32[i7 + 112 >> 2] | 0;
+ L4 : do {
+ if ((i10 | 0) != 0) {
+ while (1) {
+ if ((HEAP32[i10 >> 2] | 0) == (i8 | 0)) {
+ i9 = HEAP32[i10 + 4 >> 2] | 0;
+ i12 = HEAP32[i9 + 48 >> 2] | 0;
+ i13 = HEAP32[i9 + 52 >> 2] | 0;
+ i11 = HEAP32[i9 + 56 >> 2] | 0;
+ i9 = HEAP32[i9 + 60 >> 2] | 0;
+ if ((i12 | 0) == (i4 | 0) & (i13 | 0) == (i3 | 0) & (i11 | 0) == (i5 | 0) & (i9 | 0) == (i6 | 0)) {
+ i9 = 22;
+ break;
+ }
+ if ((i12 | 0) == (i3 | 0) & (i13 | 0) == (i4 | 0) & (i11 | 0) == (i6 | 0) & (i9 | 0) == (i5 | 0)) {
+ i9 = 22;
+ break;
+ }
+ }
+ i10 = HEAP32[i10 + 12 >> 2] | 0;
+ if ((i10 | 0) == 0) {
+ break L4;
+ }
+ }
+ if ((i9 | 0) == 22) {
+ STACKTOP = i2;
+ return;
+ }
+ }
+ } while (0);
+ if (!(__ZNK6b2Body13ShouldCollideEPKS_(i7, i8) | 0)) {
+ STACKTOP = i2;
+ return;
+ }
+ i7 = HEAP32[i1 + 68 >> 2] | 0;
+ if ((i7 | 0) != 0 ? !(FUNCTION_TABLE_iiii[HEAP32[(HEAP32[i7 >> 2] | 0) + 8 >> 2] & 7](i7, i4, i3) | 0) : 0) {
+ STACKTOP = i2;
+ return;
+ }
+ i5 = __ZN9b2Contact6CreateEP9b2FixtureiS1_iP16b2BlockAllocator(i4, i5, i3, i6, HEAP32[i1 + 76 >> 2] | 0) | 0;
+ if ((i5 | 0) == 0) {
+ STACKTOP = i2;
+ return;
+ }
+ i4 = HEAP32[(HEAP32[i5 + 48 >> 2] | 0) + 8 >> 2] | 0;
+ i3 = HEAP32[(HEAP32[i5 + 52 >> 2] | 0) + 8 >> 2] | 0;
+ HEAP32[i5 + 8 >> 2] = 0;
+ i7 = i1 + 60 | 0;
+ HEAP32[i5 + 12 >> 2] = HEAP32[i7 >> 2];
+ i6 = HEAP32[i7 >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ HEAP32[i6 + 8 >> 2] = i5;
+ }
+ HEAP32[i7 >> 2] = i5;
+ i8 = i5 + 16 | 0;
+ HEAP32[i5 + 20 >> 2] = i5;
+ HEAP32[i8 >> 2] = i3;
+ HEAP32[i5 + 24 >> 2] = 0;
+ i6 = i4 + 112 | 0;
+ HEAP32[i5 + 28 >> 2] = HEAP32[i6 >> 2];
+ i7 = HEAP32[i6 >> 2] | 0;
+ if ((i7 | 0) != 0) {
+ HEAP32[i7 + 8 >> 2] = i8;
+ }
+ HEAP32[i6 >> 2] = i8;
+ i6 = i5 + 32 | 0;
+ HEAP32[i5 + 36 >> 2] = i5;
+ HEAP32[i6 >> 2] = i4;
+ HEAP32[i5 + 40 >> 2] = 0;
+ i7 = i3 + 112 | 0;
+ HEAP32[i5 + 44 >> 2] = HEAP32[i7 >> 2];
+ i5 = HEAP32[i7 >> 2] | 0;
+ if ((i5 | 0) != 0) {
+ HEAP32[i5 + 8 >> 2] = i6;
+ }
+ HEAP32[i7 >> 2] = i6;
+ i5 = i4 + 4 | 0;
+ i6 = HEAPU16[i5 >> 1] | 0;
+ if ((i6 & 2 | 0) == 0) {
+ HEAP16[i5 >> 1] = i6 | 2;
+ HEAPF32[i4 + 144 >> 2] = 0.0;
+ }
+ i4 = i3 + 4 | 0;
+ i5 = HEAPU16[i4 >> 1] | 0;
+ if ((i5 & 2 | 0) == 0) {
+ HEAP16[i4 >> 1] = i5 | 2;
+ HEAPF32[i3 + 144 >> 2] = 0.0;
+ }
+ i13 = i1 + 64 | 0;
+ HEAP32[i13 >> 2] = (HEAP32[i13 >> 2] | 0) + 1;
+ STACKTOP = i2;
+ return;
+}
+function __ZN12b2BroadPhase11UpdatePairsI16b2ContactManagerEEvPT_(i5, i2) {
+ i5 = i5 | 0;
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i6 = i3;
+ i1 = i5 + 52 | 0;
+ HEAP32[i1 >> 2] = 0;
+ i4 = i5 + 40 | 0;
+ i12 = HEAP32[i4 >> 2] | 0;
+ do {
+ if ((i12 | 0) > 0) {
+ i9 = i5 + 32 | 0;
+ i11 = i5 + 56 | 0;
+ i8 = i5 + 12 | 0;
+ i10 = i5 + 4 | 0;
+ i13 = 0;
+ while (1) {
+ i14 = HEAP32[(HEAP32[i9 >> 2] | 0) + (i13 << 2) >> 2] | 0;
+ HEAP32[i11 >> 2] = i14;
+ if (!((i14 | 0) == -1)) {
+ if (!((i14 | 0) > -1)) {
+ i8 = 6;
+ break;
+ }
+ if ((HEAP32[i8 >> 2] | 0) <= (i14 | 0)) {
+ i8 = 6;
+ break;
+ }
+ __ZNK13b2DynamicTree5QueryI12b2BroadPhaseEEvPT_RK6b2AABB(i5, i5, (HEAP32[i10 >> 2] | 0) + (i14 * 36 | 0) | 0);
+ i12 = HEAP32[i4 >> 2] | 0;
+ }
+ i13 = i13 + 1 | 0;
+ if ((i13 | 0) >= (i12 | 0)) {
+ i8 = 9;
+ break;
+ }
+ }
+ if ((i8 | 0) == 6) {
+ ___assert_fail(1904, 1952, 159, 2008);
+ } else if ((i8 | 0) == 9) {
+ i7 = HEAP32[i1 >> 2] | 0;
+ break;
+ }
+ } else {
+ i7 = 0;
+ }
+ } while (0);
+ HEAP32[i4 >> 2] = 0;
+ i4 = i5 + 44 | 0;
+ i14 = HEAP32[i4 >> 2] | 0;
+ HEAP32[i6 >> 2] = 3;
+ __ZNSt3__16__sortIRPFbRK6b2PairS3_EPS1_EEvT0_S8_T_(i14, i14 + (i7 * 12 | 0) | 0, i6);
+ if ((HEAP32[i1 >> 2] | 0) <= 0) {
+ STACKTOP = i3;
+ return;
+ }
+ i6 = i5 + 12 | 0;
+ i7 = i5 + 4 | 0;
+ i9 = 0;
+ L18 : while (1) {
+ i8 = HEAP32[i4 >> 2] | 0;
+ i5 = i8 + (i9 * 12 | 0) | 0;
+ i10 = HEAP32[i5 >> 2] | 0;
+ if (!((i10 | 0) > -1)) {
+ i8 = 14;
+ break;
+ }
+ i12 = HEAP32[i6 >> 2] | 0;
+ if ((i12 | 0) <= (i10 | 0)) {
+ i8 = 14;
+ break;
+ }
+ i11 = HEAP32[i7 >> 2] | 0;
+ i8 = i8 + (i9 * 12 | 0) + 4 | 0;
+ i13 = HEAP32[i8 >> 2] | 0;
+ if (!((i13 | 0) > -1 & (i12 | 0) > (i13 | 0))) {
+ i8 = 16;
+ break;
+ }
+ __ZN16b2ContactManager7AddPairEPvS0_(i2, HEAP32[i11 + (i10 * 36 | 0) + 16 >> 2] | 0, HEAP32[i11 + (i13 * 36 | 0) + 16 >> 2] | 0);
+ i10 = HEAP32[i1 >> 2] | 0;
+ while (1) {
+ i9 = i9 + 1 | 0;
+ if ((i9 | 0) >= (i10 | 0)) {
+ i8 = 21;
+ break L18;
+ }
+ i11 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP32[i11 + (i9 * 12 | 0) >> 2] | 0) != (HEAP32[i5 >> 2] | 0)) {
+ continue L18;
+ }
+ if ((HEAP32[i11 + (i9 * 12 | 0) + 4 >> 2] | 0) != (HEAP32[i8 >> 2] | 0)) {
+ continue L18;
+ }
+ }
+ }
+ if ((i8 | 0) == 14) {
+ ___assert_fail(1904, 1952, 153, 1992);
+ } else if ((i8 | 0) == 16) {
+ ___assert_fail(1904, 1952, 153, 1992);
+ } else if ((i8 | 0) == 21) {
+ STACKTOP = i3;
+ return;
+ }
+}
+function __ZNK13b2DynamicTree5QueryI12b2BroadPhaseEEvPT_RK6b2AABB(i9, i4, i7) {
+ i9 = i9 | 0;
+ i4 = i4 | 0;
+ i7 = i7 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i5 = 0, i6 = 0, i8 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 1040 | 0;
+ i3 = i2;
+ i1 = i3 + 4 | 0;
+ HEAP32[i3 >> 2] = i1;
+ i5 = i3 + 1028 | 0;
+ HEAP32[i5 >> 2] = 0;
+ i6 = i3 + 1032 | 0;
+ HEAP32[i6 >> 2] = 256;
+ i14 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i14 + (HEAP32[i5 >> 2] << 2) >> 2] = HEAP32[i9 >> 2];
+ i15 = HEAP32[i5 >> 2] | 0;
+ i16 = i15 + 1 | 0;
+ HEAP32[i5 >> 2] = i16;
+ L1 : do {
+ if ((i15 | 0) > -1) {
+ i9 = i9 + 4 | 0;
+ i11 = i7 + 4 | 0;
+ i12 = i7 + 8 | 0;
+ i10 = i7 + 12 | 0;
+ while (1) {
+ i16 = i16 + -1 | 0;
+ HEAP32[i5 >> 2] = i16;
+ i13 = HEAP32[i14 + (i16 << 2) >> 2] | 0;
+ do {
+ if (!((i13 | 0) == -1) ? (i8 = HEAP32[i9 >> 2] | 0, !(+HEAPF32[i7 >> 2] - +HEAPF32[i8 + (i13 * 36 | 0) + 8 >> 2] > 0.0 | +HEAPF32[i11 >> 2] - +HEAPF32[i8 + (i13 * 36 | 0) + 12 >> 2] > 0.0 | +HEAPF32[i8 + (i13 * 36 | 0) >> 2] - +HEAPF32[i12 >> 2] > 0.0 | +HEAPF32[i8 + (i13 * 36 | 0) + 4 >> 2] - +HEAPF32[i10 >> 2] > 0.0)) : 0) {
+ i15 = i8 + (i13 * 36 | 0) + 24 | 0;
+ if ((HEAP32[i15 >> 2] | 0) == -1) {
+ if (!(__ZN12b2BroadPhase13QueryCallbackEi(i4, i13) | 0)) {
+ break L1;
+ }
+ i16 = HEAP32[i5 >> 2] | 0;
+ break;
+ }
+ if ((i16 | 0) == (HEAP32[i6 >> 2] | 0) ? (HEAP32[i6 >> 2] = i16 << 1, i16 = __Z7b2Alloci(i16 << 3) | 0, HEAP32[i3 >> 2] = i16, _memcpy(i16 | 0, i14 | 0, HEAP32[i5 >> 2] << 2 | 0) | 0, (i14 | 0) != (i1 | 0)) : 0) {
+ __Z6b2FreePv(i14);
+ }
+ i14 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i14 + (HEAP32[i5 >> 2] << 2) >> 2] = HEAP32[i15 >> 2];
+ i15 = (HEAP32[i5 >> 2] | 0) + 1 | 0;
+ HEAP32[i5 >> 2] = i15;
+ i13 = i8 + (i13 * 36 | 0) + 28 | 0;
+ if ((i15 | 0) == (HEAP32[i6 >> 2] | 0) ? (HEAP32[i6 >> 2] = i15 << 1, i16 = __Z7b2Alloci(i15 << 3) | 0, HEAP32[i3 >> 2] = i16, _memcpy(i16 | 0, i14 | 0, HEAP32[i5 >> 2] << 2 | 0) | 0, (i14 | 0) != (i1 | 0)) : 0) {
+ __Z6b2FreePv(i14);
+ }
+ HEAP32[(HEAP32[i3 >> 2] | 0) + (HEAP32[i5 >> 2] << 2) >> 2] = HEAP32[i13 >> 2];
+ i16 = (HEAP32[i5 >> 2] | 0) + 1 | 0;
+ HEAP32[i5 >> 2] = i16;
+ }
+ } while (0);
+ if ((i16 | 0) <= 0) {
+ break L1;
+ }
+ i14 = HEAP32[i3 >> 2] | 0;
+ }
+ }
+ } while (0);
+ i4 = HEAP32[i3 >> 2] | 0;
+ if ((i4 | 0) == (i1 | 0)) {
+ STACKTOP = i2;
+ return;
+ }
+ __Z6b2FreePv(i4);
+ HEAP32[i3 >> 2] = 0;
+ STACKTOP = i2;
+ return;
+}
+function __ZN15b2ContactSolver9WarmStartEv(i4) {
+ i4 = i4 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, d10 = 0.0, d11 = 0.0, d12 = 0.0, i13 = 0, d14 = 0.0, d15 = 0.0, d16 = 0.0, d17 = 0.0, d18 = 0.0, d19 = 0.0, d20 = 0.0, d21 = 0.0, i22 = 0, d23 = 0.0, i24 = 0, d25 = 0.0, d26 = 0.0, d27 = 0.0;
+ i1 = STACKTOP;
+ i2 = i4 + 48 | 0;
+ if ((HEAP32[i2 >> 2] | 0) <= 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i3 = i4 + 40 | 0;
+ i5 = i4 + 28 | 0;
+ i22 = HEAP32[i5 >> 2] | 0;
+ i8 = 0;
+ do {
+ i9 = HEAP32[i3 >> 2] | 0;
+ i7 = HEAP32[i9 + (i8 * 152 | 0) + 112 >> 2] | 0;
+ i6 = HEAP32[i9 + (i8 * 152 | 0) + 116 >> 2] | 0;
+ d10 = +HEAPF32[i9 + (i8 * 152 | 0) + 120 >> 2];
+ d14 = +HEAPF32[i9 + (i8 * 152 | 0) + 128 >> 2];
+ d12 = +HEAPF32[i9 + (i8 * 152 | 0) + 124 >> 2];
+ d11 = +HEAPF32[i9 + (i8 * 152 | 0) + 132 >> 2];
+ i13 = HEAP32[i9 + (i8 * 152 | 0) + 144 >> 2] | 0;
+ i4 = i22 + (i7 * 12 | 0) | 0;
+ i24 = i4;
+ d17 = +HEAPF32[i24 >> 2];
+ d19 = +HEAPF32[i24 + 4 >> 2];
+ d20 = +HEAPF32[i22 + (i7 * 12 | 0) + 8 >> 2];
+ i24 = i22 + (i6 * 12 | 0) | 0;
+ d21 = +HEAPF32[i24 >> 2];
+ d23 = +HEAPF32[i24 + 4 >> 2];
+ d18 = +HEAPF32[i22 + (i6 * 12 | 0) + 8 >> 2];
+ i22 = i9 + (i8 * 152 | 0) + 72 | 0;
+ d15 = +HEAPF32[i22 >> 2];
+ d16 = +HEAPF32[i22 + 4 >> 2];
+ if ((i13 | 0) > 0) {
+ i22 = 0;
+ do {
+ d27 = +HEAPF32[i9 + (i8 * 152 | 0) + (i22 * 36 | 0) + 16 >> 2];
+ d25 = +HEAPF32[i9 + (i8 * 152 | 0) + (i22 * 36 | 0) + 20 >> 2];
+ d26 = d15 * d27 + d16 * d25;
+ d25 = d16 * d27 - d15 * d25;
+ d20 = d20 - d14 * (+HEAPF32[i9 + (i8 * 152 | 0) + (i22 * 36 | 0) >> 2] * d25 - +HEAPF32[i9 + (i8 * 152 | 0) + (i22 * 36 | 0) + 4 >> 2] * d26);
+ d17 = d17 - d10 * d26;
+ d19 = d19 - d10 * d25;
+ d18 = d18 + d11 * (d25 * +HEAPF32[i9 + (i8 * 152 | 0) + (i22 * 36 | 0) + 8 >> 2] - d26 * +HEAPF32[i9 + (i8 * 152 | 0) + (i22 * 36 | 0) + 12 >> 2]);
+ d21 = d21 + d12 * d26;
+ d23 = d23 + d12 * d25;
+ i22 = i22 + 1 | 0;
+ } while ((i22 | 0) != (i13 | 0));
+ }
+ d27 = +d17;
+ d26 = +d19;
+ i22 = i4;
+ HEAPF32[i22 >> 2] = d27;
+ HEAPF32[i22 + 4 >> 2] = d26;
+ i22 = HEAP32[i5 >> 2] | 0;
+ HEAPF32[i22 + (i7 * 12 | 0) + 8 >> 2] = d20;
+ d26 = +d21;
+ d27 = +d23;
+ i22 = i22 + (i6 * 12 | 0) | 0;
+ HEAPF32[i22 >> 2] = d26;
+ HEAPF32[i22 + 4 >> 2] = d27;
+ i22 = HEAP32[i5 >> 2] | 0;
+ HEAPF32[i22 + (i6 * 12 | 0) + 8 >> 2] = d18;
+ i8 = i8 + 1 | 0;
+ } while ((i8 | 0) < (HEAP32[i2 >> 2] | 0));
+ STACKTOP = i1;
+ return;
+}
+function __ZNK14b2PolygonShape7RayCastEP15b2RayCastOutputRK14b2RayCastInputRK11b2Transformi(i1, i5, i8, i7, i4) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ i8 = i8 | 0;
+ i7 = i7 | 0;
+ i4 = i4 | 0;
+ var i2 = 0, d3 = 0.0, i6 = 0, d9 = 0.0, d10 = 0.0, d11 = 0.0, d12 = 0.0, d13 = 0.0, i14 = 0, i15 = 0, i16 = 0, d17 = 0.0, d18 = 0.0, d19 = 0.0, d20 = 0.0;
+ i4 = STACKTOP;
+ d10 = +HEAPF32[i7 >> 2];
+ d9 = +HEAPF32[i8 >> 2] - d10;
+ d18 = +HEAPF32[i7 + 4 >> 2];
+ d11 = +HEAPF32[i8 + 4 >> 2] - d18;
+ i6 = i7 + 12 | 0;
+ d17 = +HEAPF32[i6 >> 2];
+ i7 = i7 + 8 | 0;
+ d19 = +HEAPF32[i7 >> 2];
+ d12 = d9 * d17 + d11 * d19;
+ d9 = d17 * d11 - d9 * d19;
+ d10 = +HEAPF32[i8 + 8 >> 2] - d10;
+ d18 = +HEAPF32[i8 + 12 >> 2] - d18;
+ d11 = d17 * d10 + d19 * d18 - d12;
+ d10 = d17 * d18 - d19 * d10 - d9;
+ i8 = i8 + 16 | 0;
+ i14 = HEAP32[i1 + 148 >> 2] | 0;
+ do {
+ if ((i14 | 0) > 0) {
+ i16 = 0;
+ i15 = -1;
+ d13 = 0.0;
+ d17 = +HEAPF32[i8 >> 2];
+ L3 : while (1) {
+ d20 = +HEAPF32[i1 + (i16 << 3) + 84 >> 2];
+ d19 = +HEAPF32[i1 + (i16 << 3) + 88 >> 2];
+ d18 = (+HEAPF32[i1 + (i16 << 3) + 20 >> 2] - d12) * d20 + (+HEAPF32[i1 + (i16 << 3) + 24 >> 2] - d9) * d19;
+ d19 = d11 * d20 + d10 * d19;
+ do {
+ if (d19 == 0.0) {
+ if (d18 < 0.0) {
+ i1 = 0;
+ i14 = 18;
+ break L3;
+ }
+ } else {
+ if (d19 < 0.0 ? d18 < d13 * d19 : 0) {
+ i15 = i16;
+ d13 = d18 / d19;
+ break;
+ }
+ if (d19 > 0.0 ? d18 < d17 * d19 : 0) {
+ d17 = d18 / d19;
+ }
+ }
+ } while (0);
+ i16 = i16 + 1 | 0;
+ if (d17 < d13) {
+ i1 = 0;
+ i14 = 18;
+ break;
+ }
+ if ((i16 | 0) >= (i14 | 0)) {
+ i14 = 13;
+ break;
+ }
+ }
+ if ((i14 | 0) == 13) {
+ if (d13 >= 0.0) {
+ i2 = i15;
+ d3 = d13;
+ break;
+ }
+ ___assert_fail(376, 328, 249, 424);
+ } else if ((i14 | 0) == 18) {
+ STACKTOP = i4;
+ return i1 | 0;
+ }
+ } else {
+ i2 = -1;
+ d3 = 0.0;
+ }
+ } while (0);
+ if (!(d3 <= +HEAPF32[i8 >> 2])) {
+ ___assert_fail(376, 328, 249, 424);
+ }
+ if (!((i2 | 0) > -1)) {
+ i16 = 0;
+ STACKTOP = i4;
+ return i16 | 0;
+ }
+ HEAPF32[i5 + 8 >> 2] = d3;
+ d18 = +HEAPF32[i6 >> 2];
+ d13 = +HEAPF32[i1 + (i2 << 3) + 84 >> 2];
+ d17 = +HEAPF32[i7 >> 2];
+ d20 = +HEAPF32[i1 + (i2 << 3) + 88 >> 2];
+ d19 = +(d18 * d13 - d17 * d20);
+ d20 = +(d13 * d17 + d18 * d20);
+ i16 = i5;
+ HEAPF32[i16 >> 2] = d19;
+ HEAPF32[i16 + 4 >> 2] = d20;
+ i16 = 1;
+ STACKTOP = i4;
+ return i16 | 0;
+}
+function __ZN7b2World4StepEfii(i1, d9, i11, i12) {
+ i1 = i1 | 0;
+ d9 = +d9;
+ i11 = i11 | 0;
+ i12 = i12 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i10 = 0, i13 = 0;
+ i4 = STACKTOP;
+ STACKTOP = STACKTOP + 32 | 0;
+ i3 = i4 + 27 | 0;
+ i5 = i4;
+ i8 = i4 + 26 | 0;
+ i10 = i4 + 25 | 0;
+ i7 = i4 + 24 | 0;
+ __ZN7b2TimerC2Ev(i3);
+ i2 = i1 + 102868 | 0;
+ i13 = HEAP32[i2 >> 2] | 0;
+ if ((i13 & 1 | 0) != 0) {
+ __ZN16b2ContactManager15FindNewContactsEv(i1 + 102872 | 0);
+ i13 = HEAP32[i2 >> 2] & -2;
+ HEAP32[i2 >> 2] = i13;
+ }
+ HEAP32[i2 >> 2] = i13 | 2;
+ HEAPF32[i5 >> 2] = d9;
+ HEAP32[i5 + 12 >> 2] = i11;
+ HEAP32[i5 + 16 >> 2] = i12;
+ if (d9 > 0.0) {
+ HEAPF32[i5 + 4 >> 2] = 1.0 / d9;
+ } else {
+ HEAPF32[i5 + 4 >> 2] = 0.0;
+ }
+ i11 = i1 + 102988 | 0;
+ HEAPF32[i5 + 8 >> 2] = +HEAPF32[i11 >> 2] * d9;
+ HEAP8[i5 + 20 | 0] = HEAP8[i1 + 102992 | 0] | 0;
+ __ZN7b2TimerC2Ev(i8);
+ __ZN16b2ContactManager7CollideEv(i1 + 102872 | 0);
+ HEAPF32[i1 + 103e3 >> 2] = +__ZNK7b2Timer15GetMillisecondsEv(i8);
+ if ((HEAP8[i1 + 102995 | 0] | 0) != 0 ? +HEAPF32[i5 >> 2] > 0.0 : 0) {
+ __ZN7b2TimerC2Ev(i10);
+ __ZN7b2World5SolveERK10b2TimeStep(i1, i5);
+ HEAPF32[i1 + 103004 >> 2] = +__ZNK7b2Timer15GetMillisecondsEv(i10);
+ }
+ if ((HEAP8[i1 + 102993 | 0] | 0) != 0) {
+ d9 = +HEAPF32[i5 >> 2];
+ if (d9 > 0.0) {
+ __ZN7b2TimerC2Ev(i7);
+ __ZN7b2World8SolveTOIERK10b2TimeStep(i1, i5);
+ HEAPF32[i1 + 103024 >> 2] = +__ZNK7b2Timer15GetMillisecondsEv(i7);
+ i6 = 12;
+ }
+ } else {
+ i6 = 12;
+ }
+ if ((i6 | 0) == 12) {
+ d9 = +HEAPF32[i5 >> 2];
+ }
+ if (d9 > 0.0) {
+ HEAPF32[i11 >> 2] = +HEAPF32[i5 + 4 >> 2];
+ }
+ i5 = HEAP32[i2 >> 2] | 0;
+ if ((i5 & 4 | 0) == 0) {
+ i13 = i5 & -3;
+ HEAP32[i2 >> 2] = i13;
+ d9 = +__ZNK7b2Timer15GetMillisecondsEv(i3);
+ i13 = i1 + 102996 | 0;
+ HEAPF32[i13 >> 2] = d9;
+ STACKTOP = i4;
+ return;
+ }
+ i6 = HEAP32[i1 + 102952 >> 2] | 0;
+ if ((i6 | 0) == 0) {
+ i13 = i5 & -3;
+ HEAP32[i2 >> 2] = i13;
+ d9 = +__ZNK7b2Timer15GetMillisecondsEv(i3);
+ i13 = i1 + 102996 | 0;
+ HEAPF32[i13 >> 2] = d9;
+ STACKTOP = i4;
+ return;
+ }
+ do {
+ HEAPF32[i6 + 76 >> 2] = 0.0;
+ HEAPF32[i6 + 80 >> 2] = 0.0;
+ HEAPF32[i6 + 84 >> 2] = 0.0;
+ i6 = HEAP32[i6 + 96 >> 2] | 0;
+ } while ((i6 | 0) != 0);
+ i13 = i5 & -3;
+ HEAP32[i2 >> 2] = i13;
+ d9 = +__ZNK7b2Timer15GetMillisecondsEv(i3);
+ i13 = i1 + 102996 | 0;
+ HEAPF32[i13 >> 2] = d9;
+ STACKTOP = i4;
+ return;
+}
+function __ZL19b2FindMaxSeparationPiPK14b2PolygonShapeRK11b2TransformS2_S5_(i1, i5, i6, i3, i4) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ i6 = i6 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ var i2 = 0, i7 = 0, d8 = 0.0, d9 = 0.0, d10 = 0.0, d11 = 0.0, i12 = 0, i13 = 0, i14 = 0, d15 = 0.0, d16 = 0.0, d17 = 0.0, d18 = 0.0, d19 = 0.0;
+ i2 = STACKTOP;
+ i7 = HEAP32[i5 + 148 >> 2] | 0;
+ d17 = +HEAPF32[i4 + 12 >> 2];
+ d19 = +HEAPF32[i3 + 12 >> 2];
+ d18 = +HEAPF32[i4 + 8 >> 2];
+ d16 = +HEAPF32[i3 + 16 >> 2];
+ d15 = +HEAPF32[i6 + 12 >> 2];
+ d10 = +HEAPF32[i5 + 12 >> 2];
+ d8 = +HEAPF32[i6 + 8 >> 2];
+ d9 = +HEAPF32[i5 + 16 >> 2];
+ d11 = +HEAPF32[i4 >> 2] + (d17 * d19 - d18 * d16) - (+HEAPF32[i6 >> 2] + (d15 * d10 - d8 * d9));
+ d9 = d19 * d18 + d17 * d16 + +HEAPF32[i4 + 4 >> 2] - (d10 * d8 + d15 * d9 + +HEAPF32[i6 + 4 >> 2]);
+ d10 = d15 * d11 + d8 * d9;
+ d8 = d15 * d9 - d11 * d8;
+ if ((i7 | 0) > 0) {
+ i14 = 0;
+ i13 = 0;
+ d9 = -3.4028234663852886e+38;
+ while (1) {
+ d11 = d10 * +HEAPF32[i5 + (i13 << 3) + 84 >> 2] + d8 * +HEAPF32[i5 + (i13 << 3) + 88 >> 2];
+ i12 = d11 > d9;
+ i14 = i12 ? i13 : i14;
+ i13 = i13 + 1 | 0;
+ if ((i13 | 0) == (i7 | 0)) {
+ break;
+ } else {
+ d9 = i12 ? d11 : d9;
+ }
+ }
+ } else {
+ i14 = 0;
+ }
+ d9 = +__ZL16b2EdgeSeparationPK14b2PolygonShapeRK11b2TransformiS1_S4_(i5, i6, i14, i3, i4);
+ i12 = ((i14 | 0) > 0 ? i14 : i7) + -1 | 0;
+ d8 = +__ZL16b2EdgeSeparationPK14b2PolygonShapeRK11b2TransformiS1_S4_(i5, i6, i12, i3, i4);
+ i13 = i14 + 1 | 0;
+ i13 = (i13 | 0) < (i7 | 0) ? i13 : 0;
+ d10 = +__ZL16b2EdgeSeparationPK14b2PolygonShapeRK11b2TransformiS1_S4_(i5, i6, i13, i3, i4);
+ if (d8 > d9 & d8 > d10) {
+ while (1) {
+ i13 = ((i12 | 0) > 0 ? i12 : i7) + -1 | 0;
+ d9 = +__ZL16b2EdgeSeparationPK14b2PolygonShapeRK11b2TransformiS1_S4_(i5, i6, i13, i3, i4);
+ if (d9 > d8) {
+ i12 = i13;
+ d8 = d9;
+ } else {
+ break;
+ }
+ }
+ HEAP32[i1 >> 2] = i12;
+ STACKTOP = i2;
+ return +d8;
+ }
+ if (d10 > d9) {
+ i12 = i13;
+ d8 = d10;
+ } else {
+ d19 = d9;
+ HEAP32[i1 >> 2] = i14;
+ STACKTOP = i2;
+ return +d19;
+ }
+ while (1) {
+ i13 = i12 + 1 | 0;
+ i13 = (i13 | 0) < (i7 | 0) ? i13 : 0;
+ d9 = +__ZL16b2EdgeSeparationPK14b2PolygonShapeRK11b2TransformiS1_S4_(i5, i6, i13, i3, i4);
+ if (d9 > d8) {
+ i12 = i13;
+ d8 = d9;
+ } else {
+ break;
+ }
+ }
+ HEAP32[i1 >> 2] = i12;
+ STACKTOP = i2;
+ return +d8;
+}
+function __ZN9b2Fixture11SynchronizeEP12b2BroadPhaseRK11b2TransformS4_(i10, i8, i7, i2) {
+ i10 = i10 | 0;
+ i8 = i8 | 0;
+ i7 = i7 | 0;
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i9 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, d23 = 0.0, d24 = 0.0, d25 = 0.0, d26 = 0.0, i27 = 0;
+ i9 = STACKTOP;
+ STACKTOP = STACKTOP + 48 | 0;
+ i5 = i9 + 24 | 0;
+ i6 = i9 + 8 | 0;
+ i3 = i9;
+ i4 = i10 + 28 | 0;
+ if ((HEAP32[i4 >> 2] | 0) <= 0) {
+ STACKTOP = i9;
+ return;
+ }
+ i1 = i10 + 24 | 0;
+ i18 = i10 + 12 | 0;
+ i19 = i5 + 4 | 0;
+ i20 = i6 + 4 | 0;
+ i13 = i5 + 8 | 0;
+ i14 = i6 + 8 | 0;
+ i15 = i5 + 12 | 0;
+ i16 = i6 + 12 | 0;
+ i11 = i2 + 4 | 0;
+ i22 = i7 + 4 | 0;
+ i12 = i3 + 4 | 0;
+ i21 = 0;
+ do {
+ i10 = HEAP32[i1 >> 2] | 0;
+ i27 = HEAP32[i18 >> 2] | 0;
+ i17 = i10 + (i21 * 28 | 0) + 20 | 0;
+ FUNCTION_TABLE_viiii[HEAP32[(HEAP32[i27 >> 2] | 0) + 24 >> 2] & 15](i27, i5, i7, HEAP32[i17 >> 2] | 0);
+ i27 = HEAP32[i18 >> 2] | 0;
+ FUNCTION_TABLE_viiii[HEAP32[(HEAP32[i27 >> 2] | 0) + 24 >> 2] & 15](i27, i6, i2, HEAP32[i17 >> 2] | 0);
+ i17 = i10 + (i21 * 28 | 0) | 0;
+ d25 = +HEAPF32[i5 >> 2];
+ d26 = +HEAPF32[i6 >> 2];
+ d24 = +HEAPF32[i19 >> 2];
+ d23 = +HEAPF32[i20 >> 2];
+ d25 = +(d25 < d26 ? d25 : d26);
+ d26 = +(d24 < d23 ? d24 : d23);
+ i27 = i17;
+ HEAPF32[i27 >> 2] = d25;
+ HEAPF32[i27 + 4 >> 2] = d26;
+ d25 = +HEAPF32[i13 >> 2];
+ d26 = +HEAPF32[i14 >> 2];
+ d23 = +HEAPF32[i15 >> 2];
+ d24 = +HEAPF32[i16 >> 2];
+ d25 = +(d25 > d26 ? d25 : d26);
+ d26 = +(d23 > d24 ? d23 : d24);
+ i27 = i10 + (i21 * 28 | 0) + 8 | 0;
+ HEAPF32[i27 >> 2] = d25;
+ HEAPF32[i27 + 4 >> 2] = d26;
+ d26 = +HEAPF32[i11 >> 2] - +HEAPF32[i22 >> 2];
+ HEAPF32[i3 >> 2] = +HEAPF32[i2 >> 2] - +HEAPF32[i7 >> 2];
+ HEAPF32[i12 >> 2] = d26;
+ __ZN12b2BroadPhase9MoveProxyEiRK6b2AABBRK6b2Vec2(i8, HEAP32[i10 + (i21 * 28 | 0) + 24 >> 2] | 0, i17, i3);
+ i21 = i21 + 1 | 0;
+ } while ((i21 | 0) < (HEAP32[i4 >> 2] | 0));
+ STACKTOP = i9;
+ return;
+}
+function __ZN12b2EPCollider24ComputePolygonSeparationEv(i2, i9) {
+ i2 = i2 | 0;
+ i9 = i9 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, d6 = 0.0, d7 = 0.0, i8 = 0, d10 = 0.0, d11 = 0.0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, d16 = 0.0, d17 = 0.0, d18 = 0.0, d19 = 0.0, i20 = 0, d21 = 0.0, d22 = 0.0, d23 = 0.0, d24 = 0.0, d25 = 0.0, d26 = 0.0;
+ i15 = STACKTOP;
+ HEAP32[i2 >> 2] = 0;
+ i3 = i2 + 4 | 0;
+ HEAP32[i3 >> 2] = -1;
+ i4 = i2 + 8 | 0;
+ HEAPF32[i4 >> 2] = -3.4028234663852886e+38;
+ d7 = +HEAPF32[i9 + 216 >> 2];
+ d6 = +HEAPF32[i9 + 212 >> 2];
+ i5 = HEAP32[i9 + 128 >> 2] | 0;
+ if ((i5 | 0) <= 0) {
+ STACKTOP = i15;
+ return;
+ }
+ d17 = +HEAPF32[i9 + 164 >> 2];
+ d18 = +HEAPF32[i9 + 168 >> 2];
+ d11 = +HEAPF32[i9 + 172 >> 2];
+ d10 = +HEAPF32[i9 + 176 >> 2];
+ d16 = +HEAPF32[i9 + 244 >> 2];
+ i12 = i9 + 228 | 0;
+ i13 = i9 + 232 | 0;
+ i14 = i9 + 236 | 0;
+ i1 = i9 + 240 | 0;
+ d19 = -3.4028234663852886e+38;
+ i20 = 0;
+ while (1) {
+ d23 = +HEAPF32[i9 + (i20 << 3) + 64 >> 2];
+ d21 = -d23;
+ d22 = -+HEAPF32[i9 + (i20 << 3) + 68 >> 2];
+ d26 = +HEAPF32[i9 + (i20 << 3) >> 2];
+ d25 = +HEAPF32[i9 + (i20 << 3) + 4 >> 2];
+ d24 = (d26 - d17) * d21 + (d25 - d18) * d22;
+ d25 = (d26 - d11) * d21 + (d25 - d10) * d22;
+ d24 = d24 < d25 ? d24 : d25;
+ if (d24 > d16) {
+ break;
+ }
+ if (!(d7 * d23 + d6 * d22 >= 0.0)) {
+ if (!((d21 - +HEAPF32[i12 >> 2]) * d6 + (d22 - +HEAPF32[i13 >> 2]) * d7 < -.03490658849477768) & d24 > d19) {
+ i8 = 8;
+ }
+ } else {
+ if (!((d21 - +HEAPF32[i14 >> 2]) * d6 + (d22 - +HEAPF32[i1 >> 2]) * d7 < -.03490658849477768) & d24 > d19) {
+ i8 = 8;
+ }
+ }
+ if ((i8 | 0) == 8) {
+ i8 = 0;
+ HEAP32[i2 >> 2] = 2;
+ HEAP32[i3 >> 2] = i20;
+ HEAPF32[i4 >> 2] = d24;
+ d19 = d24;
+ }
+ i20 = i20 + 1 | 0;
+ if ((i20 | 0) >= (i5 | 0)) {
+ i8 = 10;
+ break;
+ }
+ }
+ if ((i8 | 0) == 10) {
+ STACKTOP = i15;
+ return;
+ }
+ HEAP32[i2 >> 2] = 2;
+ HEAP32[i3 >> 2] = i20;
+ HEAPF32[i4 >> 2] = d24;
+ STACKTOP = i15;
+ return;
+}
+function __ZNK11b2EdgeShape7RayCastEP15b2RayCastOutputRK14b2RayCastInputRK11b2Transformi(i17, i1, i2, i18, i3) {
+ i17 = i17 | 0;
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ i18 = i18 | 0;
+ i3 = i3 | 0;
+ var d4 = 0.0, d5 = 0.0, d6 = 0.0, d7 = 0.0, d8 = 0.0, d9 = 0.0, d10 = 0.0, d11 = 0.0, d12 = 0.0, d13 = 0.0, d14 = 0.0, d15 = 0.0, d16 = 0.0;
+ i3 = STACKTOP;
+ d6 = +HEAPF32[i18 >> 2];
+ d7 = +HEAPF32[i2 >> 2] - d6;
+ d9 = +HEAPF32[i18 + 4 >> 2];
+ d4 = +HEAPF32[i2 + 4 >> 2] - d9;
+ d11 = +HEAPF32[i18 + 12 >> 2];
+ d5 = +HEAPF32[i18 + 8 >> 2];
+ d8 = d7 * d11 + d4 * d5;
+ d7 = d11 * d4 - d7 * d5;
+ d6 = +HEAPF32[i2 + 8 >> 2] - d6;
+ d9 = +HEAPF32[i2 + 12 >> 2] - d9;
+ d4 = d11 * d6 + d5 * d9 - d8;
+ d6 = d11 * d9 - d5 * d6 - d7;
+ i18 = i17 + 12 | 0;
+ d5 = +HEAPF32[i18 >> 2];
+ d9 = +HEAPF32[i18 + 4 >> 2];
+ i18 = i17 + 20 | 0;
+ d11 = +HEAPF32[i18 >> 2];
+ d11 = d11 - d5;
+ d12 = +HEAPF32[i18 + 4 >> 2] - d9;
+ d15 = -d11;
+ d10 = d11 * d11 + d12 * d12;
+ d13 = +Math_sqrt(+d10);
+ if (d13 < 1.1920928955078125e-7) {
+ d13 = d12;
+ } else {
+ d16 = 1.0 / d13;
+ d13 = d12 * d16;
+ d15 = d16 * d15;
+ }
+ d14 = (d9 - d7) * d15 + (d5 - d8) * d13;
+ d16 = d6 * d15 + d4 * d13;
+ if (d16 == 0.0) {
+ i18 = 0;
+ STACKTOP = i3;
+ return i18 | 0;
+ }
+ d16 = d14 / d16;
+ if (d16 < 0.0) {
+ i18 = 0;
+ STACKTOP = i3;
+ return i18 | 0;
+ }
+ if (+HEAPF32[i2 + 16 >> 2] < d16 | d10 == 0.0) {
+ i18 = 0;
+ STACKTOP = i3;
+ return i18 | 0;
+ }
+ d12 = (d11 * (d8 + d4 * d16 - d5) + d12 * (d7 + d6 * d16 - d9)) / d10;
+ if (d12 < 0.0 | d12 > 1.0) {
+ i18 = 0;
+ STACKTOP = i3;
+ return i18 | 0;
+ }
+ HEAPF32[i1 + 8 >> 2] = d16;
+ if (d14 > 0.0) {
+ d14 = +-d13;
+ d16 = +-d15;
+ i18 = i1;
+ HEAPF32[i18 >> 2] = d14;
+ HEAPF32[i18 + 4 >> 2] = d16;
+ i18 = 1;
+ STACKTOP = i3;
+ return i18 | 0;
+ } else {
+ d14 = +d13;
+ d16 = +d15;
+ i18 = i1;
+ HEAPF32[i18 >> 2] = d14;
+ HEAPF32[i18 + 4 >> 2] = d16;
+ i18 = 1;
+ STACKTOP = i3;
+ return i18 | 0;
+ }
+ return 0;
+}
+function ___dynamic_cast(i7, i6, i11, i5) {
+ i7 = i7 | 0;
+ i6 = i6 | 0;
+ i11 = i11 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i8 = 0, i9 = 0, i10 = 0, i12 = 0, i13 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 64 | 0;
+ i2 = i1;
+ i3 = HEAP32[i7 >> 2] | 0;
+ i4 = i7 + (HEAP32[i3 + -8 >> 2] | 0) | 0;
+ i3 = HEAP32[i3 + -4 >> 2] | 0;
+ HEAP32[i2 >> 2] = i11;
+ HEAP32[i2 + 4 >> 2] = i7;
+ HEAP32[i2 + 8 >> 2] = i6;
+ HEAP32[i2 + 12 >> 2] = i5;
+ i9 = i2 + 16 | 0;
+ i10 = i2 + 20 | 0;
+ i6 = i2 + 24 | 0;
+ i8 = i2 + 28 | 0;
+ i5 = i2 + 32 | 0;
+ i7 = i2 + 40 | 0;
+ i12 = (i3 | 0) == (i11 | 0);
+ i13 = i9 + 0 | 0;
+ i11 = i13 + 36 | 0;
+ do {
+ HEAP32[i13 >> 2] = 0;
+ i13 = i13 + 4 | 0;
+ } while ((i13 | 0) < (i11 | 0));
+ HEAP16[i9 + 36 >> 1] = 0;
+ HEAP8[i9 + 38 | 0] = 0;
+ if (i12) {
+ HEAP32[i2 + 48 >> 2] = 1;
+ FUNCTION_TABLE_viiiiii[HEAP32[(HEAP32[i3 >> 2] | 0) + 20 >> 2] & 3](i3, i2, i4, i4, 1, 0);
+ i13 = (HEAP32[i6 >> 2] | 0) == 1 ? i4 : 0;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ FUNCTION_TABLE_viiiii[HEAP32[(HEAP32[i3 >> 2] | 0) + 24 >> 2] & 3](i3, i2, i4, 1, 0);
+ i2 = HEAP32[i2 + 36 >> 2] | 0;
+ if ((i2 | 0) == 0) {
+ if ((HEAP32[i7 >> 2] | 0) != 1) {
+ i13 = 0;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ if ((HEAP32[i8 >> 2] | 0) != 1) {
+ i13 = 0;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ i13 = (HEAP32[i5 >> 2] | 0) == 1 ? HEAP32[i10 >> 2] | 0 : 0;
+ STACKTOP = i1;
+ return i13 | 0;
+ } else if ((i2 | 0) == 1) {
+ if ((HEAP32[i6 >> 2] | 0) != 1) {
+ if ((HEAP32[i7 >> 2] | 0) != 0) {
+ i13 = 0;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ if ((HEAP32[i8 >> 2] | 0) != 1) {
+ i13 = 0;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ if ((HEAP32[i5 >> 2] | 0) != 1) {
+ i13 = 0;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ }
+ i13 = HEAP32[i9 >> 2] | 0;
+ STACKTOP = i1;
+ return i13 | 0;
+ } else {
+ i13 = 0;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ return 0;
+}
+function __ZNK14b2PolygonShape11ComputeMassEP10b2MassDataf(i4, i1, d2) {
+ i4 = i4 | 0;
+ i1 = i1 | 0;
+ d2 = +d2;
+ var i3 = 0, i5 = 0, d6 = 0.0, d7 = 0.0, d8 = 0.0, d9 = 0.0, d10 = 0.0, d11 = 0.0, i12 = 0, d13 = 0.0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, d18 = 0.0, i19 = 0, d20 = 0.0, d21 = 0.0, d22 = 0.0, d23 = 0.0;
+ i3 = STACKTOP;
+ i5 = HEAP32[i4 + 148 >> 2] | 0;
+ if ((i5 | 0) > 2) {
+ d7 = 0.0;
+ d6 = 0.0;
+ i12 = 0;
+ } else {
+ ___assert_fail(432, 328, 306, 456);
+ }
+ do {
+ d6 = d6 + +HEAPF32[i4 + (i12 << 3) + 20 >> 2];
+ d7 = d7 + +HEAPF32[i4 + (i12 << 3) + 24 >> 2];
+ i12 = i12 + 1 | 0;
+ } while ((i12 | 0) < (i5 | 0));
+ d11 = 1.0 / +(i5 | 0);
+ d6 = d6 * d11;
+ d11 = d7 * d11;
+ i16 = i4 + 20 | 0;
+ i19 = i4 + 24 | 0;
+ d9 = 0.0;
+ d10 = 0.0;
+ d7 = 0.0;
+ d8 = 0.0;
+ i17 = 0;
+ do {
+ d18 = +HEAPF32[i4 + (i17 << 3) + 20 >> 2] - d6;
+ d13 = +HEAPF32[i4 + (i17 << 3) + 24 >> 2] - d11;
+ i17 = i17 + 1 | 0;
+ i12 = (i17 | 0) < (i5 | 0);
+ if (i12) {
+ i14 = i4 + (i17 << 3) + 20 | 0;
+ i15 = i4 + (i17 << 3) + 24 | 0;
+ } else {
+ i14 = i16;
+ i15 = i19;
+ }
+ d21 = +HEAPF32[i14 >> 2] - d6;
+ d20 = +HEAPF32[i15 >> 2] - d11;
+ d22 = d18 * d20 - d13 * d21;
+ d23 = d22 * .5;
+ d8 = d8 + d23;
+ d23 = d23 * .3333333432674408;
+ d9 = d9 + (d18 + d21) * d23;
+ d10 = d10 + (d13 + d20) * d23;
+ d7 = d7 + d22 * .0833333358168602 * (d21 * d21 + (d18 * d18 + d18 * d21) + (d20 * d20 + (d13 * d13 + d13 * d20)));
+ } while (i12);
+ d13 = d8 * d2;
+ HEAPF32[i1 >> 2] = d13;
+ if (d8 > 1.1920928955078125e-7) {
+ d23 = 1.0 / d8;
+ d22 = d9 * d23;
+ d23 = d10 * d23;
+ d20 = d6 + d22;
+ d21 = d11 + d23;
+ d11 = +d20;
+ d18 = +d21;
+ i19 = i1 + 4 | 0;
+ HEAPF32[i19 >> 2] = d11;
+ HEAPF32[i19 + 4 >> 2] = d18;
+ HEAPF32[i1 + 12 >> 2] = d7 * d2 + d13 * (d20 * d20 + d21 * d21 - (d22 * d22 + d23 * d23));
+ STACKTOP = i3;
+ return;
+ } else {
+ ___assert_fail(472, 328, 352, 456);
+ }
+}
+function __ZN16b2ContactManager7DestroyEP9b2Contact(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0;
+ i3 = STACKTOP;
+ i5 = HEAP32[(HEAP32[i2 + 48 >> 2] | 0) + 8 >> 2] | 0;
+ i4 = HEAP32[(HEAP32[i2 + 52 >> 2] | 0) + 8 >> 2] | 0;
+ i6 = HEAP32[i1 + 72 >> 2] | 0;
+ if ((i6 | 0) != 0 ? (HEAP32[i2 + 4 >> 2] & 2 | 0) != 0 : 0) {
+ FUNCTION_TABLE_vii[HEAP32[(HEAP32[i6 >> 2] | 0) + 12 >> 2] & 15](i6, i2);
+ }
+ i7 = i2 + 8 | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ i6 = i2 + 12 | 0;
+ if ((i8 | 0) != 0) {
+ HEAP32[i8 + 12 >> 2] = HEAP32[i6 >> 2];
+ }
+ i8 = HEAP32[i6 >> 2] | 0;
+ if ((i8 | 0) != 0) {
+ HEAP32[i8 + 8 >> 2] = HEAP32[i7 >> 2];
+ }
+ i7 = i1 + 60 | 0;
+ if ((HEAP32[i7 >> 2] | 0) == (i2 | 0)) {
+ HEAP32[i7 >> 2] = HEAP32[i6 >> 2];
+ }
+ i7 = i2 + 24 | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ i6 = i2 + 28 | 0;
+ if ((i8 | 0) != 0) {
+ HEAP32[i8 + 12 >> 2] = HEAP32[i6 >> 2];
+ }
+ i8 = HEAP32[i6 >> 2] | 0;
+ if ((i8 | 0) != 0) {
+ HEAP32[i8 + 8 >> 2] = HEAP32[i7 >> 2];
+ }
+ i5 = i5 + 112 | 0;
+ if ((i2 + 16 | 0) == (HEAP32[i5 >> 2] | 0)) {
+ HEAP32[i5 >> 2] = HEAP32[i6 >> 2];
+ }
+ i6 = i2 + 40 | 0;
+ i7 = HEAP32[i6 >> 2] | 0;
+ i5 = i2 + 44 | 0;
+ if ((i7 | 0) != 0) {
+ HEAP32[i7 + 12 >> 2] = HEAP32[i5 >> 2];
+ }
+ i7 = HEAP32[i5 >> 2] | 0;
+ if ((i7 | 0) != 0) {
+ HEAP32[i7 + 8 >> 2] = HEAP32[i6 >> 2];
+ }
+ i4 = i4 + 112 | 0;
+ if ((i2 + 32 | 0) != (HEAP32[i4 >> 2] | 0)) {
+ i8 = i1 + 76 | 0;
+ i8 = HEAP32[i8 >> 2] | 0;
+ __ZN9b2Contact7DestroyEPS_P16b2BlockAllocator(i2, i8);
+ i8 = i1 + 64 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ i7 = i7 + -1 | 0;
+ HEAP32[i8 >> 2] = i7;
+ STACKTOP = i3;
+ return;
+ }
+ HEAP32[i4 >> 2] = HEAP32[i5 >> 2];
+ i8 = i1 + 76 | 0;
+ i8 = HEAP32[i8 >> 2] | 0;
+ __ZN9b2Contact7DestroyEPS_P16b2BlockAllocator(i2, i8);
+ i8 = i1 + 64 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ i7 = i7 + -1 | 0;
+ HEAP32[i8 >> 2] = i7;
+ STACKTOP = i3;
+ return;
+}
+function __ZNK10__cxxabiv120__si_class_type_info16search_below_dstEPNS_19__dynamic_cast_infoEPKvib(i6, i3, i4, i8, i7) {
+ i6 = i6 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ i8 = i8 | 0;
+ i7 = i7 | 0;
+ var i1 = 0, i2 = 0, i5 = 0, i9 = 0, i10 = 0;
+ i1 = STACKTOP;
+ if ((i6 | 0) == (HEAP32[i3 + 8 >> 2] | 0)) {
+ if ((HEAP32[i3 + 4 >> 2] | 0) != (i4 | 0)) {
+ STACKTOP = i1;
+ return;
+ }
+ i2 = i3 + 28 | 0;
+ if ((HEAP32[i2 >> 2] | 0) == 1) {
+ STACKTOP = i1;
+ return;
+ }
+ HEAP32[i2 >> 2] = i8;
+ STACKTOP = i1;
+ return;
+ }
+ if ((i6 | 0) != (HEAP32[i3 >> 2] | 0)) {
+ i9 = HEAP32[i6 + 8 >> 2] | 0;
+ FUNCTION_TABLE_viiiii[HEAP32[(HEAP32[i9 >> 2] | 0) + 24 >> 2] & 3](i9, i3, i4, i8, i7);
+ STACKTOP = i1;
+ return;
+ }
+ if ((HEAP32[i3 + 16 >> 2] | 0) != (i4 | 0) ? (i5 = i3 + 20 | 0, (HEAP32[i5 >> 2] | 0) != (i4 | 0)) : 0) {
+ HEAP32[i3 + 32 >> 2] = i8;
+ i8 = i3 + 44 | 0;
+ if ((HEAP32[i8 >> 2] | 0) == 4) {
+ STACKTOP = i1;
+ return;
+ }
+ i9 = i3 + 52 | 0;
+ HEAP8[i9] = 0;
+ i10 = i3 + 53 | 0;
+ HEAP8[i10] = 0;
+ i6 = HEAP32[i6 + 8 >> 2] | 0;
+ FUNCTION_TABLE_viiiiii[HEAP32[(HEAP32[i6 >> 2] | 0) + 20 >> 2] & 3](i6, i3, i4, i4, 1, i7);
+ if ((HEAP8[i10] | 0) != 0) {
+ if ((HEAP8[i9] | 0) == 0) {
+ i6 = 1;
+ i2 = 13;
+ }
+ } else {
+ i6 = 0;
+ i2 = 13;
+ }
+ do {
+ if ((i2 | 0) == 13) {
+ HEAP32[i5 >> 2] = i4;
+ i10 = i3 + 40 | 0;
+ HEAP32[i10 >> 2] = (HEAP32[i10 >> 2] | 0) + 1;
+ if ((HEAP32[i3 + 36 >> 2] | 0) == 1 ? (HEAP32[i3 + 24 >> 2] | 0) == 2 : 0) {
+ HEAP8[i3 + 54 | 0] = 1;
+ if (i6) {
+ break;
+ }
+ } else {
+ i2 = 16;
+ }
+ if ((i2 | 0) == 16 ? i6 : 0) {
+ break;
+ }
+ HEAP32[i8 >> 2] = 4;
+ STACKTOP = i1;
+ return;
+ }
+ } while (0);
+ HEAP32[i8 >> 2] = 3;
+ STACKTOP = i1;
+ return;
+ }
+ if ((i8 | 0) != 1) {
+ STACKTOP = i1;
+ return;
+ }
+ HEAP32[i3 + 32 >> 2] = 1;
+ STACKTOP = i1;
+ return;
+}
+function __ZN16b2BlockAllocator8AllocateEi(i4, i2) {
+ i4 = i4 | 0;
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0;
+ i1 = STACKTOP;
+ if ((i2 | 0) == 0) {
+ i9 = 0;
+ STACKTOP = i1;
+ return i9 | 0;
+ }
+ if ((i2 | 0) <= 0) {
+ ___assert_fail(1376, 1312, 104, 1392);
+ }
+ if ((i2 | 0) > 640) {
+ i9 = __Z7b2Alloci(i2) | 0;
+ STACKTOP = i1;
+ return i9 | 0;
+ }
+ i9 = HEAP8[632 + i2 | 0] | 0;
+ i5 = i9 & 255;
+ if (!((i9 & 255) < 14)) {
+ ___assert_fail(1408, 1312, 112, 1392);
+ }
+ i2 = i4 + (i5 << 2) + 12 | 0;
+ i3 = HEAP32[i2 >> 2] | 0;
+ if ((i3 | 0) != 0) {
+ HEAP32[i2 >> 2] = HEAP32[i3 >> 2];
+ i9 = i3;
+ STACKTOP = i1;
+ return i9 | 0;
+ }
+ i3 = i4 + 4 | 0;
+ i6 = HEAP32[i3 >> 2] | 0;
+ i7 = i4 + 8 | 0;
+ if ((i6 | 0) == (HEAP32[i7 >> 2] | 0)) {
+ i9 = HEAP32[i4 >> 2] | 0;
+ i6 = i6 + 128 | 0;
+ HEAP32[i7 >> 2] = i6;
+ i6 = __Z7b2Alloci(i6 << 3) | 0;
+ HEAP32[i4 >> 2] = i6;
+ _memcpy(i6 | 0, i9 | 0, HEAP32[i3 >> 2] << 3 | 0) | 0;
+ _memset((HEAP32[i4 >> 2] | 0) + (HEAP32[i3 >> 2] << 3) | 0, 0, 1024) | 0;
+ __Z6b2FreePv(i9);
+ i6 = HEAP32[i3 >> 2] | 0;
+ }
+ i9 = HEAP32[i4 >> 2] | 0;
+ i7 = __Z7b2Alloci(16384) | 0;
+ i4 = i9 + (i6 << 3) + 4 | 0;
+ HEAP32[i4 >> 2] = i7;
+ i5 = HEAP32[576 + (i5 << 2) >> 2] | 0;
+ HEAP32[i9 + (i6 << 3) >> 2] = i5;
+ i6 = 16384 / (i5 | 0) | 0;
+ if ((Math_imul(i6, i5) | 0) >= 16385) {
+ ___assert_fail(1448, 1312, 140, 1392);
+ }
+ i6 = i6 + -1 | 0;
+ if ((i6 | 0) > 0) {
+ i9 = 0;
+ while (1) {
+ i8 = i9 + 1 | 0;
+ HEAP32[i7 + (Math_imul(i9, i5) | 0) >> 2] = i7 + (Math_imul(i8, i5) | 0);
+ i7 = HEAP32[i4 >> 2] | 0;
+ if ((i8 | 0) == (i6 | 0)) {
+ break;
+ } else {
+ i9 = i8;
+ }
+ }
+ }
+ HEAP32[i7 + (Math_imul(i6, i5) | 0) >> 2] = 0;
+ HEAP32[i2 >> 2] = HEAP32[HEAP32[i4 >> 2] >> 2];
+ HEAP32[i3 >> 2] = (HEAP32[i3 >> 2] | 0) + 1;
+ i9 = HEAP32[i4 >> 2] | 0;
+ STACKTOP = i1;
+ return i9 | 0;
+}
+function __ZN9b2Contact6CreateEP9b2FixtureiS1_iP16b2BlockAllocator(i4, i5, i1, i3, i6) {
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i6 = i6 | 0;
+ var i2 = 0, i7 = 0, i8 = 0, i9 = 0;
+ i2 = STACKTOP;
+ if ((HEAP8[4200] | 0) == 0) {
+ HEAP32[1002] = 3;
+ HEAP32[4012 >> 2] = 3;
+ HEAP8[4016 | 0] = 1;
+ HEAP32[4104 >> 2] = 4;
+ HEAP32[4108 >> 2] = 4;
+ HEAP8[4112 | 0] = 1;
+ HEAP32[4032 >> 2] = 4;
+ HEAP32[4036 >> 2] = 4;
+ HEAP8[4040 | 0] = 0;
+ HEAP32[4128 >> 2] = 5;
+ HEAP32[4132 >> 2] = 5;
+ HEAP8[4136 | 0] = 1;
+ HEAP32[4056 >> 2] = 6;
+ HEAP32[4060 >> 2] = 6;
+ HEAP8[4064 | 0] = 1;
+ HEAP32[4020 >> 2] = 6;
+ HEAP32[4024 >> 2] = 6;
+ HEAP8[4028 | 0] = 0;
+ HEAP32[4080 >> 2] = 7;
+ HEAP32[4084 >> 2] = 7;
+ HEAP8[4088 | 0] = 1;
+ HEAP32[4116 >> 2] = 7;
+ HEAP32[4120 >> 2] = 7;
+ HEAP8[4124 | 0] = 0;
+ HEAP32[4152 >> 2] = 8;
+ HEAP32[4156 >> 2] = 8;
+ HEAP8[4160 | 0] = 1;
+ HEAP32[4044 >> 2] = 8;
+ HEAP32[4048 >> 2] = 8;
+ HEAP8[4052 | 0] = 0;
+ HEAP32[4176 >> 2] = 9;
+ HEAP32[4180 >> 2] = 9;
+ HEAP8[4184 | 0] = 1;
+ HEAP32[4140 >> 2] = 9;
+ HEAP32[4144 >> 2] = 9;
+ HEAP8[4148 | 0] = 0;
+ HEAP8[4200] = 1;
+ }
+ i7 = HEAP32[(HEAP32[i4 + 12 >> 2] | 0) + 4 >> 2] | 0;
+ i8 = HEAP32[(HEAP32[i1 + 12 >> 2] | 0) + 4 >> 2] | 0;
+ if (!(i7 >>> 0 < 4)) {
+ ___assert_fail(4208, 4256, 80, 4344);
+ }
+ if (!(i8 >>> 0 < 4)) {
+ ___assert_fail(4296, 4256, 81, 4344);
+ }
+ i9 = HEAP32[4008 + (i7 * 48 | 0) + (i8 * 12 | 0) >> 2] | 0;
+ if ((i9 | 0) == 0) {
+ i9 = 0;
+ STACKTOP = i2;
+ return i9 | 0;
+ }
+ if ((HEAP8[4008 + (i7 * 48 | 0) + (i8 * 12 | 0) + 8 | 0] | 0) == 0) {
+ i9 = FUNCTION_TABLE_iiiiii[i9 & 15](i1, i3, i4, i5, i6) | 0;
+ STACKTOP = i2;
+ return i9 | 0;
+ } else {
+ i9 = FUNCTION_TABLE_iiiiii[i9 & 15](i4, i5, i1, i3, i6) | 0;
+ STACKTOP = i2;
+ return i9 | 0;
+ }
+ return 0;
+}
+function __ZN13b2DynamicTree9MoveProxyEiRK6b2AABBRK6b2Vec2(i1, i2, i13, i9) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ i13 = i13 | 0;
+ i9 = i9 | 0;
+ var i3 = 0, i4 = 0, d5 = 0.0, d6 = 0.0, d7 = 0.0, d8 = 0.0, d10 = 0.0, d11 = 0.0, i12 = 0;
+ i4 = STACKTOP;
+ if (!((i2 | 0) > -1)) {
+ ___assert_fail(3072, 2944, 135, 3152);
+ }
+ if ((HEAP32[i1 + 12 >> 2] | 0) <= (i2 | 0)) {
+ ___assert_fail(3072, 2944, 135, 3152);
+ }
+ i3 = i1 + 4 | 0;
+ i12 = HEAP32[i3 >> 2] | 0;
+ if (!((HEAP32[i12 + (i2 * 36 | 0) + 24 >> 2] | 0) == -1)) {
+ ___assert_fail(3120, 2944, 137, 3152);
+ }
+ if (((+HEAPF32[i12 + (i2 * 36 | 0) >> 2] <= +HEAPF32[i13 >> 2] ? +HEAPF32[i12 + (i2 * 36 | 0) + 4 >> 2] <= +HEAPF32[i13 + 4 >> 2] : 0) ? +HEAPF32[i13 + 8 >> 2] <= +HEAPF32[i12 + (i2 * 36 | 0) + 8 >> 2] : 0) ? +HEAPF32[i13 + 12 >> 2] <= +HEAPF32[i12 + (i2 * 36 | 0) + 12 >> 2] : 0) {
+ i13 = 0;
+ STACKTOP = i4;
+ return i13 | 0;
+ }
+ __ZN13b2DynamicTree10RemoveLeafEi(i1, i2);
+ i12 = i13;
+ d6 = +HEAPF32[i12 >> 2];
+ d8 = +HEAPF32[i12 + 4 >> 2];
+ i13 = i13 + 8 | 0;
+ d10 = +HEAPF32[i13 >> 2];
+ d6 = d6 + -.10000000149011612;
+ d8 = d8 + -.10000000149011612;
+ d10 = d10 + .10000000149011612;
+ d5 = +HEAPF32[i13 + 4 >> 2] + .10000000149011612;
+ d11 = +HEAPF32[i9 >> 2] * 2.0;
+ d7 = +HEAPF32[i9 + 4 >> 2] * 2.0;
+ if (d11 < 0.0) {
+ d6 = d6 + d11;
+ } else {
+ d10 = d11 + d10;
+ }
+ if (d7 < 0.0) {
+ d8 = d8 + d7;
+ } else {
+ d5 = d7 + d5;
+ }
+ i13 = HEAP32[i3 >> 2] | 0;
+ d7 = +d6;
+ d11 = +d8;
+ i12 = i13 + (i2 * 36 | 0) | 0;
+ HEAPF32[i12 >> 2] = d7;
+ HEAPF32[i12 + 4 >> 2] = d11;
+ d10 = +d10;
+ d11 = +d5;
+ i13 = i13 + (i2 * 36 | 0) + 8 | 0;
+ HEAPF32[i13 >> 2] = d10;
+ HEAPF32[i13 + 4 >> 2] = d11;
+ __ZN13b2DynamicTree10InsertLeafEi(i1, i2);
+ i13 = 1;
+ STACKTOP = i4;
+ return i13 | 0;
+}
+function __ZNK9b2Simplex16GetWitnessPointsEP6b2Vec2S1_(i1, i4, i5) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, d6 = 0.0, d7 = 0.0, d8 = 0.0, i9 = 0, i10 = 0, d11 = 0.0;
+ i2 = STACKTOP;
+ i3 = HEAP32[i1 + 108 >> 2] | 0;
+ if ((i3 | 0) == 2) {
+ i9 = i1 + 24 | 0;
+ d7 = +HEAPF32[i9 >> 2];
+ i3 = i1 + 60 | 0;
+ d8 = +HEAPF32[i3 >> 2];
+ d6 = +(d7 * +HEAPF32[i1 >> 2] + d8 * +HEAPF32[i1 + 36 >> 2]);
+ d8 = +(d7 * +HEAPF32[i1 + 4 >> 2] + d8 * +HEAPF32[i1 + 40 >> 2]);
+ HEAPF32[i4 >> 2] = d6;
+ HEAPF32[i4 + 4 >> 2] = d8;
+ d8 = +HEAPF32[i9 >> 2];
+ d6 = +HEAPF32[i3 >> 2];
+ d7 = +(d8 * +HEAPF32[i1 + 8 >> 2] + d6 * +HEAPF32[i1 + 44 >> 2]);
+ d6 = +(d8 * +HEAPF32[i1 + 12 >> 2] + d6 * +HEAPF32[i1 + 48 >> 2]);
+ HEAPF32[i5 >> 2] = d7;
+ HEAPF32[i5 + 4 >> 2] = d6;
+ STACKTOP = i2;
+ return;
+ } else if ((i3 | 0) == 1) {
+ i10 = i1;
+ i9 = HEAP32[i10 + 4 >> 2] | 0;
+ i3 = i4;
+ HEAP32[i3 >> 2] = HEAP32[i10 >> 2];
+ HEAP32[i3 + 4 >> 2] = i9;
+ i3 = i1 + 8 | 0;
+ i4 = HEAP32[i3 + 4 >> 2] | 0;
+ i9 = i5;
+ HEAP32[i9 >> 2] = HEAP32[i3 >> 2];
+ HEAP32[i9 + 4 >> 2] = i4;
+ STACKTOP = i2;
+ return;
+ } else if ((i3 | 0) == 0) {
+ ___assert_fail(2712, 2672, 217, 2752);
+ } else if ((i3 | 0) == 3) {
+ d11 = +HEAPF32[i1 + 24 >> 2];
+ d6 = +HEAPF32[i1 + 60 >> 2];
+ d8 = +HEAPF32[i1 + 96 >> 2];
+ d7 = +(d11 * +HEAPF32[i1 >> 2] + d6 * +HEAPF32[i1 + 36 >> 2] + d8 * +HEAPF32[i1 + 72 >> 2]);
+ d8 = +(d11 * +HEAPF32[i1 + 4 >> 2] + d6 * +HEAPF32[i1 + 40 >> 2] + d8 * +HEAPF32[i1 + 76 >> 2]);
+ i10 = i4;
+ HEAPF32[i10 >> 2] = d7;
+ HEAPF32[i10 + 4 >> 2] = d8;
+ i10 = i5;
+ HEAPF32[i10 >> 2] = d7;
+ HEAPF32[i10 + 4 >> 2] = d8;
+ STACKTOP = i2;
+ return;
+ } else {
+ ___assert_fail(2712, 2672, 236, 2752);
+ }
+}
+function __ZNK12b2ChainShape12GetChildEdgeEP11b2EdgeShapei(i4, i3, i1) {
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0;
+ i2 = STACKTOP;
+ if (!((i1 | 0) > -1)) {
+ ___assert_fail(6832, 6792, 89, 6872);
+ }
+ i5 = i4 + 16 | 0;
+ if (((HEAP32[i5 >> 2] | 0) + -1 | 0) <= (i1 | 0)) {
+ ___assert_fail(6832, 6792, 89, 6872);
+ }
+ HEAP32[i3 + 4 >> 2] = 1;
+ HEAPF32[i3 + 8 >> 2] = +HEAPF32[i4 + 8 >> 2];
+ i6 = i4 + 12 | 0;
+ i7 = (HEAP32[i6 >> 2] | 0) + (i1 << 3) | 0;
+ i8 = HEAP32[i7 + 4 >> 2] | 0;
+ i9 = i3 + 12 | 0;
+ HEAP32[i9 >> 2] = HEAP32[i7 >> 2];
+ HEAP32[i9 + 4 >> 2] = i8;
+ i9 = (HEAP32[i6 >> 2] | 0) + (i1 + 1 << 3) | 0;
+ i8 = HEAP32[i9 + 4 >> 2] | 0;
+ i7 = i3 + 20 | 0;
+ HEAP32[i7 >> 2] = HEAP32[i9 >> 2];
+ HEAP32[i7 + 4 >> 2] = i8;
+ i7 = i3 + 28 | 0;
+ if ((i1 | 0) > 0) {
+ i10 = (HEAP32[i6 >> 2] | 0) + (i1 + -1 << 3) | 0;
+ i8 = HEAP32[i10 + 4 >> 2] | 0;
+ i9 = i7;
+ HEAP32[i9 >> 2] = HEAP32[i10 >> 2];
+ HEAP32[i9 + 4 >> 2] = i8;
+ HEAP8[i3 + 44 | 0] = 1;
+ } else {
+ i8 = i4 + 20 | 0;
+ i9 = HEAP32[i8 + 4 >> 2] | 0;
+ i10 = i7;
+ HEAP32[i10 >> 2] = HEAP32[i8 >> 2];
+ HEAP32[i10 + 4 >> 2] = i9;
+ HEAP8[i3 + 44 | 0] = HEAP8[i4 + 36 | 0] | 0;
+ }
+ i7 = i3 + 36 | 0;
+ if (((HEAP32[i5 >> 2] | 0) + -2 | 0) > (i1 | 0)) {
+ i8 = (HEAP32[i6 >> 2] | 0) + (i1 + 2 << 3) | 0;
+ i9 = HEAP32[i8 + 4 >> 2] | 0;
+ i10 = i7;
+ HEAP32[i10 >> 2] = HEAP32[i8 >> 2];
+ HEAP32[i10 + 4 >> 2] = i9;
+ HEAP8[i3 + 45 | 0] = 1;
+ STACKTOP = i2;
+ return;
+ } else {
+ i8 = i4 + 28 | 0;
+ i9 = HEAP32[i8 + 4 >> 2] | 0;
+ i10 = i7;
+ HEAP32[i10 >> 2] = HEAP32[i8 >> 2];
+ HEAP32[i10 + 4 >> 2] = i9;
+ HEAP8[i3 + 45 | 0] = HEAP8[i4 + 37 | 0] | 0;
+ STACKTOP = i2;
+ return;
+ }
+}
+function __ZN15b2DistanceProxy3SetEPK7b2Shapei(i3, i1, i5) {
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0;
+ i2 = STACKTOP;
+ i4 = HEAP32[i1 + 4 >> 2] | 0;
+ if ((i4 | 0) == 1) {
+ HEAP32[i3 + 16 >> 2] = i1 + 12;
+ HEAP32[i3 + 20 >> 2] = 2;
+ HEAPF32[i3 + 24 >> 2] = +HEAPF32[i1 + 8 >> 2];
+ STACKTOP = i2;
+ return;
+ } else if ((i4 | 0) == 3) {
+ if (!((i5 | 0) > -1)) {
+ ___assert_fail(2632, 2672, 53, 2704);
+ }
+ i4 = i1 + 16 | 0;
+ if ((HEAP32[i4 >> 2] | 0) <= (i5 | 0)) {
+ ___assert_fail(2632, 2672, 53, 2704);
+ }
+ i7 = i1 + 12 | 0;
+ i9 = (HEAP32[i7 >> 2] | 0) + (i5 << 3) | 0;
+ i8 = HEAP32[i9 + 4 >> 2] | 0;
+ i6 = i3;
+ HEAP32[i6 >> 2] = HEAP32[i9 >> 2];
+ HEAP32[i6 + 4 >> 2] = i8;
+ i6 = i5 + 1 | 0;
+ i5 = i3 + 8 | 0;
+ i7 = HEAP32[i7 >> 2] | 0;
+ if ((i6 | 0) < (HEAP32[i4 >> 2] | 0)) {
+ i7 = i7 + (i6 << 3) | 0;
+ i8 = HEAP32[i7 + 4 >> 2] | 0;
+ i9 = i5;
+ HEAP32[i9 >> 2] = HEAP32[i7 >> 2];
+ HEAP32[i9 + 4 >> 2] = i8;
+ } else {
+ i8 = HEAP32[i7 + 4 >> 2] | 0;
+ i9 = i5;
+ HEAP32[i9 >> 2] = HEAP32[i7 >> 2];
+ HEAP32[i9 + 4 >> 2] = i8;
+ }
+ HEAP32[i3 + 16 >> 2] = i3;
+ HEAP32[i3 + 20 >> 2] = 2;
+ HEAPF32[i3 + 24 >> 2] = +HEAPF32[i1 + 8 >> 2];
+ STACKTOP = i2;
+ return;
+ } else if ((i4 | 0) == 2) {
+ HEAP32[i3 + 16 >> 2] = i1 + 20;
+ HEAP32[i3 + 20 >> 2] = HEAP32[i1 + 148 >> 2];
+ HEAPF32[i3 + 24 >> 2] = +HEAPF32[i1 + 8 >> 2];
+ STACKTOP = i2;
+ return;
+ } else if ((i4 | 0) == 0) {
+ HEAP32[i3 + 16 >> 2] = i1 + 12;
+ HEAP32[i3 + 20 >> 2] = 1;
+ HEAPF32[i3 + 24 >> 2] = +HEAPF32[i1 + 8 >> 2];
+ STACKTOP = i2;
+ return;
+ } else {
+ ___assert_fail(2712, 2672, 81, 2704);
+ }
+}
+function __ZL16b2EdgeSeparationPK14b2PolygonShapeRK11b2TransformiS1_S4_(i2, i7, i4, i5, i6) {
+ i2 = i2 | 0;
+ i7 = i7 | 0;
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ i6 = i6 | 0;
+ var d1 = 0.0, d3 = 0.0, d8 = 0.0, d9 = 0.0, d10 = 0.0, d11 = 0.0, i12 = 0, i13 = 0, d14 = 0.0, d15 = 0.0, d16 = 0.0, d17 = 0.0, i18 = 0, i19 = 0, i20 = 0;
+ i12 = STACKTOP;
+ i13 = HEAP32[i5 + 148 >> 2] | 0;
+ if (!((i4 | 0) > -1)) {
+ ___assert_fail(5640, 5688, 32, 5752);
+ }
+ if ((HEAP32[i2 + 148 >> 2] | 0) <= (i4 | 0)) {
+ ___assert_fail(5640, 5688, 32, 5752);
+ }
+ d11 = +HEAPF32[i7 + 12 >> 2];
+ d9 = +HEAPF32[i2 + (i4 << 3) + 84 >> 2];
+ d1 = +HEAPF32[i7 + 8 >> 2];
+ d3 = +HEAPF32[i2 + (i4 << 3) + 88 >> 2];
+ d8 = d11 * d9 - d1 * d3;
+ d3 = d9 * d1 + d11 * d3;
+ d9 = +HEAPF32[i6 + 12 >> 2];
+ d10 = +HEAPF32[i6 + 8 >> 2];
+ d16 = d9 * d8 + d10 * d3;
+ d14 = d9 * d3 - d8 * d10;
+ if ((i13 | 0) > 0) {
+ i19 = 0;
+ i20 = 0;
+ d15 = 3.4028234663852886e+38;
+ while (1) {
+ d17 = d16 * +HEAPF32[i5 + (i19 << 3) + 20 >> 2] + d14 * +HEAPF32[i5 + (i19 << 3) + 24 >> 2];
+ i18 = d17 < d15;
+ i20 = i18 ? i19 : i20;
+ i19 = i19 + 1 | 0;
+ if ((i19 | 0) == (i13 | 0)) {
+ break;
+ } else {
+ d15 = i18 ? d17 : d15;
+ }
+ }
+ } else {
+ i20 = 0;
+ }
+ d16 = +HEAPF32[i2 + (i4 << 3) + 20 >> 2];
+ d17 = +HEAPF32[i2 + (i4 << 3) + 24 >> 2];
+ d14 = +HEAPF32[i5 + (i20 << 3) + 20 >> 2];
+ d15 = +HEAPF32[i5 + (i20 << 3) + 24 >> 2];
+ STACKTOP = i12;
+ return +(d8 * (+HEAPF32[i6 >> 2] + (d9 * d14 - d10 * d15) - (+HEAPF32[i7 >> 2] + (d11 * d16 - d1 * d17))) + d3 * (d14 * d10 + d9 * d15 + +HEAPF32[i6 + 4 >> 2] - (d16 * d1 + d11 * d17 + +HEAPF32[i7 + 4 >> 2])));
+}
+function __Z4iterv() {
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, d5 = 0.0, d6 = 0.0, d7 = 0.0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 48 | 0;
+ i2 = i1;
+ i3 = i1 + 32 | 0;
+ i4 = HEAP32[16] | 0;
+ if ((i4 | 0) >= (HEAP32[4] | 0)) {
+ HEAP32[16] = i4 + 1;
+ __Z7measurePl(i3, HEAP32[8] | 0);
+ d7 = +HEAPF32[i3 + 4 >> 2];
+ d6 = +(HEAP32[10] | 0) / 1.0e6 * 1.0e3;
+ d5 = +(HEAP32[12] | 0) / 1.0e6 * 1.0e3;
+ HEAPF64[tempDoublePtr >> 3] = +HEAPF32[i3 >> 2];
+ HEAP32[i2 >> 2] = HEAP32[tempDoublePtr >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[tempDoublePtr + 4 >> 2];
+ i4 = i2 + 8 | 0;
+ HEAPF64[tempDoublePtr >> 3] = d7;
+ HEAP32[i4 >> 2] = HEAP32[tempDoublePtr >> 2];
+ HEAP32[i4 + 4 >> 2] = HEAP32[tempDoublePtr + 4 >> 2];
+ i4 = i2 + 16 | 0;
+ HEAPF64[tempDoublePtr >> 3] = d6;
+ HEAP32[i4 >> 2] = HEAP32[tempDoublePtr >> 2];
+ HEAP32[i4 + 4 >> 2] = HEAP32[tempDoublePtr + 4 >> 2];
+ i4 = i2 + 24 | 0;
+ HEAPF64[tempDoublePtr >> 3] = d5;
+ HEAP32[i4 >> 2] = HEAP32[tempDoublePtr >> 2];
+ HEAP32[i4 + 4 >> 2] = HEAP32[tempDoublePtr + 4 >> 2];
+ _printf(96, i2 | 0) | 0;
+ _emscripten_run_script(152);
+ if ((HEAP32[18] | 0) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ _emscripten_cancel_main_loop();
+ STACKTOP = i1;
+ return;
+ }
+ i3 = _clock() | 0;
+ __ZN7b2World4StepEfii(HEAP32[6] | 0, .01666666753590107, 3, 3);
+ i3 = (_clock() | 0) - i3 | 0;
+ i2 = HEAP32[16] | 0;
+ HEAP32[(HEAP32[8] | 0) + (i2 << 2) >> 2] = i3;
+ if ((i3 | 0) < (HEAP32[10] | 0)) {
+ HEAP32[10] = i3;
+ }
+ if ((i3 | 0) > (HEAP32[12] | 0)) {
+ HEAP32[12] = i3;
+ }
+ HEAP32[16] = i2 + 1;
+ STACKTOP = i1;
+ return;
+}
+function __ZN13b2DynamicTree12AllocateNodeEv(i5) {
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i6 = 0, i7 = 0;
+ i1 = STACKTOP;
+ i2 = i5 + 16 | 0;
+ i3 = HEAP32[i2 >> 2] | 0;
+ if ((i3 | 0) == -1) {
+ i4 = i5 + 8 | 0;
+ i6 = HEAP32[i4 >> 2] | 0;
+ i3 = i5 + 12 | 0;
+ if ((i6 | 0) != (HEAP32[i3 >> 2] | 0)) {
+ ___assert_fail(2912, 2944, 61, 2984);
+ }
+ i5 = i5 + 4 | 0;
+ i7 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i3 >> 2] = i6 << 1;
+ i6 = __Z7b2Alloci(i6 * 72 | 0) | 0;
+ HEAP32[i5 >> 2] = i6;
+ _memcpy(i6 | 0, i7 | 0, (HEAP32[i4 >> 2] | 0) * 36 | 0) | 0;
+ __Z6b2FreePv(i7);
+ i6 = HEAP32[i4 >> 2] | 0;
+ i7 = (HEAP32[i3 >> 2] | 0) + -1 | 0;
+ i5 = HEAP32[i5 >> 2] | 0;
+ if ((i6 | 0) < (i7 | 0)) {
+ i7 = i6;
+ while (1) {
+ i6 = i7 + 1 | 0;
+ HEAP32[i5 + (i7 * 36 | 0) + 20 >> 2] = i6;
+ HEAP32[i5 + (i7 * 36 | 0) + 32 >> 2] = -1;
+ i7 = (HEAP32[i3 >> 2] | 0) + -1 | 0;
+ if ((i6 | 0) < (i7 | 0)) {
+ i7 = i6;
+ } else {
+ break;
+ }
+ }
+ }
+ HEAP32[i5 + (i7 * 36 | 0) + 20 >> 2] = -1;
+ HEAP32[i5 + (((HEAP32[i3 >> 2] | 0) + -1 | 0) * 36 | 0) + 32 >> 2] = -1;
+ i3 = HEAP32[i4 >> 2] | 0;
+ HEAP32[i2 >> 2] = i3;
+ } else {
+ i4 = i5 + 8 | 0;
+ i5 = HEAP32[i5 + 4 >> 2] | 0;
+ }
+ i7 = i5 + (i3 * 36 | 0) + 20 | 0;
+ HEAP32[i2 >> 2] = HEAP32[i7 >> 2];
+ HEAP32[i7 >> 2] = -1;
+ HEAP32[i5 + (i3 * 36 | 0) + 24 >> 2] = -1;
+ HEAP32[i5 + (i3 * 36 | 0) + 28 >> 2] = -1;
+ HEAP32[i5 + (i3 * 36 | 0) + 32 >> 2] = 0;
+ HEAP32[i5 + (i3 * 36 | 0) + 16 >> 2] = 0;
+ HEAP32[i4 >> 2] = (HEAP32[i4 >> 2] | 0) + 1;
+ STACKTOP = i1;
+ return i3 | 0;
+}
+function __ZN9b2Fixture6CreateEP16b2BlockAllocatorP6b2BodyPK12b2FixtureDef(i1, i5, i4, i3) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i6 = 0, i7 = 0, d8 = 0.0;
+ i2 = STACKTOP;
+ HEAP32[i1 + 40 >> 2] = HEAP32[i3 + 4 >> 2];
+ HEAPF32[i1 + 16 >> 2] = +HEAPF32[i3 + 8 >> 2];
+ HEAPF32[i1 + 20 >> 2] = +HEAPF32[i3 + 12 >> 2];
+ HEAP32[i1 + 8 >> 2] = i4;
+ HEAP32[i1 + 4 >> 2] = 0;
+ i4 = i1 + 32 | 0;
+ i6 = i3 + 22 | 0;
+ HEAP16[i4 + 0 >> 1] = HEAP16[i6 + 0 >> 1] | 0;
+ HEAP16[i4 + 2 >> 1] = HEAP16[i6 + 2 >> 1] | 0;
+ HEAP16[i4 + 4 >> 1] = HEAP16[i6 + 4 >> 1] | 0;
+ HEAP8[i1 + 38 | 0] = HEAP8[i3 + 20 | 0] | 0;
+ i4 = HEAP32[i3 >> 2] | 0;
+ i4 = FUNCTION_TABLE_iii[HEAP32[(HEAP32[i4 >> 2] | 0) + 8 >> 2] & 3](i4, i5) | 0;
+ HEAP32[i1 + 12 >> 2] = i4;
+ i4 = FUNCTION_TABLE_ii[HEAP32[(HEAP32[i4 >> 2] | 0) + 12 >> 2] & 3](i4) | 0;
+ i6 = __ZN16b2BlockAllocator8AllocateEi(i5, i4 * 28 | 0) | 0;
+ i5 = i1 + 24 | 0;
+ HEAP32[i5 >> 2] = i6;
+ if ((i4 | 0) > 0) {
+ i7 = 0;
+ } else {
+ i7 = i1 + 28 | 0;
+ HEAP32[i7 >> 2] = 0;
+ i7 = i3 + 16 | 0;
+ d8 = +HEAPF32[i7 >> 2];
+ HEAPF32[i1 >> 2] = d8;
+ STACKTOP = i2;
+ return;
+ }
+ do {
+ HEAP32[i6 + (i7 * 28 | 0) + 16 >> 2] = 0;
+ i6 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i6 + (i7 * 28 | 0) + 24 >> 2] = -1;
+ i7 = i7 + 1 | 0;
+ } while ((i7 | 0) != (i4 | 0));
+ i7 = i1 + 28 | 0;
+ HEAP32[i7 >> 2] = 0;
+ i7 = i3 + 16 | 0;
+ d8 = +HEAPF32[i7 >> 2];
+ HEAPF32[i1 >> 2] = d8;
+ STACKTOP = i2;
+ return;
+}
+function __Z19b2ClipSegmentToLineP12b2ClipVertexPKS_RK6b2Vec2fi(i4, i1, i5, d9, i2) {
+ i4 = i4 | 0;
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ d9 = +d9;
+ i2 = i2 | 0;
+ var i3 = 0, i6 = 0, d7 = 0.0, i8 = 0, i10 = 0, d11 = 0.0, d12 = 0.0, i13 = 0;
+ i3 = STACKTOP;
+ d12 = +HEAPF32[i5 >> 2];
+ d11 = +HEAPF32[i5 + 4 >> 2];
+ i5 = i1 + 4 | 0;
+ d7 = d12 * +HEAPF32[i1 >> 2] + d11 * +HEAPF32[i5 >> 2] - d9;
+ i6 = i1 + 12 | 0;
+ i8 = i1 + 16 | 0;
+ d9 = d12 * +HEAPF32[i6 >> 2] + d11 * +HEAPF32[i8 >> 2] - d9;
+ if (!(d7 <= 0.0)) {
+ i10 = 0;
+ } else {
+ HEAP32[i4 + 0 >> 2] = HEAP32[i1 + 0 >> 2];
+ HEAP32[i4 + 4 >> 2] = HEAP32[i1 + 4 >> 2];
+ HEAP32[i4 + 8 >> 2] = HEAP32[i1 + 8 >> 2];
+ i10 = 1;
+ }
+ if (d9 <= 0.0) {
+ i13 = i10 + 1 | 0;
+ i10 = i4 + (i10 * 12 | 0) | 0;
+ HEAP32[i10 + 0 >> 2] = HEAP32[i6 + 0 >> 2];
+ HEAP32[i10 + 4 >> 2] = HEAP32[i6 + 4 >> 2];
+ HEAP32[i10 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ i10 = i13;
+ }
+ if (!(d7 * d9 < 0.0)) {
+ i13 = i10;
+ STACKTOP = i3;
+ return i13 | 0;
+ }
+ d9 = d7 / (d7 - d9);
+ d11 = +HEAPF32[i1 >> 2];
+ d12 = +HEAPF32[i5 >> 2];
+ d11 = +(d11 + d9 * (+HEAPF32[i6 >> 2] - d11));
+ d12 = +(d12 + d9 * (+HEAPF32[i8 >> 2] - d12));
+ i13 = i4 + (i10 * 12 | 0) | 0;
+ HEAPF32[i13 >> 2] = d11;
+ HEAPF32[i13 + 4 >> 2] = d12;
+ i13 = i4 + (i10 * 12 | 0) + 8 | 0;
+ HEAP8[i13] = i2;
+ HEAP8[i13 + 1 | 0] = HEAP8[i1 + 9 | 0] | 0;
+ HEAP8[i13 + 2 | 0] = 0;
+ HEAP8[i13 + 3 | 0] = 1;
+ i13 = i10 + 1 | 0;
+ STACKTOP = i3;
+ return i13 | 0;
+}
+function __Z16b2CollideCirclesP10b2ManifoldPK13b2CircleShapeRK11b2TransformS3_S6_(i1, i7, i8, i6, i9) {
+ i1 = i1 | 0;
+ i7 = i7 | 0;
+ i8 = i8 | 0;
+ i6 = i6 | 0;
+ i9 = i9 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, d10 = 0.0, d11 = 0.0, d12 = 0.0, d13 = 0.0, d14 = 0.0, d15 = 0.0, d16 = 0.0, d17 = 0.0, d18 = 0.0;
+ i2 = STACKTOP;
+ i4 = i1 + 60 | 0;
+ HEAP32[i4 >> 2] = 0;
+ i3 = i7 + 12 | 0;
+ d10 = +HEAPF32[i8 + 12 >> 2];
+ d14 = +HEAPF32[i3 >> 2];
+ d13 = +HEAPF32[i8 + 8 >> 2];
+ d11 = +HEAPF32[i7 + 16 >> 2];
+ i5 = i6 + 12 | 0;
+ d16 = +HEAPF32[i9 + 12 >> 2];
+ d18 = +HEAPF32[i5 >> 2];
+ d17 = +HEAPF32[i9 + 8 >> 2];
+ d15 = +HEAPF32[i6 + 16 >> 2];
+ d12 = +HEAPF32[i9 >> 2] + (d16 * d18 - d17 * d15) - (+HEAPF32[i8 >> 2] + (d10 * d14 - d13 * d11));
+ d11 = d18 * d17 + d16 * d15 + +HEAPF32[i9 + 4 >> 2] - (d14 * d13 + d10 * d11 + +HEAPF32[i8 + 4 >> 2]);
+ d10 = +HEAPF32[i7 + 8 >> 2] + +HEAPF32[i6 + 8 >> 2];
+ if (d12 * d12 + d11 * d11 > d10 * d10) {
+ STACKTOP = i2;
+ return;
+ }
+ HEAP32[i1 + 56 >> 2] = 0;
+ i9 = i3;
+ i8 = HEAP32[i9 + 4 >> 2] | 0;
+ i7 = i1 + 48 | 0;
+ HEAP32[i7 >> 2] = HEAP32[i9 >> 2];
+ HEAP32[i7 + 4 >> 2] = i8;
+ HEAPF32[i1 + 40 >> 2] = 0.0;
+ HEAPF32[i1 + 44 >> 2] = 0.0;
+ HEAP32[i4 >> 2] = 1;
+ i7 = i5;
+ i8 = HEAP32[i7 + 4 >> 2] | 0;
+ i9 = i1;
+ HEAP32[i9 >> 2] = HEAP32[i7 >> 2];
+ HEAP32[i9 + 4 >> 2] = i8;
+ HEAP32[i1 + 16 >> 2] = 0;
+ STACKTOP = i2;
+ return;
+}
+function __ZNK14b2PolygonShape11ComputeAABBEP6b2AABBRK11b2Transformi(i1, i2, i7, i3) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ i7 = i7 | 0;
+ i3 = i3 | 0;
+ var d4 = 0.0, d5 = 0.0, d6 = 0.0, d8 = 0.0, d9 = 0.0, d10 = 0.0, d11 = 0.0, d12 = 0.0, i13 = 0, d14 = 0.0, d15 = 0.0, d16 = 0.0;
+ i3 = STACKTOP;
+ d4 = +HEAPF32[i7 + 12 >> 2];
+ d15 = +HEAPF32[i1 + 20 >> 2];
+ d5 = +HEAPF32[i7 + 8 >> 2];
+ d12 = +HEAPF32[i1 + 24 >> 2];
+ d6 = +HEAPF32[i7 >> 2];
+ d9 = d6 + (d4 * d15 - d5 * d12);
+ d8 = +HEAPF32[i7 + 4 >> 2];
+ d12 = d15 * d5 + d4 * d12 + d8;
+ i7 = HEAP32[i1 + 148 >> 2] | 0;
+ if ((i7 | 0) > 1) {
+ d10 = d9;
+ d11 = d12;
+ i13 = 1;
+ do {
+ d16 = +HEAPF32[i1 + (i13 << 3) + 20 >> 2];
+ d14 = +HEAPF32[i1 + (i13 << 3) + 24 >> 2];
+ d15 = d6 + (d4 * d16 - d5 * d14);
+ d14 = d16 * d5 + d4 * d14 + d8;
+ d10 = d10 < d15 ? d10 : d15;
+ d11 = d11 < d14 ? d11 : d14;
+ d9 = d9 > d15 ? d9 : d15;
+ d12 = d12 > d14 ? d12 : d14;
+ i13 = i13 + 1 | 0;
+ } while ((i13 | 0) < (i7 | 0));
+ } else {
+ d11 = d12;
+ d10 = d9;
+ }
+ d16 = +HEAPF32[i1 + 8 >> 2];
+ d14 = +(d10 - d16);
+ d15 = +(d11 - d16);
+ i13 = i2;
+ HEAPF32[i13 >> 2] = d14;
+ HEAPF32[i13 + 4 >> 2] = d15;
+ d15 = +(d9 + d16);
+ d16 = +(d12 + d16);
+ i13 = i2 + 8 | 0;
+ HEAPF32[i13 >> 2] = d15;
+ HEAPF32[i13 + 4 >> 2] = d16;
+ STACKTOP = i3;
+ return;
+}
+function __ZNK10__cxxabiv120__si_class_type_info16search_above_dstEPNS_19__dynamic_cast_infoEPKvS4_ib(i5, i1, i4, i6, i3, i7) {
+ i5 = i5 | 0;
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i6 = i6 | 0;
+ i3 = i3 | 0;
+ i7 = i7 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ if ((i5 | 0) != (HEAP32[i1 + 8 >> 2] | 0)) {
+ i5 = HEAP32[i5 + 8 >> 2] | 0;
+ FUNCTION_TABLE_viiiiii[HEAP32[(HEAP32[i5 >> 2] | 0) + 20 >> 2] & 3](i5, i1, i4, i6, i3, i7);
+ STACKTOP = i2;
+ return;
+ }
+ HEAP8[i1 + 53 | 0] = 1;
+ if ((HEAP32[i1 + 4 >> 2] | 0) != (i6 | 0)) {
+ STACKTOP = i2;
+ return;
+ }
+ HEAP8[i1 + 52 | 0] = 1;
+ i5 = i1 + 16 | 0;
+ i6 = HEAP32[i5 >> 2] | 0;
+ if ((i6 | 0) == 0) {
+ HEAP32[i5 >> 2] = i4;
+ HEAP32[i1 + 24 >> 2] = i3;
+ HEAP32[i1 + 36 >> 2] = 1;
+ if (!((HEAP32[i1 + 48 >> 2] | 0) == 1 & (i3 | 0) == 1)) {
+ STACKTOP = i2;
+ return;
+ }
+ HEAP8[i1 + 54 | 0] = 1;
+ STACKTOP = i2;
+ return;
+ }
+ if ((i6 | 0) != (i4 | 0)) {
+ i7 = i1 + 36 | 0;
+ HEAP32[i7 >> 2] = (HEAP32[i7 >> 2] | 0) + 1;
+ HEAP8[i1 + 54 | 0] = 1;
+ STACKTOP = i2;
+ return;
+ }
+ i4 = i1 + 24 | 0;
+ i5 = HEAP32[i4 >> 2] | 0;
+ if ((i5 | 0) == 2) {
+ HEAP32[i4 >> 2] = i3;
+ } else {
+ i3 = i5;
+ }
+ if (!((HEAP32[i1 + 48 >> 2] | 0) == 1 & (i3 | 0) == 1)) {
+ STACKTOP = i2;
+ return;
+ }
+ HEAP8[i1 + 54 | 0] = 1;
+ STACKTOP = i2;
+ return;
+}
+function __ZN6b2Body13CreateFixtureEPK12b2FixtureDef(i1, i5) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i6 = 0;
+ i3 = STACKTOP;
+ i2 = i1 + 88 | 0;
+ i4 = HEAP32[i2 >> 2] | 0;
+ if ((HEAP32[i4 + 102868 >> 2] & 2 | 0) != 0) {
+ ___assert_fail(1776, 1520, 153, 1808);
+ }
+ i6 = __ZN16b2BlockAllocator8AllocateEi(i4, 44) | 0;
+ if ((i6 | 0) == 0) {
+ i6 = 0;
+ } else {
+ __ZN9b2FixtureC2Ev(i6);
+ }
+ __ZN9b2Fixture6CreateEP16b2BlockAllocatorP6b2BodyPK12b2FixtureDef(i6, i4, i1, i5);
+ if (!((HEAP16[i1 + 4 >> 1] & 32) == 0)) {
+ __ZN9b2Fixture13CreateProxiesEP12b2BroadPhaseRK11b2Transform(i6, (HEAP32[i2 >> 2] | 0) + 102872 | 0, i1 + 12 | 0);
+ }
+ i5 = i1 + 100 | 0;
+ HEAP32[i6 + 4 >> 2] = HEAP32[i5 >> 2];
+ HEAP32[i5 >> 2] = i6;
+ i5 = i1 + 104 | 0;
+ HEAP32[i5 >> 2] = (HEAP32[i5 >> 2] | 0) + 1;
+ HEAP32[i6 + 8 >> 2] = i1;
+ if (!(+HEAPF32[i6 >> 2] > 0.0)) {
+ i5 = HEAP32[i2 >> 2] | 0;
+ i5 = i5 + 102868 | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ i4 = i4 | 1;
+ HEAP32[i5 >> 2] = i4;
+ STACKTOP = i3;
+ return i6 | 0;
+ }
+ __ZN6b2Body13ResetMassDataEv(i1);
+ i5 = HEAP32[i2 >> 2] | 0;
+ i5 = i5 + 102868 | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ i4 = i4 | 1;
+ HEAP32[i5 >> 2] = i4;
+ STACKTOP = i3;
+ return i6 | 0;
+}
+function __Z13b2TestOverlapPK7b2ShapeiS1_iRK11b2TransformS4_(i6, i5, i4, i3, i2, i1) {
+ i6 = i6 | 0;
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i7 = 0, i8 = 0, i9 = 0, i10 = 0;
+ i8 = STACKTOP;
+ STACKTOP = STACKTOP + 128 | 0;
+ i9 = i8 + 36 | 0;
+ i10 = i8 + 24 | 0;
+ i7 = i8;
+ HEAP32[i9 + 16 >> 2] = 0;
+ HEAP32[i9 + 20 >> 2] = 0;
+ HEAPF32[i9 + 24 >> 2] = 0.0;
+ HEAP32[i9 + 44 >> 2] = 0;
+ HEAP32[i9 + 48 >> 2] = 0;
+ HEAPF32[i9 + 52 >> 2] = 0.0;
+ __ZN15b2DistanceProxy3SetEPK7b2Shapei(i9, i6, i5);
+ __ZN15b2DistanceProxy3SetEPK7b2Shapei(i9 + 28 | 0, i4, i3);
+ i6 = i9 + 56 | 0;
+ HEAP32[i6 + 0 >> 2] = HEAP32[i2 + 0 >> 2];
+ HEAP32[i6 + 4 >> 2] = HEAP32[i2 + 4 >> 2];
+ HEAP32[i6 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ HEAP32[i6 + 12 >> 2] = HEAP32[i2 + 12 >> 2];
+ i6 = i9 + 72 | 0;
+ HEAP32[i6 + 0 >> 2] = HEAP32[i1 + 0 >> 2];
+ HEAP32[i6 + 4 >> 2] = HEAP32[i1 + 4 >> 2];
+ HEAP32[i6 + 8 >> 2] = HEAP32[i1 + 8 >> 2];
+ HEAP32[i6 + 12 >> 2] = HEAP32[i1 + 12 >> 2];
+ HEAP8[i9 + 88 | 0] = 1;
+ HEAP16[i10 + 4 >> 1] = 0;
+ __Z10b2DistanceP16b2DistanceOutputP14b2SimplexCachePK15b2DistanceInput(i7, i10, i9);
+ STACKTOP = i8;
+ return +HEAPF32[i7 + 16 >> 2] < 11920928955078125.0e-22 | 0;
+}
+function __ZNK10__cxxabiv117__class_type_info16search_above_dstEPNS_19__dynamic_cast_infoEPKvS4_ib(i6, i1, i4, i5, i2, i3) {
+ i6 = i6 | 0;
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ i3 = STACKTOP;
+ if ((HEAP32[i1 + 8 >> 2] | 0) != (i6 | 0)) {
+ STACKTOP = i3;
+ return;
+ }
+ HEAP8[i1 + 53 | 0] = 1;
+ if ((HEAP32[i1 + 4 >> 2] | 0) != (i5 | 0)) {
+ STACKTOP = i3;
+ return;
+ }
+ HEAP8[i1 + 52 | 0] = 1;
+ i5 = i1 + 16 | 0;
+ i6 = HEAP32[i5 >> 2] | 0;
+ if ((i6 | 0) == 0) {
+ HEAP32[i5 >> 2] = i4;
+ HEAP32[i1 + 24 >> 2] = i2;
+ HEAP32[i1 + 36 >> 2] = 1;
+ if (!((HEAP32[i1 + 48 >> 2] | 0) == 1 & (i2 | 0) == 1)) {
+ STACKTOP = i3;
+ return;
+ }
+ HEAP8[i1 + 54 | 0] = 1;
+ STACKTOP = i3;
+ return;
+ }
+ if ((i6 | 0) != (i4 | 0)) {
+ i6 = i1 + 36 | 0;
+ HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + 1;
+ HEAP8[i1 + 54 | 0] = 1;
+ STACKTOP = i3;
+ return;
+ }
+ i4 = i1 + 24 | 0;
+ i5 = HEAP32[i4 >> 2] | 0;
+ if ((i5 | 0) == 2) {
+ HEAP32[i4 >> 2] = i2;
+ } else {
+ i2 = i5;
+ }
+ if (!((HEAP32[i1 + 48 >> 2] | 0) == 1 & (i2 | 0) == 1)) {
+ STACKTOP = i3;
+ return;
+ }
+ HEAP8[i1 + 54 | 0] = 1;
+ STACKTOP = i3;
+ return;
+}
+function __ZNK11b2EdgeShape5CloneEP16b2BlockAllocator(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i2 = STACKTOP;
+ i3 = __ZN16b2BlockAllocator8AllocateEi(i3, 48) | 0;
+ if ((i3 | 0) == 0) {
+ i3 = 0;
+ } else {
+ HEAP32[i3 >> 2] = 240;
+ HEAP32[i3 + 4 >> 2] = 1;
+ HEAPF32[i3 + 8 >> 2] = .009999999776482582;
+ i4 = i3 + 28 | 0;
+ HEAP32[i4 + 0 >> 2] = 0;
+ HEAP32[i4 + 4 >> 2] = 0;
+ HEAP32[i4 + 8 >> 2] = 0;
+ HEAP32[i4 + 12 >> 2] = 0;
+ HEAP16[i4 + 16 >> 1] = 0;
+ }
+ i6 = i1 + 4 | 0;
+ i5 = HEAP32[i6 + 4 >> 2] | 0;
+ i4 = i3 + 4 | 0;
+ HEAP32[i4 >> 2] = HEAP32[i6 >> 2];
+ HEAP32[i4 + 4 >> 2] = i5;
+ i4 = i3 + 12 | 0;
+ i1 = i1 + 12 | 0;
+ HEAP32[i4 + 0 >> 2] = HEAP32[i1 + 0 >> 2];
+ HEAP32[i4 + 4 >> 2] = HEAP32[i1 + 4 >> 2];
+ HEAP32[i4 + 8 >> 2] = HEAP32[i1 + 8 >> 2];
+ HEAP32[i4 + 12 >> 2] = HEAP32[i1 + 12 >> 2];
+ HEAP32[i4 + 16 >> 2] = HEAP32[i1 + 16 >> 2];
+ HEAP32[i4 + 20 >> 2] = HEAP32[i1 + 20 >> 2];
+ HEAP32[i4 + 24 >> 2] = HEAP32[i1 + 24 >> 2];
+ HEAP32[i4 + 28 >> 2] = HEAP32[i1 + 28 >> 2];
+ HEAP16[i4 + 32 >> 1] = HEAP16[i1 + 32 >> 1] | 0;
+ STACKTOP = i2;
+ return i3 | 0;
+}
+function __ZN7b2WorldC2ERK6b2Vec2(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i3 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i3 = STACKTOP;
+ __ZN16b2BlockAllocatorC2Ev(i1);
+ __ZN16b2StackAllocatorC2Ev(i1 + 68 | 0);
+ __ZN16b2ContactManagerC2Ev(i1 + 102872 | 0);
+ i6 = i1 + 102968 | 0;
+ HEAP32[i1 + 102980 >> 2] = 0;
+ HEAP32[i1 + 102984 >> 2] = 0;
+ i4 = i1 + 102952 | 0;
+ i5 = i1 + 102992 | 0;
+ HEAP32[i4 + 0 >> 2] = 0;
+ HEAP32[i4 + 4 >> 2] = 0;
+ HEAP32[i4 + 8 >> 2] = 0;
+ HEAP32[i4 + 12 >> 2] = 0;
+ HEAP8[i5] = 1;
+ HEAP8[i1 + 102993 | 0] = 1;
+ HEAP8[i1 + 102994 | 0] = 0;
+ HEAP8[i1 + 102995 | 0] = 1;
+ HEAP8[i1 + 102976 | 0] = 1;
+ i5 = i2;
+ i4 = HEAP32[i5 + 4 >> 2] | 0;
+ i2 = i6;
+ HEAP32[i2 >> 2] = HEAP32[i5 >> 2];
+ HEAP32[i2 + 4 >> 2] = i4;
+ HEAP32[i1 + 102868 >> 2] = 4;
+ HEAPF32[i1 + 102988 >> 2] = 0.0;
+ HEAP32[i1 + 102948 >> 2] = i1;
+ i2 = i1 + 102996 | 0;
+ HEAP32[i2 + 0 >> 2] = 0;
+ HEAP32[i2 + 4 >> 2] = 0;
+ HEAP32[i2 + 8 >> 2] = 0;
+ HEAP32[i2 + 12 >> 2] = 0;
+ HEAP32[i2 + 16 >> 2] = 0;
+ HEAP32[i2 + 20 >> 2] = 0;
+ HEAP32[i2 + 24 >> 2] = 0;
+ HEAP32[i2 + 28 >> 2] = 0;
+ STACKTOP = i3;
+ return;
+}
+function __ZNK10__cxxabiv117__class_type_info16search_below_dstEPNS_19__dynamic_cast_infoEPKvib(i6, i3, i4, i1, i2) {
+ i6 = i6 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i5 = 0;
+ i2 = STACKTOP;
+ if ((HEAP32[i3 + 8 >> 2] | 0) == (i6 | 0)) {
+ if ((HEAP32[i3 + 4 >> 2] | 0) != (i4 | 0)) {
+ STACKTOP = i2;
+ return;
+ }
+ i3 = i3 + 28 | 0;
+ if ((HEAP32[i3 >> 2] | 0) == 1) {
+ STACKTOP = i2;
+ return;
+ }
+ HEAP32[i3 >> 2] = i1;
+ STACKTOP = i2;
+ return;
+ }
+ if ((HEAP32[i3 >> 2] | 0) != (i6 | 0)) {
+ STACKTOP = i2;
+ return;
+ }
+ if ((HEAP32[i3 + 16 >> 2] | 0) != (i4 | 0) ? (i5 = i3 + 20 | 0, (HEAP32[i5 >> 2] | 0) != (i4 | 0)) : 0) {
+ HEAP32[i3 + 32 >> 2] = i1;
+ HEAP32[i5 >> 2] = i4;
+ i6 = i3 + 40 | 0;
+ HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + 1;
+ if ((HEAP32[i3 + 36 >> 2] | 0) == 1 ? (HEAP32[i3 + 24 >> 2] | 0) == 2 : 0) {
+ HEAP8[i3 + 54 | 0] = 1;
+ }
+ HEAP32[i3 + 44 >> 2] = 4;
+ STACKTOP = i2;
+ return;
+ }
+ if ((i1 | 0) != 1) {
+ STACKTOP = i2;
+ return;
+ }
+ HEAP32[i3 + 32 >> 2] = 1;
+ STACKTOP = i2;
+ return;
+}
+function __ZN9b2Contact7DestroyEPS_P16b2BlockAllocator(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0;
+ i3 = STACKTOP;
+ if ((HEAP8[4200] | 0) == 0) {
+ ___assert_fail(4352, 4256, 103, 4376);
+ }
+ i4 = HEAP32[i1 + 48 >> 2] | 0;
+ if ((HEAP32[i1 + 124 >> 2] | 0) > 0) {
+ i7 = HEAP32[i4 + 8 >> 2] | 0;
+ i6 = i7 + 4 | 0;
+ i5 = HEAPU16[i6 >> 1] | 0;
+ if ((i5 & 2 | 0) == 0) {
+ HEAP16[i6 >> 1] = i5 | 2;
+ HEAPF32[i7 + 144 >> 2] = 0.0;
+ }
+ i7 = HEAP32[i1 + 52 >> 2] | 0;
+ i6 = HEAP32[i7 + 8 >> 2] | 0;
+ i5 = i6 + 4 | 0;
+ i8 = HEAPU16[i5 >> 1] | 0;
+ if ((i8 & 2 | 0) == 0) {
+ HEAP16[i5 >> 1] = i8 | 2;
+ HEAPF32[i6 + 144 >> 2] = 0.0;
+ }
+ } else {
+ i7 = HEAP32[i1 + 52 >> 2] | 0;
+ }
+ i4 = HEAP32[(HEAP32[i4 + 12 >> 2] | 0) + 4 >> 2] | 0;
+ i5 = HEAP32[(HEAP32[i7 + 12 >> 2] | 0) + 4 >> 2] | 0;
+ if ((i4 | 0) > -1 & (i5 | 0) < 4) {
+ FUNCTION_TABLE_vii[HEAP32[4008 + (i4 * 48 | 0) + (i5 * 12 | 0) + 4 >> 2] & 15](i1, i2);
+ STACKTOP = i3;
+ return;
+ } else {
+ ___assert_fail(4384, 4256, 114, 4376);
+ }
+}
+function __ZN9b2Fixture13CreateProxiesEP12b2BroadPhaseRK11b2Transform(i5, i4, i1) {
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0;
+ i2 = STACKTOP;
+ i3 = i5 + 28 | 0;
+ if ((HEAP32[i3 >> 2] | 0) != 0) {
+ ___assert_fail(2088, 2112, 124, 2144);
+ }
+ i6 = i5 + 12 | 0;
+ i8 = HEAP32[i6 >> 2] | 0;
+ i8 = FUNCTION_TABLE_ii[HEAP32[(HEAP32[i8 >> 2] | 0) + 12 >> 2] & 3](i8) | 0;
+ HEAP32[i3 >> 2] = i8;
+ if ((i8 | 0) <= 0) {
+ STACKTOP = i2;
+ return;
+ }
+ i7 = i5 + 24 | 0;
+ i8 = 0;
+ do {
+ i9 = HEAP32[i7 >> 2] | 0;
+ i10 = i9 + (i8 * 28 | 0) | 0;
+ i11 = HEAP32[i6 >> 2] | 0;
+ FUNCTION_TABLE_viiii[HEAP32[(HEAP32[i11 >> 2] | 0) + 24 >> 2] & 15](i11, i10, i1, i8);
+ HEAP32[i9 + (i8 * 28 | 0) + 24 >> 2] = __ZN12b2BroadPhase11CreateProxyERK6b2AABBPv(i4, i10, i10) | 0;
+ HEAP32[i9 + (i8 * 28 | 0) + 16 >> 2] = i5;
+ HEAP32[i9 + (i8 * 28 | 0) + 20 >> 2] = i8;
+ i8 = i8 + 1 | 0;
+ } while ((i8 | 0) < (HEAP32[i3 >> 2] | 0));
+ STACKTOP = i2;
+ return;
+}
+function __ZNK10__cxxabiv117__class_type_info9can_catchEPKNS_16__shim_type_infoERPv(i1, i5, i4) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ var i2 = 0, i3 = 0, i6 = 0, i7 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 64 | 0;
+ i3 = i2;
+ if ((i1 | 0) == (i5 | 0)) {
+ i7 = 1;
+ STACKTOP = i2;
+ return i7 | 0;
+ }
+ if ((i5 | 0) == 0) {
+ i7 = 0;
+ STACKTOP = i2;
+ return i7 | 0;
+ }
+ i5 = ___dynamic_cast(i5, 6952, 7008, 0) | 0;
+ if ((i5 | 0) == 0) {
+ i7 = 0;
+ STACKTOP = i2;
+ return i7 | 0;
+ }
+ i7 = i3 + 0 | 0;
+ i6 = i7 + 56 | 0;
+ do {
+ HEAP32[i7 >> 2] = 0;
+ i7 = i7 + 4 | 0;
+ } while ((i7 | 0) < (i6 | 0));
+ HEAP32[i3 >> 2] = i5;
+ HEAP32[i3 + 8 >> 2] = i1;
+ HEAP32[i3 + 12 >> 2] = -1;
+ HEAP32[i3 + 48 >> 2] = 1;
+ FUNCTION_TABLE_viiii[HEAP32[(HEAP32[i5 >> 2] | 0) + 28 >> 2] & 15](i5, i3, HEAP32[i4 >> 2] | 0, 1);
+ if ((HEAP32[i3 + 24 >> 2] | 0) != 1) {
+ i7 = 0;
+ STACKTOP = i2;
+ return i7 | 0;
+ }
+ HEAP32[i4 >> 2] = HEAP32[i3 + 16 >> 2];
+ i7 = 1;
+ STACKTOP = i2;
+ return i7 | 0;
+}
+function __ZN8b2IslandC2EiiiP16b2StackAllocatorP17b2ContactListener(i1, i4, i3, i2, i5, i6) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i5 = i5 | 0;
+ i6 = i6 | 0;
+ var i7 = 0, i8 = 0;
+ i7 = STACKTOP;
+ i8 = i1 + 40 | 0;
+ HEAP32[i8 >> 2] = i4;
+ HEAP32[i1 + 44 >> 2] = i3;
+ HEAP32[i1 + 48 >> 2] = i2;
+ HEAP32[i1 + 28 >> 2] = 0;
+ HEAP32[i1 + 36 >> 2] = 0;
+ HEAP32[i1 + 32 >> 2] = 0;
+ HEAP32[i1 >> 2] = i5;
+ HEAP32[i1 + 4 >> 2] = i6;
+ HEAP32[i1 + 8 >> 2] = __ZN16b2StackAllocator8AllocateEi(i5, i4 << 2) | 0;
+ HEAP32[i1 + 12 >> 2] = __ZN16b2StackAllocator8AllocateEi(HEAP32[i1 >> 2] | 0, i3 << 2) | 0;
+ HEAP32[i1 + 16 >> 2] = __ZN16b2StackAllocator8AllocateEi(HEAP32[i1 >> 2] | 0, i2 << 2) | 0;
+ HEAP32[i1 + 24 >> 2] = __ZN16b2StackAllocator8AllocateEi(HEAP32[i1 >> 2] | 0, (HEAP32[i8 >> 2] | 0) * 12 | 0) | 0;
+ HEAP32[i1 + 20 >> 2] = __ZN16b2StackAllocator8AllocateEi(HEAP32[i1 >> 2] | 0, (HEAP32[i8 >> 2] | 0) * 12 | 0) | 0;
+ STACKTOP = i7;
+ return;
+}
+function __ZNK11b2EdgeShape11ComputeAABBEP6b2AABBRK11b2Transformi(i8, i1, i10, i2) {
+ i8 = i8 | 0;
+ i1 = i1 | 0;
+ i10 = i10 | 0;
+ i2 = i2 | 0;
+ var d3 = 0.0, d4 = 0.0, d5 = 0.0, d6 = 0.0, d7 = 0.0, d9 = 0.0, d11 = 0.0, d12 = 0.0;
+ i2 = STACKTOP;
+ d7 = +HEAPF32[i10 + 12 >> 2];
+ d9 = +HEAPF32[i8 + 12 >> 2];
+ d11 = +HEAPF32[i10 + 8 >> 2];
+ d3 = +HEAPF32[i8 + 16 >> 2];
+ d6 = +HEAPF32[i10 >> 2];
+ d5 = d6 + (d7 * d9 - d11 * d3);
+ d12 = +HEAPF32[i10 + 4 >> 2];
+ d3 = d9 * d11 + d7 * d3 + d12;
+ d9 = +HEAPF32[i8 + 20 >> 2];
+ d4 = +HEAPF32[i8 + 24 >> 2];
+ d6 = d6 + (d7 * d9 - d11 * d4);
+ d4 = d12 + (d11 * d9 + d7 * d4);
+ d7 = +HEAPF32[i8 + 8 >> 2];
+ d9 = +((d5 < d6 ? d5 : d6) - d7);
+ d12 = +((d3 < d4 ? d3 : d4) - d7);
+ i10 = i1;
+ HEAPF32[i10 >> 2] = d9;
+ HEAPF32[i10 + 4 >> 2] = d12;
+ d5 = +(d7 + (d5 > d6 ? d5 : d6));
+ d12 = +(d7 + (d3 > d4 ? d3 : d4));
+ i10 = i1 + 8 | 0;
+ HEAPF32[i10 >> 2] = d5;
+ HEAPF32[i10 + 4 >> 2] = d12;
+ STACKTOP = i2;
+ return;
+}
+function __ZNK14b2PolygonShape9TestPointERK11b2TransformRK6b2Vec2(i2, i3, i6) {
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ i6 = i6 | 0;
+ var i1 = 0, d4 = 0.0, d5 = 0.0, i7 = 0, d8 = 0.0, d9 = 0.0, d10 = 0.0;
+ i1 = STACKTOP;
+ d8 = +HEAPF32[i6 >> 2] - +HEAPF32[i3 >> 2];
+ d9 = +HEAPF32[i6 + 4 >> 2] - +HEAPF32[i3 + 4 >> 2];
+ d10 = +HEAPF32[i3 + 12 >> 2];
+ d5 = +HEAPF32[i3 + 8 >> 2];
+ d4 = d8 * d10 + d9 * d5;
+ d5 = d10 * d9 - d8 * d5;
+ i3 = HEAP32[i2 + 148 >> 2] | 0;
+ if ((i3 | 0) > 0) {
+ i6 = 0;
+ } else {
+ i7 = 1;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ while (1) {
+ i7 = i6 + 1 | 0;
+ if ((d4 - +HEAPF32[i2 + (i6 << 3) + 20 >> 2]) * +HEAPF32[i2 + (i6 << 3) + 84 >> 2] + (d5 - +HEAPF32[i2 + (i6 << 3) + 24 >> 2]) * +HEAPF32[i2 + (i6 << 3) + 88 >> 2] > 0.0) {
+ i3 = 0;
+ i2 = 4;
+ break;
+ }
+ if ((i7 | 0) < (i3 | 0)) {
+ i6 = i7;
+ } else {
+ i3 = 1;
+ i2 = 4;
+ break;
+ }
+ }
+ if ((i2 | 0) == 4) {
+ STACKTOP = i1;
+ return i3 | 0;
+ }
+ return 0;
+}
+function __ZN16b2StackAllocator8AllocateEi(i4, i5) {
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i6 = 0, i7 = 0, i8 = 0;
+ i2 = STACKTOP;
+ i3 = i4 + 102796 | 0;
+ i6 = HEAP32[i3 >> 2] | 0;
+ if ((i6 | 0) >= 32) {
+ ___assert_fail(3896, 3808, 38, 3936);
+ }
+ i1 = i4 + (i6 * 12 | 0) + 102412 | 0;
+ HEAP32[i4 + (i6 * 12 | 0) + 102416 >> 2] = i5;
+ i7 = i4 + 102400 | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ if ((i8 + i5 | 0) > 102400) {
+ HEAP32[i1 >> 2] = __Z7b2Alloci(i5) | 0;
+ HEAP8[i4 + (i6 * 12 | 0) + 102420 | 0] = 1;
+ } else {
+ HEAP32[i1 >> 2] = i4 + i8;
+ HEAP8[i4 + (i6 * 12 | 0) + 102420 | 0] = 0;
+ HEAP32[i7 >> 2] = (HEAP32[i7 >> 2] | 0) + i5;
+ }
+ i6 = i4 + 102404 | 0;
+ i5 = (HEAP32[i6 >> 2] | 0) + i5 | 0;
+ HEAP32[i6 >> 2] = i5;
+ i4 = i4 + 102408 | 0;
+ i6 = HEAP32[i4 >> 2] | 0;
+ HEAP32[i4 >> 2] = (i6 | 0) > (i5 | 0) ? i6 : i5;
+ HEAP32[i3 >> 2] = (HEAP32[i3 >> 2] | 0) + 1;
+ STACKTOP = i2;
+ return HEAP32[i1 >> 2] | 0;
+}
+function __ZN12b2BroadPhase13QueryCallbackEi(i5, i1) {
+ i5 = i5 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0;
+ i2 = STACKTOP;
+ i4 = i5 + 56 | 0;
+ i7 = HEAP32[i4 >> 2] | 0;
+ if ((i7 | 0) == (i1 | 0)) {
+ STACKTOP = i2;
+ return 1;
+ }
+ i3 = i5 + 52 | 0;
+ i6 = HEAP32[i3 >> 2] | 0;
+ i8 = i5 + 48 | 0;
+ i5 = i5 + 44 | 0;
+ if ((i6 | 0) == (HEAP32[i8 >> 2] | 0)) {
+ i7 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i8 >> 2] = i6 << 1;
+ i6 = __Z7b2Alloci(i6 * 24 | 0) | 0;
+ HEAP32[i5 >> 2] = i6;
+ _memcpy(i6 | 0, i7 | 0, (HEAP32[i3 >> 2] | 0) * 12 | 0) | 0;
+ __Z6b2FreePv(i7);
+ i7 = HEAP32[i4 >> 2] | 0;
+ i6 = HEAP32[i3 >> 2] | 0;
+ }
+ i5 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 + (i6 * 12 | 0) >> 2] = (i7 | 0) > (i1 | 0) ? i1 : i7;
+ i4 = HEAP32[i4 >> 2] | 0;
+ HEAP32[i5 + ((HEAP32[i3 >> 2] | 0) * 12 | 0) + 4 >> 2] = (i4 | 0) < (i1 | 0) ? i1 : i4;
+ HEAP32[i3 >> 2] = (HEAP32[i3 >> 2] | 0) + 1;
+ STACKTOP = i2;
+ return 1;
+}
+function __ZNK10__cxxabiv120__si_class_type_info27has_unambiguous_public_baseEPNS_19__dynamic_cast_infoEPvi(i5, i4, i3, i1) {
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i6 = 0;
+ i2 = STACKTOP;
+ if ((i5 | 0) != (HEAP32[i4 + 8 >> 2] | 0)) {
+ i6 = HEAP32[i5 + 8 >> 2] | 0;
+ FUNCTION_TABLE_viiii[HEAP32[(HEAP32[i6 >> 2] | 0) + 28 >> 2] & 15](i6, i4, i3, i1);
+ STACKTOP = i2;
+ return;
+ }
+ i5 = i4 + 16 | 0;
+ i6 = HEAP32[i5 >> 2] | 0;
+ if ((i6 | 0) == 0) {
+ HEAP32[i5 >> 2] = i3;
+ HEAP32[i4 + 24 >> 2] = i1;
+ HEAP32[i4 + 36 >> 2] = 1;
+ STACKTOP = i2;
+ return;
+ }
+ if ((i6 | 0) != (i3 | 0)) {
+ i6 = i4 + 36 | 0;
+ HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + 1;
+ HEAP32[i4 + 24 >> 2] = 2;
+ HEAP8[i4 + 54 | 0] = 1;
+ STACKTOP = i2;
+ return;
+ }
+ i3 = i4 + 24 | 0;
+ if ((HEAP32[i3 >> 2] | 0) != 2) {
+ STACKTOP = i2;
+ return;
+ }
+ HEAP32[i3 >> 2] = i1;
+ STACKTOP = i2;
+ return;
+}
+function __ZN6b2Body19SynchronizeFixturesEv(i5) {
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, d6 = 0.0, d7 = 0.0, d8 = 0.0, d9 = 0.0, d10 = 0.0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i1;
+ d8 = +HEAPF32[i5 + 52 >> 2];
+ d9 = +Math_sin(+d8);
+ HEAPF32[i3 + 8 >> 2] = d9;
+ d8 = +Math_cos(+d8);
+ HEAPF32[i3 + 12 >> 2] = d8;
+ d10 = +HEAPF32[i5 + 28 >> 2];
+ d6 = +HEAPF32[i5 + 32 >> 2];
+ d7 = +(+HEAPF32[i5 + 36 >> 2] - (d8 * d10 - d9 * d6));
+ d6 = +(+HEAPF32[i5 + 40 >> 2] - (d10 * d9 + d8 * d6));
+ i2 = i3;
+ HEAPF32[i2 >> 2] = d7;
+ HEAPF32[i2 + 4 >> 2] = d6;
+ i2 = (HEAP32[i5 + 88 >> 2] | 0) + 102872 | 0;
+ i4 = HEAP32[i5 + 100 >> 2] | 0;
+ if ((i4 | 0) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i5 = i5 + 12 | 0;
+ do {
+ __ZN9b2Fixture11SynchronizeEP12b2BroadPhaseRK11b2TransformS4_(i4, i2, i3, i5);
+ i4 = HEAP32[i4 + 4 >> 2] | 0;
+ } while ((i4 | 0) != 0);
+ STACKTOP = i1;
+ return;
+}
+function __ZN13b2DynamicTreeC2Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i4 = STACKTOP;
+ HEAP32[i1 >> 2] = -1;
+ i3 = i1 + 12 | 0;
+ HEAP32[i3 >> 2] = 16;
+ HEAP32[i1 + 8 >> 2] = 0;
+ i6 = __Z7b2Alloci(576) | 0;
+ i2 = i1 + 4 | 0;
+ HEAP32[i2 >> 2] = i6;
+ _memset(i6 | 0, 0, (HEAP32[i3 >> 2] | 0) * 36 | 0) | 0;
+ i6 = (HEAP32[i3 >> 2] | 0) + -1 | 0;
+ i2 = HEAP32[i2 >> 2] | 0;
+ if ((i6 | 0) > 0) {
+ i6 = 0;
+ while (1) {
+ i5 = i6 + 1 | 0;
+ HEAP32[i2 + (i6 * 36 | 0) + 20 >> 2] = i5;
+ HEAP32[i2 + (i6 * 36 | 0) + 32 >> 2] = -1;
+ i6 = (HEAP32[i3 >> 2] | 0) + -1 | 0;
+ if ((i5 | 0) < (i6 | 0)) {
+ i6 = i5;
+ } else {
+ break;
+ }
+ }
+ }
+ HEAP32[i2 + (i6 * 36 | 0) + 20 >> 2] = -1;
+ HEAP32[i2 + (((HEAP32[i3 >> 2] | 0) + -1 | 0) * 36 | 0) + 32 >> 2] = -1;
+ HEAP32[i1 + 16 >> 2] = 0;
+ HEAP32[i1 + 20 >> 2] = 0;
+ HEAP32[i1 + 24 >> 2] = 0;
+ STACKTOP = i4;
+ return;
+}
+function __Z7measurePl(i1, i9) {
+ i1 = i1 | 0;
+ i9 = i9 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, d5 = 0.0, d6 = 0.0, i7 = 0, d8 = 0.0, i10 = 0, d11 = 0.0;
+ i2 = STACKTOP;
+ i3 = HEAP32[4] | 0;
+ i4 = STACKTOP;
+ STACKTOP = STACKTOP + ((4 * i3 | 0) + 15 & -16) | 0;
+ i7 = (i3 | 0) > 0;
+ if (i7) {
+ i10 = 0;
+ d6 = 0.0;
+ do {
+ d8 = +(HEAP32[i9 + (i10 << 2) >> 2] | 0) / 1.0e6 * 1.0e3;
+ HEAPF32[i4 + (i10 << 2) >> 2] = d8;
+ d6 = d6 + d8;
+ i10 = i10 + 1 | 0;
+ } while ((i10 | 0) < (i3 | 0));
+ d5 = +(i3 | 0);
+ d6 = d6 / d5;
+ HEAPF32[i1 >> 2] = d6;
+ if (i7) {
+ i7 = 0;
+ d8 = 0.0;
+ do {
+ d11 = +HEAPF32[i4 + (i7 << 2) >> 2] - d6;
+ d8 = d8 + d11 * d11;
+ i7 = i7 + 1 | 0;
+ } while ((i7 | 0) < (i3 | 0));
+ } else {
+ d8 = 0.0;
+ }
+ } else {
+ d5 = +(i3 | 0);
+ HEAPF32[i1 >> 2] = 0.0 / d5;
+ d8 = 0.0;
+ }
+ HEAPF32[i1 + 4 >> 2] = +Math_sqrt(+(d8 / d5));
+ STACKTOP = i2;
+ return;
+}
+function __ZN13b2DynamicTree11CreateProxyERK6b2AABBPv(i1, i3, i2) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ var i4 = 0, i5 = 0, i6 = 0, d7 = 0.0, d8 = 0.0, i9 = 0;
+ i5 = STACKTOP;
+ i4 = __ZN13b2DynamicTree12AllocateNodeEv(i1) | 0;
+ i6 = i1 + 4 | 0;
+ d7 = +(+HEAPF32[i3 >> 2] + -.10000000149011612);
+ d8 = +(+HEAPF32[i3 + 4 >> 2] + -.10000000149011612);
+ i9 = (HEAP32[i6 >> 2] | 0) + (i4 * 36 | 0) | 0;
+ HEAPF32[i9 >> 2] = d7;
+ HEAPF32[i9 + 4 >> 2] = d8;
+ d8 = +(+HEAPF32[i3 + 8 >> 2] + .10000000149011612);
+ d7 = +(+HEAPF32[i3 + 12 >> 2] + .10000000149011612);
+ i3 = (HEAP32[i6 >> 2] | 0) + (i4 * 36 | 0) + 8 | 0;
+ HEAPF32[i3 >> 2] = d8;
+ HEAPF32[i3 + 4 >> 2] = d7;
+ HEAP32[(HEAP32[i6 >> 2] | 0) + (i4 * 36 | 0) + 16 >> 2] = i2;
+ HEAP32[(HEAP32[i6 >> 2] | 0) + (i4 * 36 | 0) + 32 >> 2] = 0;
+ __ZN13b2DynamicTree10InsertLeafEi(i1, i4);
+ STACKTOP = i5;
+ return i4 | 0;
+}
+function __ZN16b2BlockAllocatorC2Ev(i3) {
+ i3 = i3 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i5 = 0;
+ i2 = STACKTOP;
+ i4 = i3 + 8 | 0;
+ HEAP32[i4 >> 2] = 128;
+ HEAP32[i3 + 4 >> 2] = 0;
+ i5 = __Z7b2Alloci(1024) | 0;
+ HEAP32[i3 >> 2] = i5;
+ _memset(i5 | 0, 0, HEAP32[i4 >> 2] << 3 | 0) | 0;
+ i4 = i3 + 12 | 0;
+ i3 = i4 + 56 | 0;
+ do {
+ HEAP32[i4 >> 2] = 0;
+ i4 = i4 + 4 | 0;
+ } while ((i4 | 0) < (i3 | 0));
+ if ((HEAP8[1280] | 0) == 0) {
+ i3 = 1;
+ i4 = 0;
+ } else {
+ STACKTOP = i2;
+ return;
+ }
+ do {
+ if ((i4 | 0) >= 14) {
+ i1 = 3;
+ break;
+ }
+ if ((i3 | 0) > (HEAP32[576 + (i4 << 2) >> 2] | 0)) {
+ i4 = i4 + 1 | 0;
+ HEAP8[632 + i3 | 0] = i4;
+ } else {
+ HEAP8[632 + i3 | 0] = i4;
+ }
+ i3 = i3 + 1 | 0;
+ } while ((i3 | 0) < 641);
+ if ((i1 | 0) == 3) {
+ ___assert_fail(1288, 1312, 73, 1352);
+ }
+ HEAP8[1280] = 1;
+ STACKTOP = i2;
+ return;
+}
+function __ZN24b2ChainAndPolygonContact8EvaluateEP10b2ManifoldRK11b2TransformS4_(i2, i4, i3, i1) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ var i5 = 0, i6 = 0, i7 = 0, i8 = 0;
+ i5 = STACKTOP;
+ STACKTOP = STACKTOP + 48 | 0;
+ i6 = i5;
+ i7 = HEAP32[(HEAP32[i2 + 48 >> 2] | 0) + 12 >> 2] | 0;
+ HEAP32[i6 >> 2] = 240;
+ HEAP32[i6 + 4 >> 2] = 1;
+ HEAPF32[i6 + 8 >> 2] = .009999999776482582;
+ i8 = i6 + 28 | 0;
+ HEAP32[i8 + 0 >> 2] = 0;
+ HEAP32[i8 + 4 >> 2] = 0;
+ HEAP32[i8 + 8 >> 2] = 0;
+ HEAP32[i8 + 12 >> 2] = 0;
+ HEAP16[i8 + 16 >> 1] = 0;
+ __ZNK12b2ChainShape12GetChildEdgeEP11b2EdgeShapei(i7, i6, HEAP32[i2 + 56 >> 2] | 0);
+ __Z23b2CollideEdgeAndPolygonP10b2ManifoldPK11b2EdgeShapeRK11b2TransformPK14b2PolygonShapeS6_(i4, i6, i3, HEAP32[(HEAP32[i2 + 52 >> 2] | 0) + 12 >> 2] | 0, i1);
+ STACKTOP = i5;
+ return;
+}
+function __ZN23b2ChainAndCircleContact8EvaluateEP10b2ManifoldRK11b2TransformS4_(i2, i4, i3, i1) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ var i5 = 0, i6 = 0, i7 = 0, i8 = 0;
+ i5 = STACKTOP;
+ STACKTOP = STACKTOP + 48 | 0;
+ i6 = i5;
+ i7 = HEAP32[(HEAP32[i2 + 48 >> 2] | 0) + 12 >> 2] | 0;
+ HEAP32[i6 >> 2] = 240;
+ HEAP32[i6 + 4 >> 2] = 1;
+ HEAPF32[i6 + 8 >> 2] = .009999999776482582;
+ i8 = i6 + 28 | 0;
+ HEAP32[i8 + 0 >> 2] = 0;
+ HEAP32[i8 + 4 >> 2] = 0;
+ HEAP32[i8 + 8 >> 2] = 0;
+ HEAP32[i8 + 12 >> 2] = 0;
+ HEAP16[i8 + 16 >> 1] = 0;
+ __ZNK12b2ChainShape12GetChildEdgeEP11b2EdgeShapei(i7, i6, HEAP32[i2 + 56 >> 2] | 0);
+ __Z22b2CollideEdgeAndCircleP10b2ManifoldPK11b2EdgeShapeRK11b2TransformPK13b2CircleShapeS6_(i4, i6, i3, HEAP32[(HEAP32[i2 + 52 >> 2] | 0) + 12 >> 2] | 0, i1);
+ STACKTOP = i5;
+ return;
+}
+function __ZN15b2ContactSolver13StoreImpulsesEv(i4) {
+ i4 = i4 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0;
+ i1 = STACKTOP;
+ i2 = HEAP32[i4 + 48 >> 2] | 0;
+ if ((i2 | 0) <= 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i3 = HEAP32[i4 + 40 >> 2] | 0;
+ i4 = HEAP32[i4 + 44 >> 2] | 0;
+ i5 = 0;
+ do {
+ i6 = HEAP32[i4 + (HEAP32[i3 + (i5 * 152 | 0) + 148 >> 2] << 2) >> 2] | 0;
+ i7 = HEAP32[i3 + (i5 * 152 | 0) + 144 >> 2] | 0;
+ if ((i7 | 0) > 0) {
+ i8 = 0;
+ do {
+ HEAPF32[i6 + (i8 * 20 | 0) + 72 >> 2] = +HEAPF32[i3 + (i5 * 152 | 0) + (i8 * 36 | 0) + 16 >> 2];
+ HEAPF32[i6 + (i8 * 20 | 0) + 76 >> 2] = +HEAPF32[i3 + (i5 * 152 | 0) + (i8 * 36 | 0) + 20 >> 2];
+ i8 = i8 + 1 | 0;
+ } while ((i8 | 0) < (i7 | 0));
+ }
+ i5 = i5 + 1 | 0;
+ } while ((i5 | 0) < (i2 | 0));
+ STACKTOP = i1;
+ return;
+}
+function __ZN16b2StackAllocator4FreeEPv(i1, i5) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i6 = 0;
+ i3 = STACKTOP;
+ i2 = i1 + 102796 | 0;
+ i4 = HEAP32[i2 >> 2] | 0;
+ if ((i4 | 0) <= 0) {
+ ___assert_fail(3952, 3808, 63, 3976);
+ }
+ i6 = i4 + -1 | 0;
+ if ((HEAP32[i1 + (i6 * 12 | 0) + 102412 >> 2] | 0) != (i5 | 0)) {
+ ___assert_fail(3984, 3808, 65, 3976);
+ }
+ if ((HEAP8[i1 + (i6 * 12 | 0) + 102420 | 0] | 0) == 0) {
+ i5 = i1 + (i6 * 12 | 0) + 102416 | 0;
+ i6 = i1 + 102400 | 0;
+ HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) - (HEAP32[i5 >> 2] | 0);
+ } else {
+ __Z6b2FreePv(i5);
+ i5 = i1 + (i6 * 12 | 0) + 102416 | 0;
+ i4 = HEAP32[i2 >> 2] | 0;
+ }
+ i6 = i1 + 102404 | 0;
+ HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) - (HEAP32[i5 >> 2] | 0);
+ HEAP32[i2 >> 2] = i4 + -1;
+ STACKTOP = i3;
+ return;
+}
+function __ZNK10__cxxabiv117__class_type_info27has_unambiguous_public_baseEPNS_19__dynamic_cast_infoEPvi(i5, i4, i3, i2) {
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ var i1 = 0, i6 = 0;
+ i1 = STACKTOP;
+ if ((HEAP32[i4 + 8 >> 2] | 0) != (i5 | 0)) {
+ STACKTOP = i1;
+ return;
+ }
+ i5 = i4 + 16 | 0;
+ i6 = HEAP32[i5 >> 2] | 0;
+ if ((i6 | 0) == 0) {
+ HEAP32[i5 >> 2] = i3;
+ HEAP32[i4 + 24 >> 2] = i2;
+ HEAP32[i4 + 36 >> 2] = 1;
+ STACKTOP = i1;
+ return;
+ }
+ if ((i6 | 0) != (i3 | 0)) {
+ i6 = i4 + 36 | 0;
+ HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + 1;
+ HEAP32[i4 + 24 >> 2] = 2;
+ HEAP8[i4 + 54 | 0] = 1;
+ STACKTOP = i1;
+ return;
+ }
+ i3 = i4 + 24 | 0;
+ if ((HEAP32[i3 >> 2] | 0) != 2) {
+ STACKTOP = i1;
+ return;
+ }
+ HEAP32[i3 >> 2] = i2;
+ STACKTOP = i1;
+ return;
+}
+function __ZN12b2BroadPhase11CreateProxyERK6b2AABBPv(i2, i4, i3) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ var i1 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i1 = STACKTOP;
+ i3 = __ZN13b2DynamicTree11CreateProxyERK6b2AABBPv(i2, i4, i3) | 0;
+ i4 = i2 + 28 | 0;
+ HEAP32[i4 >> 2] = (HEAP32[i4 >> 2] | 0) + 1;
+ i4 = i2 + 40 | 0;
+ i5 = HEAP32[i4 >> 2] | 0;
+ i6 = i2 + 36 | 0;
+ i2 = i2 + 32 | 0;
+ if ((i5 | 0) == (HEAP32[i6 >> 2] | 0)) {
+ i7 = HEAP32[i2 >> 2] | 0;
+ HEAP32[i6 >> 2] = i5 << 1;
+ i5 = __Z7b2Alloci(i5 << 3) | 0;
+ HEAP32[i2 >> 2] = i5;
+ _memcpy(i5 | 0, i7 | 0, HEAP32[i4 >> 2] << 2 | 0) | 0;
+ __Z6b2FreePv(i7);
+ i5 = HEAP32[i4 >> 2] | 0;
+ }
+ HEAP32[(HEAP32[i2 >> 2] | 0) + (i5 << 2) >> 2] = i3;
+ HEAP32[i4 >> 2] = (HEAP32[i4 >> 2] | 0) + 1;
+ STACKTOP = i1;
+ return i3 | 0;
+}
+function __ZN9b2ContactC2EP9b2FixtureiS1_i(i1, i4, i6, i3, i5) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i6 = i6 | 0;
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i7 = 0, d8 = 0.0, d9 = 0.0;
+ i2 = STACKTOP;
+ HEAP32[i1 >> 2] = 4440;
+ HEAP32[i1 + 4 >> 2] = 4;
+ HEAP32[i1 + 48 >> 2] = i4;
+ HEAP32[i1 + 52 >> 2] = i3;
+ HEAP32[i1 + 56 >> 2] = i6;
+ HEAP32[i1 + 60 >> 2] = i5;
+ HEAP32[i1 + 124 >> 2] = 0;
+ HEAP32[i1 + 128 >> 2] = 0;
+ i5 = i4 + 16 | 0;
+ i6 = i1 + 8 | 0;
+ i7 = i6 + 40 | 0;
+ do {
+ HEAP32[i6 >> 2] = 0;
+ i6 = i6 + 4 | 0;
+ } while ((i6 | 0) < (i7 | 0));
+ HEAPF32[i1 + 136 >> 2] = +Math_sqrt(+(+HEAPF32[i5 >> 2] * +HEAPF32[i3 + 16 >> 2]));
+ d8 = +HEAPF32[i4 + 20 >> 2];
+ d9 = +HEAPF32[i3 + 20 >> 2];
+ HEAPF32[i1 + 140 >> 2] = d8 > d9 ? d8 : d9;
+ STACKTOP = i2;
+ return;
+}
+function __ZN12b2BroadPhase9MoveProxyEiRK6b2AABBRK6b2Vec2(i3, i1, i5, i4) {
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ var i2 = 0, i6 = 0, i7 = 0;
+ i2 = STACKTOP;
+ if (!(__ZN13b2DynamicTree9MoveProxyEiRK6b2AABBRK6b2Vec2(i3, i1, i5, i4) | 0)) {
+ STACKTOP = i2;
+ return;
+ }
+ i4 = i3 + 40 | 0;
+ i5 = HEAP32[i4 >> 2] | 0;
+ i6 = i3 + 36 | 0;
+ i3 = i3 + 32 | 0;
+ if ((i5 | 0) == (HEAP32[i6 >> 2] | 0)) {
+ i7 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i6 >> 2] = i5 << 1;
+ i5 = __Z7b2Alloci(i5 << 3) | 0;
+ HEAP32[i3 >> 2] = i5;
+ _memcpy(i5 | 0, i7 | 0, HEAP32[i4 >> 2] << 2 | 0) | 0;
+ __Z6b2FreePv(i7);
+ i5 = HEAP32[i4 >> 2] | 0;
+ }
+ HEAP32[(HEAP32[i3 >> 2] | 0) + (i5 << 2) >> 2] = i1;
+ HEAP32[i4 >> 2] = (HEAP32[i4 >> 2] | 0) + 1;
+ STACKTOP = i2;
+ return;
+}
+function __ZN24b2ChainAndPolygonContact6CreateEP9b2FixtureiS1_iP16b2BlockAllocator(i1, i3, i4, i5, i6) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ i6 = i6 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ i6 = __ZN16b2BlockAllocator8AllocateEi(i6, 144) | 0;
+ if ((i6 | 0) == 0) {
+ i6 = 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ __ZN9b2ContactC2EP9b2FixtureiS1_i(i6, i1, i3, i4, i5);
+ HEAP32[i6 >> 2] = 6032;
+ if ((HEAP32[(HEAP32[(HEAP32[i6 + 48 >> 2] | 0) + 12 >> 2] | 0) + 4 >> 2] | 0) != 3) {
+ ___assert_fail(6048, 6096, 43, 6152);
+ }
+ if ((HEAP32[(HEAP32[(HEAP32[i6 + 52 >> 2] | 0) + 12 >> 2] | 0) + 4 >> 2] | 0) == 2) {
+ STACKTOP = i2;
+ return i6 | 0;
+ } else {
+ ___assert_fail(6184, 6096, 44, 6152);
+ }
+ return 0;
+}
+function __ZN23b2ChainAndCircleContact6CreateEP9b2FixtureiS1_iP16b2BlockAllocator(i1, i3, i4, i5, i6) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ i6 = i6 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ i6 = __ZN16b2BlockAllocator8AllocateEi(i6, 144) | 0;
+ if ((i6 | 0) == 0) {
+ i6 = 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ __ZN9b2ContactC2EP9b2FixtureiS1_i(i6, i1, i3, i4, i5);
+ HEAP32[i6 >> 2] = 5784;
+ if ((HEAP32[(HEAP32[(HEAP32[i6 + 48 >> 2] | 0) + 12 >> 2] | 0) + 4 >> 2] | 0) != 3) {
+ ___assert_fail(5800, 5848, 43, 5904);
+ }
+ if ((HEAP32[(HEAP32[(HEAP32[i6 + 52 >> 2] | 0) + 12 >> 2] | 0) + 4 >> 2] | 0) == 0) {
+ STACKTOP = i2;
+ return i6 | 0;
+ } else {
+ ___assert_fail(5928, 5848, 44, 5904);
+ }
+ return 0;
+}
+function __ZN25b2PolygonAndCircleContact6CreateEP9b2FixtureiS1_iP16b2BlockAllocator(i1, i4, i2, i5, i3) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i2 = i2 | 0;
+ i5 = i5 | 0;
+ i3 = i3 | 0;
+ i4 = STACKTOP;
+ i3 = __ZN16b2BlockAllocator8AllocateEi(i3, 144) | 0;
+ if ((i3 | 0) == 0) {
+ i5 = 0;
+ STACKTOP = i4;
+ return i5 | 0;
+ }
+ __ZN9b2ContactC2EP9b2FixtureiS1_i(i3, i1, 0, i2, 0);
+ HEAP32[i3 >> 2] = 4984;
+ if ((HEAP32[(HEAP32[(HEAP32[i3 + 48 >> 2] | 0) + 12 >> 2] | 0) + 4 >> 2] | 0) != 2) {
+ ___assert_fail(5e3, 5048, 41, 5104);
+ }
+ if ((HEAP32[(HEAP32[(HEAP32[i3 + 52 >> 2] | 0) + 12 >> 2] | 0) + 4 >> 2] | 0) == 0) {
+ i5 = i3;
+ STACKTOP = i4;
+ return i5 | 0;
+ } else {
+ ___assert_fail(5136, 5048, 42, 5104);
+ }
+ return 0;
+}
+function __ZN23b2EdgeAndPolygonContact6CreateEP9b2FixtureiS1_iP16b2BlockAllocator(i1, i4, i2, i5, i3) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i2 = i2 | 0;
+ i5 = i5 | 0;
+ i3 = i3 | 0;
+ i4 = STACKTOP;
+ i3 = __ZN16b2BlockAllocator8AllocateEi(i3, 144) | 0;
+ if ((i3 | 0) == 0) {
+ i5 = 0;
+ STACKTOP = i4;
+ return i5 | 0;
+ }
+ __ZN9b2ContactC2EP9b2FixtureiS1_i(i3, i1, 0, i2, 0);
+ HEAP32[i3 >> 2] = 4736;
+ if ((HEAP32[(HEAP32[(HEAP32[i3 + 48 >> 2] | 0) + 12 >> 2] | 0) + 4 >> 2] | 0) != 1) {
+ ___assert_fail(4752, 4800, 41, 4856);
+ }
+ if ((HEAP32[(HEAP32[(HEAP32[i3 + 52 >> 2] | 0) + 12 >> 2] | 0) + 4 >> 2] | 0) == 2) {
+ i5 = i3;
+ STACKTOP = i4;
+ return i5 | 0;
+ } else {
+ ___assert_fail(4880, 4800, 42, 4856);
+ }
+ return 0;
+}
+function __ZN22b2EdgeAndCircleContact6CreateEP9b2FixtureiS1_iP16b2BlockAllocator(i1, i4, i2, i5, i3) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i2 = i2 | 0;
+ i5 = i5 | 0;
+ i3 = i3 | 0;
+ i4 = STACKTOP;
+ i3 = __ZN16b2BlockAllocator8AllocateEi(i3, 144) | 0;
+ if ((i3 | 0) == 0) {
+ i5 = 0;
+ STACKTOP = i4;
+ return i5 | 0;
+ }
+ __ZN9b2ContactC2EP9b2FixtureiS1_i(i3, i1, 0, i2, 0);
+ HEAP32[i3 >> 2] = 4488;
+ if ((HEAP32[(HEAP32[(HEAP32[i3 + 48 >> 2] | 0) + 12 >> 2] | 0) + 4 >> 2] | 0) != 1) {
+ ___assert_fail(4504, 4552, 41, 4608);
+ }
+ if ((HEAP32[(HEAP32[(HEAP32[i3 + 52 >> 2] | 0) + 12 >> 2] | 0) + 4 >> 2] | 0) == 0) {
+ i5 = i3;
+ STACKTOP = i4;
+ return i5 | 0;
+ } else {
+ ___assert_fail(4632, 4552, 42, 4608);
+ }
+ return 0;
+}
+function __ZN14b2PolygonShape8SetAsBoxEff(i1, d3, d2) {
+ i1 = i1 | 0;
+ d3 = +d3;
+ d2 = +d2;
+ var d4 = 0.0, d5 = 0.0;
+ HEAP32[i1 + 148 >> 2] = 4;
+ d4 = -d3;
+ d5 = -d2;
+ HEAPF32[i1 + 20 >> 2] = d4;
+ HEAPF32[i1 + 24 >> 2] = d5;
+ HEAPF32[i1 + 28 >> 2] = d3;
+ HEAPF32[i1 + 32 >> 2] = d5;
+ HEAPF32[i1 + 36 >> 2] = d3;
+ HEAPF32[i1 + 40 >> 2] = d2;
+ HEAPF32[i1 + 44 >> 2] = d4;
+ HEAPF32[i1 + 48 >> 2] = d2;
+ HEAPF32[i1 + 84 >> 2] = 0.0;
+ HEAPF32[i1 + 88 >> 2] = -1.0;
+ HEAPF32[i1 + 92 >> 2] = 1.0;
+ HEAPF32[i1 + 96 >> 2] = 0.0;
+ HEAPF32[i1 + 100 >> 2] = 0.0;
+ HEAPF32[i1 + 104 >> 2] = 1.0;
+ HEAPF32[i1 + 108 >> 2] = -1.0;
+ HEAPF32[i1 + 112 >> 2] = 0.0;
+ HEAPF32[i1 + 12 >> 2] = 0.0;
+ HEAPF32[i1 + 16 >> 2] = 0.0;
+ return;
+}
+function __ZN16b2PolygonContact6CreateEP9b2FixtureiS1_iP16b2BlockAllocator(i1, i4, i2, i5, i3) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i2 = i2 | 0;
+ i5 = i5 | 0;
+ i3 = i3 | 0;
+ i4 = STACKTOP;
+ i3 = __ZN16b2BlockAllocator8AllocateEi(i3, 144) | 0;
+ if ((i3 | 0) == 0) {
+ i5 = 0;
+ STACKTOP = i4;
+ return i5 | 0;
+ }
+ __ZN9b2ContactC2EP9b2FixtureiS1_i(i3, i1, 0, i2, 0);
+ HEAP32[i3 >> 2] = 5240;
+ if ((HEAP32[(HEAP32[(HEAP32[i3 + 48 >> 2] | 0) + 12 >> 2] | 0) + 4 >> 2] | 0) != 2) {
+ ___assert_fail(5256, 5304, 44, 5352);
+ }
+ if ((HEAP32[(HEAP32[(HEAP32[i3 + 52 >> 2] | 0) + 12 >> 2] | 0) + 4 >> 2] | 0) == 2) {
+ i5 = i3;
+ STACKTOP = i4;
+ return i5 | 0;
+ } else {
+ ___assert_fail(5376, 5304, 45, 5352);
+ }
+ return 0;
+}
+function __ZN15b2CircleContact6CreateEP9b2FixtureiS1_iP16b2BlockAllocator(i1, i4, i2, i5, i3) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i2 = i2 | 0;
+ i5 = i5 | 0;
+ i3 = i3 | 0;
+ i4 = STACKTOP;
+ i3 = __ZN16b2BlockAllocator8AllocateEi(i3, 144) | 0;
+ if ((i3 | 0) == 0) {
+ i5 = 0;
+ STACKTOP = i4;
+ return i5 | 0;
+ }
+ __ZN9b2ContactC2EP9b2FixtureiS1_i(i3, i1, 0, i2, 0);
+ HEAP32[i3 >> 2] = 6288;
+ if ((HEAP32[(HEAP32[(HEAP32[i3 + 48 >> 2] | 0) + 12 >> 2] | 0) + 4 >> 2] | 0) != 0) {
+ ___assert_fail(6304, 6352, 44, 6400);
+ }
+ if ((HEAP32[(HEAP32[(HEAP32[i3 + 52 >> 2] | 0) + 12 >> 2] | 0) + 4 >> 2] | 0) == 0) {
+ i5 = i3;
+ STACKTOP = i4;
+ return i5 | 0;
+ } else {
+ ___assert_fail(6416, 6352, 45, 6400);
+ }
+ return 0;
+}
+function __ZN7b2World10CreateBodyEPK9b2BodyDef(i1, i4) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ var i2 = 0, i3 = 0, i5 = 0;
+ i2 = STACKTOP;
+ if ((HEAP32[i1 + 102868 >> 2] & 2 | 0) != 0) {
+ ___assert_fail(2160, 2184, 109, 2216);
+ }
+ i3 = __ZN16b2BlockAllocator8AllocateEi(i1, 152) | 0;
+ if ((i3 | 0) == 0) {
+ i3 = 0;
+ } else {
+ __ZN6b2BodyC2EPK9b2BodyDefP7b2World(i3, i4, i1);
+ }
+ HEAP32[i3 + 92 >> 2] = 0;
+ i4 = i1 + 102952 | 0;
+ HEAP32[i3 + 96 >> 2] = HEAP32[i4 >> 2];
+ i5 = HEAP32[i4 >> 2] | 0;
+ if ((i5 | 0) != 0) {
+ HEAP32[i5 + 92 >> 2] = i3;
+ }
+ HEAP32[i4 >> 2] = i3;
+ i5 = i1 + 102960 | 0;
+ HEAP32[i5 >> 2] = (HEAP32[i5 >> 2] | 0) + 1;
+ STACKTOP = i2;
+ return i3 | 0;
+}
+function __ZNK6b2Body13ShouldCollideEPKS_(i4, i2) {
+ i4 = i4 | 0;
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0;
+ i1 = STACKTOP;
+ if ((HEAP32[i4 >> 2] | 0) != 2 ? (HEAP32[i2 >> 2] | 0) != 2 : 0) {
+ i2 = 0;
+ } else {
+ i3 = 3;
+ }
+ L3 : do {
+ if ((i3 | 0) == 3) {
+ i3 = HEAP32[i4 + 108 >> 2] | 0;
+ if ((i3 | 0) == 0) {
+ i2 = 1;
+ } else {
+ while (1) {
+ if ((HEAP32[i3 >> 2] | 0) == (i2 | 0) ? (HEAP8[(HEAP32[i3 + 4 >> 2] | 0) + 61 | 0] | 0) == 0 : 0) {
+ i2 = 0;
+ break L3;
+ }
+ i3 = HEAP32[i3 + 12 >> 2] | 0;
+ if ((i3 | 0) == 0) {
+ i2 = 1;
+ break;
+ }
+ }
+ }
+ }
+ } while (0);
+ STACKTOP = i1;
+ return i2 | 0;
+}
+function __ZNK14b2PolygonShape5CloneEP16b2BlockAllocator(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i2 = STACKTOP;
+ i3 = __ZN16b2BlockAllocator8AllocateEi(i3, 152) | 0;
+ if ((i3 | 0) == 0) {
+ i3 = 0;
+ } else {
+ HEAP32[i3 >> 2] = 504;
+ HEAP32[i3 + 4 >> 2] = 2;
+ HEAPF32[i3 + 8 >> 2] = .009999999776482582;
+ HEAP32[i3 + 148 >> 2] = 0;
+ HEAPF32[i3 + 12 >> 2] = 0.0;
+ HEAPF32[i3 + 16 >> 2] = 0.0;
+ }
+ i6 = i1 + 4 | 0;
+ i5 = HEAP32[i6 + 4 >> 2] | 0;
+ i4 = i3 + 4 | 0;
+ HEAP32[i4 >> 2] = HEAP32[i6 >> 2];
+ HEAP32[i4 + 4 >> 2] = i5;
+ _memcpy(i3 + 12 | 0, i1 + 12 | 0, 140) | 0;
+ STACKTOP = i2;
+ return i3 | 0;
+}
+function _memcpy(i3, i2, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i4 = 0;
+ if ((i1 | 0) >= 4096) return _emscripten_memcpy_big(i3 | 0, i2 | 0, i1 | 0) | 0;
+ i4 = i3 | 0;
+ if ((i3 & 3) == (i2 & 3)) {
+ while (i3 & 3) {
+ if ((i1 | 0) == 0) return i4 | 0;
+ HEAP8[i3] = HEAP8[i2] | 0;
+ i3 = i3 + 1 | 0;
+ i2 = i2 + 1 | 0;
+ i1 = i1 - 1 | 0;
+ }
+ while ((i1 | 0) >= 4) {
+ HEAP32[i3 >> 2] = HEAP32[i2 >> 2];
+ i3 = i3 + 4 | 0;
+ i2 = i2 + 4 | 0;
+ i1 = i1 - 4 | 0;
+ }
+ }
+ while ((i1 | 0) > 0) {
+ HEAP8[i3] = HEAP8[i2] | 0;
+ i3 = i3 + 1 | 0;
+ i2 = i2 + 1 | 0;
+ i1 = i1 - 1 | 0;
+ }
+ return i4 | 0;
+}
+function __ZN7b2World16SetAllowSleepingEb(i2, i4) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i3 = 0;
+ i1 = STACKTOP;
+ i3 = i2 + 102976 | 0;
+ if ((i4 & 1 | 0) == (HEAPU8[i3] | 0 | 0)) {
+ STACKTOP = i1;
+ return;
+ }
+ HEAP8[i3] = i4 & 1;
+ if (i4) {
+ STACKTOP = i1;
+ return;
+ }
+ i2 = HEAP32[i2 + 102952 >> 2] | 0;
+ if ((i2 | 0) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ do {
+ i3 = i2 + 4 | 0;
+ i4 = HEAPU16[i3 >> 1] | 0;
+ if ((i4 & 2 | 0) == 0) {
+ HEAP16[i3 >> 1] = i4 | 2;
+ HEAPF32[i2 + 144 >> 2] = 0.0;
+ }
+ i2 = HEAP32[i2 + 96 >> 2] | 0;
+ } while ((i2 | 0) != 0);
+ STACKTOP = i1;
+ return;
+}
+function __ZN16b2BlockAllocator4FreeEPvi(i3, i1, i4) {
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ if ((i4 | 0) == 0) {
+ STACKTOP = i2;
+ return;
+ }
+ if ((i4 | 0) <= 0) {
+ ___assert_fail(1376, 1312, 164, 1488);
+ }
+ if ((i4 | 0) > 640) {
+ __Z6b2FreePv(i1);
+ STACKTOP = i2;
+ return;
+ }
+ i4 = HEAP8[632 + i4 | 0] | 0;
+ if (!((i4 & 255) < 14)) {
+ ___assert_fail(1408, 1312, 173, 1488);
+ }
+ i4 = i3 + ((i4 & 255) << 2) + 12 | 0;
+ HEAP32[i1 >> 2] = HEAP32[i4 >> 2];
+ HEAP32[i4 >> 2] = i1;
+ STACKTOP = i2;
+ return;
+}
+function __ZN15b2ContactFilter13ShouldCollideEP9b2FixtureS1_(i3, i2, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i4 = 0;
+ i3 = STACKTOP;
+ i4 = HEAP16[i2 + 36 >> 1] | 0;
+ if (!(i4 << 16 >> 16 != (HEAP16[i1 + 36 >> 1] | 0) | i4 << 16 >> 16 == 0)) {
+ i4 = i4 << 16 >> 16 > 0;
+ STACKTOP = i3;
+ return i4 | 0;
+ }
+ if ((HEAP16[i1 + 32 >> 1] & HEAP16[i2 + 34 >> 1]) << 16 >> 16 == 0) {
+ i4 = 0;
+ STACKTOP = i3;
+ return i4 | 0;
+ }
+ i4 = (HEAP16[i1 + 34 >> 1] & HEAP16[i2 + 32 >> 1]) << 16 >> 16 != 0;
+ STACKTOP = i3;
+ return i4 | 0;
+}
+function _memset(i1, i4, i3) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i2 = i1 + i3 | 0;
+ if ((i3 | 0) >= 20) {
+ i4 = i4 & 255;
+ i7 = i1 & 3;
+ i6 = i4 | i4 << 8 | i4 << 16 | i4 << 24;
+ i5 = i2 & ~3;
+ if (i7) {
+ i7 = i1 + 4 - i7 | 0;
+ while ((i1 | 0) < (i7 | 0)) {
+ HEAP8[i1] = i4;
+ i1 = i1 + 1 | 0;
+ }
+ }
+ while ((i1 | 0) < (i5 | 0)) {
+ HEAP32[i1 >> 2] = i6;
+ i1 = i1 + 4 | 0;
+ }
+ }
+ while ((i1 | 0) < (i2 | 0)) {
+ HEAP8[i1] = i4;
+ i1 = i1 + 1 | 0;
+ }
+ return i1 - i3 | 0;
+}
+function __ZN6b2Body13CreateFixtureEPK7b2Shapef(i1, i3, d2) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ d2 = +d2;
+ var i4 = 0, i5 = 0;
+ i4 = STACKTOP;
+ STACKTOP = STACKTOP + 32 | 0;
+ i5 = i4;
+ HEAP16[i5 + 22 >> 1] = 1;
+ HEAP16[i5 + 24 >> 1] = -1;
+ HEAP16[i5 + 26 >> 1] = 0;
+ HEAP32[i5 + 4 >> 2] = 0;
+ HEAPF32[i5 + 8 >> 2] = .20000000298023224;
+ HEAPF32[i5 + 12 >> 2] = 0.0;
+ HEAP8[i5 + 20 | 0] = 0;
+ HEAP32[i5 >> 2] = i3;
+ HEAPF32[i5 + 16 >> 2] = d2;
+ i3 = __ZN6b2Body13CreateFixtureEPK12b2FixtureDef(i1, i5) | 0;
+ STACKTOP = i4;
+ return i3 | 0;
+}
+function __Znwj(i2) {
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0;
+ i1 = STACKTOP;
+ i2 = (i2 | 0) == 0 ? 1 : i2;
+ while (1) {
+ i3 = _malloc(i2) | 0;
+ if ((i3 | 0) != 0) {
+ i2 = 6;
+ break;
+ }
+ i3 = HEAP32[1914] | 0;
+ HEAP32[1914] = i3 + 0;
+ if ((i3 | 0) == 0) {
+ i2 = 5;
+ break;
+ }
+ FUNCTION_TABLE_v[i3 & 3]();
+ }
+ if ((i2 | 0) == 5) {
+ i3 = ___cxa_allocate_exception(4) | 0;
+ HEAP32[i3 >> 2] = 7672;
+ ___cxa_throw(i3 | 0, 7720, 30);
+ } else if ((i2 | 0) == 6) {
+ STACKTOP = i1;
+ return i3 | 0;
+ }
+ return 0;
+}
+function __ZN8b2IslandD2Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __ZN16b2StackAllocator4FreeEPv(HEAP32[i1 >> 2] | 0, HEAP32[i1 + 20 >> 2] | 0);
+ __ZN16b2StackAllocator4FreeEPv(HEAP32[i1 >> 2] | 0, HEAP32[i1 + 24 >> 2] | 0);
+ __ZN16b2StackAllocator4FreeEPv(HEAP32[i1 >> 2] | 0, HEAP32[i1 + 16 >> 2] | 0);
+ __ZN16b2StackAllocator4FreeEPv(HEAP32[i1 >> 2] | 0, HEAP32[i1 + 12 >> 2] | 0);
+ __ZN16b2StackAllocator4FreeEPv(HEAP32[i1 >> 2] | 0, HEAP32[i1 + 8 >> 2] | 0);
+ STACKTOP = i2;
+ return;
+}
+function __ZN16b2BlockAllocatorD2Ev(i2) {
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0;
+ i1 = STACKTOP;
+ i3 = i2 + 4 | 0;
+ i4 = HEAP32[i2 >> 2] | 0;
+ if ((HEAP32[i3 >> 2] | 0) > 0) {
+ i5 = 0;
+ } else {
+ i5 = i4;
+ __Z6b2FreePv(i5);
+ STACKTOP = i1;
+ return;
+ }
+ do {
+ __Z6b2FreePv(HEAP32[i4 + (i5 << 3) + 4 >> 2] | 0);
+ i5 = i5 + 1 | 0;
+ i4 = HEAP32[i2 >> 2] | 0;
+ } while ((i5 | 0) < (HEAP32[i3 >> 2] | 0));
+ __Z6b2FreePv(i4);
+ STACKTOP = i1;
+ return;
+}
+function copyTempDouble(i1) {
+ i1 = i1 | 0;
+ HEAP8[tempDoublePtr] = HEAP8[i1];
+ HEAP8[tempDoublePtr + 1 | 0] = HEAP8[i1 + 1 | 0];
+ HEAP8[tempDoublePtr + 2 | 0] = HEAP8[i1 + 2 | 0];
+ HEAP8[tempDoublePtr + 3 | 0] = HEAP8[i1 + 3 | 0];
+ HEAP8[tempDoublePtr + 4 | 0] = HEAP8[i1 + 4 | 0];
+ HEAP8[tempDoublePtr + 5 | 0] = HEAP8[i1 + 5 | 0];
+ HEAP8[tempDoublePtr + 6 | 0] = HEAP8[i1 + 6 | 0];
+ HEAP8[tempDoublePtr + 7 | 0] = HEAP8[i1 + 7 | 0];
+}
+function __ZNK11b2EdgeShape11ComputeMassEP10b2MassDataf(i2, i1, d3) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ d3 = +d3;
+ var i4 = 0, d5 = 0.0;
+ i4 = STACKTOP;
+ HEAPF32[i1 >> 2] = 0.0;
+ d5 = +((+HEAPF32[i2 + 12 >> 2] + +HEAPF32[i2 + 20 >> 2]) * .5);
+ d3 = +((+HEAPF32[i2 + 16 >> 2] + +HEAPF32[i2 + 24 >> 2]) * .5);
+ i2 = i1 + 4 | 0;
+ HEAPF32[i2 >> 2] = d5;
+ HEAPF32[i2 + 4 >> 2] = d3;
+ HEAPF32[i1 + 12 >> 2] = 0.0;
+ STACKTOP = i4;
+ return;
+}
+function __ZN11b2EdgeShape3SetERK6b2Vec2S2_(i1, i3, i2) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ var i4 = 0, i5 = 0;
+ i5 = i3;
+ i3 = HEAP32[i5 + 4 >> 2] | 0;
+ i4 = i1 + 12 | 0;
+ HEAP32[i4 >> 2] = HEAP32[i5 >> 2];
+ HEAP32[i4 + 4 >> 2] = i3;
+ i4 = i2;
+ i2 = HEAP32[i4 + 4 >> 2] | 0;
+ i3 = i1 + 20 | 0;
+ HEAP32[i3 >> 2] = HEAP32[i4 >> 2];
+ HEAP32[i3 + 4 >> 2] = i2;
+ HEAP8[i1 + 44 | 0] = 0;
+ HEAP8[i1 + 45 | 0] = 0;
+ return;
+}
+function __ZN25b2PolygonAndCircleContact8EvaluateEP10b2ManifoldRK11b2TransformS4_(i2, i4, i3, i1) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ var i5 = 0;
+ i5 = STACKTOP;
+ __Z25b2CollidePolygonAndCircleP10b2ManifoldPK14b2PolygonShapeRK11b2TransformPK13b2CircleShapeS6_(i4, HEAP32[(HEAP32[i2 + 48 >> 2] | 0) + 12 >> 2] | 0, i3, HEAP32[(HEAP32[i2 + 52 >> 2] | 0) + 12 >> 2] | 0, i1);
+ STACKTOP = i5;
+ return;
+}
+function __ZN23b2EdgeAndPolygonContact8EvaluateEP10b2ManifoldRK11b2TransformS4_(i2, i4, i3, i1) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ var i5 = 0;
+ i5 = STACKTOP;
+ __Z23b2CollideEdgeAndPolygonP10b2ManifoldPK11b2EdgeShapeRK11b2TransformPK14b2PolygonShapeS6_(i4, HEAP32[(HEAP32[i2 + 48 >> 2] | 0) + 12 >> 2] | 0, i3, HEAP32[(HEAP32[i2 + 52 >> 2] | 0) + 12 >> 2] | 0, i1);
+ STACKTOP = i5;
+ return;
+}
+function __ZN22b2EdgeAndCircleContact8EvaluateEP10b2ManifoldRK11b2TransformS4_(i2, i4, i3, i1) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ var i5 = 0;
+ i5 = STACKTOP;
+ __Z22b2CollideEdgeAndCircleP10b2ManifoldPK11b2EdgeShapeRK11b2TransformPK13b2CircleShapeS6_(i4, HEAP32[(HEAP32[i2 + 48 >> 2] | 0) + 12 >> 2] | 0, i3, HEAP32[(HEAP32[i2 + 52 >> 2] | 0) + 12 >> 2] | 0, i1);
+ STACKTOP = i5;
+ return;
+}
+function __Z23b2CollideEdgeAndPolygonP10b2ManifoldPK11b2EdgeShapeRK11b2TransformPK14b2PolygonShapeS6_(i5, i4, i3, i2, i1) {
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i6 = 0;
+ i6 = STACKTOP;
+ STACKTOP = STACKTOP + 256 | 0;
+ __ZN12b2EPCollider7CollideEP10b2ManifoldPK11b2EdgeShapeRK11b2TransformPK14b2PolygonShapeS7_(i6, i5, i4, i3, i2, i1);
+ STACKTOP = i6;
+ return;
+}
+function __ZN16b2PolygonContact8EvaluateEP10b2ManifoldRK11b2TransformS4_(i2, i4, i3, i1) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ var i5 = 0;
+ i5 = STACKTOP;
+ __Z17b2CollidePolygonsP10b2ManifoldPK14b2PolygonShapeRK11b2TransformS3_S6_(i4, HEAP32[(HEAP32[i2 + 48 >> 2] | 0) + 12 >> 2] | 0, i3, HEAP32[(HEAP32[i2 + 52 >> 2] | 0) + 12 >> 2] | 0, i1);
+ STACKTOP = i5;
+ return;
+}
+function __ZN15b2CircleContact8EvaluateEP10b2ManifoldRK11b2TransformS4_(i2, i4, i3, i1) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ var i5 = 0;
+ i5 = STACKTOP;
+ __Z16b2CollideCirclesP10b2ManifoldPK13b2CircleShapeRK11b2TransformS3_S6_(i4, HEAP32[(HEAP32[i2 + 48 >> 2] | 0) + 12 >> 2] | 0, i3, HEAP32[(HEAP32[i2 + 52 >> 2] | 0) + 12 >> 2] | 0, i1);
+ STACKTOP = i5;
+ return;
+}
+function __Z14b2PairLessThanRK6b2PairS1_(i2, i5) {
+ i2 = i2 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i3 = 0, i4 = 0;
+ i1 = STACKTOP;
+ i4 = HEAP32[i2 >> 2] | 0;
+ i3 = HEAP32[i5 >> 2] | 0;
+ if ((i4 | 0) >= (i3 | 0)) {
+ if ((i4 | 0) == (i3 | 0)) {
+ i2 = (HEAP32[i2 + 4 >> 2] | 0) < (HEAP32[i5 + 4 >> 2] | 0);
+ } else {
+ i2 = 0;
+ }
+ } else {
+ i2 = 1;
+ }
+ STACKTOP = i1;
+ return i2 | 0;
+}
+function __ZN9b2FixtureC2Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ HEAP16[i1 + 32 >> 1] = 1;
+ HEAP16[i1 + 34 >> 1] = -1;
+ HEAP16[i1 + 36 >> 1] = 0;
+ HEAP32[i1 + 40 >> 2] = 0;
+ HEAP32[i1 + 24 >> 2] = 0;
+ HEAP32[i1 + 28 >> 2] = 0;
+ HEAP32[i1 + 0 >> 2] = 0;
+ HEAP32[i1 + 4 >> 2] = 0;
+ HEAP32[i1 + 8 >> 2] = 0;
+ HEAP32[i1 + 12 >> 2] = 0;
+ STACKTOP = i2;
+ return;
+}
+function __ZN12b2BroadPhaseC2Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __ZN13b2DynamicTreeC2Ev(i1);
+ HEAP32[i1 + 28 >> 2] = 0;
+ HEAP32[i1 + 48 >> 2] = 16;
+ HEAP32[i1 + 52 >> 2] = 0;
+ HEAP32[i1 + 44 >> 2] = __Z7b2Alloci(192) | 0;
+ HEAP32[i1 + 36 >> 2] = 16;
+ HEAP32[i1 + 40 >> 2] = 0;
+ HEAP32[i1 + 32 >> 2] = __Z7b2Alloci(64) | 0;
+ STACKTOP = i2;
+ return;
+}
+function __ZN16b2StackAllocatorD2Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ if ((HEAP32[i1 + 102400 >> 2] | 0) != 0) {
+ ___assert_fail(3792, 3808, 32, 3848);
+ }
+ if ((HEAP32[i1 + 102796 >> 2] | 0) == 0) {
+ STACKTOP = i2;
+ return;
+ } else {
+ ___assert_fail(3872, 3808, 33, 3848);
+ }
+}
+function __ZN15b2ContactSolverD2Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = i1 + 32 | 0;
+ __ZN16b2StackAllocator4FreeEPv(HEAP32[i3 >> 2] | 0, HEAP32[i1 + 40 >> 2] | 0);
+ __ZN16b2StackAllocator4FreeEPv(HEAP32[i3 >> 2] | 0, HEAP32[i1 + 36 >> 2] | 0);
+ STACKTOP = i2;
+ return;
+}
+function __ZN25b2PolygonAndCircleContact7DestroyEP9b2ContactP16b2BlockAllocator(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i3 = 0;
+ i3 = STACKTOP;
+ FUNCTION_TABLE_vi[HEAP32[(HEAP32[i1 >> 2] | 0) + 4 >> 2] & 31](i1);
+ __ZN16b2BlockAllocator4FreeEPvi(i2, i1, 144);
+ STACKTOP = i3;
+ return;
+}
+function __ZN24b2ChainAndPolygonContact7DestroyEP9b2ContactP16b2BlockAllocator(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i3 = 0;
+ i3 = STACKTOP;
+ FUNCTION_TABLE_vi[HEAP32[(HEAP32[i1 >> 2] | 0) + 4 >> 2] & 31](i1);
+ __ZN16b2BlockAllocator4FreeEPvi(i2, i1, 144);
+ STACKTOP = i3;
+ return;
+}
+function __ZN23b2EdgeAndPolygonContact7DestroyEP9b2ContactP16b2BlockAllocator(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i3 = 0;
+ i3 = STACKTOP;
+ FUNCTION_TABLE_vi[HEAP32[(HEAP32[i1 >> 2] | 0) + 4 >> 2] & 31](i1);
+ __ZN16b2BlockAllocator4FreeEPvi(i2, i1, 144);
+ STACKTOP = i3;
+ return;
+}
+function __ZN23b2ChainAndCircleContact7DestroyEP9b2ContactP16b2BlockAllocator(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i3 = 0;
+ i3 = STACKTOP;
+ FUNCTION_TABLE_vi[HEAP32[(HEAP32[i1 >> 2] | 0) + 4 >> 2] & 31](i1);
+ __ZN16b2BlockAllocator4FreeEPvi(i2, i1, 144);
+ STACKTOP = i3;
+ return;
+}
+function __ZN22b2EdgeAndCircleContact7DestroyEP9b2ContactP16b2BlockAllocator(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i3 = 0;
+ i3 = STACKTOP;
+ FUNCTION_TABLE_vi[HEAP32[(HEAP32[i1 >> 2] | 0) + 4 >> 2] & 31](i1);
+ __ZN16b2BlockAllocator4FreeEPvi(i2, i1, 144);
+ STACKTOP = i3;
+ return;
+}
+function __ZN16b2ContactManagerC2Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __ZN12b2BroadPhaseC2Ev(i1);
+ HEAP32[i1 + 60 >> 2] = 0;
+ HEAP32[i1 + 64 >> 2] = 0;
+ HEAP32[i1 + 68 >> 2] = 1888;
+ HEAP32[i1 + 72 >> 2] = 1896;
+ HEAP32[i1 + 76 >> 2] = 0;
+ STACKTOP = i2;
+ return;
+}
+function __ZN16b2PolygonContact7DestroyEP9b2ContactP16b2BlockAllocator(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i3 = 0;
+ i3 = STACKTOP;
+ FUNCTION_TABLE_vi[HEAP32[(HEAP32[i1 >> 2] | 0) + 4 >> 2] & 31](i1);
+ __ZN16b2BlockAllocator4FreeEPvi(i2, i1, 144);
+ STACKTOP = i3;
+ return;
+}
+function __ZN15b2CircleContact7DestroyEP9b2ContactP16b2BlockAllocator(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i3 = 0;
+ i3 = STACKTOP;
+ FUNCTION_TABLE_vi[HEAP32[(HEAP32[i1 >> 2] | 0) + 4 >> 2] & 31](i1);
+ __ZN16b2BlockAllocator4FreeEPvi(i2, i1, 144);
+ STACKTOP = i3;
+ return;
+}
+function dynCall_viiiiii(i7, i6, i5, i4, i3, i2, i1) {
+ i7 = i7 | 0;
+ i6 = i6 | 0;
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ FUNCTION_TABLE_viiiiii[i7 & 3](i6 | 0, i5 | 0, i4 | 0, i3 | 0, i2 | 0, i1 | 0);
+}
+function copyTempFloat(i1) {
+ i1 = i1 | 0;
+ HEAP8[tempDoublePtr] = HEAP8[i1];
+ HEAP8[tempDoublePtr + 1 | 0] = HEAP8[i1 + 1 | 0];
+ HEAP8[tempDoublePtr + 2 | 0] = HEAP8[i1 + 2 | 0];
+ HEAP8[tempDoublePtr + 3 | 0] = HEAP8[i1 + 3 | 0];
+}
+function dynCall_iiiiii(i6, i5, i4, i3, i2, i1) {
+ i6 = i6 | 0;
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ return FUNCTION_TABLE_iiiiii[i6 & 15](i5 | 0, i4 | 0, i3 | 0, i2 | 0, i1 | 0) | 0;
+}
+function dynCall_viiiii(i6, i5, i4, i3, i2, i1) {
+ i6 = i6 | 0;
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ FUNCTION_TABLE_viiiii[i6 & 3](i5 | 0, i4 | 0, i3 | 0, i2 | 0, i1 | 0);
+}
+function __ZN16b2ContactManager15FindNewContactsEv(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __ZN12b2BroadPhase11UpdatePairsI16b2ContactManagerEEvPT_(i1, i1);
+ STACKTOP = i2;
+ return;
+}
+function __ZN16b2StackAllocatorC2Ev(i1) {
+ i1 = i1 | 0;
+ HEAP32[i1 + 102400 >> 2] = 0;
+ HEAP32[i1 + 102404 >> 2] = 0;
+ HEAP32[i1 + 102408 >> 2] = 0;
+ HEAP32[i1 + 102796 >> 2] = 0;
+ return;
+}
+function dynCall_viiii(i5, i4, i3, i2, i1) {
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ FUNCTION_TABLE_viiii[i5 & 15](i4 | 0, i3 | 0, i2 | 0, i1 | 0);
+}
+function dynCall_iiii(i4, i3, i2, i1) {
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ return FUNCTION_TABLE_iiii[i4 & 7](i3 | 0, i2 | 0, i1 | 0) | 0;
+}
+function dynCall_viii(i4, i3, i2, i1) {
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ FUNCTION_TABLE_viii[i4 & 3](i3 | 0, i2 | 0, i1 | 0);
+}
+function __ZNSt9bad_allocD0Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __ZNSt9exceptionD2Ev(i1 | 0);
+ __ZdlPv(i1);
+ STACKTOP = i2;
+ return;
+}
+function stackAlloc(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + i1 | 0;
+ STACKTOP = STACKTOP + 7 & -8;
+ return i2 | 0;
+}
+function __ZN13b2DynamicTreeD2Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __Z6b2FreePv(HEAP32[i1 + 4 >> 2] | 0);
+ STACKTOP = i2;
+ return;
+}
+function dynCall_viid(i4, i3, i2, d1) {
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ d1 = +d1;
+ FUNCTION_TABLE_viid[i4 & 3](i3 | 0, i2 | 0, +d1);
+}
+function __ZN17b2ContactListener9PostSolveEP9b2ContactPK16b2ContactImpulse(i1, i2, i3) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ return;
+}
+function __ZN10__cxxabiv120__si_class_type_infoD0Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __ZdlPv(i1);
+ STACKTOP = i2;
+ return;
+}
+function __ZN10__cxxabiv117__class_type_infoD0Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __ZdlPv(i1);
+ STACKTOP = i2;
+ return;
+}
+function __ZNSt9bad_allocD2Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __ZNSt9exceptionD2Ev(i1 | 0);
+ STACKTOP = i2;
+ return;
+}
+function dynCall_iii(i3, i2, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ return FUNCTION_TABLE_iii[i3 & 3](i2 | 0, i1 | 0) | 0;
+}
+function b8(i1, i2, i3, i4, i5, i6) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ i6 = i6 | 0;
+ abort(8);
+}
+function __ZN25b2PolygonAndCircleContactD0Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __ZdlPv(i1);
+ STACKTOP = i2;
+ return;
+}
+function __ZN17b2ContactListener8PreSolveEP9b2ContactPK10b2Manifold(i1, i2, i3) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ return;
+}
+function __ZN24b2ChainAndPolygonContactD0Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __ZdlPv(i1);
+ STACKTOP = i2;
+ return;
+}
+function __ZN23b2EdgeAndPolygonContactD0Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __ZdlPv(i1);
+ STACKTOP = i2;
+ return;
+}
+function __ZN23b2ChainAndCircleContactD0Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __ZdlPv(i1);
+ STACKTOP = i2;
+ return;
+}
+function __ZNK11b2EdgeShape9TestPointERK11b2TransformRK6b2Vec2(i1, i2, i3) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ return 0;
+}
+function __ZN22b2EdgeAndCircleContactD0Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __ZdlPv(i1);
+ STACKTOP = i2;
+ return;
+}
+function __ZdlPv(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ if ((i1 | 0) != 0) {
+ _free(i1);
+ }
+ STACKTOP = i2;
+ return;
+}
+function b10(i1, i2, i3, i4, i5) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ abort(10);
+ return 0;
+}
+function _strlen(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = i1;
+ while (HEAP8[i2] | 0) {
+ i2 = i2 + 1 | 0;
+ }
+ return i2 - i1 | 0;
+}
+function __Z7b2Alloci(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ i1 = _malloc(i1) | 0;
+ STACKTOP = i2;
+ return i1 | 0;
+}
+function setThrew(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ if ((__THREW__ | 0) == 0) {
+ __THREW__ = i1;
+ threwValue = i2;
+ }
+}
+function __ZN17b2ContactListenerD0Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __ZdlPv(i1);
+ STACKTOP = i2;
+ return;
+}
+function __ZN16b2PolygonContactD0Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __ZdlPv(i1);
+ STACKTOP = i2;
+ return;
+}
+function dynCall_vii(i3, i2, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ FUNCTION_TABLE_vii[i3 & 15](i2 | 0, i1 | 0);
+}
+function __ZN15b2ContactFilterD0Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __ZdlPv(i1);
+ STACKTOP = i2;
+ return;
+}
+function __ZN15b2CircleContactD0Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __ZdlPv(i1);
+ STACKTOP = i2;
+ return;
+}
+function __ZN14b2PolygonShapeD0Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __ZdlPv(i1);
+ STACKTOP = i2;
+ return;
+}
+function __Znaj(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ i1 = __Znwj(i1) | 0;
+ STACKTOP = i2;
+ return i1 | 0;
+}
+function __ZN11b2EdgeShapeD0Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __ZdlPv(i1);
+ STACKTOP = i2;
+ return;
+}
+function __ZN9b2ContactD0Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __ZdlPv(i1);
+ STACKTOP = i2;
+ return;
+}
+function b1(i1, i2, i3, i4, i5) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ abort(1);
+}
+function __Z6b2FreePv(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _free(i1);
+ STACKTOP = i2;
+ return;
+}
+function ___clang_call_terminate(i1) {
+ i1 = i1 | 0;
+ ___cxa_begin_catch(i1 | 0) | 0;
+ __ZSt9terminatev();
+}
+function __ZN17b2ContactListener12BeginContactEP9b2Contact(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ return;
+}
+function dynCall_ii(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ return FUNCTION_TABLE_ii[i2 & 3](i1 | 0) | 0;
+}
+function __ZN17b2ContactListener10EndContactEP9b2Contact(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ return;
+}
+function b11(i1, i2, i3, i4) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ abort(11);
+}
+function dynCall_vi(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ FUNCTION_TABLE_vi[i2 & 31](i1 | 0);
+}
+function b0(i1, i2, i3) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ abort(0);
+ return 0;
+}
+function __ZNK10__cxxabiv116__shim_type_info5noop2Ev(i1) {
+ i1 = i1 | 0;
+ return;
+}
+function __ZNK10__cxxabiv116__shim_type_info5noop1Ev(i1) {
+ i1 = i1 | 0;
+ return;
+}
+function b5(i1, i2, i3) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ abort(5);
+}
+function __ZNK14b2PolygonShape13GetChildCountEv(i1) {
+ i1 = i1 | 0;
+ return 1;
+}
+function __ZN10__cxxabiv116__shim_type_infoD2Ev(i1) {
+ i1 = i1 | 0;
+ return;
+}
+function b7(i1, i2, d3) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ d3 = +d3;
+ abort(7);
+}
+function __ZNK11b2EdgeShape13GetChildCountEv(i1) {
+ i1 = i1 | 0;
+ return 1;
+}
+function __ZNK7b2Timer15GetMillisecondsEv(i1) {
+ i1 = i1 | 0;
+ return 0.0;
+}
+function __ZN25b2PolygonAndCircleContactD1Ev(i1) {
+ i1 = i1 | 0;
+ return;
+}
+function __ZN24b2ChainAndPolygonContactD1Ev(i1) {
+ i1 = i1 | 0;
+ return;
+}
+function b9(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ abort(9);
+ return 0;
+}
+function __ZN23b2EdgeAndPolygonContactD1Ev(i1) {
+ i1 = i1 | 0;
+ return;
+}
+function __ZN23b2ChainAndCircleContactD1Ev(i1) {
+ i1 = i1 | 0;
+ return;
+}
+function __ZN22b2EdgeAndCircleContactD1Ev(i1) {
+ i1 = i1 | 0;
+ return;
+}
+function dynCall_v(i1) {
+ i1 = i1 | 0;
+ FUNCTION_TABLE_v[i1 & 3]();
+}
+function __ZNKSt9bad_alloc4whatEv(i1) {
+ i1 = i1 | 0;
+ return 7688;
+}
+function ___cxa_pure_virtual__wrapper() {
+ ___cxa_pure_virtual();
+}
+function __ZN17b2ContactListenerD1Ev(i1) {
+ i1 = i1 | 0;
+ return;
+}
+function __ZN16b2PolygonContactD1Ev(i1) {
+ i1 = i1 | 0;
+ return;
+}
+function __ZN15b2ContactFilterD1Ev(i1) {
+ i1 = i1 | 0;
+ return;
+}
+function __ZN15b2CircleContactD1Ev(i1) {
+ i1 = i1 | 0;
+ return;
+}
+function __ZN14b2PolygonShapeD1Ev(i1) {
+ i1 = i1 | 0;
+ return;
+}
+function b3(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ abort(3);
+}
+function runPostSets() {
+ HEAP32[1932] = __ZTISt9exception;
+}
+function __ZN11b2EdgeShapeD1Ev(i1) {
+ i1 = i1 | 0;
+ return;
+}
+function __ZNSt9type_infoD2Ev(i1) {
+ i1 = i1 | 0;
+ return;
+}
+function __ZN7b2Timer5ResetEv(i1) {
+ i1 = i1 | 0;
+ return;
+}
+function stackRestore(i1) {
+ i1 = i1 | 0;
+ STACKTOP = i1;
+}
+function setTempRet9(i1) {
+ i1 = i1 | 0;
+ tempRet9 = i1;
+}
+function setTempRet8(i1) {
+ i1 = i1 | 0;
+ tempRet8 = i1;
+}
+function setTempRet7(i1) {
+ i1 = i1 | 0;
+ tempRet7 = i1;
+}
+function setTempRet6(i1) {
+ i1 = i1 | 0;
+ tempRet6 = i1;
+}
+function setTempRet5(i1) {
+ i1 = i1 | 0;
+ tempRet5 = i1;
+}
+function setTempRet4(i1) {
+ i1 = i1 | 0;
+ tempRet4 = i1;
+}
+function setTempRet3(i1) {
+ i1 = i1 | 0;
+ tempRet3 = i1;
+}
+function setTempRet2(i1) {
+ i1 = i1 | 0;
+ tempRet2 = i1;
+}
+function setTempRet1(i1) {
+ i1 = i1 | 0;
+ tempRet1 = i1;
+}
+function setTempRet0(i1) {
+ i1 = i1 | 0;
+ tempRet0 = i1;
+}
+function __ZN9b2ContactD1Ev(i1) {
+ i1 = i1 | 0;
+ return;
+}
+function __ZN7b2TimerC2Ev(i1) {
+ i1 = i1 | 0;
+ return;
+}
+function b4(i1) {
+ i1 = i1 | 0;
+ abort(4);
+ return 0;
+}
+function stackSave() {
+ return STACKTOP | 0;
+}
+function b2(i1) {
+ i1 = i1 | 0;
+ abort(2);
+}
+function b6() {
+ abort(6);
+}
+
+// EMSCRIPTEN_END_FUNCS
+ var FUNCTION_TABLE_iiii = [b0,__ZNK11b2EdgeShape9TestPointERK11b2TransformRK6b2Vec2,__ZNK14b2PolygonShape9TestPointERK11b2TransformRK6b2Vec2,__ZN15b2ContactFilter13ShouldCollideEP9b2FixtureS1_,__ZNK10__cxxabiv117__class_type_info9can_catchEPKNS_16__shim_type_infoERPv,b0,b0,b0];
+ var FUNCTION_TABLE_viiiii = [b1,__ZNK10__cxxabiv117__class_type_info16search_below_dstEPNS_19__dynamic_cast_infoEPKvib,__ZNK10__cxxabiv120__si_class_type_info16search_below_dstEPNS_19__dynamic_cast_infoEPKvib,b1];
+ var FUNCTION_TABLE_vi = [b2,__ZN11b2EdgeShapeD1Ev,__ZN11b2EdgeShapeD0Ev,__ZN14b2PolygonShapeD1Ev,__ZN14b2PolygonShapeD0Ev,__ZN17b2ContactListenerD1Ev,__ZN17b2ContactListenerD0Ev,__ZN15b2ContactFilterD1Ev,__ZN15b2ContactFilterD0Ev,__ZN9b2ContactD1Ev,__ZN9b2ContactD0Ev,__ZN22b2EdgeAndCircleContactD1Ev,__ZN22b2EdgeAndCircleContactD0Ev,__ZN23b2EdgeAndPolygonContactD1Ev,__ZN23b2EdgeAndPolygonContactD0Ev,__ZN25b2PolygonAndCircleContactD1Ev,__ZN25b2PolygonAndCircleContactD0Ev,__ZN16b2PolygonContactD1Ev,__ZN16b2PolygonContactD0Ev,__ZN23b2ChainAndCircleContactD1Ev,__ZN23b2ChainAndCircleContactD0Ev,__ZN24b2ChainAndPolygonContactD1Ev,__ZN24b2ChainAndPolygonContactD0Ev,__ZN15b2CircleContactD1Ev,__ZN15b2CircleContactD0Ev,__ZN10__cxxabiv116__shim_type_infoD2Ev,__ZN10__cxxabiv117__class_type_infoD0Ev,__ZNK10__cxxabiv116__shim_type_info5noop1Ev,__ZNK10__cxxabiv116__shim_type_info5noop2Ev
+ ,__ZN10__cxxabiv120__si_class_type_infoD0Ev,__ZNSt9bad_allocD2Ev,__ZNSt9bad_allocD0Ev];
+ var FUNCTION_TABLE_vii = [b3,__ZN17b2ContactListener12BeginContactEP9b2Contact,__ZN17b2ContactListener10EndContactEP9b2Contact,__ZN15b2CircleContact7DestroyEP9b2ContactP16b2BlockAllocator,__ZN25b2PolygonAndCircleContact7DestroyEP9b2ContactP16b2BlockAllocator,__ZN16b2PolygonContact7DestroyEP9b2ContactP16b2BlockAllocator,__ZN22b2EdgeAndCircleContact7DestroyEP9b2ContactP16b2BlockAllocator,__ZN23b2EdgeAndPolygonContact7DestroyEP9b2ContactP16b2BlockAllocator,__ZN23b2ChainAndCircleContact7DestroyEP9b2ContactP16b2BlockAllocator,__ZN24b2ChainAndPolygonContact7DestroyEP9b2ContactP16b2BlockAllocator,b3,b3,b3,b3,b3,b3];
+ var FUNCTION_TABLE_ii = [b4,__ZNK11b2EdgeShape13GetChildCountEv,__ZNK14b2PolygonShape13GetChildCountEv,__ZNKSt9bad_alloc4whatEv];
+ var FUNCTION_TABLE_viii = [b5,__ZN17b2ContactListener8PreSolveEP9b2ContactPK10b2Manifold,__ZN17b2ContactListener9PostSolveEP9b2ContactPK16b2ContactImpulse,b5];
+ var FUNCTION_TABLE_v = [b6,___cxa_pure_virtual__wrapper,__Z4iterv,b6];
+ var FUNCTION_TABLE_viid = [b7,__ZNK11b2EdgeShape11ComputeMassEP10b2MassDataf,__ZNK14b2PolygonShape11ComputeMassEP10b2MassDataf,b7];
+ var FUNCTION_TABLE_viiiiii = [b8,__ZNK10__cxxabiv117__class_type_info16search_above_dstEPNS_19__dynamic_cast_infoEPKvS4_ib,__ZNK10__cxxabiv120__si_class_type_info16search_above_dstEPNS_19__dynamic_cast_infoEPKvS4_ib,b8];
+ var FUNCTION_TABLE_iii = [b9,__ZNK11b2EdgeShape5CloneEP16b2BlockAllocator,__ZNK14b2PolygonShape5CloneEP16b2BlockAllocator,__Z14b2PairLessThanRK6b2PairS1_];
+ var FUNCTION_TABLE_iiiiii = [b10,__ZNK11b2EdgeShape7RayCastEP15b2RayCastOutputRK14b2RayCastInputRK11b2Transformi,__ZNK14b2PolygonShape7RayCastEP15b2RayCastOutputRK14b2RayCastInputRK11b2Transformi,__ZN15b2CircleContact6CreateEP9b2FixtureiS1_iP16b2BlockAllocator,__ZN25b2PolygonAndCircleContact6CreateEP9b2FixtureiS1_iP16b2BlockAllocator,__ZN16b2PolygonContact6CreateEP9b2FixtureiS1_iP16b2BlockAllocator,__ZN22b2EdgeAndCircleContact6CreateEP9b2FixtureiS1_iP16b2BlockAllocator,__ZN23b2EdgeAndPolygonContact6CreateEP9b2FixtureiS1_iP16b2BlockAllocator,__ZN23b2ChainAndCircleContact6CreateEP9b2FixtureiS1_iP16b2BlockAllocator,__ZN24b2ChainAndPolygonContact6CreateEP9b2FixtureiS1_iP16b2BlockAllocator,b10,b10,b10,b10,b10,b10];
+ var FUNCTION_TABLE_viiii = [b11,__ZNK11b2EdgeShape11ComputeAABBEP6b2AABBRK11b2Transformi,__ZNK14b2PolygonShape11ComputeAABBEP6b2AABBRK11b2Transformi,__ZN22b2EdgeAndCircleContact8EvaluateEP10b2ManifoldRK11b2TransformS4_,__ZN23b2EdgeAndPolygonContact8EvaluateEP10b2ManifoldRK11b2TransformS4_,__ZN25b2PolygonAndCircleContact8EvaluateEP10b2ManifoldRK11b2TransformS4_,__ZN16b2PolygonContact8EvaluateEP10b2ManifoldRK11b2TransformS4_,__ZN23b2ChainAndCircleContact8EvaluateEP10b2ManifoldRK11b2TransformS4_,__ZN24b2ChainAndPolygonContact8EvaluateEP10b2ManifoldRK11b2TransformS4_,__ZN15b2CircleContact8EvaluateEP10b2ManifoldRK11b2TransformS4_,__ZNK10__cxxabiv117__class_type_info27has_unambiguous_public_baseEPNS_19__dynamic_cast_infoEPvi,__ZNK10__cxxabiv120__si_class_type_info27has_unambiguous_public_baseEPNS_19__dynamic_cast_infoEPvi,b11,b11,b11,b11];
+
+ return { _strlen: _strlen, _free: _free, _main: _main, _memset: _memset, _malloc: _malloc, _memcpy: _memcpy, runPostSets: runPostSets, stackAlloc: stackAlloc, stackSave: stackSave, stackRestore: stackRestore, setThrew: setThrew, setTempRet0: setTempRet0, setTempRet1: setTempRet1, setTempRet2: setTempRet2, setTempRet3: setTempRet3, setTempRet4: setTempRet4, setTempRet5: setTempRet5, setTempRet6: setTempRet6, setTempRet7: setTempRet7, setTempRet8: setTempRet8, setTempRet9: setTempRet9, dynCall_iiii: dynCall_iiii, dynCall_viiiii: dynCall_viiiii, dynCall_vi: dynCall_vi, dynCall_vii: dynCall_vii, dynCall_ii: dynCall_ii, dynCall_viii: dynCall_viii, dynCall_v: dynCall_v, dynCall_viid: dynCall_viid, dynCall_viiiiii: dynCall_viiiiii, dynCall_iii: dynCall_iii, dynCall_iiiiii: dynCall_iiiiii, dynCall_viiii: dynCall_viiii };
+}).toString(),
+// EMSCRIPTEN_END_ASM
+{ "abort": abort, "assert": assert, "asmPrintInt": asmPrintInt, "asmPrintFloat": asmPrintFloat, "min": Math_min, "invoke_iiii": invoke_iiii, "invoke_viiiii": invoke_viiiii, "invoke_vi": invoke_vi, "invoke_vii": invoke_vii, "invoke_ii": invoke_ii, "invoke_viii": invoke_viii, "invoke_v": invoke_v, "invoke_viid": invoke_viid, "invoke_viiiiii": invoke_viiiiii, "invoke_iii": invoke_iii, "invoke_iiiiii": invoke_iiiiii, "invoke_viiii": invoke_viiii, "___cxa_throw": ___cxa_throw, "_emscripten_run_script": _emscripten_run_script, "_cosf": _cosf, "_send": _send, "__ZSt9terminatev": __ZSt9terminatev, "__reallyNegative": __reallyNegative, "___cxa_is_number_type": ___cxa_is_number_type, "___assert_fail": ___assert_fail, "___cxa_allocate_exception": ___cxa_allocate_exception, "___cxa_find_matching_catch": ___cxa_find_matching_catch, "_fflush": _fflush, "_pwrite": _pwrite, "___setErrNo": ___setErrNo, "_sbrk": _sbrk, "___cxa_begin_catch": ___cxa_begin_catch, "_sinf": _sinf, "_fileno": _fileno, "___resumeException": ___resumeException, "__ZSt18uncaught_exceptionv": __ZSt18uncaught_exceptionv, "_sysconf": _sysconf, "_clock": _clock, "_emscripten_memcpy_big": _emscripten_memcpy_big, "_puts": _puts, "_mkport": _mkport, "_floorf": _floorf, "_sqrtf": _sqrtf, "_write": _write, "_emscripten_set_main_loop": _emscripten_set_main_loop, "___errno_location": ___errno_location, "__ZNSt9exceptionD2Ev": __ZNSt9exceptionD2Ev, "_printf": _printf, "___cxa_does_inherit": ___cxa_does_inherit, "__exit": __exit, "_fputc": _fputc, "_abort": _abort, "_fwrite": _fwrite, "_time": _time, "_fprintf": _fprintf, "_emscripten_cancel_main_loop": _emscripten_cancel_main_loop, "__formatString": __formatString, "_fputs": _fputs, "_exit": _exit, "___cxa_pure_virtual": ___cxa_pure_virtual, "STACKTOP": STACKTOP, "STACK_MAX": STACK_MAX, "tempDoublePtr": tempDoublePtr, "ABORT": ABORT, "NaN": NaN, "Infinity": Infinity, "__ZTISt9exception": __ZTISt9exception }, buffer);
+var _strlen = Module["_strlen"] = asm["_strlen"];
+var _free = Module["_free"] = asm["_free"];
+var _main = Module["_main"] = asm["_main"];
+var _memset = Module["_memset"] = asm["_memset"];
+var _malloc = Module["_malloc"] = asm["_malloc"];
+var _memcpy = Module["_memcpy"] = asm["_memcpy"];
+var runPostSets = Module["runPostSets"] = asm["runPostSets"];
+var dynCall_iiii = Module["dynCall_iiii"] = asm["dynCall_iiii"];
+var dynCall_viiiii = Module["dynCall_viiiii"] = asm["dynCall_viiiii"];
+var dynCall_vi = Module["dynCall_vi"] = asm["dynCall_vi"];
+var dynCall_vii = Module["dynCall_vii"] = asm["dynCall_vii"];
+var dynCall_ii = Module["dynCall_ii"] = asm["dynCall_ii"];
+var dynCall_viii = Module["dynCall_viii"] = asm["dynCall_viii"];
+var dynCall_v = Module["dynCall_v"] = asm["dynCall_v"];
+var dynCall_viid = Module["dynCall_viid"] = asm["dynCall_viid"];
+var dynCall_viiiiii = Module["dynCall_viiiiii"] = asm["dynCall_viiiiii"];
+var dynCall_iii = Module["dynCall_iii"] = asm["dynCall_iii"];
+var dynCall_iiiiii = Module["dynCall_iiiiii"] = asm["dynCall_iiiiii"];
+var dynCall_viiii = Module["dynCall_viiii"] = asm["dynCall_viiii"];
+
+Runtime.stackAlloc = function(size) { return asm['stackAlloc'](size) };
+Runtime.stackSave = function() { return asm['stackSave']() };
+Runtime.stackRestore = function(top) { asm['stackRestore'](top) };
+
+
+// Warning: printing of i64 values may be slightly rounded! No deep i64 math used, so precise i64 code not included
+var i64Math = null;
+
+// === Auto-generated postamble setup entry stuff ===
+
+if (memoryInitializer) {
+ if (ENVIRONMENT_IS_NODE || ENVIRONMENT_IS_SHELL) {
+ var data = Module['readBinary'](memoryInitializer);
+ HEAPU8.set(data, STATIC_BASE);
+ } else {
+ addRunDependency('memory initializer');
+ Browser.asyncLoad(memoryInitializer, function(data) {
+ HEAPU8.set(data, STATIC_BASE);
+ removeRunDependency('memory initializer');
+ }, function(data) {
+ throw 'could not load memory initializer ' + memoryInitializer;
+ });
+ }
+}
+
+function ExitStatus(status) {
+ this.name = "ExitStatus";
+ this.message = "Program terminated with exit(" + status + ")";
+ this.status = status;
+};
+ExitStatus.prototype = new Error();
+ExitStatus.prototype.constructor = ExitStatus;
+
+var initialStackTop;
+var preloadStartTime = null;
+var calledMain = false;
+
+dependenciesFulfilled = function runCaller() {
+ // If run has never been called, and we should call run (INVOKE_RUN is true, and Module.noInitialRun is not false)
+ if (!Module['calledRun'] && shouldRunNow) run([].concat(Module["arguments"]));
+ if (!Module['calledRun']) dependenciesFulfilled = runCaller; // try this again later, after new deps are fulfilled
+}
+
+Module['callMain'] = Module.callMain = function callMain(args) {
+ assert(runDependencies == 0, 'cannot call main when async dependencies remain! (listen on __ATMAIN__)');
+ assert(__ATPRERUN__.length == 0, 'cannot call main when preRun functions remain to be called');
+
+ args = args || [];
+
+ ensureInitRuntime();
+
+ var argc = args.length+1;
+ function pad() {
+ for (var i = 0; i < 4-1; i++) {
+ argv.push(0);
+ }
+ }
+ var argv = [allocate(intArrayFromString("/bin/this.program"), 'i8', ALLOC_NORMAL) ];
+ pad();
+ for (var i = 0; i < argc-1; i = i + 1) {
+ argv.push(allocate(intArrayFromString(args[i]), 'i8', ALLOC_NORMAL));
+ pad();
+ }
+ argv.push(0);
+ argv = allocate(argv, 'i32', ALLOC_NORMAL);
+
+ initialStackTop = STACKTOP;
+
+ try {
+
+ var ret = Module['_main'](argc, argv, 0);
+
+
+ // if we're not running an evented main loop, it's time to exit
+ if (!Module['noExitRuntime']) {
+ exit(ret);
+ }
+ }
+ catch(e) {
+ if (e instanceof ExitStatus) {
+ // exit() throws this once it's done to make sure execution
+ // has been stopped completely
+ return;
+ } else if (e == 'SimulateInfiniteLoop') {
+ // running an evented main loop, don't immediately exit
+ Module['noExitRuntime'] = true;
+ return;
+ } else {
+ if (e && typeof e === 'object' && e.stack) Module.printErr('exception thrown: ' + [e, e.stack]);
+ throw e;
+ }
+ } finally {
+ calledMain = true;
+ }
+}
+
+
+
+
+function run(args) {
+ args = args || Module['arguments'];
+
+ if (preloadStartTime === null) preloadStartTime = Date.now();
+
+ if (runDependencies > 0) {
+ Module.printErr('run() called, but dependencies remain, so not running');
+ return;
+ }
+
+ preRun();
+
+ if (runDependencies > 0) return; // a preRun added a dependency, run will be called later
+ if (Module['calledRun']) return; // run may have just been called through dependencies being fulfilled just in this very frame
+
+ function doRun() {
+ if (Module['calledRun']) return; // run may have just been called while the async setStatus time below was happening
+ Module['calledRun'] = true;
+
+ ensureInitRuntime();
+
+ preMain();
+
+ if (ENVIRONMENT_IS_WEB && preloadStartTime !== null) {
+ Module.printErr('pre-main prep time: ' + (Date.now() - preloadStartTime) + ' ms');
+ }
+
+ if (Module['_main'] && shouldRunNow) {
+ Module['callMain'](args);
+ }
+
+ postRun();
+ }
+
+ if (Module['setStatus']) {
+ Module['setStatus']('Running...');
+ setTimeout(function() {
+ setTimeout(function() {
+ Module['setStatus']('');
+ }, 1);
+ if (!ABORT) doRun();
+ }, 1);
+ } else {
+ doRun();
+ }
+}
+Module['run'] = Module.run = run;
+
+function exit(status) {
+ ABORT = true;
+ EXITSTATUS = status;
+ STACKTOP = initialStackTop;
+
+ // exit the runtime
+ exitRuntime();
+
+ // TODO We should handle this differently based on environment.
+ // In the browser, the best we can do is throw an exception
+ // to halt execution, but in node we could process.exit and
+ // I'd imagine SM shell would have something equivalent.
+ // This would let us set a proper exit status (which
+ // would be great for checking test exit statuses).
+ // https://github.com/kripken/emscripten/issues/1371
+
+ // throw an exception to halt the current execution
+ throw new ExitStatus(status);
+}
+Module['exit'] = Module.exit = exit;
+
+function abort(text) {
+ if (text) {
+ Module.print(text);
+ Module.printErr(text);
+ }
+
+ ABORT = true;
+ EXITSTATUS = 1;
+
+ var extra = '\nIf this abort() is unexpected, build with -s ASSERTIONS=1 which can give more information.';
+
+ throw 'abort() at ' + stackTrace() + extra;
+}
+Module['abort'] = Module.abort = abort;
+
+// {{PRE_RUN_ADDITIONS}}
+
+if (Module['preInit']) {
+ if (typeof Module['preInit'] == 'function') Module['preInit'] = [Module['preInit']];
+ while (Module['preInit'].length > 0) {
+ Module['preInit'].pop()();
+ }
+}
+
+// shouldRunNow refers to calling main(), not run().
+var shouldRunNow = true;
+if (Module['noInitialRun']) {
+ shouldRunNow = false;
+}
+
+
+run([].concat(Module["arguments"]));
diff --git a/test/mjsunit/wasm/embenchen/copy.js b/test/mjsunit/wasm/embenchen/copy.js
new file mode 100644
index 0000000..70609aa
--- /dev/null
+++ b/test/mjsunit/wasm/embenchen/copy.js
@@ -0,0 +1,5979 @@
+// Modified embenchen to direct to asm-wasm.
+// Flags: --expose-wasm
+
+var EXPECTED_OUTPUT = 'sum:8930\n';
+var Module = {
+ arguments: [1],
+ print: function(x) {Module.printBuffer += x + '\n';},
+ preRun: [function() {Module.printBuffer = ''}],
+ postRun: [function() {
+ assertEquals(EXPECTED_OUTPUT, Module.printBuffer);
+ }],
+};
+// The Module object: Our interface to the outside world. We import
+// and export values on it, and do the work to get that through
+// closure compiler if necessary. There are various ways Module can be used:
+// 1. Not defined. We create it here
+// 2. A function parameter, function(Module) { ..generated code.. }
+// 3. pre-run appended it, var Module = {}; ..generated code..
+// 4. External script tag defines var Module.
+// We need to do an eval in order to handle the closure compiler
+// case, where this code here is minified but Module was defined
+// elsewhere (e.g. case 4 above). We also need to check if Module
+// already exists (e.g. case 3 above).
+// Note that if you want to run closure, and also to use Module
+// after the generated code, you will need to define var Module = {};
+// before the code. Then that object will be used in the code, and you
+// can continue to use Module afterwards as well.
+var Module;
+if (!Module) Module = (typeof Module !== 'undefined' ? Module : null) || {};
+
+// Sometimes an existing Module object exists with properties
+// meant to overwrite the default module functionality. Here
+// we collect those properties and reapply _after_ we configure
+// the current environment's defaults to avoid having to be so
+// defensive during initialization.
+var moduleOverrides = {};
+for (var key in Module) {
+ if (Module.hasOwnProperty(key)) {
+ moduleOverrides[key] = Module[key];
+ }
+}
+
+// The environment setup code below is customized to use Module.
+// *** Environment setup code ***
+var ENVIRONMENT_IS_NODE = typeof process === 'object' && typeof require === 'function';
+var ENVIRONMENT_IS_WEB = typeof window === 'object';
+var ENVIRONMENT_IS_WORKER = typeof importScripts === 'function';
+var ENVIRONMENT_IS_SHELL = !ENVIRONMENT_IS_WEB && !ENVIRONMENT_IS_NODE && !ENVIRONMENT_IS_WORKER;
+
+if (ENVIRONMENT_IS_NODE) {
+ // Expose functionality in the same simple way that the shells work
+ // Note that we pollute the global namespace here, otherwise we break in node
+ if (!Module['print']) Module['print'] = function print(x) {
+ process['stdout'].write(x + '\n');
+ };
+ if (!Module['printErr']) Module['printErr'] = function printErr(x) {
+ process['stderr'].write(x + '\n');
+ };
+
+ var nodeFS = require('fs');
+ var nodePath = require('path');
+
+ Module['read'] = function read(filename, binary) {
+ filename = nodePath['normalize'](filename);
+ var ret = nodeFS['readFileSync'](filename);
+ // The path is absolute if the normalized version is the same as the resolved.
+ if (!ret && filename != nodePath['resolve'](filename)) {
+ filename = path.join(__dirname, '..', 'src', filename);
+ ret = nodeFS['readFileSync'](filename);
+ }
+ if (ret && !binary) ret = ret.toString();
+ return ret;
+ };
+
+ Module['readBinary'] = function readBinary(filename) { return Module['read'](filename, true) };
+
+ Module['load'] = function load(f) {
+ globalEval(read(f));
+ };
+
+ Module['arguments'] = process['argv'].slice(2);
+
+ module['exports'] = Module;
+}
+else if (ENVIRONMENT_IS_SHELL) {
+ if (!Module['print']) Module['print'] = print;
+ if (typeof printErr != 'undefined') Module['printErr'] = printErr; // not present in v8 or older sm
+
+ if (typeof read != 'undefined') {
+ Module['read'] = read;
+ } else {
+ Module['read'] = function read() { throw 'no read() available (jsc?)' };
+ }
+
+ Module['readBinary'] = function readBinary(f) {
+ return read(f, 'binary');
+ };
+
+ if (typeof scriptArgs != 'undefined') {
+ Module['arguments'] = scriptArgs;
+ } else if (typeof arguments != 'undefined') {
+ Module['arguments'] = arguments;
+ }
+
+ this['Module'] = Module;
+
+ eval("if (typeof gc === 'function' && gc.toString().indexOf('[native code]') > 0) var gc = undefined"); // wipe out the SpiderMonkey shell 'gc' function, which can confuse closure (uses it as a minified name, and it is then initted to a non-falsey value unexpectedly)
+}
+else if (ENVIRONMENT_IS_WEB || ENVIRONMENT_IS_WORKER) {
+ Module['read'] = function read(url) {
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, false);
+ xhr.send(null);
+ return xhr.responseText;
+ };
+
+ if (typeof arguments != 'undefined') {
+ Module['arguments'] = arguments;
+ }
+
+ if (typeof console !== 'undefined') {
+ if (!Module['print']) Module['print'] = function print(x) {
+ console.log(x);
+ };
+ if (!Module['printErr']) Module['printErr'] = function printErr(x) {
+ console.log(x);
+ };
+ } else {
+ // Probably a worker, and without console.log. We can do very little here...
+ var TRY_USE_DUMP = false;
+ if (!Module['print']) Module['print'] = (TRY_USE_DUMP && (typeof(dump) !== "undefined") ? (function(x) {
+ dump(x);
+ }) : (function(x) {
+ // self.postMessage(x); // enable this if you want stdout to be sent as messages
+ }));
+ }
+
+ if (ENVIRONMENT_IS_WEB) {
+ window['Module'] = Module;
+ } else {
+ Module['load'] = importScripts;
+ }
+}
+else {
+ // Unreachable because SHELL is dependant on the others
+ throw 'Unknown runtime environment. Where are we?';
+}
+
+function globalEval(x) {
+ eval.call(null, x);
+}
+if (!Module['load'] == 'undefined' && Module['read']) {
+ Module['load'] = function load(f) {
+ globalEval(Module['read'](f));
+ };
+}
+if (!Module['print']) {
+ Module['print'] = function(){};
+}
+if (!Module['printErr']) {
+ Module['printErr'] = Module['print'];
+}
+if (!Module['arguments']) {
+ Module['arguments'] = [];
+}
+// *** Environment setup code ***
+
+// Closure helpers
+Module.print = Module['print'];
+Module.printErr = Module['printErr'];
+
+// Callbacks
+Module['preRun'] = [];
+Module['postRun'] = [];
+
+// Merge back in the overrides
+for (var key in moduleOverrides) {
+ if (moduleOverrides.hasOwnProperty(key)) {
+ Module[key] = moduleOverrides[key];
+ }
+}
+
+
+
+// === Auto-generated preamble library stuff ===
+
+//========================================
+// Runtime code shared with compiler
+//========================================
+
+var Runtime = {
+ stackSave: function () {
+ return STACKTOP;
+ },
+ stackRestore: function (stackTop) {
+ STACKTOP = stackTop;
+ },
+ forceAlign: function (target, quantum) {
+ quantum = quantum || 4;
+ if (quantum == 1) return target;
+ if (isNumber(target) && isNumber(quantum)) {
+ return Math.ceil(target/quantum)*quantum;
+ } else if (isNumber(quantum) && isPowerOfTwo(quantum)) {
+ return '(((' +target + ')+' + (quantum-1) + ')&' + -quantum + ')';
+ }
+ return 'Math.ceil((' + target + ')/' + quantum + ')*' + quantum;
+ },
+ isNumberType: function (type) {
+ return type in Runtime.INT_TYPES || type in Runtime.FLOAT_TYPES;
+ },
+ isPointerType: function isPointerType(type) {
+ return type[type.length-1] == '*';
+},
+ isStructType: function isStructType(type) {
+ if (isPointerType(type)) return false;
+ if (isArrayType(type)) return true;
+ if (/<?\{ ?[^}]* ?\}>?/.test(type)) return true; // { i32, i8 } etc. - anonymous struct types
+ // See comment in isStructPointerType()
+ return type[0] == '%';
+},
+ INT_TYPES: {"i1":0,"i8":0,"i16":0,"i32":0,"i64":0},
+ FLOAT_TYPES: {"float":0,"double":0},
+ or64: function (x, y) {
+ var l = (x | 0) | (y | 0);
+ var h = (Math.round(x / 4294967296) | Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ and64: function (x, y) {
+ var l = (x | 0) & (y | 0);
+ var h = (Math.round(x / 4294967296) & Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ xor64: function (x, y) {
+ var l = (x | 0) ^ (y | 0);
+ var h = (Math.round(x / 4294967296) ^ Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ getNativeTypeSize: function (type) {
+ switch (type) {
+ case 'i1': case 'i8': return 1;
+ case 'i16': return 2;
+ case 'i32': return 4;
+ case 'i64': return 8;
+ case 'float': return 4;
+ case 'double': return 8;
+ default: {
+ if (type[type.length-1] === '*') {
+ return Runtime.QUANTUM_SIZE; // A pointer
+ } else if (type[0] === 'i') {
+ var bits = parseInt(type.substr(1));
+ assert(bits % 8 === 0);
+ return bits/8;
+ } else {
+ return 0;
+ }
+ }
+ }
+ },
+ getNativeFieldSize: function (type) {
+ return Math.max(Runtime.getNativeTypeSize(type), Runtime.QUANTUM_SIZE);
+ },
+ dedup: function dedup(items, ident) {
+ var seen = {};
+ if (ident) {
+ return items.filter(function(item) {
+ if (seen[item[ident]]) return false;
+ seen[item[ident]] = true;
+ return true;
+ });
+ } else {
+ return items.filter(function(item) {
+ if (seen[item]) return false;
+ seen[item] = true;
+ return true;
+ });
+ }
+},
+ set: function set() {
+ var args = typeof arguments[0] === 'object' ? arguments[0] : arguments;
+ var ret = {};
+ for (var i = 0; i < args.length; i++) {
+ ret[args[i]] = 0;
+ }
+ return ret;
+},
+ STACK_ALIGN: 8,
+ getAlignSize: function (type, size, vararg) {
+ // we align i64s and doubles on 64-bit boundaries, unlike x86
+ if (!vararg && (type == 'i64' || type == 'double')) return 8;
+ if (!type) return Math.min(size, 8); // align structures internally to 64 bits
+ return Math.min(size || (type ? Runtime.getNativeFieldSize(type) : 0), Runtime.QUANTUM_SIZE);
+ },
+ calculateStructAlignment: function calculateStructAlignment(type) {
+ type.flatSize = 0;
+ type.alignSize = 0;
+ var diffs = [];
+ var prev = -1;
+ var index = 0;
+ type.flatIndexes = type.fields.map(function(field) {
+ index++;
+ var size, alignSize;
+ if (Runtime.isNumberType(field) || Runtime.isPointerType(field)) {
+ size = Runtime.getNativeTypeSize(field); // pack char; char; in structs, also char[X]s.
+ alignSize = Runtime.getAlignSize(field, size);
+ } else if (Runtime.isStructType(field)) {
+ if (field[1] === '0') {
+ // this is [0 x something]. When inside another structure like here, it must be at the end,
+ // and it adds no size
+ // XXX this happens in java-nbody for example... assert(index === type.fields.length, 'zero-length in the middle!');
+ size = 0;
+ if (Types.types[field]) {
+ alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
+ } else {
+ alignSize = type.alignSize || QUANTUM_SIZE;
+ }
+ } else {
+ size = Types.types[field].flatSize;
+ alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
+ }
+ } else if (field[0] == 'b') {
+ // bN, large number field, like a [N x i8]
+ size = field.substr(1)|0;
+ alignSize = 1;
+ } else if (field[0] === '<') {
+ // vector type
+ size = alignSize = Types.types[field].flatSize; // fully aligned
+ } else if (field[0] === 'i') {
+ // illegal integer field, that could not be legalized because it is an internal structure field
+ // it is ok to have such fields, if we just use them as markers of field size and nothing more complex
+ size = alignSize = parseInt(field.substr(1))/8;
+ assert(size % 1 === 0, 'cannot handle non-byte-size field ' + field);
+ } else {
+ assert(false, 'invalid type for calculateStructAlignment');
+ }
+ if (type.packed) alignSize = 1;
+ type.alignSize = Math.max(type.alignSize, alignSize);
+ var curr = Runtime.alignMemory(type.flatSize, alignSize); // if necessary, place this on aligned memory
+ type.flatSize = curr + size;
+ if (prev >= 0) {
+ diffs.push(curr-prev);
+ }
+ prev = curr;
+ return curr;
+ });
+ if (type.name_ && type.name_[0] === '[') {
+ // arrays have 2 elements, so we get the proper difference. then we scale here. that way we avoid
+ // allocating a potentially huge array for [999999 x i8] etc.
+ type.flatSize = parseInt(type.name_.substr(1))*type.flatSize/2;
+ }
+ type.flatSize = Runtime.alignMemory(type.flatSize, type.alignSize);
+ if (diffs.length == 0) {
+ type.flatFactor = type.flatSize;
+ } else if (Runtime.dedup(diffs).length == 1) {
+ type.flatFactor = diffs[0];
+ }
+ type.needsFlattening = (type.flatFactor != 1);
+ return type.flatIndexes;
+ },
+ generateStructInfo: function (struct, typeName, offset) {
+ var type, alignment;
+ if (typeName) {
+ offset = offset || 0;
+ type = (typeof Types === 'undefined' ? Runtime.typeInfo : Types.types)[typeName];
+ if (!type) return null;
+ if (type.fields.length != struct.length) {
+ printErr('Number of named fields must match the type for ' + typeName + ': possibly duplicate struct names. Cannot return structInfo');
+ return null;
+ }
+ alignment = type.flatIndexes;
+ } else {
+ var type = { fields: struct.map(function(item) { return item[0] }) };
+ alignment = Runtime.calculateStructAlignment(type);
+ }
+ var ret = {
+ __size__: type.flatSize
+ };
+ if (typeName) {
+ struct.forEach(function(item, i) {
+ if (typeof item === 'string') {
+ ret[item] = alignment[i] + offset;
+ } else {
+ // embedded struct
+ var key;
+ for (var k in item) key = k;
+ ret[key] = Runtime.generateStructInfo(item[key], type.fields[i], alignment[i]);
+ }
+ });
+ } else {
+ struct.forEach(function(item, i) {
+ ret[item[1]] = alignment[i];
+ });
+ }
+ return ret;
+ },
+ dynCall: function (sig, ptr, args) {
+ if (args && args.length) {
+ if (!args.splice) args = Array.prototype.slice.call(args);
+ args.splice(0, 0, ptr);
+ return Module['dynCall_' + sig].apply(null, args);
+ } else {
+ return Module['dynCall_' + sig].call(null, ptr);
+ }
+ },
+ functionPointers: [],
+ addFunction: function (func) {
+ for (var i = 0; i < Runtime.functionPointers.length; i++) {
+ if (!Runtime.functionPointers[i]) {
+ Runtime.functionPointers[i] = func;
+ return 2*(1 + i);
+ }
+ }
+ throw 'Finished up all reserved function pointers. Use a higher value for RESERVED_FUNCTION_POINTERS.';
+ },
+ removeFunction: function (index) {
+ Runtime.functionPointers[(index-2)/2] = null;
+ },
+ getAsmConst: function (code, numArgs) {
+ // code is a constant string on the heap, so we can cache these
+ if (!Runtime.asmConstCache) Runtime.asmConstCache = {};
+ var func = Runtime.asmConstCache[code];
+ if (func) return func;
+ var args = [];
+ for (var i = 0; i < numArgs; i++) {
+ args.push(String.fromCharCode(36) + i); // $0, $1 etc
+ }
+ var source = Pointer_stringify(code);
+ if (source[0] === '"') {
+ // tolerate EM_ASM("..code..") even though EM_ASM(..code..) is correct
+ if (source.indexOf('"', 1) === source.length-1) {
+ source = source.substr(1, source.length-2);
+ } else {
+ // something invalid happened, e.g. EM_ASM("..code($0)..", input)
+ abort('invalid EM_ASM input |' + source + '|. Please use EM_ASM(..code..) (no quotes) or EM_ASM({ ..code($0).. }, input) (to input values)');
+ }
+ }
+ try {
+ var evalled = eval('(function(' + args.join(',') + '){ ' + source + ' })'); // new Function does not allow upvars in node
+ } catch(e) {
+ Module.printErr('error in executing inline EM_ASM code: ' + e + ' on: \n\n' + source + '\n\nwith args |' + args + '| (make sure to use the right one out of EM_ASM, EM_ASM_ARGS, etc.)');
+ throw e;
+ }
+ return Runtime.asmConstCache[code] = evalled;
+ },
+ warnOnce: function (text) {
+ if (!Runtime.warnOnce.shown) Runtime.warnOnce.shown = {};
+ if (!Runtime.warnOnce.shown[text]) {
+ Runtime.warnOnce.shown[text] = 1;
+ Module.printErr(text);
+ }
+ },
+ funcWrappers: {},
+ getFuncWrapper: function (func, sig) {
+ assert(sig);
+ if (!Runtime.funcWrappers[func]) {
+ Runtime.funcWrappers[func] = function dynCall_wrapper() {
+ return Runtime.dynCall(sig, func, arguments);
+ };
+ }
+ return Runtime.funcWrappers[func];
+ },
+ UTF8Processor: function () {
+ var buffer = [];
+ var needed = 0;
+ this.processCChar = function (code) {
+ code = code & 0xFF;
+
+ if (buffer.length == 0) {
+ if ((code & 0x80) == 0x00) { // 0xxxxxxx
+ return String.fromCharCode(code);
+ }
+ buffer.push(code);
+ if ((code & 0xE0) == 0xC0) { // 110xxxxx
+ needed = 1;
+ } else if ((code & 0xF0) == 0xE0) { // 1110xxxx
+ needed = 2;
+ } else { // 11110xxx
+ needed = 3;
+ }
+ return '';
+ }
+
+ if (needed) {
+ buffer.push(code);
+ needed--;
+ if (needed > 0) return '';
+ }
+
+ var c1 = buffer[0];
+ var c2 = buffer[1];
+ var c3 = buffer[2];
+ var c4 = buffer[3];
+ var ret;
+ if (buffer.length == 2) {
+ ret = String.fromCharCode(((c1 & 0x1F) << 6) | (c2 & 0x3F));
+ } else if (buffer.length == 3) {
+ ret = String.fromCharCode(((c1 & 0x0F) << 12) | ((c2 & 0x3F) << 6) | (c3 & 0x3F));
+ } else {
+ // http://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae
+ var codePoint = ((c1 & 0x07) << 18) | ((c2 & 0x3F) << 12) |
+ ((c3 & 0x3F) << 6) | (c4 & 0x3F);
+ ret = String.fromCharCode(
+ Math.floor((codePoint - 0x10000) / 0x400) + 0xD800,
+ (codePoint - 0x10000) % 0x400 + 0xDC00);
+ }
+ buffer.length = 0;
+ return ret;
+ }
+ this.processJSString = function processJSString(string) {
+ /* TODO: use TextEncoder when present,
+ var encoder = new TextEncoder();
+ encoder['encoding'] = "utf-8";
+ var utf8Array = encoder['encode'](aMsg.data);
+ */
+ string = unescape(encodeURIComponent(string));
+ var ret = [];
+ for (var i = 0; i < string.length; i++) {
+ ret.push(string.charCodeAt(i));
+ }
+ return ret;
+ }
+ },
+ getCompilerSetting: function (name) {
+ throw 'You must build with -s RETAIN_COMPILER_SETTINGS=1 for Runtime.getCompilerSetting or emscripten_get_compiler_setting to work';
+ },
+ stackAlloc: function (size) { var ret = STACKTOP;STACKTOP = (STACKTOP + size)|0;STACKTOP = (((STACKTOP)+7)&-8); return ret; },
+ staticAlloc: function (size) { var ret = STATICTOP;STATICTOP = (STATICTOP + size)|0;STATICTOP = (((STATICTOP)+7)&-8); return ret; },
+ dynamicAlloc: function (size) { var ret = DYNAMICTOP;DYNAMICTOP = (DYNAMICTOP + size)|0;DYNAMICTOP = (((DYNAMICTOP)+7)&-8); if (DYNAMICTOP >= TOTAL_MEMORY) enlargeMemory();; return ret; },
+ alignMemory: function (size,quantum) { var ret = size = Math.ceil((size)/(quantum ? quantum : 8))*(quantum ? quantum : 8); return ret; },
+ makeBigInt: function (low,high,unsigned) { var ret = (unsigned ? ((+((low>>>0)))+((+((high>>>0)))*(+4294967296))) : ((+((low>>>0)))+((+((high|0)))*(+4294967296)))); return ret; },
+ GLOBAL_BASE: 8,
+ QUANTUM_SIZE: 4,
+ __dummy__: 0
+}
+
+
+Module['Runtime'] = Runtime;
+
+
+
+
+
+
+
+
+
+//========================================
+// Runtime essentials
+//========================================
+
+var __THREW__ = 0; // Used in checking for thrown exceptions.
+
+var ABORT = false; // whether we are quitting the application. no code should run after this. set in exit() and abort()
+var EXITSTATUS = 0;
+
+var undef = 0;
+// tempInt is used for 32-bit signed values or smaller. tempBigInt is used
+// for 32-bit unsigned values or more than 32 bits. TODO: audit all uses of tempInt
+var tempValue, tempInt, tempBigInt, tempInt2, tempBigInt2, tempPair, tempBigIntI, tempBigIntR, tempBigIntS, tempBigIntP, tempBigIntD, tempDouble, tempFloat;
+var tempI64, tempI64b;
+var tempRet0, tempRet1, tempRet2, tempRet3, tempRet4, tempRet5, tempRet6, tempRet7, tempRet8, tempRet9;
+
+function assert(condition, text) {
+ if (!condition) {
+ abort('Assertion failed: ' + text);
+ }
+}
+
+var globalScope = this;
+
+// C calling interface. A convenient way to call C functions (in C files, or
+// defined with extern "C").
+//
+// Note: LLVM optimizations can inline and remove functions, after which you will not be
+// able to call them. Closure can also do so. To avoid that, add your function to
+// the exports using something like
+//
+// -s EXPORTED_FUNCTIONS='["_main", "_myfunc"]'
+//
+// @param ident The name of the C function (note that C++ functions will be name-mangled - use extern "C")
+// @param returnType The return type of the function, one of the JS types 'number', 'string' or 'array' (use 'number' for any C pointer, and
+// 'array' for JavaScript arrays and typed arrays; note that arrays are 8-bit).
+// @param argTypes An array of the types of arguments for the function (if there are no arguments, this can be ommitted). Types are as in returnType,
+// except that 'array' is not possible (there is no way for us to know the length of the array)
+// @param args An array of the arguments to the function, as native JS values (as in returnType)
+// Note that string arguments will be stored on the stack (the JS string will become a C string on the stack).
+// @return The return value, as a native JS value (as in returnType)
+function ccall(ident, returnType, argTypes, args) {
+ return ccallFunc(getCFunc(ident), returnType, argTypes, args);
+}
+Module["ccall"] = ccall;
+
+// Returns the C function with a specified identifier (for C++, you need to do manual name mangling)
+function getCFunc(ident) {
+ try {
+ var func = Module['_' + ident]; // closure exported function
+ if (!func) func = eval('_' + ident); // explicit lookup
+ } catch(e) {
+ }
+ assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');
+ return func;
+}
+
+// Internal function that does a C call using a function, not an identifier
+function ccallFunc(func, returnType, argTypes, args) {
+ var stack = 0;
+ function toC(value, type) {
+ if (type == 'string') {
+ if (value === null || value === undefined || value === 0) return 0; // null string
+ value = intArrayFromString(value);
+ type = 'array';
+ }
+ if (type == 'array') {
+ if (!stack) stack = Runtime.stackSave();
+ var ret = Runtime.stackAlloc(value.length);
+ writeArrayToMemory(value, ret);
+ return ret;
+ }
+ return value;
+ }
+ function fromC(value, type) {
+ if (type == 'string') {
+ return Pointer_stringify(value);
+ }
+ assert(type != 'array');
+ return value;
+ }
+ var i = 0;
+ var cArgs = args ? args.map(function(arg) {
+ return toC(arg, argTypes[i++]);
+ }) : [];
+ var ret = fromC(func.apply(null, cArgs), returnType);
+ if (stack) Runtime.stackRestore(stack);
+ return ret;
+}
+
+// Returns a native JS wrapper for a C function. This is similar to ccall, but
+// returns a function you can call repeatedly in a normal way. For example:
+//
+// var my_function = cwrap('my_c_function', 'number', ['number', 'number']);
+// alert(my_function(5, 22));
+// alert(my_function(99, 12));
+//
+function cwrap(ident, returnType, argTypes) {
+ var func = getCFunc(ident);
+ return function() {
+ return ccallFunc(func, returnType, argTypes, Array.prototype.slice.call(arguments));
+ }
+}
+Module["cwrap"] = cwrap;
+
+// Sets a value in memory in a dynamic way at run-time. Uses the
+// type data. This is the same as makeSetValue, except that
+// makeSetValue is done at compile-time and generates the needed
+// code then, whereas this function picks the right code at
+// run-time.
+// Note that setValue and getValue only do *aligned* writes and reads!
+// Note that ccall uses JS types as for defining types, while setValue and
+// getValue need LLVM types ('i8', 'i32') - this is a lower-level operation
+function setValue(ptr, value, type, noSafe) {
+ type = type || 'i8';
+ if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
+ switch(type) {
+ case 'i1': HEAP8[(ptr)]=value; break;
+ case 'i8': HEAP8[(ptr)]=value; break;
+ case 'i16': HEAP16[((ptr)>>1)]=value; break;
+ case 'i32': HEAP32[((ptr)>>2)]=value; break;
+ case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;
+ case 'float': HEAPF32[((ptr)>>2)]=value; break;
+ case 'double': HEAPF64[((ptr)>>3)]=value; break;
+ default: abort('invalid type for setValue: ' + type);
+ }
+}
+Module['setValue'] = setValue;
+
+// Parallel to setValue.
+function getValue(ptr, type, noSafe) {
+ type = type || 'i8';
+ if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
+ switch(type) {
+ case 'i1': return HEAP8[(ptr)];
+ case 'i8': return HEAP8[(ptr)];
+ case 'i16': return HEAP16[((ptr)>>1)];
+ case 'i32': return HEAP32[((ptr)>>2)];
+ case 'i64': return HEAP32[((ptr)>>2)];
+ case 'float': return HEAPF32[((ptr)>>2)];
+ case 'double': return HEAPF64[((ptr)>>3)];
+ default: abort('invalid type for setValue: ' + type);
+ }
+ return null;
+}
+Module['getValue'] = getValue;
+
+var ALLOC_NORMAL = 0; // Tries to use _malloc()
+var ALLOC_STACK = 1; // Lives for the duration of the current function call
+var ALLOC_STATIC = 2; // Cannot be freed
+var ALLOC_DYNAMIC = 3; // Cannot be freed except through sbrk
+var ALLOC_NONE = 4; // Do not allocate
+Module['ALLOC_NORMAL'] = ALLOC_NORMAL;
+Module['ALLOC_STACK'] = ALLOC_STACK;
+Module['ALLOC_STATIC'] = ALLOC_STATIC;
+Module['ALLOC_DYNAMIC'] = ALLOC_DYNAMIC;
+Module['ALLOC_NONE'] = ALLOC_NONE;
+
+// allocate(): This is for internal use. You can use it yourself as well, but the interface
+// is a little tricky (see docs right below). The reason is that it is optimized
+// for multiple syntaxes to save space in generated code. So you should
+// normally not use allocate(), and instead allocate memory using _malloc(),
+// initialize it with setValue(), and so forth.
+// @slab: An array of data, or a number. If a number, then the size of the block to allocate,
+// in *bytes* (note that this is sometimes confusing: the next parameter does not
+// affect this!)
+// @types: Either an array of types, one for each byte (or 0 if no type at that position),
+// or a single type which is used for the entire block. This only matters if there
+// is initial data - if @slab is a number, then this does not matter at all and is
+// ignored.
+// @allocator: How to allocate memory, see ALLOC_*
+function allocate(slab, types, allocator, ptr) {
+ var zeroinit, size;
+ if (typeof slab === 'number') {
+ zeroinit = true;
+ size = slab;
+ } else {
+ zeroinit = false;
+ size = slab.length;
+ }
+
+ var singleType = typeof types === 'string' ? types : null;
+
+ var ret;
+ if (allocator == ALLOC_NONE) {
+ ret = ptr;
+ } else {
+ ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));
+ }
+
+ if (zeroinit) {
+ var ptr = ret, stop;
+ assert((ret & 3) == 0);
+ stop = ret + (size & ~3);
+ for (; ptr < stop; ptr += 4) {
+ HEAP32[((ptr)>>2)]=0;
+ }
+ stop = ret + size;
+ while (ptr < stop) {
+ HEAP8[((ptr++)|0)]=0;
+ }
+ return ret;
+ }
+
+ if (singleType === 'i8') {
+ if (slab.subarray || slab.slice) {
+ HEAPU8.set(slab, ret);
+ } else {
+ HEAPU8.set(new Uint8Array(slab), ret);
+ }
+ return ret;
+ }
+
+ var i = 0, type, typeSize, previousType;
+ while (i < size) {
+ var curr = slab[i];
+
+ if (typeof curr === 'function') {
+ curr = Runtime.getFunctionIndex(curr);
+ }
+
+ type = singleType || types[i];
+ if (type === 0) {
+ i++;
+ continue;
+ }
+
+ if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later
+
+ setValue(ret+i, curr, type);
+
+ // no need to look up size unless type changes, so cache it
+ if (previousType !== type) {
+ typeSize = Runtime.getNativeTypeSize(type);
+ previousType = type;
+ }
+ i += typeSize;
+ }
+
+ return ret;
+}
+Module['allocate'] = allocate;
+
+function Pointer_stringify(ptr, /* optional */ length) {
+ // TODO: use TextDecoder
+ // Find the length, and check for UTF while doing so
+ var hasUtf = false;
+ var t;
+ var i = 0;
+ while (1) {
+ t = HEAPU8[(((ptr)+(i))|0)];
+ if (t >= 128) hasUtf = true;
+ else if (t == 0 && !length) break;
+ i++;
+ if (length && i == length) break;
+ }
+ if (!length) length = i;
+
+ var ret = '';
+
+ if (!hasUtf) {
+ var MAX_CHUNK = 1024; // split up into chunks, because .apply on a huge string can overflow the stack
+ var curr;
+ while (length > 0) {
+ curr = String.fromCharCode.apply(String, HEAPU8.subarray(ptr, ptr + Math.min(length, MAX_CHUNK)));
+ ret = ret ? ret + curr : curr;
+ ptr += MAX_CHUNK;
+ length -= MAX_CHUNK;
+ }
+ return ret;
+ }
+
+ var utf8 = new Runtime.UTF8Processor();
+ for (i = 0; i < length; i++) {
+ t = HEAPU8[(((ptr)+(i))|0)];
+ ret += utf8.processCChar(t);
+ }
+ return ret;
+}
+Module['Pointer_stringify'] = Pointer_stringify;
+
+// Given a pointer 'ptr' to a null-terminated UTF16LE-encoded string in the emscripten HEAP, returns
+// a copy of that string as a Javascript String object.
+function UTF16ToString(ptr) {
+ var i = 0;
+
+ var str = '';
+ while (1) {
+ var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];
+ if (codeUnit == 0)
+ return str;
+ ++i;
+ // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.
+ str += String.fromCharCode(codeUnit);
+ }
+}
+Module['UTF16ToString'] = UTF16ToString;
+
+// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
+// null-terminated and encoded in UTF16LE form. The copy will require at most (str.length*2+1)*2 bytes of space in the HEAP.
+function stringToUTF16(str, outPtr) {
+ for(var i = 0; i < str.length; ++i) {
+ // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.
+ var codeUnit = str.charCodeAt(i); // possibly a lead surrogate
+ HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;
+ }
+ // Null-terminate the pointer to the HEAP.
+ HEAP16[(((outPtr)+(str.length*2))>>1)]=0;
+}
+Module['stringToUTF16'] = stringToUTF16;
+
+// Given a pointer 'ptr' to a null-terminated UTF32LE-encoded string in the emscripten HEAP, returns
+// a copy of that string as a Javascript String object.
+function UTF32ToString(ptr) {
+ var i = 0;
+
+ var str = '';
+ while (1) {
+ var utf32 = HEAP32[(((ptr)+(i*4))>>2)];
+ if (utf32 == 0)
+ return str;
+ ++i;
+ // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.
+ if (utf32 >= 0x10000) {
+ var ch = utf32 - 0x10000;
+ str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));
+ } else {
+ str += String.fromCharCode(utf32);
+ }
+ }
+}
+Module['UTF32ToString'] = UTF32ToString;
+
+// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
+// null-terminated and encoded in UTF32LE form. The copy will require at most (str.length+1)*4 bytes of space in the HEAP,
+// but can use less, since str.length does not return the number of characters in the string, but the number of UTF-16 code units in the string.
+function stringToUTF32(str, outPtr) {
+ var iChar = 0;
+ for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {
+ // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.
+ var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate
+ if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {
+ var trailSurrogate = str.charCodeAt(++iCodeUnit);
+ codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);
+ }
+ HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;
+ ++iChar;
+ }
+ // Null-terminate the pointer to the HEAP.
+ HEAP32[(((outPtr)+(iChar*4))>>2)]=0;
+}
+Module['stringToUTF32'] = stringToUTF32;
+
+function demangle(func) {
+ var i = 3;
+ // params, etc.
+ var basicTypes = {
+ 'v': 'void',
+ 'b': 'bool',
+ 'c': 'char',
+ 's': 'short',
+ 'i': 'int',
+ 'l': 'long',
+ 'f': 'float',
+ 'd': 'double',
+ 'w': 'wchar_t',
+ 'a': 'signed char',
+ 'h': 'unsigned char',
+ 't': 'unsigned short',
+ 'j': 'unsigned int',
+ 'm': 'unsigned long',
+ 'x': 'long long',
+ 'y': 'unsigned long long',
+ 'z': '...'
+ };
+ var subs = [];
+ var first = true;
+ function dump(x) {
+ //return;
+ if (x) Module.print(x);
+ Module.print(func);
+ var pre = '';
+ for (var a = 0; a < i; a++) pre += ' ';
+ Module.print (pre + '^');
+ }
+ function parseNested() {
+ i++;
+ if (func[i] === 'K') i++; // ignore const
+ var parts = [];
+ while (func[i] !== 'E') {
+ if (func[i] === 'S') { // substitution
+ i++;
+ var next = func.indexOf('_', i);
+ var num = func.substring(i, next) || 0;
+ parts.push(subs[num] || '?');
+ i = next+1;
+ continue;
+ }
+ if (func[i] === 'C') { // constructor
+ parts.push(parts[parts.length-1]);
+ i += 2;
+ continue;
+ }
+ var size = parseInt(func.substr(i));
+ var pre = size.toString().length;
+ if (!size || !pre) { i--; break; } // counter i++ below us
+ var curr = func.substr(i + pre, size);
+ parts.push(curr);
+ subs.push(curr);
+ i += pre + size;
+ }
+ i++; // skip E
+ return parts;
+ }
+ function parse(rawList, limit, allowVoid) { // main parser
+ limit = limit || Infinity;
+ var ret = '', list = [];
+ function flushList() {
+ return '(' + list.join(', ') + ')';
+ }
+ var name;
+ if (func[i] === 'N') {
+ // namespaced N-E
+ name = parseNested().join('::');
+ limit--;
+ if (limit === 0) return rawList ? [name] : name;
+ } else {
+ // not namespaced
+ if (func[i] === 'K' || (first && func[i] === 'L')) i++; // ignore const and first 'L'
+ var size = parseInt(func.substr(i));
+ if (size) {
+ var pre = size.toString().length;
+ name = func.substr(i + pre, size);
+ i += pre + size;
+ }
+ }
+ first = false;
+ if (func[i] === 'I') {
+ i++;
+ var iList = parse(true);
+ var iRet = parse(true, 1, true);
+ ret += iRet[0] + ' ' + name + '<' + iList.join(', ') + '>';
+ } else {
+ ret = name;
+ }
+ paramLoop: while (i < func.length && limit-- > 0) {
+ //dump('paramLoop');
+ var c = func[i++];
+ if (c in basicTypes) {
+ list.push(basicTypes[c]);
+ } else {
+ switch (c) {
+ case 'P': list.push(parse(true, 1, true)[0] + '*'); break; // pointer
+ case 'R': list.push(parse(true, 1, true)[0] + '&'); break; // reference
+ case 'L': { // literal
+ i++; // skip basic type
+ var end = func.indexOf('E', i);
+ var size = end - i;
+ list.push(func.substr(i, size));
+ i += size + 2; // size + 'EE'
+ break;
+ }
+ case 'A': { // array
+ var size = parseInt(func.substr(i));
+ i += size.toString().length;
+ if (func[i] !== '_') throw '?';
+ i++; // skip _
+ list.push(parse(true, 1, true)[0] + ' [' + size + ']');
+ break;
+ }
+ case 'E': break paramLoop;
+ default: ret += '?' + c; break paramLoop;
+ }
+ }
+ }
+ if (!allowVoid && list.length === 1 && list[0] === 'void') list = []; // avoid (void)
+ if (rawList) {
+ if (ret) {
+ list.push(ret + '?');
+ }
+ return list;
+ } else {
+ return ret + flushList();
+ }
+ }
+ try {
+ // Special-case the entry point, since its name differs from other name mangling.
+ if (func == 'Object._main' || func == '_main') {
+ return 'main()';
+ }
+ if (typeof func === 'number') func = Pointer_stringify(func);
+ if (func[0] !== '_') return func;
+ if (func[1] !== '_') return func; // C function
+ if (func[2] !== 'Z') return func;
+ switch (func[3]) {
+ case 'n': return 'operator new()';
+ case 'd': return 'operator delete()';
+ }
+ return parse();
+ } catch(e) {
+ return func;
+ }
+}
+
+function demangleAll(text) {
+ return text.replace(/__Z[\w\d_]+/g, function(x) { var y = demangle(x); return x === y ? x : (x + ' [' + y + ']') });
+}
+
+function stackTrace() {
+ var stack = new Error().stack;
+ return stack ? demangleAll(stack) : '(no stack trace available)'; // Stack trace is not available at least on IE10 and Safari 6.
+}
+
+// Memory management
+
+var PAGE_SIZE = 4096;
+function alignMemoryPage(x) {
+ return (x+4095)&-4096;
+}
+
+var HEAP;
+var HEAP8, HEAPU8, HEAP16, HEAPU16, HEAP32, HEAPU32, HEAPF32, HEAPF64;
+
+var STATIC_BASE = 0, STATICTOP = 0, staticSealed = false; // static area
+var STACK_BASE = 0, STACKTOP = 0, STACK_MAX = 0; // stack area
+var DYNAMIC_BASE = 0, DYNAMICTOP = 0; // dynamic area handled by sbrk
+
+function enlargeMemory() {
+ abort('Cannot enlarge memory arrays. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value ' + TOTAL_MEMORY + ', (2) compile with ALLOW_MEMORY_GROWTH which adjusts the size at runtime but prevents some optimizations, or (3) set Module.TOTAL_MEMORY before the program runs.');
+}
+
+var TOTAL_STACK = Module['TOTAL_STACK'] || 5242880;
+var TOTAL_MEMORY = Module['TOTAL_MEMORY'] || 134217728;
+var FAST_MEMORY = Module['FAST_MEMORY'] || 2097152;
+
+var totalMemory = 4096;
+while (totalMemory < TOTAL_MEMORY || totalMemory < 2*TOTAL_STACK) {
+ if (totalMemory < 16*1024*1024) {
+ totalMemory *= 2;
+ } else {
+ totalMemory += 16*1024*1024
+ }
+}
+if (totalMemory !== TOTAL_MEMORY) {
+ Module.printErr('increasing TOTAL_MEMORY to ' + totalMemory + ' to be more reasonable');
+ TOTAL_MEMORY = totalMemory;
+}
+
+// Initialize the runtime's memory
+// check for full engine support (use string 'subarray' to avoid closure compiler confusion)
+assert(typeof Int32Array !== 'undefined' && typeof Float64Array !== 'undefined' && !!(new Int32Array(1)['subarray']) && !!(new Int32Array(1)['set']),
+ 'JS engine does not provide full typed array support');
+
+var buffer = new ArrayBuffer(TOTAL_MEMORY);
+HEAP8 = new Int8Array(buffer);
+HEAP16 = new Int16Array(buffer);
+HEAP32 = new Int32Array(buffer);
+HEAPU8 = new Uint8Array(buffer);
+HEAPU16 = new Uint16Array(buffer);
+HEAPU32 = new Uint32Array(buffer);
+HEAPF32 = new Float32Array(buffer);
+HEAPF64 = new Float64Array(buffer);
+
+// Endianness check (note: assumes compiler arch was little-endian)
+HEAP32[0] = 255;
+assert(HEAPU8[0] === 255 && HEAPU8[3] === 0, 'Typed arrays 2 must be run on a little-endian system');
+
+Module['HEAP'] = HEAP;
+Module['HEAP8'] = HEAP8;
+Module['HEAP16'] = HEAP16;
+Module['HEAP32'] = HEAP32;
+Module['HEAPU8'] = HEAPU8;
+Module['HEAPU16'] = HEAPU16;
+Module['HEAPU32'] = HEAPU32;
+Module['HEAPF32'] = HEAPF32;
+Module['HEAPF64'] = HEAPF64;
+
+function callRuntimeCallbacks(callbacks) {
+ while(callbacks.length > 0) {
+ var callback = callbacks.shift();
+ if (typeof callback == 'function') {
+ callback();
+ continue;
+ }
+ var func = callback.func;
+ if (typeof func === 'number') {
+ if (callback.arg === undefined) {
+ Runtime.dynCall('v', func);
+ } else {
+ Runtime.dynCall('vi', func, [callback.arg]);
+ }
+ } else {
+ func(callback.arg === undefined ? null : callback.arg);
+ }
+ }
+}
+
+var __ATPRERUN__ = []; // functions called before the runtime is initialized
+var __ATINIT__ = []; // functions called during startup
+var __ATMAIN__ = []; // functions called when main() is to be run
+var __ATEXIT__ = []; // functions called during shutdown
+var __ATPOSTRUN__ = []; // functions called after the runtime has exited
+
+var runtimeInitialized = false;
+
+function preRun() {
+ // compatibility - merge in anything from Module['preRun'] at this time
+ if (Module['preRun']) {
+ if (typeof Module['preRun'] == 'function') Module['preRun'] = [Module['preRun']];
+ while (Module['preRun'].length) {
+ addOnPreRun(Module['preRun'].shift());
+ }
+ }
+ callRuntimeCallbacks(__ATPRERUN__);
+}
+
+function ensureInitRuntime() {
+ if (runtimeInitialized) return;
+ runtimeInitialized = true;
+ callRuntimeCallbacks(__ATINIT__);
+}
+
+function preMain() {
+ callRuntimeCallbacks(__ATMAIN__);
+}
+
+function exitRuntime() {
+ callRuntimeCallbacks(__ATEXIT__);
+}
+
+function postRun() {
+ // compatibility - merge in anything from Module['postRun'] at this time
+ if (Module['postRun']) {
+ if (typeof Module['postRun'] == 'function') Module['postRun'] = [Module['postRun']];
+ while (Module['postRun'].length) {
+ addOnPostRun(Module['postRun'].shift());
+ }
+ }
+ callRuntimeCallbacks(__ATPOSTRUN__);
+}
+
+function addOnPreRun(cb) {
+ __ATPRERUN__.unshift(cb);
+}
+Module['addOnPreRun'] = Module.addOnPreRun = addOnPreRun;
+
+function addOnInit(cb) {
+ __ATINIT__.unshift(cb);
+}
+Module['addOnInit'] = Module.addOnInit = addOnInit;
+
+function addOnPreMain(cb) {
+ __ATMAIN__.unshift(cb);
+}
+Module['addOnPreMain'] = Module.addOnPreMain = addOnPreMain;
+
+function addOnExit(cb) {
+ __ATEXIT__.unshift(cb);
+}
+Module['addOnExit'] = Module.addOnExit = addOnExit;
+
+function addOnPostRun(cb) {
+ __ATPOSTRUN__.unshift(cb);
+}
+Module['addOnPostRun'] = Module.addOnPostRun = addOnPostRun;
+
+// Tools
+
+// This processes a JS string into a C-line array of numbers, 0-terminated.
+// For LLVM-originating strings, see parser.js:parseLLVMString function
+function intArrayFromString(stringy, dontAddNull, length /* optional */) {
+ var ret = (new Runtime.UTF8Processor()).processJSString(stringy);
+ if (length) {
+ ret.length = length;
+ }
+ if (!dontAddNull) {
+ ret.push(0);
+ }
+ return ret;
+}
+Module['intArrayFromString'] = intArrayFromString;
+
+function intArrayToString(array) {
+ var ret = [];
+ for (var i = 0; i < array.length; i++) {
+ var chr = array[i];
+ if (chr > 0xFF) {
+ chr &= 0xFF;
+ }
+ ret.push(String.fromCharCode(chr));
+ }
+ return ret.join('');
+}
+Module['intArrayToString'] = intArrayToString;
+
+// Write a Javascript array to somewhere in the heap
+function writeStringToMemory(string, buffer, dontAddNull) {
+ var array = intArrayFromString(string, dontAddNull);
+ var i = 0;
+ while (i < array.length) {
+ var chr = array[i];
+ HEAP8[(((buffer)+(i))|0)]=chr;
+ i = i + 1;
+ }
+}
+Module['writeStringToMemory'] = writeStringToMemory;
+
+function writeArrayToMemory(array, buffer) {
+ for (var i = 0; i < array.length; i++) {
+ HEAP8[(((buffer)+(i))|0)]=array[i];
+ }
+}
+Module['writeArrayToMemory'] = writeArrayToMemory;
+
+function writeAsciiToMemory(str, buffer, dontAddNull) {
+ for (var i = 0; i < str.length; i++) {
+ HEAP8[(((buffer)+(i))|0)]=str.charCodeAt(i);
+ }
+ if (!dontAddNull) HEAP8[(((buffer)+(str.length))|0)]=0;
+}
+Module['writeAsciiToMemory'] = writeAsciiToMemory;
+
+function unSign(value, bits, ignore) {
+ if (value >= 0) {
+ return value;
+ }
+ return bits <= 32 ? 2*Math.abs(1 << (bits-1)) + value // Need some trickery, since if bits == 32, we are right at the limit of the bits JS uses in bitshifts
+ : Math.pow(2, bits) + value;
+}
+function reSign(value, bits, ignore) {
+ if (value <= 0) {
+ return value;
+ }
+ var half = bits <= 32 ? Math.abs(1 << (bits-1)) // abs is needed if bits == 32
+ : Math.pow(2, bits-1);
+ if (value >= half && (bits <= 32 || value > half)) { // for huge values, we can hit the precision limit and always get true here. so don't do that
+ // but, in general there is no perfect solution here. With 64-bit ints, we get rounding and errors
+ // TODO: In i64 mode 1, resign the two parts separately and safely
+ value = -2*half + value; // Cannot bitshift half, as it may be at the limit of the bits JS uses in bitshifts
+ }
+ return value;
+}
+
+// check for imul support, and also for correctness ( https://bugs.webkit.org/show_bug.cgi?id=126345 )
+if (!Math['imul'] || Math['imul'](0xffffffff, 5) !== -5) Math['imul'] = function imul(a, b) {
+ var ah = a >>> 16;
+ var al = a & 0xffff;
+ var bh = b >>> 16;
+ var bl = b & 0xffff;
+ return (al*bl + ((ah*bl + al*bh) << 16))|0;
+};
+Math.imul = Math['imul'];
+
+
+var Math_abs = Math.abs;
+var Math_cos = Math.cos;
+var Math_sin = Math.sin;
+var Math_tan = Math.tan;
+var Math_acos = Math.acos;
+var Math_asin = Math.asin;
+var Math_atan = Math.atan;
+var Math_atan2 = Math.atan2;
+var Math_exp = Math.exp;
+var Math_log = Math.log;
+var Math_sqrt = Math.sqrt;
+var Math_ceil = Math.ceil;
+var Math_floor = Math.floor;
+var Math_pow = Math.pow;
+var Math_imul = Math.imul;
+var Math_fround = Math.fround;
+var Math_min = Math.min;
+
+// A counter of dependencies for calling run(). If we need to
+// do asynchronous work before running, increment this and
+// decrement it. Incrementing must happen in a place like
+// PRE_RUN_ADDITIONS (used by emcc to add file preloading).
+// Note that you can add dependencies in preRun, even though
+// it happens right before run - run will be postponed until
+// the dependencies are met.
+var runDependencies = 0;
+var runDependencyWatcher = null;
+var dependenciesFulfilled = null; // overridden to take different actions when all run dependencies are fulfilled
+
+function addRunDependency(id) {
+ runDependencies++;
+ if (Module['monitorRunDependencies']) {
+ Module['monitorRunDependencies'](runDependencies);
+ }
+}
+Module['addRunDependency'] = addRunDependency;
+function removeRunDependency(id) {
+ runDependencies--;
+ if (Module['monitorRunDependencies']) {
+ Module['monitorRunDependencies'](runDependencies);
+ }
+ if (runDependencies == 0) {
+ if (runDependencyWatcher !== null) {
+ clearInterval(runDependencyWatcher);
+ runDependencyWatcher = null;
+ }
+ if (dependenciesFulfilled) {
+ var callback = dependenciesFulfilled;
+ dependenciesFulfilled = null;
+ callback(); // can add another dependenciesFulfilled
+ }
+ }
+}
+Module['removeRunDependency'] = removeRunDependency;
+
+Module["preloadedImages"] = {}; // maps url to image data
+Module["preloadedAudios"] = {}; // maps url to audio data
+
+
+var memoryInitializer = null;
+
+// === Body ===
+
+
+
+
+
+STATIC_BASE = 8;
+
+STATICTOP = STATIC_BASE + Runtime.alignMemory(27);
+/* global initializers */ __ATINIT__.push();
+
+
+/* memory initializer */ allocate([101,114,114,111,114,58,32,37,100,92,110,0,0,0,0,0,115,117,109,58,37,100,10,0], "i8", ALLOC_NONE, Runtime.GLOBAL_BASE);
+
+
+
+
+var tempDoublePtr = Runtime.alignMemory(allocate(12, "i8", ALLOC_STATIC), 8);
+
+assert(tempDoublePtr % 8 == 0);
+
+function copyTempFloat(ptr) { // functions, because inlining this code increases code size too much
+
+ HEAP8[tempDoublePtr] = HEAP8[ptr];
+
+ HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
+
+ HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
+
+ HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
+
+}
+
+function copyTempDouble(ptr) {
+
+ HEAP8[tempDoublePtr] = HEAP8[ptr];
+
+ HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
+
+ HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
+
+ HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
+
+ HEAP8[tempDoublePtr+4] = HEAP8[ptr+4];
+
+ HEAP8[tempDoublePtr+5] = HEAP8[ptr+5];
+
+ HEAP8[tempDoublePtr+6] = HEAP8[ptr+6];
+
+ HEAP8[tempDoublePtr+7] = HEAP8[ptr+7];
+
+}
+
+
+ function _malloc(bytes) {
+ /* Over-allocate to make sure it is byte-aligned by 8.
+ * This will leak memory, but this is only the dummy
+ * implementation (replaced by dlmalloc normally) so
+ * not an issue.
+ */
+ var ptr = Runtime.dynamicAlloc(bytes + 8);
+ return (ptr+8) & 0xFFFFFFF8;
+ }
+ Module["_malloc"] = _malloc;
+
+
+
+
+ var ERRNO_CODES={EPERM:1,ENOENT:2,ESRCH:3,EINTR:4,EIO:5,ENXIO:6,E2BIG:7,ENOEXEC:8,EBADF:9,ECHILD:10,EAGAIN:11,EWOULDBLOCK:11,ENOMEM:12,EACCES:13,EFAULT:14,ENOTBLK:15,EBUSY:16,EEXIST:17,EXDEV:18,ENODEV:19,ENOTDIR:20,EISDIR:21,EINVAL:22,ENFILE:23,EMFILE:24,ENOTTY:25,ETXTBSY:26,EFBIG:27,ENOSPC:28,ESPIPE:29,EROFS:30,EMLINK:31,EPIPE:32,EDOM:33,ERANGE:34,ENOMSG:42,EIDRM:43,ECHRNG:44,EL2NSYNC:45,EL3HLT:46,EL3RST:47,ELNRNG:48,EUNATCH:49,ENOCSI:50,EL2HLT:51,EDEADLK:35,ENOLCK:37,EBADE:52,EBADR:53,EXFULL:54,ENOANO:55,EBADRQC:56,EBADSLT:57,EDEADLOCK:35,EBFONT:59,ENOSTR:60,ENODATA:61,ETIME:62,ENOSR:63,ENONET:64,ENOPKG:65,EREMOTE:66,ENOLINK:67,EADV:68,ESRMNT:69,ECOMM:70,EPROTO:71,EMULTIHOP:72,EDOTDOT:73,EBADMSG:74,ENOTUNIQ:76,EBADFD:77,EREMCHG:78,ELIBACC:79,ELIBBAD:80,ELIBSCN:81,ELIBMAX:82,ELIBEXEC:83,ENOSYS:38,ENOTEMPTY:39,ENAMETOOLONG:36,ELOOP:40,EOPNOTSUPP:95,EPFNOSUPPORT:96,ECONNRESET:104,ENOBUFS:105,EAFNOSUPPORT:97,EPROTOTYPE:91,ENOTSOCK:88,ENOPROTOOPT:92,ESHUTDOWN:108,ECONNREFUSED:111,EADDRINUSE:98,ECONNABORTED:103,ENETUNREACH:101,ENETDOWN:100,ETIMEDOUT:110,EHOSTDOWN:112,EHOSTUNREACH:113,EINPROGRESS:115,EALREADY:114,EDESTADDRREQ:89,EMSGSIZE:90,EPROTONOSUPPORT:93,ESOCKTNOSUPPORT:94,EADDRNOTAVAIL:99,ENETRESET:102,EISCONN:106,ENOTCONN:107,ETOOMANYREFS:109,EUSERS:87,EDQUOT:122,ESTALE:116,ENOTSUP:95,ENOMEDIUM:123,EILSEQ:84,EOVERFLOW:75,ECANCELED:125,ENOTRECOVERABLE:131,EOWNERDEAD:130,ESTRPIPE:86};
+
+ var ERRNO_MESSAGES={0:"Success",1:"Not super-user",2:"No such file or directory",3:"No such process",4:"Interrupted system call",5:"I/O error",6:"No such device or address",7:"Arg list too long",8:"Exec format error",9:"Bad file number",10:"No children",11:"No more processes",12:"Not enough core",13:"Permission denied",14:"Bad address",15:"Block device required",16:"Mount device busy",17:"File exists",18:"Cross-device link",19:"No such device",20:"Not a directory",21:"Is a directory",22:"Invalid argument",23:"Too many open files in system",24:"Too many open files",25:"Not a typewriter",26:"Text file busy",27:"File too large",28:"No space left on device",29:"Illegal seek",30:"Read only file system",31:"Too many links",32:"Broken pipe",33:"Math arg out of domain of func",34:"Math result not representable",35:"File locking deadlock error",36:"File or path name too long",37:"No record locks available",38:"Function not implemented",39:"Directory not empty",40:"Too many symbolic links",42:"No message of desired type",43:"Identifier removed",44:"Channel number out of range",45:"Level 2 not synchronized",46:"Level 3 halted",47:"Level 3 reset",48:"Link number out of range",49:"Protocol driver not attached",50:"No CSI structure available",51:"Level 2 halted",52:"Invalid exchange",53:"Invalid request descriptor",54:"Exchange full",55:"No anode",56:"Invalid request code",57:"Invalid slot",59:"Bad font file fmt",60:"Device not a stream",61:"No data (for no delay io)",62:"Timer expired",63:"Out of streams resources",64:"Machine is not on the network",65:"Package not installed",66:"The object is remote",67:"The link has been severed",68:"Advertise error",69:"Srmount error",70:"Communication error on send",71:"Protocol error",72:"Multihop attempted",73:"Cross mount point (not really error)",74:"Trying to read unreadable message",75:"Value too large for defined data type",76:"Given log. name not unique",77:"f.d. invalid for this operation",78:"Remote address changed",79:"Can access a needed shared lib",80:"Accessing a corrupted shared lib",81:".lib section in a.out corrupted",82:"Attempting to link in too many libs",83:"Attempting to exec a shared library",84:"Illegal byte sequence",86:"Streams pipe error",87:"Too many users",88:"Socket operation on non-socket",89:"Destination address required",90:"Message too long",91:"Protocol wrong type for socket",92:"Protocol not available",93:"Unknown protocol",94:"Socket type not supported",95:"Not supported",96:"Protocol family not supported",97:"Address family not supported by protocol family",98:"Address already in use",99:"Address not available",100:"Network interface is not configured",101:"Network is unreachable",102:"Connection reset by network",103:"Connection aborted",104:"Connection reset by peer",105:"No buffer space available",106:"Socket is already connected",107:"Socket is not connected",108:"Can't send after socket shutdown",109:"Too many references",110:"Connection timed out",111:"Connection refused",112:"Host is down",113:"Host is unreachable",114:"Socket already connected",115:"Connection already in progress",116:"Stale file handle",122:"Quota exceeded",123:"No medium (in tape drive)",125:"Operation canceled",130:"Previous owner died",131:"State not recoverable"};
+
+
+ var ___errno_state=0;function ___setErrNo(value) {
+ // For convenient setting and returning of errno.
+ HEAP32[((___errno_state)>>2)]=value;
+ return value;
+ }
+
+ var TTY={ttys:[],init:function () {
+ // https://github.com/kripken/emscripten/pull/1555
+ // if (ENVIRONMENT_IS_NODE) {
+ // // currently, FS.init does not distinguish if process.stdin is a file or TTY
+ // // device, it always assumes it's a TTY device. because of this, we're forcing
+ // // process.stdin to UTF8 encoding to at least make stdin reading compatible
+ // // with text files until FS.init can be refactored.
+ // process['stdin']['setEncoding']('utf8');
+ // }
+ },shutdown:function () {
+ // https://github.com/kripken/emscripten/pull/1555
+ // if (ENVIRONMENT_IS_NODE) {
+ // // inolen: any idea as to why node -e 'process.stdin.read()' wouldn't exit immediately (with process.stdin being a tty)?
+ // // isaacs: because now it's reading from the stream, you've expressed interest in it, so that read() kicks off a _read() which creates a ReadReq operation
+ // // inolen: I thought read() in that case was a synchronous operation that just grabbed some amount of buffered data if it exists?
+ // // isaacs: it is. but it also triggers a _read() call, which calls readStart() on the handle
+ // // isaacs: do process.stdin.pause() and i'd think it'd probably close the pending call
+ // process['stdin']['pause']();
+ // }
+ },register:function (dev, ops) {
+ TTY.ttys[dev] = { input: [], output: [], ops: ops };
+ FS.registerDevice(dev, TTY.stream_ops);
+ },stream_ops:{open:function (stream) {
+ var tty = TTY.ttys[stream.node.rdev];
+ if (!tty) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ stream.tty = tty;
+ stream.seekable = false;
+ },close:function (stream) {
+ // flush any pending line data
+ if (stream.tty.output.length) {
+ stream.tty.ops.put_char(stream.tty, 10);
+ }
+ },read:function (stream, buffer, offset, length, pos /* ignored */) {
+ if (!stream.tty || !stream.tty.ops.get_char) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
+ }
+ var bytesRead = 0;
+ for (var i = 0; i < length; i++) {
+ var result;
+ try {
+ result = stream.tty.ops.get_char(stream.tty);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ if (result === undefined && bytesRead === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ if (result === null || result === undefined) break;
+ bytesRead++;
+ buffer[offset+i] = result;
+ }
+ if (bytesRead) {
+ stream.node.timestamp = Date.now();
+ }
+ return bytesRead;
+ },write:function (stream, buffer, offset, length, pos) {
+ if (!stream.tty || !stream.tty.ops.put_char) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
+ }
+ for (var i = 0; i < length; i++) {
+ try {
+ stream.tty.ops.put_char(stream.tty, buffer[offset+i]);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ }
+ if (length) {
+ stream.node.timestamp = Date.now();
+ }
+ return i;
+ }},default_tty_ops:{get_char:function (tty) {
+ if (!tty.input.length) {
+ var result = null;
+ if (ENVIRONMENT_IS_NODE) {
+ result = process['stdin']['read']();
+ if (!result) {
+ if (process['stdin']['_readableState'] && process['stdin']['_readableState']['ended']) {
+ return null; // EOF
+ }
+ return undefined; // no data available
+ }
+ } else if (typeof window != 'undefined' &&
+ typeof window.prompt == 'function') {
+ // Browser.
+ result = window.prompt('Input: '); // returns null on cancel
+ if (result !== null) {
+ result += '\n';
+ }
+ } else if (typeof readline == 'function') {
+ // Command line.
+ result = readline();
+ if (result !== null) {
+ result += '\n';
+ }
+ }
+ if (!result) {
+ return null;
+ }
+ tty.input = intArrayFromString(result, true);
+ }
+ return tty.input.shift();
+ },put_char:function (tty, val) {
+ if (val === null || val === 10) {
+ Module['print'](tty.output.join(''));
+ tty.output = [];
+ } else {
+ tty.output.push(TTY.utf8.processCChar(val));
+ }
+ }},default_tty1_ops:{put_char:function (tty, val) {
+ if (val === null || val === 10) {
+ Module['printErr'](tty.output.join(''));
+ tty.output = [];
+ } else {
+ tty.output.push(TTY.utf8.processCChar(val));
+ }
+ }}};
+
+ var MEMFS={ops_table:null,CONTENT_OWNING:1,CONTENT_FLEXIBLE:2,CONTENT_FIXED:3,mount:function (mount) {
+ return MEMFS.createNode(null, '/', 16384 | 511 /* 0777 */, 0);
+ },createNode:function (parent, name, mode, dev) {
+ if (FS.isBlkdev(mode) || FS.isFIFO(mode)) {
+ // no supported
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (!MEMFS.ops_table) {
+ MEMFS.ops_table = {
+ dir: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr,
+ lookup: MEMFS.node_ops.lookup,
+ mknod: MEMFS.node_ops.mknod,
+ rename: MEMFS.node_ops.rename,
+ unlink: MEMFS.node_ops.unlink,
+ rmdir: MEMFS.node_ops.rmdir,
+ readdir: MEMFS.node_ops.readdir,
+ symlink: MEMFS.node_ops.symlink
+ },
+ stream: {
+ llseek: MEMFS.stream_ops.llseek
+ }
+ },
+ file: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr
+ },
+ stream: {
+ llseek: MEMFS.stream_ops.llseek,
+ read: MEMFS.stream_ops.read,
+ write: MEMFS.stream_ops.write,
+ allocate: MEMFS.stream_ops.allocate,
+ mmap: MEMFS.stream_ops.mmap
+ }
+ },
+ link: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr,
+ readlink: MEMFS.node_ops.readlink
+ },
+ stream: {}
+ },
+ chrdev: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr
+ },
+ stream: FS.chrdev_stream_ops
+ },
+ };
+ }
+ var node = FS.createNode(parent, name, mode, dev);
+ if (FS.isDir(node.mode)) {
+ node.node_ops = MEMFS.ops_table.dir.node;
+ node.stream_ops = MEMFS.ops_table.dir.stream;
+ node.contents = {};
+ } else if (FS.isFile(node.mode)) {
+ node.node_ops = MEMFS.ops_table.file.node;
+ node.stream_ops = MEMFS.ops_table.file.stream;
+ node.contents = [];
+ node.contentMode = MEMFS.CONTENT_FLEXIBLE;
+ } else if (FS.isLink(node.mode)) {
+ node.node_ops = MEMFS.ops_table.link.node;
+ node.stream_ops = MEMFS.ops_table.link.stream;
+ } else if (FS.isChrdev(node.mode)) {
+ node.node_ops = MEMFS.ops_table.chrdev.node;
+ node.stream_ops = MEMFS.ops_table.chrdev.stream;
+ }
+ node.timestamp = Date.now();
+ // add the new node to the parent
+ if (parent) {
+ parent.contents[name] = node;
+ }
+ return node;
+ },ensureFlexible:function (node) {
+ if (node.contentMode !== MEMFS.CONTENT_FLEXIBLE) {
+ var contents = node.contents;
+ node.contents = Array.prototype.slice.call(contents);
+ node.contentMode = MEMFS.CONTENT_FLEXIBLE;
+ }
+ },node_ops:{getattr:function (node) {
+ var attr = {};
+ // device numbers reuse inode numbers.
+ attr.dev = FS.isChrdev(node.mode) ? node.id : 1;
+ attr.ino = node.id;
+ attr.mode = node.mode;
+ attr.nlink = 1;
+ attr.uid = 0;
+ attr.gid = 0;
+ attr.rdev = node.rdev;
+ if (FS.isDir(node.mode)) {
+ attr.size = 4096;
+ } else if (FS.isFile(node.mode)) {
+ attr.size = node.contents.length;
+ } else if (FS.isLink(node.mode)) {
+ attr.size = node.link.length;
+ } else {
+ attr.size = 0;
+ }
+ attr.atime = new Date(node.timestamp);
+ attr.mtime = new Date(node.timestamp);
+ attr.ctime = new Date(node.timestamp);
+ // NOTE: In our implementation, st_blocks = Math.ceil(st_size/st_blksize),
+ // but this is not required by the standard.
+ attr.blksize = 4096;
+ attr.blocks = Math.ceil(attr.size / attr.blksize);
+ return attr;
+ },setattr:function (node, attr) {
+ if (attr.mode !== undefined) {
+ node.mode = attr.mode;
+ }
+ if (attr.timestamp !== undefined) {
+ node.timestamp = attr.timestamp;
+ }
+ if (attr.size !== undefined) {
+ MEMFS.ensureFlexible(node);
+ var contents = node.contents;
+ if (attr.size < contents.length) contents.length = attr.size;
+ else while (attr.size > contents.length) contents.push(0);
+ }
+ },lookup:function (parent, name) {
+ throw FS.genericErrors[ERRNO_CODES.ENOENT];
+ },mknod:function (parent, name, mode, dev) {
+ return MEMFS.createNode(parent, name, mode, dev);
+ },rename:function (old_node, new_dir, new_name) {
+ // if we're overwriting a directory at new_name, make sure it's empty.
+ if (FS.isDir(old_node.mode)) {
+ var new_node;
+ try {
+ new_node = FS.lookupNode(new_dir, new_name);
+ } catch (e) {
+ }
+ if (new_node) {
+ for (var i in new_node.contents) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ }
+ }
+ // do the internal rewiring
+ delete old_node.parent.contents[old_node.name];
+ old_node.name = new_name;
+ new_dir.contents[new_name] = old_node;
+ old_node.parent = new_dir;
+ },unlink:function (parent, name) {
+ delete parent.contents[name];
+ },rmdir:function (parent, name) {
+ var node = FS.lookupNode(parent, name);
+ for (var i in node.contents) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ delete parent.contents[name];
+ },readdir:function (node) {
+ var entries = ['.', '..']
+ for (var key in node.contents) {
+ if (!node.contents.hasOwnProperty(key)) {
+ continue;
+ }
+ entries.push(key);
+ }
+ return entries;
+ },symlink:function (parent, newname, oldpath) {
+ var node = MEMFS.createNode(parent, newname, 511 /* 0777 */ | 40960, 0);
+ node.link = oldpath;
+ return node;
+ },readlink:function (node) {
+ if (!FS.isLink(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ return node.link;
+ }},stream_ops:{read:function (stream, buffer, offset, length, position) {
+ var contents = stream.node.contents;
+ if (position >= contents.length)
+ return 0;
+ var size = Math.min(contents.length - position, length);
+ assert(size >= 0);
+ if (size > 8 && contents.subarray) { // non-trivial, and typed array
+ buffer.set(contents.subarray(position, position + size), offset);
+ } else
+ {
+ for (var i = 0; i < size; i++) {
+ buffer[offset + i] = contents[position + i];
+ }
+ }
+ return size;
+ },write:function (stream, buffer, offset, length, position, canOwn) {
+ var node = stream.node;
+ node.timestamp = Date.now();
+ var contents = node.contents;
+ if (length && contents.length === 0 && position === 0 && buffer.subarray) {
+ // just replace it with the new data
+ if (canOwn && offset === 0) {
+ node.contents = buffer; // this could be a subarray of Emscripten HEAP, or allocated from some other source.
+ node.contentMode = (buffer.buffer === HEAP8.buffer) ? MEMFS.CONTENT_OWNING : MEMFS.CONTENT_FIXED;
+ } else {
+ node.contents = new Uint8Array(buffer.subarray(offset, offset+length));
+ node.contentMode = MEMFS.CONTENT_FIXED;
+ }
+ return length;
+ }
+ MEMFS.ensureFlexible(node);
+ var contents = node.contents;
+ while (contents.length < position) contents.push(0);
+ for (var i = 0; i < length; i++) {
+ contents[position + i] = buffer[offset + i];
+ }
+ return length;
+ },llseek:function (stream, offset, whence) {
+ var position = offset;
+ if (whence === 1) { // SEEK_CUR.
+ position += stream.position;
+ } else if (whence === 2) { // SEEK_END.
+ if (FS.isFile(stream.node.mode)) {
+ position += stream.node.contents.length;
+ }
+ }
+ if (position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ stream.ungotten = [];
+ stream.position = position;
+ return position;
+ },allocate:function (stream, offset, length) {
+ MEMFS.ensureFlexible(stream.node);
+ var contents = stream.node.contents;
+ var limit = offset + length;
+ while (limit > contents.length) contents.push(0);
+ },mmap:function (stream, buffer, offset, length, position, prot, flags) {
+ if (!FS.isFile(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ var ptr;
+ var allocated;
+ var contents = stream.node.contents;
+ // Only make a new copy when MAP_PRIVATE is specified.
+ if ( !(flags & 2) &&
+ (contents.buffer === buffer || contents.buffer === buffer.buffer) ) {
+ // We can't emulate MAP_SHARED when the file is not backed by the buffer
+ // we're mapping to (e.g. the HEAP buffer).
+ allocated = false;
+ ptr = contents.byteOffset;
+ } else {
+ // Try to avoid unnecessary slices.
+ if (position > 0 || position + length < contents.length) {
+ if (contents.subarray) {
+ contents = contents.subarray(position, position + length);
+ } else {
+ contents = Array.prototype.slice.call(contents, position, position + length);
+ }
+ }
+ allocated = true;
+ ptr = _malloc(length);
+ if (!ptr) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOMEM);
+ }
+ buffer.set(contents, ptr);
+ }
+ return { ptr: ptr, allocated: allocated };
+ }}};
+
+ var IDBFS={dbs:{},indexedDB:function () {
+ return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
+ },DB_VERSION:21,DB_STORE_NAME:"FILE_DATA",mount:function (mount) {
+ // reuse all of the core MEMFS functionality
+ return MEMFS.mount.apply(null, arguments);
+ },syncfs:function (mount, populate, callback) {
+ IDBFS.getLocalSet(mount, function(err, local) {
+ if (err) return callback(err);
+
+ IDBFS.getRemoteSet(mount, function(err, remote) {
+ if (err) return callback(err);
+
+ var src = populate ? remote : local;
+ var dst = populate ? local : remote;
+
+ IDBFS.reconcile(src, dst, callback);
+ });
+ });
+ },getDB:function (name, callback) {
+ // check the cache first
+ var db = IDBFS.dbs[name];
+ if (db) {
+ return callback(null, db);
+ }
+
+ var req;
+ try {
+ req = IDBFS.indexedDB().open(name, IDBFS.DB_VERSION);
+ } catch (e) {
+ return callback(e);
+ }
+ req.onupgradeneeded = function(e) {
+ var db = e.target.result;
+ var transaction = e.target.transaction;
+
+ var fileStore;
+
+ if (db.objectStoreNames.contains(IDBFS.DB_STORE_NAME)) {
+ fileStore = transaction.objectStore(IDBFS.DB_STORE_NAME);
+ } else {
+ fileStore = db.createObjectStore(IDBFS.DB_STORE_NAME);
+ }
+
+ fileStore.createIndex('timestamp', 'timestamp', { unique: false });
+ };
+ req.onsuccess = function() {
+ db = req.result;
+
+ // add to the cache
+ IDBFS.dbs[name] = db;
+ callback(null, db);
+ };
+ req.onerror = function() {
+ callback(this.error);
+ };
+ },getLocalSet:function (mount, callback) {
+ var entries = {};
+
+ function isRealDir(p) {
+ return p !== '.' && p !== '..';
+ };
+ function toAbsolute(root) {
+ return function(p) {
+ return PATH.join2(root, p);
+ }
+ };
+
+ var check = FS.readdir(mount.mountpoint).filter(isRealDir).map(toAbsolute(mount.mountpoint));
+
+ while (check.length) {
+ var path = check.pop();
+ var stat;
+
+ try {
+ stat = FS.stat(path);
+ } catch (e) {
+ return callback(e);
+ }
+
+ if (FS.isDir(stat.mode)) {
+ check.push.apply(check, FS.readdir(path).filter(isRealDir).map(toAbsolute(path)));
+ }
+
+ entries[path] = { timestamp: stat.mtime };
+ }
+
+ return callback(null, { type: 'local', entries: entries });
+ },getRemoteSet:function (mount, callback) {
+ var entries = {};
+
+ IDBFS.getDB(mount.mountpoint, function(err, db) {
+ if (err) return callback(err);
+
+ var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readonly');
+ transaction.onerror = function() { callback(this.error); };
+
+ var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
+ var index = store.index('timestamp');
+
+ index.openKeyCursor().onsuccess = function(event) {
+ var cursor = event.target.result;
+
+ if (!cursor) {
+ return callback(null, { type: 'remote', db: db, entries: entries });
+ }
+
+ entries[cursor.primaryKey] = { timestamp: cursor.key };
+
+ cursor.continue();
+ };
+ });
+ },loadLocalEntry:function (path, callback) {
+ var stat, node;
+
+ try {
+ var lookup = FS.lookupPath(path);
+ node = lookup.node;
+ stat = FS.stat(path);
+ } catch (e) {
+ return callback(e);
+ }
+
+ if (FS.isDir(stat.mode)) {
+ return callback(null, { timestamp: stat.mtime, mode: stat.mode });
+ } else if (FS.isFile(stat.mode)) {
+ return callback(null, { timestamp: stat.mtime, mode: stat.mode, contents: node.contents });
+ } else {
+ return callback(new Error('node type not supported'));
+ }
+ },storeLocalEntry:function (path, entry, callback) {
+ try {
+ if (FS.isDir(entry.mode)) {
+ FS.mkdir(path, entry.mode);
+ } else if (FS.isFile(entry.mode)) {
+ FS.writeFile(path, entry.contents, { encoding: 'binary', canOwn: true });
+ } else {
+ return callback(new Error('node type not supported'));
+ }
+
+ FS.utime(path, entry.timestamp, entry.timestamp);
+ } catch (e) {
+ return callback(e);
+ }
+
+ callback(null);
+ },removeLocalEntry:function (path, callback) {
+ try {
+ var lookup = FS.lookupPath(path);
+ var stat = FS.stat(path);
+
+ if (FS.isDir(stat.mode)) {
+ FS.rmdir(path);
+ } else if (FS.isFile(stat.mode)) {
+ FS.unlink(path);
+ }
+ } catch (e) {
+ return callback(e);
+ }
+
+ callback(null);
+ },loadRemoteEntry:function (store, path, callback) {
+ var req = store.get(path);
+ req.onsuccess = function(event) { callback(null, event.target.result); };
+ req.onerror = function() { callback(this.error); };
+ },storeRemoteEntry:function (store, path, entry, callback) {
+ var req = store.put(entry, path);
+ req.onsuccess = function() { callback(null); };
+ req.onerror = function() { callback(this.error); };
+ },removeRemoteEntry:function (store, path, callback) {
+ var req = store.delete(path);
+ req.onsuccess = function() { callback(null); };
+ req.onerror = function() { callback(this.error); };
+ },reconcile:function (src, dst, callback) {
+ var total = 0;
+
+ var create = [];
+ Object.keys(src.entries).forEach(function (key) {
+ var e = src.entries[key];
+ var e2 = dst.entries[key];
+ if (!e2 || e.timestamp > e2.timestamp) {
+ create.push(key);
+ total++;
+ }
+ });
+
+ var remove = [];
+ Object.keys(dst.entries).forEach(function (key) {
+ var e = dst.entries[key];
+ var e2 = src.entries[key];
+ if (!e2) {
+ remove.push(key);
+ total++;
+ }
+ });
+
+ if (!total) {
+ return callback(null);
+ }
+
+ var errored = false;
+ var completed = 0;
+ var db = src.type === 'remote' ? src.db : dst.db;
+ var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readwrite');
+ var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
+
+ function done(err) {
+ if (err) {
+ if (!done.errored) {
+ done.errored = true;
+ return callback(err);
+ }
+ return;
+ }
+ if (++completed >= total) {
+ return callback(null);
+ }
+ };
+
+ transaction.onerror = function() { done(this.error); };
+
+ // sort paths in ascending order so directory entries are created
+ // before the files inside them
+ create.sort().forEach(function (path) {
+ if (dst.type === 'local') {
+ IDBFS.loadRemoteEntry(store, path, function (err, entry) {
+ if (err) return done(err);
+ IDBFS.storeLocalEntry(path, entry, done);
+ });
+ } else {
+ IDBFS.loadLocalEntry(path, function (err, entry) {
+ if (err) return done(err);
+ IDBFS.storeRemoteEntry(store, path, entry, done);
+ });
+ }
+ });
+
+ // sort paths in descending order so files are deleted before their
+ // parent directories
+ remove.sort().reverse().forEach(function(path) {
+ if (dst.type === 'local') {
+ IDBFS.removeLocalEntry(path, done);
+ } else {
+ IDBFS.removeRemoteEntry(store, path, done);
+ }
+ });
+ }};
+
+ var NODEFS={isWindows:false,staticInit:function () {
+ NODEFS.isWindows = !!process.platform.match(/^win/);
+ },mount:function (mount) {
+ assert(ENVIRONMENT_IS_NODE);
+ return NODEFS.createNode(null, '/', NODEFS.getMode(mount.opts.root), 0);
+ },createNode:function (parent, name, mode, dev) {
+ if (!FS.isDir(mode) && !FS.isFile(mode) && !FS.isLink(mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var node = FS.createNode(parent, name, mode);
+ node.node_ops = NODEFS.node_ops;
+ node.stream_ops = NODEFS.stream_ops;
+ return node;
+ },getMode:function (path) {
+ var stat;
+ try {
+ stat = fs.lstatSync(path);
+ if (NODEFS.isWindows) {
+ // On Windows, directories return permission bits 'rw-rw-rw-', even though they have 'rwxrwxrwx', so
+ // propagate write bits to execute bits.
+ stat.mode = stat.mode | ((stat.mode & 146) >> 1);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return stat.mode;
+ },realPath:function (node) {
+ var parts = [];
+ while (node.parent !== node) {
+ parts.push(node.name);
+ node = node.parent;
+ }
+ parts.push(node.mount.opts.root);
+ parts.reverse();
+ return PATH.join.apply(null, parts);
+ },flagsToPermissionStringMap:{0:"r",1:"r+",2:"r+",64:"r",65:"r+",66:"r+",129:"rx+",193:"rx+",514:"w+",577:"w",578:"w+",705:"wx",706:"wx+",1024:"a",1025:"a",1026:"a+",1089:"a",1090:"a+",1153:"ax",1154:"ax+",1217:"ax",1218:"ax+",4096:"rs",4098:"rs+"},flagsToPermissionString:function (flags) {
+ if (flags in NODEFS.flagsToPermissionStringMap) {
+ return NODEFS.flagsToPermissionStringMap[flags];
+ } else {
+ return flags;
+ }
+ },node_ops:{getattr:function (node) {
+ var path = NODEFS.realPath(node);
+ var stat;
+ try {
+ stat = fs.lstatSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ // node.js v0.10.20 doesn't report blksize and blocks on Windows. Fake them with default blksize of 4096.
+ // See http://support.microsoft.com/kb/140365
+ if (NODEFS.isWindows && !stat.blksize) {
+ stat.blksize = 4096;
+ }
+ if (NODEFS.isWindows && !stat.blocks) {
+ stat.blocks = (stat.size+stat.blksize-1)/stat.blksize|0;
+ }
+ return {
+ dev: stat.dev,
+ ino: stat.ino,
+ mode: stat.mode,
+ nlink: stat.nlink,
+ uid: stat.uid,
+ gid: stat.gid,
+ rdev: stat.rdev,
+ size: stat.size,
+ atime: stat.atime,
+ mtime: stat.mtime,
+ ctime: stat.ctime,
+ blksize: stat.blksize,
+ blocks: stat.blocks
+ };
+ },setattr:function (node, attr) {
+ var path = NODEFS.realPath(node);
+ try {
+ if (attr.mode !== undefined) {
+ fs.chmodSync(path, attr.mode);
+ // update the common node structure mode as well
+ node.mode = attr.mode;
+ }
+ if (attr.timestamp !== undefined) {
+ var date = new Date(attr.timestamp);
+ fs.utimesSync(path, date, date);
+ }
+ if (attr.size !== undefined) {
+ fs.truncateSync(path, attr.size);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },lookup:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ var mode = NODEFS.getMode(path);
+ return NODEFS.createNode(parent, name, mode);
+ },mknod:function (parent, name, mode, dev) {
+ var node = NODEFS.createNode(parent, name, mode, dev);
+ // create the backing node for this in the fs root as well
+ var path = NODEFS.realPath(node);
+ try {
+ if (FS.isDir(node.mode)) {
+ fs.mkdirSync(path, node.mode);
+ } else {
+ fs.writeFileSync(path, '', { mode: node.mode });
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return node;
+ },rename:function (oldNode, newDir, newName) {
+ var oldPath = NODEFS.realPath(oldNode);
+ var newPath = PATH.join2(NODEFS.realPath(newDir), newName);
+ try {
+ fs.renameSync(oldPath, newPath);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },unlink:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ try {
+ fs.unlinkSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },rmdir:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ try {
+ fs.rmdirSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },readdir:function (node) {
+ var path = NODEFS.realPath(node);
+ try {
+ return fs.readdirSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },symlink:function (parent, newName, oldPath) {
+ var newPath = PATH.join2(NODEFS.realPath(parent), newName);
+ try {
+ fs.symlinkSync(oldPath, newPath);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },readlink:function (node) {
+ var path = NODEFS.realPath(node);
+ try {
+ return fs.readlinkSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ }},stream_ops:{open:function (stream) {
+ var path = NODEFS.realPath(stream.node);
+ try {
+ if (FS.isFile(stream.node.mode)) {
+ stream.nfd = fs.openSync(path, NODEFS.flagsToPermissionString(stream.flags));
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },close:function (stream) {
+ try {
+ if (FS.isFile(stream.node.mode) && stream.nfd) {
+ fs.closeSync(stream.nfd);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },read:function (stream, buffer, offset, length, position) {
+ // FIXME this is terrible.
+ var nbuffer = new Buffer(length);
+ var res;
+ try {
+ res = fs.readSync(stream.nfd, nbuffer, 0, length, position);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ if (res > 0) {
+ for (var i = 0; i < res; i++) {
+ buffer[offset + i] = nbuffer[i];
+ }
+ }
+ return res;
+ },write:function (stream, buffer, offset, length, position) {
+ // FIXME this is terrible.
+ var nbuffer = new Buffer(buffer.subarray(offset, offset + length));
+ var res;
+ try {
+ res = fs.writeSync(stream.nfd, nbuffer, 0, length, position);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return res;
+ },llseek:function (stream, offset, whence) {
+ var position = offset;
+ if (whence === 1) { // SEEK_CUR.
+ position += stream.position;
+ } else if (whence === 2) { // SEEK_END.
+ if (FS.isFile(stream.node.mode)) {
+ try {
+ var stat = fs.fstatSync(stream.nfd);
+ position += stat.size;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ }
+ }
+
+ if (position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+
+ stream.position = position;
+ return position;
+ }}};
+
+ var _stdin=allocate(1, "i32*", ALLOC_STATIC);
+
+ var _stdout=allocate(1, "i32*", ALLOC_STATIC);
+
+ var _stderr=allocate(1, "i32*", ALLOC_STATIC);
+
+ function _fflush(stream) {
+ // int fflush(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fflush.html
+ // we don't currently perform any user-space buffering of data
+ }var FS={root:null,mounts:[],devices:[null],streams:[],nextInode:1,nameTable:null,currentPath:"/",initialized:false,ignorePermissions:true,ErrnoError:null,genericErrors:{},handleFSError:function (e) {
+ if (!(e instanceof FS.ErrnoError)) throw e + ' : ' + stackTrace();
+ return ___setErrNo(e.errno);
+ },lookupPath:function (path, opts) {
+ path = PATH.resolve(FS.cwd(), path);
+ opts = opts || {};
+
+ var defaults = {
+ follow_mount: true,
+ recurse_count: 0
+ };
+ for (var key in defaults) {
+ if (opts[key] === undefined) {
+ opts[key] = defaults[key];
+ }
+ }
+
+ if (opts.recurse_count > 8) { // max recursive lookup of 8
+ throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
+ }
+
+ // split the path
+ var parts = PATH.normalizeArray(path.split('/').filter(function(p) {
+ return !!p;
+ }), false);
+
+ // start at the root
+ var current = FS.root;
+ var current_path = '/';
+
+ for (var i = 0; i < parts.length; i++) {
+ var islast = (i === parts.length-1);
+ if (islast && opts.parent) {
+ // stop resolving
+ break;
+ }
+
+ current = FS.lookupNode(current, parts[i]);
+ current_path = PATH.join2(current_path, parts[i]);
+
+ // jump to the mount's root node if this is a mountpoint
+ if (FS.isMountpoint(current)) {
+ if (!islast || (islast && opts.follow_mount)) {
+ current = current.mounted.root;
+ }
+ }
+
+ // by default, lookupPath will not follow a symlink if it is the final path component.
+ // setting opts.follow = true will override this behavior.
+ if (!islast || opts.follow) {
+ var count = 0;
+ while (FS.isLink(current.mode)) {
+ var link = FS.readlink(current_path);
+ current_path = PATH.resolve(PATH.dirname(current_path), link);
+
+ var lookup = FS.lookupPath(current_path, { recurse_count: opts.recurse_count });
+ current = lookup.node;
+
+ if (count++ > 40) { // limit max consecutive symlinks to 40 (SYMLOOP_MAX).
+ throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
+ }
+ }
+ }
+ }
+
+ return { path: current_path, node: current };
+ },getPath:function (node) {
+ var path;
+ while (true) {
+ if (FS.isRoot(node)) {
+ var mount = node.mount.mountpoint;
+ if (!path) return mount;
+ return mount[mount.length-1] !== '/' ? mount + '/' + path : mount + path;
+ }
+ path = path ? node.name + '/' + path : node.name;
+ node = node.parent;
+ }
+ },hashName:function (parentid, name) {
+ var hash = 0;
+
+
+ for (var i = 0; i < name.length; i++) {
+ hash = ((hash << 5) - hash + name.charCodeAt(i)) | 0;
+ }
+ return ((parentid + hash) >>> 0) % FS.nameTable.length;
+ },hashAddNode:function (node) {
+ var hash = FS.hashName(node.parent.id, node.name);
+ node.name_next = FS.nameTable[hash];
+ FS.nameTable[hash] = node;
+ },hashRemoveNode:function (node) {
+ var hash = FS.hashName(node.parent.id, node.name);
+ if (FS.nameTable[hash] === node) {
+ FS.nameTable[hash] = node.name_next;
+ } else {
+ var current = FS.nameTable[hash];
+ while (current) {
+ if (current.name_next === node) {
+ current.name_next = node.name_next;
+ break;
+ }
+ current = current.name_next;
+ }
+ }
+ },lookupNode:function (parent, name) {
+ var err = FS.mayLookup(parent);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ var hash = FS.hashName(parent.id, name);
+ for (var node = FS.nameTable[hash]; node; node = node.name_next) {
+ var nodeName = node.name;
+ if (node.parent.id === parent.id && nodeName === name) {
+ return node;
+ }
+ }
+ // if we failed to find it in the cache, call into the VFS
+ return FS.lookup(parent, name);
+ },createNode:function (parent, name, mode, rdev) {
+ if (!FS.FSNode) {
+ FS.FSNode = function(parent, name, mode, rdev) {
+ if (!parent) {
+ parent = this; // root node sets parent to itself
+ }
+ this.parent = parent;
+ this.mount = parent.mount;
+ this.mounted = null;
+ this.id = FS.nextInode++;
+ this.name = name;
+ this.mode = mode;
+ this.node_ops = {};
+ this.stream_ops = {};
+ this.rdev = rdev;
+ };
+
+ FS.FSNode.prototype = {};
+
+ // compatibility
+ var readMode = 292 | 73;
+ var writeMode = 146;
+
+ // NOTE we must use Object.defineProperties instead of individual calls to
+ // Object.defineProperty in order to make closure compiler happy
+ Object.defineProperties(FS.FSNode.prototype, {
+ read: {
+ get: function() { return (this.mode & readMode) === readMode; },
+ set: function(val) { val ? this.mode |= readMode : this.mode &= ~readMode; }
+ },
+ write: {
+ get: function() { return (this.mode & writeMode) === writeMode; },
+ set: function(val) { val ? this.mode |= writeMode : this.mode &= ~writeMode; }
+ },
+ isFolder: {
+ get: function() { return FS.isDir(this.mode); },
+ },
+ isDevice: {
+ get: function() { return FS.isChrdev(this.mode); },
+ },
+ });
+ }
+
+ var node = new FS.FSNode(parent, name, mode, rdev);
+
+ FS.hashAddNode(node);
+
+ return node;
+ },destroyNode:function (node) {
+ FS.hashRemoveNode(node);
+ },isRoot:function (node) {
+ return node === node.parent;
+ },isMountpoint:function (node) {
+ return !!node.mounted;
+ },isFile:function (mode) {
+ return (mode & 61440) === 32768;
+ },isDir:function (mode) {
+ return (mode & 61440) === 16384;
+ },isLink:function (mode) {
+ return (mode & 61440) === 40960;
+ },isChrdev:function (mode) {
+ return (mode & 61440) === 8192;
+ },isBlkdev:function (mode) {
+ return (mode & 61440) === 24576;
+ },isFIFO:function (mode) {
+ return (mode & 61440) === 4096;
+ },isSocket:function (mode) {
+ return (mode & 49152) === 49152;
+ },flagModes:{"r":0,"rs":1052672,"r+":2,"w":577,"wx":705,"xw":705,"w+":578,"wx+":706,"xw+":706,"a":1089,"ax":1217,"xa":1217,"a+":1090,"ax+":1218,"xa+":1218},modeStringToFlags:function (str) {
+ var flags = FS.flagModes[str];
+ if (typeof flags === 'undefined') {
+ throw new Error('Unknown file open mode: ' + str);
+ }
+ return flags;
+ },flagsToPermissionString:function (flag) {
+ var accmode = flag & 2097155;
+ var perms = ['r', 'w', 'rw'][accmode];
+ if ((flag & 512)) {
+ perms += 'w';
+ }
+ return perms;
+ },nodePermissions:function (node, perms) {
+ if (FS.ignorePermissions) {
+ return 0;
+ }
+ // return 0 if any user, group or owner bits are set.
+ if (perms.indexOf('r') !== -1 && !(node.mode & 292)) {
+ return ERRNO_CODES.EACCES;
+ } else if (perms.indexOf('w') !== -1 && !(node.mode & 146)) {
+ return ERRNO_CODES.EACCES;
+ } else if (perms.indexOf('x') !== -1 && !(node.mode & 73)) {
+ return ERRNO_CODES.EACCES;
+ }
+ return 0;
+ },mayLookup:function (dir) {
+ return FS.nodePermissions(dir, 'x');
+ },mayCreate:function (dir, name) {
+ try {
+ var node = FS.lookupNode(dir, name);
+ return ERRNO_CODES.EEXIST;
+ } catch (e) {
+ }
+ return FS.nodePermissions(dir, 'wx');
+ },mayDelete:function (dir, name, isdir) {
+ var node;
+ try {
+ node = FS.lookupNode(dir, name);
+ } catch (e) {
+ return e.errno;
+ }
+ var err = FS.nodePermissions(dir, 'wx');
+ if (err) {
+ return err;
+ }
+ if (isdir) {
+ if (!FS.isDir(node.mode)) {
+ return ERRNO_CODES.ENOTDIR;
+ }
+ if (FS.isRoot(node) || FS.getPath(node) === FS.cwd()) {
+ return ERRNO_CODES.EBUSY;
+ }
+ } else {
+ if (FS.isDir(node.mode)) {
+ return ERRNO_CODES.EISDIR;
+ }
+ }
+ return 0;
+ },mayOpen:function (node, flags) {
+ if (!node) {
+ return ERRNO_CODES.ENOENT;
+ }
+ if (FS.isLink(node.mode)) {
+ return ERRNO_CODES.ELOOP;
+ } else if (FS.isDir(node.mode)) {
+ if ((flags & 2097155) !== 0 || // opening for write
+ (flags & 512)) {
+ return ERRNO_CODES.EISDIR;
+ }
+ }
+ return FS.nodePermissions(node, FS.flagsToPermissionString(flags));
+ },MAX_OPEN_FDS:4096,nextfd:function (fd_start, fd_end) {
+ fd_start = fd_start || 0;
+ fd_end = fd_end || FS.MAX_OPEN_FDS;
+ for (var fd = fd_start; fd <= fd_end; fd++) {
+ if (!FS.streams[fd]) {
+ return fd;
+ }
+ }
+ throw new FS.ErrnoError(ERRNO_CODES.EMFILE);
+ },getStream:function (fd) {
+ return FS.streams[fd];
+ },createStream:function (stream, fd_start, fd_end) {
+ if (!FS.FSStream) {
+ FS.FSStream = function(){};
+ FS.FSStream.prototype = {};
+ // compatibility
+ Object.defineProperties(FS.FSStream.prototype, {
+ object: {
+ get: function() { return this.node; },
+ set: function(val) { this.node = val; }
+ },
+ isRead: {
+ get: function() { return (this.flags & 2097155) !== 1; }
+ },
+ isWrite: {
+ get: function() { return (this.flags & 2097155) !== 0; }
+ },
+ isAppend: {
+ get: function() { return (this.flags & 1024); }
+ }
+ });
+ }
+ if (0) {
+ // reuse the object
+ stream.__proto__ = FS.FSStream.prototype;
+ } else {
+ var newStream = new FS.FSStream();
+ for (var p in stream) {
+ newStream[p] = stream[p];
+ }
+ stream = newStream;
+ }
+ var fd = FS.nextfd(fd_start, fd_end);
+ stream.fd = fd;
+ FS.streams[fd] = stream;
+ return stream;
+ },closeStream:function (fd) {
+ FS.streams[fd] = null;
+ },getStreamFromPtr:function (ptr) {
+ return FS.streams[ptr - 1];
+ },getPtrForStream:function (stream) {
+ return stream ? stream.fd + 1 : 0;
+ },chrdev_stream_ops:{open:function (stream) {
+ var device = FS.getDevice(stream.node.rdev);
+ // override node's stream ops with the device's
+ stream.stream_ops = device.stream_ops;
+ // forward the open call
+ if (stream.stream_ops.open) {
+ stream.stream_ops.open(stream);
+ }
+ },llseek:function () {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }},major:function (dev) {
+ return ((dev) >> 8);
+ },minor:function (dev) {
+ return ((dev) & 0xff);
+ },makedev:function (ma, mi) {
+ return ((ma) << 8 | (mi));
+ },registerDevice:function (dev, ops) {
+ FS.devices[dev] = { stream_ops: ops };
+ },getDevice:function (dev) {
+ return FS.devices[dev];
+ },getMounts:function (mount) {
+ var mounts = [];
+ var check = [mount];
+
+ while (check.length) {
+ var m = check.pop();
+
+ mounts.push(m);
+
+ check.push.apply(check, m.mounts);
+ }
+
+ return mounts;
+ },syncfs:function (populate, callback) {
+ if (typeof(populate) === 'function') {
+ callback = populate;
+ populate = false;
+ }
+
+ var mounts = FS.getMounts(FS.root.mount);
+ var completed = 0;
+
+ function done(err) {
+ if (err) {
+ if (!done.errored) {
+ done.errored = true;
+ return callback(err);
+ }
+ return;
+ }
+ if (++completed >= mounts.length) {
+ callback(null);
+ }
+ };
+
+ // sync all mounts
+ mounts.forEach(function (mount) {
+ if (!mount.type.syncfs) {
+ return done(null);
+ }
+ mount.type.syncfs(mount, populate, done);
+ });
+ },mount:function (type, opts, mountpoint) {
+ var root = mountpoint === '/';
+ var pseudo = !mountpoint;
+ var node;
+
+ if (root && FS.root) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ } else if (!root && !pseudo) {
+ var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
+
+ mountpoint = lookup.path; // use the absolute path
+ node = lookup.node;
+
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+
+ if (!FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ }
+
+ var mount = {
+ type: type,
+ opts: opts,
+ mountpoint: mountpoint,
+ mounts: []
+ };
+
+ // create a root node for the fs
+ var mountRoot = type.mount(mount);
+ mountRoot.mount = mount;
+ mount.root = mountRoot;
+
+ if (root) {
+ FS.root = mountRoot;
+ } else if (node) {
+ // set as a mountpoint
+ node.mounted = mount;
+
+ // add the new mount to the current mount's children
+ if (node.mount) {
+ node.mount.mounts.push(mount);
+ }
+ }
+
+ return mountRoot;
+ },unmount:function (mountpoint) {
+ var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
+
+ if (!FS.isMountpoint(lookup.node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+
+ // destroy the nodes for this mount, and all its child mounts
+ var node = lookup.node;
+ var mount = node.mounted;
+ var mounts = FS.getMounts(mount);
+
+ Object.keys(FS.nameTable).forEach(function (hash) {
+ var current = FS.nameTable[hash];
+
+ while (current) {
+ var next = current.name_next;
+
+ if (mounts.indexOf(current.mount) !== -1) {
+ FS.destroyNode(current);
+ }
+
+ current = next;
+ }
+ });
+
+ // no longer a mountpoint
+ node.mounted = null;
+
+ // remove this mount from the child mounts
+ var idx = node.mount.mounts.indexOf(mount);
+ assert(idx !== -1);
+ node.mount.mounts.splice(idx, 1);
+ },lookup:function (parent, name) {
+ return parent.node_ops.lookup(parent, name);
+ },mknod:function (path, mode, dev) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var err = FS.mayCreate(parent, name);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.mknod) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return parent.node_ops.mknod(parent, name, mode, dev);
+ },create:function (path, mode) {
+ mode = mode !== undefined ? mode : 438 /* 0666 */;
+ mode &= 4095;
+ mode |= 32768;
+ return FS.mknod(path, mode, 0);
+ },mkdir:function (path, mode) {
+ mode = mode !== undefined ? mode : 511 /* 0777 */;
+ mode &= 511 | 512;
+ mode |= 16384;
+ return FS.mknod(path, mode, 0);
+ },mkdev:function (path, mode, dev) {
+ if (typeof(dev) === 'undefined') {
+ dev = mode;
+ mode = 438 /* 0666 */;
+ }
+ mode |= 8192;
+ return FS.mknod(path, mode, dev);
+ },symlink:function (oldpath, newpath) {
+ var lookup = FS.lookupPath(newpath, { parent: true });
+ var parent = lookup.node;
+ var newname = PATH.basename(newpath);
+ var err = FS.mayCreate(parent, newname);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.symlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return parent.node_ops.symlink(parent, newname, oldpath);
+ },rename:function (old_path, new_path) {
+ var old_dirname = PATH.dirname(old_path);
+ var new_dirname = PATH.dirname(new_path);
+ var old_name = PATH.basename(old_path);
+ var new_name = PATH.basename(new_path);
+ // parents must exist
+ var lookup, old_dir, new_dir;
+ try {
+ lookup = FS.lookupPath(old_path, { parent: true });
+ old_dir = lookup.node;
+ lookup = FS.lookupPath(new_path, { parent: true });
+ new_dir = lookup.node;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ // need to be part of the same mount
+ if (old_dir.mount !== new_dir.mount) {
+ throw new FS.ErrnoError(ERRNO_CODES.EXDEV);
+ }
+ // source must exist
+ var old_node = FS.lookupNode(old_dir, old_name);
+ // old path should not be an ancestor of the new path
+ var relative = PATH.relative(old_path, new_dirname);
+ if (relative.charAt(0) !== '.') {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ // new path should not be an ancestor of the old path
+ relative = PATH.relative(new_path, old_dirname);
+ if (relative.charAt(0) !== '.') {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ // see if the new path already exists
+ var new_node;
+ try {
+ new_node = FS.lookupNode(new_dir, new_name);
+ } catch (e) {
+ // not fatal
+ }
+ // early out if nothing needs to change
+ if (old_node === new_node) {
+ return;
+ }
+ // we'll need to delete the old entry
+ var isdir = FS.isDir(old_node.mode);
+ var err = FS.mayDelete(old_dir, old_name, isdir);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ // need delete permissions if we'll be overwriting.
+ // need create permissions if new doesn't already exist.
+ err = new_node ?
+ FS.mayDelete(new_dir, new_name, isdir) :
+ FS.mayCreate(new_dir, new_name);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!old_dir.node_ops.rename) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(old_node) || (new_node && FS.isMountpoint(new_node))) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ // if we are going to change the parent, check write permissions
+ if (new_dir !== old_dir) {
+ err = FS.nodePermissions(old_dir, 'w');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ }
+ // remove the node from the lookup hash
+ FS.hashRemoveNode(old_node);
+ // do the underlying fs rename
+ try {
+ old_dir.node_ops.rename(old_node, new_dir, new_name);
+ } catch (e) {
+ throw e;
+ } finally {
+ // add the node back to the hash (in case node_ops.rename
+ // changed its name)
+ FS.hashAddNode(old_node);
+ }
+ },rmdir:function (path) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var node = FS.lookupNode(parent, name);
+ var err = FS.mayDelete(parent, name, true);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.rmdir) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ parent.node_ops.rmdir(parent, name);
+ FS.destroyNode(node);
+ },readdir:function (path) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ var node = lookup.node;
+ if (!node.node_ops.readdir) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ return node.node_ops.readdir(node);
+ },unlink:function (path) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var node = FS.lookupNode(parent, name);
+ var err = FS.mayDelete(parent, name, false);
+ if (err) {
+ // POSIX says unlink should set EPERM, not EISDIR
+ if (err === ERRNO_CODES.EISDIR) err = ERRNO_CODES.EPERM;
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.unlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ parent.node_ops.unlink(parent, name);
+ FS.destroyNode(node);
+ },readlink:function (path) {
+ var lookup = FS.lookupPath(path);
+ var link = lookup.node;
+ if (!link.node_ops.readlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ return link.node_ops.readlink(link);
+ },stat:function (path, dontFollow) {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ var node = lookup.node;
+ if (!node.node_ops.getattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return node.node_ops.getattr(node);
+ },lstat:function (path) {
+ return FS.stat(path, true);
+ },chmod:function (path, mode, dontFollow) {
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ node.node_ops.setattr(node, {
+ mode: (mode & 4095) | (node.mode & ~4095),
+ timestamp: Date.now()
+ });
+ },lchmod:function (path, mode) {
+ FS.chmod(path, mode, true);
+ },fchmod:function (fd, mode) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ FS.chmod(stream.node, mode);
+ },chown:function (path, uid, gid, dontFollow) {
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ node.node_ops.setattr(node, {
+ timestamp: Date.now()
+ // we ignore the uid / gid for now
+ });
+ },lchown:function (path, uid, gid) {
+ FS.chown(path, uid, gid, true);
+ },fchown:function (fd, uid, gid) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ FS.chown(stream.node, uid, gid);
+ },truncate:function (path, len) {
+ if (len < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: true });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!FS.isFile(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var err = FS.nodePermissions(node, 'w');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ node.node_ops.setattr(node, {
+ size: len,
+ timestamp: Date.now()
+ });
+ },ftruncate:function (fd, len) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ FS.truncate(stream.node, len);
+ },utime:function (path, atime, mtime) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ var node = lookup.node;
+ node.node_ops.setattr(node, {
+ timestamp: Math.max(atime, mtime)
+ });
+ },open:function (path, flags, mode, fd_start, fd_end) {
+ flags = typeof flags === 'string' ? FS.modeStringToFlags(flags) : flags;
+ mode = typeof mode === 'undefined' ? 438 /* 0666 */ : mode;
+ if ((flags & 64)) {
+ mode = (mode & 4095) | 32768;
+ } else {
+ mode = 0;
+ }
+ var node;
+ if (typeof path === 'object') {
+ node = path;
+ } else {
+ path = PATH.normalize(path);
+ try {
+ var lookup = FS.lookupPath(path, {
+ follow: !(flags & 131072)
+ });
+ node = lookup.node;
+ } catch (e) {
+ // ignore
+ }
+ }
+ // perhaps we need to create the node
+ if ((flags & 64)) {
+ if (node) {
+ // if O_CREAT and O_EXCL are set, error out if the node already exists
+ if ((flags & 128)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EEXIST);
+ }
+ } else {
+ // node doesn't exist, try to create it
+ node = FS.mknod(path, mode, 0);
+ }
+ }
+ if (!node) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
+ }
+ // can't truncate a device
+ if (FS.isChrdev(node.mode)) {
+ flags &= ~512;
+ }
+ // check permissions
+ var err = FS.mayOpen(node, flags);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ // do truncation if necessary
+ if ((flags & 512)) {
+ FS.truncate(node, 0);
+ }
+ // we've already handled these, don't pass down to the underlying vfs
+ flags &= ~(128 | 512);
+
+ // register the stream with the filesystem
+ var stream = FS.createStream({
+ node: node,
+ path: FS.getPath(node), // we want the absolute path to the node
+ flags: flags,
+ seekable: true,
+ position: 0,
+ stream_ops: node.stream_ops,
+ // used by the file family libc calls (fopen, fwrite, ferror, etc.)
+ ungotten: [],
+ error: false
+ }, fd_start, fd_end);
+ // call the new stream's open function
+ if (stream.stream_ops.open) {
+ stream.stream_ops.open(stream);
+ }
+ if (Module['logReadFiles'] && !(flags & 1)) {
+ if (!FS.readFiles) FS.readFiles = {};
+ if (!(path in FS.readFiles)) {
+ FS.readFiles[path] = 1;
+ Module['printErr']('read file: ' + path);
+ }
+ }
+ return stream;
+ },close:function (stream) {
+ try {
+ if (stream.stream_ops.close) {
+ stream.stream_ops.close(stream);
+ }
+ } catch (e) {
+ throw e;
+ } finally {
+ FS.closeStream(stream.fd);
+ }
+ },llseek:function (stream, offset, whence) {
+ if (!stream.seekable || !stream.stream_ops.llseek) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ return stream.stream_ops.llseek(stream, offset, whence);
+ },read:function (stream, buffer, offset, length, position) {
+ if (length < 0 || position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 1) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (FS.isDir(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!stream.stream_ops.read) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var seeking = true;
+ if (typeof position === 'undefined') {
+ position = stream.position;
+ seeking = false;
+ } else if (!stream.seekable) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ var bytesRead = stream.stream_ops.read(stream, buffer, offset, length, position);
+ if (!seeking) stream.position += bytesRead;
+ return bytesRead;
+ },write:function (stream, buffer, offset, length, position, canOwn) {
+ if (length < 0 || position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (FS.isDir(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!stream.stream_ops.write) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var seeking = true;
+ if (typeof position === 'undefined') {
+ position = stream.position;
+ seeking = false;
+ } else if (!stream.seekable) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ if (stream.flags & 1024) {
+ // seek to the end before writing in append mode
+ FS.llseek(stream, 0, 2);
+ }
+ var bytesWritten = stream.stream_ops.write(stream, buffer, offset, length, position, canOwn);
+ if (!seeking) stream.position += bytesWritten;
+ return bytesWritten;
+ },allocate:function (stream, offset, length) {
+ if (offset < 0 || length <= 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (!FS.isFile(stream.node.mode) && !FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ if (!stream.stream_ops.allocate) {
+ throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
+ }
+ stream.stream_ops.allocate(stream, offset, length);
+ },mmap:function (stream, buffer, offset, length, position, prot, flags) {
+ // TODO if PROT is PROT_WRITE, make sure we have write access
+ if ((stream.flags & 2097155) === 1) {
+ throw new FS.ErrnoError(ERRNO_CODES.EACCES);
+ }
+ if (!stream.stream_ops.mmap) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ return stream.stream_ops.mmap(stream, buffer, offset, length, position, prot, flags);
+ },ioctl:function (stream, cmd, arg) {
+ if (!stream.stream_ops.ioctl) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTTY);
+ }
+ return stream.stream_ops.ioctl(stream, cmd, arg);
+ },readFile:function (path, opts) {
+ opts = opts || {};
+ opts.flags = opts.flags || 'r';
+ opts.encoding = opts.encoding || 'binary';
+ if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
+ throw new Error('Invalid encoding type "' + opts.encoding + '"');
+ }
+ var ret;
+ var stream = FS.open(path, opts.flags);
+ var stat = FS.stat(path);
+ var length = stat.size;
+ var buf = new Uint8Array(length);
+ FS.read(stream, buf, 0, length, 0);
+ if (opts.encoding === 'utf8') {
+ ret = '';
+ var utf8 = new Runtime.UTF8Processor();
+ for (var i = 0; i < length; i++) {
+ ret += utf8.processCChar(buf[i]);
+ }
+ } else if (opts.encoding === 'binary') {
+ ret = buf;
+ }
+ FS.close(stream);
+ return ret;
+ },writeFile:function (path, data, opts) {
+ opts = opts || {};
+ opts.flags = opts.flags || 'w';
+ opts.encoding = opts.encoding || 'utf8';
+ if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
+ throw new Error('Invalid encoding type "' + opts.encoding + '"');
+ }
+ var stream = FS.open(path, opts.flags, opts.mode);
+ if (opts.encoding === 'utf8') {
+ var utf8 = new Runtime.UTF8Processor();
+ var buf = new Uint8Array(utf8.processJSString(data));
+ FS.write(stream, buf, 0, buf.length, 0, opts.canOwn);
+ } else if (opts.encoding === 'binary') {
+ FS.write(stream, data, 0, data.length, 0, opts.canOwn);
+ }
+ FS.close(stream);
+ },cwd:function () {
+ return FS.currentPath;
+ },chdir:function (path) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ if (!FS.isDir(lookup.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ var err = FS.nodePermissions(lookup.node, 'x');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ FS.currentPath = lookup.path;
+ },createDefaultDirectories:function () {
+ FS.mkdir('/tmp');
+ },createDefaultDevices:function () {
+ // create /dev
+ FS.mkdir('/dev');
+ // setup /dev/null
+ FS.registerDevice(FS.makedev(1, 3), {
+ read: function() { return 0; },
+ write: function() { return 0; }
+ });
+ FS.mkdev('/dev/null', FS.makedev(1, 3));
+ // setup /dev/tty and /dev/tty1
+ // stderr needs to print output using Module['printErr']
+ // so we register a second tty just for it.
+ TTY.register(FS.makedev(5, 0), TTY.default_tty_ops);
+ TTY.register(FS.makedev(6, 0), TTY.default_tty1_ops);
+ FS.mkdev('/dev/tty', FS.makedev(5, 0));
+ FS.mkdev('/dev/tty1', FS.makedev(6, 0));
+ // we're not going to emulate the actual shm device,
+ // just create the tmp dirs that reside in it commonly
+ FS.mkdir('/dev/shm');
+ FS.mkdir('/dev/shm/tmp');
+ },createStandardStreams:function () {
+ // TODO deprecate the old functionality of a single
+ // input / output callback and that utilizes FS.createDevice
+ // and instead require a unique set of stream ops
+
+ // by default, we symlink the standard streams to the
+ // default tty devices. however, if the standard streams
+ // have been overwritten we create a unique device for
+ // them instead.
+ if (Module['stdin']) {
+ FS.createDevice('/dev', 'stdin', Module['stdin']);
+ } else {
+ FS.symlink('/dev/tty', '/dev/stdin');
+ }
+ if (Module['stdout']) {
+ FS.createDevice('/dev', 'stdout', null, Module['stdout']);
+ } else {
+ FS.symlink('/dev/tty', '/dev/stdout');
+ }
+ if (Module['stderr']) {
+ FS.createDevice('/dev', 'stderr', null, Module['stderr']);
+ } else {
+ FS.symlink('/dev/tty1', '/dev/stderr');
+ }
+
+ // open default streams for the stdin, stdout and stderr devices
+ var stdin = FS.open('/dev/stdin', 'r');
+ HEAP32[((_stdin)>>2)]=FS.getPtrForStream(stdin);
+ assert(stdin.fd === 0, 'invalid handle for stdin (' + stdin.fd + ')');
+
+ var stdout = FS.open('/dev/stdout', 'w');
+ HEAP32[((_stdout)>>2)]=FS.getPtrForStream(stdout);
+ assert(stdout.fd === 1, 'invalid handle for stdout (' + stdout.fd + ')');
+
+ var stderr = FS.open('/dev/stderr', 'w');
+ HEAP32[((_stderr)>>2)]=FS.getPtrForStream(stderr);
+ assert(stderr.fd === 2, 'invalid handle for stderr (' + stderr.fd + ')');
+ },ensureErrnoError:function () {
+ if (FS.ErrnoError) return;
+ FS.ErrnoError = function ErrnoError(errno) {
+ this.errno = errno;
+ for (var key in ERRNO_CODES) {
+ if (ERRNO_CODES[key] === errno) {
+ this.code = key;
+ break;
+ }
+ }
+ this.message = ERRNO_MESSAGES[errno];
+ };
+ FS.ErrnoError.prototype = new Error();
+ FS.ErrnoError.prototype.constructor = FS.ErrnoError;
+ // Some errors may happen quite a bit, to avoid overhead we reuse them (and suffer a lack of stack info)
+ [ERRNO_CODES.ENOENT].forEach(function(code) {
+ FS.genericErrors[code] = new FS.ErrnoError(code);
+ FS.genericErrors[code].stack = '<generic error, no stack>';
+ });
+ },staticInit:function () {
+ FS.ensureErrnoError();
+
+ FS.nameTable = new Array(4096);
+
+ FS.mount(MEMFS, {}, '/');
+
+ FS.createDefaultDirectories();
+ FS.createDefaultDevices();
+ },init:function (input, output, error) {
+ assert(!FS.init.initialized, 'FS.init was previously called. If you want to initialize later with custom parameters, remove any earlier calls (note that one is automatically added to the generated code)');
+ FS.init.initialized = true;
+
+ FS.ensureErrnoError();
+
+ // Allow Module.stdin etc. to provide defaults, if none explicitly passed to us here
+ Module['stdin'] = input || Module['stdin'];
+ Module['stdout'] = output || Module['stdout'];
+ Module['stderr'] = error || Module['stderr'];
+
+ FS.createStandardStreams();
+ },quit:function () {
+ FS.init.initialized = false;
+ for (var i = 0; i < FS.streams.length; i++) {
+ var stream = FS.streams[i];
+ if (!stream) {
+ continue;
+ }
+ FS.close(stream);
+ }
+ },getMode:function (canRead, canWrite) {
+ var mode = 0;
+ if (canRead) mode |= 292 | 73;
+ if (canWrite) mode |= 146;
+ return mode;
+ },joinPath:function (parts, forceRelative) {
+ var path = PATH.join.apply(null, parts);
+ if (forceRelative && path[0] == '/') path = path.substr(1);
+ return path;
+ },absolutePath:function (relative, base) {
+ return PATH.resolve(base, relative);
+ },standardizePath:function (path) {
+ return PATH.normalize(path);
+ },findObject:function (path, dontResolveLastLink) {
+ var ret = FS.analyzePath(path, dontResolveLastLink);
+ if (ret.exists) {
+ return ret.object;
+ } else {
+ ___setErrNo(ret.error);
+ return null;
+ }
+ },analyzePath:function (path, dontResolveLastLink) {
+ // operate from within the context of the symlink's target
+ try {
+ var lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
+ path = lookup.path;
+ } catch (e) {
+ }
+ var ret = {
+ isRoot: false, exists: false, error: 0, name: null, path: null, object: null,
+ parentExists: false, parentPath: null, parentObject: null
+ };
+ try {
+ var lookup = FS.lookupPath(path, { parent: true });
+ ret.parentExists = true;
+ ret.parentPath = lookup.path;
+ ret.parentObject = lookup.node;
+ ret.name = PATH.basename(path);
+ lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
+ ret.exists = true;
+ ret.path = lookup.path;
+ ret.object = lookup.node;
+ ret.name = lookup.node.name;
+ ret.isRoot = lookup.path === '/';
+ } catch (e) {
+ ret.error = e.errno;
+ };
+ return ret;
+ },createFolder:function (parent, name, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(canRead, canWrite);
+ return FS.mkdir(path, mode);
+ },createPath:function (parent, path, canRead, canWrite) {
+ parent = typeof parent === 'string' ? parent : FS.getPath(parent);
+ var parts = path.split('/').reverse();
+ while (parts.length) {
+ var part = parts.pop();
+ if (!part) continue;
+ var current = PATH.join2(parent, part);
+ try {
+ FS.mkdir(current);
+ } catch (e) {
+ // ignore EEXIST
+ }
+ parent = current;
+ }
+ return current;
+ },createFile:function (parent, name, properties, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(canRead, canWrite);
+ return FS.create(path, mode);
+ },createDataFile:function (parent, name, data, canRead, canWrite, canOwn) {
+ var path = name ? PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name) : parent;
+ var mode = FS.getMode(canRead, canWrite);
+ var node = FS.create(path, mode);
+ if (data) {
+ if (typeof data === 'string') {
+ var arr = new Array(data.length);
+ for (var i = 0, len = data.length; i < len; ++i) arr[i] = data.charCodeAt(i);
+ data = arr;
+ }
+ // make sure we can write to the file
+ FS.chmod(node, mode | 146);
+ var stream = FS.open(node, 'w');
+ FS.write(stream, data, 0, data.length, 0, canOwn);
+ FS.close(stream);
+ FS.chmod(node, mode);
+ }
+ return node;
+ },createDevice:function (parent, name, input, output) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(!!input, !!output);
+ if (!FS.createDevice.major) FS.createDevice.major = 64;
+ var dev = FS.makedev(FS.createDevice.major++, 0);
+ // Create a fake device that a set of stream ops to emulate
+ // the old behavior.
+ FS.registerDevice(dev, {
+ open: function(stream) {
+ stream.seekable = false;
+ },
+ close: function(stream) {
+ // flush any pending line data
+ if (output && output.buffer && output.buffer.length) {
+ output(10);
+ }
+ },
+ read: function(stream, buffer, offset, length, pos /* ignored */) {
+ var bytesRead = 0;
+ for (var i = 0; i < length; i++) {
+ var result;
+ try {
+ result = input();
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ if (result === undefined && bytesRead === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ if (result === null || result === undefined) break;
+ bytesRead++;
+ buffer[offset+i] = result;
+ }
+ if (bytesRead) {
+ stream.node.timestamp = Date.now();
+ }
+ return bytesRead;
+ },
+ write: function(stream, buffer, offset, length, pos) {
+ for (var i = 0; i < length; i++) {
+ try {
+ output(buffer[offset+i]);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ }
+ if (length) {
+ stream.node.timestamp = Date.now();
+ }
+ return i;
+ }
+ });
+ return FS.mkdev(path, mode, dev);
+ },createLink:function (parent, name, target, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ return FS.symlink(target, path);
+ },forceLoadFile:function (obj) {
+ if (obj.isDevice || obj.isFolder || obj.link || obj.contents) return true;
+ var success = true;
+ if (typeof XMLHttpRequest !== 'undefined') {
+ throw new Error("Lazy loading should have been performed (contents set) in createLazyFile, but it was not. Lazy loading only works in web workers. Use --embed-file or --preload-file in emcc on the main thread.");
+ } else if (Module['read']) {
+ // Command-line.
+ try {
+ // WARNING: Can't read binary files in V8's d8 or tracemonkey's js, as
+ // read() will try to parse UTF8.
+ obj.contents = intArrayFromString(Module['read'](obj.url), true);
+ } catch (e) {
+ success = false;
+ }
+ } else {
+ throw new Error('Cannot load without read() or XMLHttpRequest.');
+ }
+ if (!success) ___setErrNo(ERRNO_CODES.EIO);
+ return success;
+ },createLazyFile:function (parent, name, url, canRead, canWrite) {
+ // Lazy chunked Uint8Array (implements get and length from Uint8Array). Actual getting is abstracted away for eventual reuse.
+ function LazyUint8Array() {
+ this.lengthKnown = false;
+ this.chunks = []; // Loaded chunks. Index is the chunk number
+ }
+ LazyUint8Array.prototype.get = function LazyUint8Array_get(idx) {
+ if (idx > this.length-1 || idx < 0) {
+ return undefined;
+ }
+ var chunkOffset = idx % this.chunkSize;
+ var chunkNum = Math.floor(idx / this.chunkSize);
+ return this.getter(chunkNum)[chunkOffset];
+ }
+ LazyUint8Array.prototype.setDataGetter = function LazyUint8Array_setDataGetter(getter) {
+ this.getter = getter;
+ }
+ LazyUint8Array.prototype.cacheLength = function LazyUint8Array_cacheLength() {
+ // Find length
+ var xhr = new XMLHttpRequest();
+ xhr.open('HEAD', url, false);
+ xhr.send(null);
+ if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
+ var datalength = Number(xhr.getResponseHeader("Content-length"));
+ var header;
+ var hasByteServing = (header = xhr.getResponseHeader("Accept-Ranges")) && header === "bytes";
+ var chunkSize = 1024*1024; // Chunk size in bytes
+
+ if (!hasByteServing) chunkSize = datalength;
+
+ // Function to get a range from the remote URL.
+ var doXHR = (function(from, to) {
+ if (from > to) throw new Error("invalid range (" + from + ", " + to + ") or no bytes requested!");
+ if (to > datalength-1) throw new Error("only " + datalength + " bytes available! programmer error!");
+
+ // TODO: Use mozResponseArrayBuffer, responseStream, etc. if available.
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, false);
+ if (datalength !== chunkSize) xhr.setRequestHeader("Range", "bytes=" + from + "-" + to);
+
+ // Some hints to the browser that we want binary data.
+ if (typeof Uint8Array != 'undefined') xhr.responseType = 'arraybuffer';
+ if (xhr.overrideMimeType) {
+ xhr.overrideMimeType('text/plain; charset=x-user-defined');
+ }
+
+ xhr.send(null);
+ if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
+ if (xhr.response !== undefined) {
+ return new Uint8Array(xhr.response || []);
+ } else {
+ return intArrayFromString(xhr.responseText || '', true);
+ }
+ });
+ var lazyArray = this;
+ lazyArray.setDataGetter(function(chunkNum) {
+ var start = chunkNum * chunkSize;
+ var end = (chunkNum+1) * chunkSize - 1; // including this byte
+ end = Math.min(end, datalength-1); // if datalength-1 is selected, this is the last block
+ if (typeof(lazyArray.chunks[chunkNum]) === "undefined") {
+ lazyArray.chunks[chunkNum] = doXHR(start, end);
+ }
+ if (typeof(lazyArray.chunks[chunkNum]) === "undefined") throw new Error("doXHR failed!");
+ return lazyArray.chunks[chunkNum];
+ });
+
+ this._length = datalength;
+ this._chunkSize = chunkSize;
+ this.lengthKnown = true;
+ }
+ if (typeof XMLHttpRequest !== 'undefined') {
+ if (!ENVIRONMENT_IS_WORKER) throw 'Cannot do synchronous binary XHRs outside webworkers in modern browsers. Use --embed-file or --preload-file in emcc';
+ var lazyArray = new LazyUint8Array();
+ Object.defineProperty(lazyArray, "length", {
+ get: function() {
+ if(!this.lengthKnown) {
+ this.cacheLength();
+ }
+ return this._length;
+ }
+ });
+ Object.defineProperty(lazyArray, "chunkSize", {
+ get: function() {
+ if(!this.lengthKnown) {
+ this.cacheLength();
+ }
+ return this._chunkSize;
+ }
+ });
+
+ var properties = { isDevice: false, contents: lazyArray };
+ } else {
+ var properties = { isDevice: false, url: url };
+ }
+
+ var node = FS.createFile(parent, name, properties, canRead, canWrite);
+ // This is a total hack, but I want to get this lazy file code out of the
+ // core of MEMFS. If we want to keep this lazy file concept I feel it should
+ // be its own thin LAZYFS proxying calls to MEMFS.
+ if (properties.contents) {
+ node.contents = properties.contents;
+ } else if (properties.url) {
+ node.contents = null;
+ node.url = properties.url;
+ }
+ // override each stream op with one that tries to force load the lazy file first
+ var stream_ops = {};
+ var keys = Object.keys(node.stream_ops);
+ keys.forEach(function(key) {
+ var fn = node.stream_ops[key];
+ stream_ops[key] = function forceLoadLazyFile() {
+ if (!FS.forceLoadFile(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ return fn.apply(null, arguments);
+ };
+ });
+ // use a custom read function
+ stream_ops.read = function stream_ops_read(stream, buffer, offset, length, position) {
+ if (!FS.forceLoadFile(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ var contents = stream.node.contents;
+ if (position >= contents.length)
+ return 0;
+ var size = Math.min(contents.length - position, length);
+ assert(size >= 0);
+ if (contents.slice) { // normal array
+ for (var i = 0; i < size; i++) {
+ buffer[offset + i] = contents[position + i];
+ }
+ } else {
+ for (var i = 0; i < size; i++) { // LazyUint8Array from sync binary XHR
+ buffer[offset + i] = contents.get(position + i);
+ }
+ }
+ return size;
+ };
+ node.stream_ops = stream_ops;
+ return node;
+ },createPreloadedFile:function (parent, name, url, canRead, canWrite, onload, onerror, dontCreateFile, canOwn) {
+ Browser.init();
+ // TODO we should allow people to just pass in a complete filename instead
+ // of parent and name being that we just join them anyways
+ var fullname = name ? PATH.resolve(PATH.join2(parent, name)) : parent;
+ function processData(byteArray) {
+ function finish(byteArray) {
+ if (!dontCreateFile) {
+ FS.createDataFile(parent, name, byteArray, canRead, canWrite, canOwn);
+ }
+ if (onload) onload();
+ removeRunDependency('cp ' + fullname);
+ }
+ var handled = false;
+ Module['preloadPlugins'].forEach(function(plugin) {
+ if (handled) return;
+ if (plugin['canHandle'](fullname)) {
+ plugin['handle'](byteArray, fullname, finish, function() {
+ if (onerror) onerror();
+ removeRunDependency('cp ' + fullname);
+ });
+ handled = true;
+ }
+ });
+ if (!handled) finish(byteArray);
+ }
+ addRunDependency('cp ' + fullname);
+ if (typeof url == 'string') {
+ Browser.asyncLoad(url, function(byteArray) {
+ processData(byteArray);
+ }, onerror);
+ } else {
+ processData(url);
+ }
+ },indexedDB:function () {
+ return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
+ },DB_NAME:function () {
+ return 'EM_FS_' + window.location.pathname;
+ },DB_VERSION:20,DB_STORE_NAME:"FILE_DATA",saveFilesToDB:function (paths, onload, onerror) {
+ onload = onload || function(){};
+ onerror = onerror || function(){};
+ var indexedDB = FS.indexedDB();
+ try {
+ var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
+ } catch (e) {
+ return onerror(e);
+ }
+ openRequest.onupgradeneeded = function openRequest_onupgradeneeded() {
+ console.log('creating db');
+ var db = openRequest.result;
+ db.createObjectStore(FS.DB_STORE_NAME);
+ };
+ openRequest.onsuccess = function openRequest_onsuccess() {
+ var db = openRequest.result;
+ var transaction = db.transaction([FS.DB_STORE_NAME], 'readwrite');
+ var files = transaction.objectStore(FS.DB_STORE_NAME);
+ var ok = 0, fail = 0, total = paths.length;
+ function finish() {
+ if (fail == 0) onload(); else onerror();
+ }
+ paths.forEach(function(path) {
+ var putRequest = files.put(FS.analyzePath(path).object.contents, path);
+ putRequest.onsuccess = function putRequest_onsuccess() { ok++; if (ok + fail == total) finish() };
+ putRequest.onerror = function putRequest_onerror() { fail++; if (ok + fail == total) finish() };
+ });
+ transaction.onerror = onerror;
+ };
+ openRequest.onerror = onerror;
+ },loadFilesFromDB:function (paths, onload, onerror) {
+ onload = onload || function(){};
+ onerror = onerror || function(){};
+ var indexedDB = FS.indexedDB();
+ try {
+ var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
+ } catch (e) {
+ return onerror(e);
+ }
+ openRequest.onupgradeneeded = onerror; // no database to load from
+ openRequest.onsuccess = function openRequest_onsuccess() {
+ var db = openRequest.result;
+ try {
+ var transaction = db.transaction([FS.DB_STORE_NAME], 'readonly');
+ } catch(e) {
+ onerror(e);
+ return;
+ }
+ var files = transaction.objectStore(FS.DB_STORE_NAME);
+ var ok = 0, fail = 0, total = paths.length;
+ function finish() {
+ if (fail == 0) onload(); else onerror();
+ }
+ paths.forEach(function(path) {
+ var getRequest = files.get(path);
+ getRequest.onsuccess = function getRequest_onsuccess() {
+ if (FS.analyzePath(path).exists) {
+ FS.unlink(path);
+ }
+ FS.createDataFile(PATH.dirname(path), PATH.basename(path), getRequest.result, true, true, true);
+ ok++;
+ if (ok + fail == total) finish();
+ };
+ getRequest.onerror = function getRequest_onerror() { fail++; if (ok + fail == total) finish() };
+ });
+ transaction.onerror = onerror;
+ };
+ openRequest.onerror = onerror;
+ }};var PATH={splitPath:function (filename) {
+ var splitPathRe = /^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/;
+ return splitPathRe.exec(filename).slice(1);
+ },normalizeArray:function (parts, allowAboveRoot) {
+ // if the path tries to go above the root, `up` ends up > 0
+ var up = 0;
+ for (var i = parts.length - 1; i >= 0; i--) {
+ var last = parts[i];
+ if (last === '.') {
+ parts.splice(i, 1);
+ } else if (last === '..') {
+ parts.splice(i, 1);
+ up++;
+ } else if (up) {
+ parts.splice(i, 1);
+ up--;
+ }
+ }
+ // if the path is allowed to go above the root, restore leading ..s
+ if (allowAboveRoot) {
+ for (; up--; up) {
+ parts.unshift('..');
+ }
+ }
+ return parts;
+ },normalize:function (path) {
+ var isAbsolute = path.charAt(0) === '/',
+ trailingSlash = path.substr(-1) === '/';
+ // Normalize the path
+ path = PATH.normalizeArray(path.split('/').filter(function(p) {
+ return !!p;
+ }), !isAbsolute).join('/');
+ if (!path && !isAbsolute) {
+ path = '.';
+ }
+ if (path && trailingSlash) {
+ path += '/';
+ }
+ return (isAbsolute ? '/' : '') + path;
+ },dirname:function (path) {
+ var result = PATH.splitPath(path),
+ root = result[0],
+ dir = result[1];
+ if (!root && !dir) {
+ // No dirname whatsoever
+ return '.';
+ }
+ if (dir) {
+ // It has a dirname, strip trailing slash
+ dir = dir.substr(0, dir.length - 1);
+ }
+ return root + dir;
+ },basename:function (path) {
+ // EMSCRIPTEN return '/'' for '/', not an empty string
+ if (path === '/') return '/';
+ var lastSlash = path.lastIndexOf('/');
+ if (lastSlash === -1) return path;
+ return path.substr(lastSlash+1);
+ },extname:function (path) {
+ return PATH.splitPath(path)[3];
+ },join:function () {
+ var paths = Array.prototype.slice.call(arguments, 0);
+ return PATH.normalize(paths.join('/'));
+ },join2:function (l, r) {
+ return PATH.normalize(l + '/' + r);
+ },resolve:function () {
+ var resolvedPath = '',
+ resolvedAbsolute = false;
+ for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {
+ var path = (i >= 0) ? arguments[i] : FS.cwd();
+ // Skip empty and invalid entries
+ if (typeof path !== 'string') {
+ throw new TypeError('Arguments to path.resolve must be strings');
+ } else if (!path) {
+ continue;
+ }
+ resolvedPath = path + '/' + resolvedPath;
+ resolvedAbsolute = path.charAt(0) === '/';
+ }
+ // At this point the path should be resolved to a full absolute path, but
+ // handle relative paths to be safe (might happen when process.cwd() fails)
+ resolvedPath = PATH.normalizeArray(resolvedPath.split('/').filter(function(p) {
+ return !!p;
+ }), !resolvedAbsolute).join('/');
+ return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.';
+ },relative:function (from, to) {
+ from = PATH.resolve(from).substr(1);
+ to = PATH.resolve(to).substr(1);
+ function trim(arr) {
+ var start = 0;
+ for (; start < arr.length; start++) {
+ if (arr[start] !== '') break;
+ }
+ var end = arr.length - 1;
+ for (; end >= 0; end--) {
+ if (arr[end] !== '') break;
+ }
+ if (start > end) return [];
+ return arr.slice(start, end - start + 1);
+ }
+ var fromParts = trim(from.split('/'));
+ var toParts = trim(to.split('/'));
+ var length = Math.min(fromParts.length, toParts.length);
+ var samePartsLength = length;
+ for (var i = 0; i < length; i++) {
+ if (fromParts[i] !== toParts[i]) {
+ samePartsLength = i;
+ break;
+ }
+ }
+ var outputParts = [];
+ for (var i = samePartsLength; i < fromParts.length; i++) {
+ outputParts.push('..');
+ }
+ outputParts = outputParts.concat(toParts.slice(samePartsLength));
+ return outputParts.join('/');
+ }};var Browser={mainLoop:{scheduler:null,method:"",shouldPause:false,paused:false,queue:[],pause:function () {
+ Browser.mainLoop.shouldPause = true;
+ },resume:function () {
+ if (Browser.mainLoop.paused) {
+ Browser.mainLoop.paused = false;
+ Browser.mainLoop.scheduler();
+ }
+ Browser.mainLoop.shouldPause = false;
+ },updateStatus:function () {
+ if (Module['setStatus']) {
+ var message = Module['statusMessage'] || 'Please wait...';
+ var remaining = Browser.mainLoop.remainingBlockers;
+ var expected = Browser.mainLoop.expectedBlockers;
+ if (remaining) {
+ if (remaining < expected) {
+ Module['setStatus'](message + ' (' + (expected - remaining) + '/' + expected + ')');
+ } else {
+ Module['setStatus'](message);
+ }
+ } else {
+ Module['setStatus']('');
+ }
+ }
+ }},isFullScreen:false,pointerLock:false,moduleContextCreatedCallbacks:[],workers:[],init:function () {
+ if (!Module["preloadPlugins"]) Module["preloadPlugins"] = []; // needs to exist even in workers
+
+ if (Browser.initted || ENVIRONMENT_IS_WORKER) return;
+ Browser.initted = true;
+
+ try {
+ new Blob();
+ Browser.hasBlobConstructor = true;
+ } catch(e) {
+ Browser.hasBlobConstructor = false;
+ console.log("warning: no blob constructor, cannot create blobs with mimetypes");
+ }
+ Browser.BlobBuilder = typeof MozBlobBuilder != "undefined" ? MozBlobBuilder : (typeof WebKitBlobBuilder != "undefined" ? WebKitBlobBuilder : (!Browser.hasBlobConstructor ? console.log("warning: no BlobBuilder") : null));
+ Browser.URLObject = typeof window != "undefined" ? (window.URL ? window.URL : window.webkitURL) : undefined;
+ if (!Module.noImageDecoding && typeof Browser.URLObject === 'undefined') {
+ console.log("warning: Browser does not support creating object URLs. Built-in browser image decoding will not be available.");
+ Module.noImageDecoding = true;
+ }
+
+ // Support for plugins that can process preloaded files. You can add more of these to
+ // your app by creating and appending to Module.preloadPlugins.
+ //
+ // Each plugin is asked if it can handle a file based on the file's name. If it can,
+ // it is given the file's raw data. When it is done, it calls a callback with the file's
+ // (possibly modified) data. For example, a plugin might decompress a file, or it
+ // might create some side data structure for use later (like an Image element, etc.).
+
+ var imagePlugin = {};
+ imagePlugin['canHandle'] = function imagePlugin_canHandle(name) {
+ return !Module.noImageDecoding && /\.(jpg|jpeg|png|bmp)$/i.test(name);
+ };
+ imagePlugin['handle'] = function imagePlugin_handle(byteArray, name, onload, onerror) {
+ var b = null;
+ if (Browser.hasBlobConstructor) {
+ try {
+ b = new Blob([byteArray], { type: Browser.getMimetype(name) });
+ if (b.size !== byteArray.length) { // Safari bug #118630
+ // Safari's Blob can only take an ArrayBuffer
+ b = new Blob([(new Uint8Array(byteArray)).buffer], { type: Browser.getMimetype(name) });
+ }
+ } catch(e) {
+ Runtime.warnOnce('Blob constructor present but fails: ' + e + '; falling back to blob builder');
+ }
+ }
+ if (!b) {
+ var bb = new Browser.BlobBuilder();
+ bb.append((new Uint8Array(byteArray)).buffer); // we need to pass a buffer, and must copy the array to get the right data range
+ b = bb.getBlob();
+ }
+ var url = Browser.URLObject.createObjectURL(b);
+ var img = new Image();
+ img.onload = function img_onload() {
+ assert(img.complete, 'Image ' + name + ' could not be decoded');
+ var canvas = document.createElement('canvas');
+ canvas.width = img.width;
+ canvas.height = img.height;
+ var ctx = canvas.getContext('2d');
+ ctx.drawImage(img, 0, 0);
+ Module["preloadedImages"][name] = canvas;
+ Browser.URLObject.revokeObjectURL(url);
+ if (onload) onload(byteArray);
+ };
+ img.onerror = function img_onerror(event) {
+ console.log('Image ' + url + ' could not be decoded');
+ if (onerror) onerror();
+ };
+ img.src = url;
+ };
+ Module['preloadPlugins'].push(imagePlugin);
+
+ var audioPlugin = {};
+ audioPlugin['canHandle'] = function audioPlugin_canHandle(name) {
+ return !Module.noAudioDecoding && name.substr(-4) in { '.ogg': 1, '.wav': 1, '.mp3': 1 };
+ };
+ audioPlugin['handle'] = function audioPlugin_handle(byteArray, name, onload, onerror) {
+ var done = false;
+ function finish(audio) {
+ if (done) return;
+ done = true;
+ Module["preloadedAudios"][name] = audio;
+ if (onload) onload(byteArray);
+ }
+ function fail() {
+ if (done) return;
+ done = true;
+ Module["preloadedAudios"][name] = new Audio(); // empty shim
+ if (onerror) onerror();
+ }
+ if (Browser.hasBlobConstructor) {
+ try {
+ var b = new Blob([byteArray], { type: Browser.getMimetype(name) });
+ } catch(e) {
+ return fail();
+ }
+ var url = Browser.URLObject.createObjectURL(b); // XXX we never revoke this!
+ var audio = new Audio();
+ audio.addEventListener('canplaythrough', function() { finish(audio) }, false); // use addEventListener due to chromium bug 124926
+ audio.onerror = function audio_onerror(event) {
+ if (done) return;
+ console.log('warning: browser could not fully decode audio ' + name + ', trying slower base64 approach');
+ function encode64(data) {
+ var BASE = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
+ var PAD = '=';
+ var ret = '';
+ var leftchar = 0;
+ var leftbits = 0;
+ for (var i = 0; i < data.length; i++) {
+ leftchar = (leftchar << 8) | data[i];
+ leftbits += 8;
+ while (leftbits >= 6) {
+ var curr = (leftchar >> (leftbits-6)) & 0x3f;
+ leftbits -= 6;
+ ret += BASE[curr];
+ }
+ }
+ if (leftbits == 2) {
+ ret += BASE[(leftchar&3) << 4];
+ ret += PAD + PAD;
+ } else if (leftbits == 4) {
+ ret += BASE[(leftchar&0xf) << 2];
+ ret += PAD;
+ }
+ return ret;
+ }
+ audio.src = 'data:audio/x-' + name.substr(-3) + ';base64,' + encode64(byteArray);
+ finish(audio); // we don't wait for confirmation this worked - but it's worth trying
+ };
+ audio.src = url;
+ // workaround for chrome bug 124926 - we do not always get oncanplaythrough or onerror
+ Browser.safeSetTimeout(function() {
+ finish(audio); // try to use it even though it is not necessarily ready to play
+ }, 10000);
+ } else {
+ return fail();
+ }
+ };
+ Module['preloadPlugins'].push(audioPlugin);
+
+ // Canvas event setup
+
+ var canvas = Module['canvas'];
+
+ // forced aspect ratio can be enabled by defining 'forcedAspectRatio' on Module
+ // Module['forcedAspectRatio'] = 4 / 3;
+
+ canvas.requestPointerLock = canvas['requestPointerLock'] ||
+ canvas['mozRequestPointerLock'] ||
+ canvas['webkitRequestPointerLock'] ||
+ canvas['msRequestPointerLock'] ||
+ function(){};
+ canvas.exitPointerLock = document['exitPointerLock'] ||
+ document['mozExitPointerLock'] ||
+ document['webkitExitPointerLock'] ||
+ document['msExitPointerLock'] ||
+ function(){}; // no-op if function does not exist
+ canvas.exitPointerLock = canvas.exitPointerLock.bind(document);
+
+ function pointerLockChange() {
+ Browser.pointerLock = document['pointerLockElement'] === canvas ||
+ document['mozPointerLockElement'] === canvas ||
+ document['webkitPointerLockElement'] === canvas ||
+ document['msPointerLockElement'] === canvas;
+ }
+
+ document.addEventListener('pointerlockchange', pointerLockChange, false);
+ document.addEventListener('mozpointerlockchange', pointerLockChange, false);
+ document.addEventListener('webkitpointerlockchange', pointerLockChange, false);
+ document.addEventListener('mspointerlockchange', pointerLockChange, false);
+
+ if (Module['elementPointerLock']) {
+ canvas.addEventListener("click", function(ev) {
+ if (!Browser.pointerLock && canvas.requestPointerLock) {
+ canvas.requestPointerLock();
+ ev.preventDefault();
+ }
+ }, false);
+ }
+ },createContext:function (canvas, useWebGL, setInModule, webGLContextAttributes) {
+ var ctx;
+ var errorInfo = '?';
+ function onContextCreationError(event) {
+ errorInfo = event.statusMessage || errorInfo;
+ }
+ try {
+ if (useWebGL) {
+ var contextAttributes = {
+ antialias: false,
+ alpha: false
+ };
+
+ if (webGLContextAttributes) {
+ for (var attribute in webGLContextAttributes) {
+ contextAttributes[attribute] = webGLContextAttributes[attribute];
+ }
+ }
+
+
+ canvas.addEventListener('webglcontextcreationerror', onContextCreationError, false);
+ try {
+ ['experimental-webgl', 'webgl'].some(function(webglId) {
+ return ctx = canvas.getContext(webglId, contextAttributes);
+ });
+ } finally {
+ canvas.removeEventListener('webglcontextcreationerror', onContextCreationError, false);
+ }
+ } else {
+ ctx = canvas.getContext('2d');
+ }
+ if (!ctx) throw ':(';
+ } catch (e) {
+ Module.print('Could not create canvas: ' + [errorInfo, e]);
+ return null;
+ }
+ if (useWebGL) {
+ // Set the background of the WebGL canvas to black
+ canvas.style.backgroundColor = "black";
+
+ // Warn on context loss
+ canvas.addEventListener('webglcontextlost', function(event) {
+ alert('WebGL context lost. You will need to reload the page.');
+ }, false);
+ }
+ if (setInModule) {
+ GLctx = Module.ctx = ctx;
+ Module.useWebGL = useWebGL;
+ Browser.moduleContextCreatedCallbacks.forEach(function(callback) { callback() });
+ Browser.init();
+ }
+ return ctx;
+ },destroyContext:function (canvas, useWebGL, setInModule) {},fullScreenHandlersInstalled:false,lockPointer:undefined,resizeCanvas:undefined,requestFullScreen:function (lockPointer, resizeCanvas) {
+ Browser.lockPointer = lockPointer;
+ Browser.resizeCanvas = resizeCanvas;
+ if (typeof Browser.lockPointer === 'undefined') Browser.lockPointer = true;
+ if (typeof Browser.resizeCanvas === 'undefined') Browser.resizeCanvas = false;
+
+ var canvas = Module['canvas'];
+ function fullScreenChange() {
+ Browser.isFullScreen = false;
+ var canvasContainer = canvas.parentNode;
+ if ((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
+ document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
+ document['fullScreenElement'] || document['fullscreenElement'] ||
+ document['msFullScreenElement'] || document['msFullscreenElement'] ||
+ document['webkitCurrentFullScreenElement']) === canvasContainer) {
+ canvas.cancelFullScreen = document['cancelFullScreen'] ||
+ document['mozCancelFullScreen'] ||
+ document['webkitCancelFullScreen'] ||
+ document['msExitFullscreen'] ||
+ document['exitFullscreen'] ||
+ function() {};
+ canvas.cancelFullScreen = canvas.cancelFullScreen.bind(document);
+ if (Browser.lockPointer) canvas.requestPointerLock();
+ Browser.isFullScreen = true;
+ if (Browser.resizeCanvas) Browser.setFullScreenCanvasSize();
+ } else {
+
+ // remove the full screen specific parent of the canvas again to restore the HTML structure from before going full screen
+ canvasContainer.parentNode.insertBefore(canvas, canvasContainer);
+ canvasContainer.parentNode.removeChild(canvasContainer);
+
+ if (Browser.resizeCanvas) Browser.setWindowedCanvasSize();
+ }
+ if (Module['onFullScreen']) Module['onFullScreen'](Browser.isFullScreen);
+ Browser.updateCanvasDimensions(canvas);
+ }
+
+ if (!Browser.fullScreenHandlersInstalled) {
+ Browser.fullScreenHandlersInstalled = true;
+ document.addEventListener('fullscreenchange', fullScreenChange, false);
+ document.addEventListener('mozfullscreenchange', fullScreenChange, false);
+ document.addEventListener('webkitfullscreenchange', fullScreenChange, false);
+ document.addEventListener('MSFullscreenChange', fullScreenChange, false);
+ }
+
+ // create a new parent to ensure the canvas has no siblings. this allows browsers to optimize full screen performance when its parent is the full screen root
+ var canvasContainer = document.createElement("div");
+ canvas.parentNode.insertBefore(canvasContainer, canvas);
+ canvasContainer.appendChild(canvas);
+
+ // use parent of canvas as full screen root to allow aspect ratio correction (Firefox stretches the root to screen size)
+ canvasContainer.requestFullScreen = canvasContainer['requestFullScreen'] ||
+ canvasContainer['mozRequestFullScreen'] ||
+ canvasContainer['msRequestFullscreen'] ||
+ (canvasContainer['webkitRequestFullScreen'] ? function() { canvasContainer['webkitRequestFullScreen'](Element['ALLOW_KEYBOARD_INPUT']) } : null);
+ canvasContainer.requestFullScreen();
+ },requestAnimationFrame:function requestAnimationFrame(func) {
+ if (typeof window === 'undefined') { // Provide fallback to setTimeout if window is undefined (e.g. in Node.js)
+ setTimeout(func, 1000/60);
+ } else {
+ if (!window.requestAnimationFrame) {
+ window.requestAnimationFrame = window['requestAnimationFrame'] ||
+ window['mozRequestAnimationFrame'] ||
+ window['webkitRequestAnimationFrame'] ||
+ window['msRequestAnimationFrame'] ||
+ window['oRequestAnimationFrame'] ||
+ window['setTimeout'];
+ }
+ window.requestAnimationFrame(func);
+ }
+ },safeCallback:function (func) {
+ return function() {
+ if (!ABORT) return func.apply(null, arguments);
+ };
+ },safeRequestAnimationFrame:function (func) {
+ return Browser.requestAnimationFrame(function() {
+ if (!ABORT) func();
+ });
+ },safeSetTimeout:function (func, timeout) {
+ return setTimeout(function() {
+ if (!ABORT) func();
+ }, timeout);
+ },safeSetInterval:function (func, timeout) {
+ return setInterval(function() {
+ if (!ABORT) func();
+ }, timeout);
+ },getMimetype:function (name) {
+ return {
+ 'jpg': 'image/jpeg',
+ 'jpeg': 'image/jpeg',
+ 'png': 'image/png',
+ 'bmp': 'image/bmp',
+ 'ogg': 'audio/ogg',
+ 'wav': 'audio/wav',
+ 'mp3': 'audio/mpeg'
+ }[name.substr(name.lastIndexOf('.')+1)];
+ },getUserMedia:function (func) {
+ if(!window.getUserMedia) {
+ window.getUserMedia = navigator['getUserMedia'] ||
+ navigator['mozGetUserMedia'];
+ }
+ window.getUserMedia(func);
+ },getMovementX:function (event) {
+ return event['movementX'] ||
+ event['mozMovementX'] ||
+ event['webkitMovementX'] ||
+ 0;
+ },getMovementY:function (event) {
+ return event['movementY'] ||
+ event['mozMovementY'] ||
+ event['webkitMovementY'] ||
+ 0;
+ },getMouseWheelDelta:function (event) {
+ return Math.max(-1, Math.min(1, event.type === 'DOMMouseScroll' ? event.detail : -event.wheelDelta));
+ },mouseX:0,mouseY:0,mouseMovementX:0,mouseMovementY:0,calculateMouseEvent:function (event) { // event should be mousemove, mousedown or mouseup
+ if (Browser.pointerLock) {
+ // When the pointer is locked, calculate the coordinates
+ // based on the movement of the mouse.
+ // Workaround for Firefox bug 764498
+ if (event.type != 'mousemove' &&
+ ('mozMovementX' in event)) {
+ Browser.mouseMovementX = Browser.mouseMovementY = 0;
+ } else {
+ Browser.mouseMovementX = Browser.getMovementX(event);
+ Browser.mouseMovementY = Browser.getMovementY(event);
+ }
+
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ Browser.mouseX = SDL.mouseX + Browser.mouseMovementX;
+ Browser.mouseY = SDL.mouseY + Browser.mouseMovementY;
+ } else {
+ // just add the mouse delta to the current absolut mouse position
+ // FIXME: ideally this should be clamped against the canvas size and zero
+ Browser.mouseX += Browser.mouseMovementX;
+ Browser.mouseY += Browser.mouseMovementY;
+ }
+ } else {
+ // Otherwise, calculate the movement based on the changes
+ // in the coordinates.
+ var rect = Module["canvas"].getBoundingClientRect();
+ var x, y;
+
+ // Neither .scrollX or .pageXOffset are defined in a spec, but
+ // we prefer .scrollX because it is currently in a spec draft.
+ // (see: http://www.w3.org/TR/2013/WD-cssom-view-20131217/)
+ var scrollX = ((typeof window.scrollX !== 'undefined') ? window.scrollX : window.pageXOffset);
+ var scrollY = ((typeof window.scrollY !== 'undefined') ? window.scrollY : window.pageYOffset);
+ if (event.type == 'touchstart' ||
+ event.type == 'touchend' ||
+ event.type == 'touchmove') {
+ var t = event.touches.item(0);
+ if (t) {
+ x = t.pageX - (scrollX + rect.left);
+ y = t.pageY - (scrollY + rect.top);
+ } else {
+ return;
+ }
+ } else {
+ x = event.pageX - (scrollX + rect.left);
+ y = event.pageY - (scrollY + rect.top);
+ }
+
+ // the canvas might be CSS-scaled compared to its backbuffer;
+ // SDL-using content will want mouse coordinates in terms
+ // of backbuffer units.
+ var cw = Module["canvas"].width;
+ var ch = Module["canvas"].height;
+ x = x * (cw / rect.width);
+ y = y * (ch / rect.height);
+
+ Browser.mouseMovementX = x - Browser.mouseX;
+ Browser.mouseMovementY = y - Browser.mouseY;
+ Browser.mouseX = x;
+ Browser.mouseY = y;
+ }
+ },xhrLoad:function (url, onload, onerror) {
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, true);
+ xhr.responseType = 'arraybuffer';
+ xhr.onload = function xhr_onload() {
+ if (xhr.status == 200 || (xhr.status == 0 && xhr.response)) { // file URLs can return 0
+ onload(xhr.response);
+ } else {
+ onerror();
+ }
+ };
+ xhr.onerror = onerror;
+ xhr.send(null);
+ },asyncLoad:function (url, onload, onerror, noRunDep) {
+ Browser.xhrLoad(url, function(arrayBuffer) {
+ assert(arrayBuffer, 'Loading data file "' + url + '" failed (no arrayBuffer).');
+ onload(new Uint8Array(arrayBuffer));
+ if (!noRunDep) removeRunDependency('al ' + url);
+ }, function(event) {
+ if (onerror) {
+ onerror();
+ } else {
+ throw 'Loading data file "' + url + '" failed.';
+ }
+ });
+ if (!noRunDep) addRunDependency('al ' + url);
+ },resizeListeners:[],updateResizeListeners:function () {
+ var canvas = Module['canvas'];
+ Browser.resizeListeners.forEach(function(listener) {
+ listener(canvas.width, canvas.height);
+ });
+ },setCanvasSize:function (width, height, noUpdates) {
+ var canvas = Module['canvas'];
+ Browser.updateCanvasDimensions(canvas, width, height);
+ if (!noUpdates) Browser.updateResizeListeners();
+ },windowedWidth:0,windowedHeight:0,setFullScreenCanvasSize:function () {
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
+ flags = flags | 0x00800000; // set SDL_FULLSCREEN flag
+ HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
+ }
+ Browser.updateResizeListeners();
+ },setWindowedCanvasSize:function () {
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
+ flags = flags & ~0x00800000; // clear SDL_FULLSCREEN flag
+ HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
+ }
+ Browser.updateResizeListeners();
+ },updateCanvasDimensions:function (canvas, wNative, hNative) {
+ if (wNative && hNative) {
+ canvas.widthNative = wNative;
+ canvas.heightNative = hNative;
+ } else {
+ wNative = canvas.widthNative;
+ hNative = canvas.heightNative;
+ }
+ var w = wNative;
+ var h = hNative;
+ if (Module['forcedAspectRatio'] && Module['forcedAspectRatio'] > 0) {
+ if (w/h < Module['forcedAspectRatio']) {
+ w = Math.round(h * Module['forcedAspectRatio']);
+ } else {
+ h = Math.round(w / Module['forcedAspectRatio']);
+ }
+ }
+ if (((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
+ document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
+ document['fullScreenElement'] || document['fullscreenElement'] ||
+ document['msFullScreenElement'] || document['msFullscreenElement'] ||
+ document['webkitCurrentFullScreenElement']) === canvas.parentNode) && (typeof screen != 'undefined')) {
+ var factor = Math.min(screen.width / w, screen.height / h);
+ w = Math.round(w * factor);
+ h = Math.round(h * factor);
+ }
+ if (Browser.resizeCanvas) {
+ if (canvas.width != w) canvas.width = w;
+ if (canvas.height != h) canvas.height = h;
+ if (typeof canvas.style != 'undefined') {
+ canvas.style.removeProperty( "width");
+ canvas.style.removeProperty("height");
+ }
+ } else {
+ if (canvas.width != wNative) canvas.width = wNative;
+ if (canvas.height != hNative) canvas.height = hNative;
+ if (typeof canvas.style != 'undefined') {
+ if (w != wNative || h != hNative) {
+ canvas.style.setProperty( "width", w + "px", "important");
+ canvas.style.setProperty("height", h + "px", "important");
+ } else {
+ canvas.style.removeProperty( "width");
+ canvas.style.removeProperty("height");
+ }
+ }
+ }
+ }};
+
+
+
+
+
+
+
+ function _mkport() { throw 'TODO' }var SOCKFS={mount:function (mount) {
+ return FS.createNode(null, '/', 16384 | 511 /* 0777 */, 0);
+ },createSocket:function (family, type, protocol) {
+ var streaming = type == 1;
+ if (protocol) {
+ assert(streaming == (protocol == 6)); // if SOCK_STREAM, must be tcp
+ }
+
+ // create our internal socket structure
+ var sock = {
+ family: family,
+ type: type,
+ protocol: protocol,
+ server: null,
+ peers: {},
+ pending: [],
+ recv_queue: [],
+ sock_ops: SOCKFS.websocket_sock_ops
+ };
+
+ // create the filesystem node to store the socket structure
+ var name = SOCKFS.nextname();
+ var node = FS.createNode(SOCKFS.root, name, 49152, 0);
+ node.sock = sock;
+
+ // and the wrapping stream that enables library functions such
+ // as read and write to indirectly interact with the socket
+ var stream = FS.createStream({
+ path: name,
+ node: node,
+ flags: FS.modeStringToFlags('r+'),
+ seekable: false,
+ stream_ops: SOCKFS.stream_ops
+ });
+
+ // map the new stream to the socket structure (sockets have a 1:1
+ // relationship with a stream)
+ sock.stream = stream;
+
+ return sock;
+ },getSocket:function (fd) {
+ var stream = FS.getStream(fd);
+ if (!stream || !FS.isSocket(stream.node.mode)) {
+ return null;
+ }
+ return stream.node.sock;
+ },stream_ops:{poll:function (stream) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.poll(sock);
+ },ioctl:function (stream, request, varargs) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.ioctl(sock, request, varargs);
+ },read:function (stream, buffer, offset, length, position /* ignored */) {
+ var sock = stream.node.sock;
+ var msg = sock.sock_ops.recvmsg(sock, length);
+ if (!msg) {
+ // socket is closed
+ return 0;
+ }
+ buffer.set(msg.buffer, offset);
+ return msg.buffer.length;
+ },write:function (stream, buffer, offset, length, position /* ignored */) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.sendmsg(sock, buffer, offset, length);
+ },close:function (stream) {
+ var sock = stream.node.sock;
+ sock.sock_ops.close(sock);
+ }},nextname:function () {
+ if (!SOCKFS.nextname.current) {
+ SOCKFS.nextname.current = 0;
+ }
+ return 'socket[' + (SOCKFS.nextname.current++) + ']';
+ },websocket_sock_ops:{createPeer:function (sock, addr, port) {
+ var ws;
+
+ if (typeof addr === 'object') {
+ ws = addr;
+ addr = null;
+ port = null;
+ }
+
+ if (ws) {
+ // for sockets that've already connected (e.g. we're the server)
+ // we can inspect the _socket property for the address
+ if (ws._socket) {
+ addr = ws._socket.remoteAddress;
+ port = ws._socket.remotePort;
+ }
+ // if we're just now initializing a connection to the remote,
+ // inspect the url property
+ else {
+ var result = /ws[s]?:\/\/([^:]+):(\d+)/.exec(ws.url);
+ if (!result) {
+ throw new Error('WebSocket URL must be in the format ws(s)://address:port');
+ }
+ addr = result[1];
+ port = parseInt(result[2], 10);
+ }
+ } else {
+ // create the actual websocket object and connect
+ try {
+ // runtimeConfig gets set to true if WebSocket runtime configuration is available.
+ var runtimeConfig = (Module['websocket'] && ('object' === typeof Module['websocket']));
+
+ // The default value is 'ws://' the replace is needed because the compiler replaces "//" comments with '#'
+ // comments without checking context, so we'd end up with ws:#, the replace swaps the "#" for "//" again.
+ var url = 'ws:#'.replace('#', '//');
+
+ if (runtimeConfig) {
+ if ('string' === typeof Module['websocket']['url']) {
+ url = Module['websocket']['url']; // Fetch runtime WebSocket URL config.
+ }
+ }
+
+ if (url === 'ws://' || url === 'wss://') { // Is the supplied URL config just a prefix, if so complete it.
+ url = url + addr + ':' + port;
+ }
+
+ // Make the WebSocket subprotocol (Sec-WebSocket-Protocol) default to binary if no configuration is set.
+ var subProtocols = 'binary'; // The default value is 'binary'
+
+ if (runtimeConfig) {
+ if ('string' === typeof Module['websocket']['subprotocol']) {
+ subProtocols = Module['websocket']['subprotocol']; // Fetch runtime WebSocket subprotocol config.
+ }
+ }
+
+ // The regex trims the string (removes spaces at the beginning and end, then splits the string by
+ // <any space>,<any space> into an Array. Whitespace removal is important for Websockify and ws.
+ subProtocols = subProtocols.replace(/^ +| +$/g,"").split(/ *, */);
+
+ // The node ws library API for specifying optional subprotocol is slightly different than the browser's.
+ var opts = ENVIRONMENT_IS_NODE ? {'protocol': subProtocols.toString()} : subProtocols;
+
+ // If node we use the ws library.
+ var WebSocket = ENVIRONMENT_IS_NODE ? require('ws') : window['WebSocket'];
+ ws = new WebSocket(url, opts);
+ ws.binaryType = 'arraybuffer';
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EHOSTUNREACH);
+ }
+ }
+
+
+ var peer = {
+ addr: addr,
+ port: port,
+ socket: ws,
+ dgram_send_queue: []
+ };
+
+ SOCKFS.websocket_sock_ops.addPeer(sock, peer);
+ SOCKFS.websocket_sock_ops.handlePeerEvents(sock, peer);
+
+ // if this is a bound dgram socket, send the port number first to allow
+ // us to override the ephemeral port reported to us by remotePort on the
+ // remote end.
+ if (sock.type === 2 && typeof sock.sport !== 'undefined') {
+ peer.dgram_send_queue.push(new Uint8Array([
+ 255, 255, 255, 255,
+ 'p'.charCodeAt(0), 'o'.charCodeAt(0), 'r'.charCodeAt(0), 't'.charCodeAt(0),
+ ((sock.sport & 0xff00) >> 8) , (sock.sport & 0xff)
+ ]));
+ }
+
+ return peer;
+ },getPeer:function (sock, addr, port) {
+ return sock.peers[addr + ':' + port];
+ },addPeer:function (sock, peer) {
+ sock.peers[peer.addr + ':' + peer.port] = peer;
+ },removePeer:function (sock, peer) {
+ delete sock.peers[peer.addr + ':' + peer.port];
+ },handlePeerEvents:function (sock, peer) {
+ var first = true;
+
+ var handleOpen = function () {
+ try {
+ var queued = peer.dgram_send_queue.shift();
+ while (queued) {
+ peer.socket.send(queued);
+ queued = peer.dgram_send_queue.shift();
+ }
+ } catch (e) {
+ // not much we can do here in the way of proper error handling as we've already
+ // lied and said this data was sent. shut it down.
+ peer.socket.close();
+ }
+ };
+
+ function handleMessage(data) {
+ assert(typeof data !== 'string' && data.byteLength !== undefined); // must receive an ArrayBuffer
+ data = new Uint8Array(data); // make a typed array view on the array buffer
+
+
+ // if this is the port message, override the peer's port with it
+ var wasfirst = first;
+ first = false;
+ if (wasfirst &&
+ data.length === 10 &&
+ data[0] === 255 && data[1] === 255 && data[2] === 255 && data[3] === 255 &&
+ data[4] === 'p'.charCodeAt(0) && data[5] === 'o'.charCodeAt(0) && data[6] === 'r'.charCodeAt(0) && data[7] === 't'.charCodeAt(0)) {
+ // update the peer's port and it's key in the peer map
+ var newport = ((data[8] << 8) | data[9]);
+ SOCKFS.websocket_sock_ops.removePeer(sock, peer);
+ peer.port = newport;
+ SOCKFS.websocket_sock_ops.addPeer(sock, peer);
+ return;
+ }
+
+ sock.recv_queue.push({ addr: peer.addr, port: peer.port, data: data });
+ };
+
+ if (ENVIRONMENT_IS_NODE) {
+ peer.socket.on('open', handleOpen);
+ peer.socket.on('message', function(data, flags) {
+ if (!flags.binary) {
+ return;
+ }
+ handleMessage((new Uint8Array(data)).buffer); // copy from node Buffer -> ArrayBuffer
+ });
+ peer.socket.on('error', function() {
+ // don't throw
+ });
+ } else {
+ peer.socket.onopen = handleOpen;
+ peer.socket.onmessage = function peer_socket_onmessage(event) {
+ handleMessage(event.data);
+ };
+ }
+ },poll:function (sock) {
+ if (sock.type === 1 && sock.server) {
+ // listen sockets should only say they're available for reading
+ // if there are pending clients.
+ return sock.pending.length ? (64 | 1) : 0;
+ }
+
+ var mask = 0;
+ var dest = sock.type === 1 ? // we only care about the socket state for connection-based sockets
+ SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport) :
+ null;
+
+ if (sock.recv_queue.length ||
+ !dest || // connection-less sockets are always ready to read
+ (dest && dest.socket.readyState === dest.socket.CLOSING) ||
+ (dest && dest.socket.readyState === dest.socket.CLOSED)) { // let recv return 0 once closed
+ mask |= (64 | 1);
+ }
+
+ if (!dest || // connection-less sockets are always ready to write
+ (dest && dest.socket.readyState === dest.socket.OPEN)) {
+ mask |= 4;
+ }
+
+ if ((dest && dest.socket.readyState === dest.socket.CLOSING) ||
+ (dest && dest.socket.readyState === dest.socket.CLOSED)) {
+ mask |= 16;
+ }
+
+ return mask;
+ },ioctl:function (sock, request, arg) {
+ switch (request) {
+ case 21531:
+ var bytes = 0;
+ if (sock.recv_queue.length) {
+ bytes = sock.recv_queue[0].data.length;
+ }
+ HEAP32[((arg)>>2)]=bytes;
+ return 0;
+ default:
+ return ERRNO_CODES.EINVAL;
+ }
+ },close:function (sock) {
+ // if we've spawned a listen server, close it
+ if (sock.server) {
+ try {
+ sock.server.close();
+ } catch (e) {
+ }
+ sock.server = null;
+ }
+ // close any peer connections
+ var peers = Object.keys(sock.peers);
+ for (var i = 0; i < peers.length; i++) {
+ var peer = sock.peers[peers[i]];
+ try {
+ peer.socket.close();
+ } catch (e) {
+ }
+ SOCKFS.websocket_sock_ops.removePeer(sock, peer);
+ }
+ return 0;
+ },bind:function (sock, addr, port) {
+ if (typeof sock.saddr !== 'undefined' || typeof sock.sport !== 'undefined') {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL); // already bound
+ }
+ sock.saddr = addr;
+ sock.sport = port || _mkport();
+ // in order to emulate dgram sockets, we need to launch a listen server when
+ // binding on a connection-less socket
+ // note: this is only required on the server side
+ if (sock.type === 2) {
+ // close the existing server if it exists
+ if (sock.server) {
+ sock.server.close();
+ sock.server = null;
+ }
+ // swallow error operation not supported error that occurs when binding in the
+ // browser where this isn't supported
+ try {
+ sock.sock_ops.listen(sock, 0);
+ } catch (e) {
+ if (!(e instanceof FS.ErrnoError)) throw e;
+ if (e.errno !== ERRNO_CODES.EOPNOTSUPP) throw e;
+ }
+ }
+ },connect:function (sock, addr, port) {
+ if (sock.server) {
+ throw new FS.ErrnoError(ERRNO_CODS.EOPNOTSUPP);
+ }
+
+ // TODO autobind
+ // if (!sock.addr && sock.type == 2) {
+ // }
+
+ // early out if we're already connected / in the middle of connecting
+ if (typeof sock.daddr !== 'undefined' && typeof sock.dport !== 'undefined') {
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
+ if (dest) {
+ if (dest.socket.readyState === dest.socket.CONNECTING) {
+ throw new FS.ErrnoError(ERRNO_CODES.EALREADY);
+ } else {
+ throw new FS.ErrnoError(ERRNO_CODES.EISCONN);
+ }
+ }
+ }
+
+ // add the socket to our peer list and set our
+ // destination address / port to match
+ var peer = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
+ sock.daddr = peer.addr;
+ sock.dport = peer.port;
+
+ // always "fail" in non-blocking mode
+ throw new FS.ErrnoError(ERRNO_CODES.EINPROGRESS);
+ },listen:function (sock, backlog) {
+ if (!ENVIRONMENT_IS_NODE) {
+ throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
+ }
+ if (sock.server) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL); // already listening
+ }
+ var WebSocketServer = require('ws').Server;
+ var host = sock.saddr;
+ sock.server = new WebSocketServer({
+ host: host,
+ port: sock.sport
+ // TODO support backlog
+ });
+
+ sock.server.on('connection', function(ws) {
+ if (sock.type === 1) {
+ var newsock = SOCKFS.createSocket(sock.family, sock.type, sock.protocol);
+
+ // create a peer on the new socket
+ var peer = SOCKFS.websocket_sock_ops.createPeer(newsock, ws);
+ newsock.daddr = peer.addr;
+ newsock.dport = peer.port;
+
+ // push to queue for accept to pick up
+ sock.pending.push(newsock);
+ } else {
+ // create a peer on the listen socket so calling sendto
+ // with the listen socket and an address will resolve
+ // to the correct client
+ SOCKFS.websocket_sock_ops.createPeer(sock, ws);
+ }
+ });
+ sock.server.on('closed', function() {
+ sock.server = null;
+ });
+ sock.server.on('error', function() {
+ // don't throw
+ });
+ },accept:function (listensock) {
+ if (!listensock.server) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var newsock = listensock.pending.shift();
+ newsock.stream.flags = listensock.stream.flags;
+ return newsock;
+ },getname:function (sock, peer) {
+ var addr, port;
+ if (peer) {
+ if (sock.daddr === undefined || sock.dport === undefined) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+ addr = sock.daddr;
+ port = sock.dport;
+ } else {
+ // TODO saddr and sport will be set for bind()'d UDP sockets, but what
+ // should we be returning for TCP sockets that've been connect()'d?
+ addr = sock.saddr || 0;
+ port = sock.sport || 0;
+ }
+ return { addr: addr, port: port };
+ },sendmsg:function (sock, buffer, offset, length, addr, port) {
+ if (sock.type === 2) {
+ // connection-less sockets will honor the message address,
+ // and otherwise fall back to the bound destination address
+ if (addr === undefined || port === undefined) {
+ addr = sock.daddr;
+ port = sock.dport;
+ }
+ // if there was no address to fall back to, error out
+ if (addr === undefined || port === undefined) {
+ throw new FS.ErrnoError(ERRNO_CODES.EDESTADDRREQ);
+ }
+ } else {
+ // connection-based sockets will only use the bound
+ addr = sock.daddr;
+ port = sock.dport;
+ }
+
+ // find the peer for the destination address
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, addr, port);
+
+ // early out if not connected with a connection-based socket
+ if (sock.type === 1) {
+ if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ } else if (dest.socket.readyState === dest.socket.CONNECTING) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ }
+
+ // create a copy of the incoming data to send, as the WebSocket API
+ // doesn't work entirely with an ArrayBufferView, it'll just send
+ // the entire underlying buffer
+ var data;
+ if (buffer instanceof Array || buffer instanceof ArrayBuffer) {
+ data = buffer.slice(offset, offset + length);
+ } else { // ArrayBufferView
+ data = buffer.buffer.slice(buffer.byteOffset + offset, buffer.byteOffset + offset + length);
+ }
+
+ // if we're emulating a connection-less dgram socket and don't have
+ // a cached connection, queue the buffer to send upon connect and
+ // lie, saying the data was sent now.
+ if (sock.type === 2) {
+ if (!dest || dest.socket.readyState !== dest.socket.OPEN) {
+ // if we're not connected, open a new connection
+ if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ dest = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
+ }
+ dest.dgram_send_queue.push(data);
+ return length;
+ }
+ }
+
+ try {
+ // send the actual data
+ dest.socket.send(data);
+ return length;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ },recvmsg:function (sock, length) {
+ // http://pubs.opengroup.org/onlinepubs/7908799/xns/recvmsg.html
+ if (sock.type === 1 && sock.server) {
+ // tcp servers should not be recv()'ing on the listen socket
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+
+ var queued = sock.recv_queue.shift();
+ if (!queued) {
+ if (sock.type === 1) {
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
+
+ if (!dest) {
+ // if we have a destination address but are not connected, error out
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+ else if (dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ // return null if the socket has closed
+ return null;
+ }
+ else {
+ // else, our socket is in a valid state but truly has nothing available
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ } else {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ }
+
+ // queued.data will be an ArrayBuffer if it's unadulterated, but if it's
+ // requeued TCP data it'll be an ArrayBufferView
+ var queuedLength = queued.data.byteLength || queued.data.length;
+ var queuedOffset = queued.data.byteOffset || 0;
+ var queuedBuffer = queued.data.buffer || queued.data;
+ var bytesRead = Math.min(length, queuedLength);
+ var res = {
+ buffer: new Uint8Array(queuedBuffer, queuedOffset, bytesRead),
+ addr: queued.addr,
+ port: queued.port
+ };
+
+
+ // push back any unread data for TCP connections
+ if (sock.type === 1 && bytesRead < queuedLength) {
+ var bytesRemaining = queuedLength - bytesRead;
+ queued.data = new Uint8Array(queuedBuffer, queuedOffset + bytesRead, bytesRemaining);
+ sock.recv_queue.unshift(queued);
+ }
+
+ return res;
+ }}};function _send(fd, buf, len, flags) {
+ var sock = SOCKFS.getSocket(fd);
+ if (!sock) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ // TODO honor flags
+ return _write(fd, buf, len);
+ }
+
+ function _pwrite(fildes, buf, nbyte, offset) {
+ // ssize_t pwrite(int fildes, const void *buf, size_t nbyte, off_t offset);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
+ var stream = FS.getStream(fildes);
+ if (!stream) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ try {
+ var slab = HEAP8;
+ return FS.write(stream, slab, buf, nbyte, offset);
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }function _write(fildes, buf, nbyte) {
+ // ssize_t write(int fildes, const void *buf, size_t nbyte);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
+ var stream = FS.getStream(fildes);
+ if (!stream) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+
+
+ try {
+ var slab = HEAP8;
+ return FS.write(stream, slab, buf, nbyte);
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }
+
+ function _fileno(stream) {
+ // int fileno(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fileno.html
+ stream = FS.getStreamFromPtr(stream);
+ if (!stream) return -1;
+ return stream.fd;
+ }function _fwrite(ptr, size, nitems, stream) {
+ // size_t fwrite(const void *restrict ptr, size_t size, size_t nitems, FILE *restrict stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fwrite.html
+ var bytesToWrite = nitems * size;
+ if (bytesToWrite == 0) return 0;
+ var fd = _fileno(stream);
+ var bytesWritten = _write(fd, ptr, bytesToWrite);
+ if (bytesWritten == -1) {
+ var streamObj = FS.getStreamFromPtr(stream);
+ if (streamObj) streamObj.error = true;
+ return 0;
+ } else {
+ return Math.floor(bytesWritten / size);
+ }
+ }
+
+
+
+ Module["_strlen"] = _strlen;
+
+ function __reallyNegative(x) {
+ return x < 0 || (x === 0 && (1/x) === -Infinity);
+ }function __formatString(format, varargs) {
+ var textIndex = format;
+ var argIndex = 0;
+ function getNextArg(type) {
+ // NOTE: Explicitly ignoring type safety. Otherwise this fails:
+ // int x = 4; printf("%c\n", (char)x);
+ var ret;
+ if (type === 'double') {
+ ret = HEAPF64[(((varargs)+(argIndex))>>3)];
+ } else if (type == 'i64') {
+ ret = [HEAP32[(((varargs)+(argIndex))>>2)],
+ HEAP32[(((varargs)+(argIndex+4))>>2)]];
+
+ } else {
+ type = 'i32'; // varargs are always i32, i64, or double
+ ret = HEAP32[(((varargs)+(argIndex))>>2)];
+ }
+ argIndex += Runtime.getNativeFieldSize(type);
+ return ret;
+ }
+
+ var ret = [];
+ var curr, next, currArg;
+ while(1) {
+ var startTextIndex = textIndex;
+ curr = HEAP8[(textIndex)];
+ if (curr === 0) break;
+ next = HEAP8[((textIndex+1)|0)];
+ if (curr == 37) {
+ // Handle flags.
+ var flagAlwaysSigned = false;
+ var flagLeftAlign = false;
+ var flagAlternative = false;
+ var flagZeroPad = false;
+ var flagPadSign = false;
+ flagsLoop: while (1) {
+ switch (next) {
+ case 43:
+ flagAlwaysSigned = true;
+ break;
+ case 45:
+ flagLeftAlign = true;
+ break;
+ case 35:
+ flagAlternative = true;
+ break;
+ case 48:
+ if (flagZeroPad) {
+ break flagsLoop;
+ } else {
+ flagZeroPad = true;
+ break;
+ }
+ case 32:
+ flagPadSign = true;
+ break;
+ default:
+ break flagsLoop;
+ }
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ }
+
+ // Handle width.
+ var width = 0;
+ if (next == 42) {
+ width = getNextArg('i32');
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ } else {
+ while (next >= 48 && next <= 57) {
+ width = width * 10 + (next - 48);
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ }
+ }
+
+ // Handle precision.
+ var precisionSet = false, precision = -1;
+ if (next == 46) {
+ precision = 0;
+ precisionSet = true;
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ if (next == 42) {
+ precision = getNextArg('i32');
+ textIndex++;
+ } else {
+ while(1) {
+ var precisionChr = HEAP8[((textIndex+1)|0)];
+ if (precisionChr < 48 ||
+ precisionChr > 57) break;
+ precision = precision * 10 + (precisionChr - 48);
+ textIndex++;
+ }
+ }
+ next = HEAP8[((textIndex+1)|0)];
+ }
+ if (precision < 0) {
+ precision = 6; // Standard default.
+ precisionSet = false;
+ }
+
+ // Handle integer sizes. WARNING: These assume a 32-bit architecture!
+ var argSize;
+ switch (String.fromCharCode(next)) {
+ case 'h':
+ var nextNext = HEAP8[((textIndex+2)|0)];
+ if (nextNext == 104) {
+ textIndex++;
+ argSize = 1; // char (actually i32 in varargs)
+ } else {
+ argSize = 2; // short (actually i32 in varargs)
+ }
+ break;
+ case 'l':
+ var nextNext = HEAP8[((textIndex+2)|0)];
+ if (nextNext == 108) {
+ textIndex++;
+ argSize = 8; // long long
+ } else {
+ argSize = 4; // long
+ }
+ break;
+ case 'L': // long long
+ case 'q': // int64_t
+ case 'j': // intmax_t
+ argSize = 8;
+ break;
+ case 'z': // size_t
+ case 't': // ptrdiff_t
+ case 'I': // signed ptrdiff_t or unsigned size_t
+ argSize = 4;
+ break;
+ default:
+ argSize = null;
+ }
+ if (argSize) textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+
+ // Handle type specifier.
+ switch (String.fromCharCode(next)) {
+ case 'd': case 'i': case 'u': case 'o': case 'x': case 'X': case 'p': {
+ // Integer.
+ var signed = next == 100 || next == 105;
+ argSize = argSize || 4;
+ var currArg = getNextArg('i' + (argSize * 8));
+ var argText;
+ // Flatten i64-1 [low, high] into a (slightly rounded) double
+ if (argSize == 8) {
+ currArg = Runtime.makeBigInt(currArg[0], currArg[1], next == 117);
+ }
+ // Truncate to requested size.
+ if (argSize <= 4) {
+ var limit = Math.pow(256, argSize) - 1;
+ currArg = (signed ? reSign : unSign)(currArg & limit, argSize * 8);
+ }
+ // Format the number.
+ var currAbsArg = Math.abs(currArg);
+ var prefix = '';
+ if (next == 100 || next == 105) {
+ argText = reSign(currArg, 8 * argSize, 1).toString(10);
+ } else if (next == 117) {
+ argText = unSign(currArg, 8 * argSize, 1).toString(10);
+ currArg = Math.abs(currArg);
+ } else if (next == 111) {
+ argText = (flagAlternative ? '0' : '') + currAbsArg.toString(8);
+ } else if (next == 120 || next == 88) {
+ prefix = (flagAlternative && currArg != 0) ? '0x' : '';
+ if (currArg < 0) {
+ // Represent negative numbers in hex as 2's complement.
+ currArg = -currArg;
+ argText = (currAbsArg - 1).toString(16);
+ var buffer = [];
+ for (var i = 0; i < argText.length; i++) {
+ buffer.push((0xF - parseInt(argText[i], 16)).toString(16));
+ }
+ argText = buffer.join('');
+ while (argText.length < argSize * 2) argText = 'f' + argText;
+ } else {
+ argText = currAbsArg.toString(16);
+ }
+ if (next == 88) {
+ prefix = prefix.toUpperCase();
+ argText = argText.toUpperCase();
+ }
+ } else if (next == 112) {
+ if (currAbsArg === 0) {
+ argText = '(nil)';
+ } else {
+ prefix = '0x';
+ argText = currAbsArg.toString(16);
+ }
+ }
+ if (precisionSet) {
+ while (argText.length < precision) {
+ argText = '0' + argText;
+ }
+ }
+
+ // Add sign if needed
+ if (currArg >= 0) {
+ if (flagAlwaysSigned) {
+ prefix = '+' + prefix;
+ } else if (flagPadSign) {
+ prefix = ' ' + prefix;
+ }
+ }
+
+ // Move sign to prefix so we zero-pad after the sign
+ if (argText.charAt(0) == '-') {
+ prefix = '-' + prefix;
+ argText = argText.substr(1);
+ }
+
+ // Add padding.
+ while (prefix.length + argText.length < width) {
+ if (flagLeftAlign) {
+ argText += ' ';
+ } else {
+ if (flagZeroPad) {
+ argText = '0' + argText;
+ } else {
+ prefix = ' ' + prefix;
+ }
+ }
+ }
+
+ // Insert the result into the buffer.
+ argText = prefix + argText;
+ argText.split('').forEach(function(chr) {
+ ret.push(chr.charCodeAt(0));
+ });
+ break;
+ }
+ case 'f': case 'F': case 'e': case 'E': case 'g': case 'G': {
+ // Float.
+ var currArg = getNextArg('double');
+ var argText;
+ if (isNaN(currArg)) {
+ argText = 'nan';
+ flagZeroPad = false;
+ } else if (!isFinite(currArg)) {
+ argText = (currArg < 0 ? '-' : '') + 'inf';
+ flagZeroPad = false;
+ } else {
+ var isGeneral = false;
+ var effectivePrecision = Math.min(precision, 20);
+
+ // Convert g/G to f/F or e/E, as per:
+ // http://pubs.opengroup.org/onlinepubs/9699919799/functions/printf.html
+ if (next == 103 || next == 71) {
+ isGeneral = true;
+ precision = precision || 1;
+ var exponent = parseInt(currArg.toExponential(effectivePrecision).split('e')[1], 10);
+ if (precision > exponent && exponent >= -4) {
+ next = ((next == 103) ? 'f' : 'F').charCodeAt(0);
+ precision -= exponent + 1;
+ } else {
+ next = ((next == 103) ? 'e' : 'E').charCodeAt(0);
+ precision--;
+ }
+ effectivePrecision = Math.min(precision, 20);
+ }
+
+ if (next == 101 || next == 69) {
+ argText = currArg.toExponential(effectivePrecision);
+ // Make sure the exponent has at least 2 digits.
+ if (/[eE][-+]\d$/.test(argText)) {
+ argText = argText.slice(0, -1) + '0' + argText.slice(-1);
+ }
+ } else if (next == 102 || next == 70) {
+ argText = currArg.toFixed(effectivePrecision);
+ if (currArg === 0 && __reallyNegative(currArg)) {
+ argText = '-' + argText;
+ }
+ }
+
+ var parts = argText.split('e');
+ if (isGeneral && !flagAlternative) {
+ // Discard trailing zeros and periods.
+ while (parts[0].length > 1 && parts[0].indexOf('.') != -1 &&
+ (parts[0].slice(-1) == '0' || parts[0].slice(-1) == '.')) {
+ parts[0] = parts[0].slice(0, -1);
+ }
+ } else {
+ // Make sure we have a period in alternative mode.
+ if (flagAlternative && argText.indexOf('.') == -1) parts[0] += '.';
+ // Zero pad until required precision.
+ while (precision > effectivePrecision++) parts[0] += '0';
+ }
+ argText = parts[0] + (parts.length > 1 ? 'e' + parts[1] : '');
+
+ // Capitalize 'E' if needed.
+ if (next == 69) argText = argText.toUpperCase();
+
+ // Add sign.
+ if (currArg >= 0) {
+ if (flagAlwaysSigned) {
+ argText = '+' + argText;
+ } else if (flagPadSign) {
+ argText = ' ' + argText;
+ }
+ }
+ }
+
+ // Add padding.
+ while (argText.length < width) {
+ if (flagLeftAlign) {
+ argText += ' ';
+ } else {
+ if (flagZeroPad && (argText[0] == '-' || argText[0] == '+')) {
+ argText = argText[0] + '0' + argText.slice(1);
+ } else {
+ argText = (flagZeroPad ? '0' : ' ') + argText;
+ }
+ }
+ }
+
+ // Adjust case.
+ if (next < 97) argText = argText.toUpperCase();
+
+ // Insert the result into the buffer.
+ argText.split('').forEach(function(chr) {
+ ret.push(chr.charCodeAt(0));
+ });
+ break;
+ }
+ case 's': {
+ // String.
+ var arg = getNextArg('i8*');
+ var argLength = arg ? _strlen(arg) : '(null)'.length;
+ if (precisionSet) argLength = Math.min(argLength, precision);
+ if (!flagLeftAlign) {
+ while (argLength < width--) {
+ ret.push(32);
+ }
+ }
+ if (arg) {
+ for (var i = 0; i < argLength; i++) {
+ ret.push(HEAPU8[((arg++)|0)]);
+ }
+ } else {
+ ret = ret.concat(intArrayFromString('(null)'.substr(0, argLength), true));
+ }
+ if (flagLeftAlign) {
+ while (argLength < width--) {
+ ret.push(32);
+ }
+ }
+ break;
+ }
+ case 'c': {
+ // Character.
+ if (flagLeftAlign) ret.push(getNextArg('i8'));
+ while (--width > 0) {
+ ret.push(32);
+ }
+ if (!flagLeftAlign) ret.push(getNextArg('i8'));
+ break;
+ }
+ case 'n': {
+ // Write the length written so far to the next parameter.
+ var ptr = getNextArg('i32*');
+ HEAP32[((ptr)>>2)]=ret.length;
+ break;
+ }
+ case '%': {
+ // Literal percent sign.
+ ret.push(curr);
+ break;
+ }
+ default: {
+ // Unknown specifiers remain untouched.
+ for (var i = startTextIndex; i < textIndex + 2; i++) {
+ ret.push(HEAP8[(i)]);
+ }
+ }
+ }
+ textIndex += 2;
+ // TODO: Support a/A (hex float) and m (last error) specifiers.
+ // TODO: Support %1${specifier} for arg selection.
+ } else {
+ ret.push(curr);
+ textIndex += 1;
+ }
+ }
+ return ret;
+ }function _fprintf(stream, format, varargs) {
+ // int fprintf(FILE *restrict stream, const char *restrict format, ...);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
+ var result = __formatString(format, varargs);
+ var stack = Runtime.stackSave();
+ var ret = _fwrite(allocate(result, 'i8', ALLOC_STACK), 1, result.length, stream);
+ Runtime.stackRestore(stack);
+ return ret;
+ }function _printf(format, varargs) {
+ // int printf(const char *restrict format, ...);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
+ var stdout = HEAP32[((_stdout)>>2)];
+ return _fprintf(stdout, format, varargs);
+ }
+
+
+ Module["_memset"] = _memset;
+
+
+
+ function _emscripten_memcpy_big(dest, src, num) {
+ HEAPU8.set(HEAPU8.subarray(src, src+num), dest);
+ return dest;
+ }
+ Module["_memcpy"] = _memcpy;
+
+ function _free() {
+ }
+ Module["_free"] = _free;
+Module["requestFullScreen"] = function Module_requestFullScreen(lockPointer, resizeCanvas) { Browser.requestFullScreen(lockPointer, resizeCanvas) };
+ Module["requestAnimationFrame"] = function Module_requestAnimationFrame(func) { Browser.requestAnimationFrame(func) };
+ Module["setCanvasSize"] = function Module_setCanvasSize(width, height, noUpdates) { Browser.setCanvasSize(width, height, noUpdates) };
+ Module["pauseMainLoop"] = function Module_pauseMainLoop() { Browser.mainLoop.pause() };
+ Module["resumeMainLoop"] = function Module_resumeMainLoop() { Browser.mainLoop.resume() };
+ Module["getUserMedia"] = function Module_getUserMedia() { Browser.getUserMedia() }
+FS.staticInit();__ATINIT__.unshift({ func: function() { if (!Module["noFSInit"] && !FS.init.initialized) FS.init() } });__ATMAIN__.push({ func: function() { FS.ignorePermissions = false } });__ATEXIT__.push({ func: function() { FS.quit() } });Module["FS_createFolder"] = FS.createFolder;Module["FS_createPath"] = FS.createPath;Module["FS_createDataFile"] = FS.createDataFile;Module["FS_createPreloadedFile"] = FS.createPreloadedFile;Module["FS_createLazyFile"] = FS.createLazyFile;Module["FS_createLink"] = FS.createLink;Module["FS_createDevice"] = FS.createDevice;
+___errno_state = Runtime.staticAlloc(4); HEAP32[((___errno_state)>>2)]=0;
+__ATINIT__.unshift({ func: function() { TTY.init() } });__ATEXIT__.push({ func: function() { TTY.shutdown() } });TTY.utf8 = new Runtime.UTF8Processor();
+if (ENVIRONMENT_IS_NODE) { var fs = require("fs"); NODEFS.staticInit(); }
+__ATINIT__.push({ func: function() { SOCKFS.root = FS.mount(SOCKFS, {}, null); } });
+STACK_BASE = STACKTOP = Runtime.alignMemory(STATICTOP);
+
+staticSealed = true; // seal the static portion of memory
+
+STACK_MAX = STACK_BASE + 5242880;
+
+DYNAMIC_BASE = DYNAMICTOP = Runtime.alignMemory(STACK_MAX);
+
+assert(DYNAMIC_BASE < TOTAL_MEMORY, "TOTAL_MEMORY not big enough for stack");
+
+
+var Math_min = Math.min;
+function asmPrintInt(x, y) {
+ Module.print('int ' + x + ',' + y);// + ' ' + new Error().stack);
+}
+function asmPrintFloat(x, y) {
+ Module.print('float ' + x + ',' + y);// + ' ' + new Error().stack);
+}
+// EMSCRIPTEN_START_ASM
+var asm = Wasm.instantiateModuleFromAsm((function Module(global, env, buffer) {
+ 'use asm';
+ var HEAP8 = new global.Int8Array(buffer);
+ var HEAP16 = new global.Int16Array(buffer);
+ var HEAP32 = new global.Int32Array(buffer);
+ var HEAPU8 = new global.Uint8Array(buffer);
+ var HEAPU16 = new global.Uint16Array(buffer);
+ var HEAPU32 = new global.Uint32Array(buffer);
+ var HEAPF32 = new global.Float32Array(buffer);
+ var HEAPF64 = new global.Float64Array(buffer);
+
+ var STACKTOP=env.STACKTOP|0;
+ var STACK_MAX=env.STACK_MAX|0;
+ var tempDoublePtr=env.tempDoublePtr|0;
+ var ABORT=env.ABORT|0;
+
+ var __THREW__ = 0;
+ var threwValue = 0;
+ var setjmpId = 0;
+ var undef = 0;
+ var nan = +env.NaN, inf = +env.Infinity;
+ var tempInt = 0, tempBigInt = 0, tempBigIntP = 0, tempBigIntS = 0, tempBigIntR = 0.0, tempBigIntI = 0, tempBigIntD = 0, tempValue = 0, tempDouble = 0.0;
+
+ var tempRet0 = 0;
+ var tempRet1 = 0;
+ var tempRet2 = 0;
+ var tempRet3 = 0;
+ var tempRet4 = 0;
+ var tempRet5 = 0;
+ var tempRet6 = 0;
+ var tempRet7 = 0;
+ var tempRet8 = 0;
+ var tempRet9 = 0;
+ var Math_floor=global.Math.floor;
+ var Math_abs=global.Math.abs;
+ var Math_sqrt=global.Math.sqrt;
+ var Math_pow=global.Math.pow;
+ var Math_cos=global.Math.cos;
+ var Math_sin=global.Math.sin;
+ var Math_tan=global.Math.tan;
+ var Math_acos=global.Math.acos;
+ var Math_asin=global.Math.asin;
+ var Math_atan=global.Math.atan;
+ var Math_atan2=global.Math.atan2;
+ var Math_exp=global.Math.exp;
+ var Math_log=global.Math.log;
+ var Math_ceil=global.Math.ceil;
+ var Math_imul=global.Math.imul;
+ var abort=env.abort;
+ var assert=env.assert;
+ var asmPrintInt=env.asmPrintInt;
+ var asmPrintFloat=env.asmPrintFloat;
+ var Math_min=env.min;
+ var _free=env._free;
+ var _emscripten_memcpy_big=env._emscripten_memcpy_big;
+ var _printf=env._printf;
+ var _send=env._send;
+ var _pwrite=env._pwrite;
+ var __reallyNegative=env.__reallyNegative;
+ var _fwrite=env._fwrite;
+ var _malloc=env._malloc;
+ var _mkport=env._mkport;
+ var _fprintf=env._fprintf;
+ var ___setErrNo=env.___setErrNo;
+ var __formatString=env.__formatString;
+ var _fileno=env._fileno;
+ var _fflush=env._fflush;
+ var _write=env._write;
+ var tempFloat = 0.0;
+
+// EMSCRIPTEN_START_FUNCS
+function _main(i3, i5) {
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i2 = i1;
+ L1 : do {
+ if ((i3 | 0) > 1) {
+ i3 = HEAP8[HEAP32[i5 + 4 >> 2] | 0] | 0;
+ switch (i3 | 0) {
+ case 50:
+ {
+ i3 = 625;
+ break L1;
+ }
+ case 51:
+ {
+ i4 = 4;
+ break L1;
+ }
+ case 52:
+ {
+ i3 = 6250;
+ break L1;
+ }
+ case 53:
+ {
+ i3 = 12500;
+ break L1;
+ }
+ case 49:
+ {
+ i3 = 75;
+ break L1;
+ }
+ case 48:
+ {
+ i12 = 0;
+ STACKTOP = i1;
+ return i12 | 0;
+ }
+ default:
+ {
+ HEAP32[i2 >> 2] = i3 + -48;
+ _printf(8, i2 | 0) | 0;
+ i12 = -1;
+ STACKTOP = i1;
+ return i12 | 0;
+ }
+ }
+ } else {
+ i4 = 4;
+ }
+ } while (0);
+ if ((i4 | 0) == 4) {
+ i3 = 1250;
+ }
+ i4 = 0;
+ i12 = 0;
+ do {
+ i9 = (i4 | 0) % 10 | 0;
+ i5 = i9 + i4 | 0;
+ i6 = (i4 | 0) % 255 | 0;
+ i8 = (i4 | 0) % 15 | 0;
+ i10 = ((i4 | 0) % 120 | 0 | 0) % 1024 | 0;
+ i11 = ((i4 | 0) % 1024 | 0) + i4 | 0;
+ i5 = ((i5 | 0) % 1024 | 0) + i5 | 0;
+ i8 = ((i8 | 0) % 1024 | 0) + i8 | 0;
+ i6 = (((i6 | 0) % 1024 | 0) + i6 + i10 | 0) % 1024 | 0;
+ i7 = 0;
+ do {
+ i17 = i7 << 1;
+ i14 = (i7 | 0) % 120 | 0;
+ i18 = (i17 | 0) % 1024 | 0;
+ i19 = (i9 + i7 | 0) % 1024 | 0;
+ i16 = ((i7 | 0) % 255 | 0 | 0) % 1024 | 0;
+ i15 = (i7 | 0) % 1024 | 0;
+ i13 = ((i7 | 0) % 15 | 0 | 0) % 1024 | 0;
+ i12 = (((i19 + i18 + i16 + i10 + i15 + i13 + ((i11 + i19 | 0) % 1024 | 0) + ((i5 + i18 | 0) % 1024 | 0) + ((i18 + i17 + i16 | 0) % 1024 | 0) + i6 + ((i8 + i15 | 0) % 1024 | 0) + ((((i14 | 0) % 1024 | 0) + i14 + i13 | 0) % 1024 | 0) | 0) % 100 | 0) + i12 | 0) % 10240 | 0;
+ i7 = i7 + 1 | 0;
+ } while ((i7 | 0) != 5e4);
+ i4 = i4 + 1 | 0;
+ } while ((i4 | 0) < (i3 | 0));
+ HEAP32[i2 >> 2] = i12;
+ _printf(24, i2 | 0) | 0;
+ i19 = 0;
+ STACKTOP = i1;
+ return i19 | 0;
+}
+function _memcpy(i3, i2, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i4 = 0;
+ if ((i1 | 0) >= 4096) return _emscripten_memcpy_big(i3 | 0, i2 | 0, i1 | 0) | 0;
+ i4 = i3 | 0;
+ if ((i3 & 3) == (i2 & 3)) {
+ while (i3 & 3) {
+ if ((i1 | 0) == 0) return i4 | 0;
+ HEAP8[i3] = HEAP8[i2] | 0;
+ i3 = i3 + 1 | 0;
+ i2 = i2 + 1 | 0;
+ i1 = i1 - 1 | 0;
+ }
+ while ((i1 | 0) >= 4) {
+ HEAP32[i3 >> 2] = HEAP32[i2 >> 2];
+ i3 = i3 + 4 | 0;
+ i2 = i2 + 4 | 0;
+ i1 = i1 - 4 | 0;
+ }
+ }
+ while ((i1 | 0) > 0) {
+ HEAP8[i3] = HEAP8[i2] | 0;
+ i3 = i3 + 1 | 0;
+ i2 = i2 + 1 | 0;
+ i1 = i1 - 1 | 0;
+ }
+ return i4 | 0;
+}
+function _memset(i1, i4, i3) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i2 = i1 + i3 | 0;
+ if ((i3 | 0) >= 20) {
+ i4 = i4 & 255;
+ i7 = i1 & 3;
+ i6 = i4 | i4 << 8 | i4 << 16 | i4 << 24;
+ i5 = i2 & ~3;
+ if (i7) {
+ i7 = i1 + 4 - i7 | 0;
+ while ((i1 | 0) < (i7 | 0)) {
+ HEAP8[i1] = i4;
+ i1 = i1 + 1 | 0;
+ }
+ }
+ while ((i1 | 0) < (i5 | 0)) {
+ HEAP32[i1 >> 2] = i6;
+ i1 = i1 + 4 | 0;
+ }
+ }
+ while ((i1 | 0) < (i2 | 0)) {
+ HEAP8[i1] = i4;
+ i1 = i1 + 1 | 0;
+ }
+ return i1 - i3 | 0;
+}
+function copyTempDouble(i1) {
+ i1 = i1 | 0;
+ HEAP8[tempDoublePtr] = HEAP8[i1];
+ HEAP8[tempDoublePtr + 1 | 0] = HEAP8[i1 + 1 | 0];
+ HEAP8[tempDoublePtr + 2 | 0] = HEAP8[i1 + 2 | 0];
+ HEAP8[tempDoublePtr + 3 | 0] = HEAP8[i1 + 3 | 0];
+ HEAP8[tempDoublePtr + 4 | 0] = HEAP8[i1 + 4 | 0];
+ HEAP8[tempDoublePtr + 5 | 0] = HEAP8[i1 + 5 | 0];
+ HEAP8[tempDoublePtr + 6 | 0] = HEAP8[i1 + 6 | 0];
+ HEAP8[tempDoublePtr + 7 | 0] = HEAP8[i1 + 7 | 0];
+}
+function copyTempFloat(i1) {
+ i1 = i1 | 0;
+ HEAP8[tempDoublePtr] = HEAP8[i1];
+ HEAP8[tempDoublePtr + 1 | 0] = HEAP8[i1 + 1 | 0];
+ HEAP8[tempDoublePtr + 2 | 0] = HEAP8[i1 + 2 | 0];
+ HEAP8[tempDoublePtr + 3 | 0] = HEAP8[i1 + 3 | 0];
+}
+function runPostSets() {}
+function _strlen(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = i1;
+ while (HEAP8[i2] | 0) {
+ i2 = i2 + 1 | 0;
+ }
+ return i2 - i1 | 0;
+}
+function stackAlloc(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + i1 | 0;
+ STACKTOP = STACKTOP + 7 & -8;
+ return i2 | 0;
+}
+function setThrew(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ if ((__THREW__ | 0) == 0) {
+ __THREW__ = i1;
+ threwValue = i2;
+ }
+}
+function stackRestore(i1) {
+ i1 = i1 | 0;
+ STACKTOP = i1;
+}
+function setTempRet9(i1) {
+ i1 = i1 | 0;
+ tempRet9 = i1;
+}
+function setTempRet8(i1) {
+ i1 = i1 | 0;
+ tempRet8 = i1;
+}
+function setTempRet7(i1) {
+ i1 = i1 | 0;
+ tempRet7 = i1;
+}
+function setTempRet6(i1) {
+ i1 = i1 | 0;
+ tempRet6 = i1;
+}
+function setTempRet5(i1) {
+ i1 = i1 | 0;
+ tempRet5 = i1;
+}
+function setTempRet4(i1) {
+ i1 = i1 | 0;
+ tempRet4 = i1;
+}
+function setTempRet3(i1) {
+ i1 = i1 | 0;
+ tempRet3 = i1;
+}
+function setTempRet2(i1) {
+ i1 = i1 | 0;
+ tempRet2 = i1;
+}
+function setTempRet1(i1) {
+ i1 = i1 | 0;
+ tempRet1 = i1;
+}
+function setTempRet0(i1) {
+ i1 = i1 | 0;
+ tempRet0 = i1;
+}
+function stackSave() {
+ return STACKTOP | 0;
+}
+
+// EMSCRIPTEN_END_FUNCS
+
+
+ return { _strlen: _strlen, _memcpy: _memcpy, _main: _main, _memset: _memset, runPostSets: runPostSets, stackAlloc: stackAlloc, stackSave: stackSave, stackRestore: stackRestore, setThrew: setThrew, setTempRet0: setTempRet0, setTempRet1: setTempRet1, setTempRet2: setTempRet2, setTempRet3: setTempRet3, setTempRet4: setTempRet4, setTempRet5: setTempRet5, setTempRet6: setTempRet6, setTempRet7: setTempRet7, setTempRet8: setTempRet8, setTempRet9: setTempRet9 };
+}).toString(),
+// EMSCRIPTEN_END_ASM
+{ "Math": Math, "Int8Array": Int8Array, "Int16Array": Int16Array, "Int32Array": Int32Array, "Uint8Array": Uint8Array, "Uint16Array": Uint16Array, "Uint32Array": Uint32Array, "Float32Array": Float32Array, "Float64Array": Float64Array, "abort": abort, "assert": assert, "asmPrintInt": asmPrintInt, "asmPrintFloat": asmPrintFloat, "min": Math_min, "_free": _free, "_emscripten_memcpy_big": _emscripten_memcpy_big, "_printf": _printf, "_send": _send, "_pwrite": _pwrite, "__reallyNegative": __reallyNegative, "_fwrite": _fwrite, "_malloc": _malloc, "_mkport": _mkport, "_fprintf": _fprintf, "___setErrNo": ___setErrNo, "__formatString": __formatString, "_fileno": _fileno, "_fflush": _fflush, "_write": _write, "STACKTOP": STACKTOP, "STACK_MAX": STACK_MAX, "tempDoublePtr": tempDoublePtr, "ABORT": ABORT, "NaN": NaN, "Infinity": Infinity }, buffer);
+var _strlen = Module["_strlen"] = asm["_strlen"];
+var _memcpy = Module["_memcpy"] = asm["_memcpy"];
+var _main = Module["_main"] = asm["_main"];
+var _memset = Module["_memset"] = asm["_memset"];
+var runPostSets = Module["runPostSets"] = asm["runPostSets"];
+
+Runtime.stackAlloc = function(size) { return asm['stackAlloc'](size) };
+Runtime.stackSave = function() { return asm['stackSave']() };
+Runtime.stackRestore = function(top) { asm['stackRestore'](top) };
+
+
+// Warning: printing of i64 values may be slightly rounded! No deep i64 math used, so precise i64 code not included
+var i64Math = null;
+
+// === Auto-generated postamble setup entry stuff ===
+
+if (memoryInitializer) {
+ if (ENVIRONMENT_IS_NODE || ENVIRONMENT_IS_SHELL) {
+ var data = Module['readBinary'](memoryInitializer);
+ HEAPU8.set(data, STATIC_BASE);
+ } else {
+ addRunDependency('memory initializer');
+ Browser.asyncLoad(memoryInitializer, function(data) {
+ HEAPU8.set(data, STATIC_BASE);
+ removeRunDependency('memory initializer');
+ }, function(data) {
+ throw 'could not load memory initializer ' + memoryInitializer;
+ });
+ }
+}
+
+function ExitStatus(status) {
+ this.name = "ExitStatus";
+ this.message = "Program terminated with exit(" + status + ")";
+ this.status = status;
+};
+ExitStatus.prototype = new Error();
+ExitStatus.prototype.constructor = ExitStatus;
+
+var initialStackTop;
+var preloadStartTime = null;
+var calledMain = false;
+
+dependenciesFulfilled = function runCaller() {
+ // If run has never been called, and we should call run (INVOKE_RUN is true, and Module.noInitialRun is not false)
+ if (!Module['calledRun'] && shouldRunNow) run([].concat(Module["arguments"]));
+ if (!Module['calledRun']) dependenciesFulfilled = runCaller; // try this again later, after new deps are fulfilled
+}
+
+Module['callMain'] = Module.callMain = function callMain(args) {
+ assert(runDependencies == 0, 'cannot call main when async dependencies remain! (listen on __ATMAIN__)');
+ assert(__ATPRERUN__.length == 0, 'cannot call main when preRun functions remain to be called');
+
+ args = args || [];
+
+ ensureInitRuntime();
+
+ var argc = args.length+1;
+ function pad() {
+ for (var i = 0; i < 4-1; i++) {
+ argv.push(0);
+ }
+ }
+ var argv = [allocate(intArrayFromString("/bin/this.program"), 'i8', ALLOC_NORMAL) ];
+ pad();
+ for (var i = 0; i < argc-1; i = i + 1) {
+ argv.push(allocate(intArrayFromString(args[i]), 'i8', ALLOC_NORMAL));
+ pad();
+ }
+ argv.push(0);
+ argv = allocate(argv, 'i32', ALLOC_NORMAL);
+
+ initialStackTop = STACKTOP;
+
+ try {
+
+ var ret = Module['_main'](argc, argv, 0);
+
+
+ // if we're not running an evented main loop, it's time to exit
+ if (!Module['noExitRuntime']) {
+ exit(ret);
+ }
+ }
+ catch(e) {
+ if (e instanceof ExitStatus) {
+ // exit() throws this once it's done to make sure execution
+ // has been stopped completely
+ return;
+ } else if (e == 'SimulateInfiniteLoop') {
+ // running an evented main loop, don't immediately exit
+ Module['noExitRuntime'] = true;
+ return;
+ } else {
+ if (e && typeof e === 'object' && e.stack) Module.printErr('exception thrown: ' + [e, e.stack]);
+ throw e;
+ }
+ } finally {
+ calledMain = true;
+ }
+}
+
+
+
+
+function run(args) {
+ args = args || Module['arguments'];
+
+ if (preloadStartTime === null) preloadStartTime = Date.now();
+
+ if (runDependencies > 0) {
+ Module.printErr('run() called, but dependencies remain, so not running');
+ return;
+ }
+
+ preRun();
+
+ if (runDependencies > 0) return; // a preRun added a dependency, run will be called later
+ if (Module['calledRun']) return; // run may have just been called through dependencies being fulfilled just in this very frame
+
+ function doRun() {
+ if (Module['calledRun']) return; // run may have just been called while the async setStatus time below was happening
+ Module['calledRun'] = true;
+
+ ensureInitRuntime();
+
+ preMain();
+
+ if (ENVIRONMENT_IS_WEB && preloadStartTime !== null) {
+ Module.printErr('pre-main prep time: ' + (Date.now() - preloadStartTime) + ' ms');
+ }
+
+ if (Module['_main'] && shouldRunNow) {
+ Module['callMain'](args);
+ }
+
+ postRun();
+ }
+
+ if (Module['setStatus']) {
+ Module['setStatus']('Running...');
+ setTimeout(function() {
+ setTimeout(function() {
+ Module['setStatus']('');
+ }, 1);
+ if (!ABORT) doRun();
+ }, 1);
+ } else {
+ doRun();
+ }
+}
+Module['run'] = Module.run = run;
+
+function exit(status) {
+ ABORT = true;
+ EXITSTATUS = status;
+ STACKTOP = initialStackTop;
+
+ // exit the runtime
+ exitRuntime();
+
+ // TODO We should handle this differently based on environment.
+ // In the browser, the best we can do is throw an exception
+ // to halt execution, but in node we could process.exit and
+ // I'd imagine SM shell would have something equivalent.
+ // This would let us set a proper exit status (which
+ // would be great for checking test exit statuses).
+ // https://github.com/kripken/emscripten/issues/1371
+
+ // throw an exception to halt the current execution
+ throw new ExitStatus(status);
+}
+Module['exit'] = Module.exit = exit;
+
+function abort(text) {
+ if (text) {
+ Module.print(text);
+ Module.printErr(text);
+ }
+
+ ABORT = true;
+ EXITSTATUS = 1;
+
+ var extra = '\nIf this abort() is unexpected, build with -s ASSERTIONS=1 which can give more information.';
+
+ throw 'abort() at ' + stackTrace() + extra;
+}
+Module['abort'] = Module.abort = abort;
+
+// {{PRE_RUN_ADDITIONS}}
+
+if (Module['preInit']) {
+ if (typeof Module['preInit'] == 'function') Module['preInit'] = [Module['preInit']];
+ while (Module['preInit'].length > 0) {
+ Module['preInit'].pop()();
+ }
+}
+
+// shouldRunNow refers to calling main(), not run().
+var shouldRunNow = true;
+if (Module['noInitialRun']) {
+ shouldRunNow = false;
+}
+
+
+run([].concat(Module["arguments"]));
diff --git a/test/mjsunit/wasm/embenchen/corrections.js b/test/mjsunit/wasm/embenchen/corrections.js
new file mode 100644
index 0000000..23bec5f
--- /dev/null
+++ b/test/mjsunit/wasm/embenchen/corrections.js
@@ -0,0 +1,5986 @@
+// Modified embenchen to direct to asm-wasm.
+// Flags: --expose-wasm
+
+var EXPECTED_OUTPUT = 'final: 40006013:58243.\n';
+var Module = {
+ arguments: [1],
+ print: function(x) {Module.printBuffer += x + '\n';},
+ preRun: [function() {Module.printBuffer = ''}],
+ postRun: [function() {
+ assertEquals(EXPECTED_OUTPUT, Module.printBuffer);
+ }],
+};
+// The Module object: Our interface to the outside world. We import
+// and export values on it, and do the work to get that through
+// closure compiler if necessary. There are various ways Module can be used:
+// 1. Not defined. We create it here
+// 2. A function parameter, function(Module) { ..generated code.. }
+// 3. pre-run appended it, var Module = {}; ..generated code..
+// 4. External script tag defines var Module.
+// We need to do an eval in order to handle the closure compiler
+// case, where this code here is minified but Module was defined
+// elsewhere (e.g. case 4 above). We also need to check if Module
+// already exists (e.g. case 3 above).
+// Note that if you want to run closure, and also to use Module
+// after the generated code, you will need to define var Module = {};
+// before the code. Then that object will be used in the code, and you
+// can continue to use Module afterwards as well.
+var Module;
+if (!Module) Module = (typeof Module !== 'undefined' ? Module : null) || {};
+
+// Sometimes an existing Module object exists with properties
+// meant to overwrite the default module functionality. Here
+// we collect those properties and reapply _after_ we configure
+// the current environment's defaults to avoid having to be so
+// defensive during initialization.
+var moduleOverrides = {};
+for (var key in Module) {
+ if (Module.hasOwnProperty(key)) {
+ moduleOverrides[key] = Module[key];
+ }
+}
+
+// The environment setup code below is customized to use Module.
+// *** Environment setup code ***
+var ENVIRONMENT_IS_NODE = typeof process === 'object' && typeof require === 'function';
+var ENVIRONMENT_IS_WEB = typeof window === 'object';
+var ENVIRONMENT_IS_WORKER = typeof importScripts === 'function';
+var ENVIRONMENT_IS_SHELL = !ENVIRONMENT_IS_WEB && !ENVIRONMENT_IS_NODE && !ENVIRONMENT_IS_WORKER;
+
+if (ENVIRONMENT_IS_NODE) {
+ // Expose functionality in the same simple way that the shells work
+ // Note that we pollute the global namespace here, otherwise we break in node
+ if (!Module['print']) Module['print'] = function print(x) {
+ process['stdout'].write(x + '\n');
+ };
+ if (!Module['printErr']) Module['printErr'] = function printErr(x) {
+ process['stderr'].write(x + '\n');
+ };
+
+ var nodeFS = require('fs');
+ var nodePath = require('path');
+
+ Module['read'] = function read(filename, binary) {
+ filename = nodePath['normalize'](filename);
+ var ret = nodeFS['readFileSync'](filename);
+ // The path is absolute if the normalized version is the same as the resolved.
+ if (!ret && filename != nodePath['resolve'](filename)) {
+ filename = path.join(__dirname, '..', 'src', filename);
+ ret = nodeFS['readFileSync'](filename);
+ }
+ if (ret && !binary) ret = ret.toString();
+ return ret;
+ };
+
+ Module['readBinary'] = function readBinary(filename) { return Module['read'](filename, true) };
+
+ Module['load'] = function load(f) {
+ globalEval(read(f));
+ };
+
+ Module['arguments'] = process['argv'].slice(2);
+
+ module['exports'] = Module;
+}
+else if (ENVIRONMENT_IS_SHELL) {
+ if (!Module['print']) Module['print'] = print;
+ if (typeof printErr != 'undefined') Module['printErr'] = printErr; // not present in v8 or older sm
+
+ if (typeof read != 'undefined') {
+ Module['read'] = read;
+ } else {
+ Module['read'] = function read() { throw 'no read() available (jsc?)' };
+ }
+
+ Module['readBinary'] = function readBinary(f) {
+ return read(f, 'binary');
+ };
+
+ if (typeof scriptArgs != 'undefined') {
+ Module['arguments'] = scriptArgs;
+ } else if (typeof arguments != 'undefined') {
+ Module['arguments'] = arguments;
+ }
+
+ this['Module'] = Module;
+
+ eval("if (typeof gc === 'function' && gc.toString().indexOf('[native code]') > 0) var gc = undefined"); // wipe out the SpiderMonkey shell 'gc' function, which can confuse closure (uses it as a minified name, and it is then initted to a non-falsey value unexpectedly)
+}
+else if (ENVIRONMENT_IS_WEB || ENVIRONMENT_IS_WORKER) {
+ Module['read'] = function read(url) {
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, false);
+ xhr.send(null);
+ return xhr.responseText;
+ };
+
+ if (typeof arguments != 'undefined') {
+ Module['arguments'] = arguments;
+ }
+
+ if (typeof console !== 'undefined') {
+ if (!Module['print']) Module['print'] = function print(x) {
+ console.log(x);
+ };
+ if (!Module['printErr']) Module['printErr'] = function printErr(x) {
+ console.log(x);
+ };
+ } else {
+ // Probably a worker, and without console.log. We can do very little here...
+ var TRY_USE_DUMP = false;
+ if (!Module['print']) Module['print'] = (TRY_USE_DUMP && (typeof(dump) !== "undefined") ? (function(x) {
+ dump(x);
+ }) : (function(x) {
+ // self.postMessage(x); // enable this if you want stdout to be sent as messages
+ }));
+ }
+
+ if (ENVIRONMENT_IS_WEB) {
+ window['Module'] = Module;
+ } else {
+ Module['load'] = importScripts;
+ }
+}
+else {
+ // Unreachable because SHELL is dependant on the others
+ throw 'Unknown runtime environment. Where are we?';
+}
+
+function globalEval(x) {
+ eval.call(null, x);
+}
+if (!Module['load'] == 'undefined' && Module['read']) {
+ Module['load'] = function load(f) {
+ globalEval(Module['read'](f));
+ };
+}
+if (!Module['print']) {
+ Module['print'] = function(){};
+}
+if (!Module['printErr']) {
+ Module['printErr'] = Module['print'];
+}
+if (!Module['arguments']) {
+ Module['arguments'] = [];
+}
+// *** Environment setup code ***
+
+// Closure helpers
+Module.print = Module['print'];
+Module.printErr = Module['printErr'];
+
+// Callbacks
+Module['preRun'] = [];
+Module['postRun'] = [];
+
+// Merge back in the overrides
+for (var key in moduleOverrides) {
+ if (moduleOverrides.hasOwnProperty(key)) {
+ Module[key] = moduleOverrides[key];
+ }
+}
+
+
+
+// === Auto-generated preamble library stuff ===
+
+//========================================
+// Runtime code shared with compiler
+//========================================
+
+var Runtime = {
+ stackSave: function () {
+ return STACKTOP;
+ },
+ stackRestore: function (stackTop) {
+ STACKTOP = stackTop;
+ },
+ forceAlign: function (target, quantum) {
+ quantum = quantum || 4;
+ if (quantum == 1) return target;
+ if (isNumber(target) && isNumber(quantum)) {
+ return Math.ceil(target/quantum)*quantum;
+ } else if (isNumber(quantum) && isPowerOfTwo(quantum)) {
+ return '(((' +target + ')+' + (quantum-1) + ')&' + -quantum + ')';
+ }
+ return 'Math.ceil((' + target + ')/' + quantum + ')*' + quantum;
+ },
+ isNumberType: function (type) {
+ return type in Runtime.INT_TYPES || type in Runtime.FLOAT_TYPES;
+ },
+ isPointerType: function isPointerType(type) {
+ return type[type.length-1] == '*';
+},
+ isStructType: function isStructType(type) {
+ if (isPointerType(type)) return false;
+ if (isArrayType(type)) return true;
+ if (/<?\{ ?[^}]* ?\}>?/.test(type)) return true; // { i32, i8 } etc. - anonymous struct types
+ // See comment in isStructPointerType()
+ return type[0] == '%';
+},
+ INT_TYPES: {"i1":0,"i8":0,"i16":0,"i32":0,"i64":0},
+ FLOAT_TYPES: {"float":0,"double":0},
+ or64: function (x, y) {
+ var l = (x | 0) | (y | 0);
+ var h = (Math.round(x / 4294967296) | Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ and64: function (x, y) {
+ var l = (x | 0) & (y | 0);
+ var h = (Math.round(x / 4294967296) & Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ xor64: function (x, y) {
+ var l = (x | 0) ^ (y | 0);
+ var h = (Math.round(x / 4294967296) ^ Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ getNativeTypeSize: function (type) {
+ switch (type) {
+ case 'i1': case 'i8': return 1;
+ case 'i16': return 2;
+ case 'i32': return 4;
+ case 'i64': return 8;
+ case 'float': return 4;
+ case 'double': return 8;
+ default: {
+ if (type[type.length-1] === '*') {
+ return Runtime.QUANTUM_SIZE; // A pointer
+ } else if (type[0] === 'i') {
+ var bits = parseInt(type.substr(1));
+ assert(bits % 8 === 0);
+ return bits/8;
+ } else {
+ return 0;
+ }
+ }
+ }
+ },
+ getNativeFieldSize: function (type) {
+ return Math.max(Runtime.getNativeTypeSize(type), Runtime.QUANTUM_SIZE);
+ },
+ dedup: function dedup(items, ident) {
+ var seen = {};
+ if (ident) {
+ return items.filter(function(item) {
+ if (seen[item[ident]]) return false;
+ seen[item[ident]] = true;
+ return true;
+ });
+ } else {
+ return items.filter(function(item) {
+ if (seen[item]) return false;
+ seen[item] = true;
+ return true;
+ });
+ }
+},
+ set: function set() {
+ var args = typeof arguments[0] === 'object' ? arguments[0] : arguments;
+ var ret = {};
+ for (var i = 0; i < args.length; i++) {
+ ret[args[i]] = 0;
+ }
+ return ret;
+},
+ STACK_ALIGN: 8,
+ getAlignSize: function (type, size, vararg) {
+ // we align i64s and doubles on 64-bit boundaries, unlike x86
+ if (!vararg && (type == 'i64' || type == 'double')) return 8;
+ if (!type) return Math.min(size, 8); // align structures internally to 64 bits
+ return Math.min(size || (type ? Runtime.getNativeFieldSize(type) : 0), Runtime.QUANTUM_SIZE);
+ },
+ calculateStructAlignment: function calculateStructAlignment(type) {
+ type.flatSize = 0;
+ type.alignSize = 0;
+ var diffs = [];
+ var prev = -1;
+ var index = 0;
+ type.flatIndexes = type.fields.map(function(field) {
+ index++;
+ var size, alignSize;
+ if (Runtime.isNumberType(field) || Runtime.isPointerType(field)) {
+ size = Runtime.getNativeTypeSize(field); // pack char; char; in structs, also char[X]s.
+ alignSize = Runtime.getAlignSize(field, size);
+ } else if (Runtime.isStructType(field)) {
+ if (field[1] === '0') {
+ // this is [0 x something]. When inside another structure like here, it must be at the end,
+ // and it adds no size
+ // XXX this happens in java-nbody for example... assert(index === type.fields.length, 'zero-length in the middle!');
+ size = 0;
+ if (Types.types[field]) {
+ alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
+ } else {
+ alignSize = type.alignSize || QUANTUM_SIZE;
+ }
+ } else {
+ size = Types.types[field].flatSize;
+ alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
+ }
+ } else if (field[0] == 'b') {
+ // bN, large number field, like a [N x i8]
+ size = field.substr(1)|0;
+ alignSize = 1;
+ } else if (field[0] === '<') {
+ // vector type
+ size = alignSize = Types.types[field].flatSize; // fully aligned
+ } else if (field[0] === 'i') {
+ // illegal integer field, that could not be legalized because it is an internal structure field
+ // it is ok to have such fields, if we just use them as markers of field size and nothing more complex
+ size = alignSize = parseInt(field.substr(1))/8;
+ assert(size % 1 === 0, 'cannot handle non-byte-size field ' + field);
+ } else {
+ assert(false, 'invalid type for calculateStructAlignment');
+ }
+ if (type.packed) alignSize = 1;
+ type.alignSize = Math.max(type.alignSize, alignSize);
+ var curr = Runtime.alignMemory(type.flatSize, alignSize); // if necessary, place this on aligned memory
+ type.flatSize = curr + size;
+ if (prev >= 0) {
+ diffs.push(curr-prev);
+ }
+ prev = curr;
+ return curr;
+ });
+ if (type.name_ && type.name_[0] === '[') {
+ // arrays have 2 elements, so we get the proper difference. then we scale here. that way we avoid
+ // allocating a potentially huge array for [999999 x i8] etc.
+ type.flatSize = parseInt(type.name_.substr(1))*type.flatSize/2;
+ }
+ type.flatSize = Runtime.alignMemory(type.flatSize, type.alignSize);
+ if (diffs.length == 0) {
+ type.flatFactor = type.flatSize;
+ } else if (Runtime.dedup(diffs).length == 1) {
+ type.flatFactor = diffs[0];
+ }
+ type.needsFlattening = (type.flatFactor != 1);
+ return type.flatIndexes;
+ },
+ generateStructInfo: function (struct, typeName, offset) {
+ var type, alignment;
+ if (typeName) {
+ offset = offset || 0;
+ type = (typeof Types === 'undefined' ? Runtime.typeInfo : Types.types)[typeName];
+ if (!type) return null;
+ if (type.fields.length != struct.length) {
+ printErr('Number of named fields must match the type for ' + typeName + ': possibly duplicate struct names. Cannot return structInfo');
+ return null;
+ }
+ alignment = type.flatIndexes;
+ } else {
+ var type = { fields: struct.map(function(item) { return item[0] }) };
+ alignment = Runtime.calculateStructAlignment(type);
+ }
+ var ret = {
+ __size__: type.flatSize
+ };
+ if (typeName) {
+ struct.forEach(function(item, i) {
+ if (typeof item === 'string') {
+ ret[item] = alignment[i] + offset;
+ } else {
+ // embedded struct
+ var key;
+ for (var k in item) key = k;
+ ret[key] = Runtime.generateStructInfo(item[key], type.fields[i], alignment[i]);
+ }
+ });
+ } else {
+ struct.forEach(function(item, i) {
+ ret[item[1]] = alignment[i];
+ });
+ }
+ return ret;
+ },
+ dynCall: function (sig, ptr, args) {
+ if (args && args.length) {
+ if (!args.splice) args = Array.prototype.slice.call(args);
+ args.splice(0, 0, ptr);
+ return Module['dynCall_' + sig].apply(null, args);
+ } else {
+ return Module['dynCall_' + sig].call(null, ptr);
+ }
+ },
+ functionPointers: [],
+ addFunction: function (func) {
+ for (var i = 0; i < Runtime.functionPointers.length; i++) {
+ if (!Runtime.functionPointers[i]) {
+ Runtime.functionPointers[i] = func;
+ return 2*(1 + i);
+ }
+ }
+ throw 'Finished up all reserved function pointers. Use a higher value for RESERVED_FUNCTION_POINTERS.';
+ },
+ removeFunction: function (index) {
+ Runtime.functionPointers[(index-2)/2] = null;
+ },
+ getAsmConst: function (code, numArgs) {
+ // code is a constant string on the heap, so we can cache these
+ if (!Runtime.asmConstCache) Runtime.asmConstCache = {};
+ var func = Runtime.asmConstCache[code];
+ if (func) return func;
+ var args = [];
+ for (var i = 0; i < numArgs; i++) {
+ args.push(String.fromCharCode(36) + i); // $0, $1 etc
+ }
+ var source = Pointer_stringify(code);
+ if (source[0] === '"') {
+ // tolerate EM_ASM("..code..") even though EM_ASM(..code..) is correct
+ if (source.indexOf('"', 1) === source.length-1) {
+ source = source.substr(1, source.length-2);
+ } else {
+ // something invalid happened, e.g. EM_ASM("..code($0)..", input)
+ abort('invalid EM_ASM input |' + source + '|. Please use EM_ASM(..code..) (no quotes) or EM_ASM({ ..code($0).. }, input) (to input values)');
+ }
+ }
+ try {
+ var evalled = eval('(function(' + args.join(',') + '){ ' + source + ' })'); // new Function does not allow upvars in node
+ } catch(e) {
+ Module.printErr('error in executing inline EM_ASM code: ' + e + ' on: \n\n' + source + '\n\nwith args |' + args + '| (make sure to use the right one out of EM_ASM, EM_ASM_ARGS, etc.)');
+ throw e;
+ }
+ return Runtime.asmConstCache[code] = evalled;
+ },
+ warnOnce: function (text) {
+ if (!Runtime.warnOnce.shown) Runtime.warnOnce.shown = {};
+ if (!Runtime.warnOnce.shown[text]) {
+ Runtime.warnOnce.shown[text] = 1;
+ Module.printErr(text);
+ }
+ },
+ funcWrappers: {},
+ getFuncWrapper: function (func, sig) {
+ assert(sig);
+ if (!Runtime.funcWrappers[func]) {
+ Runtime.funcWrappers[func] = function dynCall_wrapper() {
+ return Runtime.dynCall(sig, func, arguments);
+ };
+ }
+ return Runtime.funcWrappers[func];
+ },
+ UTF8Processor: function () {
+ var buffer = [];
+ var needed = 0;
+ this.processCChar = function (code) {
+ code = code & 0xFF;
+
+ if (buffer.length == 0) {
+ if ((code & 0x80) == 0x00) { // 0xxxxxxx
+ return String.fromCharCode(code);
+ }
+ buffer.push(code);
+ if ((code & 0xE0) == 0xC0) { // 110xxxxx
+ needed = 1;
+ } else if ((code & 0xF0) == 0xE0) { // 1110xxxx
+ needed = 2;
+ } else { // 11110xxx
+ needed = 3;
+ }
+ return '';
+ }
+
+ if (needed) {
+ buffer.push(code);
+ needed--;
+ if (needed > 0) return '';
+ }
+
+ var c1 = buffer[0];
+ var c2 = buffer[1];
+ var c3 = buffer[2];
+ var c4 = buffer[3];
+ var ret;
+ if (buffer.length == 2) {
+ ret = String.fromCharCode(((c1 & 0x1F) << 6) | (c2 & 0x3F));
+ } else if (buffer.length == 3) {
+ ret = String.fromCharCode(((c1 & 0x0F) << 12) | ((c2 & 0x3F) << 6) | (c3 & 0x3F));
+ } else {
+ // http://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae
+ var codePoint = ((c1 & 0x07) << 18) | ((c2 & 0x3F) << 12) |
+ ((c3 & 0x3F) << 6) | (c4 & 0x3F);
+ ret = String.fromCharCode(
+ Math.floor((codePoint - 0x10000) / 0x400) + 0xD800,
+ (codePoint - 0x10000) % 0x400 + 0xDC00);
+ }
+ buffer.length = 0;
+ return ret;
+ }
+ this.processJSString = function processJSString(string) {
+ /* TODO: use TextEncoder when present,
+ var encoder = new TextEncoder();
+ encoder['encoding'] = "utf-8";
+ var utf8Array = encoder['encode'](aMsg.data);
+ */
+ string = unescape(encodeURIComponent(string));
+ var ret = [];
+ for (var i = 0; i < string.length; i++) {
+ ret.push(string.charCodeAt(i));
+ }
+ return ret;
+ }
+ },
+ getCompilerSetting: function (name) {
+ throw 'You must build with -s RETAIN_COMPILER_SETTINGS=1 for Runtime.getCompilerSetting or emscripten_get_compiler_setting to work';
+ },
+ stackAlloc: function (size) { var ret = STACKTOP;STACKTOP = (STACKTOP + size)|0;STACKTOP = (((STACKTOP)+7)&-8); return ret; },
+ staticAlloc: function (size) { var ret = STATICTOP;STATICTOP = (STATICTOP + size)|0;STATICTOP = (((STATICTOP)+7)&-8); return ret; },
+ dynamicAlloc: function (size) { var ret = DYNAMICTOP;DYNAMICTOP = (DYNAMICTOP + size)|0;DYNAMICTOP = (((DYNAMICTOP)+7)&-8); if (DYNAMICTOP >= TOTAL_MEMORY) enlargeMemory();; return ret; },
+ alignMemory: function (size,quantum) { var ret = size = Math.ceil((size)/(quantum ? quantum : 8))*(quantum ? quantum : 8); return ret; },
+ makeBigInt: function (low,high,unsigned) { var ret = (unsigned ? ((+((low>>>0)))+((+((high>>>0)))*(+4294967296))) : ((+((low>>>0)))+((+((high|0)))*(+4294967296)))); return ret; },
+ GLOBAL_BASE: 8,
+ QUANTUM_SIZE: 4,
+ __dummy__: 0
+}
+
+
+Module['Runtime'] = Runtime;
+
+
+
+
+
+
+
+
+
+//========================================
+// Runtime essentials
+//========================================
+
+var __THREW__ = 0; // Used in checking for thrown exceptions.
+
+var ABORT = false; // whether we are quitting the application. no code should run after this. set in exit() and abort()
+var EXITSTATUS = 0;
+
+var undef = 0;
+// tempInt is used for 32-bit signed values or smaller. tempBigInt is used
+// for 32-bit unsigned values or more than 32 bits. TODO: audit all uses of tempInt
+var tempValue, tempInt, tempBigInt, tempInt2, tempBigInt2, tempPair, tempBigIntI, tempBigIntR, tempBigIntS, tempBigIntP, tempBigIntD, tempDouble, tempFloat;
+var tempI64, tempI64b;
+var tempRet0, tempRet1, tempRet2, tempRet3, tempRet4, tempRet5, tempRet6, tempRet7, tempRet8, tempRet9;
+
+function assert(condition, text) {
+ if (!condition) {
+ abort('Assertion failed: ' + text);
+ }
+}
+
+var globalScope = this;
+
+// C calling interface. A convenient way to call C functions (in C files, or
+// defined with extern "C").
+//
+// Note: LLVM optimizations can inline and remove functions, after which you will not be
+// able to call them. Closure can also do so. To avoid that, add your function to
+// the exports using something like
+//
+// -s EXPORTED_FUNCTIONS='["_main", "_myfunc"]'
+//
+// @param ident The name of the C function (note that C++ functions will be name-mangled - use extern "C")
+// @param returnType The return type of the function, one of the JS types 'number', 'string' or 'array' (use 'number' for any C pointer, and
+// 'array' for JavaScript arrays and typed arrays; note that arrays are 8-bit).
+// @param argTypes An array of the types of arguments for the function (if there are no arguments, this can be ommitted). Types are as in returnType,
+// except that 'array' is not possible (there is no way for us to know the length of the array)
+// @param args An array of the arguments to the function, as native JS values (as in returnType)
+// Note that string arguments will be stored on the stack (the JS string will become a C string on the stack).
+// @return The return value, as a native JS value (as in returnType)
+function ccall(ident, returnType, argTypes, args) {
+ return ccallFunc(getCFunc(ident), returnType, argTypes, args);
+}
+Module["ccall"] = ccall;
+
+// Returns the C function with a specified identifier (for C++, you need to do manual name mangling)
+function getCFunc(ident) {
+ try {
+ var func = Module['_' + ident]; // closure exported function
+ if (!func) func = eval('_' + ident); // explicit lookup
+ } catch(e) {
+ }
+ assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');
+ return func;
+}
+
+// Internal function that does a C call using a function, not an identifier
+function ccallFunc(func, returnType, argTypes, args) {
+ var stack = 0;
+ function toC(value, type) {
+ if (type == 'string') {
+ if (value === null || value === undefined || value === 0) return 0; // null string
+ value = intArrayFromString(value);
+ type = 'array';
+ }
+ if (type == 'array') {
+ if (!stack) stack = Runtime.stackSave();
+ var ret = Runtime.stackAlloc(value.length);
+ writeArrayToMemory(value, ret);
+ return ret;
+ }
+ return value;
+ }
+ function fromC(value, type) {
+ if (type == 'string') {
+ return Pointer_stringify(value);
+ }
+ assert(type != 'array');
+ return value;
+ }
+ var i = 0;
+ var cArgs = args ? args.map(function(arg) {
+ return toC(arg, argTypes[i++]);
+ }) : [];
+ var ret = fromC(func.apply(null, cArgs), returnType);
+ if (stack) Runtime.stackRestore(stack);
+ return ret;
+}
+
+// Returns a native JS wrapper for a C function. This is similar to ccall, but
+// returns a function you can call repeatedly in a normal way. For example:
+//
+// var my_function = cwrap('my_c_function', 'number', ['number', 'number']);
+// alert(my_function(5, 22));
+// alert(my_function(99, 12));
+//
+function cwrap(ident, returnType, argTypes) {
+ var func = getCFunc(ident);
+ return function() {
+ return ccallFunc(func, returnType, argTypes, Array.prototype.slice.call(arguments));
+ }
+}
+Module["cwrap"] = cwrap;
+
+// Sets a value in memory in a dynamic way at run-time. Uses the
+// type data. This is the same as makeSetValue, except that
+// makeSetValue is done at compile-time and generates the needed
+// code then, whereas this function picks the right code at
+// run-time.
+// Note that setValue and getValue only do *aligned* writes and reads!
+// Note that ccall uses JS types as for defining types, while setValue and
+// getValue need LLVM types ('i8', 'i32') - this is a lower-level operation
+function setValue(ptr, value, type, noSafe) {
+ type = type || 'i8';
+ if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
+ switch(type) {
+ case 'i1': HEAP8[(ptr)]=value; break;
+ case 'i8': HEAP8[(ptr)]=value; break;
+ case 'i16': HEAP16[((ptr)>>1)]=value; break;
+ case 'i32': HEAP32[((ptr)>>2)]=value; break;
+ case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;
+ case 'float': HEAPF32[((ptr)>>2)]=value; break;
+ case 'double': HEAPF64[((ptr)>>3)]=value; break;
+ default: abort('invalid type for setValue: ' + type);
+ }
+}
+Module['setValue'] = setValue;
+
+// Parallel to setValue.
+function getValue(ptr, type, noSafe) {
+ type = type || 'i8';
+ if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
+ switch(type) {
+ case 'i1': return HEAP8[(ptr)];
+ case 'i8': return HEAP8[(ptr)];
+ case 'i16': return HEAP16[((ptr)>>1)];
+ case 'i32': return HEAP32[((ptr)>>2)];
+ case 'i64': return HEAP32[((ptr)>>2)];
+ case 'float': return HEAPF32[((ptr)>>2)];
+ case 'double': return HEAPF64[((ptr)>>3)];
+ default: abort('invalid type for setValue: ' + type);
+ }
+ return null;
+}
+Module['getValue'] = getValue;
+
+var ALLOC_NORMAL = 0; // Tries to use _malloc()
+var ALLOC_STACK = 1; // Lives for the duration of the current function call
+var ALLOC_STATIC = 2; // Cannot be freed
+var ALLOC_DYNAMIC = 3; // Cannot be freed except through sbrk
+var ALLOC_NONE = 4; // Do not allocate
+Module['ALLOC_NORMAL'] = ALLOC_NORMAL;
+Module['ALLOC_STACK'] = ALLOC_STACK;
+Module['ALLOC_STATIC'] = ALLOC_STATIC;
+Module['ALLOC_DYNAMIC'] = ALLOC_DYNAMIC;
+Module['ALLOC_NONE'] = ALLOC_NONE;
+
+// allocate(): This is for internal use. You can use it yourself as well, but the interface
+// is a little tricky (see docs right below). The reason is that it is optimized
+// for multiple syntaxes to save space in generated code. So you should
+// normally not use allocate(), and instead allocate memory using _malloc(),
+// initialize it with setValue(), and so forth.
+// @slab: An array of data, or a number. If a number, then the size of the block to allocate,
+// in *bytes* (note that this is sometimes confusing: the next parameter does not
+// affect this!)
+// @types: Either an array of types, one for each byte (or 0 if no type at that position),
+// or a single type which is used for the entire block. This only matters if there
+// is initial data - if @slab is a number, then this does not matter at all and is
+// ignored.
+// @allocator: How to allocate memory, see ALLOC_*
+function allocate(slab, types, allocator, ptr) {
+ var zeroinit, size;
+ if (typeof slab === 'number') {
+ zeroinit = true;
+ size = slab;
+ } else {
+ zeroinit = false;
+ size = slab.length;
+ }
+
+ var singleType = typeof types === 'string' ? types : null;
+
+ var ret;
+ if (allocator == ALLOC_NONE) {
+ ret = ptr;
+ } else {
+ ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));
+ }
+
+ if (zeroinit) {
+ var ptr = ret, stop;
+ assert((ret & 3) == 0);
+ stop = ret + (size & ~3);
+ for (; ptr < stop; ptr += 4) {
+ HEAP32[((ptr)>>2)]=0;
+ }
+ stop = ret + size;
+ while (ptr < stop) {
+ HEAP8[((ptr++)|0)]=0;
+ }
+ return ret;
+ }
+
+ if (singleType === 'i8') {
+ if (slab.subarray || slab.slice) {
+ HEAPU8.set(slab, ret);
+ } else {
+ HEAPU8.set(new Uint8Array(slab), ret);
+ }
+ return ret;
+ }
+
+ var i = 0, type, typeSize, previousType;
+ while (i < size) {
+ var curr = slab[i];
+
+ if (typeof curr === 'function') {
+ curr = Runtime.getFunctionIndex(curr);
+ }
+
+ type = singleType || types[i];
+ if (type === 0) {
+ i++;
+ continue;
+ }
+
+ if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later
+
+ setValue(ret+i, curr, type);
+
+ // no need to look up size unless type changes, so cache it
+ if (previousType !== type) {
+ typeSize = Runtime.getNativeTypeSize(type);
+ previousType = type;
+ }
+ i += typeSize;
+ }
+
+ return ret;
+}
+Module['allocate'] = allocate;
+
+function Pointer_stringify(ptr, /* optional */ length) {
+ // TODO: use TextDecoder
+ // Find the length, and check for UTF while doing so
+ var hasUtf = false;
+ var t;
+ var i = 0;
+ while (1) {
+ t = HEAPU8[(((ptr)+(i))|0)];
+ if (t >= 128) hasUtf = true;
+ else if (t == 0 && !length) break;
+ i++;
+ if (length && i == length) break;
+ }
+ if (!length) length = i;
+
+ var ret = '';
+
+ if (!hasUtf) {
+ var MAX_CHUNK = 1024; // split up into chunks, because .apply on a huge string can overflow the stack
+ var curr;
+ while (length > 0) {
+ curr = String.fromCharCode.apply(String, HEAPU8.subarray(ptr, ptr + Math.min(length, MAX_CHUNK)));
+ ret = ret ? ret + curr : curr;
+ ptr += MAX_CHUNK;
+ length -= MAX_CHUNK;
+ }
+ return ret;
+ }
+
+ var utf8 = new Runtime.UTF8Processor();
+ for (i = 0; i < length; i++) {
+ t = HEAPU8[(((ptr)+(i))|0)];
+ ret += utf8.processCChar(t);
+ }
+ return ret;
+}
+Module['Pointer_stringify'] = Pointer_stringify;
+
+// Given a pointer 'ptr' to a null-terminated UTF16LE-encoded string in the emscripten HEAP, returns
+// a copy of that string as a Javascript String object.
+function UTF16ToString(ptr) {
+ var i = 0;
+
+ var str = '';
+ while (1) {
+ var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];
+ if (codeUnit == 0)
+ return str;
+ ++i;
+ // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.
+ str += String.fromCharCode(codeUnit);
+ }
+}
+Module['UTF16ToString'] = UTF16ToString;
+
+// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
+// null-terminated and encoded in UTF16LE form. The copy will require at most (str.length*2+1)*2 bytes of space in the HEAP.
+function stringToUTF16(str, outPtr) {
+ for(var i = 0; i < str.length; ++i) {
+ // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.
+ var codeUnit = str.charCodeAt(i); // possibly a lead surrogate
+ HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;
+ }
+ // Null-terminate the pointer to the HEAP.
+ HEAP16[(((outPtr)+(str.length*2))>>1)]=0;
+}
+Module['stringToUTF16'] = stringToUTF16;
+
+// Given a pointer 'ptr' to a null-terminated UTF32LE-encoded string in the emscripten HEAP, returns
+// a copy of that string as a Javascript String object.
+function UTF32ToString(ptr) {
+ var i = 0;
+
+ var str = '';
+ while (1) {
+ var utf32 = HEAP32[(((ptr)+(i*4))>>2)];
+ if (utf32 == 0)
+ return str;
+ ++i;
+ // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.
+ if (utf32 >= 0x10000) {
+ var ch = utf32 - 0x10000;
+ str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));
+ } else {
+ str += String.fromCharCode(utf32);
+ }
+ }
+}
+Module['UTF32ToString'] = UTF32ToString;
+
+// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
+// null-terminated and encoded in UTF32LE form. The copy will require at most (str.length+1)*4 bytes of space in the HEAP,
+// but can use less, since str.length does not return the number of characters in the string, but the number of UTF-16 code units in the string.
+function stringToUTF32(str, outPtr) {
+ var iChar = 0;
+ for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {
+ // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.
+ var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate
+ if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {
+ var trailSurrogate = str.charCodeAt(++iCodeUnit);
+ codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);
+ }
+ HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;
+ ++iChar;
+ }
+ // Null-terminate the pointer to the HEAP.
+ HEAP32[(((outPtr)+(iChar*4))>>2)]=0;
+}
+Module['stringToUTF32'] = stringToUTF32;
+
+function demangle(func) {
+ var i = 3;
+ // params, etc.
+ var basicTypes = {
+ 'v': 'void',
+ 'b': 'bool',
+ 'c': 'char',
+ 's': 'short',
+ 'i': 'int',
+ 'l': 'long',
+ 'f': 'float',
+ 'd': 'double',
+ 'w': 'wchar_t',
+ 'a': 'signed char',
+ 'h': 'unsigned char',
+ 't': 'unsigned short',
+ 'j': 'unsigned int',
+ 'm': 'unsigned long',
+ 'x': 'long long',
+ 'y': 'unsigned long long',
+ 'z': '...'
+ };
+ var subs = [];
+ var first = true;
+ function dump(x) {
+ //return;
+ if (x) Module.print(x);
+ Module.print(func);
+ var pre = '';
+ for (var a = 0; a < i; a++) pre += ' ';
+ Module.print (pre + '^');
+ }
+ function parseNested() {
+ i++;
+ if (func[i] === 'K') i++; // ignore const
+ var parts = [];
+ while (func[i] !== 'E') {
+ if (func[i] === 'S') { // substitution
+ i++;
+ var next = func.indexOf('_', i);
+ var num = func.substring(i, next) || 0;
+ parts.push(subs[num] || '?');
+ i = next+1;
+ continue;
+ }
+ if (func[i] === 'C') { // constructor
+ parts.push(parts[parts.length-1]);
+ i += 2;
+ continue;
+ }
+ var size = parseInt(func.substr(i));
+ var pre = size.toString().length;
+ if (!size || !pre) { i--; break; } // counter i++ below us
+ var curr = func.substr(i + pre, size);
+ parts.push(curr);
+ subs.push(curr);
+ i += pre + size;
+ }
+ i++; // skip E
+ return parts;
+ }
+ function parse(rawList, limit, allowVoid) { // main parser
+ limit = limit || Infinity;
+ var ret = '', list = [];
+ function flushList() {
+ return '(' + list.join(', ') + ')';
+ }
+ var name;
+ if (func[i] === 'N') {
+ // namespaced N-E
+ name = parseNested().join('::');
+ limit--;
+ if (limit === 0) return rawList ? [name] : name;
+ } else {
+ // not namespaced
+ if (func[i] === 'K' || (first && func[i] === 'L')) i++; // ignore const and first 'L'
+ var size = parseInt(func.substr(i));
+ if (size) {
+ var pre = size.toString().length;
+ name = func.substr(i + pre, size);
+ i += pre + size;
+ }
+ }
+ first = false;
+ if (func[i] === 'I') {
+ i++;
+ var iList = parse(true);
+ var iRet = parse(true, 1, true);
+ ret += iRet[0] + ' ' + name + '<' + iList.join(', ') + '>';
+ } else {
+ ret = name;
+ }
+ paramLoop: while (i < func.length && limit-- > 0) {
+ //dump('paramLoop');
+ var c = func[i++];
+ if (c in basicTypes) {
+ list.push(basicTypes[c]);
+ } else {
+ switch (c) {
+ case 'P': list.push(parse(true, 1, true)[0] + '*'); break; // pointer
+ case 'R': list.push(parse(true, 1, true)[0] + '&'); break; // reference
+ case 'L': { // literal
+ i++; // skip basic type
+ var end = func.indexOf('E', i);
+ var size = end - i;
+ list.push(func.substr(i, size));
+ i += size + 2; // size + 'EE'
+ break;
+ }
+ case 'A': { // array
+ var size = parseInt(func.substr(i));
+ i += size.toString().length;
+ if (func[i] !== '_') throw '?';
+ i++; // skip _
+ list.push(parse(true, 1, true)[0] + ' [' + size + ']');
+ break;
+ }
+ case 'E': break paramLoop;
+ default: ret += '?' + c; break paramLoop;
+ }
+ }
+ }
+ if (!allowVoid && list.length === 1 && list[0] === 'void') list = []; // avoid (void)
+ if (rawList) {
+ if (ret) {
+ list.push(ret + '?');
+ }
+ return list;
+ } else {
+ return ret + flushList();
+ }
+ }
+ try {
+ // Special-case the entry point, since its name differs from other name mangling.
+ if (func == 'Object._main' || func == '_main') {
+ return 'main()';
+ }
+ if (typeof func === 'number') func = Pointer_stringify(func);
+ if (func[0] !== '_') return func;
+ if (func[1] !== '_') return func; // C function
+ if (func[2] !== 'Z') return func;
+ switch (func[3]) {
+ case 'n': return 'operator new()';
+ case 'd': return 'operator delete()';
+ }
+ return parse();
+ } catch(e) {
+ return func;
+ }
+}
+
+function demangleAll(text) {
+ return text.replace(/__Z[\w\d_]+/g, function(x) { var y = demangle(x); return x === y ? x : (x + ' [' + y + ']') });
+}
+
+function stackTrace() {
+ var stack = new Error().stack;
+ return stack ? demangleAll(stack) : '(no stack trace available)'; // Stack trace is not available at least on IE10 and Safari 6.
+}
+
+// Memory management
+
+var PAGE_SIZE = 4096;
+function alignMemoryPage(x) {
+ return (x+4095)&-4096;
+}
+
+var HEAP;
+var HEAP8, HEAPU8, HEAP16, HEAPU16, HEAP32, HEAPU32, HEAPF32, HEAPF64;
+
+var STATIC_BASE = 0, STATICTOP = 0, staticSealed = false; // static area
+var STACK_BASE = 0, STACKTOP = 0, STACK_MAX = 0; // stack area
+var DYNAMIC_BASE = 0, DYNAMICTOP = 0; // dynamic area handled by sbrk
+
+function enlargeMemory() {
+ abort('Cannot enlarge memory arrays. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value ' + TOTAL_MEMORY + ', (2) compile with ALLOW_MEMORY_GROWTH which adjusts the size at runtime but prevents some optimizations, or (3) set Module.TOTAL_MEMORY before the program runs.');
+}
+
+var TOTAL_STACK = Module['TOTAL_STACK'] || 5242880;
+var TOTAL_MEMORY = Module['TOTAL_MEMORY'] || 134217728;
+var FAST_MEMORY = Module['FAST_MEMORY'] || 2097152;
+
+var totalMemory = 4096;
+while (totalMemory < TOTAL_MEMORY || totalMemory < 2*TOTAL_STACK) {
+ if (totalMemory < 16*1024*1024) {
+ totalMemory *= 2;
+ } else {
+ totalMemory += 16*1024*1024
+ }
+}
+if (totalMemory !== TOTAL_MEMORY) {
+ Module.printErr('increasing TOTAL_MEMORY to ' + totalMemory + ' to be more reasonable');
+ TOTAL_MEMORY = totalMemory;
+}
+
+// Initialize the runtime's memory
+// check for full engine support (use string 'subarray' to avoid closure compiler confusion)
+assert(typeof Int32Array !== 'undefined' && typeof Float64Array !== 'undefined' && !!(new Int32Array(1)['subarray']) && !!(new Int32Array(1)['set']),
+ 'JS engine does not provide full typed array support');
+
+var buffer = new ArrayBuffer(TOTAL_MEMORY);
+HEAP8 = new Int8Array(buffer);
+HEAP16 = new Int16Array(buffer);
+HEAP32 = new Int32Array(buffer);
+HEAPU8 = new Uint8Array(buffer);
+HEAPU16 = new Uint16Array(buffer);
+HEAPU32 = new Uint32Array(buffer);
+HEAPF32 = new Float32Array(buffer);
+HEAPF64 = new Float64Array(buffer);
+
+// Endianness check (note: assumes compiler arch was little-endian)
+HEAP32[0] = 255;
+assert(HEAPU8[0] === 255 && HEAPU8[3] === 0, 'Typed arrays 2 must be run on a little-endian system');
+
+Module['HEAP'] = HEAP;
+Module['HEAP8'] = HEAP8;
+Module['HEAP16'] = HEAP16;
+Module['HEAP32'] = HEAP32;
+Module['HEAPU8'] = HEAPU8;
+Module['HEAPU16'] = HEAPU16;
+Module['HEAPU32'] = HEAPU32;
+Module['HEAPF32'] = HEAPF32;
+Module['HEAPF64'] = HEAPF64;
+
+function callRuntimeCallbacks(callbacks) {
+ while(callbacks.length > 0) {
+ var callback = callbacks.shift();
+ if (typeof callback == 'function') {
+ callback();
+ continue;
+ }
+ var func = callback.func;
+ if (typeof func === 'number') {
+ if (callback.arg === undefined) {
+ Runtime.dynCall('v', func);
+ } else {
+ Runtime.dynCall('vi', func, [callback.arg]);
+ }
+ } else {
+ func(callback.arg === undefined ? null : callback.arg);
+ }
+ }
+}
+
+var __ATPRERUN__ = []; // functions called before the runtime is initialized
+var __ATINIT__ = []; // functions called during startup
+var __ATMAIN__ = []; // functions called when main() is to be run
+var __ATEXIT__ = []; // functions called during shutdown
+var __ATPOSTRUN__ = []; // functions called after the runtime has exited
+
+var runtimeInitialized = false;
+
+function preRun() {
+ // compatibility - merge in anything from Module['preRun'] at this time
+ if (Module['preRun']) {
+ if (typeof Module['preRun'] == 'function') Module['preRun'] = [Module['preRun']];
+ while (Module['preRun'].length) {
+ addOnPreRun(Module['preRun'].shift());
+ }
+ }
+ callRuntimeCallbacks(__ATPRERUN__);
+}
+
+function ensureInitRuntime() {
+ if (runtimeInitialized) return;
+ runtimeInitialized = true;
+ callRuntimeCallbacks(__ATINIT__);
+}
+
+function preMain() {
+ callRuntimeCallbacks(__ATMAIN__);
+}
+
+function exitRuntime() {
+ callRuntimeCallbacks(__ATEXIT__);
+}
+
+function postRun() {
+ // compatibility - merge in anything from Module['postRun'] at this time
+ if (Module['postRun']) {
+ if (typeof Module['postRun'] == 'function') Module['postRun'] = [Module['postRun']];
+ while (Module['postRun'].length) {
+ addOnPostRun(Module['postRun'].shift());
+ }
+ }
+ callRuntimeCallbacks(__ATPOSTRUN__);
+}
+
+function addOnPreRun(cb) {
+ __ATPRERUN__.unshift(cb);
+}
+Module['addOnPreRun'] = Module.addOnPreRun = addOnPreRun;
+
+function addOnInit(cb) {
+ __ATINIT__.unshift(cb);
+}
+Module['addOnInit'] = Module.addOnInit = addOnInit;
+
+function addOnPreMain(cb) {
+ __ATMAIN__.unshift(cb);
+}
+Module['addOnPreMain'] = Module.addOnPreMain = addOnPreMain;
+
+function addOnExit(cb) {
+ __ATEXIT__.unshift(cb);
+}
+Module['addOnExit'] = Module.addOnExit = addOnExit;
+
+function addOnPostRun(cb) {
+ __ATPOSTRUN__.unshift(cb);
+}
+Module['addOnPostRun'] = Module.addOnPostRun = addOnPostRun;
+
+// Tools
+
+// This processes a JS string into a C-line array of numbers, 0-terminated.
+// For LLVM-originating strings, see parser.js:parseLLVMString function
+function intArrayFromString(stringy, dontAddNull, length /* optional */) {
+ var ret = (new Runtime.UTF8Processor()).processJSString(stringy);
+ if (length) {
+ ret.length = length;
+ }
+ if (!dontAddNull) {
+ ret.push(0);
+ }
+ return ret;
+}
+Module['intArrayFromString'] = intArrayFromString;
+
+function intArrayToString(array) {
+ var ret = [];
+ for (var i = 0; i < array.length; i++) {
+ var chr = array[i];
+ if (chr > 0xFF) {
+ chr &= 0xFF;
+ }
+ ret.push(String.fromCharCode(chr));
+ }
+ return ret.join('');
+}
+Module['intArrayToString'] = intArrayToString;
+
+// Write a Javascript array to somewhere in the heap
+function writeStringToMemory(string, buffer, dontAddNull) {
+ var array = intArrayFromString(string, dontAddNull);
+ var i = 0;
+ while (i < array.length) {
+ var chr = array[i];
+ HEAP8[(((buffer)+(i))|0)]=chr;
+ i = i + 1;
+ }
+}
+Module['writeStringToMemory'] = writeStringToMemory;
+
+function writeArrayToMemory(array, buffer) {
+ for (var i = 0; i < array.length; i++) {
+ HEAP8[(((buffer)+(i))|0)]=array[i];
+ }
+}
+Module['writeArrayToMemory'] = writeArrayToMemory;
+
+function writeAsciiToMemory(str, buffer, dontAddNull) {
+ for (var i = 0; i < str.length; i++) {
+ HEAP8[(((buffer)+(i))|0)]=str.charCodeAt(i);
+ }
+ if (!dontAddNull) HEAP8[(((buffer)+(str.length))|0)]=0;
+}
+Module['writeAsciiToMemory'] = writeAsciiToMemory;
+
+function unSign(value, bits, ignore) {
+ if (value >= 0) {
+ return value;
+ }
+ return bits <= 32 ? 2*Math.abs(1 << (bits-1)) + value // Need some trickery, since if bits == 32, we are right at the limit of the bits JS uses in bitshifts
+ : Math.pow(2, bits) + value;
+}
+function reSign(value, bits, ignore) {
+ if (value <= 0) {
+ return value;
+ }
+ var half = bits <= 32 ? Math.abs(1 << (bits-1)) // abs is needed if bits == 32
+ : Math.pow(2, bits-1);
+ if (value >= half && (bits <= 32 || value > half)) { // for huge values, we can hit the precision limit and always get true here. so don't do that
+ // but, in general there is no perfect solution here. With 64-bit ints, we get rounding and errors
+ // TODO: In i64 mode 1, resign the two parts separately and safely
+ value = -2*half + value; // Cannot bitshift half, as it may be at the limit of the bits JS uses in bitshifts
+ }
+ return value;
+}
+
+// check for imul support, and also for correctness ( https://bugs.webkit.org/show_bug.cgi?id=126345 )
+if (!Math['imul'] || Math['imul'](0xffffffff, 5) !== -5) Math['imul'] = function imul(a, b) {
+ var ah = a >>> 16;
+ var al = a & 0xffff;
+ var bh = b >>> 16;
+ var bl = b & 0xffff;
+ return (al*bl + ((ah*bl + al*bh) << 16))|0;
+};
+Math.imul = Math['imul'];
+
+
+var Math_abs = Math.abs;
+var Math_cos = Math.cos;
+var Math_sin = Math.sin;
+var Math_tan = Math.tan;
+var Math_acos = Math.acos;
+var Math_asin = Math.asin;
+var Math_atan = Math.atan;
+var Math_atan2 = Math.atan2;
+var Math_exp = Math.exp;
+var Math_log = Math.log;
+var Math_sqrt = Math.sqrt;
+var Math_ceil = Math.ceil;
+var Math_floor = Math.floor;
+var Math_pow = Math.pow;
+var Math_imul = Math.imul;
+var Math_fround = Math.fround;
+var Math_min = Math.min;
+
+// A counter of dependencies for calling run(). If we need to
+// do asynchronous work before running, increment this and
+// decrement it. Incrementing must happen in a place like
+// PRE_RUN_ADDITIONS (used by emcc to add file preloading).
+// Note that you can add dependencies in preRun, even though
+// it happens right before run - run will be postponed until
+// the dependencies are met.
+var runDependencies = 0;
+var runDependencyWatcher = null;
+var dependenciesFulfilled = null; // overridden to take different actions when all run dependencies are fulfilled
+
+function addRunDependency(id) {
+ runDependencies++;
+ if (Module['monitorRunDependencies']) {
+ Module['monitorRunDependencies'](runDependencies);
+ }
+}
+Module['addRunDependency'] = addRunDependency;
+function removeRunDependency(id) {
+ runDependencies--;
+ if (Module['monitorRunDependencies']) {
+ Module['monitorRunDependencies'](runDependencies);
+ }
+ if (runDependencies == 0) {
+ if (runDependencyWatcher !== null) {
+ clearInterval(runDependencyWatcher);
+ runDependencyWatcher = null;
+ }
+ if (dependenciesFulfilled) {
+ var callback = dependenciesFulfilled;
+ dependenciesFulfilled = null;
+ callback(); // can add another dependenciesFulfilled
+ }
+ }
+}
+Module['removeRunDependency'] = removeRunDependency;
+
+Module["preloadedImages"] = {}; // maps url to image data
+Module["preloadedAudios"] = {}; // maps url to audio data
+
+
+var memoryInitializer = null;
+
+// === Body ===
+
+
+
+
+
+STATIC_BASE = 8;
+
+STATICTOP = STATIC_BASE + Runtime.alignMemory(35);
+/* global initializers */ __ATINIT__.push();
+
+
+/* memory initializer */ allocate([101,114,114,111,114,58,32,37,100,92,110,0,0,0,0,0,102,105,110,97,108,58,32,37,100,58,37,100,46,10,0,0], "i8", ALLOC_NONE, Runtime.GLOBAL_BASE);
+
+
+
+
+var tempDoublePtr = Runtime.alignMemory(allocate(12, "i8", ALLOC_STATIC), 8);
+
+assert(tempDoublePtr % 8 == 0);
+
+function copyTempFloat(ptr) { // functions, because inlining this code increases code size too much
+
+ HEAP8[tempDoublePtr] = HEAP8[ptr];
+
+ HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
+
+ HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
+
+ HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
+
+}
+
+function copyTempDouble(ptr) {
+
+ HEAP8[tempDoublePtr] = HEAP8[ptr];
+
+ HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
+
+ HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
+
+ HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
+
+ HEAP8[tempDoublePtr+4] = HEAP8[ptr+4];
+
+ HEAP8[tempDoublePtr+5] = HEAP8[ptr+5];
+
+ HEAP8[tempDoublePtr+6] = HEAP8[ptr+6];
+
+ HEAP8[tempDoublePtr+7] = HEAP8[ptr+7];
+
+}
+
+
+ function _malloc(bytes) {
+ /* Over-allocate to make sure it is byte-aligned by 8.
+ * This will leak memory, but this is only the dummy
+ * implementation (replaced by dlmalloc normally) so
+ * not an issue.
+ */
+ var ptr = Runtime.dynamicAlloc(bytes + 8);
+ return (ptr+8) & 0xFFFFFFF8;
+ }
+ Module["_malloc"] = _malloc;
+
+
+
+
+ var ERRNO_CODES={EPERM:1,ENOENT:2,ESRCH:3,EINTR:4,EIO:5,ENXIO:6,E2BIG:7,ENOEXEC:8,EBADF:9,ECHILD:10,EAGAIN:11,EWOULDBLOCK:11,ENOMEM:12,EACCES:13,EFAULT:14,ENOTBLK:15,EBUSY:16,EEXIST:17,EXDEV:18,ENODEV:19,ENOTDIR:20,EISDIR:21,EINVAL:22,ENFILE:23,EMFILE:24,ENOTTY:25,ETXTBSY:26,EFBIG:27,ENOSPC:28,ESPIPE:29,EROFS:30,EMLINK:31,EPIPE:32,EDOM:33,ERANGE:34,ENOMSG:42,EIDRM:43,ECHRNG:44,EL2NSYNC:45,EL3HLT:46,EL3RST:47,ELNRNG:48,EUNATCH:49,ENOCSI:50,EL2HLT:51,EDEADLK:35,ENOLCK:37,EBADE:52,EBADR:53,EXFULL:54,ENOANO:55,EBADRQC:56,EBADSLT:57,EDEADLOCK:35,EBFONT:59,ENOSTR:60,ENODATA:61,ETIME:62,ENOSR:63,ENONET:64,ENOPKG:65,EREMOTE:66,ENOLINK:67,EADV:68,ESRMNT:69,ECOMM:70,EPROTO:71,EMULTIHOP:72,EDOTDOT:73,EBADMSG:74,ENOTUNIQ:76,EBADFD:77,EREMCHG:78,ELIBACC:79,ELIBBAD:80,ELIBSCN:81,ELIBMAX:82,ELIBEXEC:83,ENOSYS:38,ENOTEMPTY:39,ENAMETOOLONG:36,ELOOP:40,EOPNOTSUPP:95,EPFNOSUPPORT:96,ECONNRESET:104,ENOBUFS:105,EAFNOSUPPORT:97,EPROTOTYPE:91,ENOTSOCK:88,ENOPROTOOPT:92,ESHUTDOWN:108,ECONNREFUSED:111,EADDRINUSE:98,ECONNABORTED:103,ENETUNREACH:101,ENETDOWN:100,ETIMEDOUT:110,EHOSTDOWN:112,EHOSTUNREACH:113,EINPROGRESS:115,EALREADY:114,EDESTADDRREQ:89,EMSGSIZE:90,EPROTONOSUPPORT:93,ESOCKTNOSUPPORT:94,EADDRNOTAVAIL:99,ENETRESET:102,EISCONN:106,ENOTCONN:107,ETOOMANYREFS:109,EUSERS:87,EDQUOT:122,ESTALE:116,ENOTSUP:95,ENOMEDIUM:123,EILSEQ:84,EOVERFLOW:75,ECANCELED:125,ENOTRECOVERABLE:131,EOWNERDEAD:130,ESTRPIPE:86};
+
+ var ERRNO_MESSAGES={0:"Success",1:"Not super-user",2:"No such file or directory",3:"No such process",4:"Interrupted system call",5:"I/O error",6:"No such device or address",7:"Arg list too long",8:"Exec format error",9:"Bad file number",10:"No children",11:"No more processes",12:"Not enough core",13:"Permission denied",14:"Bad address",15:"Block device required",16:"Mount device busy",17:"File exists",18:"Cross-device link",19:"No such device",20:"Not a directory",21:"Is a directory",22:"Invalid argument",23:"Too many open files in system",24:"Too many open files",25:"Not a typewriter",26:"Text file busy",27:"File too large",28:"No space left on device",29:"Illegal seek",30:"Read only file system",31:"Too many links",32:"Broken pipe",33:"Math arg out of domain of func",34:"Math result not representable",35:"File locking deadlock error",36:"File or path name too long",37:"No record locks available",38:"Function not implemented",39:"Directory not empty",40:"Too many symbolic links",42:"No message of desired type",43:"Identifier removed",44:"Channel number out of range",45:"Level 2 not synchronized",46:"Level 3 halted",47:"Level 3 reset",48:"Link number out of range",49:"Protocol driver not attached",50:"No CSI structure available",51:"Level 2 halted",52:"Invalid exchange",53:"Invalid request descriptor",54:"Exchange full",55:"No anode",56:"Invalid request code",57:"Invalid slot",59:"Bad font file fmt",60:"Device not a stream",61:"No data (for no delay io)",62:"Timer expired",63:"Out of streams resources",64:"Machine is not on the network",65:"Package not installed",66:"The object is remote",67:"The link has been severed",68:"Advertise error",69:"Srmount error",70:"Communication error on send",71:"Protocol error",72:"Multihop attempted",73:"Cross mount point (not really error)",74:"Trying to read unreadable message",75:"Value too large for defined data type",76:"Given log. name not unique",77:"f.d. invalid for this operation",78:"Remote address changed",79:"Can access a needed shared lib",80:"Accessing a corrupted shared lib",81:".lib section in a.out corrupted",82:"Attempting to link in too many libs",83:"Attempting to exec a shared library",84:"Illegal byte sequence",86:"Streams pipe error",87:"Too many users",88:"Socket operation on non-socket",89:"Destination address required",90:"Message too long",91:"Protocol wrong type for socket",92:"Protocol not available",93:"Unknown protocol",94:"Socket type not supported",95:"Not supported",96:"Protocol family not supported",97:"Address family not supported by protocol family",98:"Address already in use",99:"Address not available",100:"Network interface is not configured",101:"Network is unreachable",102:"Connection reset by network",103:"Connection aborted",104:"Connection reset by peer",105:"No buffer space available",106:"Socket is already connected",107:"Socket is not connected",108:"Can't send after socket shutdown",109:"Too many references",110:"Connection timed out",111:"Connection refused",112:"Host is down",113:"Host is unreachable",114:"Socket already connected",115:"Connection already in progress",116:"Stale file handle",122:"Quota exceeded",123:"No medium (in tape drive)",125:"Operation canceled",130:"Previous owner died",131:"State not recoverable"};
+
+
+ var ___errno_state=0;function ___setErrNo(value) {
+ // For convenient setting and returning of errno.
+ HEAP32[((___errno_state)>>2)]=value;
+ return value;
+ }
+
+ var TTY={ttys:[],init:function () {
+ // https://github.com/kripken/emscripten/pull/1555
+ // if (ENVIRONMENT_IS_NODE) {
+ // // currently, FS.init does not distinguish if process.stdin is a file or TTY
+ // // device, it always assumes it's a TTY device. because of this, we're forcing
+ // // process.stdin to UTF8 encoding to at least make stdin reading compatible
+ // // with text files until FS.init can be refactored.
+ // process['stdin']['setEncoding']('utf8');
+ // }
+ },shutdown:function () {
+ // https://github.com/kripken/emscripten/pull/1555
+ // if (ENVIRONMENT_IS_NODE) {
+ // // inolen: any idea as to why node -e 'process.stdin.read()' wouldn't exit immediately (with process.stdin being a tty)?
+ // // isaacs: because now it's reading from the stream, you've expressed interest in it, so that read() kicks off a _read() which creates a ReadReq operation
+ // // inolen: I thought read() in that case was a synchronous operation that just grabbed some amount of buffered data if it exists?
+ // // isaacs: it is. but it also triggers a _read() call, which calls readStart() on the handle
+ // // isaacs: do process.stdin.pause() and i'd think it'd probably close the pending call
+ // process['stdin']['pause']();
+ // }
+ },register:function (dev, ops) {
+ TTY.ttys[dev] = { input: [], output: [], ops: ops };
+ FS.registerDevice(dev, TTY.stream_ops);
+ },stream_ops:{open:function (stream) {
+ var tty = TTY.ttys[stream.node.rdev];
+ if (!tty) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ stream.tty = tty;
+ stream.seekable = false;
+ },close:function (stream) {
+ // flush any pending line data
+ if (stream.tty.output.length) {
+ stream.tty.ops.put_char(stream.tty, 10);
+ }
+ },read:function (stream, buffer, offset, length, pos /* ignored */) {
+ if (!stream.tty || !stream.tty.ops.get_char) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
+ }
+ var bytesRead = 0;
+ for (var i = 0; i < length; i++) {
+ var result;
+ try {
+ result = stream.tty.ops.get_char(stream.tty);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ if (result === undefined && bytesRead === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ if (result === null || result === undefined) break;
+ bytesRead++;
+ buffer[offset+i] = result;
+ }
+ if (bytesRead) {
+ stream.node.timestamp = Date.now();
+ }
+ return bytesRead;
+ },write:function (stream, buffer, offset, length, pos) {
+ if (!stream.tty || !stream.tty.ops.put_char) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
+ }
+ for (var i = 0; i < length; i++) {
+ try {
+ stream.tty.ops.put_char(stream.tty, buffer[offset+i]);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ }
+ if (length) {
+ stream.node.timestamp = Date.now();
+ }
+ return i;
+ }},default_tty_ops:{get_char:function (tty) {
+ if (!tty.input.length) {
+ var result = null;
+ if (ENVIRONMENT_IS_NODE) {
+ result = process['stdin']['read']();
+ if (!result) {
+ if (process['stdin']['_readableState'] && process['stdin']['_readableState']['ended']) {
+ return null; // EOF
+ }
+ return undefined; // no data available
+ }
+ } else if (typeof window != 'undefined' &&
+ typeof window.prompt == 'function') {
+ // Browser.
+ result = window.prompt('Input: '); // returns null on cancel
+ if (result !== null) {
+ result += '\n';
+ }
+ } else if (typeof readline == 'function') {
+ // Command line.
+ result = readline();
+ if (result !== null) {
+ result += '\n';
+ }
+ }
+ if (!result) {
+ return null;
+ }
+ tty.input = intArrayFromString(result, true);
+ }
+ return tty.input.shift();
+ },put_char:function (tty, val) {
+ if (val === null || val === 10) {
+ Module['print'](tty.output.join(''));
+ tty.output = [];
+ } else {
+ tty.output.push(TTY.utf8.processCChar(val));
+ }
+ }},default_tty1_ops:{put_char:function (tty, val) {
+ if (val === null || val === 10) {
+ Module['printErr'](tty.output.join(''));
+ tty.output = [];
+ } else {
+ tty.output.push(TTY.utf8.processCChar(val));
+ }
+ }}};
+
+ var MEMFS={ops_table:null,CONTENT_OWNING:1,CONTENT_FLEXIBLE:2,CONTENT_FIXED:3,mount:function (mount) {
+ return MEMFS.createNode(null, '/', 16384 | 511 /* 0777 */, 0);
+ },createNode:function (parent, name, mode, dev) {
+ if (FS.isBlkdev(mode) || FS.isFIFO(mode)) {
+ // no supported
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (!MEMFS.ops_table) {
+ MEMFS.ops_table = {
+ dir: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr,
+ lookup: MEMFS.node_ops.lookup,
+ mknod: MEMFS.node_ops.mknod,
+ rename: MEMFS.node_ops.rename,
+ unlink: MEMFS.node_ops.unlink,
+ rmdir: MEMFS.node_ops.rmdir,
+ readdir: MEMFS.node_ops.readdir,
+ symlink: MEMFS.node_ops.symlink
+ },
+ stream: {
+ llseek: MEMFS.stream_ops.llseek
+ }
+ },
+ file: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr
+ },
+ stream: {
+ llseek: MEMFS.stream_ops.llseek,
+ read: MEMFS.stream_ops.read,
+ write: MEMFS.stream_ops.write,
+ allocate: MEMFS.stream_ops.allocate,
+ mmap: MEMFS.stream_ops.mmap
+ }
+ },
+ link: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr,
+ readlink: MEMFS.node_ops.readlink
+ },
+ stream: {}
+ },
+ chrdev: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr
+ },
+ stream: FS.chrdev_stream_ops
+ },
+ };
+ }
+ var node = FS.createNode(parent, name, mode, dev);
+ if (FS.isDir(node.mode)) {
+ node.node_ops = MEMFS.ops_table.dir.node;
+ node.stream_ops = MEMFS.ops_table.dir.stream;
+ node.contents = {};
+ } else if (FS.isFile(node.mode)) {
+ node.node_ops = MEMFS.ops_table.file.node;
+ node.stream_ops = MEMFS.ops_table.file.stream;
+ node.contents = [];
+ node.contentMode = MEMFS.CONTENT_FLEXIBLE;
+ } else if (FS.isLink(node.mode)) {
+ node.node_ops = MEMFS.ops_table.link.node;
+ node.stream_ops = MEMFS.ops_table.link.stream;
+ } else if (FS.isChrdev(node.mode)) {
+ node.node_ops = MEMFS.ops_table.chrdev.node;
+ node.stream_ops = MEMFS.ops_table.chrdev.stream;
+ }
+ node.timestamp = Date.now();
+ // add the new node to the parent
+ if (parent) {
+ parent.contents[name] = node;
+ }
+ return node;
+ },ensureFlexible:function (node) {
+ if (node.contentMode !== MEMFS.CONTENT_FLEXIBLE) {
+ var contents = node.contents;
+ node.contents = Array.prototype.slice.call(contents);
+ node.contentMode = MEMFS.CONTENT_FLEXIBLE;
+ }
+ },node_ops:{getattr:function (node) {
+ var attr = {};
+ // device numbers reuse inode numbers.
+ attr.dev = FS.isChrdev(node.mode) ? node.id : 1;
+ attr.ino = node.id;
+ attr.mode = node.mode;
+ attr.nlink = 1;
+ attr.uid = 0;
+ attr.gid = 0;
+ attr.rdev = node.rdev;
+ if (FS.isDir(node.mode)) {
+ attr.size = 4096;
+ } else if (FS.isFile(node.mode)) {
+ attr.size = node.contents.length;
+ } else if (FS.isLink(node.mode)) {
+ attr.size = node.link.length;
+ } else {
+ attr.size = 0;
+ }
+ attr.atime = new Date(node.timestamp);
+ attr.mtime = new Date(node.timestamp);
+ attr.ctime = new Date(node.timestamp);
+ // NOTE: In our implementation, st_blocks = Math.ceil(st_size/st_blksize),
+ // but this is not required by the standard.
+ attr.blksize = 4096;
+ attr.blocks = Math.ceil(attr.size / attr.blksize);
+ return attr;
+ },setattr:function (node, attr) {
+ if (attr.mode !== undefined) {
+ node.mode = attr.mode;
+ }
+ if (attr.timestamp !== undefined) {
+ node.timestamp = attr.timestamp;
+ }
+ if (attr.size !== undefined) {
+ MEMFS.ensureFlexible(node);
+ var contents = node.contents;
+ if (attr.size < contents.length) contents.length = attr.size;
+ else while (attr.size > contents.length) contents.push(0);
+ }
+ },lookup:function (parent, name) {
+ throw FS.genericErrors[ERRNO_CODES.ENOENT];
+ },mknod:function (parent, name, mode, dev) {
+ return MEMFS.createNode(parent, name, mode, dev);
+ },rename:function (old_node, new_dir, new_name) {
+ // if we're overwriting a directory at new_name, make sure it's empty.
+ if (FS.isDir(old_node.mode)) {
+ var new_node;
+ try {
+ new_node = FS.lookupNode(new_dir, new_name);
+ } catch (e) {
+ }
+ if (new_node) {
+ for (var i in new_node.contents) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ }
+ }
+ // do the internal rewiring
+ delete old_node.parent.contents[old_node.name];
+ old_node.name = new_name;
+ new_dir.contents[new_name] = old_node;
+ old_node.parent = new_dir;
+ },unlink:function (parent, name) {
+ delete parent.contents[name];
+ },rmdir:function (parent, name) {
+ var node = FS.lookupNode(parent, name);
+ for (var i in node.contents) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ delete parent.contents[name];
+ },readdir:function (node) {
+ var entries = ['.', '..']
+ for (var key in node.contents) {
+ if (!node.contents.hasOwnProperty(key)) {
+ continue;
+ }
+ entries.push(key);
+ }
+ return entries;
+ },symlink:function (parent, newname, oldpath) {
+ var node = MEMFS.createNode(parent, newname, 511 /* 0777 */ | 40960, 0);
+ node.link = oldpath;
+ return node;
+ },readlink:function (node) {
+ if (!FS.isLink(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ return node.link;
+ }},stream_ops:{read:function (stream, buffer, offset, length, position) {
+ var contents = stream.node.contents;
+ if (position >= contents.length)
+ return 0;
+ var size = Math.min(contents.length - position, length);
+ assert(size >= 0);
+ if (size > 8 && contents.subarray) { // non-trivial, and typed array
+ buffer.set(contents.subarray(position, position + size), offset);
+ } else
+ {
+ for (var i = 0; i < size; i++) {
+ buffer[offset + i] = contents[position + i];
+ }
+ }
+ return size;
+ },write:function (stream, buffer, offset, length, position, canOwn) {
+ var node = stream.node;
+ node.timestamp = Date.now();
+ var contents = node.contents;
+ if (length && contents.length === 0 && position === 0 && buffer.subarray) {
+ // just replace it with the new data
+ if (canOwn && offset === 0) {
+ node.contents = buffer; // this could be a subarray of Emscripten HEAP, or allocated from some other source.
+ node.contentMode = (buffer.buffer === HEAP8.buffer) ? MEMFS.CONTENT_OWNING : MEMFS.CONTENT_FIXED;
+ } else {
+ node.contents = new Uint8Array(buffer.subarray(offset, offset+length));
+ node.contentMode = MEMFS.CONTENT_FIXED;
+ }
+ return length;
+ }
+ MEMFS.ensureFlexible(node);
+ var contents = node.contents;
+ while (contents.length < position) contents.push(0);
+ for (var i = 0; i < length; i++) {
+ contents[position + i] = buffer[offset + i];
+ }
+ return length;
+ },llseek:function (stream, offset, whence) {
+ var position = offset;
+ if (whence === 1) { // SEEK_CUR.
+ position += stream.position;
+ } else if (whence === 2) { // SEEK_END.
+ if (FS.isFile(stream.node.mode)) {
+ position += stream.node.contents.length;
+ }
+ }
+ if (position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ stream.ungotten = [];
+ stream.position = position;
+ return position;
+ },allocate:function (stream, offset, length) {
+ MEMFS.ensureFlexible(stream.node);
+ var contents = stream.node.contents;
+ var limit = offset + length;
+ while (limit > contents.length) contents.push(0);
+ },mmap:function (stream, buffer, offset, length, position, prot, flags) {
+ if (!FS.isFile(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ var ptr;
+ var allocated;
+ var contents = stream.node.contents;
+ // Only make a new copy when MAP_PRIVATE is specified.
+ if ( !(flags & 2) &&
+ (contents.buffer === buffer || contents.buffer === buffer.buffer) ) {
+ // We can't emulate MAP_SHARED when the file is not backed by the buffer
+ // we're mapping to (e.g. the HEAP buffer).
+ allocated = false;
+ ptr = contents.byteOffset;
+ } else {
+ // Try to avoid unnecessary slices.
+ if (position > 0 || position + length < contents.length) {
+ if (contents.subarray) {
+ contents = contents.subarray(position, position + length);
+ } else {
+ contents = Array.prototype.slice.call(contents, position, position + length);
+ }
+ }
+ allocated = true;
+ ptr = _malloc(length);
+ if (!ptr) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOMEM);
+ }
+ buffer.set(contents, ptr);
+ }
+ return { ptr: ptr, allocated: allocated };
+ }}};
+
+ var IDBFS={dbs:{},indexedDB:function () {
+ return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
+ },DB_VERSION:21,DB_STORE_NAME:"FILE_DATA",mount:function (mount) {
+ // reuse all of the core MEMFS functionality
+ return MEMFS.mount.apply(null, arguments);
+ },syncfs:function (mount, populate, callback) {
+ IDBFS.getLocalSet(mount, function(err, local) {
+ if (err) return callback(err);
+
+ IDBFS.getRemoteSet(mount, function(err, remote) {
+ if (err) return callback(err);
+
+ var src = populate ? remote : local;
+ var dst = populate ? local : remote;
+
+ IDBFS.reconcile(src, dst, callback);
+ });
+ });
+ },getDB:function (name, callback) {
+ // check the cache first
+ var db = IDBFS.dbs[name];
+ if (db) {
+ return callback(null, db);
+ }
+
+ var req;
+ try {
+ req = IDBFS.indexedDB().open(name, IDBFS.DB_VERSION);
+ } catch (e) {
+ return callback(e);
+ }
+ req.onupgradeneeded = function(e) {
+ var db = e.target.result;
+ var transaction = e.target.transaction;
+
+ var fileStore;
+
+ if (db.objectStoreNames.contains(IDBFS.DB_STORE_NAME)) {
+ fileStore = transaction.objectStore(IDBFS.DB_STORE_NAME);
+ } else {
+ fileStore = db.createObjectStore(IDBFS.DB_STORE_NAME);
+ }
+
+ fileStore.createIndex('timestamp', 'timestamp', { unique: false });
+ };
+ req.onsuccess = function() {
+ db = req.result;
+
+ // add to the cache
+ IDBFS.dbs[name] = db;
+ callback(null, db);
+ };
+ req.onerror = function() {
+ callback(this.error);
+ };
+ },getLocalSet:function (mount, callback) {
+ var entries = {};
+
+ function isRealDir(p) {
+ return p !== '.' && p !== '..';
+ };
+ function toAbsolute(root) {
+ return function(p) {
+ return PATH.join2(root, p);
+ }
+ };
+
+ var check = FS.readdir(mount.mountpoint).filter(isRealDir).map(toAbsolute(mount.mountpoint));
+
+ while (check.length) {
+ var path = check.pop();
+ var stat;
+
+ try {
+ stat = FS.stat(path);
+ } catch (e) {
+ return callback(e);
+ }
+
+ if (FS.isDir(stat.mode)) {
+ check.push.apply(check, FS.readdir(path).filter(isRealDir).map(toAbsolute(path)));
+ }
+
+ entries[path] = { timestamp: stat.mtime };
+ }
+
+ return callback(null, { type: 'local', entries: entries });
+ },getRemoteSet:function (mount, callback) {
+ var entries = {};
+
+ IDBFS.getDB(mount.mountpoint, function(err, db) {
+ if (err) return callback(err);
+
+ var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readonly');
+ transaction.onerror = function() { callback(this.error); };
+
+ var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
+ var index = store.index('timestamp');
+
+ index.openKeyCursor().onsuccess = function(event) {
+ var cursor = event.target.result;
+
+ if (!cursor) {
+ return callback(null, { type: 'remote', db: db, entries: entries });
+ }
+
+ entries[cursor.primaryKey] = { timestamp: cursor.key };
+
+ cursor.continue();
+ };
+ });
+ },loadLocalEntry:function (path, callback) {
+ var stat, node;
+
+ try {
+ var lookup = FS.lookupPath(path);
+ node = lookup.node;
+ stat = FS.stat(path);
+ } catch (e) {
+ return callback(e);
+ }
+
+ if (FS.isDir(stat.mode)) {
+ return callback(null, { timestamp: stat.mtime, mode: stat.mode });
+ } else if (FS.isFile(stat.mode)) {
+ return callback(null, { timestamp: stat.mtime, mode: stat.mode, contents: node.contents });
+ } else {
+ return callback(new Error('node type not supported'));
+ }
+ },storeLocalEntry:function (path, entry, callback) {
+ try {
+ if (FS.isDir(entry.mode)) {
+ FS.mkdir(path, entry.mode);
+ } else if (FS.isFile(entry.mode)) {
+ FS.writeFile(path, entry.contents, { encoding: 'binary', canOwn: true });
+ } else {
+ return callback(new Error('node type not supported'));
+ }
+
+ FS.utime(path, entry.timestamp, entry.timestamp);
+ } catch (e) {
+ return callback(e);
+ }
+
+ callback(null);
+ },removeLocalEntry:function (path, callback) {
+ try {
+ var lookup = FS.lookupPath(path);
+ var stat = FS.stat(path);
+
+ if (FS.isDir(stat.mode)) {
+ FS.rmdir(path);
+ } else if (FS.isFile(stat.mode)) {
+ FS.unlink(path);
+ }
+ } catch (e) {
+ return callback(e);
+ }
+
+ callback(null);
+ },loadRemoteEntry:function (store, path, callback) {
+ var req = store.get(path);
+ req.onsuccess = function(event) { callback(null, event.target.result); };
+ req.onerror = function() { callback(this.error); };
+ },storeRemoteEntry:function (store, path, entry, callback) {
+ var req = store.put(entry, path);
+ req.onsuccess = function() { callback(null); };
+ req.onerror = function() { callback(this.error); };
+ },removeRemoteEntry:function (store, path, callback) {
+ var req = store.delete(path);
+ req.onsuccess = function() { callback(null); };
+ req.onerror = function() { callback(this.error); };
+ },reconcile:function (src, dst, callback) {
+ var total = 0;
+
+ var create = [];
+ Object.keys(src.entries).forEach(function (key) {
+ var e = src.entries[key];
+ var e2 = dst.entries[key];
+ if (!e2 || e.timestamp > e2.timestamp) {
+ create.push(key);
+ total++;
+ }
+ });
+
+ var remove = [];
+ Object.keys(dst.entries).forEach(function (key) {
+ var e = dst.entries[key];
+ var e2 = src.entries[key];
+ if (!e2) {
+ remove.push(key);
+ total++;
+ }
+ });
+
+ if (!total) {
+ return callback(null);
+ }
+
+ var errored = false;
+ var completed = 0;
+ var db = src.type === 'remote' ? src.db : dst.db;
+ var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readwrite');
+ var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
+
+ function done(err) {
+ if (err) {
+ if (!done.errored) {
+ done.errored = true;
+ return callback(err);
+ }
+ return;
+ }
+ if (++completed >= total) {
+ return callback(null);
+ }
+ };
+
+ transaction.onerror = function() { done(this.error); };
+
+ // sort paths in ascending order so directory entries are created
+ // before the files inside them
+ create.sort().forEach(function (path) {
+ if (dst.type === 'local') {
+ IDBFS.loadRemoteEntry(store, path, function (err, entry) {
+ if (err) return done(err);
+ IDBFS.storeLocalEntry(path, entry, done);
+ });
+ } else {
+ IDBFS.loadLocalEntry(path, function (err, entry) {
+ if (err) return done(err);
+ IDBFS.storeRemoteEntry(store, path, entry, done);
+ });
+ }
+ });
+
+ // sort paths in descending order so files are deleted before their
+ // parent directories
+ remove.sort().reverse().forEach(function(path) {
+ if (dst.type === 'local') {
+ IDBFS.removeLocalEntry(path, done);
+ } else {
+ IDBFS.removeRemoteEntry(store, path, done);
+ }
+ });
+ }};
+
+ var NODEFS={isWindows:false,staticInit:function () {
+ NODEFS.isWindows = !!process.platform.match(/^win/);
+ },mount:function (mount) {
+ assert(ENVIRONMENT_IS_NODE);
+ return NODEFS.createNode(null, '/', NODEFS.getMode(mount.opts.root), 0);
+ },createNode:function (parent, name, mode, dev) {
+ if (!FS.isDir(mode) && !FS.isFile(mode) && !FS.isLink(mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var node = FS.createNode(parent, name, mode);
+ node.node_ops = NODEFS.node_ops;
+ node.stream_ops = NODEFS.stream_ops;
+ return node;
+ },getMode:function (path) {
+ var stat;
+ try {
+ stat = fs.lstatSync(path);
+ if (NODEFS.isWindows) {
+ // On Windows, directories return permission bits 'rw-rw-rw-', even though they have 'rwxrwxrwx', so
+ // propagate write bits to execute bits.
+ stat.mode = stat.mode | ((stat.mode & 146) >> 1);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return stat.mode;
+ },realPath:function (node) {
+ var parts = [];
+ while (node.parent !== node) {
+ parts.push(node.name);
+ node = node.parent;
+ }
+ parts.push(node.mount.opts.root);
+ parts.reverse();
+ return PATH.join.apply(null, parts);
+ },flagsToPermissionStringMap:{0:"r",1:"r+",2:"r+",64:"r",65:"r+",66:"r+",129:"rx+",193:"rx+",514:"w+",577:"w",578:"w+",705:"wx",706:"wx+",1024:"a",1025:"a",1026:"a+",1089:"a",1090:"a+",1153:"ax",1154:"ax+",1217:"ax",1218:"ax+",4096:"rs",4098:"rs+"},flagsToPermissionString:function (flags) {
+ if (flags in NODEFS.flagsToPermissionStringMap) {
+ return NODEFS.flagsToPermissionStringMap[flags];
+ } else {
+ return flags;
+ }
+ },node_ops:{getattr:function (node) {
+ var path = NODEFS.realPath(node);
+ var stat;
+ try {
+ stat = fs.lstatSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ // node.js v0.10.20 doesn't report blksize and blocks on Windows. Fake them with default blksize of 4096.
+ // See http://support.microsoft.com/kb/140365
+ if (NODEFS.isWindows && !stat.blksize) {
+ stat.blksize = 4096;
+ }
+ if (NODEFS.isWindows && !stat.blocks) {
+ stat.blocks = (stat.size+stat.blksize-1)/stat.blksize|0;
+ }
+ return {
+ dev: stat.dev,
+ ino: stat.ino,
+ mode: stat.mode,
+ nlink: stat.nlink,
+ uid: stat.uid,
+ gid: stat.gid,
+ rdev: stat.rdev,
+ size: stat.size,
+ atime: stat.atime,
+ mtime: stat.mtime,
+ ctime: stat.ctime,
+ blksize: stat.blksize,
+ blocks: stat.blocks
+ };
+ },setattr:function (node, attr) {
+ var path = NODEFS.realPath(node);
+ try {
+ if (attr.mode !== undefined) {
+ fs.chmodSync(path, attr.mode);
+ // update the common node structure mode as well
+ node.mode = attr.mode;
+ }
+ if (attr.timestamp !== undefined) {
+ var date = new Date(attr.timestamp);
+ fs.utimesSync(path, date, date);
+ }
+ if (attr.size !== undefined) {
+ fs.truncateSync(path, attr.size);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },lookup:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ var mode = NODEFS.getMode(path);
+ return NODEFS.createNode(parent, name, mode);
+ },mknod:function (parent, name, mode, dev) {
+ var node = NODEFS.createNode(parent, name, mode, dev);
+ // create the backing node for this in the fs root as well
+ var path = NODEFS.realPath(node);
+ try {
+ if (FS.isDir(node.mode)) {
+ fs.mkdirSync(path, node.mode);
+ } else {
+ fs.writeFileSync(path, '', { mode: node.mode });
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return node;
+ },rename:function (oldNode, newDir, newName) {
+ var oldPath = NODEFS.realPath(oldNode);
+ var newPath = PATH.join2(NODEFS.realPath(newDir), newName);
+ try {
+ fs.renameSync(oldPath, newPath);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },unlink:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ try {
+ fs.unlinkSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },rmdir:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ try {
+ fs.rmdirSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },readdir:function (node) {
+ var path = NODEFS.realPath(node);
+ try {
+ return fs.readdirSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },symlink:function (parent, newName, oldPath) {
+ var newPath = PATH.join2(NODEFS.realPath(parent), newName);
+ try {
+ fs.symlinkSync(oldPath, newPath);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },readlink:function (node) {
+ var path = NODEFS.realPath(node);
+ try {
+ return fs.readlinkSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ }},stream_ops:{open:function (stream) {
+ var path = NODEFS.realPath(stream.node);
+ try {
+ if (FS.isFile(stream.node.mode)) {
+ stream.nfd = fs.openSync(path, NODEFS.flagsToPermissionString(stream.flags));
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },close:function (stream) {
+ try {
+ if (FS.isFile(stream.node.mode) && stream.nfd) {
+ fs.closeSync(stream.nfd);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },read:function (stream, buffer, offset, length, position) {
+ // FIXME this is terrible.
+ var nbuffer = new Buffer(length);
+ var res;
+ try {
+ res = fs.readSync(stream.nfd, nbuffer, 0, length, position);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ if (res > 0) {
+ for (var i = 0; i < res; i++) {
+ buffer[offset + i] = nbuffer[i];
+ }
+ }
+ return res;
+ },write:function (stream, buffer, offset, length, position) {
+ // FIXME this is terrible.
+ var nbuffer = new Buffer(buffer.subarray(offset, offset + length));
+ var res;
+ try {
+ res = fs.writeSync(stream.nfd, nbuffer, 0, length, position);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return res;
+ },llseek:function (stream, offset, whence) {
+ var position = offset;
+ if (whence === 1) { // SEEK_CUR.
+ position += stream.position;
+ } else if (whence === 2) { // SEEK_END.
+ if (FS.isFile(stream.node.mode)) {
+ try {
+ var stat = fs.fstatSync(stream.nfd);
+ position += stat.size;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ }
+ }
+
+ if (position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+
+ stream.position = position;
+ return position;
+ }}};
+
+ var _stdin=allocate(1, "i32*", ALLOC_STATIC);
+
+ var _stdout=allocate(1, "i32*", ALLOC_STATIC);
+
+ var _stderr=allocate(1, "i32*", ALLOC_STATIC);
+
+ function _fflush(stream) {
+ // int fflush(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fflush.html
+ // we don't currently perform any user-space buffering of data
+ }var FS={root:null,mounts:[],devices:[null],streams:[],nextInode:1,nameTable:null,currentPath:"/",initialized:false,ignorePermissions:true,ErrnoError:null,genericErrors:{},handleFSError:function (e) {
+ if (!(e instanceof FS.ErrnoError)) throw e + ' : ' + stackTrace();
+ return ___setErrNo(e.errno);
+ },lookupPath:function (path, opts) {
+ path = PATH.resolve(FS.cwd(), path);
+ opts = opts || {};
+
+ var defaults = {
+ follow_mount: true,
+ recurse_count: 0
+ };
+ for (var key in defaults) {
+ if (opts[key] === undefined) {
+ opts[key] = defaults[key];
+ }
+ }
+
+ if (opts.recurse_count > 8) { // max recursive lookup of 8
+ throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
+ }
+
+ // split the path
+ var parts = PATH.normalizeArray(path.split('/').filter(function(p) {
+ return !!p;
+ }), false);
+
+ // start at the root
+ var current = FS.root;
+ var current_path = '/';
+
+ for (var i = 0; i < parts.length; i++) {
+ var islast = (i === parts.length-1);
+ if (islast && opts.parent) {
+ // stop resolving
+ break;
+ }
+
+ current = FS.lookupNode(current, parts[i]);
+ current_path = PATH.join2(current_path, parts[i]);
+
+ // jump to the mount's root node if this is a mountpoint
+ if (FS.isMountpoint(current)) {
+ if (!islast || (islast && opts.follow_mount)) {
+ current = current.mounted.root;
+ }
+ }
+
+ // by default, lookupPath will not follow a symlink if it is the final path component.
+ // setting opts.follow = true will override this behavior.
+ if (!islast || opts.follow) {
+ var count = 0;
+ while (FS.isLink(current.mode)) {
+ var link = FS.readlink(current_path);
+ current_path = PATH.resolve(PATH.dirname(current_path), link);
+
+ var lookup = FS.lookupPath(current_path, { recurse_count: opts.recurse_count });
+ current = lookup.node;
+
+ if (count++ > 40) { // limit max consecutive symlinks to 40 (SYMLOOP_MAX).
+ throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
+ }
+ }
+ }
+ }
+
+ return { path: current_path, node: current };
+ },getPath:function (node) {
+ var path;
+ while (true) {
+ if (FS.isRoot(node)) {
+ var mount = node.mount.mountpoint;
+ if (!path) return mount;
+ return mount[mount.length-1] !== '/' ? mount + '/' + path : mount + path;
+ }
+ path = path ? node.name + '/' + path : node.name;
+ node = node.parent;
+ }
+ },hashName:function (parentid, name) {
+ var hash = 0;
+
+
+ for (var i = 0; i < name.length; i++) {
+ hash = ((hash << 5) - hash + name.charCodeAt(i)) | 0;
+ }
+ return ((parentid + hash) >>> 0) % FS.nameTable.length;
+ },hashAddNode:function (node) {
+ var hash = FS.hashName(node.parent.id, node.name);
+ node.name_next = FS.nameTable[hash];
+ FS.nameTable[hash] = node;
+ },hashRemoveNode:function (node) {
+ var hash = FS.hashName(node.parent.id, node.name);
+ if (FS.nameTable[hash] === node) {
+ FS.nameTable[hash] = node.name_next;
+ } else {
+ var current = FS.nameTable[hash];
+ while (current) {
+ if (current.name_next === node) {
+ current.name_next = node.name_next;
+ break;
+ }
+ current = current.name_next;
+ }
+ }
+ },lookupNode:function (parent, name) {
+ var err = FS.mayLookup(parent);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ var hash = FS.hashName(parent.id, name);
+ for (var node = FS.nameTable[hash]; node; node = node.name_next) {
+ var nodeName = node.name;
+ if (node.parent.id === parent.id && nodeName === name) {
+ return node;
+ }
+ }
+ // if we failed to find it in the cache, call into the VFS
+ return FS.lookup(parent, name);
+ },createNode:function (parent, name, mode, rdev) {
+ if (!FS.FSNode) {
+ FS.FSNode = function(parent, name, mode, rdev) {
+ if (!parent) {
+ parent = this; // root node sets parent to itself
+ }
+ this.parent = parent;
+ this.mount = parent.mount;
+ this.mounted = null;
+ this.id = FS.nextInode++;
+ this.name = name;
+ this.mode = mode;
+ this.node_ops = {};
+ this.stream_ops = {};
+ this.rdev = rdev;
+ };
+
+ FS.FSNode.prototype = {};
+
+ // compatibility
+ var readMode = 292 | 73;
+ var writeMode = 146;
+
+ // NOTE we must use Object.defineProperties instead of individual calls to
+ // Object.defineProperty in order to make closure compiler happy
+ Object.defineProperties(FS.FSNode.prototype, {
+ read: {
+ get: function() { return (this.mode & readMode) === readMode; },
+ set: function(val) { val ? this.mode |= readMode : this.mode &= ~readMode; }
+ },
+ write: {
+ get: function() { return (this.mode & writeMode) === writeMode; },
+ set: function(val) { val ? this.mode |= writeMode : this.mode &= ~writeMode; }
+ },
+ isFolder: {
+ get: function() { return FS.isDir(this.mode); },
+ },
+ isDevice: {
+ get: function() { return FS.isChrdev(this.mode); },
+ },
+ });
+ }
+
+ var node = new FS.FSNode(parent, name, mode, rdev);
+
+ FS.hashAddNode(node);
+
+ return node;
+ },destroyNode:function (node) {
+ FS.hashRemoveNode(node);
+ },isRoot:function (node) {
+ return node === node.parent;
+ },isMountpoint:function (node) {
+ return !!node.mounted;
+ },isFile:function (mode) {
+ return (mode & 61440) === 32768;
+ },isDir:function (mode) {
+ return (mode & 61440) === 16384;
+ },isLink:function (mode) {
+ return (mode & 61440) === 40960;
+ },isChrdev:function (mode) {
+ return (mode & 61440) === 8192;
+ },isBlkdev:function (mode) {
+ return (mode & 61440) === 24576;
+ },isFIFO:function (mode) {
+ return (mode & 61440) === 4096;
+ },isSocket:function (mode) {
+ return (mode & 49152) === 49152;
+ },flagModes:{"r":0,"rs":1052672,"r+":2,"w":577,"wx":705,"xw":705,"w+":578,"wx+":706,"xw+":706,"a":1089,"ax":1217,"xa":1217,"a+":1090,"ax+":1218,"xa+":1218},modeStringToFlags:function (str) {
+ var flags = FS.flagModes[str];
+ if (typeof flags === 'undefined') {
+ throw new Error('Unknown file open mode: ' + str);
+ }
+ return flags;
+ },flagsToPermissionString:function (flag) {
+ var accmode = flag & 2097155;
+ var perms = ['r', 'w', 'rw'][accmode];
+ if ((flag & 512)) {
+ perms += 'w';
+ }
+ return perms;
+ },nodePermissions:function (node, perms) {
+ if (FS.ignorePermissions) {
+ return 0;
+ }
+ // return 0 if any user, group or owner bits are set.
+ if (perms.indexOf('r') !== -1 && !(node.mode & 292)) {
+ return ERRNO_CODES.EACCES;
+ } else if (perms.indexOf('w') !== -1 && !(node.mode & 146)) {
+ return ERRNO_CODES.EACCES;
+ } else if (perms.indexOf('x') !== -1 && !(node.mode & 73)) {
+ return ERRNO_CODES.EACCES;
+ }
+ return 0;
+ },mayLookup:function (dir) {
+ return FS.nodePermissions(dir, 'x');
+ },mayCreate:function (dir, name) {
+ try {
+ var node = FS.lookupNode(dir, name);
+ return ERRNO_CODES.EEXIST;
+ } catch (e) {
+ }
+ return FS.nodePermissions(dir, 'wx');
+ },mayDelete:function (dir, name, isdir) {
+ var node;
+ try {
+ node = FS.lookupNode(dir, name);
+ } catch (e) {
+ return e.errno;
+ }
+ var err = FS.nodePermissions(dir, 'wx');
+ if (err) {
+ return err;
+ }
+ if (isdir) {
+ if (!FS.isDir(node.mode)) {
+ return ERRNO_CODES.ENOTDIR;
+ }
+ if (FS.isRoot(node) || FS.getPath(node) === FS.cwd()) {
+ return ERRNO_CODES.EBUSY;
+ }
+ } else {
+ if (FS.isDir(node.mode)) {
+ return ERRNO_CODES.EISDIR;
+ }
+ }
+ return 0;
+ },mayOpen:function (node, flags) {
+ if (!node) {
+ return ERRNO_CODES.ENOENT;
+ }
+ if (FS.isLink(node.mode)) {
+ return ERRNO_CODES.ELOOP;
+ } else if (FS.isDir(node.mode)) {
+ if ((flags & 2097155) !== 0 || // opening for write
+ (flags & 512)) {
+ return ERRNO_CODES.EISDIR;
+ }
+ }
+ return FS.nodePermissions(node, FS.flagsToPermissionString(flags));
+ },MAX_OPEN_FDS:4096,nextfd:function (fd_start, fd_end) {
+ fd_start = fd_start || 0;
+ fd_end = fd_end || FS.MAX_OPEN_FDS;
+ for (var fd = fd_start; fd <= fd_end; fd++) {
+ if (!FS.streams[fd]) {
+ return fd;
+ }
+ }
+ throw new FS.ErrnoError(ERRNO_CODES.EMFILE);
+ },getStream:function (fd) {
+ return FS.streams[fd];
+ },createStream:function (stream, fd_start, fd_end) {
+ if (!FS.FSStream) {
+ FS.FSStream = function(){};
+ FS.FSStream.prototype = {};
+ // compatibility
+ Object.defineProperties(FS.FSStream.prototype, {
+ object: {
+ get: function() { return this.node; },
+ set: function(val) { this.node = val; }
+ },
+ isRead: {
+ get: function() { return (this.flags & 2097155) !== 1; }
+ },
+ isWrite: {
+ get: function() { return (this.flags & 2097155) !== 0; }
+ },
+ isAppend: {
+ get: function() { return (this.flags & 1024); }
+ }
+ });
+ }
+ if (0) {
+ // reuse the object
+ stream.__proto__ = FS.FSStream.prototype;
+ } else {
+ var newStream = new FS.FSStream();
+ for (var p in stream) {
+ newStream[p] = stream[p];
+ }
+ stream = newStream;
+ }
+ var fd = FS.nextfd(fd_start, fd_end);
+ stream.fd = fd;
+ FS.streams[fd] = stream;
+ return stream;
+ },closeStream:function (fd) {
+ FS.streams[fd] = null;
+ },getStreamFromPtr:function (ptr) {
+ return FS.streams[ptr - 1];
+ },getPtrForStream:function (stream) {
+ return stream ? stream.fd + 1 : 0;
+ },chrdev_stream_ops:{open:function (stream) {
+ var device = FS.getDevice(stream.node.rdev);
+ // override node's stream ops with the device's
+ stream.stream_ops = device.stream_ops;
+ // forward the open call
+ if (stream.stream_ops.open) {
+ stream.stream_ops.open(stream);
+ }
+ },llseek:function () {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }},major:function (dev) {
+ return ((dev) >> 8);
+ },minor:function (dev) {
+ return ((dev) & 0xff);
+ },makedev:function (ma, mi) {
+ return ((ma) << 8 | (mi));
+ },registerDevice:function (dev, ops) {
+ FS.devices[dev] = { stream_ops: ops };
+ },getDevice:function (dev) {
+ return FS.devices[dev];
+ },getMounts:function (mount) {
+ var mounts = [];
+ var check = [mount];
+
+ while (check.length) {
+ var m = check.pop();
+
+ mounts.push(m);
+
+ check.push.apply(check, m.mounts);
+ }
+
+ return mounts;
+ },syncfs:function (populate, callback) {
+ if (typeof(populate) === 'function') {
+ callback = populate;
+ populate = false;
+ }
+
+ var mounts = FS.getMounts(FS.root.mount);
+ var completed = 0;
+
+ function done(err) {
+ if (err) {
+ if (!done.errored) {
+ done.errored = true;
+ return callback(err);
+ }
+ return;
+ }
+ if (++completed >= mounts.length) {
+ callback(null);
+ }
+ };
+
+ // sync all mounts
+ mounts.forEach(function (mount) {
+ if (!mount.type.syncfs) {
+ return done(null);
+ }
+ mount.type.syncfs(mount, populate, done);
+ });
+ },mount:function (type, opts, mountpoint) {
+ var root = mountpoint === '/';
+ var pseudo = !mountpoint;
+ var node;
+
+ if (root && FS.root) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ } else if (!root && !pseudo) {
+ var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
+
+ mountpoint = lookup.path; // use the absolute path
+ node = lookup.node;
+
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+
+ if (!FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ }
+
+ var mount = {
+ type: type,
+ opts: opts,
+ mountpoint: mountpoint,
+ mounts: []
+ };
+
+ // create a root node for the fs
+ var mountRoot = type.mount(mount);
+ mountRoot.mount = mount;
+ mount.root = mountRoot;
+
+ if (root) {
+ FS.root = mountRoot;
+ } else if (node) {
+ // set as a mountpoint
+ node.mounted = mount;
+
+ // add the new mount to the current mount's children
+ if (node.mount) {
+ node.mount.mounts.push(mount);
+ }
+ }
+
+ return mountRoot;
+ },unmount:function (mountpoint) {
+ var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
+
+ if (!FS.isMountpoint(lookup.node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+
+ // destroy the nodes for this mount, and all its child mounts
+ var node = lookup.node;
+ var mount = node.mounted;
+ var mounts = FS.getMounts(mount);
+
+ Object.keys(FS.nameTable).forEach(function (hash) {
+ var current = FS.nameTable[hash];
+
+ while (current) {
+ var next = current.name_next;
+
+ if (mounts.indexOf(current.mount) !== -1) {
+ FS.destroyNode(current);
+ }
+
+ current = next;
+ }
+ });
+
+ // no longer a mountpoint
+ node.mounted = null;
+
+ // remove this mount from the child mounts
+ var idx = node.mount.mounts.indexOf(mount);
+ assert(idx !== -1);
+ node.mount.mounts.splice(idx, 1);
+ },lookup:function (parent, name) {
+ return parent.node_ops.lookup(parent, name);
+ },mknod:function (path, mode, dev) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var err = FS.mayCreate(parent, name);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.mknod) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return parent.node_ops.mknod(parent, name, mode, dev);
+ },create:function (path, mode) {
+ mode = mode !== undefined ? mode : 438 /* 0666 */;
+ mode &= 4095;
+ mode |= 32768;
+ return FS.mknod(path, mode, 0);
+ },mkdir:function (path, mode) {
+ mode = mode !== undefined ? mode : 511 /* 0777 */;
+ mode &= 511 | 512;
+ mode |= 16384;
+ return FS.mknod(path, mode, 0);
+ },mkdev:function (path, mode, dev) {
+ if (typeof(dev) === 'undefined') {
+ dev = mode;
+ mode = 438 /* 0666 */;
+ }
+ mode |= 8192;
+ return FS.mknod(path, mode, dev);
+ },symlink:function (oldpath, newpath) {
+ var lookup = FS.lookupPath(newpath, { parent: true });
+ var parent = lookup.node;
+ var newname = PATH.basename(newpath);
+ var err = FS.mayCreate(parent, newname);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.symlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return parent.node_ops.symlink(parent, newname, oldpath);
+ },rename:function (old_path, new_path) {
+ var old_dirname = PATH.dirname(old_path);
+ var new_dirname = PATH.dirname(new_path);
+ var old_name = PATH.basename(old_path);
+ var new_name = PATH.basename(new_path);
+ // parents must exist
+ var lookup, old_dir, new_dir;
+ try {
+ lookup = FS.lookupPath(old_path, { parent: true });
+ old_dir = lookup.node;
+ lookup = FS.lookupPath(new_path, { parent: true });
+ new_dir = lookup.node;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ // need to be part of the same mount
+ if (old_dir.mount !== new_dir.mount) {
+ throw new FS.ErrnoError(ERRNO_CODES.EXDEV);
+ }
+ // source must exist
+ var old_node = FS.lookupNode(old_dir, old_name);
+ // old path should not be an ancestor of the new path
+ var relative = PATH.relative(old_path, new_dirname);
+ if (relative.charAt(0) !== '.') {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ // new path should not be an ancestor of the old path
+ relative = PATH.relative(new_path, old_dirname);
+ if (relative.charAt(0) !== '.') {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ // see if the new path already exists
+ var new_node;
+ try {
+ new_node = FS.lookupNode(new_dir, new_name);
+ } catch (e) {
+ // not fatal
+ }
+ // early out if nothing needs to change
+ if (old_node === new_node) {
+ return;
+ }
+ // we'll need to delete the old entry
+ var isdir = FS.isDir(old_node.mode);
+ var err = FS.mayDelete(old_dir, old_name, isdir);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ // need delete permissions if we'll be overwriting.
+ // need create permissions if new doesn't already exist.
+ err = new_node ?
+ FS.mayDelete(new_dir, new_name, isdir) :
+ FS.mayCreate(new_dir, new_name);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!old_dir.node_ops.rename) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(old_node) || (new_node && FS.isMountpoint(new_node))) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ // if we are going to change the parent, check write permissions
+ if (new_dir !== old_dir) {
+ err = FS.nodePermissions(old_dir, 'w');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ }
+ // remove the node from the lookup hash
+ FS.hashRemoveNode(old_node);
+ // do the underlying fs rename
+ try {
+ old_dir.node_ops.rename(old_node, new_dir, new_name);
+ } catch (e) {
+ throw e;
+ } finally {
+ // add the node back to the hash (in case node_ops.rename
+ // changed its name)
+ FS.hashAddNode(old_node);
+ }
+ },rmdir:function (path) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var node = FS.lookupNode(parent, name);
+ var err = FS.mayDelete(parent, name, true);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.rmdir) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ parent.node_ops.rmdir(parent, name);
+ FS.destroyNode(node);
+ },readdir:function (path) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ var node = lookup.node;
+ if (!node.node_ops.readdir) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ return node.node_ops.readdir(node);
+ },unlink:function (path) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var node = FS.lookupNode(parent, name);
+ var err = FS.mayDelete(parent, name, false);
+ if (err) {
+ // POSIX says unlink should set EPERM, not EISDIR
+ if (err === ERRNO_CODES.EISDIR) err = ERRNO_CODES.EPERM;
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.unlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ parent.node_ops.unlink(parent, name);
+ FS.destroyNode(node);
+ },readlink:function (path) {
+ var lookup = FS.lookupPath(path);
+ var link = lookup.node;
+ if (!link.node_ops.readlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ return link.node_ops.readlink(link);
+ },stat:function (path, dontFollow) {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ var node = lookup.node;
+ if (!node.node_ops.getattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return node.node_ops.getattr(node);
+ },lstat:function (path) {
+ return FS.stat(path, true);
+ },chmod:function (path, mode, dontFollow) {
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ node.node_ops.setattr(node, {
+ mode: (mode & 4095) | (node.mode & ~4095),
+ timestamp: Date.now()
+ });
+ },lchmod:function (path, mode) {
+ FS.chmod(path, mode, true);
+ },fchmod:function (fd, mode) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ FS.chmod(stream.node, mode);
+ },chown:function (path, uid, gid, dontFollow) {
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ node.node_ops.setattr(node, {
+ timestamp: Date.now()
+ // we ignore the uid / gid for now
+ });
+ },lchown:function (path, uid, gid) {
+ FS.chown(path, uid, gid, true);
+ },fchown:function (fd, uid, gid) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ FS.chown(stream.node, uid, gid);
+ },truncate:function (path, len) {
+ if (len < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: true });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!FS.isFile(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var err = FS.nodePermissions(node, 'w');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ node.node_ops.setattr(node, {
+ size: len,
+ timestamp: Date.now()
+ });
+ },ftruncate:function (fd, len) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ FS.truncate(stream.node, len);
+ },utime:function (path, atime, mtime) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ var node = lookup.node;
+ node.node_ops.setattr(node, {
+ timestamp: Math.max(atime, mtime)
+ });
+ },open:function (path, flags, mode, fd_start, fd_end) {
+ flags = typeof flags === 'string' ? FS.modeStringToFlags(flags) : flags;
+ mode = typeof mode === 'undefined' ? 438 /* 0666 */ : mode;
+ if ((flags & 64)) {
+ mode = (mode & 4095) | 32768;
+ } else {
+ mode = 0;
+ }
+ var node;
+ if (typeof path === 'object') {
+ node = path;
+ } else {
+ path = PATH.normalize(path);
+ try {
+ var lookup = FS.lookupPath(path, {
+ follow: !(flags & 131072)
+ });
+ node = lookup.node;
+ } catch (e) {
+ // ignore
+ }
+ }
+ // perhaps we need to create the node
+ if ((flags & 64)) {
+ if (node) {
+ // if O_CREAT and O_EXCL are set, error out if the node already exists
+ if ((flags & 128)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EEXIST);
+ }
+ } else {
+ // node doesn't exist, try to create it
+ node = FS.mknod(path, mode, 0);
+ }
+ }
+ if (!node) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
+ }
+ // can't truncate a device
+ if (FS.isChrdev(node.mode)) {
+ flags &= ~512;
+ }
+ // check permissions
+ var err = FS.mayOpen(node, flags);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ // do truncation if necessary
+ if ((flags & 512)) {
+ FS.truncate(node, 0);
+ }
+ // we've already handled these, don't pass down to the underlying vfs
+ flags &= ~(128 | 512);
+
+ // register the stream with the filesystem
+ var stream = FS.createStream({
+ node: node,
+ path: FS.getPath(node), // we want the absolute path to the node
+ flags: flags,
+ seekable: true,
+ position: 0,
+ stream_ops: node.stream_ops,
+ // used by the file family libc calls (fopen, fwrite, ferror, etc.)
+ ungotten: [],
+ error: false
+ }, fd_start, fd_end);
+ // call the new stream's open function
+ if (stream.stream_ops.open) {
+ stream.stream_ops.open(stream);
+ }
+ if (Module['logReadFiles'] && !(flags & 1)) {
+ if (!FS.readFiles) FS.readFiles = {};
+ if (!(path in FS.readFiles)) {
+ FS.readFiles[path] = 1;
+ Module['printErr']('read file: ' + path);
+ }
+ }
+ return stream;
+ },close:function (stream) {
+ try {
+ if (stream.stream_ops.close) {
+ stream.stream_ops.close(stream);
+ }
+ } catch (e) {
+ throw e;
+ } finally {
+ FS.closeStream(stream.fd);
+ }
+ },llseek:function (stream, offset, whence) {
+ if (!stream.seekable || !stream.stream_ops.llseek) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ return stream.stream_ops.llseek(stream, offset, whence);
+ },read:function (stream, buffer, offset, length, position) {
+ if (length < 0 || position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 1) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (FS.isDir(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!stream.stream_ops.read) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var seeking = true;
+ if (typeof position === 'undefined') {
+ position = stream.position;
+ seeking = false;
+ } else if (!stream.seekable) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ var bytesRead = stream.stream_ops.read(stream, buffer, offset, length, position);
+ if (!seeking) stream.position += bytesRead;
+ return bytesRead;
+ },write:function (stream, buffer, offset, length, position, canOwn) {
+ if (length < 0 || position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (FS.isDir(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!stream.stream_ops.write) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var seeking = true;
+ if (typeof position === 'undefined') {
+ position = stream.position;
+ seeking = false;
+ } else if (!stream.seekable) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ if (stream.flags & 1024) {
+ // seek to the end before writing in append mode
+ FS.llseek(stream, 0, 2);
+ }
+ var bytesWritten = stream.stream_ops.write(stream, buffer, offset, length, position, canOwn);
+ if (!seeking) stream.position += bytesWritten;
+ return bytesWritten;
+ },allocate:function (stream, offset, length) {
+ if (offset < 0 || length <= 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (!FS.isFile(stream.node.mode) && !FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ if (!stream.stream_ops.allocate) {
+ throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
+ }
+ stream.stream_ops.allocate(stream, offset, length);
+ },mmap:function (stream, buffer, offset, length, position, prot, flags) {
+ // TODO if PROT is PROT_WRITE, make sure we have write access
+ if ((stream.flags & 2097155) === 1) {
+ throw new FS.ErrnoError(ERRNO_CODES.EACCES);
+ }
+ if (!stream.stream_ops.mmap) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ return stream.stream_ops.mmap(stream, buffer, offset, length, position, prot, flags);
+ },ioctl:function (stream, cmd, arg) {
+ if (!stream.stream_ops.ioctl) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTTY);
+ }
+ return stream.stream_ops.ioctl(stream, cmd, arg);
+ },readFile:function (path, opts) {
+ opts = opts || {};
+ opts.flags = opts.flags || 'r';
+ opts.encoding = opts.encoding || 'binary';
+ if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
+ throw new Error('Invalid encoding type "' + opts.encoding + '"');
+ }
+ var ret;
+ var stream = FS.open(path, opts.flags);
+ var stat = FS.stat(path);
+ var length = stat.size;
+ var buf = new Uint8Array(length);
+ FS.read(stream, buf, 0, length, 0);
+ if (opts.encoding === 'utf8') {
+ ret = '';
+ var utf8 = new Runtime.UTF8Processor();
+ for (var i = 0; i < length; i++) {
+ ret += utf8.processCChar(buf[i]);
+ }
+ } else if (opts.encoding === 'binary') {
+ ret = buf;
+ }
+ FS.close(stream);
+ return ret;
+ },writeFile:function (path, data, opts) {
+ opts = opts || {};
+ opts.flags = opts.flags || 'w';
+ opts.encoding = opts.encoding || 'utf8';
+ if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
+ throw new Error('Invalid encoding type "' + opts.encoding + '"');
+ }
+ var stream = FS.open(path, opts.flags, opts.mode);
+ if (opts.encoding === 'utf8') {
+ var utf8 = new Runtime.UTF8Processor();
+ var buf = new Uint8Array(utf8.processJSString(data));
+ FS.write(stream, buf, 0, buf.length, 0, opts.canOwn);
+ } else if (opts.encoding === 'binary') {
+ FS.write(stream, data, 0, data.length, 0, opts.canOwn);
+ }
+ FS.close(stream);
+ },cwd:function () {
+ return FS.currentPath;
+ },chdir:function (path) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ if (!FS.isDir(lookup.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ var err = FS.nodePermissions(lookup.node, 'x');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ FS.currentPath = lookup.path;
+ },createDefaultDirectories:function () {
+ FS.mkdir('/tmp');
+ },createDefaultDevices:function () {
+ // create /dev
+ FS.mkdir('/dev');
+ // setup /dev/null
+ FS.registerDevice(FS.makedev(1, 3), {
+ read: function() { return 0; },
+ write: function() { return 0; }
+ });
+ FS.mkdev('/dev/null', FS.makedev(1, 3));
+ // setup /dev/tty and /dev/tty1
+ // stderr needs to print output using Module['printErr']
+ // so we register a second tty just for it.
+ TTY.register(FS.makedev(5, 0), TTY.default_tty_ops);
+ TTY.register(FS.makedev(6, 0), TTY.default_tty1_ops);
+ FS.mkdev('/dev/tty', FS.makedev(5, 0));
+ FS.mkdev('/dev/tty1', FS.makedev(6, 0));
+ // we're not going to emulate the actual shm device,
+ // just create the tmp dirs that reside in it commonly
+ FS.mkdir('/dev/shm');
+ FS.mkdir('/dev/shm/tmp');
+ },createStandardStreams:function () {
+ // TODO deprecate the old functionality of a single
+ // input / output callback and that utilizes FS.createDevice
+ // and instead require a unique set of stream ops
+
+ // by default, we symlink the standard streams to the
+ // default tty devices. however, if the standard streams
+ // have been overwritten we create a unique device for
+ // them instead.
+ if (Module['stdin']) {
+ FS.createDevice('/dev', 'stdin', Module['stdin']);
+ } else {
+ FS.symlink('/dev/tty', '/dev/stdin');
+ }
+ if (Module['stdout']) {
+ FS.createDevice('/dev', 'stdout', null, Module['stdout']);
+ } else {
+ FS.symlink('/dev/tty', '/dev/stdout');
+ }
+ if (Module['stderr']) {
+ FS.createDevice('/dev', 'stderr', null, Module['stderr']);
+ } else {
+ FS.symlink('/dev/tty1', '/dev/stderr');
+ }
+
+ // open default streams for the stdin, stdout and stderr devices
+ var stdin = FS.open('/dev/stdin', 'r');
+ HEAP32[((_stdin)>>2)]=FS.getPtrForStream(stdin);
+ assert(stdin.fd === 0, 'invalid handle for stdin (' + stdin.fd + ')');
+
+ var stdout = FS.open('/dev/stdout', 'w');
+ HEAP32[((_stdout)>>2)]=FS.getPtrForStream(stdout);
+ assert(stdout.fd === 1, 'invalid handle for stdout (' + stdout.fd + ')');
+
+ var stderr = FS.open('/dev/stderr', 'w');
+ HEAP32[((_stderr)>>2)]=FS.getPtrForStream(stderr);
+ assert(stderr.fd === 2, 'invalid handle for stderr (' + stderr.fd + ')');
+ },ensureErrnoError:function () {
+ if (FS.ErrnoError) return;
+ FS.ErrnoError = function ErrnoError(errno) {
+ this.errno = errno;
+ for (var key in ERRNO_CODES) {
+ if (ERRNO_CODES[key] === errno) {
+ this.code = key;
+ break;
+ }
+ }
+ this.message = ERRNO_MESSAGES[errno];
+ };
+ FS.ErrnoError.prototype = new Error();
+ FS.ErrnoError.prototype.constructor = FS.ErrnoError;
+ // Some errors may happen quite a bit, to avoid overhead we reuse them (and suffer a lack of stack info)
+ [ERRNO_CODES.ENOENT].forEach(function(code) {
+ FS.genericErrors[code] = new FS.ErrnoError(code);
+ FS.genericErrors[code].stack = '<generic error, no stack>';
+ });
+ },staticInit:function () {
+ FS.ensureErrnoError();
+
+ FS.nameTable = new Array(4096);
+
+ FS.mount(MEMFS, {}, '/');
+
+ FS.createDefaultDirectories();
+ FS.createDefaultDevices();
+ },init:function (input, output, error) {
+ assert(!FS.init.initialized, 'FS.init was previously called. If you want to initialize later with custom parameters, remove any earlier calls (note that one is automatically added to the generated code)');
+ FS.init.initialized = true;
+
+ FS.ensureErrnoError();
+
+ // Allow Module.stdin etc. to provide defaults, if none explicitly passed to us here
+ Module['stdin'] = input || Module['stdin'];
+ Module['stdout'] = output || Module['stdout'];
+ Module['stderr'] = error || Module['stderr'];
+
+ FS.createStandardStreams();
+ },quit:function () {
+ FS.init.initialized = false;
+ for (var i = 0; i < FS.streams.length; i++) {
+ var stream = FS.streams[i];
+ if (!stream) {
+ continue;
+ }
+ FS.close(stream);
+ }
+ },getMode:function (canRead, canWrite) {
+ var mode = 0;
+ if (canRead) mode |= 292 | 73;
+ if (canWrite) mode |= 146;
+ return mode;
+ },joinPath:function (parts, forceRelative) {
+ var path = PATH.join.apply(null, parts);
+ if (forceRelative && path[0] == '/') path = path.substr(1);
+ return path;
+ },absolutePath:function (relative, base) {
+ return PATH.resolve(base, relative);
+ },standardizePath:function (path) {
+ return PATH.normalize(path);
+ },findObject:function (path, dontResolveLastLink) {
+ var ret = FS.analyzePath(path, dontResolveLastLink);
+ if (ret.exists) {
+ return ret.object;
+ } else {
+ ___setErrNo(ret.error);
+ return null;
+ }
+ },analyzePath:function (path, dontResolveLastLink) {
+ // operate from within the context of the symlink's target
+ try {
+ var lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
+ path = lookup.path;
+ } catch (e) {
+ }
+ var ret = {
+ isRoot: false, exists: false, error: 0, name: null, path: null, object: null,
+ parentExists: false, parentPath: null, parentObject: null
+ };
+ try {
+ var lookup = FS.lookupPath(path, { parent: true });
+ ret.parentExists = true;
+ ret.parentPath = lookup.path;
+ ret.parentObject = lookup.node;
+ ret.name = PATH.basename(path);
+ lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
+ ret.exists = true;
+ ret.path = lookup.path;
+ ret.object = lookup.node;
+ ret.name = lookup.node.name;
+ ret.isRoot = lookup.path === '/';
+ } catch (e) {
+ ret.error = e.errno;
+ };
+ return ret;
+ },createFolder:function (parent, name, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(canRead, canWrite);
+ return FS.mkdir(path, mode);
+ },createPath:function (parent, path, canRead, canWrite) {
+ parent = typeof parent === 'string' ? parent : FS.getPath(parent);
+ var parts = path.split('/').reverse();
+ while (parts.length) {
+ var part = parts.pop();
+ if (!part) continue;
+ var current = PATH.join2(parent, part);
+ try {
+ FS.mkdir(current);
+ } catch (e) {
+ // ignore EEXIST
+ }
+ parent = current;
+ }
+ return current;
+ },createFile:function (parent, name, properties, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(canRead, canWrite);
+ return FS.create(path, mode);
+ },createDataFile:function (parent, name, data, canRead, canWrite, canOwn) {
+ var path = name ? PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name) : parent;
+ var mode = FS.getMode(canRead, canWrite);
+ var node = FS.create(path, mode);
+ if (data) {
+ if (typeof data === 'string') {
+ var arr = new Array(data.length);
+ for (var i = 0, len = data.length; i < len; ++i) arr[i] = data.charCodeAt(i);
+ data = arr;
+ }
+ // make sure we can write to the file
+ FS.chmod(node, mode | 146);
+ var stream = FS.open(node, 'w');
+ FS.write(stream, data, 0, data.length, 0, canOwn);
+ FS.close(stream);
+ FS.chmod(node, mode);
+ }
+ return node;
+ },createDevice:function (parent, name, input, output) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(!!input, !!output);
+ if (!FS.createDevice.major) FS.createDevice.major = 64;
+ var dev = FS.makedev(FS.createDevice.major++, 0);
+ // Create a fake device that a set of stream ops to emulate
+ // the old behavior.
+ FS.registerDevice(dev, {
+ open: function(stream) {
+ stream.seekable = false;
+ },
+ close: function(stream) {
+ // flush any pending line data
+ if (output && output.buffer && output.buffer.length) {
+ output(10);
+ }
+ },
+ read: function(stream, buffer, offset, length, pos /* ignored */) {
+ var bytesRead = 0;
+ for (var i = 0; i < length; i++) {
+ var result;
+ try {
+ result = input();
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ if (result === undefined && bytesRead === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ if (result === null || result === undefined) break;
+ bytesRead++;
+ buffer[offset+i] = result;
+ }
+ if (bytesRead) {
+ stream.node.timestamp = Date.now();
+ }
+ return bytesRead;
+ },
+ write: function(stream, buffer, offset, length, pos) {
+ for (var i = 0; i < length; i++) {
+ try {
+ output(buffer[offset+i]);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ }
+ if (length) {
+ stream.node.timestamp = Date.now();
+ }
+ return i;
+ }
+ });
+ return FS.mkdev(path, mode, dev);
+ },createLink:function (parent, name, target, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ return FS.symlink(target, path);
+ },forceLoadFile:function (obj) {
+ if (obj.isDevice || obj.isFolder || obj.link || obj.contents) return true;
+ var success = true;
+ if (typeof XMLHttpRequest !== 'undefined') {
+ throw new Error("Lazy loading should have been performed (contents set) in createLazyFile, but it was not. Lazy loading only works in web workers. Use --embed-file or --preload-file in emcc on the main thread.");
+ } else if (Module['read']) {
+ // Command-line.
+ try {
+ // WARNING: Can't read binary files in V8's d8 or tracemonkey's js, as
+ // read() will try to parse UTF8.
+ obj.contents = intArrayFromString(Module['read'](obj.url), true);
+ } catch (e) {
+ success = false;
+ }
+ } else {
+ throw new Error('Cannot load without read() or XMLHttpRequest.');
+ }
+ if (!success) ___setErrNo(ERRNO_CODES.EIO);
+ return success;
+ },createLazyFile:function (parent, name, url, canRead, canWrite) {
+ // Lazy chunked Uint8Array (implements get and length from Uint8Array). Actual getting is abstracted away for eventual reuse.
+ function LazyUint8Array() {
+ this.lengthKnown = false;
+ this.chunks = []; // Loaded chunks. Index is the chunk number
+ }
+ LazyUint8Array.prototype.get = function LazyUint8Array_get(idx) {
+ if (idx > this.length-1 || idx < 0) {
+ return undefined;
+ }
+ var chunkOffset = idx % this.chunkSize;
+ var chunkNum = Math.floor(idx / this.chunkSize);
+ return this.getter(chunkNum)[chunkOffset];
+ }
+ LazyUint8Array.prototype.setDataGetter = function LazyUint8Array_setDataGetter(getter) {
+ this.getter = getter;
+ }
+ LazyUint8Array.prototype.cacheLength = function LazyUint8Array_cacheLength() {
+ // Find length
+ var xhr = new XMLHttpRequest();
+ xhr.open('HEAD', url, false);
+ xhr.send(null);
+ if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
+ var datalength = Number(xhr.getResponseHeader("Content-length"));
+ var header;
+ var hasByteServing = (header = xhr.getResponseHeader("Accept-Ranges")) && header === "bytes";
+ var chunkSize = 1024*1024; // Chunk size in bytes
+
+ if (!hasByteServing) chunkSize = datalength;
+
+ // Function to get a range from the remote URL.
+ var doXHR = (function(from, to) {
+ if (from > to) throw new Error("invalid range (" + from + ", " + to + ") or no bytes requested!");
+ if (to > datalength-1) throw new Error("only " + datalength + " bytes available! programmer error!");
+
+ // TODO: Use mozResponseArrayBuffer, responseStream, etc. if available.
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, false);
+ if (datalength !== chunkSize) xhr.setRequestHeader("Range", "bytes=" + from + "-" + to);
+
+ // Some hints to the browser that we want binary data.
+ if (typeof Uint8Array != 'undefined') xhr.responseType = 'arraybuffer';
+ if (xhr.overrideMimeType) {
+ xhr.overrideMimeType('text/plain; charset=x-user-defined');
+ }
+
+ xhr.send(null);
+ if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
+ if (xhr.response !== undefined) {
+ return new Uint8Array(xhr.response || []);
+ } else {
+ return intArrayFromString(xhr.responseText || '', true);
+ }
+ });
+ var lazyArray = this;
+ lazyArray.setDataGetter(function(chunkNum) {
+ var start = chunkNum * chunkSize;
+ var end = (chunkNum+1) * chunkSize - 1; // including this byte
+ end = Math.min(end, datalength-1); // if datalength-1 is selected, this is the last block
+ if (typeof(lazyArray.chunks[chunkNum]) === "undefined") {
+ lazyArray.chunks[chunkNum] = doXHR(start, end);
+ }
+ if (typeof(lazyArray.chunks[chunkNum]) === "undefined") throw new Error("doXHR failed!");
+ return lazyArray.chunks[chunkNum];
+ });
+
+ this._length = datalength;
+ this._chunkSize = chunkSize;
+ this.lengthKnown = true;
+ }
+ if (typeof XMLHttpRequest !== 'undefined') {
+ if (!ENVIRONMENT_IS_WORKER) throw 'Cannot do synchronous binary XHRs outside webworkers in modern browsers. Use --embed-file or --preload-file in emcc';
+ var lazyArray = new LazyUint8Array();
+ Object.defineProperty(lazyArray, "length", {
+ get: function() {
+ if(!this.lengthKnown) {
+ this.cacheLength();
+ }
+ return this._length;
+ }
+ });
+ Object.defineProperty(lazyArray, "chunkSize", {
+ get: function() {
+ if(!this.lengthKnown) {
+ this.cacheLength();
+ }
+ return this._chunkSize;
+ }
+ });
+
+ var properties = { isDevice: false, contents: lazyArray };
+ } else {
+ var properties = { isDevice: false, url: url };
+ }
+
+ var node = FS.createFile(parent, name, properties, canRead, canWrite);
+ // This is a total hack, but I want to get this lazy file code out of the
+ // core of MEMFS. If we want to keep this lazy file concept I feel it should
+ // be its own thin LAZYFS proxying calls to MEMFS.
+ if (properties.contents) {
+ node.contents = properties.contents;
+ } else if (properties.url) {
+ node.contents = null;
+ node.url = properties.url;
+ }
+ // override each stream op with one that tries to force load the lazy file first
+ var stream_ops = {};
+ var keys = Object.keys(node.stream_ops);
+ keys.forEach(function(key) {
+ var fn = node.stream_ops[key];
+ stream_ops[key] = function forceLoadLazyFile() {
+ if (!FS.forceLoadFile(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ return fn.apply(null, arguments);
+ };
+ });
+ // use a custom read function
+ stream_ops.read = function stream_ops_read(stream, buffer, offset, length, position) {
+ if (!FS.forceLoadFile(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ var contents = stream.node.contents;
+ if (position >= contents.length)
+ return 0;
+ var size = Math.min(contents.length - position, length);
+ assert(size >= 0);
+ if (contents.slice) { // normal array
+ for (var i = 0; i < size; i++) {
+ buffer[offset + i] = contents[position + i];
+ }
+ } else {
+ for (var i = 0; i < size; i++) { // LazyUint8Array from sync binary XHR
+ buffer[offset + i] = contents.get(position + i);
+ }
+ }
+ return size;
+ };
+ node.stream_ops = stream_ops;
+ return node;
+ },createPreloadedFile:function (parent, name, url, canRead, canWrite, onload, onerror, dontCreateFile, canOwn) {
+ Browser.init();
+ // TODO we should allow people to just pass in a complete filename instead
+ // of parent and name being that we just join them anyways
+ var fullname = name ? PATH.resolve(PATH.join2(parent, name)) : parent;
+ function processData(byteArray) {
+ function finish(byteArray) {
+ if (!dontCreateFile) {
+ FS.createDataFile(parent, name, byteArray, canRead, canWrite, canOwn);
+ }
+ if (onload) onload();
+ removeRunDependency('cp ' + fullname);
+ }
+ var handled = false;
+ Module['preloadPlugins'].forEach(function(plugin) {
+ if (handled) return;
+ if (plugin['canHandle'](fullname)) {
+ plugin['handle'](byteArray, fullname, finish, function() {
+ if (onerror) onerror();
+ removeRunDependency('cp ' + fullname);
+ });
+ handled = true;
+ }
+ });
+ if (!handled) finish(byteArray);
+ }
+ addRunDependency('cp ' + fullname);
+ if (typeof url == 'string') {
+ Browser.asyncLoad(url, function(byteArray) {
+ processData(byteArray);
+ }, onerror);
+ } else {
+ processData(url);
+ }
+ },indexedDB:function () {
+ return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
+ },DB_NAME:function () {
+ return 'EM_FS_' + window.location.pathname;
+ },DB_VERSION:20,DB_STORE_NAME:"FILE_DATA",saveFilesToDB:function (paths, onload, onerror) {
+ onload = onload || function(){};
+ onerror = onerror || function(){};
+ var indexedDB = FS.indexedDB();
+ try {
+ var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
+ } catch (e) {
+ return onerror(e);
+ }
+ openRequest.onupgradeneeded = function openRequest_onupgradeneeded() {
+ console.log('creating db');
+ var db = openRequest.result;
+ db.createObjectStore(FS.DB_STORE_NAME);
+ };
+ openRequest.onsuccess = function openRequest_onsuccess() {
+ var db = openRequest.result;
+ var transaction = db.transaction([FS.DB_STORE_NAME], 'readwrite');
+ var files = transaction.objectStore(FS.DB_STORE_NAME);
+ var ok = 0, fail = 0, total = paths.length;
+ function finish() {
+ if (fail == 0) onload(); else onerror();
+ }
+ paths.forEach(function(path) {
+ var putRequest = files.put(FS.analyzePath(path).object.contents, path);
+ putRequest.onsuccess = function putRequest_onsuccess() { ok++; if (ok + fail == total) finish() };
+ putRequest.onerror = function putRequest_onerror() { fail++; if (ok + fail == total) finish() };
+ });
+ transaction.onerror = onerror;
+ };
+ openRequest.onerror = onerror;
+ },loadFilesFromDB:function (paths, onload, onerror) {
+ onload = onload || function(){};
+ onerror = onerror || function(){};
+ var indexedDB = FS.indexedDB();
+ try {
+ var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
+ } catch (e) {
+ return onerror(e);
+ }
+ openRequest.onupgradeneeded = onerror; // no database to load from
+ openRequest.onsuccess = function openRequest_onsuccess() {
+ var db = openRequest.result;
+ try {
+ var transaction = db.transaction([FS.DB_STORE_NAME], 'readonly');
+ } catch(e) {
+ onerror(e);
+ return;
+ }
+ var files = transaction.objectStore(FS.DB_STORE_NAME);
+ var ok = 0, fail = 0, total = paths.length;
+ function finish() {
+ if (fail == 0) onload(); else onerror();
+ }
+ paths.forEach(function(path) {
+ var getRequest = files.get(path);
+ getRequest.onsuccess = function getRequest_onsuccess() {
+ if (FS.analyzePath(path).exists) {
+ FS.unlink(path);
+ }
+ FS.createDataFile(PATH.dirname(path), PATH.basename(path), getRequest.result, true, true, true);
+ ok++;
+ if (ok + fail == total) finish();
+ };
+ getRequest.onerror = function getRequest_onerror() { fail++; if (ok + fail == total) finish() };
+ });
+ transaction.onerror = onerror;
+ };
+ openRequest.onerror = onerror;
+ }};var PATH={splitPath:function (filename) {
+ var splitPathRe = /^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/;
+ return splitPathRe.exec(filename).slice(1);
+ },normalizeArray:function (parts, allowAboveRoot) {
+ // if the path tries to go above the root, `up` ends up > 0
+ var up = 0;
+ for (var i = parts.length - 1; i >= 0; i--) {
+ var last = parts[i];
+ if (last === '.') {
+ parts.splice(i, 1);
+ } else if (last === '..') {
+ parts.splice(i, 1);
+ up++;
+ } else if (up) {
+ parts.splice(i, 1);
+ up--;
+ }
+ }
+ // if the path is allowed to go above the root, restore leading ..s
+ if (allowAboveRoot) {
+ for (; up--; up) {
+ parts.unshift('..');
+ }
+ }
+ return parts;
+ },normalize:function (path) {
+ var isAbsolute = path.charAt(0) === '/',
+ trailingSlash = path.substr(-1) === '/';
+ // Normalize the path
+ path = PATH.normalizeArray(path.split('/').filter(function(p) {
+ return !!p;
+ }), !isAbsolute).join('/');
+ if (!path && !isAbsolute) {
+ path = '.';
+ }
+ if (path && trailingSlash) {
+ path += '/';
+ }
+ return (isAbsolute ? '/' : '') + path;
+ },dirname:function (path) {
+ var result = PATH.splitPath(path),
+ root = result[0],
+ dir = result[1];
+ if (!root && !dir) {
+ // No dirname whatsoever
+ return '.';
+ }
+ if (dir) {
+ // It has a dirname, strip trailing slash
+ dir = dir.substr(0, dir.length - 1);
+ }
+ return root + dir;
+ },basename:function (path) {
+ // EMSCRIPTEN return '/'' for '/', not an empty string
+ if (path === '/') return '/';
+ var lastSlash = path.lastIndexOf('/');
+ if (lastSlash === -1) return path;
+ return path.substr(lastSlash+1);
+ },extname:function (path) {
+ return PATH.splitPath(path)[3];
+ },join:function () {
+ var paths = Array.prototype.slice.call(arguments, 0);
+ return PATH.normalize(paths.join('/'));
+ },join2:function (l, r) {
+ return PATH.normalize(l + '/' + r);
+ },resolve:function () {
+ var resolvedPath = '',
+ resolvedAbsolute = false;
+ for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {
+ var path = (i >= 0) ? arguments[i] : FS.cwd();
+ // Skip empty and invalid entries
+ if (typeof path !== 'string') {
+ throw new TypeError('Arguments to path.resolve must be strings');
+ } else if (!path) {
+ continue;
+ }
+ resolvedPath = path + '/' + resolvedPath;
+ resolvedAbsolute = path.charAt(0) === '/';
+ }
+ // At this point the path should be resolved to a full absolute path, but
+ // handle relative paths to be safe (might happen when process.cwd() fails)
+ resolvedPath = PATH.normalizeArray(resolvedPath.split('/').filter(function(p) {
+ return !!p;
+ }), !resolvedAbsolute).join('/');
+ return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.';
+ },relative:function (from, to) {
+ from = PATH.resolve(from).substr(1);
+ to = PATH.resolve(to).substr(1);
+ function trim(arr) {
+ var start = 0;
+ for (; start < arr.length; start++) {
+ if (arr[start] !== '') break;
+ }
+ var end = arr.length - 1;
+ for (; end >= 0; end--) {
+ if (arr[end] !== '') break;
+ }
+ if (start > end) return [];
+ return arr.slice(start, end - start + 1);
+ }
+ var fromParts = trim(from.split('/'));
+ var toParts = trim(to.split('/'));
+ var length = Math.min(fromParts.length, toParts.length);
+ var samePartsLength = length;
+ for (var i = 0; i < length; i++) {
+ if (fromParts[i] !== toParts[i]) {
+ samePartsLength = i;
+ break;
+ }
+ }
+ var outputParts = [];
+ for (var i = samePartsLength; i < fromParts.length; i++) {
+ outputParts.push('..');
+ }
+ outputParts = outputParts.concat(toParts.slice(samePartsLength));
+ return outputParts.join('/');
+ }};var Browser={mainLoop:{scheduler:null,method:"",shouldPause:false,paused:false,queue:[],pause:function () {
+ Browser.mainLoop.shouldPause = true;
+ },resume:function () {
+ if (Browser.mainLoop.paused) {
+ Browser.mainLoop.paused = false;
+ Browser.mainLoop.scheduler();
+ }
+ Browser.mainLoop.shouldPause = false;
+ },updateStatus:function () {
+ if (Module['setStatus']) {
+ var message = Module['statusMessage'] || 'Please wait...';
+ var remaining = Browser.mainLoop.remainingBlockers;
+ var expected = Browser.mainLoop.expectedBlockers;
+ if (remaining) {
+ if (remaining < expected) {
+ Module['setStatus'](message + ' (' + (expected - remaining) + '/' + expected + ')');
+ } else {
+ Module['setStatus'](message);
+ }
+ } else {
+ Module['setStatus']('');
+ }
+ }
+ }},isFullScreen:false,pointerLock:false,moduleContextCreatedCallbacks:[],workers:[],init:function () {
+ if (!Module["preloadPlugins"]) Module["preloadPlugins"] = []; // needs to exist even in workers
+
+ if (Browser.initted || ENVIRONMENT_IS_WORKER) return;
+ Browser.initted = true;
+
+ try {
+ new Blob();
+ Browser.hasBlobConstructor = true;
+ } catch(e) {
+ Browser.hasBlobConstructor = false;
+ console.log("warning: no blob constructor, cannot create blobs with mimetypes");
+ }
+ Browser.BlobBuilder = typeof MozBlobBuilder != "undefined" ? MozBlobBuilder : (typeof WebKitBlobBuilder != "undefined" ? WebKitBlobBuilder : (!Browser.hasBlobConstructor ? console.log("warning: no BlobBuilder") : null));
+ Browser.URLObject = typeof window != "undefined" ? (window.URL ? window.URL : window.webkitURL) : undefined;
+ if (!Module.noImageDecoding && typeof Browser.URLObject === 'undefined') {
+ console.log("warning: Browser does not support creating object URLs. Built-in browser image decoding will not be available.");
+ Module.noImageDecoding = true;
+ }
+
+ // Support for plugins that can process preloaded files. You can add more of these to
+ // your app by creating and appending to Module.preloadPlugins.
+ //
+ // Each plugin is asked if it can handle a file based on the file's name. If it can,
+ // it is given the file's raw data. When it is done, it calls a callback with the file's
+ // (possibly modified) data. For example, a plugin might decompress a file, or it
+ // might create some side data structure for use later (like an Image element, etc.).
+
+ var imagePlugin = {};
+ imagePlugin['canHandle'] = function imagePlugin_canHandle(name) {
+ return !Module.noImageDecoding && /\.(jpg|jpeg|png|bmp)$/i.test(name);
+ };
+ imagePlugin['handle'] = function imagePlugin_handle(byteArray, name, onload, onerror) {
+ var b = null;
+ if (Browser.hasBlobConstructor) {
+ try {
+ b = new Blob([byteArray], { type: Browser.getMimetype(name) });
+ if (b.size !== byteArray.length) { // Safari bug #118630
+ // Safari's Blob can only take an ArrayBuffer
+ b = new Blob([(new Uint8Array(byteArray)).buffer], { type: Browser.getMimetype(name) });
+ }
+ } catch(e) {
+ Runtime.warnOnce('Blob constructor present but fails: ' + e + '; falling back to blob builder');
+ }
+ }
+ if (!b) {
+ var bb = new Browser.BlobBuilder();
+ bb.append((new Uint8Array(byteArray)).buffer); // we need to pass a buffer, and must copy the array to get the right data range
+ b = bb.getBlob();
+ }
+ var url = Browser.URLObject.createObjectURL(b);
+ var img = new Image();
+ img.onload = function img_onload() {
+ assert(img.complete, 'Image ' + name + ' could not be decoded');
+ var canvas = document.createElement('canvas');
+ canvas.width = img.width;
+ canvas.height = img.height;
+ var ctx = canvas.getContext('2d');
+ ctx.drawImage(img, 0, 0);
+ Module["preloadedImages"][name] = canvas;
+ Browser.URLObject.revokeObjectURL(url);
+ if (onload) onload(byteArray);
+ };
+ img.onerror = function img_onerror(event) {
+ console.log('Image ' + url + ' could not be decoded');
+ if (onerror) onerror();
+ };
+ img.src = url;
+ };
+ Module['preloadPlugins'].push(imagePlugin);
+
+ var audioPlugin = {};
+ audioPlugin['canHandle'] = function audioPlugin_canHandle(name) {
+ return !Module.noAudioDecoding && name.substr(-4) in { '.ogg': 1, '.wav': 1, '.mp3': 1 };
+ };
+ audioPlugin['handle'] = function audioPlugin_handle(byteArray, name, onload, onerror) {
+ var done = false;
+ function finish(audio) {
+ if (done) return;
+ done = true;
+ Module["preloadedAudios"][name] = audio;
+ if (onload) onload(byteArray);
+ }
+ function fail() {
+ if (done) return;
+ done = true;
+ Module["preloadedAudios"][name] = new Audio(); // empty shim
+ if (onerror) onerror();
+ }
+ if (Browser.hasBlobConstructor) {
+ try {
+ var b = new Blob([byteArray], { type: Browser.getMimetype(name) });
+ } catch(e) {
+ return fail();
+ }
+ var url = Browser.URLObject.createObjectURL(b); // XXX we never revoke this!
+ var audio = new Audio();
+ audio.addEventListener('canplaythrough', function() { finish(audio) }, false); // use addEventListener due to chromium bug 124926
+ audio.onerror = function audio_onerror(event) {
+ if (done) return;
+ console.log('warning: browser could not fully decode audio ' + name + ', trying slower base64 approach');
+ function encode64(data) {
+ var BASE = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
+ var PAD = '=';
+ var ret = '';
+ var leftchar = 0;
+ var leftbits = 0;
+ for (var i = 0; i < data.length; i++) {
+ leftchar = (leftchar << 8) | data[i];
+ leftbits += 8;
+ while (leftbits >= 6) {
+ var curr = (leftchar >> (leftbits-6)) & 0x3f;
+ leftbits -= 6;
+ ret += BASE[curr];
+ }
+ }
+ if (leftbits == 2) {
+ ret += BASE[(leftchar&3) << 4];
+ ret += PAD + PAD;
+ } else if (leftbits == 4) {
+ ret += BASE[(leftchar&0xf) << 2];
+ ret += PAD;
+ }
+ return ret;
+ }
+ audio.src = 'data:audio/x-' + name.substr(-3) + ';base64,' + encode64(byteArray);
+ finish(audio); // we don't wait for confirmation this worked - but it's worth trying
+ };
+ audio.src = url;
+ // workaround for chrome bug 124926 - we do not always get oncanplaythrough or onerror
+ Browser.safeSetTimeout(function() {
+ finish(audio); // try to use it even though it is not necessarily ready to play
+ }, 10000);
+ } else {
+ return fail();
+ }
+ };
+ Module['preloadPlugins'].push(audioPlugin);
+
+ // Canvas event setup
+
+ var canvas = Module['canvas'];
+
+ // forced aspect ratio can be enabled by defining 'forcedAspectRatio' on Module
+ // Module['forcedAspectRatio'] = 4 / 3;
+
+ canvas.requestPointerLock = canvas['requestPointerLock'] ||
+ canvas['mozRequestPointerLock'] ||
+ canvas['webkitRequestPointerLock'] ||
+ canvas['msRequestPointerLock'] ||
+ function(){};
+ canvas.exitPointerLock = document['exitPointerLock'] ||
+ document['mozExitPointerLock'] ||
+ document['webkitExitPointerLock'] ||
+ document['msExitPointerLock'] ||
+ function(){}; // no-op if function does not exist
+ canvas.exitPointerLock = canvas.exitPointerLock.bind(document);
+
+ function pointerLockChange() {
+ Browser.pointerLock = document['pointerLockElement'] === canvas ||
+ document['mozPointerLockElement'] === canvas ||
+ document['webkitPointerLockElement'] === canvas ||
+ document['msPointerLockElement'] === canvas;
+ }
+
+ document.addEventListener('pointerlockchange', pointerLockChange, false);
+ document.addEventListener('mozpointerlockchange', pointerLockChange, false);
+ document.addEventListener('webkitpointerlockchange', pointerLockChange, false);
+ document.addEventListener('mspointerlockchange', pointerLockChange, false);
+
+ if (Module['elementPointerLock']) {
+ canvas.addEventListener("click", function(ev) {
+ if (!Browser.pointerLock && canvas.requestPointerLock) {
+ canvas.requestPointerLock();
+ ev.preventDefault();
+ }
+ }, false);
+ }
+ },createContext:function (canvas, useWebGL, setInModule, webGLContextAttributes) {
+ var ctx;
+ var errorInfo = '?';
+ function onContextCreationError(event) {
+ errorInfo = event.statusMessage || errorInfo;
+ }
+ try {
+ if (useWebGL) {
+ var contextAttributes = {
+ antialias: false,
+ alpha: false
+ };
+
+ if (webGLContextAttributes) {
+ for (var attribute in webGLContextAttributes) {
+ contextAttributes[attribute] = webGLContextAttributes[attribute];
+ }
+ }
+
+
+ canvas.addEventListener('webglcontextcreationerror', onContextCreationError, false);
+ try {
+ ['experimental-webgl', 'webgl'].some(function(webglId) {
+ return ctx = canvas.getContext(webglId, contextAttributes);
+ });
+ } finally {
+ canvas.removeEventListener('webglcontextcreationerror', onContextCreationError, false);
+ }
+ } else {
+ ctx = canvas.getContext('2d');
+ }
+ if (!ctx) throw ':(';
+ } catch (e) {
+ Module.print('Could not create canvas: ' + [errorInfo, e]);
+ return null;
+ }
+ if (useWebGL) {
+ // Set the background of the WebGL canvas to black
+ canvas.style.backgroundColor = "black";
+
+ // Warn on context loss
+ canvas.addEventListener('webglcontextlost', function(event) {
+ alert('WebGL context lost. You will need to reload the page.');
+ }, false);
+ }
+ if (setInModule) {
+ GLctx = Module.ctx = ctx;
+ Module.useWebGL = useWebGL;
+ Browser.moduleContextCreatedCallbacks.forEach(function(callback) { callback() });
+ Browser.init();
+ }
+ return ctx;
+ },destroyContext:function (canvas, useWebGL, setInModule) {},fullScreenHandlersInstalled:false,lockPointer:undefined,resizeCanvas:undefined,requestFullScreen:function (lockPointer, resizeCanvas) {
+ Browser.lockPointer = lockPointer;
+ Browser.resizeCanvas = resizeCanvas;
+ if (typeof Browser.lockPointer === 'undefined') Browser.lockPointer = true;
+ if (typeof Browser.resizeCanvas === 'undefined') Browser.resizeCanvas = false;
+
+ var canvas = Module['canvas'];
+ function fullScreenChange() {
+ Browser.isFullScreen = false;
+ var canvasContainer = canvas.parentNode;
+ if ((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
+ document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
+ document['fullScreenElement'] || document['fullscreenElement'] ||
+ document['msFullScreenElement'] || document['msFullscreenElement'] ||
+ document['webkitCurrentFullScreenElement']) === canvasContainer) {
+ canvas.cancelFullScreen = document['cancelFullScreen'] ||
+ document['mozCancelFullScreen'] ||
+ document['webkitCancelFullScreen'] ||
+ document['msExitFullscreen'] ||
+ document['exitFullscreen'] ||
+ function() {};
+ canvas.cancelFullScreen = canvas.cancelFullScreen.bind(document);
+ if (Browser.lockPointer) canvas.requestPointerLock();
+ Browser.isFullScreen = true;
+ if (Browser.resizeCanvas) Browser.setFullScreenCanvasSize();
+ } else {
+
+ // remove the full screen specific parent of the canvas again to restore the HTML structure from before going full screen
+ canvasContainer.parentNode.insertBefore(canvas, canvasContainer);
+ canvasContainer.parentNode.removeChild(canvasContainer);
+
+ if (Browser.resizeCanvas) Browser.setWindowedCanvasSize();
+ }
+ if (Module['onFullScreen']) Module['onFullScreen'](Browser.isFullScreen);
+ Browser.updateCanvasDimensions(canvas);
+ }
+
+ if (!Browser.fullScreenHandlersInstalled) {
+ Browser.fullScreenHandlersInstalled = true;
+ document.addEventListener('fullscreenchange', fullScreenChange, false);
+ document.addEventListener('mozfullscreenchange', fullScreenChange, false);
+ document.addEventListener('webkitfullscreenchange', fullScreenChange, false);
+ document.addEventListener('MSFullscreenChange', fullScreenChange, false);
+ }
+
+ // create a new parent to ensure the canvas has no siblings. this allows browsers to optimize full screen performance when its parent is the full screen root
+ var canvasContainer = document.createElement("div");
+ canvas.parentNode.insertBefore(canvasContainer, canvas);
+ canvasContainer.appendChild(canvas);
+
+ // use parent of canvas as full screen root to allow aspect ratio correction (Firefox stretches the root to screen size)
+ canvasContainer.requestFullScreen = canvasContainer['requestFullScreen'] ||
+ canvasContainer['mozRequestFullScreen'] ||
+ canvasContainer['msRequestFullscreen'] ||
+ (canvasContainer['webkitRequestFullScreen'] ? function() { canvasContainer['webkitRequestFullScreen'](Element['ALLOW_KEYBOARD_INPUT']) } : null);
+ canvasContainer.requestFullScreen();
+ },requestAnimationFrame:function requestAnimationFrame(func) {
+ if (typeof window === 'undefined') { // Provide fallback to setTimeout if window is undefined (e.g. in Node.js)
+ setTimeout(func, 1000/60);
+ } else {
+ if (!window.requestAnimationFrame) {
+ window.requestAnimationFrame = window['requestAnimationFrame'] ||
+ window['mozRequestAnimationFrame'] ||
+ window['webkitRequestAnimationFrame'] ||
+ window['msRequestAnimationFrame'] ||
+ window['oRequestAnimationFrame'] ||
+ window['setTimeout'];
+ }
+ window.requestAnimationFrame(func);
+ }
+ },safeCallback:function (func) {
+ return function() {
+ if (!ABORT) return func.apply(null, arguments);
+ };
+ },safeRequestAnimationFrame:function (func) {
+ return Browser.requestAnimationFrame(function() {
+ if (!ABORT) func();
+ });
+ },safeSetTimeout:function (func, timeout) {
+ return setTimeout(function() {
+ if (!ABORT) func();
+ }, timeout);
+ },safeSetInterval:function (func, timeout) {
+ return setInterval(function() {
+ if (!ABORT) func();
+ }, timeout);
+ },getMimetype:function (name) {
+ return {
+ 'jpg': 'image/jpeg',
+ 'jpeg': 'image/jpeg',
+ 'png': 'image/png',
+ 'bmp': 'image/bmp',
+ 'ogg': 'audio/ogg',
+ 'wav': 'audio/wav',
+ 'mp3': 'audio/mpeg'
+ }[name.substr(name.lastIndexOf('.')+1)];
+ },getUserMedia:function (func) {
+ if(!window.getUserMedia) {
+ window.getUserMedia = navigator['getUserMedia'] ||
+ navigator['mozGetUserMedia'];
+ }
+ window.getUserMedia(func);
+ },getMovementX:function (event) {
+ return event['movementX'] ||
+ event['mozMovementX'] ||
+ event['webkitMovementX'] ||
+ 0;
+ },getMovementY:function (event) {
+ return event['movementY'] ||
+ event['mozMovementY'] ||
+ event['webkitMovementY'] ||
+ 0;
+ },getMouseWheelDelta:function (event) {
+ return Math.max(-1, Math.min(1, event.type === 'DOMMouseScroll' ? event.detail : -event.wheelDelta));
+ },mouseX:0,mouseY:0,mouseMovementX:0,mouseMovementY:0,calculateMouseEvent:function (event) { // event should be mousemove, mousedown or mouseup
+ if (Browser.pointerLock) {
+ // When the pointer is locked, calculate the coordinates
+ // based on the movement of the mouse.
+ // Workaround for Firefox bug 764498
+ if (event.type != 'mousemove' &&
+ ('mozMovementX' in event)) {
+ Browser.mouseMovementX = Browser.mouseMovementY = 0;
+ } else {
+ Browser.mouseMovementX = Browser.getMovementX(event);
+ Browser.mouseMovementY = Browser.getMovementY(event);
+ }
+
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ Browser.mouseX = SDL.mouseX + Browser.mouseMovementX;
+ Browser.mouseY = SDL.mouseY + Browser.mouseMovementY;
+ } else {
+ // just add the mouse delta to the current absolut mouse position
+ // FIXME: ideally this should be clamped against the canvas size and zero
+ Browser.mouseX += Browser.mouseMovementX;
+ Browser.mouseY += Browser.mouseMovementY;
+ }
+ } else {
+ // Otherwise, calculate the movement based on the changes
+ // in the coordinates.
+ var rect = Module["canvas"].getBoundingClientRect();
+ var x, y;
+
+ // Neither .scrollX or .pageXOffset are defined in a spec, but
+ // we prefer .scrollX because it is currently in a spec draft.
+ // (see: http://www.w3.org/TR/2013/WD-cssom-view-20131217/)
+ var scrollX = ((typeof window.scrollX !== 'undefined') ? window.scrollX : window.pageXOffset);
+ var scrollY = ((typeof window.scrollY !== 'undefined') ? window.scrollY : window.pageYOffset);
+ if (event.type == 'touchstart' ||
+ event.type == 'touchend' ||
+ event.type == 'touchmove') {
+ var t = event.touches.item(0);
+ if (t) {
+ x = t.pageX - (scrollX + rect.left);
+ y = t.pageY - (scrollY + rect.top);
+ } else {
+ return;
+ }
+ } else {
+ x = event.pageX - (scrollX + rect.left);
+ y = event.pageY - (scrollY + rect.top);
+ }
+
+ // the canvas might be CSS-scaled compared to its backbuffer;
+ // SDL-using content will want mouse coordinates in terms
+ // of backbuffer units.
+ var cw = Module["canvas"].width;
+ var ch = Module["canvas"].height;
+ x = x * (cw / rect.width);
+ y = y * (ch / rect.height);
+
+ Browser.mouseMovementX = x - Browser.mouseX;
+ Browser.mouseMovementY = y - Browser.mouseY;
+ Browser.mouseX = x;
+ Browser.mouseY = y;
+ }
+ },xhrLoad:function (url, onload, onerror) {
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, true);
+ xhr.responseType = 'arraybuffer';
+ xhr.onload = function xhr_onload() {
+ if (xhr.status == 200 || (xhr.status == 0 && xhr.response)) { // file URLs can return 0
+ onload(xhr.response);
+ } else {
+ onerror();
+ }
+ };
+ xhr.onerror = onerror;
+ xhr.send(null);
+ },asyncLoad:function (url, onload, onerror, noRunDep) {
+ Browser.xhrLoad(url, function(arrayBuffer) {
+ assert(arrayBuffer, 'Loading data file "' + url + '" failed (no arrayBuffer).');
+ onload(new Uint8Array(arrayBuffer));
+ if (!noRunDep) removeRunDependency('al ' + url);
+ }, function(event) {
+ if (onerror) {
+ onerror();
+ } else {
+ throw 'Loading data file "' + url + '" failed.';
+ }
+ });
+ if (!noRunDep) addRunDependency('al ' + url);
+ },resizeListeners:[],updateResizeListeners:function () {
+ var canvas = Module['canvas'];
+ Browser.resizeListeners.forEach(function(listener) {
+ listener(canvas.width, canvas.height);
+ });
+ },setCanvasSize:function (width, height, noUpdates) {
+ var canvas = Module['canvas'];
+ Browser.updateCanvasDimensions(canvas, width, height);
+ if (!noUpdates) Browser.updateResizeListeners();
+ },windowedWidth:0,windowedHeight:0,setFullScreenCanvasSize:function () {
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
+ flags = flags | 0x00800000; // set SDL_FULLSCREEN flag
+ HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
+ }
+ Browser.updateResizeListeners();
+ },setWindowedCanvasSize:function () {
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
+ flags = flags & ~0x00800000; // clear SDL_FULLSCREEN flag
+ HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
+ }
+ Browser.updateResizeListeners();
+ },updateCanvasDimensions:function (canvas, wNative, hNative) {
+ if (wNative && hNative) {
+ canvas.widthNative = wNative;
+ canvas.heightNative = hNative;
+ } else {
+ wNative = canvas.widthNative;
+ hNative = canvas.heightNative;
+ }
+ var w = wNative;
+ var h = hNative;
+ if (Module['forcedAspectRatio'] && Module['forcedAspectRatio'] > 0) {
+ if (w/h < Module['forcedAspectRatio']) {
+ w = Math.round(h * Module['forcedAspectRatio']);
+ } else {
+ h = Math.round(w / Module['forcedAspectRatio']);
+ }
+ }
+ if (((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
+ document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
+ document['fullScreenElement'] || document['fullscreenElement'] ||
+ document['msFullScreenElement'] || document['msFullscreenElement'] ||
+ document['webkitCurrentFullScreenElement']) === canvas.parentNode) && (typeof screen != 'undefined')) {
+ var factor = Math.min(screen.width / w, screen.height / h);
+ w = Math.round(w * factor);
+ h = Math.round(h * factor);
+ }
+ if (Browser.resizeCanvas) {
+ if (canvas.width != w) canvas.width = w;
+ if (canvas.height != h) canvas.height = h;
+ if (typeof canvas.style != 'undefined') {
+ canvas.style.removeProperty( "width");
+ canvas.style.removeProperty("height");
+ }
+ } else {
+ if (canvas.width != wNative) canvas.width = wNative;
+ if (canvas.height != hNative) canvas.height = hNative;
+ if (typeof canvas.style != 'undefined') {
+ if (w != wNative || h != hNative) {
+ canvas.style.setProperty( "width", w + "px", "important");
+ canvas.style.setProperty("height", h + "px", "important");
+ } else {
+ canvas.style.removeProperty( "width");
+ canvas.style.removeProperty("height");
+ }
+ }
+ }
+ }};
+
+
+
+
+
+
+
+ function _mkport() { throw 'TODO' }var SOCKFS={mount:function (mount) {
+ return FS.createNode(null, '/', 16384 | 511 /* 0777 */, 0);
+ },createSocket:function (family, type, protocol) {
+ var streaming = type == 1;
+ if (protocol) {
+ assert(streaming == (protocol == 6)); // if SOCK_STREAM, must be tcp
+ }
+
+ // create our internal socket structure
+ var sock = {
+ family: family,
+ type: type,
+ protocol: protocol,
+ server: null,
+ peers: {},
+ pending: [],
+ recv_queue: [],
+ sock_ops: SOCKFS.websocket_sock_ops
+ };
+
+ // create the filesystem node to store the socket structure
+ var name = SOCKFS.nextname();
+ var node = FS.createNode(SOCKFS.root, name, 49152, 0);
+ node.sock = sock;
+
+ // and the wrapping stream that enables library functions such
+ // as read and write to indirectly interact with the socket
+ var stream = FS.createStream({
+ path: name,
+ node: node,
+ flags: FS.modeStringToFlags('r+'),
+ seekable: false,
+ stream_ops: SOCKFS.stream_ops
+ });
+
+ // map the new stream to the socket structure (sockets have a 1:1
+ // relationship with a stream)
+ sock.stream = stream;
+
+ return sock;
+ },getSocket:function (fd) {
+ var stream = FS.getStream(fd);
+ if (!stream || !FS.isSocket(stream.node.mode)) {
+ return null;
+ }
+ return stream.node.sock;
+ },stream_ops:{poll:function (stream) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.poll(sock);
+ },ioctl:function (stream, request, varargs) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.ioctl(sock, request, varargs);
+ },read:function (stream, buffer, offset, length, position /* ignored */) {
+ var sock = stream.node.sock;
+ var msg = sock.sock_ops.recvmsg(sock, length);
+ if (!msg) {
+ // socket is closed
+ return 0;
+ }
+ buffer.set(msg.buffer, offset);
+ return msg.buffer.length;
+ },write:function (stream, buffer, offset, length, position /* ignored */) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.sendmsg(sock, buffer, offset, length);
+ },close:function (stream) {
+ var sock = stream.node.sock;
+ sock.sock_ops.close(sock);
+ }},nextname:function () {
+ if (!SOCKFS.nextname.current) {
+ SOCKFS.nextname.current = 0;
+ }
+ return 'socket[' + (SOCKFS.nextname.current++) + ']';
+ },websocket_sock_ops:{createPeer:function (sock, addr, port) {
+ var ws;
+
+ if (typeof addr === 'object') {
+ ws = addr;
+ addr = null;
+ port = null;
+ }
+
+ if (ws) {
+ // for sockets that've already connected (e.g. we're the server)
+ // we can inspect the _socket property for the address
+ if (ws._socket) {
+ addr = ws._socket.remoteAddress;
+ port = ws._socket.remotePort;
+ }
+ // if we're just now initializing a connection to the remote,
+ // inspect the url property
+ else {
+ var result = /ws[s]?:\/\/([^:]+):(\d+)/.exec(ws.url);
+ if (!result) {
+ throw new Error('WebSocket URL must be in the format ws(s)://address:port');
+ }
+ addr = result[1];
+ port = parseInt(result[2], 10);
+ }
+ } else {
+ // create the actual websocket object and connect
+ try {
+ // runtimeConfig gets set to true if WebSocket runtime configuration is available.
+ var runtimeConfig = (Module['websocket'] && ('object' === typeof Module['websocket']));
+
+ // The default value is 'ws://' the replace is needed because the compiler replaces "//" comments with '#'
+ // comments without checking context, so we'd end up with ws:#, the replace swaps the "#" for "//" again.
+ var url = 'ws:#'.replace('#', '//');
+
+ if (runtimeConfig) {
+ if ('string' === typeof Module['websocket']['url']) {
+ url = Module['websocket']['url']; // Fetch runtime WebSocket URL config.
+ }
+ }
+
+ if (url === 'ws://' || url === 'wss://') { // Is the supplied URL config just a prefix, if so complete it.
+ url = url + addr + ':' + port;
+ }
+
+ // Make the WebSocket subprotocol (Sec-WebSocket-Protocol) default to binary if no configuration is set.
+ var subProtocols = 'binary'; // The default value is 'binary'
+
+ if (runtimeConfig) {
+ if ('string' === typeof Module['websocket']['subprotocol']) {
+ subProtocols = Module['websocket']['subprotocol']; // Fetch runtime WebSocket subprotocol config.
+ }
+ }
+
+ // The regex trims the string (removes spaces at the beginning and end, then splits the string by
+ // <any space>,<any space> into an Array. Whitespace removal is important for Websockify and ws.
+ subProtocols = subProtocols.replace(/^ +| +$/g,"").split(/ *, */);
+
+ // The node ws library API for specifying optional subprotocol is slightly different than the browser's.
+ var opts = ENVIRONMENT_IS_NODE ? {'protocol': subProtocols.toString()} : subProtocols;
+
+ // If node we use the ws library.
+ var WebSocket = ENVIRONMENT_IS_NODE ? require('ws') : window['WebSocket'];
+ ws = new WebSocket(url, opts);
+ ws.binaryType = 'arraybuffer';
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EHOSTUNREACH);
+ }
+ }
+
+
+ var peer = {
+ addr: addr,
+ port: port,
+ socket: ws,
+ dgram_send_queue: []
+ };
+
+ SOCKFS.websocket_sock_ops.addPeer(sock, peer);
+ SOCKFS.websocket_sock_ops.handlePeerEvents(sock, peer);
+
+ // if this is a bound dgram socket, send the port number first to allow
+ // us to override the ephemeral port reported to us by remotePort on the
+ // remote end.
+ if (sock.type === 2 && typeof sock.sport !== 'undefined') {
+ peer.dgram_send_queue.push(new Uint8Array([
+ 255, 255, 255, 255,
+ 'p'.charCodeAt(0), 'o'.charCodeAt(0), 'r'.charCodeAt(0), 't'.charCodeAt(0),
+ ((sock.sport & 0xff00) >> 8) , (sock.sport & 0xff)
+ ]));
+ }
+
+ return peer;
+ },getPeer:function (sock, addr, port) {
+ return sock.peers[addr + ':' + port];
+ },addPeer:function (sock, peer) {
+ sock.peers[peer.addr + ':' + peer.port] = peer;
+ },removePeer:function (sock, peer) {
+ delete sock.peers[peer.addr + ':' + peer.port];
+ },handlePeerEvents:function (sock, peer) {
+ var first = true;
+
+ var handleOpen = function () {
+ try {
+ var queued = peer.dgram_send_queue.shift();
+ while (queued) {
+ peer.socket.send(queued);
+ queued = peer.dgram_send_queue.shift();
+ }
+ } catch (e) {
+ // not much we can do here in the way of proper error handling as we've already
+ // lied and said this data was sent. shut it down.
+ peer.socket.close();
+ }
+ };
+
+ function handleMessage(data) {
+ assert(typeof data !== 'string' && data.byteLength !== undefined); // must receive an ArrayBuffer
+ data = new Uint8Array(data); // make a typed array view on the array buffer
+
+
+ // if this is the port message, override the peer's port with it
+ var wasfirst = first;
+ first = false;
+ if (wasfirst &&
+ data.length === 10 &&
+ data[0] === 255 && data[1] === 255 && data[2] === 255 && data[3] === 255 &&
+ data[4] === 'p'.charCodeAt(0) && data[5] === 'o'.charCodeAt(0) && data[6] === 'r'.charCodeAt(0) && data[7] === 't'.charCodeAt(0)) {
+ // update the peer's port and it's key in the peer map
+ var newport = ((data[8] << 8) | data[9]);
+ SOCKFS.websocket_sock_ops.removePeer(sock, peer);
+ peer.port = newport;
+ SOCKFS.websocket_sock_ops.addPeer(sock, peer);
+ return;
+ }
+
+ sock.recv_queue.push({ addr: peer.addr, port: peer.port, data: data });
+ };
+
+ if (ENVIRONMENT_IS_NODE) {
+ peer.socket.on('open', handleOpen);
+ peer.socket.on('message', function(data, flags) {
+ if (!flags.binary) {
+ return;
+ }
+ handleMessage((new Uint8Array(data)).buffer); // copy from node Buffer -> ArrayBuffer
+ });
+ peer.socket.on('error', function() {
+ // don't throw
+ });
+ } else {
+ peer.socket.onopen = handleOpen;
+ peer.socket.onmessage = function peer_socket_onmessage(event) {
+ handleMessage(event.data);
+ };
+ }
+ },poll:function (sock) {
+ if (sock.type === 1 && sock.server) {
+ // listen sockets should only say they're available for reading
+ // if there are pending clients.
+ return sock.pending.length ? (64 | 1) : 0;
+ }
+
+ var mask = 0;
+ var dest = sock.type === 1 ? // we only care about the socket state for connection-based sockets
+ SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport) :
+ null;
+
+ if (sock.recv_queue.length ||
+ !dest || // connection-less sockets are always ready to read
+ (dest && dest.socket.readyState === dest.socket.CLOSING) ||
+ (dest && dest.socket.readyState === dest.socket.CLOSED)) { // let recv return 0 once closed
+ mask |= (64 | 1);
+ }
+
+ if (!dest || // connection-less sockets are always ready to write
+ (dest && dest.socket.readyState === dest.socket.OPEN)) {
+ mask |= 4;
+ }
+
+ if ((dest && dest.socket.readyState === dest.socket.CLOSING) ||
+ (dest && dest.socket.readyState === dest.socket.CLOSED)) {
+ mask |= 16;
+ }
+
+ return mask;
+ },ioctl:function (sock, request, arg) {
+ switch (request) {
+ case 21531:
+ var bytes = 0;
+ if (sock.recv_queue.length) {
+ bytes = sock.recv_queue[0].data.length;
+ }
+ HEAP32[((arg)>>2)]=bytes;
+ return 0;
+ default:
+ return ERRNO_CODES.EINVAL;
+ }
+ },close:function (sock) {
+ // if we've spawned a listen server, close it
+ if (sock.server) {
+ try {
+ sock.server.close();
+ } catch (e) {
+ }
+ sock.server = null;
+ }
+ // close any peer connections
+ var peers = Object.keys(sock.peers);
+ for (var i = 0; i < peers.length; i++) {
+ var peer = sock.peers[peers[i]];
+ try {
+ peer.socket.close();
+ } catch (e) {
+ }
+ SOCKFS.websocket_sock_ops.removePeer(sock, peer);
+ }
+ return 0;
+ },bind:function (sock, addr, port) {
+ if (typeof sock.saddr !== 'undefined' || typeof sock.sport !== 'undefined') {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL); // already bound
+ }
+ sock.saddr = addr;
+ sock.sport = port || _mkport();
+ // in order to emulate dgram sockets, we need to launch a listen server when
+ // binding on a connection-less socket
+ // note: this is only required on the server side
+ if (sock.type === 2) {
+ // close the existing server if it exists
+ if (sock.server) {
+ sock.server.close();
+ sock.server = null;
+ }
+ // swallow error operation not supported error that occurs when binding in the
+ // browser where this isn't supported
+ try {
+ sock.sock_ops.listen(sock, 0);
+ } catch (e) {
+ if (!(e instanceof FS.ErrnoError)) throw e;
+ if (e.errno !== ERRNO_CODES.EOPNOTSUPP) throw e;
+ }
+ }
+ },connect:function (sock, addr, port) {
+ if (sock.server) {
+ throw new FS.ErrnoError(ERRNO_CODS.EOPNOTSUPP);
+ }
+
+ // TODO autobind
+ // if (!sock.addr && sock.type == 2) {
+ // }
+
+ // early out if we're already connected / in the middle of connecting
+ if (typeof sock.daddr !== 'undefined' && typeof sock.dport !== 'undefined') {
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
+ if (dest) {
+ if (dest.socket.readyState === dest.socket.CONNECTING) {
+ throw new FS.ErrnoError(ERRNO_CODES.EALREADY);
+ } else {
+ throw new FS.ErrnoError(ERRNO_CODES.EISCONN);
+ }
+ }
+ }
+
+ // add the socket to our peer list and set our
+ // destination address / port to match
+ var peer = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
+ sock.daddr = peer.addr;
+ sock.dport = peer.port;
+
+ // always "fail" in non-blocking mode
+ throw new FS.ErrnoError(ERRNO_CODES.EINPROGRESS);
+ },listen:function (sock, backlog) {
+ if (!ENVIRONMENT_IS_NODE) {
+ throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
+ }
+ if (sock.server) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL); // already listening
+ }
+ var WebSocketServer = require('ws').Server;
+ var host = sock.saddr;
+ sock.server = new WebSocketServer({
+ host: host,
+ port: sock.sport
+ // TODO support backlog
+ });
+
+ sock.server.on('connection', function(ws) {
+ if (sock.type === 1) {
+ var newsock = SOCKFS.createSocket(sock.family, sock.type, sock.protocol);
+
+ // create a peer on the new socket
+ var peer = SOCKFS.websocket_sock_ops.createPeer(newsock, ws);
+ newsock.daddr = peer.addr;
+ newsock.dport = peer.port;
+
+ // push to queue for accept to pick up
+ sock.pending.push(newsock);
+ } else {
+ // create a peer on the listen socket so calling sendto
+ // with the listen socket and an address will resolve
+ // to the correct client
+ SOCKFS.websocket_sock_ops.createPeer(sock, ws);
+ }
+ });
+ sock.server.on('closed', function() {
+ sock.server = null;
+ });
+ sock.server.on('error', function() {
+ // don't throw
+ });
+ },accept:function (listensock) {
+ if (!listensock.server) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var newsock = listensock.pending.shift();
+ newsock.stream.flags = listensock.stream.flags;
+ return newsock;
+ },getname:function (sock, peer) {
+ var addr, port;
+ if (peer) {
+ if (sock.daddr === undefined || sock.dport === undefined) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+ addr = sock.daddr;
+ port = sock.dport;
+ } else {
+ // TODO saddr and sport will be set for bind()'d UDP sockets, but what
+ // should we be returning for TCP sockets that've been connect()'d?
+ addr = sock.saddr || 0;
+ port = sock.sport || 0;
+ }
+ return { addr: addr, port: port };
+ },sendmsg:function (sock, buffer, offset, length, addr, port) {
+ if (sock.type === 2) {
+ // connection-less sockets will honor the message address,
+ // and otherwise fall back to the bound destination address
+ if (addr === undefined || port === undefined) {
+ addr = sock.daddr;
+ port = sock.dport;
+ }
+ // if there was no address to fall back to, error out
+ if (addr === undefined || port === undefined) {
+ throw new FS.ErrnoError(ERRNO_CODES.EDESTADDRREQ);
+ }
+ } else {
+ // connection-based sockets will only use the bound
+ addr = sock.daddr;
+ port = sock.dport;
+ }
+
+ // find the peer for the destination address
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, addr, port);
+
+ // early out if not connected with a connection-based socket
+ if (sock.type === 1) {
+ if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ } else if (dest.socket.readyState === dest.socket.CONNECTING) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ }
+
+ // create a copy of the incoming data to send, as the WebSocket API
+ // doesn't work entirely with an ArrayBufferView, it'll just send
+ // the entire underlying buffer
+ var data;
+ if (buffer instanceof Array || buffer instanceof ArrayBuffer) {
+ data = buffer.slice(offset, offset + length);
+ } else { // ArrayBufferView
+ data = buffer.buffer.slice(buffer.byteOffset + offset, buffer.byteOffset + offset + length);
+ }
+
+ // if we're emulating a connection-less dgram socket and don't have
+ // a cached connection, queue the buffer to send upon connect and
+ // lie, saying the data was sent now.
+ if (sock.type === 2) {
+ if (!dest || dest.socket.readyState !== dest.socket.OPEN) {
+ // if we're not connected, open a new connection
+ if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ dest = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
+ }
+ dest.dgram_send_queue.push(data);
+ return length;
+ }
+ }
+
+ try {
+ // send the actual data
+ dest.socket.send(data);
+ return length;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ },recvmsg:function (sock, length) {
+ // http://pubs.opengroup.org/onlinepubs/7908799/xns/recvmsg.html
+ if (sock.type === 1 && sock.server) {
+ // tcp servers should not be recv()'ing on the listen socket
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+
+ var queued = sock.recv_queue.shift();
+ if (!queued) {
+ if (sock.type === 1) {
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
+
+ if (!dest) {
+ // if we have a destination address but are not connected, error out
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+ else if (dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ // return null if the socket has closed
+ return null;
+ }
+ else {
+ // else, our socket is in a valid state but truly has nothing available
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ } else {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ }
+
+ // queued.data will be an ArrayBuffer if it's unadulterated, but if it's
+ // requeued TCP data it'll be an ArrayBufferView
+ var queuedLength = queued.data.byteLength || queued.data.length;
+ var queuedOffset = queued.data.byteOffset || 0;
+ var queuedBuffer = queued.data.buffer || queued.data;
+ var bytesRead = Math.min(length, queuedLength);
+ var res = {
+ buffer: new Uint8Array(queuedBuffer, queuedOffset, bytesRead),
+ addr: queued.addr,
+ port: queued.port
+ };
+
+
+ // push back any unread data for TCP connections
+ if (sock.type === 1 && bytesRead < queuedLength) {
+ var bytesRemaining = queuedLength - bytesRead;
+ queued.data = new Uint8Array(queuedBuffer, queuedOffset + bytesRead, bytesRemaining);
+ sock.recv_queue.unshift(queued);
+ }
+
+ return res;
+ }}};function _send(fd, buf, len, flags) {
+ var sock = SOCKFS.getSocket(fd);
+ if (!sock) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ // TODO honor flags
+ return _write(fd, buf, len);
+ }
+
+ function _pwrite(fildes, buf, nbyte, offset) {
+ // ssize_t pwrite(int fildes, const void *buf, size_t nbyte, off_t offset);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
+ var stream = FS.getStream(fildes);
+ if (!stream) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ try {
+ var slab = HEAP8;
+ return FS.write(stream, slab, buf, nbyte, offset);
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }function _write(fildes, buf, nbyte) {
+ // ssize_t write(int fildes, const void *buf, size_t nbyte);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
+ var stream = FS.getStream(fildes);
+ if (!stream) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+
+
+ try {
+ var slab = HEAP8;
+ return FS.write(stream, slab, buf, nbyte);
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }
+
+ function _fileno(stream) {
+ // int fileno(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fileno.html
+ stream = FS.getStreamFromPtr(stream);
+ if (!stream) return -1;
+ return stream.fd;
+ }function _fwrite(ptr, size, nitems, stream) {
+ // size_t fwrite(const void *restrict ptr, size_t size, size_t nitems, FILE *restrict stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fwrite.html
+ var bytesToWrite = nitems * size;
+ if (bytesToWrite == 0) return 0;
+ var fd = _fileno(stream);
+ var bytesWritten = _write(fd, ptr, bytesToWrite);
+ if (bytesWritten == -1) {
+ var streamObj = FS.getStreamFromPtr(stream);
+ if (streamObj) streamObj.error = true;
+ return 0;
+ } else {
+ return Math.floor(bytesWritten / size);
+ }
+ }
+
+
+
+ Module["_strlen"] = _strlen;
+
+ function __reallyNegative(x) {
+ return x < 0 || (x === 0 && (1/x) === -Infinity);
+ }function __formatString(format, varargs) {
+ var textIndex = format;
+ var argIndex = 0;
+ function getNextArg(type) {
+ // NOTE: Explicitly ignoring type safety. Otherwise this fails:
+ // int x = 4; printf("%c\n", (char)x);
+ var ret;
+ if (type === 'double') {
+ ret = HEAPF64[(((varargs)+(argIndex))>>3)];
+ } else if (type == 'i64') {
+ ret = [HEAP32[(((varargs)+(argIndex))>>2)],
+ HEAP32[(((varargs)+(argIndex+4))>>2)]];
+
+ } else {
+ type = 'i32'; // varargs are always i32, i64, or double
+ ret = HEAP32[(((varargs)+(argIndex))>>2)];
+ }
+ argIndex += Runtime.getNativeFieldSize(type);
+ return ret;
+ }
+
+ var ret = [];
+ var curr, next, currArg;
+ while(1) {
+ var startTextIndex = textIndex;
+ curr = HEAP8[(textIndex)];
+ if (curr === 0) break;
+ next = HEAP8[((textIndex+1)|0)];
+ if (curr == 37) {
+ // Handle flags.
+ var flagAlwaysSigned = false;
+ var flagLeftAlign = false;
+ var flagAlternative = false;
+ var flagZeroPad = false;
+ var flagPadSign = false;
+ flagsLoop: while (1) {
+ switch (next) {
+ case 43:
+ flagAlwaysSigned = true;
+ break;
+ case 45:
+ flagLeftAlign = true;
+ break;
+ case 35:
+ flagAlternative = true;
+ break;
+ case 48:
+ if (flagZeroPad) {
+ break flagsLoop;
+ } else {
+ flagZeroPad = true;
+ break;
+ }
+ case 32:
+ flagPadSign = true;
+ break;
+ default:
+ break flagsLoop;
+ }
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ }
+
+ // Handle width.
+ var width = 0;
+ if (next == 42) {
+ width = getNextArg('i32');
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ } else {
+ while (next >= 48 && next <= 57) {
+ width = width * 10 + (next - 48);
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ }
+ }
+
+ // Handle precision.
+ var precisionSet = false, precision = -1;
+ if (next == 46) {
+ precision = 0;
+ precisionSet = true;
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ if (next == 42) {
+ precision = getNextArg('i32');
+ textIndex++;
+ } else {
+ while(1) {
+ var precisionChr = HEAP8[((textIndex+1)|0)];
+ if (precisionChr < 48 ||
+ precisionChr > 57) break;
+ precision = precision * 10 + (precisionChr - 48);
+ textIndex++;
+ }
+ }
+ next = HEAP8[((textIndex+1)|0)];
+ }
+ if (precision < 0) {
+ precision = 6; // Standard default.
+ precisionSet = false;
+ }
+
+ // Handle integer sizes. WARNING: These assume a 32-bit architecture!
+ var argSize;
+ switch (String.fromCharCode(next)) {
+ case 'h':
+ var nextNext = HEAP8[((textIndex+2)|0)];
+ if (nextNext == 104) {
+ textIndex++;
+ argSize = 1; // char (actually i32 in varargs)
+ } else {
+ argSize = 2; // short (actually i32 in varargs)
+ }
+ break;
+ case 'l':
+ var nextNext = HEAP8[((textIndex+2)|0)];
+ if (nextNext == 108) {
+ textIndex++;
+ argSize = 8; // long long
+ } else {
+ argSize = 4; // long
+ }
+ break;
+ case 'L': // long long
+ case 'q': // int64_t
+ case 'j': // intmax_t
+ argSize = 8;
+ break;
+ case 'z': // size_t
+ case 't': // ptrdiff_t
+ case 'I': // signed ptrdiff_t or unsigned size_t
+ argSize = 4;
+ break;
+ default:
+ argSize = null;
+ }
+ if (argSize) textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+
+ // Handle type specifier.
+ switch (String.fromCharCode(next)) {
+ case 'd': case 'i': case 'u': case 'o': case 'x': case 'X': case 'p': {
+ // Integer.
+ var signed = next == 100 || next == 105;
+ argSize = argSize || 4;
+ var currArg = getNextArg('i' + (argSize * 8));
+ var argText;
+ // Flatten i64-1 [low, high] into a (slightly rounded) double
+ if (argSize == 8) {
+ currArg = Runtime.makeBigInt(currArg[0], currArg[1], next == 117);
+ }
+ // Truncate to requested size.
+ if (argSize <= 4) {
+ var limit = Math.pow(256, argSize) - 1;
+ currArg = (signed ? reSign : unSign)(currArg & limit, argSize * 8);
+ }
+ // Format the number.
+ var currAbsArg = Math.abs(currArg);
+ var prefix = '';
+ if (next == 100 || next == 105) {
+ argText = reSign(currArg, 8 * argSize, 1).toString(10);
+ } else if (next == 117) {
+ argText = unSign(currArg, 8 * argSize, 1).toString(10);
+ currArg = Math.abs(currArg);
+ } else if (next == 111) {
+ argText = (flagAlternative ? '0' : '') + currAbsArg.toString(8);
+ } else if (next == 120 || next == 88) {
+ prefix = (flagAlternative && currArg != 0) ? '0x' : '';
+ if (currArg < 0) {
+ // Represent negative numbers in hex as 2's complement.
+ currArg = -currArg;
+ argText = (currAbsArg - 1).toString(16);
+ var buffer = [];
+ for (var i = 0; i < argText.length; i++) {
+ buffer.push((0xF - parseInt(argText[i], 16)).toString(16));
+ }
+ argText = buffer.join('');
+ while (argText.length < argSize * 2) argText = 'f' + argText;
+ } else {
+ argText = currAbsArg.toString(16);
+ }
+ if (next == 88) {
+ prefix = prefix.toUpperCase();
+ argText = argText.toUpperCase();
+ }
+ } else if (next == 112) {
+ if (currAbsArg === 0) {
+ argText = '(nil)';
+ } else {
+ prefix = '0x';
+ argText = currAbsArg.toString(16);
+ }
+ }
+ if (precisionSet) {
+ while (argText.length < precision) {
+ argText = '0' + argText;
+ }
+ }
+
+ // Add sign if needed
+ if (currArg >= 0) {
+ if (flagAlwaysSigned) {
+ prefix = '+' + prefix;
+ } else if (flagPadSign) {
+ prefix = ' ' + prefix;
+ }
+ }
+
+ // Move sign to prefix so we zero-pad after the sign
+ if (argText.charAt(0) == '-') {
+ prefix = '-' + prefix;
+ argText = argText.substr(1);
+ }
+
+ // Add padding.
+ while (prefix.length + argText.length < width) {
+ if (flagLeftAlign) {
+ argText += ' ';
+ } else {
+ if (flagZeroPad) {
+ argText = '0' + argText;
+ } else {
+ prefix = ' ' + prefix;
+ }
+ }
+ }
+
+ // Insert the result into the buffer.
+ argText = prefix + argText;
+ argText.split('').forEach(function(chr) {
+ ret.push(chr.charCodeAt(0));
+ });
+ break;
+ }
+ case 'f': case 'F': case 'e': case 'E': case 'g': case 'G': {
+ // Float.
+ var currArg = getNextArg('double');
+ var argText;
+ if (isNaN(currArg)) {
+ argText = 'nan';
+ flagZeroPad = false;
+ } else if (!isFinite(currArg)) {
+ argText = (currArg < 0 ? '-' : '') + 'inf';
+ flagZeroPad = false;
+ } else {
+ var isGeneral = false;
+ var effectivePrecision = Math.min(precision, 20);
+
+ // Convert g/G to f/F or e/E, as per:
+ // http://pubs.opengroup.org/onlinepubs/9699919799/functions/printf.html
+ if (next == 103 || next == 71) {
+ isGeneral = true;
+ precision = precision || 1;
+ var exponent = parseInt(currArg.toExponential(effectivePrecision).split('e')[1], 10);
+ if (precision > exponent && exponent >= -4) {
+ next = ((next == 103) ? 'f' : 'F').charCodeAt(0);
+ precision -= exponent + 1;
+ } else {
+ next = ((next == 103) ? 'e' : 'E').charCodeAt(0);
+ precision--;
+ }
+ effectivePrecision = Math.min(precision, 20);
+ }
+
+ if (next == 101 || next == 69) {
+ argText = currArg.toExponential(effectivePrecision);
+ // Make sure the exponent has at least 2 digits.
+ if (/[eE][-+]\d$/.test(argText)) {
+ argText = argText.slice(0, -1) + '0' + argText.slice(-1);
+ }
+ } else if (next == 102 || next == 70) {
+ argText = currArg.toFixed(effectivePrecision);
+ if (currArg === 0 && __reallyNegative(currArg)) {
+ argText = '-' + argText;
+ }
+ }
+
+ var parts = argText.split('e');
+ if (isGeneral && !flagAlternative) {
+ // Discard trailing zeros and periods.
+ while (parts[0].length > 1 && parts[0].indexOf('.') != -1 &&
+ (parts[0].slice(-1) == '0' || parts[0].slice(-1) == '.')) {
+ parts[0] = parts[0].slice(0, -1);
+ }
+ } else {
+ // Make sure we have a period in alternative mode.
+ if (flagAlternative && argText.indexOf('.') == -1) parts[0] += '.';
+ // Zero pad until required precision.
+ while (precision > effectivePrecision++) parts[0] += '0';
+ }
+ argText = parts[0] + (parts.length > 1 ? 'e' + parts[1] : '');
+
+ // Capitalize 'E' if needed.
+ if (next == 69) argText = argText.toUpperCase();
+
+ // Add sign.
+ if (currArg >= 0) {
+ if (flagAlwaysSigned) {
+ argText = '+' + argText;
+ } else if (flagPadSign) {
+ argText = ' ' + argText;
+ }
+ }
+ }
+
+ // Add padding.
+ while (argText.length < width) {
+ if (flagLeftAlign) {
+ argText += ' ';
+ } else {
+ if (flagZeroPad && (argText[0] == '-' || argText[0] == '+')) {
+ argText = argText[0] + '0' + argText.slice(1);
+ } else {
+ argText = (flagZeroPad ? '0' : ' ') + argText;
+ }
+ }
+ }
+
+ // Adjust case.
+ if (next < 97) argText = argText.toUpperCase();
+
+ // Insert the result into the buffer.
+ argText.split('').forEach(function(chr) {
+ ret.push(chr.charCodeAt(0));
+ });
+ break;
+ }
+ case 's': {
+ // String.
+ var arg = getNextArg('i8*');
+ var argLength = arg ? _strlen(arg) : '(null)'.length;
+ if (precisionSet) argLength = Math.min(argLength, precision);
+ if (!flagLeftAlign) {
+ while (argLength < width--) {
+ ret.push(32);
+ }
+ }
+ if (arg) {
+ for (var i = 0; i < argLength; i++) {
+ ret.push(HEAPU8[((arg++)|0)]);
+ }
+ } else {
+ ret = ret.concat(intArrayFromString('(null)'.substr(0, argLength), true));
+ }
+ if (flagLeftAlign) {
+ while (argLength < width--) {
+ ret.push(32);
+ }
+ }
+ break;
+ }
+ case 'c': {
+ // Character.
+ if (flagLeftAlign) ret.push(getNextArg('i8'));
+ while (--width > 0) {
+ ret.push(32);
+ }
+ if (!flagLeftAlign) ret.push(getNextArg('i8'));
+ break;
+ }
+ case 'n': {
+ // Write the length written so far to the next parameter.
+ var ptr = getNextArg('i32*');
+ HEAP32[((ptr)>>2)]=ret.length;
+ break;
+ }
+ case '%': {
+ // Literal percent sign.
+ ret.push(curr);
+ break;
+ }
+ default: {
+ // Unknown specifiers remain untouched.
+ for (var i = startTextIndex; i < textIndex + 2; i++) {
+ ret.push(HEAP8[(i)]);
+ }
+ }
+ }
+ textIndex += 2;
+ // TODO: Support a/A (hex float) and m (last error) specifiers.
+ // TODO: Support %1${specifier} for arg selection.
+ } else {
+ ret.push(curr);
+ textIndex += 1;
+ }
+ }
+ return ret;
+ }function _fprintf(stream, format, varargs) {
+ // int fprintf(FILE *restrict stream, const char *restrict format, ...);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
+ var result = __formatString(format, varargs);
+ var stack = Runtime.stackSave();
+ var ret = _fwrite(allocate(result, 'i8', ALLOC_STACK), 1, result.length, stream);
+ Runtime.stackRestore(stack);
+ return ret;
+ }function _printf(format, varargs) {
+ // int printf(const char *restrict format, ...);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
+ var stdout = HEAP32[((_stdout)>>2)];
+ return _fprintf(stdout, format, varargs);
+ }
+
+
+ Module["_memset"] = _memset;
+
+
+
+ function _emscripten_memcpy_big(dest, src, num) {
+ HEAPU8.set(HEAPU8.subarray(src, src+num), dest);
+ return dest;
+ }
+ Module["_memcpy"] = _memcpy;
+
+ function _free() {
+ }
+ Module["_free"] = _free;
+Module["requestFullScreen"] = function Module_requestFullScreen(lockPointer, resizeCanvas) { Browser.requestFullScreen(lockPointer, resizeCanvas) };
+ Module["requestAnimationFrame"] = function Module_requestAnimationFrame(func) { Browser.requestAnimationFrame(func) };
+ Module["setCanvasSize"] = function Module_setCanvasSize(width, height, noUpdates) { Browser.setCanvasSize(width, height, noUpdates) };
+ Module["pauseMainLoop"] = function Module_pauseMainLoop() { Browser.mainLoop.pause() };
+ Module["resumeMainLoop"] = function Module_resumeMainLoop() { Browser.mainLoop.resume() };
+ Module["getUserMedia"] = function Module_getUserMedia() { Browser.getUserMedia() }
+FS.staticInit();__ATINIT__.unshift({ func: function() { if (!Module["noFSInit"] && !FS.init.initialized) FS.init() } });__ATMAIN__.push({ func: function() { FS.ignorePermissions = false } });__ATEXIT__.push({ func: function() { FS.quit() } });Module["FS_createFolder"] = FS.createFolder;Module["FS_createPath"] = FS.createPath;Module["FS_createDataFile"] = FS.createDataFile;Module["FS_createPreloadedFile"] = FS.createPreloadedFile;Module["FS_createLazyFile"] = FS.createLazyFile;Module["FS_createLink"] = FS.createLink;Module["FS_createDevice"] = FS.createDevice;
+___errno_state = Runtime.staticAlloc(4); HEAP32[((___errno_state)>>2)]=0;
+__ATINIT__.unshift({ func: function() { TTY.init() } });__ATEXIT__.push({ func: function() { TTY.shutdown() } });TTY.utf8 = new Runtime.UTF8Processor();
+if (ENVIRONMENT_IS_NODE) { var fs = require("fs"); NODEFS.staticInit(); }
+__ATINIT__.push({ func: function() { SOCKFS.root = FS.mount(SOCKFS, {}, null); } });
+STACK_BASE = STACKTOP = Runtime.alignMemory(STATICTOP);
+
+staticSealed = true; // seal the static portion of memory
+
+STACK_MAX = STACK_BASE + 5242880;
+
+DYNAMIC_BASE = DYNAMICTOP = Runtime.alignMemory(STACK_MAX);
+
+assert(DYNAMIC_BASE < TOTAL_MEMORY, "TOTAL_MEMORY not big enough for stack");
+
+
+var Math_min = Math.min;
+function asmPrintInt(x, y) {
+ Module.print('int ' + x + ',' + y);// + ' ' + new Error().stack);
+}
+function asmPrintFloat(x, y) {
+ Module.print('float ' + x + ',' + y);// + ' ' + new Error().stack);
+}
+// EMSCRIPTEN_START_ASM
+var asm = Wasm.instantiateModuleFromAsm((function Module(global, env, buffer) {
+ 'use asm';
+ var HEAP8 = new global.Int8Array(buffer);
+ var HEAP16 = new global.Int16Array(buffer);
+ var HEAP32 = new global.Int32Array(buffer);
+ var HEAPU8 = new global.Uint8Array(buffer);
+ var HEAPU16 = new global.Uint16Array(buffer);
+ var HEAPU32 = new global.Uint32Array(buffer);
+ var HEAPF32 = new global.Float32Array(buffer);
+ var HEAPF64 = new global.Float64Array(buffer);
+
+ var STACKTOP=env.STACKTOP|0;
+ var STACK_MAX=env.STACK_MAX|0;
+ var tempDoublePtr=env.tempDoublePtr|0;
+ var ABORT=env.ABORT|0;
+
+ var __THREW__ = 0;
+ var threwValue = 0;
+ var setjmpId = 0;
+ var undef = 0;
+ var nan = +env.NaN, inf = +env.Infinity;
+ var tempInt = 0, tempBigInt = 0, tempBigIntP = 0, tempBigIntS = 0, tempBigIntR = 0.0, tempBigIntI = 0, tempBigIntD = 0, tempValue = 0, tempDouble = 0.0;
+
+ var tempRet0 = 0;
+ var tempRet1 = 0;
+ var tempRet2 = 0;
+ var tempRet3 = 0;
+ var tempRet4 = 0;
+ var tempRet5 = 0;
+ var tempRet6 = 0;
+ var tempRet7 = 0;
+ var tempRet8 = 0;
+ var tempRet9 = 0;
+ var Math_floor=global.Math.floor;
+ var Math_abs=global.Math.abs;
+ var Math_sqrt=global.Math.sqrt;
+ var Math_pow=global.Math.pow;
+ var Math_cos=global.Math.cos;
+ var Math_sin=global.Math.sin;
+ var Math_tan=global.Math.tan;
+ var Math_acos=global.Math.acos;
+ var Math_asin=global.Math.asin;
+ var Math_atan=global.Math.atan;
+ var Math_atan2=global.Math.atan2;
+ var Math_exp=global.Math.exp;
+ var Math_log=global.Math.log;
+ var Math_ceil=global.Math.ceil;
+ var Math_imul=global.Math.imul;
+ var abort=env.abort;
+ var assert=env.assert;
+ var asmPrintInt=env.asmPrintInt;
+ var asmPrintFloat=env.asmPrintFloat;
+ var Math_min=env.min;
+ var _free=env._free;
+ var _emscripten_memcpy_big=env._emscripten_memcpy_big;
+ var _printf=env._printf;
+ var _send=env._send;
+ var _pwrite=env._pwrite;
+ var __reallyNegative=env.__reallyNegative;
+ var _fwrite=env._fwrite;
+ var _malloc=env._malloc;
+ var _mkport=env._mkport;
+ var _fprintf=env._fprintf;
+ var ___setErrNo=env.___setErrNo;
+ var __formatString=env.__formatString;
+ var _fileno=env._fileno;
+ var _fflush=env._fflush;
+ var _write=env._write;
+ var tempFloat = 0.0;
+
+// EMSCRIPTEN_START_FUNCS
+function _main(i3, i5) {
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i2 = i1;
+ L1 : do {
+ if ((i3 | 0) > 1) {
+ i3 = HEAP8[HEAP32[i5 + 4 >> 2] | 0] | 0;
+ switch (i3 | 0) {
+ case 50:
+ {
+ i3 = 3500;
+ break L1;
+ }
+ case 51:
+ {
+ i4 = 4;
+ break L1;
+ }
+ case 52:
+ {
+ i3 = 35e3;
+ break L1;
+ }
+ case 53:
+ {
+ i3 = 7e4;
+ break L1;
+ }
+ case 49:
+ {
+ i3 = 550;
+ break L1;
+ }
+ case 48:
+ {
+ i11 = 0;
+ STACKTOP = i1;
+ return i11 | 0;
+ }
+ default:
+ {
+ HEAP32[i2 >> 2] = i3 + -48;
+ _printf(8, i2 | 0) | 0;
+ i11 = -1;
+ STACKTOP = i1;
+ return i11 | 0;
+ }
+ }
+ } else {
+ i4 = 4;
+ }
+ } while (0);
+ if ((i4 | 0) == 4) {
+ i3 = 7e3;
+ }
+ i11 = 0;
+ i8 = 0;
+ i5 = 0;
+ while (1) {
+ i6 = ((i5 | 0) % 5 | 0) + 1 | 0;
+ i4 = ((i5 | 0) % 3 | 0) + 1 | 0;
+ i7 = 0;
+ while (1) {
+ i11 = ((i7 | 0) / (i6 | 0) | 0) + i11 | 0;
+ if (i11 >>> 0 > 1e3) {
+ i11 = (i11 >>> 0) / (i4 >>> 0) | 0;
+ }
+ if ((i7 & 3 | 0) == 0) {
+ i11 = i11 + (Math_imul((i7 & 7 | 0) == 0 ? 1 : -1, i7) | 0) | 0;
+ }
+ i10 = i11 << 16 >> 16;
+ i10 = (Math_imul(i10, i10) | 0) & 255;
+ i9 = i10 + (i8 & 65535) | 0;
+ i7 = i7 + 1 | 0;
+ if ((i7 | 0) == 2e4) {
+ break;
+ } else {
+ i8 = i9;
+ }
+ }
+ i5 = i5 + 1 | 0;
+ if ((i5 | 0) < (i3 | 0)) {
+ i8 = i9;
+ } else {
+ break;
+ }
+ }
+ HEAP32[i2 >> 2] = i11;
+ HEAP32[i2 + 4 >> 2] = i8 + i10 & 65535;
+ _printf(24, i2 | 0) | 0;
+ i11 = 0;
+ STACKTOP = i1;
+ return i11 | 0;
+}
+function _memcpy(i3, i2, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i4 = 0;
+ if ((i1 | 0) >= 4096) return _emscripten_memcpy_big(i3 | 0, i2 | 0, i1 | 0) | 0;
+ i4 = i3 | 0;
+ if ((i3 & 3) == (i2 & 3)) {
+ while (i3 & 3) {
+ if ((i1 | 0) == 0) return i4 | 0;
+ HEAP8[i3] = HEAP8[i2] | 0;
+ i3 = i3 + 1 | 0;
+ i2 = i2 + 1 | 0;
+ i1 = i1 - 1 | 0;
+ }
+ while ((i1 | 0) >= 4) {
+ HEAP32[i3 >> 2] = HEAP32[i2 >> 2];
+ i3 = i3 + 4 | 0;
+ i2 = i2 + 4 | 0;
+ i1 = i1 - 4 | 0;
+ }
+ }
+ while ((i1 | 0) > 0) {
+ HEAP8[i3] = HEAP8[i2] | 0;
+ i3 = i3 + 1 | 0;
+ i2 = i2 + 1 | 0;
+ i1 = i1 - 1 | 0;
+ }
+ return i4 | 0;
+}
+function _memset(i1, i4, i3) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i2 = i1 + i3 | 0;
+ if ((i3 | 0) >= 20) {
+ i4 = i4 & 255;
+ i7 = i1 & 3;
+ i6 = i4 | i4 << 8 | i4 << 16 | i4 << 24;
+ i5 = i2 & ~3;
+ if (i7) {
+ i7 = i1 + 4 - i7 | 0;
+ while ((i1 | 0) < (i7 | 0)) {
+ HEAP8[i1] = i4;
+ i1 = i1 + 1 | 0;
+ }
+ }
+ while ((i1 | 0) < (i5 | 0)) {
+ HEAP32[i1 >> 2] = i6;
+ i1 = i1 + 4 | 0;
+ }
+ }
+ while ((i1 | 0) < (i2 | 0)) {
+ HEAP8[i1] = i4;
+ i1 = i1 + 1 | 0;
+ }
+ return i1 - i3 | 0;
+}
+function copyTempDouble(i1) {
+ i1 = i1 | 0;
+ HEAP8[tempDoublePtr] = HEAP8[i1];
+ HEAP8[tempDoublePtr + 1 | 0] = HEAP8[i1 + 1 | 0];
+ HEAP8[tempDoublePtr + 2 | 0] = HEAP8[i1 + 2 | 0];
+ HEAP8[tempDoublePtr + 3 | 0] = HEAP8[i1 + 3 | 0];
+ HEAP8[tempDoublePtr + 4 | 0] = HEAP8[i1 + 4 | 0];
+ HEAP8[tempDoublePtr + 5 | 0] = HEAP8[i1 + 5 | 0];
+ HEAP8[tempDoublePtr + 6 | 0] = HEAP8[i1 + 6 | 0];
+ HEAP8[tempDoublePtr + 7 | 0] = HEAP8[i1 + 7 | 0];
+}
+function copyTempFloat(i1) {
+ i1 = i1 | 0;
+ HEAP8[tempDoublePtr] = HEAP8[i1];
+ HEAP8[tempDoublePtr + 1 | 0] = HEAP8[i1 + 1 | 0];
+ HEAP8[tempDoublePtr + 2 | 0] = HEAP8[i1 + 2 | 0];
+ HEAP8[tempDoublePtr + 3 | 0] = HEAP8[i1 + 3 | 0];
+}
+function runPostSets() {}
+function _strlen(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = i1;
+ while (HEAP8[i2] | 0) {
+ i2 = i2 + 1 | 0;
+ }
+ return i2 - i1 | 0;
+}
+function stackAlloc(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + i1 | 0;
+ STACKTOP = STACKTOP + 7 & -8;
+ return i2 | 0;
+}
+function setThrew(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ if ((__THREW__ | 0) == 0) {
+ __THREW__ = i1;
+ threwValue = i2;
+ }
+}
+function stackRestore(i1) {
+ i1 = i1 | 0;
+ STACKTOP = i1;
+}
+function setTempRet9(i1) {
+ i1 = i1 | 0;
+ tempRet9 = i1;
+}
+function setTempRet8(i1) {
+ i1 = i1 | 0;
+ tempRet8 = i1;
+}
+function setTempRet7(i1) {
+ i1 = i1 | 0;
+ tempRet7 = i1;
+}
+function setTempRet6(i1) {
+ i1 = i1 | 0;
+ tempRet6 = i1;
+}
+function setTempRet5(i1) {
+ i1 = i1 | 0;
+ tempRet5 = i1;
+}
+function setTempRet4(i1) {
+ i1 = i1 | 0;
+ tempRet4 = i1;
+}
+function setTempRet3(i1) {
+ i1 = i1 | 0;
+ tempRet3 = i1;
+}
+function setTempRet2(i1) {
+ i1 = i1 | 0;
+ tempRet2 = i1;
+}
+function setTempRet1(i1) {
+ i1 = i1 | 0;
+ tempRet1 = i1;
+}
+function setTempRet0(i1) {
+ i1 = i1 | 0;
+ tempRet0 = i1;
+}
+function stackSave() {
+ return STACKTOP | 0;
+}
+
+// EMSCRIPTEN_END_FUNCS
+
+
+ return { _strlen: _strlen, _memcpy: _memcpy, _main: _main, _memset: _memset, runPostSets: runPostSets, stackAlloc: stackAlloc, stackSave: stackSave, stackRestore: stackRestore, setThrew: setThrew, setTempRet0: setTempRet0, setTempRet1: setTempRet1, setTempRet2: setTempRet2, setTempRet3: setTempRet3, setTempRet4: setTempRet4, setTempRet5: setTempRet5, setTempRet6: setTempRet6, setTempRet7: setTempRet7, setTempRet8: setTempRet8, setTempRet9: setTempRet9 };
+}).toString(),
+// EMSCRIPTEN_END_ASM
+{ "Math": Math, "Int8Array": Int8Array, "Int16Array": Int16Array, "Int32Array": Int32Array, "Uint8Array": Uint8Array, "Uint16Array": Uint16Array, "Uint32Array": Uint32Array, "Float32Array": Float32Array, "Float64Array": Float64Array, "abort": abort, "assert": assert, "asmPrintInt": asmPrintInt, "asmPrintFloat": asmPrintFloat, "min": Math_min, "_free": _free, "_emscripten_memcpy_big": _emscripten_memcpy_big, "_printf": _printf, "_send": _send, "_pwrite": _pwrite, "__reallyNegative": __reallyNegative, "_fwrite": _fwrite, "_malloc": _malloc, "_mkport": _mkport, "_fprintf": _fprintf, "___setErrNo": ___setErrNo, "__formatString": __formatString, "_fileno": _fileno, "_fflush": _fflush, "_write": _write, "STACKTOP": STACKTOP, "STACK_MAX": STACK_MAX, "tempDoublePtr": tempDoublePtr, "ABORT": ABORT, "NaN": NaN, "Infinity": Infinity }, buffer);
+var _strlen = Module["_strlen"] = asm["_strlen"];
+var _memcpy = Module["_memcpy"] = asm["_memcpy"];
+var _main = Module["_main"] = asm["_main"];
+var _memset = Module["_memset"] = asm["_memset"];
+var runPostSets = Module["runPostSets"] = asm["runPostSets"];
+
+Runtime.stackAlloc = function(size) { return asm['stackAlloc'](size) };
+Runtime.stackSave = function() { return asm['stackSave']() };
+Runtime.stackRestore = function(top) { asm['stackRestore'](top) };
+
+
+// Warning: printing of i64 values may be slightly rounded! No deep i64 math used, so precise i64 code not included
+var i64Math = null;
+
+// === Auto-generated postamble setup entry stuff ===
+
+if (memoryInitializer) {
+ if (ENVIRONMENT_IS_NODE || ENVIRONMENT_IS_SHELL) {
+ var data = Module['readBinary'](memoryInitializer);
+ HEAPU8.set(data, STATIC_BASE);
+ } else {
+ addRunDependency('memory initializer');
+ Browser.asyncLoad(memoryInitializer, function(data) {
+ HEAPU8.set(data, STATIC_BASE);
+ removeRunDependency('memory initializer');
+ }, function(data) {
+ throw 'could not load memory initializer ' + memoryInitializer;
+ });
+ }
+}
+
+function ExitStatus(status) {
+ this.name = "ExitStatus";
+ this.message = "Program terminated with exit(" + status + ")";
+ this.status = status;
+};
+ExitStatus.prototype = new Error();
+ExitStatus.prototype.constructor = ExitStatus;
+
+var initialStackTop;
+var preloadStartTime = null;
+var calledMain = false;
+
+dependenciesFulfilled = function runCaller() {
+ // If run has never been called, and we should call run (INVOKE_RUN is true, and Module.noInitialRun is not false)
+ if (!Module['calledRun'] && shouldRunNow) run([].concat(Module["arguments"]));
+ if (!Module['calledRun']) dependenciesFulfilled = runCaller; // try this again later, after new deps are fulfilled
+}
+
+Module['callMain'] = Module.callMain = function callMain(args) {
+ assert(runDependencies == 0, 'cannot call main when async dependencies remain! (listen on __ATMAIN__)');
+ assert(__ATPRERUN__.length == 0, 'cannot call main when preRun functions remain to be called');
+
+ args = args || [];
+
+ ensureInitRuntime();
+
+ var argc = args.length+1;
+ function pad() {
+ for (var i = 0; i < 4-1; i++) {
+ argv.push(0);
+ }
+ }
+ var argv = [allocate(intArrayFromString("/bin/this.program"), 'i8', ALLOC_NORMAL) ];
+ pad();
+ for (var i = 0; i < argc-1; i = i + 1) {
+ argv.push(allocate(intArrayFromString(args[i]), 'i8', ALLOC_NORMAL));
+ pad();
+ }
+ argv.push(0);
+ argv = allocate(argv, 'i32', ALLOC_NORMAL);
+
+ initialStackTop = STACKTOP;
+
+ try {
+
+ var ret = Module['_main'](argc, argv, 0);
+
+
+ // if we're not running an evented main loop, it's time to exit
+ if (!Module['noExitRuntime']) {
+ exit(ret);
+ }
+ }
+ catch(e) {
+ if (e instanceof ExitStatus) {
+ // exit() throws this once it's done to make sure execution
+ // has been stopped completely
+ return;
+ } else if (e == 'SimulateInfiniteLoop') {
+ // running an evented main loop, don't immediately exit
+ Module['noExitRuntime'] = true;
+ return;
+ } else {
+ if (e && typeof e === 'object' && e.stack) Module.printErr('exception thrown: ' + [e, e.stack]);
+ throw e;
+ }
+ } finally {
+ calledMain = true;
+ }
+}
+
+
+
+
+function run(args) {
+ args = args || Module['arguments'];
+
+ if (preloadStartTime === null) preloadStartTime = Date.now();
+
+ if (runDependencies > 0) {
+ Module.printErr('run() called, but dependencies remain, so not running');
+ return;
+ }
+
+ preRun();
+
+ if (runDependencies > 0) return; // a preRun added a dependency, run will be called later
+ if (Module['calledRun']) return; // run may have just been called through dependencies being fulfilled just in this very frame
+
+ function doRun() {
+ if (Module['calledRun']) return; // run may have just been called while the async setStatus time below was happening
+ Module['calledRun'] = true;
+
+ ensureInitRuntime();
+
+ preMain();
+
+ if (ENVIRONMENT_IS_WEB && preloadStartTime !== null) {
+ Module.printErr('pre-main prep time: ' + (Date.now() - preloadStartTime) + ' ms');
+ }
+
+ if (Module['_main'] && shouldRunNow) {
+ Module['callMain'](args);
+ }
+
+ postRun();
+ }
+
+ if (Module['setStatus']) {
+ Module['setStatus']('Running...');
+ setTimeout(function() {
+ setTimeout(function() {
+ Module['setStatus']('');
+ }, 1);
+ if (!ABORT) doRun();
+ }, 1);
+ } else {
+ doRun();
+ }
+}
+Module['run'] = Module.run = run;
+
+function exit(status) {
+ ABORT = true;
+ EXITSTATUS = status;
+ STACKTOP = initialStackTop;
+
+ // exit the runtime
+ exitRuntime();
+
+ // TODO We should handle this differently based on environment.
+ // In the browser, the best we can do is throw an exception
+ // to halt execution, but in node we could process.exit and
+ // I'd imagine SM shell would have something equivalent.
+ // This would let us set a proper exit status (which
+ // would be great for checking test exit statuses).
+ // https://github.com/kripken/emscripten/issues/1371
+
+ // throw an exception to halt the current execution
+ throw new ExitStatus(status);
+}
+Module['exit'] = Module.exit = exit;
+
+function abort(text) {
+ if (text) {
+ Module.print(text);
+ Module.printErr(text);
+ }
+
+ ABORT = true;
+ EXITSTATUS = 1;
+
+ var extra = '\nIf this abort() is unexpected, build with -s ASSERTIONS=1 which can give more information.';
+
+ throw 'abort() at ' + stackTrace() + extra;
+}
+Module['abort'] = Module.abort = abort;
+
+// {{PRE_RUN_ADDITIONS}}
+
+if (Module['preInit']) {
+ if (typeof Module['preInit'] == 'function') Module['preInit'] = [Module['preInit']];
+ while (Module['preInit'].length > 0) {
+ Module['preInit'].pop()();
+ }
+}
+
+// shouldRunNow refers to calling main(), not run().
+var shouldRunNow = true;
+if (Module['noInitialRun']) {
+ shouldRunNow = false;
+}
+
+
+run([].concat(Module["arguments"]));
diff --git a/test/mjsunit/wasm/embenchen/fannkuch.js b/test/mjsunit/wasm/embenchen/fannkuch.js
new file mode 100644
index 0000000..8c03a34
--- /dev/null
+++ b/test/mjsunit/wasm/embenchen/fannkuch.js
@@ -0,0 +1,8438 @@
+// Modified embenchen to direct to asm-wasm.
+// Flags: --expose-wasm
+
+var EXPECTED_OUTPUT =
+ '123456789\n' +
+ '213456789\n' +
+ '231456789\n' +
+ '321456789\n' +
+ '312456789\n' +
+ '132456789\n' +
+ '234156789\n' +
+ '324156789\n' +
+ '342156789\n' +
+ '432156789\n' +
+ '423156789\n' +
+ '243156789\n' +
+ '341256789\n' +
+ '431256789\n' +
+ '413256789\n' +
+ '143256789\n' +
+ '134256789\n' +
+ '314256789\n' +
+ '412356789\n' +
+ '142356789\n' +
+ '124356789\n' +
+ '214356789\n' +
+ '241356789\n' +
+ '421356789\n' +
+ '234516789\n' +
+ '324516789\n' +
+ '342516789\n' +
+ '432516789\n' +
+ '423516789\n' +
+ '243516789\n' +
+ 'Pfannkuchen(9) = 30.\n';
+var Module = {
+ arguments: [1],
+ print: function(x) {Module.printBuffer += x + '\n';},
+ preRun: [function() {Module.printBuffer = ''}],
+ postRun: [function() {
+ assertEquals(EXPECTED_OUTPUT, Module.printBuffer);
+ }],
+};
+// The Module object: Our interface to the outside world. We import
+// and export values on it, and do the work to get that through
+// closure compiler if necessary. There are various ways Module can be used:
+// 1. Not defined. We create it here
+// 2. A function parameter, function(Module) { ..generated code.. }
+// 3. pre-run appended it, var Module = {}; ..generated code..
+// 4. External script tag defines var Module.
+// We need to do an eval in order to handle the closure compiler
+// case, where this code here is minified but Module was defined
+// elsewhere (e.g. case 4 above). We also need to check if Module
+// already exists (e.g. case 3 above).
+// Note that if you want to run closure, and also to use Module
+// after the generated code, you will need to define var Module = {};
+// before the code. Then that object will be used in the code, and you
+// can continue to use Module afterwards as well.
+var Module;
+if (!Module) Module = (typeof Module !== 'undefined' ? Module : null) || {};
+
+// Sometimes an existing Module object exists with properties
+// meant to overwrite the default module functionality. Here
+// we collect those properties and reapply _after_ we configure
+// the current environment's defaults to avoid having to be so
+// defensive during initialization.
+var moduleOverrides = {};
+for (var key in Module) {
+ if (Module.hasOwnProperty(key)) {
+ moduleOverrides[key] = Module[key];
+ }
+}
+
+// The environment setup code below is customized to use Module.
+// *** Environment setup code ***
+var ENVIRONMENT_IS_NODE = typeof process === 'object' && typeof require === 'function';
+var ENVIRONMENT_IS_WEB = typeof window === 'object';
+var ENVIRONMENT_IS_WORKER = typeof importScripts === 'function';
+var ENVIRONMENT_IS_SHELL = !ENVIRONMENT_IS_WEB && !ENVIRONMENT_IS_NODE && !ENVIRONMENT_IS_WORKER;
+
+if (ENVIRONMENT_IS_NODE) {
+ // Expose functionality in the same simple way that the shells work
+ // Note that we pollute the global namespace here, otherwise we break in node
+ if (!Module['print']) Module['print'] = function print(x) {
+ process['stdout'].write(x + '\n');
+ };
+ if (!Module['printErr']) Module['printErr'] = function printErr(x) {
+ process['stderr'].write(x + '\n');
+ };
+
+ var nodeFS = require('fs');
+ var nodePath = require('path');
+
+ Module['read'] = function read(filename, binary) {
+ filename = nodePath['normalize'](filename);
+ var ret = nodeFS['readFileSync'](filename);
+ // The path is absolute if the normalized version is the same as the resolved.
+ if (!ret && filename != nodePath['resolve'](filename)) {
+ filename = path.join(__dirname, '..', 'src', filename);
+ ret = nodeFS['readFileSync'](filename);
+ }
+ if (ret && !binary) ret = ret.toString();
+ return ret;
+ };
+
+ Module['readBinary'] = function readBinary(filename) { return Module['read'](filename, true) };
+
+ Module['load'] = function load(f) {
+ globalEval(read(f));
+ };
+
+ Module['arguments'] = process['argv'].slice(2);
+
+ module['exports'] = Module;
+}
+else if (ENVIRONMENT_IS_SHELL) {
+ if (!Module['print']) Module['print'] = print;
+ if (typeof printErr != 'undefined') Module['printErr'] = printErr; // not present in v8 or older sm
+
+ if (typeof read != 'undefined') {
+ Module['read'] = read;
+ } else {
+ Module['read'] = function read() { throw 'no read() available (jsc?)' };
+ }
+
+ Module['readBinary'] = function readBinary(f) {
+ return read(f, 'binary');
+ };
+
+ if (typeof scriptArgs != 'undefined') {
+ Module['arguments'] = scriptArgs;
+ } else if (typeof arguments != 'undefined') {
+ Module['arguments'] = arguments;
+ }
+
+ this['Module'] = Module;
+
+ eval("if (typeof gc === 'function' && gc.toString().indexOf('[native code]') > 0) var gc = undefined"); // wipe out the SpiderMonkey shell 'gc' function, which can confuse closure (uses it as a minified name, and it is then initted to a non-falsey value unexpectedly)
+}
+else if (ENVIRONMENT_IS_WEB || ENVIRONMENT_IS_WORKER) {
+ Module['read'] = function read(url) {
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, false);
+ xhr.send(null);
+ return xhr.responseText;
+ };
+
+ if (typeof arguments != 'undefined') {
+ Module['arguments'] = arguments;
+ }
+
+ if (typeof console !== 'undefined') {
+ if (!Module['print']) Module['print'] = function print(x) {
+ console.log(x);
+ };
+ if (!Module['printErr']) Module['printErr'] = function printErr(x) {
+ console.log(x);
+ };
+ } else {
+ // Probably a worker, and without console.log. We can do very little here...
+ var TRY_USE_DUMP = false;
+ if (!Module['print']) Module['print'] = (TRY_USE_DUMP && (typeof(dump) !== "undefined") ? (function(x) {
+ dump(x);
+ }) : (function(x) {
+ // self.postMessage(x); // enable this if you want stdout to be sent as messages
+ }));
+ }
+
+ if (ENVIRONMENT_IS_WEB) {
+ window['Module'] = Module;
+ } else {
+ Module['load'] = importScripts;
+ }
+}
+else {
+ // Unreachable because SHELL is dependant on the others
+ throw 'Unknown runtime environment. Where are we?';
+}
+
+function globalEval(x) {
+ eval.call(null, x);
+}
+if (!Module['load'] == 'undefined' && Module['read']) {
+ Module['load'] = function load(f) {
+ globalEval(Module['read'](f));
+ };
+}
+if (!Module['print']) {
+ Module['print'] = function(){};
+}
+if (!Module['printErr']) {
+ Module['printErr'] = Module['print'];
+}
+if (!Module['arguments']) {
+ Module['arguments'] = [];
+}
+// *** Environment setup code ***
+
+// Closure helpers
+Module.print = Module['print'];
+Module.printErr = Module['printErr'];
+
+// Callbacks
+Module['preRun'] = [];
+Module['postRun'] = [];
+
+// Merge back in the overrides
+for (var key in moduleOverrides) {
+ if (moduleOverrides.hasOwnProperty(key)) {
+ Module[key] = moduleOverrides[key];
+ }
+}
+
+
+
+// === Auto-generated preamble library stuff ===
+
+//========================================
+// Runtime code shared with compiler
+//========================================
+
+var Runtime = {
+ stackSave: function () {
+ return STACKTOP;
+ },
+ stackRestore: function (stackTop) {
+ STACKTOP = stackTop;
+ },
+ forceAlign: function (target, quantum) {
+ quantum = quantum || 4;
+ if (quantum == 1) return target;
+ if (isNumber(target) && isNumber(quantum)) {
+ return Math.ceil(target/quantum)*quantum;
+ } else if (isNumber(quantum) && isPowerOfTwo(quantum)) {
+ return '(((' +target + ')+' + (quantum-1) + ')&' + -quantum + ')';
+ }
+ return 'Math.ceil((' + target + ')/' + quantum + ')*' + quantum;
+ },
+ isNumberType: function (type) {
+ return type in Runtime.INT_TYPES || type in Runtime.FLOAT_TYPES;
+ },
+ isPointerType: function isPointerType(type) {
+ return type[type.length-1] == '*';
+},
+ isStructType: function isStructType(type) {
+ if (isPointerType(type)) return false;
+ if (isArrayType(type)) return true;
+ if (/<?\{ ?[^}]* ?\}>?/.test(type)) return true; // { i32, i8 } etc. - anonymous struct types
+ // See comment in isStructPointerType()
+ return type[0] == '%';
+},
+ INT_TYPES: {"i1":0,"i8":0,"i16":0,"i32":0,"i64":0},
+ FLOAT_TYPES: {"float":0,"double":0},
+ or64: function (x, y) {
+ var l = (x | 0) | (y | 0);
+ var h = (Math.round(x / 4294967296) | Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ and64: function (x, y) {
+ var l = (x | 0) & (y | 0);
+ var h = (Math.round(x / 4294967296) & Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ xor64: function (x, y) {
+ var l = (x | 0) ^ (y | 0);
+ var h = (Math.round(x / 4294967296) ^ Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ getNativeTypeSize: function (type) {
+ switch (type) {
+ case 'i1': case 'i8': return 1;
+ case 'i16': return 2;
+ case 'i32': return 4;
+ case 'i64': return 8;
+ case 'float': return 4;
+ case 'double': return 8;
+ default: {
+ if (type[type.length-1] === '*') {
+ return Runtime.QUANTUM_SIZE; // A pointer
+ } else if (type[0] === 'i') {
+ var bits = parseInt(type.substr(1));
+ assert(bits % 8 === 0);
+ return bits/8;
+ } else {
+ return 0;
+ }
+ }
+ }
+ },
+ getNativeFieldSize: function (type) {
+ return Math.max(Runtime.getNativeTypeSize(type), Runtime.QUANTUM_SIZE);
+ },
+ dedup: function dedup(items, ident) {
+ var seen = {};
+ if (ident) {
+ return items.filter(function(item) {
+ if (seen[item[ident]]) return false;
+ seen[item[ident]] = true;
+ return true;
+ });
+ } else {
+ return items.filter(function(item) {
+ if (seen[item]) return false;
+ seen[item] = true;
+ return true;
+ });
+ }
+},
+ set: function set() {
+ var args = typeof arguments[0] === 'object' ? arguments[0] : arguments;
+ var ret = {};
+ for (var i = 0; i < args.length; i++) {
+ ret[args[i]] = 0;
+ }
+ return ret;
+},
+ STACK_ALIGN: 8,
+ getAlignSize: function (type, size, vararg) {
+ // we align i64s and doubles on 64-bit boundaries, unlike x86
+ if (!vararg && (type == 'i64' || type == 'double')) return 8;
+ if (!type) return Math.min(size, 8); // align structures internally to 64 bits
+ return Math.min(size || (type ? Runtime.getNativeFieldSize(type) : 0), Runtime.QUANTUM_SIZE);
+ },
+ calculateStructAlignment: function calculateStructAlignment(type) {
+ type.flatSize = 0;
+ type.alignSize = 0;
+ var diffs = [];
+ var prev = -1;
+ var index = 0;
+ type.flatIndexes = type.fields.map(function(field) {
+ index++;
+ var size, alignSize;
+ if (Runtime.isNumberType(field) || Runtime.isPointerType(field)) {
+ size = Runtime.getNativeTypeSize(field); // pack char; char; in structs, also char[X]s.
+ alignSize = Runtime.getAlignSize(field, size);
+ } else if (Runtime.isStructType(field)) {
+ if (field[1] === '0') {
+ // this is [0 x something]. When inside another structure like here, it must be at the end,
+ // and it adds no size
+ // XXX this happens in java-nbody for example... assert(index === type.fields.length, 'zero-length in the middle!');
+ size = 0;
+ if (Types.types[field]) {
+ alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
+ } else {
+ alignSize = type.alignSize || QUANTUM_SIZE;
+ }
+ } else {
+ size = Types.types[field].flatSize;
+ alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
+ }
+ } else if (field[0] == 'b') {
+ // bN, large number field, like a [N x i8]
+ size = field.substr(1)|0;
+ alignSize = 1;
+ } else if (field[0] === '<') {
+ // vector type
+ size = alignSize = Types.types[field].flatSize; // fully aligned
+ } else if (field[0] === 'i') {
+ // illegal integer field, that could not be legalized because it is an internal structure field
+ // it is ok to have such fields, if we just use them as markers of field size and nothing more complex
+ size = alignSize = parseInt(field.substr(1))/8;
+ assert(size % 1 === 0, 'cannot handle non-byte-size field ' + field);
+ } else {
+ assert(false, 'invalid type for calculateStructAlignment');
+ }
+ if (type.packed) alignSize = 1;
+ type.alignSize = Math.max(type.alignSize, alignSize);
+ var curr = Runtime.alignMemory(type.flatSize, alignSize); // if necessary, place this on aligned memory
+ type.flatSize = curr + size;
+ if (prev >= 0) {
+ diffs.push(curr-prev);
+ }
+ prev = curr;
+ return curr;
+ });
+ if (type.name_ && type.name_[0] === '[') {
+ // arrays have 2 elements, so we get the proper difference. then we scale here. that way we avoid
+ // allocating a potentially huge array for [999999 x i8] etc.
+ type.flatSize = parseInt(type.name_.substr(1))*type.flatSize/2;
+ }
+ type.flatSize = Runtime.alignMemory(type.flatSize, type.alignSize);
+ if (diffs.length == 0) {
+ type.flatFactor = type.flatSize;
+ } else if (Runtime.dedup(diffs).length == 1) {
+ type.flatFactor = diffs[0];
+ }
+ type.needsFlattening = (type.flatFactor != 1);
+ return type.flatIndexes;
+ },
+ generateStructInfo: function (struct, typeName, offset) {
+ var type, alignment;
+ if (typeName) {
+ offset = offset || 0;
+ type = (typeof Types === 'undefined' ? Runtime.typeInfo : Types.types)[typeName];
+ if (!type) return null;
+ if (type.fields.length != struct.length) {
+ printErr('Number of named fields must match the type for ' + typeName + ': possibly duplicate struct names. Cannot return structInfo');
+ return null;
+ }
+ alignment = type.flatIndexes;
+ } else {
+ var type = { fields: struct.map(function(item) { return item[0] }) };
+ alignment = Runtime.calculateStructAlignment(type);
+ }
+ var ret = {
+ __size__: type.flatSize
+ };
+ if (typeName) {
+ struct.forEach(function(item, i) {
+ if (typeof item === 'string') {
+ ret[item] = alignment[i] + offset;
+ } else {
+ // embedded struct
+ var key;
+ for (var k in item) key = k;
+ ret[key] = Runtime.generateStructInfo(item[key], type.fields[i], alignment[i]);
+ }
+ });
+ } else {
+ struct.forEach(function(item, i) {
+ ret[item[1]] = alignment[i];
+ });
+ }
+ return ret;
+ },
+ dynCall: function (sig, ptr, args) {
+ if (args && args.length) {
+ if (!args.splice) args = Array.prototype.slice.call(args);
+ args.splice(0, 0, ptr);
+ return Module['dynCall_' + sig].apply(null, args);
+ } else {
+ return Module['dynCall_' + sig].call(null, ptr);
+ }
+ },
+ functionPointers: [],
+ addFunction: function (func) {
+ for (var i = 0; i < Runtime.functionPointers.length; i++) {
+ if (!Runtime.functionPointers[i]) {
+ Runtime.functionPointers[i] = func;
+ return 2*(1 + i);
+ }
+ }
+ throw 'Finished up all reserved function pointers. Use a higher value for RESERVED_FUNCTION_POINTERS.';
+ },
+ removeFunction: function (index) {
+ Runtime.functionPointers[(index-2)/2] = null;
+ },
+ getAsmConst: function (code, numArgs) {
+ // code is a constant string on the heap, so we can cache these
+ if (!Runtime.asmConstCache) Runtime.asmConstCache = {};
+ var func = Runtime.asmConstCache[code];
+ if (func) return func;
+ var args = [];
+ for (var i = 0; i < numArgs; i++) {
+ args.push(String.fromCharCode(36) + i); // $0, $1 etc
+ }
+ var source = Pointer_stringify(code);
+ if (source[0] === '"') {
+ // tolerate EM_ASM("..code..") even though EM_ASM(..code..) is correct
+ if (source.indexOf('"', 1) === source.length-1) {
+ source = source.substr(1, source.length-2);
+ } else {
+ // something invalid happened, e.g. EM_ASM("..code($0)..", input)
+ abort('invalid EM_ASM input |' + source + '|. Please use EM_ASM(..code..) (no quotes) or EM_ASM({ ..code($0).. }, input) (to input values)');
+ }
+ }
+ try {
+ var evalled = eval('(function(' + args.join(',') + '){ ' + source + ' })'); // new Function does not allow upvars in node
+ } catch(e) {
+ Module.printErr('error in executing inline EM_ASM code: ' + e + ' on: \n\n' + source + '\n\nwith args |' + args + '| (make sure to use the right one out of EM_ASM, EM_ASM_ARGS, etc.)');
+ throw e;
+ }
+ return Runtime.asmConstCache[code] = evalled;
+ },
+ warnOnce: function (text) {
+ if (!Runtime.warnOnce.shown) Runtime.warnOnce.shown = {};
+ if (!Runtime.warnOnce.shown[text]) {
+ Runtime.warnOnce.shown[text] = 1;
+ Module.printErr(text);
+ }
+ },
+ funcWrappers: {},
+ getFuncWrapper: function (func, sig) {
+ assert(sig);
+ if (!Runtime.funcWrappers[func]) {
+ Runtime.funcWrappers[func] = function dynCall_wrapper() {
+ return Runtime.dynCall(sig, func, arguments);
+ };
+ }
+ return Runtime.funcWrappers[func];
+ },
+ UTF8Processor: function () {
+ var buffer = [];
+ var needed = 0;
+ this.processCChar = function (code) {
+ code = code & 0xFF;
+
+ if (buffer.length == 0) {
+ if ((code & 0x80) == 0x00) { // 0xxxxxxx
+ return String.fromCharCode(code);
+ }
+ buffer.push(code);
+ if ((code & 0xE0) == 0xC0) { // 110xxxxx
+ needed = 1;
+ } else if ((code & 0xF0) == 0xE0) { // 1110xxxx
+ needed = 2;
+ } else { // 11110xxx
+ needed = 3;
+ }
+ return '';
+ }
+
+ if (needed) {
+ buffer.push(code);
+ needed--;
+ if (needed > 0) return '';
+ }
+
+ var c1 = buffer[0];
+ var c2 = buffer[1];
+ var c3 = buffer[2];
+ var c4 = buffer[3];
+ var ret;
+ if (buffer.length == 2) {
+ ret = String.fromCharCode(((c1 & 0x1F) << 6) | (c2 & 0x3F));
+ } else if (buffer.length == 3) {
+ ret = String.fromCharCode(((c1 & 0x0F) << 12) | ((c2 & 0x3F) << 6) | (c3 & 0x3F));
+ } else {
+ // http://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae
+ var codePoint = ((c1 & 0x07) << 18) | ((c2 & 0x3F) << 12) |
+ ((c3 & 0x3F) << 6) | (c4 & 0x3F);
+ ret = String.fromCharCode(
+ Math.floor((codePoint - 0x10000) / 0x400) + 0xD800,
+ (codePoint - 0x10000) % 0x400 + 0xDC00);
+ }
+ buffer.length = 0;
+ return ret;
+ }
+ this.processJSString = function processJSString(string) {
+ /* TODO: use TextEncoder when present,
+ var encoder = new TextEncoder();
+ encoder['encoding'] = "utf-8";
+ var utf8Array = encoder['encode'](aMsg.data);
+ */
+ string = unescape(encodeURIComponent(string));
+ var ret = [];
+ for (var i = 0; i < string.length; i++) {
+ ret.push(string.charCodeAt(i));
+ }
+ return ret;
+ }
+ },
+ getCompilerSetting: function (name) {
+ throw 'You must build with -s RETAIN_COMPILER_SETTINGS=1 for Runtime.getCompilerSetting or emscripten_get_compiler_setting to work';
+ },
+ stackAlloc: function (size) { var ret = STACKTOP;STACKTOP = (STACKTOP + size)|0;STACKTOP = (((STACKTOP)+7)&-8); return ret; },
+ staticAlloc: function (size) { var ret = STATICTOP;STATICTOP = (STATICTOP + size)|0;STATICTOP = (((STATICTOP)+7)&-8); return ret; },
+ dynamicAlloc: function (size) { var ret = DYNAMICTOP;DYNAMICTOP = (DYNAMICTOP + size)|0;DYNAMICTOP = (((DYNAMICTOP)+7)&-8); if (DYNAMICTOP >= TOTAL_MEMORY) enlargeMemory();; return ret; },
+ alignMemory: function (size,quantum) { var ret = size = Math.ceil((size)/(quantum ? quantum : 8))*(quantum ? quantum : 8); return ret; },
+ makeBigInt: function (low,high,unsigned) { var ret = (unsigned ? ((+((low>>>0)))+((+((high>>>0)))*(+4294967296))) : ((+((low>>>0)))+((+((high|0)))*(+4294967296)))); return ret; },
+ GLOBAL_BASE: 8,
+ QUANTUM_SIZE: 4,
+ __dummy__: 0
+}
+
+
+Module['Runtime'] = Runtime;
+
+
+
+
+
+
+
+
+
+//========================================
+// Runtime essentials
+//========================================
+
+var __THREW__ = 0; // Used in checking for thrown exceptions.
+
+var ABORT = false; // whether we are quitting the application. no code should run after this. set in exit() and abort()
+var EXITSTATUS = 0;
+
+var undef = 0;
+// tempInt is used for 32-bit signed values or smaller. tempBigInt is used
+// for 32-bit unsigned values or more than 32 bits. TODO: audit all uses of tempInt
+var tempValue, tempInt, tempBigInt, tempInt2, tempBigInt2, tempPair, tempBigIntI, tempBigIntR, tempBigIntS, tempBigIntP, tempBigIntD, tempDouble, tempFloat;
+var tempI64, tempI64b;
+var tempRet0, tempRet1, tempRet2, tempRet3, tempRet4, tempRet5, tempRet6, tempRet7, tempRet8, tempRet9;
+
+function assert(condition, text) {
+ if (!condition) {
+ abort('Assertion failed: ' + text);
+ }
+}
+
+var globalScope = this;
+
+// C calling interface. A convenient way to call C functions (in C files, or
+// defined with extern "C").
+//
+// Note: LLVM optimizations can inline and remove functions, after which you will not be
+// able to call them. Closure can also do so. To avoid that, add your function to
+// the exports using something like
+//
+// -s EXPORTED_FUNCTIONS='["_main", "_myfunc"]'
+//
+// @param ident The name of the C function (note that C++ functions will be name-mangled - use extern "C")
+// @param returnType The return type of the function, one of the JS types 'number', 'string' or 'array' (use 'number' for any C pointer, and
+// 'array' for JavaScript arrays and typed arrays; note that arrays are 8-bit).
+// @param argTypes An array of the types of arguments for the function (if there are no arguments, this can be ommitted). Types are as in returnType,
+// except that 'array' is not possible (there is no way for us to know the length of the array)
+// @param args An array of the arguments to the function, as native JS values (as in returnType)
+// Note that string arguments will be stored on the stack (the JS string will become a C string on the stack).
+// @return The return value, as a native JS value (as in returnType)
+function ccall(ident, returnType, argTypes, args) {
+ return ccallFunc(getCFunc(ident), returnType, argTypes, args);
+}
+Module["ccall"] = ccall;
+
+// Returns the C function with a specified identifier (for C++, you need to do manual name mangling)
+function getCFunc(ident) {
+ try {
+ var func = Module['_' + ident]; // closure exported function
+ if (!func) func = eval('_' + ident); // explicit lookup
+ } catch(e) {
+ }
+ assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');
+ return func;
+}
+
+// Internal function that does a C call using a function, not an identifier
+function ccallFunc(func, returnType, argTypes, args) {
+ var stack = 0;
+ function toC(value, type) {
+ if (type == 'string') {
+ if (value === null || value === undefined || value === 0) return 0; // null string
+ value = intArrayFromString(value);
+ type = 'array';
+ }
+ if (type == 'array') {
+ if (!stack) stack = Runtime.stackSave();
+ var ret = Runtime.stackAlloc(value.length);
+ writeArrayToMemory(value, ret);
+ return ret;
+ }
+ return value;
+ }
+ function fromC(value, type) {
+ if (type == 'string') {
+ return Pointer_stringify(value);
+ }
+ assert(type != 'array');
+ return value;
+ }
+ var i = 0;
+ var cArgs = args ? args.map(function(arg) {
+ return toC(arg, argTypes[i++]);
+ }) : [];
+ var ret = fromC(func.apply(null, cArgs), returnType);
+ if (stack) Runtime.stackRestore(stack);
+ return ret;
+}
+
+// Returns a native JS wrapper for a C function. This is similar to ccall, but
+// returns a function you can call repeatedly in a normal way. For example:
+//
+// var my_function = cwrap('my_c_function', 'number', ['number', 'number']);
+// alert(my_function(5, 22));
+// alert(my_function(99, 12));
+//
+function cwrap(ident, returnType, argTypes) {
+ var func = getCFunc(ident);
+ return function() {
+ return ccallFunc(func, returnType, argTypes, Array.prototype.slice.call(arguments));
+ }
+}
+Module["cwrap"] = cwrap;
+
+// Sets a value in memory in a dynamic way at run-time. Uses the
+// type data. This is the same as makeSetValue, except that
+// makeSetValue is done at compile-time and generates the needed
+// code then, whereas this function picks the right code at
+// run-time.
+// Note that setValue and getValue only do *aligned* writes and reads!
+// Note that ccall uses JS types as for defining types, while setValue and
+// getValue need LLVM types ('i8', 'i32') - this is a lower-level operation
+function setValue(ptr, value, type, noSafe) {
+ type = type || 'i8';
+ if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
+ switch(type) {
+ case 'i1': HEAP8[(ptr)]=value; break;
+ case 'i8': HEAP8[(ptr)]=value; break;
+ case 'i16': HEAP16[((ptr)>>1)]=value; break;
+ case 'i32': HEAP32[((ptr)>>2)]=value; break;
+ case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;
+ case 'float': HEAPF32[((ptr)>>2)]=value; break;
+ case 'double': HEAPF64[((ptr)>>3)]=value; break;
+ default: abort('invalid type for setValue: ' + type);
+ }
+}
+Module['setValue'] = setValue;
+
+// Parallel to setValue.
+function getValue(ptr, type, noSafe) {
+ type = type || 'i8';
+ if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
+ switch(type) {
+ case 'i1': return HEAP8[(ptr)];
+ case 'i8': return HEAP8[(ptr)];
+ case 'i16': return HEAP16[((ptr)>>1)];
+ case 'i32': return HEAP32[((ptr)>>2)];
+ case 'i64': return HEAP32[((ptr)>>2)];
+ case 'float': return HEAPF32[((ptr)>>2)];
+ case 'double': return HEAPF64[((ptr)>>3)];
+ default: abort('invalid type for setValue: ' + type);
+ }
+ return null;
+}
+Module['getValue'] = getValue;
+
+var ALLOC_NORMAL = 0; // Tries to use _malloc()
+var ALLOC_STACK = 1; // Lives for the duration of the current function call
+var ALLOC_STATIC = 2; // Cannot be freed
+var ALLOC_DYNAMIC = 3; // Cannot be freed except through sbrk
+var ALLOC_NONE = 4; // Do not allocate
+Module['ALLOC_NORMAL'] = ALLOC_NORMAL;
+Module['ALLOC_STACK'] = ALLOC_STACK;
+Module['ALLOC_STATIC'] = ALLOC_STATIC;
+Module['ALLOC_DYNAMIC'] = ALLOC_DYNAMIC;
+Module['ALLOC_NONE'] = ALLOC_NONE;
+
+// allocate(): This is for internal use. You can use it yourself as well, but the interface
+// is a little tricky (see docs right below). The reason is that it is optimized
+// for multiple syntaxes to save space in generated code. So you should
+// normally not use allocate(), and instead allocate memory using _malloc(),
+// initialize it with setValue(), and so forth.
+// @slab: An array of data, or a number. If a number, then the size of the block to allocate,
+// in *bytes* (note that this is sometimes confusing: the next parameter does not
+// affect this!)
+// @types: Either an array of types, one for each byte (or 0 if no type at that position),
+// or a single type which is used for the entire block. This only matters if there
+// is initial data - if @slab is a number, then this does not matter at all and is
+// ignored.
+// @allocator: How to allocate memory, see ALLOC_*
+function allocate(slab, types, allocator, ptr) {
+ var zeroinit, size;
+ if (typeof slab === 'number') {
+ zeroinit = true;
+ size = slab;
+ } else {
+ zeroinit = false;
+ size = slab.length;
+ }
+
+ var singleType = typeof types === 'string' ? types : null;
+
+ var ret;
+ if (allocator == ALLOC_NONE) {
+ ret = ptr;
+ } else {
+ ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));
+ }
+
+ if (zeroinit) {
+ var ptr = ret, stop;
+ assert((ret & 3) == 0);
+ stop = ret + (size & ~3);
+ for (; ptr < stop; ptr += 4) {
+ HEAP32[((ptr)>>2)]=0;
+ }
+ stop = ret + size;
+ while (ptr < stop) {
+ HEAP8[((ptr++)|0)]=0;
+ }
+ return ret;
+ }
+
+ if (singleType === 'i8') {
+ if (slab.subarray || slab.slice) {
+ HEAPU8.set(slab, ret);
+ } else {
+ HEAPU8.set(new Uint8Array(slab), ret);
+ }
+ return ret;
+ }
+
+ var i = 0, type, typeSize, previousType;
+ while (i < size) {
+ var curr = slab[i];
+
+ if (typeof curr === 'function') {
+ curr = Runtime.getFunctionIndex(curr);
+ }
+
+ type = singleType || types[i];
+ if (type === 0) {
+ i++;
+ continue;
+ }
+
+ if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later
+
+ setValue(ret+i, curr, type);
+
+ // no need to look up size unless type changes, so cache it
+ if (previousType !== type) {
+ typeSize = Runtime.getNativeTypeSize(type);
+ previousType = type;
+ }
+ i += typeSize;
+ }
+
+ return ret;
+}
+Module['allocate'] = allocate;
+
+function Pointer_stringify(ptr, /* optional */ length) {
+ // TODO: use TextDecoder
+ // Find the length, and check for UTF while doing so
+ var hasUtf = false;
+ var t;
+ var i = 0;
+ while (1) {
+ t = HEAPU8[(((ptr)+(i))|0)];
+ if (t >= 128) hasUtf = true;
+ else if (t == 0 && !length) break;
+ i++;
+ if (length && i == length) break;
+ }
+ if (!length) length = i;
+
+ var ret = '';
+
+ if (!hasUtf) {
+ var MAX_CHUNK = 1024; // split up into chunks, because .apply on a huge string can overflow the stack
+ var curr;
+ while (length > 0) {
+ curr = String.fromCharCode.apply(String, HEAPU8.subarray(ptr, ptr + Math.min(length, MAX_CHUNK)));
+ ret = ret ? ret + curr : curr;
+ ptr += MAX_CHUNK;
+ length -= MAX_CHUNK;
+ }
+ return ret;
+ }
+
+ var utf8 = new Runtime.UTF8Processor();
+ for (i = 0; i < length; i++) {
+ t = HEAPU8[(((ptr)+(i))|0)];
+ ret += utf8.processCChar(t);
+ }
+ return ret;
+}
+Module['Pointer_stringify'] = Pointer_stringify;
+
+// Given a pointer 'ptr' to a null-terminated UTF16LE-encoded string in the emscripten HEAP, returns
+// a copy of that string as a Javascript String object.
+function UTF16ToString(ptr) {
+ var i = 0;
+
+ var str = '';
+ while (1) {
+ var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];
+ if (codeUnit == 0)
+ return str;
+ ++i;
+ // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.
+ str += String.fromCharCode(codeUnit);
+ }
+}
+Module['UTF16ToString'] = UTF16ToString;
+
+// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
+// null-terminated and encoded in UTF16LE form. The copy will require at most (str.length*2+1)*2 bytes of space in the HEAP.
+function stringToUTF16(str, outPtr) {
+ for(var i = 0; i < str.length; ++i) {
+ // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.
+ var codeUnit = str.charCodeAt(i); // possibly a lead surrogate
+ HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;
+ }
+ // Null-terminate the pointer to the HEAP.
+ HEAP16[(((outPtr)+(str.length*2))>>1)]=0;
+}
+Module['stringToUTF16'] = stringToUTF16;
+
+// Given a pointer 'ptr' to a null-terminated UTF32LE-encoded string in the emscripten HEAP, returns
+// a copy of that string as a Javascript String object.
+function UTF32ToString(ptr) {
+ var i = 0;
+
+ var str = '';
+ while (1) {
+ var utf32 = HEAP32[(((ptr)+(i*4))>>2)];
+ if (utf32 == 0)
+ return str;
+ ++i;
+ // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.
+ if (utf32 >= 0x10000) {
+ var ch = utf32 - 0x10000;
+ str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));
+ } else {
+ str += String.fromCharCode(utf32);
+ }
+ }
+}
+Module['UTF32ToString'] = UTF32ToString;
+
+// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
+// null-terminated and encoded in UTF32LE form. The copy will require at most (str.length+1)*4 bytes of space in the HEAP,
+// but can use less, since str.length does not return the number of characters in the string, but the number of UTF-16 code units in the string.
+function stringToUTF32(str, outPtr) {
+ var iChar = 0;
+ for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {
+ // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.
+ var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate
+ if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {
+ var trailSurrogate = str.charCodeAt(++iCodeUnit);
+ codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);
+ }
+ HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;
+ ++iChar;
+ }
+ // Null-terminate the pointer to the HEAP.
+ HEAP32[(((outPtr)+(iChar*4))>>2)]=0;
+}
+Module['stringToUTF32'] = stringToUTF32;
+
+function demangle(func) {
+ var i = 3;
+ // params, etc.
+ var basicTypes = {
+ 'v': 'void',
+ 'b': 'bool',
+ 'c': 'char',
+ 's': 'short',
+ 'i': 'int',
+ 'l': 'long',
+ 'f': 'float',
+ 'd': 'double',
+ 'w': 'wchar_t',
+ 'a': 'signed char',
+ 'h': 'unsigned char',
+ 't': 'unsigned short',
+ 'j': 'unsigned int',
+ 'm': 'unsigned long',
+ 'x': 'long long',
+ 'y': 'unsigned long long',
+ 'z': '...'
+ };
+ var subs = [];
+ var first = true;
+ function dump(x) {
+ //return;
+ if (x) Module.print(x);
+ Module.print(func);
+ var pre = '';
+ for (var a = 0; a < i; a++) pre += ' ';
+ Module.print (pre + '^');
+ }
+ function parseNested() {
+ i++;
+ if (func[i] === 'K') i++; // ignore const
+ var parts = [];
+ while (func[i] !== 'E') {
+ if (func[i] === 'S') { // substitution
+ i++;
+ var next = func.indexOf('_', i);
+ var num = func.substring(i, next) || 0;
+ parts.push(subs[num] || '?');
+ i = next+1;
+ continue;
+ }
+ if (func[i] === 'C') { // constructor
+ parts.push(parts[parts.length-1]);
+ i += 2;
+ continue;
+ }
+ var size = parseInt(func.substr(i));
+ var pre = size.toString().length;
+ if (!size || !pre) { i--; break; } // counter i++ below us
+ var curr = func.substr(i + pre, size);
+ parts.push(curr);
+ subs.push(curr);
+ i += pre + size;
+ }
+ i++; // skip E
+ return parts;
+ }
+ function parse(rawList, limit, allowVoid) { // main parser
+ limit = limit || Infinity;
+ var ret = '', list = [];
+ function flushList() {
+ return '(' + list.join(', ') + ')';
+ }
+ var name;
+ if (func[i] === 'N') {
+ // namespaced N-E
+ name = parseNested().join('::');
+ limit--;
+ if (limit === 0) return rawList ? [name] : name;
+ } else {
+ // not namespaced
+ if (func[i] === 'K' || (first && func[i] === 'L')) i++; // ignore const and first 'L'
+ var size = parseInt(func.substr(i));
+ if (size) {
+ var pre = size.toString().length;
+ name = func.substr(i + pre, size);
+ i += pre + size;
+ }
+ }
+ first = false;
+ if (func[i] === 'I') {
+ i++;
+ var iList = parse(true);
+ var iRet = parse(true, 1, true);
+ ret += iRet[0] + ' ' + name + '<' + iList.join(', ') + '>';
+ } else {
+ ret = name;
+ }
+ paramLoop: while (i < func.length && limit-- > 0) {
+ //dump('paramLoop');
+ var c = func[i++];
+ if (c in basicTypes) {
+ list.push(basicTypes[c]);
+ } else {
+ switch (c) {
+ case 'P': list.push(parse(true, 1, true)[0] + '*'); break; // pointer
+ case 'R': list.push(parse(true, 1, true)[0] + '&'); break; // reference
+ case 'L': { // literal
+ i++; // skip basic type
+ var end = func.indexOf('E', i);
+ var size = end - i;
+ list.push(func.substr(i, size));
+ i += size + 2; // size + 'EE'
+ break;
+ }
+ case 'A': { // array
+ var size = parseInt(func.substr(i));
+ i += size.toString().length;
+ if (func[i] !== '_') throw '?';
+ i++; // skip _
+ list.push(parse(true, 1, true)[0] + ' [' + size + ']');
+ break;
+ }
+ case 'E': break paramLoop;
+ default: ret += '?' + c; break paramLoop;
+ }
+ }
+ }
+ if (!allowVoid && list.length === 1 && list[0] === 'void') list = []; // avoid (void)
+ if (rawList) {
+ if (ret) {
+ list.push(ret + '?');
+ }
+ return list;
+ } else {
+ return ret + flushList();
+ }
+ }
+ try {
+ // Special-case the entry point, since its name differs from other name mangling.
+ if (func == 'Object._main' || func == '_main') {
+ return 'main()';
+ }
+ if (typeof func === 'number') func = Pointer_stringify(func);
+ if (func[0] !== '_') return func;
+ if (func[1] !== '_') return func; // C function
+ if (func[2] !== 'Z') return func;
+ switch (func[3]) {
+ case 'n': return 'operator new()';
+ case 'd': return 'operator delete()';
+ }
+ return parse();
+ } catch(e) {
+ return func;
+ }
+}
+
+function demangleAll(text) {
+ return text.replace(/__Z[\w\d_]+/g, function(x) { var y = demangle(x); return x === y ? x : (x + ' [' + y + ']') });
+}
+
+function stackTrace() {
+ var stack = new Error().stack;
+ return stack ? demangleAll(stack) : '(no stack trace available)'; // Stack trace is not available at least on IE10 and Safari 6.
+}
+
+// Memory management
+
+var PAGE_SIZE = 4096;
+function alignMemoryPage(x) {
+ return (x+4095)&-4096;
+}
+
+var HEAP;
+var HEAP8, HEAPU8, HEAP16, HEAPU16, HEAP32, HEAPU32, HEAPF32, HEAPF64;
+
+var STATIC_BASE = 0, STATICTOP = 0, staticSealed = false; // static area
+var STACK_BASE = 0, STACKTOP = 0, STACK_MAX = 0; // stack area
+var DYNAMIC_BASE = 0, DYNAMICTOP = 0; // dynamic area handled by sbrk
+
+function enlargeMemory() {
+ abort('Cannot enlarge memory arrays. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value ' + TOTAL_MEMORY + ', (2) compile with ALLOW_MEMORY_GROWTH which adjusts the size at runtime but prevents some optimizations, or (3) set Module.TOTAL_MEMORY before the program runs.');
+}
+
+var TOTAL_STACK = Module['TOTAL_STACK'] || 5242880;
+var TOTAL_MEMORY = Module['TOTAL_MEMORY'] || 134217728;
+var FAST_MEMORY = Module['FAST_MEMORY'] || 2097152;
+
+var totalMemory = 4096;
+while (totalMemory < TOTAL_MEMORY || totalMemory < 2*TOTAL_STACK) {
+ if (totalMemory < 16*1024*1024) {
+ totalMemory *= 2;
+ } else {
+ totalMemory += 16*1024*1024
+ }
+}
+if (totalMemory !== TOTAL_MEMORY) {
+ Module.printErr('increasing TOTAL_MEMORY to ' + totalMemory + ' to be more reasonable');
+ TOTAL_MEMORY = totalMemory;
+}
+
+// Initialize the runtime's memory
+// check for full engine support (use string 'subarray' to avoid closure compiler confusion)
+assert(typeof Int32Array !== 'undefined' && typeof Float64Array !== 'undefined' && !!(new Int32Array(1)['subarray']) && !!(new Int32Array(1)['set']),
+ 'JS engine does not provide full typed array support');
+
+var buffer = new ArrayBuffer(TOTAL_MEMORY);
+HEAP8 = new Int8Array(buffer);
+HEAP16 = new Int16Array(buffer);
+HEAP32 = new Int32Array(buffer);
+HEAPU8 = new Uint8Array(buffer);
+HEAPU16 = new Uint16Array(buffer);
+HEAPU32 = new Uint32Array(buffer);
+HEAPF32 = new Float32Array(buffer);
+HEAPF64 = new Float64Array(buffer);
+
+// Endianness check (note: assumes compiler arch was little-endian)
+HEAP32[0] = 255;
+assert(HEAPU8[0] === 255 && HEAPU8[3] === 0, 'Typed arrays 2 must be run on a little-endian system');
+
+Module['HEAP'] = HEAP;
+Module['HEAP8'] = HEAP8;
+Module['HEAP16'] = HEAP16;
+Module['HEAP32'] = HEAP32;
+Module['HEAPU8'] = HEAPU8;
+Module['HEAPU16'] = HEAPU16;
+Module['HEAPU32'] = HEAPU32;
+Module['HEAPF32'] = HEAPF32;
+Module['HEAPF64'] = HEAPF64;
+
+function callRuntimeCallbacks(callbacks) {
+ while(callbacks.length > 0) {
+ var callback = callbacks.shift();
+ if (typeof callback == 'function') {
+ callback();
+ continue;
+ }
+ var func = callback.func;
+ if (typeof func === 'number') {
+ if (callback.arg === undefined) {
+ Runtime.dynCall('v', func);
+ } else {
+ Runtime.dynCall('vi', func, [callback.arg]);
+ }
+ } else {
+ func(callback.arg === undefined ? null : callback.arg);
+ }
+ }
+}
+
+var __ATPRERUN__ = []; // functions called before the runtime is initialized
+var __ATINIT__ = []; // functions called during startup
+var __ATMAIN__ = []; // functions called when main() is to be run
+var __ATEXIT__ = []; // functions called during shutdown
+var __ATPOSTRUN__ = []; // functions called after the runtime has exited
+
+var runtimeInitialized = false;
+
+function preRun() {
+ // compatibility - merge in anything from Module['preRun'] at this time
+ if (Module['preRun']) {
+ if (typeof Module['preRun'] == 'function') Module['preRun'] = [Module['preRun']];
+ while (Module['preRun'].length) {
+ addOnPreRun(Module['preRun'].shift());
+ }
+ }
+ callRuntimeCallbacks(__ATPRERUN__);
+}
+
+function ensureInitRuntime() {
+ if (runtimeInitialized) return;
+ runtimeInitialized = true;
+ callRuntimeCallbacks(__ATINIT__);
+}
+
+function preMain() {
+ callRuntimeCallbacks(__ATMAIN__);
+}
+
+function exitRuntime() {
+ callRuntimeCallbacks(__ATEXIT__);
+}
+
+function postRun() {
+ // compatibility - merge in anything from Module['postRun'] at this time
+ if (Module['postRun']) {
+ if (typeof Module['postRun'] == 'function') Module['postRun'] = [Module['postRun']];
+ while (Module['postRun'].length) {
+ addOnPostRun(Module['postRun'].shift());
+ }
+ }
+ callRuntimeCallbacks(__ATPOSTRUN__);
+}
+
+function addOnPreRun(cb) {
+ __ATPRERUN__.unshift(cb);
+}
+Module['addOnPreRun'] = Module.addOnPreRun = addOnPreRun;
+
+function addOnInit(cb) {
+ __ATINIT__.unshift(cb);
+}
+Module['addOnInit'] = Module.addOnInit = addOnInit;
+
+function addOnPreMain(cb) {
+ __ATMAIN__.unshift(cb);
+}
+Module['addOnPreMain'] = Module.addOnPreMain = addOnPreMain;
+
+function addOnExit(cb) {
+ __ATEXIT__.unshift(cb);
+}
+Module['addOnExit'] = Module.addOnExit = addOnExit;
+
+function addOnPostRun(cb) {
+ __ATPOSTRUN__.unshift(cb);
+}
+Module['addOnPostRun'] = Module.addOnPostRun = addOnPostRun;
+
+// Tools
+
+// This processes a JS string into a C-line array of numbers, 0-terminated.
+// For LLVM-originating strings, see parser.js:parseLLVMString function
+function intArrayFromString(stringy, dontAddNull, length /* optional */) {
+ var ret = (new Runtime.UTF8Processor()).processJSString(stringy);
+ if (length) {
+ ret.length = length;
+ }
+ if (!dontAddNull) {
+ ret.push(0);
+ }
+ return ret;
+}
+Module['intArrayFromString'] = intArrayFromString;
+
+function intArrayToString(array) {
+ var ret = [];
+ for (var i = 0; i < array.length; i++) {
+ var chr = array[i];
+ if (chr > 0xFF) {
+ chr &= 0xFF;
+ }
+ ret.push(String.fromCharCode(chr));
+ }
+ return ret.join('');
+}
+Module['intArrayToString'] = intArrayToString;
+
+// Write a Javascript array to somewhere in the heap
+function writeStringToMemory(string, buffer, dontAddNull) {
+ var array = intArrayFromString(string, dontAddNull);
+ var i = 0;
+ while (i < array.length) {
+ var chr = array[i];
+ HEAP8[(((buffer)+(i))|0)]=chr;
+ i = i + 1;
+ }
+}
+Module['writeStringToMemory'] = writeStringToMemory;
+
+function writeArrayToMemory(array, buffer) {
+ for (var i = 0; i < array.length; i++) {
+ HEAP8[(((buffer)+(i))|0)]=array[i];
+ }
+}
+Module['writeArrayToMemory'] = writeArrayToMemory;
+
+function writeAsciiToMemory(str, buffer, dontAddNull) {
+ for (var i = 0; i < str.length; i++) {
+ HEAP8[(((buffer)+(i))|0)]=str.charCodeAt(i);
+ }
+ if (!dontAddNull) HEAP8[(((buffer)+(str.length))|0)]=0;
+}
+Module['writeAsciiToMemory'] = writeAsciiToMemory;
+
+function unSign(value, bits, ignore) {
+ if (value >= 0) {
+ return value;
+ }
+ return bits <= 32 ? 2*Math.abs(1 << (bits-1)) + value // Need some trickery, since if bits == 32, we are right at the limit of the bits JS uses in bitshifts
+ : Math.pow(2, bits) + value;
+}
+function reSign(value, bits, ignore) {
+ if (value <= 0) {
+ return value;
+ }
+ var half = bits <= 32 ? Math.abs(1 << (bits-1)) // abs is needed if bits == 32
+ : Math.pow(2, bits-1);
+ if (value >= half && (bits <= 32 || value > half)) { // for huge values, we can hit the precision limit and always get true here. so don't do that
+ // but, in general there is no perfect solution here. With 64-bit ints, we get rounding and errors
+ // TODO: In i64 mode 1, resign the two parts separately and safely
+ value = -2*half + value; // Cannot bitshift half, as it may be at the limit of the bits JS uses in bitshifts
+ }
+ return value;
+}
+
+// check for imul support, and also for correctness ( https://bugs.webkit.org/show_bug.cgi?id=126345 )
+if (!Math['imul'] || Math['imul'](0xffffffff, 5) !== -5) Math['imul'] = function imul(a, b) {
+ var ah = a >>> 16;
+ var al = a & 0xffff;
+ var bh = b >>> 16;
+ var bl = b & 0xffff;
+ return (al*bl + ((ah*bl + al*bh) << 16))|0;
+};
+Math.imul = Math['imul'];
+
+
+var Math_abs = Math.abs;
+var Math_cos = Math.cos;
+var Math_sin = Math.sin;
+var Math_tan = Math.tan;
+var Math_acos = Math.acos;
+var Math_asin = Math.asin;
+var Math_atan = Math.atan;
+var Math_atan2 = Math.atan2;
+var Math_exp = Math.exp;
+var Math_log = Math.log;
+var Math_sqrt = Math.sqrt;
+var Math_ceil = Math.ceil;
+var Math_floor = Math.floor;
+var Math_pow = Math.pow;
+var Math_imul = Math.imul;
+var Math_fround = Math.fround;
+var Math_min = Math.min;
+
+// A counter of dependencies for calling run(). If we need to
+// do asynchronous work before running, increment this and
+// decrement it. Incrementing must happen in a place like
+// PRE_RUN_ADDITIONS (used by emcc to add file preloading).
+// Note that you can add dependencies in preRun, even though
+// it happens right before run - run will be postponed until
+// the dependencies are met.
+var runDependencies = 0;
+var runDependencyWatcher = null;
+var dependenciesFulfilled = null; // overridden to take different actions when all run dependencies are fulfilled
+
+function addRunDependency(id) {
+ runDependencies++;
+ if (Module['monitorRunDependencies']) {
+ Module['monitorRunDependencies'](runDependencies);
+ }
+}
+Module['addRunDependency'] = addRunDependency;
+function removeRunDependency(id) {
+ runDependencies--;
+ if (Module['monitorRunDependencies']) {
+ Module['monitorRunDependencies'](runDependencies);
+ }
+ if (runDependencies == 0) {
+ if (runDependencyWatcher !== null) {
+ clearInterval(runDependencyWatcher);
+ runDependencyWatcher = null;
+ }
+ if (dependenciesFulfilled) {
+ var callback = dependenciesFulfilled;
+ dependenciesFulfilled = null;
+ callback(); // can add another dependenciesFulfilled
+ }
+ }
+}
+Module['removeRunDependency'] = removeRunDependency;
+
+Module["preloadedImages"] = {}; // maps url to image data
+Module["preloadedAudios"] = {}; // maps url to audio data
+
+
+var memoryInitializer = null;
+
+// === Body ===
+
+
+
+
+
+STATIC_BASE = 8;
+
+STATICTOP = STATIC_BASE + Runtime.alignMemory(547);
+/* global initializers */ __ATINIT__.push();
+
+
+/* memory initializer */ allocate([101,114,114,111,114,58,32,37,100,10,0,0,0,0,0,0,80,102,97,110,110,107,117,99,104,101,110,40,37,100,41,32,61,32,37,100,46,10,0,0,37,100,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], "i8", ALLOC_NONE, Runtime.GLOBAL_BASE);
+
+
+
+
+var tempDoublePtr = Runtime.alignMemory(allocate(12, "i8", ALLOC_STATIC), 8);
+
+assert(tempDoublePtr % 8 == 0);
+
+function copyTempFloat(ptr) { // functions, because inlining this code increases code size too much
+
+ HEAP8[tempDoublePtr] = HEAP8[ptr];
+
+ HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
+
+ HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
+
+ HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
+
+}
+
+function copyTempDouble(ptr) {
+
+ HEAP8[tempDoublePtr] = HEAP8[ptr];
+
+ HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
+
+ HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
+
+ HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
+
+ HEAP8[tempDoublePtr+4] = HEAP8[ptr+4];
+
+ HEAP8[tempDoublePtr+5] = HEAP8[ptr+5];
+
+ HEAP8[tempDoublePtr+6] = HEAP8[ptr+6];
+
+ HEAP8[tempDoublePtr+7] = HEAP8[ptr+7];
+
+}
+
+
+
+
+
+
+ var ERRNO_CODES={EPERM:1,ENOENT:2,ESRCH:3,EINTR:4,EIO:5,ENXIO:6,E2BIG:7,ENOEXEC:8,EBADF:9,ECHILD:10,EAGAIN:11,EWOULDBLOCK:11,ENOMEM:12,EACCES:13,EFAULT:14,ENOTBLK:15,EBUSY:16,EEXIST:17,EXDEV:18,ENODEV:19,ENOTDIR:20,EISDIR:21,EINVAL:22,ENFILE:23,EMFILE:24,ENOTTY:25,ETXTBSY:26,EFBIG:27,ENOSPC:28,ESPIPE:29,EROFS:30,EMLINK:31,EPIPE:32,EDOM:33,ERANGE:34,ENOMSG:42,EIDRM:43,ECHRNG:44,EL2NSYNC:45,EL3HLT:46,EL3RST:47,ELNRNG:48,EUNATCH:49,ENOCSI:50,EL2HLT:51,EDEADLK:35,ENOLCK:37,EBADE:52,EBADR:53,EXFULL:54,ENOANO:55,EBADRQC:56,EBADSLT:57,EDEADLOCK:35,EBFONT:59,ENOSTR:60,ENODATA:61,ETIME:62,ENOSR:63,ENONET:64,ENOPKG:65,EREMOTE:66,ENOLINK:67,EADV:68,ESRMNT:69,ECOMM:70,EPROTO:71,EMULTIHOP:72,EDOTDOT:73,EBADMSG:74,ENOTUNIQ:76,EBADFD:77,EREMCHG:78,ELIBACC:79,ELIBBAD:80,ELIBSCN:81,ELIBMAX:82,ELIBEXEC:83,ENOSYS:38,ENOTEMPTY:39,ENAMETOOLONG:36,ELOOP:40,EOPNOTSUPP:95,EPFNOSUPPORT:96,ECONNRESET:104,ENOBUFS:105,EAFNOSUPPORT:97,EPROTOTYPE:91,ENOTSOCK:88,ENOPROTOOPT:92,ESHUTDOWN:108,ECONNREFUSED:111,EADDRINUSE:98,ECONNABORTED:103,ENETUNREACH:101,ENETDOWN:100,ETIMEDOUT:110,EHOSTDOWN:112,EHOSTUNREACH:113,EINPROGRESS:115,EALREADY:114,EDESTADDRREQ:89,EMSGSIZE:90,EPROTONOSUPPORT:93,ESOCKTNOSUPPORT:94,EADDRNOTAVAIL:99,ENETRESET:102,EISCONN:106,ENOTCONN:107,ETOOMANYREFS:109,EUSERS:87,EDQUOT:122,ESTALE:116,ENOTSUP:95,ENOMEDIUM:123,EILSEQ:84,EOVERFLOW:75,ECANCELED:125,ENOTRECOVERABLE:131,EOWNERDEAD:130,ESTRPIPE:86};
+
+ var ERRNO_MESSAGES={0:"Success",1:"Not super-user",2:"No such file or directory",3:"No such process",4:"Interrupted system call",5:"I/O error",6:"No such device or address",7:"Arg list too long",8:"Exec format error",9:"Bad file number",10:"No children",11:"No more processes",12:"Not enough core",13:"Permission denied",14:"Bad address",15:"Block device required",16:"Mount device busy",17:"File exists",18:"Cross-device link",19:"No such device",20:"Not a directory",21:"Is a directory",22:"Invalid argument",23:"Too many open files in system",24:"Too many open files",25:"Not a typewriter",26:"Text file busy",27:"File too large",28:"No space left on device",29:"Illegal seek",30:"Read only file system",31:"Too many links",32:"Broken pipe",33:"Math arg out of domain of func",34:"Math result not representable",35:"File locking deadlock error",36:"File or path name too long",37:"No record locks available",38:"Function not implemented",39:"Directory not empty",40:"Too many symbolic links",42:"No message of desired type",43:"Identifier removed",44:"Channel number out of range",45:"Level 2 not synchronized",46:"Level 3 halted",47:"Level 3 reset",48:"Link number out of range",49:"Protocol driver not attached",50:"No CSI structure available",51:"Level 2 halted",52:"Invalid exchange",53:"Invalid request descriptor",54:"Exchange full",55:"No anode",56:"Invalid request code",57:"Invalid slot",59:"Bad font file fmt",60:"Device not a stream",61:"No data (for no delay io)",62:"Timer expired",63:"Out of streams resources",64:"Machine is not on the network",65:"Package not installed",66:"The object is remote",67:"The link has been severed",68:"Advertise error",69:"Srmount error",70:"Communication error on send",71:"Protocol error",72:"Multihop attempted",73:"Cross mount point (not really error)",74:"Trying to read unreadable message",75:"Value too large for defined data type",76:"Given log. name not unique",77:"f.d. invalid for this operation",78:"Remote address changed",79:"Can access a needed shared lib",80:"Accessing a corrupted shared lib",81:".lib section in a.out corrupted",82:"Attempting to link in too many libs",83:"Attempting to exec a shared library",84:"Illegal byte sequence",86:"Streams pipe error",87:"Too many users",88:"Socket operation on non-socket",89:"Destination address required",90:"Message too long",91:"Protocol wrong type for socket",92:"Protocol not available",93:"Unknown protocol",94:"Socket type not supported",95:"Not supported",96:"Protocol family not supported",97:"Address family not supported by protocol family",98:"Address already in use",99:"Address not available",100:"Network interface is not configured",101:"Network is unreachable",102:"Connection reset by network",103:"Connection aborted",104:"Connection reset by peer",105:"No buffer space available",106:"Socket is already connected",107:"Socket is not connected",108:"Can't send after socket shutdown",109:"Too many references",110:"Connection timed out",111:"Connection refused",112:"Host is down",113:"Host is unreachable",114:"Socket already connected",115:"Connection already in progress",116:"Stale file handle",122:"Quota exceeded",123:"No medium (in tape drive)",125:"Operation canceled",130:"Previous owner died",131:"State not recoverable"};
+
+
+ var ___errno_state=0;function ___setErrNo(value) {
+ // For convenient setting and returning of errno.
+ HEAP32[((___errno_state)>>2)]=value;
+ return value;
+ }
+
+ var PATH={splitPath:function (filename) {
+ var splitPathRe = /^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/;
+ return splitPathRe.exec(filename).slice(1);
+ },normalizeArray:function (parts, allowAboveRoot) {
+ // if the path tries to go above the root, `up` ends up > 0
+ var up = 0;
+ for (var i = parts.length - 1; i >= 0; i--) {
+ var last = parts[i];
+ if (last === '.') {
+ parts.splice(i, 1);
+ } else if (last === '..') {
+ parts.splice(i, 1);
+ up++;
+ } else if (up) {
+ parts.splice(i, 1);
+ up--;
+ }
+ }
+ // if the path is allowed to go above the root, restore leading ..s
+ if (allowAboveRoot) {
+ for (; up--; up) {
+ parts.unshift('..');
+ }
+ }
+ return parts;
+ },normalize:function (path) {
+ var isAbsolute = path.charAt(0) === '/',
+ trailingSlash = path.substr(-1) === '/';
+ // Normalize the path
+ path = PATH.normalizeArray(path.split('/').filter(function(p) {
+ return !!p;
+ }), !isAbsolute).join('/');
+ if (!path && !isAbsolute) {
+ path = '.';
+ }
+ if (path && trailingSlash) {
+ path += '/';
+ }
+ return (isAbsolute ? '/' : '') + path;
+ },dirname:function (path) {
+ var result = PATH.splitPath(path),
+ root = result[0],
+ dir = result[1];
+ if (!root && !dir) {
+ // No dirname whatsoever
+ return '.';
+ }
+ if (dir) {
+ // It has a dirname, strip trailing slash
+ dir = dir.substr(0, dir.length - 1);
+ }
+ return root + dir;
+ },basename:function (path) {
+ // EMSCRIPTEN return '/'' for '/', not an empty string
+ if (path === '/') return '/';
+ var lastSlash = path.lastIndexOf('/');
+ if (lastSlash === -1) return path;
+ return path.substr(lastSlash+1);
+ },extname:function (path) {
+ return PATH.splitPath(path)[3];
+ },join:function () {
+ var paths = Array.prototype.slice.call(arguments, 0);
+ return PATH.normalize(paths.join('/'));
+ },join2:function (l, r) {
+ return PATH.normalize(l + '/' + r);
+ },resolve:function () {
+ var resolvedPath = '',
+ resolvedAbsolute = false;
+ for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {
+ var path = (i >= 0) ? arguments[i] : FS.cwd();
+ // Skip empty and invalid entries
+ if (typeof path !== 'string') {
+ throw new TypeError('Arguments to path.resolve must be strings');
+ } else if (!path) {
+ continue;
+ }
+ resolvedPath = path + '/' + resolvedPath;
+ resolvedAbsolute = path.charAt(0) === '/';
+ }
+ // At this point the path should be resolved to a full absolute path, but
+ // handle relative paths to be safe (might happen when process.cwd() fails)
+ resolvedPath = PATH.normalizeArray(resolvedPath.split('/').filter(function(p) {
+ return !!p;
+ }), !resolvedAbsolute).join('/');
+ return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.';
+ },relative:function (from, to) {
+ from = PATH.resolve(from).substr(1);
+ to = PATH.resolve(to).substr(1);
+ function trim(arr) {
+ var start = 0;
+ for (; start < arr.length; start++) {
+ if (arr[start] !== '') break;
+ }
+ var end = arr.length - 1;
+ for (; end >= 0; end--) {
+ if (arr[end] !== '') break;
+ }
+ if (start > end) return [];
+ return arr.slice(start, end - start + 1);
+ }
+ var fromParts = trim(from.split('/'));
+ var toParts = trim(to.split('/'));
+ var length = Math.min(fromParts.length, toParts.length);
+ var samePartsLength = length;
+ for (var i = 0; i < length; i++) {
+ if (fromParts[i] !== toParts[i]) {
+ samePartsLength = i;
+ break;
+ }
+ }
+ var outputParts = [];
+ for (var i = samePartsLength; i < fromParts.length; i++) {
+ outputParts.push('..');
+ }
+ outputParts = outputParts.concat(toParts.slice(samePartsLength));
+ return outputParts.join('/');
+ }};
+
+ var TTY={ttys:[],init:function () {
+ // https://github.com/kripken/emscripten/pull/1555
+ // if (ENVIRONMENT_IS_NODE) {
+ // // currently, FS.init does not distinguish if process.stdin is a file or TTY
+ // // device, it always assumes it's a TTY device. because of this, we're forcing
+ // // process.stdin to UTF8 encoding to at least make stdin reading compatible
+ // // with text files until FS.init can be refactored.
+ // process['stdin']['setEncoding']('utf8');
+ // }
+ },shutdown:function () {
+ // https://github.com/kripken/emscripten/pull/1555
+ // if (ENVIRONMENT_IS_NODE) {
+ // // inolen: any idea as to why node -e 'process.stdin.read()' wouldn't exit immediately (with process.stdin being a tty)?
+ // // isaacs: because now it's reading from the stream, you've expressed interest in it, so that read() kicks off a _read() which creates a ReadReq operation
+ // // inolen: I thought read() in that case was a synchronous operation that just grabbed some amount of buffered data if it exists?
+ // // isaacs: it is. but it also triggers a _read() call, which calls readStart() on the handle
+ // // isaacs: do process.stdin.pause() and i'd think it'd probably close the pending call
+ // process['stdin']['pause']();
+ // }
+ },register:function (dev, ops) {
+ TTY.ttys[dev] = { input: [], output: [], ops: ops };
+ FS.registerDevice(dev, TTY.stream_ops);
+ },stream_ops:{open:function (stream) {
+ var tty = TTY.ttys[stream.node.rdev];
+ if (!tty) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ stream.tty = tty;
+ stream.seekable = false;
+ },close:function (stream) {
+ // flush any pending line data
+ if (stream.tty.output.length) {
+ stream.tty.ops.put_char(stream.tty, 10);
+ }
+ },read:function (stream, buffer, offset, length, pos /* ignored */) {
+ if (!stream.tty || !stream.tty.ops.get_char) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
+ }
+ var bytesRead = 0;
+ for (var i = 0; i < length; i++) {
+ var result;
+ try {
+ result = stream.tty.ops.get_char(stream.tty);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ if (result === undefined && bytesRead === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ if (result === null || result === undefined) break;
+ bytesRead++;
+ buffer[offset+i] = result;
+ }
+ if (bytesRead) {
+ stream.node.timestamp = Date.now();
+ }
+ return bytesRead;
+ },write:function (stream, buffer, offset, length, pos) {
+ if (!stream.tty || !stream.tty.ops.put_char) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
+ }
+ for (var i = 0; i < length; i++) {
+ try {
+ stream.tty.ops.put_char(stream.tty, buffer[offset+i]);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ }
+ if (length) {
+ stream.node.timestamp = Date.now();
+ }
+ return i;
+ }},default_tty_ops:{get_char:function (tty) {
+ if (!tty.input.length) {
+ var result = null;
+ if (ENVIRONMENT_IS_NODE) {
+ result = process['stdin']['read']();
+ if (!result) {
+ if (process['stdin']['_readableState'] && process['stdin']['_readableState']['ended']) {
+ return null; // EOF
+ }
+ return undefined; // no data available
+ }
+ } else if (typeof window != 'undefined' &&
+ typeof window.prompt == 'function') {
+ // Browser.
+ result = window.prompt('Input: '); // returns null on cancel
+ if (result !== null) {
+ result += '\n';
+ }
+ } else if (typeof readline == 'function') {
+ // Command line.
+ result = readline();
+ if (result !== null) {
+ result += '\n';
+ }
+ }
+ if (!result) {
+ return null;
+ }
+ tty.input = intArrayFromString(result, true);
+ }
+ return tty.input.shift();
+ },put_char:function (tty, val) {
+ if (val === null || val === 10) {
+ Module['print'](tty.output.join(''));
+ tty.output = [];
+ } else {
+ tty.output.push(TTY.utf8.processCChar(val));
+ }
+ }},default_tty1_ops:{put_char:function (tty, val) {
+ if (val === null || val === 10) {
+ Module['printErr'](tty.output.join(''));
+ tty.output = [];
+ } else {
+ tty.output.push(TTY.utf8.processCChar(val));
+ }
+ }}};
+
+ var MEMFS={ops_table:null,CONTENT_OWNING:1,CONTENT_FLEXIBLE:2,CONTENT_FIXED:3,mount:function (mount) {
+ return MEMFS.createNode(null, '/', 16384 | 511 /* 0777 */, 0);
+ },createNode:function (parent, name, mode, dev) {
+ if (FS.isBlkdev(mode) || FS.isFIFO(mode)) {
+ // no supported
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (!MEMFS.ops_table) {
+ MEMFS.ops_table = {
+ dir: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr,
+ lookup: MEMFS.node_ops.lookup,
+ mknod: MEMFS.node_ops.mknod,
+ rename: MEMFS.node_ops.rename,
+ unlink: MEMFS.node_ops.unlink,
+ rmdir: MEMFS.node_ops.rmdir,
+ readdir: MEMFS.node_ops.readdir,
+ symlink: MEMFS.node_ops.symlink
+ },
+ stream: {
+ llseek: MEMFS.stream_ops.llseek
+ }
+ },
+ file: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr
+ },
+ stream: {
+ llseek: MEMFS.stream_ops.llseek,
+ read: MEMFS.stream_ops.read,
+ write: MEMFS.stream_ops.write,
+ allocate: MEMFS.stream_ops.allocate,
+ mmap: MEMFS.stream_ops.mmap
+ }
+ },
+ link: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr,
+ readlink: MEMFS.node_ops.readlink
+ },
+ stream: {}
+ },
+ chrdev: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr
+ },
+ stream: FS.chrdev_stream_ops
+ },
+ };
+ }
+ var node = FS.createNode(parent, name, mode, dev);
+ if (FS.isDir(node.mode)) {
+ node.node_ops = MEMFS.ops_table.dir.node;
+ node.stream_ops = MEMFS.ops_table.dir.stream;
+ node.contents = {};
+ } else if (FS.isFile(node.mode)) {
+ node.node_ops = MEMFS.ops_table.file.node;
+ node.stream_ops = MEMFS.ops_table.file.stream;
+ node.contents = [];
+ node.contentMode = MEMFS.CONTENT_FLEXIBLE;
+ } else if (FS.isLink(node.mode)) {
+ node.node_ops = MEMFS.ops_table.link.node;
+ node.stream_ops = MEMFS.ops_table.link.stream;
+ } else if (FS.isChrdev(node.mode)) {
+ node.node_ops = MEMFS.ops_table.chrdev.node;
+ node.stream_ops = MEMFS.ops_table.chrdev.stream;
+ }
+ node.timestamp = Date.now();
+ // add the new node to the parent
+ if (parent) {
+ parent.contents[name] = node;
+ }
+ return node;
+ },ensureFlexible:function (node) {
+ if (node.contentMode !== MEMFS.CONTENT_FLEXIBLE) {
+ var contents = node.contents;
+ node.contents = Array.prototype.slice.call(contents);
+ node.contentMode = MEMFS.CONTENT_FLEXIBLE;
+ }
+ },node_ops:{getattr:function (node) {
+ var attr = {};
+ // device numbers reuse inode numbers.
+ attr.dev = FS.isChrdev(node.mode) ? node.id : 1;
+ attr.ino = node.id;
+ attr.mode = node.mode;
+ attr.nlink = 1;
+ attr.uid = 0;
+ attr.gid = 0;
+ attr.rdev = node.rdev;
+ if (FS.isDir(node.mode)) {
+ attr.size = 4096;
+ } else if (FS.isFile(node.mode)) {
+ attr.size = node.contents.length;
+ } else if (FS.isLink(node.mode)) {
+ attr.size = node.link.length;
+ } else {
+ attr.size = 0;
+ }
+ attr.atime = new Date(node.timestamp);
+ attr.mtime = new Date(node.timestamp);
+ attr.ctime = new Date(node.timestamp);
+ // NOTE: In our implementation, st_blocks = Math.ceil(st_size/st_blksize),
+ // but this is not required by the standard.
+ attr.blksize = 4096;
+ attr.blocks = Math.ceil(attr.size / attr.blksize);
+ return attr;
+ },setattr:function (node, attr) {
+ if (attr.mode !== undefined) {
+ node.mode = attr.mode;
+ }
+ if (attr.timestamp !== undefined) {
+ node.timestamp = attr.timestamp;
+ }
+ if (attr.size !== undefined) {
+ MEMFS.ensureFlexible(node);
+ var contents = node.contents;
+ if (attr.size < contents.length) contents.length = attr.size;
+ else while (attr.size > contents.length) contents.push(0);
+ }
+ },lookup:function (parent, name) {
+ throw FS.genericErrors[ERRNO_CODES.ENOENT];
+ },mknod:function (parent, name, mode, dev) {
+ return MEMFS.createNode(parent, name, mode, dev);
+ },rename:function (old_node, new_dir, new_name) {
+ // if we're overwriting a directory at new_name, make sure it's empty.
+ if (FS.isDir(old_node.mode)) {
+ var new_node;
+ try {
+ new_node = FS.lookupNode(new_dir, new_name);
+ } catch (e) {
+ }
+ if (new_node) {
+ for (var i in new_node.contents) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ }
+ }
+ // do the internal rewiring
+ delete old_node.parent.contents[old_node.name];
+ old_node.name = new_name;
+ new_dir.contents[new_name] = old_node;
+ old_node.parent = new_dir;
+ },unlink:function (parent, name) {
+ delete parent.contents[name];
+ },rmdir:function (parent, name) {
+ var node = FS.lookupNode(parent, name);
+ for (var i in node.contents) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ delete parent.contents[name];
+ },readdir:function (node) {
+ var entries = ['.', '..']
+ for (var key in node.contents) {
+ if (!node.contents.hasOwnProperty(key)) {
+ continue;
+ }
+ entries.push(key);
+ }
+ return entries;
+ },symlink:function (parent, newname, oldpath) {
+ var node = MEMFS.createNode(parent, newname, 511 /* 0777 */ | 40960, 0);
+ node.link = oldpath;
+ return node;
+ },readlink:function (node) {
+ if (!FS.isLink(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ return node.link;
+ }},stream_ops:{read:function (stream, buffer, offset, length, position) {
+ var contents = stream.node.contents;
+ if (position >= contents.length)
+ return 0;
+ var size = Math.min(contents.length - position, length);
+ assert(size >= 0);
+ if (size > 8 && contents.subarray) { // non-trivial, and typed array
+ buffer.set(contents.subarray(position, position + size), offset);
+ } else
+ {
+ for (var i = 0; i < size; i++) {
+ buffer[offset + i] = contents[position + i];
+ }
+ }
+ return size;
+ },write:function (stream, buffer, offset, length, position, canOwn) {
+ var node = stream.node;
+ node.timestamp = Date.now();
+ var contents = node.contents;
+ if (length && contents.length === 0 && position === 0 && buffer.subarray) {
+ // just replace it with the new data
+ if (canOwn && offset === 0) {
+ node.contents = buffer; // this could be a subarray of Emscripten HEAP, or allocated from some other source.
+ node.contentMode = (buffer.buffer === HEAP8.buffer) ? MEMFS.CONTENT_OWNING : MEMFS.CONTENT_FIXED;
+ } else {
+ node.contents = new Uint8Array(buffer.subarray(offset, offset+length));
+ node.contentMode = MEMFS.CONTENT_FIXED;
+ }
+ return length;
+ }
+ MEMFS.ensureFlexible(node);
+ var contents = node.contents;
+ while (contents.length < position) contents.push(0);
+ for (var i = 0; i < length; i++) {
+ contents[position + i] = buffer[offset + i];
+ }
+ return length;
+ },llseek:function (stream, offset, whence) {
+ var position = offset;
+ if (whence === 1) { // SEEK_CUR.
+ position += stream.position;
+ } else if (whence === 2) { // SEEK_END.
+ if (FS.isFile(stream.node.mode)) {
+ position += stream.node.contents.length;
+ }
+ }
+ if (position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ stream.ungotten = [];
+ stream.position = position;
+ return position;
+ },allocate:function (stream, offset, length) {
+ MEMFS.ensureFlexible(stream.node);
+ var contents = stream.node.contents;
+ var limit = offset + length;
+ while (limit > contents.length) contents.push(0);
+ },mmap:function (stream, buffer, offset, length, position, prot, flags) {
+ if (!FS.isFile(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ var ptr;
+ var allocated;
+ var contents = stream.node.contents;
+ // Only make a new copy when MAP_PRIVATE is specified.
+ if ( !(flags & 2) &&
+ (contents.buffer === buffer || contents.buffer === buffer.buffer) ) {
+ // We can't emulate MAP_SHARED when the file is not backed by the buffer
+ // we're mapping to (e.g. the HEAP buffer).
+ allocated = false;
+ ptr = contents.byteOffset;
+ } else {
+ // Try to avoid unnecessary slices.
+ if (position > 0 || position + length < contents.length) {
+ if (contents.subarray) {
+ contents = contents.subarray(position, position + length);
+ } else {
+ contents = Array.prototype.slice.call(contents, position, position + length);
+ }
+ }
+ allocated = true;
+ ptr = _malloc(length);
+ if (!ptr) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOMEM);
+ }
+ buffer.set(contents, ptr);
+ }
+ return { ptr: ptr, allocated: allocated };
+ }}};
+
+ var IDBFS={dbs:{},indexedDB:function () {
+ return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
+ },DB_VERSION:21,DB_STORE_NAME:"FILE_DATA",mount:function (mount) {
+ // reuse all of the core MEMFS functionality
+ return MEMFS.mount.apply(null, arguments);
+ },syncfs:function (mount, populate, callback) {
+ IDBFS.getLocalSet(mount, function(err, local) {
+ if (err) return callback(err);
+
+ IDBFS.getRemoteSet(mount, function(err, remote) {
+ if (err) return callback(err);
+
+ var src = populate ? remote : local;
+ var dst = populate ? local : remote;
+
+ IDBFS.reconcile(src, dst, callback);
+ });
+ });
+ },getDB:function (name, callback) {
+ // check the cache first
+ var db = IDBFS.dbs[name];
+ if (db) {
+ return callback(null, db);
+ }
+
+ var req;
+ try {
+ req = IDBFS.indexedDB().open(name, IDBFS.DB_VERSION);
+ } catch (e) {
+ return callback(e);
+ }
+ req.onupgradeneeded = function(e) {
+ var db = e.target.result;
+ var transaction = e.target.transaction;
+
+ var fileStore;
+
+ if (db.objectStoreNames.contains(IDBFS.DB_STORE_NAME)) {
+ fileStore = transaction.objectStore(IDBFS.DB_STORE_NAME);
+ } else {
+ fileStore = db.createObjectStore(IDBFS.DB_STORE_NAME);
+ }
+
+ fileStore.createIndex('timestamp', 'timestamp', { unique: false });
+ };
+ req.onsuccess = function() {
+ db = req.result;
+
+ // add to the cache
+ IDBFS.dbs[name] = db;
+ callback(null, db);
+ };
+ req.onerror = function() {
+ callback(this.error);
+ };
+ },getLocalSet:function (mount, callback) {
+ var entries = {};
+
+ function isRealDir(p) {
+ return p !== '.' && p !== '..';
+ };
+ function toAbsolute(root) {
+ return function(p) {
+ return PATH.join2(root, p);
+ }
+ };
+
+ var check = FS.readdir(mount.mountpoint).filter(isRealDir).map(toAbsolute(mount.mountpoint));
+
+ while (check.length) {
+ var path = check.pop();
+ var stat;
+
+ try {
+ stat = FS.stat(path);
+ } catch (e) {
+ return callback(e);
+ }
+
+ if (FS.isDir(stat.mode)) {
+ check.push.apply(check, FS.readdir(path).filter(isRealDir).map(toAbsolute(path)));
+ }
+
+ entries[path] = { timestamp: stat.mtime };
+ }
+
+ return callback(null, { type: 'local', entries: entries });
+ },getRemoteSet:function (mount, callback) {
+ var entries = {};
+
+ IDBFS.getDB(mount.mountpoint, function(err, db) {
+ if (err) return callback(err);
+
+ var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readonly');
+ transaction.onerror = function() { callback(this.error); };
+
+ var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
+ var index = store.index('timestamp');
+
+ index.openKeyCursor().onsuccess = function(event) {
+ var cursor = event.target.result;
+
+ if (!cursor) {
+ return callback(null, { type: 'remote', db: db, entries: entries });
+ }
+
+ entries[cursor.primaryKey] = { timestamp: cursor.key };
+
+ cursor.continue();
+ };
+ });
+ },loadLocalEntry:function (path, callback) {
+ var stat, node;
+
+ try {
+ var lookup = FS.lookupPath(path);
+ node = lookup.node;
+ stat = FS.stat(path);
+ } catch (e) {
+ return callback(e);
+ }
+
+ if (FS.isDir(stat.mode)) {
+ return callback(null, { timestamp: stat.mtime, mode: stat.mode });
+ } else if (FS.isFile(stat.mode)) {
+ return callback(null, { timestamp: stat.mtime, mode: stat.mode, contents: node.contents });
+ } else {
+ return callback(new Error('node type not supported'));
+ }
+ },storeLocalEntry:function (path, entry, callback) {
+ try {
+ if (FS.isDir(entry.mode)) {
+ FS.mkdir(path, entry.mode);
+ } else if (FS.isFile(entry.mode)) {
+ FS.writeFile(path, entry.contents, { encoding: 'binary', canOwn: true });
+ } else {
+ return callback(new Error('node type not supported'));
+ }
+
+ FS.utime(path, entry.timestamp, entry.timestamp);
+ } catch (e) {
+ return callback(e);
+ }
+
+ callback(null);
+ },removeLocalEntry:function (path, callback) {
+ try {
+ var lookup = FS.lookupPath(path);
+ var stat = FS.stat(path);
+
+ if (FS.isDir(stat.mode)) {
+ FS.rmdir(path);
+ } else if (FS.isFile(stat.mode)) {
+ FS.unlink(path);
+ }
+ } catch (e) {
+ return callback(e);
+ }
+
+ callback(null);
+ },loadRemoteEntry:function (store, path, callback) {
+ var req = store.get(path);
+ req.onsuccess = function(event) { callback(null, event.target.result); };
+ req.onerror = function() { callback(this.error); };
+ },storeRemoteEntry:function (store, path, entry, callback) {
+ var req = store.put(entry, path);
+ req.onsuccess = function() { callback(null); };
+ req.onerror = function() { callback(this.error); };
+ },removeRemoteEntry:function (store, path, callback) {
+ var req = store.delete(path);
+ req.onsuccess = function() { callback(null); };
+ req.onerror = function() { callback(this.error); };
+ },reconcile:function (src, dst, callback) {
+ var total = 0;
+
+ var create = [];
+ Object.keys(src.entries).forEach(function (key) {
+ var e = src.entries[key];
+ var e2 = dst.entries[key];
+ if (!e2 || e.timestamp > e2.timestamp) {
+ create.push(key);
+ total++;
+ }
+ });
+
+ var remove = [];
+ Object.keys(dst.entries).forEach(function (key) {
+ var e = dst.entries[key];
+ var e2 = src.entries[key];
+ if (!e2) {
+ remove.push(key);
+ total++;
+ }
+ });
+
+ if (!total) {
+ return callback(null);
+ }
+
+ var errored = false;
+ var completed = 0;
+ var db = src.type === 'remote' ? src.db : dst.db;
+ var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readwrite');
+ var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
+
+ function done(err) {
+ if (err) {
+ if (!done.errored) {
+ done.errored = true;
+ return callback(err);
+ }
+ return;
+ }
+ if (++completed >= total) {
+ return callback(null);
+ }
+ };
+
+ transaction.onerror = function() { done(this.error); };
+
+ // sort paths in ascending order so directory entries are created
+ // before the files inside them
+ create.sort().forEach(function (path) {
+ if (dst.type === 'local') {
+ IDBFS.loadRemoteEntry(store, path, function (err, entry) {
+ if (err) return done(err);
+ IDBFS.storeLocalEntry(path, entry, done);
+ });
+ } else {
+ IDBFS.loadLocalEntry(path, function (err, entry) {
+ if (err) return done(err);
+ IDBFS.storeRemoteEntry(store, path, entry, done);
+ });
+ }
+ });
+
+ // sort paths in descending order so files are deleted before their
+ // parent directories
+ remove.sort().reverse().forEach(function(path) {
+ if (dst.type === 'local') {
+ IDBFS.removeLocalEntry(path, done);
+ } else {
+ IDBFS.removeRemoteEntry(store, path, done);
+ }
+ });
+ }};
+
+ var NODEFS={isWindows:false,staticInit:function () {
+ NODEFS.isWindows = !!process.platform.match(/^win/);
+ },mount:function (mount) {
+ assert(ENVIRONMENT_IS_NODE);
+ return NODEFS.createNode(null, '/', NODEFS.getMode(mount.opts.root), 0);
+ },createNode:function (parent, name, mode, dev) {
+ if (!FS.isDir(mode) && !FS.isFile(mode) && !FS.isLink(mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var node = FS.createNode(parent, name, mode);
+ node.node_ops = NODEFS.node_ops;
+ node.stream_ops = NODEFS.stream_ops;
+ return node;
+ },getMode:function (path) {
+ var stat;
+ try {
+ stat = fs.lstatSync(path);
+ if (NODEFS.isWindows) {
+ // On Windows, directories return permission bits 'rw-rw-rw-', even though they have 'rwxrwxrwx', so
+ // propagate write bits to execute bits.
+ stat.mode = stat.mode | ((stat.mode & 146) >> 1);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return stat.mode;
+ },realPath:function (node) {
+ var parts = [];
+ while (node.parent !== node) {
+ parts.push(node.name);
+ node = node.parent;
+ }
+ parts.push(node.mount.opts.root);
+ parts.reverse();
+ return PATH.join.apply(null, parts);
+ },flagsToPermissionStringMap:{0:"r",1:"r+",2:"r+",64:"r",65:"r+",66:"r+",129:"rx+",193:"rx+",514:"w+",577:"w",578:"w+",705:"wx",706:"wx+",1024:"a",1025:"a",1026:"a+",1089:"a",1090:"a+",1153:"ax",1154:"ax+",1217:"ax",1218:"ax+",4096:"rs",4098:"rs+"},flagsToPermissionString:function (flags) {
+ if (flags in NODEFS.flagsToPermissionStringMap) {
+ return NODEFS.flagsToPermissionStringMap[flags];
+ } else {
+ return flags;
+ }
+ },node_ops:{getattr:function (node) {
+ var path = NODEFS.realPath(node);
+ var stat;
+ try {
+ stat = fs.lstatSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ // node.js v0.10.20 doesn't report blksize and blocks on Windows. Fake them with default blksize of 4096.
+ // See http://support.microsoft.com/kb/140365
+ if (NODEFS.isWindows && !stat.blksize) {
+ stat.blksize = 4096;
+ }
+ if (NODEFS.isWindows && !stat.blocks) {
+ stat.blocks = (stat.size+stat.blksize-1)/stat.blksize|0;
+ }
+ return {
+ dev: stat.dev,
+ ino: stat.ino,
+ mode: stat.mode,
+ nlink: stat.nlink,
+ uid: stat.uid,
+ gid: stat.gid,
+ rdev: stat.rdev,
+ size: stat.size,
+ atime: stat.atime,
+ mtime: stat.mtime,
+ ctime: stat.ctime,
+ blksize: stat.blksize,
+ blocks: stat.blocks
+ };
+ },setattr:function (node, attr) {
+ var path = NODEFS.realPath(node);
+ try {
+ if (attr.mode !== undefined) {
+ fs.chmodSync(path, attr.mode);
+ // update the common node structure mode as well
+ node.mode = attr.mode;
+ }
+ if (attr.timestamp !== undefined) {
+ var date = new Date(attr.timestamp);
+ fs.utimesSync(path, date, date);
+ }
+ if (attr.size !== undefined) {
+ fs.truncateSync(path, attr.size);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },lookup:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ var mode = NODEFS.getMode(path);
+ return NODEFS.createNode(parent, name, mode);
+ },mknod:function (parent, name, mode, dev) {
+ var node = NODEFS.createNode(parent, name, mode, dev);
+ // create the backing node for this in the fs root as well
+ var path = NODEFS.realPath(node);
+ try {
+ if (FS.isDir(node.mode)) {
+ fs.mkdirSync(path, node.mode);
+ } else {
+ fs.writeFileSync(path, '', { mode: node.mode });
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return node;
+ },rename:function (oldNode, newDir, newName) {
+ var oldPath = NODEFS.realPath(oldNode);
+ var newPath = PATH.join2(NODEFS.realPath(newDir), newName);
+ try {
+ fs.renameSync(oldPath, newPath);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },unlink:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ try {
+ fs.unlinkSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },rmdir:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ try {
+ fs.rmdirSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },readdir:function (node) {
+ var path = NODEFS.realPath(node);
+ try {
+ return fs.readdirSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },symlink:function (parent, newName, oldPath) {
+ var newPath = PATH.join2(NODEFS.realPath(parent), newName);
+ try {
+ fs.symlinkSync(oldPath, newPath);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },readlink:function (node) {
+ var path = NODEFS.realPath(node);
+ try {
+ return fs.readlinkSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ }},stream_ops:{open:function (stream) {
+ var path = NODEFS.realPath(stream.node);
+ try {
+ if (FS.isFile(stream.node.mode)) {
+ stream.nfd = fs.openSync(path, NODEFS.flagsToPermissionString(stream.flags));
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },close:function (stream) {
+ try {
+ if (FS.isFile(stream.node.mode) && stream.nfd) {
+ fs.closeSync(stream.nfd);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },read:function (stream, buffer, offset, length, position) {
+ // FIXME this is terrible.
+ var nbuffer = new Buffer(length);
+ var res;
+ try {
+ res = fs.readSync(stream.nfd, nbuffer, 0, length, position);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ if (res > 0) {
+ for (var i = 0; i < res; i++) {
+ buffer[offset + i] = nbuffer[i];
+ }
+ }
+ return res;
+ },write:function (stream, buffer, offset, length, position) {
+ // FIXME this is terrible.
+ var nbuffer = new Buffer(buffer.subarray(offset, offset + length));
+ var res;
+ try {
+ res = fs.writeSync(stream.nfd, nbuffer, 0, length, position);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return res;
+ },llseek:function (stream, offset, whence) {
+ var position = offset;
+ if (whence === 1) { // SEEK_CUR.
+ position += stream.position;
+ } else if (whence === 2) { // SEEK_END.
+ if (FS.isFile(stream.node.mode)) {
+ try {
+ var stat = fs.fstatSync(stream.nfd);
+ position += stat.size;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ }
+ }
+
+ if (position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+
+ stream.position = position;
+ return position;
+ }}};
+
+ var _stdin=allocate(1, "i32*", ALLOC_STATIC);
+
+ var _stdout=allocate(1, "i32*", ALLOC_STATIC);
+
+ var _stderr=allocate(1, "i32*", ALLOC_STATIC);
+
+ function _fflush(stream) {
+ // int fflush(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fflush.html
+ // we don't currently perform any user-space buffering of data
+ }var FS={root:null,mounts:[],devices:[null],streams:[],nextInode:1,nameTable:null,currentPath:"/",initialized:false,ignorePermissions:true,ErrnoError:null,genericErrors:{},handleFSError:function (e) {
+ if (!(e instanceof FS.ErrnoError)) throw e + ' : ' + stackTrace();
+ return ___setErrNo(e.errno);
+ },lookupPath:function (path, opts) {
+ path = PATH.resolve(FS.cwd(), path);
+ opts = opts || {};
+
+ var defaults = {
+ follow_mount: true,
+ recurse_count: 0
+ };
+ for (var key in defaults) {
+ if (opts[key] === undefined) {
+ opts[key] = defaults[key];
+ }
+ }
+
+ if (opts.recurse_count > 8) { // max recursive lookup of 8
+ throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
+ }
+
+ // split the path
+ var parts = PATH.normalizeArray(path.split('/').filter(function(p) {
+ return !!p;
+ }), false);
+
+ // start at the root
+ var current = FS.root;
+ var current_path = '/';
+
+ for (var i = 0; i < parts.length; i++) {
+ var islast = (i === parts.length-1);
+ if (islast && opts.parent) {
+ // stop resolving
+ break;
+ }
+
+ current = FS.lookupNode(current, parts[i]);
+ current_path = PATH.join2(current_path, parts[i]);
+
+ // jump to the mount's root node if this is a mountpoint
+ if (FS.isMountpoint(current)) {
+ if (!islast || (islast && opts.follow_mount)) {
+ current = current.mounted.root;
+ }
+ }
+
+ // by default, lookupPath will not follow a symlink if it is the final path component.
+ // setting opts.follow = true will override this behavior.
+ if (!islast || opts.follow) {
+ var count = 0;
+ while (FS.isLink(current.mode)) {
+ var link = FS.readlink(current_path);
+ current_path = PATH.resolve(PATH.dirname(current_path), link);
+
+ var lookup = FS.lookupPath(current_path, { recurse_count: opts.recurse_count });
+ current = lookup.node;
+
+ if (count++ > 40) { // limit max consecutive symlinks to 40 (SYMLOOP_MAX).
+ throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
+ }
+ }
+ }
+ }
+
+ return { path: current_path, node: current };
+ },getPath:function (node) {
+ var path;
+ while (true) {
+ if (FS.isRoot(node)) {
+ var mount = node.mount.mountpoint;
+ if (!path) return mount;
+ return mount[mount.length-1] !== '/' ? mount + '/' + path : mount + path;
+ }
+ path = path ? node.name + '/' + path : node.name;
+ node = node.parent;
+ }
+ },hashName:function (parentid, name) {
+ var hash = 0;
+
+
+ for (var i = 0; i < name.length; i++) {
+ hash = ((hash << 5) - hash + name.charCodeAt(i)) | 0;
+ }
+ return ((parentid + hash) >>> 0) % FS.nameTable.length;
+ },hashAddNode:function (node) {
+ var hash = FS.hashName(node.parent.id, node.name);
+ node.name_next = FS.nameTable[hash];
+ FS.nameTable[hash] = node;
+ },hashRemoveNode:function (node) {
+ var hash = FS.hashName(node.parent.id, node.name);
+ if (FS.nameTable[hash] === node) {
+ FS.nameTable[hash] = node.name_next;
+ } else {
+ var current = FS.nameTable[hash];
+ while (current) {
+ if (current.name_next === node) {
+ current.name_next = node.name_next;
+ break;
+ }
+ current = current.name_next;
+ }
+ }
+ },lookupNode:function (parent, name) {
+ var err = FS.mayLookup(parent);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ var hash = FS.hashName(parent.id, name);
+ for (var node = FS.nameTable[hash]; node; node = node.name_next) {
+ var nodeName = node.name;
+ if (node.parent.id === parent.id && nodeName === name) {
+ return node;
+ }
+ }
+ // if we failed to find it in the cache, call into the VFS
+ return FS.lookup(parent, name);
+ },createNode:function (parent, name, mode, rdev) {
+ if (!FS.FSNode) {
+ FS.FSNode = function(parent, name, mode, rdev) {
+ if (!parent) {
+ parent = this; // root node sets parent to itself
+ }
+ this.parent = parent;
+ this.mount = parent.mount;
+ this.mounted = null;
+ this.id = FS.nextInode++;
+ this.name = name;
+ this.mode = mode;
+ this.node_ops = {};
+ this.stream_ops = {};
+ this.rdev = rdev;
+ };
+
+ FS.FSNode.prototype = {};
+
+ // compatibility
+ var readMode = 292 | 73;
+ var writeMode = 146;
+
+ // NOTE we must use Object.defineProperties instead of individual calls to
+ // Object.defineProperty in order to make closure compiler happy
+ Object.defineProperties(FS.FSNode.prototype, {
+ read: {
+ get: function() { return (this.mode & readMode) === readMode; },
+ set: function(val) { val ? this.mode |= readMode : this.mode &= ~readMode; }
+ },
+ write: {
+ get: function() { return (this.mode & writeMode) === writeMode; },
+ set: function(val) { val ? this.mode |= writeMode : this.mode &= ~writeMode; }
+ },
+ isFolder: {
+ get: function() { return FS.isDir(this.mode); },
+ },
+ isDevice: {
+ get: function() { return FS.isChrdev(this.mode); },
+ },
+ });
+ }
+
+ var node = new FS.FSNode(parent, name, mode, rdev);
+
+ FS.hashAddNode(node);
+
+ return node;
+ },destroyNode:function (node) {
+ FS.hashRemoveNode(node);
+ },isRoot:function (node) {
+ return node === node.parent;
+ },isMountpoint:function (node) {
+ return !!node.mounted;
+ },isFile:function (mode) {
+ return (mode & 61440) === 32768;
+ },isDir:function (mode) {
+ return (mode & 61440) === 16384;
+ },isLink:function (mode) {
+ return (mode & 61440) === 40960;
+ },isChrdev:function (mode) {
+ return (mode & 61440) === 8192;
+ },isBlkdev:function (mode) {
+ return (mode & 61440) === 24576;
+ },isFIFO:function (mode) {
+ return (mode & 61440) === 4096;
+ },isSocket:function (mode) {
+ return (mode & 49152) === 49152;
+ },flagModes:{"r":0,"rs":1052672,"r+":2,"w":577,"wx":705,"xw":705,"w+":578,"wx+":706,"xw+":706,"a":1089,"ax":1217,"xa":1217,"a+":1090,"ax+":1218,"xa+":1218},modeStringToFlags:function (str) {
+ var flags = FS.flagModes[str];
+ if (typeof flags === 'undefined') {
+ throw new Error('Unknown file open mode: ' + str);
+ }
+ return flags;
+ },flagsToPermissionString:function (flag) {
+ var accmode = flag & 2097155;
+ var perms = ['r', 'w', 'rw'][accmode];
+ if ((flag & 512)) {
+ perms += 'w';
+ }
+ return perms;
+ },nodePermissions:function (node, perms) {
+ if (FS.ignorePermissions) {
+ return 0;
+ }
+ // return 0 if any user, group or owner bits are set.
+ if (perms.indexOf('r') !== -1 && !(node.mode & 292)) {
+ return ERRNO_CODES.EACCES;
+ } else if (perms.indexOf('w') !== -1 && !(node.mode & 146)) {
+ return ERRNO_CODES.EACCES;
+ } else if (perms.indexOf('x') !== -1 && !(node.mode & 73)) {
+ return ERRNO_CODES.EACCES;
+ }
+ return 0;
+ },mayLookup:function (dir) {
+ return FS.nodePermissions(dir, 'x');
+ },mayCreate:function (dir, name) {
+ try {
+ var node = FS.lookupNode(dir, name);
+ return ERRNO_CODES.EEXIST;
+ } catch (e) {
+ }
+ return FS.nodePermissions(dir, 'wx');
+ },mayDelete:function (dir, name, isdir) {
+ var node;
+ try {
+ node = FS.lookupNode(dir, name);
+ } catch (e) {
+ return e.errno;
+ }
+ var err = FS.nodePermissions(dir, 'wx');
+ if (err) {
+ return err;
+ }
+ if (isdir) {
+ if (!FS.isDir(node.mode)) {
+ return ERRNO_CODES.ENOTDIR;
+ }
+ if (FS.isRoot(node) || FS.getPath(node) === FS.cwd()) {
+ return ERRNO_CODES.EBUSY;
+ }
+ } else {
+ if (FS.isDir(node.mode)) {
+ return ERRNO_CODES.EISDIR;
+ }
+ }
+ return 0;
+ },mayOpen:function (node, flags) {
+ if (!node) {
+ return ERRNO_CODES.ENOENT;
+ }
+ if (FS.isLink(node.mode)) {
+ return ERRNO_CODES.ELOOP;
+ } else if (FS.isDir(node.mode)) {
+ if ((flags & 2097155) !== 0 || // opening for write
+ (flags & 512)) {
+ return ERRNO_CODES.EISDIR;
+ }
+ }
+ return FS.nodePermissions(node, FS.flagsToPermissionString(flags));
+ },MAX_OPEN_FDS:4096,nextfd:function (fd_start, fd_end) {
+ fd_start = fd_start || 0;
+ fd_end = fd_end || FS.MAX_OPEN_FDS;
+ for (var fd = fd_start; fd <= fd_end; fd++) {
+ if (!FS.streams[fd]) {
+ return fd;
+ }
+ }
+ throw new FS.ErrnoError(ERRNO_CODES.EMFILE);
+ },getStream:function (fd) {
+ return FS.streams[fd];
+ },createStream:function (stream, fd_start, fd_end) {
+ if (!FS.FSStream) {
+ FS.FSStream = function(){};
+ FS.FSStream.prototype = {};
+ // compatibility
+ Object.defineProperties(FS.FSStream.prototype, {
+ object: {
+ get: function() { return this.node; },
+ set: function(val) { this.node = val; }
+ },
+ isRead: {
+ get: function() { return (this.flags & 2097155) !== 1; }
+ },
+ isWrite: {
+ get: function() { return (this.flags & 2097155) !== 0; }
+ },
+ isAppend: {
+ get: function() { return (this.flags & 1024); }
+ }
+ });
+ }
+ if (0) {
+ // reuse the object
+ stream.__proto__ = FS.FSStream.prototype;
+ } else {
+ var newStream = new FS.FSStream();
+ for (var p in stream) {
+ newStream[p] = stream[p];
+ }
+ stream = newStream;
+ }
+ var fd = FS.nextfd(fd_start, fd_end);
+ stream.fd = fd;
+ FS.streams[fd] = stream;
+ return stream;
+ },closeStream:function (fd) {
+ FS.streams[fd] = null;
+ },getStreamFromPtr:function (ptr) {
+ return FS.streams[ptr - 1];
+ },getPtrForStream:function (stream) {
+ return stream ? stream.fd + 1 : 0;
+ },chrdev_stream_ops:{open:function (stream) {
+ var device = FS.getDevice(stream.node.rdev);
+ // override node's stream ops with the device's
+ stream.stream_ops = device.stream_ops;
+ // forward the open call
+ if (stream.stream_ops.open) {
+ stream.stream_ops.open(stream);
+ }
+ },llseek:function () {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }},major:function (dev) {
+ return ((dev) >> 8);
+ },minor:function (dev) {
+ return ((dev) & 0xff);
+ },makedev:function (ma, mi) {
+ return ((ma) << 8 | (mi));
+ },registerDevice:function (dev, ops) {
+ FS.devices[dev] = { stream_ops: ops };
+ },getDevice:function (dev) {
+ return FS.devices[dev];
+ },getMounts:function (mount) {
+ var mounts = [];
+ var check = [mount];
+
+ while (check.length) {
+ var m = check.pop();
+
+ mounts.push(m);
+
+ check.push.apply(check, m.mounts);
+ }
+
+ return mounts;
+ },syncfs:function (populate, callback) {
+ if (typeof(populate) === 'function') {
+ callback = populate;
+ populate = false;
+ }
+
+ var mounts = FS.getMounts(FS.root.mount);
+ var completed = 0;
+
+ function done(err) {
+ if (err) {
+ if (!done.errored) {
+ done.errored = true;
+ return callback(err);
+ }
+ return;
+ }
+ if (++completed >= mounts.length) {
+ callback(null);
+ }
+ };
+
+ // sync all mounts
+ mounts.forEach(function (mount) {
+ if (!mount.type.syncfs) {
+ return done(null);
+ }
+ mount.type.syncfs(mount, populate, done);
+ });
+ },mount:function (type, opts, mountpoint) {
+ var root = mountpoint === '/';
+ var pseudo = !mountpoint;
+ var node;
+
+ if (root && FS.root) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ } else if (!root && !pseudo) {
+ var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
+
+ mountpoint = lookup.path; // use the absolute path
+ node = lookup.node;
+
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+
+ if (!FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ }
+
+ var mount = {
+ type: type,
+ opts: opts,
+ mountpoint: mountpoint,
+ mounts: []
+ };
+
+ // create a root node for the fs
+ var mountRoot = type.mount(mount);
+ mountRoot.mount = mount;
+ mount.root = mountRoot;
+
+ if (root) {
+ FS.root = mountRoot;
+ } else if (node) {
+ // set as a mountpoint
+ node.mounted = mount;
+
+ // add the new mount to the current mount's children
+ if (node.mount) {
+ node.mount.mounts.push(mount);
+ }
+ }
+
+ return mountRoot;
+ },unmount:function (mountpoint) {
+ var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
+
+ if (!FS.isMountpoint(lookup.node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+
+ // destroy the nodes for this mount, and all its child mounts
+ var node = lookup.node;
+ var mount = node.mounted;
+ var mounts = FS.getMounts(mount);
+
+ Object.keys(FS.nameTable).forEach(function (hash) {
+ var current = FS.nameTable[hash];
+
+ while (current) {
+ var next = current.name_next;
+
+ if (mounts.indexOf(current.mount) !== -1) {
+ FS.destroyNode(current);
+ }
+
+ current = next;
+ }
+ });
+
+ // no longer a mountpoint
+ node.mounted = null;
+
+ // remove this mount from the child mounts
+ var idx = node.mount.mounts.indexOf(mount);
+ assert(idx !== -1);
+ node.mount.mounts.splice(idx, 1);
+ },lookup:function (parent, name) {
+ return parent.node_ops.lookup(parent, name);
+ },mknod:function (path, mode, dev) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var err = FS.mayCreate(parent, name);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.mknod) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return parent.node_ops.mknod(parent, name, mode, dev);
+ },create:function (path, mode) {
+ mode = mode !== undefined ? mode : 438 /* 0666 */;
+ mode &= 4095;
+ mode |= 32768;
+ return FS.mknod(path, mode, 0);
+ },mkdir:function (path, mode) {
+ mode = mode !== undefined ? mode : 511 /* 0777 */;
+ mode &= 511 | 512;
+ mode |= 16384;
+ return FS.mknod(path, mode, 0);
+ },mkdev:function (path, mode, dev) {
+ if (typeof(dev) === 'undefined') {
+ dev = mode;
+ mode = 438 /* 0666 */;
+ }
+ mode |= 8192;
+ return FS.mknod(path, mode, dev);
+ },symlink:function (oldpath, newpath) {
+ var lookup = FS.lookupPath(newpath, { parent: true });
+ var parent = lookup.node;
+ var newname = PATH.basename(newpath);
+ var err = FS.mayCreate(parent, newname);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.symlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return parent.node_ops.symlink(parent, newname, oldpath);
+ },rename:function (old_path, new_path) {
+ var old_dirname = PATH.dirname(old_path);
+ var new_dirname = PATH.dirname(new_path);
+ var old_name = PATH.basename(old_path);
+ var new_name = PATH.basename(new_path);
+ // parents must exist
+ var lookup, old_dir, new_dir;
+ try {
+ lookup = FS.lookupPath(old_path, { parent: true });
+ old_dir = lookup.node;
+ lookup = FS.lookupPath(new_path, { parent: true });
+ new_dir = lookup.node;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ // need to be part of the same mount
+ if (old_dir.mount !== new_dir.mount) {
+ throw new FS.ErrnoError(ERRNO_CODES.EXDEV);
+ }
+ // source must exist
+ var old_node = FS.lookupNode(old_dir, old_name);
+ // old path should not be an ancestor of the new path
+ var relative = PATH.relative(old_path, new_dirname);
+ if (relative.charAt(0) !== '.') {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ // new path should not be an ancestor of the old path
+ relative = PATH.relative(new_path, old_dirname);
+ if (relative.charAt(0) !== '.') {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ // see if the new path already exists
+ var new_node;
+ try {
+ new_node = FS.lookupNode(new_dir, new_name);
+ } catch (e) {
+ // not fatal
+ }
+ // early out if nothing needs to change
+ if (old_node === new_node) {
+ return;
+ }
+ // we'll need to delete the old entry
+ var isdir = FS.isDir(old_node.mode);
+ var err = FS.mayDelete(old_dir, old_name, isdir);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ // need delete permissions if we'll be overwriting.
+ // need create permissions if new doesn't already exist.
+ err = new_node ?
+ FS.mayDelete(new_dir, new_name, isdir) :
+ FS.mayCreate(new_dir, new_name);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!old_dir.node_ops.rename) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(old_node) || (new_node && FS.isMountpoint(new_node))) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ // if we are going to change the parent, check write permissions
+ if (new_dir !== old_dir) {
+ err = FS.nodePermissions(old_dir, 'w');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ }
+ // remove the node from the lookup hash
+ FS.hashRemoveNode(old_node);
+ // do the underlying fs rename
+ try {
+ old_dir.node_ops.rename(old_node, new_dir, new_name);
+ } catch (e) {
+ throw e;
+ } finally {
+ // add the node back to the hash (in case node_ops.rename
+ // changed its name)
+ FS.hashAddNode(old_node);
+ }
+ },rmdir:function (path) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var node = FS.lookupNode(parent, name);
+ var err = FS.mayDelete(parent, name, true);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.rmdir) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ parent.node_ops.rmdir(parent, name);
+ FS.destroyNode(node);
+ },readdir:function (path) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ var node = lookup.node;
+ if (!node.node_ops.readdir) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ return node.node_ops.readdir(node);
+ },unlink:function (path) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var node = FS.lookupNode(parent, name);
+ var err = FS.mayDelete(parent, name, false);
+ if (err) {
+ // POSIX says unlink should set EPERM, not EISDIR
+ if (err === ERRNO_CODES.EISDIR) err = ERRNO_CODES.EPERM;
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.unlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ parent.node_ops.unlink(parent, name);
+ FS.destroyNode(node);
+ },readlink:function (path) {
+ var lookup = FS.lookupPath(path);
+ var link = lookup.node;
+ if (!link.node_ops.readlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ return link.node_ops.readlink(link);
+ },stat:function (path, dontFollow) {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ var node = lookup.node;
+ if (!node.node_ops.getattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return node.node_ops.getattr(node);
+ },lstat:function (path) {
+ return FS.stat(path, true);
+ },chmod:function (path, mode, dontFollow) {
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ node.node_ops.setattr(node, {
+ mode: (mode & 4095) | (node.mode & ~4095),
+ timestamp: Date.now()
+ });
+ },lchmod:function (path, mode) {
+ FS.chmod(path, mode, true);
+ },fchmod:function (fd, mode) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ FS.chmod(stream.node, mode);
+ },chown:function (path, uid, gid, dontFollow) {
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ node.node_ops.setattr(node, {
+ timestamp: Date.now()
+ // we ignore the uid / gid for now
+ });
+ },lchown:function (path, uid, gid) {
+ FS.chown(path, uid, gid, true);
+ },fchown:function (fd, uid, gid) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ FS.chown(stream.node, uid, gid);
+ },truncate:function (path, len) {
+ if (len < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: true });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!FS.isFile(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var err = FS.nodePermissions(node, 'w');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ node.node_ops.setattr(node, {
+ size: len,
+ timestamp: Date.now()
+ });
+ },ftruncate:function (fd, len) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ FS.truncate(stream.node, len);
+ },utime:function (path, atime, mtime) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ var node = lookup.node;
+ node.node_ops.setattr(node, {
+ timestamp: Math.max(atime, mtime)
+ });
+ },open:function (path, flags, mode, fd_start, fd_end) {
+ flags = typeof flags === 'string' ? FS.modeStringToFlags(flags) : flags;
+ mode = typeof mode === 'undefined' ? 438 /* 0666 */ : mode;
+ if ((flags & 64)) {
+ mode = (mode & 4095) | 32768;
+ } else {
+ mode = 0;
+ }
+ var node;
+ if (typeof path === 'object') {
+ node = path;
+ } else {
+ path = PATH.normalize(path);
+ try {
+ var lookup = FS.lookupPath(path, {
+ follow: !(flags & 131072)
+ });
+ node = lookup.node;
+ } catch (e) {
+ // ignore
+ }
+ }
+ // perhaps we need to create the node
+ if ((flags & 64)) {
+ if (node) {
+ // if O_CREAT and O_EXCL are set, error out if the node already exists
+ if ((flags & 128)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EEXIST);
+ }
+ } else {
+ // node doesn't exist, try to create it
+ node = FS.mknod(path, mode, 0);
+ }
+ }
+ if (!node) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
+ }
+ // can't truncate a device
+ if (FS.isChrdev(node.mode)) {
+ flags &= ~512;
+ }
+ // check permissions
+ var err = FS.mayOpen(node, flags);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ // do truncation if necessary
+ if ((flags & 512)) {
+ FS.truncate(node, 0);
+ }
+ // we've already handled these, don't pass down to the underlying vfs
+ flags &= ~(128 | 512);
+
+ // register the stream with the filesystem
+ var stream = FS.createStream({
+ node: node,
+ path: FS.getPath(node), // we want the absolute path to the node
+ flags: flags,
+ seekable: true,
+ position: 0,
+ stream_ops: node.stream_ops,
+ // used by the file family libc calls (fopen, fwrite, ferror, etc.)
+ ungotten: [],
+ error: false
+ }, fd_start, fd_end);
+ // call the new stream's open function
+ if (stream.stream_ops.open) {
+ stream.stream_ops.open(stream);
+ }
+ if (Module['logReadFiles'] && !(flags & 1)) {
+ if (!FS.readFiles) FS.readFiles = {};
+ if (!(path in FS.readFiles)) {
+ FS.readFiles[path] = 1;
+ Module['printErr']('read file: ' + path);
+ }
+ }
+ return stream;
+ },close:function (stream) {
+ try {
+ if (stream.stream_ops.close) {
+ stream.stream_ops.close(stream);
+ }
+ } catch (e) {
+ throw e;
+ } finally {
+ FS.closeStream(stream.fd);
+ }
+ },llseek:function (stream, offset, whence) {
+ if (!stream.seekable || !stream.stream_ops.llseek) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ return stream.stream_ops.llseek(stream, offset, whence);
+ },read:function (stream, buffer, offset, length, position) {
+ if (length < 0 || position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 1) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (FS.isDir(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!stream.stream_ops.read) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var seeking = true;
+ if (typeof position === 'undefined') {
+ position = stream.position;
+ seeking = false;
+ } else if (!stream.seekable) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ var bytesRead = stream.stream_ops.read(stream, buffer, offset, length, position);
+ if (!seeking) stream.position += bytesRead;
+ return bytesRead;
+ },write:function (stream, buffer, offset, length, position, canOwn) {
+ if (length < 0 || position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (FS.isDir(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!stream.stream_ops.write) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var seeking = true;
+ if (typeof position === 'undefined') {
+ position = stream.position;
+ seeking = false;
+ } else if (!stream.seekable) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ if (stream.flags & 1024) {
+ // seek to the end before writing in append mode
+ FS.llseek(stream, 0, 2);
+ }
+ var bytesWritten = stream.stream_ops.write(stream, buffer, offset, length, position, canOwn);
+ if (!seeking) stream.position += bytesWritten;
+ return bytesWritten;
+ },allocate:function (stream, offset, length) {
+ if (offset < 0 || length <= 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (!FS.isFile(stream.node.mode) && !FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ if (!stream.stream_ops.allocate) {
+ throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
+ }
+ stream.stream_ops.allocate(stream, offset, length);
+ },mmap:function (stream, buffer, offset, length, position, prot, flags) {
+ // TODO if PROT is PROT_WRITE, make sure we have write access
+ if ((stream.flags & 2097155) === 1) {
+ throw new FS.ErrnoError(ERRNO_CODES.EACCES);
+ }
+ if (!stream.stream_ops.mmap) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ return stream.stream_ops.mmap(stream, buffer, offset, length, position, prot, flags);
+ },ioctl:function (stream, cmd, arg) {
+ if (!stream.stream_ops.ioctl) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTTY);
+ }
+ return stream.stream_ops.ioctl(stream, cmd, arg);
+ },readFile:function (path, opts) {
+ opts = opts || {};
+ opts.flags = opts.flags || 'r';
+ opts.encoding = opts.encoding || 'binary';
+ if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
+ throw new Error('Invalid encoding type "' + opts.encoding + '"');
+ }
+ var ret;
+ var stream = FS.open(path, opts.flags);
+ var stat = FS.stat(path);
+ var length = stat.size;
+ var buf = new Uint8Array(length);
+ FS.read(stream, buf, 0, length, 0);
+ if (opts.encoding === 'utf8') {
+ ret = '';
+ var utf8 = new Runtime.UTF8Processor();
+ for (var i = 0; i < length; i++) {
+ ret += utf8.processCChar(buf[i]);
+ }
+ } else if (opts.encoding === 'binary') {
+ ret = buf;
+ }
+ FS.close(stream);
+ return ret;
+ },writeFile:function (path, data, opts) {
+ opts = opts || {};
+ opts.flags = opts.flags || 'w';
+ opts.encoding = opts.encoding || 'utf8';
+ if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
+ throw new Error('Invalid encoding type "' + opts.encoding + '"');
+ }
+ var stream = FS.open(path, opts.flags, opts.mode);
+ if (opts.encoding === 'utf8') {
+ var utf8 = new Runtime.UTF8Processor();
+ var buf = new Uint8Array(utf8.processJSString(data));
+ FS.write(stream, buf, 0, buf.length, 0, opts.canOwn);
+ } else if (opts.encoding === 'binary') {
+ FS.write(stream, data, 0, data.length, 0, opts.canOwn);
+ }
+ FS.close(stream);
+ },cwd:function () {
+ return FS.currentPath;
+ },chdir:function (path) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ if (!FS.isDir(lookup.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ var err = FS.nodePermissions(lookup.node, 'x');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ FS.currentPath = lookup.path;
+ },createDefaultDirectories:function () {
+ FS.mkdir('/tmp');
+ },createDefaultDevices:function () {
+ // create /dev
+ FS.mkdir('/dev');
+ // setup /dev/null
+ FS.registerDevice(FS.makedev(1, 3), {
+ read: function() { return 0; },
+ write: function() { return 0; }
+ });
+ FS.mkdev('/dev/null', FS.makedev(1, 3));
+ // setup /dev/tty and /dev/tty1
+ // stderr needs to print output using Module['printErr']
+ // so we register a second tty just for it.
+ TTY.register(FS.makedev(5, 0), TTY.default_tty_ops);
+ TTY.register(FS.makedev(6, 0), TTY.default_tty1_ops);
+ FS.mkdev('/dev/tty', FS.makedev(5, 0));
+ FS.mkdev('/dev/tty1', FS.makedev(6, 0));
+ // we're not going to emulate the actual shm device,
+ // just create the tmp dirs that reside in it commonly
+ FS.mkdir('/dev/shm');
+ FS.mkdir('/dev/shm/tmp');
+ },createStandardStreams:function () {
+ // TODO deprecate the old functionality of a single
+ // input / output callback and that utilizes FS.createDevice
+ // and instead require a unique set of stream ops
+
+ // by default, we symlink the standard streams to the
+ // default tty devices. however, if the standard streams
+ // have been overwritten we create a unique device for
+ // them instead.
+ if (Module['stdin']) {
+ FS.createDevice('/dev', 'stdin', Module['stdin']);
+ } else {
+ FS.symlink('/dev/tty', '/dev/stdin');
+ }
+ if (Module['stdout']) {
+ FS.createDevice('/dev', 'stdout', null, Module['stdout']);
+ } else {
+ FS.symlink('/dev/tty', '/dev/stdout');
+ }
+ if (Module['stderr']) {
+ FS.createDevice('/dev', 'stderr', null, Module['stderr']);
+ } else {
+ FS.symlink('/dev/tty1', '/dev/stderr');
+ }
+
+ // open default streams for the stdin, stdout and stderr devices
+ var stdin = FS.open('/dev/stdin', 'r');
+ HEAP32[((_stdin)>>2)]=FS.getPtrForStream(stdin);
+ assert(stdin.fd === 0, 'invalid handle for stdin (' + stdin.fd + ')');
+
+ var stdout = FS.open('/dev/stdout', 'w');
+ HEAP32[((_stdout)>>2)]=FS.getPtrForStream(stdout);
+ assert(stdout.fd === 1, 'invalid handle for stdout (' + stdout.fd + ')');
+
+ var stderr = FS.open('/dev/stderr', 'w');
+ HEAP32[((_stderr)>>2)]=FS.getPtrForStream(stderr);
+ assert(stderr.fd === 2, 'invalid handle for stderr (' + stderr.fd + ')');
+ },ensureErrnoError:function () {
+ if (FS.ErrnoError) return;
+ FS.ErrnoError = function ErrnoError(errno) {
+ this.errno = errno;
+ for (var key in ERRNO_CODES) {
+ if (ERRNO_CODES[key] === errno) {
+ this.code = key;
+ break;
+ }
+ }
+ this.message = ERRNO_MESSAGES[errno];
+ };
+ FS.ErrnoError.prototype = new Error();
+ FS.ErrnoError.prototype.constructor = FS.ErrnoError;
+ // Some errors may happen quite a bit, to avoid overhead we reuse them (and suffer a lack of stack info)
+ [ERRNO_CODES.ENOENT].forEach(function(code) {
+ FS.genericErrors[code] = new FS.ErrnoError(code);
+ FS.genericErrors[code].stack = '<generic error, no stack>';
+ });
+ },staticInit:function () {
+ FS.ensureErrnoError();
+
+ FS.nameTable = new Array(4096);
+
+ FS.mount(MEMFS, {}, '/');
+
+ FS.createDefaultDirectories();
+ FS.createDefaultDevices();
+ },init:function (input, output, error) {
+ assert(!FS.init.initialized, 'FS.init was previously called. If you want to initialize later with custom parameters, remove any earlier calls (note that one is automatically added to the generated code)');
+ FS.init.initialized = true;
+
+ FS.ensureErrnoError();
+
+ // Allow Module.stdin etc. to provide defaults, if none explicitly passed to us here
+ Module['stdin'] = input || Module['stdin'];
+ Module['stdout'] = output || Module['stdout'];
+ Module['stderr'] = error || Module['stderr'];
+
+ FS.createStandardStreams();
+ },quit:function () {
+ FS.init.initialized = false;
+ for (var i = 0; i < FS.streams.length; i++) {
+ var stream = FS.streams[i];
+ if (!stream) {
+ continue;
+ }
+ FS.close(stream);
+ }
+ },getMode:function (canRead, canWrite) {
+ var mode = 0;
+ if (canRead) mode |= 292 | 73;
+ if (canWrite) mode |= 146;
+ return mode;
+ },joinPath:function (parts, forceRelative) {
+ var path = PATH.join.apply(null, parts);
+ if (forceRelative && path[0] == '/') path = path.substr(1);
+ return path;
+ },absolutePath:function (relative, base) {
+ return PATH.resolve(base, relative);
+ },standardizePath:function (path) {
+ return PATH.normalize(path);
+ },findObject:function (path, dontResolveLastLink) {
+ var ret = FS.analyzePath(path, dontResolveLastLink);
+ if (ret.exists) {
+ return ret.object;
+ } else {
+ ___setErrNo(ret.error);
+ return null;
+ }
+ },analyzePath:function (path, dontResolveLastLink) {
+ // operate from within the context of the symlink's target
+ try {
+ var lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
+ path = lookup.path;
+ } catch (e) {
+ }
+ var ret = {
+ isRoot: false, exists: false, error: 0, name: null, path: null, object: null,
+ parentExists: false, parentPath: null, parentObject: null
+ };
+ try {
+ var lookup = FS.lookupPath(path, { parent: true });
+ ret.parentExists = true;
+ ret.parentPath = lookup.path;
+ ret.parentObject = lookup.node;
+ ret.name = PATH.basename(path);
+ lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
+ ret.exists = true;
+ ret.path = lookup.path;
+ ret.object = lookup.node;
+ ret.name = lookup.node.name;
+ ret.isRoot = lookup.path === '/';
+ } catch (e) {
+ ret.error = e.errno;
+ };
+ return ret;
+ },createFolder:function (parent, name, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(canRead, canWrite);
+ return FS.mkdir(path, mode);
+ },createPath:function (parent, path, canRead, canWrite) {
+ parent = typeof parent === 'string' ? parent : FS.getPath(parent);
+ var parts = path.split('/').reverse();
+ while (parts.length) {
+ var part = parts.pop();
+ if (!part) continue;
+ var current = PATH.join2(parent, part);
+ try {
+ FS.mkdir(current);
+ } catch (e) {
+ // ignore EEXIST
+ }
+ parent = current;
+ }
+ return current;
+ },createFile:function (parent, name, properties, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(canRead, canWrite);
+ return FS.create(path, mode);
+ },createDataFile:function (parent, name, data, canRead, canWrite, canOwn) {
+ var path = name ? PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name) : parent;
+ var mode = FS.getMode(canRead, canWrite);
+ var node = FS.create(path, mode);
+ if (data) {
+ if (typeof data === 'string') {
+ var arr = new Array(data.length);
+ for (var i = 0, len = data.length; i < len; ++i) arr[i] = data.charCodeAt(i);
+ data = arr;
+ }
+ // make sure we can write to the file
+ FS.chmod(node, mode | 146);
+ var stream = FS.open(node, 'w');
+ FS.write(stream, data, 0, data.length, 0, canOwn);
+ FS.close(stream);
+ FS.chmod(node, mode);
+ }
+ return node;
+ },createDevice:function (parent, name, input, output) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(!!input, !!output);
+ if (!FS.createDevice.major) FS.createDevice.major = 64;
+ var dev = FS.makedev(FS.createDevice.major++, 0);
+ // Create a fake device that a set of stream ops to emulate
+ // the old behavior.
+ FS.registerDevice(dev, {
+ open: function(stream) {
+ stream.seekable = false;
+ },
+ close: function(stream) {
+ // flush any pending line data
+ if (output && output.buffer && output.buffer.length) {
+ output(10);
+ }
+ },
+ read: function(stream, buffer, offset, length, pos /* ignored */) {
+ var bytesRead = 0;
+ for (var i = 0; i < length; i++) {
+ var result;
+ try {
+ result = input();
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ if (result === undefined && bytesRead === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ if (result === null || result === undefined) break;
+ bytesRead++;
+ buffer[offset+i] = result;
+ }
+ if (bytesRead) {
+ stream.node.timestamp = Date.now();
+ }
+ return bytesRead;
+ },
+ write: function(stream, buffer, offset, length, pos) {
+ for (var i = 0; i < length; i++) {
+ try {
+ output(buffer[offset+i]);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ }
+ if (length) {
+ stream.node.timestamp = Date.now();
+ }
+ return i;
+ }
+ });
+ return FS.mkdev(path, mode, dev);
+ },createLink:function (parent, name, target, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ return FS.symlink(target, path);
+ },forceLoadFile:function (obj) {
+ if (obj.isDevice || obj.isFolder || obj.link || obj.contents) return true;
+ var success = true;
+ if (typeof XMLHttpRequest !== 'undefined') {
+ throw new Error("Lazy loading should have been performed (contents set) in createLazyFile, but it was not. Lazy loading only works in web workers. Use --embed-file or --preload-file in emcc on the main thread.");
+ } else if (Module['read']) {
+ // Command-line.
+ try {
+ // WARNING: Can't read binary files in V8's d8 or tracemonkey's js, as
+ // read() will try to parse UTF8.
+ obj.contents = intArrayFromString(Module['read'](obj.url), true);
+ } catch (e) {
+ success = false;
+ }
+ } else {
+ throw new Error('Cannot load without read() or XMLHttpRequest.');
+ }
+ if (!success) ___setErrNo(ERRNO_CODES.EIO);
+ return success;
+ },createLazyFile:function (parent, name, url, canRead, canWrite) {
+ // Lazy chunked Uint8Array (implements get and length from Uint8Array). Actual getting is abstracted away for eventual reuse.
+ function LazyUint8Array() {
+ this.lengthKnown = false;
+ this.chunks = []; // Loaded chunks. Index is the chunk number
+ }
+ LazyUint8Array.prototype.get = function LazyUint8Array_get(idx) {
+ if (idx > this.length-1 || idx < 0) {
+ return undefined;
+ }
+ var chunkOffset = idx % this.chunkSize;
+ var chunkNum = Math.floor(idx / this.chunkSize);
+ return this.getter(chunkNum)[chunkOffset];
+ }
+ LazyUint8Array.prototype.setDataGetter = function LazyUint8Array_setDataGetter(getter) {
+ this.getter = getter;
+ }
+ LazyUint8Array.prototype.cacheLength = function LazyUint8Array_cacheLength() {
+ // Find length
+ var xhr = new XMLHttpRequest();
+ xhr.open('HEAD', url, false);
+ xhr.send(null);
+ if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
+ var datalength = Number(xhr.getResponseHeader("Content-length"));
+ var header;
+ var hasByteServing = (header = xhr.getResponseHeader("Accept-Ranges")) && header === "bytes";
+ var chunkSize = 1024*1024; // Chunk size in bytes
+
+ if (!hasByteServing) chunkSize = datalength;
+
+ // Function to get a range from the remote URL.
+ var doXHR = (function(from, to) {
+ if (from > to) throw new Error("invalid range (" + from + ", " + to + ") or no bytes requested!");
+ if (to > datalength-1) throw new Error("only " + datalength + " bytes available! programmer error!");
+
+ // TODO: Use mozResponseArrayBuffer, responseStream, etc. if available.
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, false);
+ if (datalength !== chunkSize) xhr.setRequestHeader("Range", "bytes=" + from + "-" + to);
+
+ // Some hints to the browser that we want binary data.
+ if (typeof Uint8Array != 'undefined') xhr.responseType = 'arraybuffer';
+ if (xhr.overrideMimeType) {
+ xhr.overrideMimeType('text/plain; charset=x-user-defined');
+ }
+
+ xhr.send(null);
+ if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
+ if (xhr.response !== undefined) {
+ return new Uint8Array(xhr.response || []);
+ } else {
+ return intArrayFromString(xhr.responseText || '', true);
+ }
+ });
+ var lazyArray = this;
+ lazyArray.setDataGetter(function(chunkNum) {
+ var start = chunkNum * chunkSize;
+ var end = (chunkNum+1) * chunkSize - 1; // including this byte
+ end = Math.min(end, datalength-1); // if datalength-1 is selected, this is the last block
+ if (typeof(lazyArray.chunks[chunkNum]) === "undefined") {
+ lazyArray.chunks[chunkNum] = doXHR(start, end);
+ }
+ if (typeof(lazyArray.chunks[chunkNum]) === "undefined") throw new Error("doXHR failed!");
+ return lazyArray.chunks[chunkNum];
+ });
+
+ this._length = datalength;
+ this._chunkSize = chunkSize;
+ this.lengthKnown = true;
+ }
+ if (typeof XMLHttpRequest !== 'undefined') {
+ if (!ENVIRONMENT_IS_WORKER) throw 'Cannot do synchronous binary XHRs outside webworkers in modern browsers. Use --embed-file or --preload-file in emcc';
+ var lazyArray = new LazyUint8Array();
+ Object.defineProperty(lazyArray, "length", {
+ get: function() {
+ if(!this.lengthKnown) {
+ this.cacheLength();
+ }
+ return this._length;
+ }
+ });
+ Object.defineProperty(lazyArray, "chunkSize", {
+ get: function() {
+ if(!this.lengthKnown) {
+ this.cacheLength();
+ }
+ return this._chunkSize;
+ }
+ });
+
+ var properties = { isDevice: false, contents: lazyArray };
+ } else {
+ var properties = { isDevice: false, url: url };
+ }
+
+ var node = FS.createFile(parent, name, properties, canRead, canWrite);
+ // This is a total hack, but I want to get this lazy file code out of the
+ // core of MEMFS. If we want to keep this lazy file concept I feel it should
+ // be its own thin LAZYFS proxying calls to MEMFS.
+ if (properties.contents) {
+ node.contents = properties.contents;
+ } else if (properties.url) {
+ node.contents = null;
+ node.url = properties.url;
+ }
+ // override each stream op with one that tries to force load the lazy file first
+ var stream_ops = {};
+ var keys = Object.keys(node.stream_ops);
+ keys.forEach(function(key) {
+ var fn = node.stream_ops[key];
+ stream_ops[key] = function forceLoadLazyFile() {
+ if (!FS.forceLoadFile(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ return fn.apply(null, arguments);
+ };
+ });
+ // use a custom read function
+ stream_ops.read = function stream_ops_read(stream, buffer, offset, length, position) {
+ if (!FS.forceLoadFile(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ var contents = stream.node.contents;
+ if (position >= contents.length)
+ return 0;
+ var size = Math.min(contents.length - position, length);
+ assert(size >= 0);
+ if (contents.slice) { // normal array
+ for (var i = 0; i < size; i++) {
+ buffer[offset + i] = contents[position + i];
+ }
+ } else {
+ for (var i = 0; i < size; i++) { // LazyUint8Array from sync binary XHR
+ buffer[offset + i] = contents.get(position + i);
+ }
+ }
+ return size;
+ };
+ node.stream_ops = stream_ops;
+ return node;
+ },createPreloadedFile:function (parent, name, url, canRead, canWrite, onload, onerror, dontCreateFile, canOwn) {
+ Browser.init();
+ // TODO we should allow people to just pass in a complete filename instead
+ // of parent and name being that we just join them anyways
+ var fullname = name ? PATH.resolve(PATH.join2(parent, name)) : parent;
+ function processData(byteArray) {
+ function finish(byteArray) {
+ if (!dontCreateFile) {
+ FS.createDataFile(parent, name, byteArray, canRead, canWrite, canOwn);
+ }
+ if (onload) onload();
+ removeRunDependency('cp ' + fullname);
+ }
+ var handled = false;
+ Module['preloadPlugins'].forEach(function(plugin) {
+ if (handled) return;
+ if (plugin['canHandle'](fullname)) {
+ plugin['handle'](byteArray, fullname, finish, function() {
+ if (onerror) onerror();
+ removeRunDependency('cp ' + fullname);
+ });
+ handled = true;
+ }
+ });
+ if (!handled) finish(byteArray);
+ }
+ addRunDependency('cp ' + fullname);
+ if (typeof url == 'string') {
+ Browser.asyncLoad(url, function(byteArray) {
+ processData(byteArray);
+ }, onerror);
+ } else {
+ processData(url);
+ }
+ },indexedDB:function () {
+ return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
+ },DB_NAME:function () {
+ return 'EM_FS_' + window.location.pathname;
+ },DB_VERSION:20,DB_STORE_NAME:"FILE_DATA",saveFilesToDB:function (paths, onload, onerror) {
+ onload = onload || function(){};
+ onerror = onerror || function(){};
+ var indexedDB = FS.indexedDB();
+ try {
+ var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
+ } catch (e) {
+ return onerror(e);
+ }
+ openRequest.onupgradeneeded = function openRequest_onupgradeneeded() {
+ console.log('creating db');
+ var db = openRequest.result;
+ db.createObjectStore(FS.DB_STORE_NAME);
+ };
+ openRequest.onsuccess = function openRequest_onsuccess() {
+ var db = openRequest.result;
+ var transaction = db.transaction([FS.DB_STORE_NAME], 'readwrite');
+ var files = transaction.objectStore(FS.DB_STORE_NAME);
+ var ok = 0, fail = 0, total = paths.length;
+ function finish() {
+ if (fail == 0) onload(); else onerror();
+ }
+ paths.forEach(function(path) {
+ var putRequest = files.put(FS.analyzePath(path).object.contents, path);
+ putRequest.onsuccess = function putRequest_onsuccess() { ok++; if (ok + fail == total) finish() };
+ putRequest.onerror = function putRequest_onerror() { fail++; if (ok + fail == total) finish() };
+ });
+ transaction.onerror = onerror;
+ };
+ openRequest.onerror = onerror;
+ },loadFilesFromDB:function (paths, onload, onerror) {
+ onload = onload || function(){};
+ onerror = onerror || function(){};
+ var indexedDB = FS.indexedDB();
+ try {
+ var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
+ } catch (e) {
+ return onerror(e);
+ }
+ openRequest.onupgradeneeded = onerror; // no database to load from
+ openRequest.onsuccess = function openRequest_onsuccess() {
+ var db = openRequest.result;
+ try {
+ var transaction = db.transaction([FS.DB_STORE_NAME], 'readonly');
+ } catch(e) {
+ onerror(e);
+ return;
+ }
+ var files = transaction.objectStore(FS.DB_STORE_NAME);
+ var ok = 0, fail = 0, total = paths.length;
+ function finish() {
+ if (fail == 0) onload(); else onerror();
+ }
+ paths.forEach(function(path) {
+ var getRequest = files.get(path);
+ getRequest.onsuccess = function getRequest_onsuccess() {
+ if (FS.analyzePath(path).exists) {
+ FS.unlink(path);
+ }
+ FS.createDataFile(PATH.dirname(path), PATH.basename(path), getRequest.result, true, true, true);
+ ok++;
+ if (ok + fail == total) finish();
+ };
+ getRequest.onerror = function getRequest_onerror() { fail++; if (ok + fail == total) finish() };
+ });
+ transaction.onerror = onerror;
+ };
+ openRequest.onerror = onerror;
+ }};
+
+
+
+
+ function _mkport() { throw 'TODO' }var SOCKFS={mount:function (mount) {
+ return FS.createNode(null, '/', 16384 | 511 /* 0777 */, 0);
+ },createSocket:function (family, type, protocol) {
+ var streaming = type == 1;
+ if (protocol) {
+ assert(streaming == (protocol == 6)); // if SOCK_STREAM, must be tcp
+ }
+
+ // create our internal socket structure
+ var sock = {
+ family: family,
+ type: type,
+ protocol: protocol,
+ server: null,
+ peers: {},
+ pending: [],
+ recv_queue: [],
+ sock_ops: SOCKFS.websocket_sock_ops
+ };
+
+ // create the filesystem node to store the socket structure
+ var name = SOCKFS.nextname();
+ var node = FS.createNode(SOCKFS.root, name, 49152, 0);
+ node.sock = sock;
+
+ // and the wrapping stream that enables library functions such
+ // as read and write to indirectly interact with the socket
+ var stream = FS.createStream({
+ path: name,
+ node: node,
+ flags: FS.modeStringToFlags('r+'),
+ seekable: false,
+ stream_ops: SOCKFS.stream_ops
+ });
+
+ // map the new stream to the socket structure (sockets have a 1:1
+ // relationship with a stream)
+ sock.stream = stream;
+
+ return sock;
+ },getSocket:function (fd) {
+ var stream = FS.getStream(fd);
+ if (!stream || !FS.isSocket(stream.node.mode)) {
+ return null;
+ }
+ return stream.node.sock;
+ },stream_ops:{poll:function (stream) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.poll(sock);
+ },ioctl:function (stream, request, varargs) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.ioctl(sock, request, varargs);
+ },read:function (stream, buffer, offset, length, position /* ignored */) {
+ var sock = stream.node.sock;
+ var msg = sock.sock_ops.recvmsg(sock, length);
+ if (!msg) {
+ // socket is closed
+ return 0;
+ }
+ buffer.set(msg.buffer, offset);
+ return msg.buffer.length;
+ },write:function (stream, buffer, offset, length, position /* ignored */) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.sendmsg(sock, buffer, offset, length);
+ },close:function (stream) {
+ var sock = stream.node.sock;
+ sock.sock_ops.close(sock);
+ }},nextname:function () {
+ if (!SOCKFS.nextname.current) {
+ SOCKFS.nextname.current = 0;
+ }
+ return 'socket[' + (SOCKFS.nextname.current++) + ']';
+ },websocket_sock_ops:{createPeer:function (sock, addr, port) {
+ var ws;
+
+ if (typeof addr === 'object') {
+ ws = addr;
+ addr = null;
+ port = null;
+ }
+
+ if (ws) {
+ // for sockets that've already connected (e.g. we're the server)
+ // we can inspect the _socket property for the address
+ if (ws._socket) {
+ addr = ws._socket.remoteAddress;
+ port = ws._socket.remotePort;
+ }
+ // if we're just now initializing a connection to the remote,
+ // inspect the url property
+ else {
+ var result = /ws[s]?:\/\/([^:]+):(\d+)/.exec(ws.url);
+ if (!result) {
+ throw new Error('WebSocket URL must be in the format ws(s)://address:port');
+ }
+ addr = result[1];
+ port = parseInt(result[2], 10);
+ }
+ } else {
+ // create the actual websocket object and connect
+ try {
+ // runtimeConfig gets set to true if WebSocket runtime configuration is available.
+ var runtimeConfig = (Module['websocket'] && ('object' === typeof Module['websocket']));
+
+ // The default value is 'ws://' the replace is needed because the compiler replaces "//" comments with '#'
+ // comments without checking context, so we'd end up with ws:#, the replace swaps the "#" for "//" again.
+ var url = 'ws:#'.replace('#', '//');
+
+ if (runtimeConfig) {
+ if ('string' === typeof Module['websocket']['url']) {
+ url = Module['websocket']['url']; // Fetch runtime WebSocket URL config.
+ }
+ }
+
+ if (url === 'ws://' || url === 'wss://') { // Is the supplied URL config just a prefix, if so complete it.
+ url = url + addr + ':' + port;
+ }
+
+ // Make the WebSocket subprotocol (Sec-WebSocket-Protocol) default to binary if no configuration is set.
+ var subProtocols = 'binary'; // The default value is 'binary'
+
+ if (runtimeConfig) {
+ if ('string' === typeof Module['websocket']['subprotocol']) {
+ subProtocols = Module['websocket']['subprotocol']; // Fetch runtime WebSocket subprotocol config.
+ }
+ }
+
+ // The regex trims the string (removes spaces at the beginning and end, then splits the string by
+ // <any space>,<any space> into an Array. Whitespace removal is important for Websockify and ws.
+ subProtocols = subProtocols.replace(/^ +| +$/g,"").split(/ *, */);
+
+ // The node ws library API for specifying optional subprotocol is slightly different than the browser's.
+ var opts = ENVIRONMENT_IS_NODE ? {'protocol': subProtocols.toString()} : subProtocols;
+
+ // If node we use the ws library.
+ var WebSocket = ENVIRONMENT_IS_NODE ? require('ws') : window['WebSocket'];
+ ws = new WebSocket(url, opts);
+ ws.binaryType = 'arraybuffer';
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EHOSTUNREACH);
+ }
+ }
+
+
+ var peer = {
+ addr: addr,
+ port: port,
+ socket: ws,
+ dgram_send_queue: []
+ };
+
+ SOCKFS.websocket_sock_ops.addPeer(sock, peer);
+ SOCKFS.websocket_sock_ops.handlePeerEvents(sock, peer);
+
+ // if this is a bound dgram socket, send the port number first to allow
+ // us to override the ephemeral port reported to us by remotePort on the
+ // remote end.
+ if (sock.type === 2 && typeof sock.sport !== 'undefined') {
+ peer.dgram_send_queue.push(new Uint8Array([
+ 255, 255, 255, 255,
+ 'p'.charCodeAt(0), 'o'.charCodeAt(0), 'r'.charCodeAt(0), 't'.charCodeAt(0),
+ ((sock.sport & 0xff00) >> 8) , (sock.sport & 0xff)
+ ]));
+ }
+
+ return peer;
+ },getPeer:function (sock, addr, port) {
+ return sock.peers[addr + ':' + port];
+ },addPeer:function (sock, peer) {
+ sock.peers[peer.addr + ':' + peer.port] = peer;
+ },removePeer:function (sock, peer) {
+ delete sock.peers[peer.addr + ':' + peer.port];
+ },handlePeerEvents:function (sock, peer) {
+ var first = true;
+
+ var handleOpen = function () {
+ try {
+ var queued = peer.dgram_send_queue.shift();
+ while (queued) {
+ peer.socket.send(queued);
+ queued = peer.dgram_send_queue.shift();
+ }
+ } catch (e) {
+ // not much we can do here in the way of proper error handling as we've already
+ // lied and said this data was sent. shut it down.
+ peer.socket.close();
+ }
+ };
+
+ function handleMessage(data) {
+ assert(typeof data !== 'string' && data.byteLength !== undefined); // must receive an ArrayBuffer
+ data = new Uint8Array(data); // make a typed array view on the array buffer
+
+
+ // if this is the port message, override the peer's port with it
+ var wasfirst = first;
+ first = false;
+ if (wasfirst &&
+ data.length === 10 &&
+ data[0] === 255 && data[1] === 255 && data[2] === 255 && data[3] === 255 &&
+ data[4] === 'p'.charCodeAt(0) && data[5] === 'o'.charCodeAt(0) && data[6] === 'r'.charCodeAt(0) && data[7] === 't'.charCodeAt(0)) {
+ // update the peer's port and it's key in the peer map
+ var newport = ((data[8] << 8) | data[9]);
+ SOCKFS.websocket_sock_ops.removePeer(sock, peer);
+ peer.port = newport;
+ SOCKFS.websocket_sock_ops.addPeer(sock, peer);
+ return;
+ }
+
+ sock.recv_queue.push({ addr: peer.addr, port: peer.port, data: data });
+ };
+
+ if (ENVIRONMENT_IS_NODE) {
+ peer.socket.on('open', handleOpen);
+ peer.socket.on('message', function(data, flags) {
+ if (!flags.binary) {
+ return;
+ }
+ handleMessage((new Uint8Array(data)).buffer); // copy from node Buffer -> ArrayBuffer
+ });
+ peer.socket.on('error', function() {
+ // don't throw
+ });
+ } else {
+ peer.socket.onopen = handleOpen;
+ peer.socket.onmessage = function peer_socket_onmessage(event) {
+ handleMessage(event.data);
+ };
+ }
+ },poll:function (sock) {
+ if (sock.type === 1 && sock.server) {
+ // listen sockets should only say they're available for reading
+ // if there are pending clients.
+ return sock.pending.length ? (64 | 1) : 0;
+ }
+
+ var mask = 0;
+ var dest = sock.type === 1 ? // we only care about the socket state for connection-based sockets
+ SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport) :
+ null;
+
+ if (sock.recv_queue.length ||
+ !dest || // connection-less sockets are always ready to read
+ (dest && dest.socket.readyState === dest.socket.CLOSING) ||
+ (dest && dest.socket.readyState === dest.socket.CLOSED)) { // let recv return 0 once closed
+ mask |= (64 | 1);
+ }
+
+ if (!dest || // connection-less sockets are always ready to write
+ (dest && dest.socket.readyState === dest.socket.OPEN)) {
+ mask |= 4;
+ }
+
+ if ((dest && dest.socket.readyState === dest.socket.CLOSING) ||
+ (dest && dest.socket.readyState === dest.socket.CLOSED)) {
+ mask |= 16;
+ }
+
+ return mask;
+ },ioctl:function (sock, request, arg) {
+ switch (request) {
+ case 21531:
+ var bytes = 0;
+ if (sock.recv_queue.length) {
+ bytes = sock.recv_queue[0].data.length;
+ }
+ HEAP32[((arg)>>2)]=bytes;
+ return 0;
+ default:
+ return ERRNO_CODES.EINVAL;
+ }
+ },close:function (sock) {
+ // if we've spawned a listen server, close it
+ if (sock.server) {
+ try {
+ sock.server.close();
+ } catch (e) {
+ }
+ sock.server = null;
+ }
+ // close any peer connections
+ var peers = Object.keys(sock.peers);
+ for (var i = 0; i < peers.length; i++) {
+ var peer = sock.peers[peers[i]];
+ try {
+ peer.socket.close();
+ } catch (e) {
+ }
+ SOCKFS.websocket_sock_ops.removePeer(sock, peer);
+ }
+ return 0;
+ },bind:function (sock, addr, port) {
+ if (typeof sock.saddr !== 'undefined' || typeof sock.sport !== 'undefined') {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL); // already bound
+ }
+ sock.saddr = addr;
+ sock.sport = port || _mkport();
+ // in order to emulate dgram sockets, we need to launch a listen server when
+ // binding on a connection-less socket
+ // note: this is only required on the server side
+ if (sock.type === 2) {
+ // close the existing server if it exists
+ if (sock.server) {
+ sock.server.close();
+ sock.server = null;
+ }
+ // swallow error operation not supported error that occurs when binding in the
+ // browser where this isn't supported
+ try {
+ sock.sock_ops.listen(sock, 0);
+ } catch (e) {
+ if (!(e instanceof FS.ErrnoError)) throw e;
+ if (e.errno !== ERRNO_CODES.EOPNOTSUPP) throw e;
+ }
+ }
+ },connect:function (sock, addr, port) {
+ if (sock.server) {
+ throw new FS.ErrnoError(ERRNO_CODS.EOPNOTSUPP);
+ }
+
+ // TODO autobind
+ // if (!sock.addr && sock.type == 2) {
+ // }
+
+ // early out if we're already connected / in the middle of connecting
+ if (typeof sock.daddr !== 'undefined' && typeof sock.dport !== 'undefined') {
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
+ if (dest) {
+ if (dest.socket.readyState === dest.socket.CONNECTING) {
+ throw new FS.ErrnoError(ERRNO_CODES.EALREADY);
+ } else {
+ throw new FS.ErrnoError(ERRNO_CODES.EISCONN);
+ }
+ }
+ }
+
+ // add the socket to our peer list and set our
+ // destination address / port to match
+ var peer = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
+ sock.daddr = peer.addr;
+ sock.dport = peer.port;
+
+ // always "fail" in non-blocking mode
+ throw new FS.ErrnoError(ERRNO_CODES.EINPROGRESS);
+ },listen:function (sock, backlog) {
+ if (!ENVIRONMENT_IS_NODE) {
+ throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
+ }
+ if (sock.server) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL); // already listening
+ }
+ var WebSocketServer = require('ws').Server;
+ var host = sock.saddr;
+ sock.server = new WebSocketServer({
+ host: host,
+ port: sock.sport
+ // TODO support backlog
+ });
+
+ sock.server.on('connection', function(ws) {
+ if (sock.type === 1) {
+ var newsock = SOCKFS.createSocket(sock.family, sock.type, sock.protocol);
+
+ // create a peer on the new socket
+ var peer = SOCKFS.websocket_sock_ops.createPeer(newsock, ws);
+ newsock.daddr = peer.addr;
+ newsock.dport = peer.port;
+
+ // push to queue for accept to pick up
+ sock.pending.push(newsock);
+ } else {
+ // create a peer on the listen socket so calling sendto
+ // with the listen socket and an address will resolve
+ // to the correct client
+ SOCKFS.websocket_sock_ops.createPeer(sock, ws);
+ }
+ });
+ sock.server.on('closed', function() {
+ sock.server = null;
+ });
+ sock.server.on('error', function() {
+ // don't throw
+ });
+ },accept:function (listensock) {
+ if (!listensock.server) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var newsock = listensock.pending.shift();
+ newsock.stream.flags = listensock.stream.flags;
+ return newsock;
+ },getname:function (sock, peer) {
+ var addr, port;
+ if (peer) {
+ if (sock.daddr === undefined || sock.dport === undefined) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+ addr = sock.daddr;
+ port = sock.dport;
+ } else {
+ // TODO saddr and sport will be set for bind()'d UDP sockets, but what
+ // should we be returning for TCP sockets that've been connect()'d?
+ addr = sock.saddr || 0;
+ port = sock.sport || 0;
+ }
+ return { addr: addr, port: port };
+ },sendmsg:function (sock, buffer, offset, length, addr, port) {
+ if (sock.type === 2) {
+ // connection-less sockets will honor the message address,
+ // and otherwise fall back to the bound destination address
+ if (addr === undefined || port === undefined) {
+ addr = sock.daddr;
+ port = sock.dport;
+ }
+ // if there was no address to fall back to, error out
+ if (addr === undefined || port === undefined) {
+ throw new FS.ErrnoError(ERRNO_CODES.EDESTADDRREQ);
+ }
+ } else {
+ // connection-based sockets will only use the bound
+ addr = sock.daddr;
+ port = sock.dport;
+ }
+
+ // find the peer for the destination address
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, addr, port);
+
+ // early out if not connected with a connection-based socket
+ if (sock.type === 1) {
+ if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ } else if (dest.socket.readyState === dest.socket.CONNECTING) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ }
+
+ // create a copy of the incoming data to send, as the WebSocket API
+ // doesn't work entirely with an ArrayBufferView, it'll just send
+ // the entire underlying buffer
+ var data;
+ if (buffer instanceof Array || buffer instanceof ArrayBuffer) {
+ data = buffer.slice(offset, offset + length);
+ } else { // ArrayBufferView
+ data = buffer.buffer.slice(buffer.byteOffset + offset, buffer.byteOffset + offset + length);
+ }
+
+ // if we're emulating a connection-less dgram socket and don't have
+ // a cached connection, queue the buffer to send upon connect and
+ // lie, saying the data was sent now.
+ if (sock.type === 2) {
+ if (!dest || dest.socket.readyState !== dest.socket.OPEN) {
+ // if we're not connected, open a new connection
+ if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ dest = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
+ }
+ dest.dgram_send_queue.push(data);
+ return length;
+ }
+ }
+
+ try {
+ // send the actual data
+ dest.socket.send(data);
+ return length;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ },recvmsg:function (sock, length) {
+ // http://pubs.opengroup.org/onlinepubs/7908799/xns/recvmsg.html
+ if (sock.type === 1 && sock.server) {
+ // tcp servers should not be recv()'ing on the listen socket
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+
+ var queued = sock.recv_queue.shift();
+ if (!queued) {
+ if (sock.type === 1) {
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
+
+ if (!dest) {
+ // if we have a destination address but are not connected, error out
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+ else if (dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ // return null if the socket has closed
+ return null;
+ }
+ else {
+ // else, our socket is in a valid state but truly has nothing available
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ } else {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ }
+
+ // queued.data will be an ArrayBuffer if it's unadulterated, but if it's
+ // requeued TCP data it'll be an ArrayBufferView
+ var queuedLength = queued.data.byteLength || queued.data.length;
+ var queuedOffset = queued.data.byteOffset || 0;
+ var queuedBuffer = queued.data.buffer || queued.data;
+ var bytesRead = Math.min(length, queuedLength);
+ var res = {
+ buffer: new Uint8Array(queuedBuffer, queuedOffset, bytesRead),
+ addr: queued.addr,
+ port: queued.port
+ };
+
+
+ // push back any unread data for TCP connections
+ if (sock.type === 1 && bytesRead < queuedLength) {
+ var bytesRemaining = queuedLength - bytesRead;
+ queued.data = new Uint8Array(queuedBuffer, queuedOffset + bytesRead, bytesRemaining);
+ sock.recv_queue.unshift(queued);
+ }
+
+ return res;
+ }}};function _send(fd, buf, len, flags) {
+ var sock = SOCKFS.getSocket(fd);
+ if (!sock) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ // TODO honor flags
+ return _write(fd, buf, len);
+ }
+
+ function _pwrite(fildes, buf, nbyte, offset) {
+ // ssize_t pwrite(int fildes, const void *buf, size_t nbyte, off_t offset);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
+ var stream = FS.getStream(fildes);
+ if (!stream) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ try {
+ var slab = HEAP8;
+ return FS.write(stream, slab, buf, nbyte, offset);
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }function _write(fildes, buf, nbyte) {
+ // ssize_t write(int fildes, const void *buf, size_t nbyte);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
+ var stream = FS.getStream(fildes);
+ if (!stream) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+
+
+ try {
+ var slab = HEAP8;
+ return FS.write(stream, slab, buf, nbyte);
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }
+
+ function _fileno(stream) {
+ // int fileno(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fileno.html
+ stream = FS.getStreamFromPtr(stream);
+ if (!stream) return -1;
+ return stream.fd;
+ }function _fwrite(ptr, size, nitems, stream) {
+ // size_t fwrite(const void *restrict ptr, size_t size, size_t nitems, FILE *restrict stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fwrite.html
+ var bytesToWrite = nitems * size;
+ if (bytesToWrite == 0) return 0;
+ var fd = _fileno(stream);
+ var bytesWritten = _write(fd, ptr, bytesToWrite);
+ if (bytesWritten == -1) {
+ var streamObj = FS.getStreamFromPtr(stream);
+ if (streamObj) streamObj.error = true;
+ return 0;
+ } else {
+ return Math.floor(bytesWritten / size);
+ }
+ }
+
+
+
+ Module["_strlen"] = _strlen;
+
+ function __reallyNegative(x) {
+ return x < 0 || (x === 0 && (1/x) === -Infinity);
+ }function __formatString(format, varargs) {
+ var textIndex = format;
+ var argIndex = 0;
+ function getNextArg(type) {
+ // NOTE: Explicitly ignoring type safety. Otherwise this fails:
+ // int x = 4; printf("%c\n", (char)x);
+ var ret;
+ if (type === 'double') {
+ ret = HEAPF64[(((varargs)+(argIndex))>>3)];
+ } else if (type == 'i64') {
+ ret = [HEAP32[(((varargs)+(argIndex))>>2)],
+ HEAP32[(((varargs)+(argIndex+4))>>2)]];
+
+ } else {
+ type = 'i32'; // varargs are always i32, i64, or double
+ ret = HEAP32[(((varargs)+(argIndex))>>2)];
+ }
+ argIndex += Runtime.getNativeFieldSize(type);
+ return ret;
+ }
+
+ var ret = [];
+ var curr, next, currArg;
+ while(1) {
+ var startTextIndex = textIndex;
+ curr = HEAP8[(textIndex)];
+ if (curr === 0) break;
+ next = HEAP8[((textIndex+1)|0)];
+ if (curr == 37) {
+ // Handle flags.
+ var flagAlwaysSigned = false;
+ var flagLeftAlign = false;
+ var flagAlternative = false;
+ var flagZeroPad = false;
+ var flagPadSign = false;
+ flagsLoop: while (1) {
+ switch (next) {
+ case 43:
+ flagAlwaysSigned = true;
+ break;
+ case 45:
+ flagLeftAlign = true;
+ break;
+ case 35:
+ flagAlternative = true;
+ break;
+ case 48:
+ if (flagZeroPad) {
+ break flagsLoop;
+ } else {
+ flagZeroPad = true;
+ break;
+ }
+ case 32:
+ flagPadSign = true;
+ break;
+ default:
+ break flagsLoop;
+ }
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ }
+
+ // Handle width.
+ var width = 0;
+ if (next == 42) {
+ width = getNextArg('i32');
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ } else {
+ while (next >= 48 && next <= 57) {
+ width = width * 10 + (next - 48);
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ }
+ }
+
+ // Handle precision.
+ var precisionSet = false, precision = -1;
+ if (next == 46) {
+ precision = 0;
+ precisionSet = true;
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ if (next == 42) {
+ precision = getNextArg('i32');
+ textIndex++;
+ } else {
+ while(1) {
+ var precisionChr = HEAP8[((textIndex+1)|0)];
+ if (precisionChr < 48 ||
+ precisionChr > 57) break;
+ precision = precision * 10 + (precisionChr - 48);
+ textIndex++;
+ }
+ }
+ next = HEAP8[((textIndex+1)|0)];
+ }
+ if (precision < 0) {
+ precision = 6; // Standard default.
+ precisionSet = false;
+ }
+
+ // Handle integer sizes. WARNING: These assume a 32-bit architecture!
+ var argSize;
+ switch (String.fromCharCode(next)) {
+ case 'h':
+ var nextNext = HEAP8[((textIndex+2)|0)];
+ if (nextNext == 104) {
+ textIndex++;
+ argSize = 1; // char (actually i32 in varargs)
+ } else {
+ argSize = 2; // short (actually i32 in varargs)
+ }
+ break;
+ case 'l':
+ var nextNext = HEAP8[((textIndex+2)|0)];
+ if (nextNext == 108) {
+ textIndex++;
+ argSize = 8; // long long
+ } else {
+ argSize = 4; // long
+ }
+ break;
+ case 'L': // long long
+ case 'q': // int64_t
+ case 'j': // intmax_t
+ argSize = 8;
+ break;
+ case 'z': // size_t
+ case 't': // ptrdiff_t
+ case 'I': // signed ptrdiff_t or unsigned size_t
+ argSize = 4;
+ break;
+ default:
+ argSize = null;
+ }
+ if (argSize) textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+
+ // Handle type specifier.
+ switch (String.fromCharCode(next)) {
+ case 'd': case 'i': case 'u': case 'o': case 'x': case 'X': case 'p': {
+ // Integer.
+ var signed = next == 100 || next == 105;
+ argSize = argSize || 4;
+ var currArg = getNextArg('i' + (argSize * 8));
+ var argText;
+ // Flatten i64-1 [low, high] into a (slightly rounded) double
+ if (argSize == 8) {
+ currArg = Runtime.makeBigInt(currArg[0], currArg[1], next == 117);
+ }
+ // Truncate to requested size.
+ if (argSize <= 4) {
+ var limit = Math.pow(256, argSize) - 1;
+ currArg = (signed ? reSign : unSign)(currArg & limit, argSize * 8);
+ }
+ // Format the number.
+ var currAbsArg = Math.abs(currArg);
+ var prefix = '';
+ if (next == 100 || next == 105) {
+ argText = reSign(currArg, 8 * argSize, 1).toString(10);
+ } else if (next == 117) {
+ argText = unSign(currArg, 8 * argSize, 1).toString(10);
+ currArg = Math.abs(currArg);
+ } else if (next == 111) {
+ argText = (flagAlternative ? '0' : '') + currAbsArg.toString(8);
+ } else if (next == 120 || next == 88) {
+ prefix = (flagAlternative && currArg != 0) ? '0x' : '';
+ if (currArg < 0) {
+ // Represent negative numbers in hex as 2's complement.
+ currArg = -currArg;
+ argText = (currAbsArg - 1).toString(16);
+ var buffer = [];
+ for (var i = 0; i < argText.length; i++) {
+ buffer.push((0xF - parseInt(argText[i], 16)).toString(16));
+ }
+ argText = buffer.join('');
+ while (argText.length < argSize * 2) argText = 'f' + argText;
+ } else {
+ argText = currAbsArg.toString(16);
+ }
+ if (next == 88) {
+ prefix = prefix.toUpperCase();
+ argText = argText.toUpperCase();
+ }
+ } else if (next == 112) {
+ if (currAbsArg === 0) {
+ argText = '(nil)';
+ } else {
+ prefix = '0x';
+ argText = currAbsArg.toString(16);
+ }
+ }
+ if (precisionSet) {
+ while (argText.length < precision) {
+ argText = '0' + argText;
+ }
+ }
+
+ // Add sign if needed
+ if (currArg >= 0) {
+ if (flagAlwaysSigned) {
+ prefix = '+' + prefix;
+ } else if (flagPadSign) {
+ prefix = ' ' + prefix;
+ }
+ }
+
+ // Move sign to prefix so we zero-pad after the sign
+ if (argText.charAt(0) == '-') {
+ prefix = '-' + prefix;
+ argText = argText.substr(1);
+ }
+
+ // Add padding.
+ while (prefix.length + argText.length < width) {
+ if (flagLeftAlign) {
+ argText += ' ';
+ } else {
+ if (flagZeroPad) {
+ argText = '0' + argText;
+ } else {
+ prefix = ' ' + prefix;
+ }
+ }
+ }
+
+ // Insert the result into the buffer.
+ argText = prefix + argText;
+ argText.split('').forEach(function(chr) {
+ ret.push(chr.charCodeAt(0));
+ });
+ break;
+ }
+ case 'f': case 'F': case 'e': case 'E': case 'g': case 'G': {
+ // Float.
+ var currArg = getNextArg('double');
+ var argText;
+ if (isNaN(currArg)) {
+ argText = 'nan';
+ flagZeroPad = false;
+ } else if (!isFinite(currArg)) {
+ argText = (currArg < 0 ? '-' : '') + 'inf';
+ flagZeroPad = false;
+ } else {
+ var isGeneral = false;
+ var effectivePrecision = Math.min(precision, 20);
+
+ // Convert g/G to f/F or e/E, as per:
+ // http://pubs.opengroup.org/onlinepubs/9699919799/functions/printf.html
+ if (next == 103 || next == 71) {
+ isGeneral = true;
+ precision = precision || 1;
+ var exponent = parseInt(currArg.toExponential(effectivePrecision).split('e')[1], 10);
+ if (precision > exponent && exponent >= -4) {
+ next = ((next == 103) ? 'f' : 'F').charCodeAt(0);
+ precision -= exponent + 1;
+ } else {
+ next = ((next == 103) ? 'e' : 'E').charCodeAt(0);
+ precision--;
+ }
+ effectivePrecision = Math.min(precision, 20);
+ }
+
+ if (next == 101 || next == 69) {
+ argText = currArg.toExponential(effectivePrecision);
+ // Make sure the exponent has at least 2 digits.
+ if (/[eE][-+]\d$/.test(argText)) {
+ argText = argText.slice(0, -1) + '0' + argText.slice(-1);
+ }
+ } else if (next == 102 || next == 70) {
+ argText = currArg.toFixed(effectivePrecision);
+ if (currArg === 0 && __reallyNegative(currArg)) {
+ argText = '-' + argText;
+ }
+ }
+
+ var parts = argText.split('e');
+ if (isGeneral && !flagAlternative) {
+ // Discard trailing zeros and periods.
+ while (parts[0].length > 1 && parts[0].indexOf('.') != -1 &&
+ (parts[0].slice(-1) == '0' || parts[0].slice(-1) == '.')) {
+ parts[0] = parts[0].slice(0, -1);
+ }
+ } else {
+ // Make sure we have a period in alternative mode.
+ if (flagAlternative && argText.indexOf('.') == -1) parts[0] += '.';
+ // Zero pad until required precision.
+ while (precision > effectivePrecision++) parts[0] += '0';
+ }
+ argText = parts[0] + (parts.length > 1 ? 'e' + parts[1] : '');
+
+ // Capitalize 'E' if needed.
+ if (next == 69) argText = argText.toUpperCase();
+
+ // Add sign.
+ if (currArg >= 0) {
+ if (flagAlwaysSigned) {
+ argText = '+' + argText;
+ } else if (flagPadSign) {
+ argText = ' ' + argText;
+ }
+ }
+ }
+
+ // Add padding.
+ while (argText.length < width) {
+ if (flagLeftAlign) {
+ argText += ' ';
+ } else {
+ if (flagZeroPad && (argText[0] == '-' || argText[0] == '+')) {
+ argText = argText[0] + '0' + argText.slice(1);
+ } else {
+ argText = (flagZeroPad ? '0' : ' ') + argText;
+ }
+ }
+ }
+
+ // Adjust case.
+ if (next < 97) argText = argText.toUpperCase();
+
+ // Insert the result into the buffer.
+ argText.split('').forEach(function(chr) {
+ ret.push(chr.charCodeAt(0));
+ });
+ break;
+ }
+ case 's': {
+ // String.
+ var arg = getNextArg('i8*');
+ var argLength = arg ? _strlen(arg) : '(null)'.length;
+ if (precisionSet) argLength = Math.min(argLength, precision);
+ if (!flagLeftAlign) {
+ while (argLength < width--) {
+ ret.push(32);
+ }
+ }
+ if (arg) {
+ for (var i = 0; i < argLength; i++) {
+ ret.push(HEAPU8[((arg++)|0)]);
+ }
+ } else {
+ ret = ret.concat(intArrayFromString('(null)'.substr(0, argLength), true));
+ }
+ if (flagLeftAlign) {
+ while (argLength < width--) {
+ ret.push(32);
+ }
+ }
+ break;
+ }
+ case 'c': {
+ // Character.
+ if (flagLeftAlign) ret.push(getNextArg('i8'));
+ while (--width > 0) {
+ ret.push(32);
+ }
+ if (!flagLeftAlign) ret.push(getNextArg('i8'));
+ break;
+ }
+ case 'n': {
+ // Write the length written so far to the next parameter.
+ var ptr = getNextArg('i32*');
+ HEAP32[((ptr)>>2)]=ret.length;
+ break;
+ }
+ case '%': {
+ // Literal percent sign.
+ ret.push(curr);
+ break;
+ }
+ default: {
+ // Unknown specifiers remain untouched.
+ for (var i = startTextIndex; i < textIndex + 2; i++) {
+ ret.push(HEAP8[(i)]);
+ }
+ }
+ }
+ textIndex += 2;
+ // TODO: Support a/A (hex float) and m (last error) specifiers.
+ // TODO: Support %1${specifier} for arg selection.
+ } else {
+ ret.push(curr);
+ textIndex += 1;
+ }
+ }
+ return ret;
+ }function _fprintf(stream, format, varargs) {
+ // int fprintf(FILE *restrict stream, const char *restrict format, ...);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
+ var result = __formatString(format, varargs);
+ var stack = Runtime.stackSave();
+ var ret = _fwrite(allocate(result, 'i8', ALLOC_STACK), 1, result.length, stream);
+ Runtime.stackRestore(stack);
+ return ret;
+ }function _printf(format, varargs) {
+ // int printf(const char *restrict format, ...);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
+ var stdout = HEAP32[((_stdout)>>2)];
+ return _fprintf(stdout, format, varargs);
+ }
+
+
+ function _fputc(c, stream) {
+ // int fputc(int c, FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fputc.html
+ var chr = unSign(c & 0xFF);
+ HEAP8[((_fputc.ret)|0)]=chr;
+ var fd = _fileno(stream);
+ var ret = _write(fd, _fputc.ret, 1);
+ if (ret == -1) {
+ var streamObj = FS.getStreamFromPtr(stream);
+ if (streamObj) streamObj.error = true;
+ return -1;
+ } else {
+ return chr;
+ }
+ }function _putchar(c) {
+ // int putchar(int c);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/putchar.html
+ return _fputc(c, HEAP32[((_stdout)>>2)]);
+ }
+
+ function _sbrk(bytes) {
+ // Implement a Linux-like 'memory area' for our 'process'.
+ // Changes the size of the memory area by |bytes|; returns the
+ // address of the previous top ('break') of the memory area
+ // We control the "dynamic" memory - DYNAMIC_BASE to DYNAMICTOP
+ var self = _sbrk;
+ if (!self.called) {
+ DYNAMICTOP = alignMemoryPage(DYNAMICTOP); // make sure we start out aligned
+ self.called = true;
+ assert(Runtime.dynamicAlloc);
+ self.alloc = Runtime.dynamicAlloc;
+ Runtime.dynamicAlloc = function() { abort('cannot dynamically allocate, sbrk now has control') };
+ }
+ var ret = DYNAMICTOP;
+ if (bytes != 0) self.alloc(bytes);
+ return ret; // Previous break location.
+ }
+
+ function _sysconf(name) {
+ // long sysconf(int name);
+ // http://pubs.opengroup.org/onlinepubs/009695399/functions/sysconf.html
+ switch(name) {
+ case 30: return PAGE_SIZE;
+ case 132:
+ case 133:
+ case 12:
+ case 137:
+ case 138:
+ case 15:
+ case 235:
+ case 16:
+ case 17:
+ case 18:
+ case 19:
+ case 20:
+ case 149:
+ case 13:
+ case 10:
+ case 236:
+ case 153:
+ case 9:
+ case 21:
+ case 22:
+ case 159:
+ case 154:
+ case 14:
+ case 77:
+ case 78:
+ case 139:
+ case 80:
+ case 81:
+ case 79:
+ case 82:
+ case 68:
+ case 67:
+ case 164:
+ case 11:
+ case 29:
+ case 47:
+ case 48:
+ case 95:
+ case 52:
+ case 51:
+ case 46:
+ return 200809;
+ case 27:
+ case 246:
+ case 127:
+ case 128:
+ case 23:
+ case 24:
+ case 160:
+ case 161:
+ case 181:
+ case 182:
+ case 242:
+ case 183:
+ case 184:
+ case 243:
+ case 244:
+ case 245:
+ case 165:
+ case 178:
+ case 179:
+ case 49:
+ case 50:
+ case 168:
+ case 169:
+ case 175:
+ case 170:
+ case 171:
+ case 172:
+ case 97:
+ case 76:
+ case 32:
+ case 173:
+ case 35:
+ return -1;
+ case 176:
+ case 177:
+ case 7:
+ case 155:
+ case 8:
+ case 157:
+ case 125:
+ case 126:
+ case 92:
+ case 93:
+ case 129:
+ case 130:
+ case 131:
+ case 94:
+ case 91:
+ return 1;
+ case 74:
+ case 60:
+ case 69:
+ case 70:
+ case 4:
+ return 1024;
+ case 31:
+ case 42:
+ case 72:
+ return 32;
+ case 87:
+ case 26:
+ case 33:
+ return 2147483647;
+ case 34:
+ case 1:
+ return 47839;
+ case 38:
+ case 36:
+ return 99;
+ case 43:
+ case 37:
+ return 2048;
+ case 0: return 2097152;
+ case 3: return 65536;
+ case 28: return 32768;
+ case 44: return 32767;
+ case 75: return 16384;
+ case 39: return 1000;
+ case 89: return 700;
+ case 71: return 256;
+ case 40: return 255;
+ case 2: return 100;
+ case 180: return 64;
+ case 25: return 20;
+ case 5: return 16;
+ case 6: return 6;
+ case 73: return 4;
+ case 84: return 1;
+ }
+ ___setErrNo(ERRNO_CODES.EINVAL);
+ return -1;
+ }
+
+
+ Module["_memset"] = _memset;
+
+ function ___errno_location() {
+ return ___errno_state;
+ }
+
+ function _abort() {
+ Module['abort']();
+ }
+
+ var Browser={mainLoop:{scheduler:null,method:"",shouldPause:false,paused:false,queue:[],pause:function () {
+ Browser.mainLoop.shouldPause = true;
+ },resume:function () {
+ if (Browser.mainLoop.paused) {
+ Browser.mainLoop.paused = false;
+ Browser.mainLoop.scheduler();
+ }
+ Browser.mainLoop.shouldPause = false;
+ },updateStatus:function () {
+ if (Module['setStatus']) {
+ var message = Module['statusMessage'] || 'Please wait...';
+ var remaining = Browser.mainLoop.remainingBlockers;
+ var expected = Browser.mainLoop.expectedBlockers;
+ if (remaining) {
+ if (remaining < expected) {
+ Module['setStatus'](message + ' (' + (expected - remaining) + '/' + expected + ')');
+ } else {
+ Module['setStatus'](message);
+ }
+ } else {
+ Module['setStatus']('');
+ }
+ }
+ }},isFullScreen:false,pointerLock:false,moduleContextCreatedCallbacks:[],workers:[],init:function () {
+ if (!Module["preloadPlugins"]) Module["preloadPlugins"] = []; // needs to exist even in workers
+
+ if (Browser.initted || ENVIRONMENT_IS_WORKER) return;
+ Browser.initted = true;
+
+ try {
+ new Blob();
+ Browser.hasBlobConstructor = true;
+ } catch(e) {
+ Browser.hasBlobConstructor = false;
+ console.log("warning: no blob constructor, cannot create blobs with mimetypes");
+ }
+ Browser.BlobBuilder = typeof MozBlobBuilder != "undefined" ? MozBlobBuilder : (typeof WebKitBlobBuilder != "undefined" ? WebKitBlobBuilder : (!Browser.hasBlobConstructor ? console.log("warning: no BlobBuilder") : null));
+ Browser.URLObject = typeof window != "undefined" ? (window.URL ? window.URL : window.webkitURL) : undefined;
+ if (!Module.noImageDecoding && typeof Browser.URLObject === 'undefined') {
+ console.log("warning: Browser does not support creating object URLs. Built-in browser image decoding will not be available.");
+ Module.noImageDecoding = true;
+ }
+
+ // Support for plugins that can process preloaded files. You can add more of these to
+ // your app by creating and appending to Module.preloadPlugins.
+ //
+ // Each plugin is asked if it can handle a file based on the file's name. If it can,
+ // it is given the file's raw data. When it is done, it calls a callback with the file's
+ // (possibly modified) data. For example, a plugin might decompress a file, or it
+ // might create some side data structure for use later (like an Image element, etc.).
+
+ var imagePlugin = {};
+ imagePlugin['canHandle'] = function imagePlugin_canHandle(name) {
+ return !Module.noImageDecoding && /\.(jpg|jpeg|png|bmp)$/i.test(name);
+ };
+ imagePlugin['handle'] = function imagePlugin_handle(byteArray, name, onload, onerror) {
+ var b = null;
+ if (Browser.hasBlobConstructor) {
+ try {
+ b = new Blob([byteArray], { type: Browser.getMimetype(name) });
+ if (b.size !== byteArray.length) { // Safari bug #118630
+ // Safari's Blob can only take an ArrayBuffer
+ b = new Blob([(new Uint8Array(byteArray)).buffer], { type: Browser.getMimetype(name) });
+ }
+ } catch(e) {
+ Runtime.warnOnce('Blob constructor present but fails: ' + e + '; falling back to blob builder');
+ }
+ }
+ if (!b) {
+ var bb = new Browser.BlobBuilder();
+ bb.append((new Uint8Array(byteArray)).buffer); // we need to pass a buffer, and must copy the array to get the right data range
+ b = bb.getBlob();
+ }
+ var url = Browser.URLObject.createObjectURL(b);
+ var img = new Image();
+ img.onload = function img_onload() {
+ assert(img.complete, 'Image ' + name + ' could not be decoded');
+ var canvas = document.createElement('canvas');
+ canvas.width = img.width;
+ canvas.height = img.height;
+ var ctx = canvas.getContext('2d');
+ ctx.drawImage(img, 0, 0);
+ Module["preloadedImages"][name] = canvas;
+ Browser.URLObject.revokeObjectURL(url);
+ if (onload) onload(byteArray);
+ };
+ img.onerror = function img_onerror(event) {
+ console.log('Image ' + url + ' could not be decoded');
+ if (onerror) onerror();
+ };
+ img.src = url;
+ };
+ Module['preloadPlugins'].push(imagePlugin);
+
+ var audioPlugin = {};
+ audioPlugin['canHandle'] = function audioPlugin_canHandle(name) {
+ return !Module.noAudioDecoding && name.substr(-4) in { '.ogg': 1, '.wav': 1, '.mp3': 1 };
+ };
+ audioPlugin['handle'] = function audioPlugin_handle(byteArray, name, onload, onerror) {
+ var done = false;
+ function finish(audio) {
+ if (done) return;
+ done = true;
+ Module["preloadedAudios"][name] = audio;
+ if (onload) onload(byteArray);
+ }
+ function fail() {
+ if (done) return;
+ done = true;
+ Module["preloadedAudios"][name] = new Audio(); // empty shim
+ if (onerror) onerror();
+ }
+ if (Browser.hasBlobConstructor) {
+ try {
+ var b = new Blob([byteArray], { type: Browser.getMimetype(name) });
+ } catch(e) {
+ return fail();
+ }
+ var url = Browser.URLObject.createObjectURL(b); // XXX we never revoke this!
+ var audio = new Audio();
+ audio.addEventListener('canplaythrough', function() { finish(audio) }, false); // use addEventListener due to chromium bug 124926
+ audio.onerror = function audio_onerror(event) {
+ if (done) return;
+ console.log('warning: browser could not fully decode audio ' + name + ', trying slower base64 approach');
+ function encode64(data) {
+ var BASE = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
+ var PAD = '=';
+ var ret = '';
+ var leftchar = 0;
+ var leftbits = 0;
+ for (var i = 0; i < data.length; i++) {
+ leftchar = (leftchar << 8) | data[i];
+ leftbits += 8;
+ while (leftbits >= 6) {
+ var curr = (leftchar >> (leftbits-6)) & 0x3f;
+ leftbits -= 6;
+ ret += BASE[curr];
+ }
+ }
+ if (leftbits == 2) {
+ ret += BASE[(leftchar&3) << 4];
+ ret += PAD + PAD;
+ } else if (leftbits == 4) {
+ ret += BASE[(leftchar&0xf) << 2];
+ ret += PAD;
+ }
+ return ret;
+ }
+ audio.src = 'data:audio/x-' + name.substr(-3) + ';base64,' + encode64(byteArray);
+ finish(audio); // we don't wait for confirmation this worked - but it's worth trying
+ };
+ audio.src = url;
+ // workaround for chrome bug 124926 - we do not always get oncanplaythrough or onerror
+ Browser.safeSetTimeout(function() {
+ finish(audio); // try to use it even though it is not necessarily ready to play
+ }, 10000);
+ } else {
+ return fail();
+ }
+ };
+ Module['preloadPlugins'].push(audioPlugin);
+
+ // Canvas event setup
+
+ var canvas = Module['canvas'];
+
+ // forced aspect ratio can be enabled by defining 'forcedAspectRatio' on Module
+ // Module['forcedAspectRatio'] = 4 / 3;
+
+ canvas.requestPointerLock = canvas['requestPointerLock'] ||
+ canvas['mozRequestPointerLock'] ||
+ canvas['webkitRequestPointerLock'] ||
+ canvas['msRequestPointerLock'] ||
+ function(){};
+ canvas.exitPointerLock = document['exitPointerLock'] ||
+ document['mozExitPointerLock'] ||
+ document['webkitExitPointerLock'] ||
+ document['msExitPointerLock'] ||
+ function(){}; // no-op if function does not exist
+ canvas.exitPointerLock = canvas.exitPointerLock.bind(document);
+
+ function pointerLockChange() {
+ Browser.pointerLock = document['pointerLockElement'] === canvas ||
+ document['mozPointerLockElement'] === canvas ||
+ document['webkitPointerLockElement'] === canvas ||
+ document['msPointerLockElement'] === canvas;
+ }
+
+ document.addEventListener('pointerlockchange', pointerLockChange, false);
+ document.addEventListener('mozpointerlockchange', pointerLockChange, false);
+ document.addEventListener('webkitpointerlockchange', pointerLockChange, false);
+ document.addEventListener('mspointerlockchange', pointerLockChange, false);
+
+ if (Module['elementPointerLock']) {
+ canvas.addEventListener("click", function(ev) {
+ if (!Browser.pointerLock && canvas.requestPointerLock) {
+ canvas.requestPointerLock();
+ ev.preventDefault();
+ }
+ }, false);
+ }
+ },createContext:function (canvas, useWebGL, setInModule, webGLContextAttributes) {
+ var ctx;
+ var errorInfo = '?';
+ function onContextCreationError(event) {
+ errorInfo = event.statusMessage || errorInfo;
+ }
+ try {
+ if (useWebGL) {
+ var contextAttributes = {
+ antialias: false,
+ alpha: false
+ };
+
+ if (webGLContextAttributes) {
+ for (var attribute in webGLContextAttributes) {
+ contextAttributes[attribute] = webGLContextAttributes[attribute];
+ }
+ }
+
+
+ canvas.addEventListener('webglcontextcreationerror', onContextCreationError, false);
+ try {
+ ['experimental-webgl', 'webgl'].some(function(webglId) {
+ return ctx = canvas.getContext(webglId, contextAttributes);
+ });
+ } finally {
+ canvas.removeEventListener('webglcontextcreationerror', onContextCreationError, false);
+ }
+ } else {
+ ctx = canvas.getContext('2d');
+ }
+ if (!ctx) throw ':(';
+ } catch (e) {
+ Module.print('Could not create canvas: ' + [errorInfo, e]);
+ return null;
+ }
+ if (useWebGL) {
+ // Set the background of the WebGL canvas to black
+ canvas.style.backgroundColor = "black";
+
+ // Warn on context loss
+ canvas.addEventListener('webglcontextlost', function(event) {
+ alert('WebGL context lost. You will need to reload the page.');
+ }, false);
+ }
+ if (setInModule) {
+ GLctx = Module.ctx = ctx;
+ Module.useWebGL = useWebGL;
+ Browser.moduleContextCreatedCallbacks.forEach(function(callback) { callback() });
+ Browser.init();
+ }
+ return ctx;
+ },destroyContext:function (canvas, useWebGL, setInModule) {},fullScreenHandlersInstalled:false,lockPointer:undefined,resizeCanvas:undefined,requestFullScreen:function (lockPointer, resizeCanvas) {
+ Browser.lockPointer = lockPointer;
+ Browser.resizeCanvas = resizeCanvas;
+ if (typeof Browser.lockPointer === 'undefined') Browser.lockPointer = true;
+ if (typeof Browser.resizeCanvas === 'undefined') Browser.resizeCanvas = false;
+
+ var canvas = Module['canvas'];
+ function fullScreenChange() {
+ Browser.isFullScreen = false;
+ var canvasContainer = canvas.parentNode;
+ if ((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
+ document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
+ document['fullScreenElement'] || document['fullscreenElement'] ||
+ document['msFullScreenElement'] || document['msFullscreenElement'] ||
+ document['webkitCurrentFullScreenElement']) === canvasContainer) {
+ canvas.cancelFullScreen = document['cancelFullScreen'] ||
+ document['mozCancelFullScreen'] ||
+ document['webkitCancelFullScreen'] ||
+ document['msExitFullscreen'] ||
+ document['exitFullscreen'] ||
+ function() {};
+ canvas.cancelFullScreen = canvas.cancelFullScreen.bind(document);
+ if (Browser.lockPointer) canvas.requestPointerLock();
+ Browser.isFullScreen = true;
+ if (Browser.resizeCanvas) Browser.setFullScreenCanvasSize();
+ } else {
+
+ // remove the full screen specific parent of the canvas again to restore the HTML structure from before going full screen
+ canvasContainer.parentNode.insertBefore(canvas, canvasContainer);
+ canvasContainer.parentNode.removeChild(canvasContainer);
+
+ if (Browser.resizeCanvas) Browser.setWindowedCanvasSize();
+ }
+ if (Module['onFullScreen']) Module['onFullScreen'](Browser.isFullScreen);
+ Browser.updateCanvasDimensions(canvas);
+ }
+
+ if (!Browser.fullScreenHandlersInstalled) {
+ Browser.fullScreenHandlersInstalled = true;
+ document.addEventListener('fullscreenchange', fullScreenChange, false);
+ document.addEventListener('mozfullscreenchange', fullScreenChange, false);
+ document.addEventListener('webkitfullscreenchange', fullScreenChange, false);
+ document.addEventListener('MSFullscreenChange', fullScreenChange, false);
+ }
+
+ // create a new parent to ensure the canvas has no siblings. this allows browsers to optimize full screen performance when its parent is the full screen root
+ var canvasContainer = document.createElement("div");
+ canvas.parentNode.insertBefore(canvasContainer, canvas);
+ canvasContainer.appendChild(canvas);
+
+ // use parent of canvas as full screen root to allow aspect ratio correction (Firefox stretches the root to screen size)
+ canvasContainer.requestFullScreen = canvasContainer['requestFullScreen'] ||
+ canvasContainer['mozRequestFullScreen'] ||
+ canvasContainer['msRequestFullscreen'] ||
+ (canvasContainer['webkitRequestFullScreen'] ? function() { canvasContainer['webkitRequestFullScreen'](Element['ALLOW_KEYBOARD_INPUT']) } : null);
+ canvasContainer.requestFullScreen();
+ },requestAnimationFrame:function requestAnimationFrame(func) {
+ if (typeof window === 'undefined') { // Provide fallback to setTimeout if window is undefined (e.g. in Node.js)
+ setTimeout(func, 1000/60);
+ } else {
+ if (!window.requestAnimationFrame) {
+ window.requestAnimationFrame = window['requestAnimationFrame'] ||
+ window['mozRequestAnimationFrame'] ||
+ window['webkitRequestAnimationFrame'] ||
+ window['msRequestAnimationFrame'] ||
+ window['oRequestAnimationFrame'] ||
+ window['setTimeout'];
+ }
+ window.requestAnimationFrame(func);
+ }
+ },safeCallback:function (func) {
+ return function() {
+ if (!ABORT) return func.apply(null, arguments);
+ };
+ },safeRequestAnimationFrame:function (func) {
+ return Browser.requestAnimationFrame(function() {
+ if (!ABORT) func();
+ });
+ },safeSetTimeout:function (func, timeout) {
+ return setTimeout(function() {
+ if (!ABORT) func();
+ }, timeout);
+ },safeSetInterval:function (func, timeout) {
+ return setInterval(function() {
+ if (!ABORT) func();
+ }, timeout);
+ },getMimetype:function (name) {
+ return {
+ 'jpg': 'image/jpeg',
+ 'jpeg': 'image/jpeg',
+ 'png': 'image/png',
+ 'bmp': 'image/bmp',
+ 'ogg': 'audio/ogg',
+ 'wav': 'audio/wav',
+ 'mp3': 'audio/mpeg'
+ }[name.substr(name.lastIndexOf('.')+1)];
+ },getUserMedia:function (func) {
+ if(!window.getUserMedia) {
+ window.getUserMedia = navigator['getUserMedia'] ||
+ navigator['mozGetUserMedia'];
+ }
+ window.getUserMedia(func);
+ },getMovementX:function (event) {
+ return event['movementX'] ||
+ event['mozMovementX'] ||
+ event['webkitMovementX'] ||
+ 0;
+ },getMovementY:function (event) {
+ return event['movementY'] ||
+ event['mozMovementY'] ||
+ event['webkitMovementY'] ||
+ 0;
+ },getMouseWheelDelta:function (event) {
+ return Math.max(-1, Math.min(1, event.type === 'DOMMouseScroll' ? event.detail : -event.wheelDelta));
+ },mouseX:0,mouseY:0,mouseMovementX:0,mouseMovementY:0,calculateMouseEvent:function (event) { // event should be mousemove, mousedown or mouseup
+ if (Browser.pointerLock) {
+ // When the pointer is locked, calculate the coordinates
+ // based on the movement of the mouse.
+ // Workaround for Firefox bug 764498
+ if (event.type != 'mousemove' &&
+ ('mozMovementX' in event)) {
+ Browser.mouseMovementX = Browser.mouseMovementY = 0;
+ } else {
+ Browser.mouseMovementX = Browser.getMovementX(event);
+ Browser.mouseMovementY = Browser.getMovementY(event);
+ }
+
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ Browser.mouseX = SDL.mouseX + Browser.mouseMovementX;
+ Browser.mouseY = SDL.mouseY + Browser.mouseMovementY;
+ } else {
+ // just add the mouse delta to the current absolut mouse position
+ // FIXME: ideally this should be clamped against the canvas size and zero
+ Browser.mouseX += Browser.mouseMovementX;
+ Browser.mouseY += Browser.mouseMovementY;
+ }
+ } else {
+ // Otherwise, calculate the movement based on the changes
+ // in the coordinates.
+ var rect = Module["canvas"].getBoundingClientRect();
+ var x, y;
+
+ // Neither .scrollX or .pageXOffset are defined in a spec, but
+ // we prefer .scrollX because it is currently in a spec draft.
+ // (see: http://www.w3.org/TR/2013/WD-cssom-view-20131217/)
+ var scrollX = ((typeof window.scrollX !== 'undefined') ? window.scrollX : window.pageXOffset);
+ var scrollY = ((typeof window.scrollY !== 'undefined') ? window.scrollY : window.pageYOffset);
+ if (event.type == 'touchstart' ||
+ event.type == 'touchend' ||
+ event.type == 'touchmove') {
+ var t = event.touches.item(0);
+ if (t) {
+ x = t.pageX - (scrollX + rect.left);
+ y = t.pageY - (scrollY + rect.top);
+ } else {
+ return;
+ }
+ } else {
+ x = event.pageX - (scrollX + rect.left);
+ y = event.pageY - (scrollY + rect.top);
+ }
+
+ // the canvas might be CSS-scaled compared to its backbuffer;
+ // SDL-using content will want mouse coordinates in terms
+ // of backbuffer units.
+ var cw = Module["canvas"].width;
+ var ch = Module["canvas"].height;
+ x = x * (cw / rect.width);
+ y = y * (ch / rect.height);
+
+ Browser.mouseMovementX = x - Browser.mouseX;
+ Browser.mouseMovementY = y - Browser.mouseY;
+ Browser.mouseX = x;
+ Browser.mouseY = y;
+ }
+ },xhrLoad:function (url, onload, onerror) {
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, true);
+ xhr.responseType = 'arraybuffer';
+ xhr.onload = function xhr_onload() {
+ if (xhr.status == 200 || (xhr.status == 0 && xhr.response)) { // file URLs can return 0
+ onload(xhr.response);
+ } else {
+ onerror();
+ }
+ };
+ xhr.onerror = onerror;
+ xhr.send(null);
+ },asyncLoad:function (url, onload, onerror, noRunDep) {
+ Browser.xhrLoad(url, function(arrayBuffer) {
+ assert(arrayBuffer, 'Loading data file "' + url + '" failed (no arrayBuffer).');
+ onload(new Uint8Array(arrayBuffer));
+ if (!noRunDep) removeRunDependency('al ' + url);
+ }, function(event) {
+ if (onerror) {
+ onerror();
+ } else {
+ throw 'Loading data file "' + url + '" failed.';
+ }
+ });
+ if (!noRunDep) addRunDependency('al ' + url);
+ },resizeListeners:[],updateResizeListeners:function () {
+ var canvas = Module['canvas'];
+ Browser.resizeListeners.forEach(function(listener) {
+ listener(canvas.width, canvas.height);
+ });
+ },setCanvasSize:function (width, height, noUpdates) {
+ var canvas = Module['canvas'];
+ Browser.updateCanvasDimensions(canvas, width, height);
+ if (!noUpdates) Browser.updateResizeListeners();
+ },windowedWidth:0,windowedHeight:0,setFullScreenCanvasSize:function () {
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
+ flags = flags | 0x00800000; // set SDL_FULLSCREEN flag
+ HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
+ }
+ Browser.updateResizeListeners();
+ },setWindowedCanvasSize:function () {
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
+ flags = flags & ~0x00800000; // clear SDL_FULLSCREEN flag
+ HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
+ }
+ Browser.updateResizeListeners();
+ },updateCanvasDimensions:function (canvas, wNative, hNative) {
+ if (wNative && hNative) {
+ canvas.widthNative = wNative;
+ canvas.heightNative = hNative;
+ } else {
+ wNative = canvas.widthNative;
+ hNative = canvas.heightNative;
+ }
+ var w = wNative;
+ var h = hNative;
+ if (Module['forcedAspectRatio'] && Module['forcedAspectRatio'] > 0) {
+ if (w/h < Module['forcedAspectRatio']) {
+ w = Math.round(h * Module['forcedAspectRatio']);
+ } else {
+ h = Math.round(w / Module['forcedAspectRatio']);
+ }
+ }
+ if (((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
+ document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
+ document['fullScreenElement'] || document['fullscreenElement'] ||
+ document['msFullScreenElement'] || document['msFullscreenElement'] ||
+ document['webkitCurrentFullScreenElement']) === canvas.parentNode) && (typeof screen != 'undefined')) {
+ var factor = Math.min(screen.width / w, screen.height / h);
+ w = Math.round(w * factor);
+ h = Math.round(h * factor);
+ }
+ if (Browser.resizeCanvas) {
+ if (canvas.width != w) canvas.width = w;
+ if (canvas.height != h) canvas.height = h;
+ if (typeof canvas.style != 'undefined') {
+ canvas.style.removeProperty( "width");
+ canvas.style.removeProperty("height");
+ }
+ } else {
+ if (canvas.width != wNative) canvas.width = wNative;
+ if (canvas.height != hNative) canvas.height = hNative;
+ if (typeof canvas.style != 'undefined') {
+ if (w != wNative || h != hNative) {
+ canvas.style.setProperty( "width", w + "px", "important");
+ canvas.style.setProperty("height", h + "px", "important");
+ } else {
+ canvas.style.removeProperty( "width");
+ canvas.style.removeProperty("height");
+ }
+ }
+ }
+ }};
+
+ function _time(ptr) {
+ var ret = Math.floor(Date.now()/1000);
+ if (ptr) {
+ HEAP32[((ptr)>>2)]=ret;
+ }
+ return ret;
+ }
+
+
+
+ function _emscripten_memcpy_big(dest, src, num) {
+ HEAPU8.set(HEAPU8.subarray(src, src+num), dest);
+ return dest;
+ }
+ Module["_memcpy"] = _memcpy;
+FS.staticInit();__ATINIT__.unshift({ func: function() { if (!Module["noFSInit"] && !FS.init.initialized) FS.init() } });__ATMAIN__.push({ func: function() { FS.ignorePermissions = false } });__ATEXIT__.push({ func: function() { FS.quit() } });Module["FS_createFolder"] = FS.createFolder;Module["FS_createPath"] = FS.createPath;Module["FS_createDataFile"] = FS.createDataFile;Module["FS_createPreloadedFile"] = FS.createPreloadedFile;Module["FS_createLazyFile"] = FS.createLazyFile;Module["FS_createLink"] = FS.createLink;Module["FS_createDevice"] = FS.createDevice;
+___errno_state = Runtime.staticAlloc(4); HEAP32[((___errno_state)>>2)]=0;
+__ATINIT__.unshift({ func: function() { TTY.init() } });__ATEXIT__.push({ func: function() { TTY.shutdown() } });TTY.utf8 = new Runtime.UTF8Processor();
+if (ENVIRONMENT_IS_NODE) { var fs = require("fs"); NODEFS.staticInit(); }
+__ATINIT__.push({ func: function() { SOCKFS.root = FS.mount(SOCKFS, {}, null); } });
+_fputc.ret = allocate([0], "i8", ALLOC_STATIC);
+Module["requestFullScreen"] = function Module_requestFullScreen(lockPointer, resizeCanvas) { Browser.requestFullScreen(lockPointer, resizeCanvas) };
+ Module["requestAnimationFrame"] = function Module_requestAnimationFrame(func) { Browser.requestAnimationFrame(func) };
+ Module["setCanvasSize"] = function Module_setCanvasSize(width, height, noUpdates) { Browser.setCanvasSize(width, height, noUpdates) };
+ Module["pauseMainLoop"] = function Module_pauseMainLoop() { Browser.mainLoop.pause() };
+ Module["resumeMainLoop"] = function Module_resumeMainLoop() { Browser.mainLoop.resume() };
+ Module["getUserMedia"] = function Module_getUserMedia() { Browser.getUserMedia() }
+STACK_BASE = STACKTOP = Runtime.alignMemory(STATICTOP);
+
+staticSealed = true; // seal the static portion of memory
+
+STACK_MAX = STACK_BASE + 5242880;
+
+DYNAMIC_BASE = DYNAMICTOP = Runtime.alignMemory(STACK_MAX);
+
+assert(DYNAMIC_BASE < TOTAL_MEMORY, "TOTAL_MEMORY not big enough for stack");
+
+
+var Math_min = Math.min;
+function asmPrintInt(x, y) {
+ Module.print('int ' + x + ',' + y);// + ' ' + new Error().stack);
+}
+function asmPrintFloat(x, y) {
+ Module.print('float ' + x + ',' + y);// + ' ' + new Error().stack);
+}
+// EMSCRIPTEN_START_ASM
+var asm = Wasm.instantiateModuleFromAsm((function Module(global, env, buffer) {
+ 'use asm';
+ var HEAP8 = new global.Int8Array(buffer);
+ var HEAP16 = new global.Int16Array(buffer);
+ var HEAP32 = new global.Int32Array(buffer);
+ var HEAPU8 = new global.Uint8Array(buffer);
+ var HEAPU16 = new global.Uint16Array(buffer);
+ var HEAPU32 = new global.Uint32Array(buffer);
+ var HEAPF32 = new global.Float32Array(buffer);
+ var HEAPF64 = new global.Float64Array(buffer);
+
+ var STACKTOP=env.STACKTOP|0;
+ var STACK_MAX=env.STACK_MAX|0;
+ var tempDoublePtr=env.tempDoublePtr|0;
+ var ABORT=env.ABORT|0;
+
+ var __THREW__ = 0;
+ var threwValue = 0;
+ var setjmpId = 0;
+ var undef = 0;
+ var nan = +env.NaN, inf = +env.Infinity;
+ var tempInt = 0, tempBigInt = 0, tempBigIntP = 0, tempBigIntS = 0, tempBigIntR = 0.0, tempBigIntI = 0, tempBigIntD = 0, tempValue = 0, tempDouble = 0.0;
+
+ var tempRet0 = 0;
+ var tempRet1 = 0;
+ var tempRet2 = 0;
+ var tempRet3 = 0;
+ var tempRet4 = 0;
+ var tempRet5 = 0;
+ var tempRet6 = 0;
+ var tempRet7 = 0;
+ var tempRet8 = 0;
+ var tempRet9 = 0;
+ var Math_floor=global.Math.floor;
+ var Math_abs=global.Math.abs;
+ var Math_sqrt=global.Math.sqrt;
+ var Math_pow=global.Math.pow;
+ var Math_cos=global.Math.cos;
+ var Math_sin=global.Math.sin;
+ var Math_tan=global.Math.tan;
+ var Math_acos=global.Math.acos;
+ var Math_asin=global.Math.asin;
+ var Math_atan=global.Math.atan;
+ var Math_atan2=global.Math.atan2;
+ var Math_exp=global.Math.exp;
+ var Math_log=global.Math.log;
+ var Math_ceil=global.Math.ceil;
+ var Math_imul=global.Math.imul;
+ var abort=env.abort;
+ var assert=env.assert;
+ var asmPrintInt=env.asmPrintInt;
+ var asmPrintFloat=env.asmPrintFloat;
+ var Math_min=env.min;
+ var _fflush=env._fflush;
+ var _emscripten_memcpy_big=env._emscripten_memcpy_big;
+ var _putchar=env._putchar;
+ var _fputc=env._fputc;
+ var _send=env._send;
+ var _pwrite=env._pwrite;
+ var _abort=env._abort;
+ var __reallyNegative=env.__reallyNegative;
+ var _fwrite=env._fwrite;
+ var _sbrk=env._sbrk;
+ var _mkport=env._mkport;
+ var _fprintf=env._fprintf;
+ var ___setErrNo=env.___setErrNo;
+ var __formatString=env.__formatString;
+ var _fileno=env._fileno;
+ var _printf=env._printf;
+ var _time=env._time;
+ var _sysconf=env._sysconf;
+ var _write=env._write;
+ var ___errno_location=env.___errno_location;
+ var tempFloat = 0.0;
+
+// EMSCRIPTEN_START_FUNCS
+function _malloc(i12) {
+ i12 = i12 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0, i30 = 0, i31 = 0, i32 = 0;
+ i1 = STACKTOP;
+ do {
+ if (i12 >>> 0 < 245) {
+ if (i12 >>> 0 < 11) {
+ i12 = 16;
+ } else {
+ i12 = i12 + 11 & -8;
+ }
+ i20 = i12 >>> 3;
+ i18 = HEAP32[14] | 0;
+ i21 = i18 >>> i20;
+ if ((i21 & 3 | 0) != 0) {
+ i6 = (i21 & 1 ^ 1) + i20 | 0;
+ i5 = i6 << 1;
+ i3 = 96 + (i5 << 2) | 0;
+ i5 = 96 + (i5 + 2 << 2) | 0;
+ i7 = HEAP32[i5 >> 2] | 0;
+ i2 = i7 + 8 | 0;
+ i4 = HEAP32[i2 >> 2] | 0;
+ do {
+ if ((i3 | 0) != (i4 | 0)) {
+ if (i4 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i8 = i4 + 12 | 0;
+ if ((HEAP32[i8 >> 2] | 0) == (i7 | 0)) {
+ HEAP32[i8 >> 2] = i3;
+ HEAP32[i5 >> 2] = i4;
+ break;
+ } else {
+ _abort();
+ }
+ } else {
+ HEAP32[14] = i18 & ~(1 << i6);
+ }
+ } while (0);
+ i32 = i6 << 3;
+ HEAP32[i7 + 4 >> 2] = i32 | 3;
+ i32 = i7 + (i32 | 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ i32 = i2;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ if (i12 >>> 0 > (HEAP32[64 >> 2] | 0) >>> 0) {
+ if ((i21 | 0) != 0) {
+ i7 = 2 << i20;
+ i7 = i21 << i20 & (i7 | 0 - i7);
+ i7 = (i7 & 0 - i7) + -1 | 0;
+ i2 = i7 >>> 12 & 16;
+ i7 = i7 >>> i2;
+ i6 = i7 >>> 5 & 8;
+ i7 = i7 >>> i6;
+ i5 = i7 >>> 2 & 4;
+ i7 = i7 >>> i5;
+ i4 = i7 >>> 1 & 2;
+ i7 = i7 >>> i4;
+ i3 = i7 >>> 1 & 1;
+ i3 = (i6 | i2 | i5 | i4 | i3) + (i7 >>> i3) | 0;
+ i7 = i3 << 1;
+ i4 = 96 + (i7 << 2) | 0;
+ i7 = 96 + (i7 + 2 << 2) | 0;
+ i5 = HEAP32[i7 >> 2] | 0;
+ i2 = i5 + 8 | 0;
+ i6 = HEAP32[i2 >> 2] | 0;
+ do {
+ if ((i4 | 0) != (i6 | 0)) {
+ if (i6 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i8 = i6 + 12 | 0;
+ if ((HEAP32[i8 >> 2] | 0) == (i5 | 0)) {
+ HEAP32[i8 >> 2] = i4;
+ HEAP32[i7 >> 2] = i6;
+ break;
+ } else {
+ _abort();
+ }
+ } else {
+ HEAP32[14] = i18 & ~(1 << i3);
+ }
+ } while (0);
+ i6 = i3 << 3;
+ i4 = i6 - i12 | 0;
+ HEAP32[i5 + 4 >> 2] = i12 | 3;
+ i3 = i5 + i12 | 0;
+ HEAP32[i5 + (i12 | 4) >> 2] = i4 | 1;
+ HEAP32[i5 + i6 >> 2] = i4;
+ i6 = HEAP32[64 >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ i5 = HEAP32[76 >> 2] | 0;
+ i8 = i6 >>> 3;
+ i9 = i8 << 1;
+ i6 = 96 + (i9 << 2) | 0;
+ i7 = HEAP32[14] | 0;
+ i8 = 1 << i8;
+ if ((i7 & i8 | 0) != 0) {
+ i7 = 96 + (i9 + 2 << 2) | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ if (i8 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i28 = i7;
+ i27 = i8;
+ }
+ } else {
+ HEAP32[14] = i7 | i8;
+ i28 = 96 + (i9 + 2 << 2) | 0;
+ i27 = i6;
+ }
+ HEAP32[i28 >> 2] = i5;
+ HEAP32[i27 + 12 >> 2] = i5;
+ HEAP32[i5 + 8 >> 2] = i27;
+ HEAP32[i5 + 12 >> 2] = i6;
+ }
+ HEAP32[64 >> 2] = i4;
+ HEAP32[76 >> 2] = i3;
+ i32 = i2;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i18 = HEAP32[60 >> 2] | 0;
+ if ((i18 | 0) != 0) {
+ i2 = (i18 & 0 - i18) + -1 | 0;
+ i31 = i2 >>> 12 & 16;
+ i2 = i2 >>> i31;
+ i30 = i2 >>> 5 & 8;
+ i2 = i2 >>> i30;
+ i32 = i2 >>> 2 & 4;
+ i2 = i2 >>> i32;
+ i6 = i2 >>> 1 & 2;
+ i2 = i2 >>> i6;
+ i3 = i2 >>> 1 & 1;
+ i3 = HEAP32[360 + ((i30 | i31 | i32 | i6 | i3) + (i2 >>> i3) << 2) >> 2] | 0;
+ i2 = (HEAP32[i3 + 4 >> 2] & -8) - i12 | 0;
+ i6 = i3;
+ while (1) {
+ i5 = HEAP32[i6 + 16 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ i5 = HEAP32[i6 + 20 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ }
+ i6 = (HEAP32[i5 + 4 >> 2] & -8) - i12 | 0;
+ i4 = i6 >>> 0 < i2 >>> 0;
+ i2 = i4 ? i6 : i2;
+ i6 = i5;
+ i3 = i4 ? i5 : i3;
+ }
+ i6 = HEAP32[72 >> 2] | 0;
+ if (i3 >>> 0 < i6 >>> 0) {
+ _abort();
+ }
+ i4 = i3 + i12 | 0;
+ if (!(i3 >>> 0 < i4 >>> 0)) {
+ _abort();
+ }
+ i5 = HEAP32[i3 + 24 >> 2] | 0;
+ i7 = HEAP32[i3 + 12 >> 2] | 0;
+ do {
+ if ((i7 | 0) == (i3 | 0)) {
+ i8 = i3 + 20 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ if ((i7 | 0) == 0) {
+ i8 = i3 + 16 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ if ((i7 | 0) == 0) {
+ i26 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i10 = i7 + 20 | 0;
+ i9 = HEAP32[i10 >> 2] | 0;
+ if ((i9 | 0) != 0) {
+ i7 = i9;
+ i8 = i10;
+ continue;
+ }
+ i10 = i7 + 16 | 0;
+ i9 = HEAP32[i10 >> 2] | 0;
+ if ((i9 | 0) == 0) {
+ break;
+ } else {
+ i7 = i9;
+ i8 = i10;
+ }
+ }
+ if (i8 >>> 0 < i6 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i8 >> 2] = 0;
+ i26 = i7;
+ break;
+ }
+ } else {
+ i8 = HEAP32[i3 + 8 >> 2] | 0;
+ if (i8 >>> 0 < i6 >>> 0) {
+ _abort();
+ }
+ i6 = i8 + 12 | 0;
+ if ((HEAP32[i6 >> 2] | 0) != (i3 | 0)) {
+ _abort();
+ }
+ i9 = i7 + 8 | 0;
+ if ((HEAP32[i9 >> 2] | 0) == (i3 | 0)) {
+ HEAP32[i6 >> 2] = i7;
+ HEAP32[i9 >> 2] = i8;
+ i26 = i7;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ do {
+ if ((i5 | 0) != 0) {
+ i7 = HEAP32[i3 + 28 >> 2] | 0;
+ i6 = 360 + (i7 << 2) | 0;
+ if ((i3 | 0) == (HEAP32[i6 >> 2] | 0)) {
+ HEAP32[i6 >> 2] = i26;
+ if ((i26 | 0) == 0) {
+ HEAP32[60 >> 2] = HEAP32[60 >> 2] & ~(1 << i7);
+ break;
+ }
+ } else {
+ if (i5 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i6 = i5 + 16 | 0;
+ if ((HEAP32[i6 >> 2] | 0) == (i3 | 0)) {
+ HEAP32[i6 >> 2] = i26;
+ } else {
+ HEAP32[i5 + 20 >> 2] = i26;
+ }
+ if ((i26 | 0) == 0) {
+ break;
+ }
+ }
+ if (i26 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i26 + 24 >> 2] = i5;
+ i5 = HEAP32[i3 + 16 >> 2] | 0;
+ do {
+ if ((i5 | 0) != 0) {
+ if (i5 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i26 + 16 >> 2] = i5;
+ HEAP32[i5 + 24 >> 2] = i26;
+ break;
+ }
+ }
+ } while (0);
+ i5 = HEAP32[i3 + 20 >> 2] | 0;
+ if ((i5 | 0) != 0) {
+ if (i5 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i26 + 20 >> 2] = i5;
+ HEAP32[i5 + 24 >> 2] = i26;
+ break;
+ }
+ }
+ }
+ } while (0);
+ if (i2 >>> 0 < 16) {
+ i32 = i2 + i12 | 0;
+ HEAP32[i3 + 4 >> 2] = i32 | 3;
+ i32 = i3 + (i32 + 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ } else {
+ HEAP32[i3 + 4 >> 2] = i12 | 3;
+ HEAP32[i3 + (i12 | 4) >> 2] = i2 | 1;
+ HEAP32[i3 + (i2 + i12) >> 2] = i2;
+ i6 = HEAP32[64 >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ i5 = HEAP32[76 >> 2] | 0;
+ i8 = i6 >>> 3;
+ i9 = i8 << 1;
+ i6 = 96 + (i9 << 2) | 0;
+ i7 = HEAP32[14] | 0;
+ i8 = 1 << i8;
+ if ((i7 & i8 | 0) != 0) {
+ i7 = 96 + (i9 + 2 << 2) | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ if (i8 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i25 = i7;
+ i24 = i8;
+ }
+ } else {
+ HEAP32[14] = i7 | i8;
+ i25 = 96 + (i9 + 2 << 2) | 0;
+ i24 = i6;
+ }
+ HEAP32[i25 >> 2] = i5;
+ HEAP32[i24 + 12 >> 2] = i5;
+ HEAP32[i5 + 8 >> 2] = i24;
+ HEAP32[i5 + 12 >> 2] = i6;
+ }
+ HEAP32[64 >> 2] = i2;
+ HEAP32[76 >> 2] = i4;
+ }
+ i32 = i3 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ }
+ } else {
+ if (!(i12 >>> 0 > 4294967231)) {
+ i24 = i12 + 11 | 0;
+ i12 = i24 & -8;
+ i26 = HEAP32[60 >> 2] | 0;
+ if ((i26 | 0) != 0) {
+ i25 = 0 - i12 | 0;
+ i24 = i24 >>> 8;
+ if ((i24 | 0) != 0) {
+ if (i12 >>> 0 > 16777215) {
+ i27 = 31;
+ } else {
+ i31 = (i24 + 1048320 | 0) >>> 16 & 8;
+ i32 = i24 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i27 = (i32 + 245760 | 0) >>> 16 & 2;
+ i27 = 14 - (i30 | i31 | i27) + (i32 << i27 >>> 15) | 0;
+ i27 = i12 >>> (i27 + 7 | 0) & 1 | i27 << 1;
+ }
+ } else {
+ i27 = 0;
+ }
+ i30 = HEAP32[360 + (i27 << 2) >> 2] | 0;
+ L126 : do {
+ if ((i30 | 0) == 0) {
+ i29 = 0;
+ i24 = 0;
+ } else {
+ if ((i27 | 0) == 31) {
+ i24 = 0;
+ } else {
+ i24 = 25 - (i27 >>> 1) | 0;
+ }
+ i29 = 0;
+ i28 = i12 << i24;
+ i24 = 0;
+ while (1) {
+ i32 = HEAP32[i30 + 4 >> 2] & -8;
+ i31 = i32 - i12 | 0;
+ if (i31 >>> 0 < i25 >>> 0) {
+ if ((i32 | 0) == (i12 | 0)) {
+ i25 = i31;
+ i29 = i30;
+ i24 = i30;
+ break L126;
+ } else {
+ i25 = i31;
+ i24 = i30;
+ }
+ }
+ i31 = HEAP32[i30 + 20 >> 2] | 0;
+ i30 = HEAP32[i30 + (i28 >>> 31 << 2) + 16 >> 2] | 0;
+ i29 = (i31 | 0) == 0 | (i31 | 0) == (i30 | 0) ? i29 : i31;
+ if ((i30 | 0) == 0) {
+ break;
+ } else {
+ i28 = i28 << 1;
+ }
+ }
+ }
+ } while (0);
+ if ((i29 | 0) == 0 & (i24 | 0) == 0) {
+ i32 = 2 << i27;
+ i26 = i26 & (i32 | 0 - i32);
+ if ((i26 | 0) == 0) {
+ break;
+ }
+ i32 = (i26 & 0 - i26) + -1 | 0;
+ i28 = i32 >>> 12 & 16;
+ i32 = i32 >>> i28;
+ i27 = i32 >>> 5 & 8;
+ i32 = i32 >>> i27;
+ i30 = i32 >>> 2 & 4;
+ i32 = i32 >>> i30;
+ i31 = i32 >>> 1 & 2;
+ i32 = i32 >>> i31;
+ i29 = i32 >>> 1 & 1;
+ i29 = HEAP32[360 + ((i27 | i28 | i30 | i31 | i29) + (i32 >>> i29) << 2) >> 2] | 0;
+ }
+ if ((i29 | 0) != 0) {
+ while (1) {
+ i27 = (HEAP32[i29 + 4 >> 2] & -8) - i12 | 0;
+ i26 = i27 >>> 0 < i25 >>> 0;
+ i25 = i26 ? i27 : i25;
+ i24 = i26 ? i29 : i24;
+ i26 = HEAP32[i29 + 16 >> 2] | 0;
+ if ((i26 | 0) != 0) {
+ i29 = i26;
+ continue;
+ }
+ i29 = HEAP32[i29 + 20 >> 2] | 0;
+ if ((i29 | 0) == 0) {
+ break;
+ }
+ }
+ }
+ if ((i24 | 0) != 0 ? i25 >>> 0 < ((HEAP32[64 >> 2] | 0) - i12 | 0) >>> 0 : 0) {
+ i4 = HEAP32[72 >> 2] | 0;
+ if (i24 >>> 0 < i4 >>> 0) {
+ _abort();
+ }
+ i2 = i24 + i12 | 0;
+ if (!(i24 >>> 0 < i2 >>> 0)) {
+ _abort();
+ }
+ i3 = HEAP32[i24 + 24 >> 2] | 0;
+ i6 = HEAP32[i24 + 12 >> 2] | 0;
+ do {
+ if ((i6 | 0) == (i24 | 0)) {
+ i6 = i24 + 20 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ i6 = i24 + 16 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ i22 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i8 = i5 + 20 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ if ((i7 | 0) != 0) {
+ i5 = i7;
+ i6 = i8;
+ continue;
+ }
+ i7 = i5 + 16 | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ if ((i8 | 0) == 0) {
+ break;
+ } else {
+ i5 = i8;
+ i6 = i7;
+ }
+ }
+ if (i6 >>> 0 < i4 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i6 >> 2] = 0;
+ i22 = i5;
+ break;
+ }
+ } else {
+ i5 = HEAP32[i24 + 8 >> 2] | 0;
+ if (i5 >>> 0 < i4 >>> 0) {
+ _abort();
+ }
+ i7 = i5 + 12 | 0;
+ if ((HEAP32[i7 >> 2] | 0) != (i24 | 0)) {
+ _abort();
+ }
+ i4 = i6 + 8 | 0;
+ if ((HEAP32[i4 >> 2] | 0) == (i24 | 0)) {
+ HEAP32[i7 >> 2] = i6;
+ HEAP32[i4 >> 2] = i5;
+ i22 = i6;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ do {
+ if ((i3 | 0) != 0) {
+ i4 = HEAP32[i24 + 28 >> 2] | 0;
+ i5 = 360 + (i4 << 2) | 0;
+ if ((i24 | 0) == (HEAP32[i5 >> 2] | 0)) {
+ HEAP32[i5 >> 2] = i22;
+ if ((i22 | 0) == 0) {
+ HEAP32[60 >> 2] = HEAP32[60 >> 2] & ~(1 << i4);
+ break;
+ }
+ } else {
+ if (i3 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i4 = i3 + 16 | 0;
+ if ((HEAP32[i4 >> 2] | 0) == (i24 | 0)) {
+ HEAP32[i4 >> 2] = i22;
+ } else {
+ HEAP32[i3 + 20 >> 2] = i22;
+ }
+ if ((i22 | 0) == 0) {
+ break;
+ }
+ }
+ if (i22 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i22 + 24 >> 2] = i3;
+ i3 = HEAP32[i24 + 16 >> 2] | 0;
+ do {
+ if ((i3 | 0) != 0) {
+ if (i3 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i22 + 16 >> 2] = i3;
+ HEAP32[i3 + 24 >> 2] = i22;
+ break;
+ }
+ }
+ } while (0);
+ i3 = HEAP32[i24 + 20 >> 2] | 0;
+ if ((i3 | 0) != 0) {
+ if (i3 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i22 + 20 >> 2] = i3;
+ HEAP32[i3 + 24 >> 2] = i22;
+ break;
+ }
+ }
+ }
+ } while (0);
+ L204 : do {
+ if (!(i25 >>> 0 < 16)) {
+ HEAP32[i24 + 4 >> 2] = i12 | 3;
+ HEAP32[i24 + (i12 | 4) >> 2] = i25 | 1;
+ HEAP32[i24 + (i25 + i12) >> 2] = i25;
+ i4 = i25 >>> 3;
+ if (i25 >>> 0 < 256) {
+ i6 = i4 << 1;
+ i3 = 96 + (i6 << 2) | 0;
+ i5 = HEAP32[14] | 0;
+ i4 = 1 << i4;
+ if ((i5 & i4 | 0) != 0) {
+ i5 = 96 + (i6 + 2 << 2) | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ if (i4 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i21 = i5;
+ i20 = i4;
+ }
+ } else {
+ HEAP32[14] = i5 | i4;
+ i21 = 96 + (i6 + 2 << 2) | 0;
+ i20 = i3;
+ }
+ HEAP32[i21 >> 2] = i2;
+ HEAP32[i20 + 12 >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i20;
+ HEAP32[i24 + (i12 + 12) >> 2] = i3;
+ break;
+ }
+ i3 = i25 >>> 8;
+ if ((i3 | 0) != 0) {
+ if (i25 >>> 0 > 16777215) {
+ i3 = 31;
+ } else {
+ i31 = (i3 + 1048320 | 0) >>> 16 & 8;
+ i32 = i3 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i3 = (i32 + 245760 | 0) >>> 16 & 2;
+ i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
+ i3 = i25 >>> (i3 + 7 | 0) & 1 | i3 << 1;
+ }
+ } else {
+ i3 = 0;
+ }
+ i6 = 360 + (i3 << 2) | 0;
+ HEAP32[i24 + (i12 + 28) >> 2] = i3;
+ HEAP32[i24 + (i12 + 20) >> 2] = 0;
+ HEAP32[i24 + (i12 + 16) >> 2] = 0;
+ i4 = HEAP32[60 >> 2] | 0;
+ i5 = 1 << i3;
+ if ((i4 & i5 | 0) == 0) {
+ HEAP32[60 >> 2] = i4 | i5;
+ HEAP32[i6 >> 2] = i2;
+ HEAP32[i24 + (i12 + 24) >> 2] = i6;
+ HEAP32[i24 + (i12 + 12) >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i2;
+ break;
+ }
+ i4 = HEAP32[i6 >> 2] | 0;
+ if ((i3 | 0) == 31) {
+ i3 = 0;
+ } else {
+ i3 = 25 - (i3 >>> 1) | 0;
+ }
+ L225 : do {
+ if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i25 | 0)) {
+ i3 = i25 << i3;
+ while (1) {
+ i6 = i4 + (i3 >>> 31 << 2) + 16 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) == (i25 | 0)) {
+ i18 = i5;
+ break L225;
+ } else {
+ i3 = i3 << 1;
+ i4 = i5;
+ }
+ }
+ if (i6 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i6 >> 2] = i2;
+ HEAP32[i24 + (i12 + 24) >> 2] = i4;
+ HEAP32[i24 + (i12 + 12) >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i2;
+ break L204;
+ }
+ } else {
+ i18 = i4;
+ }
+ } while (0);
+ i4 = i18 + 8 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ i5 = HEAP32[72 >> 2] | 0;
+ if (i18 >>> 0 < i5 >>> 0) {
+ _abort();
+ }
+ if (i3 >>> 0 < i5 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i3 + 12 >> 2] = i2;
+ HEAP32[i4 >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i3;
+ HEAP32[i24 + (i12 + 12) >> 2] = i18;
+ HEAP32[i24 + (i12 + 24) >> 2] = 0;
+ break;
+ }
+ } else {
+ i32 = i25 + i12 | 0;
+ HEAP32[i24 + 4 >> 2] = i32 | 3;
+ i32 = i24 + (i32 + 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ }
+ } while (0);
+ i32 = i24 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ }
+ } else {
+ i12 = -1;
+ }
+ }
+ } while (0);
+ i18 = HEAP32[64 >> 2] | 0;
+ if (!(i12 >>> 0 > i18 >>> 0)) {
+ i3 = i18 - i12 | 0;
+ i2 = HEAP32[76 >> 2] | 0;
+ if (i3 >>> 0 > 15) {
+ HEAP32[76 >> 2] = i2 + i12;
+ HEAP32[64 >> 2] = i3;
+ HEAP32[i2 + (i12 + 4) >> 2] = i3 | 1;
+ HEAP32[i2 + i18 >> 2] = i3;
+ HEAP32[i2 + 4 >> 2] = i12 | 3;
+ } else {
+ HEAP32[64 >> 2] = 0;
+ HEAP32[76 >> 2] = 0;
+ HEAP32[i2 + 4 >> 2] = i18 | 3;
+ i32 = i2 + (i18 + 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ }
+ i32 = i2 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i18 = HEAP32[68 >> 2] | 0;
+ if (i12 >>> 0 < i18 >>> 0) {
+ i31 = i18 - i12 | 0;
+ HEAP32[68 >> 2] = i31;
+ i32 = HEAP32[80 >> 2] | 0;
+ HEAP32[80 >> 2] = i32 + i12;
+ HEAP32[i32 + (i12 + 4) >> 2] = i31 | 1;
+ HEAP32[i32 + 4 >> 2] = i12 | 3;
+ i32 = i32 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ do {
+ if ((HEAP32[132] | 0) == 0) {
+ i18 = _sysconf(30) | 0;
+ if ((i18 + -1 & i18 | 0) == 0) {
+ HEAP32[536 >> 2] = i18;
+ HEAP32[532 >> 2] = i18;
+ HEAP32[540 >> 2] = -1;
+ HEAP32[544 >> 2] = -1;
+ HEAP32[548 >> 2] = 0;
+ HEAP32[500 >> 2] = 0;
+ HEAP32[132] = (_time(0) | 0) & -16 ^ 1431655768;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ i20 = i12 + 48 | 0;
+ i25 = HEAP32[536 >> 2] | 0;
+ i21 = i12 + 47 | 0;
+ i22 = i25 + i21 | 0;
+ i25 = 0 - i25 | 0;
+ i18 = i22 & i25;
+ if (!(i18 >>> 0 > i12 >>> 0)) {
+ i32 = 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i24 = HEAP32[496 >> 2] | 0;
+ if ((i24 | 0) != 0 ? (i31 = HEAP32[488 >> 2] | 0, i32 = i31 + i18 | 0, i32 >>> 0 <= i31 >>> 0 | i32 >>> 0 > i24 >>> 0) : 0) {
+ i32 = 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ L269 : do {
+ if ((HEAP32[500 >> 2] & 4 | 0) == 0) {
+ i26 = HEAP32[80 >> 2] | 0;
+ L271 : do {
+ if ((i26 | 0) != 0) {
+ i24 = 504 | 0;
+ while (1) {
+ i27 = HEAP32[i24 >> 2] | 0;
+ if (!(i27 >>> 0 > i26 >>> 0) ? (i23 = i24 + 4 | 0, (i27 + (HEAP32[i23 >> 2] | 0) | 0) >>> 0 > i26 >>> 0) : 0) {
+ break;
+ }
+ i24 = HEAP32[i24 + 8 >> 2] | 0;
+ if ((i24 | 0) == 0) {
+ i13 = 182;
+ break L271;
+ }
+ }
+ if ((i24 | 0) != 0) {
+ i25 = i22 - (HEAP32[68 >> 2] | 0) & i25;
+ if (i25 >>> 0 < 2147483647) {
+ i13 = _sbrk(i25 | 0) | 0;
+ i26 = (i13 | 0) == ((HEAP32[i24 >> 2] | 0) + (HEAP32[i23 >> 2] | 0) | 0);
+ i22 = i13;
+ i24 = i25;
+ i23 = i26 ? i13 : -1;
+ i25 = i26 ? i25 : 0;
+ i13 = 191;
+ } else {
+ i25 = 0;
+ }
+ } else {
+ i13 = 182;
+ }
+ } else {
+ i13 = 182;
+ }
+ } while (0);
+ do {
+ if ((i13 | 0) == 182) {
+ i23 = _sbrk(0) | 0;
+ if ((i23 | 0) != (-1 | 0)) {
+ i24 = i23;
+ i22 = HEAP32[532 >> 2] | 0;
+ i25 = i22 + -1 | 0;
+ if ((i25 & i24 | 0) == 0) {
+ i25 = i18;
+ } else {
+ i25 = i18 - i24 + (i25 + i24 & 0 - i22) | 0;
+ }
+ i24 = HEAP32[488 >> 2] | 0;
+ i26 = i24 + i25 | 0;
+ if (i25 >>> 0 > i12 >>> 0 & i25 >>> 0 < 2147483647) {
+ i22 = HEAP32[496 >> 2] | 0;
+ if ((i22 | 0) != 0 ? i26 >>> 0 <= i24 >>> 0 | i26 >>> 0 > i22 >>> 0 : 0) {
+ i25 = 0;
+ break;
+ }
+ i22 = _sbrk(i25 | 0) | 0;
+ i13 = (i22 | 0) == (i23 | 0);
+ i24 = i25;
+ i23 = i13 ? i23 : -1;
+ i25 = i13 ? i25 : 0;
+ i13 = 191;
+ } else {
+ i25 = 0;
+ }
+ } else {
+ i25 = 0;
+ }
+ }
+ } while (0);
+ L291 : do {
+ if ((i13 | 0) == 191) {
+ i13 = 0 - i24 | 0;
+ if ((i23 | 0) != (-1 | 0)) {
+ i17 = i23;
+ i14 = i25;
+ i13 = 202;
+ break L269;
+ }
+ do {
+ if ((i22 | 0) != (-1 | 0) & i24 >>> 0 < 2147483647 & i24 >>> 0 < i20 >>> 0 ? (i19 = HEAP32[536 >> 2] | 0, i19 = i21 - i24 + i19 & 0 - i19, i19 >>> 0 < 2147483647) : 0) {
+ if ((_sbrk(i19 | 0) | 0) == (-1 | 0)) {
+ _sbrk(i13 | 0) | 0;
+ break L291;
+ } else {
+ i24 = i19 + i24 | 0;
+ break;
+ }
+ }
+ } while (0);
+ if ((i22 | 0) != (-1 | 0)) {
+ i17 = i22;
+ i14 = i24;
+ i13 = 202;
+ break L269;
+ }
+ }
+ } while (0);
+ HEAP32[500 >> 2] = HEAP32[500 >> 2] | 4;
+ i13 = 199;
+ } else {
+ i25 = 0;
+ i13 = 199;
+ }
+ } while (0);
+ if ((((i13 | 0) == 199 ? i18 >>> 0 < 2147483647 : 0) ? (i17 = _sbrk(i18 | 0) | 0, i16 = _sbrk(0) | 0, (i16 | 0) != (-1 | 0) & (i17 | 0) != (-1 | 0) & i17 >>> 0 < i16 >>> 0) : 0) ? (i15 = i16 - i17 | 0, i14 = i15 >>> 0 > (i12 + 40 | 0) >>> 0, i14) : 0) {
+ i14 = i14 ? i15 : i25;
+ i13 = 202;
+ }
+ if ((i13 | 0) == 202) {
+ i15 = (HEAP32[488 >> 2] | 0) + i14 | 0;
+ HEAP32[488 >> 2] = i15;
+ if (i15 >>> 0 > (HEAP32[492 >> 2] | 0) >>> 0) {
+ HEAP32[492 >> 2] = i15;
+ }
+ i15 = HEAP32[80 >> 2] | 0;
+ L311 : do {
+ if ((i15 | 0) != 0) {
+ i21 = 504 | 0;
+ while (1) {
+ i16 = HEAP32[i21 >> 2] | 0;
+ i19 = i21 + 4 | 0;
+ i20 = HEAP32[i19 >> 2] | 0;
+ if ((i17 | 0) == (i16 + i20 | 0)) {
+ i13 = 214;
+ break;
+ }
+ i18 = HEAP32[i21 + 8 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ break;
+ } else {
+ i21 = i18;
+ }
+ }
+ if (((i13 | 0) == 214 ? (HEAP32[i21 + 12 >> 2] & 8 | 0) == 0 : 0) ? i15 >>> 0 >= i16 >>> 0 & i15 >>> 0 < i17 >>> 0 : 0) {
+ HEAP32[i19 >> 2] = i20 + i14;
+ i2 = (HEAP32[68 >> 2] | 0) + i14 | 0;
+ i3 = i15 + 8 | 0;
+ if ((i3 & 7 | 0) == 0) {
+ i3 = 0;
+ } else {
+ i3 = 0 - i3 & 7;
+ }
+ i32 = i2 - i3 | 0;
+ HEAP32[80 >> 2] = i15 + i3;
+ HEAP32[68 >> 2] = i32;
+ HEAP32[i15 + (i3 + 4) >> 2] = i32 | 1;
+ HEAP32[i15 + (i2 + 4) >> 2] = 40;
+ HEAP32[84 >> 2] = HEAP32[544 >> 2];
+ break;
+ }
+ if (i17 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ HEAP32[72 >> 2] = i17;
+ }
+ i19 = i17 + i14 | 0;
+ i16 = 504 | 0;
+ while (1) {
+ if ((HEAP32[i16 >> 2] | 0) == (i19 | 0)) {
+ i13 = 224;
+ break;
+ }
+ i18 = HEAP32[i16 + 8 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ break;
+ } else {
+ i16 = i18;
+ }
+ }
+ if ((i13 | 0) == 224 ? (HEAP32[i16 + 12 >> 2] & 8 | 0) == 0 : 0) {
+ HEAP32[i16 >> 2] = i17;
+ i6 = i16 + 4 | 0;
+ HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + i14;
+ i6 = i17 + 8 | 0;
+ if ((i6 & 7 | 0) == 0) {
+ i6 = 0;
+ } else {
+ i6 = 0 - i6 & 7;
+ }
+ i7 = i17 + (i14 + 8) | 0;
+ if ((i7 & 7 | 0) == 0) {
+ i13 = 0;
+ } else {
+ i13 = 0 - i7 & 7;
+ }
+ i15 = i17 + (i13 + i14) | 0;
+ i8 = i6 + i12 | 0;
+ i7 = i17 + i8 | 0;
+ i10 = i15 - (i17 + i6) - i12 | 0;
+ HEAP32[i17 + (i6 + 4) >> 2] = i12 | 3;
+ L348 : do {
+ if ((i15 | 0) != (HEAP32[80 >> 2] | 0)) {
+ if ((i15 | 0) == (HEAP32[76 >> 2] | 0)) {
+ i32 = (HEAP32[64 >> 2] | 0) + i10 | 0;
+ HEAP32[64 >> 2] = i32;
+ HEAP32[76 >> 2] = i7;
+ HEAP32[i17 + (i8 + 4) >> 2] = i32 | 1;
+ HEAP32[i17 + (i32 + i8) >> 2] = i32;
+ break;
+ }
+ i12 = i14 + 4 | 0;
+ i18 = HEAP32[i17 + (i12 + i13) >> 2] | 0;
+ if ((i18 & 3 | 0) == 1) {
+ i11 = i18 & -8;
+ i16 = i18 >>> 3;
+ do {
+ if (!(i18 >>> 0 < 256)) {
+ i9 = HEAP32[i17 + ((i13 | 24) + i14) >> 2] | 0;
+ i19 = HEAP32[i17 + (i14 + 12 + i13) >> 2] | 0;
+ do {
+ if ((i19 | 0) == (i15 | 0)) {
+ i19 = i13 | 16;
+ i18 = i17 + (i12 + i19) | 0;
+ i16 = HEAP32[i18 >> 2] | 0;
+ if ((i16 | 0) == 0) {
+ i18 = i17 + (i19 + i14) | 0;
+ i16 = HEAP32[i18 >> 2] | 0;
+ if ((i16 | 0) == 0) {
+ i5 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i20 = i16 + 20 | 0;
+ i19 = HEAP32[i20 >> 2] | 0;
+ if ((i19 | 0) != 0) {
+ i16 = i19;
+ i18 = i20;
+ continue;
+ }
+ i19 = i16 + 16 | 0;
+ i20 = HEAP32[i19 >> 2] | 0;
+ if ((i20 | 0) == 0) {
+ break;
+ } else {
+ i16 = i20;
+ i18 = i19;
+ }
+ }
+ if (i18 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i18 >> 2] = 0;
+ i5 = i16;
+ break;
+ }
+ } else {
+ i18 = HEAP32[i17 + ((i13 | 8) + i14) >> 2] | 0;
+ if (i18 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i18 + 12 | 0;
+ if ((HEAP32[i16 >> 2] | 0) != (i15 | 0)) {
+ _abort();
+ }
+ i20 = i19 + 8 | 0;
+ if ((HEAP32[i20 >> 2] | 0) == (i15 | 0)) {
+ HEAP32[i16 >> 2] = i19;
+ HEAP32[i20 >> 2] = i18;
+ i5 = i19;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ if ((i9 | 0) != 0) {
+ i16 = HEAP32[i17 + (i14 + 28 + i13) >> 2] | 0;
+ i18 = 360 + (i16 << 2) | 0;
+ if ((i15 | 0) == (HEAP32[i18 >> 2] | 0)) {
+ HEAP32[i18 >> 2] = i5;
+ if ((i5 | 0) == 0) {
+ HEAP32[60 >> 2] = HEAP32[60 >> 2] & ~(1 << i16);
+ break;
+ }
+ } else {
+ if (i9 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i9 + 16 | 0;
+ if ((HEAP32[i16 >> 2] | 0) == (i15 | 0)) {
+ HEAP32[i16 >> 2] = i5;
+ } else {
+ HEAP32[i9 + 20 >> 2] = i5;
+ }
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ }
+ if (i5 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i5 + 24 >> 2] = i9;
+ i15 = i13 | 16;
+ i9 = HEAP32[i17 + (i15 + i14) >> 2] | 0;
+ do {
+ if ((i9 | 0) != 0) {
+ if (i9 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i5 + 16 >> 2] = i9;
+ HEAP32[i9 + 24 >> 2] = i5;
+ break;
+ }
+ }
+ } while (0);
+ i9 = HEAP32[i17 + (i12 + i15) >> 2] | 0;
+ if ((i9 | 0) != 0) {
+ if (i9 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i5 + 20 >> 2] = i9;
+ HEAP32[i9 + 24 >> 2] = i5;
+ break;
+ }
+ }
+ }
+ } else {
+ i5 = HEAP32[i17 + ((i13 | 8) + i14) >> 2] | 0;
+ i12 = HEAP32[i17 + (i14 + 12 + i13) >> 2] | 0;
+ i18 = 96 + (i16 << 1 << 2) | 0;
+ if ((i5 | 0) != (i18 | 0)) {
+ if (i5 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ if ((HEAP32[i5 + 12 >> 2] | 0) != (i15 | 0)) {
+ _abort();
+ }
+ }
+ if ((i12 | 0) == (i5 | 0)) {
+ HEAP32[14] = HEAP32[14] & ~(1 << i16);
+ break;
+ }
+ if ((i12 | 0) != (i18 | 0)) {
+ if (i12 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i12 + 8 | 0;
+ if ((HEAP32[i16 >> 2] | 0) == (i15 | 0)) {
+ i9 = i16;
+ } else {
+ _abort();
+ }
+ } else {
+ i9 = i12 + 8 | 0;
+ }
+ HEAP32[i5 + 12 >> 2] = i12;
+ HEAP32[i9 >> 2] = i5;
+ }
+ } while (0);
+ i15 = i17 + ((i11 | i13) + i14) | 0;
+ i10 = i11 + i10 | 0;
+ }
+ i5 = i15 + 4 | 0;
+ HEAP32[i5 >> 2] = HEAP32[i5 >> 2] & -2;
+ HEAP32[i17 + (i8 + 4) >> 2] = i10 | 1;
+ HEAP32[i17 + (i10 + i8) >> 2] = i10;
+ i5 = i10 >>> 3;
+ if (i10 >>> 0 < 256) {
+ i10 = i5 << 1;
+ i2 = 96 + (i10 << 2) | 0;
+ i9 = HEAP32[14] | 0;
+ i5 = 1 << i5;
+ if ((i9 & i5 | 0) != 0) {
+ i9 = 96 + (i10 + 2 << 2) | 0;
+ i5 = HEAP32[i9 >> 2] | 0;
+ if (i5 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i3 = i9;
+ i4 = i5;
+ }
+ } else {
+ HEAP32[14] = i9 | i5;
+ i3 = 96 + (i10 + 2 << 2) | 0;
+ i4 = i2;
+ }
+ HEAP32[i3 >> 2] = i7;
+ HEAP32[i4 + 12 >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i4;
+ HEAP32[i17 + (i8 + 12) >> 2] = i2;
+ break;
+ }
+ i3 = i10 >>> 8;
+ if ((i3 | 0) != 0) {
+ if (i10 >>> 0 > 16777215) {
+ i3 = 31;
+ } else {
+ i31 = (i3 + 1048320 | 0) >>> 16 & 8;
+ i32 = i3 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i3 = (i32 + 245760 | 0) >>> 16 & 2;
+ i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
+ i3 = i10 >>> (i3 + 7 | 0) & 1 | i3 << 1;
+ }
+ } else {
+ i3 = 0;
+ }
+ i4 = 360 + (i3 << 2) | 0;
+ HEAP32[i17 + (i8 + 28) >> 2] = i3;
+ HEAP32[i17 + (i8 + 20) >> 2] = 0;
+ HEAP32[i17 + (i8 + 16) >> 2] = 0;
+ i9 = HEAP32[60 >> 2] | 0;
+ i5 = 1 << i3;
+ if ((i9 & i5 | 0) == 0) {
+ HEAP32[60 >> 2] = i9 | i5;
+ HEAP32[i4 >> 2] = i7;
+ HEAP32[i17 + (i8 + 24) >> 2] = i4;
+ HEAP32[i17 + (i8 + 12) >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i7;
+ break;
+ }
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((i3 | 0) == 31) {
+ i3 = 0;
+ } else {
+ i3 = 25 - (i3 >>> 1) | 0;
+ }
+ L444 : do {
+ if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i10 | 0)) {
+ i3 = i10 << i3;
+ while (1) {
+ i5 = i4 + (i3 >>> 31 << 2) + 16 | 0;
+ i9 = HEAP32[i5 >> 2] | 0;
+ if ((i9 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i9 + 4 >> 2] & -8 | 0) == (i10 | 0)) {
+ i2 = i9;
+ break L444;
+ } else {
+ i3 = i3 << 1;
+ i4 = i9;
+ }
+ }
+ if (i5 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i5 >> 2] = i7;
+ HEAP32[i17 + (i8 + 24) >> 2] = i4;
+ HEAP32[i17 + (i8 + 12) >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i7;
+ break L348;
+ }
+ } else {
+ i2 = i4;
+ }
+ } while (0);
+ i4 = i2 + 8 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ i5 = HEAP32[72 >> 2] | 0;
+ if (i2 >>> 0 < i5 >>> 0) {
+ _abort();
+ }
+ if (i3 >>> 0 < i5 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i3 + 12 >> 2] = i7;
+ HEAP32[i4 >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i3;
+ HEAP32[i17 + (i8 + 12) >> 2] = i2;
+ HEAP32[i17 + (i8 + 24) >> 2] = 0;
+ break;
+ }
+ } else {
+ i32 = (HEAP32[68 >> 2] | 0) + i10 | 0;
+ HEAP32[68 >> 2] = i32;
+ HEAP32[80 >> 2] = i7;
+ HEAP32[i17 + (i8 + 4) >> 2] = i32 | 1;
+ }
+ } while (0);
+ i32 = i17 + (i6 | 8) | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i3 = 504 | 0;
+ while (1) {
+ i2 = HEAP32[i3 >> 2] | 0;
+ if (!(i2 >>> 0 > i15 >>> 0) ? (i11 = HEAP32[i3 + 4 >> 2] | 0, i10 = i2 + i11 | 0, i10 >>> 0 > i15 >>> 0) : 0) {
+ break;
+ }
+ i3 = HEAP32[i3 + 8 >> 2] | 0;
+ }
+ i3 = i2 + (i11 + -39) | 0;
+ if ((i3 & 7 | 0) == 0) {
+ i3 = 0;
+ } else {
+ i3 = 0 - i3 & 7;
+ }
+ i2 = i2 + (i11 + -47 + i3) | 0;
+ i2 = i2 >>> 0 < (i15 + 16 | 0) >>> 0 ? i15 : i2;
+ i3 = i2 + 8 | 0;
+ i4 = i17 + 8 | 0;
+ if ((i4 & 7 | 0) == 0) {
+ i4 = 0;
+ } else {
+ i4 = 0 - i4 & 7;
+ }
+ i32 = i14 + -40 - i4 | 0;
+ HEAP32[80 >> 2] = i17 + i4;
+ HEAP32[68 >> 2] = i32;
+ HEAP32[i17 + (i4 + 4) >> 2] = i32 | 1;
+ HEAP32[i17 + (i14 + -36) >> 2] = 40;
+ HEAP32[84 >> 2] = HEAP32[544 >> 2];
+ HEAP32[i2 + 4 >> 2] = 27;
+ HEAP32[i3 + 0 >> 2] = HEAP32[504 >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[508 >> 2];
+ HEAP32[i3 + 8 >> 2] = HEAP32[512 >> 2];
+ HEAP32[i3 + 12 >> 2] = HEAP32[516 >> 2];
+ HEAP32[504 >> 2] = i17;
+ HEAP32[508 >> 2] = i14;
+ HEAP32[516 >> 2] = 0;
+ HEAP32[512 >> 2] = i3;
+ i4 = i2 + 28 | 0;
+ HEAP32[i4 >> 2] = 7;
+ if ((i2 + 32 | 0) >>> 0 < i10 >>> 0) {
+ while (1) {
+ i3 = i4 + 4 | 0;
+ HEAP32[i3 >> 2] = 7;
+ if ((i4 + 8 | 0) >>> 0 < i10 >>> 0) {
+ i4 = i3;
+ } else {
+ break;
+ }
+ }
+ }
+ if ((i2 | 0) != (i15 | 0)) {
+ i2 = i2 - i15 | 0;
+ i3 = i15 + (i2 + 4) | 0;
+ HEAP32[i3 >> 2] = HEAP32[i3 >> 2] & -2;
+ HEAP32[i15 + 4 >> 2] = i2 | 1;
+ HEAP32[i15 + i2 >> 2] = i2;
+ i3 = i2 >>> 3;
+ if (i2 >>> 0 < 256) {
+ i4 = i3 << 1;
+ i2 = 96 + (i4 << 2) | 0;
+ i5 = HEAP32[14] | 0;
+ i3 = 1 << i3;
+ if ((i5 & i3 | 0) != 0) {
+ i4 = 96 + (i4 + 2 << 2) | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ if (i3 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i7 = i4;
+ i8 = i3;
+ }
+ } else {
+ HEAP32[14] = i5 | i3;
+ i7 = 96 + (i4 + 2 << 2) | 0;
+ i8 = i2;
+ }
+ HEAP32[i7 >> 2] = i15;
+ HEAP32[i8 + 12 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i8;
+ HEAP32[i15 + 12 >> 2] = i2;
+ break;
+ }
+ i3 = i2 >>> 8;
+ if ((i3 | 0) != 0) {
+ if (i2 >>> 0 > 16777215) {
+ i3 = 31;
+ } else {
+ i31 = (i3 + 1048320 | 0) >>> 16 & 8;
+ i32 = i3 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i3 = (i32 + 245760 | 0) >>> 16 & 2;
+ i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
+ i3 = i2 >>> (i3 + 7 | 0) & 1 | i3 << 1;
+ }
+ } else {
+ i3 = 0;
+ }
+ i7 = 360 + (i3 << 2) | 0;
+ HEAP32[i15 + 28 >> 2] = i3;
+ HEAP32[i15 + 20 >> 2] = 0;
+ HEAP32[i15 + 16 >> 2] = 0;
+ i4 = HEAP32[60 >> 2] | 0;
+ i5 = 1 << i3;
+ if ((i4 & i5 | 0) == 0) {
+ HEAP32[60 >> 2] = i4 | i5;
+ HEAP32[i7 >> 2] = i15;
+ HEAP32[i15 + 24 >> 2] = i7;
+ HEAP32[i15 + 12 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i15;
+ break;
+ }
+ i4 = HEAP32[i7 >> 2] | 0;
+ if ((i3 | 0) == 31) {
+ i3 = 0;
+ } else {
+ i3 = 25 - (i3 >>> 1) | 0;
+ }
+ L499 : do {
+ if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i2 | 0)) {
+ i3 = i2 << i3;
+ while (1) {
+ i7 = i4 + (i3 >>> 31 << 2) + 16 | 0;
+ i5 = HEAP32[i7 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) == (i2 | 0)) {
+ i6 = i5;
+ break L499;
+ } else {
+ i3 = i3 << 1;
+ i4 = i5;
+ }
+ }
+ if (i7 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i7 >> 2] = i15;
+ HEAP32[i15 + 24 >> 2] = i4;
+ HEAP32[i15 + 12 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i15;
+ break L311;
+ }
+ } else {
+ i6 = i4;
+ }
+ } while (0);
+ i4 = i6 + 8 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ i2 = HEAP32[72 >> 2] | 0;
+ if (i6 >>> 0 < i2 >>> 0) {
+ _abort();
+ }
+ if (i3 >>> 0 < i2 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i3 + 12 >> 2] = i15;
+ HEAP32[i4 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i3;
+ HEAP32[i15 + 12 >> 2] = i6;
+ HEAP32[i15 + 24 >> 2] = 0;
+ break;
+ }
+ }
+ } else {
+ i32 = HEAP32[72 >> 2] | 0;
+ if ((i32 | 0) == 0 | i17 >>> 0 < i32 >>> 0) {
+ HEAP32[72 >> 2] = i17;
+ }
+ HEAP32[504 >> 2] = i17;
+ HEAP32[508 >> 2] = i14;
+ HEAP32[516 >> 2] = 0;
+ HEAP32[92 >> 2] = HEAP32[132];
+ HEAP32[88 >> 2] = -1;
+ i2 = 0;
+ do {
+ i32 = i2 << 1;
+ i31 = 96 + (i32 << 2) | 0;
+ HEAP32[96 + (i32 + 3 << 2) >> 2] = i31;
+ HEAP32[96 + (i32 + 2 << 2) >> 2] = i31;
+ i2 = i2 + 1 | 0;
+ } while ((i2 | 0) != 32);
+ i2 = i17 + 8 | 0;
+ if ((i2 & 7 | 0) == 0) {
+ i2 = 0;
+ } else {
+ i2 = 0 - i2 & 7;
+ }
+ i32 = i14 + -40 - i2 | 0;
+ HEAP32[80 >> 2] = i17 + i2;
+ HEAP32[68 >> 2] = i32;
+ HEAP32[i17 + (i2 + 4) >> 2] = i32 | 1;
+ HEAP32[i17 + (i14 + -36) >> 2] = 40;
+ HEAP32[84 >> 2] = HEAP32[544 >> 2];
+ }
+ } while (0);
+ i2 = HEAP32[68 >> 2] | 0;
+ if (i2 >>> 0 > i12 >>> 0) {
+ i31 = i2 - i12 | 0;
+ HEAP32[68 >> 2] = i31;
+ i32 = HEAP32[80 >> 2] | 0;
+ HEAP32[80 >> 2] = i32 + i12;
+ HEAP32[i32 + (i12 + 4) >> 2] = i31 | 1;
+ HEAP32[i32 + 4 >> 2] = i12 | 3;
+ i32 = i32 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ }
+ HEAP32[(___errno_location() | 0) >> 2] = 12;
+ i32 = 0;
+ STACKTOP = i1;
+ return i32 | 0;
+}
+function _free(i7) {
+ i7 = i7 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0;
+ i1 = STACKTOP;
+ if ((i7 | 0) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i15 = i7 + -8 | 0;
+ i16 = HEAP32[72 >> 2] | 0;
+ if (i15 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ i13 = HEAP32[i7 + -4 >> 2] | 0;
+ i12 = i13 & 3;
+ if ((i12 | 0) == 1) {
+ _abort();
+ }
+ i8 = i13 & -8;
+ i6 = i7 + (i8 + -8) | 0;
+ do {
+ if ((i13 & 1 | 0) == 0) {
+ i19 = HEAP32[i15 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i15 = -8 - i19 | 0;
+ i13 = i7 + i15 | 0;
+ i12 = i19 + i8 | 0;
+ if (i13 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ if ((i13 | 0) == (HEAP32[76 >> 2] | 0)) {
+ i2 = i7 + (i8 + -4) | 0;
+ if ((HEAP32[i2 >> 2] & 3 | 0) != 3) {
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ HEAP32[64 >> 2] = i12;
+ HEAP32[i2 >> 2] = HEAP32[i2 >> 2] & -2;
+ HEAP32[i7 + (i15 + 4) >> 2] = i12 | 1;
+ HEAP32[i6 >> 2] = i12;
+ STACKTOP = i1;
+ return;
+ }
+ i18 = i19 >>> 3;
+ if (i19 >>> 0 < 256) {
+ i2 = HEAP32[i7 + (i15 + 8) >> 2] | 0;
+ i11 = HEAP32[i7 + (i15 + 12) >> 2] | 0;
+ i14 = 96 + (i18 << 1 << 2) | 0;
+ if ((i2 | 0) != (i14 | 0)) {
+ if (i2 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ if ((HEAP32[i2 + 12 >> 2] | 0) != (i13 | 0)) {
+ _abort();
+ }
+ }
+ if ((i11 | 0) == (i2 | 0)) {
+ HEAP32[14] = HEAP32[14] & ~(1 << i18);
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ if ((i11 | 0) != (i14 | 0)) {
+ if (i11 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ i14 = i11 + 8 | 0;
+ if ((HEAP32[i14 >> 2] | 0) == (i13 | 0)) {
+ i17 = i14;
+ } else {
+ _abort();
+ }
+ } else {
+ i17 = i11 + 8 | 0;
+ }
+ HEAP32[i2 + 12 >> 2] = i11;
+ HEAP32[i17 >> 2] = i2;
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ i17 = HEAP32[i7 + (i15 + 24) >> 2] | 0;
+ i18 = HEAP32[i7 + (i15 + 12) >> 2] | 0;
+ do {
+ if ((i18 | 0) == (i13 | 0)) {
+ i19 = i7 + (i15 + 20) | 0;
+ i18 = HEAP32[i19 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ i19 = i7 + (i15 + 16) | 0;
+ i18 = HEAP32[i19 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ i14 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i21 = i18 + 20 | 0;
+ i20 = HEAP32[i21 >> 2] | 0;
+ if ((i20 | 0) != 0) {
+ i18 = i20;
+ i19 = i21;
+ continue;
+ }
+ i20 = i18 + 16 | 0;
+ i21 = HEAP32[i20 >> 2] | 0;
+ if ((i21 | 0) == 0) {
+ break;
+ } else {
+ i18 = i21;
+ i19 = i20;
+ }
+ }
+ if (i19 >>> 0 < i16 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i19 >> 2] = 0;
+ i14 = i18;
+ break;
+ }
+ } else {
+ i19 = HEAP32[i7 + (i15 + 8) >> 2] | 0;
+ if (i19 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ i16 = i19 + 12 | 0;
+ if ((HEAP32[i16 >> 2] | 0) != (i13 | 0)) {
+ _abort();
+ }
+ i20 = i18 + 8 | 0;
+ if ((HEAP32[i20 >> 2] | 0) == (i13 | 0)) {
+ HEAP32[i16 >> 2] = i18;
+ HEAP32[i20 >> 2] = i19;
+ i14 = i18;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ if ((i17 | 0) != 0) {
+ i18 = HEAP32[i7 + (i15 + 28) >> 2] | 0;
+ i16 = 360 + (i18 << 2) | 0;
+ if ((i13 | 0) == (HEAP32[i16 >> 2] | 0)) {
+ HEAP32[i16 >> 2] = i14;
+ if ((i14 | 0) == 0) {
+ HEAP32[60 >> 2] = HEAP32[60 >> 2] & ~(1 << i18);
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ } else {
+ if (i17 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i17 + 16 | 0;
+ if ((HEAP32[i16 >> 2] | 0) == (i13 | 0)) {
+ HEAP32[i16 >> 2] = i14;
+ } else {
+ HEAP32[i17 + 20 >> 2] = i14;
+ }
+ if ((i14 | 0) == 0) {
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ }
+ if (i14 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i14 + 24 >> 2] = i17;
+ i16 = HEAP32[i7 + (i15 + 16) >> 2] | 0;
+ do {
+ if ((i16 | 0) != 0) {
+ if (i16 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i14 + 16 >> 2] = i16;
+ HEAP32[i16 + 24 >> 2] = i14;
+ break;
+ }
+ }
+ } while (0);
+ i15 = HEAP32[i7 + (i15 + 20) >> 2] | 0;
+ if ((i15 | 0) != 0) {
+ if (i15 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i14 + 20 >> 2] = i15;
+ HEAP32[i15 + 24 >> 2] = i14;
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ } else {
+ i2 = i13;
+ i11 = i12;
+ }
+ } else {
+ i2 = i13;
+ i11 = i12;
+ }
+ } else {
+ i2 = i15;
+ i11 = i8;
+ }
+ } while (0);
+ if (!(i2 >>> 0 < i6 >>> 0)) {
+ _abort();
+ }
+ i12 = i7 + (i8 + -4) | 0;
+ i13 = HEAP32[i12 >> 2] | 0;
+ if ((i13 & 1 | 0) == 0) {
+ _abort();
+ }
+ if ((i13 & 2 | 0) == 0) {
+ if ((i6 | 0) == (HEAP32[80 >> 2] | 0)) {
+ i21 = (HEAP32[68 >> 2] | 0) + i11 | 0;
+ HEAP32[68 >> 2] = i21;
+ HEAP32[80 >> 2] = i2;
+ HEAP32[i2 + 4 >> 2] = i21 | 1;
+ if ((i2 | 0) != (HEAP32[76 >> 2] | 0)) {
+ STACKTOP = i1;
+ return;
+ }
+ HEAP32[76 >> 2] = 0;
+ HEAP32[64 >> 2] = 0;
+ STACKTOP = i1;
+ return;
+ }
+ if ((i6 | 0) == (HEAP32[76 >> 2] | 0)) {
+ i21 = (HEAP32[64 >> 2] | 0) + i11 | 0;
+ HEAP32[64 >> 2] = i21;
+ HEAP32[76 >> 2] = i2;
+ HEAP32[i2 + 4 >> 2] = i21 | 1;
+ HEAP32[i2 + i21 >> 2] = i21;
+ STACKTOP = i1;
+ return;
+ }
+ i11 = (i13 & -8) + i11 | 0;
+ i12 = i13 >>> 3;
+ do {
+ if (!(i13 >>> 0 < 256)) {
+ i10 = HEAP32[i7 + (i8 + 16) >> 2] | 0;
+ i15 = HEAP32[i7 + (i8 | 4) >> 2] | 0;
+ do {
+ if ((i15 | 0) == (i6 | 0)) {
+ i13 = i7 + (i8 + 12) | 0;
+ i12 = HEAP32[i13 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ i13 = i7 + (i8 + 8) | 0;
+ i12 = HEAP32[i13 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ i9 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i14 = i12 + 20 | 0;
+ i15 = HEAP32[i14 >> 2] | 0;
+ if ((i15 | 0) != 0) {
+ i12 = i15;
+ i13 = i14;
+ continue;
+ }
+ i14 = i12 + 16 | 0;
+ i15 = HEAP32[i14 >> 2] | 0;
+ if ((i15 | 0) == 0) {
+ break;
+ } else {
+ i12 = i15;
+ i13 = i14;
+ }
+ }
+ if (i13 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i13 >> 2] = 0;
+ i9 = i12;
+ break;
+ }
+ } else {
+ i13 = HEAP32[i7 + i8 >> 2] | 0;
+ if (i13 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i14 = i13 + 12 | 0;
+ if ((HEAP32[i14 >> 2] | 0) != (i6 | 0)) {
+ _abort();
+ }
+ i12 = i15 + 8 | 0;
+ if ((HEAP32[i12 >> 2] | 0) == (i6 | 0)) {
+ HEAP32[i14 >> 2] = i15;
+ HEAP32[i12 >> 2] = i13;
+ i9 = i15;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ if ((i10 | 0) != 0) {
+ i12 = HEAP32[i7 + (i8 + 20) >> 2] | 0;
+ i13 = 360 + (i12 << 2) | 0;
+ if ((i6 | 0) == (HEAP32[i13 >> 2] | 0)) {
+ HEAP32[i13 >> 2] = i9;
+ if ((i9 | 0) == 0) {
+ HEAP32[60 >> 2] = HEAP32[60 >> 2] & ~(1 << i12);
+ break;
+ }
+ } else {
+ if (i10 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i12 = i10 + 16 | 0;
+ if ((HEAP32[i12 >> 2] | 0) == (i6 | 0)) {
+ HEAP32[i12 >> 2] = i9;
+ } else {
+ HEAP32[i10 + 20 >> 2] = i9;
+ }
+ if ((i9 | 0) == 0) {
+ break;
+ }
+ }
+ if (i9 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i9 + 24 >> 2] = i10;
+ i6 = HEAP32[i7 + (i8 + 8) >> 2] | 0;
+ do {
+ if ((i6 | 0) != 0) {
+ if (i6 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i9 + 16 >> 2] = i6;
+ HEAP32[i6 + 24 >> 2] = i9;
+ break;
+ }
+ }
+ } while (0);
+ i6 = HEAP32[i7 + (i8 + 12) >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ if (i6 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i9 + 20 >> 2] = i6;
+ HEAP32[i6 + 24 >> 2] = i9;
+ break;
+ }
+ }
+ }
+ } else {
+ i9 = HEAP32[i7 + i8 >> 2] | 0;
+ i7 = HEAP32[i7 + (i8 | 4) >> 2] | 0;
+ i8 = 96 + (i12 << 1 << 2) | 0;
+ if ((i9 | 0) != (i8 | 0)) {
+ if (i9 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ if ((HEAP32[i9 + 12 >> 2] | 0) != (i6 | 0)) {
+ _abort();
+ }
+ }
+ if ((i7 | 0) == (i9 | 0)) {
+ HEAP32[14] = HEAP32[14] & ~(1 << i12);
+ break;
+ }
+ if ((i7 | 0) != (i8 | 0)) {
+ if (i7 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i8 = i7 + 8 | 0;
+ if ((HEAP32[i8 >> 2] | 0) == (i6 | 0)) {
+ i10 = i8;
+ } else {
+ _abort();
+ }
+ } else {
+ i10 = i7 + 8 | 0;
+ }
+ HEAP32[i9 + 12 >> 2] = i7;
+ HEAP32[i10 >> 2] = i9;
+ }
+ } while (0);
+ HEAP32[i2 + 4 >> 2] = i11 | 1;
+ HEAP32[i2 + i11 >> 2] = i11;
+ if ((i2 | 0) == (HEAP32[76 >> 2] | 0)) {
+ HEAP32[64 >> 2] = i11;
+ STACKTOP = i1;
+ return;
+ }
+ } else {
+ HEAP32[i12 >> 2] = i13 & -2;
+ HEAP32[i2 + 4 >> 2] = i11 | 1;
+ HEAP32[i2 + i11 >> 2] = i11;
+ }
+ i6 = i11 >>> 3;
+ if (i11 >>> 0 < 256) {
+ i7 = i6 << 1;
+ i3 = 96 + (i7 << 2) | 0;
+ i8 = HEAP32[14] | 0;
+ i6 = 1 << i6;
+ if ((i8 & i6 | 0) != 0) {
+ i6 = 96 + (i7 + 2 << 2) | 0;
+ i7 = HEAP32[i6 >> 2] | 0;
+ if (i7 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i4 = i6;
+ i5 = i7;
+ }
+ } else {
+ HEAP32[14] = i8 | i6;
+ i4 = 96 + (i7 + 2 << 2) | 0;
+ i5 = i3;
+ }
+ HEAP32[i4 >> 2] = i2;
+ HEAP32[i5 + 12 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i5;
+ HEAP32[i2 + 12 >> 2] = i3;
+ STACKTOP = i1;
+ return;
+ }
+ i4 = i11 >>> 8;
+ if ((i4 | 0) != 0) {
+ if (i11 >>> 0 > 16777215) {
+ i4 = 31;
+ } else {
+ i20 = (i4 + 1048320 | 0) >>> 16 & 8;
+ i21 = i4 << i20;
+ i19 = (i21 + 520192 | 0) >>> 16 & 4;
+ i21 = i21 << i19;
+ i4 = (i21 + 245760 | 0) >>> 16 & 2;
+ i4 = 14 - (i19 | i20 | i4) + (i21 << i4 >>> 15) | 0;
+ i4 = i11 >>> (i4 + 7 | 0) & 1 | i4 << 1;
+ }
+ } else {
+ i4 = 0;
+ }
+ i5 = 360 + (i4 << 2) | 0;
+ HEAP32[i2 + 28 >> 2] = i4;
+ HEAP32[i2 + 20 >> 2] = 0;
+ HEAP32[i2 + 16 >> 2] = 0;
+ i7 = HEAP32[60 >> 2] | 0;
+ i6 = 1 << i4;
+ L199 : do {
+ if ((i7 & i6 | 0) != 0) {
+ i5 = HEAP32[i5 >> 2] | 0;
+ if ((i4 | 0) == 31) {
+ i4 = 0;
+ } else {
+ i4 = 25 - (i4 >>> 1) | 0;
+ }
+ L205 : do {
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) != (i11 | 0)) {
+ i4 = i11 << i4;
+ i7 = i5;
+ while (1) {
+ i6 = i7 + (i4 >>> 31 << 2) + 16 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) == (i11 | 0)) {
+ i3 = i5;
+ break L205;
+ } else {
+ i4 = i4 << 1;
+ i7 = i5;
+ }
+ }
+ if (i6 >>> 0 < (HEAP32[72 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i6 >> 2] = i2;
+ HEAP32[i2 + 24 >> 2] = i7;
+ HEAP32[i2 + 12 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i2;
+ break L199;
+ }
+ } else {
+ i3 = i5;
+ }
+ } while (0);
+ i5 = i3 + 8 | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ i6 = HEAP32[72 >> 2] | 0;
+ if (i3 >>> 0 < i6 >>> 0) {
+ _abort();
+ }
+ if (i4 >>> 0 < i6 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i4 + 12 >> 2] = i2;
+ HEAP32[i5 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i4;
+ HEAP32[i2 + 12 >> 2] = i3;
+ HEAP32[i2 + 24 >> 2] = 0;
+ break;
+ }
+ } else {
+ HEAP32[60 >> 2] = i7 | i6;
+ HEAP32[i5 >> 2] = i2;
+ HEAP32[i2 + 24 >> 2] = i5;
+ HEAP32[i2 + 12 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i2;
+ }
+ } while (0);
+ i21 = (HEAP32[88 >> 2] | 0) + -1 | 0;
+ HEAP32[88 >> 2] = i21;
+ if ((i21 | 0) == 0) {
+ i2 = 512 | 0;
+ } else {
+ STACKTOP = i1;
+ return;
+ }
+ while (1) {
+ i2 = HEAP32[i2 >> 2] | 0;
+ if ((i2 | 0) == 0) {
+ break;
+ } else {
+ i2 = i2 + 8 | 0;
+ }
+ }
+ HEAP32[88 >> 2] = -1;
+ STACKTOP = i1;
+ return;
+}
+function __Z15fannkuch_workerPv(i9) {
+ i9 = i9 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0;
+ i3 = STACKTOP;
+ i7 = HEAP32[i9 + 4 >> 2] | 0;
+ i6 = i7 << 2;
+ i5 = _malloc(i6) | 0;
+ i2 = _malloc(i6) | 0;
+ i6 = _malloc(i6) | 0;
+ i10 = (i7 | 0) > 0;
+ if (i10) {
+ i8 = 0;
+ do {
+ HEAP32[i5 + (i8 << 2) >> 2] = i8;
+ i8 = i8 + 1 | 0;
+ } while ((i8 | 0) != (i7 | 0));
+ i8 = i7 + -1 | 0;
+ i17 = HEAP32[i9 >> 2] | 0;
+ HEAP32[i5 + (i17 << 2) >> 2] = i8;
+ i9 = i5 + (i8 << 2) | 0;
+ HEAP32[i9 >> 2] = i17;
+ if (i10) {
+ i10 = i7 << 2;
+ i11 = 0;
+ i12 = i7;
+ L7 : while (1) {
+ if ((i12 | 0) > 1) {
+ while (1) {
+ i13 = i12 + -1 | 0;
+ HEAP32[i6 + (i13 << 2) >> 2] = i12;
+ if ((i13 | 0) > 1) {
+ i12 = i13;
+ } else {
+ i12 = 1;
+ break;
+ }
+ }
+ }
+ i13 = HEAP32[i5 >> 2] | 0;
+ if ((i13 | 0) != 0 ? (HEAP32[i9 >> 2] | 0) != (i8 | 0) : 0) {
+ _memcpy(i2 | 0, i5 | 0, i10 | 0) | 0;
+ i15 = 0;
+ i14 = HEAP32[i2 >> 2] | 0;
+ while (1) {
+ i17 = i14 + -1 | 0;
+ if ((i17 | 0) > 1) {
+ i16 = 1;
+ do {
+ i20 = i2 + (i16 << 2) | 0;
+ i19 = HEAP32[i20 >> 2] | 0;
+ i18 = i2 + (i17 << 2) | 0;
+ HEAP32[i20 >> 2] = HEAP32[i18 >> 2];
+ HEAP32[i18 >> 2] = i19;
+ i16 = i16 + 1 | 0;
+ i17 = i17 + -1 | 0;
+ } while ((i16 | 0) < (i17 | 0));
+ }
+ i15 = i15 + 1 | 0;
+ i20 = i2 + (i14 << 2) | 0;
+ i16 = HEAP32[i20 >> 2] | 0;
+ HEAP32[i20 >> 2] = i14;
+ if ((i16 | 0) == 0) {
+ break;
+ } else {
+ i14 = i16;
+ }
+ }
+ i11 = (i11 | 0) < (i15 | 0) ? i15 : i11;
+ }
+ if ((i12 | 0) >= (i8 | 0)) {
+ i8 = 34;
+ break;
+ }
+ while (1) {
+ if ((i12 | 0) > 0) {
+ i14 = 0;
+ while (1) {
+ i15 = i14 + 1 | 0;
+ HEAP32[i5 + (i14 << 2) >> 2] = HEAP32[i5 + (i15 << 2) >> 2];
+ if ((i15 | 0) == (i12 | 0)) {
+ i14 = i12;
+ break;
+ } else {
+ i14 = i15;
+ }
+ }
+ } else {
+ i14 = 0;
+ }
+ HEAP32[i5 + (i14 << 2) >> 2] = i13;
+ i14 = i6 + (i12 << 2) | 0;
+ i20 = (HEAP32[i14 >> 2] | 0) + -1 | 0;
+ HEAP32[i14 >> 2] = i20;
+ i14 = i12 + 1 | 0;
+ if ((i20 | 0) > 0) {
+ continue L7;
+ }
+ if ((i14 | 0) >= (i8 | 0)) {
+ i8 = 34;
+ break L7;
+ }
+ i13 = HEAP32[i5 >> 2] | 0;
+ i12 = i14;
+ }
+ }
+ if ((i8 | 0) == 34) {
+ _free(i5);
+ _free(i2);
+ _free(i6);
+ STACKTOP = i3;
+ return i11 | 0;
+ }
+ } else {
+ i1 = i9;
+ i4 = i8;
+ }
+ } else {
+ i4 = i7 + -1 | 0;
+ i20 = HEAP32[i9 >> 2] | 0;
+ HEAP32[i5 + (i20 << 2) >> 2] = i4;
+ i1 = i5 + (i4 << 2) | 0;
+ HEAP32[i1 >> 2] = i20;
+ }
+ i11 = 0;
+ L36 : while (1) {
+ if ((i7 | 0) > 1) {
+ while (1) {
+ i8 = i7 + -1 | 0;
+ HEAP32[i6 + (i8 << 2) >> 2] = i7;
+ if ((i8 | 0) > 1) {
+ i7 = i8;
+ } else {
+ i7 = 1;
+ break;
+ }
+ }
+ }
+ i8 = HEAP32[i5 >> 2] | 0;
+ if ((i8 | 0) != 0 ? (HEAP32[i1 >> 2] | 0) != (i4 | 0) : 0) {
+ i10 = 0;
+ i9 = HEAP32[i2 >> 2] | 0;
+ while (1) {
+ i13 = i9 + -1 | 0;
+ if ((i13 | 0) > 1) {
+ i12 = 1;
+ do {
+ i18 = i2 + (i12 << 2) | 0;
+ i19 = HEAP32[i18 >> 2] | 0;
+ i20 = i2 + (i13 << 2) | 0;
+ HEAP32[i18 >> 2] = HEAP32[i20 >> 2];
+ HEAP32[i20 >> 2] = i19;
+ i12 = i12 + 1 | 0;
+ i13 = i13 + -1 | 0;
+ } while ((i12 | 0) < (i13 | 0));
+ }
+ i10 = i10 + 1 | 0;
+ i20 = i2 + (i9 << 2) | 0;
+ i12 = HEAP32[i20 >> 2] | 0;
+ HEAP32[i20 >> 2] = i9;
+ if ((i12 | 0) == 0) {
+ break;
+ } else {
+ i9 = i12;
+ }
+ }
+ i11 = (i11 | 0) < (i10 | 0) ? i10 : i11;
+ }
+ if ((i7 | 0) >= (i4 | 0)) {
+ i8 = 34;
+ break;
+ }
+ while (1) {
+ if ((i7 | 0) > 0) {
+ i9 = 0;
+ while (1) {
+ i10 = i9 + 1 | 0;
+ HEAP32[i5 + (i9 << 2) >> 2] = HEAP32[i5 + (i10 << 2) >> 2];
+ if ((i10 | 0) == (i7 | 0)) {
+ i9 = i7;
+ break;
+ } else {
+ i9 = i10;
+ }
+ }
+ } else {
+ i9 = 0;
+ }
+ HEAP32[i5 + (i9 << 2) >> 2] = i8;
+ i9 = i6 + (i7 << 2) | 0;
+ i20 = (HEAP32[i9 >> 2] | 0) + -1 | 0;
+ HEAP32[i9 >> 2] = i20;
+ i9 = i7 + 1 | 0;
+ if ((i20 | 0) > 0) {
+ continue L36;
+ }
+ if ((i9 | 0) >= (i4 | 0)) {
+ i8 = 34;
+ break L36;
+ }
+ i8 = HEAP32[i5 >> 2] | 0;
+ i7 = i9;
+ }
+ }
+ if ((i8 | 0) == 34) {
+ _free(i5);
+ _free(i2);
+ _free(i6);
+ STACKTOP = i3;
+ return i11 | 0;
+ }
+ return 0;
+}
+function _main(i3, i5) {
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i1 = i2;
+ L1 : do {
+ if ((i3 | 0) > 1) {
+ i3 = HEAP8[HEAP32[i5 + 4 >> 2] | 0] | 0;
+ switch (i3 | 0) {
+ case 50:
+ {
+ i3 = 10;
+ break L1;
+ }
+ case 51:
+ {
+ i4 = 4;
+ break L1;
+ }
+ case 52:
+ {
+ i3 = 11;
+ break L1;
+ }
+ case 53:
+ {
+ i3 = 12;
+ break L1;
+ }
+ case 49:
+ {
+ i3 = 9;
+ break L1;
+ }
+ case 48:
+ {
+ i11 = 0;
+ STACKTOP = i2;
+ return i11 | 0;
+ }
+ default:
+ {
+ HEAP32[i1 >> 2] = i3 + -48;
+ _printf(8, i1 | 0) | 0;
+ i11 = -1;
+ STACKTOP = i2;
+ return i11 | 0;
+ }
+ }
+ } else {
+ i4 = 4;
+ }
+ } while (0);
+ if ((i4 | 0) == 4) {
+ i3 = 11;
+ }
+ i5 = i3 + -1 | 0;
+ i6 = 0;
+ i7 = 0;
+ while (1) {
+ i4 = _malloc(12) | 0;
+ HEAP32[i4 >> 2] = i7;
+ HEAP32[i4 + 4 >> 2] = i3;
+ HEAP32[i4 + 8 >> 2] = i6;
+ i7 = i7 + 1 | 0;
+ if ((i7 | 0) == (i5 | 0)) {
+ break;
+ } else {
+ i6 = i4;
+ }
+ }
+ i5 = i3 << 2;
+ i6 = _malloc(i5) | 0;
+ i5 = _malloc(i5) | 0;
+ i7 = 0;
+ do {
+ HEAP32[i6 + (i7 << 2) >> 2] = i7;
+ i7 = i7 + 1 | 0;
+ } while ((i7 | 0) != (i3 | 0));
+ i8 = i3;
+ i7 = 30;
+ L19 : do {
+ i9 = 0;
+ do {
+ HEAP32[i1 >> 2] = (HEAP32[i6 + (i9 << 2) >> 2] | 0) + 1;
+ _printf(48, i1 | 0) | 0;
+ i9 = i9 + 1 | 0;
+ } while ((i9 | 0) != (i3 | 0));
+ _putchar(10) | 0;
+ i7 = i7 + -1 | 0;
+ if ((i8 | 0) <= 1) {
+ if ((i8 | 0) == (i3 | 0)) {
+ break;
+ }
+ } else {
+ while (1) {
+ i9 = i8 + -1 | 0;
+ HEAP32[i5 + (i9 << 2) >> 2] = i8;
+ if ((i9 | 0) > 1) {
+ i8 = i9;
+ } else {
+ i8 = 1;
+ break;
+ }
+ }
+ }
+ while (1) {
+ i9 = HEAP32[i6 >> 2] | 0;
+ if ((i8 | 0) > 0) {
+ i11 = 0;
+ while (1) {
+ i10 = i11 + 1 | 0;
+ HEAP32[i6 + (i11 << 2) >> 2] = HEAP32[i6 + (i10 << 2) >> 2];
+ if ((i10 | 0) == (i8 | 0)) {
+ i10 = i8;
+ break;
+ } else {
+ i11 = i10;
+ }
+ }
+ } else {
+ i10 = 0;
+ }
+ HEAP32[i6 + (i10 << 2) >> 2] = i9;
+ i9 = i5 + (i8 << 2) | 0;
+ i11 = (HEAP32[i9 >> 2] | 0) + -1 | 0;
+ HEAP32[i9 >> 2] = i11;
+ i9 = i8 + 1 | 0;
+ if ((i11 | 0) > 0) {
+ break;
+ }
+ if ((i9 | 0) == (i3 | 0)) {
+ break L19;
+ } else {
+ i8 = i9;
+ }
+ }
+ } while ((i7 | 0) != 0);
+ _free(i6);
+ _free(i5);
+ if ((i4 | 0) == 0) {
+ i5 = 0;
+ } else {
+ i5 = 0;
+ while (1) {
+ i6 = __Z15fannkuch_workerPv(i4) | 0;
+ i5 = (i5 | 0) < (i6 | 0) ? i6 : i5;
+ i6 = HEAP32[i4 + 8 >> 2] | 0;
+ _free(i4);
+ if ((i6 | 0) == 0) {
+ break;
+ } else {
+ i4 = i6;
+ }
+ }
+ }
+ HEAP32[i1 >> 2] = i3;
+ HEAP32[i1 + 4 >> 2] = i5;
+ _printf(24, i1 | 0) | 0;
+ i11 = 0;
+ STACKTOP = i2;
+ return i11 | 0;
+}
+function _memcpy(i3, i2, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i4 = 0;
+ if ((i1 | 0) >= 4096) return _emscripten_memcpy_big(i3 | 0, i2 | 0, i1 | 0) | 0;
+ i4 = i3 | 0;
+ if ((i3 & 3) == (i2 & 3)) {
+ while (i3 & 3) {
+ if ((i1 | 0) == 0) return i4 | 0;
+ HEAP8[i3] = HEAP8[i2] | 0;
+ i3 = i3 + 1 | 0;
+ i2 = i2 + 1 | 0;
+ i1 = i1 - 1 | 0;
+ }
+ while ((i1 | 0) >= 4) {
+ HEAP32[i3 >> 2] = HEAP32[i2 >> 2];
+ i3 = i3 + 4 | 0;
+ i2 = i2 + 4 | 0;
+ i1 = i1 - 4 | 0;
+ }
+ }
+ while ((i1 | 0) > 0) {
+ HEAP8[i3] = HEAP8[i2] | 0;
+ i3 = i3 + 1 | 0;
+ i2 = i2 + 1 | 0;
+ i1 = i1 - 1 | 0;
+ }
+ return i4 | 0;
+}
+function _memset(i1, i4, i3) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i2 = i1 + i3 | 0;
+ if ((i3 | 0) >= 20) {
+ i4 = i4 & 255;
+ i7 = i1 & 3;
+ i6 = i4 | i4 << 8 | i4 << 16 | i4 << 24;
+ i5 = i2 & ~3;
+ if (i7) {
+ i7 = i1 + 4 - i7 | 0;
+ while ((i1 | 0) < (i7 | 0)) {
+ HEAP8[i1] = i4;
+ i1 = i1 + 1 | 0;
+ }
+ }
+ while ((i1 | 0) < (i5 | 0)) {
+ HEAP32[i1 >> 2] = i6;
+ i1 = i1 + 4 | 0;
+ }
+ }
+ while ((i1 | 0) < (i2 | 0)) {
+ HEAP8[i1] = i4;
+ i1 = i1 + 1 | 0;
+ }
+ return i1 - i3 | 0;
+}
+function copyTempDouble(i1) {
+ i1 = i1 | 0;
+ HEAP8[tempDoublePtr] = HEAP8[i1];
+ HEAP8[tempDoublePtr + 1 | 0] = HEAP8[i1 + 1 | 0];
+ HEAP8[tempDoublePtr + 2 | 0] = HEAP8[i1 + 2 | 0];
+ HEAP8[tempDoublePtr + 3 | 0] = HEAP8[i1 + 3 | 0];
+ HEAP8[tempDoublePtr + 4 | 0] = HEAP8[i1 + 4 | 0];
+ HEAP8[tempDoublePtr + 5 | 0] = HEAP8[i1 + 5 | 0];
+ HEAP8[tempDoublePtr + 6 | 0] = HEAP8[i1 + 6 | 0];
+ HEAP8[tempDoublePtr + 7 | 0] = HEAP8[i1 + 7 | 0];
+}
+function copyTempFloat(i1) {
+ i1 = i1 | 0;
+ HEAP8[tempDoublePtr] = HEAP8[i1];
+ HEAP8[tempDoublePtr + 1 | 0] = HEAP8[i1 + 1 | 0];
+ HEAP8[tempDoublePtr + 2 | 0] = HEAP8[i1 + 2 | 0];
+ HEAP8[tempDoublePtr + 3 | 0] = HEAP8[i1 + 3 | 0];
+}
+function runPostSets() {}
+function _strlen(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = i1;
+ while (HEAP8[i2] | 0) {
+ i2 = i2 + 1 | 0;
+ }
+ return i2 - i1 | 0;
+}
+function stackAlloc(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + i1 | 0;
+ STACKTOP = STACKTOP + 7 & -8;
+ return i2 | 0;
+}
+function setThrew(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ if ((__THREW__ | 0) == 0) {
+ __THREW__ = i1;
+ threwValue = i2;
+ }
+}
+function stackRestore(i1) {
+ i1 = i1 | 0;
+ STACKTOP = i1;
+}
+function setTempRet9(i1) {
+ i1 = i1 | 0;
+ tempRet9 = i1;
+}
+function setTempRet8(i1) {
+ i1 = i1 | 0;
+ tempRet8 = i1;
+}
+function setTempRet7(i1) {
+ i1 = i1 | 0;
+ tempRet7 = i1;
+}
+function setTempRet6(i1) {
+ i1 = i1 | 0;
+ tempRet6 = i1;
+}
+function setTempRet5(i1) {
+ i1 = i1 | 0;
+ tempRet5 = i1;
+}
+function setTempRet4(i1) {
+ i1 = i1 | 0;
+ tempRet4 = i1;
+}
+function setTempRet3(i1) {
+ i1 = i1 | 0;
+ tempRet3 = i1;
+}
+function setTempRet2(i1) {
+ i1 = i1 | 0;
+ tempRet2 = i1;
+}
+function setTempRet1(i1) {
+ i1 = i1 | 0;
+ tempRet1 = i1;
+}
+function setTempRet0(i1) {
+ i1 = i1 | 0;
+ tempRet0 = i1;
+}
+function stackSave() {
+ return STACKTOP | 0;
+}
+
+// EMSCRIPTEN_END_FUNCS
+
+
+ return { _strlen: _strlen, _free: _free, _main: _main, _memset: _memset, _malloc: _malloc, _memcpy: _memcpy, runPostSets: runPostSets, stackAlloc: stackAlloc, stackSave: stackSave, stackRestore: stackRestore, setThrew: setThrew, setTempRet0: setTempRet0, setTempRet1: setTempRet1, setTempRet2: setTempRet2, setTempRet3: setTempRet3, setTempRet4: setTempRet4, setTempRet5: setTempRet5, setTempRet6: setTempRet6, setTempRet7: setTempRet7, setTempRet8: setTempRet8, setTempRet9: setTempRet9 };
+}).toString(),
+// EMSCRIPTEN_END_ASM
+{ "Math": Math, "Int8Array": Int8Array, "Int16Array": Int16Array, "Int32Array": Int32Array, "Uint8Array": Uint8Array, "Uint16Array": Uint16Array, "Uint32Array": Uint32Array, "Float32Array": Float32Array, "Float64Array": Float64Array, "abort": abort, "assert": assert, "asmPrintInt": asmPrintInt, "asmPrintFloat": asmPrintFloat, "min": Math_min, "_fflush": _fflush, "_emscripten_memcpy_big": _emscripten_memcpy_big, "_putchar": _putchar, "_fputc": _fputc, "_send": _send, "_pwrite": _pwrite, "_abort": _abort, "__reallyNegative": __reallyNegative, "_fwrite": _fwrite, "_sbrk": _sbrk, "_mkport": _mkport, "_fprintf": _fprintf, "___setErrNo": ___setErrNo, "__formatString": __formatString, "_fileno": _fileno, "_printf": _printf, "_time": _time, "_sysconf": _sysconf, "_write": _write, "___errno_location": ___errno_location, "STACKTOP": STACKTOP, "STACK_MAX": STACK_MAX, "tempDoublePtr": tempDoublePtr, "ABORT": ABORT, "NaN": NaN, "Infinity": Infinity }, buffer);
+var _strlen = Module["_strlen"] = asm["_strlen"];
+var _free = Module["_free"] = asm["_free"];
+var _main = Module["_main"] = asm["_main"];
+var _memset = Module["_memset"] = asm["_memset"];
+var _malloc = Module["_malloc"] = asm["_malloc"];
+var _memcpy = Module["_memcpy"] = asm["_memcpy"];
+var runPostSets = Module["runPostSets"] = asm["runPostSets"];
+
+Runtime.stackAlloc = function(size) { return asm['stackAlloc'](size) };
+Runtime.stackSave = function() { return asm['stackSave']() };
+Runtime.stackRestore = function(top) { asm['stackRestore'](top) };
+
+
+// Warning: printing of i64 values may be slightly rounded! No deep i64 math used, so precise i64 code not included
+var i64Math = null;
+
+// === Auto-generated postamble setup entry stuff ===
+
+if (memoryInitializer) {
+ if (ENVIRONMENT_IS_NODE || ENVIRONMENT_IS_SHELL) {
+ var data = Module['readBinary'](memoryInitializer);
+ HEAPU8.set(data, STATIC_BASE);
+ } else {
+ addRunDependency('memory initializer');
+ Browser.asyncLoad(memoryInitializer, function(data) {
+ HEAPU8.set(data, STATIC_BASE);
+ removeRunDependency('memory initializer');
+ }, function(data) {
+ throw 'could not load memory initializer ' + memoryInitializer;
+ });
+ }
+}
+
+function ExitStatus(status) {
+ this.name = "ExitStatus";
+ this.message = "Program terminated with exit(" + status + ")";
+ this.status = status;
+};
+ExitStatus.prototype = new Error();
+ExitStatus.prototype.constructor = ExitStatus;
+
+var initialStackTop;
+var preloadStartTime = null;
+var calledMain = false;
+
+dependenciesFulfilled = function runCaller() {
+ // If run has never been called, and we should call run (INVOKE_RUN is true, and Module.noInitialRun is not false)
+ if (!Module['calledRun'] && shouldRunNow) run([].concat(Module["arguments"]));
+ if (!Module['calledRun']) dependenciesFulfilled = runCaller; // try this again later, after new deps are fulfilled
+}
+
+Module['callMain'] = Module.callMain = function callMain(args) {
+ assert(runDependencies == 0, 'cannot call main when async dependencies remain! (listen on __ATMAIN__)');
+ assert(__ATPRERUN__.length == 0, 'cannot call main when preRun functions remain to be called');
+
+ args = args || [];
+
+ ensureInitRuntime();
+
+ var argc = args.length+1;
+ function pad() {
+ for (var i = 0; i < 4-1; i++) {
+ argv.push(0);
+ }
+ }
+ var argv = [allocate(intArrayFromString("/bin/this.program"), 'i8', ALLOC_NORMAL) ];
+ pad();
+ for (var i = 0; i < argc-1; i = i + 1) {
+ argv.push(allocate(intArrayFromString(args[i]), 'i8', ALLOC_NORMAL));
+ pad();
+ }
+ argv.push(0);
+ argv = allocate(argv, 'i32', ALLOC_NORMAL);
+
+ initialStackTop = STACKTOP;
+
+ try {
+
+ var ret = Module['_main'](argc, argv, 0);
+
+
+ // if we're not running an evented main loop, it's time to exit
+ if (!Module['noExitRuntime']) {
+ exit(ret);
+ }
+ }
+ catch(e) {
+ if (e instanceof ExitStatus) {
+ // exit() throws this once it's done to make sure execution
+ // has been stopped completely
+ return;
+ } else if (e == 'SimulateInfiniteLoop') {
+ // running an evented main loop, don't immediately exit
+ Module['noExitRuntime'] = true;
+ return;
+ } else {
+ if (e && typeof e === 'object' && e.stack) Module.printErr('exception thrown: ' + [e, e.stack]);
+ throw e;
+ }
+ } finally {
+ calledMain = true;
+ }
+}
+
+
+
+
+function run(args) {
+ args = args || Module['arguments'];
+
+ if (preloadStartTime === null) preloadStartTime = Date.now();
+
+ if (runDependencies > 0) {
+ Module.printErr('run() called, but dependencies remain, so not running');
+ return;
+ }
+
+ preRun();
+
+ if (runDependencies > 0) return; // a preRun added a dependency, run will be called later
+ if (Module['calledRun']) return; // run may have just been called through dependencies being fulfilled just in this very frame
+
+ function doRun() {
+ if (Module['calledRun']) return; // run may have just been called while the async setStatus time below was happening
+ Module['calledRun'] = true;
+
+ ensureInitRuntime();
+
+ preMain();
+
+ if (ENVIRONMENT_IS_WEB && preloadStartTime !== null) {
+ Module.printErr('pre-main prep time: ' + (Date.now() - preloadStartTime) + ' ms');
+ }
+
+ if (Module['_main'] && shouldRunNow) {
+ Module['callMain'](args);
+ }
+
+ postRun();
+ }
+
+ if (Module['setStatus']) {
+ Module['setStatus']('Running...');
+ setTimeout(function() {
+ setTimeout(function() {
+ Module['setStatus']('');
+ }, 1);
+ if (!ABORT) doRun();
+ }, 1);
+ } else {
+ doRun();
+ }
+}
+Module['run'] = Module.run = run;
+
+function exit(status) {
+ ABORT = true;
+ EXITSTATUS = status;
+ STACKTOP = initialStackTop;
+
+ // exit the runtime
+ exitRuntime();
+
+ // TODO We should handle this differently based on environment.
+ // In the browser, the best we can do is throw an exception
+ // to halt execution, but in node we could process.exit and
+ // I'd imagine SM shell would have something equivalent.
+ // This would let us set a proper exit status (which
+ // would be great for checking test exit statuses).
+ // https://github.com/kripken/emscripten/issues/1371
+
+ // throw an exception to halt the current execution
+ throw new ExitStatus(status);
+}
+Module['exit'] = Module.exit = exit;
+
+function abort(text) {
+ if (text) {
+ Module.print(text);
+ Module.printErr(text);
+ }
+
+ ABORT = true;
+ EXITSTATUS = 1;
+
+ var extra = '\nIf this abort() is unexpected, build with -s ASSERTIONS=1 which can give more information.';
+
+ throw 'abort() at ' + stackTrace() + extra;
+}
+Module['abort'] = Module.abort = abort;
+
+// {{PRE_RUN_ADDITIONS}}
+
+if (Module['preInit']) {
+ if (typeof Module['preInit'] == 'function') Module['preInit'] = [Module['preInit']];
+ while (Module['preInit'].length > 0) {
+ Module['preInit'].pop()();
+ }
+}
+
+// shouldRunNow refers to calling main(), not run().
+var shouldRunNow = true;
+if (Module['noInitialRun']) {
+ shouldRunNow = false;
+}
+
+
+run([].concat(Module["arguments"]));
diff --git a/test/mjsunit/wasm/embenchen/fasta.js b/test/mjsunit/wasm/embenchen/fasta.js
new file mode 100644
index 0000000..1cd47fa
--- /dev/null
+++ b/test/mjsunit/wasm/embenchen/fasta.js
@@ -0,0 +1,8608 @@
+// Modified embenchen to direct to asm-wasm.
+// Flags: --expose-wasm
+
+var EXPECTED_OUTPUT =
+ 'GGCCGGGCGCGGTGGCTCACGCCTGTAATCCCAGCACTTTGGGAGGCCGAGGCGGGCGGA\n' +
+ 'TCACCTGAGGTCAGGAGTTCGAGACCAGCCTGGCCAACATGGTGAAACCCCGTCTCTACT\n' +
+ 'AAAAATACAAAAATTAGCCGGGCGTGGTGGCGCGCGCCTGTAATCCCAGCTACTCGGGAG\n' +
+ 'GCTGAGGCAGGAGAATCGCTTGAACCCGGGAGGCGGAGGTTGCAGTGAGCCGAGATCGCG\n' +
+ 'CCACTGCACTCCAGCCTGGGCGACAGAGCGAGACTCCGTCTCAAAAAGGCCGGGCGCGGT\n' +
+ 'GGCTCACGCCTGTAATCCCAGCACTTTGGGAGGCCGAGGCGGGCGGATCACCTGAGGTCA\n' +
+ 'GGAGTTCGAGACCAGCCTGGCCAACATGGTGAAACCCCGTCTCTACTAAAAATACAAAAA\n' +
+ 'TTAGCCGGGCGTGGTGGCGCGCGCCTGTAATCCCAGCTACTCGGGAGGCTGAGGCAGGAG\n' +
+ 'AATCGCTTGAACCCGGGAGGCGGAGGTTGCAGTGAGCCGAGATCGCGCCACTGCACTCCA\n' +
+ 'GCCTGGGCGA\n';
+var Module = {
+ arguments: [1],
+ print: function(x) {Module.printBuffer += x + '\n';},
+ preRun: [function() {Module.printBuffer = ''}],
+ postRun: [function() {
+ assertEquals(EXPECTED_OUTPUT, Module.printBuffer);
+ }],
+};
+// The Module object: Our interface to the outside world. We import
+// and export values on it, and do the work to get that through
+// closure compiler if necessary. There are various ways Module can be used:
+// 1. Not defined. We create it here
+// 2. A function parameter, function(Module) { ..generated code.. }
+// 3. pre-run appended it, var Module = {}; ..generated code..
+// 4. External script tag defines var Module.
+// We need to do an eval in order to handle the closure compiler
+// case, where this code here is minified but Module was defined
+// elsewhere (e.g. case 4 above). We also need to check if Module
+// already exists (e.g. case 3 above).
+// Note that if you want to run closure, and also to use Module
+// after the generated code, you will need to define var Module = {};
+// before the code. Then that object will be used in the code, and you
+// can continue to use Module afterwards as well.
+var Module;
+if (!Module) Module = (typeof Module !== 'undefined' ? Module : null) || {};
+
+// Sometimes an existing Module object exists with properties
+// meant to overwrite the default module functionality. Here
+// we collect those properties and reapply _after_ we configure
+// the current environment's defaults to avoid having to be so
+// defensive during initialization.
+var moduleOverrides = {};
+for (var key in Module) {
+ if (Module.hasOwnProperty(key)) {
+ moduleOverrides[key] = Module[key];
+ }
+}
+
+// The environment setup code below is customized to use Module.
+// *** Environment setup code ***
+var ENVIRONMENT_IS_NODE = typeof process === 'object' && typeof require === 'function';
+var ENVIRONMENT_IS_WEB = typeof window === 'object';
+var ENVIRONMENT_IS_WORKER = typeof importScripts === 'function';
+var ENVIRONMENT_IS_SHELL = !ENVIRONMENT_IS_WEB && !ENVIRONMENT_IS_NODE && !ENVIRONMENT_IS_WORKER;
+
+if (ENVIRONMENT_IS_NODE) {
+ // Expose functionality in the same simple way that the shells work
+ // Note that we pollute the global namespace here, otherwise we break in node
+ if (!Module['print']) Module['print'] = function print(x) {
+ process['stdout'].write(x + '\n');
+ };
+ if (!Module['printErr']) Module['printErr'] = function printErr(x) {
+ process['stderr'].write(x + '\n');
+ };
+
+ var nodeFS = require('fs');
+ var nodePath = require('path');
+
+ Module['read'] = function read(filename, binary) {
+ filename = nodePath['normalize'](filename);
+ var ret = nodeFS['readFileSync'](filename);
+ // The path is absolute if the normalized version is the same as the resolved.
+ if (!ret && filename != nodePath['resolve'](filename)) {
+ filename = path.join(__dirname, '..', 'src', filename);
+ ret = nodeFS['readFileSync'](filename);
+ }
+ if (ret && !binary) ret = ret.toString();
+ return ret;
+ };
+
+ Module['readBinary'] = function readBinary(filename) { return Module['read'](filename, true) };
+
+ Module['load'] = function load(f) {
+ globalEval(read(f));
+ };
+
+ Module['arguments'] = process['argv'].slice(2);
+
+ module['exports'] = Module;
+}
+else if (ENVIRONMENT_IS_SHELL) {
+ if (!Module['print']) Module['print'] = print;
+ if (typeof printErr != 'undefined') Module['printErr'] = printErr; // not present in v8 or older sm
+
+ if (typeof read != 'undefined') {
+ Module['read'] = read;
+ } else {
+ Module['read'] = function read() { throw 'no read() available (jsc?)' };
+ }
+
+ Module['readBinary'] = function readBinary(f) {
+ return read(f, 'binary');
+ };
+
+ if (typeof scriptArgs != 'undefined') {
+ Module['arguments'] = scriptArgs;
+ } else if (typeof arguments != 'undefined') {
+ Module['arguments'] = arguments;
+ }
+
+ this['Module'] = Module;
+
+ eval("if (typeof gc === 'function' && gc.toString().indexOf('[native code]') > 0) var gc = undefined"); // wipe out the SpiderMonkey shell 'gc' function, which can confuse closure (uses it as a minified name, and it is then initted to a non-falsey value unexpectedly)
+}
+else if (ENVIRONMENT_IS_WEB || ENVIRONMENT_IS_WORKER) {
+ Module['read'] = function read(url) {
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, false);
+ xhr.send(null);
+ return xhr.responseText;
+ };
+
+ if (typeof arguments != 'undefined') {
+ Module['arguments'] = arguments;
+ }
+
+ if (typeof console !== 'undefined') {
+ if (!Module['print']) Module['print'] = function print(x) {
+ console.log(x);
+ };
+ if (!Module['printErr']) Module['printErr'] = function printErr(x) {
+ console.log(x);
+ };
+ } else {
+ // Probably a worker, and without console.log. We can do very little here...
+ var TRY_USE_DUMP = false;
+ if (!Module['print']) Module['print'] = (TRY_USE_DUMP && (typeof(dump) !== "undefined") ? (function(x) {
+ dump(x);
+ }) : (function(x) {
+ // self.postMessage(x); // enable this if you want stdout to be sent as messages
+ }));
+ }
+
+ if (ENVIRONMENT_IS_WEB) {
+ window['Module'] = Module;
+ } else {
+ Module['load'] = importScripts;
+ }
+}
+else {
+ // Unreachable because SHELL is dependant on the others
+ throw 'Unknown runtime environment. Where are we?';
+}
+
+function globalEval(x) {
+ eval.call(null, x);
+}
+if (!Module['load'] == 'undefined' && Module['read']) {
+ Module['load'] = function load(f) {
+ globalEval(Module['read'](f));
+ };
+}
+if (!Module['print']) {
+ Module['print'] = function(){};
+}
+if (!Module['printErr']) {
+ Module['printErr'] = Module['print'];
+}
+if (!Module['arguments']) {
+ Module['arguments'] = [];
+}
+// *** Environment setup code ***
+
+// Closure helpers
+Module.print = Module['print'];
+Module.printErr = Module['printErr'];
+
+// Callbacks
+Module['preRun'] = [];
+Module['postRun'] = [];
+
+// Merge back in the overrides
+for (var key in moduleOverrides) {
+ if (moduleOverrides.hasOwnProperty(key)) {
+ Module[key] = moduleOverrides[key];
+ }
+}
+
+
+
+// === Auto-generated preamble library stuff ===
+
+//========================================
+// Runtime code shared with compiler
+//========================================
+
+var Runtime = {
+ stackSave: function () {
+ return STACKTOP;
+ },
+ stackRestore: function (stackTop) {
+ STACKTOP = stackTop;
+ },
+ forceAlign: function (target, quantum) {
+ quantum = quantum || 4;
+ if (quantum == 1) return target;
+ if (isNumber(target) && isNumber(quantum)) {
+ return Math.ceil(target/quantum)*quantum;
+ } else if (isNumber(quantum) && isPowerOfTwo(quantum)) {
+ return '(((' +target + ')+' + (quantum-1) + ')&' + -quantum + ')';
+ }
+ return 'Math.ceil((' + target + ')/' + quantum + ')*' + quantum;
+ },
+ isNumberType: function (type) {
+ return type in Runtime.INT_TYPES || type in Runtime.FLOAT_TYPES;
+ },
+ isPointerType: function isPointerType(type) {
+ return type[type.length-1] == '*';
+},
+ isStructType: function isStructType(type) {
+ if (isPointerType(type)) return false;
+ if (isArrayType(type)) return true;
+ if (/<?\{ ?[^}]* ?\}>?/.test(type)) return true; // { i32, i8 } etc. - anonymous struct types
+ // See comment in isStructPointerType()
+ return type[0] == '%';
+},
+ INT_TYPES: {"i1":0,"i8":0,"i16":0,"i32":0,"i64":0},
+ FLOAT_TYPES: {"float":0,"double":0},
+ or64: function (x, y) {
+ var l = (x | 0) | (y | 0);
+ var h = (Math.round(x / 4294967296) | Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ and64: function (x, y) {
+ var l = (x | 0) & (y | 0);
+ var h = (Math.round(x / 4294967296) & Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ xor64: function (x, y) {
+ var l = (x | 0) ^ (y | 0);
+ var h = (Math.round(x / 4294967296) ^ Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ getNativeTypeSize: function (type) {
+ switch (type) {
+ case 'i1': case 'i8': return 1;
+ case 'i16': return 2;
+ case 'i32': return 4;
+ case 'i64': return 8;
+ case 'float': return 4;
+ case 'double': return 8;
+ default: {
+ if (type[type.length-1] === '*') {
+ return Runtime.QUANTUM_SIZE; // A pointer
+ } else if (type[0] === 'i') {
+ var bits = parseInt(type.substr(1));
+ assert(bits % 8 === 0);
+ return bits/8;
+ } else {
+ return 0;
+ }
+ }
+ }
+ },
+ getNativeFieldSize: function (type) {
+ return Math.max(Runtime.getNativeTypeSize(type), Runtime.QUANTUM_SIZE);
+ },
+ dedup: function dedup(items, ident) {
+ var seen = {};
+ if (ident) {
+ return items.filter(function(item) {
+ if (seen[item[ident]]) return false;
+ seen[item[ident]] = true;
+ return true;
+ });
+ } else {
+ return items.filter(function(item) {
+ if (seen[item]) return false;
+ seen[item] = true;
+ return true;
+ });
+ }
+},
+ set: function set() {
+ var args = typeof arguments[0] === 'object' ? arguments[0] : arguments;
+ var ret = {};
+ for (var i = 0; i < args.length; i++) {
+ ret[args[i]] = 0;
+ }
+ return ret;
+},
+ STACK_ALIGN: 8,
+ getAlignSize: function (type, size, vararg) {
+ // we align i64s and doubles on 64-bit boundaries, unlike x86
+ if (!vararg && (type == 'i64' || type == 'double')) return 8;
+ if (!type) return Math.min(size, 8); // align structures internally to 64 bits
+ return Math.min(size || (type ? Runtime.getNativeFieldSize(type) : 0), Runtime.QUANTUM_SIZE);
+ },
+ calculateStructAlignment: function calculateStructAlignment(type) {
+ type.flatSize = 0;
+ type.alignSize = 0;
+ var diffs = [];
+ var prev = -1;
+ var index = 0;
+ type.flatIndexes = type.fields.map(function(field) {
+ index++;
+ var size, alignSize;
+ if (Runtime.isNumberType(field) || Runtime.isPointerType(field)) {
+ size = Runtime.getNativeTypeSize(field); // pack char; char; in structs, also char[X]s.
+ alignSize = Runtime.getAlignSize(field, size);
+ } else if (Runtime.isStructType(field)) {
+ if (field[1] === '0') {
+ // this is [0 x something]. When inside another structure like here, it must be at the end,
+ // and it adds no size
+ // XXX this happens in java-nbody for example... assert(index === type.fields.length, 'zero-length in the middle!');
+ size = 0;
+ if (Types.types[field]) {
+ alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
+ } else {
+ alignSize = type.alignSize || QUANTUM_SIZE;
+ }
+ } else {
+ size = Types.types[field].flatSize;
+ alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
+ }
+ } else if (field[0] == 'b') {
+ // bN, large number field, like a [N x i8]
+ size = field.substr(1)|0;
+ alignSize = 1;
+ } else if (field[0] === '<') {
+ // vector type
+ size = alignSize = Types.types[field].flatSize; // fully aligned
+ } else if (field[0] === 'i') {
+ // illegal integer field, that could not be legalized because it is an internal structure field
+ // it is ok to have such fields, if we just use them as markers of field size and nothing more complex
+ size = alignSize = parseInt(field.substr(1))/8;
+ assert(size % 1 === 0, 'cannot handle non-byte-size field ' + field);
+ } else {
+ assert(false, 'invalid type for calculateStructAlignment');
+ }
+ if (type.packed) alignSize = 1;
+ type.alignSize = Math.max(type.alignSize, alignSize);
+ var curr = Runtime.alignMemory(type.flatSize, alignSize); // if necessary, place this on aligned memory
+ type.flatSize = curr + size;
+ if (prev >= 0) {
+ diffs.push(curr-prev);
+ }
+ prev = curr;
+ return curr;
+ });
+ if (type.name_ && type.name_[0] === '[') {
+ // arrays have 2 elements, so we get the proper difference. then we scale here. that way we avoid
+ // allocating a potentially huge array for [999999 x i8] etc.
+ type.flatSize = parseInt(type.name_.substr(1))*type.flatSize/2;
+ }
+ type.flatSize = Runtime.alignMemory(type.flatSize, type.alignSize);
+ if (diffs.length == 0) {
+ type.flatFactor = type.flatSize;
+ } else if (Runtime.dedup(diffs).length == 1) {
+ type.flatFactor = diffs[0];
+ }
+ type.needsFlattening = (type.flatFactor != 1);
+ return type.flatIndexes;
+ },
+ generateStructInfo: function (struct, typeName, offset) {
+ var type, alignment;
+ if (typeName) {
+ offset = offset || 0;
+ type = (typeof Types === 'undefined' ? Runtime.typeInfo : Types.types)[typeName];
+ if (!type) return null;
+ if (type.fields.length != struct.length) {
+ printErr('Number of named fields must match the type for ' + typeName + ': possibly duplicate struct names. Cannot return structInfo');
+ return null;
+ }
+ alignment = type.flatIndexes;
+ } else {
+ var type = { fields: struct.map(function(item) { return item[0] }) };
+ alignment = Runtime.calculateStructAlignment(type);
+ }
+ var ret = {
+ __size__: type.flatSize
+ };
+ if (typeName) {
+ struct.forEach(function(item, i) {
+ if (typeof item === 'string') {
+ ret[item] = alignment[i] + offset;
+ } else {
+ // embedded struct
+ var key;
+ for (var k in item) key = k;
+ ret[key] = Runtime.generateStructInfo(item[key], type.fields[i], alignment[i]);
+ }
+ });
+ } else {
+ struct.forEach(function(item, i) {
+ ret[item[1]] = alignment[i];
+ });
+ }
+ return ret;
+ },
+ dynCall: function (sig, ptr, args) {
+ if (args && args.length) {
+ if (!args.splice) args = Array.prototype.slice.call(args);
+ args.splice(0, 0, ptr);
+ return Module['dynCall_' + sig].apply(null, args);
+ } else {
+ return Module['dynCall_' + sig].call(null, ptr);
+ }
+ },
+ functionPointers: [],
+ addFunction: function (func) {
+ for (var i = 0; i < Runtime.functionPointers.length; i++) {
+ if (!Runtime.functionPointers[i]) {
+ Runtime.functionPointers[i] = func;
+ return 2*(1 + i);
+ }
+ }
+ throw 'Finished up all reserved function pointers. Use a higher value for RESERVED_FUNCTION_POINTERS.';
+ },
+ removeFunction: function (index) {
+ Runtime.functionPointers[(index-2)/2] = null;
+ },
+ getAsmConst: function (code, numArgs) {
+ // code is a constant string on the heap, so we can cache these
+ if (!Runtime.asmConstCache) Runtime.asmConstCache = {};
+ var func = Runtime.asmConstCache[code];
+ if (func) return func;
+ var args = [];
+ for (var i = 0; i < numArgs; i++) {
+ args.push(String.fromCharCode(36) + i); // $0, $1 etc
+ }
+ var source = Pointer_stringify(code);
+ if (source[0] === '"') {
+ // tolerate EM_ASM("..code..") even though EM_ASM(..code..) is correct
+ if (source.indexOf('"', 1) === source.length-1) {
+ source = source.substr(1, source.length-2);
+ } else {
+ // something invalid happened, e.g. EM_ASM("..code($0)..", input)
+ abort('invalid EM_ASM input |' + source + '|. Please use EM_ASM(..code..) (no quotes) or EM_ASM({ ..code($0).. }, input) (to input values)');
+ }
+ }
+ try {
+ var evalled = eval('(function(' + args.join(',') + '){ ' + source + ' })'); // new Function does not allow upvars in node
+ } catch(e) {
+ Module.printErr('error in executing inline EM_ASM code: ' + e + ' on: \n\n' + source + '\n\nwith args |' + args + '| (make sure to use the right one out of EM_ASM, EM_ASM_ARGS, etc.)');
+ throw e;
+ }
+ return Runtime.asmConstCache[code] = evalled;
+ },
+ warnOnce: function (text) {
+ if (!Runtime.warnOnce.shown) Runtime.warnOnce.shown = {};
+ if (!Runtime.warnOnce.shown[text]) {
+ Runtime.warnOnce.shown[text] = 1;
+ Module.printErr(text);
+ }
+ },
+ funcWrappers: {},
+ getFuncWrapper: function (func, sig) {
+ assert(sig);
+ if (!Runtime.funcWrappers[func]) {
+ Runtime.funcWrappers[func] = function dynCall_wrapper() {
+ return Runtime.dynCall(sig, func, arguments);
+ };
+ }
+ return Runtime.funcWrappers[func];
+ },
+ UTF8Processor: function () {
+ var buffer = [];
+ var needed = 0;
+ this.processCChar = function (code) {
+ code = code & 0xFF;
+
+ if (buffer.length == 0) {
+ if ((code & 0x80) == 0x00) { // 0xxxxxxx
+ return String.fromCharCode(code);
+ }
+ buffer.push(code);
+ if ((code & 0xE0) == 0xC0) { // 110xxxxx
+ needed = 1;
+ } else if ((code & 0xF0) == 0xE0) { // 1110xxxx
+ needed = 2;
+ } else { // 11110xxx
+ needed = 3;
+ }
+ return '';
+ }
+
+ if (needed) {
+ buffer.push(code);
+ needed--;
+ if (needed > 0) return '';
+ }
+
+ var c1 = buffer[0];
+ var c2 = buffer[1];
+ var c3 = buffer[2];
+ var c4 = buffer[3];
+ var ret;
+ if (buffer.length == 2) {
+ ret = String.fromCharCode(((c1 & 0x1F) << 6) | (c2 & 0x3F));
+ } else if (buffer.length == 3) {
+ ret = String.fromCharCode(((c1 & 0x0F) << 12) | ((c2 & 0x3F) << 6) | (c3 & 0x3F));
+ } else {
+ // http://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae
+ var codePoint = ((c1 & 0x07) << 18) | ((c2 & 0x3F) << 12) |
+ ((c3 & 0x3F) << 6) | (c4 & 0x3F);
+ ret = String.fromCharCode(
+ Math.floor((codePoint - 0x10000) / 0x400) + 0xD800,
+ (codePoint - 0x10000) % 0x400 + 0xDC00);
+ }
+ buffer.length = 0;
+ return ret;
+ }
+ this.processJSString = function processJSString(string) {
+ /* TODO: use TextEncoder when present,
+ var encoder = new TextEncoder();
+ encoder['encoding'] = "utf-8";
+ var utf8Array = encoder['encode'](aMsg.data);
+ */
+ string = unescape(encodeURIComponent(string));
+ var ret = [];
+ for (var i = 0; i < string.length; i++) {
+ ret.push(string.charCodeAt(i));
+ }
+ return ret;
+ }
+ },
+ getCompilerSetting: function (name) {
+ throw 'You must build with -s RETAIN_COMPILER_SETTINGS=1 for Runtime.getCompilerSetting or emscripten_get_compiler_setting to work';
+ },
+ stackAlloc: function (size) { var ret = STACKTOP;STACKTOP = (STACKTOP + size)|0;STACKTOP = (((STACKTOP)+7)&-8); return ret; },
+ staticAlloc: function (size) { var ret = STATICTOP;STATICTOP = (STATICTOP + size)|0;STATICTOP = (((STATICTOP)+7)&-8); return ret; },
+ dynamicAlloc: function (size) { var ret = DYNAMICTOP;DYNAMICTOP = (DYNAMICTOP + size)|0;DYNAMICTOP = (((DYNAMICTOP)+7)&-8); if (DYNAMICTOP >= TOTAL_MEMORY) enlargeMemory();; return ret; },
+ alignMemory: function (size,quantum) { var ret = size = Math.ceil((size)/(quantum ? quantum : 8))*(quantum ? quantum : 8); return ret; },
+ makeBigInt: function (low,high,unsigned) { var ret = (unsigned ? ((+((low>>>0)))+((+((high>>>0)))*(+4294967296))) : ((+((low>>>0)))+((+((high|0)))*(+4294967296)))); return ret; },
+ GLOBAL_BASE: 8,
+ QUANTUM_SIZE: 4,
+ __dummy__: 0
+}
+
+
+Module['Runtime'] = Runtime;
+
+
+
+
+
+
+
+
+
+//========================================
+// Runtime essentials
+//========================================
+
+var __THREW__ = 0; // Used in checking for thrown exceptions.
+
+var ABORT = false; // whether we are quitting the application. no code should run after this. set in exit() and abort()
+var EXITSTATUS = 0;
+
+var undef = 0;
+// tempInt is used for 32-bit signed values or smaller. tempBigInt is used
+// for 32-bit unsigned values or more than 32 bits. TODO: audit all uses of tempInt
+var tempValue, tempInt, tempBigInt, tempInt2, tempBigInt2, tempPair, tempBigIntI, tempBigIntR, tempBigIntS, tempBigIntP, tempBigIntD, tempDouble, tempFloat;
+var tempI64, tempI64b;
+var tempRet0, tempRet1, tempRet2, tempRet3, tempRet4, tempRet5, tempRet6, tempRet7, tempRet8, tempRet9;
+
+function assert(condition, text) {
+ if (!condition) {
+ abort('Assertion failed: ' + text);
+ }
+}
+
+var globalScope = this;
+
+// C calling interface. A convenient way to call C functions (in C files, or
+// defined with extern "C").
+//
+// Note: LLVM optimizations can inline and remove functions, after which you will not be
+// able to call them. Closure can also do so. To avoid that, add your function to
+// the exports using something like
+//
+// -s EXPORTED_FUNCTIONS='["_main", "_myfunc"]'
+//
+// @param ident The name of the C function (note that C++ functions will be name-mangled - use extern "C")
+// @param returnType The return type of the function, one of the JS types 'number', 'string' or 'array' (use 'number' for any C pointer, and
+// 'array' for JavaScript arrays and typed arrays; note that arrays are 8-bit).
+// @param argTypes An array of the types of arguments for the function (if there are no arguments, this can be ommitted). Types are as in returnType,
+// except that 'array' is not possible (there is no way for us to know the length of the array)
+// @param args An array of the arguments to the function, as native JS values (as in returnType)
+// Note that string arguments will be stored on the stack (the JS string will become a C string on the stack).
+// @return The return value, as a native JS value (as in returnType)
+function ccall(ident, returnType, argTypes, args) {
+ return ccallFunc(getCFunc(ident), returnType, argTypes, args);
+}
+Module["ccall"] = ccall;
+
+// Returns the C function with a specified identifier (for C++, you need to do manual name mangling)
+function getCFunc(ident) {
+ try {
+ var func = Module['_' + ident]; // closure exported function
+ if (!func) func = eval('_' + ident); // explicit lookup
+ } catch(e) {
+ }
+ assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');
+ return func;
+}
+
+// Internal function that does a C call using a function, not an identifier
+function ccallFunc(func, returnType, argTypes, args) {
+ var stack = 0;
+ function toC(value, type) {
+ if (type == 'string') {
+ if (value === null || value === undefined || value === 0) return 0; // null string
+ value = intArrayFromString(value);
+ type = 'array';
+ }
+ if (type == 'array') {
+ if (!stack) stack = Runtime.stackSave();
+ var ret = Runtime.stackAlloc(value.length);
+ writeArrayToMemory(value, ret);
+ return ret;
+ }
+ return value;
+ }
+ function fromC(value, type) {
+ if (type == 'string') {
+ return Pointer_stringify(value);
+ }
+ assert(type != 'array');
+ return value;
+ }
+ var i = 0;
+ var cArgs = args ? args.map(function(arg) {
+ return toC(arg, argTypes[i++]);
+ }) : [];
+ var ret = fromC(func.apply(null, cArgs), returnType);
+ if (stack) Runtime.stackRestore(stack);
+ return ret;
+}
+
+// Returns a native JS wrapper for a C function. This is similar to ccall, but
+// returns a function you can call repeatedly in a normal way. For example:
+//
+// var my_function = cwrap('my_c_function', 'number', ['number', 'number']);
+// alert(my_function(5, 22));
+// alert(my_function(99, 12));
+//
+function cwrap(ident, returnType, argTypes) {
+ var func = getCFunc(ident);
+ return function() {
+ return ccallFunc(func, returnType, argTypes, Array.prototype.slice.call(arguments));
+ }
+}
+Module["cwrap"] = cwrap;
+
+// Sets a value in memory in a dynamic way at run-time. Uses the
+// type data. This is the same as makeSetValue, except that
+// makeSetValue is done at compile-time and generates the needed
+// code then, whereas this function picks the right code at
+// run-time.
+// Note that setValue and getValue only do *aligned* writes and reads!
+// Note that ccall uses JS types as for defining types, while setValue and
+// getValue need LLVM types ('i8', 'i32') - this is a lower-level operation
+function setValue(ptr, value, type, noSafe) {
+ type = type || 'i8';
+ if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
+ switch(type) {
+ case 'i1': HEAP8[(ptr)]=value; break;
+ case 'i8': HEAP8[(ptr)]=value; break;
+ case 'i16': HEAP16[((ptr)>>1)]=value; break;
+ case 'i32': HEAP32[((ptr)>>2)]=value; break;
+ case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;
+ case 'float': HEAPF32[((ptr)>>2)]=value; break;
+ case 'double': HEAPF64[((ptr)>>3)]=value; break;
+ default: abort('invalid type for setValue: ' + type);
+ }
+}
+Module['setValue'] = setValue;
+
+// Parallel to setValue.
+function getValue(ptr, type, noSafe) {
+ type = type || 'i8';
+ if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
+ switch(type) {
+ case 'i1': return HEAP8[(ptr)];
+ case 'i8': return HEAP8[(ptr)];
+ case 'i16': return HEAP16[((ptr)>>1)];
+ case 'i32': return HEAP32[((ptr)>>2)];
+ case 'i64': return HEAP32[((ptr)>>2)];
+ case 'float': return HEAPF32[((ptr)>>2)];
+ case 'double': return HEAPF64[((ptr)>>3)];
+ default: abort('invalid type for setValue: ' + type);
+ }
+ return null;
+}
+Module['getValue'] = getValue;
+
+var ALLOC_NORMAL = 0; // Tries to use _malloc()
+var ALLOC_STACK = 1; // Lives for the duration of the current function call
+var ALLOC_STATIC = 2; // Cannot be freed
+var ALLOC_DYNAMIC = 3; // Cannot be freed except through sbrk
+var ALLOC_NONE = 4; // Do not allocate
+Module['ALLOC_NORMAL'] = ALLOC_NORMAL;
+Module['ALLOC_STACK'] = ALLOC_STACK;
+Module['ALLOC_STATIC'] = ALLOC_STATIC;
+Module['ALLOC_DYNAMIC'] = ALLOC_DYNAMIC;
+Module['ALLOC_NONE'] = ALLOC_NONE;
+
+// allocate(): This is for internal use. You can use it yourself as well, but the interface
+// is a little tricky (see docs right below). The reason is that it is optimized
+// for multiple syntaxes to save space in generated code. So you should
+// normally not use allocate(), and instead allocate memory using _malloc(),
+// initialize it with setValue(), and so forth.
+// @slab: An array of data, or a number. If a number, then the size of the block to allocate,
+// in *bytes* (note that this is sometimes confusing: the next parameter does not
+// affect this!)
+// @types: Either an array of types, one for each byte (or 0 if no type at that position),
+// or a single type which is used for the entire block. This only matters if there
+// is initial data - if @slab is a number, then this does not matter at all and is
+// ignored.
+// @allocator: How to allocate memory, see ALLOC_*
+function allocate(slab, types, allocator, ptr) {
+ var zeroinit, size;
+ if (typeof slab === 'number') {
+ zeroinit = true;
+ size = slab;
+ } else {
+ zeroinit = false;
+ size = slab.length;
+ }
+
+ var singleType = typeof types === 'string' ? types : null;
+
+ var ret;
+ if (allocator == ALLOC_NONE) {
+ ret = ptr;
+ } else {
+ ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));
+ }
+
+ if (zeroinit) {
+ var ptr = ret, stop;
+ assert((ret & 3) == 0);
+ stop = ret + (size & ~3);
+ for (; ptr < stop; ptr += 4) {
+ HEAP32[((ptr)>>2)]=0;
+ }
+ stop = ret + size;
+ while (ptr < stop) {
+ HEAP8[((ptr++)|0)]=0;
+ }
+ return ret;
+ }
+
+ if (singleType === 'i8') {
+ if (slab.subarray || slab.slice) {
+ HEAPU8.set(slab, ret);
+ } else {
+ HEAPU8.set(new Uint8Array(slab), ret);
+ }
+ return ret;
+ }
+
+ var i = 0, type, typeSize, previousType;
+ while (i < size) {
+ var curr = slab[i];
+
+ if (typeof curr === 'function') {
+ curr = Runtime.getFunctionIndex(curr);
+ }
+
+ type = singleType || types[i];
+ if (type === 0) {
+ i++;
+ continue;
+ }
+
+ if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later
+
+ setValue(ret+i, curr, type);
+
+ // no need to look up size unless type changes, so cache it
+ if (previousType !== type) {
+ typeSize = Runtime.getNativeTypeSize(type);
+ previousType = type;
+ }
+ i += typeSize;
+ }
+
+ return ret;
+}
+Module['allocate'] = allocate;
+
+function Pointer_stringify(ptr, /* optional */ length) {
+ // TODO: use TextDecoder
+ // Find the length, and check for UTF while doing so
+ var hasUtf = false;
+ var t;
+ var i = 0;
+ while (1) {
+ t = HEAPU8[(((ptr)+(i))|0)];
+ if (t >= 128) hasUtf = true;
+ else if (t == 0 && !length) break;
+ i++;
+ if (length && i == length) break;
+ }
+ if (!length) length = i;
+
+ var ret = '';
+
+ if (!hasUtf) {
+ var MAX_CHUNK = 1024; // split up into chunks, because .apply on a huge string can overflow the stack
+ var curr;
+ while (length > 0) {
+ curr = String.fromCharCode.apply(String, HEAPU8.subarray(ptr, ptr + Math.min(length, MAX_CHUNK)));
+ ret = ret ? ret + curr : curr;
+ ptr += MAX_CHUNK;
+ length -= MAX_CHUNK;
+ }
+ return ret;
+ }
+
+ var utf8 = new Runtime.UTF8Processor();
+ for (i = 0; i < length; i++) {
+ t = HEAPU8[(((ptr)+(i))|0)];
+ ret += utf8.processCChar(t);
+ }
+ return ret;
+}
+Module['Pointer_stringify'] = Pointer_stringify;
+
+// Given a pointer 'ptr' to a null-terminated UTF16LE-encoded string in the emscripten HEAP, returns
+// a copy of that string as a Javascript String object.
+function UTF16ToString(ptr) {
+ var i = 0;
+
+ var str = '';
+ while (1) {
+ var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];
+ if (codeUnit == 0)
+ return str;
+ ++i;
+ // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.
+ str += String.fromCharCode(codeUnit);
+ }
+}
+Module['UTF16ToString'] = UTF16ToString;
+
+// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
+// null-terminated and encoded in UTF16LE form. The copy will require at most (str.length*2+1)*2 bytes of space in the HEAP.
+function stringToUTF16(str, outPtr) {
+ for(var i = 0; i < str.length; ++i) {
+ // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.
+ var codeUnit = str.charCodeAt(i); // possibly a lead surrogate
+ HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;
+ }
+ // Null-terminate the pointer to the HEAP.
+ HEAP16[(((outPtr)+(str.length*2))>>1)]=0;
+}
+Module['stringToUTF16'] = stringToUTF16;
+
+// Given a pointer 'ptr' to a null-terminated UTF32LE-encoded string in the emscripten HEAP, returns
+// a copy of that string as a Javascript String object.
+function UTF32ToString(ptr) {
+ var i = 0;
+
+ var str = '';
+ while (1) {
+ var utf32 = HEAP32[(((ptr)+(i*4))>>2)];
+ if (utf32 == 0)
+ return str;
+ ++i;
+ // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.
+ if (utf32 >= 0x10000) {
+ var ch = utf32 - 0x10000;
+ str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));
+ } else {
+ str += String.fromCharCode(utf32);
+ }
+ }
+}
+Module['UTF32ToString'] = UTF32ToString;
+
+// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
+// null-terminated and encoded in UTF32LE form. The copy will require at most (str.length+1)*4 bytes of space in the HEAP,
+// but can use less, since str.length does not return the number of characters in the string, but the number of UTF-16 code units in the string.
+function stringToUTF32(str, outPtr) {
+ var iChar = 0;
+ for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {
+ // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.
+ var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate
+ if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {
+ var trailSurrogate = str.charCodeAt(++iCodeUnit);
+ codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);
+ }
+ HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;
+ ++iChar;
+ }
+ // Null-terminate the pointer to the HEAP.
+ HEAP32[(((outPtr)+(iChar*4))>>2)]=0;
+}
+Module['stringToUTF32'] = stringToUTF32;
+
+function demangle(func) {
+ var i = 3;
+ // params, etc.
+ var basicTypes = {
+ 'v': 'void',
+ 'b': 'bool',
+ 'c': 'char',
+ 's': 'short',
+ 'i': 'int',
+ 'l': 'long',
+ 'f': 'float',
+ 'd': 'double',
+ 'w': 'wchar_t',
+ 'a': 'signed char',
+ 'h': 'unsigned char',
+ 't': 'unsigned short',
+ 'j': 'unsigned int',
+ 'm': 'unsigned long',
+ 'x': 'long long',
+ 'y': 'unsigned long long',
+ 'z': '...'
+ };
+ var subs = [];
+ var first = true;
+ function dump(x) {
+ //return;
+ if (x) Module.print(x);
+ Module.print(func);
+ var pre = '';
+ for (var a = 0; a < i; a++) pre += ' ';
+ Module.print (pre + '^');
+ }
+ function parseNested() {
+ i++;
+ if (func[i] === 'K') i++; // ignore const
+ var parts = [];
+ while (func[i] !== 'E') {
+ if (func[i] === 'S') { // substitution
+ i++;
+ var next = func.indexOf('_', i);
+ var num = func.substring(i, next) || 0;
+ parts.push(subs[num] || '?');
+ i = next+1;
+ continue;
+ }
+ if (func[i] === 'C') { // constructor
+ parts.push(parts[parts.length-1]);
+ i += 2;
+ continue;
+ }
+ var size = parseInt(func.substr(i));
+ var pre = size.toString().length;
+ if (!size || !pre) { i--; break; } // counter i++ below us
+ var curr = func.substr(i + pre, size);
+ parts.push(curr);
+ subs.push(curr);
+ i += pre + size;
+ }
+ i++; // skip E
+ return parts;
+ }
+ function parse(rawList, limit, allowVoid) { // main parser
+ limit = limit || Infinity;
+ var ret = '', list = [];
+ function flushList() {
+ return '(' + list.join(', ') + ')';
+ }
+ var name;
+ if (func[i] === 'N') {
+ // namespaced N-E
+ name = parseNested().join('::');
+ limit--;
+ if (limit === 0) return rawList ? [name] : name;
+ } else {
+ // not namespaced
+ if (func[i] === 'K' || (first && func[i] === 'L')) i++; // ignore const and first 'L'
+ var size = parseInt(func.substr(i));
+ if (size) {
+ var pre = size.toString().length;
+ name = func.substr(i + pre, size);
+ i += pre + size;
+ }
+ }
+ first = false;
+ if (func[i] === 'I') {
+ i++;
+ var iList = parse(true);
+ var iRet = parse(true, 1, true);
+ ret += iRet[0] + ' ' + name + '<' + iList.join(', ') + '>';
+ } else {
+ ret = name;
+ }
+ paramLoop: while (i < func.length && limit-- > 0) {
+ //dump('paramLoop');
+ var c = func[i++];
+ if (c in basicTypes) {
+ list.push(basicTypes[c]);
+ } else {
+ switch (c) {
+ case 'P': list.push(parse(true, 1, true)[0] + '*'); break; // pointer
+ case 'R': list.push(parse(true, 1, true)[0] + '&'); break; // reference
+ case 'L': { // literal
+ i++; // skip basic type
+ var end = func.indexOf('E', i);
+ var size = end - i;
+ list.push(func.substr(i, size));
+ i += size + 2; // size + 'EE'
+ break;
+ }
+ case 'A': { // array
+ var size = parseInt(func.substr(i));
+ i += size.toString().length;
+ if (func[i] !== '_') throw '?';
+ i++; // skip _
+ list.push(parse(true, 1, true)[0] + ' [' + size + ']');
+ break;
+ }
+ case 'E': break paramLoop;
+ default: ret += '?' + c; break paramLoop;
+ }
+ }
+ }
+ if (!allowVoid && list.length === 1 && list[0] === 'void') list = []; // avoid (void)
+ if (rawList) {
+ if (ret) {
+ list.push(ret + '?');
+ }
+ return list;
+ } else {
+ return ret + flushList();
+ }
+ }
+ try {
+ // Special-case the entry point, since its name differs from other name mangling.
+ if (func == 'Object._main' || func == '_main') {
+ return 'main()';
+ }
+ if (typeof func === 'number') func = Pointer_stringify(func);
+ if (func[0] !== '_') return func;
+ if (func[1] !== '_') return func; // C function
+ if (func[2] !== 'Z') return func;
+ switch (func[3]) {
+ case 'n': return 'operator new()';
+ case 'd': return 'operator delete()';
+ }
+ return parse();
+ } catch(e) {
+ return func;
+ }
+}
+
+function demangleAll(text) {
+ return text.replace(/__Z[\w\d_]+/g, function(x) { var y = demangle(x); return x === y ? x : (x + ' [' + y + ']') });
+}
+
+function stackTrace() {
+ var stack = new Error().stack;
+ return stack ? demangleAll(stack) : '(no stack trace available)'; // Stack trace is not available at least on IE10 and Safari 6.
+}
+
+// Memory management
+
+var PAGE_SIZE = 4096;
+function alignMemoryPage(x) {
+ return (x+4095)&-4096;
+}
+
+var HEAP;
+var HEAP8, HEAPU8, HEAP16, HEAPU16, HEAP32, HEAPU32, HEAPF32, HEAPF64;
+
+var STATIC_BASE = 0, STATICTOP = 0, staticSealed = false; // static area
+var STACK_BASE = 0, STACKTOP = 0, STACK_MAX = 0; // stack area
+var DYNAMIC_BASE = 0, DYNAMICTOP = 0; // dynamic area handled by sbrk
+
+function enlargeMemory() {
+ abort('Cannot enlarge memory arrays. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value ' + TOTAL_MEMORY + ', (2) compile with ALLOW_MEMORY_GROWTH which adjusts the size at runtime but prevents some optimizations, or (3) set Module.TOTAL_MEMORY before the program runs.');
+}
+
+var TOTAL_STACK = Module['TOTAL_STACK'] || 5242880;
+var TOTAL_MEMORY = Module['TOTAL_MEMORY'] || 134217728;
+var FAST_MEMORY = Module['FAST_MEMORY'] || 2097152;
+
+var totalMemory = 4096;
+while (totalMemory < TOTAL_MEMORY || totalMemory < 2*TOTAL_STACK) {
+ if (totalMemory < 16*1024*1024) {
+ totalMemory *= 2;
+ } else {
+ totalMemory += 16*1024*1024
+ }
+}
+if (totalMemory !== TOTAL_MEMORY) {
+ Module.printErr('increasing TOTAL_MEMORY to ' + totalMemory + ' to be more reasonable');
+ TOTAL_MEMORY = totalMemory;
+}
+
+// Initialize the runtime's memory
+// check for full engine support (use string 'subarray' to avoid closure compiler confusion)
+assert(typeof Int32Array !== 'undefined' && typeof Float64Array !== 'undefined' && !!(new Int32Array(1)['subarray']) && !!(new Int32Array(1)['set']),
+ 'JS engine does not provide full typed array support');
+
+var buffer = new ArrayBuffer(TOTAL_MEMORY);
+HEAP8 = new Int8Array(buffer);
+HEAP16 = new Int16Array(buffer);
+HEAP32 = new Int32Array(buffer);
+HEAPU8 = new Uint8Array(buffer);
+HEAPU16 = new Uint16Array(buffer);
+HEAPU32 = new Uint32Array(buffer);
+HEAPF32 = new Float32Array(buffer);
+HEAPF64 = new Float64Array(buffer);
+
+// Endianness check (note: assumes compiler arch was little-endian)
+HEAP32[0] = 255;
+assert(HEAPU8[0] === 255 && HEAPU8[3] === 0, 'Typed arrays 2 must be run on a little-endian system');
+
+Module['HEAP'] = HEAP;
+Module['HEAP8'] = HEAP8;
+Module['HEAP16'] = HEAP16;
+Module['HEAP32'] = HEAP32;
+Module['HEAPU8'] = HEAPU8;
+Module['HEAPU16'] = HEAPU16;
+Module['HEAPU32'] = HEAPU32;
+Module['HEAPF32'] = HEAPF32;
+Module['HEAPF64'] = HEAPF64;
+
+function callRuntimeCallbacks(callbacks) {
+ while(callbacks.length > 0) {
+ var callback = callbacks.shift();
+ if (typeof callback == 'function') {
+ callback();
+ continue;
+ }
+ var func = callback.func;
+ if (typeof func === 'number') {
+ if (callback.arg === undefined) {
+ Runtime.dynCall('v', func);
+ } else {
+ Runtime.dynCall('vi', func, [callback.arg]);
+ }
+ } else {
+ func(callback.arg === undefined ? null : callback.arg);
+ }
+ }
+}
+
+var __ATPRERUN__ = []; // functions called before the runtime is initialized
+var __ATINIT__ = []; // functions called during startup
+var __ATMAIN__ = []; // functions called when main() is to be run
+var __ATEXIT__ = []; // functions called during shutdown
+var __ATPOSTRUN__ = []; // functions called after the runtime has exited
+
+var runtimeInitialized = false;
+
+function preRun() {
+ // compatibility - merge in anything from Module['preRun'] at this time
+ if (Module['preRun']) {
+ if (typeof Module['preRun'] == 'function') Module['preRun'] = [Module['preRun']];
+ while (Module['preRun'].length) {
+ addOnPreRun(Module['preRun'].shift());
+ }
+ }
+ callRuntimeCallbacks(__ATPRERUN__);
+}
+
+function ensureInitRuntime() {
+ if (runtimeInitialized) return;
+ runtimeInitialized = true;
+ callRuntimeCallbacks(__ATINIT__);
+}
+
+function preMain() {
+ callRuntimeCallbacks(__ATMAIN__);
+}
+
+function exitRuntime() {
+ callRuntimeCallbacks(__ATEXIT__);
+}
+
+function postRun() {
+ // compatibility - merge in anything from Module['postRun'] at this time
+ if (Module['postRun']) {
+ if (typeof Module['postRun'] == 'function') Module['postRun'] = [Module['postRun']];
+ while (Module['postRun'].length) {
+ addOnPostRun(Module['postRun'].shift());
+ }
+ }
+ callRuntimeCallbacks(__ATPOSTRUN__);
+}
+
+function addOnPreRun(cb) {
+ __ATPRERUN__.unshift(cb);
+}
+Module['addOnPreRun'] = Module.addOnPreRun = addOnPreRun;
+
+function addOnInit(cb) {
+ __ATINIT__.unshift(cb);
+}
+Module['addOnInit'] = Module.addOnInit = addOnInit;
+
+function addOnPreMain(cb) {
+ __ATMAIN__.unshift(cb);
+}
+Module['addOnPreMain'] = Module.addOnPreMain = addOnPreMain;
+
+function addOnExit(cb) {
+ __ATEXIT__.unshift(cb);
+}
+Module['addOnExit'] = Module.addOnExit = addOnExit;
+
+function addOnPostRun(cb) {
+ __ATPOSTRUN__.unshift(cb);
+}
+Module['addOnPostRun'] = Module.addOnPostRun = addOnPostRun;
+
+// Tools
+
+// This processes a JS string into a C-line array of numbers, 0-terminated.
+// For LLVM-originating strings, see parser.js:parseLLVMString function
+function intArrayFromString(stringy, dontAddNull, length /* optional */) {
+ var ret = (new Runtime.UTF8Processor()).processJSString(stringy);
+ if (length) {
+ ret.length = length;
+ }
+ if (!dontAddNull) {
+ ret.push(0);
+ }
+ return ret;
+}
+Module['intArrayFromString'] = intArrayFromString;
+
+function intArrayToString(array) {
+ var ret = [];
+ for (var i = 0; i < array.length; i++) {
+ var chr = array[i];
+ if (chr > 0xFF) {
+ chr &= 0xFF;
+ }
+ ret.push(String.fromCharCode(chr));
+ }
+ return ret.join('');
+}
+Module['intArrayToString'] = intArrayToString;
+
+// Write a Javascript array to somewhere in the heap
+function writeStringToMemory(string, buffer, dontAddNull) {
+ var array = intArrayFromString(string, dontAddNull);
+ var i = 0;
+ while (i < array.length) {
+ var chr = array[i];
+ HEAP8[(((buffer)+(i))|0)]=chr;
+ i = i + 1;
+ }
+}
+Module['writeStringToMemory'] = writeStringToMemory;
+
+function writeArrayToMemory(array, buffer) {
+ for (var i = 0; i < array.length; i++) {
+ HEAP8[(((buffer)+(i))|0)]=array[i];
+ }
+}
+Module['writeArrayToMemory'] = writeArrayToMemory;
+
+function writeAsciiToMemory(str, buffer, dontAddNull) {
+ for (var i = 0; i < str.length; i++) {
+ HEAP8[(((buffer)+(i))|0)]=str.charCodeAt(i);
+ }
+ if (!dontAddNull) HEAP8[(((buffer)+(str.length))|0)]=0;
+}
+Module['writeAsciiToMemory'] = writeAsciiToMemory;
+
+function unSign(value, bits, ignore) {
+ if (value >= 0) {
+ return value;
+ }
+ return bits <= 32 ? 2*Math.abs(1 << (bits-1)) + value // Need some trickery, since if bits == 32, we are right at the limit of the bits JS uses in bitshifts
+ : Math.pow(2, bits) + value;
+}
+function reSign(value, bits, ignore) {
+ if (value <= 0) {
+ return value;
+ }
+ var half = bits <= 32 ? Math.abs(1 << (bits-1)) // abs is needed if bits == 32
+ : Math.pow(2, bits-1);
+ if (value >= half && (bits <= 32 || value > half)) { // for huge values, we can hit the precision limit and always get true here. so don't do that
+ // but, in general there is no perfect solution here. With 64-bit ints, we get rounding and errors
+ // TODO: In i64 mode 1, resign the two parts separately and safely
+ value = -2*half + value; // Cannot bitshift half, as it may be at the limit of the bits JS uses in bitshifts
+ }
+ return value;
+}
+
+// check for imul support, and also for correctness ( https://bugs.webkit.org/show_bug.cgi?id=126345 )
+if (!Math['imul'] || Math['imul'](0xffffffff, 5) !== -5) Math['imul'] = function imul(a, b) {
+ var ah = a >>> 16;
+ var al = a & 0xffff;
+ var bh = b >>> 16;
+ var bl = b & 0xffff;
+ return (al*bl + ((ah*bl + al*bh) << 16))|0;
+};
+Math.imul = Math['imul'];
+
+
+var Math_abs = Math.abs;
+var Math_cos = Math.cos;
+var Math_sin = Math.sin;
+var Math_tan = Math.tan;
+var Math_acos = Math.acos;
+var Math_asin = Math.asin;
+var Math_atan = Math.atan;
+var Math_atan2 = Math.atan2;
+var Math_exp = Math.exp;
+var Math_log = Math.log;
+var Math_sqrt = Math.sqrt;
+var Math_ceil = Math.ceil;
+var Math_floor = Math.floor;
+var Math_pow = Math.pow;
+var Math_imul = Math.imul;
+var Math_fround = Math.fround;
+var Math_min = Math.min;
+
+// A counter of dependencies for calling run(). If we need to
+// do asynchronous work before running, increment this and
+// decrement it. Incrementing must happen in a place like
+// PRE_RUN_ADDITIONS (used by emcc to add file preloading).
+// Note that you can add dependencies in preRun, even though
+// it happens right before run - run will be postponed until
+// the dependencies are met.
+var runDependencies = 0;
+var runDependencyWatcher = null;
+var dependenciesFulfilled = null; // overridden to take different actions when all run dependencies are fulfilled
+
+function addRunDependency(id) {
+ runDependencies++;
+ if (Module['monitorRunDependencies']) {
+ Module['monitorRunDependencies'](runDependencies);
+ }
+}
+Module['addRunDependency'] = addRunDependency;
+function removeRunDependency(id) {
+ runDependencies--;
+ if (Module['monitorRunDependencies']) {
+ Module['monitorRunDependencies'](runDependencies);
+ }
+ if (runDependencies == 0) {
+ if (runDependencyWatcher !== null) {
+ clearInterval(runDependencyWatcher);
+ runDependencyWatcher = null;
+ }
+ if (dependenciesFulfilled) {
+ var callback = dependenciesFulfilled;
+ dependenciesFulfilled = null;
+ callback(); // can add another dependenciesFulfilled
+ }
+ }
+}
+Module['removeRunDependency'] = removeRunDependency;
+
+Module["preloadedImages"] = {}; // maps url to image data
+Module["preloadedAudios"] = {}; // maps url to audio data
+
+
+var memoryInitializer = null;
+
+// === Body ===
+
+
+
+
+
+STATIC_BASE = 8;
+
+STATICTOP = STATIC_BASE + Runtime.alignMemory(1155);
+/* global initializers */ __ATINIT__.push();
+
+
+/* memory initializer */ allocate([38,2,0,0,0,0,0,0,42,0,0,0,0,0,0,0,97,0,0,0,113,61,138,62,0,0,0,0,99,0,0,0,143,194,245,61,0,0,0,0,103,0,0,0,143,194,245,61,0,0,0,0,116,0,0,0,113,61,138,62,0,0,0,0,66,0,0,0,10,215,163,60,0,0,0,0,68,0,0,0,10,215,163,60,0,0,0,0,72,0,0,0,10,215,163,60,0,0,0,0,75,0,0,0,10,215,163,60,0,0,0,0,77,0,0,0,10,215,163,60,0,0,0,0,78,0,0,0,10,215,163,60,0,0,0,0,82,0,0,0,10,215,163,60,0,0,0,0,83,0,0,0,10,215,163,60,0,0,0,0,86,0,0,0,10,215,163,60,0,0,0,0,87,0,0,0,10,215,163,60,0,0,0,0,89,0,0,0,10,215,163,60,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,97,0,0,0,233,28,155,62,0,0,0,0,99,0,0,0,114,189,74,62,0,0,0,0,103,0,0,0,215,73,74,62,0,0,0,0,116,0,0,0,114,95,154,62,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,101,114,114,111,114,58,32,37,100,10,0,0,0,0,0,0,71,71,67,67,71,71,71,67,71,67,71,71,84,71,71,67,84,67,65,67,71,67,67,84,71,84,65,65,84,67,67,67,65,71,67,65,67,84,84,84,71,71,71,65,71,71,67,67,71,65,71,71,67,71,71,71,67,71,71,65,84,67,65,67,67,84,71,65,71,71,84,67,65,71,71,65,71,84,84,67,71,65,71,65,67,67,65,71,67,67,84,71,71,67,67,65,65,67,65,84,71,71,84,71,65,65,65,67,67,67,67,71,84,67,84,67,84,65,67,84,65,65,65,65,65,84,65,67,65,65,65,65,65,84,84,65,71,67,67,71,71,71,67,71,84,71,71,84,71,71,67,71,67,71,67,71,67,67,84,71,84,65,65,84,67,67,67,65,71,67,84,65,67,84,67,71,71,71,65,71,71,67,84,71,65,71,71,67,65,71,71,65,71,65,65,84,67,71,67,84,84,71,65,65,67,67,67,71,71,71,65,71,71,67,71,71,65,71,71,84,84,71,67,65,71,84,71,65,71,67,67,71,65,71,65,84,67,71,67,71,67,67,65,67,84,71,67,65,67,84,67,67,65,71,67,67,84,71,71,71,67,71,65,67,65,71,65,71,67,71,65,71,65,67,84,67,67,71,84,67,84,67,65,65,65,65,65,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,120,4,0,0,1,0,0,0,2,0,0,0,1,0,0,0,0,0,0,0,115,116,100,58,58,98,97,100,95,97,108,108,111,99,0,0,83,116,57,98,97,100,95,97,108,108,111,99,0,0,0,0,8,0,0,0,104,4,0,0,0,0,0,0,0,0,0,0], "i8", ALLOC_NONE, Runtime.GLOBAL_BASE);
+
+
+
+
+var tempDoublePtr = Runtime.alignMemory(allocate(12, "i8", ALLOC_STATIC), 8);
+
+assert(tempDoublePtr % 8 == 0);
+
+function copyTempFloat(ptr) { // functions, because inlining this code increases code size too much
+
+ HEAP8[tempDoublePtr] = HEAP8[ptr];
+
+ HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
+
+ HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
+
+ HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
+
+}
+
+function copyTempDouble(ptr) {
+
+ HEAP8[tempDoublePtr] = HEAP8[ptr];
+
+ HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
+
+ HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
+
+ HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
+
+ HEAP8[tempDoublePtr+4] = HEAP8[ptr+4];
+
+ HEAP8[tempDoublePtr+5] = HEAP8[ptr+5];
+
+ HEAP8[tempDoublePtr+6] = HEAP8[ptr+6];
+
+ HEAP8[tempDoublePtr+7] = HEAP8[ptr+7];
+
+}
+
+
+
+
+ var ___errno_state=0;function ___setErrNo(value) {
+ // For convenient setting and returning of errno.
+ HEAP32[((___errno_state)>>2)]=value;
+ return value;
+ }
+
+ var ERRNO_CODES={EPERM:1,ENOENT:2,ESRCH:3,EINTR:4,EIO:5,ENXIO:6,E2BIG:7,ENOEXEC:8,EBADF:9,ECHILD:10,EAGAIN:11,EWOULDBLOCK:11,ENOMEM:12,EACCES:13,EFAULT:14,ENOTBLK:15,EBUSY:16,EEXIST:17,EXDEV:18,ENODEV:19,ENOTDIR:20,EISDIR:21,EINVAL:22,ENFILE:23,EMFILE:24,ENOTTY:25,ETXTBSY:26,EFBIG:27,ENOSPC:28,ESPIPE:29,EROFS:30,EMLINK:31,EPIPE:32,EDOM:33,ERANGE:34,ENOMSG:42,EIDRM:43,ECHRNG:44,EL2NSYNC:45,EL3HLT:46,EL3RST:47,ELNRNG:48,EUNATCH:49,ENOCSI:50,EL2HLT:51,EDEADLK:35,ENOLCK:37,EBADE:52,EBADR:53,EXFULL:54,ENOANO:55,EBADRQC:56,EBADSLT:57,EDEADLOCK:35,EBFONT:59,ENOSTR:60,ENODATA:61,ETIME:62,ENOSR:63,ENONET:64,ENOPKG:65,EREMOTE:66,ENOLINK:67,EADV:68,ESRMNT:69,ECOMM:70,EPROTO:71,EMULTIHOP:72,EDOTDOT:73,EBADMSG:74,ENOTUNIQ:76,EBADFD:77,EREMCHG:78,ELIBACC:79,ELIBBAD:80,ELIBSCN:81,ELIBMAX:82,ELIBEXEC:83,ENOSYS:38,ENOTEMPTY:39,ENAMETOOLONG:36,ELOOP:40,EOPNOTSUPP:95,EPFNOSUPPORT:96,ECONNRESET:104,ENOBUFS:105,EAFNOSUPPORT:97,EPROTOTYPE:91,ENOTSOCK:88,ENOPROTOOPT:92,ESHUTDOWN:108,ECONNREFUSED:111,EADDRINUSE:98,ECONNABORTED:103,ENETUNREACH:101,ENETDOWN:100,ETIMEDOUT:110,EHOSTDOWN:112,EHOSTUNREACH:113,EINPROGRESS:115,EALREADY:114,EDESTADDRREQ:89,EMSGSIZE:90,EPROTONOSUPPORT:93,ESOCKTNOSUPPORT:94,EADDRNOTAVAIL:99,ENETRESET:102,EISCONN:106,ENOTCONN:107,ETOOMANYREFS:109,EUSERS:87,EDQUOT:122,ESTALE:116,ENOTSUP:95,ENOMEDIUM:123,EILSEQ:84,EOVERFLOW:75,ECANCELED:125,ENOTRECOVERABLE:131,EOWNERDEAD:130,ESTRPIPE:86};function _sysconf(name) {
+ // long sysconf(int name);
+ // http://pubs.opengroup.org/onlinepubs/009695399/functions/sysconf.html
+ switch(name) {
+ case 30: return PAGE_SIZE;
+ case 132:
+ case 133:
+ case 12:
+ case 137:
+ case 138:
+ case 15:
+ case 235:
+ case 16:
+ case 17:
+ case 18:
+ case 19:
+ case 20:
+ case 149:
+ case 13:
+ case 10:
+ case 236:
+ case 153:
+ case 9:
+ case 21:
+ case 22:
+ case 159:
+ case 154:
+ case 14:
+ case 77:
+ case 78:
+ case 139:
+ case 80:
+ case 81:
+ case 79:
+ case 82:
+ case 68:
+ case 67:
+ case 164:
+ case 11:
+ case 29:
+ case 47:
+ case 48:
+ case 95:
+ case 52:
+ case 51:
+ case 46:
+ return 200809;
+ case 27:
+ case 246:
+ case 127:
+ case 128:
+ case 23:
+ case 24:
+ case 160:
+ case 161:
+ case 181:
+ case 182:
+ case 242:
+ case 183:
+ case 184:
+ case 243:
+ case 244:
+ case 245:
+ case 165:
+ case 178:
+ case 179:
+ case 49:
+ case 50:
+ case 168:
+ case 169:
+ case 175:
+ case 170:
+ case 171:
+ case 172:
+ case 97:
+ case 76:
+ case 32:
+ case 173:
+ case 35:
+ return -1;
+ case 176:
+ case 177:
+ case 7:
+ case 155:
+ case 8:
+ case 157:
+ case 125:
+ case 126:
+ case 92:
+ case 93:
+ case 129:
+ case 130:
+ case 131:
+ case 94:
+ case 91:
+ return 1;
+ case 74:
+ case 60:
+ case 69:
+ case 70:
+ case 4:
+ return 1024;
+ case 31:
+ case 42:
+ case 72:
+ return 32;
+ case 87:
+ case 26:
+ case 33:
+ return 2147483647;
+ case 34:
+ case 1:
+ return 47839;
+ case 38:
+ case 36:
+ return 99;
+ case 43:
+ case 37:
+ return 2048;
+ case 0: return 2097152;
+ case 3: return 65536;
+ case 28: return 32768;
+ case 44: return 32767;
+ case 75: return 16384;
+ case 39: return 1000;
+ case 89: return 700;
+ case 71: return 256;
+ case 40: return 255;
+ case 2: return 100;
+ case 180: return 64;
+ case 25: return 20;
+ case 5: return 16;
+ case 6: return 6;
+ case 73: return 4;
+ case 84: return 1;
+ }
+ ___setErrNo(ERRNO_CODES.EINVAL);
+ return -1;
+ }
+
+
+ function __ZSt18uncaught_exceptionv() { // std::uncaught_exception()
+ return !!__ZSt18uncaught_exceptionv.uncaught_exception;
+ }
+
+
+
+ function ___cxa_is_number_type(type) {
+ var isNumber = false;
+ try { if (type == __ZTIi) isNumber = true } catch(e){}
+ try { if (type == __ZTIj) isNumber = true } catch(e){}
+ try { if (type == __ZTIl) isNumber = true } catch(e){}
+ try { if (type == __ZTIm) isNumber = true } catch(e){}
+ try { if (type == __ZTIx) isNumber = true } catch(e){}
+ try { if (type == __ZTIy) isNumber = true } catch(e){}
+ try { if (type == __ZTIf) isNumber = true } catch(e){}
+ try { if (type == __ZTId) isNumber = true } catch(e){}
+ try { if (type == __ZTIe) isNumber = true } catch(e){}
+ try { if (type == __ZTIc) isNumber = true } catch(e){}
+ try { if (type == __ZTIa) isNumber = true } catch(e){}
+ try { if (type == __ZTIh) isNumber = true } catch(e){}
+ try { if (type == __ZTIs) isNumber = true } catch(e){}
+ try { if (type == __ZTIt) isNumber = true } catch(e){}
+ return isNumber;
+ }function ___cxa_does_inherit(definiteType, possibilityType, possibility) {
+ if (possibility == 0) return false;
+ if (possibilityType == 0 || possibilityType == definiteType)
+ return true;
+ var possibility_type_info;
+ if (___cxa_is_number_type(possibilityType)) {
+ possibility_type_info = possibilityType;
+ } else {
+ var possibility_type_infoAddr = HEAP32[((possibilityType)>>2)] - 8;
+ possibility_type_info = HEAP32[((possibility_type_infoAddr)>>2)];
+ }
+ switch (possibility_type_info) {
+ case 0: // possibility is a pointer
+ // See if definite type is a pointer
+ var definite_type_infoAddr = HEAP32[((definiteType)>>2)] - 8;
+ var definite_type_info = HEAP32[((definite_type_infoAddr)>>2)];
+ if (definite_type_info == 0) {
+ // Also a pointer; compare base types of pointers
+ var defPointerBaseAddr = definiteType+8;
+ var defPointerBaseType = HEAP32[((defPointerBaseAddr)>>2)];
+ var possPointerBaseAddr = possibilityType+8;
+ var possPointerBaseType = HEAP32[((possPointerBaseAddr)>>2)];
+ return ___cxa_does_inherit(defPointerBaseType, possPointerBaseType, possibility);
+ } else
+ return false; // one pointer and one non-pointer
+ case 1: // class with no base class
+ return false;
+ case 2: // class with base class
+ var parentTypeAddr = possibilityType + 8;
+ var parentType = HEAP32[((parentTypeAddr)>>2)];
+ return ___cxa_does_inherit(definiteType, parentType, possibility);
+ default:
+ return false; // some unencountered type
+ }
+ }
+
+
+
+ var ___cxa_last_thrown_exception=0;function ___resumeException(ptr) {
+ if (!___cxa_last_thrown_exception) { ___cxa_last_thrown_exception = ptr; }
+ throw ptr + " - Exception catching is disabled, this exception cannot be caught. Compile with -s DISABLE_EXCEPTION_CATCHING=0 or DISABLE_EXCEPTION_CATCHING=2 to catch.";
+ }
+
+ var ___cxa_exception_header_size=8;function ___cxa_find_matching_catch(thrown, throwntype) {
+ if (thrown == -1) thrown = ___cxa_last_thrown_exception;
+ header = thrown - ___cxa_exception_header_size;
+ if (throwntype == -1) throwntype = HEAP32[((header)>>2)];
+ var typeArray = Array.prototype.slice.call(arguments, 2);
+
+ // If throwntype is a pointer, this means a pointer has been
+ // thrown. When a pointer is thrown, actually what's thrown
+ // is a pointer to the pointer. We'll dereference it.
+ if (throwntype != 0 && !___cxa_is_number_type(throwntype)) {
+ var throwntypeInfoAddr= HEAP32[((throwntype)>>2)] - 8;
+ var throwntypeInfo= HEAP32[((throwntypeInfoAddr)>>2)];
+ if (throwntypeInfo == 0)
+ thrown = HEAP32[((thrown)>>2)];
+ }
+ // The different catch blocks are denoted by different types.
+ // Due to inheritance, those types may not precisely match the
+ // type of the thrown object. Find one which matches, and
+ // return the type of the catch block which should be called.
+ for (var i = 0; i < typeArray.length; i++) {
+ if (___cxa_does_inherit(typeArray[i], throwntype, thrown))
+ return ((asm["setTempRet0"](typeArray[i]),thrown)|0);
+ }
+ // Shouldn't happen unless we have bogus data in typeArray
+ // or encounter a type for which emscripten doesn't have suitable
+ // typeinfo defined. Best-efforts match just in case.
+ return ((asm["setTempRet0"](throwntype),thrown)|0);
+ }function ___cxa_throw(ptr, type, destructor) {
+ if (!___cxa_throw.initialized) {
+ try {
+ HEAP32[((__ZTVN10__cxxabiv119__pointer_type_infoE)>>2)]=0; // Workaround for libcxxabi integration bug
+ } catch(e){}
+ try {
+ HEAP32[((__ZTVN10__cxxabiv117__class_type_infoE)>>2)]=1; // Workaround for libcxxabi integration bug
+ } catch(e){}
+ try {
+ HEAP32[((__ZTVN10__cxxabiv120__si_class_type_infoE)>>2)]=2; // Workaround for libcxxabi integration bug
+ } catch(e){}
+ ___cxa_throw.initialized = true;
+ }
+ var header = ptr - ___cxa_exception_header_size;
+ HEAP32[((header)>>2)]=type;
+ HEAP32[(((header)+(4))>>2)]=destructor;
+ ___cxa_last_thrown_exception = ptr;
+ if (!("uncaught_exception" in __ZSt18uncaught_exceptionv)) {
+ __ZSt18uncaught_exceptionv.uncaught_exception = 1;
+ } else {
+ __ZSt18uncaught_exceptionv.uncaught_exception++;
+ }
+ throw ptr + " - Exception catching is disabled, this exception cannot be caught. Compile with -s DISABLE_EXCEPTION_CATCHING=0 or DISABLE_EXCEPTION_CATCHING=2 to catch.";
+ }
+
+
+ Module["_memset"] = _memset;
+
+ function _abort() {
+ Module['abort']();
+ }
+
+
+
+
+
+ var ERRNO_MESSAGES={0:"Success",1:"Not super-user",2:"No such file or directory",3:"No such process",4:"Interrupted system call",5:"I/O error",6:"No such device or address",7:"Arg list too long",8:"Exec format error",9:"Bad file number",10:"No children",11:"No more processes",12:"Not enough core",13:"Permission denied",14:"Bad address",15:"Block device required",16:"Mount device busy",17:"File exists",18:"Cross-device link",19:"No such device",20:"Not a directory",21:"Is a directory",22:"Invalid argument",23:"Too many open files in system",24:"Too many open files",25:"Not a typewriter",26:"Text file busy",27:"File too large",28:"No space left on device",29:"Illegal seek",30:"Read only file system",31:"Too many links",32:"Broken pipe",33:"Math arg out of domain of func",34:"Math result not representable",35:"File locking deadlock error",36:"File or path name too long",37:"No record locks available",38:"Function not implemented",39:"Directory not empty",40:"Too many symbolic links",42:"No message of desired type",43:"Identifier removed",44:"Channel number out of range",45:"Level 2 not synchronized",46:"Level 3 halted",47:"Level 3 reset",48:"Link number out of range",49:"Protocol driver not attached",50:"No CSI structure available",51:"Level 2 halted",52:"Invalid exchange",53:"Invalid request descriptor",54:"Exchange full",55:"No anode",56:"Invalid request code",57:"Invalid slot",59:"Bad font file fmt",60:"Device not a stream",61:"No data (for no delay io)",62:"Timer expired",63:"Out of streams resources",64:"Machine is not on the network",65:"Package not installed",66:"The object is remote",67:"The link has been severed",68:"Advertise error",69:"Srmount error",70:"Communication error on send",71:"Protocol error",72:"Multihop attempted",73:"Cross mount point (not really error)",74:"Trying to read unreadable message",75:"Value too large for defined data type",76:"Given log. name not unique",77:"f.d. invalid for this operation",78:"Remote address changed",79:"Can access a needed shared lib",80:"Accessing a corrupted shared lib",81:".lib section in a.out corrupted",82:"Attempting to link in too many libs",83:"Attempting to exec a shared library",84:"Illegal byte sequence",86:"Streams pipe error",87:"Too many users",88:"Socket operation on non-socket",89:"Destination address required",90:"Message too long",91:"Protocol wrong type for socket",92:"Protocol not available",93:"Unknown protocol",94:"Socket type not supported",95:"Not supported",96:"Protocol family not supported",97:"Address family not supported by protocol family",98:"Address already in use",99:"Address not available",100:"Network interface is not configured",101:"Network is unreachable",102:"Connection reset by network",103:"Connection aborted",104:"Connection reset by peer",105:"No buffer space available",106:"Socket is already connected",107:"Socket is not connected",108:"Can't send after socket shutdown",109:"Too many references",110:"Connection timed out",111:"Connection refused",112:"Host is down",113:"Host is unreachable",114:"Socket already connected",115:"Connection already in progress",116:"Stale file handle",122:"Quota exceeded",123:"No medium (in tape drive)",125:"Operation canceled",130:"Previous owner died",131:"State not recoverable"};
+
+ var PATH={splitPath:function (filename) {
+ var splitPathRe = /^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/;
+ return splitPathRe.exec(filename).slice(1);
+ },normalizeArray:function (parts, allowAboveRoot) {
+ // if the path tries to go above the root, `up` ends up > 0
+ var up = 0;
+ for (var i = parts.length - 1; i >= 0; i--) {
+ var last = parts[i];
+ if (last === '.') {
+ parts.splice(i, 1);
+ } else if (last === '..') {
+ parts.splice(i, 1);
+ up++;
+ } else if (up) {
+ parts.splice(i, 1);
+ up--;
+ }
+ }
+ // if the path is allowed to go above the root, restore leading ..s
+ if (allowAboveRoot) {
+ for (; up--; up) {
+ parts.unshift('..');
+ }
+ }
+ return parts;
+ },normalize:function (path) {
+ var isAbsolute = path.charAt(0) === '/',
+ trailingSlash = path.substr(-1) === '/';
+ // Normalize the path
+ path = PATH.normalizeArray(path.split('/').filter(function(p) {
+ return !!p;
+ }), !isAbsolute).join('/');
+ if (!path && !isAbsolute) {
+ path = '.';
+ }
+ if (path && trailingSlash) {
+ path += '/';
+ }
+ return (isAbsolute ? '/' : '') + path;
+ },dirname:function (path) {
+ var result = PATH.splitPath(path),
+ root = result[0],
+ dir = result[1];
+ if (!root && !dir) {
+ // No dirname whatsoever
+ return '.';
+ }
+ if (dir) {
+ // It has a dirname, strip trailing slash
+ dir = dir.substr(0, dir.length - 1);
+ }
+ return root + dir;
+ },basename:function (path) {
+ // EMSCRIPTEN return '/'' for '/', not an empty string
+ if (path === '/') return '/';
+ var lastSlash = path.lastIndexOf('/');
+ if (lastSlash === -1) return path;
+ return path.substr(lastSlash+1);
+ },extname:function (path) {
+ return PATH.splitPath(path)[3];
+ },join:function () {
+ var paths = Array.prototype.slice.call(arguments, 0);
+ return PATH.normalize(paths.join('/'));
+ },join2:function (l, r) {
+ return PATH.normalize(l + '/' + r);
+ },resolve:function () {
+ var resolvedPath = '',
+ resolvedAbsolute = false;
+ for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {
+ var path = (i >= 0) ? arguments[i] : FS.cwd();
+ // Skip empty and invalid entries
+ if (typeof path !== 'string') {
+ throw new TypeError('Arguments to path.resolve must be strings');
+ } else if (!path) {
+ continue;
+ }
+ resolvedPath = path + '/' + resolvedPath;
+ resolvedAbsolute = path.charAt(0) === '/';
+ }
+ // At this point the path should be resolved to a full absolute path, but
+ // handle relative paths to be safe (might happen when process.cwd() fails)
+ resolvedPath = PATH.normalizeArray(resolvedPath.split('/').filter(function(p) {
+ return !!p;
+ }), !resolvedAbsolute).join('/');
+ return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.';
+ },relative:function (from, to) {
+ from = PATH.resolve(from).substr(1);
+ to = PATH.resolve(to).substr(1);
+ function trim(arr) {
+ var start = 0;
+ for (; start < arr.length; start++) {
+ if (arr[start] !== '') break;
+ }
+ var end = arr.length - 1;
+ for (; end >= 0; end--) {
+ if (arr[end] !== '') break;
+ }
+ if (start > end) return [];
+ return arr.slice(start, end - start + 1);
+ }
+ var fromParts = trim(from.split('/'));
+ var toParts = trim(to.split('/'));
+ var length = Math.min(fromParts.length, toParts.length);
+ var samePartsLength = length;
+ for (var i = 0; i < length; i++) {
+ if (fromParts[i] !== toParts[i]) {
+ samePartsLength = i;
+ break;
+ }
+ }
+ var outputParts = [];
+ for (var i = samePartsLength; i < fromParts.length; i++) {
+ outputParts.push('..');
+ }
+ outputParts = outputParts.concat(toParts.slice(samePartsLength));
+ return outputParts.join('/');
+ }};
+
+ var TTY={ttys:[],init:function () {
+ // https://github.com/kripken/emscripten/pull/1555
+ // if (ENVIRONMENT_IS_NODE) {
+ // // currently, FS.init does not distinguish if process.stdin is a file or TTY
+ // // device, it always assumes it's a TTY device. because of this, we're forcing
+ // // process.stdin to UTF8 encoding to at least make stdin reading compatible
+ // // with text files until FS.init can be refactored.
+ // process['stdin']['setEncoding']('utf8');
+ // }
+ },shutdown:function () {
+ // https://github.com/kripken/emscripten/pull/1555
+ // if (ENVIRONMENT_IS_NODE) {
+ // // inolen: any idea as to why node -e 'process.stdin.read()' wouldn't exit immediately (with process.stdin being a tty)?
+ // // isaacs: because now it's reading from the stream, you've expressed interest in it, so that read() kicks off a _read() which creates a ReadReq operation
+ // // inolen: I thought read() in that case was a synchronous operation that just grabbed some amount of buffered data if it exists?
+ // // isaacs: it is. but it also triggers a _read() call, which calls readStart() on the handle
+ // // isaacs: do process.stdin.pause() and i'd think it'd probably close the pending call
+ // process['stdin']['pause']();
+ // }
+ },register:function (dev, ops) {
+ TTY.ttys[dev] = { input: [], output: [], ops: ops };
+ FS.registerDevice(dev, TTY.stream_ops);
+ },stream_ops:{open:function (stream) {
+ var tty = TTY.ttys[stream.node.rdev];
+ if (!tty) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ stream.tty = tty;
+ stream.seekable = false;
+ },close:function (stream) {
+ // flush any pending line data
+ if (stream.tty.output.length) {
+ stream.tty.ops.put_char(stream.tty, 10);
+ }
+ },read:function (stream, buffer, offset, length, pos /* ignored */) {
+ if (!stream.tty || !stream.tty.ops.get_char) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
+ }
+ var bytesRead = 0;
+ for (var i = 0; i < length; i++) {
+ var result;
+ try {
+ result = stream.tty.ops.get_char(stream.tty);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ if (result === undefined && bytesRead === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ if (result === null || result === undefined) break;
+ bytesRead++;
+ buffer[offset+i] = result;
+ }
+ if (bytesRead) {
+ stream.node.timestamp = Date.now();
+ }
+ return bytesRead;
+ },write:function (stream, buffer, offset, length, pos) {
+ if (!stream.tty || !stream.tty.ops.put_char) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
+ }
+ for (var i = 0; i < length; i++) {
+ try {
+ stream.tty.ops.put_char(stream.tty, buffer[offset+i]);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ }
+ if (length) {
+ stream.node.timestamp = Date.now();
+ }
+ return i;
+ }},default_tty_ops:{get_char:function (tty) {
+ if (!tty.input.length) {
+ var result = null;
+ if (ENVIRONMENT_IS_NODE) {
+ result = process['stdin']['read']();
+ if (!result) {
+ if (process['stdin']['_readableState'] && process['stdin']['_readableState']['ended']) {
+ return null; // EOF
+ }
+ return undefined; // no data available
+ }
+ } else if (typeof window != 'undefined' &&
+ typeof window.prompt == 'function') {
+ // Browser.
+ result = window.prompt('Input: '); // returns null on cancel
+ if (result !== null) {
+ result += '\n';
+ }
+ } else if (typeof readline == 'function') {
+ // Command line.
+ result = readline();
+ if (result !== null) {
+ result += '\n';
+ }
+ }
+ if (!result) {
+ return null;
+ }
+ tty.input = intArrayFromString(result, true);
+ }
+ return tty.input.shift();
+ },put_char:function (tty, val) {
+ if (val === null || val === 10) {
+ Module['print'](tty.output.join(''));
+ tty.output = [];
+ } else {
+ tty.output.push(TTY.utf8.processCChar(val));
+ }
+ }},default_tty1_ops:{put_char:function (tty, val) {
+ if (val === null || val === 10) {
+ Module['printErr'](tty.output.join(''));
+ tty.output = [];
+ } else {
+ tty.output.push(TTY.utf8.processCChar(val));
+ }
+ }}};
+
+ var MEMFS={ops_table:null,CONTENT_OWNING:1,CONTENT_FLEXIBLE:2,CONTENT_FIXED:3,mount:function (mount) {
+ return MEMFS.createNode(null, '/', 16384 | 511 /* 0777 */, 0);
+ },createNode:function (parent, name, mode, dev) {
+ if (FS.isBlkdev(mode) || FS.isFIFO(mode)) {
+ // no supported
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (!MEMFS.ops_table) {
+ MEMFS.ops_table = {
+ dir: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr,
+ lookup: MEMFS.node_ops.lookup,
+ mknod: MEMFS.node_ops.mknod,
+ rename: MEMFS.node_ops.rename,
+ unlink: MEMFS.node_ops.unlink,
+ rmdir: MEMFS.node_ops.rmdir,
+ readdir: MEMFS.node_ops.readdir,
+ symlink: MEMFS.node_ops.symlink
+ },
+ stream: {
+ llseek: MEMFS.stream_ops.llseek
+ }
+ },
+ file: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr
+ },
+ stream: {
+ llseek: MEMFS.stream_ops.llseek,
+ read: MEMFS.stream_ops.read,
+ write: MEMFS.stream_ops.write,
+ allocate: MEMFS.stream_ops.allocate,
+ mmap: MEMFS.stream_ops.mmap
+ }
+ },
+ link: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr,
+ readlink: MEMFS.node_ops.readlink
+ },
+ stream: {}
+ },
+ chrdev: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr
+ },
+ stream: FS.chrdev_stream_ops
+ },
+ };
+ }
+ var node = FS.createNode(parent, name, mode, dev);
+ if (FS.isDir(node.mode)) {
+ node.node_ops = MEMFS.ops_table.dir.node;
+ node.stream_ops = MEMFS.ops_table.dir.stream;
+ node.contents = {};
+ } else if (FS.isFile(node.mode)) {
+ node.node_ops = MEMFS.ops_table.file.node;
+ node.stream_ops = MEMFS.ops_table.file.stream;
+ node.contents = [];
+ node.contentMode = MEMFS.CONTENT_FLEXIBLE;
+ } else if (FS.isLink(node.mode)) {
+ node.node_ops = MEMFS.ops_table.link.node;
+ node.stream_ops = MEMFS.ops_table.link.stream;
+ } else if (FS.isChrdev(node.mode)) {
+ node.node_ops = MEMFS.ops_table.chrdev.node;
+ node.stream_ops = MEMFS.ops_table.chrdev.stream;
+ }
+ node.timestamp = Date.now();
+ // add the new node to the parent
+ if (parent) {
+ parent.contents[name] = node;
+ }
+ return node;
+ },ensureFlexible:function (node) {
+ if (node.contentMode !== MEMFS.CONTENT_FLEXIBLE) {
+ var contents = node.contents;
+ node.contents = Array.prototype.slice.call(contents);
+ node.contentMode = MEMFS.CONTENT_FLEXIBLE;
+ }
+ },node_ops:{getattr:function (node) {
+ var attr = {};
+ // device numbers reuse inode numbers.
+ attr.dev = FS.isChrdev(node.mode) ? node.id : 1;
+ attr.ino = node.id;
+ attr.mode = node.mode;
+ attr.nlink = 1;
+ attr.uid = 0;
+ attr.gid = 0;
+ attr.rdev = node.rdev;
+ if (FS.isDir(node.mode)) {
+ attr.size = 4096;
+ } else if (FS.isFile(node.mode)) {
+ attr.size = node.contents.length;
+ } else if (FS.isLink(node.mode)) {
+ attr.size = node.link.length;
+ } else {
+ attr.size = 0;
+ }
+ attr.atime = new Date(node.timestamp);
+ attr.mtime = new Date(node.timestamp);
+ attr.ctime = new Date(node.timestamp);
+ // NOTE: In our implementation, st_blocks = Math.ceil(st_size/st_blksize),
+ // but this is not required by the standard.
+ attr.blksize = 4096;
+ attr.blocks = Math.ceil(attr.size / attr.blksize);
+ return attr;
+ },setattr:function (node, attr) {
+ if (attr.mode !== undefined) {
+ node.mode = attr.mode;
+ }
+ if (attr.timestamp !== undefined) {
+ node.timestamp = attr.timestamp;
+ }
+ if (attr.size !== undefined) {
+ MEMFS.ensureFlexible(node);
+ var contents = node.contents;
+ if (attr.size < contents.length) contents.length = attr.size;
+ else while (attr.size > contents.length) contents.push(0);
+ }
+ },lookup:function (parent, name) {
+ throw FS.genericErrors[ERRNO_CODES.ENOENT];
+ },mknod:function (parent, name, mode, dev) {
+ return MEMFS.createNode(parent, name, mode, dev);
+ },rename:function (old_node, new_dir, new_name) {
+ // if we're overwriting a directory at new_name, make sure it's empty.
+ if (FS.isDir(old_node.mode)) {
+ var new_node;
+ try {
+ new_node = FS.lookupNode(new_dir, new_name);
+ } catch (e) {
+ }
+ if (new_node) {
+ for (var i in new_node.contents) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ }
+ }
+ // do the internal rewiring
+ delete old_node.parent.contents[old_node.name];
+ old_node.name = new_name;
+ new_dir.contents[new_name] = old_node;
+ old_node.parent = new_dir;
+ },unlink:function (parent, name) {
+ delete parent.contents[name];
+ },rmdir:function (parent, name) {
+ var node = FS.lookupNode(parent, name);
+ for (var i in node.contents) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ delete parent.contents[name];
+ },readdir:function (node) {
+ var entries = ['.', '..']
+ for (var key in node.contents) {
+ if (!node.contents.hasOwnProperty(key)) {
+ continue;
+ }
+ entries.push(key);
+ }
+ return entries;
+ },symlink:function (parent, newname, oldpath) {
+ var node = MEMFS.createNode(parent, newname, 511 /* 0777 */ | 40960, 0);
+ node.link = oldpath;
+ return node;
+ },readlink:function (node) {
+ if (!FS.isLink(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ return node.link;
+ }},stream_ops:{read:function (stream, buffer, offset, length, position) {
+ var contents = stream.node.contents;
+ if (position >= contents.length)
+ return 0;
+ var size = Math.min(contents.length - position, length);
+ assert(size >= 0);
+ if (size > 8 && contents.subarray) { // non-trivial, and typed array
+ buffer.set(contents.subarray(position, position + size), offset);
+ } else
+ {
+ for (var i = 0; i < size; i++) {
+ buffer[offset + i] = contents[position + i];
+ }
+ }
+ return size;
+ },write:function (stream, buffer, offset, length, position, canOwn) {
+ var node = stream.node;
+ node.timestamp = Date.now();
+ var contents = node.contents;
+ if (length && contents.length === 0 && position === 0 && buffer.subarray) {
+ // just replace it with the new data
+ if (canOwn && offset === 0) {
+ node.contents = buffer; // this could be a subarray of Emscripten HEAP, or allocated from some other source.
+ node.contentMode = (buffer.buffer === HEAP8.buffer) ? MEMFS.CONTENT_OWNING : MEMFS.CONTENT_FIXED;
+ } else {
+ node.contents = new Uint8Array(buffer.subarray(offset, offset+length));
+ node.contentMode = MEMFS.CONTENT_FIXED;
+ }
+ return length;
+ }
+ MEMFS.ensureFlexible(node);
+ var contents = node.contents;
+ while (contents.length < position) contents.push(0);
+ for (var i = 0; i < length; i++) {
+ contents[position + i] = buffer[offset + i];
+ }
+ return length;
+ },llseek:function (stream, offset, whence) {
+ var position = offset;
+ if (whence === 1) { // SEEK_CUR.
+ position += stream.position;
+ } else if (whence === 2) { // SEEK_END.
+ if (FS.isFile(stream.node.mode)) {
+ position += stream.node.contents.length;
+ }
+ }
+ if (position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ stream.ungotten = [];
+ stream.position = position;
+ return position;
+ },allocate:function (stream, offset, length) {
+ MEMFS.ensureFlexible(stream.node);
+ var contents = stream.node.contents;
+ var limit = offset + length;
+ while (limit > contents.length) contents.push(0);
+ },mmap:function (stream, buffer, offset, length, position, prot, flags) {
+ if (!FS.isFile(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ var ptr;
+ var allocated;
+ var contents = stream.node.contents;
+ // Only make a new copy when MAP_PRIVATE is specified.
+ if ( !(flags & 2) &&
+ (contents.buffer === buffer || contents.buffer === buffer.buffer) ) {
+ // We can't emulate MAP_SHARED when the file is not backed by the buffer
+ // we're mapping to (e.g. the HEAP buffer).
+ allocated = false;
+ ptr = contents.byteOffset;
+ } else {
+ // Try to avoid unnecessary slices.
+ if (position > 0 || position + length < contents.length) {
+ if (contents.subarray) {
+ contents = contents.subarray(position, position + length);
+ } else {
+ contents = Array.prototype.slice.call(contents, position, position + length);
+ }
+ }
+ allocated = true;
+ ptr = _malloc(length);
+ if (!ptr) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOMEM);
+ }
+ buffer.set(contents, ptr);
+ }
+ return { ptr: ptr, allocated: allocated };
+ }}};
+
+ var IDBFS={dbs:{},indexedDB:function () {
+ return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
+ },DB_VERSION:21,DB_STORE_NAME:"FILE_DATA",mount:function (mount) {
+ // reuse all of the core MEMFS functionality
+ return MEMFS.mount.apply(null, arguments);
+ },syncfs:function (mount, populate, callback) {
+ IDBFS.getLocalSet(mount, function(err, local) {
+ if (err) return callback(err);
+
+ IDBFS.getRemoteSet(mount, function(err, remote) {
+ if (err) return callback(err);
+
+ var src = populate ? remote : local;
+ var dst = populate ? local : remote;
+
+ IDBFS.reconcile(src, dst, callback);
+ });
+ });
+ },getDB:function (name, callback) {
+ // check the cache first
+ var db = IDBFS.dbs[name];
+ if (db) {
+ return callback(null, db);
+ }
+
+ var req;
+ try {
+ req = IDBFS.indexedDB().open(name, IDBFS.DB_VERSION);
+ } catch (e) {
+ return callback(e);
+ }
+ req.onupgradeneeded = function(e) {
+ var db = e.target.result;
+ var transaction = e.target.transaction;
+
+ var fileStore;
+
+ if (db.objectStoreNames.contains(IDBFS.DB_STORE_NAME)) {
+ fileStore = transaction.objectStore(IDBFS.DB_STORE_NAME);
+ } else {
+ fileStore = db.createObjectStore(IDBFS.DB_STORE_NAME);
+ }
+
+ fileStore.createIndex('timestamp', 'timestamp', { unique: false });
+ };
+ req.onsuccess = function() {
+ db = req.result;
+
+ // add to the cache
+ IDBFS.dbs[name] = db;
+ callback(null, db);
+ };
+ req.onerror = function() {
+ callback(this.error);
+ };
+ },getLocalSet:function (mount, callback) {
+ var entries = {};
+
+ function isRealDir(p) {
+ return p !== '.' && p !== '..';
+ };
+ function toAbsolute(root) {
+ return function(p) {
+ return PATH.join2(root, p);
+ }
+ };
+
+ var check = FS.readdir(mount.mountpoint).filter(isRealDir).map(toAbsolute(mount.mountpoint));
+
+ while (check.length) {
+ var path = check.pop();
+ var stat;
+
+ try {
+ stat = FS.stat(path);
+ } catch (e) {
+ return callback(e);
+ }
+
+ if (FS.isDir(stat.mode)) {
+ check.push.apply(check, FS.readdir(path).filter(isRealDir).map(toAbsolute(path)));
+ }
+
+ entries[path] = { timestamp: stat.mtime };
+ }
+
+ return callback(null, { type: 'local', entries: entries });
+ },getRemoteSet:function (mount, callback) {
+ var entries = {};
+
+ IDBFS.getDB(mount.mountpoint, function(err, db) {
+ if (err) return callback(err);
+
+ var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readonly');
+ transaction.onerror = function() { callback(this.error); };
+
+ var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
+ var index = store.index('timestamp');
+
+ index.openKeyCursor().onsuccess = function(event) {
+ var cursor = event.target.result;
+
+ if (!cursor) {
+ return callback(null, { type: 'remote', db: db, entries: entries });
+ }
+
+ entries[cursor.primaryKey] = { timestamp: cursor.key };
+
+ cursor.continue();
+ };
+ });
+ },loadLocalEntry:function (path, callback) {
+ var stat, node;
+
+ try {
+ var lookup = FS.lookupPath(path);
+ node = lookup.node;
+ stat = FS.stat(path);
+ } catch (e) {
+ return callback(e);
+ }
+
+ if (FS.isDir(stat.mode)) {
+ return callback(null, { timestamp: stat.mtime, mode: stat.mode });
+ } else if (FS.isFile(stat.mode)) {
+ return callback(null, { timestamp: stat.mtime, mode: stat.mode, contents: node.contents });
+ } else {
+ return callback(new Error('node type not supported'));
+ }
+ },storeLocalEntry:function (path, entry, callback) {
+ try {
+ if (FS.isDir(entry.mode)) {
+ FS.mkdir(path, entry.mode);
+ } else if (FS.isFile(entry.mode)) {
+ FS.writeFile(path, entry.contents, { encoding: 'binary', canOwn: true });
+ } else {
+ return callback(new Error('node type not supported'));
+ }
+
+ FS.utime(path, entry.timestamp, entry.timestamp);
+ } catch (e) {
+ return callback(e);
+ }
+
+ callback(null);
+ },removeLocalEntry:function (path, callback) {
+ try {
+ var lookup = FS.lookupPath(path);
+ var stat = FS.stat(path);
+
+ if (FS.isDir(stat.mode)) {
+ FS.rmdir(path);
+ } else if (FS.isFile(stat.mode)) {
+ FS.unlink(path);
+ }
+ } catch (e) {
+ return callback(e);
+ }
+
+ callback(null);
+ },loadRemoteEntry:function (store, path, callback) {
+ var req = store.get(path);
+ req.onsuccess = function(event) { callback(null, event.target.result); };
+ req.onerror = function() { callback(this.error); };
+ },storeRemoteEntry:function (store, path, entry, callback) {
+ var req = store.put(entry, path);
+ req.onsuccess = function() { callback(null); };
+ req.onerror = function() { callback(this.error); };
+ },removeRemoteEntry:function (store, path, callback) {
+ var req = store.delete(path);
+ req.onsuccess = function() { callback(null); };
+ req.onerror = function() { callback(this.error); };
+ },reconcile:function (src, dst, callback) {
+ var total = 0;
+
+ var create = [];
+ Object.keys(src.entries).forEach(function (key) {
+ var e = src.entries[key];
+ var e2 = dst.entries[key];
+ if (!e2 || e.timestamp > e2.timestamp) {
+ create.push(key);
+ total++;
+ }
+ });
+
+ var remove = [];
+ Object.keys(dst.entries).forEach(function (key) {
+ var e = dst.entries[key];
+ var e2 = src.entries[key];
+ if (!e2) {
+ remove.push(key);
+ total++;
+ }
+ });
+
+ if (!total) {
+ return callback(null);
+ }
+
+ var errored = false;
+ var completed = 0;
+ var db = src.type === 'remote' ? src.db : dst.db;
+ var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readwrite');
+ var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
+
+ function done(err) {
+ if (err) {
+ if (!done.errored) {
+ done.errored = true;
+ return callback(err);
+ }
+ return;
+ }
+ if (++completed >= total) {
+ return callback(null);
+ }
+ };
+
+ transaction.onerror = function() { done(this.error); };
+
+ // sort paths in ascending order so directory entries are created
+ // before the files inside them
+ create.sort().forEach(function (path) {
+ if (dst.type === 'local') {
+ IDBFS.loadRemoteEntry(store, path, function (err, entry) {
+ if (err) return done(err);
+ IDBFS.storeLocalEntry(path, entry, done);
+ });
+ } else {
+ IDBFS.loadLocalEntry(path, function (err, entry) {
+ if (err) return done(err);
+ IDBFS.storeRemoteEntry(store, path, entry, done);
+ });
+ }
+ });
+
+ // sort paths in descending order so files are deleted before their
+ // parent directories
+ remove.sort().reverse().forEach(function(path) {
+ if (dst.type === 'local') {
+ IDBFS.removeLocalEntry(path, done);
+ } else {
+ IDBFS.removeRemoteEntry(store, path, done);
+ }
+ });
+ }};
+
+ var NODEFS={isWindows:false,staticInit:function () {
+ NODEFS.isWindows = !!process.platform.match(/^win/);
+ },mount:function (mount) {
+ assert(ENVIRONMENT_IS_NODE);
+ return NODEFS.createNode(null, '/', NODEFS.getMode(mount.opts.root), 0);
+ },createNode:function (parent, name, mode, dev) {
+ if (!FS.isDir(mode) && !FS.isFile(mode) && !FS.isLink(mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var node = FS.createNode(parent, name, mode);
+ node.node_ops = NODEFS.node_ops;
+ node.stream_ops = NODEFS.stream_ops;
+ return node;
+ },getMode:function (path) {
+ var stat;
+ try {
+ stat = fs.lstatSync(path);
+ if (NODEFS.isWindows) {
+ // On Windows, directories return permission bits 'rw-rw-rw-', even though they have 'rwxrwxrwx', so
+ // propagate write bits to execute bits.
+ stat.mode = stat.mode | ((stat.mode & 146) >> 1);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return stat.mode;
+ },realPath:function (node) {
+ var parts = [];
+ while (node.parent !== node) {
+ parts.push(node.name);
+ node = node.parent;
+ }
+ parts.push(node.mount.opts.root);
+ parts.reverse();
+ return PATH.join.apply(null, parts);
+ },flagsToPermissionStringMap:{0:"r",1:"r+",2:"r+",64:"r",65:"r+",66:"r+",129:"rx+",193:"rx+",514:"w+",577:"w",578:"w+",705:"wx",706:"wx+",1024:"a",1025:"a",1026:"a+",1089:"a",1090:"a+",1153:"ax",1154:"ax+",1217:"ax",1218:"ax+",4096:"rs",4098:"rs+"},flagsToPermissionString:function (flags) {
+ if (flags in NODEFS.flagsToPermissionStringMap) {
+ return NODEFS.flagsToPermissionStringMap[flags];
+ } else {
+ return flags;
+ }
+ },node_ops:{getattr:function (node) {
+ var path = NODEFS.realPath(node);
+ var stat;
+ try {
+ stat = fs.lstatSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ // node.js v0.10.20 doesn't report blksize and blocks on Windows. Fake them with default blksize of 4096.
+ // See http://support.microsoft.com/kb/140365
+ if (NODEFS.isWindows && !stat.blksize) {
+ stat.blksize = 4096;
+ }
+ if (NODEFS.isWindows && !stat.blocks) {
+ stat.blocks = (stat.size+stat.blksize-1)/stat.blksize|0;
+ }
+ return {
+ dev: stat.dev,
+ ino: stat.ino,
+ mode: stat.mode,
+ nlink: stat.nlink,
+ uid: stat.uid,
+ gid: stat.gid,
+ rdev: stat.rdev,
+ size: stat.size,
+ atime: stat.atime,
+ mtime: stat.mtime,
+ ctime: stat.ctime,
+ blksize: stat.blksize,
+ blocks: stat.blocks
+ };
+ },setattr:function (node, attr) {
+ var path = NODEFS.realPath(node);
+ try {
+ if (attr.mode !== undefined) {
+ fs.chmodSync(path, attr.mode);
+ // update the common node structure mode as well
+ node.mode = attr.mode;
+ }
+ if (attr.timestamp !== undefined) {
+ var date = new Date(attr.timestamp);
+ fs.utimesSync(path, date, date);
+ }
+ if (attr.size !== undefined) {
+ fs.truncateSync(path, attr.size);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },lookup:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ var mode = NODEFS.getMode(path);
+ return NODEFS.createNode(parent, name, mode);
+ },mknod:function (parent, name, mode, dev) {
+ var node = NODEFS.createNode(parent, name, mode, dev);
+ // create the backing node for this in the fs root as well
+ var path = NODEFS.realPath(node);
+ try {
+ if (FS.isDir(node.mode)) {
+ fs.mkdirSync(path, node.mode);
+ } else {
+ fs.writeFileSync(path, '', { mode: node.mode });
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return node;
+ },rename:function (oldNode, newDir, newName) {
+ var oldPath = NODEFS.realPath(oldNode);
+ var newPath = PATH.join2(NODEFS.realPath(newDir), newName);
+ try {
+ fs.renameSync(oldPath, newPath);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },unlink:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ try {
+ fs.unlinkSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },rmdir:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ try {
+ fs.rmdirSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },readdir:function (node) {
+ var path = NODEFS.realPath(node);
+ try {
+ return fs.readdirSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },symlink:function (parent, newName, oldPath) {
+ var newPath = PATH.join2(NODEFS.realPath(parent), newName);
+ try {
+ fs.symlinkSync(oldPath, newPath);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },readlink:function (node) {
+ var path = NODEFS.realPath(node);
+ try {
+ return fs.readlinkSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ }},stream_ops:{open:function (stream) {
+ var path = NODEFS.realPath(stream.node);
+ try {
+ if (FS.isFile(stream.node.mode)) {
+ stream.nfd = fs.openSync(path, NODEFS.flagsToPermissionString(stream.flags));
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },close:function (stream) {
+ try {
+ if (FS.isFile(stream.node.mode) && stream.nfd) {
+ fs.closeSync(stream.nfd);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },read:function (stream, buffer, offset, length, position) {
+ // FIXME this is terrible.
+ var nbuffer = new Buffer(length);
+ var res;
+ try {
+ res = fs.readSync(stream.nfd, nbuffer, 0, length, position);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ if (res > 0) {
+ for (var i = 0; i < res; i++) {
+ buffer[offset + i] = nbuffer[i];
+ }
+ }
+ return res;
+ },write:function (stream, buffer, offset, length, position) {
+ // FIXME this is terrible.
+ var nbuffer = new Buffer(buffer.subarray(offset, offset + length));
+ var res;
+ try {
+ res = fs.writeSync(stream.nfd, nbuffer, 0, length, position);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return res;
+ },llseek:function (stream, offset, whence) {
+ var position = offset;
+ if (whence === 1) { // SEEK_CUR.
+ position += stream.position;
+ } else if (whence === 2) { // SEEK_END.
+ if (FS.isFile(stream.node.mode)) {
+ try {
+ var stat = fs.fstatSync(stream.nfd);
+ position += stat.size;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ }
+ }
+
+ if (position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+
+ stream.position = position;
+ return position;
+ }}};
+
+ var _stdin=allocate(1, "i32*", ALLOC_STATIC);
+
+ var _stdout=allocate(1, "i32*", ALLOC_STATIC);
+
+ var _stderr=allocate(1, "i32*", ALLOC_STATIC);
+
+ function _fflush(stream) {
+ // int fflush(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fflush.html
+ // we don't currently perform any user-space buffering of data
+ }var FS={root:null,mounts:[],devices:[null],streams:[],nextInode:1,nameTable:null,currentPath:"/",initialized:false,ignorePermissions:true,ErrnoError:null,genericErrors:{},handleFSError:function (e) {
+ if (!(e instanceof FS.ErrnoError)) throw e + ' : ' + stackTrace();
+ return ___setErrNo(e.errno);
+ },lookupPath:function (path, opts) {
+ path = PATH.resolve(FS.cwd(), path);
+ opts = opts || {};
+
+ var defaults = {
+ follow_mount: true,
+ recurse_count: 0
+ };
+ for (var key in defaults) {
+ if (opts[key] === undefined) {
+ opts[key] = defaults[key];
+ }
+ }
+
+ if (opts.recurse_count > 8) { // max recursive lookup of 8
+ throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
+ }
+
+ // split the path
+ var parts = PATH.normalizeArray(path.split('/').filter(function(p) {
+ return !!p;
+ }), false);
+
+ // start at the root
+ var current = FS.root;
+ var current_path = '/';
+
+ for (var i = 0; i < parts.length; i++) {
+ var islast = (i === parts.length-1);
+ if (islast && opts.parent) {
+ // stop resolving
+ break;
+ }
+
+ current = FS.lookupNode(current, parts[i]);
+ current_path = PATH.join2(current_path, parts[i]);
+
+ // jump to the mount's root node if this is a mountpoint
+ if (FS.isMountpoint(current)) {
+ if (!islast || (islast && opts.follow_mount)) {
+ current = current.mounted.root;
+ }
+ }
+
+ // by default, lookupPath will not follow a symlink if it is the final path component.
+ // setting opts.follow = true will override this behavior.
+ if (!islast || opts.follow) {
+ var count = 0;
+ while (FS.isLink(current.mode)) {
+ var link = FS.readlink(current_path);
+ current_path = PATH.resolve(PATH.dirname(current_path), link);
+
+ var lookup = FS.lookupPath(current_path, { recurse_count: opts.recurse_count });
+ current = lookup.node;
+
+ if (count++ > 40) { // limit max consecutive symlinks to 40 (SYMLOOP_MAX).
+ throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
+ }
+ }
+ }
+ }
+
+ return { path: current_path, node: current };
+ },getPath:function (node) {
+ var path;
+ while (true) {
+ if (FS.isRoot(node)) {
+ var mount = node.mount.mountpoint;
+ if (!path) return mount;
+ return mount[mount.length-1] !== '/' ? mount + '/' + path : mount + path;
+ }
+ path = path ? node.name + '/' + path : node.name;
+ node = node.parent;
+ }
+ },hashName:function (parentid, name) {
+ var hash = 0;
+
+
+ for (var i = 0; i < name.length; i++) {
+ hash = ((hash << 5) - hash + name.charCodeAt(i)) | 0;
+ }
+ return ((parentid + hash) >>> 0) % FS.nameTable.length;
+ },hashAddNode:function (node) {
+ var hash = FS.hashName(node.parent.id, node.name);
+ node.name_next = FS.nameTable[hash];
+ FS.nameTable[hash] = node;
+ },hashRemoveNode:function (node) {
+ var hash = FS.hashName(node.parent.id, node.name);
+ if (FS.nameTable[hash] === node) {
+ FS.nameTable[hash] = node.name_next;
+ } else {
+ var current = FS.nameTable[hash];
+ while (current) {
+ if (current.name_next === node) {
+ current.name_next = node.name_next;
+ break;
+ }
+ current = current.name_next;
+ }
+ }
+ },lookupNode:function (parent, name) {
+ var err = FS.mayLookup(parent);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ var hash = FS.hashName(parent.id, name);
+ for (var node = FS.nameTable[hash]; node; node = node.name_next) {
+ var nodeName = node.name;
+ if (node.parent.id === parent.id && nodeName === name) {
+ return node;
+ }
+ }
+ // if we failed to find it in the cache, call into the VFS
+ return FS.lookup(parent, name);
+ },createNode:function (parent, name, mode, rdev) {
+ if (!FS.FSNode) {
+ FS.FSNode = function(parent, name, mode, rdev) {
+ if (!parent) {
+ parent = this; // root node sets parent to itself
+ }
+ this.parent = parent;
+ this.mount = parent.mount;
+ this.mounted = null;
+ this.id = FS.nextInode++;
+ this.name = name;
+ this.mode = mode;
+ this.node_ops = {};
+ this.stream_ops = {};
+ this.rdev = rdev;
+ };
+
+ FS.FSNode.prototype = {};
+
+ // compatibility
+ var readMode = 292 | 73;
+ var writeMode = 146;
+
+ // NOTE we must use Object.defineProperties instead of individual calls to
+ // Object.defineProperty in order to make closure compiler happy
+ Object.defineProperties(FS.FSNode.prototype, {
+ read: {
+ get: function() { return (this.mode & readMode) === readMode; },
+ set: function(val) { val ? this.mode |= readMode : this.mode &= ~readMode; }
+ },
+ write: {
+ get: function() { return (this.mode & writeMode) === writeMode; },
+ set: function(val) { val ? this.mode |= writeMode : this.mode &= ~writeMode; }
+ },
+ isFolder: {
+ get: function() { return FS.isDir(this.mode); },
+ },
+ isDevice: {
+ get: function() { return FS.isChrdev(this.mode); },
+ },
+ });
+ }
+
+ var node = new FS.FSNode(parent, name, mode, rdev);
+
+ FS.hashAddNode(node);
+
+ return node;
+ },destroyNode:function (node) {
+ FS.hashRemoveNode(node);
+ },isRoot:function (node) {
+ return node === node.parent;
+ },isMountpoint:function (node) {
+ return !!node.mounted;
+ },isFile:function (mode) {
+ return (mode & 61440) === 32768;
+ },isDir:function (mode) {
+ return (mode & 61440) === 16384;
+ },isLink:function (mode) {
+ return (mode & 61440) === 40960;
+ },isChrdev:function (mode) {
+ return (mode & 61440) === 8192;
+ },isBlkdev:function (mode) {
+ return (mode & 61440) === 24576;
+ },isFIFO:function (mode) {
+ return (mode & 61440) === 4096;
+ },isSocket:function (mode) {
+ return (mode & 49152) === 49152;
+ },flagModes:{"r":0,"rs":1052672,"r+":2,"w":577,"wx":705,"xw":705,"w+":578,"wx+":706,"xw+":706,"a":1089,"ax":1217,"xa":1217,"a+":1090,"ax+":1218,"xa+":1218},modeStringToFlags:function (str) {
+ var flags = FS.flagModes[str];
+ if (typeof flags === 'undefined') {
+ throw new Error('Unknown file open mode: ' + str);
+ }
+ return flags;
+ },flagsToPermissionString:function (flag) {
+ var accmode = flag & 2097155;
+ var perms = ['r', 'w', 'rw'][accmode];
+ if ((flag & 512)) {
+ perms += 'w';
+ }
+ return perms;
+ },nodePermissions:function (node, perms) {
+ if (FS.ignorePermissions) {
+ return 0;
+ }
+ // return 0 if any user, group or owner bits are set.
+ if (perms.indexOf('r') !== -1 && !(node.mode & 292)) {
+ return ERRNO_CODES.EACCES;
+ } else if (perms.indexOf('w') !== -1 && !(node.mode & 146)) {
+ return ERRNO_CODES.EACCES;
+ } else if (perms.indexOf('x') !== -1 && !(node.mode & 73)) {
+ return ERRNO_CODES.EACCES;
+ }
+ return 0;
+ },mayLookup:function (dir) {
+ return FS.nodePermissions(dir, 'x');
+ },mayCreate:function (dir, name) {
+ try {
+ var node = FS.lookupNode(dir, name);
+ return ERRNO_CODES.EEXIST;
+ } catch (e) {
+ }
+ return FS.nodePermissions(dir, 'wx');
+ },mayDelete:function (dir, name, isdir) {
+ var node;
+ try {
+ node = FS.lookupNode(dir, name);
+ } catch (e) {
+ return e.errno;
+ }
+ var err = FS.nodePermissions(dir, 'wx');
+ if (err) {
+ return err;
+ }
+ if (isdir) {
+ if (!FS.isDir(node.mode)) {
+ return ERRNO_CODES.ENOTDIR;
+ }
+ if (FS.isRoot(node) || FS.getPath(node) === FS.cwd()) {
+ return ERRNO_CODES.EBUSY;
+ }
+ } else {
+ if (FS.isDir(node.mode)) {
+ return ERRNO_CODES.EISDIR;
+ }
+ }
+ return 0;
+ },mayOpen:function (node, flags) {
+ if (!node) {
+ return ERRNO_CODES.ENOENT;
+ }
+ if (FS.isLink(node.mode)) {
+ return ERRNO_CODES.ELOOP;
+ } else if (FS.isDir(node.mode)) {
+ if ((flags & 2097155) !== 0 || // opening for write
+ (flags & 512)) {
+ return ERRNO_CODES.EISDIR;
+ }
+ }
+ return FS.nodePermissions(node, FS.flagsToPermissionString(flags));
+ },MAX_OPEN_FDS:4096,nextfd:function (fd_start, fd_end) {
+ fd_start = fd_start || 0;
+ fd_end = fd_end || FS.MAX_OPEN_FDS;
+ for (var fd = fd_start; fd <= fd_end; fd++) {
+ if (!FS.streams[fd]) {
+ return fd;
+ }
+ }
+ throw new FS.ErrnoError(ERRNO_CODES.EMFILE);
+ },getStream:function (fd) {
+ return FS.streams[fd];
+ },createStream:function (stream, fd_start, fd_end) {
+ if (!FS.FSStream) {
+ FS.FSStream = function(){};
+ FS.FSStream.prototype = {};
+ // compatibility
+ Object.defineProperties(FS.FSStream.prototype, {
+ object: {
+ get: function() { return this.node; },
+ set: function(val) { this.node = val; }
+ },
+ isRead: {
+ get: function() { return (this.flags & 2097155) !== 1; }
+ },
+ isWrite: {
+ get: function() { return (this.flags & 2097155) !== 0; }
+ },
+ isAppend: {
+ get: function() { return (this.flags & 1024); }
+ }
+ });
+ }
+ if (0) {
+ // reuse the object
+ stream.__proto__ = FS.FSStream.prototype;
+ } else {
+ var newStream = new FS.FSStream();
+ for (var p in stream) {
+ newStream[p] = stream[p];
+ }
+ stream = newStream;
+ }
+ var fd = FS.nextfd(fd_start, fd_end);
+ stream.fd = fd;
+ FS.streams[fd] = stream;
+ return stream;
+ },closeStream:function (fd) {
+ FS.streams[fd] = null;
+ },getStreamFromPtr:function (ptr) {
+ return FS.streams[ptr - 1];
+ },getPtrForStream:function (stream) {
+ return stream ? stream.fd + 1 : 0;
+ },chrdev_stream_ops:{open:function (stream) {
+ var device = FS.getDevice(stream.node.rdev);
+ // override node's stream ops with the device's
+ stream.stream_ops = device.stream_ops;
+ // forward the open call
+ if (stream.stream_ops.open) {
+ stream.stream_ops.open(stream);
+ }
+ },llseek:function () {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }},major:function (dev) {
+ return ((dev) >> 8);
+ },minor:function (dev) {
+ return ((dev) & 0xff);
+ },makedev:function (ma, mi) {
+ return ((ma) << 8 | (mi));
+ },registerDevice:function (dev, ops) {
+ FS.devices[dev] = { stream_ops: ops };
+ },getDevice:function (dev) {
+ return FS.devices[dev];
+ },getMounts:function (mount) {
+ var mounts = [];
+ var check = [mount];
+
+ while (check.length) {
+ var m = check.pop();
+
+ mounts.push(m);
+
+ check.push.apply(check, m.mounts);
+ }
+
+ return mounts;
+ },syncfs:function (populate, callback) {
+ if (typeof(populate) === 'function') {
+ callback = populate;
+ populate = false;
+ }
+
+ var mounts = FS.getMounts(FS.root.mount);
+ var completed = 0;
+
+ function done(err) {
+ if (err) {
+ if (!done.errored) {
+ done.errored = true;
+ return callback(err);
+ }
+ return;
+ }
+ if (++completed >= mounts.length) {
+ callback(null);
+ }
+ };
+
+ // sync all mounts
+ mounts.forEach(function (mount) {
+ if (!mount.type.syncfs) {
+ return done(null);
+ }
+ mount.type.syncfs(mount, populate, done);
+ });
+ },mount:function (type, opts, mountpoint) {
+ var root = mountpoint === '/';
+ var pseudo = !mountpoint;
+ var node;
+
+ if (root && FS.root) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ } else if (!root && !pseudo) {
+ var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
+
+ mountpoint = lookup.path; // use the absolute path
+ node = lookup.node;
+
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+
+ if (!FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ }
+
+ var mount = {
+ type: type,
+ opts: opts,
+ mountpoint: mountpoint,
+ mounts: []
+ };
+
+ // create a root node for the fs
+ var mountRoot = type.mount(mount);
+ mountRoot.mount = mount;
+ mount.root = mountRoot;
+
+ if (root) {
+ FS.root = mountRoot;
+ } else if (node) {
+ // set as a mountpoint
+ node.mounted = mount;
+
+ // add the new mount to the current mount's children
+ if (node.mount) {
+ node.mount.mounts.push(mount);
+ }
+ }
+
+ return mountRoot;
+ },unmount:function (mountpoint) {
+ var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
+
+ if (!FS.isMountpoint(lookup.node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+
+ // destroy the nodes for this mount, and all its child mounts
+ var node = lookup.node;
+ var mount = node.mounted;
+ var mounts = FS.getMounts(mount);
+
+ Object.keys(FS.nameTable).forEach(function (hash) {
+ var current = FS.nameTable[hash];
+
+ while (current) {
+ var next = current.name_next;
+
+ if (mounts.indexOf(current.mount) !== -1) {
+ FS.destroyNode(current);
+ }
+
+ current = next;
+ }
+ });
+
+ // no longer a mountpoint
+ node.mounted = null;
+
+ // remove this mount from the child mounts
+ var idx = node.mount.mounts.indexOf(mount);
+ assert(idx !== -1);
+ node.mount.mounts.splice(idx, 1);
+ },lookup:function (parent, name) {
+ return parent.node_ops.lookup(parent, name);
+ },mknod:function (path, mode, dev) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var err = FS.mayCreate(parent, name);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.mknod) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return parent.node_ops.mknod(parent, name, mode, dev);
+ },create:function (path, mode) {
+ mode = mode !== undefined ? mode : 438 /* 0666 */;
+ mode &= 4095;
+ mode |= 32768;
+ return FS.mknod(path, mode, 0);
+ },mkdir:function (path, mode) {
+ mode = mode !== undefined ? mode : 511 /* 0777 */;
+ mode &= 511 | 512;
+ mode |= 16384;
+ return FS.mknod(path, mode, 0);
+ },mkdev:function (path, mode, dev) {
+ if (typeof(dev) === 'undefined') {
+ dev = mode;
+ mode = 438 /* 0666 */;
+ }
+ mode |= 8192;
+ return FS.mknod(path, mode, dev);
+ },symlink:function (oldpath, newpath) {
+ var lookup = FS.lookupPath(newpath, { parent: true });
+ var parent = lookup.node;
+ var newname = PATH.basename(newpath);
+ var err = FS.mayCreate(parent, newname);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.symlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return parent.node_ops.symlink(parent, newname, oldpath);
+ },rename:function (old_path, new_path) {
+ var old_dirname = PATH.dirname(old_path);
+ var new_dirname = PATH.dirname(new_path);
+ var old_name = PATH.basename(old_path);
+ var new_name = PATH.basename(new_path);
+ // parents must exist
+ var lookup, old_dir, new_dir;
+ try {
+ lookup = FS.lookupPath(old_path, { parent: true });
+ old_dir = lookup.node;
+ lookup = FS.lookupPath(new_path, { parent: true });
+ new_dir = lookup.node;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ // need to be part of the same mount
+ if (old_dir.mount !== new_dir.mount) {
+ throw new FS.ErrnoError(ERRNO_CODES.EXDEV);
+ }
+ // source must exist
+ var old_node = FS.lookupNode(old_dir, old_name);
+ // old path should not be an ancestor of the new path
+ var relative = PATH.relative(old_path, new_dirname);
+ if (relative.charAt(0) !== '.') {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ // new path should not be an ancestor of the old path
+ relative = PATH.relative(new_path, old_dirname);
+ if (relative.charAt(0) !== '.') {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ // see if the new path already exists
+ var new_node;
+ try {
+ new_node = FS.lookupNode(new_dir, new_name);
+ } catch (e) {
+ // not fatal
+ }
+ // early out if nothing needs to change
+ if (old_node === new_node) {
+ return;
+ }
+ // we'll need to delete the old entry
+ var isdir = FS.isDir(old_node.mode);
+ var err = FS.mayDelete(old_dir, old_name, isdir);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ // need delete permissions if we'll be overwriting.
+ // need create permissions if new doesn't already exist.
+ err = new_node ?
+ FS.mayDelete(new_dir, new_name, isdir) :
+ FS.mayCreate(new_dir, new_name);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!old_dir.node_ops.rename) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(old_node) || (new_node && FS.isMountpoint(new_node))) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ // if we are going to change the parent, check write permissions
+ if (new_dir !== old_dir) {
+ err = FS.nodePermissions(old_dir, 'w');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ }
+ // remove the node from the lookup hash
+ FS.hashRemoveNode(old_node);
+ // do the underlying fs rename
+ try {
+ old_dir.node_ops.rename(old_node, new_dir, new_name);
+ } catch (e) {
+ throw e;
+ } finally {
+ // add the node back to the hash (in case node_ops.rename
+ // changed its name)
+ FS.hashAddNode(old_node);
+ }
+ },rmdir:function (path) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var node = FS.lookupNode(parent, name);
+ var err = FS.mayDelete(parent, name, true);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.rmdir) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ parent.node_ops.rmdir(parent, name);
+ FS.destroyNode(node);
+ },readdir:function (path) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ var node = lookup.node;
+ if (!node.node_ops.readdir) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ return node.node_ops.readdir(node);
+ },unlink:function (path) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var node = FS.lookupNode(parent, name);
+ var err = FS.mayDelete(parent, name, false);
+ if (err) {
+ // POSIX says unlink should set EPERM, not EISDIR
+ if (err === ERRNO_CODES.EISDIR) err = ERRNO_CODES.EPERM;
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.unlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ parent.node_ops.unlink(parent, name);
+ FS.destroyNode(node);
+ },readlink:function (path) {
+ var lookup = FS.lookupPath(path);
+ var link = lookup.node;
+ if (!link.node_ops.readlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ return link.node_ops.readlink(link);
+ },stat:function (path, dontFollow) {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ var node = lookup.node;
+ if (!node.node_ops.getattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return node.node_ops.getattr(node);
+ },lstat:function (path) {
+ return FS.stat(path, true);
+ },chmod:function (path, mode, dontFollow) {
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ node.node_ops.setattr(node, {
+ mode: (mode & 4095) | (node.mode & ~4095),
+ timestamp: Date.now()
+ });
+ },lchmod:function (path, mode) {
+ FS.chmod(path, mode, true);
+ },fchmod:function (fd, mode) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ FS.chmod(stream.node, mode);
+ },chown:function (path, uid, gid, dontFollow) {
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ node.node_ops.setattr(node, {
+ timestamp: Date.now()
+ // we ignore the uid / gid for now
+ });
+ },lchown:function (path, uid, gid) {
+ FS.chown(path, uid, gid, true);
+ },fchown:function (fd, uid, gid) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ FS.chown(stream.node, uid, gid);
+ },truncate:function (path, len) {
+ if (len < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: true });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!FS.isFile(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var err = FS.nodePermissions(node, 'w');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ node.node_ops.setattr(node, {
+ size: len,
+ timestamp: Date.now()
+ });
+ },ftruncate:function (fd, len) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ FS.truncate(stream.node, len);
+ },utime:function (path, atime, mtime) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ var node = lookup.node;
+ node.node_ops.setattr(node, {
+ timestamp: Math.max(atime, mtime)
+ });
+ },open:function (path, flags, mode, fd_start, fd_end) {
+ flags = typeof flags === 'string' ? FS.modeStringToFlags(flags) : flags;
+ mode = typeof mode === 'undefined' ? 438 /* 0666 */ : mode;
+ if ((flags & 64)) {
+ mode = (mode & 4095) | 32768;
+ } else {
+ mode = 0;
+ }
+ var node;
+ if (typeof path === 'object') {
+ node = path;
+ } else {
+ path = PATH.normalize(path);
+ try {
+ var lookup = FS.lookupPath(path, {
+ follow: !(flags & 131072)
+ });
+ node = lookup.node;
+ } catch (e) {
+ // ignore
+ }
+ }
+ // perhaps we need to create the node
+ if ((flags & 64)) {
+ if (node) {
+ // if O_CREAT and O_EXCL are set, error out if the node already exists
+ if ((flags & 128)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EEXIST);
+ }
+ } else {
+ // node doesn't exist, try to create it
+ node = FS.mknod(path, mode, 0);
+ }
+ }
+ if (!node) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
+ }
+ // can't truncate a device
+ if (FS.isChrdev(node.mode)) {
+ flags &= ~512;
+ }
+ // check permissions
+ var err = FS.mayOpen(node, flags);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ // do truncation if necessary
+ if ((flags & 512)) {
+ FS.truncate(node, 0);
+ }
+ // we've already handled these, don't pass down to the underlying vfs
+ flags &= ~(128 | 512);
+
+ // register the stream with the filesystem
+ var stream = FS.createStream({
+ node: node,
+ path: FS.getPath(node), // we want the absolute path to the node
+ flags: flags,
+ seekable: true,
+ position: 0,
+ stream_ops: node.stream_ops,
+ // used by the file family libc calls (fopen, fwrite, ferror, etc.)
+ ungotten: [],
+ error: false
+ }, fd_start, fd_end);
+ // call the new stream's open function
+ if (stream.stream_ops.open) {
+ stream.stream_ops.open(stream);
+ }
+ if (Module['logReadFiles'] && !(flags & 1)) {
+ if (!FS.readFiles) FS.readFiles = {};
+ if (!(path in FS.readFiles)) {
+ FS.readFiles[path] = 1;
+ Module['printErr']('read file: ' + path);
+ }
+ }
+ return stream;
+ },close:function (stream) {
+ try {
+ if (stream.stream_ops.close) {
+ stream.stream_ops.close(stream);
+ }
+ } catch (e) {
+ throw e;
+ } finally {
+ FS.closeStream(stream.fd);
+ }
+ },llseek:function (stream, offset, whence) {
+ if (!stream.seekable || !stream.stream_ops.llseek) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ return stream.stream_ops.llseek(stream, offset, whence);
+ },read:function (stream, buffer, offset, length, position) {
+ if (length < 0 || position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 1) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (FS.isDir(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!stream.stream_ops.read) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var seeking = true;
+ if (typeof position === 'undefined') {
+ position = stream.position;
+ seeking = false;
+ } else if (!stream.seekable) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ var bytesRead = stream.stream_ops.read(stream, buffer, offset, length, position);
+ if (!seeking) stream.position += bytesRead;
+ return bytesRead;
+ },write:function (stream, buffer, offset, length, position, canOwn) {
+ if (length < 0 || position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (FS.isDir(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!stream.stream_ops.write) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var seeking = true;
+ if (typeof position === 'undefined') {
+ position = stream.position;
+ seeking = false;
+ } else if (!stream.seekable) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ if (stream.flags & 1024) {
+ // seek to the end before writing in append mode
+ FS.llseek(stream, 0, 2);
+ }
+ var bytesWritten = stream.stream_ops.write(stream, buffer, offset, length, position, canOwn);
+ if (!seeking) stream.position += bytesWritten;
+ return bytesWritten;
+ },allocate:function (stream, offset, length) {
+ if (offset < 0 || length <= 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (!FS.isFile(stream.node.mode) && !FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ if (!stream.stream_ops.allocate) {
+ throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
+ }
+ stream.stream_ops.allocate(stream, offset, length);
+ },mmap:function (stream, buffer, offset, length, position, prot, flags) {
+ // TODO if PROT is PROT_WRITE, make sure we have write access
+ if ((stream.flags & 2097155) === 1) {
+ throw new FS.ErrnoError(ERRNO_CODES.EACCES);
+ }
+ if (!stream.stream_ops.mmap) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ return stream.stream_ops.mmap(stream, buffer, offset, length, position, prot, flags);
+ },ioctl:function (stream, cmd, arg) {
+ if (!stream.stream_ops.ioctl) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTTY);
+ }
+ return stream.stream_ops.ioctl(stream, cmd, arg);
+ },readFile:function (path, opts) {
+ opts = opts || {};
+ opts.flags = opts.flags || 'r';
+ opts.encoding = opts.encoding || 'binary';
+ if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
+ throw new Error('Invalid encoding type "' + opts.encoding + '"');
+ }
+ var ret;
+ var stream = FS.open(path, opts.flags);
+ var stat = FS.stat(path);
+ var length = stat.size;
+ var buf = new Uint8Array(length);
+ FS.read(stream, buf, 0, length, 0);
+ if (opts.encoding === 'utf8') {
+ ret = '';
+ var utf8 = new Runtime.UTF8Processor();
+ for (var i = 0; i < length; i++) {
+ ret += utf8.processCChar(buf[i]);
+ }
+ } else if (opts.encoding === 'binary') {
+ ret = buf;
+ }
+ FS.close(stream);
+ return ret;
+ },writeFile:function (path, data, opts) {
+ opts = opts || {};
+ opts.flags = opts.flags || 'w';
+ opts.encoding = opts.encoding || 'utf8';
+ if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
+ throw new Error('Invalid encoding type "' + opts.encoding + '"');
+ }
+ var stream = FS.open(path, opts.flags, opts.mode);
+ if (opts.encoding === 'utf8') {
+ var utf8 = new Runtime.UTF8Processor();
+ var buf = new Uint8Array(utf8.processJSString(data));
+ FS.write(stream, buf, 0, buf.length, 0, opts.canOwn);
+ } else if (opts.encoding === 'binary') {
+ FS.write(stream, data, 0, data.length, 0, opts.canOwn);
+ }
+ FS.close(stream);
+ },cwd:function () {
+ return FS.currentPath;
+ },chdir:function (path) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ if (!FS.isDir(lookup.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ var err = FS.nodePermissions(lookup.node, 'x');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ FS.currentPath = lookup.path;
+ },createDefaultDirectories:function () {
+ FS.mkdir('/tmp');
+ },createDefaultDevices:function () {
+ // create /dev
+ FS.mkdir('/dev');
+ // setup /dev/null
+ FS.registerDevice(FS.makedev(1, 3), {
+ read: function() { return 0; },
+ write: function() { return 0; }
+ });
+ FS.mkdev('/dev/null', FS.makedev(1, 3));
+ // setup /dev/tty and /dev/tty1
+ // stderr needs to print output using Module['printErr']
+ // so we register a second tty just for it.
+ TTY.register(FS.makedev(5, 0), TTY.default_tty_ops);
+ TTY.register(FS.makedev(6, 0), TTY.default_tty1_ops);
+ FS.mkdev('/dev/tty', FS.makedev(5, 0));
+ FS.mkdev('/dev/tty1', FS.makedev(6, 0));
+ // we're not going to emulate the actual shm device,
+ // just create the tmp dirs that reside in it commonly
+ FS.mkdir('/dev/shm');
+ FS.mkdir('/dev/shm/tmp');
+ },createStandardStreams:function () {
+ // TODO deprecate the old functionality of a single
+ // input / output callback and that utilizes FS.createDevice
+ // and instead require a unique set of stream ops
+
+ // by default, we symlink the standard streams to the
+ // default tty devices. however, if the standard streams
+ // have been overwritten we create a unique device for
+ // them instead.
+ if (Module['stdin']) {
+ FS.createDevice('/dev', 'stdin', Module['stdin']);
+ } else {
+ FS.symlink('/dev/tty', '/dev/stdin');
+ }
+ if (Module['stdout']) {
+ FS.createDevice('/dev', 'stdout', null, Module['stdout']);
+ } else {
+ FS.symlink('/dev/tty', '/dev/stdout');
+ }
+ if (Module['stderr']) {
+ FS.createDevice('/dev', 'stderr', null, Module['stderr']);
+ } else {
+ FS.symlink('/dev/tty1', '/dev/stderr');
+ }
+
+ // open default streams for the stdin, stdout and stderr devices
+ var stdin = FS.open('/dev/stdin', 'r');
+ HEAP32[((_stdin)>>2)]=FS.getPtrForStream(stdin);
+ assert(stdin.fd === 0, 'invalid handle for stdin (' + stdin.fd + ')');
+
+ var stdout = FS.open('/dev/stdout', 'w');
+ HEAP32[((_stdout)>>2)]=FS.getPtrForStream(stdout);
+ assert(stdout.fd === 1, 'invalid handle for stdout (' + stdout.fd + ')');
+
+ var stderr = FS.open('/dev/stderr', 'w');
+ HEAP32[((_stderr)>>2)]=FS.getPtrForStream(stderr);
+ assert(stderr.fd === 2, 'invalid handle for stderr (' + stderr.fd + ')');
+ },ensureErrnoError:function () {
+ if (FS.ErrnoError) return;
+ FS.ErrnoError = function ErrnoError(errno) {
+ this.errno = errno;
+ for (var key in ERRNO_CODES) {
+ if (ERRNO_CODES[key] === errno) {
+ this.code = key;
+ break;
+ }
+ }
+ this.message = ERRNO_MESSAGES[errno];
+ };
+ FS.ErrnoError.prototype = new Error();
+ FS.ErrnoError.prototype.constructor = FS.ErrnoError;
+ // Some errors may happen quite a bit, to avoid overhead we reuse them (and suffer a lack of stack info)
+ [ERRNO_CODES.ENOENT].forEach(function(code) {
+ FS.genericErrors[code] = new FS.ErrnoError(code);
+ FS.genericErrors[code].stack = '<generic error, no stack>';
+ });
+ },staticInit:function () {
+ FS.ensureErrnoError();
+
+ FS.nameTable = new Array(4096);
+
+ FS.mount(MEMFS, {}, '/');
+
+ FS.createDefaultDirectories();
+ FS.createDefaultDevices();
+ },init:function (input, output, error) {
+ assert(!FS.init.initialized, 'FS.init was previously called. If you want to initialize later with custom parameters, remove any earlier calls (note that one is automatically added to the generated code)');
+ FS.init.initialized = true;
+
+ FS.ensureErrnoError();
+
+ // Allow Module.stdin etc. to provide defaults, if none explicitly passed to us here
+ Module['stdin'] = input || Module['stdin'];
+ Module['stdout'] = output || Module['stdout'];
+ Module['stderr'] = error || Module['stderr'];
+
+ FS.createStandardStreams();
+ },quit:function () {
+ FS.init.initialized = false;
+ for (var i = 0; i < FS.streams.length; i++) {
+ var stream = FS.streams[i];
+ if (!stream) {
+ continue;
+ }
+ FS.close(stream);
+ }
+ },getMode:function (canRead, canWrite) {
+ var mode = 0;
+ if (canRead) mode |= 292 | 73;
+ if (canWrite) mode |= 146;
+ return mode;
+ },joinPath:function (parts, forceRelative) {
+ var path = PATH.join.apply(null, parts);
+ if (forceRelative && path[0] == '/') path = path.substr(1);
+ return path;
+ },absolutePath:function (relative, base) {
+ return PATH.resolve(base, relative);
+ },standardizePath:function (path) {
+ return PATH.normalize(path);
+ },findObject:function (path, dontResolveLastLink) {
+ var ret = FS.analyzePath(path, dontResolveLastLink);
+ if (ret.exists) {
+ return ret.object;
+ } else {
+ ___setErrNo(ret.error);
+ return null;
+ }
+ },analyzePath:function (path, dontResolveLastLink) {
+ // operate from within the context of the symlink's target
+ try {
+ var lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
+ path = lookup.path;
+ } catch (e) {
+ }
+ var ret = {
+ isRoot: false, exists: false, error: 0, name: null, path: null, object: null,
+ parentExists: false, parentPath: null, parentObject: null
+ };
+ try {
+ var lookup = FS.lookupPath(path, { parent: true });
+ ret.parentExists = true;
+ ret.parentPath = lookup.path;
+ ret.parentObject = lookup.node;
+ ret.name = PATH.basename(path);
+ lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
+ ret.exists = true;
+ ret.path = lookup.path;
+ ret.object = lookup.node;
+ ret.name = lookup.node.name;
+ ret.isRoot = lookup.path === '/';
+ } catch (e) {
+ ret.error = e.errno;
+ };
+ return ret;
+ },createFolder:function (parent, name, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(canRead, canWrite);
+ return FS.mkdir(path, mode);
+ },createPath:function (parent, path, canRead, canWrite) {
+ parent = typeof parent === 'string' ? parent : FS.getPath(parent);
+ var parts = path.split('/').reverse();
+ while (parts.length) {
+ var part = parts.pop();
+ if (!part) continue;
+ var current = PATH.join2(parent, part);
+ try {
+ FS.mkdir(current);
+ } catch (e) {
+ // ignore EEXIST
+ }
+ parent = current;
+ }
+ return current;
+ },createFile:function (parent, name, properties, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(canRead, canWrite);
+ return FS.create(path, mode);
+ },createDataFile:function (parent, name, data, canRead, canWrite, canOwn) {
+ var path = name ? PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name) : parent;
+ var mode = FS.getMode(canRead, canWrite);
+ var node = FS.create(path, mode);
+ if (data) {
+ if (typeof data === 'string') {
+ var arr = new Array(data.length);
+ for (var i = 0, len = data.length; i < len; ++i) arr[i] = data.charCodeAt(i);
+ data = arr;
+ }
+ // make sure we can write to the file
+ FS.chmod(node, mode | 146);
+ var stream = FS.open(node, 'w');
+ FS.write(stream, data, 0, data.length, 0, canOwn);
+ FS.close(stream);
+ FS.chmod(node, mode);
+ }
+ return node;
+ },createDevice:function (parent, name, input, output) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(!!input, !!output);
+ if (!FS.createDevice.major) FS.createDevice.major = 64;
+ var dev = FS.makedev(FS.createDevice.major++, 0);
+ // Create a fake device that a set of stream ops to emulate
+ // the old behavior.
+ FS.registerDevice(dev, {
+ open: function(stream) {
+ stream.seekable = false;
+ },
+ close: function(stream) {
+ // flush any pending line data
+ if (output && output.buffer && output.buffer.length) {
+ output(10);
+ }
+ },
+ read: function(stream, buffer, offset, length, pos /* ignored */) {
+ var bytesRead = 0;
+ for (var i = 0; i < length; i++) {
+ var result;
+ try {
+ result = input();
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ if (result === undefined && bytesRead === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ if (result === null || result === undefined) break;
+ bytesRead++;
+ buffer[offset+i] = result;
+ }
+ if (bytesRead) {
+ stream.node.timestamp = Date.now();
+ }
+ return bytesRead;
+ },
+ write: function(stream, buffer, offset, length, pos) {
+ for (var i = 0; i < length; i++) {
+ try {
+ output(buffer[offset+i]);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ }
+ if (length) {
+ stream.node.timestamp = Date.now();
+ }
+ return i;
+ }
+ });
+ return FS.mkdev(path, mode, dev);
+ },createLink:function (parent, name, target, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ return FS.symlink(target, path);
+ },forceLoadFile:function (obj) {
+ if (obj.isDevice || obj.isFolder || obj.link || obj.contents) return true;
+ var success = true;
+ if (typeof XMLHttpRequest !== 'undefined') {
+ throw new Error("Lazy loading should have been performed (contents set) in createLazyFile, but it was not. Lazy loading only works in web workers. Use --embed-file or --preload-file in emcc on the main thread.");
+ } else if (Module['read']) {
+ // Command-line.
+ try {
+ // WARNING: Can't read binary files in V8's d8 or tracemonkey's js, as
+ // read() will try to parse UTF8.
+ obj.contents = intArrayFromString(Module['read'](obj.url), true);
+ } catch (e) {
+ success = false;
+ }
+ } else {
+ throw new Error('Cannot load without read() or XMLHttpRequest.');
+ }
+ if (!success) ___setErrNo(ERRNO_CODES.EIO);
+ return success;
+ },createLazyFile:function (parent, name, url, canRead, canWrite) {
+ // Lazy chunked Uint8Array (implements get and length from Uint8Array). Actual getting is abstracted away for eventual reuse.
+ function LazyUint8Array() {
+ this.lengthKnown = false;
+ this.chunks = []; // Loaded chunks. Index is the chunk number
+ }
+ LazyUint8Array.prototype.get = function LazyUint8Array_get(idx) {
+ if (idx > this.length-1 || idx < 0) {
+ return undefined;
+ }
+ var chunkOffset = idx % this.chunkSize;
+ var chunkNum = Math.floor(idx / this.chunkSize);
+ return this.getter(chunkNum)[chunkOffset];
+ }
+ LazyUint8Array.prototype.setDataGetter = function LazyUint8Array_setDataGetter(getter) {
+ this.getter = getter;
+ }
+ LazyUint8Array.prototype.cacheLength = function LazyUint8Array_cacheLength() {
+ // Find length
+ var xhr = new XMLHttpRequest();
+ xhr.open('HEAD', url, false);
+ xhr.send(null);
+ if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
+ var datalength = Number(xhr.getResponseHeader("Content-length"));
+ var header;
+ var hasByteServing = (header = xhr.getResponseHeader("Accept-Ranges")) && header === "bytes";
+ var chunkSize = 1024*1024; // Chunk size in bytes
+
+ if (!hasByteServing) chunkSize = datalength;
+
+ // Function to get a range from the remote URL.
+ var doXHR = (function(from, to) {
+ if (from > to) throw new Error("invalid range (" + from + ", " + to + ") or no bytes requested!");
+ if (to > datalength-1) throw new Error("only " + datalength + " bytes available! programmer error!");
+
+ // TODO: Use mozResponseArrayBuffer, responseStream, etc. if available.
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, false);
+ if (datalength !== chunkSize) xhr.setRequestHeader("Range", "bytes=" + from + "-" + to);
+
+ // Some hints to the browser that we want binary data.
+ if (typeof Uint8Array != 'undefined') xhr.responseType = 'arraybuffer';
+ if (xhr.overrideMimeType) {
+ xhr.overrideMimeType('text/plain; charset=x-user-defined');
+ }
+
+ xhr.send(null);
+ if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
+ if (xhr.response !== undefined) {
+ return new Uint8Array(xhr.response || []);
+ } else {
+ return intArrayFromString(xhr.responseText || '', true);
+ }
+ });
+ var lazyArray = this;
+ lazyArray.setDataGetter(function(chunkNum) {
+ var start = chunkNum * chunkSize;
+ var end = (chunkNum+1) * chunkSize - 1; // including this byte
+ end = Math.min(end, datalength-1); // if datalength-1 is selected, this is the last block
+ if (typeof(lazyArray.chunks[chunkNum]) === "undefined") {
+ lazyArray.chunks[chunkNum] = doXHR(start, end);
+ }
+ if (typeof(lazyArray.chunks[chunkNum]) === "undefined") throw new Error("doXHR failed!");
+ return lazyArray.chunks[chunkNum];
+ });
+
+ this._length = datalength;
+ this._chunkSize = chunkSize;
+ this.lengthKnown = true;
+ }
+ if (typeof XMLHttpRequest !== 'undefined') {
+ if (!ENVIRONMENT_IS_WORKER) throw 'Cannot do synchronous binary XHRs outside webworkers in modern browsers. Use --embed-file or --preload-file in emcc';
+ var lazyArray = new LazyUint8Array();
+ Object.defineProperty(lazyArray, "length", {
+ get: function() {
+ if(!this.lengthKnown) {
+ this.cacheLength();
+ }
+ return this._length;
+ }
+ });
+ Object.defineProperty(lazyArray, "chunkSize", {
+ get: function() {
+ if(!this.lengthKnown) {
+ this.cacheLength();
+ }
+ return this._chunkSize;
+ }
+ });
+
+ var properties = { isDevice: false, contents: lazyArray };
+ } else {
+ var properties = { isDevice: false, url: url };
+ }
+
+ var node = FS.createFile(parent, name, properties, canRead, canWrite);
+ // This is a total hack, but I want to get this lazy file code out of the
+ // core of MEMFS. If we want to keep this lazy file concept I feel it should
+ // be its own thin LAZYFS proxying calls to MEMFS.
+ if (properties.contents) {
+ node.contents = properties.contents;
+ } else if (properties.url) {
+ node.contents = null;
+ node.url = properties.url;
+ }
+ // override each stream op with one that tries to force load the lazy file first
+ var stream_ops = {};
+ var keys = Object.keys(node.stream_ops);
+ keys.forEach(function(key) {
+ var fn = node.stream_ops[key];
+ stream_ops[key] = function forceLoadLazyFile() {
+ if (!FS.forceLoadFile(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ return fn.apply(null, arguments);
+ };
+ });
+ // use a custom read function
+ stream_ops.read = function stream_ops_read(stream, buffer, offset, length, position) {
+ if (!FS.forceLoadFile(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ var contents = stream.node.contents;
+ if (position >= contents.length)
+ return 0;
+ var size = Math.min(contents.length - position, length);
+ assert(size >= 0);
+ if (contents.slice) { // normal array
+ for (var i = 0; i < size; i++) {
+ buffer[offset + i] = contents[position + i];
+ }
+ } else {
+ for (var i = 0; i < size; i++) { // LazyUint8Array from sync binary XHR
+ buffer[offset + i] = contents.get(position + i);
+ }
+ }
+ return size;
+ };
+ node.stream_ops = stream_ops;
+ return node;
+ },createPreloadedFile:function (parent, name, url, canRead, canWrite, onload, onerror, dontCreateFile, canOwn) {
+ Browser.init();
+ // TODO we should allow people to just pass in a complete filename instead
+ // of parent and name being that we just join them anyways
+ var fullname = name ? PATH.resolve(PATH.join2(parent, name)) : parent;
+ function processData(byteArray) {
+ function finish(byteArray) {
+ if (!dontCreateFile) {
+ FS.createDataFile(parent, name, byteArray, canRead, canWrite, canOwn);
+ }
+ if (onload) onload();
+ removeRunDependency('cp ' + fullname);
+ }
+ var handled = false;
+ Module['preloadPlugins'].forEach(function(plugin) {
+ if (handled) return;
+ if (plugin['canHandle'](fullname)) {
+ plugin['handle'](byteArray, fullname, finish, function() {
+ if (onerror) onerror();
+ removeRunDependency('cp ' + fullname);
+ });
+ handled = true;
+ }
+ });
+ if (!handled) finish(byteArray);
+ }
+ addRunDependency('cp ' + fullname);
+ if (typeof url == 'string') {
+ Browser.asyncLoad(url, function(byteArray) {
+ processData(byteArray);
+ }, onerror);
+ } else {
+ processData(url);
+ }
+ },indexedDB:function () {
+ return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
+ },DB_NAME:function () {
+ return 'EM_FS_' + window.location.pathname;
+ },DB_VERSION:20,DB_STORE_NAME:"FILE_DATA",saveFilesToDB:function (paths, onload, onerror) {
+ onload = onload || function(){};
+ onerror = onerror || function(){};
+ var indexedDB = FS.indexedDB();
+ try {
+ var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
+ } catch (e) {
+ return onerror(e);
+ }
+ openRequest.onupgradeneeded = function openRequest_onupgradeneeded() {
+ console.log('creating db');
+ var db = openRequest.result;
+ db.createObjectStore(FS.DB_STORE_NAME);
+ };
+ openRequest.onsuccess = function openRequest_onsuccess() {
+ var db = openRequest.result;
+ var transaction = db.transaction([FS.DB_STORE_NAME], 'readwrite');
+ var files = transaction.objectStore(FS.DB_STORE_NAME);
+ var ok = 0, fail = 0, total = paths.length;
+ function finish() {
+ if (fail == 0) onload(); else onerror();
+ }
+ paths.forEach(function(path) {
+ var putRequest = files.put(FS.analyzePath(path).object.contents, path);
+ putRequest.onsuccess = function putRequest_onsuccess() { ok++; if (ok + fail == total) finish() };
+ putRequest.onerror = function putRequest_onerror() { fail++; if (ok + fail == total) finish() };
+ });
+ transaction.onerror = onerror;
+ };
+ openRequest.onerror = onerror;
+ },loadFilesFromDB:function (paths, onload, onerror) {
+ onload = onload || function(){};
+ onerror = onerror || function(){};
+ var indexedDB = FS.indexedDB();
+ try {
+ var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
+ } catch (e) {
+ return onerror(e);
+ }
+ openRequest.onupgradeneeded = onerror; // no database to load from
+ openRequest.onsuccess = function openRequest_onsuccess() {
+ var db = openRequest.result;
+ try {
+ var transaction = db.transaction([FS.DB_STORE_NAME], 'readonly');
+ } catch(e) {
+ onerror(e);
+ return;
+ }
+ var files = transaction.objectStore(FS.DB_STORE_NAME);
+ var ok = 0, fail = 0, total = paths.length;
+ function finish() {
+ if (fail == 0) onload(); else onerror();
+ }
+ paths.forEach(function(path) {
+ var getRequest = files.get(path);
+ getRequest.onsuccess = function getRequest_onsuccess() {
+ if (FS.analyzePath(path).exists) {
+ FS.unlink(path);
+ }
+ FS.createDataFile(PATH.dirname(path), PATH.basename(path), getRequest.result, true, true, true);
+ ok++;
+ if (ok + fail == total) finish();
+ };
+ getRequest.onerror = function getRequest_onerror() { fail++; if (ok + fail == total) finish() };
+ });
+ transaction.onerror = onerror;
+ };
+ openRequest.onerror = onerror;
+ }};
+
+
+
+
+ function _mkport() { throw 'TODO' }var SOCKFS={mount:function (mount) {
+ return FS.createNode(null, '/', 16384 | 511 /* 0777 */, 0);
+ },createSocket:function (family, type, protocol) {
+ var streaming = type == 1;
+ if (protocol) {
+ assert(streaming == (protocol == 6)); // if SOCK_STREAM, must be tcp
+ }
+
+ // create our internal socket structure
+ var sock = {
+ family: family,
+ type: type,
+ protocol: protocol,
+ server: null,
+ peers: {},
+ pending: [],
+ recv_queue: [],
+ sock_ops: SOCKFS.websocket_sock_ops
+ };
+
+ // create the filesystem node to store the socket structure
+ var name = SOCKFS.nextname();
+ var node = FS.createNode(SOCKFS.root, name, 49152, 0);
+ node.sock = sock;
+
+ // and the wrapping stream that enables library functions such
+ // as read and write to indirectly interact with the socket
+ var stream = FS.createStream({
+ path: name,
+ node: node,
+ flags: FS.modeStringToFlags('r+'),
+ seekable: false,
+ stream_ops: SOCKFS.stream_ops
+ });
+
+ // map the new stream to the socket structure (sockets have a 1:1
+ // relationship with a stream)
+ sock.stream = stream;
+
+ return sock;
+ },getSocket:function (fd) {
+ var stream = FS.getStream(fd);
+ if (!stream || !FS.isSocket(stream.node.mode)) {
+ return null;
+ }
+ return stream.node.sock;
+ },stream_ops:{poll:function (stream) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.poll(sock);
+ },ioctl:function (stream, request, varargs) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.ioctl(sock, request, varargs);
+ },read:function (stream, buffer, offset, length, position /* ignored */) {
+ var sock = stream.node.sock;
+ var msg = sock.sock_ops.recvmsg(sock, length);
+ if (!msg) {
+ // socket is closed
+ return 0;
+ }
+ buffer.set(msg.buffer, offset);
+ return msg.buffer.length;
+ },write:function (stream, buffer, offset, length, position /* ignored */) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.sendmsg(sock, buffer, offset, length);
+ },close:function (stream) {
+ var sock = stream.node.sock;
+ sock.sock_ops.close(sock);
+ }},nextname:function () {
+ if (!SOCKFS.nextname.current) {
+ SOCKFS.nextname.current = 0;
+ }
+ return 'socket[' + (SOCKFS.nextname.current++) + ']';
+ },websocket_sock_ops:{createPeer:function (sock, addr, port) {
+ var ws;
+
+ if (typeof addr === 'object') {
+ ws = addr;
+ addr = null;
+ port = null;
+ }
+
+ if (ws) {
+ // for sockets that've already connected (e.g. we're the server)
+ // we can inspect the _socket property for the address
+ if (ws._socket) {
+ addr = ws._socket.remoteAddress;
+ port = ws._socket.remotePort;
+ }
+ // if we're just now initializing a connection to the remote,
+ // inspect the url property
+ else {
+ var result = /ws[s]?:\/\/([^:]+):(\d+)/.exec(ws.url);
+ if (!result) {
+ throw new Error('WebSocket URL must be in the format ws(s)://address:port');
+ }
+ addr = result[1];
+ port = parseInt(result[2], 10);
+ }
+ } else {
+ // create the actual websocket object and connect
+ try {
+ // runtimeConfig gets set to true if WebSocket runtime configuration is available.
+ var runtimeConfig = (Module['websocket'] && ('object' === typeof Module['websocket']));
+
+ // The default value is 'ws://' the replace is needed because the compiler replaces "//" comments with '#'
+ // comments without checking context, so we'd end up with ws:#, the replace swaps the "#" for "//" again.
+ var url = 'ws:#'.replace('#', '//');
+
+ if (runtimeConfig) {
+ if ('string' === typeof Module['websocket']['url']) {
+ url = Module['websocket']['url']; // Fetch runtime WebSocket URL config.
+ }
+ }
+
+ if (url === 'ws://' || url === 'wss://') { // Is the supplied URL config just a prefix, if so complete it.
+ url = url + addr + ':' + port;
+ }
+
+ // Make the WebSocket subprotocol (Sec-WebSocket-Protocol) default to binary if no configuration is set.
+ var subProtocols = 'binary'; // The default value is 'binary'
+
+ if (runtimeConfig) {
+ if ('string' === typeof Module['websocket']['subprotocol']) {
+ subProtocols = Module['websocket']['subprotocol']; // Fetch runtime WebSocket subprotocol config.
+ }
+ }
+
+ // The regex trims the string (removes spaces at the beginning and end, then splits the string by
+ // <any space>,<any space> into an Array. Whitespace removal is important for Websockify and ws.
+ subProtocols = subProtocols.replace(/^ +| +$/g,"").split(/ *, */);
+
+ // The node ws library API for specifying optional subprotocol is slightly different than the browser's.
+ var opts = ENVIRONMENT_IS_NODE ? {'protocol': subProtocols.toString()} : subProtocols;
+
+ // If node we use the ws library.
+ var WebSocket = ENVIRONMENT_IS_NODE ? require('ws') : window['WebSocket'];
+ ws = new WebSocket(url, opts);
+ ws.binaryType = 'arraybuffer';
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EHOSTUNREACH);
+ }
+ }
+
+
+ var peer = {
+ addr: addr,
+ port: port,
+ socket: ws,
+ dgram_send_queue: []
+ };
+
+ SOCKFS.websocket_sock_ops.addPeer(sock, peer);
+ SOCKFS.websocket_sock_ops.handlePeerEvents(sock, peer);
+
+ // if this is a bound dgram socket, send the port number first to allow
+ // us to override the ephemeral port reported to us by remotePort on the
+ // remote end.
+ if (sock.type === 2 && typeof sock.sport !== 'undefined') {
+ peer.dgram_send_queue.push(new Uint8Array([
+ 255, 255, 255, 255,
+ 'p'.charCodeAt(0), 'o'.charCodeAt(0), 'r'.charCodeAt(0), 't'.charCodeAt(0),
+ ((sock.sport & 0xff00) >> 8) , (sock.sport & 0xff)
+ ]));
+ }
+
+ return peer;
+ },getPeer:function (sock, addr, port) {
+ return sock.peers[addr + ':' + port];
+ },addPeer:function (sock, peer) {
+ sock.peers[peer.addr + ':' + peer.port] = peer;
+ },removePeer:function (sock, peer) {
+ delete sock.peers[peer.addr + ':' + peer.port];
+ },handlePeerEvents:function (sock, peer) {
+ var first = true;
+
+ var handleOpen = function () {
+ try {
+ var queued = peer.dgram_send_queue.shift();
+ while (queued) {
+ peer.socket.send(queued);
+ queued = peer.dgram_send_queue.shift();
+ }
+ } catch (e) {
+ // not much we can do here in the way of proper error handling as we've already
+ // lied and said this data was sent. shut it down.
+ peer.socket.close();
+ }
+ };
+
+ function handleMessage(data) {
+ assert(typeof data !== 'string' && data.byteLength !== undefined); // must receive an ArrayBuffer
+ data = new Uint8Array(data); // make a typed array view on the array buffer
+
+
+ // if this is the port message, override the peer's port with it
+ var wasfirst = first;
+ first = false;
+ if (wasfirst &&
+ data.length === 10 &&
+ data[0] === 255 && data[1] === 255 && data[2] === 255 && data[3] === 255 &&
+ data[4] === 'p'.charCodeAt(0) && data[5] === 'o'.charCodeAt(0) && data[6] === 'r'.charCodeAt(0) && data[7] === 't'.charCodeAt(0)) {
+ // update the peer's port and it's key in the peer map
+ var newport = ((data[8] << 8) | data[9]);
+ SOCKFS.websocket_sock_ops.removePeer(sock, peer);
+ peer.port = newport;
+ SOCKFS.websocket_sock_ops.addPeer(sock, peer);
+ return;
+ }
+
+ sock.recv_queue.push({ addr: peer.addr, port: peer.port, data: data });
+ };
+
+ if (ENVIRONMENT_IS_NODE) {
+ peer.socket.on('open', handleOpen);
+ peer.socket.on('message', function(data, flags) {
+ if (!flags.binary) {
+ return;
+ }
+ handleMessage((new Uint8Array(data)).buffer); // copy from node Buffer -> ArrayBuffer
+ });
+ peer.socket.on('error', function() {
+ // don't throw
+ });
+ } else {
+ peer.socket.onopen = handleOpen;
+ peer.socket.onmessage = function peer_socket_onmessage(event) {
+ handleMessage(event.data);
+ };
+ }
+ },poll:function (sock) {
+ if (sock.type === 1 && sock.server) {
+ // listen sockets should only say they're available for reading
+ // if there are pending clients.
+ return sock.pending.length ? (64 | 1) : 0;
+ }
+
+ var mask = 0;
+ var dest = sock.type === 1 ? // we only care about the socket state for connection-based sockets
+ SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport) :
+ null;
+
+ if (sock.recv_queue.length ||
+ !dest || // connection-less sockets are always ready to read
+ (dest && dest.socket.readyState === dest.socket.CLOSING) ||
+ (dest && dest.socket.readyState === dest.socket.CLOSED)) { // let recv return 0 once closed
+ mask |= (64 | 1);
+ }
+
+ if (!dest || // connection-less sockets are always ready to write
+ (dest && dest.socket.readyState === dest.socket.OPEN)) {
+ mask |= 4;
+ }
+
+ if ((dest && dest.socket.readyState === dest.socket.CLOSING) ||
+ (dest && dest.socket.readyState === dest.socket.CLOSED)) {
+ mask |= 16;
+ }
+
+ return mask;
+ },ioctl:function (sock, request, arg) {
+ switch (request) {
+ case 21531:
+ var bytes = 0;
+ if (sock.recv_queue.length) {
+ bytes = sock.recv_queue[0].data.length;
+ }
+ HEAP32[((arg)>>2)]=bytes;
+ return 0;
+ default:
+ return ERRNO_CODES.EINVAL;
+ }
+ },close:function (sock) {
+ // if we've spawned a listen server, close it
+ if (sock.server) {
+ try {
+ sock.server.close();
+ } catch (e) {
+ }
+ sock.server = null;
+ }
+ // close any peer connections
+ var peers = Object.keys(sock.peers);
+ for (var i = 0; i < peers.length; i++) {
+ var peer = sock.peers[peers[i]];
+ try {
+ peer.socket.close();
+ } catch (e) {
+ }
+ SOCKFS.websocket_sock_ops.removePeer(sock, peer);
+ }
+ return 0;
+ },bind:function (sock, addr, port) {
+ if (typeof sock.saddr !== 'undefined' || typeof sock.sport !== 'undefined') {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL); // already bound
+ }
+ sock.saddr = addr;
+ sock.sport = port || _mkport();
+ // in order to emulate dgram sockets, we need to launch a listen server when
+ // binding on a connection-less socket
+ // note: this is only required on the server side
+ if (sock.type === 2) {
+ // close the existing server if it exists
+ if (sock.server) {
+ sock.server.close();
+ sock.server = null;
+ }
+ // swallow error operation not supported error that occurs when binding in the
+ // browser where this isn't supported
+ try {
+ sock.sock_ops.listen(sock, 0);
+ } catch (e) {
+ if (!(e instanceof FS.ErrnoError)) throw e;
+ if (e.errno !== ERRNO_CODES.EOPNOTSUPP) throw e;
+ }
+ }
+ },connect:function (sock, addr, port) {
+ if (sock.server) {
+ throw new FS.ErrnoError(ERRNO_CODS.EOPNOTSUPP);
+ }
+
+ // TODO autobind
+ // if (!sock.addr && sock.type == 2) {
+ // }
+
+ // early out if we're already connected / in the middle of connecting
+ if (typeof sock.daddr !== 'undefined' && typeof sock.dport !== 'undefined') {
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
+ if (dest) {
+ if (dest.socket.readyState === dest.socket.CONNECTING) {
+ throw new FS.ErrnoError(ERRNO_CODES.EALREADY);
+ } else {
+ throw new FS.ErrnoError(ERRNO_CODES.EISCONN);
+ }
+ }
+ }
+
+ // add the socket to our peer list and set our
+ // destination address / port to match
+ var peer = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
+ sock.daddr = peer.addr;
+ sock.dport = peer.port;
+
+ // always "fail" in non-blocking mode
+ throw new FS.ErrnoError(ERRNO_CODES.EINPROGRESS);
+ },listen:function (sock, backlog) {
+ if (!ENVIRONMENT_IS_NODE) {
+ throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
+ }
+ if (sock.server) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL); // already listening
+ }
+ var WebSocketServer = require('ws').Server;
+ var host = sock.saddr;
+ sock.server = new WebSocketServer({
+ host: host,
+ port: sock.sport
+ // TODO support backlog
+ });
+
+ sock.server.on('connection', function(ws) {
+ if (sock.type === 1) {
+ var newsock = SOCKFS.createSocket(sock.family, sock.type, sock.protocol);
+
+ // create a peer on the new socket
+ var peer = SOCKFS.websocket_sock_ops.createPeer(newsock, ws);
+ newsock.daddr = peer.addr;
+ newsock.dport = peer.port;
+
+ // push to queue for accept to pick up
+ sock.pending.push(newsock);
+ } else {
+ // create a peer on the listen socket so calling sendto
+ // with the listen socket and an address will resolve
+ // to the correct client
+ SOCKFS.websocket_sock_ops.createPeer(sock, ws);
+ }
+ });
+ sock.server.on('closed', function() {
+ sock.server = null;
+ });
+ sock.server.on('error', function() {
+ // don't throw
+ });
+ },accept:function (listensock) {
+ if (!listensock.server) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var newsock = listensock.pending.shift();
+ newsock.stream.flags = listensock.stream.flags;
+ return newsock;
+ },getname:function (sock, peer) {
+ var addr, port;
+ if (peer) {
+ if (sock.daddr === undefined || sock.dport === undefined) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+ addr = sock.daddr;
+ port = sock.dport;
+ } else {
+ // TODO saddr and sport will be set for bind()'d UDP sockets, but what
+ // should we be returning for TCP sockets that've been connect()'d?
+ addr = sock.saddr || 0;
+ port = sock.sport || 0;
+ }
+ return { addr: addr, port: port };
+ },sendmsg:function (sock, buffer, offset, length, addr, port) {
+ if (sock.type === 2) {
+ // connection-less sockets will honor the message address,
+ // and otherwise fall back to the bound destination address
+ if (addr === undefined || port === undefined) {
+ addr = sock.daddr;
+ port = sock.dport;
+ }
+ // if there was no address to fall back to, error out
+ if (addr === undefined || port === undefined) {
+ throw new FS.ErrnoError(ERRNO_CODES.EDESTADDRREQ);
+ }
+ } else {
+ // connection-based sockets will only use the bound
+ addr = sock.daddr;
+ port = sock.dport;
+ }
+
+ // find the peer for the destination address
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, addr, port);
+
+ // early out if not connected with a connection-based socket
+ if (sock.type === 1) {
+ if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ } else if (dest.socket.readyState === dest.socket.CONNECTING) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ }
+
+ // create a copy of the incoming data to send, as the WebSocket API
+ // doesn't work entirely with an ArrayBufferView, it'll just send
+ // the entire underlying buffer
+ var data;
+ if (buffer instanceof Array || buffer instanceof ArrayBuffer) {
+ data = buffer.slice(offset, offset + length);
+ } else { // ArrayBufferView
+ data = buffer.buffer.slice(buffer.byteOffset + offset, buffer.byteOffset + offset + length);
+ }
+
+ // if we're emulating a connection-less dgram socket and don't have
+ // a cached connection, queue the buffer to send upon connect and
+ // lie, saying the data was sent now.
+ if (sock.type === 2) {
+ if (!dest || dest.socket.readyState !== dest.socket.OPEN) {
+ // if we're not connected, open a new connection
+ if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ dest = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
+ }
+ dest.dgram_send_queue.push(data);
+ return length;
+ }
+ }
+
+ try {
+ // send the actual data
+ dest.socket.send(data);
+ return length;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ },recvmsg:function (sock, length) {
+ // http://pubs.opengroup.org/onlinepubs/7908799/xns/recvmsg.html
+ if (sock.type === 1 && sock.server) {
+ // tcp servers should not be recv()'ing on the listen socket
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+
+ var queued = sock.recv_queue.shift();
+ if (!queued) {
+ if (sock.type === 1) {
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
+
+ if (!dest) {
+ // if we have a destination address but are not connected, error out
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+ else if (dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ // return null if the socket has closed
+ return null;
+ }
+ else {
+ // else, our socket is in a valid state but truly has nothing available
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ } else {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ }
+
+ // queued.data will be an ArrayBuffer if it's unadulterated, but if it's
+ // requeued TCP data it'll be an ArrayBufferView
+ var queuedLength = queued.data.byteLength || queued.data.length;
+ var queuedOffset = queued.data.byteOffset || 0;
+ var queuedBuffer = queued.data.buffer || queued.data;
+ var bytesRead = Math.min(length, queuedLength);
+ var res = {
+ buffer: new Uint8Array(queuedBuffer, queuedOffset, bytesRead),
+ addr: queued.addr,
+ port: queued.port
+ };
+
+
+ // push back any unread data for TCP connections
+ if (sock.type === 1 && bytesRead < queuedLength) {
+ var bytesRemaining = queuedLength - bytesRead;
+ queued.data = new Uint8Array(queuedBuffer, queuedOffset + bytesRead, bytesRemaining);
+ sock.recv_queue.unshift(queued);
+ }
+
+ return res;
+ }}};function _send(fd, buf, len, flags) {
+ var sock = SOCKFS.getSocket(fd);
+ if (!sock) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ // TODO honor flags
+ return _write(fd, buf, len);
+ }
+
+ function _pwrite(fildes, buf, nbyte, offset) {
+ // ssize_t pwrite(int fildes, const void *buf, size_t nbyte, off_t offset);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
+ var stream = FS.getStream(fildes);
+ if (!stream) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ try {
+ var slab = HEAP8;
+ return FS.write(stream, slab, buf, nbyte, offset);
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }function _write(fildes, buf, nbyte) {
+ // ssize_t write(int fildes, const void *buf, size_t nbyte);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
+ var stream = FS.getStream(fildes);
+ if (!stream) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+
+
+ try {
+ var slab = HEAP8;
+ return FS.write(stream, slab, buf, nbyte);
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }
+
+ function _fileno(stream) {
+ // int fileno(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fileno.html
+ stream = FS.getStreamFromPtr(stream);
+ if (!stream) return -1;
+ return stream.fd;
+ }function _fwrite(ptr, size, nitems, stream) {
+ // size_t fwrite(const void *restrict ptr, size_t size, size_t nitems, FILE *restrict stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fwrite.html
+ var bytesToWrite = nitems * size;
+ if (bytesToWrite == 0) return 0;
+ var fd = _fileno(stream);
+ var bytesWritten = _write(fd, ptr, bytesToWrite);
+ if (bytesWritten == -1) {
+ var streamObj = FS.getStreamFromPtr(stream);
+ if (streamObj) streamObj.error = true;
+ return 0;
+ } else {
+ return Math.floor(bytesWritten / size);
+ }
+ }
+
+
+
+ Module["_strlen"] = _strlen;
+
+ function __reallyNegative(x) {
+ return x < 0 || (x === 0 && (1/x) === -Infinity);
+ }function __formatString(format, varargs) {
+ var textIndex = format;
+ var argIndex = 0;
+ function getNextArg(type) {
+ // NOTE: Explicitly ignoring type safety. Otherwise this fails:
+ // int x = 4; printf("%c\n", (char)x);
+ var ret;
+ if (type === 'double') {
+ ret = HEAPF64[(((varargs)+(argIndex))>>3)];
+ } else if (type == 'i64') {
+ ret = [HEAP32[(((varargs)+(argIndex))>>2)],
+ HEAP32[(((varargs)+(argIndex+4))>>2)]];
+
+ } else {
+ type = 'i32'; // varargs are always i32, i64, or double
+ ret = HEAP32[(((varargs)+(argIndex))>>2)];
+ }
+ argIndex += Runtime.getNativeFieldSize(type);
+ return ret;
+ }
+
+ var ret = [];
+ var curr, next, currArg;
+ while(1) {
+ var startTextIndex = textIndex;
+ curr = HEAP8[(textIndex)];
+ if (curr === 0) break;
+ next = HEAP8[((textIndex+1)|0)];
+ if (curr == 37) {
+ // Handle flags.
+ var flagAlwaysSigned = false;
+ var flagLeftAlign = false;
+ var flagAlternative = false;
+ var flagZeroPad = false;
+ var flagPadSign = false;
+ flagsLoop: while (1) {
+ switch (next) {
+ case 43:
+ flagAlwaysSigned = true;
+ break;
+ case 45:
+ flagLeftAlign = true;
+ break;
+ case 35:
+ flagAlternative = true;
+ break;
+ case 48:
+ if (flagZeroPad) {
+ break flagsLoop;
+ } else {
+ flagZeroPad = true;
+ break;
+ }
+ case 32:
+ flagPadSign = true;
+ break;
+ default:
+ break flagsLoop;
+ }
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ }
+
+ // Handle width.
+ var width = 0;
+ if (next == 42) {
+ width = getNextArg('i32');
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ } else {
+ while (next >= 48 && next <= 57) {
+ width = width * 10 + (next - 48);
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ }
+ }
+
+ // Handle precision.
+ var precisionSet = false, precision = -1;
+ if (next == 46) {
+ precision = 0;
+ precisionSet = true;
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ if (next == 42) {
+ precision = getNextArg('i32');
+ textIndex++;
+ } else {
+ while(1) {
+ var precisionChr = HEAP8[((textIndex+1)|0)];
+ if (precisionChr < 48 ||
+ precisionChr > 57) break;
+ precision = precision * 10 + (precisionChr - 48);
+ textIndex++;
+ }
+ }
+ next = HEAP8[((textIndex+1)|0)];
+ }
+ if (precision < 0) {
+ precision = 6; // Standard default.
+ precisionSet = false;
+ }
+
+ // Handle integer sizes. WARNING: These assume a 32-bit architecture!
+ var argSize;
+ switch (String.fromCharCode(next)) {
+ case 'h':
+ var nextNext = HEAP8[((textIndex+2)|0)];
+ if (nextNext == 104) {
+ textIndex++;
+ argSize = 1; // char (actually i32 in varargs)
+ } else {
+ argSize = 2; // short (actually i32 in varargs)
+ }
+ break;
+ case 'l':
+ var nextNext = HEAP8[((textIndex+2)|0)];
+ if (nextNext == 108) {
+ textIndex++;
+ argSize = 8; // long long
+ } else {
+ argSize = 4; // long
+ }
+ break;
+ case 'L': // long long
+ case 'q': // int64_t
+ case 'j': // intmax_t
+ argSize = 8;
+ break;
+ case 'z': // size_t
+ case 't': // ptrdiff_t
+ case 'I': // signed ptrdiff_t or unsigned size_t
+ argSize = 4;
+ break;
+ default:
+ argSize = null;
+ }
+ if (argSize) textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+
+ // Handle type specifier.
+ switch (String.fromCharCode(next)) {
+ case 'd': case 'i': case 'u': case 'o': case 'x': case 'X': case 'p': {
+ // Integer.
+ var signed = next == 100 || next == 105;
+ argSize = argSize || 4;
+ var currArg = getNextArg('i' + (argSize * 8));
+ var argText;
+ // Flatten i64-1 [low, high] into a (slightly rounded) double
+ if (argSize == 8) {
+ currArg = Runtime.makeBigInt(currArg[0], currArg[1], next == 117);
+ }
+ // Truncate to requested size.
+ if (argSize <= 4) {
+ var limit = Math.pow(256, argSize) - 1;
+ currArg = (signed ? reSign : unSign)(currArg & limit, argSize * 8);
+ }
+ // Format the number.
+ var currAbsArg = Math.abs(currArg);
+ var prefix = '';
+ if (next == 100 || next == 105) {
+ argText = reSign(currArg, 8 * argSize, 1).toString(10);
+ } else if (next == 117) {
+ argText = unSign(currArg, 8 * argSize, 1).toString(10);
+ currArg = Math.abs(currArg);
+ } else if (next == 111) {
+ argText = (flagAlternative ? '0' : '') + currAbsArg.toString(8);
+ } else if (next == 120 || next == 88) {
+ prefix = (flagAlternative && currArg != 0) ? '0x' : '';
+ if (currArg < 0) {
+ // Represent negative numbers in hex as 2's complement.
+ currArg = -currArg;
+ argText = (currAbsArg - 1).toString(16);
+ var buffer = [];
+ for (var i = 0; i < argText.length; i++) {
+ buffer.push((0xF - parseInt(argText[i], 16)).toString(16));
+ }
+ argText = buffer.join('');
+ while (argText.length < argSize * 2) argText = 'f' + argText;
+ } else {
+ argText = currAbsArg.toString(16);
+ }
+ if (next == 88) {
+ prefix = prefix.toUpperCase();
+ argText = argText.toUpperCase();
+ }
+ } else if (next == 112) {
+ if (currAbsArg === 0) {
+ argText = '(nil)';
+ } else {
+ prefix = '0x';
+ argText = currAbsArg.toString(16);
+ }
+ }
+ if (precisionSet) {
+ while (argText.length < precision) {
+ argText = '0' + argText;
+ }
+ }
+
+ // Add sign if needed
+ if (currArg >= 0) {
+ if (flagAlwaysSigned) {
+ prefix = '+' + prefix;
+ } else if (flagPadSign) {
+ prefix = ' ' + prefix;
+ }
+ }
+
+ // Move sign to prefix so we zero-pad after the sign
+ if (argText.charAt(0) == '-') {
+ prefix = '-' + prefix;
+ argText = argText.substr(1);
+ }
+
+ // Add padding.
+ while (prefix.length + argText.length < width) {
+ if (flagLeftAlign) {
+ argText += ' ';
+ } else {
+ if (flagZeroPad) {
+ argText = '0' + argText;
+ } else {
+ prefix = ' ' + prefix;
+ }
+ }
+ }
+
+ // Insert the result into the buffer.
+ argText = prefix + argText;
+ argText.split('').forEach(function(chr) {
+ ret.push(chr.charCodeAt(0));
+ });
+ break;
+ }
+ case 'f': case 'F': case 'e': case 'E': case 'g': case 'G': {
+ // Float.
+ var currArg = getNextArg('double');
+ var argText;
+ if (isNaN(currArg)) {
+ argText = 'nan';
+ flagZeroPad = false;
+ } else if (!isFinite(currArg)) {
+ argText = (currArg < 0 ? '-' : '') + 'inf';
+ flagZeroPad = false;
+ } else {
+ var isGeneral = false;
+ var effectivePrecision = Math.min(precision, 20);
+
+ // Convert g/G to f/F or e/E, as per:
+ // http://pubs.opengroup.org/onlinepubs/9699919799/functions/printf.html
+ if (next == 103 || next == 71) {
+ isGeneral = true;
+ precision = precision || 1;
+ var exponent = parseInt(currArg.toExponential(effectivePrecision).split('e')[1], 10);
+ if (precision > exponent && exponent >= -4) {
+ next = ((next == 103) ? 'f' : 'F').charCodeAt(0);
+ precision -= exponent + 1;
+ } else {
+ next = ((next == 103) ? 'e' : 'E').charCodeAt(0);
+ precision--;
+ }
+ effectivePrecision = Math.min(precision, 20);
+ }
+
+ if (next == 101 || next == 69) {
+ argText = currArg.toExponential(effectivePrecision);
+ // Make sure the exponent has at least 2 digits.
+ if (/[eE][-+]\d$/.test(argText)) {
+ argText = argText.slice(0, -1) + '0' + argText.slice(-1);
+ }
+ } else if (next == 102 || next == 70) {
+ argText = currArg.toFixed(effectivePrecision);
+ if (currArg === 0 && __reallyNegative(currArg)) {
+ argText = '-' + argText;
+ }
+ }
+
+ var parts = argText.split('e');
+ if (isGeneral && !flagAlternative) {
+ // Discard trailing zeros and periods.
+ while (parts[0].length > 1 && parts[0].indexOf('.') != -1 &&
+ (parts[0].slice(-1) == '0' || parts[0].slice(-1) == '.')) {
+ parts[0] = parts[0].slice(0, -1);
+ }
+ } else {
+ // Make sure we have a period in alternative mode.
+ if (flagAlternative && argText.indexOf('.') == -1) parts[0] += '.';
+ // Zero pad until required precision.
+ while (precision > effectivePrecision++) parts[0] += '0';
+ }
+ argText = parts[0] + (parts.length > 1 ? 'e' + parts[1] : '');
+
+ // Capitalize 'E' if needed.
+ if (next == 69) argText = argText.toUpperCase();
+
+ // Add sign.
+ if (currArg >= 0) {
+ if (flagAlwaysSigned) {
+ argText = '+' + argText;
+ } else if (flagPadSign) {
+ argText = ' ' + argText;
+ }
+ }
+ }
+
+ // Add padding.
+ while (argText.length < width) {
+ if (flagLeftAlign) {
+ argText += ' ';
+ } else {
+ if (flagZeroPad && (argText[0] == '-' || argText[0] == '+')) {
+ argText = argText[0] + '0' + argText.slice(1);
+ } else {
+ argText = (flagZeroPad ? '0' : ' ') + argText;
+ }
+ }
+ }
+
+ // Adjust case.
+ if (next < 97) argText = argText.toUpperCase();
+
+ // Insert the result into the buffer.
+ argText.split('').forEach(function(chr) {
+ ret.push(chr.charCodeAt(0));
+ });
+ break;
+ }
+ case 's': {
+ // String.
+ var arg = getNextArg('i8*');
+ var argLength = arg ? _strlen(arg) : '(null)'.length;
+ if (precisionSet) argLength = Math.min(argLength, precision);
+ if (!flagLeftAlign) {
+ while (argLength < width--) {
+ ret.push(32);
+ }
+ }
+ if (arg) {
+ for (var i = 0; i < argLength; i++) {
+ ret.push(HEAPU8[((arg++)|0)]);
+ }
+ } else {
+ ret = ret.concat(intArrayFromString('(null)'.substr(0, argLength), true));
+ }
+ if (flagLeftAlign) {
+ while (argLength < width--) {
+ ret.push(32);
+ }
+ }
+ break;
+ }
+ case 'c': {
+ // Character.
+ if (flagLeftAlign) ret.push(getNextArg('i8'));
+ while (--width > 0) {
+ ret.push(32);
+ }
+ if (!flagLeftAlign) ret.push(getNextArg('i8'));
+ break;
+ }
+ case 'n': {
+ // Write the length written so far to the next parameter.
+ var ptr = getNextArg('i32*');
+ HEAP32[((ptr)>>2)]=ret.length;
+ break;
+ }
+ case '%': {
+ // Literal percent sign.
+ ret.push(curr);
+ break;
+ }
+ default: {
+ // Unknown specifiers remain untouched.
+ for (var i = startTextIndex; i < textIndex + 2; i++) {
+ ret.push(HEAP8[(i)]);
+ }
+ }
+ }
+ textIndex += 2;
+ // TODO: Support a/A (hex float) and m (last error) specifiers.
+ // TODO: Support %1${specifier} for arg selection.
+ } else {
+ ret.push(curr);
+ textIndex += 1;
+ }
+ }
+ return ret;
+ }function _fprintf(stream, format, varargs) {
+ // int fprintf(FILE *restrict stream, const char *restrict format, ...);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
+ var result = __formatString(format, varargs);
+ var stack = Runtime.stackSave();
+ var ret = _fwrite(allocate(result, 'i8', ALLOC_STACK), 1, result.length, stream);
+ Runtime.stackRestore(stack);
+ return ret;
+ }function _printf(format, varargs) {
+ // int printf(const char *restrict format, ...);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
+ var stdout = HEAP32[((_stdout)>>2)];
+ return _fprintf(stdout, format, varargs);
+ }
+
+
+
+ function _emscripten_memcpy_big(dest, src, num) {
+ HEAPU8.set(HEAPU8.subarray(src, src+num), dest);
+ return dest;
+ }
+ Module["_memcpy"] = _memcpy;
+
+
+ function _fputs(s, stream) {
+ // int fputs(const char *restrict s, FILE *restrict stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fputs.html
+ var fd = _fileno(stream);
+ return _write(fd, s, _strlen(s));
+ }
+
+ function _fputc(c, stream) {
+ // int fputc(int c, FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fputc.html
+ var chr = unSign(c & 0xFF);
+ HEAP8[((_fputc.ret)|0)]=chr;
+ var fd = _fileno(stream);
+ var ret = _write(fd, _fputc.ret, 1);
+ if (ret == -1) {
+ var streamObj = FS.getStreamFromPtr(stream);
+ if (streamObj) streamObj.error = true;
+ return -1;
+ } else {
+ return chr;
+ }
+ }function _puts(s) {
+ // int puts(const char *s);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/puts.html
+ // NOTE: puts() always writes an extra newline.
+ var stdout = HEAP32[((_stdout)>>2)];
+ var ret = _fputs(s, stdout);
+ if (ret < 0) {
+ return ret;
+ } else {
+ var newlineRet = _fputc(10, stdout);
+ return (newlineRet < 0) ? -1 : ret + 1;
+ }
+ }
+
+ function _sbrk(bytes) {
+ // Implement a Linux-like 'memory area' for our 'process'.
+ // Changes the size of the memory area by |bytes|; returns the
+ // address of the previous top ('break') of the memory area
+ // We control the "dynamic" memory - DYNAMIC_BASE to DYNAMICTOP
+ var self = _sbrk;
+ if (!self.called) {
+ DYNAMICTOP = alignMemoryPage(DYNAMICTOP); // make sure we start out aligned
+ self.called = true;
+ assert(Runtime.dynamicAlloc);
+ self.alloc = Runtime.dynamicAlloc;
+ Runtime.dynamicAlloc = function() { abort('cannot dynamically allocate, sbrk now has control') };
+ }
+ var ret = DYNAMICTOP;
+ if (bytes != 0) self.alloc(bytes);
+ return ret; // Previous break location.
+ }
+
+ function ___errno_location() {
+ return ___errno_state;
+ }
+
+ function __ZNSt9exceptionD2Ev() {}
+
+ var Browser={mainLoop:{scheduler:null,method:"",shouldPause:false,paused:false,queue:[],pause:function () {
+ Browser.mainLoop.shouldPause = true;
+ },resume:function () {
+ if (Browser.mainLoop.paused) {
+ Browser.mainLoop.paused = false;
+ Browser.mainLoop.scheduler();
+ }
+ Browser.mainLoop.shouldPause = false;
+ },updateStatus:function () {
+ if (Module['setStatus']) {
+ var message = Module['statusMessage'] || 'Please wait...';
+ var remaining = Browser.mainLoop.remainingBlockers;
+ var expected = Browser.mainLoop.expectedBlockers;
+ if (remaining) {
+ if (remaining < expected) {
+ Module['setStatus'](message + ' (' + (expected - remaining) + '/' + expected + ')');
+ } else {
+ Module['setStatus'](message);
+ }
+ } else {
+ Module['setStatus']('');
+ }
+ }
+ }},isFullScreen:false,pointerLock:false,moduleContextCreatedCallbacks:[],workers:[],init:function () {
+ if (!Module["preloadPlugins"]) Module["preloadPlugins"] = []; // needs to exist even in workers
+
+ if (Browser.initted || ENVIRONMENT_IS_WORKER) return;
+ Browser.initted = true;
+
+ try {
+ new Blob();
+ Browser.hasBlobConstructor = true;
+ } catch(e) {
+ Browser.hasBlobConstructor = false;
+ console.log("warning: no blob constructor, cannot create blobs with mimetypes");
+ }
+ Browser.BlobBuilder = typeof MozBlobBuilder != "undefined" ? MozBlobBuilder : (typeof WebKitBlobBuilder != "undefined" ? WebKitBlobBuilder : (!Browser.hasBlobConstructor ? console.log("warning: no BlobBuilder") : null));
+ Browser.URLObject = typeof window != "undefined" ? (window.URL ? window.URL : window.webkitURL) : undefined;
+ if (!Module.noImageDecoding && typeof Browser.URLObject === 'undefined') {
+ console.log("warning: Browser does not support creating object URLs. Built-in browser image decoding will not be available.");
+ Module.noImageDecoding = true;
+ }
+
+ // Support for plugins that can process preloaded files. You can add more of these to
+ // your app by creating and appending to Module.preloadPlugins.
+ //
+ // Each plugin is asked if it can handle a file based on the file's name. If it can,
+ // it is given the file's raw data. When it is done, it calls a callback with the file's
+ // (possibly modified) data. For example, a plugin might decompress a file, or it
+ // might create some side data structure for use later (like an Image element, etc.).
+
+ var imagePlugin = {};
+ imagePlugin['canHandle'] = function imagePlugin_canHandle(name) {
+ return !Module.noImageDecoding && /\.(jpg|jpeg|png|bmp)$/i.test(name);
+ };
+ imagePlugin['handle'] = function imagePlugin_handle(byteArray, name, onload, onerror) {
+ var b = null;
+ if (Browser.hasBlobConstructor) {
+ try {
+ b = new Blob([byteArray], { type: Browser.getMimetype(name) });
+ if (b.size !== byteArray.length) { // Safari bug #118630
+ // Safari's Blob can only take an ArrayBuffer
+ b = new Blob([(new Uint8Array(byteArray)).buffer], { type: Browser.getMimetype(name) });
+ }
+ } catch(e) {
+ Runtime.warnOnce('Blob constructor present but fails: ' + e + '; falling back to blob builder');
+ }
+ }
+ if (!b) {
+ var bb = new Browser.BlobBuilder();
+ bb.append((new Uint8Array(byteArray)).buffer); // we need to pass a buffer, and must copy the array to get the right data range
+ b = bb.getBlob();
+ }
+ var url = Browser.URLObject.createObjectURL(b);
+ var img = new Image();
+ img.onload = function img_onload() {
+ assert(img.complete, 'Image ' + name + ' could not be decoded');
+ var canvas = document.createElement('canvas');
+ canvas.width = img.width;
+ canvas.height = img.height;
+ var ctx = canvas.getContext('2d');
+ ctx.drawImage(img, 0, 0);
+ Module["preloadedImages"][name] = canvas;
+ Browser.URLObject.revokeObjectURL(url);
+ if (onload) onload(byteArray);
+ };
+ img.onerror = function img_onerror(event) {
+ console.log('Image ' + url + ' could not be decoded');
+ if (onerror) onerror();
+ };
+ img.src = url;
+ };
+ Module['preloadPlugins'].push(imagePlugin);
+
+ var audioPlugin = {};
+ audioPlugin['canHandle'] = function audioPlugin_canHandle(name) {
+ return !Module.noAudioDecoding && name.substr(-4) in { '.ogg': 1, '.wav': 1, '.mp3': 1 };
+ };
+ audioPlugin['handle'] = function audioPlugin_handle(byteArray, name, onload, onerror) {
+ var done = false;
+ function finish(audio) {
+ if (done) return;
+ done = true;
+ Module["preloadedAudios"][name] = audio;
+ if (onload) onload(byteArray);
+ }
+ function fail() {
+ if (done) return;
+ done = true;
+ Module["preloadedAudios"][name] = new Audio(); // empty shim
+ if (onerror) onerror();
+ }
+ if (Browser.hasBlobConstructor) {
+ try {
+ var b = new Blob([byteArray], { type: Browser.getMimetype(name) });
+ } catch(e) {
+ return fail();
+ }
+ var url = Browser.URLObject.createObjectURL(b); // XXX we never revoke this!
+ var audio = new Audio();
+ audio.addEventListener('canplaythrough', function() { finish(audio) }, false); // use addEventListener due to chromium bug 124926
+ audio.onerror = function audio_onerror(event) {
+ if (done) return;
+ console.log('warning: browser could not fully decode audio ' + name + ', trying slower base64 approach');
+ function encode64(data) {
+ var BASE = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
+ var PAD = '=';
+ var ret = '';
+ var leftchar = 0;
+ var leftbits = 0;
+ for (var i = 0; i < data.length; i++) {
+ leftchar = (leftchar << 8) | data[i];
+ leftbits += 8;
+ while (leftbits >= 6) {
+ var curr = (leftchar >> (leftbits-6)) & 0x3f;
+ leftbits -= 6;
+ ret += BASE[curr];
+ }
+ }
+ if (leftbits == 2) {
+ ret += BASE[(leftchar&3) << 4];
+ ret += PAD + PAD;
+ } else if (leftbits == 4) {
+ ret += BASE[(leftchar&0xf) << 2];
+ ret += PAD;
+ }
+ return ret;
+ }
+ audio.src = 'data:audio/x-' + name.substr(-3) + ';base64,' + encode64(byteArray);
+ finish(audio); // we don't wait for confirmation this worked - but it's worth trying
+ };
+ audio.src = url;
+ // workaround for chrome bug 124926 - we do not always get oncanplaythrough or onerror
+ Browser.safeSetTimeout(function() {
+ finish(audio); // try to use it even though it is not necessarily ready to play
+ }, 10000);
+ } else {
+ return fail();
+ }
+ };
+ Module['preloadPlugins'].push(audioPlugin);
+
+ // Canvas event setup
+
+ var canvas = Module['canvas'];
+
+ // forced aspect ratio can be enabled by defining 'forcedAspectRatio' on Module
+ // Module['forcedAspectRatio'] = 4 / 3;
+
+ canvas.requestPointerLock = canvas['requestPointerLock'] ||
+ canvas['mozRequestPointerLock'] ||
+ canvas['webkitRequestPointerLock'] ||
+ canvas['msRequestPointerLock'] ||
+ function(){};
+ canvas.exitPointerLock = document['exitPointerLock'] ||
+ document['mozExitPointerLock'] ||
+ document['webkitExitPointerLock'] ||
+ document['msExitPointerLock'] ||
+ function(){}; // no-op if function does not exist
+ canvas.exitPointerLock = canvas.exitPointerLock.bind(document);
+
+ function pointerLockChange() {
+ Browser.pointerLock = document['pointerLockElement'] === canvas ||
+ document['mozPointerLockElement'] === canvas ||
+ document['webkitPointerLockElement'] === canvas ||
+ document['msPointerLockElement'] === canvas;
+ }
+
+ document.addEventListener('pointerlockchange', pointerLockChange, false);
+ document.addEventListener('mozpointerlockchange', pointerLockChange, false);
+ document.addEventListener('webkitpointerlockchange', pointerLockChange, false);
+ document.addEventListener('mspointerlockchange', pointerLockChange, false);
+
+ if (Module['elementPointerLock']) {
+ canvas.addEventListener("click", function(ev) {
+ if (!Browser.pointerLock && canvas.requestPointerLock) {
+ canvas.requestPointerLock();
+ ev.preventDefault();
+ }
+ }, false);
+ }
+ },createContext:function (canvas, useWebGL, setInModule, webGLContextAttributes) {
+ var ctx;
+ var errorInfo = '?';
+ function onContextCreationError(event) {
+ errorInfo = event.statusMessage || errorInfo;
+ }
+ try {
+ if (useWebGL) {
+ var contextAttributes = {
+ antialias: false,
+ alpha: false
+ };
+
+ if (webGLContextAttributes) {
+ for (var attribute in webGLContextAttributes) {
+ contextAttributes[attribute] = webGLContextAttributes[attribute];
+ }
+ }
+
+
+ canvas.addEventListener('webglcontextcreationerror', onContextCreationError, false);
+ try {
+ ['experimental-webgl', 'webgl'].some(function(webglId) {
+ return ctx = canvas.getContext(webglId, contextAttributes);
+ });
+ } finally {
+ canvas.removeEventListener('webglcontextcreationerror', onContextCreationError, false);
+ }
+ } else {
+ ctx = canvas.getContext('2d');
+ }
+ if (!ctx) throw ':(';
+ } catch (e) {
+ Module.print('Could not create canvas: ' + [errorInfo, e]);
+ return null;
+ }
+ if (useWebGL) {
+ // Set the background of the WebGL canvas to black
+ canvas.style.backgroundColor = "black";
+
+ // Warn on context loss
+ canvas.addEventListener('webglcontextlost', function(event) {
+ alert('WebGL context lost. You will need to reload the page.');
+ }, false);
+ }
+ if (setInModule) {
+ GLctx = Module.ctx = ctx;
+ Module.useWebGL = useWebGL;
+ Browser.moduleContextCreatedCallbacks.forEach(function(callback) { callback() });
+ Browser.init();
+ }
+ return ctx;
+ },destroyContext:function (canvas, useWebGL, setInModule) {},fullScreenHandlersInstalled:false,lockPointer:undefined,resizeCanvas:undefined,requestFullScreen:function (lockPointer, resizeCanvas) {
+ Browser.lockPointer = lockPointer;
+ Browser.resizeCanvas = resizeCanvas;
+ if (typeof Browser.lockPointer === 'undefined') Browser.lockPointer = true;
+ if (typeof Browser.resizeCanvas === 'undefined') Browser.resizeCanvas = false;
+
+ var canvas = Module['canvas'];
+ function fullScreenChange() {
+ Browser.isFullScreen = false;
+ var canvasContainer = canvas.parentNode;
+ if ((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
+ document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
+ document['fullScreenElement'] || document['fullscreenElement'] ||
+ document['msFullScreenElement'] || document['msFullscreenElement'] ||
+ document['webkitCurrentFullScreenElement']) === canvasContainer) {
+ canvas.cancelFullScreen = document['cancelFullScreen'] ||
+ document['mozCancelFullScreen'] ||
+ document['webkitCancelFullScreen'] ||
+ document['msExitFullscreen'] ||
+ document['exitFullscreen'] ||
+ function() {};
+ canvas.cancelFullScreen = canvas.cancelFullScreen.bind(document);
+ if (Browser.lockPointer) canvas.requestPointerLock();
+ Browser.isFullScreen = true;
+ if (Browser.resizeCanvas) Browser.setFullScreenCanvasSize();
+ } else {
+
+ // remove the full screen specific parent of the canvas again to restore the HTML structure from before going full screen
+ canvasContainer.parentNode.insertBefore(canvas, canvasContainer);
+ canvasContainer.parentNode.removeChild(canvasContainer);
+
+ if (Browser.resizeCanvas) Browser.setWindowedCanvasSize();
+ }
+ if (Module['onFullScreen']) Module['onFullScreen'](Browser.isFullScreen);
+ Browser.updateCanvasDimensions(canvas);
+ }
+
+ if (!Browser.fullScreenHandlersInstalled) {
+ Browser.fullScreenHandlersInstalled = true;
+ document.addEventListener('fullscreenchange', fullScreenChange, false);
+ document.addEventListener('mozfullscreenchange', fullScreenChange, false);
+ document.addEventListener('webkitfullscreenchange', fullScreenChange, false);
+ document.addEventListener('MSFullscreenChange', fullScreenChange, false);
+ }
+
+ // create a new parent to ensure the canvas has no siblings. this allows browsers to optimize full screen performance when its parent is the full screen root
+ var canvasContainer = document.createElement("div");
+ canvas.parentNode.insertBefore(canvasContainer, canvas);
+ canvasContainer.appendChild(canvas);
+
+ // use parent of canvas as full screen root to allow aspect ratio correction (Firefox stretches the root to screen size)
+ canvasContainer.requestFullScreen = canvasContainer['requestFullScreen'] ||
+ canvasContainer['mozRequestFullScreen'] ||
+ canvasContainer['msRequestFullscreen'] ||
+ (canvasContainer['webkitRequestFullScreen'] ? function() { canvasContainer['webkitRequestFullScreen'](Element['ALLOW_KEYBOARD_INPUT']) } : null);
+ canvasContainer.requestFullScreen();
+ },requestAnimationFrame:function requestAnimationFrame(func) {
+ if (typeof window === 'undefined') { // Provide fallback to setTimeout if window is undefined (e.g. in Node.js)
+ setTimeout(func, 1000/60);
+ } else {
+ if (!window.requestAnimationFrame) {
+ window.requestAnimationFrame = window['requestAnimationFrame'] ||
+ window['mozRequestAnimationFrame'] ||
+ window['webkitRequestAnimationFrame'] ||
+ window['msRequestAnimationFrame'] ||
+ window['oRequestAnimationFrame'] ||
+ window['setTimeout'];
+ }
+ window.requestAnimationFrame(func);
+ }
+ },safeCallback:function (func) {
+ return function() {
+ if (!ABORT) return func.apply(null, arguments);
+ };
+ },safeRequestAnimationFrame:function (func) {
+ return Browser.requestAnimationFrame(function() {
+ if (!ABORT) func();
+ });
+ },safeSetTimeout:function (func, timeout) {
+ return setTimeout(function() {
+ if (!ABORT) func();
+ }, timeout);
+ },safeSetInterval:function (func, timeout) {
+ return setInterval(function() {
+ if (!ABORT) func();
+ }, timeout);
+ },getMimetype:function (name) {
+ return {
+ 'jpg': 'image/jpeg',
+ 'jpeg': 'image/jpeg',
+ 'png': 'image/png',
+ 'bmp': 'image/bmp',
+ 'ogg': 'audio/ogg',
+ 'wav': 'audio/wav',
+ 'mp3': 'audio/mpeg'
+ }[name.substr(name.lastIndexOf('.')+1)];
+ },getUserMedia:function (func) {
+ if(!window.getUserMedia) {
+ window.getUserMedia = navigator['getUserMedia'] ||
+ navigator['mozGetUserMedia'];
+ }
+ window.getUserMedia(func);
+ },getMovementX:function (event) {
+ return event['movementX'] ||
+ event['mozMovementX'] ||
+ event['webkitMovementX'] ||
+ 0;
+ },getMovementY:function (event) {
+ return event['movementY'] ||
+ event['mozMovementY'] ||
+ event['webkitMovementY'] ||
+ 0;
+ },getMouseWheelDelta:function (event) {
+ return Math.max(-1, Math.min(1, event.type === 'DOMMouseScroll' ? event.detail : -event.wheelDelta));
+ },mouseX:0,mouseY:0,mouseMovementX:0,mouseMovementY:0,calculateMouseEvent:function (event) { // event should be mousemove, mousedown or mouseup
+ if (Browser.pointerLock) {
+ // When the pointer is locked, calculate the coordinates
+ // based on the movement of the mouse.
+ // Workaround for Firefox bug 764498
+ if (event.type != 'mousemove' &&
+ ('mozMovementX' in event)) {
+ Browser.mouseMovementX = Browser.mouseMovementY = 0;
+ } else {
+ Browser.mouseMovementX = Browser.getMovementX(event);
+ Browser.mouseMovementY = Browser.getMovementY(event);
+ }
+
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ Browser.mouseX = SDL.mouseX + Browser.mouseMovementX;
+ Browser.mouseY = SDL.mouseY + Browser.mouseMovementY;
+ } else {
+ // just add the mouse delta to the current absolut mouse position
+ // FIXME: ideally this should be clamped against the canvas size and zero
+ Browser.mouseX += Browser.mouseMovementX;
+ Browser.mouseY += Browser.mouseMovementY;
+ }
+ } else {
+ // Otherwise, calculate the movement based on the changes
+ // in the coordinates.
+ var rect = Module["canvas"].getBoundingClientRect();
+ var x, y;
+
+ // Neither .scrollX or .pageXOffset are defined in a spec, but
+ // we prefer .scrollX because it is currently in a spec draft.
+ // (see: http://www.w3.org/TR/2013/WD-cssom-view-20131217/)
+ var scrollX = ((typeof window.scrollX !== 'undefined') ? window.scrollX : window.pageXOffset);
+ var scrollY = ((typeof window.scrollY !== 'undefined') ? window.scrollY : window.pageYOffset);
+ if (event.type == 'touchstart' ||
+ event.type == 'touchend' ||
+ event.type == 'touchmove') {
+ var t = event.touches.item(0);
+ if (t) {
+ x = t.pageX - (scrollX + rect.left);
+ y = t.pageY - (scrollY + rect.top);
+ } else {
+ return;
+ }
+ } else {
+ x = event.pageX - (scrollX + rect.left);
+ y = event.pageY - (scrollY + rect.top);
+ }
+
+ // the canvas might be CSS-scaled compared to its backbuffer;
+ // SDL-using content will want mouse coordinates in terms
+ // of backbuffer units.
+ var cw = Module["canvas"].width;
+ var ch = Module["canvas"].height;
+ x = x * (cw / rect.width);
+ y = y * (ch / rect.height);
+
+ Browser.mouseMovementX = x - Browser.mouseX;
+ Browser.mouseMovementY = y - Browser.mouseY;
+ Browser.mouseX = x;
+ Browser.mouseY = y;
+ }
+ },xhrLoad:function (url, onload, onerror) {
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, true);
+ xhr.responseType = 'arraybuffer';
+ xhr.onload = function xhr_onload() {
+ if (xhr.status == 200 || (xhr.status == 0 && xhr.response)) { // file URLs can return 0
+ onload(xhr.response);
+ } else {
+ onerror();
+ }
+ };
+ xhr.onerror = onerror;
+ xhr.send(null);
+ },asyncLoad:function (url, onload, onerror, noRunDep) {
+ Browser.xhrLoad(url, function(arrayBuffer) {
+ assert(arrayBuffer, 'Loading data file "' + url + '" failed (no arrayBuffer).');
+ onload(new Uint8Array(arrayBuffer));
+ if (!noRunDep) removeRunDependency('al ' + url);
+ }, function(event) {
+ if (onerror) {
+ onerror();
+ } else {
+ throw 'Loading data file "' + url + '" failed.';
+ }
+ });
+ if (!noRunDep) addRunDependency('al ' + url);
+ },resizeListeners:[],updateResizeListeners:function () {
+ var canvas = Module['canvas'];
+ Browser.resizeListeners.forEach(function(listener) {
+ listener(canvas.width, canvas.height);
+ });
+ },setCanvasSize:function (width, height, noUpdates) {
+ var canvas = Module['canvas'];
+ Browser.updateCanvasDimensions(canvas, width, height);
+ if (!noUpdates) Browser.updateResizeListeners();
+ },windowedWidth:0,windowedHeight:0,setFullScreenCanvasSize:function () {
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
+ flags = flags | 0x00800000; // set SDL_FULLSCREEN flag
+ HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
+ }
+ Browser.updateResizeListeners();
+ },setWindowedCanvasSize:function () {
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
+ flags = flags & ~0x00800000; // clear SDL_FULLSCREEN flag
+ HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
+ }
+ Browser.updateResizeListeners();
+ },updateCanvasDimensions:function (canvas, wNative, hNative) {
+ if (wNative && hNative) {
+ canvas.widthNative = wNative;
+ canvas.heightNative = hNative;
+ } else {
+ wNative = canvas.widthNative;
+ hNative = canvas.heightNative;
+ }
+ var w = wNative;
+ var h = hNative;
+ if (Module['forcedAspectRatio'] && Module['forcedAspectRatio'] > 0) {
+ if (w/h < Module['forcedAspectRatio']) {
+ w = Math.round(h * Module['forcedAspectRatio']);
+ } else {
+ h = Math.round(w / Module['forcedAspectRatio']);
+ }
+ }
+ if (((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
+ document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
+ document['fullScreenElement'] || document['fullscreenElement'] ||
+ document['msFullScreenElement'] || document['msFullscreenElement'] ||
+ document['webkitCurrentFullScreenElement']) === canvas.parentNode) && (typeof screen != 'undefined')) {
+ var factor = Math.min(screen.width / w, screen.height / h);
+ w = Math.round(w * factor);
+ h = Math.round(h * factor);
+ }
+ if (Browser.resizeCanvas) {
+ if (canvas.width != w) canvas.width = w;
+ if (canvas.height != h) canvas.height = h;
+ if (typeof canvas.style != 'undefined') {
+ canvas.style.removeProperty( "width");
+ canvas.style.removeProperty("height");
+ }
+ } else {
+ if (canvas.width != wNative) canvas.width = wNative;
+ if (canvas.height != hNative) canvas.height = hNative;
+ if (typeof canvas.style != 'undefined') {
+ if (w != wNative || h != hNative) {
+ canvas.style.setProperty( "width", w + "px", "important");
+ canvas.style.setProperty("height", h + "px", "important");
+ } else {
+ canvas.style.removeProperty( "width");
+ canvas.style.removeProperty("height");
+ }
+ }
+ }
+ }};
+
+ function _time(ptr) {
+ var ret = Math.floor(Date.now()/1000);
+ if (ptr) {
+ HEAP32[((ptr)>>2)]=ret;
+ }
+ return ret;
+ }
+
+
+ function _malloc(bytes) {
+ /* Over-allocate to make sure it is byte-aligned by 8.
+ * This will leak memory, but this is only the dummy
+ * implementation (replaced by dlmalloc normally) so
+ * not an issue.
+ */
+ var ptr = Runtime.dynamicAlloc(bytes + 8);
+ return (ptr+8) & 0xFFFFFFF8;
+ }
+ Module["_malloc"] = _malloc;function ___cxa_allocate_exception(size) {
+ var ptr = _malloc(size + ___cxa_exception_header_size);
+ return ptr + ___cxa_exception_header_size;
+ }
+
+ var __ZTISt9exception=allocate([allocate([1,0,0,0,0,0,0], "i8", ALLOC_STATIC)+8, 0], "i32", ALLOC_STATIC);
+
+ function __ZTVN10__cxxabiv120__si_class_type_infoE() {
+ Module['printErr']('missing function: _ZTVN10__cxxabiv120__si_class_type_infoE'); abort(-1);
+ }
+___errno_state = Runtime.staticAlloc(4); HEAP32[((___errno_state)>>2)]=0;
+FS.staticInit();__ATINIT__.unshift({ func: function() { if (!Module["noFSInit"] && !FS.init.initialized) FS.init() } });__ATMAIN__.push({ func: function() { FS.ignorePermissions = false } });__ATEXIT__.push({ func: function() { FS.quit() } });Module["FS_createFolder"] = FS.createFolder;Module["FS_createPath"] = FS.createPath;Module["FS_createDataFile"] = FS.createDataFile;Module["FS_createPreloadedFile"] = FS.createPreloadedFile;Module["FS_createLazyFile"] = FS.createLazyFile;Module["FS_createLink"] = FS.createLink;Module["FS_createDevice"] = FS.createDevice;
+__ATINIT__.unshift({ func: function() { TTY.init() } });__ATEXIT__.push({ func: function() { TTY.shutdown() } });TTY.utf8 = new Runtime.UTF8Processor();
+if (ENVIRONMENT_IS_NODE) { var fs = require("fs"); NODEFS.staticInit(); }
+__ATINIT__.push({ func: function() { SOCKFS.root = FS.mount(SOCKFS, {}, null); } });
+_fputc.ret = allocate([0], "i8", ALLOC_STATIC);
+Module["requestFullScreen"] = function Module_requestFullScreen(lockPointer, resizeCanvas) { Browser.requestFullScreen(lockPointer, resizeCanvas) };
+ Module["requestAnimationFrame"] = function Module_requestAnimationFrame(func) { Browser.requestAnimationFrame(func) };
+ Module["setCanvasSize"] = function Module_setCanvasSize(width, height, noUpdates) { Browser.setCanvasSize(width, height, noUpdates) };
+ Module["pauseMainLoop"] = function Module_pauseMainLoop() { Browser.mainLoop.pause() };
+ Module["resumeMainLoop"] = function Module_resumeMainLoop() { Browser.mainLoop.resume() };
+ Module["getUserMedia"] = function Module_getUserMedia() { Browser.getUserMedia() }
+STACK_BASE = STACKTOP = Runtime.alignMemory(STATICTOP);
+
+staticSealed = true; // seal the static portion of memory
+
+STACK_MAX = STACK_BASE + 5242880;
+
+DYNAMIC_BASE = DYNAMICTOP = Runtime.alignMemory(STACK_MAX);
+
+assert(DYNAMIC_BASE < TOTAL_MEMORY, "TOTAL_MEMORY not big enough for stack");
+
+
+var Math_min = Math.min;
+function invoke_ii(index,a1) {
+ try {
+ return Module["dynCall_ii"](index,a1);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function invoke_vi(index,a1) {
+ try {
+ Module["dynCall_vi"](index,a1);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function invoke_v(index) {
+ try {
+ Module["dynCall_v"](index);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function asmPrintInt(x, y) {
+ Module.print('int ' + x + ',' + y);// + ' ' + new Error().stack);
+}
+function asmPrintFloat(x, y) {
+ Module.print('float ' + x + ',' + y);// + ' ' + new Error().stack);
+}
+// EMSCRIPTEN_START_ASM
+var asm = Wasm.instantiateModuleFromAsm((function Module(global, env, buffer) {
+ 'use asm';
+ var HEAP8 = new global.Int8Array(buffer);
+ var HEAP16 = new global.Int16Array(buffer);
+ var HEAP32 = new global.Int32Array(buffer);
+ var HEAPU8 = new global.Uint8Array(buffer);
+ var HEAPU16 = new global.Uint16Array(buffer);
+ var HEAPU32 = new global.Uint32Array(buffer);
+ var HEAPF32 = new global.Float32Array(buffer);
+ var HEAPF64 = new global.Float64Array(buffer);
+
+ var STACKTOP=env.STACKTOP|0;
+ var STACK_MAX=env.STACK_MAX|0;
+ var tempDoublePtr=env.tempDoublePtr|0;
+ var ABORT=env.ABORT|0;
+ var __ZTISt9exception=env.__ZTISt9exception|0;
+ var __ZTVN10__cxxabiv120__si_class_type_infoE=env.__ZTVN10__cxxabiv120__si_class_type_infoE|0;
+
+ var __THREW__ = 0;
+ var threwValue = 0;
+ var setjmpId = 0;
+ var undef = 0;
+ var nan = +env.NaN, inf = +env.Infinity;
+ var tempInt = 0, tempBigInt = 0, tempBigIntP = 0, tempBigIntS = 0, tempBigIntR = 0.0, tempBigIntI = 0, tempBigIntD = 0, tempValue = 0, tempDouble = 0.0;
+
+ var tempRet0 = 0;
+ var tempRet1 = 0;
+ var tempRet2 = 0;
+ var tempRet3 = 0;
+ var tempRet4 = 0;
+ var tempRet5 = 0;
+ var tempRet6 = 0;
+ var tempRet7 = 0;
+ var tempRet8 = 0;
+ var tempRet9 = 0;
+ var Math_floor=global.Math.floor;
+ var Math_abs=global.Math.abs;
+ var Math_sqrt=global.Math.sqrt;
+ var Math_pow=global.Math.pow;
+ var Math_cos=global.Math.cos;
+ var Math_sin=global.Math.sin;
+ var Math_tan=global.Math.tan;
+ var Math_acos=global.Math.acos;
+ var Math_asin=global.Math.asin;
+ var Math_atan=global.Math.atan;
+ var Math_atan2=global.Math.atan2;
+ var Math_exp=global.Math.exp;
+ var Math_log=global.Math.log;
+ var Math_ceil=global.Math.ceil;
+ var Math_imul=global.Math.imul;
+ var abort=env.abort;
+ var assert=env.assert;
+ var asmPrintInt=env.asmPrintInt;
+ var asmPrintFloat=env.asmPrintFloat;
+ var Math_min=env.min;
+ var invoke_ii=env.invoke_ii;
+ var invoke_vi=env.invoke_vi;
+ var invoke_v=env.invoke_v;
+ var _send=env._send;
+ var ___setErrNo=env.___setErrNo;
+ var ___cxa_is_number_type=env.___cxa_is_number_type;
+ var ___cxa_allocate_exception=env.___cxa_allocate_exception;
+ var ___cxa_find_matching_catch=env.___cxa_find_matching_catch;
+ var _fflush=env._fflush;
+ var _time=env._time;
+ var _pwrite=env._pwrite;
+ var __reallyNegative=env.__reallyNegative;
+ var _sbrk=env._sbrk;
+ var _emscripten_memcpy_big=env._emscripten_memcpy_big;
+ var _fileno=env._fileno;
+ var ___resumeException=env.___resumeException;
+ var __ZSt18uncaught_exceptionv=env.__ZSt18uncaught_exceptionv;
+ var _sysconf=env._sysconf;
+ var _puts=env._puts;
+ var _mkport=env._mkport;
+ var _write=env._write;
+ var ___errno_location=env.___errno_location;
+ var __ZNSt9exceptionD2Ev=env.__ZNSt9exceptionD2Ev;
+ var _fputc=env._fputc;
+ var ___cxa_throw=env.___cxa_throw;
+ var _abort=env._abort;
+ var _fwrite=env._fwrite;
+ var ___cxa_does_inherit=env.___cxa_does_inherit;
+ var _fprintf=env._fprintf;
+ var __formatString=env.__formatString;
+ var _fputs=env._fputs;
+ var _printf=env._printf;
+ var tempFloat = 0.0;
+
+// EMSCRIPTEN_START_FUNCS
+function _malloc(i12) {
+ i12 = i12 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0, i30 = 0, i31 = 0, i32 = 0;
+ i1 = STACKTOP;
+ do {
+ if (i12 >>> 0 < 245) {
+ if (i12 >>> 0 < 11) {
+ i12 = 16;
+ } else {
+ i12 = i12 + 11 & -8;
+ }
+ i20 = i12 >>> 3;
+ i18 = HEAP32[146] | 0;
+ i21 = i18 >>> i20;
+ if ((i21 & 3 | 0) != 0) {
+ i6 = (i21 & 1 ^ 1) + i20 | 0;
+ i5 = i6 << 1;
+ i3 = 624 + (i5 << 2) | 0;
+ i5 = 624 + (i5 + 2 << 2) | 0;
+ i7 = HEAP32[i5 >> 2] | 0;
+ i2 = i7 + 8 | 0;
+ i4 = HEAP32[i2 >> 2] | 0;
+ do {
+ if ((i3 | 0) != (i4 | 0)) {
+ if (i4 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i8 = i4 + 12 | 0;
+ if ((HEAP32[i8 >> 2] | 0) == (i7 | 0)) {
+ HEAP32[i8 >> 2] = i3;
+ HEAP32[i5 >> 2] = i4;
+ break;
+ } else {
+ _abort();
+ }
+ } else {
+ HEAP32[146] = i18 & ~(1 << i6);
+ }
+ } while (0);
+ i32 = i6 << 3;
+ HEAP32[i7 + 4 >> 2] = i32 | 3;
+ i32 = i7 + (i32 | 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ i32 = i2;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ if (i12 >>> 0 > (HEAP32[592 >> 2] | 0) >>> 0) {
+ if ((i21 | 0) != 0) {
+ i7 = 2 << i20;
+ i7 = i21 << i20 & (i7 | 0 - i7);
+ i7 = (i7 & 0 - i7) + -1 | 0;
+ i2 = i7 >>> 12 & 16;
+ i7 = i7 >>> i2;
+ i6 = i7 >>> 5 & 8;
+ i7 = i7 >>> i6;
+ i5 = i7 >>> 2 & 4;
+ i7 = i7 >>> i5;
+ i4 = i7 >>> 1 & 2;
+ i7 = i7 >>> i4;
+ i3 = i7 >>> 1 & 1;
+ i3 = (i6 | i2 | i5 | i4 | i3) + (i7 >>> i3) | 0;
+ i7 = i3 << 1;
+ i4 = 624 + (i7 << 2) | 0;
+ i7 = 624 + (i7 + 2 << 2) | 0;
+ i5 = HEAP32[i7 >> 2] | 0;
+ i2 = i5 + 8 | 0;
+ i6 = HEAP32[i2 >> 2] | 0;
+ do {
+ if ((i4 | 0) != (i6 | 0)) {
+ if (i6 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i8 = i6 + 12 | 0;
+ if ((HEAP32[i8 >> 2] | 0) == (i5 | 0)) {
+ HEAP32[i8 >> 2] = i4;
+ HEAP32[i7 >> 2] = i6;
+ break;
+ } else {
+ _abort();
+ }
+ } else {
+ HEAP32[146] = i18 & ~(1 << i3);
+ }
+ } while (0);
+ i6 = i3 << 3;
+ i4 = i6 - i12 | 0;
+ HEAP32[i5 + 4 >> 2] = i12 | 3;
+ i3 = i5 + i12 | 0;
+ HEAP32[i5 + (i12 | 4) >> 2] = i4 | 1;
+ HEAP32[i5 + i6 >> 2] = i4;
+ i6 = HEAP32[592 >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ i5 = HEAP32[604 >> 2] | 0;
+ i8 = i6 >>> 3;
+ i9 = i8 << 1;
+ i6 = 624 + (i9 << 2) | 0;
+ i7 = HEAP32[146] | 0;
+ i8 = 1 << i8;
+ if ((i7 & i8 | 0) != 0) {
+ i7 = 624 + (i9 + 2 << 2) | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ if (i8 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i28 = i7;
+ i27 = i8;
+ }
+ } else {
+ HEAP32[146] = i7 | i8;
+ i28 = 624 + (i9 + 2 << 2) | 0;
+ i27 = i6;
+ }
+ HEAP32[i28 >> 2] = i5;
+ HEAP32[i27 + 12 >> 2] = i5;
+ HEAP32[i5 + 8 >> 2] = i27;
+ HEAP32[i5 + 12 >> 2] = i6;
+ }
+ HEAP32[592 >> 2] = i4;
+ HEAP32[604 >> 2] = i3;
+ i32 = i2;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i18 = HEAP32[588 >> 2] | 0;
+ if ((i18 | 0) != 0) {
+ i2 = (i18 & 0 - i18) + -1 | 0;
+ i31 = i2 >>> 12 & 16;
+ i2 = i2 >>> i31;
+ i30 = i2 >>> 5 & 8;
+ i2 = i2 >>> i30;
+ i32 = i2 >>> 2 & 4;
+ i2 = i2 >>> i32;
+ i6 = i2 >>> 1 & 2;
+ i2 = i2 >>> i6;
+ i3 = i2 >>> 1 & 1;
+ i3 = HEAP32[888 + ((i30 | i31 | i32 | i6 | i3) + (i2 >>> i3) << 2) >> 2] | 0;
+ i2 = (HEAP32[i3 + 4 >> 2] & -8) - i12 | 0;
+ i6 = i3;
+ while (1) {
+ i5 = HEAP32[i6 + 16 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ i5 = HEAP32[i6 + 20 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ }
+ i6 = (HEAP32[i5 + 4 >> 2] & -8) - i12 | 0;
+ i4 = i6 >>> 0 < i2 >>> 0;
+ i2 = i4 ? i6 : i2;
+ i6 = i5;
+ i3 = i4 ? i5 : i3;
+ }
+ i6 = HEAP32[600 >> 2] | 0;
+ if (i3 >>> 0 < i6 >>> 0) {
+ _abort();
+ }
+ i4 = i3 + i12 | 0;
+ if (!(i3 >>> 0 < i4 >>> 0)) {
+ _abort();
+ }
+ i5 = HEAP32[i3 + 24 >> 2] | 0;
+ i7 = HEAP32[i3 + 12 >> 2] | 0;
+ do {
+ if ((i7 | 0) == (i3 | 0)) {
+ i8 = i3 + 20 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ if ((i7 | 0) == 0) {
+ i8 = i3 + 16 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ if ((i7 | 0) == 0) {
+ i26 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i10 = i7 + 20 | 0;
+ i9 = HEAP32[i10 >> 2] | 0;
+ if ((i9 | 0) != 0) {
+ i7 = i9;
+ i8 = i10;
+ continue;
+ }
+ i10 = i7 + 16 | 0;
+ i9 = HEAP32[i10 >> 2] | 0;
+ if ((i9 | 0) == 0) {
+ break;
+ } else {
+ i7 = i9;
+ i8 = i10;
+ }
+ }
+ if (i8 >>> 0 < i6 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i8 >> 2] = 0;
+ i26 = i7;
+ break;
+ }
+ } else {
+ i8 = HEAP32[i3 + 8 >> 2] | 0;
+ if (i8 >>> 0 < i6 >>> 0) {
+ _abort();
+ }
+ i6 = i8 + 12 | 0;
+ if ((HEAP32[i6 >> 2] | 0) != (i3 | 0)) {
+ _abort();
+ }
+ i9 = i7 + 8 | 0;
+ if ((HEAP32[i9 >> 2] | 0) == (i3 | 0)) {
+ HEAP32[i6 >> 2] = i7;
+ HEAP32[i9 >> 2] = i8;
+ i26 = i7;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ do {
+ if ((i5 | 0) != 0) {
+ i7 = HEAP32[i3 + 28 >> 2] | 0;
+ i6 = 888 + (i7 << 2) | 0;
+ if ((i3 | 0) == (HEAP32[i6 >> 2] | 0)) {
+ HEAP32[i6 >> 2] = i26;
+ if ((i26 | 0) == 0) {
+ HEAP32[588 >> 2] = HEAP32[588 >> 2] & ~(1 << i7);
+ break;
+ }
+ } else {
+ if (i5 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i6 = i5 + 16 | 0;
+ if ((HEAP32[i6 >> 2] | 0) == (i3 | 0)) {
+ HEAP32[i6 >> 2] = i26;
+ } else {
+ HEAP32[i5 + 20 >> 2] = i26;
+ }
+ if ((i26 | 0) == 0) {
+ break;
+ }
+ }
+ if (i26 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i26 + 24 >> 2] = i5;
+ i5 = HEAP32[i3 + 16 >> 2] | 0;
+ do {
+ if ((i5 | 0) != 0) {
+ if (i5 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i26 + 16 >> 2] = i5;
+ HEAP32[i5 + 24 >> 2] = i26;
+ break;
+ }
+ }
+ } while (0);
+ i5 = HEAP32[i3 + 20 >> 2] | 0;
+ if ((i5 | 0) != 0) {
+ if (i5 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i26 + 20 >> 2] = i5;
+ HEAP32[i5 + 24 >> 2] = i26;
+ break;
+ }
+ }
+ }
+ } while (0);
+ if (i2 >>> 0 < 16) {
+ i32 = i2 + i12 | 0;
+ HEAP32[i3 + 4 >> 2] = i32 | 3;
+ i32 = i3 + (i32 + 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ } else {
+ HEAP32[i3 + 4 >> 2] = i12 | 3;
+ HEAP32[i3 + (i12 | 4) >> 2] = i2 | 1;
+ HEAP32[i3 + (i2 + i12) >> 2] = i2;
+ i6 = HEAP32[592 >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ i5 = HEAP32[604 >> 2] | 0;
+ i8 = i6 >>> 3;
+ i9 = i8 << 1;
+ i6 = 624 + (i9 << 2) | 0;
+ i7 = HEAP32[146] | 0;
+ i8 = 1 << i8;
+ if ((i7 & i8 | 0) != 0) {
+ i7 = 624 + (i9 + 2 << 2) | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ if (i8 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i25 = i7;
+ i24 = i8;
+ }
+ } else {
+ HEAP32[146] = i7 | i8;
+ i25 = 624 + (i9 + 2 << 2) | 0;
+ i24 = i6;
+ }
+ HEAP32[i25 >> 2] = i5;
+ HEAP32[i24 + 12 >> 2] = i5;
+ HEAP32[i5 + 8 >> 2] = i24;
+ HEAP32[i5 + 12 >> 2] = i6;
+ }
+ HEAP32[592 >> 2] = i2;
+ HEAP32[604 >> 2] = i4;
+ }
+ i32 = i3 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ }
+ } else {
+ if (!(i12 >>> 0 > 4294967231)) {
+ i24 = i12 + 11 | 0;
+ i12 = i24 & -8;
+ i26 = HEAP32[588 >> 2] | 0;
+ if ((i26 | 0) != 0) {
+ i25 = 0 - i12 | 0;
+ i24 = i24 >>> 8;
+ if ((i24 | 0) != 0) {
+ if (i12 >>> 0 > 16777215) {
+ i27 = 31;
+ } else {
+ i31 = (i24 + 1048320 | 0) >>> 16 & 8;
+ i32 = i24 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i27 = (i32 + 245760 | 0) >>> 16 & 2;
+ i27 = 14 - (i30 | i31 | i27) + (i32 << i27 >>> 15) | 0;
+ i27 = i12 >>> (i27 + 7 | 0) & 1 | i27 << 1;
+ }
+ } else {
+ i27 = 0;
+ }
+ i30 = HEAP32[888 + (i27 << 2) >> 2] | 0;
+ L126 : do {
+ if ((i30 | 0) == 0) {
+ i29 = 0;
+ i24 = 0;
+ } else {
+ if ((i27 | 0) == 31) {
+ i24 = 0;
+ } else {
+ i24 = 25 - (i27 >>> 1) | 0;
+ }
+ i29 = 0;
+ i28 = i12 << i24;
+ i24 = 0;
+ while (1) {
+ i32 = HEAP32[i30 + 4 >> 2] & -8;
+ i31 = i32 - i12 | 0;
+ if (i31 >>> 0 < i25 >>> 0) {
+ if ((i32 | 0) == (i12 | 0)) {
+ i25 = i31;
+ i29 = i30;
+ i24 = i30;
+ break L126;
+ } else {
+ i25 = i31;
+ i24 = i30;
+ }
+ }
+ i31 = HEAP32[i30 + 20 >> 2] | 0;
+ i30 = HEAP32[i30 + (i28 >>> 31 << 2) + 16 >> 2] | 0;
+ i29 = (i31 | 0) == 0 | (i31 | 0) == (i30 | 0) ? i29 : i31;
+ if ((i30 | 0) == 0) {
+ break;
+ } else {
+ i28 = i28 << 1;
+ }
+ }
+ }
+ } while (0);
+ if ((i29 | 0) == 0 & (i24 | 0) == 0) {
+ i32 = 2 << i27;
+ i26 = i26 & (i32 | 0 - i32);
+ if ((i26 | 0) == 0) {
+ break;
+ }
+ i32 = (i26 & 0 - i26) + -1 | 0;
+ i28 = i32 >>> 12 & 16;
+ i32 = i32 >>> i28;
+ i27 = i32 >>> 5 & 8;
+ i32 = i32 >>> i27;
+ i30 = i32 >>> 2 & 4;
+ i32 = i32 >>> i30;
+ i31 = i32 >>> 1 & 2;
+ i32 = i32 >>> i31;
+ i29 = i32 >>> 1 & 1;
+ i29 = HEAP32[888 + ((i27 | i28 | i30 | i31 | i29) + (i32 >>> i29) << 2) >> 2] | 0;
+ }
+ if ((i29 | 0) != 0) {
+ while (1) {
+ i27 = (HEAP32[i29 + 4 >> 2] & -8) - i12 | 0;
+ i26 = i27 >>> 0 < i25 >>> 0;
+ i25 = i26 ? i27 : i25;
+ i24 = i26 ? i29 : i24;
+ i26 = HEAP32[i29 + 16 >> 2] | 0;
+ if ((i26 | 0) != 0) {
+ i29 = i26;
+ continue;
+ }
+ i29 = HEAP32[i29 + 20 >> 2] | 0;
+ if ((i29 | 0) == 0) {
+ break;
+ }
+ }
+ }
+ if ((i24 | 0) != 0 ? i25 >>> 0 < ((HEAP32[592 >> 2] | 0) - i12 | 0) >>> 0 : 0) {
+ i4 = HEAP32[600 >> 2] | 0;
+ if (i24 >>> 0 < i4 >>> 0) {
+ _abort();
+ }
+ i2 = i24 + i12 | 0;
+ if (!(i24 >>> 0 < i2 >>> 0)) {
+ _abort();
+ }
+ i3 = HEAP32[i24 + 24 >> 2] | 0;
+ i6 = HEAP32[i24 + 12 >> 2] | 0;
+ do {
+ if ((i6 | 0) == (i24 | 0)) {
+ i6 = i24 + 20 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ i6 = i24 + 16 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ i22 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i8 = i5 + 20 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ if ((i7 | 0) != 0) {
+ i5 = i7;
+ i6 = i8;
+ continue;
+ }
+ i7 = i5 + 16 | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ if ((i8 | 0) == 0) {
+ break;
+ } else {
+ i5 = i8;
+ i6 = i7;
+ }
+ }
+ if (i6 >>> 0 < i4 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i6 >> 2] = 0;
+ i22 = i5;
+ break;
+ }
+ } else {
+ i5 = HEAP32[i24 + 8 >> 2] | 0;
+ if (i5 >>> 0 < i4 >>> 0) {
+ _abort();
+ }
+ i7 = i5 + 12 | 0;
+ if ((HEAP32[i7 >> 2] | 0) != (i24 | 0)) {
+ _abort();
+ }
+ i4 = i6 + 8 | 0;
+ if ((HEAP32[i4 >> 2] | 0) == (i24 | 0)) {
+ HEAP32[i7 >> 2] = i6;
+ HEAP32[i4 >> 2] = i5;
+ i22 = i6;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ do {
+ if ((i3 | 0) != 0) {
+ i4 = HEAP32[i24 + 28 >> 2] | 0;
+ i5 = 888 + (i4 << 2) | 0;
+ if ((i24 | 0) == (HEAP32[i5 >> 2] | 0)) {
+ HEAP32[i5 >> 2] = i22;
+ if ((i22 | 0) == 0) {
+ HEAP32[588 >> 2] = HEAP32[588 >> 2] & ~(1 << i4);
+ break;
+ }
+ } else {
+ if (i3 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i4 = i3 + 16 | 0;
+ if ((HEAP32[i4 >> 2] | 0) == (i24 | 0)) {
+ HEAP32[i4 >> 2] = i22;
+ } else {
+ HEAP32[i3 + 20 >> 2] = i22;
+ }
+ if ((i22 | 0) == 0) {
+ break;
+ }
+ }
+ if (i22 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i22 + 24 >> 2] = i3;
+ i3 = HEAP32[i24 + 16 >> 2] | 0;
+ do {
+ if ((i3 | 0) != 0) {
+ if (i3 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i22 + 16 >> 2] = i3;
+ HEAP32[i3 + 24 >> 2] = i22;
+ break;
+ }
+ }
+ } while (0);
+ i3 = HEAP32[i24 + 20 >> 2] | 0;
+ if ((i3 | 0) != 0) {
+ if (i3 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i22 + 20 >> 2] = i3;
+ HEAP32[i3 + 24 >> 2] = i22;
+ break;
+ }
+ }
+ }
+ } while (0);
+ L204 : do {
+ if (!(i25 >>> 0 < 16)) {
+ HEAP32[i24 + 4 >> 2] = i12 | 3;
+ HEAP32[i24 + (i12 | 4) >> 2] = i25 | 1;
+ HEAP32[i24 + (i25 + i12) >> 2] = i25;
+ i4 = i25 >>> 3;
+ if (i25 >>> 0 < 256) {
+ i6 = i4 << 1;
+ i3 = 624 + (i6 << 2) | 0;
+ i5 = HEAP32[146] | 0;
+ i4 = 1 << i4;
+ if ((i5 & i4 | 0) != 0) {
+ i5 = 624 + (i6 + 2 << 2) | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ if (i4 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i21 = i5;
+ i20 = i4;
+ }
+ } else {
+ HEAP32[146] = i5 | i4;
+ i21 = 624 + (i6 + 2 << 2) | 0;
+ i20 = i3;
+ }
+ HEAP32[i21 >> 2] = i2;
+ HEAP32[i20 + 12 >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i20;
+ HEAP32[i24 + (i12 + 12) >> 2] = i3;
+ break;
+ }
+ i3 = i25 >>> 8;
+ if ((i3 | 0) != 0) {
+ if (i25 >>> 0 > 16777215) {
+ i3 = 31;
+ } else {
+ i31 = (i3 + 1048320 | 0) >>> 16 & 8;
+ i32 = i3 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i3 = (i32 + 245760 | 0) >>> 16 & 2;
+ i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
+ i3 = i25 >>> (i3 + 7 | 0) & 1 | i3 << 1;
+ }
+ } else {
+ i3 = 0;
+ }
+ i6 = 888 + (i3 << 2) | 0;
+ HEAP32[i24 + (i12 + 28) >> 2] = i3;
+ HEAP32[i24 + (i12 + 20) >> 2] = 0;
+ HEAP32[i24 + (i12 + 16) >> 2] = 0;
+ i4 = HEAP32[588 >> 2] | 0;
+ i5 = 1 << i3;
+ if ((i4 & i5 | 0) == 0) {
+ HEAP32[588 >> 2] = i4 | i5;
+ HEAP32[i6 >> 2] = i2;
+ HEAP32[i24 + (i12 + 24) >> 2] = i6;
+ HEAP32[i24 + (i12 + 12) >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i2;
+ break;
+ }
+ i4 = HEAP32[i6 >> 2] | 0;
+ if ((i3 | 0) == 31) {
+ i3 = 0;
+ } else {
+ i3 = 25 - (i3 >>> 1) | 0;
+ }
+ L225 : do {
+ if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i25 | 0)) {
+ i3 = i25 << i3;
+ while (1) {
+ i6 = i4 + (i3 >>> 31 << 2) + 16 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) == (i25 | 0)) {
+ i18 = i5;
+ break L225;
+ } else {
+ i3 = i3 << 1;
+ i4 = i5;
+ }
+ }
+ if (i6 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i6 >> 2] = i2;
+ HEAP32[i24 + (i12 + 24) >> 2] = i4;
+ HEAP32[i24 + (i12 + 12) >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i2;
+ break L204;
+ }
+ } else {
+ i18 = i4;
+ }
+ } while (0);
+ i4 = i18 + 8 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ i5 = HEAP32[600 >> 2] | 0;
+ if (i18 >>> 0 < i5 >>> 0) {
+ _abort();
+ }
+ if (i3 >>> 0 < i5 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i3 + 12 >> 2] = i2;
+ HEAP32[i4 >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i3;
+ HEAP32[i24 + (i12 + 12) >> 2] = i18;
+ HEAP32[i24 + (i12 + 24) >> 2] = 0;
+ break;
+ }
+ } else {
+ i32 = i25 + i12 | 0;
+ HEAP32[i24 + 4 >> 2] = i32 | 3;
+ i32 = i24 + (i32 + 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ }
+ } while (0);
+ i32 = i24 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ }
+ } else {
+ i12 = -1;
+ }
+ }
+ } while (0);
+ i18 = HEAP32[592 >> 2] | 0;
+ if (!(i12 >>> 0 > i18 >>> 0)) {
+ i3 = i18 - i12 | 0;
+ i2 = HEAP32[604 >> 2] | 0;
+ if (i3 >>> 0 > 15) {
+ HEAP32[604 >> 2] = i2 + i12;
+ HEAP32[592 >> 2] = i3;
+ HEAP32[i2 + (i12 + 4) >> 2] = i3 | 1;
+ HEAP32[i2 + i18 >> 2] = i3;
+ HEAP32[i2 + 4 >> 2] = i12 | 3;
+ } else {
+ HEAP32[592 >> 2] = 0;
+ HEAP32[604 >> 2] = 0;
+ HEAP32[i2 + 4 >> 2] = i18 | 3;
+ i32 = i2 + (i18 + 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ }
+ i32 = i2 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i18 = HEAP32[596 >> 2] | 0;
+ if (i12 >>> 0 < i18 >>> 0) {
+ i31 = i18 - i12 | 0;
+ HEAP32[596 >> 2] = i31;
+ i32 = HEAP32[608 >> 2] | 0;
+ HEAP32[608 >> 2] = i32 + i12;
+ HEAP32[i32 + (i12 + 4) >> 2] = i31 | 1;
+ HEAP32[i32 + 4 >> 2] = i12 | 3;
+ i32 = i32 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ do {
+ if ((HEAP32[264] | 0) == 0) {
+ i18 = _sysconf(30) | 0;
+ if ((i18 + -1 & i18 | 0) == 0) {
+ HEAP32[1064 >> 2] = i18;
+ HEAP32[1060 >> 2] = i18;
+ HEAP32[1068 >> 2] = -1;
+ HEAP32[1072 >> 2] = -1;
+ HEAP32[1076 >> 2] = 0;
+ HEAP32[1028 >> 2] = 0;
+ HEAP32[264] = (_time(0) | 0) & -16 ^ 1431655768;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ i20 = i12 + 48 | 0;
+ i25 = HEAP32[1064 >> 2] | 0;
+ i21 = i12 + 47 | 0;
+ i22 = i25 + i21 | 0;
+ i25 = 0 - i25 | 0;
+ i18 = i22 & i25;
+ if (!(i18 >>> 0 > i12 >>> 0)) {
+ i32 = 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i24 = HEAP32[1024 >> 2] | 0;
+ if ((i24 | 0) != 0 ? (i31 = HEAP32[1016 >> 2] | 0, i32 = i31 + i18 | 0, i32 >>> 0 <= i31 >>> 0 | i32 >>> 0 > i24 >>> 0) : 0) {
+ i32 = 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ L269 : do {
+ if ((HEAP32[1028 >> 2] & 4 | 0) == 0) {
+ i26 = HEAP32[608 >> 2] | 0;
+ L271 : do {
+ if ((i26 | 0) != 0) {
+ i24 = 1032 | 0;
+ while (1) {
+ i27 = HEAP32[i24 >> 2] | 0;
+ if (!(i27 >>> 0 > i26 >>> 0) ? (i23 = i24 + 4 | 0, (i27 + (HEAP32[i23 >> 2] | 0) | 0) >>> 0 > i26 >>> 0) : 0) {
+ break;
+ }
+ i24 = HEAP32[i24 + 8 >> 2] | 0;
+ if ((i24 | 0) == 0) {
+ i13 = 182;
+ break L271;
+ }
+ }
+ if ((i24 | 0) != 0) {
+ i25 = i22 - (HEAP32[596 >> 2] | 0) & i25;
+ if (i25 >>> 0 < 2147483647) {
+ i13 = _sbrk(i25 | 0) | 0;
+ i26 = (i13 | 0) == ((HEAP32[i24 >> 2] | 0) + (HEAP32[i23 >> 2] | 0) | 0);
+ i22 = i13;
+ i24 = i25;
+ i23 = i26 ? i13 : -1;
+ i25 = i26 ? i25 : 0;
+ i13 = 191;
+ } else {
+ i25 = 0;
+ }
+ } else {
+ i13 = 182;
+ }
+ } else {
+ i13 = 182;
+ }
+ } while (0);
+ do {
+ if ((i13 | 0) == 182) {
+ i23 = _sbrk(0) | 0;
+ if ((i23 | 0) != (-1 | 0)) {
+ i24 = i23;
+ i22 = HEAP32[1060 >> 2] | 0;
+ i25 = i22 + -1 | 0;
+ if ((i25 & i24 | 0) == 0) {
+ i25 = i18;
+ } else {
+ i25 = i18 - i24 + (i25 + i24 & 0 - i22) | 0;
+ }
+ i24 = HEAP32[1016 >> 2] | 0;
+ i26 = i24 + i25 | 0;
+ if (i25 >>> 0 > i12 >>> 0 & i25 >>> 0 < 2147483647) {
+ i22 = HEAP32[1024 >> 2] | 0;
+ if ((i22 | 0) != 0 ? i26 >>> 0 <= i24 >>> 0 | i26 >>> 0 > i22 >>> 0 : 0) {
+ i25 = 0;
+ break;
+ }
+ i22 = _sbrk(i25 | 0) | 0;
+ i13 = (i22 | 0) == (i23 | 0);
+ i24 = i25;
+ i23 = i13 ? i23 : -1;
+ i25 = i13 ? i25 : 0;
+ i13 = 191;
+ } else {
+ i25 = 0;
+ }
+ } else {
+ i25 = 0;
+ }
+ }
+ } while (0);
+ L291 : do {
+ if ((i13 | 0) == 191) {
+ i13 = 0 - i24 | 0;
+ if ((i23 | 0) != (-1 | 0)) {
+ i17 = i23;
+ i14 = i25;
+ i13 = 202;
+ break L269;
+ }
+ do {
+ if ((i22 | 0) != (-1 | 0) & i24 >>> 0 < 2147483647 & i24 >>> 0 < i20 >>> 0 ? (i19 = HEAP32[1064 >> 2] | 0, i19 = i21 - i24 + i19 & 0 - i19, i19 >>> 0 < 2147483647) : 0) {
+ if ((_sbrk(i19 | 0) | 0) == (-1 | 0)) {
+ _sbrk(i13 | 0) | 0;
+ break L291;
+ } else {
+ i24 = i19 + i24 | 0;
+ break;
+ }
+ }
+ } while (0);
+ if ((i22 | 0) != (-1 | 0)) {
+ i17 = i22;
+ i14 = i24;
+ i13 = 202;
+ break L269;
+ }
+ }
+ } while (0);
+ HEAP32[1028 >> 2] = HEAP32[1028 >> 2] | 4;
+ i13 = 199;
+ } else {
+ i25 = 0;
+ i13 = 199;
+ }
+ } while (0);
+ if ((((i13 | 0) == 199 ? i18 >>> 0 < 2147483647 : 0) ? (i17 = _sbrk(i18 | 0) | 0, i16 = _sbrk(0) | 0, (i16 | 0) != (-1 | 0) & (i17 | 0) != (-1 | 0) & i17 >>> 0 < i16 >>> 0) : 0) ? (i15 = i16 - i17 | 0, i14 = i15 >>> 0 > (i12 + 40 | 0) >>> 0, i14) : 0) {
+ i14 = i14 ? i15 : i25;
+ i13 = 202;
+ }
+ if ((i13 | 0) == 202) {
+ i15 = (HEAP32[1016 >> 2] | 0) + i14 | 0;
+ HEAP32[1016 >> 2] = i15;
+ if (i15 >>> 0 > (HEAP32[1020 >> 2] | 0) >>> 0) {
+ HEAP32[1020 >> 2] = i15;
+ }
+ i15 = HEAP32[608 >> 2] | 0;
+ L311 : do {
+ if ((i15 | 0) != 0) {
+ i21 = 1032 | 0;
+ while (1) {
+ i16 = HEAP32[i21 >> 2] | 0;
+ i19 = i21 + 4 | 0;
+ i20 = HEAP32[i19 >> 2] | 0;
+ if ((i17 | 0) == (i16 + i20 | 0)) {
+ i13 = 214;
+ break;
+ }
+ i18 = HEAP32[i21 + 8 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ break;
+ } else {
+ i21 = i18;
+ }
+ }
+ if (((i13 | 0) == 214 ? (HEAP32[i21 + 12 >> 2] & 8 | 0) == 0 : 0) ? i15 >>> 0 >= i16 >>> 0 & i15 >>> 0 < i17 >>> 0 : 0) {
+ HEAP32[i19 >> 2] = i20 + i14;
+ i2 = (HEAP32[596 >> 2] | 0) + i14 | 0;
+ i3 = i15 + 8 | 0;
+ if ((i3 & 7 | 0) == 0) {
+ i3 = 0;
+ } else {
+ i3 = 0 - i3 & 7;
+ }
+ i32 = i2 - i3 | 0;
+ HEAP32[608 >> 2] = i15 + i3;
+ HEAP32[596 >> 2] = i32;
+ HEAP32[i15 + (i3 + 4) >> 2] = i32 | 1;
+ HEAP32[i15 + (i2 + 4) >> 2] = 40;
+ HEAP32[612 >> 2] = HEAP32[1072 >> 2];
+ break;
+ }
+ if (i17 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ HEAP32[600 >> 2] = i17;
+ }
+ i19 = i17 + i14 | 0;
+ i16 = 1032 | 0;
+ while (1) {
+ if ((HEAP32[i16 >> 2] | 0) == (i19 | 0)) {
+ i13 = 224;
+ break;
+ }
+ i18 = HEAP32[i16 + 8 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ break;
+ } else {
+ i16 = i18;
+ }
+ }
+ if ((i13 | 0) == 224 ? (HEAP32[i16 + 12 >> 2] & 8 | 0) == 0 : 0) {
+ HEAP32[i16 >> 2] = i17;
+ i6 = i16 + 4 | 0;
+ HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + i14;
+ i6 = i17 + 8 | 0;
+ if ((i6 & 7 | 0) == 0) {
+ i6 = 0;
+ } else {
+ i6 = 0 - i6 & 7;
+ }
+ i7 = i17 + (i14 + 8) | 0;
+ if ((i7 & 7 | 0) == 0) {
+ i13 = 0;
+ } else {
+ i13 = 0 - i7 & 7;
+ }
+ i15 = i17 + (i13 + i14) | 0;
+ i8 = i6 + i12 | 0;
+ i7 = i17 + i8 | 0;
+ i10 = i15 - (i17 + i6) - i12 | 0;
+ HEAP32[i17 + (i6 + 4) >> 2] = i12 | 3;
+ L348 : do {
+ if ((i15 | 0) != (HEAP32[608 >> 2] | 0)) {
+ if ((i15 | 0) == (HEAP32[604 >> 2] | 0)) {
+ i32 = (HEAP32[592 >> 2] | 0) + i10 | 0;
+ HEAP32[592 >> 2] = i32;
+ HEAP32[604 >> 2] = i7;
+ HEAP32[i17 + (i8 + 4) >> 2] = i32 | 1;
+ HEAP32[i17 + (i32 + i8) >> 2] = i32;
+ break;
+ }
+ i12 = i14 + 4 | 0;
+ i18 = HEAP32[i17 + (i12 + i13) >> 2] | 0;
+ if ((i18 & 3 | 0) == 1) {
+ i11 = i18 & -8;
+ i16 = i18 >>> 3;
+ do {
+ if (!(i18 >>> 0 < 256)) {
+ i9 = HEAP32[i17 + ((i13 | 24) + i14) >> 2] | 0;
+ i19 = HEAP32[i17 + (i14 + 12 + i13) >> 2] | 0;
+ do {
+ if ((i19 | 0) == (i15 | 0)) {
+ i19 = i13 | 16;
+ i18 = i17 + (i12 + i19) | 0;
+ i16 = HEAP32[i18 >> 2] | 0;
+ if ((i16 | 0) == 0) {
+ i18 = i17 + (i19 + i14) | 0;
+ i16 = HEAP32[i18 >> 2] | 0;
+ if ((i16 | 0) == 0) {
+ i5 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i20 = i16 + 20 | 0;
+ i19 = HEAP32[i20 >> 2] | 0;
+ if ((i19 | 0) != 0) {
+ i16 = i19;
+ i18 = i20;
+ continue;
+ }
+ i19 = i16 + 16 | 0;
+ i20 = HEAP32[i19 >> 2] | 0;
+ if ((i20 | 0) == 0) {
+ break;
+ } else {
+ i16 = i20;
+ i18 = i19;
+ }
+ }
+ if (i18 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i18 >> 2] = 0;
+ i5 = i16;
+ break;
+ }
+ } else {
+ i18 = HEAP32[i17 + ((i13 | 8) + i14) >> 2] | 0;
+ if (i18 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i18 + 12 | 0;
+ if ((HEAP32[i16 >> 2] | 0) != (i15 | 0)) {
+ _abort();
+ }
+ i20 = i19 + 8 | 0;
+ if ((HEAP32[i20 >> 2] | 0) == (i15 | 0)) {
+ HEAP32[i16 >> 2] = i19;
+ HEAP32[i20 >> 2] = i18;
+ i5 = i19;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ if ((i9 | 0) != 0) {
+ i16 = HEAP32[i17 + (i14 + 28 + i13) >> 2] | 0;
+ i18 = 888 + (i16 << 2) | 0;
+ if ((i15 | 0) == (HEAP32[i18 >> 2] | 0)) {
+ HEAP32[i18 >> 2] = i5;
+ if ((i5 | 0) == 0) {
+ HEAP32[588 >> 2] = HEAP32[588 >> 2] & ~(1 << i16);
+ break;
+ }
+ } else {
+ if (i9 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i9 + 16 | 0;
+ if ((HEAP32[i16 >> 2] | 0) == (i15 | 0)) {
+ HEAP32[i16 >> 2] = i5;
+ } else {
+ HEAP32[i9 + 20 >> 2] = i5;
+ }
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ }
+ if (i5 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i5 + 24 >> 2] = i9;
+ i15 = i13 | 16;
+ i9 = HEAP32[i17 + (i15 + i14) >> 2] | 0;
+ do {
+ if ((i9 | 0) != 0) {
+ if (i9 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i5 + 16 >> 2] = i9;
+ HEAP32[i9 + 24 >> 2] = i5;
+ break;
+ }
+ }
+ } while (0);
+ i9 = HEAP32[i17 + (i12 + i15) >> 2] | 0;
+ if ((i9 | 0) != 0) {
+ if (i9 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i5 + 20 >> 2] = i9;
+ HEAP32[i9 + 24 >> 2] = i5;
+ break;
+ }
+ }
+ }
+ } else {
+ i5 = HEAP32[i17 + ((i13 | 8) + i14) >> 2] | 0;
+ i12 = HEAP32[i17 + (i14 + 12 + i13) >> 2] | 0;
+ i18 = 624 + (i16 << 1 << 2) | 0;
+ if ((i5 | 0) != (i18 | 0)) {
+ if (i5 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ if ((HEAP32[i5 + 12 >> 2] | 0) != (i15 | 0)) {
+ _abort();
+ }
+ }
+ if ((i12 | 0) == (i5 | 0)) {
+ HEAP32[146] = HEAP32[146] & ~(1 << i16);
+ break;
+ }
+ if ((i12 | 0) != (i18 | 0)) {
+ if (i12 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i12 + 8 | 0;
+ if ((HEAP32[i16 >> 2] | 0) == (i15 | 0)) {
+ i9 = i16;
+ } else {
+ _abort();
+ }
+ } else {
+ i9 = i12 + 8 | 0;
+ }
+ HEAP32[i5 + 12 >> 2] = i12;
+ HEAP32[i9 >> 2] = i5;
+ }
+ } while (0);
+ i15 = i17 + ((i11 | i13) + i14) | 0;
+ i10 = i11 + i10 | 0;
+ }
+ i5 = i15 + 4 | 0;
+ HEAP32[i5 >> 2] = HEAP32[i5 >> 2] & -2;
+ HEAP32[i17 + (i8 + 4) >> 2] = i10 | 1;
+ HEAP32[i17 + (i10 + i8) >> 2] = i10;
+ i5 = i10 >>> 3;
+ if (i10 >>> 0 < 256) {
+ i10 = i5 << 1;
+ i2 = 624 + (i10 << 2) | 0;
+ i9 = HEAP32[146] | 0;
+ i5 = 1 << i5;
+ if ((i9 & i5 | 0) != 0) {
+ i9 = 624 + (i10 + 2 << 2) | 0;
+ i5 = HEAP32[i9 >> 2] | 0;
+ if (i5 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i3 = i9;
+ i4 = i5;
+ }
+ } else {
+ HEAP32[146] = i9 | i5;
+ i3 = 624 + (i10 + 2 << 2) | 0;
+ i4 = i2;
+ }
+ HEAP32[i3 >> 2] = i7;
+ HEAP32[i4 + 12 >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i4;
+ HEAP32[i17 + (i8 + 12) >> 2] = i2;
+ break;
+ }
+ i3 = i10 >>> 8;
+ if ((i3 | 0) != 0) {
+ if (i10 >>> 0 > 16777215) {
+ i3 = 31;
+ } else {
+ i31 = (i3 + 1048320 | 0) >>> 16 & 8;
+ i32 = i3 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i3 = (i32 + 245760 | 0) >>> 16 & 2;
+ i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
+ i3 = i10 >>> (i3 + 7 | 0) & 1 | i3 << 1;
+ }
+ } else {
+ i3 = 0;
+ }
+ i4 = 888 + (i3 << 2) | 0;
+ HEAP32[i17 + (i8 + 28) >> 2] = i3;
+ HEAP32[i17 + (i8 + 20) >> 2] = 0;
+ HEAP32[i17 + (i8 + 16) >> 2] = 0;
+ i9 = HEAP32[588 >> 2] | 0;
+ i5 = 1 << i3;
+ if ((i9 & i5 | 0) == 0) {
+ HEAP32[588 >> 2] = i9 | i5;
+ HEAP32[i4 >> 2] = i7;
+ HEAP32[i17 + (i8 + 24) >> 2] = i4;
+ HEAP32[i17 + (i8 + 12) >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i7;
+ break;
+ }
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((i3 | 0) == 31) {
+ i3 = 0;
+ } else {
+ i3 = 25 - (i3 >>> 1) | 0;
+ }
+ L444 : do {
+ if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i10 | 0)) {
+ i3 = i10 << i3;
+ while (1) {
+ i5 = i4 + (i3 >>> 31 << 2) + 16 | 0;
+ i9 = HEAP32[i5 >> 2] | 0;
+ if ((i9 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i9 + 4 >> 2] & -8 | 0) == (i10 | 0)) {
+ i2 = i9;
+ break L444;
+ } else {
+ i3 = i3 << 1;
+ i4 = i9;
+ }
+ }
+ if (i5 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i5 >> 2] = i7;
+ HEAP32[i17 + (i8 + 24) >> 2] = i4;
+ HEAP32[i17 + (i8 + 12) >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i7;
+ break L348;
+ }
+ } else {
+ i2 = i4;
+ }
+ } while (0);
+ i4 = i2 + 8 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ i5 = HEAP32[600 >> 2] | 0;
+ if (i2 >>> 0 < i5 >>> 0) {
+ _abort();
+ }
+ if (i3 >>> 0 < i5 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i3 + 12 >> 2] = i7;
+ HEAP32[i4 >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i3;
+ HEAP32[i17 + (i8 + 12) >> 2] = i2;
+ HEAP32[i17 + (i8 + 24) >> 2] = 0;
+ break;
+ }
+ } else {
+ i32 = (HEAP32[596 >> 2] | 0) + i10 | 0;
+ HEAP32[596 >> 2] = i32;
+ HEAP32[608 >> 2] = i7;
+ HEAP32[i17 + (i8 + 4) >> 2] = i32 | 1;
+ }
+ } while (0);
+ i32 = i17 + (i6 | 8) | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i3 = 1032 | 0;
+ while (1) {
+ i2 = HEAP32[i3 >> 2] | 0;
+ if (!(i2 >>> 0 > i15 >>> 0) ? (i11 = HEAP32[i3 + 4 >> 2] | 0, i10 = i2 + i11 | 0, i10 >>> 0 > i15 >>> 0) : 0) {
+ break;
+ }
+ i3 = HEAP32[i3 + 8 >> 2] | 0;
+ }
+ i3 = i2 + (i11 + -39) | 0;
+ if ((i3 & 7 | 0) == 0) {
+ i3 = 0;
+ } else {
+ i3 = 0 - i3 & 7;
+ }
+ i2 = i2 + (i11 + -47 + i3) | 0;
+ i2 = i2 >>> 0 < (i15 + 16 | 0) >>> 0 ? i15 : i2;
+ i3 = i2 + 8 | 0;
+ i4 = i17 + 8 | 0;
+ if ((i4 & 7 | 0) == 0) {
+ i4 = 0;
+ } else {
+ i4 = 0 - i4 & 7;
+ }
+ i32 = i14 + -40 - i4 | 0;
+ HEAP32[608 >> 2] = i17 + i4;
+ HEAP32[596 >> 2] = i32;
+ HEAP32[i17 + (i4 + 4) >> 2] = i32 | 1;
+ HEAP32[i17 + (i14 + -36) >> 2] = 40;
+ HEAP32[612 >> 2] = HEAP32[1072 >> 2];
+ HEAP32[i2 + 4 >> 2] = 27;
+ HEAP32[i3 + 0 >> 2] = HEAP32[1032 >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[1036 >> 2];
+ HEAP32[i3 + 8 >> 2] = HEAP32[1040 >> 2];
+ HEAP32[i3 + 12 >> 2] = HEAP32[1044 >> 2];
+ HEAP32[1032 >> 2] = i17;
+ HEAP32[1036 >> 2] = i14;
+ HEAP32[1044 >> 2] = 0;
+ HEAP32[1040 >> 2] = i3;
+ i4 = i2 + 28 | 0;
+ HEAP32[i4 >> 2] = 7;
+ if ((i2 + 32 | 0) >>> 0 < i10 >>> 0) {
+ while (1) {
+ i3 = i4 + 4 | 0;
+ HEAP32[i3 >> 2] = 7;
+ if ((i4 + 8 | 0) >>> 0 < i10 >>> 0) {
+ i4 = i3;
+ } else {
+ break;
+ }
+ }
+ }
+ if ((i2 | 0) != (i15 | 0)) {
+ i2 = i2 - i15 | 0;
+ i3 = i15 + (i2 + 4) | 0;
+ HEAP32[i3 >> 2] = HEAP32[i3 >> 2] & -2;
+ HEAP32[i15 + 4 >> 2] = i2 | 1;
+ HEAP32[i15 + i2 >> 2] = i2;
+ i3 = i2 >>> 3;
+ if (i2 >>> 0 < 256) {
+ i4 = i3 << 1;
+ i2 = 624 + (i4 << 2) | 0;
+ i5 = HEAP32[146] | 0;
+ i3 = 1 << i3;
+ if ((i5 & i3 | 0) != 0) {
+ i4 = 624 + (i4 + 2 << 2) | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ if (i3 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i7 = i4;
+ i8 = i3;
+ }
+ } else {
+ HEAP32[146] = i5 | i3;
+ i7 = 624 + (i4 + 2 << 2) | 0;
+ i8 = i2;
+ }
+ HEAP32[i7 >> 2] = i15;
+ HEAP32[i8 + 12 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i8;
+ HEAP32[i15 + 12 >> 2] = i2;
+ break;
+ }
+ i3 = i2 >>> 8;
+ if ((i3 | 0) != 0) {
+ if (i2 >>> 0 > 16777215) {
+ i3 = 31;
+ } else {
+ i31 = (i3 + 1048320 | 0) >>> 16 & 8;
+ i32 = i3 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i3 = (i32 + 245760 | 0) >>> 16 & 2;
+ i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
+ i3 = i2 >>> (i3 + 7 | 0) & 1 | i3 << 1;
+ }
+ } else {
+ i3 = 0;
+ }
+ i7 = 888 + (i3 << 2) | 0;
+ HEAP32[i15 + 28 >> 2] = i3;
+ HEAP32[i15 + 20 >> 2] = 0;
+ HEAP32[i15 + 16 >> 2] = 0;
+ i4 = HEAP32[588 >> 2] | 0;
+ i5 = 1 << i3;
+ if ((i4 & i5 | 0) == 0) {
+ HEAP32[588 >> 2] = i4 | i5;
+ HEAP32[i7 >> 2] = i15;
+ HEAP32[i15 + 24 >> 2] = i7;
+ HEAP32[i15 + 12 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i15;
+ break;
+ }
+ i4 = HEAP32[i7 >> 2] | 0;
+ if ((i3 | 0) == 31) {
+ i3 = 0;
+ } else {
+ i3 = 25 - (i3 >>> 1) | 0;
+ }
+ L499 : do {
+ if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i2 | 0)) {
+ i3 = i2 << i3;
+ while (1) {
+ i7 = i4 + (i3 >>> 31 << 2) + 16 | 0;
+ i5 = HEAP32[i7 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) == (i2 | 0)) {
+ i6 = i5;
+ break L499;
+ } else {
+ i3 = i3 << 1;
+ i4 = i5;
+ }
+ }
+ if (i7 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i7 >> 2] = i15;
+ HEAP32[i15 + 24 >> 2] = i4;
+ HEAP32[i15 + 12 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i15;
+ break L311;
+ }
+ } else {
+ i6 = i4;
+ }
+ } while (0);
+ i4 = i6 + 8 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ i2 = HEAP32[600 >> 2] | 0;
+ if (i6 >>> 0 < i2 >>> 0) {
+ _abort();
+ }
+ if (i3 >>> 0 < i2 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i3 + 12 >> 2] = i15;
+ HEAP32[i4 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i3;
+ HEAP32[i15 + 12 >> 2] = i6;
+ HEAP32[i15 + 24 >> 2] = 0;
+ break;
+ }
+ }
+ } else {
+ i32 = HEAP32[600 >> 2] | 0;
+ if ((i32 | 0) == 0 | i17 >>> 0 < i32 >>> 0) {
+ HEAP32[600 >> 2] = i17;
+ }
+ HEAP32[1032 >> 2] = i17;
+ HEAP32[1036 >> 2] = i14;
+ HEAP32[1044 >> 2] = 0;
+ HEAP32[620 >> 2] = HEAP32[264];
+ HEAP32[616 >> 2] = -1;
+ i2 = 0;
+ do {
+ i32 = i2 << 1;
+ i31 = 624 + (i32 << 2) | 0;
+ HEAP32[624 + (i32 + 3 << 2) >> 2] = i31;
+ HEAP32[624 + (i32 + 2 << 2) >> 2] = i31;
+ i2 = i2 + 1 | 0;
+ } while ((i2 | 0) != 32);
+ i2 = i17 + 8 | 0;
+ if ((i2 & 7 | 0) == 0) {
+ i2 = 0;
+ } else {
+ i2 = 0 - i2 & 7;
+ }
+ i32 = i14 + -40 - i2 | 0;
+ HEAP32[608 >> 2] = i17 + i2;
+ HEAP32[596 >> 2] = i32;
+ HEAP32[i17 + (i2 + 4) >> 2] = i32 | 1;
+ HEAP32[i17 + (i14 + -36) >> 2] = 40;
+ HEAP32[612 >> 2] = HEAP32[1072 >> 2];
+ }
+ } while (0);
+ i2 = HEAP32[596 >> 2] | 0;
+ if (i2 >>> 0 > i12 >>> 0) {
+ i31 = i2 - i12 | 0;
+ HEAP32[596 >> 2] = i31;
+ i32 = HEAP32[608 >> 2] | 0;
+ HEAP32[608 >> 2] = i32 + i12;
+ HEAP32[i32 + (i12 + 4) >> 2] = i31 | 1;
+ HEAP32[i32 + 4 >> 2] = i12 | 3;
+ i32 = i32 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ }
+ HEAP32[(___errno_location() | 0) >> 2] = 12;
+ i32 = 0;
+ STACKTOP = i1;
+ return i32 | 0;
+}
+function _free(i7) {
+ i7 = i7 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0;
+ i1 = STACKTOP;
+ if ((i7 | 0) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i15 = i7 + -8 | 0;
+ i16 = HEAP32[600 >> 2] | 0;
+ if (i15 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ i13 = HEAP32[i7 + -4 >> 2] | 0;
+ i12 = i13 & 3;
+ if ((i12 | 0) == 1) {
+ _abort();
+ }
+ i8 = i13 & -8;
+ i6 = i7 + (i8 + -8) | 0;
+ do {
+ if ((i13 & 1 | 0) == 0) {
+ i19 = HEAP32[i15 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i15 = -8 - i19 | 0;
+ i13 = i7 + i15 | 0;
+ i12 = i19 + i8 | 0;
+ if (i13 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ if ((i13 | 0) == (HEAP32[604 >> 2] | 0)) {
+ i2 = i7 + (i8 + -4) | 0;
+ if ((HEAP32[i2 >> 2] & 3 | 0) != 3) {
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ HEAP32[592 >> 2] = i12;
+ HEAP32[i2 >> 2] = HEAP32[i2 >> 2] & -2;
+ HEAP32[i7 + (i15 + 4) >> 2] = i12 | 1;
+ HEAP32[i6 >> 2] = i12;
+ STACKTOP = i1;
+ return;
+ }
+ i18 = i19 >>> 3;
+ if (i19 >>> 0 < 256) {
+ i2 = HEAP32[i7 + (i15 + 8) >> 2] | 0;
+ i11 = HEAP32[i7 + (i15 + 12) >> 2] | 0;
+ i14 = 624 + (i18 << 1 << 2) | 0;
+ if ((i2 | 0) != (i14 | 0)) {
+ if (i2 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ if ((HEAP32[i2 + 12 >> 2] | 0) != (i13 | 0)) {
+ _abort();
+ }
+ }
+ if ((i11 | 0) == (i2 | 0)) {
+ HEAP32[146] = HEAP32[146] & ~(1 << i18);
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ if ((i11 | 0) != (i14 | 0)) {
+ if (i11 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ i14 = i11 + 8 | 0;
+ if ((HEAP32[i14 >> 2] | 0) == (i13 | 0)) {
+ i17 = i14;
+ } else {
+ _abort();
+ }
+ } else {
+ i17 = i11 + 8 | 0;
+ }
+ HEAP32[i2 + 12 >> 2] = i11;
+ HEAP32[i17 >> 2] = i2;
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ i17 = HEAP32[i7 + (i15 + 24) >> 2] | 0;
+ i18 = HEAP32[i7 + (i15 + 12) >> 2] | 0;
+ do {
+ if ((i18 | 0) == (i13 | 0)) {
+ i19 = i7 + (i15 + 20) | 0;
+ i18 = HEAP32[i19 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ i19 = i7 + (i15 + 16) | 0;
+ i18 = HEAP32[i19 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ i14 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i21 = i18 + 20 | 0;
+ i20 = HEAP32[i21 >> 2] | 0;
+ if ((i20 | 0) != 0) {
+ i18 = i20;
+ i19 = i21;
+ continue;
+ }
+ i20 = i18 + 16 | 0;
+ i21 = HEAP32[i20 >> 2] | 0;
+ if ((i21 | 0) == 0) {
+ break;
+ } else {
+ i18 = i21;
+ i19 = i20;
+ }
+ }
+ if (i19 >>> 0 < i16 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i19 >> 2] = 0;
+ i14 = i18;
+ break;
+ }
+ } else {
+ i19 = HEAP32[i7 + (i15 + 8) >> 2] | 0;
+ if (i19 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ i16 = i19 + 12 | 0;
+ if ((HEAP32[i16 >> 2] | 0) != (i13 | 0)) {
+ _abort();
+ }
+ i20 = i18 + 8 | 0;
+ if ((HEAP32[i20 >> 2] | 0) == (i13 | 0)) {
+ HEAP32[i16 >> 2] = i18;
+ HEAP32[i20 >> 2] = i19;
+ i14 = i18;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ if ((i17 | 0) != 0) {
+ i18 = HEAP32[i7 + (i15 + 28) >> 2] | 0;
+ i16 = 888 + (i18 << 2) | 0;
+ if ((i13 | 0) == (HEAP32[i16 >> 2] | 0)) {
+ HEAP32[i16 >> 2] = i14;
+ if ((i14 | 0) == 0) {
+ HEAP32[588 >> 2] = HEAP32[588 >> 2] & ~(1 << i18);
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ } else {
+ if (i17 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i17 + 16 | 0;
+ if ((HEAP32[i16 >> 2] | 0) == (i13 | 0)) {
+ HEAP32[i16 >> 2] = i14;
+ } else {
+ HEAP32[i17 + 20 >> 2] = i14;
+ }
+ if ((i14 | 0) == 0) {
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ }
+ if (i14 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i14 + 24 >> 2] = i17;
+ i16 = HEAP32[i7 + (i15 + 16) >> 2] | 0;
+ do {
+ if ((i16 | 0) != 0) {
+ if (i16 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i14 + 16 >> 2] = i16;
+ HEAP32[i16 + 24 >> 2] = i14;
+ break;
+ }
+ }
+ } while (0);
+ i15 = HEAP32[i7 + (i15 + 20) >> 2] | 0;
+ if ((i15 | 0) != 0) {
+ if (i15 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i14 + 20 >> 2] = i15;
+ HEAP32[i15 + 24 >> 2] = i14;
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ } else {
+ i2 = i13;
+ i11 = i12;
+ }
+ } else {
+ i2 = i13;
+ i11 = i12;
+ }
+ } else {
+ i2 = i15;
+ i11 = i8;
+ }
+ } while (0);
+ if (!(i2 >>> 0 < i6 >>> 0)) {
+ _abort();
+ }
+ i12 = i7 + (i8 + -4) | 0;
+ i13 = HEAP32[i12 >> 2] | 0;
+ if ((i13 & 1 | 0) == 0) {
+ _abort();
+ }
+ if ((i13 & 2 | 0) == 0) {
+ if ((i6 | 0) == (HEAP32[608 >> 2] | 0)) {
+ i21 = (HEAP32[596 >> 2] | 0) + i11 | 0;
+ HEAP32[596 >> 2] = i21;
+ HEAP32[608 >> 2] = i2;
+ HEAP32[i2 + 4 >> 2] = i21 | 1;
+ if ((i2 | 0) != (HEAP32[604 >> 2] | 0)) {
+ STACKTOP = i1;
+ return;
+ }
+ HEAP32[604 >> 2] = 0;
+ HEAP32[592 >> 2] = 0;
+ STACKTOP = i1;
+ return;
+ }
+ if ((i6 | 0) == (HEAP32[604 >> 2] | 0)) {
+ i21 = (HEAP32[592 >> 2] | 0) + i11 | 0;
+ HEAP32[592 >> 2] = i21;
+ HEAP32[604 >> 2] = i2;
+ HEAP32[i2 + 4 >> 2] = i21 | 1;
+ HEAP32[i2 + i21 >> 2] = i21;
+ STACKTOP = i1;
+ return;
+ }
+ i11 = (i13 & -8) + i11 | 0;
+ i12 = i13 >>> 3;
+ do {
+ if (!(i13 >>> 0 < 256)) {
+ i10 = HEAP32[i7 + (i8 + 16) >> 2] | 0;
+ i15 = HEAP32[i7 + (i8 | 4) >> 2] | 0;
+ do {
+ if ((i15 | 0) == (i6 | 0)) {
+ i13 = i7 + (i8 + 12) | 0;
+ i12 = HEAP32[i13 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ i13 = i7 + (i8 + 8) | 0;
+ i12 = HEAP32[i13 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ i9 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i14 = i12 + 20 | 0;
+ i15 = HEAP32[i14 >> 2] | 0;
+ if ((i15 | 0) != 0) {
+ i12 = i15;
+ i13 = i14;
+ continue;
+ }
+ i14 = i12 + 16 | 0;
+ i15 = HEAP32[i14 >> 2] | 0;
+ if ((i15 | 0) == 0) {
+ break;
+ } else {
+ i12 = i15;
+ i13 = i14;
+ }
+ }
+ if (i13 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i13 >> 2] = 0;
+ i9 = i12;
+ break;
+ }
+ } else {
+ i13 = HEAP32[i7 + i8 >> 2] | 0;
+ if (i13 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i14 = i13 + 12 | 0;
+ if ((HEAP32[i14 >> 2] | 0) != (i6 | 0)) {
+ _abort();
+ }
+ i12 = i15 + 8 | 0;
+ if ((HEAP32[i12 >> 2] | 0) == (i6 | 0)) {
+ HEAP32[i14 >> 2] = i15;
+ HEAP32[i12 >> 2] = i13;
+ i9 = i15;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ if ((i10 | 0) != 0) {
+ i12 = HEAP32[i7 + (i8 + 20) >> 2] | 0;
+ i13 = 888 + (i12 << 2) | 0;
+ if ((i6 | 0) == (HEAP32[i13 >> 2] | 0)) {
+ HEAP32[i13 >> 2] = i9;
+ if ((i9 | 0) == 0) {
+ HEAP32[588 >> 2] = HEAP32[588 >> 2] & ~(1 << i12);
+ break;
+ }
+ } else {
+ if (i10 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i12 = i10 + 16 | 0;
+ if ((HEAP32[i12 >> 2] | 0) == (i6 | 0)) {
+ HEAP32[i12 >> 2] = i9;
+ } else {
+ HEAP32[i10 + 20 >> 2] = i9;
+ }
+ if ((i9 | 0) == 0) {
+ break;
+ }
+ }
+ if (i9 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i9 + 24 >> 2] = i10;
+ i6 = HEAP32[i7 + (i8 + 8) >> 2] | 0;
+ do {
+ if ((i6 | 0) != 0) {
+ if (i6 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i9 + 16 >> 2] = i6;
+ HEAP32[i6 + 24 >> 2] = i9;
+ break;
+ }
+ }
+ } while (0);
+ i6 = HEAP32[i7 + (i8 + 12) >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ if (i6 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i9 + 20 >> 2] = i6;
+ HEAP32[i6 + 24 >> 2] = i9;
+ break;
+ }
+ }
+ }
+ } else {
+ i9 = HEAP32[i7 + i8 >> 2] | 0;
+ i7 = HEAP32[i7 + (i8 | 4) >> 2] | 0;
+ i8 = 624 + (i12 << 1 << 2) | 0;
+ if ((i9 | 0) != (i8 | 0)) {
+ if (i9 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ if ((HEAP32[i9 + 12 >> 2] | 0) != (i6 | 0)) {
+ _abort();
+ }
+ }
+ if ((i7 | 0) == (i9 | 0)) {
+ HEAP32[146] = HEAP32[146] & ~(1 << i12);
+ break;
+ }
+ if ((i7 | 0) != (i8 | 0)) {
+ if (i7 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i8 = i7 + 8 | 0;
+ if ((HEAP32[i8 >> 2] | 0) == (i6 | 0)) {
+ i10 = i8;
+ } else {
+ _abort();
+ }
+ } else {
+ i10 = i7 + 8 | 0;
+ }
+ HEAP32[i9 + 12 >> 2] = i7;
+ HEAP32[i10 >> 2] = i9;
+ }
+ } while (0);
+ HEAP32[i2 + 4 >> 2] = i11 | 1;
+ HEAP32[i2 + i11 >> 2] = i11;
+ if ((i2 | 0) == (HEAP32[604 >> 2] | 0)) {
+ HEAP32[592 >> 2] = i11;
+ STACKTOP = i1;
+ return;
+ }
+ } else {
+ HEAP32[i12 >> 2] = i13 & -2;
+ HEAP32[i2 + 4 >> 2] = i11 | 1;
+ HEAP32[i2 + i11 >> 2] = i11;
+ }
+ i6 = i11 >>> 3;
+ if (i11 >>> 0 < 256) {
+ i7 = i6 << 1;
+ i3 = 624 + (i7 << 2) | 0;
+ i8 = HEAP32[146] | 0;
+ i6 = 1 << i6;
+ if ((i8 & i6 | 0) != 0) {
+ i6 = 624 + (i7 + 2 << 2) | 0;
+ i7 = HEAP32[i6 >> 2] | 0;
+ if (i7 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i4 = i6;
+ i5 = i7;
+ }
+ } else {
+ HEAP32[146] = i8 | i6;
+ i4 = 624 + (i7 + 2 << 2) | 0;
+ i5 = i3;
+ }
+ HEAP32[i4 >> 2] = i2;
+ HEAP32[i5 + 12 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i5;
+ HEAP32[i2 + 12 >> 2] = i3;
+ STACKTOP = i1;
+ return;
+ }
+ i4 = i11 >>> 8;
+ if ((i4 | 0) != 0) {
+ if (i11 >>> 0 > 16777215) {
+ i4 = 31;
+ } else {
+ i20 = (i4 + 1048320 | 0) >>> 16 & 8;
+ i21 = i4 << i20;
+ i19 = (i21 + 520192 | 0) >>> 16 & 4;
+ i21 = i21 << i19;
+ i4 = (i21 + 245760 | 0) >>> 16 & 2;
+ i4 = 14 - (i19 | i20 | i4) + (i21 << i4 >>> 15) | 0;
+ i4 = i11 >>> (i4 + 7 | 0) & 1 | i4 << 1;
+ }
+ } else {
+ i4 = 0;
+ }
+ i5 = 888 + (i4 << 2) | 0;
+ HEAP32[i2 + 28 >> 2] = i4;
+ HEAP32[i2 + 20 >> 2] = 0;
+ HEAP32[i2 + 16 >> 2] = 0;
+ i7 = HEAP32[588 >> 2] | 0;
+ i6 = 1 << i4;
+ L199 : do {
+ if ((i7 & i6 | 0) != 0) {
+ i5 = HEAP32[i5 >> 2] | 0;
+ if ((i4 | 0) == 31) {
+ i4 = 0;
+ } else {
+ i4 = 25 - (i4 >>> 1) | 0;
+ }
+ L204 : do {
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) != (i11 | 0)) {
+ i4 = i11 << i4;
+ i7 = i5;
+ while (1) {
+ i6 = i7 + (i4 >>> 31 << 2) + 16 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) == (i11 | 0)) {
+ i3 = i5;
+ break L204;
+ } else {
+ i4 = i4 << 1;
+ i7 = i5;
+ }
+ }
+ if (i6 >>> 0 < (HEAP32[600 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i6 >> 2] = i2;
+ HEAP32[i2 + 24 >> 2] = i7;
+ HEAP32[i2 + 12 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i2;
+ break L199;
+ }
+ } else {
+ i3 = i5;
+ }
+ } while (0);
+ i5 = i3 + 8 | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ i6 = HEAP32[600 >> 2] | 0;
+ if (i3 >>> 0 < i6 >>> 0) {
+ _abort();
+ }
+ if (i4 >>> 0 < i6 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i4 + 12 >> 2] = i2;
+ HEAP32[i5 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i4;
+ HEAP32[i2 + 12 >> 2] = i3;
+ HEAP32[i2 + 24 >> 2] = 0;
+ break;
+ }
+ } else {
+ HEAP32[588 >> 2] = i7 | i6;
+ HEAP32[i5 >> 2] = i2;
+ HEAP32[i2 + 24 >> 2] = i5;
+ HEAP32[i2 + 12 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i2;
+ }
+ } while (0);
+ i21 = (HEAP32[616 >> 2] | 0) + -1 | 0;
+ HEAP32[616 >> 2] = i21;
+ if ((i21 | 0) == 0) {
+ i2 = 1040 | 0;
+ } else {
+ STACKTOP = i1;
+ return;
+ }
+ while (1) {
+ i2 = HEAP32[i2 >> 2] | 0;
+ if ((i2 | 0) == 0) {
+ break;
+ } else {
+ i2 = i2 + 8 | 0;
+ }
+ }
+ HEAP32[616 >> 2] = -1;
+ STACKTOP = i1;
+ return;
+}
+function _main(i7, i8) {
+ i7 = i7 | 0;
+ i8 = i8 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, d9 = 0.0, d10 = 0.0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 4272 | 0;
+ i3 = i2;
+ i5 = i2 + 4248 | 0;
+ i4 = i2 + 2128 | 0;
+ i1 = i2 + 8 | 0;
+ L1 : do {
+ if ((i7 | 0) > 1) {
+ i7 = HEAP8[HEAP32[i8 + 4 >> 2] | 0] | 0;
+ switch (i7 | 0) {
+ case 50:
+ {
+ i3 = 95e5;
+ break L1;
+ }
+ case 51:
+ {
+ i6 = 4;
+ break L1;
+ }
+ case 52:
+ {
+ i3 = 95e6;
+ break L1;
+ }
+ case 53:
+ {
+ i3 = 19e7;
+ break L1;
+ }
+ case 49:
+ {
+ i3 = 95e4;
+ break L1;
+ }
+ case 48:
+ {
+ i8 = 0;
+ STACKTOP = i2;
+ return i8 | 0;
+ }
+ default:
+ {
+ HEAP32[i3 >> 2] = i7 + -48;
+ _printf(280, i3 | 0) | 0;
+ i8 = -1;
+ STACKTOP = i2;
+ return i8 | 0;
+ }
+ }
+ } else {
+ i6 = 4;
+ }
+ } while (0);
+ if ((i6 | 0) == 4) {
+ i3 = 19e6;
+ }
+ HEAP32[i5 + 8 >> 2] = 0;
+ HEAP32[i5 + 4 >> 2] = 287;
+ i8 = __Znaj(347) | 0;
+ HEAP32[i5 >> 2] = i8;
+ _memcpy(i8 | 0, 296, 287) | 0;
+ i8 = i8 + 287 | 0;
+ i7 = 296 | 0;
+ i6 = i8 + 60 | 0;
+ do {
+ HEAP8[i8] = HEAP8[i7] | 0;
+ i8 = i8 + 1 | 0;
+ i7 = i7 + 1 | 0;
+ } while ((i8 | 0) < (i6 | 0));
+ i7 = i3 << 1;
+ while (1) {
+ i6 = i7 >>> 0 < 60 ? i7 : 60;
+ __ZN14RotatingString5writeEj(i5, i6);
+ if ((i7 | 0) == (i6 | 0)) {
+ break;
+ } else {
+ i7 = i7 - i6 | 0;
+ }
+ }
+ i5 = HEAP32[i5 >> 2] | 0;
+ if ((i5 | 0) != 0) {
+ __ZdaPv(i5);
+ }
+ if ((HEAP32[6] | 0) == 0) {
+ i6 = 24;
+ i5 = 0;
+ } else {
+ i5 = 24;
+ d9 = 0.0;
+ while (1) {
+ i6 = i5 + 4 | 0;
+ d9 = d9 + +HEAPF32[i6 >> 2];
+ d10 = d9 < 1.0 ? d9 : 1.0;
+ HEAPF32[i6 >> 2] = d10;
+ HEAP32[i5 + 8 >> 2] = ~~(d10 * 512.0) >>> 0;
+ i5 = i5 + 12 | 0;
+ if ((HEAP32[i5 >> 2] | 0) == 0) {
+ i6 = 24;
+ i5 = 0;
+ break;
+ }
+ }
+ }
+ do {
+ while (1) {
+ i8 = HEAP32[i6 + 8 >> 2] | 0;
+ if (i5 >>> 0 > i8 >>> 0 & (i8 | 0) != 0) {
+ i6 = i6 + 12 | 0;
+ } else {
+ break;
+ }
+ }
+ HEAP32[i4 + (i5 << 2) >> 2] = i6;
+ i5 = i5 + 1 | 0;
+ } while ((i5 | 0) != 513);
+ HEAP32[i4 + 2116 >> 2] = 0;
+ __Z9makeFastaI10RandomizedEvPKcS2_jRT_(0, 0, i3 * 3 | 0, i4);
+ if ((HEAP32[54] | 0) == 0) {
+ i5 = 216;
+ i4 = 0;
+ } else {
+ i5 = 216;
+ d9 = 0.0;
+ while (1) {
+ i4 = i5 + 4 | 0;
+ d9 = d9 + +HEAPF32[i4 >> 2];
+ d10 = d9 < 1.0 ? d9 : 1.0;
+ HEAPF32[i4 >> 2] = d10;
+ HEAP32[i5 + 8 >> 2] = ~~(d10 * 512.0) >>> 0;
+ i5 = i5 + 12 | 0;
+ if ((HEAP32[i5 >> 2] | 0) == 0) {
+ i5 = 216;
+ i4 = 0;
+ break;
+ }
+ }
+ }
+ do {
+ while (1) {
+ i8 = HEAP32[i5 + 8 >> 2] | 0;
+ if (i4 >>> 0 > i8 >>> 0 & (i8 | 0) != 0) {
+ i5 = i5 + 12 | 0;
+ } else {
+ break;
+ }
+ }
+ HEAP32[i1 + (i4 << 2) >> 2] = i5;
+ i4 = i4 + 1 | 0;
+ } while ((i4 | 0) != 513);
+ HEAP32[i1 + 2116 >> 2] = 0;
+ __Z9makeFastaI10RandomizedEvPKcS2_jRT_(0, 0, i3 * 5 | 0, i1);
+ i8 = 0;
+ STACKTOP = i2;
+ return i8 | 0;
+}
+function __Z9makeFastaI10RandomizedEvPKcS2_jRT_(i3, i2, i6, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i6 = i6 | 0;
+ i1 = i1 | 0;
+ var i4 = 0, i5 = 0, i7 = 0, d8 = 0.0, i9 = 0;
+ i2 = STACKTOP;
+ if ((i6 | 0) == 0) {
+ STACKTOP = i2;
+ return;
+ }
+ i4 = i1 + 2116 | 0;
+ i3 = i1 + 2052 | 0;
+ while (1) {
+ i5 = i6 >>> 0 < 60 ? i6 : 60;
+ if ((i5 | 0) != 0) {
+ i7 = 0;
+ do {
+ i9 = ((((HEAP32[4] | 0) * 3877 | 0) + 29573 | 0) >>> 0) % 139968 | 0;
+ HEAP32[4] = i9;
+ d8 = +(i9 >>> 0) / 139968.0;
+ i9 = HEAP32[i1 + (~~(d8 * 512.0) >>> 0 << 2) >> 2] | 0;
+ while (1) {
+ if (+HEAPF32[i9 + 4 >> 2] < d8) {
+ i9 = i9 + 12 | 0;
+ } else {
+ break;
+ }
+ }
+ HEAP8[i1 + i7 + 2052 | 0] = HEAP32[i9 >> 2];
+ i7 = i7 + 1 | 0;
+ } while ((i7 | 0) != (i5 | 0));
+ }
+ HEAP8[i1 + i5 + 2052 | 0] = 10;
+ i9 = i5 + 1 | 0;
+ HEAP8[i1 + i9 + 2052 | 0] = 0;
+ HEAP32[i4 >> 2] = i9;
+ i9 = _strlen(i3 | 0) | 0;
+ i7 = HEAP32[2] | 0;
+ if ((i9 | 0) > (i7 | 0)) {
+ if ((i7 | 0) > 0) {
+ HEAP8[i1 + i7 + 2052 | 0] = 0;
+ _puts(i3 | 0) | 0;
+ HEAP8[i1 + (HEAP32[2] | 0) + 2052 | 0] = 122;
+ HEAP32[2] = 0;
+ }
+ } else {
+ _puts(i3 | 0) | 0;
+ HEAP32[2] = (HEAP32[2] | 0) - i9;
+ }
+ if ((i6 | 0) == (i5 | 0)) {
+ break;
+ } else {
+ i6 = i6 - i5 | 0;
+ }
+ }
+ STACKTOP = i2;
+ return;
+}
+function __ZN14RotatingString5writeEj(i3, i4) {
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i2 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i1 = STACKTOP;
+ i5 = __Znaj(i4 + 2 | 0) | 0;
+ i2 = i3 + 8 | 0;
+ _memcpy(i5 | 0, (HEAP32[i3 >> 2] | 0) + (HEAP32[i2 >> 2] | 0) | 0, i4 | 0) | 0;
+ HEAP8[i5 + i4 | 0] = 0;
+ i7 = _strlen(i5 | 0) | 0;
+ i6 = HEAP32[2] | 0;
+ if ((i7 | 0) > (i6 | 0)) {
+ if ((i6 | 0) > 0) {
+ HEAP8[i5 + i6 | 0] = 0;
+ _puts(i5 | 0) | 0;
+ HEAP32[2] = 0;
+ i6 = 6;
+ } else {
+ i6 = 5;
+ }
+ } else {
+ _puts(i5 | 0) | 0;
+ HEAP32[2] = (HEAP32[2] | 0) - i7;
+ i6 = 5;
+ }
+ if ((i6 | 0) == 5 ? (i5 | 0) != 0 : 0) {
+ i6 = 6;
+ }
+ if ((i6 | 0) == 6) {
+ __ZdlPv(i5);
+ }
+ i4 = (HEAP32[i2 >> 2] | 0) + i4 | 0;
+ HEAP32[i2 >> 2] = i4;
+ i3 = HEAP32[i3 + 4 >> 2] | 0;
+ if (!(i4 >>> 0 > i3 >>> 0)) {
+ STACKTOP = i1;
+ return;
+ }
+ HEAP32[i2 >> 2] = i4 - i3;
+ STACKTOP = i1;
+ return;
+}
+function _memcpy(i3, i2, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i4 = 0;
+ if ((i1 | 0) >= 4096) return _emscripten_memcpy_big(i3 | 0, i2 | 0, i1 | 0) | 0;
+ i4 = i3 | 0;
+ if ((i3 & 3) == (i2 & 3)) {
+ while (i3 & 3) {
+ if ((i1 | 0) == 0) return i4 | 0;
+ HEAP8[i3] = HEAP8[i2] | 0;
+ i3 = i3 + 1 | 0;
+ i2 = i2 + 1 | 0;
+ i1 = i1 - 1 | 0;
+ }
+ while ((i1 | 0) >= 4) {
+ HEAP32[i3 >> 2] = HEAP32[i2 >> 2];
+ i3 = i3 + 4 | 0;
+ i2 = i2 + 4 | 0;
+ i1 = i1 - 4 | 0;
+ }
+ }
+ while ((i1 | 0) > 0) {
+ HEAP8[i3] = HEAP8[i2] | 0;
+ i3 = i3 + 1 | 0;
+ i2 = i2 + 1 | 0;
+ i1 = i1 - 1 | 0;
+ }
+ return i4 | 0;
+}
+function _memset(i1, i4, i3) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i2 = i1 + i3 | 0;
+ if ((i3 | 0) >= 20) {
+ i4 = i4 & 255;
+ i7 = i1 & 3;
+ i6 = i4 | i4 << 8 | i4 << 16 | i4 << 24;
+ i5 = i2 & ~3;
+ if (i7) {
+ i7 = i1 + 4 - i7 | 0;
+ while ((i1 | 0) < (i7 | 0)) {
+ HEAP8[i1] = i4;
+ i1 = i1 + 1 | 0;
+ }
+ }
+ while ((i1 | 0) < (i5 | 0)) {
+ HEAP32[i1 >> 2] = i6;
+ i1 = i1 + 4 | 0;
+ }
+ }
+ while ((i1 | 0) < (i2 | 0)) {
+ HEAP8[i1] = i4;
+ i1 = i1 + 1 | 0;
+ }
+ return i1 - i3 | 0;
+}
+function __Znwj(i2) {
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0;
+ i1 = STACKTOP;
+ i2 = (i2 | 0) == 0 ? 1 : i2;
+ while (1) {
+ i3 = _malloc(i2) | 0;
+ if ((i3 | 0) != 0) {
+ i2 = 6;
+ break;
+ }
+ i3 = HEAP32[270] | 0;
+ HEAP32[270] = i3 + 0;
+ if ((i3 | 0) == 0) {
+ i2 = 5;
+ break;
+ }
+ FUNCTION_TABLE_v[i3 & 0]();
+ }
+ if ((i2 | 0) == 5) {
+ i3 = ___cxa_allocate_exception(4) | 0;
+ HEAP32[i3 >> 2] = 1096;
+ ___cxa_throw(i3 | 0, 1144, 1);
+ } else if ((i2 | 0) == 6) {
+ STACKTOP = i1;
+ return i3 | 0;
+ }
+ return 0;
+}
+function copyTempDouble(i1) {
+ i1 = i1 | 0;
+ HEAP8[tempDoublePtr] = HEAP8[i1];
+ HEAP8[tempDoublePtr + 1 | 0] = HEAP8[i1 + 1 | 0];
+ HEAP8[tempDoublePtr + 2 | 0] = HEAP8[i1 + 2 | 0];
+ HEAP8[tempDoublePtr + 3 | 0] = HEAP8[i1 + 3 | 0];
+ HEAP8[tempDoublePtr + 4 | 0] = HEAP8[i1 + 4 | 0];
+ HEAP8[tempDoublePtr + 5 | 0] = HEAP8[i1 + 5 | 0];
+ HEAP8[tempDoublePtr + 6 | 0] = HEAP8[i1 + 6 | 0];
+ HEAP8[tempDoublePtr + 7 | 0] = HEAP8[i1 + 7 | 0];
+}
+function copyTempFloat(i1) {
+ i1 = i1 | 0;
+ HEAP8[tempDoublePtr] = HEAP8[i1];
+ HEAP8[tempDoublePtr + 1 | 0] = HEAP8[i1 + 1 | 0];
+ HEAP8[tempDoublePtr + 2 | 0] = HEAP8[i1 + 2 | 0];
+ HEAP8[tempDoublePtr + 3 | 0] = HEAP8[i1 + 3 | 0];
+}
+function __ZNSt9bad_allocD0Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __ZNSt9exceptionD2Ev(i1 | 0);
+ __ZdlPv(i1);
+ STACKTOP = i2;
+ return;
+}
+function stackAlloc(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + i1 | 0;
+ STACKTOP = STACKTOP + 7 & -8;
+ return i2 | 0;
+}
+function __ZNSt9bad_allocD2Ev(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __ZNSt9exceptionD2Ev(i1 | 0);
+ STACKTOP = i2;
+ return;
+}
+function __ZdlPv(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ if ((i1 | 0) != 0) {
+ _free(i1);
+ }
+ STACKTOP = i2;
+ return;
+}
+function _strlen(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = i1;
+ while (HEAP8[i2] | 0) {
+ i2 = i2 + 1 | 0;
+ }
+ return i2 - i1 | 0;
+}
+function setThrew(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ if ((__THREW__ | 0) == 0) {
+ __THREW__ = i1;
+ threwValue = i2;
+ }
+}
+function __Znaj(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ i1 = __Znwj(i1) | 0;
+ STACKTOP = i2;
+ return i1 | 0;
+}
+function runPostSets() {
+ HEAP32[286] = __ZTVN10__cxxabiv120__si_class_type_infoE;
+ HEAP32[288] = __ZTISt9exception;
+}
+function dynCall_ii(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ return FUNCTION_TABLE_ii[i2 & 1](i1 | 0) | 0;
+}
+function __ZdaPv(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ __ZdlPv(i1);
+ STACKTOP = i2;
+ return;
+}
+function dynCall_vi(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ FUNCTION_TABLE_vi[i2 & 3](i1 | 0);
+}
+function dynCall_v(i1) {
+ i1 = i1 | 0;
+ FUNCTION_TABLE_v[i1 & 0]();
+}
+function __ZNKSt9bad_alloc4whatEv(i1) {
+ i1 = i1 | 0;
+ return 1112;
+}
+function stackRestore(i1) {
+ i1 = i1 | 0;
+ STACKTOP = i1;
+}
+function setTempRet9(i1) {
+ i1 = i1 | 0;
+ tempRet9 = i1;
+}
+function setTempRet8(i1) {
+ i1 = i1 | 0;
+ tempRet8 = i1;
+}
+function setTempRet7(i1) {
+ i1 = i1 | 0;
+ tempRet7 = i1;
+}
+function setTempRet6(i1) {
+ i1 = i1 | 0;
+ tempRet6 = i1;
+}
+function setTempRet5(i1) {
+ i1 = i1 | 0;
+ tempRet5 = i1;
+}
+function setTempRet4(i1) {
+ i1 = i1 | 0;
+ tempRet4 = i1;
+}
+function setTempRet3(i1) {
+ i1 = i1 | 0;
+ tempRet3 = i1;
+}
+function setTempRet2(i1) {
+ i1 = i1 | 0;
+ tempRet2 = i1;
+}
+function setTempRet1(i1) {
+ i1 = i1 | 0;
+ tempRet1 = i1;
+}
+function setTempRet0(i1) {
+ i1 = i1 | 0;
+ tempRet0 = i1;
+}
+function b0(i1) {
+ i1 = i1 | 0;
+ abort(0);
+ return 0;
+}
+function stackSave() {
+ return STACKTOP | 0;
+}
+function b1(i1) {
+ i1 = i1 | 0;
+ abort(1);
+}
+function b2() {
+ abort(2);
+}
+
+// EMSCRIPTEN_END_FUNCS
+ var FUNCTION_TABLE_ii = [b0,__ZNKSt9bad_alloc4whatEv];
+ var FUNCTION_TABLE_vi = [b1,__ZNSt9bad_allocD2Ev,__ZNSt9bad_allocD0Ev,b1];
+ var FUNCTION_TABLE_v = [b2];
+
+ return { _strlen: _strlen, _free: _free, _main: _main, _memset: _memset, _malloc: _malloc, _memcpy: _memcpy, runPostSets: runPostSets, stackAlloc: stackAlloc, stackSave: stackSave, stackRestore: stackRestore, setThrew: setThrew, setTempRet0: setTempRet0, setTempRet1: setTempRet1, setTempRet2: setTempRet2, setTempRet3: setTempRet3, setTempRet4: setTempRet4, setTempRet5: setTempRet5, setTempRet6: setTempRet6, setTempRet7: setTempRet7, setTempRet8: setTempRet8, setTempRet9: setTempRet9, dynCall_ii: dynCall_ii, dynCall_vi: dynCall_vi, dynCall_v: dynCall_v };
+}).toString(),
+// EMSCRIPTEN_END_ASM
+{ "Math": Math, "Int8Array": Int8Array, "Int16Array": Int16Array, "Int32Array": Int32Array, "Uint8Array": Uint8Array, "Uint16Array": Uint16Array, "Uint32Array": Uint32Array, "Float32Array": Float32Array, "Float64Array": Float64Array, "abort": abort, "assert": assert, "asmPrintInt": asmPrintInt, "asmPrintFloat": asmPrintFloat, "min": Math_min, "invoke_ii": invoke_ii, "invoke_vi": invoke_vi, "invoke_v": invoke_v, "_send": _send, "___setErrNo": ___setErrNo, "___cxa_is_number_type": ___cxa_is_number_type, "___cxa_allocate_exception": ___cxa_allocate_exception, "___cxa_find_matching_catch": ___cxa_find_matching_catch, "_fflush": _fflush, "_time": _time, "_pwrite": _pwrite, "__reallyNegative": __reallyNegative, "_sbrk": _sbrk, "_emscripten_memcpy_big": _emscripten_memcpy_big, "_fileno": _fileno, "___resumeException": ___resumeException, "__ZSt18uncaught_exceptionv": __ZSt18uncaught_exceptionv, "_sysconf": _sysconf, "_puts": _puts, "_mkport": _mkport, "_write": _write, "___errno_location": ___errno_location, "__ZNSt9exceptionD2Ev": __ZNSt9exceptionD2Ev, "_fputc": _fputc, "___cxa_throw": ___cxa_throw, "_abort": _abort, "_fwrite": _fwrite, "___cxa_does_inherit": ___cxa_does_inherit, "_fprintf": _fprintf, "__formatString": __formatString, "_fputs": _fputs, "_printf": _printf, "STACKTOP": STACKTOP, "STACK_MAX": STACK_MAX, "tempDoublePtr": tempDoublePtr, "ABORT": ABORT, "NaN": NaN, "Infinity": Infinity, "__ZTISt9exception": __ZTISt9exception, "__ZTVN10__cxxabiv120__si_class_type_infoE": __ZTVN10__cxxabiv120__si_class_type_infoE }, buffer);
+var _strlen = Module["_strlen"] = asm["_strlen"];
+var _free = Module["_free"] = asm["_free"];
+var _main = Module["_main"] = asm["_main"];
+var _memset = Module["_memset"] = asm["_memset"];
+var _malloc = Module["_malloc"] = asm["_malloc"];
+var _memcpy = Module["_memcpy"] = asm["_memcpy"];
+var runPostSets = Module["runPostSets"] = asm["runPostSets"];
+var dynCall_ii = Module["dynCall_ii"] = asm["dynCall_ii"];
+var dynCall_vi = Module["dynCall_vi"] = asm["dynCall_vi"];
+var dynCall_v = Module["dynCall_v"] = asm["dynCall_v"];
+
+Runtime.stackAlloc = function(size) { return asm['stackAlloc'](size) };
+Runtime.stackSave = function() { return asm['stackSave']() };
+Runtime.stackRestore = function(top) { asm['stackRestore'](top) };
+
+
+// Warning: printing of i64 values may be slightly rounded! No deep i64 math used, so precise i64 code not included
+var i64Math = null;
+
+// === Auto-generated postamble setup entry stuff ===
+
+if (memoryInitializer) {
+ if (ENVIRONMENT_IS_NODE || ENVIRONMENT_IS_SHELL) {
+ var data = Module['readBinary'](memoryInitializer);
+ HEAPU8.set(data, STATIC_BASE);
+ } else {
+ addRunDependency('memory initializer');
+ Browser.asyncLoad(memoryInitializer, function(data) {
+ HEAPU8.set(data, STATIC_BASE);
+ removeRunDependency('memory initializer');
+ }, function(data) {
+ throw 'could not load memory initializer ' + memoryInitializer;
+ });
+ }
+}
+
+function ExitStatus(status) {
+ this.name = "ExitStatus";
+ this.message = "Program terminated with exit(" + status + ")";
+ this.status = status;
+};
+ExitStatus.prototype = new Error();
+ExitStatus.prototype.constructor = ExitStatus;
+
+var initialStackTop;
+var preloadStartTime = null;
+var calledMain = false;
+
+dependenciesFulfilled = function runCaller() {
+ // If run has never been called, and we should call run (INVOKE_RUN is true, and Module.noInitialRun is not false)
+ if (!Module['calledRun'] && shouldRunNow) run([].concat(Module["arguments"]));
+ if (!Module['calledRun']) dependenciesFulfilled = runCaller; // try this again later, after new deps are fulfilled
+}
+
+Module['callMain'] = Module.callMain = function callMain(args) {
+ assert(runDependencies == 0, 'cannot call main when async dependencies remain! (listen on __ATMAIN__)');
+ assert(__ATPRERUN__.length == 0, 'cannot call main when preRun functions remain to be called');
+
+ args = args || [];
+
+ ensureInitRuntime();
+
+ var argc = args.length+1;
+ function pad() {
+ for (var i = 0; i < 4-1; i++) {
+ argv.push(0);
+ }
+ }
+ var argv = [allocate(intArrayFromString("/bin/this.program"), 'i8', ALLOC_NORMAL) ];
+ pad();
+ for (var i = 0; i < argc-1; i = i + 1) {
+ argv.push(allocate(intArrayFromString(args[i]), 'i8', ALLOC_NORMAL));
+ pad();
+ }
+ argv.push(0);
+ argv = allocate(argv, 'i32', ALLOC_NORMAL);
+
+ initialStackTop = STACKTOP;
+
+ try {
+
+ var ret = Module['_main'](argc, argv, 0);
+
+
+ // if we're not running an evented main loop, it's time to exit
+ if (!Module['noExitRuntime']) {
+ exit(ret);
+ }
+ }
+ catch(e) {
+ if (e instanceof ExitStatus) {
+ // exit() throws this once it's done to make sure execution
+ // has been stopped completely
+ return;
+ } else if (e == 'SimulateInfiniteLoop') {
+ // running an evented main loop, don't immediately exit
+ Module['noExitRuntime'] = true;
+ return;
+ } else {
+ if (e && typeof e === 'object' && e.stack) Module.printErr('exception thrown: ' + [e, e.stack]);
+ throw e;
+ }
+ } finally {
+ calledMain = true;
+ }
+}
+
+
+
+
+function run(args) {
+ args = args || Module['arguments'];
+
+ if (preloadStartTime === null) preloadStartTime = Date.now();
+
+ if (runDependencies > 0) {
+ Module.printErr('run() called, but dependencies remain, so not running');
+ return;
+ }
+
+ preRun();
+
+ if (runDependencies > 0) return; // a preRun added a dependency, run will be called later
+ if (Module['calledRun']) return; // run may have just been called through dependencies being fulfilled just in this very frame
+
+ function doRun() {
+ if (Module['calledRun']) return; // run may have just been called while the async setStatus time below was happening
+ Module['calledRun'] = true;
+
+ ensureInitRuntime();
+
+ preMain();
+
+ if (ENVIRONMENT_IS_WEB && preloadStartTime !== null) {
+ Module.printErr('pre-main prep time: ' + (Date.now() - preloadStartTime) + ' ms');
+ }
+
+ if (Module['_main'] && shouldRunNow) {
+ Module['callMain'](args);
+ }
+
+ postRun();
+ }
+
+ if (Module['setStatus']) {
+ Module['setStatus']('Running...');
+ setTimeout(function() {
+ setTimeout(function() {
+ Module['setStatus']('');
+ }, 1);
+ if (!ABORT) doRun();
+ }, 1);
+ } else {
+ doRun();
+ }
+}
+Module['run'] = Module.run = run;
+
+function exit(status) {
+ ABORT = true;
+ EXITSTATUS = status;
+ STACKTOP = initialStackTop;
+
+ // exit the runtime
+ exitRuntime();
+
+ // TODO We should handle this differently based on environment.
+ // In the browser, the best we can do is throw an exception
+ // to halt execution, but in node we could process.exit and
+ // I'd imagine SM shell would have something equivalent.
+ // This would let us set a proper exit status (which
+ // would be great for checking test exit statuses).
+ // https://github.com/kripken/emscripten/issues/1371
+
+ // throw an exception to halt the current execution
+ throw new ExitStatus(status);
+}
+Module['exit'] = Module.exit = exit;
+
+function abort(text) {
+ if (text) {
+ Module.print(text);
+ Module.printErr(text);
+ }
+
+ ABORT = true;
+ EXITSTATUS = 1;
+
+ var extra = '\nIf this abort() is unexpected, build with -s ASSERTIONS=1 which can give more information.';
+
+ throw 'abort() at ' + stackTrace() + extra;
+}
+Module['abort'] = Module.abort = abort;
+
+// {{PRE_RUN_ADDITIONS}}
+
+if (Module['preInit']) {
+ if (typeof Module['preInit'] == 'function') Module['preInit'] = [Module['preInit']];
+ while (Module['preInit'].length > 0) {
+ Module['preInit'].pop()();
+ }
+}
+
+// shouldRunNow refers to calling main(), not run().
+var shouldRunNow = true;
+if (Module['noInitialRun']) {
+ shouldRunNow = false;
+}
+
+
+run([].concat(Module["arguments"]));
diff --git a/test/mjsunit/wasm/embenchen/lua_binarytrees.js b/test/mjsunit/wasm/embenchen/lua_binarytrees.js
new file mode 100644
index 0000000..a5f8228
--- /dev/null
+++ b/test/mjsunit/wasm/embenchen/lua_binarytrees.js
@@ -0,0 +1,42713 @@
+// Modified embenchen to direct to asm-wasm.
+// Flags: --expose-wasm
+
+var EXPECTED_OUTPUT =
+ 'stretch tree of depth 10\t check: -1\n' +
+ '1448\t trees of depth 4\t check: -1448\n' +
+ '362\t trees of depth 6\t check: -362\n' +
+ '90\t trees of depth 8\t check: -90\n' +
+ 'long lived tree of depth 9\t check: -1\n';
+var Module = {
+ arguments: [1],
+ print: function(x) {Module.printBuffer += x + '\n';},
+ preRun: [function() {Module.printBuffer = ''}],
+ postRun: [function() {
+ assertEquals(EXPECTED_OUTPUT, Module.printBuffer);
+ }],
+};
+
+var Module;
+if (typeof Module === 'undefined') Module = eval('(function() { try { return Module || {} } catch(e) { return {} } })()');
+if (!Module.expectedDataFileDownloads) {
+ Module.expectedDataFileDownloads = 0;
+ Module.finishedDataFileDownloads = 0;
+}
+Module.expectedDataFileDownloads++;
+(function() {
+
+ function runWithFS() {
+
+function assert(check, msg) {
+ if (!check) throw msg + new Error().stack;
+}
+Module['FS_createDataFile']('/', 'binarytrees.lua', [45, 45, 32, 84, 104, 101, 32, 67, 111, 109, 112, 117, 116, 101, 114, 32, 76, 97, 110, 103, 117, 97, 103, 101, 32, 66, 101, 110, 99, 104, 109, 97, 114, 107, 115, 32, 71, 97, 109, 101, 10, 45, 45, 32, 104, 116, 116, 112, 58, 47, 47, 98, 101, 110, 99, 104, 109, 97, 114, 107, 115, 103, 97, 109, 101, 46, 97, 108, 105, 111, 116, 104, 46, 100, 101, 98, 105, 97, 110, 46, 111, 114, 103, 47, 10, 45, 45, 32, 99, 111, 110, 116, 114, 105, 98, 117, 116, 101, 100, 32, 98, 121, 32, 77, 105, 107, 101, 32, 80, 97, 108, 108, 10, 10, 108, 111, 99, 97, 108, 32, 102, 117, 110, 99, 116, 105, 111, 110, 32, 66, 111, 116, 116, 111, 109, 85, 112, 84, 114, 101, 101, 40, 105, 116, 101, 109, 44, 32, 100, 101, 112, 116, 104, 41, 10, 32, 32, 105, 102, 32, 100, 101, 112, 116, 104, 32, 62, 32, 48, 32, 116, 104, 101, 110, 10, 32, 32, 32, 32, 108, 111, 99, 97, 108, 32, 105, 32, 61, 32, 105, 116, 101, 109, 32, 43, 32, 105, 116, 101, 109, 10, 32, 32, 32, 32, 100, 101, 112, 116, 104, 32, 61, 32, 100, 101, 112, 116, 104, 32, 45, 32, 49, 10, 32, 32, 32, 32, 108, 111, 99, 97, 108, 32, 108, 101, 102, 116, 44, 32, 114, 105, 103, 104, 116, 32, 61, 32, 66, 111, 116, 116, 111, 109, 85, 112, 84, 114, 101, 101, 40, 105, 45, 49, 44, 32, 100, 101, 112, 116, 104, 41, 44, 32, 66, 111, 116, 116, 111, 109, 85, 112, 84, 114, 101, 101, 40, 105, 44, 32, 100, 101, 112, 116, 104, 41, 10, 32, 32, 32, 32, 114, 101, 116, 117, 114, 110, 32, 123, 32, 105, 116, 101, 109, 44, 32, 108, 101, 102, 116, 44, 32, 114, 105, 103, 104, 116, 32, 125, 10, 32, 32, 101, 108, 115, 101, 10, 32, 32, 32, 32, 114, 101, 116, 117, 114, 110, 32, 123, 32, 105, 116, 101, 109, 32, 125, 10, 32, 32, 101, 110, 100, 10, 101, 110, 100, 10, 10, 108, 111, 99, 97, 108, 32, 102, 117, 110, 99, 116, 105, 111, 110, 32, 73, 116, 101, 109, 67, 104, 101, 99, 107, 40, 116, 114, 101, 101, 41, 10, 32, 32, 105, 102, 32, 116, 114, 101, 101, 91, 50, 93, 32, 116, 104, 101, 110, 10, 32, 32, 32, 32, 114, 101, 116, 117, 114, 110, 32, 116, 114, 101, 101, 91, 49, 93, 32, 43, 32, 73, 116, 101, 109, 67, 104, 101, 99, 107, 40, 116, 114, 101, 101, 91, 50, 93, 41, 32, 45, 32, 73, 116, 101, 109, 67, 104, 101, 99, 107, 40, 116, 114, 101, 101, 91, 51, 93, 41, 10, 32, 32, 101, 108, 115, 101, 10, 32, 32, 32, 32, 114, 101, 116, 117, 114, 110, 32, 116, 114, 101, 101, 91, 49, 93, 10, 32, 32, 101, 110, 100, 10, 101, 110, 100, 10, 10, 108, 111, 99, 97, 108, 32, 78, 32, 61, 32, 116, 111, 110, 117, 109, 98, 101, 114, 40, 97, 114, 103, 32, 97, 110, 100, 32, 97, 114, 103, 91, 49, 93, 41, 32, 111, 114, 32, 52, 10, 10, 105, 102, 32, 78, 32, 61, 61, 32, 48, 32, 116, 104, 101, 110, 10, 32, 32, 78, 32, 61, 32, 48, 10, 101, 108, 115, 101, 105, 102, 32, 78, 32, 61, 61, 32, 49, 32, 116, 104, 101, 110, 10, 32, 32, 78, 32, 61, 32, 57, 46, 53, 10, 101, 108, 115, 101, 105, 102, 32, 78, 32, 61, 61, 32, 50, 32, 116, 104, 101, 110, 10, 32, 32, 78, 32, 61, 32, 49, 49, 46, 57, 57, 10, 101, 108, 115, 101, 105, 102, 32, 78, 32, 61, 61, 32, 51, 32, 116, 104, 101, 110, 10, 32, 32, 78, 32, 61, 32, 49, 50, 46, 56, 53, 10, 101, 108, 115, 101, 105, 102, 32, 78, 32, 61, 61, 32, 52, 32, 116, 104, 101, 110, 10, 32, 32, 78, 32, 61, 32, 49, 52, 46, 55, 50, 10, 101, 108, 115, 101, 105, 102, 32, 78, 32, 61, 61, 32, 53, 32, 116, 104, 101, 110, 10, 32, 32, 78, 32, 61, 32, 49, 53, 46, 56, 50, 10, 101, 110, 100, 10, 10, 108, 111, 99, 97, 108, 32, 109, 105, 110, 100, 101, 112, 116, 104, 32, 61, 32, 52, 10, 108, 111, 99, 97, 108, 32, 109, 97, 120, 100, 101, 112, 116, 104, 32, 61, 32, 109, 105, 110, 100, 101, 112, 116, 104, 32, 43, 32, 50, 10, 105, 102, 32, 109, 97, 120, 100, 101, 112, 116, 104, 32, 60, 32, 78, 32, 116, 104, 101, 110, 32, 109, 97, 120, 100, 101, 112, 116, 104, 32, 61, 32, 78, 32, 101, 110, 100, 10, 10, 100, 111, 10, 32, 32, 108, 111, 99, 97, 108, 32, 115, 116, 114, 101, 116, 99, 104, 100, 101, 112, 116, 104, 32, 61, 32, 109, 97, 120, 100, 101, 112, 116, 104, 32, 43, 32, 49, 10, 32, 32, 108, 111, 99, 97, 108, 32, 115, 116, 114, 101, 116, 99, 104, 116, 114, 101, 101, 32, 61, 32, 66, 111, 116, 116, 111, 109, 85, 112, 84, 114, 101, 101, 40, 48, 44, 32, 115, 116, 114, 101, 116, 99, 104, 100, 101, 112, 116, 104, 41, 10, 32, 32, 105, 111, 46, 119, 114, 105, 116, 101, 40, 115, 116, 114, 105, 110, 103, 46, 102, 111, 114, 109, 97, 116, 40, 34, 115, 116, 114, 101, 116, 99, 104, 32, 116, 114, 101, 101, 32, 111, 102, 32, 100, 101, 112, 116, 104, 32, 37, 100, 92, 116, 32, 99, 104, 101, 99, 107, 58, 32, 37, 100, 92, 110, 34, 44, 10, 32, 32, 32, 32, 115, 116, 114, 101, 116, 99, 104, 100, 101, 112, 116, 104, 44, 32, 73, 116, 101, 109, 67, 104, 101, 99, 107, 40, 115, 116, 114, 101, 116, 99, 104, 116, 114, 101, 101, 41, 41, 41, 10, 101, 110, 100, 10, 10, 108, 111, 99, 97, 108, 32, 108, 111, 110, 103, 108, 105, 118, 101, 100, 116, 114, 101, 101, 32, 61, 32, 66, 111, 116, 116, 111, 109, 85, 112, 84, 114, 101, 101, 40, 48, 44, 32, 109, 97, 120, 100, 101, 112, 116, 104, 41, 10, 10, 102, 111, 114, 32, 100, 101, 112, 116, 104, 61, 109, 105, 110, 100, 101, 112, 116, 104, 44, 109, 97, 120, 100, 101, 112, 116, 104, 44, 50, 32, 100, 111, 10, 32, 32, 108, 111, 99, 97, 108, 32, 105, 116, 101, 114, 97, 116, 105, 111, 110, 115, 32, 61, 32, 50, 32, 94, 32, 40, 109, 97, 120, 100, 101, 112, 116, 104, 32, 45, 32, 100, 101, 112, 116, 104, 32, 43, 32, 109, 105, 110, 100, 101, 112, 116, 104, 41, 10, 32, 32, 108, 111, 99, 97, 108, 32, 99, 104, 101, 99, 107, 32, 61, 32, 48, 10, 32, 32, 102, 111, 114, 32, 105, 61, 49, 44, 105, 116, 101, 114, 97, 116, 105, 111, 110, 115, 32, 100, 111, 10, 32, 32, 32, 32, 99, 104, 101, 99, 107, 32, 61, 32, 99, 104, 101, 99, 107, 32, 43, 32, 73, 116, 101, 109, 67, 104, 101, 99, 107, 40, 66, 111, 116, 116, 111, 109, 85, 112, 84, 114, 101, 101, 40, 49, 44, 32, 100, 101, 112, 116, 104, 41, 41, 32, 43, 10, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 73, 116, 101, 109, 67, 104, 101, 99, 107, 40, 66, 111, 116, 116, 111, 109, 85, 112, 84, 114, 101, 101, 40, 45, 49, 44, 32, 100, 101, 112, 116, 104, 41, 41, 10, 32, 32, 101, 110, 100, 10, 32, 32, 105, 111, 46, 119, 114, 105, 116, 101, 40, 115, 116, 114, 105, 110, 103, 46, 102, 111, 114, 109, 97, 116, 40, 34, 37, 100, 92, 116, 32, 116, 114, 101, 101, 115, 32, 111, 102, 32, 100, 101, 112, 116, 104, 32, 37, 100, 92, 116, 32, 99, 104, 101, 99, 107, 58, 32, 37, 100, 92, 110, 34, 44, 10, 32, 32, 32, 32, 105, 116, 101, 114, 97, 116, 105, 111, 110, 115, 42, 50, 44, 32, 100, 101, 112, 116, 104, 44, 32, 99, 104, 101, 99, 107, 41, 41, 10, 101, 110, 100, 10, 10, 105, 111, 46, 119, 114, 105, 116, 101, 40, 115, 116, 114, 105, 110, 103, 46, 102, 111, 114, 109, 97, 116, 40, 34, 108, 111, 110, 103, 32, 108, 105, 118, 101, 100, 32, 116, 114, 101, 101, 32, 111, 102, 32, 100, 101, 112, 116, 104, 32, 37, 100, 92, 116, 32, 99, 104, 101, 99, 107, 58, 32, 37, 100, 92, 110, 34, 44, 10, 32, 32, 109, 97, 120, 100, 101, 112, 116, 104, 44, 32, 73, 116, 101, 109, 67, 104, 101, 99, 107, 40, 108, 111, 110, 103, 108, 105, 118, 101, 100, 116, 114, 101, 101, 41, 41, 41, 10], true, true);
+
+ }
+ if (Module['calledRun']) {
+ runWithFS();
+ } else {
+ if (!Module['preRun']) Module['preRun'] = [];
+ Module["preRun"].push(runWithFS); // FS is not initialized yet, wait for it
+ }
+
+})();
+
+// The Module object: Our interface to the outside world. We import
+// and export values on it, and do the work to get that through
+// closure compiler if necessary. There are various ways Module can be used:
+// 1. Not defined. We create it here
+// 2. A function parameter, function(Module) { ..generated code.. }
+// 3. pre-run appended it, var Module = {}; ..generated code..
+// 4. External script tag defines var Module.
+// We need to do an eval in order to handle the closure compiler
+// case, where this code here is minified but Module was defined
+// elsewhere (e.g. case 4 above). We also need to check if Module
+// already exists (e.g. case 3 above).
+// Note that if you want to run closure, and also to use Module
+// after the generated code, you will need to define var Module = {};
+// before the code. Then that object will be used in the code, and you
+// can continue to use Module afterwards as well.
+var Module;
+if (!Module) Module = (typeof Module !== 'undefined' ? Module : null) || {};
+
+// Sometimes an existing Module object exists with properties
+// meant to overwrite the default module functionality. Here
+// we collect those properties and reapply _after_ we configure
+// the current environment's defaults to avoid having to be so
+// defensive during initialization.
+var moduleOverrides = {};
+for (var key in Module) {
+ if (Module.hasOwnProperty(key)) {
+ moduleOverrides[key] = Module[key];
+ }
+}
+
+// The environment setup code below is customized to use Module.
+// *** Environment setup code ***
+var ENVIRONMENT_IS_NODE = typeof process === 'object' && typeof require === 'function';
+var ENVIRONMENT_IS_WEB = typeof window === 'object';
+var ENVIRONMENT_IS_WORKER = typeof importScripts === 'function';
+var ENVIRONMENT_IS_SHELL = !ENVIRONMENT_IS_WEB && !ENVIRONMENT_IS_NODE && !ENVIRONMENT_IS_WORKER;
+
+if (ENVIRONMENT_IS_NODE) {
+ // Expose functionality in the same simple way that the shells work
+ // Note that we pollute the global namespace here, otherwise we break in node
+ if (!Module['print']) Module['print'] = function print(x) {
+ process['stdout'].write(x + '\n');
+ };
+ if (!Module['printErr']) Module['printErr'] = function printErr(x) {
+ process['stderr'].write(x + '\n');
+ };
+
+ var nodeFS = require('fs');
+ var nodePath = require('path');
+
+ Module['read'] = function read(filename, binary) {
+ filename = nodePath['normalize'](filename);
+ var ret = nodeFS['readFileSync'](filename);
+ // The path is absolute if the normalized version is the same as the resolved.
+ if (!ret && filename != nodePath['resolve'](filename)) {
+ filename = path.join(__dirname, '..', 'src', filename);
+ ret = nodeFS['readFileSync'](filename);
+ }
+ if (ret && !binary) ret = ret.toString();
+ return ret;
+ };
+
+ Module['readBinary'] = function readBinary(filename) { return Module['read'](filename, true) };
+
+ Module['load'] = function load(f) {
+ globalEval(read(f));
+ };
+
+ Module['arguments'] = process['argv'].slice(2);
+
+ module['exports'] = Module;
+}
+else if (ENVIRONMENT_IS_SHELL) {
+ if (!Module['print']) Module['print'] = print;
+ if (typeof printErr != 'undefined') Module['printErr'] = printErr; // not present in v8 or older sm
+
+ if (typeof read != 'undefined') {
+ Module['read'] = read;
+ } else {
+ Module['read'] = function read() { throw 'no read() available (jsc?)' };
+ }
+
+ Module['readBinary'] = function readBinary(f) {
+ return read(f, 'binary');
+ };
+
+ if (typeof scriptArgs != 'undefined') {
+ Module['arguments'] = scriptArgs;
+ } else if (typeof arguments != 'undefined') {
+ Module['arguments'] = arguments;
+ }
+
+ this['Module'] = Module;
+
+ eval("if (typeof gc === 'function' && gc.toString().indexOf('[native code]') > 0) var gc = undefined"); // wipe out the SpiderMonkey shell 'gc' function, which can confuse closure (uses it as a minified name, and it is then initted to a non-falsey value unexpectedly)
+}
+else if (ENVIRONMENT_IS_WEB || ENVIRONMENT_IS_WORKER) {
+ Module['read'] = function read(url) {
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, false);
+ xhr.send(null);
+ return xhr.responseText;
+ };
+
+ if (typeof arguments != 'undefined') {
+ Module['arguments'] = arguments;
+ }
+
+ if (typeof console !== 'undefined') {
+ if (!Module['print']) Module['print'] = function print(x) {
+ console.log(x);
+ };
+ if (!Module['printErr']) Module['printErr'] = function printErr(x) {
+ console.log(x);
+ };
+ } else {
+ // Probably a worker, and without console.log. We can do very little here...
+ var TRY_USE_DUMP = false;
+ if (!Module['print']) Module['print'] = (TRY_USE_DUMP && (typeof(dump) !== "undefined") ? (function(x) {
+ dump(x);
+ }) : (function(x) {
+ // self.postMessage(x); // enable this if you want stdout to be sent as messages
+ }));
+ }
+
+ if (ENVIRONMENT_IS_WEB) {
+ window['Module'] = Module;
+ } else {
+ Module['load'] = importScripts;
+ }
+}
+else {
+ // Unreachable because SHELL is dependant on the others
+ throw 'Unknown runtime environment. Where are we?';
+}
+
+function globalEval(x) {
+ eval.call(null, x);
+}
+if (!Module['load'] == 'undefined' && Module['read']) {
+ Module['load'] = function load(f) {
+ globalEval(Module['read'](f));
+ };
+}
+if (!Module['print']) {
+ Module['print'] = function(){};
+}
+if (!Module['printErr']) {
+ Module['printErr'] = Module['print'];
+}
+if (!Module['arguments']) {
+ Module['arguments'] = [];
+}
+// *** Environment setup code ***
+
+// Closure helpers
+Module.print = Module['print'];
+Module.printErr = Module['printErr'];
+
+// Callbacks
+Module['preRun'] = [];
+Module['postRun'] = [];
+
+// Merge back in the overrides
+for (var key in moduleOverrides) {
+ if (moduleOverrides.hasOwnProperty(key)) {
+ Module[key] = moduleOverrides[key];
+ }
+}
+
+
+
+// === Auto-generated preamble library stuff ===
+
+//========================================
+// Runtime code shared with compiler
+//========================================
+
+var Runtime = {
+ stackSave: function () {
+ return STACKTOP;
+ },
+ stackRestore: function (stackTop) {
+ STACKTOP = stackTop;
+ },
+ forceAlign: function (target, quantum) {
+ quantum = quantum || 4;
+ if (quantum == 1) return target;
+ if (isNumber(target) && isNumber(quantum)) {
+ return Math.ceil(target/quantum)*quantum;
+ } else if (isNumber(quantum) && isPowerOfTwo(quantum)) {
+ return '(((' +target + ')+' + (quantum-1) + ')&' + -quantum + ')';
+ }
+ return 'Math.ceil((' + target + ')/' + quantum + ')*' + quantum;
+ },
+ isNumberType: function (type) {
+ return type in Runtime.INT_TYPES || type in Runtime.FLOAT_TYPES;
+ },
+ isPointerType: function isPointerType(type) {
+ return type[type.length-1] == '*';
+},
+ isStructType: function isStructType(type) {
+ if (isPointerType(type)) return false;
+ if (isArrayType(type)) return true;
+ if (/<?\{ ?[^}]* ?\}>?/.test(type)) return true; // { i32, i8 } etc. - anonymous struct types
+ // See comment in isStructPointerType()
+ return type[0] == '%';
+},
+ INT_TYPES: {"i1":0,"i8":0,"i16":0,"i32":0,"i64":0},
+ FLOAT_TYPES: {"float":0,"double":0},
+ or64: function (x, y) {
+ var l = (x | 0) | (y | 0);
+ var h = (Math.round(x / 4294967296) | Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ and64: function (x, y) {
+ var l = (x | 0) & (y | 0);
+ var h = (Math.round(x / 4294967296) & Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ xor64: function (x, y) {
+ var l = (x | 0) ^ (y | 0);
+ var h = (Math.round(x / 4294967296) ^ Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ getNativeTypeSize: function (type) {
+ switch (type) {
+ case 'i1': case 'i8': return 1;
+ case 'i16': return 2;
+ case 'i32': return 4;
+ case 'i64': return 8;
+ case 'float': return 4;
+ case 'double': return 8;
+ default: {
+ if (type[type.length-1] === '*') {
+ return Runtime.QUANTUM_SIZE; // A pointer
+ } else if (type[0] === 'i') {
+ var bits = parseInt(type.substr(1));
+ assert(bits % 8 === 0);
+ return bits/8;
+ } else {
+ return 0;
+ }
+ }
+ }
+ },
+ getNativeFieldSize: function (type) {
+ return Math.max(Runtime.getNativeTypeSize(type), Runtime.QUANTUM_SIZE);
+ },
+ dedup: function dedup(items, ident) {
+ var seen = {};
+ if (ident) {
+ return items.filter(function(item) {
+ if (seen[item[ident]]) return false;
+ seen[item[ident]] = true;
+ return true;
+ });
+ } else {
+ return items.filter(function(item) {
+ if (seen[item]) return false;
+ seen[item] = true;
+ return true;
+ });
+ }
+},
+ set: function set() {
+ var args = typeof arguments[0] === 'object' ? arguments[0] : arguments;
+ var ret = {};
+ for (var i = 0; i < args.length; i++) {
+ ret[args[i]] = 0;
+ }
+ return ret;
+},
+ STACK_ALIGN: 8,
+ getAlignSize: function (type, size, vararg) {
+ // we align i64s and doubles on 64-bit boundaries, unlike x86
+ if (!vararg && (type == 'i64' || type == 'double')) return 8;
+ if (!type) return Math.min(size, 8); // align structures internally to 64 bits
+ return Math.min(size || (type ? Runtime.getNativeFieldSize(type) : 0), Runtime.QUANTUM_SIZE);
+ },
+ calculateStructAlignment: function calculateStructAlignment(type) {
+ type.flatSize = 0;
+ type.alignSize = 0;
+ var diffs = [];
+ var prev = -1;
+ var index = 0;
+ type.flatIndexes = type.fields.map(function(field) {
+ index++;
+ var size, alignSize;
+ if (Runtime.isNumberType(field) || Runtime.isPointerType(field)) {
+ size = Runtime.getNativeTypeSize(field); // pack char; char; in structs, also char[X]s.
+ alignSize = Runtime.getAlignSize(field, size);
+ } else if (Runtime.isStructType(field)) {
+ if (field[1] === '0') {
+ // this is [0 x something]. When inside another structure like here, it must be at the end,
+ // and it adds no size
+ // XXX this happens in java-nbody for example... assert(index === type.fields.length, 'zero-length in the middle!');
+ size = 0;
+ if (Types.types[field]) {
+ alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
+ } else {
+ alignSize = type.alignSize || QUANTUM_SIZE;
+ }
+ } else {
+ size = Types.types[field].flatSize;
+ alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
+ }
+ } else if (field[0] == 'b') {
+ // bN, large number field, like a [N x i8]
+ size = field.substr(1)|0;
+ alignSize = 1;
+ } else if (field[0] === '<') {
+ // vector type
+ size = alignSize = Types.types[field].flatSize; // fully aligned
+ } else if (field[0] === 'i') {
+ // illegal integer field, that could not be legalized because it is an internal structure field
+ // it is ok to have such fields, if we just use them as markers of field size and nothing more complex
+ size = alignSize = parseInt(field.substr(1))/8;
+ assert(size % 1 === 0, 'cannot handle non-byte-size field ' + field);
+ } else {
+ assert(false, 'invalid type for calculateStructAlignment');
+ }
+ if (type.packed) alignSize = 1;
+ type.alignSize = Math.max(type.alignSize, alignSize);
+ var curr = Runtime.alignMemory(type.flatSize, alignSize); // if necessary, place this on aligned memory
+ type.flatSize = curr + size;
+ if (prev >= 0) {
+ diffs.push(curr-prev);
+ }
+ prev = curr;
+ return curr;
+ });
+ if (type.name_ && type.name_[0] === '[') {
+ // arrays have 2 elements, so we get the proper difference. then we scale here. that way we avoid
+ // allocating a potentially huge array for [999999 x i8] etc.
+ type.flatSize = parseInt(type.name_.substr(1))*type.flatSize/2;
+ }
+ type.flatSize = Runtime.alignMemory(type.flatSize, type.alignSize);
+ if (diffs.length == 0) {
+ type.flatFactor = type.flatSize;
+ } else if (Runtime.dedup(diffs).length == 1) {
+ type.flatFactor = diffs[0];
+ }
+ type.needsFlattening = (type.flatFactor != 1);
+ return type.flatIndexes;
+ },
+ generateStructInfo: function (struct, typeName, offset) {
+ var type, alignment;
+ if (typeName) {
+ offset = offset || 0;
+ type = (typeof Types === 'undefined' ? Runtime.typeInfo : Types.types)[typeName];
+ if (!type) return null;
+ if (type.fields.length != struct.length) {
+ printErr('Number of named fields must match the type for ' + typeName + ': possibly duplicate struct names. Cannot return structInfo');
+ return null;
+ }
+ alignment = type.flatIndexes;
+ } else {
+ var type = { fields: struct.map(function(item) { return item[0] }) };
+ alignment = Runtime.calculateStructAlignment(type);
+ }
+ var ret = {
+ __size__: type.flatSize
+ };
+ if (typeName) {
+ struct.forEach(function(item, i) {
+ if (typeof item === 'string') {
+ ret[item] = alignment[i] + offset;
+ } else {
+ // embedded struct
+ var key;
+ for (var k in item) key = k;
+ ret[key] = Runtime.generateStructInfo(item[key], type.fields[i], alignment[i]);
+ }
+ });
+ } else {
+ struct.forEach(function(item, i) {
+ ret[item[1]] = alignment[i];
+ });
+ }
+ return ret;
+ },
+ dynCall: function (sig, ptr, args) {
+ if (args && args.length) {
+ if (!args.splice) args = Array.prototype.slice.call(args);
+ args.splice(0, 0, ptr);
+ return Module['dynCall_' + sig].apply(null, args);
+ } else {
+ return Module['dynCall_' + sig].call(null, ptr);
+ }
+ },
+ functionPointers: [],
+ addFunction: function (func) {
+ for (var i = 0; i < Runtime.functionPointers.length; i++) {
+ if (!Runtime.functionPointers[i]) {
+ Runtime.functionPointers[i] = func;
+ return 2*(1 + i);
+ }
+ }
+ throw 'Finished up all reserved function pointers. Use a higher value for RESERVED_FUNCTION_POINTERS.';
+ },
+ removeFunction: function (index) {
+ Runtime.functionPointers[(index-2)/2] = null;
+ },
+ getAsmConst: function (code, numArgs) {
+ // code is a constant string on the heap, so we can cache these
+ if (!Runtime.asmConstCache) Runtime.asmConstCache = {};
+ var func = Runtime.asmConstCache[code];
+ if (func) return func;
+ var args = [];
+ for (var i = 0; i < numArgs; i++) {
+ args.push(String.fromCharCode(36) + i); // $0, $1 etc
+ }
+ var source = Pointer_stringify(code);
+ if (source[0] === '"') {
+ // tolerate EM_ASM("..code..") even though EM_ASM(..code..) is correct
+ if (source.indexOf('"', 1) === source.length-1) {
+ source = source.substr(1, source.length-2);
+ } else {
+ // something invalid happened, e.g. EM_ASM("..code($0)..", input)
+ abort('invalid EM_ASM input |' + source + '|. Please use EM_ASM(..code..) (no quotes) or EM_ASM({ ..code($0).. }, input) (to input values)');
+ }
+ }
+ try {
+ var evalled = eval('(function(' + args.join(',') + '){ ' + source + ' })'); // new Function does not allow upvars in node
+ } catch(e) {
+ Module.printErr('error in executing inline EM_ASM code: ' + e + ' on: \n\n' + source + '\n\nwith args |' + args + '| (make sure to use the right one out of EM_ASM, EM_ASM_ARGS, etc.)');
+ throw e;
+ }
+ return Runtime.asmConstCache[code] = evalled;
+ },
+ warnOnce: function (text) {
+ if (!Runtime.warnOnce.shown) Runtime.warnOnce.shown = {};
+ if (!Runtime.warnOnce.shown[text]) {
+ Runtime.warnOnce.shown[text] = 1;
+ Module.printErr(text);
+ }
+ },
+ funcWrappers: {},
+ getFuncWrapper: function (func, sig) {
+ assert(sig);
+ if (!Runtime.funcWrappers[func]) {
+ Runtime.funcWrappers[func] = function dynCall_wrapper() {
+ return Runtime.dynCall(sig, func, arguments);
+ };
+ }
+ return Runtime.funcWrappers[func];
+ },
+ UTF8Processor: function () {
+ var buffer = [];
+ var needed = 0;
+ this.processCChar = function (code) {
+ code = code & 0xFF;
+
+ if (buffer.length == 0) {
+ if ((code & 0x80) == 0x00) { // 0xxxxxxx
+ return String.fromCharCode(code);
+ }
+ buffer.push(code);
+ if ((code & 0xE0) == 0xC0) { // 110xxxxx
+ needed = 1;
+ } else if ((code & 0xF0) == 0xE0) { // 1110xxxx
+ needed = 2;
+ } else { // 11110xxx
+ needed = 3;
+ }
+ return '';
+ }
+
+ if (needed) {
+ buffer.push(code);
+ needed--;
+ if (needed > 0) return '';
+ }
+
+ var c1 = buffer[0];
+ var c2 = buffer[1];
+ var c3 = buffer[2];
+ var c4 = buffer[3];
+ var ret;
+ if (buffer.length == 2) {
+ ret = String.fromCharCode(((c1 & 0x1F) << 6) | (c2 & 0x3F));
+ } else if (buffer.length == 3) {
+ ret = String.fromCharCode(((c1 & 0x0F) << 12) | ((c2 & 0x3F) << 6) | (c3 & 0x3F));
+ } else {
+ // http://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae
+ var codePoint = ((c1 & 0x07) << 18) | ((c2 & 0x3F) << 12) |
+ ((c3 & 0x3F) << 6) | (c4 & 0x3F);
+ ret = String.fromCharCode(
+ Math.floor((codePoint - 0x10000) / 0x400) + 0xD800,
+ (codePoint - 0x10000) % 0x400 + 0xDC00);
+ }
+ buffer.length = 0;
+ return ret;
+ }
+ this.processJSString = function processJSString(string) {
+ /* TODO: use TextEncoder when present,
+ var encoder = new TextEncoder();
+ encoder['encoding'] = "utf-8";
+ var utf8Array = encoder['encode'](aMsg.data);
+ */
+ string = unescape(encodeURIComponent(string));
+ var ret = [];
+ for (var i = 0; i < string.length; i++) {
+ ret.push(string.charCodeAt(i));
+ }
+ return ret;
+ }
+ },
+ getCompilerSetting: function (name) {
+ throw 'You must build with -s RETAIN_COMPILER_SETTINGS=1 for Runtime.getCompilerSetting or emscripten_get_compiler_setting to work';
+ },
+ stackAlloc: function (size) { var ret = STACKTOP;STACKTOP = (STACKTOP + size)|0;STACKTOP = (((STACKTOP)+7)&-8); return ret; },
+ staticAlloc: function (size) { var ret = STATICTOP;STATICTOP = (STATICTOP + size)|0;STATICTOP = (((STATICTOP)+7)&-8); return ret; },
+ dynamicAlloc: function (size) { var ret = DYNAMICTOP;DYNAMICTOP = (DYNAMICTOP + size)|0;DYNAMICTOP = (((DYNAMICTOP)+7)&-8); if (DYNAMICTOP >= TOTAL_MEMORY) enlargeMemory();; return ret; },
+ alignMemory: function (size,quantum) { var ret = size = Math.ceil((size)/(quantum ? quantum : 8))*(quantum ? quantum : 8); return ret; },
+ makeBigInt: function (low,high,unsigned) { var ret = (unsigned ? ((+((low>>>0)))+((+((high>>>0)))*(+4294967296))) : ((+((low>>>0)))+((+((high|0)))*(+4294967296)))); return ret; },
+ GLOBAL_BASE: 8,
+ QUANTUM_SIZE: 4,
+ __dummy__: 0
+}
+
+
+Module['Runtime'] = Runtime;
+
+
+
+
+
+
+
+
+
+//========================================
+// Runtime essentials
+//========================================
+
+var __THREW__ = 0; // Used in checking for thrown exceptions.
+
+var ABORT = false; // whether we are quitting the application. no code should run after this. set in exit() and abort()
+var EXITSTATUS = 0;
+
+var undef = 0;
+// tempInt is used for 32-bit signed values or smaller. tempBigInt is used
+// for 32-bit unsigned values or more than 32 bits. TODO: audit all uses of tempInt
+var tempValue, tempInt, tempBigInt, tempInt2, tempBigInt2, tempPair, tempBigIntI, tempBigIntR, tempBigIntS, tempBigIntP, tempBigIntD, tempDouble, tempFloat;
+var tempI64, tempI64b;
+var tempRet0, tempRet1, tempRet2, tempRet3, tempRet4, tempRet5, tempRet6, tempRet7, tempRet8, tempRet9;
+
+function assert(condition, text) {
+ if (!condition) {
+ abort('Assertion failed: ' + text);
+ }
+}
+
+var globalScope = this;
+
+// C calling interface. A convenient way to call C functions (in C files, or
+// defined with extern "C").
+//
+// Note: LLVM optimizations can inline and remove functions, after which you will not be
+// able to call them. Closure can also do so. To avoid that, add your function to
+// the exports using something like
+//
+// -s EXPORTED_FUNCTIONS='["_main", "_myfunc"]'
+//
+// @param ident The name of the C function (note that C++ functions will be name-mangled - use extern "C")
+// @param returnType The return type of the function, one of the JS types 'number', 'string' or 'array' (use 'number' for any C pointer, and
+// 'array' for JavaScript arrays and typed arrays; note that arrays are 8-bit).
+// @param argTypes An array of the types of arguments for the function (if there are no arguments, this can be ommitted). Types are as in returnType,
+// except that 'array' is not possible (there is no way for us to know the length of the array)
+// @param args An array of the arguments to the function, as native JS values (as in returnType)
+// Note that string arguments will be stored on the stack (the JS string will become a C string on the stack).
+// @return The return value, as a native JS value (as in returnType)
+function ccall(ident, returnType, argTypes, args) {
+ return ccallFunc(getCFunc(ident), returnType, argTypes, args);
+}
+Module["ccall"] = ccall;
+
+// Returns the C function with a specified identifier (for C++, you need to do manual name mangling)
+function getCFunc(ident) {
+ try {
+ var func = Module['_' + ident]; // closure exported function
+ if (!func) func = eval('_' + ident); // explicit lookup
+ } catch(e) {
+ }
+ assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');
+ return func;
+}
+
+// Internal function that does a C call using a function, not an identifier
+function ccallFunc(func, returnType, argTypes, args) {
+ var stack = 0;
+ function toC(value, type) {
+ if (type == 'string') {
+ if (value === null || value === undefined || value === 0) return 0; // null string
+ value = intArrayFromString(value);
+ type = 'array';
+ }
+ if (type == 'array') {
+ if (!stack) stack = Runtime.stackSave();
+ var ret = Runtime.stackAlloc(value.length);
+ writeArrayToMemory(value, ret);
+ return ret;
+ }
+ return value;
+ }
+ function fromC(value, type) {
+ if (type == 'string') {
+ return Pointer_stringify(value);
+ }
+ assert(type != 'array');
+ return value;
+ }
+ var i = 0;
+ var cArgs = args ? args.map(function(arg) {
+ return toC(arg, argTypes[i++]);
+ }) : [];
+ var ret = fromC(func.apply(null, cArgs), returnType);
+ if (stack) Runtime.stackRestore(stack);
+ return ret;
+}
+
+// Returns a native JS wrapper for a C function. This is similar to ccall, but
+// returns a function you can call repeatedly in a normal way. For example:
+//
+// var my_function = cwrap('my_c_function', 'number', ['number', 'number']);
+// alert(my_function(5, 22));
+// alert(my_function(99, 12));
+//
+function cwrap(ident, returnType, argTypes) {
+ var func = getCFunc(ident);
+ return function() {
+ return ccallFunc(func, returnType, argTypes, Array.prototype.slice.call(arguments));
+ }
+}
+Module["cwrap"] = cwrap;
+
+// Sets a value in memory in a dynamic way at run-time. Uses the
+// type data. This is the same as makeSetValue, except that
+// makeSetValue is done at compile-time and generates the needed
+// code then, whereas this function picks the right code at
+// run-time.
+// Note that setValue and getValue only do *aligned* writes and reads!
+// Note that ccall uses JS types as for defining types, while setValue and
+// getValue need LLVM types ('i8', 'i32') - this is a lower-level operation
+function setValue(ptr, value, type, noSafe) {
+ type = type || 'i8';
+ if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
+ switch(type) {
+ case 'i1': HEAP8[(ptr)]=value; break;
+ case 'i8': HEAP8[(ptr)]=value; break;
+ case 'i16': HEAP16[((ptr)>>1)]=value; break;
+ case 'i32': HEAP32[((ptr)>>2)]=value; break;
+ case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;
+ case 'float': HEAPF32[((ptr)>>2)]=value; break;
+ case 'double': HEAPF64[((ptr)>>3)]=value; break;
+ default: abort('invalid type for setValue: ' + type);
+ }
+}
+Module['setValue'] = setValue;
+
+// Parallel to setValue.
+function getValue(ptr, type, noSafe) {
+ type = type || 'i8';
+ if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
+ switch(type) {
+ case 'i1': return HEAP8[(ptr)];
+ case 'i8': return HEAP8[(ptr)];
+ case 'i16': return HEAP16[((ptr)>>1)];
+ case 'i32': return HEAP32[((ptr)>>2)];
+ case 'i64': return HEAP32[((ptr)>>2)];
+ case 'float': return HEAPF32[((ptr)>>2)];
+ case 'double': return HEAPF64[((ptr)>>3)];
+ default: abort('invalid type for setValue: ' + type);
+ }
+ return null;
+}
+Module['getValue'] = getValue;
+
+var ALLOC_NORMAL = 0; // Tries to use _malloc()
+var ALLOC_STACK = 1; // Lives for the duration of the current function call
+var ALLOC_STATIC = 2; // Cannot be freed
+var ALLOC_DYNAMIC = 3; // Cannot be freed except through sbrk
+var ALLOC_NONE = 4; // Do not allocate
+Module['ALLOC_NORMAL'] = ALLOC_NORMAL;
+Module['ALLOC_STACK'] = ALLOC_STACK;
+Module['ALLOC_STATIC'] = ALLOC_STATIC;
+Module['ALLOC_DYNAMIC'] = ALLOC_DYNAMIC;
+Module['ALLOC_NONE'] = ALLOC_NONE;
+
+// allocate(): This is for internal use. You can use it yourself as well, but the interface
+// is a little tricky (see docs right below). The reason is that it is optimized
+// for multiple syntaxes to save space in generated code. So you should
+// normally not use allocate(), and instead allocate memory using _malloc(),
+// initialize it with setValue(), and so forth.
+// @slab: An array of data, or a number. If a number, then the size of the block to allocate,
+// in *bytes* (note that this is sometimes confusing: the next parameter does not
+// affect this!)
+// @types: Either an array of types, one for each byte (or 0 if no type at that position),
+// or a single type which is used for the entire block. This only matters if there
+// is initial data - if @slab is a number, then this does not matter at all and is
+// ignored.
+// @allocator: How to allocate memory, see ALLOC_*
+function allocate(slab, types, allocator, ptr) {
+ var zeroinit, size;
+ if (typeof slab === 'number') {
+ zeroinit = true;
+ size = slab;
+ } else {
+ zeroinit = false;
+ size = slab.length;
+ }
+
+ var singleType = typeof types === 'string' ? types : null;
+
+ var ret;
+ if (allocator == ALLOC_NONE) {
+ ret = ptr;
+ } else {
+ ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));
+ }
+
+ if (zeroinit) {
+ var ptr = ret, stop;
+ assert((ret & 3) == 0);
+ stop = ret + (size & ~3);
+ for (; ptr < stop; ptr += 4) {
+ HEAP32[((ptr)>>2)]=0;
+ }
+ stop = ret + size;
+ while (ptr < stop) {
+ HEAP8[((ptr++)|0)]=0;
+ }
+ return ret;
+ }
+
+ if (singleType === 'i8') {
+ if (slab.subarray || slab.slice) {
+ HEAPU8.set(slab, ret);
+ } else {
+ HEAPU8.set(new Uint8Array(slab), ret);
+ }
+ return ret;
+ }
+
+ var i = 0, type, typeSize, previousType;
+ while (i < size) {
+ var curr = slab[i];
+
+ if (typeof curr === 'function') {
+ curr = Runtime.getFunctionIndex(curr);
+ }
+
+ type = singleType || types[i];
+ if (type === 0) {
+ i++;
+ continue;
+ }
+
+ if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later
+
+ setValue(ret+i, curr, type);
+
+ // no need to look up size unless type changes, so cache it
+ if (previousType !== type) {
+ typeSize = Runtime.getNativeTypeSize(type);
+ previousType = type;
+ }
+ i += typeSize;
+ }
+
+ return ret;
+}
+Module['allocate'] = allocate;
+
+function Pointer_stringify(ptr, /* optional */ length) {
+ // TODO: use TextDecoder
+ // Find the length, and check for UTF while doing so
+ var hasUtf = false;
+ var t;
+ var i = 0;
+ while (1) {
+ t = HEAPU8[(((ptr)+(i))|0)];
+ if (t >= 128) hasUtf = true;
+ else if (t == 0 && !length) break;
+ i++;
+ if (length && i == length) break;
+ }
+ if (!length) length = i;
+
+ var ret = '';
+
+ if (!hasUtf) {
+ var MAX_CHUNK = 1024; // split up into chunks, because .apply on a huge string can overflow the stack
+ var curr;
+ while (length > 0) {
+ curr = String.fromCharCode.apply(String, HEAPU8.subarray(ptr, ptr + Math.min(length, MAX_CHUNK)));
+ ret = ret ? ret + curr : curr;
+ ptr += MAX_CHUNK;
+ length -= MAX_CHUNK;
+ }
+ return ret;
+ }
+
+ var utf8 = new Runtime.UTF8Processor();
+ for (i = 0; i < length; i++) {
+ t = HEAPU8[(((ptr)+(i))|0)];
+ ret += utf8.processCChar(t);
+ }
+ return ret;
+}
+Module['Pointer_stringify'] = Pointer_stringify;
+
+// Given a pointer 'ptr' to a null-terminated UTF16LE-encoded string in the emscripten HEAP, returns
+// a copy of that string as a Javascript String object.
+function UTF16ToString(ptr) {
+ var i = 0;
+
+ var str = '';
+ while (1) {
+ var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];
+ if (codeUnit == 0)
+ return str;
+ ++i;
+ // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.
+ str += String.fromCharCode(codeUnit);
+ }
+}
+Module['UTF16ToString'] = UTF16ToString;
+
+// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
+// null-terminated and encoded in UTF16LE form. The copy will require at most (str.length*2+1)*2 bytes of space in the HEAP.
+function stringToUTF16(str, outPtr) {
+ for(var i = 0; i < str.length; ++i) {
+ // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.
+ var codeUnit = str.charCodeAt(i); // possibly a lead surrogate
+ HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;
+ }
+ // Null-terminate the pointer to the HEAP.
+ HEAP16[(((outPtr)+(str.length*2))>>1)]=0;
+}
+Module['stringToUTF16'] = stringToUTF16;
+
+// Given a pointer 'ptr' to a null-terminated UTF32LE-encoded string in the emscripten HEAP, returns
+// a copy of that string as a Javascript String object.
+function UTF32ToString(ptr) {
+ var i = 0;
+
+ var str = '';
+ while (1) {
+ var utf32 = HEAP32[(((ptr)+(i*4))>>2)];
+ if (utf32 == 0)
+ return str;
+ ++i;
+ // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.
+ if (utf32 >= 0x10000) {
+ var ch = utf32 - 0x10000;
+ str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));
+ } else {
+ str += String.fromCharCode(utf32);
+ }
+ }
+}
+Module['UTF32ToString'] = UTF32ToString;
+
+// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
+// null-terminated and encoded in UTF32LE form. The copy will require at most (str.length+1)*4 bytes of space in the HEAP,
+// but can use less, since str.length does not return the number of characters in the string, but the number of UTF-16 code units in the string.
+function stringToUTF32(str, outPtr) {
+ var iChar = 0;
+ for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {
+ // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.
+ var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate
+ if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {
+ var trailSurrogate = str.charCodeAt(++iCodeUnit);
+ codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);
+ }
+ HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;
+ ++iChar;
+ }
+ // Null-terminate the pointer to the HEAP.
+ HEAP32[(((outPtr)+(iChar*4))>>2)]=0;
+}
+Module['stringToUTF32'] = stringToUTF32;
+
+function demangle(func) {
+ var i = 3;
+ // params, etc.
+ var basicTypes = {
+ 'v': 'void',
+ 'b': 'bool',
+ 'c': 'char',
+ 's': 'short',
+ 'i': 'int',
+ 'l': 'long',
+ 'f': 'float',
+ 'd': 'double',
+ 'w': 'wchar_t',
+ 'a': 'signed char',
+ 'h': 'unsigned char',
+ 't': 'unsigned short',
+ 'j': 'unsigned int',
+ 'm': 'unsigned long',
+ 'x': 'long long',
+ 'y': 'unsigned long long',
+ 'z': '...'
+ };
+ var subs = [];
+ var first = true;
+ function dump(x) {
+ //return;
+ if (x) Module.print(x);
+ Module.print(func);
+ var pre = '';
+ for (var a = 0; a < i; a++) pre += ' ';
+ Module.print (pre + '^');
+ }
+ function parseNested() {
+ i++;
+ if (func[i] === 'K') i++; // ignore const
+ var parts = [];
+ while (func[i] !== 'E') {
+ if (func[i] === 'S') { // substitution
+ i++;
+ var next = func.indexOf('_', i);
+ var num = func.substring(i, next) || 0;
+ parts.push(subs[num] || '?');
+ i = next+1;
+ continue;
+ }
+ if (func[i] === 'C') { // constructor
+ parts.push(parts[parts.length-1]);
+ i += 2;
+ continue;
+ }
+ var size = parseInt(func.substr(i));
+ var pre = size.toString().length;
+ if (!size || !pre) { i--; break; } // counter i++ below us
+ var curr = func.substr(i + pre, size);
+ parts.push(curr);
+ subs.push(curr);
+ i += pre + size;
+ }
+ i++; // skip E
+ return parts;
+ }
+ function parse(rawList, limit, allowVoid) { // main parser
+ limit = limit || Infinity;
+ var ret = '', list = [];
+ function flushList() {
+ return '(' + list.join(', ') + ')';
+ }
+ var name;
+ if (func[i] === 'N') {
+ // namespaced N-E
+ name = parseNested().join('::');
+ limit--;
+ if (limit === 0) return rawList ? [name] : name;
+ } else {
+ // not namespaced
+ if (func[i] === 'K' || (first && func[i] === 'L')) i++; // ignore const and first 'L'
+ var size = parseInt(func.substr(i));
+ if (size) {
+ var pre = size.toString().length;
+ name = func.substr(i + pre, size);
+ i += pre + size;
+ }
+ }
+ first = false;
+ if (func[i] === 'I') {
+ i++;
+ var iList = parse(true);
+ var iRet = parse(true, 1, true);
+ ret += iRet[0] + ' ' + name + '<' + iList.join(', ') + '>';
+ } else {
+ ret = name;
+ }
+ paramLoop: while (i < func.length && limit-- > 0) {
+ //dump('paramLoop');
+ var c = func[i++];
+ if (c in basicTypes) {
+ list.push(basicTypes[c]);
+ } else {
+ switch (c) {
+ case 'P': list.push(parse(true, 1, true)[0] + '*'); break; // pointer
+ case 'R': list.push(parse(true, 1, true)[0] + '&'); break; // reference
+ case 'L': { // literal
+ i++; // skip basic type
+ var end = func.indexOf('E', i);
+ var size = end - i;
+ list.push(func.substr(i, size));
+ i += size + 2; // size + 'EE'
+ break;
+ }
+ case 'A': { // array
+ var size = parseInt(func.substr(i));
+ i += size.toString().length;
+ if (func[i] !== '_') throw '?';
+ i++; // skip _
+ list.push(parse(true, 1, true)[0] + ' [' + size + ']');
+ break;
+ }
+ case 'E': break paramLoop;
+ default: ret += '?' + c; break paramLoop;
+ }
+ }
+ }
+ if (!allowVoid && list.length === 1 && list[0] === 'void') list = []; // avoid (void)
+ if (rawList) {
+ if (ret) {
+ list.push(ret + '?');
+ }
+ return list;
+ } else {
+ return ret + flushList();
+ }
+ }
+ try {
+ // Special-case the entry point, since its name differs from other name mangling.
+ if (func == 'Object._main' || func == '_main') {
+ return 'main()';
+ }
+ if (typeof func === 'number') func = Pointer_stringify(func);
+ if (func[0] !== '_') return func;
+ if (func[1] !== '_') return func; // C function
+ if (func[2] !== 'Z') return func;
+ switch (func[3]) {
+ case 'n': return 'operator new()';
+ case 'd': return 'operator delete()';
+ }
+ return parse();
+ } catch(e) {
+ return func;
+ }
+}
+
+function demangleAll(text) {
+ return text.replace(/__Z[\w\d_]+/g, function(x) { var y = demangle(x); return x === y ? x : (x + ' [' + y + ']') });
+}
+
+function stackTrace() {
+ var stack = new Error().stack;
+ return stack ? demangleAll(stack) : '(no stack trace available)'; // Stack trace is not available at least on IE10 and Safari 6.
+}
+
+// Memory management
+
+var PAGE_SIZE = 4096;
+function alignMemoryPage(x) {
+ return (x+4095)&-4096;
+}
+
+var HEAP;
+var HEAP8, HEAPU8, HEAP16, HEAPU16, HEAP32, HEAPU32, HEAPF32, HEAPF64;
+
+var STATIC_BASE = 0, STATICTOP = 0, staticSealed = false; // static area
+var STACK_BASE = 0, STACKTOP = 0, STACK_MAX = 0; // stack area
+var DYNAMIC_BASE = 0, DYNAMICTOP = 0; // dynamic area handled by sbrk
+
+function enlargeMemory() {
+ abort('Cannot enlarge memory arrays. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value ' + TOTAL_MEMORY + ', (2) compile with ALLOW_MEMORY_GROWTH which adjusts the size at runtime but prevents some optimizations, or (3) set Module.TOTAL_MEMORY before the program runs.');
+}
+
+var TOTAL_STACK = Module['TOTAL_STACK'] || 5242880;
+var TOTAL_MEMORY = Module['TOTAL_MEMORY'] || 134217728;
+var FAST_MEMORY = Module['FAST_MEMORY'] || 2097152;
+
+var totalMemory = 4096;
+while (totalMemory < TOTAL_MEMORY || totalMemory < 2*TOTAL_STACK) {
+ if (totalMemory < 16*1024*1024) {
+ totalMemory *= 2;
+ } else {
+ totalMemory += 16*1024*1024
+ }
+}
+if (totalMemory !== TOTAL_MEMORY) {
+ Module.printErr('increasing TOTAL_MEMORY to ' + totalMemory + ' to be more reasonable');
+ TOTAL_MEMORY = totalMemory;
+}
+
+// Initialize the runtime's memory
+// check for full engine support (use string 'subarray' to avoid closure compiler confusion)
+assert(typeof Int32Array !== 'undefined' && typeof Float64Array !== 'undefined' && !!(new Int32Array(1)['subarray']) && !!(new Int32Array(1)['set']),
+ 'JS engine does not provide full typed array support');
+
+var buffer = new ArrayBuffer(TOTAL_MEMORY);
+HEAP8 = new Int8Array(buffer);
+HEAP16 = new Int16Array(buffer);
+HEAP32 = new Int32Array(buffer);
+HEAPU8 = new Uint8Array(buffer);
+HEAPU16 = new Uint16Array(buffer);
+HEAPU32 = new Uint32Array(buffer);
+HEAPF32 = new Float32Array(buffer);
+HEAPF64 = new Float64Array(buffer);
+
+// Endianness check (note: assumes compiler arch was little-endian)
+HEAP32[0] = 255;
+assert(HEAPU8[0] === 255 && HEAPU8[3] === 0, 'Typed arrays 2 must be run on a little-endian system');
+
+Module['HEAP'] = HEAP;
+Module['HEAP8'] = HEAP8;
+Module['HEAP16'] = HEAP16;
+Module['HEAP32'] = HEAP32;
+Module['HEAPU8'] = HEAPU8;
+Module['HEAPU16'] = HEAPU16;
+Module['HEAPU32'] = HEAPU32;
+Module['HEAPF32'] = HEAPF32;
+Module['HEAPF64'] = HEAPF64;
+
+function callRuntimeCallbacks(callbacks) {
+ while(callbacks.length > 0) {
+ var callback = callbacks.shift();
+ if (typeof callback == 'function') {
+ callback();
+ continue;
+ }
+ var func = callback.func;
+ if (typeof func === 'number') {
+ if (callback.arg === undefined) {
+ Runtime.dynCall('v', func);
+ } else {
+ Runtime.dynCall('vi', func, [callback.arg]);
+ }
+ } else {
+ func(callback.arg === undefined ? null : callback.arg);
+ }
+ }
+}
+
+var __ATPRERUN__ = []; // functions called before the runtime is initialized
+var __ATINIT__ = []; // functions called during startup
+var __ATMAIN__ = []; // functions called when main() is to be run
+var __ATEXIT__ = []; // functions called during shutdown
+var __ATPOSTRUN__ = []; // functions called after the runtime has exited
+
+var runtimeInitialized = false;
+
+function preRun() {
+ // compatibility - merge in anything from Module['preRun'] at this time
+ if (Module['preRun']) {
+ if (typeof Module['preRun'] == 'function') Module['preRun'] = [Module['preRun']];
+ while (Module['preRun'].length) {
+ addOnPreRun(Module['preRun'].shift());
+ }
+ }
+ callRuntimeCallbacks(__ATPRERUN__);
+}
+
+function ensureInitRuntime() {
+ if (runtimeInitialized) return;
+ runtimeInitialized = true;
+ callRuntimeCallbacks(__ATINIT__);
+}
+
+function preMain() {
+ callRuntimeCallbacks(__ATMAIN__);
+}
+
+function exitRuntime() {
+ callRuntimeCallbacks(__ATEXIT__);
+}
+
+function postRun() {
+ // compatibility - merge in anything from Module['postRun'] at this time
+ if (Module['postRun']) {
+ if (typeof Module['postRun'] == 'function') Module['postRun'] = [Module['postRun']];
+ while (Module['postRun'].length) {
+ addOnPostRun(Module['postRun'].shift());
+ }
+ }
+ callRuntimeCallbacks(__ATPOSTRUN__);
+}
+
+function addOnPreRun(cb) {
+ __ATPRERUN__.unshift(cb);
+}
+Module['addOnPreRun'] = Module.addOnPreRun = addOnPreRun;
+
+function addOnInit(cb) {
+ __ATINIT__.unshift(cb);
+}
+Module['addOnInit'] = Module.addOnInit = addOnInit;
+
+function addOnPreMain(cb) {
+ __ATMAIN__.unshift(cb);
+}
+Module['addOnPreMain'] = Module.addOnPreMain = addOnPreMain;
+
+function addOnExit(cb) {
+ __ATEXIT__.unshift(cb);
+}
+Module['addOnExit'] = Module.addOnExit = addOnExit;
+
+function addOnPostRun(cb) {
+ __ATPOSTRUN__.unshift(cb);
+}
+Module['addOnPostRun'] = Module.addOnPostRun = addOnPostRun;
+
+// Tools
+
+// This processes a JS string into a C-line array of numbers, 0-terminated.
+// For LLVM-originating strings, see parser.js:parseLLVMString function
+function intArrayFromString(stringy, dontAddNull, length /* optional */) {
+ var ret = (new Runtime.UTF8Processor()).processJSString(stringy);
+ if (length) {
+ ret.length = length;
+ }
+ if (!dontAddNull) {
+ ret.push(0);
+ }
+ return ret;
+}
+Module['intArrayFromString'] = intArrayFromString;
+
+function intArrayToString(array) {
+ var ret = [];
+ for (var i = 0; i < array.length; i++) {
+ var chr = array[i];
+ if (chr > 0xFF) {
+ chr &= 0xFF;
+ }
+ ret.push(String.fromCharCode(chr));
+ }
+ return ret.join('');
+}
+Module['intArrayToString'] = intArrayToString;
+
+// Write a Javascript array to somewhere in the heap
+function writeStringToMemory(string, buffer, dontAddNull) {
+ var array = intArrayFromString(string, dontAddNull);
+ var i = 0;
+ while (i < array.length) {
+ var chr = array[i];
+ HEAP8[(((buffer)+(i))|0)]=chr;
+ i = i + 1;
+ }
+}
+Module['writeStringToMemory'] = writeStringToMemory;
+
+function writeArrayToMemory(array, buffer) {
+ for (var i = 0; i < array.length; i++) {
+ HEAP8[(((buffer)+(i))|0)]=array[i];
+ }
+}
+Module['writeArrayToMemory'] = writeArrayToMemory;
+
+function writeAsciiToMemory(str, buffer, dontAddNull) {
+ for (var i = 0; i < str.length; i++) {
+ HEAP8[(((buffer)+(i))|0)]=str.charCodeAt(i);
+ }
+ if (!dontAddNull) HEAP8[(((buffer)+(str.length))|0)]=0;
+}
+Module['writeAsciiToMemory'] = writeAsciiToMemory;
+
+function unSign(value, bits, ignore) {
+ if (value >= 0) {
+ return value;
+ }
+ return bits <= 32 ? 2*Math.abs(1 << (bits-1)) + value // Need some trickery, since if bits == 32, we are right at the limit of the bits JS uses in bitshifts
+ : Math.pow(2, bits) + value;
+}
+function reSign(value, bits, ignore) {
+ if (value <= 0) {
+ return value;
+ }
+ var half = bits <= 32 ? Math.abs(1 << (bits-1)) // abs is needed if bits == 32
+ : Math.pow(2, bits-1);
+ if (value >= half && (bits <= 32 || value > half)) { // for huge values, we can hit the precision limit and always get true here. so don't do that
+ // but, in general there is no perfect solution here. With 64-bit ints, we get rounding and errors
+ // TODO: In i64 mode 1, resign the two parts separately and safely
+ value = -2*half + value; // Cannot bitshift half, as it may be at the limit of the bits JS uses in bitshifts
+ }
+ return value;
+}
+
+// check for imul support, and also for correctness ( https://bugs.webkit.org/show_bug.cgi?id=126345 )
+if (!Math['imul'] || Math['imul'](0xffffffff, 5) !== -5) Math['imul'] = function imul(a, b) {
+ var ah = a >>> 16;
+ var al = a & 0xffff;
+ var bh = b >>> 16;
+ var bl = b & 0xffff;
+ return (al*bl + ((ah*bl + al*bh) << 16))|0;
+};
+Math.imul = Math['imul'];
+
+
+var Math_abs = Math.abs;
+var Math_cos = Math.cos;
+var Math_sin = Math.sin;
+var Math_tan = Math.tan;
+var Math_acos = Math.acos;
+var Math_asin = Math.asin;
+var Math_atan = Math.atan;
+var Math_atan2 = Math.atan2;
+var Math_exp = Math.exp;
+var Math_log = Math.log;
+var Math_sqrt = Math.sqrt;
+var Math_ceil = Math.ceil;
+var Math_floor = Math.floor;
+var Math_pow = Math.pow;
+var Math_imul = Math.imul;
+var Math_fround = Math.fround;
+var Math_min = Math.min;
+
+// A counter of dependencies for calling run(). If we need to
+// do asynchronous work before running, increment this and
+// decrement it. Incrementing must happen in a place like
+// PRE_RUN_ADDITIONS (used by emcc to add file preloading).
+// Note that you can add dependencies in preRun, even though
+// it happens right before run - run will be postponed until
+// the dependencies are met.
+var runDependencies = 0;
+var runDependencyWatcher = null;
+var dependenciesFulfilled = null; // overridden to take different actions when all run dependencies are fulfilled
+
+function addRunDependency(id) {
+ runDependencies++;
+ if (Module['monitorRunDependencies']) {
+ Module['monitorRunDependencies'](runDependencies);
+ }
+}
+Module['addRunDependency'] = addRunDependency;
+function removeRunDependency(id) {
+ runDependencies--;
+ if (Module['monitorRunDependencies']) {
+ Module['monitorRunDependencies'](runDependencies);
+ }
+ if (runDependencies == 0) {
+ if (runDependencyWatcher !== null) {
+ clearInterval(runDependencyWatcher);
+ runDependencyWatcher = null;
+ }
+ if (dependenciesFulfilled) {
+ var callback = dependenciesFulfilled;
+ dependenciesFulfilled = null;
+ callback(); // can add another dependenciesFulfilled
+ }
+ }
+}
+Module['removeRunDependency'] = removeRunDependency;
+
+Module["preloadedImages"] = {}; // maps url to image data
+Module["preloadedAudios"] = {}; // maps url to audio data
+
+
+var memoryInitializer = null;
+
+// === Body ===
+
+
+
+
+
+STATIC_BASE = 8;
+
+STATICTOP = STATIC_BASE + Runtime.alignMemory(13467);
+/* global initializers */ __ATINIT__.push();
+
+
+/* memory initializer */ allocate([99,97,110,110,111,116,32,99,114,101,97,116,101,32,115,116,97,116,101,58,32,110,111,116,32,101,110,111,117,103,104,32,109,101,109,111,114,121,0,0,40,101,114,114,111,114,32,111,98,106,101,99,116,32,105,115,32,110,111,116,32,97,32,115,116,114,105,110,103,41,0,0,88,0,0,0,0,0,0,0,108,117,97,0,0,0,0,0,76,85,65,95,78,79,69,78,86,0,0,0,0,0,0,0,116,111,111,32,109,97,110,121,32,114,101,115,117,108,116,115,32,116,111,32,112,114,105,110,116,0,0,0,0,0,0,0,112,114,105,110,116,0,0,0,101,114,114,111,114,32,99,97,108,108,105,110,103,32,39,112,114,105,110,116,39,32,40,37,115,41,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,105,110,116,101,114,114,117,112,116,101,100,33,0,0,0,0,95,95,116,111,115,116,114,105,110,103,0,0,0,0,0,0,40,110,111,32,101,114,114,111,114,32,109,101,115,115,97,103,101,41,0,0,0,0,0,0,61,115,116,100,105,110,0,0,60,101,111,102,62,0,0,0,114,101,116,117,114,110,32,37,115,0,0,0,0,0,0,0,95,80,82,79,77,80,84,0,95,80,82,79,77,80,84,50,0,0,0,0,0,0,0,0,62,32,0,0,0,0,0,0,62,62,32,0,0,0,0,0,97,114,103,0,0,0,0,0,45,0,0,0,0,0,0,0,45,45,0,0,0,0,0,0,116,111,111,32,109,97,110,121,32,97,114,103,117,109,101,110,116,115,32,116,111,32,115,99,114,105,112,116,0,0,0,0,61,40,99,111,109,109,97,110,100,32,108,105,110,101,41,0,114,101,113,117,105,114,101,0,61,76,85,65,95,73,78,73,84,95,53,95,50,0,0,0,61,76,85,65,95,73,78,73,84,0,0,0,0,0,0,0,76,117,97,32,53,46,50,46,50,32,32,67,111,112,121,114,105,103,104,116,32,40,67,41,32,49,57,57,52,45,50,48,49,51,32,76,117,97,46,111,114,103,44,32,80,85,67,45,82,105,111,0,0,0,0,0,37,115,58,32,0,0,0,0,39,37,115,39,32,110,101,101,100,115,32,97,114,103,117,109,101,110,116,10,0,0,0,0,117,110,114,101,99,111,103,110,105,122,101,100,32,111,112,116,105,111,110,32,39,37,115,39,10,0,0,0,0,0,0,0,117,115,97,103,101,58,32,37,115,32,91,111,112,116,105,111,110,115,93,32,91,115,99,114,105,112,116,32,91,97,114,103,115,93,93,10,65,118,97,105,108,97,98,108,101,32,111,112,116,105,111,110,115,32,97,114,101,58,10,32,32,45,101,32,115,116,97,116,32,32,101,120,101,99,117,116,101,32,115,116,114,105,110,103,32,39,115,116,97,116,39,10,32,32,45,105,32,32,32,32,32,32,32,101,110,116,101,114,32,105,110,116,101,114,97,99,116,105,118,101,32,109,111,100,101,32,97,102,116,101,114,32,101,120,101,99,117,116,105,110,103,32,39,115,99,114,105,112,116,39,10,32,32,45,108,32,110,97,109,101,32,32,114,101,113,117,105,114,101,32,108,105,98,114,97,114,121,32,39,110,97,109,101,39,10,32,32,45,118,32,32,32,32,32,32,32,115,104,111,119,32,118,101,114,115,105,111,110,32,105,110,102,111,114,109,97,116,105,111,110,10,32,32,45,69,32,32,32,32,32,32,32,105,103,110,111,114,101,32,101,110,118,105,114,111,110,109,101,110,116,32,118,97,114,105,97,98,108,101,115,10,32,32,45,45,32,32,32,32,32,32,32,115,116,111,112,32,104,97,110,100,108,105,110,103,32,111,112,116,105,111,110,115,10,32,32,45,32,32,32,32,32,32,32,32,115,116,111,112,32,104,97,110,100,108,105,110,103,32,111,112,116,105,111,110,115,32,97,110,100,32,101,120,101,99,117,116,101,32,115,116,100,105,110,10,0,0,0,0,0,0,0,37,115,10,0,0,0,0,0,0,0,0,0,0,96,127,64,63,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,37,115,10,0,0,0,0,0,115,116,97,99,107,32,116,114,97,99,101,98,97,99,107,58,0,0,0,0,0,0,0,0,10,9,46,46,46,0,0,0,83,108,110,116,0,0,0,0,10,9,37,115,58,0,0,0,37,100,58,0,0,0,0,0,32,105,110,32,0,0,0,0,10,9,40,46,46,46,116,97,105,108,32,99,97,108,108,115,46,46,46,41,0,0,0,0,98,97,100,32,97,114,103,117,109,101,110,116,32,35,37,100,32,40,37,115,41,0,0,0,110,0,0,0,0,0,0,0,109,101,116,104,111,100,0,0,99,97,108,108,105,110,103,32,39,37,115,39,32,111,110,32,98,97,100,32,115,101,108,102,32,40,37,115,41,0,0,0,63,0,0,0,0,0,0,0,98,97,100,32,97,114,103,117,109,101,110,116,32,35,37,100,32,116,111,32,39,37,115,39,32,40,37,115,41,0,0,0,83,108,0,0,0,0,0,0,37,115,58,37,100,58,32,0,0,0,0,0,0,0,0,0,37,115,58,32,37,115,0,0,101,120,105,116,0,0,0,0,105,110,118,97,108,105,100,32,111,112,116,105,111,110,32,39,37,115,39,0,0,0,0,0,115,116,97,99,107,32,111,118,101,114,102,108,111,119,32,40,37,115,41,0,0,0,0,0,115,116,97,99,107,32,111,118,101,114,102,108,111,119,0,0,118,97,108,117,101,32,101,120,112,101,99,116,101,100,0,0,98,117,102,102,101,114,32,116,111,111,32,108,97,114,103,101,0,0,0,0,0,0,0,0,61,115,116,100,105,110,0,0,64,37,115,0,0,0,0,0,114,0,0,0,0,0,0,0,111,112,101,110,0,0,0,0,114,98,0,0,0,0,0,0,114,101,111,112,101,110,0,0,114,101,97,100,0,0,0,0,111,98,106,101,99,116,32,108,101,110,103,116,104,32,105,115,32,110,111,116,32,97,32,110,117,109,98,101,114,0,0,0,95,95,116,111,115,116,114,105,110,103,0,0,0,0,0,0,116,114,117,101,0,0,0,0,102,97,108,115,101,0,0,0,110,105,108,0,0,0,0,0,37,115,58,32,37,112,0,0,95,76,79,65,68,69,68,0,110,97,109,101,32,99,111,110,102,108,105,99,116,32,102,111,114,32,109,111,100,117,108,101,32,39,37,115,39,0,0,0,116,111,111,32,109,97,110,121,32,117,112,118,97,108,117,101,115,0,0,0,0,0,0,0,109,117,108,116,105,112,108,101,32,76,117,97,32,86,77,115,32,100,101,116,101,99,116,101,100,0,0,0,0,0,0,0,118,101,114,115,105,111,110,32,109,105,115,109,97,116,99,104,58,32,97,112,112,46,32,110,101,101,100,115,32,37,102,44,32,76,117,97,32,99,111,114,101,32,112,114,111,118,105,100,101,115,32,37,102,0,0,0,98,97,100,32,99,111,110,118,101,114,115,105,111,110,32,110,117,109,98,101,114,45,62,105,110,116,59,32,109,117,115,116,32,114,101,99,111,109,112,105,108,101,32,76,117,97,32,119,105,116,104,32,112,114,111,112,101,114,32,115,101,116,116,105,110,103,115,0,0,0,0,0,80,65,78,73,67,58,32,117,110,112,114,111,116,101,99,116,101,100,32,101,114,114,111,114,32,105,110,32,99,97,108,108,32,116,111,32,76,117,97,32,65,80,73,32,40,37,115,41,10,0,0,0,0,0,0,0,239,187,191,0,0,0,0,0,99,97,110,110,111,116,32,37,115,32,37,115,58,32,37,115,0,0,0,0,0,0,0,0,37,115,32,101,120,112,101,99,116,101,100,44,32,103,111,116,32,37,115,0,0,0,0,0,102,0,0,0,0,0,0,0,46,0,0,0,0,0,0,0,102,117,110,99,116,105,111,110,32,39,37,115,39,0,0,0,109,97,105,110,32,99,104,117,110,107,0,0,0,0,0,0,102,117,110,99,116,105,111,110,32,60,37,115,58,37,100,62,0,0,0,0,0,0,0,0,97,116,116,101,109,112,116,32,116,111,32,37,115,32,37,115,32,39,37,115,39,32,40,97,32,37,115,32,118,97,108,117,101,41,0,0,0,0,0,0,97,116,116,101,109,112,116,32,116,111,32,37,115,32,97,32,37,115,32,118,97,108,117,101,0,0,0,0,0,0,0,0,99,111,110,99,97,116,101,110,97,116,101,0,0,0,0,0,112,101,114,102,111,114,109,32,97,114,105,116,104,109,101,116,105,99,32,111,110,0,0,0,97,116,116,101,109,112,116,32,116,111,32,99,111,109,112,97,114,101,32,116,119,111,32,37,115,32,118,97,108,117,101,115,0,0,0,0,0,0,0,0,97,116,116,101,109,112,116,32,116,111,32,99,111,109,112,97,114,101,32,37,115,32,119,105,116,104,32,37,115,0,0,0,37,115,58,37,100,58,32,37,115,0,0,0,0,0,0,0,108,111,99,97,108,0,0,0,95,69,78,86,0,0,0,0,103,108,111,98,97,108,0,0,102,105,101,108,100,0,0,0,117,112,118,97,108,117,101,0,99,111,110,115,116,97,110,116,0,0,0,0,0,0,0,0,109,101,116,104,111,100,0,0,63,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,102,111,114,32,105,116,101,114,97,116,111,114,0,0,0,0,109,101,116,97,109,101,116,104,111,100,0,0,0,0,0,0,61,91,67,93,0,0,0,0,67,0,0,0,0,0,0,0,61,63,0,0,0,0,0,0,109,97,105,110,0,0,0,0,76,117,97,0,0,0,0,0,40,42,116,101,109,112,111,114,97,114,121,41,0,0,0,0,40,42,118,97,114,97,114,103,41,0,0,0,0,0,0,0,115,116,97,99,107,32,111,118,101,114,102,108,111,119,0,0,67,32,115,116,97,99,107,32,111,118,101,114,102,108,111,119,0,0,0,0,0,0,0,0,97,116,116,101,109,112,116,32,116,111,32,121,105,101,108,100,32,97,99,114,111,115,115,32,97,32,67,45,99,97,108,108,32,98,111,117,110,100,97,114,121,0,0,0,0,0,0,0,97,116,116,101,109,112,116,32,116,111,32,121,105,101,108,100,32,102,114,111,109,32,111,117,116,115,105,100,101,32,97,32,99,111,114,111,117,116,105,110,101,0,0,0,0,0,0,0,98,105,110,97,114,121,0,0,116,101,120,116,0,0,0,0,97,116,116,101,109,112,116,32,116,111,32,108,111,97,100,32,97,32,37,115,32,99,104,117,110,107,32,40,109,111,100,101,32,105,115,32,39,37,115,39,41,0,0,0,0,0,0,0,101,114,114,111,114,32,105,110,32,101,114,114,111,114,32,104,97,110,100,108,105,110,103,0,99,97,110,110,111,116,32,114,101,115,117,109,101,32,110,111,110,45,115,117,115,112,101,110,100,101,100,32,99,111,114,111,117,116,105,110,101,0,0,0,99,97,110,110,111,116,32,114,101,115,117,109,101,32,100,101,97,100,32,99,111,114,111,117,116,105,110,101,0,0,0,0,99,97,108,108,0,0,0,0,110,111,32,109,101,115,115,97,103,101,0,0,0,0,0,0,101,114,114,111,114,32,105,110,32,95,95,103,99,32,109,101,116,97,109,101,116,104,111,100,32,40,37,115,41,0,0,0,95,80,82,69,76,79,65,68,0,0,0,0,0,0,0,0,95,71,0,0,0,0,0,0,112,97,99,107,97,103,101,0,99,111,114,111,117,116,105,110,101,0,0,0,0,0,0,0,116,97,98,108,101,0,0,0,105,111,0,0,0,0,0,0,111,115,0,0,0,0,0,0,115,116,114,105,110,103,0,0,98,105,116,51,50,0,0,0,109,97,116,104,0,0,0,0,100,101,98,117,103,0,0,0,144,11,0,0,1,0,0,0,152,11,0,0,2,0,0,0,48,13,0,0,3,0,0,0,160,11,0,0,4,0,0,0,56,13,0,0,5,0,0,0,64,13,0,0,6,0,0,0,72,13,0,0,7,0,0,0,168,11,0,0,8,0,0,0,80,13,0,0,9,0,0,0,88,13,0,0,10,0,0,0,192,11,0,0,11,0,0,0,0,0,0,0,0,0,0,0,95,73,79,95,105,110,112,117,116,0,0,0,0,0,0,0,115,116,100,105,110,0,0,0,95,73,79,95,111,117,116,112,117,116,0,0,0,0,0,0,115,116,100,111,117,116,0,0,115,116,100,101,114,114,0,0,70,73,76,69,42,0,0,0,99,97,110,110,111,116,32,99,108,111,115,101,32,115,116,97,110,100,97,114,100,32,102,105,108,101,0,0,0,0,0,0,95,95,105,110,100,101,120,0,144,11,0,0,1,0,0,0,152,11,0,0,12,0,0,0,160,11,0,0,13,0,0,0,168,11,0,0,14,0,0,0,176,11,0,0,15,0,0,0,184,11,0,0,16,0,0,0,192,11,0,0,17,0,0,0,200,11,0,0,18,0,0,0,208,11,0,0,19,0,0,0,0,0,0,0,0,0,0,0,99,108,111,115,101,0,0,0,102,108,117,115,104,0,0,0,108,105,110,101,115,0,0,0,114,101,97,100,0,0,0,0,115,101,101,107,0,0,0,0,115,101,116,118,98,117,102,0,119,114,105,116,101,0,0,0,95,95,103,99,0,0,0,0,95,95,116,111,115,116,114,105,110,103,0,0,0,0,0,0,102,105,108,101,32,40,99,108,111,115,101,100,41,0,0,0,102,105,108,101,32,40,37,112,41,0,0,0,0,0,0,0,37,46,49,52,103,0,0,0,97,116,116,101,109,112,116,32,116,111,32,117,115,101,32,97,32,99,108,111,115,101,100,32,102,105,108,101,0,0,0,0,2,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,72,12,0,0,80,12,0,0,88,12,0,0,0,0,0,0,110,111,0,0,0,0,0,0,102,117,108,108,0,0,0,0,108,105,110,101,0,0,0,0,0,0,0,0,1,0,0,0,2,0,0,0,0,0,0,0,128,12,0,0,136,12,0,0,144,12,0,0,0,0,0,0,115,101,116,0,0,0,0,0,99,117,114,0,0,0,0,0,101,110,100,0,0,0,0,0,110,111,116,32,97,110,32,105,110,116,101,103,101,114,32,105,110,32,112,114,111,112,101,114,32,114,97,110,103,101,0,0,116,111,111,32,109,97,110,121,32,97,114,103,117,109,101,110,116,115,0,0,0,0,0,0,105,110,118,97,108,105,100,32,111,112,116,105,111,110,0,0,105,110,118,97,108,105,100,32,102,111,114,109,97,116,0,0,37,108,102,0,0,0,0,0,116,111,111,32,109,97,110,121,32,111,112,116,105,111,110,115,0,0,0,0,0,0,0,0,102,105,108,101,32,105,115,32,97,108,114,101,97,100,121,32,99,108,111,115,101,100,0,0,37,115,0,0,0,0,0,0,105,110,112,117,116,0,0,0,111,112,101,110,0,0,0,0,111,117,116,112,117,116,0,0,112,111,112,101,110,0,0,0,116,109,112,102,105,108,101,0,116,121,112,101,0,0,0,0,115,116,97,110,100,97,114,100,32,37,115,32,102,105,108,101,32,105,115,32,99,108,111,115,101,100,0,0,0,0,0,0,99,108,111,115,101,100,32,102,105,108,101,0,0,0,0,0,102,105,108,101,0,0,0,0,114,0,0,0,0,0,0,0,39,112,111,112,101,110,39,32,110,111,116,32,115,117,112,112,111,114,116,101,100,0,0,0,119,0,0,0,0,0,0,0,99,97,110,110,111,116,32,111,112,101,110,32,102,105,108,101,32,39,37,115,39,32,40,37,115,41,0,0,0,0,0,0,114,119,97,0,0,0,0,0,105,110,118,97,108,105,100,32,109,111,100,101,0,0,0,0,240,14,0,0,20,0,0,0,248,14,0,0,21,0,0,0,0,15,0,0,22,0,0,0,8,15,0,0,23,0,0,0,16,15,0,0,24,0,0,0,24,15,0,0,25,0,0,0,32,15,0,0,26,0,0,0,40,15,0,0,27,0,0,0,48,15,0,0,28,0,0,0,56,15,0,0,29,0,0,0,64,15,0,0,30,0,0,0,72,15,0,0,31,0,0,0,80,15,0,0,32,0,0,0,88,15,0,0,33,0,0,0,96,15,0,0,34,0,0,0,104,15,0,0,35,0,0,0,112,15,0,0,36,0,0,0,120,15,0,0,37,0,0,0,128,15,0,0,38,0,0,0,136,15,0,0,39,0,0,0,144,15,0,0,40,0,0,0,152,15,0,0,41,0,0,0,160,15,0,0,42,0,0,0,176,15,0,0,43,0,0,0,184,15,0,0,44,0,0,0,192,15,0,0,45,0,0,0,200,15,0,0,46,0,0,0,208,15,0,0,47,0,0,0,0,0,0,0,0,0,0,0,112,105,0,0,0,0,0,0,104,117,103,101,0,0,0,0,97,98,115,0,0,0,0,0,97,99,111,115,0,0,0,0,97,115,105,110,0,0,0,0,97,116,97,110,50,0,0,0,97,116,97,110,0,0,0,0,99,101,105,108,0,0,0,0,99,111,115,104,0,0,0,0,99,111,115,0,0,0,0,0,100,101,103,0,0,0,0,0,101,120,112,0,0,0,0,0,102,108,111,111,114,0,0,0,102,109,111,100,0,0,0,0,102,114,101,120,112,0,0,0,108,100,101,120,112,0,0,0,108,111,103,49,48,0,0,0,108,111,103,0,0,0,0,0,109,97,120,0,0,0,0,0,109,105,110,0,0,0,0,0,109,111,100,102,0,0,0,0,112,111,119,0,0,0,0,0,114,97,100,0,0,0,0,0,114,97,110,100,111,109,0,0,114,97,110,100,111,109,115,101,101,100,0,0,0,0,0,0,115,105,110,104,0,0,0,0,115,105,110,0,0,0,0,0,115,113,114,116,0,0,0,0,116,97,110,104,0,0,0,0,116,97,110,0,0,0,0,0,105,110,116,101,114,118,97,108,32,105,115,32,101,109,112,116,121,0,0,0,0,0,0,0,119,114,111,110,103,32,110,117,109,98,101,114,32,111,102,32,97,114,103,117,109,101,110,116,115,0,0,0,0,0,0,0,116,111,111,32,109,97,110,121,32,37,115,32,40,108,105,109,105,116,32,105,115,32,37,100,41,0,0,0,0,0,0,0,109,101,109,111,114,121,32,97,108,108,111,99,97,116,105,111,110,32,101,114,114,111,114,58,32,98,108,111,99,107,32,116,111,111,32,98,105,103,0,0,95,67,76,73,66,83,0,0,95,95,103,99,0,0,0,0,16,20,0,0,48,0,0,0,24,20,0,0,49,0,0,0,40,20,0,0,50,0,0,0,0,0,0,0,0,0,0,0,108,111,97,100,101,114,115,0,115,101,97,114,99,104,101,114,115,0,0,0,0,0,0,0,112,97,116,104,0,0,0,0,76,85,65,95,80,65,84,72,95,53,95,50,0,0,0,0,76,85,65,95,80,65,84,72,0,0,0,0,0,0,0,0,47,117,115,114,47,108,111,99,97,108,47,115,104,97,114,101,47,108,117,97,47,53,46,50,47,63,46,108,117,97,59,47,117,115,114,47,108,111,99,97,108,47,115,104,97,114,101,47,108,117,97,47,53,46,50,47,63,47,105,110,105,116,46,108,117,97,59,47,117,115,114,47,108,111,99,97,108,47,108,105,98,47,108,117,97,47,53,46,50,47,63,46,108,117,97,59,47,117,115,114,47,108,111,99,97,108,47,108,105,98,47,108,117,97,47,53,46,50,47,63,47,105,110,105,116,46,108,117,97,59,46,47,63,46,108,117,97,0,0,0,0,0,0,0,99,112,97,116,104,0,0,0,76,85,65,95,67,80,65,84,72,95,53,95,50,0,0,0,76,85,65,95,67,80,65,84,72,0,0,0,0,0,0,0,47,117,115,114,47,108,111,99,97,108,47,108,105,98,47,108,117,97,47,53,46,50,47,63,46,115,111,59,47,117,115,114,47,108,111,99,97,108,47,108,105,98,47,108,117,97,47,53,46,50,47,108,111,97,100,97,108,108,46,115,111,59,46,47,63,46,115,111,0,0,0,0,47,10,59,10,63,10,33,10,45,10,0,0,0,0,0,0,99,111,110,102,105,103,0,0,95,76,79,65,68,69,68,0,108,111,97,100,101,100,0,0,95,80,82,69,76,79,65,68,0,0,0,0,0,0,0,0,112,114,101,108,111,97,100,0,32,18,0,0,51,0,0,0,40,18,0,0,52,0,0,0,0,0,0,0,0,0,0,0,109,111,100,117,108,101,0,0,114,101,113,117,105,114,101,0,39,112,97,99,107,97,103,101,46,115,101,97,114,99,104,101,114,115,39,32,109,117,115,116,32,98,101,32,97,32,116,97,98,108,101,0,0,0,0,0,109,111,100,117,108,101,32,39,37,115,39,32,110,111,116,32,102,111,117,110,100,58,37,115,0,0,0,0,0,0,0,0,95,78,65,77,69,0,0,0,102,0,0,0,0,0,0,0,39,109,111,100,117,108,101,39,32,110,111,116,32,99,97,108,108,101,100,32,102,114,111,109,32,97,32,76,117,97,32,102,117,110,99,116,105,111,110,0,95,77,0,0,0,0,0,0,95,80,65,67,75,65,71,69,0,0,0,0,0,0,0,0,59,59,0,0,0,0,0,0,59,1,59,0,0,0,0,0,1,0,0,0,0,0,0,0,76,85,65,95,78,79,69,78,86,0,0,0,0,0,0,0,47,0,0,0,0,0,0,0,10,9,110,111,32,109,111,100,117,108,101,32,39,37,115,39,32,105,110,32,102,105,108,101,32,39,37,115,39,0,0,0,101,114,114,111,114,32,108,111,97,100,105,110,103,32,109,111,100,117,108,101,32,39,37,115,39,32,102,114,111,109,32,102,105,108,101,32,39,37,115,39,58,10,9,37,115,0,0,0,46,0,0,0,0,0,0,0,95,0,0,0,0,0,0,0,108,117,97,111,112,101,110,95,37,115,0,0,0,0,0,0,100,121,110,97,109,105,99,32,108,105,98,114,97,114,105,101,115,32,110,111,116,32,101,110,97,98,108,101,100,59,32,99,104,101,99,107,32,121,111,117,114,32,76,117,97,32,105,110,115,116,97,108,108,97,116,105,111,110,0,0,0,0,0,0,39,112,97,99,107,97,103,101,46,37,115,39,32,109,117,115,116,32,98,101,32,97,32,115,116,114,105,110,103,0,0,0,63,0,0,0,0,0,0,0,10,9,110,111,32,102,105,108,101,32,39,37,115,39,0,0,114,0,0,0,0,0,0,0,10,9,110,111,32,102,105,101,108,100,32,112,97,99,107,97,103,101,46,112,114,101,108,111,97,100,91,39,37,115,39,93,0,0,0,0,0,0,0,0,108,111,97,100,108,105,98,0,115,101,97,114,99,104,112,97,116,104,0,0,0,0,0,0,115,101,101,97,108,108,0,0,95,95,105,110,100,101,120,0,97,98,115,101,110,116,0,0,105,110,105,116,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,110,78,0,0,0,0,0,0,120,88,0,0,0,0,0,0,40,110,117,108,108,41,0,0,37,112,0,0,0,0,0,0,37,0,0,0,0,0,0,0,105,110,118,97,108,105,100,32,111,112,116,105,111,110,32,39,37,37,37,99,39,32,116,111,32,39,108,117,97,95,112,117,115,104,102,115,116,114,105,110,103,39,0,0,0,0,0,0,46,46,46,0,0,0,0,0,91,115,116,114,105,110,103,32,34,0,0,0,0,0,0,0,34,93,0,0,0,0,0,0,96,113,65,84,80,80,92,108,60,16,60,84,108,124,124,124,124,124,124,96,96,96,104,34,188,188,188,132,228,84,84,16,98,98,4,98,20,81,80,23,88,22,0,0,53,0,0,0,96,22,0,0,54,0,0,0,104,22,0,0,55,0,0,0,120,22,0,0,56,0,0,0,128,22,0,0,57,0,0,0,136,22,0,0,58,0,0,0,144,22,0,0,59,0,0,0,152,22,0,0,60,0,0,0,160,22,0,0,61,0,0,0,176,22,0,0,62,0,0,0,184,22,0,0,63,0,0,0,0,0,0,0,0,0,0,0,99,108,111,99,107,0,0,0,100,97,116,101,0,0,0,0,100,105,102,102,116,105,109,101,0,0,0,0,0,0,0,0,101,120,101,99,117,116,101,0,101,120,105,116,0,0,0,0,103,101,116,101,110,118,0,0,114,101,109,111,118,101,0,0,114,101,110,97,109,101,0,0,115,101,116,108,111,99,97,108,101,0,0,0,0,0,0,0,116,105,109,101,0,0,0,0,116,109,112,110,97,109,101,0,117,110,97,98,108,101,32,116,111,32,103,101,110,101,114,97,116,101,32,97,32,117,110,105,113,117,101,32,102,105,108,101,110,97,109,101,0,0,0,0,115,101,99,0,0,0,0,0,109,105,110,0,0,0,0,0,104,111,117,114,0,0,0,0,100,97,121,0,0,0,0,0,109,111,110,116,104,0,0,0,121,101,97,114,0,0,0,0,105,115,100,115,116,0,0,0,102,105,101,108,100,32,39,37,115,39,32,109,105,115,115,105,110,103,32,105,110,32,100,97,116,101,32,116,97,98,108,101,0,0,0,0,0,0,0,0,6,0,0,0,3,0,0,0,0,0,0,0,4,0,0,0,1,0,0,0,2,0,0,0,128,23,0,0,136,23,0,0,144,23,0,0,152,23,0,0,168,23,0,0,176,22,0,0,0,0,0,0,0,0,0,0,97,108,108,0,0,0,0,0,99,111,108,108,97,116,101,0,99,116,121,112,101,0,0,0,109,111,110,101,116,97,114,121,0,0,0,0,0,0,0,0,110,117,109,101,114,105,99,0,37,99,0,0,0,0,0,0,42,116,0,0,0,0,0,0,119,100,97,121,0,0,0,0,121,100,97,121,0,0,0,0,97,65,98,66,99,100,72,73,106,109,77,112,83,85,119,87,120,88,121,89,122,37,0,0,105,110,118,97,108,105,100,32,99,111,110,118,101,114,115,105,111,110,32,115,112,101,99,105,102,105,101,114,32,39,37,37,37,115,39,0,0,0,0,0,60,37,115,62,32,97,116,32,108,105,110,101,32,37,100,32,110,111,116,32,105,110,115,105,100,101,32,97,32,108,111,111,112,0,0,0,0,0,0,0,110,111,32,118,105,115,105,98,108,101,32,108,97,98,101,108,32,39,37,115,39,32,102,111,114,32,60,103,111,116,111,62,32,97,116,32,108,105,110,101,32,37,100,0,0,0,0,0,60,103,111,116,111,32,37,115,62,32,97,116,32,108,105,110,101,32,37,100,32,106,117,109,112,115,32,105,110,116,111,32,116,104,101,32,115,99,111,112,101,32,111,102,32,108,111,99,97,108,32,39,37,115,39,0,98,114,101,97,107,0,0,0,108,97,98,101,108,115,47,103,111,116,111,115,0,0,0,0,37,115,32,101,120,112,101,99,116,101,100,0,0,0,0,0,115,121,110,116,97,120,32,101,114,114,111,114,0,0,0,0,67,32,108,101,118,101,108,115,0,0,0,0,0,0,0,0,6,6,6,6,7,7,7,7,7,7,10,9,5,4,3,3,3,3,3,3,3,3,3,3,3,3,2,2,1,1,0,0,99,97,110,110,111,116,32,117,115,101,32,39,46,46,46,39,32,111,117,116,115,105,100,101,32,97,32,118,97,114,97,114,103,32,102,117,110,99,116,105,111,110,0,0,0,0,0,0,115,101,108,102,0,0,0,0,60,110,97,109,101,62,32,111,114,32,39,46,46,46,39,32,101,120,112,101,99,116,101,100,0,0,0,0,0,0,0,0,108,111,99,97,108,32,118,97,114,105,97,98,108,101,115,0,102,117,110,99,116,105,111,110,115,0,0,0,0,0,0,0,105,116,101,109,115,32,105,110,32,97,32,99,111,110,115,116,114,117,99,116,111,114,0,0,109,97,105,110,32,102,117,110,99,116,105,111,110,0,0,0,102,117,110,99,116,105,111,110,32,97,116,32,108,105,110,101,32,37,100,0,0,0,0,0,116,111,111,32,109,97,110,121,32,37,115,32,40,108,105,109,105,116,32,105,115,32,37,100,41,32,105,110,32,37,115,0,102,117,110,99,116,105,111,110,32,97,114,103,117,109,101,110,116,115,32,101,120,112,101,99,116,101,100,0,0,0,0,0,117,110,101,120,112,101,99,116,101,100,32,115,121,109,98,111,108,0,0,0,0,0,0,0,108,97,98,101,108,32,39,37,115,39,32,97,108,114,101,97,100,121,32,100,101,102,105,110,101,100,32,111,110,32,108,105,110,101,32,37,100,0,0,0,39,61,39,32,111,114,32,39,105,110,39,32,101,120,112,101,99,116,101,100,0,0,0,0,40,102,111,114,32,103,101,110,101,114,97,116,111,114,41,0,40,102,111,114,32,115,116,97,116,101,41,0,0,0,0,0,40,102,111,114,32,99,111,110,116,114,111,108,41,0,0,0,40,102,111,114,32,105,110,100,101,120,41,0,0,0,0,0,40,102,111,114,32,108,105,109,105,116,41,0,0,0,0,0,40,102,111,114,32,115,116,101,112,41,0,0,0,0,0,0,37,115,32,101,120,112,101,99,116,101,100,32,40,116,111,32,99,108,111,115,101,32,37,115,32,97,116,32,108,105,110,101,32,37,100,41,0,0,0,0,117,112,118,97,108,117,101,115,0,0,0,0,0,0,0,0,110,111,116,32,101,110,111,117,103,104,32,109,101,109,111,114,121,0,0,0,0,0,0,0,144,27,0,0,64,0,0,0,152,27,0,0,65,0,0,0,160,27,0,0,66,0,0,0,168,27,0,0,67,0,0,0,176,27,0,0,68,0,0,0,184,27,0,0,69,0,0,0,192,27,0,0,70,0,0,0,200,27,0,0,71,0,0,0,208,27,0,0,72,0,0,0,216,27,0,0,73,0,0,0,224,27,0,0,74,0,0,0,232,27,0,0,75,0,0,0,240,27,0,0,76,0,0,0,248,27,0,0,77,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,95,95,105,110,100,101,120,0,98,121,116,101,0,0,0,0,99,104,97,114,0,0,0,0,100,117,109,112,0,0,0,0,102,105,110,100,0,0,0,0,102,111,114,109,97,116,0,0,103,109,97,116,99,104,0,0,103,115,117,98,0,0,0,0,108,101,110,0,0,0,0,0,108,111,119,101,114,0,0,0,109,97,116,99,104,0,0,0,114,101,112,0,0,0,0,0,114,101,118,101,114,115,101,0,115,117,98,0,0,0,0,0,117,112,112,101,114,0,0,0,114,101,115,117,108,116,105,110,103,32,115,116,114,105,110,103,32,116,111,111,32,108,97,114,103,101,0,0,0,0,0,0,116,111,111,32,109,97,110,121,32,99,97,112,116,117,114,101,115,0,0,0,0,0,0,0,105,110,118,97,108,105,100,32,99,97,112,116,117,114,101,32,105,110,100,101,120,0,0,0,117,110,102,105,110,105,115,104,101,100,32,99,97,112,116,117,114,101,0,0,0,0,0,0,112,97,116,116,101,114,110,32,116,111,111,32,99,111,109,112,108,101,120,0,0,0,0,0,109,105,115,115,105,110,103,32,39,91,39,32,97,102,116,101,114,32,39,37,37,102,39,32,105,110,32,112,97,116,116,101,114,110,0,0,0,0,0,0,105,110,118,97,108,105,100,32,99,97,112,116,117,114,101,32,105,110,100,101,120,32,37,37,37,100,0,0,0,0,0,0,109,97,108,102,111,114,109,101,100,32,112,97,116,116,101,114,110,32,40,101,110,100,115,32,119,105,116,104,32,39,37,37,39,41,0,0,0,0,0,0,109,97,108,102,111,114,109,101,100,32,112,97,116,116,101,114,110,32,40,109,105,115,115,105,110,103,32,39,93,39,41,0,109,97,108,102,111,114,109,101,100,32,112,97,116,116,101,114,110,32,40,109,105,115,115,105,110,103,32,97,114,103,117,109,101,110,116,115,32,116,111,32,39,37,37,98,39,41,0,0,105,110,118,97,108,105,100,32,112,97,116,116,101,114,110,32,99,97,112,116,117,114,101,0,94,36,42,43,63,46,40,91,37,45,0,0,0,0,0,0,115,116,114,105,110,103,47,102,117,110,99,116,105,111,110,47,116,97,98,108,101,32,101,120,112,101,99,116,101,100,0,0,105,110,118,97,108,105,100,32,114,101,112,108,97,99,101,109,101,110,116,32,118,97,108,117,101,32,40,97,32,37,115,41,0,0,0,0,0,0,0,0,105,110,118,97,108,105,100,32,117,115,101,32,111,102,32,39,37,99,39,32,105,110,32,114,101,112,108,97,99,101,109,101,110,116,32,115,116,114,105,110,103,0,0,0,0,0,0,0,110,111,32,118,97,108,117,101,0,0,0,0,0,0,0,0,110,111,116,32,97,32,110,117,109,98,101,114,32,105,110,32,112,114,111,112,101,114,32,114,97,110,103,101,0,0,0,0,110,111,116,32,97,32,110,111,110,45,110,101,103,97,116,105,118,101,32,110,117,109,98,101,114,32,105,110,32,112,114,111,112,101,114,32,114,97,110,103,101,0,0,0,0,0,0,0,105,110,118,97,108,105,100,32,111,112,116,105,111,110,32,39,37,37,37,99,39,32,116,111,32,39,102,111,114,109,97,116,39,0,0,0,0,0,0,0,92,37,100,0,0,0,0,0,92,37,48,51,100,0,0,0,45,43,32,35,48,0,0,0,105,110,118,97,108,105,100,32,102,111,114,109,97,116,32,40,114,101,112,101,97,116,101,100,32,102,108,97,103,115,41,0,105,110,118,97,108,105,100,32,102,111,114,109,97,116,32,40,119,105,100,116,104,32,111,114,32,112,114,101,99,105,115,105,111,110,32,116,111,111,32,108,111,110,103,41,0,0,0,0,117,110,97,98,108,101,32,116,111,32,100,117,109,112,32,103,105,118,101,110,32,102,117,110,99,116,105,111,110,0,0,0,118,97,108,117,101,32,111,117,116,32,111,102,32,114,97,110,103,101,0,0,0,0,0,0,115,116,114,105,110,103,32,115,108,105,99,101,32,116,111,111,32,108,111,110,103,0,0,0,116,97,98,108,101,32,105,110,100,101,120,32,105,115,32,110,105,108,0,0,0,0,0,0,116,97,98,108,101,32,105,110,100,101,120,32,105,115,32,78,97,78,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,116,97,98,108,101,32,111,118,101,114,102,108,111,119,0,0,105,110,118,97,108,105,100,32,107,101,121,32,116,111,32,39,110,101,120,116,39,0,0,0,224,31,0,0,78,0,0,0,232,31,0,0,79,0,0,0,240,31,0,0,80,0,0,0,248,31,0,0,81,0,0,0,216,31,0,0,82,0,0,0,0,32,0,0,83,0,0,0,8,32,0,0,84,0,0,0,0,0,0,0,0,0,0,0,117,110,112,97,99,107,0,0,99,111,110,99,97,116,0,0,109,97,120,110,0,0,0,0,105,110,115,101,114,116,0,0,112,97,99,107,0,0,0,0,114,101,109,111,118,101,0,0,115,111,114,116,0,0,0,0,0,0,0,0,0,0,0,0,105,110,118,97,108,105,100,32,111,114,100,101,114,32,102,117,110,99,116,105,111,110,32,102,111,114,32,115,111,114,116,105,110,103,0,0,0,0,0,0,112,111,115,105,116,105,111,110,32,111,117,116,32,111,102,32,98,111,117,110,100,115,0,0,116,111,111,32,109,97,110,121,32,114,101,115,117,108,116,115,32,116,111,32,117,110,112,97,99,107,0,0,0,0,0,0,110,0,0,0,0,0,0,0,119,114,111,110,103,32,110,117,109,98,101,114,32,111,102,32,97,114,103,117,109,101,110,116,115,32,116,111,32,39,105,110,115,101,114,116,39,0,0,0,105,110,118,97,108,105,100,32,118,97,108,117,101,32,40,37,115,41,32,97,116,32,105,110,100,101,120,32,37,100,32,105,110,32,116,97,98,108,101,32,102,111,114,32,39,99,111,110,99,97,116,39,0,0,0,0,110,111,32,118,97,108,117,101,0,0,0,0,0,0,0,0,110,105,108,0,0,0,0,0,98,111,111,108,101,97,110,0,117,115,101,114,100,97,116,97,0,0,0,0,0,0,0,0,110,117,109,98,101,114,0,0,115,116,114,105,110,103,0,0,116,97,98,108,101,0,0,0,102,117,110,99,116,105,111,110,0,0,0,0,0,0,0,0,116,104,114,101,97,100,0,0,112,114,111,116,111,0,0,0,117,112,118,97,108,0,0,0,224,32,0,0,240,32,0,0,248,32,0,0,0,33,0,0,16,33,0,0,24,33,0,0,32,33,0,0,40,33,0,0,0,33,0,0,56,33,0,0,64,33,0,0,72,33,0,0,200,33,0,0,208,33,0,0,224,33,0,0,232,33,0,0,240,33,0,0,248,33,0,0,0,34,0,0,8,34,0,0,16,34,0,0,24,34,0,0,32,34,0,0,40,34,0,0,48,34,0,0,56,34,0,0,64,34,0,0,72,34,0,0,88,34,0,0,0,0,0,0,95,95,105,110,100,101,120,0,95,95,110,101,119,105,110,100,101,120,0,0,0,0,0,0,95,95,103,99,0,0,0,0,95,95,109,111,100,101,0,0,95,95,108,101,110,0,0,0,95,95,101,113,0,0,0,0,95,95,97,100,100,0,0,0,95,95,115,117,98,0,0,0,95,95,109,117,108,0,0,0,95,95,100,105,118,0,0,0,95,95,109,111,100,0,0,0,95,95,112,111,119,0,0,0,95,95,117,110,109,0,0,0,95,95,108,116,0,0,0,0,95,95,108,101,0,0,0,0,95,95,99,111,110,99,97,116,0,0,0,0,0,0,0,0,95,95,99,97,108,108,0,0,98,105,110,97,114,121,32,115,116,114,105,110,103,0,0,0,25,147,13,10,26,10,0,0,116,114,117,110,99,97,116,101,100,0,0,0,0,0,0,0,37,115,58,32,37,115,32,112,114,101,99,111,109,112,105,108,101,100,32,99,104,117,110,107,0,0,0,0,0,0,0,0,99,111,114,114,117,112,116,101,100,0,0,0,0,0,0,0,110,111,116,32,97,0,0,0,118,101,114,115,105,111,110,32,109,105,115,109,97,116,99,104,32,105,110,0,0,0,0,0,105,110,99,111,109,112,97,116,105,98,108,101,0,0,0,0,37,46,49,52,103,0,0,0,105,110,100,101,120,0,0,0,108,111,111,112,32,105,110,32,103,101,116,116,97,98,108,101,0,0,0,0,0,0,0,0,108,111,111,112,32,105,110,32,115,101,116,116,97,98,108,101,0,0,0,0,0,0,0,0,115,116,114,105,110,103,32,108,101,110,103,116,104,32,111,118,101,114,102,108,111,119,0,0,103,101,116,32,108,101,110,103,116,104,32,111,102,0,0,0,39,102,111,114,39,32,105,110,105,116,105,97,108,32,118,97,108,117,101,32,109,117,115,116,32,98,101,32,97,32,110,117,109,98,101,114,0,0,0,0,39,102,111,114,39,32,108,105,109,105,116,32,109,117,115,116,32,98,101,32,97,32,110,117,109,98,101,114,0,0,0,0,39,102,111,114,39,32,115,116,101,112,32,109,117,115,116,32,98,101,32,97,32,110,117,109,98,101,114,0,0,0,0,0,95,71,0,0,0,0,0,0,152,36,0,0,85,0,0,0,160,36,0,0,86,0,0,0,176,36,0,0,87,0,0,0,184,36,0,0,88,0,0,0,192,36,0,0,89,0,0,0,208,36,0,0,90,0,0,0,216,36,0,0,91,0,0,0,232,36,0,0,92,0,0,0,240,36,0,0,92,0,0,0,0,37,0,0,93,0,0,0,8,37,0,0,94,0,0,0,16,37,0,0,95,0,0,0,24,37,0,0,96,0,0,0,32,37,0,0,97,0,0,0,48,37,0,0,98,0,0,0,56,37,0,0,99,0,0,0,64,37,0,0,100,0,0,0,72,37,0,0,101,0,0,0,80,37,0,0,102,0,0,0,96,37,0,0,103,0,0,0,112,37,0,0,104,0,0,0,128,37,0,0,105,0,0,0,136,37,0,0,106,0,0,0,0,0,0,0,0,0,0,0,76,117,97,32,53,46,50,0,95,86,69,82,83,73,79,78,0,0,0,0,0,0,0,0,97,115,115,101,114,116,0,0,99,111,108,108,101,99,116,103,97,114,98,97,103,101,0,0,100,111,102,105,108,101,0,0,101,114,114,111,114,0,0,0,103,101,116,109,101,116,97,116,97,98,108,101,0,0,0,0,105,112,97,105,114,115,0,0,108,111,97,100,102,105,108,101,0,0,0,0,0,0,0,0,108,111,97,100,0,0,0,0,108,111,97,100,115,116,114,105,110,103,0,0,0,0,0,0,110,101,120,116,0,0,0,0,112,97,105,114,115,0,0,0,112,99,97,108,108,0,0,0,112,114,105,110,116,0,0,0,114,97,119,101,113,117,97,108,0,0,0,0,0,0,0,0,114,97,119,108,101,110,0,0,114,97,119,103,101,116,0,0,114,97,119,115,101,116,0,0,115,101,108,101,99,116,0,0,115,101,116,109,101,116,97,116,97,98,108,101,0,0,0,0,116,111,110,117,109,98,101,114,0,0,0,0,0,0,0,0,116,111,115,116,114,105,110,103,0,0,0,0,0,0,0,0,116,121,112,101,0,0,0,0,120,112,99,97,108,108,0,0,118,97,108,117,101,32,101,120,112,101,99,116,101,100,0,0,115,116,97,99,107,32,111,118,101,114,102,108,111,119,0,0,98,97,115,101,32,111,117,116,32,111,102,32,114,97,110,103,101,0,0,0,0,0,0,0,32,12,10,13,9,11,0,0,110,105,108,32,111,114,32,116,97,98,108,101,32,101,120,112,101,99,116,101,100,0,0,0,95,95,109,101,116,97,116,97,98,108,101,0,0,0,0,0,99,97,110,110,111,116,32,99,104,97,110,103,101,32,97,32,112,114,111,116,101,99,116,101,100,32,109,101,116,97,116,97,98,108,101,0,0,0,0,0,105,110,100,101,120,32,111,117,116,32,111,102,32,114,97,110,103,101,0,0,0,0,0,0,116,97,98,108,101,32,111,114,32,115,116,114,105,110,103,32,101,120,112,101,99,116,101,100,0,0,0,0,0,0,0,0,39,116,111,115,116,114,105,110,103,39,32,109,117,115,116,32,114,101,116,117,114,110,32,97,32,115,116,114,105,110,103,32,116,111,32,39,112,114,105,110,116,39,0,0,0,0,0,0,95,95,112,97,105,114,115,0,98,116,0,0,0,0,0,0,61,40,108,111,97,100,41,0,116,111,111,32,109,97,110,121,32,110,101,115,116,101,100,32,102,117,110,99,116,105,111,110,115,0,0,0,0,0,0,0,114,101,97,100,101,114,32,102,117,110,99,116,105,111,110,32,109,117,115,116,32,114,101,116,117,114,110,32,97,32,115,116,114,105,110,103,0,0,0,0,95,95,105,112,97,105,114,115,0,0,0,0,0,0,0,0,40,39,0,0,48,39,0,0,56,39,0,0,64,39,0,0,72,39,0,0,80,39,0,0,96,39,0,0,112,39,0,0,128,39,0,0,144,39,0,0,160,39,0,0,0,0,0,0,115,116,111,112,0,0,0,0,114,101,115,116,97,114,116,0,99,111,108,108,101,99,116,0,99,111,117,110,116,0,0,0,115,116,101,112,0,0,0,0,115,101,116,112,97,117,115,101,0,0,0,0,0,0,0,0,115,101,116,115,116,101,112,109,117,108,0,0,0,0,0,0,115,101,116,109,97,106,111,114,105,110,99,0,0,0,0,0,105,115,114,117,110,110,105,110,103,0,0,0,0,0,0,0,103,101,110,101,114,97,116,105,111,110,97,108,0,0,0,0,105,110,99,114,101,109,101,110,116,97,108,0,0,0,0,0,0,0,0,0,1,0,0,0,2,0,0,0,3,0,0,0,5,0,0,0,6,0,0,0,7,0,0,0,8,0,0,0,9,0,0,0,10,0,0,0,11,0,0,0,0,0,0,0,37,115,0,0,0,0,0,0,97,115,115,101,114,116,105,111,110,32,102,97,105,108,101,100,33,0,0,0,0,0,0,0,104,40,0,0,107], "i8", ALLOC_NONE, Runtime.GLOBAL_BASE);
+/* memory initializer */ allocate([112,40,0,0,108,0,0,0,120,40,0,0,109,0,0,0,128,40,0,0,110,0,0,0,136,40,0,0,111,0,0,0,144,40,0,0,112,0,0,0,152,40,0,0,113,0,0,0,160,40,0,0,114,0,0,0,168,40,0,0,115,0,0,0,176,40,0,0,116,0,0,0,184,40,0,0,117,0,0,0,192,40,0,0,118,0,0,0,0,0,0,0,0,0,0,0,97,114,115,104,105,102,116,0,98,97,110,100,0,0,0,0,98,110,111,116,0,0,0,0,98,111,114,0,0,0,0,0,98,120,111,114,0,0,0,0,98,116,101,115,116,0,0,0,101,120,116,114,97,99,116,0,108,114,111,116,97,116,101,0,108,115,104,105,102,116,0,0,114,101,112,108,97,99,101,0,114,114,111,116,97,116,101,0,114,115,104,105,102,116,0,0,102,105,101,108,100,32,99,97,110,110,111,116,32,98,101,32,110,101,103,97,116,105,118,101,0,0,0,0,0,0,0,0,119,105,100,116,104,32,109,117,115,116,32,98,101,32,112,111,115,105,116,105,118,101,0,0,116,114,121,105,110,103,32,116,111,32,97,99,99,101,115,115,32,110,111,110,45,101,120,105,115,116,101,110,116,32,98,105,116,115,0,0,0,0,0,0,102,117,110,99,116,105,111,110,32,111,114,32,101,120,112,114,101,115,115,105,111,110,32,116,111,111,32,99,111,109,112,108,101,120,0,0,0,0,0,0,99,111,110,115,116,114,117,99,116,111,114,32,116,111,111,32,108,111,110,103,0,0,0,0,99,111,110,115,116,97,110,116,115,0,0,0,0,0,0,0,111,112,99,111,100,101,115,0,99,111,110,116,114,111,108,32,115,116,114,117,99,116,117,114,101,32,116,111,111,32,108,111,110,103,0,0,0,0,0,0,216,41,0,0,119,0,0,0,224,41,0,0,120,0,0,0,232,41,0,0,121,0,0,0,240,41,0,0,122,0,0,0,248,41,0,0,123,0,0,0,0,42,0,0,124,0,0,0,0,0,0,0,0,0,0,0,99,114,101,97,116,101,0,0,114,101,115,117,109,101,0,0,114,117,110,110,105,110,103,0,115,116,97,116,117,115,0,0,119,114,97,112,0,0,0,0,121,105,101,108,100,0,0,0,116,111,111,32,109,97,110,121,32,97,114,103,117,109,101,110,116,115,32,116,111,32,114,101,115,117,109,101,0,0,0,0,99,97,110,110,111,116,32,114,101,115,117,109,101,32,100,101,97,100,32,99,111,114,111,117,116,105,110,101,0,0,0,0,116,111,111,32,109,97,110,121,32,114,101,115,117,108,116,115,32,116,111,32,114,101,115,117,109,101,0,0,0,0,0,0,99,111,114,111,117,116,105,110,101,32,101,120,112,101,99,116,101,100,0,0,0,0,0,0,115,117,115,112,101,110,100,101,100,0,0,0,0,0,0,0,110,111,114,109,97,108,0,0,100,101,97,100,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,8,8,8,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,22,22,22,22,22,22,22,22,22,22,4,4,4,4,4,4,4,21,21,21,21,21,21,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,4,4,4,4,5,4,21,21,21,21,21,21,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,4,4,4,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,48,44,0,0,125,0,0,0,56,44,0,0,126,0,0,0,72,44,0,0,127,0,0,0,80,44,0,0,128,0,0,0,88,44,0,0,129,0,0,0,104,44,0,0,130,0,0,0,120,44,0,0,131,0,0,0,136,44,0,0,132,0,0,0,152,44,0,0,133,0,0,0,168,44,0,0,134,0,0,0,184,44,0,0,135,0,0,0,200,44,0,0,136,0,0,0,208,44,0,0,137,0,0,0,224,44,0,0,138,0,0,0,240,44,0,0,139,0,0,0,0,45,0,0,140,0,0,0,0,0,0,0,0,0,0,0,100,101,98,117,103,0,0,0,103,101,116,117,115,101,114,118,97,108,117,101,0,0,0,0,103,101,116,104,111,111,107,0,103,101,116,105,110,102,111,0,103,101,116,108,111,99,97,108,0,0,0,0,0,0,0,0,103,101,116,114,101,103,105,115,116,114,121,0,0,0,0,0,103,101,116,109,101,116,97,116,97,98,108,101,0,0,0,0,103,101,116,117,112,118,97,108,117,101,0,0,0,0,0,0,117,112,118,97,108,117,101,106,111,105,110,0,0,0,0,0,117,112,118,97,108,117,101,105,100,0,0,0,0,0,0,0,115,101,116,117,115,101,114,118,97,108,117,101,0,0,0,0,115,101,116,104,111,111,107,0,115,101,116,108,111,99,97,108,0,0,0,0,0,0,0,0,115,101,116,109,101,116,97,116,97,98,108,101,0,0,0,0,115,101,116,117,112,118,97,108,117,101,0,0,0,0,0,0,116,114,97,99,101,98,97,99,107,0,0,0,0,0,0,0,110,105,108,32,111,114,32,116,97,98,108,101,32,101,120,112,101,99,116,101,100,0,0,0,108,101,118,101,108,32,111,117,116,32,111,102,32,114,97,110,103,101,0,0,0,0,0,0,95,72,75,69,89,0,0,0,107,0,0,0,0,0,0,0,95,95,109,111,100,101,0,0,112,45,0,0,120,45,0,0,128,45,0,0,136,45,0,0,144,45,0,0,0,0,0,0,99,97,108,108,0,0,0,0,114,101,116,117,114,110,0,0,108,105,110,101,0,0,0,0,99,111,117,110,116,0,0,0,116,97,105,108,32,99,97,108,108,0,0,0,0,0,0,0,102,117,108,108,32,117,115,101,114,100,97,116,97,32,101,120,112,101,99,116,101,100,44,32,103,111,116,32,108,105,103,104,116,32,117,115,101,114,100,97,116,97,0,0,0,0,0,0,62,117,0,0,0,0,0,0,105,110,118,97,108,105,100,32,117,112,118,97,108,117,101,32,105,110,100,101,120,0,0,0,76,117,97,32,102,117,110,99,116,105,111,110,32,101,120,112,101,99,116,101,100,0,0,0,102,108,110,83,116,117,0,0,62,37,115,0,0,0,0,0,102,117,110,99,116,105,111,110,32,111,114,32,108,101,118,101,108,32,101,120,112,101,99,116,101,100,0,0,0,0,0,0,105,110,118,97,108,105,100,32,111,112,116,105,111,110,0,0,115,111,117,114,99,101,0,0,115,104,111,114,116,95,115,114,99,0,0,0,0,0,0,0,108,105,110,101,100,101,102,105,110,101,100,0,0,0,0,0,108,97,115,116,108,105,110,101,100,101,102,105,110,101,100,0,119,104,97,116,0,0,0,0,99,117,114,114,101,110,116,108,105,110,101,0,0,0,0,0,110,117,112,115,0,0,0,0,110,112,97,114,97,109,115,0,105,115,118,97,114,97,114,103,0,0,0,0,0,0,0,0,110,97,109,101,0,0,0,0,110,97,109,101,119,104,97,116,0,0,0,0,0,0,0,0,105,115,116,97,105,108,99,97,108,108,0,0,0,0,0,0,97,99,116,105,118,101,108,105,110,101,115,0,0,0,0,0,102,117,110,99,0,0,0,0,101,120,116,101,114,110,97,108,32,104,111,111,107,0,0,0,108,117,97,95,100,101,98,117,103,62,32,0,0,0,0,0,99,111,110,116,10,0,0,0,61,40,100,101,98,117,103,32,99,111,109,109,97,110,100,41,0,0,0,0,0,0,0,0,37,115,10,0,0,0,0,0,80,49,0,0,88,49,0,0,96,49,0,0,104,49,0,0,112,49,0,0,120,49,0,0,128,49,0,0,136,49,0,0,144,49,0,0,160,49,0,0,168,49,0,0,176,49,0,0,184,49,0,0,192,49,0,0,200,49,0,0,208,49,0,0,216,49,0,0,224,49,0,0,232,49,0,0,240,49,0,0,248,49,0,0,0,50,0,0,8,50,0,0,16,50,0,0,24,50,0,0,32,50,0,0,40,50,0,0,48,50,0,0,56,50,0,0,64,50,0,0,72,50,0,0,88,50,0,0,96,50,0,0,0,0,0,0,39,37,99,39,0,0,0,0,99,104,97,114,40,37,100,41,0,0,0,0,0,0,0,0,39,37,115,39,0,0,0,0,95,69,78,86,0,0,0,0,105,110,118,97,108,105,100,32,108,111,110,103,32,115,116,114,105,110,103,32,100,101,108,105,109,105,116,101,114,0,0,0,46,0,0,0,0,0,0,0,69,101,0,0,0,0,0,0,88,120,0,0,0,0,0,0,80,112,0,0,0,0,0,0,43,45,0,0,0,0,0,0,109,97,108,102,111,114,109,101,100,32,110,117,109,98,101,114,0,0,0,0,0,0,0,0,108,101,120,105,99,97,108,32,101,108,101,109,101,110,116,32,116,111,111,32,108,111,110,103,0,0,0,0,0,0,0,0,117,110,102,105,110,105,115,104,101,100,32,115,116,114,105,110,103,0,0,0,0,0,0,0,105,110,118,97,108,105,100,32,101,115,99,97,112,101,32,115,101,113,117,101,110,99,101,0,100,101,99,105,109,97,108,32,101,115,99,97,112,101,32,116,111,111,32,108,97,114,103,101,0,0,0,0,0,0,0,0,104,101,120,97,100,101,99,105,109,97,108,32,100,105,103,105,116,32,101,120,112,101,99,116,101,100,0,0,0,0,0,0,117,110,102,105,110,105,115,104,101,100,32,108,111,110,103,32,115,116,114,105,110,103,0,0,117,110,102,105,110,105,115,104,101,100,32,108,111,110,103,32,99,111,109,109,101,110,116,0,99,104,117,110,107,32,104,97,115,32,116,111,111,32,109,97,110,121,32,108,105,110,101,115,0,0,0,0,0,0,0,0,37,115,58,37,100,58,32,37,115,0,0,0,0,0,0,0,37,115,32,110,101,97,114,32,37,115,0,0,0,0,0,0,97,110,100,0,0,0,0,0,98,114,101,97,107,0,0,0,100,111,0,0,0,0,0,0,101,108,115,101,0,0,0,0,101,108,115,101,105,102,0,0,101,110,100,0,0,0,0,0,102,97,108,115,101,0,0,0,102,111,114,0,0,0,0,0,102,117,110,99,116,105,111,110,0,0,0,0,0,0,0,0,103,111,116,111,0,0,0,0,105,102,0,0,0,0,0,0,105,110,0,0,0,0,0,0,108,111,99,97,108,0,0,0,110,105,108,0,0,0,0,0,110,111,116,0,0,0,0,0,111,114,0,0,0,0,0,0,114,101,112,101,97,116,0,0,114,101,116,117,114,110,0,0,116,104,101,110,0,0,0,0,116,114,117,101,0,0,0,0,117,110,116,105,108,0,0,0,119,104,105,108,101,0,0,0,46,46,0,0,0,0,0,0,46,46,46,0,0,0,0,0,61,61,0,0,0,0,0,0,62,61,0,0,0,0,0,0,60,61,0,0,0,0,0,0,126,61,0,0,0,0,0,0,58,58,0,0,0,0,0,0,60,101,111,102,62,0,0,0,60,110,117,109,98,101,114,62,0,0,0,0,0,0,0,0,60,110,97,109,101,62,0,0,60,115,116,114,105,110,103,62,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,105,110,102,105,110,105,116,121,0,0,0,0,0,0,0,0,110,97,110,0,0,0,0,0,95,112,137,0,255,9,47,15,10,0,0,0,100,0,0,0,232,3,0,0,16,39,0,0,160,134,1,0,64,66,15,0,128,150,152,0,0,225,245,5], "i8", ALLOC_NONE, Runtime.GLOBAL_BASE+10240);
+
+
+
+
+var tempDoublePtr = Runtime.alignMemory(allocate(12, "i8", ALLOC_STATIC), 8);
+
+assert(tempDoublePtr % 8 == 0);
+
+function copyTempFloat(ptr) { // functions, because inlining this code increases code size too much
+
+ HEAP8[tempDoublePtr] = HEAP8[ptr];
+
+ HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
+
+ HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
+
+ HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
+
+}
+
+function copyTempDouble(ptr) {
+
+ HEAP8[tempDoublePtr] = HEAP8[ptr];
+
+ HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
+
+ HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
+
+ HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
+
+ HEAP8[tempDoublePtr+4] = HEAP8[ptr+4];
+
+ HEAP8[tempDoublePtr+5] = HEAP8[ptr+5];
+
+ HEAP8[tempDoublePtr+6] = HEAP8[ptr+6];
+
+ HEAP8[tempDoublePtr+7] = HEAP8[ptr+7];
+
+}
+
+
+
+
+ Module["_rand_r"] = _rand_r;
+
+ var ___rand_seed=allocate([0x0273459b, 0, 0, 0], "i32", ALLOC_STATIC);
+ Module["_rand"] = _rand;
+
+
+
+ var ERRNO_CODES={EPERM:1,ENOENT:2,ESRCH:3,EINTR:4,EIO:5,ENXIO:6,E2BIG:7,ENOEXEC:8,EBADF:9,ECHILD:10,EAGAIN:11,EWOULDBLOCK:11,ENOMEM:12,EACCES:13,EFAULT:14,ENOTBLK:15,EBUSY:16,EEXIST:17,EXDEV:18,ENODEV:19,ENOTDIR:20,EISDIR:21,EINVAL:22,ENFILE:23,EMFILE:24,ENOTTY:25,ETXTBSY:26,EFBIG:27,ENOSPC:28,ESPIPE:29,EROFS:30,EMLINK:31,EPIPE:32,EDOM:33,ERANGE:34,ENOMSG:42,EIDRM:43,ECHRNG:44,EL2NSYNC:45,EL3HLT:46,EL3RST:47,ELNRNG:48,EUNATCH:49,ENOCSI:50,EL2HLT:51,EDEADLK:35,ENOLCK:37,EBADE:52,EBADR:53,EXFULL:54,ENOANO:55,EBADRQC:56,EBADSLT:57,EDEADLOCK:35,EBFONT:59,ENOSTR:60,ENODATA:61,ETIME:62,ENOSR:63,ENONET:64,ENOPKG:65,EREMOTE:66,ENOLINK:67,EADV:68,ESRMNT:69,ECOMM:70,EPROTO:71,EMULTIHOP:72,EDOTDOT:73,EBADMSG:74,ENOTUNIQ:76,EBADFD:77,EREMCHG:78,ELIBACC:79,ELIBBAD:80,ELIBSCN:81,ELIBMAX:82,ELIBEXEC:83,ENOSYS:38,ENOTEMPTY:39,ENAMETOOLONG:36,ELOOP:40,EOPNOTSUPP:95,EPFNOSUPPORT:96,ECONNRESET:104,ENOBUFS:105,EAFNOSUPPORT:97,EPROTOTYPE:91,ENOTSOCK:88,ENOPROTOOPT:92,ESHUTDOWN:108,ECONNREFUSED:111,EADDRINUSE:98,ECONNABORTED:103,ENETUNREACH:101,ENETDOWN:100,ETIMEDOUT:110,EHOSTDOWN:112,EHOSTUNREACH:113,EINPROGRESS:115,EALREADY:114,EDESTADDRREQ:89,EMSGSIZE:90,EPROTONOSUPPORT:93,ESOCKTNOSUPPORT:94,EADDRNOTAVAIL:99,ENETRESET:102,EISCONN:106,ENOTCONN:107,ETOOMANYREFS:109,EUSERS:87,EDQUOT:122,ESTALE:116,ENOTSUP:95,ENOMEDIUM:123,EILSEQ:84,EOVERFLOW:75,ECANCELED:125,ENOTRECOVERABLE:131,EOWNERDEAD:130,ESTRPIPE:86};
+
+ var ERRNO_MESSAGES={0:"Success",1:"Not super-user",2:"No such file or directory",3:"No such process",4:"Interrupted system call",5:"I/O error",6:"No such device or address",7:"Arg list too long",8:"Exec format error",9:"Bad file number",10:"No children",11:"No more processes",12:"Not enough core",13:"Permission denied",14:"Bad address",15:"Block device required",16:"Mount device busy",17:"File exists",18:"Cross-device link",19:"No such device",20:"Not a directory",21:"Is a directory",22:"Invalid argument",23:"Too many open files in system",24:"Too many open files",25:"Not a typewriter",26:"Text file busy",27:"File too large",28:"No space left on device",29:"Illegal seek",30:"Read only file system",31:"Too many links",32:"Broken pipe",33:"Math arg out of domain of func",34:"Math result not representable",35:"File locking deadlock error",36:"File or path name too long",37:"No record locks available",38:"Function not implemented",39:"Directory not empty",40:"Too many symbolic links",42:"No message of desired type",43:"Identifier removed",44:"Channel number out of range",45:"Level 2 not synchronized",46:"Level 3 halted",47:"Level 3 reset",48:"Link number out of range",49:"Protocol driver not attached",50:"No CSI structure available",51:"Level 2 halted",52:"Invalid exchange",53:"Invalid request descriptor",54:"Exchange full",55:"No anode",56:"Invalid request code",57:"Invalid slot",59:"Bad font file fmt",60:"Device not a stream",61:"No data (for no delay io)",62:"Timer expired",63:"Out of streams resources",64:"Machine is not on the network",65:"Package not installed",66:"The object is remote",67:"The link has been severed",68:"Advertise error",69:"Srmount error",70:"Communication error on send",71:"Protocol error",72:"Multihop attempted",73:"Cross mount point (not really error)",74:"Trying to read unreadable message",75:"Value too large for defined data type",76:"Given log. name not unique",77:"f.d. invalid for this operation",78:"Remote address changed",79:"Can access a needed shared lib",80:"Accessing a corrupted shared lib",81:".lib section in a.out corrupted",82:"Attempting to link in too many libs",83:"Attempting to exec a shared library",84:"Illegal byte sequence",86:"Streams pipe error",87:"Too many users",88:"Socket operation on non-socket",89:"Destination address required",90:"Message too long",91:"Protocol wrong type for socket",92:"Protocol not available",93:"Unknown protocol",94:"Socket type not supported",95:"Not supported",96:"Protocol family not supported",97:"Address family not supported by protocol family",98:"Address already in use",99:"Address not available",100:"Network interface is not configured",101:"Network is unreachable",102:"Connection reset by network",103:"Connection aborted",104:"Connection reset by peer",105:"No buffer space available",106:"Socket is already connected",107:"Socket is not connected",108:"Can't send after socket shutdown",109:"Too many references",110:"Connection timed out",111:"Connection refused",112:"Host is down",113:"Host is unreachable",114:"Socket already connected",115:"Connection already in progress",116:"Stale file handle",122:"Quota exceeded",123:"No medium (in tape drive)",125:"Operation canceled",130:"Previous owner died",131:"State not recoverable"};
+
+
+ var ___errno_state=0;function ___setErrNo(value) {
+ // For convenient setting and returning of errno.
+ HEAP32[((___errno_state)>>2)]=value;
+ return value;
+ }
+
+ var PATH={splitPath:function (filename) {
+ var splitPathRe = /^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/;
+ return splitPathRe.exec(filename).slice(1);
+ },normalizeArray:function (parts, allowAboveRoot) {
+ // if the path tries to go above the root, `up` ends up > 0
+ var up = 0;
+ for (var i = parts.length - 1; i >= 0; i--) {
+ var last = parts[i];
+ if (last === '.') {
+ parts.splice(i, 1);
+ } else if (last === '..') {
+ parts.splice(i, 1);
+ up++;
+ } else if (up) {
+ parts.splice(i, 1);
+ up--;
+ }
+ }
+ // if the path is allowed to go above the root, restore leading ..s
+ if (allowAboveRoot) {
+ for (; up--; up) {
+ parts.unshift('..');
+ }
+ }
+ return parts;
+ },normalize:function (path) {
+ var isAbsolute = path.charAt(0) === '/',
+ trailingSlash = path.substr(-1) === '/';
+ // Normalize the path
+ path = PATH.normalizeArray(path.split('/').filter(function(p) {
+ return !!p;
+ }), !isAbsolute).join('/');
+ if (!path && !isAbsolute) {
+ path = '.';
+ }
+ if (path && trailingSlash) {
+ path += '/';
+ }
+ return (isAbsolute ? '/' : '') + path;
+ },dirname:function (path) {
+ var result = PATH.splitPath(path),
+ root = result[0],
+ dir = result[1];
+ if (!root && !dir) {
+ // No dirname whatsoever
+ return '.';
+ }
+ if (dir) {
+ // It has a dirname, strip trailing slash
+ dir = dir.substr(0, dir.length - 1);
+ }
+ return root + dir;
+ },basename:function (path) {
+ // EMSCRIPTEN return '/'' for '/', not an empty string
+ if (path === '/') return '/';
+ var lastSlash = path.lastIndexOf('/');
+ if (lastSlash === -1) return path;
+ return path.substr(lastSlash+1);
+ },extname:function (path) {
+ return PATH.splitPath(path)[3];
+ },join:function () {
+ var paths = Array.prototype.slice.call(arguments, 0);
+ return PATH.normalize(paths.join('/'));
+ },join2:function (l, r) {
+ return PATH.normalize(l + '/' + r);
+ },resolve:function () {
+ var resolvedPath = '',
+ resolvedAbsolute = false;
+ for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {
+ var path = (i >= 0) ? arguments[i] : FS.cwd();
+ // Skip empty and invalid entries
+ if (typeof path !== 'string') {
+ throw new TypeError('Arguments to path.resolve must be strings');
+ } else if (!path) {
+ continue;
+ }
+ resolvedPath = path + '/' + resolvedPath;
+ resolvedAbsolute = path.charAt(0) === '/';
+ }
+ // At this point the path should be resolved to a full absolute path, but
+ // handle relative paths to be safe (might happen when process.cwd() fails)
+ resolvedPath = PATH.normalizeArray(resolvedPath.split('/').filter(function(p) {
+ return !!p;
+ }), !resolvedAbsolute).join('/');
+ return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.';
+ },relative:function (from, to) {
+ from = PATH.resolve(from).substr(1);
+ to = PATH.resolve(to).substr(1);
+ function trim(arr) {
+ var start = 0;
+ for (; start < arr.length; start++) {
+ if (arr[start] !== '') break;
+ }
+ var end = arr.length - 1;
+ for (; end >= 0; end--) {
+ if (arr[end] !== '') break;
+ }
+ if (start > end) return [];
+ return arr.slice(start, end - start + 1);
+ }
+ var fromParts = trim(from.split('/'));
+ var toParts = trim(to.split('/'));
+ var length = Math.min(fromParts.length, toParts.length);
+ var samePartsLength = length;
+ for (var i = 0; i < length; i++) {
+ if (fromParts[i] !== toParts[i]) {
+ samePartsLength = i;
+ break;
+ }
+ }
+ var outputParts = [];
+ for (var i = samePartsLength; i < fromParts.length; i++) {
+ outputParts.push('..');
+ }
+ outputParts = outputParts.concat(toParts.slice(samePartsLength));
+ return outputParts.join('/');
+ }};
+
+ var TTY={ttys:[],init:function () {
+ // https://github.com/kripken/emscripten/pull/1555
+ // if (ENVIRONMENT_IS_NODE) {
+ // // currently, FS.init does not distinguish if process.stdin is a file or TTY
+ // // device, it always assumes it's a TTY device. because of this, we're forcing
+ // // process.stdin to UTF8 encoding to at least make stdin reading compatible
+ // // with text files until FS.init can be refactored.
+ // process['stdin']['setEncoding']('utf8');
+ // }
+ },shutdown:function () {
+ // https://github.com/kripken/emscripten/pull/1555
+ // if (ENVIRONMENT_IS_NODE) {
+ // // inolen: any idea as to why node -e 'process.stdin.read()' wouldn't exit immediately (with process.stdin being a tty)?
+ // // isaacs: because now it's reading from the stream, you've expressed interest in it, so that read() kicks off a _read() which creates a ReadReq operation
+ // // inolen: I thought read() in that case was a synchronous operation that just grabbed some amount of buffered data if it exists?
+ // // isaacs: it is. but it also triggers a _read() call, which calls readStart() on the handle
+ // // isaacs: do process.stdin.pause() and i'd think it'd probably close the pending call
+ // process['stdin']['pause']();
+ // }
+ },register:function (dev, ops) {
+ TTY.ttys[dev] = { input: [], output: [], ops: ops };
+ FS.registerDevice(dev, TTY.stream_ops);
+ },stream_ops:{open:function (stream) {
+ var tty = TTY.ttys[stream.node.rdev];
+ if (!tty) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ stream.tty = tty;
+ stream.seekable = false;
+ },close:function (stream) {
+ // flush any pending line data
+ if (stream.tty.output.length) {
+ stream.tty.ops.put_char(stream.tty, 10);
+ }
+ },read:function (stream, buffer, offset, length, pos /* ignored */) {
+ if (!stream.tty || !stream.tty.ops.get_char) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
+ }
+ var bytesRead = 0;
+ for (var i = 0; i < length; i++) {
+ var result;
+ try {
+ result = stream.tty.ops.get_char(stream.tty);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ if (result === undefined && bytesRead === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ if (result === null || result === undefined) break;
+ bytesRead++;
+ buffer[offset+i] = result;
+ }
+ if (bytesRead) {
+ stream.node.timestamp = Date.now();
+ }
+ return bytesRead;
+ },write:function (stream, buffer, offset, length, pos) {
+ if (!stream.tty || !stream.tty.ops.put_char) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
+ }
+ for (var i = 0; i < length; i++) {
+ try {
+ stream.tty.ops.put_char(stream.tty, buffer[offset+i]);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ }
+ if (length) {
+ stream.node.timestamp = Date.now();
+ }
+ return i;
+ }},default_tty_ops:{get_char:function (tty) {
+ if (!tty.input.length) {
+ var result = null;
+ if (ENVIRONMENT_IS_NODE) {
+ result = process['stdin']['read']();
+ if (!result) {
+ if (process['stdin']['_readableState'] && process['stdin']['_readableState']['ended']) {
+ return null; // EOF
+ }
+ return undefined; // no data available
+ }
+ } else if (typeof window != 'undefined' &&
+ typeof window.prompt == 'function') {
+ // Browser.
+ result = window.prompt('Input: '); // returns null on cancel
+ if (result !== null) {
+ result += '\n';
+ }
+ } else if (typeof readline == 'function') {
+ // Command line.
+ result = readline();
+ if (result !== null) {
+ result += '\n';
+ }
+ }
+ if (!result) {
+ return null;
+ }
+ tty.input = intArrayFromString(result, true);
+ }
+ return tty.input.shift();
+ },put_char:function (tty, val) {
+ if (val === null || val === 10) {
+ Module['print'](tty.output.join(''));
+ tty.output = [];
+ } else {
+ tty.output.push(TTY.utf8.processCChar(val));
+ }
+ }},default_tty1_ops:{put_char:function (tty, val) {
+ if (val === null || val === 10) {
+ Module['printErr'](tty.output.join(''));
+ tty.output = [];
+ } else {
+ tty.output.push(TTY.utf8.processCChar(val));
+ }
+ }}};
+
+ var MEMFS={ops_table:null,CONTENT_OWNING:1,CONTENT_FLEXIBLE:2,CONTENT_FIXED:3,mount:function (mount) {
+ return MEMFS.createNode(null, '/', 16384 | 511 /* 0777 */, 0);
+ },createNode:function (parent, name, mode, dev) {
+ if (FS.isBlkdev(mode) || FS.isFIFO(mode)) {
+ // no supported
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (!MEMFS.ops_table) {
+ MEMFS.ops_table = {
+ dir: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr,
+ lookup: MEMFS.node_ops.lookup,
+ mknod: MEMFS.node_ops.mknod,
+ rename: MEMFS.node_ops.rename,
+ unlink: MEMFS.node_ops.unlink,
+ rmdir: MEMFS.node_ops.rmdir,
+ readdir: MEMFS.node_ops.readdir,
+ symlink: MEMFS.node_ops.symlink
+ },
+ stream: {
+ llseek: MEMFS.stream_ops.llseek
+ }
+ },
+ file: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr
+ },
+ stream: {
+ llseek: MEMFS.stream_ops.llseek,
+ read: MEMFS.stream_ops.read,
+ write: MEMFS.stream_ops.write,
+ allocate: MEMFS.stream_ops.allocate,
+ mmap: MEMFS.stream_ops.mmap
+ }
+ },
+ link: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr,
+ readlink: MEMFS.node_ops.readlink
+ },
+ stream: {}
+ },
+ chrdev: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr
+ },
+ stream: FS.chrdev_stream_ops
+ },
+ };
+ }
+ var node = FS.createNode(parent, name, mode, dev);
+ if (FS.isDir(node.mode)) {
+ node.node_ops = MEMFS.ops_table.dir.node;
+ node.stream_ops = MEMFS.ops_table.dir.stream;
+ node.contents = {};
+ } else if (FS.isFile(node.mode)) {
+ node.node_ops = MEMFS.ops_table.file.node;
+ node.stream_ops = MEMFS.ops_table.file.stream;
+ node.contents = [];
+ node.contentMode = MEMFS.CONTENT_FLEXIBLE;
+ } else if (FS.isLink(node.mode)) {
+ node.node_ops = MEMFS.ops_table.link.node;
+ node.stream_ops = MEMFS.ops_table.link.stream;
+ } else if (FS.isChrdev(node.mode)) {
+ node.node_ops = MEMFS.ops_table.chrdev.node;
+ node.stream_ops = MEMFS.ops_table.chrdev.stream;
+ }
+ node.timestamp = Date.now();
+ // add the new node to the parent
+ if (parent) {
+ parent.contents[name] = node;
+ }
+ return node;
+ },ensureFlexible:function (node) {
+ if (node.contentMode !== MEMFS.CONTENT_FLEXIBLE) {
+ var contents = node.contents;
+ node.contents = Array.prototype.slice.call(contents);
+ node.contentMode = MEMFS.CONTENT_FLEXIBLE;
+ }
+ },node_ops:{getattr:function (node) {
+ var attr = {};
+ // device numbers reuse inode numbers.
+ attr.dev = FS.isChrdev(node.mode) ? node.id : 1;
+ attr.ino = node.id;
+ attr.mode = node.mode;
+ attr.nlink = 1;
+ attr.uid = 0;
+ attr.gid = 0;
+ attr.rdev = node.rdev;
+ if (FS.isDir(node.mode)) {
+ attr.size = 4096;
+ } else if (FS.isFile(node.mode)) {
+ attr.size = node.contents.length;
+ } else if (FS.isLink(node.mode)) {
+ attr.size = node.link.length;
+ } else {
+ attr.size = 0;
+ }
+ attr.atime = new Date(node.timestamp);
+ attr.mtime = new Date(node.timestamp);
+ attr.ctime = new Date(node.timestamp);
+ // NOTE: In our implementation, st_blocks = Math.ceil(st_size/st_blksize),
+ // but this is not required by the standard.
+ attr.blksize = 4096;
+ attr.blocks = Math.ceil(attr.size / attr.blksize);
+ return attr;
+ },setattr:function (node, attr) {
+ if (attr.mode !== undefined) {
+ node.mode = attr.mode;
+ }
+ if (attr.timestamp !== undefined) {
+ node.timestamp = attr.timestamp;
+ }
+ if (attr.size !== undefined) {
+ MEMFS.ensureFlexible(node);
+ var contents = node.contents;
+ if (attr.size < contents.length) contents.length = attr.size;
+ else while (attr.size > contents.length) contents.push(0);
+ }
+ },lookup:function (parent, name) {
+ throw FS.genericErrors[ERRNO_CODES.ENOENT];
+ },mknod:function (parent, name, mode, dev) {
+ return MEMFS.createNode(parent, name, mode, dev);
+ },rename:function (old_node, new_dir, new_name) {
+ // if we're overwriting a directory at new_name, make sure it's empty.
+ if (FS.isDir(old_node.mode)) {
+ var new_node;
+ try {
+ new_node = FS.lookupNode(new_dir, new_name);
+ } catch (e) {
+ }
+ if (new_node) {
+ for (var i in new_node.contents) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ }
+ }
+ // do the internal rewiring
+ delete old_node.parent.contents[old_node.name];
+ old_node.name = new_name;
+ new_dir.contents[new_name] = old_node;
+ old_node.parent = new_dir;
+ },unlink:function (parent, name) {
+ delete parent.contents[name];
+ },rmdir:function (parent, name) {
+ var node = FS.lookupNode(parent, name);
+ for (var i in node.contents) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ delete parent.contents[name];
+ },readdir:function (node) {
+ var entries = ['.', '..']
+ for (var key in node.contents) {
+ if (!node.contents.hasOwnProperty(key)) {
+ continue;
+ }
+ entries.push(key);
+ }
+ return entries;
+ },symlink:function (parent, newname, oldpath) {
+ var node = MEMFS.createNode(parent, newname, 511 /* 0777 */ | 40960, 0);
+ node.link = oldpath;
+ return node;
+ },readlink:function (node) {
+ if (!FS.isLink(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ return node.link;
+ }},stream_ops:{read:function (stream, buffer, offset, length, position) {
+ var contents = stream.node.contents;
+ if (position >= contents.length)
+ return 0;
+ var size = Math.min(contents.length - position, length);
+ assert(size >= 0);
+ if (size > 8 && contents.subarray) { // non-trivial, and typed array
+ buffer.set(contents.subarray(position, position + size), offset);
+ } else
+ {
+ for (var i = 0; i < size; i++) {
+ buffer[offset + i] = contents[position + i];
+ }
+ }
+ return size;
+ },write:function (stream, buffer, offset, length, position, canOwn) {
+ var node = stream.node;
+ node.timestamp = Date.now();
+ var contents = node.contents;
+ if (length && contents.length === 0 && position === 0 && buffer.subarray) {
+ // just replace it with the new data
+ if (canOwn && offset === 0) {
+ node.contents = buffer; // this could be a subarray of Emscripten HEAP, or allocated from some other source.
+ node.contentMode = (buffer.buffer === HEAP8.buffer) ? MEMFS.CONTENT_OWNING : MEMFS.CONTENT_FIXED;
+ } else {
+ node.contents = new Uint8Array(buffer.subarray(offset, offset+length));
+ node.contentMode = MEMFS.CONTENT_FIXED;
+ }
+ return length;
+ }
+ MEMFS.ensureFlexible(node);
+ var contents = node.contents;
+ while (contents.length < position) contents.push(0);
+ for (var i = 0; i < length; i++) {
+ contents[position + i] = buffer[offset + i];
+ }
+ return length;
+ },llseek:function (stream, offset, whence) {
+ var position = offset;
+ if (whence === 1) { // SEEK_CUR.
+ position += stream.position;
+ } else if (whence === 2) { // SEEK_END.
+ if (FS.isFile(stream.node.mode)) {
+ position += stream.node.contents.length;
+ }
+ }
+ if (position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ stream.ungotten = [];
+ stream.position = position;
+ return position;
+ },allocate:function (stream, offset, length) {
+ MEMFS.ensureFlexible(stream.node);
+ var contents = stream.node.contents;
+ var limit = offset + length;
+ while (limit > contents.length) contents.push(0);
+ },mmap:function (stream, buffer, offset, length, position, prot, flags) {
+ if (!FS.isFile(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ var ptr;
+ var allocated;
+ var contents = stream.node.contents;
+ // Only make a new copy when MAP_PRIVATE is specified.
+ if ( !(flags & 2) &&
+ (contents.buffer === buffer || contents.buffer === buffer.buffer) ) {
+ // We can't emulate MAP_SHARED when the file is not backed by the buffer
+ // we're mapping to (e.g. the HEAP buffer).
+ allocated = false;
+ ptr = contents.byteOffset;
+ } else {
+ // Try to avoid unnecessary slices.
+ if (position > 0 || position + length < contents.length) {
+ if (contents.subarray) {
+ contents = contents.subarray(position, position + length);
+ } else {
+ contents = Array.prototype.slice.call(contents, position, position + length);
+ }
+ }
+ allocated = true;
+ ptr = _malloc(length);
+ if (!ptr) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOMEM);
+ }
+ buffer.set(contents, ptr);
+ }
+ return { ptr: ptr, allocated: allocated };
+ }}};
+
+ var IDBFS={dbs:{},indexedDB:function () {
+ return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
+ },DB_VERSION:21,DB_STORE_NAME:"FILE_DATA",mount:function (mount) {
+ // reuse all of the core MEMFS functionality
+ return MEMFS.mount.apply(null, arguments);
+ },syncfs:function (mount, populate, callback) {
+ IDBFS.getLocalSet(mount, function(err, local) {
+ if (err) return callback(err);
+
+ IDBFS.getRemoteSet(mount, function(err, remote) {
+ if (err) return callback(err);
+
+ var src = populate ? remote : local;
+ var dst = populate ? local : remote;
+
+ IDBFS.reconcile(src, dst, callback);
+ });
+ });
+ },getDB:function (name, callback) {
+ // check the cache first
+ var db = IDBFS.dbs[name];
+ if (db) {
+ return callback(null, db);
+ }
+
+ var req;
+ try {
+ req = IDBFS.indexedDB().open(name, IDBFS.DB_VERSION);
+ } catch (e) {
+ return callback(e);
+ }
+ req.onupgradeneeded = function(e) {
+ var db = e.target.result;
+ var transaction = e.target.transaction;
+
+ var fileStore;
+
+ if (db.objectStoreNames.contains(IDBFS.DB_STORE_NAME)) {
+ fileStore = transaction.objectStore(IDBFS.DB_STORE_NAME);
+ } else {
+ fileStore = db.createObjectStore(IDBFS.DB_STORE_NAME);
+ }
+
+ fileStore.createIndex('timestamp', 'timestamp', { unique: false });
+ };
+ req.onsuccess = function() {
+ db = req.result;
+
+ // add to the cache
+ IDBFS.dbs[name] = db;
+ callback(null, db);
+ };
+ req.onerror = function() {
+ callback(this.error);
+ };
+ },getLocalSet:function (mount, callback) {
+ var entries = {};
+
+ function isRealDir(p) {
+ return p !== '.' && p !== '..';
+ };
+ function toAbsolute(root) {
+ return function(p) {
+ return PATH.join2(root, p);
+ }
+ };
+
+ var check = FS.readdir(mount.mountpoint).filter(isRealDir).map(toAbsolute(mount.mountpoint));
+
+ while (check.length) {
+ var path = check.pop();
+ var stat;
+
+ try {
+ stat = FS.stat(path);
+ } catch (e) {
+ return callback(e);
+ }
+
+ if (FS.isDir(stat.mode)) {
+ check.push.apply(check, FS.readdir(path).filter(isRealDir).map(toAbsolute(path)));
+ }
+
+ entries[path] = { timestamp: stat.mtime };
+ }
+
+ return callback(null, { type: 'local', entries: entries });
+ },getRemoteSet:function (mount, callback) {
+ var entries = {};
+
+ IDBFS.getDB(mount.mountpoint, function(err, db) {
+ if (err) return callback(err);
+
+ var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readonly');
+ transaction.onerror = function() { callback(this.error); };
+
+ var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
+ var index = store.index('timestamp');
+
+ index.openKeyCursor().onsuccess = function(event) {
+ var cursor = event.target.result;
+
+ if (!cursor) {
+ return callback(null, { type: 'remote', db: db, entries: entries });
+ }
+
+ entries[cursor.primaryKey] = { timestamp: cursor.key };
+
+ cursor.continue();
+ };
+ });
+ },loadLocalEntry:function (path, callback) {
+ var stat, node;
+
+ try {
+ var lookup = FS.lookupPath(path);
+ node = lookup.node;
+ stat = FS.stat(path);
+ } catch (e) {
+ return callback(e);
+ }
+
+ if (FS.isDir(stat.mode)) {
+ return callback(null, { timestamp: stat.mtime, mode: stat.mode });
+ } else if (FS.isFile(stat.mode)) {
+ return callback(null, { timestamp: stat.mtime, mode: stat.mode, contents: node.contents });
+ } else {
+ return callback(new Error('node type not supported'));
+ }
+ },storeLocalEntry:function (path, entry, callback) {
+ try {
+ if (FS.isDir(entry.mode)) {
+ FS.mkdir(path, entry.mode);
+ } else if (FS.isFile(entry.mode)) {
+ FS.writeFile(path, entry.contents, { encoding: 'binary', canOwn: true });
+ } else {
+ return callback(new Error('node type not supported'));
+ }
+
+ FS.utime(path, entry.timestamp, entry.timestamp);
+ } catch (e) {
+ return callback(e);
+ }
+
+ callback(null);
+ },removeLocalEntry:function (path, callback) {
+ try {
+ var lookup = FS.lookupPath(path);
+ var stat = FS.stat(path);
+
+ if (FS.isDir(stat.mode)) {
+ FS.rmdir(path);
+ } else if (FS.isFile(stat.mode)) {
+ FS.unlink(path);
+ }
+ } catch (e) {
+ return callback(e);
+ }
+
+ callback(null);
+ },loadRemoteEntry:function (store, path, callback) {
+ var req = store.get(path);
+ req.onsuccess = function(event) { callback(null, event.target.result); };
+ req.onerror = function() { callback(this.error); };
+ },storeRemoteEntry:function (store, path, entry, callback) {
+ var req = store.put(entry, path);
+ req.onsuccess = function() { callback(null); };
+ req.onerror = function() { callback(this.error); };
+ },removeRemoteEntry:function (store, path, callback) {
+ var req = store.delete(path);
+ req.onsuccess = function() { callback(null); };
+ req.onerror = function() { callback(this.error); };
+ },reconcile:function (src, dst, callback) {
+ var total = 0;
+
+ var create = [];
+ Object.keys(src.entries).forEach(function (key) {
+ var e = src.entries[key];
+ var e2 = dst.entries[key];
+ if (!e2 || e.timestamp > e2.timestamp) {
+ create.push(key);
+ total++;
+ }
+ });
+
+ var remove = [];
+ Object.keys(dst.entries).forEach(function (key) {
+ var e = dst.entries[key];
+ var e2 = src.entries[key];
+ if (!e2) {
+ remove.push(key);
+ total++;
+ }
+ });
+
+ if (!total) {
+ return callback(null);
+ }
+
+ var errored = false;
+ var completed = 0;
+ var db = src.type === 'remote' ? src.db : dst.db;
+ var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readwrite');
+ var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
+
+ function done(err) {
+ if (err) {
+ if (!done.errored) {
+ done.errored = true;
+ return callback(err);
+ }
+ return;
+ }
+ if (++completed >= total) {
+ return callback(null);
+ }
+ };
+
+ transaction.onerror = function() { done(this.error); };
+
+ // sort paths in ascending order so directory entries are created
+ // before the files inside them
+ create.sort().forEach(function (path) {
+ if (dst.type === 'local') {
+ IDBFS.loadRemoteEntry(store, path, function (err, entry) {
+ if (err) return done(err);
+ IDBFS.storeLocalEntry(path, entry, done);
+ });
+ } else {
+ IDBFS.loadLocalEntry(path, function (err, entry) {
+ if (err) return done(err);
+ IDBFS.storeRemoteEntry(store, path, entry, done);
+ });
+ }
+ });
+
+ // sort paths in descending order so files are deleted before their
+ // parent directories
+ remove.sort().reverse().forEach(function(path) {
+ if (dst.type === 'local') {
+ IDBFS.removeLocalEntry(path, done);
+ } else {
+ IDBFS.removeRemoteEntry(store, path, done);
+ }
+ });
+ }};
+
+ var NODEFS={isWindows:false,staticInit:function () {
+ NODEFS.isWindows = !!process.platform.match(/^win/);
+ },mount:function (mount) {
+ assert(ENVIRONMENT_IS_NODE);
+ return NODEFS.createNode(null, '/', NODEFS.getMode(mount.opts.root), 0);
+ },createNode:function (parent, name, mode, dev) {
+ if (!FS.isDir(mode) && !FS.isFile(mode) && !FS.isLink(mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var node = FS.createNode(parent, name, mode);
+ node.node_ops = NODEFS.node_ops;
+ node.stream_ops = NODEFS.stream_ops;
+ return node;
+ },getMode:function (path) {
+ var stat;
+ try {
+ stat = fs.lstatSync(path);
+ if (NODEFS.isWindows) {
+ // On Windows, directories return permission bits 'rw-rw-rw-', even though they have 'rwxrwxrwx', so
+ // propagate write bits to execute bits.
+ stat.mode = stat.mode | ((stat.mode & 146) >> 1);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return stat.mode;
+ },realPath:function (node) {
+ var parts = [];
+ while (node.parent !== node) {
+ parts.push(node.name);
+ node = node.parent;
+ }
+ parts.push(node.mount.opts.root);
+ parts.reverse();
+ return PATH.join.apply(null, parts);
+ },flagsToPermissionStringMap:{0:"r",1:"r+",2:"r+",64:"r",65:"r+",66:"r+",129:"rx+",193:"rx+",514:"w+",577:"w",578:"w+",705:"wx",706:"wx+",1024:"a",1025:"a",1026:"a+",1089:"a",1090:"a+",1153:"ax",1154:"ax+",1217:"ax",1218:"ax+",4096:"rs",4098:"rs+"},flagsToPermissionString:function (flags) {
+ if (flags in NODEFS.flagsToPermissionStringMap) {
+ return NODEFS.flagsToPermissionStringMap[flags];
+ } else {
+ return flags;
+ }
+ },node_ops:{getattr:function (node) {
+ var path = NODEFS.realPath(node);
+ var stat;
+ try {
+ stat = fs.lstatSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ // node.js v0.10.20 doesn't report blksize and blocks on Windows. Fake them with default blksize of 4096.
+ // See http://support.microsoft.com/kb/140365
+ if (NODEFS.isWindows && !stat.blksize) {
+ stat.blksize = 4096;
+ }
+ if (NODEFS.isWindows && !stat.blocks) {
+ stat.blocks = (stat.size+stat.blksize-1)/stat.blksize|0;
+ }
+ return {
+ dev: stat.dev,
+ ino: stat.ino,
+ mode: stat.mode,
+ nlink: stat.nlink,
+ uid: stat.uid,
+ gid: stat.gid,
+ rdev: stat.rdev,
+ size: stat.size,
+ atime: stat.atime,
+ mtime: stat.mtime,
+ ctime: stat.ctime,
+ blksize: stat.blksize,
+ blocks: stat.blocks
+ };
+ },setattr:function (node, attr) {
+ var path = NODEFS.realPath(node);
+ try {
+ if (attr.mode !== undefined) {
+ fs.chmodSync(path, attr.mode);
+ // update the common node structure mode as well
+ node.mode = attr.mode;
+ }
+ if (attr.timestamp !== undefined) {
+ var date = new Date(attr.timestamp);
+ fs.utimesSync(path, date, date);
+ }
+ if (attr.size !== undefined) {
+ fs.truncateSync(path, attr.size);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },lookup:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ var mode = NODEFS.getMode(path);
+ return NODEFS.createNode(parent, name, mode);
+ },mknod:function (parent, name, mode, dev) {
+ var node = NODEFS.createNode(parent, name, mode, dev);
+ // create the backing node for this in the fs root as well
+ var path = NODEFS.realPath(node);
+ try {
+ if (FS.isDir(node.mode)) {
+ fs.mkdirSync(path, node.mode);
+ } else {
+ fs.writeFileSync(path, '', { mode: node.mode });
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return node;
+ },rename:function (oldNode, newDir, newName) {
+ var oldPath = NODEFS.realPath(oldNode);
+ var newPath = PATH.join2(NODEFS.realPath(newDir), newName);
+ try {
+ fs.renameSync(oldPath, newPath);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },unlink:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ try {
+ fs.unlinkSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },rmdir:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ try {
+ fs.rmdirSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },readdir:function (node) {
+ var path = NODEFS.realPath(node);
+ try {
+ return fs.readdirSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },symlink:function (parent, newName, oldPath) {
+ var newPath = PATH.join2(NODEFS.realPath(parent), newName);
+ try {
+ fs.symlinkSync(oldPath, newPath);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },readlink:function (node) {
+ var path = NODEFS.realPath(node);
+ try {
+ return fs.readlinkSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ }},stream_ops:{open:function (stream) {
+ var path = NODEFS.realPath(stream.node);
+ try {
+ if (FS.isFile(stream.node.mode)) {
+ stream.nfd = fs.openSync(path, NODEFS.flagsToPermissionString(stream.flags));
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },close:function (stream) {
+ try {
+ if (FS.isFile(stream.node.mode) && stream.nfd) {
+ fs.closeSync(stream.nfd);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },read:function (stream, buffer, offset, length, position) {
+ // FIXME this is terrible.
+ var nbuffer = new Buffer(length);
+ var res;
+ try {
+ res = fs.readSync(stream.nfd, nbuffer, 0, length, position);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ if (res > 0) {
+ for (var i = 0; i < res; i++) {
+ buffer[offset + i] = nbuffer[i];
+ }
+ }
+ return res;
+ },write:function (stream, buffer, offset, length, position) {
+ // FIXME this is terrible.
+ var nbuffer = new Buffer(buffer.subarray(offset, offset + length));
+ var res;
+ try {
+ res = fs.writeSync(stream.nfd, nbuffer, 0, length, position);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return res;
+ },llseek:function (stream, offset, whence) {
+ var position = offset;
+ if (whence === 1) { // SEEK_CUR.
+ position += stream.position;
+ } else if (whence === 2) { // SEEK_END.
+ if (FS.isFile(stream.node.mode)) {
+ try {
+ var stat = fs.fstatSync(stream.nfd);
+ position += stat.size;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ }
+ }
+
+ if (position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+
+ stream.position = position;
+ return position;
+ }}};
+
+ var _stdin=allocate(1, "i32*", ALLOC_STATIC);
+
+ var _stdout=allocate(1, "i32*", ALLOC_STATIC);
+
+ var _stderr=allocate(1, "i32*", ALLOC_STATIC);
+
+ function _fflush(stream) {
+ // int fflush(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fflush.html
+ // we don't currently perform any user-space buffering of data
+ }var FS={root:null,mounts:[],devices:[null],streams:[],nextInode:1,nameTable:null,currentPath:"/",initialized:false,ignorePermissions:true,ErrnoError:null,genericErrors:{},handleFSError:function (e) {
+ if (!(e instanceof FS.ErrnoError)) throw e + ' : ' + stackTrace();
+ return ___setErrNo(e.errno);
+ },lookupPath:function (path, opts) {
+ path = PATH.resolve(FS.cwd(), path);
+ opts = opts || {};
+
+ var defaults = {
+ follow_mount: true,
+ recurse_count: 0
+ };
+ for (var key in defaults) {
+ if (opts[key] === undefined) {
+ opts[key] = defaults[key];
+ }
+ }
+
+ if (opts.recurse_count > 8) { // max recursive lookup of 8
+ throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
+ }
+
+ // split the path
+ var parts = PATH.normalizeArray(path.split('/').filter(function(p) {
+ return !!p;
+ }), false);
+
+ // start at the root
+ var current = FS.root;
+ var current_path = '/';
+
+ for (var i = 0; i < parts.length; i++) {
+ var islast = (i === parts.length-1);
+ if (islast && opts.parent) {
+ // stop resolving
+ break;
+ }
+
+ current = FS.lookupNode(current, parts[i]);
+ current_path = PATH.join2(current_path, parts[i]);
+
+ // jump to the mount's root node if this is a mountpoint
+ if (FS.isMountpoint(current)) {
+ if (!islast || (islast && opts.follow_mount)) {
+ current = current.mounted.root;
+ }
+ }
+
+ // by default, lookupPath will not follow a symlink if it is the final path component.
+ // setting opts.follow = true will override this behavior.
+ if (!islast || opts.follow) {
+ var count = 0;
+ while (FS.isLink(current.mode)) {
+ var link = FS.readlink(current_path);
+ current_path = PATH.resolve(PATH.dirname(current_path), link);
+
+ var lookup = FS.lookupPath(current_path, { recurse_count: opts.recurse_count });
+ current = lookup.node;
+
+ if (count++ > 40) { // limit max consecutive symlinks to 40 (SYMLOOP_MAX).
+ throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
+ }
+ }
+ }
+ }
+
+ return { path: current_path, node: current };
+ },getPath:function (node) {
+ var path;
+ while (true) {
+ if (FS.isRoot(node)) {
+ var mount = node.mount.mountpoint;
+ if (!path) return mount;
+ return mount[mount.length-1] !== '/' ? mount + '/' + path : mount + path;
+ }
+ path = path ? node.name + '/' + path : node.name;
+ node = node.parent;
+ }
+ },hashName:function (parentid, name) {
+ var hash = 0;
+
+
+ for (var i = 0; i < name.length; i++) {
+ hash = ((hash << 5) - hash + name.charCodeAt(i)) | 0;
+ }
+ return ((parentid + hash) >>> 0) % FS.nameTable.length;
+ },hashAddNode:function (node) {
+ var hash = FS.hashName(node.parent.id, node.name);
+ node.name_next = FS.nameTable[hash];
+ FS.nameTable[hash] = node;
+ },hashRemoveNode:function (node) {
+ var hash = FS.hashName(node.parent.id, node.name);
+ if (FS.nameTable[hash] === node) {
+ FS.nameTable[hash] = node.name_next;
+ } else {
+ var current = FS.nameTable[hash];
+ while (current) {
+ if (current.name_next === node) {
+ current.name_next = node.name_next;
+ break;
+ }
+ current = current.name_next;
+ }
+ }
+ },lookupNode:function (parent, name) {
+ var err = FS.mayLookup(parent);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ var hash = FS.hashName(parent.id, name);
+ for (var node = FS.nameTable[hash]; node; node = node.name_next) {
+ var nodeName = node.name;
+ if (node.parent.id === parent.id && nodeName === name) {
+ return node;
+ }
+ }
+ // if we failed to find it in the cache, call into the VFS
+ return FS.lookup(parent, name);
+ },createNode:function (parent, name, mode, rdev) {
+ if (!FS.FSNode) {
+ FS.FSNode = function(parent, name, mode, rdev) {
+ if (!parent) {
+ parent = this; // root node sets parent to itself
+ }
+ this.parent = parent;
+ this.mount = parent.mount;
+ this.mounted = null;
+ this.id = FS.nextInode++;
+ this.name = name;
+ this.mode = mode;
+ this.node_ops = {};
+ this.stream_ops = {};
+ this.rdev = rdev;
+ };
+
+ FS.FSNode.prototype = {};
+
+ // compatibility
+ var readMode = 292 | 73;
+ var writeMode = 146;
+
+ // NOTE we must use Object.defineProperties instead of individual calls to
+ // Object.defineProperty in order to make closure compiler happy
+ Object.defineProperties(FS.FSNode.prototype, {
+ read: {
+ get: function() { return (this.mode & readMode) === readMode; },
+ set: function(val) { val ? this.mode |= readMode : this.mode &= ~readMode; }
+ },
+ write: {
+ get: function() { return (this.mode & writeMode) === writeMode; },
+ set: function(val) { val ? this.mode |= writeMode : this.mode &= ~writeMode; }
+ },
+ isFolder: {
+ get: function() { return FS.isDir(this.mode); },
+ },
+ isDevice: {
+ get: function() { return FS.isChrdev(this.mode); },
+ },
+ });
+ }
+
+ var node = new FS.FSNode(parent, name, mode, rdev);
+
+ FS.hashAddNode(node);
+
+ return node;
+ },destroyNode:function (node) {
+ FS.hashRemoveNode(node);
+ },isRoot:function (node) {
+ return node === node.parent;
+ },isMountpoint:function (node) {
+ return !!node.mounted;
+ },isFile:function (mode) {
+ return (mode & 61440) === 32768;
+ },isDir:function (mode) {
+ return (mode & 61440) === 16384;
+ },isLink:function (mode) {
+ return (mode & 61440) === 40960;
+ },isChrdev:function (mode) {
+ return (mode & 61440) === 8192;
+ },isBlkdev:function (mode) {
+ return (mode & 61440) === 24576;
+ },isFIFO:function (mode) {
+ return (mode & 61440) === 4096;
+ },isSocket:function (mode) {
+ return (mode & 49152) === 49152;
+ },flagModes:{"r":0,"rs":1052672,"r+":2,"w":577,"wx":705,"xw":705,"w+":578,"wx+":706,"xw+":706,"a":1089,"ax":1217,"xa":1217,"a+":1090,"ax+":1218,"xa+":1218},modeStringToFlags:function (str) {
+ var flags = FS.flagModes[str];
+ if (typeof flags === 'undefined') {
+ throw new Error('Unknown file open mode: ' + str);
+ }
+ return flags;
+ },flagsToPermissionString:function (flag) {
+ var accmode = flag & 2097155;
+ var perms = ['r', 'w', 'rw'][accmode];
+ if ((flag & 512)) {
+ perms += 'w';
+ }
+ return perms;
+ },nodePermissions:function (node, perms) {
+ if (FS.ignorePermissions) {
+ return 0;
+ }
+ // return 0 if any user, group or owner bits are set.
+ if (perms.indexOf('r') !== -1 && !(node.mode & 292)) {
+ return ERRNO_CODES.EACCES;
+ } else if (perms.indexOf('w') !== -1 && !(node.mode & 146)) {
+ return ERRNO_CODES.EACCES;
+ } else if (perms.indexOf('x') !== -1 && !(node.mode & 73)) {
+ return ERRNO_CODES.EACCES;
+ }
+ return 0;
+ },mayLookup:function (dir) {
+ return FS.nodePermissions(dir, 'x');
+ },mayCreate:function (dir, name) {
+ try {
+ var node = FS.lookupNode(dir, name);
+ return ERRNO_CODES.EEXIST;
+ } catch (e) {
+ }
+ return FS.nodePermissions(dir, 'wx');
+ },mayDelete:function (dir, name, isdir) {
+ var node;
+ try {
+ node = FS.lookupNode(dir, name);
+ } catch (e) {
+ return e.errno;
+ }
+ var err = FS.nodePermissions(dir, 'wx');
+ if (err) {
+ return err;
+ }
+ if (isdir) {
+ if (!FS.isDir(node.mode)) {
+ return ERRNO_CODES.ENOTDIR;
+ }
+ if (FS.isRoot(node) || FS.getPath(node) === FS.cwd()) {
+ return ERRNO_CODES.EBUSY;
+ }
+ } else {
+ if (FS.isDir(node.mode)) {
+ return ERRNO_CODES.EISDIR;
+ }
+ }
+ return 0;
+ },mayOpen:function (node, flags) {
+ if (!node) {
+ return ERRNO_CODES.ENOENT;
+ }
+ if (FS.isLink(node.mode)) {
+ return ERRNO_CODES.ELOOP;
+ } else if (FS.isDir(node.mode)) {
+ if ((flags & 2097155) !== 0 || // opening for write
+ (flags & 512)) {
+ return ERRNO_CODES.EISDIR;
+ }
+ }
+ return FS.nodePermissions(node, FS.flagsToPermissionString(flags));
+ },MAX_OPEN_FDS:4096,nextfd:function (fd_start, fd_end) {
+ fd_start = fd_start || 0;
+ fd_end = fd_end || FS.MAX_OPEN_FDS;
+ for (var fd = fd_start; fd <= fd_end; fd++) {
+ if (!FS.streams[fd]) {
+ return fd;
+ }
+ }
+ throw new FS.ErrnoError(ERRNO_CODES.EMFILE);
+ },getStream:function (fd) {
+ return FS.streams[fd];
+ },createStream:function (stream, fd_start, fd_end) {
+ if (!FS.FSStream) {
+ FS.FSStream = function(){};
+ FS.FSStream.prototype = {};
+ // compatibility
+ Object.defineProperties(FS.FSStream.prototype, {
+ object: {
+ get: function() { return this.node; },
+ set: function(val) { this.node = val; }
+ },
+ isRead: {
+ get: function() { return (this.flags & 2097155) !== 1; }
+ },
+ isWrite: {
+ get: function() { return (this.flags & 2097155) !== 0; }
+ },
+ isAppend: {
+ get: function() { return (this.flags & 1024); }
+ }
+ });
+ }
+ if (0) {
+ // reuse the object
+ stream.__proto__ = FS.FSStream.prototype;
+ } else {
+ var newStream = new FS.FSStream();
+ for (var p in stream) {
+ newStream[p] = stream[p];
+ }
+ stream = newStream;
+ }
+ var fd = FS.nextfd(fd_start, fd_end);
+ stream.fd = fd;
+ FS.streams[fd] = stream;
+ return stream;
+ },closeStream:function (fd) {
+ FS.streams[fd] = null;
+ },getStreamFromPtr:function (ptr) {
+ return FS.streams[ptr - 1];
+ },getPtrForStream:function (stream) {
+ return stream ? stream.fd + 1 : 0;
+ },chrdev_stream_ops:{open:function (stream) {
+ var device = FS.getDevice(stream.node.rdev);
+ // override node's stream ops with the device's
+ stream.stream_ops = device.stream_ops;
+ // forward the open call
+ if (stream.stream_ops.open) {
+ stream.stream_ops.open(stream);
+ }
+ },llseek:function () {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }},major:function (dev) {
+ return ((dev) >> 8);
+ },minor:function (dev) {
+ return ((dev) & 0xff);
+ },makedev:function (ma, mi) {
+ return ((ma) << 8 | (mi));
+ },registerDevice:function (dev, ops) {
+ FS.devices[dev] = { stream_ops: ops };
+ },getDevice:function (dev) {
+ return FS.devices[dev];
+ },getMounts:function (mount) {
+ var mounts = [];
+ var check = [mount];
+
+ while (check.length) {
+ var m = check.pop();
+
+ mounts.push(m);
+
+ check.push.apply(check, m.mounts);
+ }
+
+ return mounts;
+ },syncfs:function (populate, callback) {
+ if (typeof(populate) === 'function') {
+ callback = populate;
+ populate = false;
+ }
+
+ var mounts = FS.getMounts(FS.root.mount);
+ var completed = 0;
+
+ function done(err) {
+ if (err) {
+ if (!done.errored) {
+ done.errored = true;
+ return callback(err);
+ }
+ return;
+ }
+ if (++completed >= mounts.length) {
+ callback(null);
+ }
+ };
+
+ // sync all mounts
+ mounts.forEach(function (mount) {
+ if (!mount.type.syncfs) {
+ return done(null);
+ }
+ mount.type.syncfs(mount, populate, done);
+ });
+ },mount:function (type, opts, mountpoint) {
+ var root = mountpoint === '/';
+ var pseudo = !mountpoint;
+ var node;
+
+ if (root && FS.root) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ } else if (!root && !pseudo) {
+ var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
+
+ mountpoint = lookup.path; // use the absolute path
+ node = lookup.node;
+
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+
+ if (!FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ }
+
+ var mount = {
+ type: type,
+ opts: opts,
+ mountpoint: mountpoint,
+ mounts: []
+ };
+
+ // create a root node for the fs
+ var mountRoot = type.mount(mount);
+ mountRoot.mount = mount;
+ mount.root = mountRoot;
+
+ if (root) {
+ FS.root = mountRoot;
+ } else if (node) {
+ // set as a mountpoint
+ node.mounted = mount;
+
+ // add the new mount to the current mount's children
+ if (node.mount) {
+ node.mount.mounts.push(mount);
+ }
+ }
+
+ return mountRoot;
+ },unmount:function (mountpoint) {
+ var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
+
+ if (!FS.isMountpoint(lookup.node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+
+ // destroy the nodes for this mount, and all its child mounts
+ var node = lookup.node;
+ var mount = node.mounted;
+ var mounts = FS.getMounts(mount);
+
+ Object.keys(FS.nameTable).forEach(function (hash) {
+ var current = FS.nameTable[hash];
+
+ while (current) {
+ var next = current.name_next;
+
+ if (mounts.indexOf(current.mount) !== -1) {
+ FS.destroyNode(current);
+ }
+
+ current = next;
+ }
+ });
+
+ // no longer a mountpoint
+ node.mounted = null;
+
+ // remove this mount from the child mounts
+ var idx = node.mount.mounts.indexOf(mount);
+ assert(idx !== -1);
+ node.mount.mounts.splice(idx, 1);
+ },lookup:function (parent, name) {
+ return parent.node_ops.lookup(parent, name);
+ },mknod:function (path, mode, dev) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var err = FS.mayCreate(parent, name);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.mknod) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return parent.node_ops.mknod(parent, name, mode, dev);
+ },create:function (path, mode) {
+ mode = mode !== undefined ? mode : 438 /* 0666 */;
+ mode &= 4095;
+ mode |= 32768;
+ return FS.mknod(path, mode, 0);
+ },mkdir:function (path, mode) {
+ mode = mode !== undefined ? mode : 511 /* 0777 */;
+ mode &= 511 | 512;
+ mode |= 16384;
+ return FS.mknod(path, mode, 0);
+ },mkdev:function (path, mode, dev) {
+ if (typeof(dev) === 'undefined') {
+ dev = mode;
+ mode = 438 /* 0666 */;
+ }
+ mode |= 8192;
+ return FS.mknod(path, mode, dev);
+ },symlink:function (oldpath, newpath) {
+ var lookup = FS.lookupPath(newpath, { parent: true });
+ var parent = lookup.node;
+ var newname = PATH.basename(newpath);
+ var err = FS.mayCreate(parent, newname);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.symlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return parent.node_ops.symlink(parent, newname, oldpath);
+ },rename:function (old_path, new_path) {
+ var old_dirname = PATH.dirname(old_path);
+ var new_dirname = PATH.dirname(new_path);
+ var old_name = PATH.basename(old_path);
+ var new_name = PATH.basename(new_path);
+ // parents must exist
+ var lookup, old_dir, new_dir;
+ try {
+ lookup = FS.lookupPath(old_path, { parent: true });
+ old_dir = lookup.node;
+ lookup = FS.lookupPath(new_path, { parent: true });
+ new_dir = lookup.node;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ // need to be part of the same mount
+ if (old_dir.mount !== new_dir.mount) {
+ throw new FS.ErrnoError(ERRNO_CODES.EXDEV);
+ }
+ // source must exist
+ var old_node = FS.lookupNode(old_dir, old_name);
+ // old path should not be an ancestor of the new path
+ var relative = PATH.relative(old_path, new_dirname);
+ if (relative.charAt(0) !== '.') {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ // new path should not be an ancestor of the old path
+ relative = PATH.relative(new_path, old_dirname);
+ if (relative.charAt(0) !== '.') {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ // see if the new path already exists
+ var new_node;
+ try {
+ new_node = FS.lookupNode(new_dir, new_name);
+ } catch (e) {
+ // not fatal
+ }
+ // early out if nothing needs to change
+ if (old_node === new_node) {
+ return;
+ }
+ // we'll need to delete the old entry
+ var isdir = FS.isDir(old_node.mode);
+ var err = FS.mayDelete(old_dir, old_name, isdir);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ // need delete permissions if we'll be overwriting.
+ // need create permissions if new doesn't already exist.
+ err = new_node ?
+ FS.mayDelete(new_dir, new_name, isdir) :
+ FS.mayCreate(new_dir, new_name);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!old_dir.node_ops.rename) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(old_node) || (new_node && FS.isMountpoint(new_node))) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ // if we are going to change the parent, check write permissions
+ if (new_dir !== old_dir) {
+ err = FS.nodePermissions(old_dir, 'w');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ }
+ // remove the node from the lookup hash
+ FS.hashRemoveNode(old_node);
+ // do the underlying fs rename
+ try {
+ old_dir.node_ops.rename(old_node, new_dir, new_name);
+ } catch (e) {
+ throw e;
+ } finally {
+ // add the node back to the hash (in case node_ops.rename
+ // changed its name)
+ FS.hashAddNode(old_node);
+ }
+ },rmdir:function (path) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var node = FS.lookupNode(parent, name);
+ var err = FS.mayDelete(parent, name, true);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.rmdir) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ parent.node_ops.rmdir(parent, name);
+ FS.destroyNode(node);
+ },readdir:function (path) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ var node = lookup.node;
+ if (!node.node_ops.readdir) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ return node.node_ops.readdir(node);
+ },unlink:function (path) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var node = FS.lookupNode(parent, name);
+ var err = FS.mayDelete(parent, name, false);
+ if (err) {
+ // POSIX says unlink should set EPERM, not EISDIR
+ if (err === ERRNO_CODES.EISDIR) err = ERRNO_CODES.EPERM;
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.unlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ parent.node_ops.unlink(parent, name);
+ FS.destroyNode(node);
+ },readlink:function (path) {
+ var lookup = FS.lookupPath(path);
+ var link = lookup.node;
+ if (!link.node_ops.readlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ return link.node_ops.readlink(link);
+ },stat:function (path, dontFollow) {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ var node = lookup.node;
+ if (!node.node_ops.getattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return node.node_ops.getattr(node);
+ },lstat:function (path) {
+ return FS.stat(path, true);
+ },chmod:function (path, mode, dontFollow) {
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ node.node_ops.setattr(node, {
+ mode: (mode & 4095) | (node.mode & ~4095),
+ timestamp: Date.now()
+ });
+ },lchmod:function (path, mode) {
+ FS.chmod(path, mode, true);
+ },fchmod:function (fd, mode) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ FS.chmod(stream.node, mode);
+ },chown:function (path, uid, gid, dontFollow) {
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ node.node_ops.setattr(node, {
+ timestamp: Date.now()
+ // we ignore the uid / gid for now
+ });
+ },lchown:function (path, uid, gid) {
+ FS.chown(path, uid, gid, true);
+ },fchown:function (fd, uid, gid) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ FS.chown(stream.node, uid, gid);
+ },truncate:function (path, len) {
+ if (len < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: true });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!FS.isFile(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var err = FS.nodePermissions(node, 'w');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ node.node_ops.setattr(node, {
+ size: len,
+ timestamp: Date.now()
+ });
+ },ftruncate:function (fd, len) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ FS.truncate(stream.node, len);
+ },utime:function (path, atime, mtime) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ var node = lookup.node;
+ node.node_ops.setattr(node, {
+ timestamp: Math.max(atime, mtime)
+ });
+ },open:function (path, flags, mode, fd_start, fd_end) {
+ flags = typeof flags === 'string' ? FS.modeStringToFlags(flags) : flags;
+ mode = typeof mode === 'undefined' ? 438 /* 0666 */ : mode;
+ if ((flags & 64)) {
+ mode = (mode & 4095) | 32768;
+ } else {
+ mode = 0;
+ }
+ var node;
+ if (typeof path === 'object') {
+ node = path;
+ } else {
+ path = PATH.normalize(path);
+ try {
+ var lookup = FS.lookupPath(path, {
+ follow: !(flags & 131072)
+ });
+ node = lookup.node;
+ } catch (e) {
+ // ignore
+ }
+ }
+ // perhaps we need to create the node
+ if ((flags & 64)) {
+ if (node) {
+ // if O_CREAT and O_EXCL are set, error out if the node already exists
+ if ((flags & 128)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EEXIST);
+ }
+ } else {
+ // node doesn't exist, try to create it
+ node = FS.mknod(path, mode, 0);
+ }
+ }
+ if (!node) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
+ }
+ // can't truncate a device
+ if (FS.isChrdev(node.mode)) {
+ flags &= ~512;
+ }
+ // check permissions
+ var err = FS.mayOpen(node, flags);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ // do truncation if necessary
+ if ((flags & 512)) {
+ FS.truncate(node, 0);
+ }
+ // we've already handled these, don't pass down to the underlying vfs
+ flags &= ~(128 | 512);
+
+ // register the stream with the filesystem
+ var stream = FS.createStream({
+ node: node,
+ path: FS.getPath(node), // we want the absolute path to the node
+ flags: flags,
+ seekable: true,
+ position: 0,
+ stream_ops: node.stream_ops,
+ // used by the file family libc calls (fopen, fwrite, ferror, etc.)
+ ungotten: [],
+ error: false
+ }, fd_start, fd_end);
+ // call the new stream's open function
+ if (stream.stream_ops.open) {
+ stream.stream_ops.open(stream);
+ }
+ if (Module['logReadFiles'] && !(flags & 1)) {
+ if (!FS.readFiles) FS.readFiles = {};
+ if (!(path in FS.readFiles)) {
+ FS.readFiles[path] = 1;
+ Module['printErr']('read file: ' + path);
+ }
+ }
+ return stream;
+ },close:function (stream) {
+ try {
+ if (stream.stream_ops.close) {
+ stream.stream_ops.close(stream);
+ }
+ } catch (e) {
+ throw e;
+ } finally {
+ FS.closeStream(stream.fd);
+ }
+ },llseek:function (stream, offset, whence) {
+ if (!stream.seekable || !stream.stream_ops.llseek) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ return stream.stream_ops.llseek(stream, offset, whence);
+ },read:function (stream, buffer, offset, length, position) {
+ if (length < 0 || position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 1) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (FS.isDir(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!stream.stream_ops.read) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var seeking = true;
+ if (typeof position === 'undefined') {
+ position = stream.position;
+ seeking = false;
+ } else if (!stream.seekable) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ var bytesRead = stream.stream_ops.read(stream, buffer, offset, length, position);
+ if (!seeking) stream.position += bytesRead;
+ return bytesRead;
+ },write:function (stream, buffer, offset, length, position, canOwn) {
+ if (length < 0 || position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (FS.isDir(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!stream.stream_ops.write) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var seeking = true;
+ if (typeof position === 'undefined') {
+ position = stream.position;
+ seeking = false;
+ } else if (!stream.seekable) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ if (stream.flags & 1024) {
+ // seek to the end before writing in append mode
+ FS.llseek(stream, 0, 2);
+ }
+ var bytesWritten = stream.stream_ops.write(stream, buffer, offset, length, position, canOwn);
+ if (!seeking) stream.position += bytesWritten;
+ return bytesWritten;
+ },allocate:function (stream, offset, length) {
+ if (offset < 0 || length <= 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (!FS.isFile(stream.node.mode) && !FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ if (!stream.stream_ops.allocate) {
+ throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
+ }
+ stream.stream_ops.allocate(stream, offset, length);
+ },mmap:function (stream, buffer, offset, length, position, prot, flags) {
+ // TODO if PROT is PROT_WRITE, make sure we have write access
+ if ((stream.flags & 2097155) === 1) {
+ throw new FS.ErrnoError(ERRNO_CODES.EACCES);
+ }
+ if (!stream.stream_ops.mmap) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ return stream.stream_ops.mmap(stream, buffer, offset, length, position, prot, flags);
+ },ioctl:function (stream, cmd, arg) {
+ if (!stream.stream_ops.ioctl) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTTY);
+ }
+ return stream.stream_ops.ioctl(stream, cmd, arg);
+ },readFile:function (path, opts) {
+ opts = opts || {};
+ opts.flags = opts.flags || 'r';
+ opts.encoding = opts.encoding || 'binary';
+ if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
+ throw new Error('Invalid encoding type "' + opts.encoding + '"');
+ }
+ var ret;
+ var stream = FS.open(path, opts.flags);
+ var stat = FS.stat(path);
+ var length = stat.size;
+ var buf = new Uint8Array(length);
+ FS.read(stream, buf, 0, length, 0);
+ if (opts.encoding === 'utf8') {
+ ret = '';
+ var utf8 = new Runtime.UTF8Processor();
+ for (var i = 0; i < length; i++) {
+ ret += utf8.processCChar(buf[i]);
+ }
+ } else if (opts.encoding === 'binary') {
+ ret = buf;
+ }
+ FS.close(stream);
+ return ret;
+ },writeFile:function (path, data, opts) {
+ opts = opts || {};
+ opts.flags = opts.flags || 'w';
+ opts.encoding = opts.encoding || 'utf8';
+ if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
+ throw new Error('Invalid encoding type "' + opts.encoding + '"');
+ }
+ var stream = FS.open(path, opts.flags, opts.mode);
+ if (opts.encoding === 'utf8') {
+ var utf8 = new Runtime.UTF8Processor();
+ var buf = new Uint8Array(utf8.processJSString(data));
+ FS.write(stream, buf, 0, buf.length, 0, opts.canOwn);
+ } else if (opts.encoding === 'binary') {
+ FS.write(stream, data, 0, data.length, 0, opts.canOwn);
+ }
+ FS.close(stream);
+ },cwd:function () {
+ return FS.currentPath;
+ },chdir:function (path) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ if (!FS.isDir(lookup.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ var err = FS.nodePermissions(lookup.node, 'x');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ FS.currentPath = lookup.path;
+ },createDefaultDirectories:function () {
+ FS.mkdir('/tmp');
+ },createDefaultDevices:function () {
+ // create /dev
+ FS.mkdir('/dev');
+ // setup /dev/null
+ FS.registerDevice(FS.makedev(1, 3), {
+ read: function() { return 0; },
+ write: function() { return 0; }
+ });
+ FS.mkdev('/dev/null', FS.makedev(1, 3));
+ // setup /dev/tty and /dev/tty1
+ // stderr needs to print output using Module['printErr']
+ // so we register a second tty just for it.
+ TTY.register(FS.makedev(5, 0), TTY.default_tty_ops);
+ TTY.register(FS.makedev(6, 0), TTY.default_tty1_ops);
+ FS.mkdev('/dev/tty', FS.makedev(5, 0));
+ FS.mkdev('/dev/tty1', FS.makedev(6, 0));
+ // we're not going to emulate the actual shm device,
+ // just create the tmp dirs that reside in it commonly
+ FS.mkdir('/dev/shm');
+ FS.mkdir('/dev/shm/tmp');
+ },createStandardStreams:function () {
+ // TODO deprecate the old functionality of a single
+ // input / output callback and that utilizes FS.createDevice
+ // and instead require a unique set of stream ops
+
+ // by default, we symlink the standard streams to the
+ // default tty devices. however, if the standard streams
+ // have been overwritten we create a unique device for
+ // them instead.
+ if (Module['stdin']) {
+ FS.createDevice('/dev', 'stdin', Module['stdin']);
+ } else {
+ FS.symlink('/dev/tty', '/dev/stdin');
+ }
+ if (Module['stdout']) {
+ FS.createDevice('/dev', 'stdout', null, Module['stdout']);
+ } else {
+ FS.symlink('/dev/tty', '/dev/stdout');
+ }
+ if (Module['stderr']) {
+ FS.createDevice('/dev', 'stderr', null, Module['stderr']);
+ } else {
+ FS.symlink('/dev/tty1', '/dev/stderr');
+ }
+
+ // open default streams for the stdin, stdout and stderr devices
+ var stdin = FS.open('/dev/stdin', 'r');
+ HEAP32[((_stdin)>>2)]=FS.getPtrForStream(stdin);
+ assert(stdin.fd === 0, 'invalid handle for stdin (' + stdin.fd + ')');
+
+ var stdout = FS.open('/dev/stdout', 'w');
+ HEAP32[((_stdout)>>2)]=FS.getPtrForStream(stdout);
+ assert(stdout.fd === 1, 'invalid handle for stdout (' + stdout.fd + ')');
+
+ var stderr = FS.open('/dev/stderr', 'w');
+ HEAP32[((_stderr)>>2)]=FS.getPtrForStream(stderr);
+ assert(stderr.fd === 2, 'invalid handle for stderr (' + stderr.fd + ')');
+ },ensureErrnoError:function () {
+ if (FS.ErrnoError) return;
+ FS.ErrnoError = function ErrnoError(errno) {
+ this.errno = errno;
+ for (var key in ERRNO_CODES) {
+ if (ERRNO_CODES[key] === errno) {
+ this.code = key;
+ break;
+ }
+ }
+ this.message = ERRNO_MESSAGES[errno];
+ };
+ FS.ErrnoError.prototype = new Error();
+ FS.ErrnoError.prototype.constructor = FS.ErrnoError;
+ // Some errors may happen quite a bit, to avoid overhead we reuse them (and suffer a lack of stack info)
+ [ERRNO_CODES.ENOENT].forEach(function(code) {
+ FS.genericErrors[code] = new FS.ErrnoError(code);
+ FS.genericErrors[code].stack = '<generic error, no stack>';
+ });
+ },staticInit:function () {
+ FS.ensureErrnoError();
+
+ FS.nameTable = new Array(4096);
+
+ FS.mount(MEMFS, {}, '/');
+
+ FS.createDefaultDirectories();
+ FS.createDefaultDevices();
+ },init:function (input, output, error) {
+ assert(!FS.init.initialized, 'FS.init was previously called. If you want to initialize later with custom parameters, remove any earlier calls (note that one is automatically added to the generated code)');
+ FS.init.initialized = true;
+
+ FS.ensureErrnoError();
+
+ // Allow Module.stdin etc. to provide defaults, if none explicitly passed to us here
+ Module['stdin'] = input || Module['stdin'];
+ Module['stdout'] = output || Module['stdout'];
+ Module['stderr'] = error || Module['stderr'];
+
+ FS.createStandardStreams();
+ },quit:function () {
+ FS.init.initialized = false;
+ for (var i = 0; i < FS.streams.length; i++) {
+ var stream = FS.streams[i];
+ if (!stream) {
+ continue;
+ }
+ FS.close(stream);
+ }
+ },getMode:function (canRead, canWrite) {
+ var mode = 0;
+ if (canRead) mode |= 292 | 73;
+ if (canWrite) mode |= 146;
+ return mode;
+ },joinPath:function (parts, forceRelative) {
+ var path = PATH.join.apply(null, parts);
+ if (forceRelative && path[0] == '/') path = path.substr(1);
+ return path;
+ },absolutePath:function (relative, base) {
+ return PATH.resolve(base, relative);
+ },standardizePath:function (path) {
+ return PATH.normalize(path);
+ },findObject:function (path, dontResolveLastLink) {
+ var ret = FS.analyzePath(path, dontResolveLastLink);
+ if (ret.exists) {
+ return ret.object;
+ } else {
+ ___setErrNo(ret.error);
+ return null;
+ }
+ },analyzePath:function (path, dontResolveLastLink) {
+ // operate from within the context of the symlink's target
+ try {
+ var lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
+ path = lookup.path;
+ } catch (e) {
+ }
+ var ret = {
+ isRoot: false, exists: false, error: 0, name: null, path: null, object: null,
+ parentExists: false, parentPath: null, parentObject: null
+ };
+ try {
+ var lookup = FS.lookupPath(path, { parent: true });
+ ret.parentExists = true;
+ ret.parentPath = lookup.path;
+ ret.parentObject = lookup.node;
+ ret.name = PATH.basename(path);
+ lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
+ ret.exists = true;
+ ret.path = lookup.path;
+ ret.object = lookup.node;
+ ret.name = lookup.node.name;
+ ret.isRoot = lookup.path === '/';
+ } catch (e) {
+ ret.error = e.errno;
+ };
+ return ret;
+ },createFolder:function (parent, name, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(canRead, canWrite);
+ return FS.mkdir(path, mode);
+ },createPath:function (parent, path, canRead, canWrite) {
+ parent = typeof parent === 'string' ? parent : FS.getPath(parent);
+ var parts = path.split('/').reverse();
+ while (parts.length) {
+ var part = parts.pop();
+ if (!part) continue;
+ var current = PATH.join2(parent, part);
+ try {
+ FS.mkdir(current);
+ } catch (e) {
+ // ignore EEXIST
+ }
+ parent = current;
+ }
+ return current;
+ },createFile:function (parent, name, properties, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(canRead, canWrite);
+ return FS.create(path, mode);
+ },createDataFile:function (parent, name, data, canRead, canWrite, canOwn) {
+ var path = name ? PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name) : parent;
+ var mode = FS.getMode(canRead, canWrite);
+ var node = FS.create(path, mode);
+ if (data) {
+ if (typeof data === 'string') {
+ var arr = new Array(data.length);
+ for (var i = 0, len = data.length; i < len; ++i) arr[i] = data.charCodeAt(i);
+ data = arr;
+ }
+ // make sure we can write to the file
+ FS.chmod(node, mode | 146);
+ var stream = FS.open(node, 'w');
+ FS.write(stream, data, 0, data.length, 0, canOwn);
+ FS.close(stream);
+ FS.chmod(node, mode);
+ }
+ return node;
+ },createDevice:function (parent, name, input, output) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(!!input, !!output);
+ if (!FS.createDevice.major) FS.createDevice.major = 64;
+ var dev = FS.makedev(FS.createDevice.major++, 0);
+ // Create a fake device that a set of stream ops to emulate
+ // the old behavior.
+ FS.registerDevice(dev, {
+ open: function(stream) {
+ stream.seekable = false;
+ },
+ close: function(stream) {
+ // flush any pending line data
+ if (output && output.buffer && output.buffer.length) {
+ output(10);
+ }
+ },
+ read: function(stream, buffer, offset, length, pos /* ignored */) {
+ var bytesRead = 0;
+ for (var i = 0; i < length; i++) {
+ var result;
+ try {
+ result = input();
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ if (result === undefined && bytesRead === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ if (result === null || result === undefined) break;
+ bytesRead++;
+ buffer[offset+i] = result;
+ }
+ if (bytesRead) {
+ stream.node.timestamp = Date.now();
+ }
+ return bytesRead;
+ },
+ write: function(stream, buffer, offset, length, pos) {
+ for (var i = 0; i < length; i++) {
+ try {
+ output(buffer[offset+i]);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ }
+ if (length) {
+ stream.node.timestamp = Date.now();
+ }
+ return i;
+ }
+ });
+ return FS.mkdev(path, mode, dev);
+ },createLink:function (parent, name, target, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ return FS.symlink(target, path);
+ },forceLoadFile:function (obj) {
+ if (obj.isDevice || obj.isFolder || obj.link || obj.contents) return true;
+ var success = true;
+ if (typeof XMLHttpRequest !== 'undefined') {
+ throw new Error("Lazy loading should have been performed (contents set) in createLazyFile, but it was not. Lazy loading only works in web workers. Use --embed-file or --preload-file in emcc on the main thread.");
+ } else if (Module['read']) {
+ // Command-line.
+ try {
+ // WARNING: Can't read binary files in V8's d8 or tracemonkey's js, as
+ // read() will try to parse UTF8.
+ obj.contents = intArrayFromString(Module['read'](obj.url), true);
+ } catch (e) {
+ success = false;
+ }
+ } else {
+ throw new Error('Cannot load without read() or XMLHttpRequest.');
+ }
+ if (!success) ___setErrNo(ERRNO_CODES.EIO);
+ return success;
+ },createLazyFile:function (parent, name, url, canRead, canWrite) {
+ // Lazy chunked Uint8Array (implements get and length from Uint8Array). Actual getting is abstracted away for eventual reuse.
+ function LazyUint8Array() {
+ this.lengthKnown = false;
+ this.chunks = []; // Loaded chunks. Index is the chunk number
+ }
+ LazyUint8Array.prototype.get = function LazyUint8Array_get(idx) {
+ if (idx > this.length-1 || idx < 0) {
+ return undefined;
+ }
+ var chunkOffset = idx % this.chunkSize;
+ var chunkNum = Math.floor(idx / this.chunkSize);
+ return this.getter(chunkNum)[chunkOffset];
+ }
+ LazyUint8Array.prototype.setDataGetter = function LazyUint8Array_setDataGetter(getter) {
+ this.getter = getter;
+ }
+ LazyUint8Array.prototype.cacheLength = function LazyUint8Array_cacheLength() {
+ // Find length
+ var xhr = new XMLHttpRequest();
+ xhr.open('HEAD', url, false);
+ xhr.send(null);
+ if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
+ var datalength = Number(xhr.getResponseHeader("Content-length"));
+ var header;
+ var hasByteServing = (header = xhr.getResponseHeader("Accept-Ranges")) && header === "bytes";
+ var chunkSize = 1024*1024; // Chunk size in bytes
+
+ if (!hasByteServing) chunkSize = datalength;
+
+ // Function to get a range from the remote URL.
+ var doXHR = (function(from, to) {
+ if (from > to) throw new Error("invalid range (" + from + ", " + to + ") or no bytes requested!");
+ if (to > datalength-1) throw new Error("only " + datalength + " bytes available! programmer error!");
+
+ // TODO: Use mozResponseArrayBuffer, responseStream, etc. if available.
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, false);
+ if (datalength !== chunkSize) xhr.setRequestHeader("Range", "bytes=" + from + "-" + to);
+
+ // Some hints to the browser that we want binary data.
+ if (typeof Uint8Array != 'undefined') xhr.responseType = 'arraybuffer';
+ if (xhr.overrideMimeType) {
+ xhr.overrideMimeType('text/plain; charset=x-user-defined');
+ }
+
+ xhr.send(null);
+ if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
+ if (xhr.response !== undefined) {
+ return new Uint8Array(xhr.response || []);
+ } else {
+ return intArrayFromString(xhr.responseText || '', true);
+ }
+ });
+ var lazyArray = this;
+ lazyArray.setDataGetter(function(chunkNum) {
+ var start = chunkNum * chunkSize;
+ var end = (chunkNum+1) * chunkSize - 1; // including this byte
+ end = Math.min(end, datalength-1); // if datalength-1 is selected, this is the last block
+ if (typeof(lazyArray.chunks[chunkNum]) === "undefined") {
+ lazyArray.chunks[chunkNum] = doXHR(start, end);
+ }
+ if (typeof(lazyArray.chunks[chunkNum]) === "undefined") throw new Error("doXHR failed!");
+ return lazyArray.chunks[chunkNum];
+ });
+
+ this._length = datalength;
+ this._chunkSize = chunkSize;
+ this.lengthKnown = true;
+ }
+ if (typeof XMLHttpRequest !== 'undefined') {
+ if (!ENVIRONMENT_IS_WORKER) throw 'Cannot do synchronous binary XHRs outside webworkers in modern browsers. Use --embed-file or --preload-file in emcc';
+ var lazyArray = new LazyUint8Array();
+ Object.defineProperty(lazyArray, "length", {
+ get: function() {
+ if(!this.lengthKnown) {
+ this.cacheLength();
+ }
+ return this._length;
+ }
+ });
+ Object.defineProperty(lazyArray, "chunkSize", {
+ get: function() {
+ if(!this.lengthKnown) {
+ this.cacheLength();
+ }
+ return this._chunkSize;
+ }
+ });
+
+ var properties = { isDevice: false, contents: lazyArray };
+ } else {
+ var properties = { isDevice: false, url: url };
+ }
+
+ var node = FS.createFile(parent, name, properties, canRead, canWrite);
+ // This is a total hack, but I want to get this lazy file code out of the
+ // core of MEMFS. If we want to keep this lazy file concept I feel it should
+ // be its own thin LAZYFS proxying calls to MEMFS.
+ if (properties.contents) {
+ node.contents = properties.contents;
+ } else if (properties.url) {
+ node.contents = null;
+ node.url = properties.url;
+ }
+ // override each stream op with one that tries to force load the lazy file first
+ var stream_ops = {};
+ var keys = Object.keys(node.stream_ops);
+ keys.forEach(function(key) {
+ var fn = node.stream_ops[key];
+ stream_ops[key] = function forceLoadLazyFile() {
+ if (!FS.forceLoadFile(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ return fn.apply(null, arguments);
+ };
+ });
+ // use a custom read function
+ stream_ops.read = function stream_ops_read(stream, buffer, offset, length, position) {
+ if (!FS.forceLoadFile(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ var contents = stream.node.contents;
+ if (position >= contents.length)
+ return 0;
+ var size = Math.min(contents.length - position, length);
+ assert(size >= 0);
+ if (contents.slice) { // normal array
+ for (var i = 0; i < size; i++) {
+ buffer[offset + i] = contents[position + i];
+ }
+ } else {
+ for (var i = 0; i < size; i++) { // LazyUint8Array from sync binary XHR
+ buffer[offset + i] = contents.get(position + i);
+ }
+ }
+ return size;
+ };
+ node.stream_ops = stream_ops;
+ return node;
+ },createPreloadedFile:function (parent, name, url, canRead, canWrite, onload, onerror, dontCreateFile, canOwn) {
+ Browser.init();
+ // TODO we should allow people to just pass in a complete filename instead
+ // of parent and name being that we just join them anyways
+ var fullname = name ? PATH.resolve(PATH.join2(parent, name)) : parent;
+ function processData(byteArray) {
+ function finish(byteArray) {
+ if (!dontCreateFile) {
+ FS.createDataFile(parent, name, byteArray, canRead, canWrite, canOwn);
+ }
+ if (onload) onload();
+ removeRunDependency('cp ' + fullname);
+ }
+ var handled = false;
+ Module['preloadPlugins'].forEach(function(plugin) {
+ if (handled) return;
+ if (plugin['canHandle'](fullname)) {
+ plugin['handle'](byteArray, fullname, finish, function() {
+ if (onerror) onerror();
+ removeRunDependency('cp ' + fullname);
+ });
+ handled = true;
+ }
+ });
+ if (!handled) finish(byteArray);
+ }
+ addRunDependency('cp ' + fullname);
+ if (typeof url == 'string') {
+ Browser.asyncLoad(url, function(byteArray) {
+ processData(byteArray);
+ }, onerror);
+ } else {
+ processData(url);
+ }
+ },indexedDB:function () {
+ return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
+ },DB_NAME:function () {
+ return 'EM_FS_' + window.location.pathname;
+ },DB_VERSION:20,DB_STORE_NAME:"FILE_DATA",saveFilesToDB:function (paths, onload, onerror) {
+ onload = onload || function(){};
+ onerror = onerror || function(){};
+ var indexedDB = FS.indexedDB();
+ try {
+ var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
+ } catch (e) {
+ return onerror(e);
+ }
+ openRequest.onupgradeneeded = function openRequest_onupgradeneeded() {
+ console.log('creating db');
+ var db = openRequest.result;
+ db.createObjectStore(FS.DB_STORE_NAME);
+ };
+ openRequest.onsuccess = function openRequest_onsuccess() {
+ var db = openRequest.result;
+ var transaction = db.transaction([FS.DB_STORE_NAME], 'readwrite');
+ var files = transaction.objectStore(FS.DB_STORE_NAME);
+ var ok = 0, fail = 0, total = paths.length;
+ function finish() {
+ if (fail == 0) onload(); else onerror();
+ }
+ paths.forEach(function(path) {
+ var putRequest = files.put(FS.analyzePath(path).object.contents, path);
+ putRequest.onsuccess = function putRequest_onsuccess() { ok++; if (ok + fail == total) finish() };
+ putRequest.onerror = function putRequest_onerror() { fail++; if (ok + fail == total) finish() };
+ });
+ transaction.onerror = onerror;
+ };
+ openRequest.onerror = onerror;
+ },loadFilesFromDB:function (paths, onload, onerror) {
+ onload = onload || function(){};
+ onerror = onerror || function(){};
+ var indexedDB = FS.indexedDB();
+ try {
+ var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
+ } catch (e) {
+ return onerror(e);
+ }
+ openRequest.onupgradeneeded = onerror; // no database to load from
+ openRequest.onsuccess = function openRequest_onsuccess() {
+ var db = openRequest.result;
+ try {
+ var transaction = db.transaction([FS.DB_STORE_NAME], 'readonly');
+ } catch(e) {
+ onerror(e);
+ return;
+ }
+ var files = transaction.objectStore(FS.DB_STORE_NAME);
+ var ok = 0, fail = 0, total = paths.length;
+ function finish() {
+ if (fail == 0) onload(); else onerror();
+ }
+ paths.forEach(function(path) {
+ var getRequest = files.get(path);
+ getRequest.onsuccess = function getRequest_onsuccess() {
+ if (FS.analyzePath(path).exists) {
+ FS.unlink(path);
+ }
+ FS.createDataFile(PATH.dirname(path), PATH.basename(path), getRequest.result, true, true, true);
+ ok++;
+ if (ok + fail == total) finish();
+ };
+ getRequest.onerror = function getRequest_onerror() { fail++; if (ok + fail == total) finish() };
+ });
+ transaction.onerror = onerror;
+ };
+ openRequest.onerror = onerror;
+ }};
+
+ function _lseek(fildes, offset, whence) {
+ // off_t lseek(int fildes, off_t offset, int whence);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/lseek.html
+ var stream = FS.getStream(fildes);
+ if (!stream) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ try {
+ return FS.llseek(stream, offset, whence);
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }
+
+ function _fileno(stream) {
+ // int fileno(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fileno.html
+ stream = FS.getStreamFromPtr(stream);
+ if (!stream) return -1;
+ return stream.fd;
+ }function _fseek(stream, offset, whence) {
+ // int fseek(FILE *stream, long offset, int whence);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fseek.html
+ var fd = _fileno(stream);
+ var ret = _lseek(fd, offset, whence);
+ if (ret == -1) {
+ return -1;
+ }
+ stream = FS.getStreamFromPtr(stream);
+ stream.eof = false;
+ return 0;
+ }
+
+
+ Module["_i64Subtract"] = _i64Subtract;
+
+
+ Module["_i64Add"] = _i64Add;
+
+ function _setlocale(category, locale) {
+ if (!_setlocale.ret) _setlocale.ret = allocate([0], 'i8', ALLOC_NORMAL);
+ return _setlocale.ret;
+ }
+
+
+ function _close(fildes) {
+ // int close(int fildes);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/close.html
+ var stream = FS.getStream(fildes);
+ if (!stream) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ try {
+ FS.close(stream);
+ return 0;
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }
+
+ function _fsync(fildes) {
+ // int fsync(int fildes);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fsync.html
+ var stream = FS.getStream(fildes);
+ if (stream) {
+ // We write directly to the file system, so there's nothing to do here.
+ return 0;
+ } else {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ }function _fclose(stream) {
+ // int fclose(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fclose.html
+ var fd = _fileno(stream);
+ _fsync(fd);
+ return _close(fd);
+ }
+
+
+
+
+
+ function _mkport() { throw 'TODO' }var SOCKFS={mount:function (mount) {
+ return FS.createNode(null, '/', 16384 | 511 /* 0777 */, 0);
+ },createSocket:function (family, type, protocol) {
+ var streaming = type == 1;
+ if (protocol) {
+ assert(streaming == (protocol == 6)); // if SOCK_STREAM, must be tcp
+ }
+
+ // create our internal socket structure
+ var sock = {
+ family: family,
+ type: type,
+ protocol: protocol,
+ server: null,
+ peers: {},
+ pending: [],
+ recv_queue: [],
+ sock_ops: SOCKFS.websocket_sock_ops
+ };
+
+ // create the filesystem node to store the socket structure
+ var name = SOCKFS.nextname();
+ var node = FS.createNode(SOCKFS.root, name, 49152, 0);
+ node.sock = sock;
+
+ // and the wrapping stream that enables library functions such
+ // as read and write to indirectly interact with the socket
+ var stream = FS.createStream({
+ path: name,
+ node: node,
+ flags: FS.modeStringToFlags('r+'),
+ seekable: false,
+ stream_ops: SOCKFS.stream_ops
+ });
+
+ // map the new stream to the socket structure (sockets have a 1:1
+ // relationship with a stream)
+ sock.stream = stream;
+
+ return sock;
+ },getSocket:function (fd) {
+ var stream = FS.getStream(fd);
+ if (!stream || !FS.isSocket(stream.node.mode)) {
+ return null;
+ }
+ return stream.node.sock;
+ },stream_ops:{poll:function (stream) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.poll(sock);
+ },ioctl:function (stream, request, varargs) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.ioctl(sock, request, varargs);
+ },read:function (stream, buffer, offset, length, position /* ignored */) {
+ var sock = stream.node.sock;
+ var msg = sock.sock_ops.recvmsg(sock, length);
+ if (!msg) {
+ // socket is closed
+ return 0;
+ }
+ buffer.set(msg.buffer, offset);
+ return msg.buffer.length;
+ },write:function (stream, buffer, offset, length, position /* ignored */) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.sendmsg(sock, buffer, offset, length);
+ },close:function (stream) {
+ var sock = stream.node.sock;
+ sock.sock_ops.close(sock);
+ }},nextname:function () {
+ if (!SOCKFS.nextname.current) {
+ SOCKFS.nextname.current = 0;
+ }
+ return 'socket[' + (SOCKFS.nextname.current++) + ']';
+ },websocket_sock_ops:{createPeer:function (sock, addr, port) {
+ var ws;
+
+ if (typeof addr === 'object') {
+ ws = addr;
+ addr = null;
+ port = null;
+ }
+
+ if (ws) {
+ // for sockets that've already connected (e.g. we're the server)
+ // we can inspect the _socket property for the address
+ if (ws._socket) {
+ addr = ws._socket.remoteAddress;
+ port = ws._socket.remotePort;
+ }
+ // if we're just now initializing a connection to the remote,
+ // inspect the url property
+ else {
+ var result = /ws[s]?:\/\/([^:]+):(\d+)/.exec(ws.url);
+ if (!result) {
+ throw new Error('WebSocket URL must be in the format ws(s)://address:port');
+ }
+ addr = result[1];
+ port = parseInt(result[2], 10);
+ }
+ } else {
+ // create the actual websocket object and connect
+ try {
+ // runtimeConfig gets set to true if WebSocket runtime configuration is available.
+ var runtimeConfig = (Module['websocket'] && ('object' === typeof Module['websocket']));
+
+ // The default value is 'ws://' the replace is needed because the compiler replaces "//" comments with '#'
+ // comments without checking context, so we'd end up with ws:#, the replace swaps the "#" for "//" again.
+ var url = 'ws:#'.replace('#', '//');
+
+ if (runtimeConfig) {
+ if ('string' === typeof Module['websocket']['url']) {
+ url = Module['websocket']['url']; // Fetch runtime WebSocket URL config.
+ }
+ }
+
+ if (url === 'ws://' || url === 'wss://') { // Is the supplied URL config just a prefix, if so complete it.
+ url = url + addr + ':' + port;
+ }
+
+ // Make the WebSocket subprotocol (Sec-WebSocket-Protocol) default to binary if no configuration is set.
+ var subProtocols = 'binary'; // The default value is 'binary'
+
+ if (runtimeConfig) {
+ if ('string' === typeof Module['websocket']['subprotocol']) {
+ subProtocols = Module['websocket']['subprotocol']; // Fetch runtime WebSocket subprotocol config.
+ }
+ }
+
+ // The regex trims the string (removes spaces at the beginning and end, then splits the string by
+ // <any space>,<any space> into an Array. Whitespace removal is important for Websockify and ws.
+ subProtocols = subProtocols.replace(/^ +| +$/g,"").split(/ *, */);
+
+ // The node ws library API for specifying optional subprotocol is slightly different than the browser's.
+ var opts = ENVIRONMENT_IS_NODE ? {'protocol': subProtocols.toString()} : subProtocols;
+
+ // If node we use the ws library.
+ var WebSocket = ENVIRONMENT_IS_NODE ? require('ws') : window['WebSocket'];
+ ws = new WebSocket(url, opts);
+ ws.binaryType = 'arraybuffer';
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EHOSTUNREACH);
+ }
+ }
+
+
+ var peer = {
+ addr: addr,
+ port: port,
+ socket: ws,
+ dgram_send_queue: []
+ };
+
+ SOCKFS.websocket_sock_ops.addPeer(sock, peer);
+ SOCKFS.websocket_sock_ops.handlePeerEvents(sock, peer);
+
+ // if this is a bound dgram socket, send the port number first to allow
+ // us to override the ephemeral port reported to us by remotePort on the
+ // remote end.
+ if (sock.type === 2 && typeof sock.sport !== 'undefined') {
+ peer.dgram_send_queue.push(new Uint8Array([
+ 255, 255, 255, 255,
+ 'p'.charCodeAt(0), 'o'.charCodeAt(0), 'r'.charCodeAt(0), 't'.charCodeAt(0),
+ ((sock.sport & 0xff00) >> 8) , (sock.sport & 0xff)
+ ]));
+ }
+
+ return peer;
+ },getPeer:function (sock, addr, port) {
+ return sock.peers[addr + ':' + port];
+ },addPeer:function (sock, peer) {
+ sock.peers[peer.addr + ':' + peer.port] = peer;
+ },removePeer:function (sock, peer) {
+ delete sock.peers[peer.addr + ':' + peer.port];
+ },handlePeerEvents:function (sock, peer) {
+ var first = true;
+
+ var handleOpen = function () {
+ try {
+ var queued = peer.dgram_send_queue.shift();
+ while (queued) {
+ peer.socket.send(queued);
+ queued = peer.dgram_send_queue.shift();
+ }
+ } catch (e) {
+ // not much we can do here in the way of proper error handling as we've already
+ // lied and said this data was sent. shut it down.
+ peer.socket.close();
+ }
+ };
+
+ function handleMessage(data) {
+ assert(typeof data !== 'string' && data.byteLength !== undefined); // must receive an ArrayBuffer
+ data = new Uint8Array(data); // make a typed array view on the array buffer
+
+
+ // if this is the port message, override the peer's port with it
+ var wasfirst = first;
+ first = false;
+ if (wasfirst &&
+ data.length === 10 &&
+ data[0] === 255 && data[1] === 255 && data[2] === 255 && data[3] === 255 &&
+ data[4] === 'p'.charCodeAt(0) && data[5] === 'o'.charCodeAt(0) && data[6] === 'r'.charCodeAt(0) && data[7] === 't'.charCodeAt(0)) {
+ // update the peer's port and it's key in the peer map
+ var newport = ((data[8] << 8) | data[9]);
+ SOCKFS.websocket_sock_ops.removePeer(sock, peer);
+ peer.port = newport;
+ SOCKFS.websocket_sock_ops.addPeer(sock, peer);
+ return;
+ }
+
+ sock.recv_queue.push({ addr: peer.addr, port: peer.port, data: data });
+ };
+
+ if (ENVIRONMENT_IS_NODE) {
+ peer.socket.on('open', handleOpen);
+ peer.socket.on('message', function(data, flags) {
+ if (!flags.binary) {
+ return;
+ }
+ handleMessage((new Uint8Array(data)).buffer); // copy from node Buffer -> ArrayBuffer
+ });
+ peer.socket.on('error', function() {
+ // don't throw
+ });
+ } else {
+ peer.socket.onopen = handleOpen;
+ peer.socket.onmessage = function peer_socket_onmessage(event) {
+ handleMessage(event.data);
+ };
+ }
+ },poll:function (sock) {
+ if (sock.type === 1 && sock.server) {
+ // listen sockets should only say they're available for reading
+ // if there are pending clients.
+ return sock.pending.length ? (64 | 1) : 0;
+ }
+
+ var mask = 0;
+ var dest = sock.type === 1 ? // we only care about the socket state for connection-based sockets
+ SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport) :
+ null;
+
+ if (sock.recv_queue.length ||
+ !dest || // connection-less sockets are always ready to read
+ (dest && dest.socket.readyState === dest.socket.CLOSING) ||
+ (dest && dest.socket.readyState === dest.socket.CLOSED)) { // let recv return 0 once closed
+ mask |= (64 | 1);
+ }
+
+ if (!dest || // connection-less sockets are always ready to write
+ (dest && dest.socket.readyState === dest.socket.OPEN)) {
+ mask |= 4;
+ }
+
+ if ((dest && dest.socket.readyState === dest.socket.CLOSING) ||
+ (dest && dest.socket.readyState === dest.socket.CLOSED)) {
+ mask |= 16;
+ }
+
+ return mask;
+ },ioctl:function (sock, request, arg) {
+ switch (request) {
+ case 21531:
+ var bytes = 0;
+ if (sock.recv_queue.length) {
+ bytes = sock.recv_queue[0].data.length;
+ }
+ HEAP32[((arg)>>2)]=bytes;
+ return 0;
+ default:
+ return ERRNO_CODES.EINVAL;
+ }
+ },close:function (sock) {
+ // if we've spawned a listen server, close it
+ if (sock.server) {
+ try {
+ sock.server.close();
+ } catch (e) {
+ }
+ sock.server = null;
+ }
+ // close any peer connections
+ var peers = Object.keys(sock.peers);
+ for (var i = 0; i < peers.length; i++) {
+ var peer = sock.peers[peers[i]];
+ try {
+ peer.socket.close();
+ } catch (e) {
+ }
+ SOCKFS.websocket_sock_ops.removePeer(sock, peer);
+ }
+ return 0;
+ },bind:function (sock, addr, port) {
+ if (typeof sock.saddr !== 'undefined' || typeof sock.sport !== 'undefined') {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL); // already bound
+ }
+ sock.saddr = addr;
+ sock.sport = port || _mkport();
+ // in order to emulate dgram sockets, we need to launch a listen server when
+ // binding on a connection-less socket
+ // note: this is only required on the server side
+ if (sock.type === 2) {
+ // close the existing server if it exists
+ if (sock.server) {
+ sock.server.close();
+ sock.server = null;
+ }
+ // swallow error operation not supported error that occurs when binding in the
+ // browser where this isn't supported
+ try {
+ sock.sock_ops.listen(sock, 0);
+ } catch (e) {
+ if (!(e instanceof FS.ErrnoError)) throw e;
+ if (e.errno !== ERRNO_CODES.EOPNOTSUPP) throw e;
+ }
+ }
+ },connect:function (sock, addr, port) {
+ if (sock.server) {
+ throw new FS.ErrnoError(ERRNO_CODS.EOPNOTSUPP);
+ }
+
+ // TODO autobind
+ // if (!sock.addr && sock.type == 2) {
+ // }
+
+ // early out if we're already connected / in the middle of connecting
+ if (typeof sock.daddr !== 'undefined' && typeof sock.dport !== 'undefined') {
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
+ if (dest) {
+ if (dest.socket.readyState === dest.socket.CONNECTING) {
+ throw new FS.ErrnoError(ERRNO_CODES.EALREADY);
+ } else {
+ throw new FS.ErrnoError(ERRNO_CODES.EISCONN);
+ }
+ }
+ }
+
+ // add the socket to our peer list and set our
+ // destination address / port to match
+ var peer = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
+ sock.daddr = peer.addr;
+ sock.dport = peer.port;
+
+ // always "fail" in non-blocking mode
+ throw new FS.ErrnoError(ERRNO_CODES.EINPROGRESS);
+ },listen:function (sock, backlog) {
+ if (!ENVIRONMENT_IS_NODE) {
+ throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
+ }
+ if (sock.server) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL); // already listening
+ }
+ var WebSocketServer = require('ws').Server;
+ var host = sock.saddr;
+ sock.server = new WebSocketServer({
+ host: host,
+ port: sock.sport
+ // TODO support backlog
+ });
+
+ sock.server.on('connection', function(ws) {
+ if (sock.type === 1) {
+ var newsock = SOCKFS.createSocket(sock.family, sock.type, sock.protocol);
+
+ // create a peer on the new socket
+ var peer = SOCKFS.websocket_sock_ops.createPeer(newsock, ws);
+ newsock.daddr = peer.addr;
+ newsock.dport = peer.port;
+
+ // push to queue for accept to pick up
+ sock.pending.push(newsock);
+ } else {
+ // create a peer on the listen socket so calling sendto
+ // with the listen socket and an address will resolve
+ // to the correct client
+ SOCKFS.websocket_sock_ops.createPeer(sock, ws);
+ }
+ });
+ sock.server.on('closed', function() {
+ sock.server = null;
+ });
+ sock.server.on('error', function() {
+ // don't throw
+ });
+ },accept:function (listensock) {
+ if (!listensock.server) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var newsock = listensock.pending.shift();
+ newsock.stream.flags = listensock.stream.flags;
+ return newsock;
+ },getname:function (sock, peer) {
+ var addr, port;
+ if (peer) {
+ if (sock.daddr === undefined || sock.dport === undefined) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+ addr = sock.daddr;
+ port = sock.dport;
+ } else {
+ // TODO saddr and sport will be set for bind()'d UDP sockets, but what
+ // should we be returning for TCP sockets that've been connect()'d?
+ addr = sock.saddr || 0;
+ port = sock.sport || 0;
+ }
+ return { addr: addr, port: port };
+ },sendmsg:function (sock, buffer, offset, length, addr, port) {
+ if (sock.type === 2) {
+ // connection-less sockets will honor the message address,
+ // and otherwise fall back to the bound destination address
+ if (addr === undefined || port === undefined) {
+ addr = sock.daddr;
+ port = sock.dport;
+ }
+ // if there was no address to fall back to, error out
+ if (addr === undefined || port === undefined) {
+ throw new FS.ErrnoError(ERRNO_CODES.EDESTADDRREQ);
+ }
+ } else {
+ // connection-based sockets will only use the bound
+ addr = sock.daddr;
+ port = sock.dport;
+ }
+
+ // find the peer for the destination address
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, addr, port);
+
+ // early out if not connected with a connection-based socket
+ if (sock.type === 1) {
+ if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ } else if (dest.socket.readyState === dest.socket.CONNECTING) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ }
+
+ // create a copy of the incoming data to send, as the WebSocket API
+ // doesn't work entirely with an ArrayBufferView, it'll just send
+ // the entire underlying buffer
+ var data;
+ if (buffer instanceof Array || buffer instanceof ArrayBuffer) {
+ data = buffer.slice(offset, offset + length);
+ } else { // ArrayBufferView
+ data = buffer.buffer.slice(buffer.byteOffset + offset, buffer.byteOffset + offset + length);
+ }
+
+ // if we're emulating a connection-less dgram socket and don't have
+ // a cached connection, queue the buffer to send upon connect and
+ // lie, saying the data was sent now.
+ if (sock.type === 2) {
+ if (!dest || dest.socket.readyState !== dest.socket.OPEN) {
+ // if we're not connected, open a new connection
+ if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ dest = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
+ }
+ dest.dgram_send_queue.push(data);
+ return length;
+ }
+ }
+
+ try {
+ // send the actual data
+ dest.socket.send(data);
+ return length;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ },recvmsg:function (sock, length) {
+ // http://pubs.opengroup.org/onlinepubs/7908799/xns/recvmsg.html
+ if (sock.type === 1 && sock.server) {
+ // tcp servers should not be recv()'ing on the listen socket
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+
+ var queued = sock.recv_queue.shift();
+ if (!queued) {
+ if (sock.type === 1) {
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
+
+ if (!dest) {
+ // if we have a destination address but are not connected, error out
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+ else if (dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ // return null if the socket has closed
+ return null;
+ }
+ else {
+ // else, our socket is in a valid state but truly has nothing available
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ } else {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ }
+
+ // queued.data will be an ArrayBuffer if it's unadulterated, but if it's
+ // requeued TCP data it'll be an ArrayBufferView
+ var queuedLength = queued.data.byteLength || queued.data.length;
+ var queuedOffset = queued.data.byteOffset || 0;
+ var queuedBuffer = queued.data.buffer || queued.data;
+ var bytesRead = Math.min(length, queuedLength);
+ var res = {
+ buffer: new Uint8Array(queuedBuffer, queuedOffset, bytesRead),
+ addr: queued.addr,
+ port: queued.port
+ };
+
+
+ // push back any unread data for TCP connections
+ if (sock.type === 1 && bytesRead < queuedLength) {
+ var bytesRemaining = queuedLength - bytesRead;
+ queued.data = new Uint8Array(queuedBuffer, queuedOffset + bytesRead, bytesRemaining);
+ sock.recv_queue.unshift(queued);
+ }
+
+ return res;
+ }}};function _recv(fd, buf, len, flags) {
+ var sock = SOCKFS.getSocket(fd);
+ if (!sock) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ // TODO honor flags
+ return _read(fd, buf, len);
+ }
+
+ function _pread(fildes, buf, nbyte, offset) {
+ // ssize_t pread(int fildes, void *buf, size_t nbyte, off_t offset);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/read.html
+ var stream = FS.getStream(fildes);
+ if (!stream) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ try {
+ var slab = HEAP8;
+ return FS.read(stream, slab, buf, nbyte, offset);
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }function _read(fildes, buf, nbyte) {
+ // ssize_t read(int fildes, void *buf, size_t nbyte);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/read.html
+ var stream = FS.getStream(fildes);
+ if (!stream) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+
+
+ try {
+ var slab = HEAP8;
+ return FS.read(stream, slab, buf, nbyte);
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }function _fread(ptr, size, nitems, stream) {
+ // size_t fread(void *restrict ptr, size_t size, size_t nitems, FILE *restrict stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fread.html
+ var bytesToRead = nitems * size;
+ if (bytesToRead == 0) {
+ return 0;
+ }
+ var bytesRead = 0;
+ var streamObj = FS.getStreamFromPtr(stream);
+ if (!streamObj) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return 0;
+ }
+ while (streamObj.ungotten.length && bytesToRead > 0) {
+ HEAP8[((ptr++)|0)]=streamObj.ungotten.pop();
+ bytesToRead--;
+ bytesRead++;
+ }
+ var err = _read(streamObj.fd, ptr, bytesToRead);
+ if (err == -1) {
+ if (streamObj) streamObj.error = true;
+ return 0;
+ }
+ bytesRead += err;
+ if (bytesRead < bytesToRead) streamObj.eof = true;
+ return Math.floor(bytesRead / size);
+ }
+
+ function _toupper(chr) {
+ if (chr >= 97 && chr <= 122) {
+ return chr - 97 + 65;
+ } else {
+ return chr;
+ }
+ }
+
+
+
+ function _open(path, oflag, varargs) {
+ // int open(const char *path, int oflag, ...);
+ // http://pubs.opengroup.org/onlinepubs/009695399/functions/open.html
+ var mode = HEAP32[((varargs)>>2)];
+ path = Pointer_stringify(path);
+ try {
+ var stream = FS.open(path, oflag, mode);
+ return stream.fd;
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }function _fopen(filename, mode) {
+ // FILE *fopen(const char *restrict filename, const char *restrict mode);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fopen.html
+ var flags;
+ mode = Pointer_stringify(mode);
+ if (mode[0] == 'r') {
+ if (mode.indexOf('+') != -1) {
+ flags = 2;
+ } else {
+ flags = 0;
+ }
+ } else if (mode[0] == 'w') {
+ if (mode.indexOf('+') != -1) {
+ flags = 2;
+ } else {
+ flags = 1;
+ }
+ flags |= 64;
+ flags |= 512;
+ } else if (mode[0] == 'a') {
+ if (mode.indexOf('+') != -1) {
+ flags = 2;
+ } else {
+ flags = 1;
+ }
+ flags |= 64;
+ flags |= 1024;
+ } else {
+ ___setErrNo(ERRNO_CODES.EINVAL);
+ return 0;
+ }
+ var fd = _open(filename, flags, allocate([0x1FF, 0, 0, 0], 'i32', ALLOC_STACK)); // All creation permissions.
+ return fd === -1 ? 0 : FS.getPtrForStream(FS.getStream(fd));
+ }
+
+ var _emscripten_check_longjmp=true;
+
+
+
+ function _send(fd, buf, len, flags) {
+ var sock = SOCKFS.getSocket(fd);
+ if (!sock) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ // TODO honor flags
+ return _write(fd, buf, len);
+ }
+
+ function _pwrite(fildes, buf, nbyte, offset) {
+ // ssize_t pwrite(int fildes, const void *buf, size_t nbyte, off_t offset);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
+ var stream = FS.getStream(fildes);
+ if (!stream) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ try {
+ var slab = HEAP8;
+ return FS.write(stream, slab, buf, nbyte, offset);
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }function _write(fildes, buf, nbyte) {
+ // ssize_t write(int fildes, const void *buf, size_t nbyte);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
+ var stream = FS.getStream(fildes);
+ if (!stream) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+
+
+ try {
+ var slab = HEAP8;
+ return FS.write(stream, slab, buf, nbyte);
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }function _fputc(c, stream) {
+ // int fputc(int c, FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fputc.html
+ var chr = unSign(c & 0xFF);
+ HEAP8[((_fputc.ret)|0)]=chr;
+ var fd = _fileno(stream);
+ var ret = _write(fd, _fputc.ret, 1);
+ if (ret == -1) {
+ var streamObj = FS.getStreamFromPtr(stream);
+ if (streamObj) streamObj.error = true;
+ return -1;
+ } else {
+ return chr;
+ }
+ }
+
+ var _log=Math_log;
+
+ var _emscripten_postinvoke=true;
+
+
+ function _putchar(c) {
+ // int putchar(int c);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/putchar.html
+ return _fputc(c, HEAP32[((_stdout)>>2)]);
+ }
+ Module["_saveSetjmp"] = _saveSetjmp;
+
+ function _fwrite(ptr, size, nitems, stream) {
+ // size_t fwrite(const void *restrict ptr, size_t size, size_t nitems, FILE *restrict stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fwrite.html
+ var bytesToWrite = nitems * size;
+ if (bytesToWrite == 0) return 0;
+ var fd = _fileno(stream);
+ var bytesWritten = _write(fd, ptr, bytesToWrite);
+ if (bytesWritten == -1) {
+ var streamObj = FS.getStreamFromPtr(stream);
+ if (streamObj) streamObj.error = true;
+ return 0;
+ } else {
+ return Math.floor(bytesWritten / size);
+ }
+ }
+
+ function _system(command) {
+ // int system(const char *command);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/system.html
+ // Can't call external programs.
+ ___setErrNo(ERRNO_CODES.EAGAIN);
+ return -1;
+ }
+
+ function _frexp(x, exp_addr) {
+ var sig = 0, exp_ = 0;
+ if (x !== 0) {
+ var sign = 1;
+ if (x < 0) {
+ x = -x;
+ sign = -1;
+ }
+ var raw_exp = Math.log(x)/Math.log(2);
+ exp_ = Math.ceil(raw_exp);
+ if (exp_ === raw_exp) exp_ += 1;
+ sig = sign*x/Math.pow(2, exp_);
+ }
+ HEAP32[((exp_addr)>>2)]=exp_;
+ return sig;
+ }
+
+
+
+ var _tzname=allocate(8, "i32*", ALLOC_STATIC);
+
+ var _daylight=allocate(1, "i32*", ALLOC_STATIC);
+
+ var _timezone=allocate(1, "i32*", ALLOC_STATIC);function _tzset() {
+ // TODO: Use (malleable) environment variables instead of system settings.
+ if (_tzset.called) return;
+ _tzset.called = true;
+
+ HEAP32[((_timezone)>>2)]=-(new Date()).getTimezoneOffset() * 60;
+
+ var winter = new Date(2000, 0, 1);
+ var summer = new Date(2000, 6, 1);
+ HEAP32[((_daylight)>>2)]=Number(winter.getTimezoneOffset() != summer.getTimezoneOffset());
+
+ var winterName = 'GMT'; // XXX do not rely on browser timezone info, it is very unpredictable | winter.toString().match(/\(([A-Z]+)\)/)[1];
+ var summerName = 'GMT'; // XXX do not rely on browser timezone info, it is very unpredictable | summer.toString().match(/\(([A-Z]+)\)/)[1];
+ var winterNamePtr = allocate(intArrayFromString(winterName), 'i8', ALLOC_NORMAL);
+ var summerNamePtr = allocate(intArrayFromString(summerName), 'i8', ALLOC_NORMAL);
+ HEAP32[((_tzname)>>2)]=winterNamePtr;
+ HEAP32[(((_tzname)+(4))>>2)]=summerNamePtr;
+ }function _mktime(tmPtr) {
+ _tzset();
+ var year = HEAP32[(((tmPtr)+(20))>>2)];
+ var timestamp = new Date(year >= 1900 ? year : year + 1900,
+ HEAP32[(((tmPtr)+(16))>>2)],
+ HEAP32[(((tmPtr)+(12))>>2)],
+ HEAP32[(((tmPtr)+(8))>>2)],
+ HEAP32[(((tmPtr)+(4))>>2)],
+ HEAP32[((tmPtr)>>2)],
+ 0).getTime() / 1000;
+ HEAP32[(((tmPtr)+(24))>>2)]=new Date(timestamp).getDay();
+ var yday = Math.round((timestamp - (new Date(year, 0, 1)).getTime()) / (1000 * 60 * 60 * 24));
+ HEAP32[(((tmPtr)+(28))>>2)]=yday;
+ return timestamp;
+ }
+
+ function _isalpha(chr) {
+ return (chr >= 97 && chr <= 122) ||
+ (chr >= 65 && chr <= 90);
+ }
+
+
+ function _malloc(bytes) {
+ /* Over-allocate to make sure it is byte-aligned by 8.
+ * This will leak memory, but this is only the dummy
+ * implementation (replaced by dlmalloc normally) so
+ * not an issue.
+ */
+ var ptr = Runtime.dynamicAlloc(bytes + 8);
+ return (ptr+8) & 0xFFFFFFF8;
+ }
+ Module["_malloc"] = _malloc;function _tmpnam(s, dir, prefix) {
+ // char *tmpnam(char *s);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/tmpnam.html
+ // NOTE: The dir and prefix arguments are for internal use only.
+ var folder = FS.findObject(dir || '/tmp');
+ if (!folder || !folder.isFolder) {
+ dir = '/tmp';
+ folder = FS.findObject(dir);
+ if (!folder || !folder.isFolder) return 0;
+ }
+ var name = prefix || 'file';
+ do {
+ name += String.fromCharCode(65 + Math.floor(Math.random() * 25));
+ } while (name in folder.contents);
+ var result = dir + '/' + name;
+ if (!_tmpnam.buffer) _tmpnam.buffer = _malloc(256);
+ if (!s) s = _tmpnam.buffer;
+ writeAsciiToMemory(result, s);
+ return s;
+ }
+
+ var Browser={mainLoop:{scheduler:null,method:"",shouldPause:false,paused:false,queue:[],pause:function () {
+ Browser.mainLoop.shouldPause = true;
+ },resume:function () {
+ if (Browser.mainLoop.paused) {
+ Browser.mainLoop.paused = false;
+ Browser.mainLoop.scheduler();
+ }
+ Browser.mainLoop.shouldPause = false;
+ },updateStatus:function () {
+ if (Module['setStatus']) {
+ var message = Module['statusMessage'] || 'Please wait...';
+ var remaining = Browser.mainLoop.remainingBlockers;
+ var expected = Browser.mainLoop.expectedBlockers;
+ if (remaining) {
+ if (remaining < expected) {
+ Module['setStatus'](message + ' (' + (expected - remaining) + '/' + expected + ')');
+ } else {
+ Module['setStatus'](message);
+ }
+ } else {
+ Module['setStatus']('');
+ }
+ }
+ }},isFullScreen:false,pointerLock:false,moduleContextCreatedCallbacks:[],workers:[],init:function () {
+ if (!Module["preloadPlugins"]) Module["preloadPlugins"] = []; // needs to exist even in workers
+
+ if (Browser.initted || ENVIRONMENT_IS_WORKER) return;
+ Browser.initted = true;
+
+ try {
+ new Blob();
+ Browser.hasBlobConstructor = true;
+ } catch(e) {
+ Browser.hasBlobConstructor = false;
+ console.log("warning: no blob constructor, cannot create blobs with mimetypes");
+ }
+ Browser.BlobBuilder = typeof MozBlobBuilder != "undefined" ? MozBlobBuilder : (typeof WebKitBlobBuilder != "undefined" ? WebKitBlobBuilder : (!Browser.hasBlobConstructor ? console.log("warning: no BlobBuilder") : null));
+ Browser.URLObject = typeof window != "undefined" ? (window.URL ? window.URL : window.webkitURL) : undefined;
+ if (!Module.noImageDecoding && typeof Browser.URLObject === 'undefined') {
+ console.log("warning: Browser does not support creating object URLs. Built-in browser image decoding will not be available.");
+ Module.noImageDecoding = true;
+ }
+
+ // Support for plugins that can process preloaded files. You can add more of these to
+ // your app by creating and appending to Module.preloadPlugins.
+ //
+ // Each plugin is asked if it can handle a file based on the file's name. If it can,
+ // it is given the file's raw data. When it is done, it calls a callback with the file's
+ // (possibly modified) data. For example, a plugin might decompress a file, or it
+ // might create some side data structure for use later (like an Image element, etc.).
+
+ var imagePlugin = {};
+ imagePlugin['canHandle'] = function imagePlugin_canHandle(name) {
+ return !Module.noImageDecoding && /\.(jpg|jpeg|png|bmp)$/i.test(name);
+ };
+ imagePlugin['handle'] = function imagePlugin_handle(byteArray, name, onload, onerror) {
+ var b = null;
+ if (Browser.hasBlobConstructor) {
+ try {
+ b = new Blob([byteArray], { type: Browser.getMimetype(name) });
+ if (b.size !== byteArray.length) { // Safari bug #118630
+ // Safari's Blob can only take an ArrayBuffer
+ b = new Blob([(new Uint8Array(byteArray)).buffer], { type: Browser.getMimetype(name) });
+ }
+ } catch(e) {
+ Runtime.warnOnce('Blob constructor present but fails: ' + e + '; falling back to blob builder');
+ }
+ }
+ if (!b) {
+ var bb = new Browser.BlobBuilder();
+ bb.append((new Uint8Array(byteArray)).buffer); // we need to pass a buffer, and must copy the array to get the right data range
+ b = bb.getBlob();
+ }
+ var url = Browser.URLObject.createObjectURL(b);
+ var img = new Image();
+ img.onload = function img_onload() {
+ assert(img.complete, 'Image ' + name + ' could not be decoded');
+ var canvas = document.createElement('canvas');
+ canvas.width = img.width;
+ canvas.height = img.height;
+ var ctx = canvas.getContext('2d');
+ ctx.drawImage(img, 0, 0);
+ Module["preloadedImages"][name] = canvas;
+ Browser.URLObject.revokeObjectURL(url);
+ if (onload) onload(byteArray);
+ };
+ img.onerror = function img_onerror(event) {
+ console.log('Image ' + url + ' could not be decoded');
+ if (onerror) onerror();
+ };
+ img.src = url;
+ };
+ Module['preloadPlugins'].push(imagePlugin);
+
+ var audioPlugin = {};
+ audioPlugin['canHandle'] = function audioPlugin_canHandle(name) {
+ return !Module.noAudioDecoding && name.substr(-4) in { '.ogg': 1, '.wav': 1, '.mp3': 1 };
+ };
+ audioPlugin['handle'] = function audioPlugin_handle(byteArray, name, onload, onerror) {
+ var done = false;
+ function finish(audio) {
+ if (done) return;
+ done = true;
+ Module["preloadedAudios"][name] = audio;
+ if (onload) onload(byteArray);
+ }
+ function fail() {
+ if (done) return;
+ done = true;
+ Module["preloadedAudios"][name] = new Audio(); // empty shim
+ if (onerror) onerror();
+ }
+ if (Browser.hasBlobConstructor) {
+ try {
+ var b = new Blob([byteArray], { type: Browser.getMimetype(name) });
+ } catch(e) {
+ return fail();
+ }
+ var url = Browser.URLObject.createObjectURL(b); // XXX we never revoke this!
+ var audio = new Audio();
+ audio.addEventListener('canplaythrough', function() { finish(audio) }, false); // use addEventListener due to chromium bug 124926
+ audio.onerror = function audio_onerror(event) {
+ if (done) return;
+ console.log('warning: browser could not fully decode audio ' + name + ', trying slower base64 approach');
+ function encode64(data) {
+ var BASE = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
+ var PAD = '=';
+ var ret = '';
+ var leftchar = 0;
+ var leftbits = 0;
+ for (var i = 0; i < data.length; i++) {
+ leftchar = (leftchar << 8) | data[i];
+ leftbits += 8;
+ while (leftbits >= 6) {
+ var curr = (leftchar >> (leftbits-6)) & 0x3f;
+ leftbits -= 6;
+ ret += BASE[curr];
+ }
+ }
+ if (leftbits == 2) {
+ ret += BASE[(leftchar&3) << 4];
+ ret += PAD + PAD;
+ } else if (leftbits == 4) {
+ ret += BASE[(leftchar&0xf) << 2];
+ ret += PAD;
+ }
+ return ret;
+ }
+ audio.src = 'data:audio/x-' + name.substr(-3) + ';base64,' + encode64(byteArray);
+ finish(audio); // we don't wait for confirmation this worked - but it's worth trying
+ };
+ audio.src = url;
+ // workaround for chrome bug 124926 - we do not always get oncanplaythrough or onerror
+ Browser.safeSetTimeout(function() {
+ finish(audio); // try to use it even though it is not necessarily ready to play
+ }, 10000);
+ } else {
+ return fail();
+ }
+ };
+ Module['preloadPlugins'].push(audioPlugin);
+
+ // Canvas event setup
+
+ var canvas = Module['canvas'];
+
+ // forced aspect ratio can be enabled by defining 'forcedAspectRatio' on Module
+ // Module['forcedAspectRatio'] = 4 / 3;
+
+ canvas.requestPointerLock = canvas['requestPointerLock'] ||
+ canvas['mozRequestPointerLock'] ||
+ canvas['webkitRequestPointerLock'] ||
+ canvas['msRequestPointerLock'] ||
+ function(){};
+ canvas.exitPointerLock = document['exitPointerLock'] ||
+ document['mozExitPointerLock'] ||
+ document['webkitExitPointerLock'] ||
+ document['msExitPointerLock'] ||
+ function(){}; // no-op if function does not exist
+ canvas.exitPointerLock = canvas.exitPointerLock.bind(document);
+
+ function pointerLockChange() {
+ Browser.pointerLock = document['pointerLockElement'] === canvas ||
+ document['mozPointerLockElement'] === canvas ||
+ document['webkitPointerLockElement'] === canvas ||
+ document['msPointerLockElement'] === canvas;
+ }
+
+ document.addEventListener('pointerlockchange', pointerLockChange, false);
+ document.addEventListener('mozpointerlockchange', pointerLockChange, false);
+ document.addEventListener('webkitpointerlockchange', pointerLockChange, false);
+ document.addEventListener('mspointerlockchange', pointerLockChange, false);
+
+ if (Module['elementPointerLock']) {
+ canvas.addEventListener("click", function(ev) {
+ if (!Browser.pointerLock && canvas.requestPointerLock) {
+ canvas.requestPointerLock();
+ ev.preventDefault();
+ }
+ }, false);
+ }
+ },createContext:function (canvas, useWebGL, setInModule, webGLContextAttributes) {
+ var ctx;
+ var errorInfo = '?';
+ function onContextCreationError(event) {
+ errorInfo = event.statusMessage || errorInfo;
+ }
+ try {
+ if (useWebGL) {
+ var contextAttributes = {
+ antialias: false,
+ alpha: false
+ };
+
+ if (webGLContextAttributes) {
+ for (var attribute in webGLContextAttributes) {
+ contextAttributes[attribute] = webGLContextAttributes[attribute];
+ }
+ }
+
+
+ canvas.addEventListener('webglcontextcreationerror', onContextCreationError, false);
+ try {
+ ['experimental-webgl', 'webgl'].some(function(webglId) {
+ return ctx = canvas.getContext(webglId, contextAttributes);
+ });
+ } finally {
+ canvas.removeEventListener('webglcontextcreationerror', onContextCreationError, false);
+ }
+ } else {
+ ctx = canvas.getContext('2d');
+ }
+ if (!ctx) throw ':(';
+ } catch (e) {
+ Module.print('Could not create canvas: ' + [errorInfo, e]);
+ return null;
+ }
+ if (useWebGL) {
+ // Set the background of the WebGL canvas to black
+ canvas.style.backgroundColor = "black";
+
+ // Warn on context loss
+ canvas.addEventListener('webglcontextlost', function(event) {
+ alert('WebGL context lost. You will need to reload the page.');
+ }, false);
+ }
+ if (setInModule) {
+ GLctx = Module.ctx = ctx;
+ Module.useWebGL = useWebGL;
+ Browser.moduleContextCreatedCallbacks.forEach(function(callback) { callback() });
+ Browser.init();
+ }
+ return ctx;
+ },destroyContext:function (canvas, useWebGL, setInModule) {},fullScreenHandlersInstalled:false,lockPointer:undefined,resizeCanvas:undefined,requestFullScreen:function (lockPointer, resizeCanvas) {
+ Browser.lockPointer = lockPointer;
+ Browser.resizeCanvas = resizeCanvas;
+ if (typeof Browser.lockPointer === 'undefined') Browser.lockPointer = true;
+ if (typeof Browser.resizeCanvas === 'undefined') Browser.resizeCanvas = false;
+
+ var canvas = Module['canvas'];
+ function fullScreenChange() {
+ Browser.isFullScreen = false;
+ var canvasContainer = canvas.parentNode;
+ if ((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
+ document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
+ document['fullScreenElement'] || document['fullscreenElement'] ||
+ document['msFullScreenElement'] || document['msFullscreenElement'] ||
+ document['webkitCurrentFullScreenElement']) === canvasContainer) {
+ canvas.cancelFullScreen = document['cancelFullScreen'] ||
+ document['mozCancelFullScreen'] ||
+ document['webkitCancelFullScreen'] ||
+ document['msExitFullscreen'] ||
+ document['exitFullscreen'] ||
+ function() {};
+ canvas.cancelFullScreen = canvas.cancelFullScreen.bind(document);
+ if (Browser.lockPointer) canvas.requestPointerLock();
+ Browser.isFullScreen = true;
+ if (Browser.resizeCanvas) Browser.setFullScreenCanvasSize();
+ } else {
+
+ // remove the full screen specific parent of the canvas again to restore the HTML structure from before going full screen
+ canvasContainer.parentNode.insertBefore(canvas, canvasContainer);
+ canvasContainer.parentNode.removeChild(canvasContainer);
+
+ if (Browser.resizeCanvas) Browser.setWindowedCanvasSize();
+ }
+ if (Module['onFullScreen']) Module['onFullScreen'](Browser.isFullScreen);
+ Browser.updateCanvasDimensions(canvas);
+ }
+
+ if (!Browser.fullScreenHandlersInstalled) {
+ Browser.fullScreenHandlersInstalled = true;
+ document.addEventListener('fullscreenchange', fullScreenChange, false);
+ document.addEventListener('mozfullscreenchange', fullScreenChange, false);
+ document.addEventListener('webkitfullscreenchange', fullScreenChange, false);
+ document.addEventListener('MSFullscreenChange', fullScreenChange, false);
+ }
+
+ // create a new parent to ensure the canvas has no siblings. this allows browsers to optimize full screen performance when its parent is the full screen root
+ var canvasContainer = document.createElement("div");
+ canvas.parentNode.insertBefore(canvasContainer, canvas);
+ canvasContainer.appendChild(canvas);
+
+ // use parent of canvas as full screen root to allow aspect ratio correction (Firefox stretches the root to screen size)
+ canvasContainer.requestFullScreen = canvasContainer['requestFullScreen'] ||
+ canvasContainer['mozRequestFullScreen'] ||
+ canvasContainer['msRequestFullscreen'] ||
+ (canvasContainer['webkitRequestFullScreen'] ? function() { canvasContainer['webkitRequestFullScreen'](Element['ALLOW_KEYBOARD_INPUT']) } : null);
+ canvasContainer.requestFullScreen();
+ },requestAnimationFrame:function requestAnimationFrame(func) {
+ if (typeof window === 'undefined') { // Provide fallback to setTimeout if window is undefined (e.g. in Node.js)
+ setTimeout(func, 1000/60);
+ } else {
+ if (!window.requestAnimationFrame) {
+ window.requestAnimationFrame = window['requestAnimationFrame'] ||
+ window['mozRequestAnimationFrame'] ||
+ window['webkitRequestAnimationFrame'] ||
+ window['msRequestAnimationFrame'] ||
+ window['oRequestAnimationFrame'] ||
+ window['setTimeout'];
+ }
+ window.requestAnimationFrame(func);
+ }
+ },safeCallback:function (func) {
+ return function() {
+ if (!ABORT) return func.apply(null, arguments);
+ };
+ },safeRequestAnimationFrame:function (func) {
+ return Browser.requestAnimationFrame(function() {
+ if (!ABORT) func();
+ });
+ },safeSetTimeout:function (func, timeout) {
+ return setTimeout(function() {
+ if (!ABORT) func();
+ }, timeout);
+ },safeSetInterval:function (func, timeout) {
+ return setInterval(function() {
+ if (!ABORT) func();
+ }, timeout);
+ },getMimetype:function (name) {
+ return {
+ 'jpg': 'image/jpeg',
+ 'jpeg': 'image/jpeg',
+ 'png': 'image/png',
+ 'bmp': 'image/bmp',
+ 'ogg': 'audio/ogg',
+ 'wav': 'audio/wav',
+ 'mp3': 'audio/mpeg'
+ }[name.substr(name.lastIndexOf('.')+1)];
+ },getUserMedia:function (func) {
+ if(!window.getUserMedia) {
+ window.getUserMedia = navigator['getUserMedia'] ||
+ navigator['mozGetUserMedia'];
+ }
+ window.getUserMedia(func);
+ },getMovementX:function (event) {
+ return event['movementX'] ||
+ event['mozMovementX'] ||
+ event['webkitMovementX'] ||
+ 0;
+ },getMovementY:function (event) {
+ return event['movementY'] ||
+ event['mozMovementY'] ||
+ event['webkitMovementY'] ||
+ 0;
+ },getMouseWheelDelta:function (event) {
+ return Math.max(-1, Math.min(1, event.type === 'DOMMouseScroll' ? event.detail : -event.wheelDelta));
+ },mouseX:0,mouseY:0,mouseMovementX:0,mouseMovementY:0,calculateMouseEvent:function (event) { // event should be mousemove, mousedown or mouseup
+ if (Browser.pointerLock) {
+ // When the pointer is locked, calculate the coordinates
+ // based on the movement of the mouse.
+ // Workaround for Firefox bug 764498
+ if (event.type != 'mousemove' &&
+ ('mozMovementX' in event)) {
+ Browser.mouseMovementX = Browser.mouseMovementY = 0;
+ } else {
+ Browser.mouseMovementX = Browser.getMovementX(event);
+ Browser.mouseMovementY = Browser.getMovementY(event);
+ }
+
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ Browser.mouseX = SDL.mouseX + Browser.mouseMovementX;
+ Browser.mouseY = SDL.mouseY + Browser.mouseMovementY;
+ } else {
+ // just add the mouse delta to the current absolut mouse position
+ // FIXME: ideally this should be clamped against the canvas size and zero
+ Browser.mouseX += Browser.mouseMovementX;
+ Browser.mouseY += Browser.mouseMovementY;
+ }
+ } else {
+ // Otherwise, calculate the movement based on the changes
+ // in the coordinates.
+ var rect = Module["canvas"].getBoundingClientRect();
+ var x, y;
+
+ // Neither .scrollX or .pageXOffset are defined in a spec, but
+ // we prefer .scrollX because it is currently in a spec draft.
+ // (see: http://www.w3.org/TR/2013/WD-cssom-view-20131217/)
+ var scrollX = ((typeof window.scrollX !== 'undefined') ? window.scrollX : window.pageXOffset);
+ var scrollY = ((typeof window.scrollY !== 'undefined') ? window.scrollY : window.pageYOffset);
+ if (event.type == 'touchstart' ||
+ event.type == 'touchend' ||
+ event.type == 'touchmove') {
+ var t = event.touches.item(0);
+ if (t) {
+ x = t.pageX - (scrollX + rect.left);
+ y = t.pageY - (scrollY + rect.top);
+ } else {
+ return;
+ }
+ } else {
+ x = event.pageX - (scrollX + rect.left);
+ y = event.pageY - (scrollY + rect.top);
+ }
+
+ // the canvas might be CSS-scaled compared to its backbuffer;
+ // SDL-using content will want mouse coordinates in terms
+ // of backbuffer units.
+ var cw = Module["canvas"].width;
+ var ch = Module["canvas"].height;
+ x = x * (cw / rect.width);
+ y = y * (ch / rect.height);
+
+ Browser.mouseMovementX = x - Browser.mouseX;
+ Browser.mouseMovementY = y - Browser.mouseY;
+ Browser.mouseX = x;
+ Browser.mouseY = y;
+ }
+ },xhrLoad:function (url, onload, onerror) {
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, true);
+ xhr.responseType = 'arraybuffer';
+ xhr.onload = function xhr_onload() {
+ if (xhr.status == 200 || (xhr.status == 0 && xhr.response)) { // file URLs can return 0
+ onload(xhr.response);
+ } else {
+ onerror();
+ }
+ };
+ xhr.onerror = onerror;
+ xhr.send(null);
+ },asyncLoad:function (url, onload, onerror, noRunDep) {
+ Browser.xhrLoad(url, function(arrayBuffer) {
+ assert(arrayBuffer, 'Loading data file "' + url + '" failed (no arrayBuffer).');
+ onload(new Uint8Array(arrayBuffer));
+ if (!noRunDep) removeRunDependency('al ' + url);
+ }, function(event) {
+ if (onerror) {
+ onerror();
+ } else {
+ throw 'Loading data file "' + url + '" failed.';
+ }
+ });
+ if (!noRunDep) addRunDependency('al ' + url);
+ },resizeListeners:[],updateResizeListeners:function () {
+ var canvas = Module['canvas'];
+ Browser.resizeListeners.forEach(function(listener) {
+ listener(canvas.width, canvas.height);
+ });
+ },setCanvasSize:function (width, height, noUpdates) {
+ var canvas = Module['canvas'];
+ Browser.updateCanvasDimensions(canvas, width, height);
+ if (!noUpdates) Browser.updateResizeListeners();
+ },windowedWidth:0,windowedHeight:0,setFullScreenCanvasSize:function () {
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
+ flags = flags | 0x00800000; // set SDL_FULLSCREEN flag
+ HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
+ }
+ Browser.updateResizeListeners();
+ },setWindowedCanvasSize:function () {
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
+ flags = flags & ~0x00800000; // clear SDL_FULLSCREEN flag
+ HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
+ }
+ Browser.updateResizeListeners();
+ },updateCanvasDimensions:function (canvas, wNative, hNative) {
+ if (wNative && hNative) {
+ canvas.widthNative = wNative;
+ canvas.heightNative = hNative;
+ } else {
+ wNative = canvas.widthNative;
+ hNative = canvas.heightNative;
+ }
+ var w = wNative;
+ var h = hNative;
+ if (Module['forcedAspectRatio'] && Module['forcedAspectRatio'] > 0) {
+ if (w/h < Module['forcedAspectRatio']) {
+ w = Math.round(h * Module['forcedAspectRatio']);
+ } else {
+ h = Math.round(w / Module['forcedAspectRatio']);
+ }
+ }
+ if (((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
+ document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
+ document['fullScreenElement'] || document['fullscreenElement'] ||
+ document['msFullScreenElement'] || document['msFullscreenElement'] ||
+ document['webkitCurrentFullScreenElement']) === canvas.parentNode) && (typeof screen != 'undefined')) {
+ var factor = Math.min(screen.width / w, screen.height / h);
+ w = Math.round(w * factor);
+ h = Math.round(h * factor);
+ }
+ if (Browser.resizeCanvas) {
+ if (canvas.width != w) canvas.width = w;
+ if (canvas.height != h) canvas.height = h;
+ if (typeof canvas.style != 'undefined') {
+ canvas.style.removeProperty( "width");
+ canvas.style.removeProperty("height");
+ }
+ } else {
+ if (canvas.width != wNative) canvas.width = wNative;
+ if (canvas.height != hNative) canvas.height = hNative;
+ if (typeof canvas.style != 'undefined') {
+ if (w != wNative || h != hNative) {
+ canvas.style.setProperty( "width", w + "px", "important");
+ canvas.style.setProperty("height", h + "px", "important");
+ } else {
+ canvas.style.removeProperty( "width");
+ canvas.style.removeProperty("height");
+ }
+ }
+ }
+ }};
+
+ function _log10(x) {
+ return Math.log(x) / Math.LN10;
+ }
+
+ function _isspace(chr) {
+ return (chr == 32) || (chr >= 9 && chr <= 13);
+ }
+
+
+ var ___tm_current=allocate(44, "i8", ALLOC_STATIC);
+
+
+ var ___tm_timezone=allocate(intArrayFromString("GMT"), "i8", ALLOC_STATIC);function _localtime_r(time, tmPtr) {
+ _tzset();
+ var date = new Date(HEAP32[((time)>>2)]*1000);
+ HEAP32[((tmPtr)>>2)]=date.getSeconds();
+ HEAP32[(((tmPtr)+(4))>>2)]=date.getMinutes();
+ HEAP32[(((tmPtr)+(8))>>2)]=date.getHours();
+ HEAP32[(((tmPtr)+(12))>>2)]=date.getDate();
+ HEAP32[(((tmPtr)+(16))>>2)]=date.getMonth();
+ HEAP32[(((tmPtr)+(20))>>2)]=date.getFullYear()-1900;
+ HEAP32[(((tmPtr)+(24))>>2)]=date.getDay();
+
+ var start = new Date(date.getFullYear(), 0, 1);
+ var yday = Math.floor((date.getTime() - start.getTime()) / (1000 * 60 * 60 * 24));
+ HEAP32[(((tmPtr)+(28))>>2)]=yday;
+ HEAP32[(((tmPtr)+(36))>>2)]=start.getTimezoneOffset() * 60;
+
+ var dst = Number(start.getTimezoneOffset() != date.getTimezoneOffset());
+ HEAP32[(((tmPtr)+(32))>>2)]=dst;
+
+ HEAP32[(((tmPtr)+(40))>>2)]=___tm_timezone;
+
+ return tmPtr;
+ }function _localtime(time) {
+ return _localtime_r(time, ___tm_current);
+ }
+
+ function _srand(seed) {
+ HEAP32[((___rand_seed)>>2)]=seed
+ }
+
+ var _emscripten_prep_setjmp=true;
+
+
+
+
+ Module["_testSetjmp"] = _testSetjmp;function _longjmp(env, value) {
+ asm['setThrew'](env, value || 1);
+ throw 'longjmp';
+ }function _emscripten_longjmp(env, value) {
+ _longjmp(env, value);
+ }
+
+ var _ceil=Math_ceil;
+
+
+ function _emscripten_memcpy_big(dest, src, num) {
+ HEAPU8.set(HEAPU8.subarray(src, src+num), dest);
+ return dest;
+ }
+ Module["_memcpy"] = _memcpy;
+
+ var _llvm_pow_f64=Math_pow;
+
+
+
+ Module["_strlen"] = _strlen;function _fputs(s, stream) {
+ // int fputs(const char *restrict s, FILE *restrict stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fputs.html
+ var fd = _fileno(stream);
+ return _write(fd, s, _strlen(s));
+ }
+
+ function _sbrk(bytes) {
+ // Implement a Linux-like 'memory area' for our 'process'.
+ // Changes the size of the memory area by |bytes|; returns the
+ // address of the previous top ('break') of the memory area
+ // We control the "dynamic" memory - DYNAMIC_BASE to DYNAMICTOP
+ var self = _sbrk;
+ if (!self.called) {
+ DYNAMICTOP = alignMemoryPage(DYNAMICTOP); // make sure we start out aligned
+ self.called = true;
+ assert(Runtime.dynamicAlloc);
+ self.alloc = Runtime.dynamicAlloc;
+ Runtime.dynamicAlloc = function() { abort('cannot dynamically allocate, sbrk now has control') };
+ }
+ var ret = DYNAMICTOP;
+ if (bytes != 0) self.alloc(bytes);
+ return ret; // Previous break location.
+ }
+
+
+ function _sinh(x) {
+ var p = Math.pow(Math.E, x);
+ return (p - (1 / p)) / 2;
+ }
+
+ function _cosh(x) {
+ var p = Math.pow(Math.E, x);
+ return (p + (1 / p)) / 2;
+ }function _tanh(x) {
+ return _sinh(x) / _cosh(x);
+ }
+
+ function _signal(sig, func) {
+ // TODO
+ return 0;
+ }
+
+
+
+ function __getFloat(text) {
+ return /^[+-]?[0-9]*\.?[0-9]+([eE][+-]?[0-9]+)?/.exec(text);
+ }function __scanString(format, get, unget, varargs) {
+ if (!__scanString.whiteSpace) {
+ __scanString.whiteSpace = {};
+ __scanString.whiteSpace[32] = 1;
+ __scanString.whiteSpace[9] = 1;
+ __scanString.whiteSpace[10] = 1;
+ __scanString.whiteSpace[11] = 1;
+ __scanString.whiteSpace[12] = 1;
+ __scanString.whiteSpace[13] = 1;
+ }
+ // Supports %x, %4x, %d.%d, %lld, %s, %f, %lf.
+ // TODO: Support all format specifiers.
+ format = Pointer_stringify(format);
+ var soFar = 0;
+ if (format.indexOf('%n') >= 0) {
+ // need to track soFar
+ var _get = get;
+ get = function get() {
+ soFar++;
+ return _get();
+ }
+ var _unget = unget;
+ unget = function unget() {
+ soFar--;
+ return _unget();
+ }
+ }
+ var formatIndex = 0;
+ var argsi = 0;
+ var fields = 0;
+ var argIndex = 0;
+ var next;
+
+ mainLoop:
+ for (var formatIndex = 0; formatIndex < format.length;) {
+ if (format[formatIndex] === '%' && format[formatIndex+1] == 'n') {
+ var argPtr = HEAP32[(((varargs)+(argIndex))>>2)];
+ argIndex += Runtime.getAlignSize('void*', null, true);
+ HEAP32[((argPtr)>>2)]=soFar;
+ formatIndex += 2;
+ continue;
+ }
+
+ if (format[formatIndex] === '%') {
+ var nextC = format.indexOf('c', formatIndex+1);
+ if (nextC > 0) {
+ var maxx = 1;
+ if (nextC > formatIndex+1) {
+ var sub = format.substring(formatIndex+1, nextC);
+ maxx = parseInt(sub);
+ if (maxx != sub) maxx = 0;
+ }
+ if (maxx) {
+ var argPtr = HEAP32[(((varargs)+(argIndex))>>2)];
+ argIndex += Runtime.getAlignSize('void*', null, true);
+ fields++;
+ for (var i = 0; i < maxx; i++) {
+ next = get();
+ HEAP8[((argPtr++)|0)]=next;
+ if (next === 0) return i > 0 ? fields : fields-1; // we failed to read the full length of this field
+ }
+ formatIndex += nextC - formatIndex + 1;
+ continue;
+ }
+ }
+ }
+
+ // handle %[...]
+ if (format[formatIndex] === '%' && format.indexOf('[', formatIndex+1) > 0) {
+ var match = /\%([0-9]*)\[(\^)?(\]?[^\]]*)\]/.exec(format.substring(formatIndex));
+ if (match) {
+ var maxNumCharacters = parseInt(match[1]) || Infinity;
+ var negateScanList = (match[2] === '^');
+ var scanList = match[3];
+
+ // expand "middle" dashs into character sets
+ var middleDashMatch;
+ while ((middleDashMatch = /([^\-])\-([^\-])/.exec(scanList))) {
+ var rangeStartCharCode = middleDashMatch[1].charCodeAt(0);
+ var rangeEndCharCode = middleDashMatch[2].charCodeAt(0);
+ for (var expanded = ''; rangeStartCharCode <= rangeEndCharCode; expanded += String.fromCharCode(rangeStartCharCode++));
+ scanList = scanList.replace(middleDashMatch[1] + '-' + middleDashMatch[2], expanded);
+ }
+
+ var argPtr = HEAP32[(((varargs)+(argIndex))>>2)];
+ argIndex += Runtime.getAlignSize('void*', null, true);
+ fields++;
+
+ for (var i = 0; i < maxNumCharacters; i++) {
+ next = get();
+ if (negateScanList) {
+ if (scanList.indexOf(String.fromCharCode(next)) < 0) {
+ HEAP8[((argPtr++)|0)]=next;
+ } else {
+ unget();
+ break;
+ }
+ } else {
+ if (scanList.indexOf(String.fromCharCode(next)) >= 0) {
+ HEAP8[((argPtr++)|0)]=next;
+ } else {
+ unget();
+ break;
+ }
+ }
+ }
+
+ // write out null-terminating character
+ HEAP8[((argPtr++)|0)]=0;
+ formatIndex += match[0].length;
+
+ continue;
+ }
+ }
+ // remove whitespace
+ while (1) {
+ next = get();
+ if (next == 0) return fields;
+ if (!(next in __scanString.whiteSpace)) break;
+ }
+ unget();
+
+ if (format[formatIndex] === '%') {
+ formatIndex++;
+ var suppressAssignment = false;
+ if (format[formatIndex] == '*') {
+ suppressAssignment = true;
+ formatIndex++;
+ }
+ var maxSpecifierStart = formatIndex;
+ while (format[formatIndex].charCodeAt(0) >= 48 &&
+ format[formatIndex].charCodeAt(0) <= 57) {
+ formatIndex++;
+ }
+ var max_;
+ if (formatIndex != maxSpecifierStart) {
+ max_ = parseInt(format.slice(maxSpecifierStart, formatIndex), 10);
+ }
+ var long_ = false;
+ var half = false;
+ var longLong = false;
+ if (format[formatIndex] == 'l') {
+ long_ = true;
+ formatIndex++;
+ if (format[formatIndex] == 'l') {
+ longLong = true;
+ formatIndex++;
+ }
+ } else if (format[formatIndex] == 'h') {
+ half = true;
+ formatIndex++;
+ }
+ var type = format[formatIndex];
+ formatIndex++;
+ var curr = 0;
+ var buffer = [];
+ // Read characters according to the format. floats are trickier, they may be in an unfloat state in the middle, then be a valid float later
+ if (type == 'f' || type == 'e' || type == 'g' ||
+ type == 'F' || type == 'E' || type == 'G') {
+ next = get();
+ while (next > 0 && (!(next in __scanString.whiteSpace))) {
+ buffer.push(String.fromCharCode(next));
+ next = get();
+ }
+ var m = __getFloat(buffer.join(''));
+ var last = m ? m[0].length : 0;
+ for (var i = 0; i < buffer.length - last + 1; i++) {
+ unget();
+ }
+ buffer.length = last;
+ } else {
+ next = get();
+ var first = true;
+
+ // Strip the optional 0x prefix for %x.
+ if ((type == 'x' || type == 'X') && (next == 48)) {
+ var peek = get();
+ if (peek == 120 || peek == 88) {
+ next = get();
+ } else {
+ unget();
+ }
+ }
+
+ while ((curr < max_ || isNaN(max_)) && next > 0) {
+ if (!(next in __scanString.whiteSpace) && // stop on whitespace
+ (type == 's' ||
+ ((type === 'd' || type == 'u' || type == 'i') && ((next >= 48 && next <= 57) ||
+ (first && next == 45))) ||
+ ((type === 'x' || type === 'X') && (next >= 48 && next <= 57 ||
+ next >= 97 && next <= 102 ||
+ next >= 65 && next <= 70))) &&
+ (formatIndex >= format.length || next !== format[formatIndex].charCodeAt(0))) { // Stop when we read something that is coming up
+ buffer.push(String.fromCharCode(next));
+ next = get();
+ curr++;
+ first = false;
+ } else {
+ break;
+ }
+ }
+ unget();
+ }
+ if (buffer.length === 0) return 0; // Failure.
+ if (suppressAssignment) continue;
+
+ var text = buffer.join('');
+ var argPtr = HEAP32[(((varargs)+(argIndex))>>2)];
+ argIndex += Runtime.getAlignSize('void*', null, true);
+ switch (type) {
+ case 'd': case 'u': case 'i':
+ if (half) {
+ HEAP16[((argPtr)>>1)]=parseInt(text, 10);
+ } else if (longLong) {
+ (tempI64 = [parseInt(text, 10)>>>0,(tempDouble=parseInt(text, 10),(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((argPtr)>>2)]=tempI64[0],HEAP32[(((argPtr)+(4))>>2)]=tempI64[1]);
+ } else {
+ HEAP32[((argPtr)>>2)]=parseInt(text, 10);
+ }
+ break;
+ case 'X':
+ case 'x':
+ HEAP32[((argPtr)>>2)]=parseInt(text, 16);
+ break;
+ case 'F':
+ case 'f':
+ case 'E':
+ case 'e':
+ case 'G':
+ case 'g':
+ case 'E':
+ // fallthrough intended
+ if (long_) {
+ HEAPF64[((argPtr)>>3)]=parseFloat(text);
+ } else {
+ HEAPF32[((argPtr)>>2)]=parseFloat(text);
+ }
+ break;
+ case 's':
+ var array = intArrayFromString(text);
+ for (var j = 0; j < array.length; j++) {
+ HEAP8[(((argPtr)+(j))|0)]=array[j];
+ }
+ break;
+ }
+ fields++;
+ } else if (format[formatIndex].charCodeAt(0) in __scanString.whiteSpace) {
+ next = get();
+ while (next in __scanString.whiteSpace) {
+ if (next <= 0) break mainLoop; // End of input.
+ next = get();
+ }
+ unget(next);
+ formatIndex++;
+ } else {
+ // Not a specifier.
+ next = get();
+ if (format[formatIndex].charCodeAt(0) !== next) {
+ unget(next);
+ break mainLoop;
+ }
+ formatIndex++;
+ }
+ }
+ return fields;
+ }
+
+ function _fgetc(stream) {
+ // int fgetc(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fgetc.html
+ var streamObj = FS.getStreamFromPtr(stream);
+ if (!streamObj) return -1;
+ if (streamObj.eof || streamObj.error) return -1;
+ var ret = _fread(_fgetc.ret, 1, 1, stream);
+ if (ret == 0) {
+ return -1;
+ } else if (ret == -1) {
+ streamObj.error = true;
+ return -1;
+ } else {
+ return HEAPU8[((_fgetc.ret)|0)];
+ }
+ }
+
+ function _ungetc(c, stream) {
+ // int ungetc(int c, FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/ungetc.html
+ stream = FS.getStreamFromPtr(stream);
+ if (!stream) {
+ return -1;
+ }
+ if (c === -1) {
+ // do nothing for EOF character
+ return c;
+ }
+ c = unSign(c & 0xFF);
+ stream.ungotten.push(c);
+ stream.eof = false;
+ return c;
+ }function _fscanf(stream, format, varargs) {
+ // int fscanf(FILE *restrict stream, const char *restrict format, ... );
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/scanf.html
+ var streamObj = FS.getStreamFromPtr(stream);
+ if (!streamObj) {
+ return -1;
+ }
+ var buffer = [];
+ function get() {
+ var c = _fgetc(stream);
+ buffer.push(c);
+ return c;
+ };
+ function unget() {
+ _ungetc(buffer.pop(), stream);
+ };
+ return __scanString(format, get, unget, varargs);
+ }
+
+ var _emscripten_preinvoke=true;
+
+ function _localeconv() {
+ // %struct.timeval = type { char* decimal point, other stuff... }
+ // var indexes = Runtime.calculateStructAlignment({ fields: ['i32', 'i32'] });
+ var me = _localeconv;
+ if (!me.ret) {
+ // These are defaults from the "C" locale
+ me.ret = allocate([
+ allocate(intArrayFromString('.'), 'i8', ALLOC_NORMAL),0,0,0, // decimal_point
+ allocate(intArrayFromString(''), 'i8', ALLOC_NORMAL),0,0,0, // thousands_sep
+ allocate(intArrayFromString(''), 'i8', ALLOC_NORMAL),0,0,0, // grouping
+ allocate(intArrayFromString(''), 'i8', ALLOC_NORMAL),0,0,0, // int_curr_symbol
+ allocate(intArrayFromString(''), 'i8', ALLOC_NORMAL),0,0,0, // currency_symbol
+ allocate(intArrayFromString(''), 'i8', ALLOC_NORMAL),0,0,0, // mon_decimal_point
+ allocate(intArrayFromString(''), 'i8', ALLOC_NORMAL),0,0,0, // mon_thousands_sep
+ allocate(intArrayFromString(''), 'i8', ALLOC_NORMAL),0,0,0, // mon_grouping
+ allocate(intArrayFromString(''), 'i8', ALLOC_NORMAL),0,0,0, // positive_sign
+ allocate(intArrayFromString(''), 'i8', ALLOC_NORMAL),0,0,0 // negative_sign
+ ], 'i8*', ALLOC_NORMAL); // Allocate strings in lconv, still don't allocate chars
+ }
+ return me.ret;
+ }
+
+
+ function _unlink(path) {
+ // int unlink(const char *path);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/unlink.html
+ path = Pointer_stringify(path);
+ try {
+ FS.unlink(path);
+ return 0;
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }
+
+ function _rmdir(path) {
+ // int rmdir(const char *path);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/rmdir.html
+ path = Pointer_stringify(path);
+ try {
+ FS.rmdir(path);
+ return 0;
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }function _remove(path) {
+ // int remove(const char *path);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/remove.html
+ var ret = _unlink(path);
+ if (ret == -1) ret = _rmdir(path);
+ return ret;
+ }
+
+ function _freopen(filename, mode, stream) {
+ // FILE *freopen(const char *restrict filename, const char *restrict mode, FILE *restrict stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/freopen.html
+ if (!filename) {
+ var streamObj = FS.getStreamFromPtr(stream);
+ if (!streamObj) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return 0;
+ }
+ if (_freopen.buffer) _free(_freopen.buffer);
+ filename = intArrayFromString(streamObj.path);
+ filename = allocate(filename, 'i8', ALLOC_NORMAL);
+ }
+ _fclose(stream);
+ return _fopen(filename, mode);
+ }
+
+
+ function _rename(old_path, new_path) {
+ // int rename(const char *old, const char *new);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/rename.html
+ old_path = Pointer_stringify(old_path);
+ new_path = Pointer_stringify(new_path);
+ try {
+ FS.rename(old_path, new_path);
+ return 0;
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }
+
+ function _tmpfile() {
+ // FILE *tmpfile(void);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/tmpfile.html
+ // TODO: Delete the created file on closing.
+ if (_tmpfile.mode) {
+ _tmpfile.mode = allocate(intArrayFromString('w+'), 'i8', ALLOC_NORMAL);
+ }
+ return _fopen(_tmpnam(0), _tmpfile.mode);
+ }
+
+ function _sysconf(name) {
+ // long sysconf(int name);
+ // http://pubs.opengroup.org/onlinepubs/009695399/functions/sysconf.html
+ switch(name) {
+ case 30: return PAGE_SIZE;
+ case 132:
+ case 133:
+ case 12:
+ case 137:
+ case 138:
+ case 15:
+ case 235:
+ case 16:
+ case 17:
+ case 18:
+ case 19:
+ case 20:
+ case 149:
+ case 13:
+ case 10:
+ case 236:
+ case 153:
+ case 9:
+ case 21:
+ case 22:
+ case 159:
+ case 154:
+ case 14:
+ case 77:
+ case 78:
+ case 139:
+ case 80:
+ case 81:
+ case 79:
+ case 82:
+ case 68:
+ case 67:
+ case 164:
+ case 11:
+ case 29:
+ case 47:
+ case 48:
+ case 95:
+ case 52:
+ case 51:
+ case 46:
+ return 200809;
+ case 27:
+ case 246:
+ case 127:
+ case 128:
+ case 23:
+ case 24:
+ case 160:
+ case 161:
+ case 181:
+ case 182:
+ case 242:
+ case 183:
+ case 184:
+ case 243:
+ case 244:
+ case 245:
+ case 165:
+ case 178:
+ case 179:
+ case 49:
+ case 50:
+ case 168:
+ case 169:
+ case 175:
+ case 170:
+ case 171:
+ case 172:
+ case 97:
+ case 76:
+ case 32:
+ case 173:
+ case 35:
+ return -1;
+ case 176:
+ case 177:
+ case 7:
+ case 155:
+ case 8:
+ case 157:
+ case 125:
+ case 126:
+ case 92:
+ case 93:
+ case 129:
+ case 130:
+ case 131:
+ case 94:
+ case 91:
+ return 1;
+ case 74:
+ case 60:
+ case 69:
+ case 70:
+ case 4:
+ return 1024;
+ case 31:
+ case 42:
+ case 72:
+ return 32;
+ case 87:
+ case 26:
+ case 33:
+ return 2147483647;
+ case 34:
+ case 1:
+ return 47839;
+ case 38:
+ case 36:
+ return 99;
+ case 43:
+ case 37:
+ return 2048;
+ case 0: return 2097152;
+ case 3: return 65536;
+ case 28: return 32768;
+ case 44: return 32767;
+ case 75: return 16384;
+ case 39: return 1000;
+ case 89: return 700;
+ case 71: return 256;
+ case 40: return 255;
+ case 2: return 100;
+ case 180: return 64;
+ case 25: return 20;
+ case 5: return 16;
+ case 6: return 6;
+ case 73: return 4;
+ case 84: return 1;
+ }
+ ___setErrNo(ERRNO_CODES.EINVAL);
+ return -1;
+ }
+
+
+ function ___errno_location() {
+ return ___errno_state;
+ }
+
+
+ Module["_memset"] = _memset;
+
+
+
+ Module["_bitshift64Shl"] = _bitshift64Shl;
+
+ function _abort() {
+ Module['abort']();
+ }
+
+
+
+ function __reallyNegative(x) {
+ return x < 0 || (x === 0 && (1/x) === -Infinity);
+ }function __formatString(format, varargs) {
+ var textIndex = format;
+ var argIndex = 0;
+ function getNextArg(type) {
+ // NOTE: Explicitly ignoring type safety. Otherwise this fails:
+ // int x = 4; printf("%c\n", (char)x);
+ var ret;
+ if (type === 'double') {
+ ret = HEAPF64[(((varargs)+(argIndex))>>3)];
+ } else if (type == 'i64') {
+ ret = [HEAP32[(((varargs)+(argIndex))>>2)],
+ HEAP32[(((varargs)+(argIndex+4))>>2)]];
+
+ } else {
+ type = 'i32'; // varargs are always i32, i64, or double
+ ret = HEAP32[(((varargs)+(argIndex))>>2)];
+ }
+ argIndex += Runtime.getNativeFieldSize(type);
+ return ret;
+ }
+
+ var ret = [];
+ var curr, next, currArg;
+ while(1) {
+ var startTextIndex = textIndex;
+ curr = HEAP8[(textIndex)];
+ if (curr === 0) break;
+ next = HEAP8[((textIndex+1)|0)];
+ if (curr == 37) {
+ // Handle flags.
+ var flagAlwaysSigned = false;
+ var flagLeftAlign = false;
+ var flagAlternative = false;
+ var flagZeroPad = false;
+ var flagPadSign = false;
+ flagsLoop: while (1) {
+ switch (next) {
+ case 43:
+ flagAlwaysSigned = true;
+ break;
+ case 45:
+ flagLeftAlign = true;
+ break;
+ case 35:
+ flagAlternative = true;
+ break;
+ case 48:
+ if (flagZeroPad) {
+ break flagsLoop;
+ } else {
+ flagZeroPad = true;
+ break;
+ }
+ case 32:
+ flagPadSign = true;
+ break;
+ default:
+ break flagsLoop;
+ }
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ }
+
+ // Handle width.
+ var width = 0;
+ if (next == 42) {
+ width = getNextArg('i32');
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ } else {
+ while (next >= 48 && next <= 57) {
+ width = width * 10 + (next - 48);
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ }
+ }
+
+ // Handle precision.
+ var precisionSet = false, precision = -1;
+ if (next == 46) {
+ precision = 0;
+ precisionSet = true;
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ if (next == 42) {
+ precision = getNextArg('i32');
+ textIndex++;
+ } else {
+ while(1) {
+ var precisionChr = HEAP8[((textIndex+1)|0)];
+ if (precisionChr < 48 ||
+ precisionChr > 57) break;
+ precision = precision * 10 + (precisionChr - 48);
+ textIndex++;
+ }
+ }
+ next = HEAP8[((textIndex+1)|0)];
+ }
+ if (precision < 0) {
+ precision = 6; // Standard default.
+ precisionSet = false;
+ }
+
+ // Handle integer sizes. WARNING: These assume a 32-bit architecture!
+ var argSize;
+ switch (String.fromCharCode(next)) {
+ case 'h':
+ var nextNext = HEAP8[((textIndex+2)|0)];
+ if (nextNext == 104) {
+ textIndex++;
+ argSize = 1; // char (actually i32 in varargs)
+ } else {
+ argSize = 2; // short (actually i32 in varargs)
+ }
+ break;
+ case 'l':
+ var nextNext = HEAP8[((textIndex+2)|0)];
+ if (nextNext == 108) {
+ textIndex++;
+ argSize = 8; // long long
+ } else {
+ argSize = 4; // long
+ }
+ break;
+ case 'L': // long long
+ case 'q': // int64_t
+ case 'j': // intmax_t
+ argSize = 8;
+ break;
+ case 'z': // size_t
+ case 't': // ptrdiff_t
+ case 'I': // signed ptrdiff_t or unsigned size_t
+ argSize = 4;
+ break;
+ default:
+ argSize = null;
+ }
+ if (argSize) textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+
+ // Handle type specifier.
+ switch (String.fromCharCode(next)) {
+ case 'd': case 'i': case 'u': case 'o': case 'x': case 'X': case 'p': {
+ // Integer.
+ var signed = next == 100 || next == 105;
+ argSize = argSize || 4;
+ var currArg = getNextArg('i' + (argSize * 8));
+ var origArg = currArg;
+ var argText;
+ // Flatten i64-1 [low, high] into a (slightly rounded) double
+ if (argSize == 8) {
+ currArg = Runtime.makeBigInt(currArg[0], currArg[1], next == 117);
+ }
+ // Truncate to requested size.
+ if (argSize <= 4) {
+ var limit = Math.pow(256, argSize) - 1;
+ currArg = (signed ? reSign : unSign)(currArg & limit, argSize * 8);
+ }
+ // Format the number.
+ var currAbsArg = Math.abs(currArg);
+ var prefix = '';
+ if (next == 100 || next == 105) {
+ if (argSize == 8 && i64Math) argText = i64Math.stringify(origArg[0], origArg[1], null); else
+ argText = reSign(currArg, 8 * argSize, 1).toString(10);
+ } else if (next == 117) {
+ if (argSize == 8 && i64Math) argText = i64Math.stringify(origArg[0], origArg[1], true); else
+ argText = unSign(currArg, 8 * argSize, 1).toString(10);
+ currArg = Math.abs(currArg);
+ } else if (next == 111) {
+ argText = (flagAlternative ? '0' : '') + currAbsArg.toString(8);
+ } else if (next == 120 || next == 88) {
+ prefix = (flagAlternative && currArg != 0) ? '0x' : '';
+ if (argSize == 8 && i64Math) {
+ if (origArg[1]) {
+ argText = (origArg[1]>>>0).toString(16);
+ var lower = (origArg[0]>>>0).toString(16);
+ while (lower.length < 8) lower = '0' + lower;
+ argText += lower;
+ } else {
+ argText = (origArg[0]>>>0).toString(16);
+ }
+ } else
+ if (currArg < 0) {
+ // Represent negative numbers in hex as 2's complement.
+ currArg = -currArg;
+ argText = (currAbsArg - 1).toString(16);
+ var buffer = [];
+ for (var i = 0; i < argText.length; i++) {
+ buffer.push((0xF - parseInt(argText[i], 16)).toString(16));
+ }
+ argText = buffer.join('');
+ while (argText.length < argSize * 2) argText = 'f' + argText;
+ } else {
+ argText = currAbsArg.toString(16);
+ }
+ if (next == 88) {
+ prefix = prefix.toUpperCase();
+ argText = argText.toUpperCase();
+ }
+ } else if (next == 112) {
+ if (currAbsArg === 0) {
+ argText = '(nil)';
+ } else {
+ prefix = '0x';
+ argText = currAbsArg.toString(16);
+ }
+ }
+ if (precisionSet) {
+ while (argText.length < precision) {
+ argText = '0' + argText;
+ }
+ }
+
+ // Add sign if needed
+ if (currArg >= 0) {
+ if (flagAlwaysSigned) {
+ prefix = '+' + prefix;
+ } else if (flagPadSign) {
+ prefix = ' ' + prefix;
+ }
+ }
+
+ // Move sign to prefix so we zero-pad after the sign
+ if (argText.charAt(0) == '-') {
+ prefix = '-' + prefix;
+ argText = argText.substr(1);
+ }
+
+ // Add padding.
+ while (prefix.length + argText.length < width) {
+ if (flagLeftAlign) {
+ argText += ' ';
+ } else {
+ if (flagZeroPad) {
+ argText = '0' + argText;
+ } else {
+ prefix = ' ' + prefix;
+ }
+ }
+ }
+
+ // Insert the result into the buffer.
+ argText = prefix + argText;
+ argText.split('').forEach(function(chr) {
+ ret.push(chr.charCodeAt(0));
+ });
+ break;
+ }
+ case 'f': case 'F': case 'e': case 'E': case 'g': case 'G': {
+ // Float.
+ var currArg = getNextArg('double');
+ var argText;
+ if (isNaN(currArg)) {
+ argText = 'nan';
+ flagZeroPad = false;
+ } else if (!isFinite(currArg)) {
+ argText = (currArg < 0 ? '-' : '') + 'inf';
+ flagZeroPad = false;
+ } else {
+ var isGeneral = false;
+ var effectivePrecision = Math.min(precision, 20);
+
+ // Convert g/G to f/F or e/E, as per:
+ // http://pubs.opengroup.org/onlinepubs/9699919799/functions/printf.html
+ if (next == 103 || next == 71) {
+ isGeneral = true;
+ precision = precision || 1;
+ var exponent = parseInt(currArg.toExponential(effectivePrecision).split('e')[1], 10);
+ if (precision > exponent && exponent >= -4) {
+ next = ((next == 103) ? 'f' : 'F').charCodeAt(0);
+ precision -= exponent + 1;
+ } else {
+ next = ((next == 103) ? 'e' : 'E').charCodeAt(0);
+ precision--;
+ }
+ effectivePrecision = Math.min(precision, 20);
+ }
+
+ if (next == 101 || next == 69) {
+ argText = currArg.toExponential(effectivePrecision);
+ // Make sure the exponent has at least 2 digits.
+ if (/[eE][-+]\d$/.test(argText)) {
+ argText = argText.slice(0, -1) + '0' + argText.slice(-1);
+ }
+ } else if (next == 102 || next == 70) {
+ argText = currArg.toFixed(effectivePrecision);
+ if (currArg === 0 && __reallyNegative(currArg)) {
+ argText = '-' + argText;
+ }
+ }
+
+ var parts = argText.split('e');
+ if (isGeneral && !flagAlternative) {
+ // Discard trailing zeros and periods.
+ while (parts[0].length > 1 && parts[0].indexOf('.') != -1 &&
+ (parts[0].slice(-1) == '0' || parts[0].slice(-1) == '.')) {
+ parts[0] = parts[0].slice(0, -1);
+ }
+ } else {
+ // Make sure we have a period in alternative mode.
+ if (flagAlternative && argText.indexOf('.') == -1) parts[0] += '.';
+ // Zero pad until required precision.
+ while (precision > effectivePrecision++) parts[0] += '0';
+ }
+ argText = parts[0] + (parts.length > 1 ? 'e' + parts[1] : '');
+
+ // Capitalize 'E' if needed.
+ if (next == 69) argText = argText.toUpperCase();
+
+ // Add sign.
+ if (currArg >= 0) {
+ if (flagAlwaysSigned) {
+ argText = '+' + argText;
+ } else if (flagPadSign) {
+ argText = ' ' + argText;
+ }
+ }
+ }
+
+ // Add padding.
+ while (argText.length < width) {
+ if (flagLeftAlign) {
+ argText += ' ';
+ } else {
+ if (flagZeroPad && (argText[0] == '-' || argText[0] == '+')) {
+ argText = argText[0] + '0' + argText.slice(1);
+ } else {
+ argText = (flagZeroPad ? '0' : ' ') + argText;
+ }
+ }
+ }
+
+ // Adjust case.
+ if (next < 97) argText = argText.toUpperCase();
+
+ // Insert the result into the buffer.
+ argText.split('').forEach(function(chr) {
+ ret.push(chr.charCodeAt(0));
+ });
+ break;
+ }
+ case 's': {
+ // String.
+ var arg = getNextArg('i8*');
+ var argLength = arg ? _strlen(arg) : '(null)'.length;
+ if (precisionSet) argLength = Math.min(argLength, precision);
+ if (!flagLeftAlign) {
+ while (argLength < width--) {
+ ret.push(32);
+ }
+ }
+ if (arg) {
+ for (var i = 0; i < argLength; i++) {
+ ret.push(HEAPU8[((arg++)|0)]);
+ }
+ } else {
+ ret = ret.concat(intArrayFromString('(null)'.substr(0, argLength), true));
+ }
+ if (flagLeftAlign) {
+ while (argLength < width--) {
+ ret.push(32);
+ }
+ }
+ break;
+ }
+ case 'c': {
+ // Character.
+ if (flagLeftAlign) ret.push(getNextArg('i8'));
+ while (--width > 0) {
+ ret.push(32);
+ }
+ if (!flagLeftAlign) ret.push(getNextArg('i8'));
+ break;
+ }
+ case 'n': {
+ // Write the length written so far to the next parameter.
+ var ptr = getNextArg('i32*');
+ HEAP32[((ptr)>>2)]=ret.length;
+ break;
+ }
+ case '%': {
+ // Literal percent sign.
+ ret.push(curr);
+ break;
+ }
+ default: {
+ // Unknown specifiers remain untouched.
+ for (var i = startTextIndex; i < textIndex + 2; i++) {
+ ret.push(HEAP8[(i)]);
+ }
+ }
+ }
+ textIndex += 2;
+ // TODO: Support a/A (hex float) and m (last error) specifiers.
+ // TODO: Support %1${specifier} for arg selection.
+ } else {
+ ret.push(curr);
+ textIndex += 1;
+ }
+ }
+ return ret;
+ }function _fprintf(stream, format, varargs) {
+ // int fprintf(FILE *restrict stream, const char *restrict format, ...);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
+ var result = __formatString(format, varargs);
+ var stack = Runtime.stackSave();
+ var ret = _fwrite(allocate(result, 'i8', ALLOC_STACK), 1, result.length, stream);
+ Runtime.stackRestore(stack);
+ return ret;
+ }
+
+ function _fgets(s, n, stream) {
+ // char *fgets(char *restrict s, int n, FILE *restrict stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fgets.html
+ var streamObj = FS.getStreamFromPtr(stream);
+ if (!streamObj) return 0;
+ if (streamObj.error || streamObj.eof) return 0;
+ var byte_;
+ for (var i = 0; i < n - 1 && byte_ != 10; i++) {
+ byte_ = _fgetc(stream);
+ if (byte_ == -1) {
+ if (streamObj.error || (streamObj.eof && i == 0)) return 0;
+ else if (streamObj.eof) break;
+ }
+ HEAP8[(((s)+(i))|0)]=byte_;
+ }
+ HEAP8[(((s)+(i))|0)]=0;
+ return s;
+ }
+
+ var _tan=Math_tan;
+
+ function _ispunct(chr) {
+ return (chr >= 33 && chr <= 47) ||
+ (chr >= 58 && chr <= 64) ||
+ (chr >= 91 && chr <= 96) ||
+ (chr >= 123 && chr <= 126);
+ }
+
+ function _feof(stream) {
+ // int feof(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/feof.html
+ stream = FS.getStreamFromPtr(stream);
+ return Number(stream && stream.eof);
+ }
+
+
+ Module["_tolower"] = _tolower;
+
+ var _asin=Math_asin;
+
+ function _clearerr(stream) {
+ // void clearerr(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/clearerr.html
+ stream = FS.getStreamFromPtr(stream);
+ if (!stream) {
+ return;
+ }
+ stream.eof = false;
+ stream.error = false;
+ }
+
+ var _fabs=Math_abs;
+
+ function _clock() {
+ if (_clock.start === undefined) _clock.start = Date.now();
+ return Math.floor((Date.now() - _clock.start) * (1000000/1000));
+ }
+
+
+ var _getc=_fgetc;
+
+ function _modf(x, intpart) {
+ HEAPF64[((intpart)>>3)]=Math.floor(x);
+ return x - HEAPF64[((intpart)>>3)];
+ }
+
+ var _sqrt=Math_sqrt;
+
+ function _isxdigit(chr) {
+ return (chr >= 48 && chr <= 57) ||
+ (chr >= 97 && chr <= 102) ||
+ (chr >= 65 && chr <= 70);
+ }
+
+ function _ftell(stream) {
+ // long ftell(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/ftell.html
+ stream = FS.getStreamFromPtr(stream);
+ if (!stream) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ if (FS.isChrdev(stream.node.mode)) {
+ ___setErrNo(ERRNO_CODES.ESPIPE);
+ return -1;
+ } else {
+ return stream.position;
+ }
+ }
+
+
+ function __exit(status) {
+ // void _exit(int status);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/exit.html
+ Module['exit'](status);
+ }function _exit(status) {
+ __exit(status);
+ }
+
+
+ function _snprintf(s, n, format, varargs) {
+ // int snprintf(char *restrict s, size_t n, const char *restrict format, ...);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
+ var result = __formatString(format, varargs);
+ var limit = (n === undefined) ? result.length
+ : Math.min(result.length, Math.max(n - 1, 0));
+ if (s < 0) {
+ s = -s;
+ var buf = _malloc(limit+1);
+ HEAP32[((s)>>2)]=buf;
+ s = buf;
+ }
+ for (var i = 0; i < limit; i++) {
+ HEAP8[(((s)+(i))|0)]=result[i];
+ }
+ if (limit < n || (n === undefined)) HEAP8[(((s)+(i))|0)]=0;
+ return result.length;
+ }function _sprintf(s, format, varargs) {
+ // int sprintf(char *restrict s, const char *restrict format, ...);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
+ return _snprintf(s, undefined, format, varargs);
+ }
+
+ var _emscripten_get_longjmp_result=true;
+
+ var _sin=Math_sin;
+
+
+ function _fmod(x, y) {
+ return x % y;
+ }var _fmodl=_fmod;
+
+
+
+ var _atan=Math_atan;
+
+ function _ferror(stream) {
+ // int ferror(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/ferror.html
+ stream = FS.getStreamFromPtr(stream);
+ return Number(stream && stream.error);
+ }
+
+ function _time(ptr) {
+ var ret = Math.floor(Date.now()/1000);
+ if (ptr) {
+ HEAP32[((ptr)>>2)]=ret;
+ }
+ return ret;
+ }
+
+ function _copysign(a, b) {
+ return __reallyNegative(a) === __reallyNegative(b) ? a : -a;
+ }
+
+
+ function _gmtime_r(time, tmPtr) {
+ var date = new Date(HEAP32[((time)>>2)]*1000);
+ HEAP32[((tmPtr)>>2)]=date.getUTCSeconds();
+ HEAP32[(((tmPtr)+(4))>>2)]=date.getUTCMinutes();
+ HEAP32[(((tmPtr)+(8))>>2)]=date.getUTCHours();
+ HEAP32[(((tmPtr)+(12))>>2)]=date.getUTCDate();
+ HEAP32[(((tmPtr)+(16))>>2)]=date.getUTCMonth();
+ HEAP32[(((tmPtr)+(20))>>2)]=date.getUTCFullYear()-1900;
+ HEAP32[(((tmPtr)+(24))>>2)]=date.getUTCDay();
+ HEAP32[(((tmPtr)+(36))>>2)]=0;
+ HEAP32[(((tmPtr)+(32))>>2)]=0;
+ var start = new Date(date); // define date using UTC, start from Jan 01 00:00:00 UTC
+ start.setUTCDate(1);
+ start.setUTCMonth(0);
+ start.setUTCHours(0);
+ start.setUTCMinutes(0);
+ start.setUTCSeconds(0);
+ start.setUTCMilliseconds(0);
+ var yday = Math.floor((date.getTime() - start.getTime()) / (1000 * 60 * 60 * 24));
+ HEAP32[(((tmPtr)+(28))>>2)]=yday;
+ HEAP32[(((tmPtr)+(40))>>2)]=___tm_timezone;
+
+ return tmPtr;
+ }function _gmtime(time) {
+ return _gmtime_r(time, ___tm_current);
+ }
+
+ function _isgraph(chr) {
+ return 0x20 < chr && chr < 0x7F;
+ }
+
+
+
+ function _strerror_r(errnum, strerrbuf, buflen) {
+ if (errnum in ERRNO_MESSAGES) {
+ if (ERRNO_MESSAGES[errnum].length > buflen - 1) {
+ return ___setErrNo(ERRNO_CODES.ERANGE);
+ } else {
+ var msg = ERRNO_MESSAGES[errnum];
+ writeAsciiToMemory(msg, strerrbuf);
+ return 0;
+ }
+ } else {
+ return ___setErrNo(ERRNO_CODES.EINVAL);
+ }
+ }function _strerror(errnum) {
+ if (!_strerror.buffer) _strerror.buffer = _malloc(256);
+ _strerror_r(errnum, _strerror.buffer, 256);
+ return _strerror.buffer;
+ }
+
+
+
+
+
+ var _environ=allocate(1, "i32*", ALLOC_STATIC);var ___environ=_environ;function ___buildEnvironment(env) {
+ // WARNING: Arbitrary limit!
+ var MAX_ENV_VALUES = 64;
+ var TOTAL_ENV_SIZE = 1024;
+
+ // Statically allocate memory for the environment.
+ var poolPtr;
+ var envPtr;
+ if (!___buildEnvironment.called) {
+ ___buildEnvironment.called = true;
+ // Set default values. Use string keys for Closure Compiler compatibility.
+ ENV['USER'] = 'root';
+ ENV['PATH'] = '/';
+ ENV['PWD'] = '/';
+ ENV['HOME'] = '/home/emscripten';
+ ENV['LANG'] = 'en_US.UTF-8';
+ ENV['_'] = './this.program';
+ // Allocate memory.
+ poolPtr = allocate(TOTAL_ENV_SIZE, 'i8', ALLOC_STATIC);
+ envPtr = allocate(MAX_ENV_VALUES * 4,
+ 'i8*', ALLOC_STATIC);
+ HEAP32[((envPtr)>>2)]=poolPtr;
+ HEAP32[((_environ)>>2)]=envPtr;
+ } else {
+ envPtr = HEAP32[((_environ)>>2)];
+ poolPtr = HEAP32[((envPtr)>>2)];
+ }
+
+ // Collect key=value lines.
+ var strings = [];
+ var totalSize = 0;
+ for (var key in env) {
+ if (typeof env[key] === 'string') {
+ var line = key + '=' + env[key];
+ strings.push(line);
+ totalSize += line.length;
+ }
+ }
+ if (totalSize > TOTAL_ENV_SIZE) {
+ throw new Error('Environment size exceeded TOTAL_ENV_SIZE!');
+ }
+
+ // Make new.
+ var ptrSize = 4;
+ for (var i = 0; i < strings.length; i++) {
+ var line = strings[i];
+ writeAsciiToMemory(line, poolPtr);
+ HEAP32[(((envPtr)+(i * ptrSize))>>2)]=poolPtr;
+ poolPtr += line.length + 1;
+ }
+ HEAP32[(((envPtr)+(strings.length * ptrSize))>>2)]=0;
+ }var ENV={};function _getenv(name) {
+ // char *getenv(const char *name);
+ // http://pubs.opengroup.org/onlinepubs/009695399/functions/getenv.html
+ if (name === 0) return 0;
+ name = Pointer_stringify(name);
+ if (!ENV.hasOwnProperty(name)) return 0;
+
+ if (_getenv.ret) _free(_getenv.ret);
+ _getenv.ret = allocate(intArrayFromString(ENV[name]), 'i8', ALLOC_NORMAL);
+ return _getenv.ret;
+ }
+
+ var _emscripten_setjmp=true;
+
+ var _cos=Math_cos;
+
+ function _isalnum(chr) {
+ return (chr >= 48 && chr <= 57) ||
+ (chr >= 97 && chr <= 122) ||
+ (chr >= 65 && chr <= 90);
+ }
+
+ var _BItoD=true;
+
+ function _difftime(time1, time0) {
+ return time1 - time0;
+ }
+
+ var _floor=Math_floor;
+
+ function _iscntrl(chr) {
+ return (0 <= chr && chr <= 0x1F) || chr === 0x7F;
+ }
+
+ var _atan2=Math_atan2;
+
+ function _setvbuf(stream, buf, type, size) {
+ // int setvbuf(FILE *restrict stream, char *restrict buf, int type, size_t size);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/setvbuf.html
+ // TODO: Implement custom buffering.
+ return 0;
+ }
+
+ var _exp=Math_exp;
+
+ var _copysignl=_copysign;
+
+ function _islower(chr) {
+ return chr >= 97 && chr <= 122;
+ }
+
+ var _acos=Math_acos;
+
+ function _isupper(chr) {
+ return chr >= 65 && chr <= 90;
+ }
+
+
+ function __isLeapYear(year) {
+ return year%4 === 0 && (year%100 !== 0 || year%400 === 0);
+ }
+
+ function __arraySum(array, index) {
+ var sum = 0;
+ for (var i = 0; i <= index; sum += array[i++]);
+ return sum;
+ }
+
+
+ var __MONTH_DAYS_LEAP=[31,29,31,30,31,30,31,31,30,31,30,31];
+
+ var __MONTH_DAYS_REGULAR=[31,28,31,30,31,30,31,31,30,31,30,31];function __addDays(date, days) {
+ var newDate = new Date(date.getTime());
+ while(days > 0) {
+ var leap = __isLeapYear(newDate.getFullYear());
+ var currentMonth = newDate.getMonth();
+ var daysInCurrentMonth = (leap ? __MONTH_DAYS_LEAP : __MONTH_DAYS_REGULAR)[currentMonth];
+
+ if (days > daysInCurrentMonth-newDate.getDate()) {
+ // we spill over to next month
+ days -= (daysInCurrentMonth-newDate.getDate()+1);
+ newDate.setDate(1);
+ if (currentMonth < 11) {
+ newDate.setMonth(currentMonth+1)
+ } else {
+ newDate.setMonth(0);
+ newDate.setFullYear(newDate.getFullYear()+1);
+ }
+ } else {
+ // we stay in current month
+ newDate.setDate(newDate.getDate()+days);
+ return newDate;
+ }
+ }
+
+ return newDate;
+ }function _strftime(s, maxsize, format, tm) {
+ // size_t strftime(char *restrict s, size_t maxsize, const char *restrict format, const struct tm *restrict timeptr);
+ // http://pubs.opengroup.org/onlinepubs/009695399/functions/strftime.html
+
+ var date = {
+ tm_sec: HEAP32[((tm)>>2)],
+ tm_min: HEAP32[(((tm)+(4))>>2)],
+ tm_hour: HEAP32[(((tm)+(8))>>2)],
+ tm_mday: HEAP32[(((tm)+(12))>>2)],
+ tm_mon: HEAP32[(((tm)+(16))>>2)],
+ tm_year: HEAP32[(((tm)+(20))>>2)],
+ tm_wday: HEAP32[(((tm)+(24))>>2)],
+ tm_yday: HEAP32[(((tm)+(28))>>2)],
+ tm_isdst: HEAP32[(((tm)+(32))>>2)]
+ };
+
+ var pattern = Pointer_stringify(format);
+
+ // expand format
+ var EXPANSION_RULES_1 = {
+ '%c': '%a %b %d %H:%M:%S %Y', // Replaced by the locale's appropriate date and time representation - e.g., Mon Aug 3 14:02:01 2013
+ '%D': '%m/%d/%y', // Equivalent to %m / %d / %y
+ '%F': '%Y-%m-%d', // Equivalent to %Y - %m - %d
+ '%h': '%b', // Equivalent to %b
+ '%r': '%I:%M:%S %p', // Replaced by the time in a.m. and p.m. notation
+ '%R': '%H:%M', // Replaced by the time in 24-hour notation
+ '%T': '%H:%M:%S', // Replaced by the time
+ '%x': '%m/%d/%y', // Replaced by the locale's appropriate date representation
+ '%X': '%H:%M:%S', // Replaced by the locale's appropriate date representation
+ };
+ for (var rule in EXPANSION_RULES_1) {
+ pattern = pattern.replace(new RegExp(rule, 'g'), EXPANSION_RULES_1[rule]);
+ }
+
+ var WEEKDAYS = ['Sunday', 'Monday', 'Tuesday', 'Wednesday', 'Thursday', 'Friday', 'Saturday'];
+ var MONTHS = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December'];
+
+ function leadingSomething(value, digits, character) {
+ var str = typeof value === 'number' ? value.toString() : (value || '');
+ while (str.length < digits) {
+ str = character[0]+str;
+ }
+ return str;
+ };
+
+ function leadingNulls(value, digits) {
+ return leadingSomething(value, digits, '0');
+ };
+
+ function compareByDay(date1, date2) {
+ function sgn(value) {
+ return value < 0 ? -1 : (value > 0 ? 1 : 0);
+ };
+
+ var compare;
+ if ((compare = sgn(date1.getFullYear()-date2.getFullYear())) === 0) {
+ if ((compare = sgn(date1.getMonth()-date2.getMonth())) === 0) {
+ compare = sgn(date1.getDate()-date2.getDate());
+ }
+ }
+ return compare;
+ };
+
+ function getFirstWeekStartDate(janFourth) {
+ switch (janFourth.getDay()) {
+ case 0: // Sunday
+ return new Date(janFourth.getFullYear()-1, 11, 29);
+ case 1: // Monday
+ return janFourth;
+ case 2: // Tuesday
+ return new Date(janFourth.getFullYear(), 0, 3);
+ case 3: // Wednesday
+ return new Date(janFourth.getFullYear(), 0, 2);
+ case 4: // Thursday
+ return new Date(janFourth.getFullYear(), 0, 1);
+ case 5: // Friday
+ return new Date(janFourth.getFullYear()-1, 11, 31);
+ case 6: // Saturday
+ return new Date(janFourth.getFullYear()-1, 11, 30);
+ }
+ };
+
+ function getWeekBasedYear(date) {
+ var thisDate = __addDays(new Date(date.tm_year+1900, 0, 1), date.tm_yday);
+
+ var janFourthThisYear = new Date(thisDate.getFullYear(), 0, 4);
+ var janFourthNextYear = new Date(thisDate.getFullYear()+1, 0, 4);
+
+ var firstWeekStartThisYear = getFirstWeekStartDate(janFourthThisYear);
+ var firstWeekStartNextYear = getFirstWeekStartDate(janFourthNextYear);
+
+ if (compareByDay(firstWeekStartThisYear, thisDate) <= 0) {
+ // this date is after the start of the first week of this year
+ if (compareByDay(firstWeekStartNextYear, thisDate) <= 0) {
+ return thisDate.getFullYear()+1;
+ } else {
+ return thisDate.getFullYear();
+ }
+ } else {
+ return thisDate.getFullYear()-1;
+ }
+ };
+
+ var EXPANSION_RULES_2 = {
+ '%a': function(date) {
+ return WEEKDAYS[date.tm_wday].substring(0,3);
+ },
+ '%A': function(date) {
+ return WEEKDAYS[date.tm_wday];
+ },
+ '%b': function(date) {
+ return MONTHS[date.tm_mon].substring(0,3);
+ },
+ '%B': function(date) {
+ return MONTHS[date.tm_mon];
+ },
+ '%C': function(date) {
+ var year = date.tm_year+1900;
+ return leadingNulls(Math.floor(year/100),2);
+ },
+ '%d': function(date) {
+ return leadingNulls(date.tm_mday, 2);
+ },
+ '%e': function(date) {
+ return leadingSomething(date.tm_mday, 2, ' ');
+ },
+ '%g': function(date) {
+ // %g, %G, and %V give values according to the ISO 8601:2000 standard week-based year.
+ // In this system, weeks begin on a Monday and week 1 of the year is the week that includes
+ // January 4th, which is also the week that includes the first Thursday of the year, and
+ // is also the first week that contains at least four days in the year.
+ // If the first Monday of January is the 2nd, 3rd, or 4th, the preceding days are part of
+ // the last week of the preceding year; thus, for Saturday 2nd January 1999,
+ // %G is replaced by 1998 and %V is replaced by 53. If December 29th, 30th,
+ // or 31st is a Monday, it and any following days are part of week 1 of the following year.
+ // Thus, for Tuesday 30th December 1997, %G is replaced by 1998 and %V is replaced by 01.
+
+ return getWeekBasedYear(date).toString().substring(2);
+ },
+ '%G': function(date) {
+ return getWeekBasedYear(date);
+ },
+ '%H': function(date) {
+ return leadingNulls(date.tm_hour, 2);
+ },
+ '%I': function(date) {
+ return leadingNulls(date.tm_hour < 13 ? date.tm_hour : date.tm_hour-12, 2);
+ },
+ '%j': function(date) {
+ // Day of the year (001-366)
+ return leadingNulls(date.tm_mday+__arraySum(__isLeapYear(date.tm_year+1900) ? __MONTH_DAYS_LEAP : __MONTH_DAYS_REGULAR, date.tm_mon-1), 3);
+ },
+ '%m': function(date) {
+ return leadingNulls(date.tm_mon+1, 2);
+ },
+ '%M': function(date) {
+ return leadingNulls(date.tm_min, 2);
+ },
+ '%n': function() {
+ return '\n';
+ },
+ '%p': function(date) {
+ if (date.tm_hour > 0 && date.tm_hour < 13) {
+ return 'AM';
+ } else {
+ return 'PM';
+ }
+ },
+ '%S': function(date) {
+ return leadingNulls(date.tm_sec, 2);
+ },
+ '%t': function() {
+ return '\t';
+ },
+ '%u': function(date) {
+ var day = new Date(date.tm_year+1900, date.tm_mon+1, date.tm_mday, 0, 0, 0, 0);
+ return day.getDay() || 7;
+ },
+ '%U': function(date) {
+ // Replaced by the week number of the year as a decimal number [00,53].
+ // The first Sunday of January is the first day of week 1;
+ // days in the new year before this are in week 0. [ tm_year, tm_wday, tm_yday]
+ var janFirst = new Date(date.tm_year+1900, 0, 1);
+ var firstSunday = janFirst.getDay() === 0 ? janFirst : __addDays(janFirst, 7-janFirst.getDay());
+ var endDate = new Date(date.tm_year+1900, date.tm_mon, date.tm_mday);
+
+ // is target date after the first Sunday?
+ if (compareByDay(firstSunday, endDate) < 0) {
+ // calculate difference in days between first Sunday and endDate
+ var februaryFirstUntilEndMonth = __arraySum(__isLeapYear(endDate.getFullYear()) ? __MONTH_DAYS_LEAP : __MONTH_DAYS_REGULAR, endDate.getMonth()-1)-31;
+ var firstSundayUntilEndJanuary = 31-firstSunday.getDate();
+ var days = firstSundayUntilEndJanuary+februaryFirstUntilEndMonth+endDate.getDate();
+ return leadingNulls(Math.ceil(days/7), 2);
+ }
+
+ return compareByDay(firstSunday, janFirst) === 0 ? '01': '00';
+ },
+ '%V': function(date) {
+ // Replaced by the week number of the year (Monday as the first day of the week)
+ // as a decimal number [01,53]. If the week containing 1 January has four
+ // or more days in the new year, then it is considered week 1.
+ // Otherwise, it is the last week of the previous year, and the next week is week 1.
+ // Both January 4th and the first Thursday of January are always in week 1. [ tm_year, tm_wday, tm_yday]
+ var janFourthThisYear = new Date(date.tm_year+1900, 0, 4);
+ var janFourthNextYear = new Date(date.tm_year+1901, 0, 4);
+
+ var firstWeekStartThisYear = getFirstWeekStartDate(janFourthThisYear);
+ var firstWeekStartNextYear = getFirstWeekStartDate(janFourthNextYear);
+
+ var endDate = __addDays(new Date(date.tm_year+1900, 0, 1), date.tm_yday);
+
+ if (compareByDay(endDate, firstWeekStartThisYear) < 0) {
+ // if given date is before this years first week, then it belongs to the 53rd week of last year
+ return '53';
+ }
+
+ if (compareByDay(firstWeekStartNextYear, endDate) <= 0) {
+ // if given date is after next years first week, then it belongs to the 01th week of next year
+ return '01';
+ }
+
+ // given date is in between CW 01..53 of this calendar year
+ var daysDifference;
+ if (firstWeekStartThisYear.getFullYear() < date.tm_year+1900) {
+ // first CW of this year starts last year
+ daysDifference = date.tm_yday+32-firstWeekStartThisYear.getDate()
+ } else {
+ // first CW of this year starts this year
+ daysDifference = date.tm_yday+1-firstWeekStartThisYear.getDate();
+ }
+ return leadingNulls(Math.ceil(daysDifference/7), 2);
+ },
+ '%w': function(date) {
+ var day = new Date(date.tm_year+1900, date.tm_mon+1, date.tm_mday, 0, 0, 0, 0);
+ return day.getDay();
+ },
+ '%W': function(date) {
+ // Replaced by the week number of the year as a decimal number [00,53].
+ // The first Monday of January is the first day of week 1;
+ // days in the new year before this are in week 0. [ tm_year, tm_wday, tm_yday]
+ var janFirst = new Date(date.tm_year, 0, 1);
+ var firstMonday = janFirst.getDay() === 1 ? janFirst : __addDays(janFirst, janFirst.getDay() === 0 ? 1 : 7-janFirst.getDay()+1);
+ var endDate = new Date(date.tm_year+1900, date.tm_mon, date.tm_mday);
+
+ // is target date after the first Monday?
+ if (compareByDay(firstMonday, endDate) < 0) {
+ var februaryFirstUntilEndMonth = __arraySum(__isLeapYear(endDate.getFullYear()) ? __MONTH_DAYS_LEAP : __MONTH_DAYS_REGULAR, endDate.getMonth()-1)-31;
+ var firstMondayUntilEndJanuary = 31-firstMonday.getDate();
+ var days = firstMondayUntilEndJanuary+februaryFirstUntilEndMonth+endDate.getDate();
+ return leadingNulls(Math.ceil(days/7), 2);
+ }
+ return compareByDay(firstMonday, janFirst) === 0 ? '01': '00';
+ },
+ '%y': function(date) {
+ // Replaced by the last two digits of the year as a decimal number [00,99]. [ tm_year]
+ return (date.tm_year+1900).toString().substring(2);
+ },
+ '%Y': function(date) {
+ // Replaced by the year as a decimal number (for example, 1997). [ tm_year]
+ return date.tm_year+1900;
+ },
+ '%z': function(date) {
+ // Replaced by the offset from UTC in the ISO 8601:2000 standard format ( +hhmm or -hhmm ),
+ // or by no characters if no timezone is determinable.
+ // For example, "-0430" means 4 hours 30 minutes behind UTC (west of Greenwich).
+ // If tm_isdst is zero, the standard time offset is used.
+ // If tm_isdst is greater than zero, the daylight savings time offset is used.
+ // If tm_isdst is negative, no characters are returned.
+ // FIXME: we cannot determine time zone (or can we?)
+ return '';
+ },
+ '%Z': function(date) {
+ // Replaced by the timezone name or abbreviation, or by no bytes if no timezone information exists. [ tm_isdst]
+ // FIXME: we cannot determine time zone (or can we?)
+ return '';
+ },
+ '%%': function() {
+ return '%';
+ }
+ };
+ for (var rule in EXPANSION_RULES_2) {
+ if (pattern.indexOf(rule) >= 0) {
+ pattern = pattern.replace(new RegExp(rule, 'g'), EXPANSION_RULES_2[rule](date));
+ }
+ }
+
+ var bytes = intArrayFromString(pattern, false);
+ if (bytes.length > maxsize) {
+ return 0;
+ }
+
+ writeArrayToMemory(bytes, s);
+ return bytes.length-1;
+ }
+
+
+
+FS.staticInit();__ATINIT__.unshift({ func: function() { if (!Module["noFSInit"] && !FS.init.initialized) FS.init() } });__ATMAIN__.push({ func: function() { FS.ignorePermissions = false } });__ATEXIT__.push({ func: function() { FS.quit() } });Module["FS_createFolder"] = FS.createFolder;Module["FS_createPath"] = FS.createPath;Module["FS_createDataFile"] = FS.createDataFile;Module["FS_createPreloadedFile"] = FS.createPreloadedFile;Module["FS_createLazyFile"] = FS.createLazyFile;Module["FS_createLink"] = FS.createLink;Module["FS_createDevice"] = FS.createDevice;
+___errno_state = Runtime.staticAlloc(4); HEAP32[((___errno_state)>>2)]=0;
+__ATINIT__.unshift({ func: function() { TTY.init() } });__ATEXIT__.push({ func: function() { TTY.shutdown() } });TTY.utf8 = new Runtime.UTF8Processor();
+if (ENVIRONMENT_IS_NODE) { var fs = require("fs"); NODEFS.staticInit(); }
+__ATINIT__.push({ func: function() { SOCKFS.root = FS.mount(SOCKFS, {}, null); } });
+_fputc.ret = allocate([0], "i8", ALLOC_STATIC);
+Module["requestFullScreen"] = function Module_requestFullScreen(lockPointer, resizeCanvas) { Browser.requestFullScreen(lockPointer, resizeCanvas) };
+ Module["requestAnimationFrame"] = function Module_requestAnimationFrame(func) { Browser.requestAnimationFrame(func) };
+ Module["setCanvasSize"] = function Module_setCanvasSize(width, height, noUpdates) { Browser.setCanvasSize(width, height, noUpdates) };
+ Module["pauseMainLoop"] = function Module_pauseMainLoop() { Browser.mainLoop.pause() };
+ Module["resumeMainLoop"] = function Module_resumeMainLoop() { Browser.mainLoop.resume() };
+ Module["getUserMedia"] = function Module_getUserMedia() { Browser.getUserMedia() }
+_fgetc.ret = allocate([0], "i8", ALLOC_STATIC);
+___buildEnvironment(ENV);
+STACK_BASE = STACKTOP = Runtime.alignMemory(STATICTOP);
+
+staticSealed = true; // seal the static portion of memory
+
+STACK_MAX = STACK_BASE + 5242880;
+
+DYNAMIC_BASE = DYNAMICTOP = Runtime.alignMemory(STACK_MAX);
+
+assert(DYNAMIC_BASE < TOTAL_MEMORY, "TOTAL_MEMORY not big enough for stack");
+
+ var ctlz_i8 = allocate([8,7,6,6,5,5,5,5,4,4,4,4,4,4,4,4,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], "i8", ALLOC_DYNAMIC);
+ var cttz_i8 = allocate([8,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,5,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,6,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,5,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,7,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,5,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,6,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,5,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0], "i8", ALLOC_DYNAMIC);
+
+var Math_min = Math.min;
+function invoke_iiii(index,a1,a2,a3) {
+ try {
+ return Module["dynCall_iiii"](index,a1,a2,a3);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function invoke_vi(index,a1) {
+ try {
+ Module["dynCall_vi"](index,a1);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function invoke_vii(index,a1,a2) {
+ try {
+ Module["dynCall_vii"](index,a1,a2);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function invoke_ii(index,a1) {
+ try {
+ return Module["dynCall_ii"](index,a1);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function invoke_iiiii(index,a1,a2,a3,a4) {
+ try {
+ return Module["dynCall_iiiii"](index,a1,a2,a3,a4);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function invoke_iii(index,a1,a2) {
+ try {
+ return Module["dynCall_iii"](index,a1,a2);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function asmPrintInt(x, y) {
+ Module.print('int ' + x + ',' + y);// + ' ' + new Error().stack);
+}
+function asmPrintFloat(x, y) {
+ Module.print('float ' + x + ',' + y);// + ' ' + new Error().stack);
+}
+// EMSCRIPTEN_START_ASM
+var asm = Wasm.instantiateModuleFromAsm((function Module(global, env, buffer) {
+ 'use asm';
+ var HEAP8 = new global.Int8Array(buffer);
+ var HEAP16 = new global.Int16Array(buffer);
+ var HEAP32 = new global.Int32Array(buffer);
+ var HEAPU8 = new global.Uint8Array(buffer);
+ var HEAPU16 = new global.Uint16Array(buffer);
+ var HEAPU32 = new global.Uint32Array(buffer);
+ var HEAPF32 = new global.Float32Array(buffer);
+ var HEAPF64 = new global.Float64Array(buffer);
+
+ var STACKTOP=env.STACKTOP|0;
+ var STACK_MAX=env.STACK_MAX|0;
+ var tempDoublePtr=env.tempDoublePtr|0;
+ var ABORT=env.ABORT|0;
+ var cttz_i8=env.cttz_i8|0;
+ var ctlz_i8=env.ctlz_i8|0;
+ var ___rand_seed=env.___rand_seed|0;
+ var _stderr=env._stderr|0;
+ var _stdin=env._stdin|0;
+ var _stdout=env._stdout|0;
+
+ var __THREW__ = 0;
+ var threwValue = 0;
+ var setjmpId = 0;
+ var undef = 0;
+ var nan = +env.NaN, inf = +env.Infinity;
+ var tempInt = 0, tempBigInt = 0, tempBigIntP = 0, tempBigIntS = 0, tempBigIntR = 0.0, tempBigIntI = 0, tempBigIntD = 0, tempValue = 0, tempDouble = 0.0;
+
+ var tempRet0 = 0;
+ var tempRet1 = 0;
+ var tempRet2 = 0;
+ var tempRet3 = 0;
+ var tempRet4 = 0;
+ var tempRet5 = 0;
+ var tempRet6 = 0;
+ var tempRet7 = 0;
+ var tempRet8 = 0;
+ var tempRet9 = 0;
+ var Math_floor=global.Math.floor;
+ var Math_abs=global.Math.abs;
+ var Math_sqrt=global.Math.sqrt;
+ var Math_pow=global.Math.pow;
+ var Math_cos=global.Math.cos;
+ var Math_sin=global.Math.sin;
+ var Math_tan=global.Math.tan;
+ var Math_acos=global.Math.acos;
+ var Math_asin=global.Math.asin;
+ var Math_atan=global.Math.atan;
+ var Math_atan2=global.Math.atan2;
+ var Math_exp=global.Math.exp;
+ var Math_log=global.Math.log;
+ var Math_ceil=global.Math.ceil;
+ var Math_imul=global.Math.imul;
+ var abort=env.abort;
+ var assert=env.assert;
+ var asmPrintInt=env.asmPrintInt;
+ var asmPrintFloat=env.asmPrintFloat;
+ var Math_min=env.min;
+ var invoke_iiii=env.invoke_iiii;
+ var invoke_vi=env.invoke_vi;
+ var invoke_vii=env.invoke_vii;
+ var invoke_ii=env.invoke_ii;
+ var invoke_iiiii=env.invoke_iiiii;
+ var invoke_iii=env.invoke_iii;
+ var _isalnum=env._isalnum;
+ var _fabs=env._fabs;
+ var _frexp=env._frexp;
+ var _exp=env._exp;
+ var _fread=env._fread;
+ var __reallyNegative=env.__reallyNegative;
+ var _longjmp=env._longjmp;
+ var __addDays=env.__addDays;
+ var _fsync=env._fsync;
+ var _signal=env._signal;
+ var _rename=env._rename;
+ var _sbrk=env._sbrk;
+ var _emscripten_memcpy_big=env._emscripten_memcpy_big;
+ var _sinh=env._sinh;
+ var _sysconf=env._sysconf;
+ var _close=env._close;
+ var _ferror=env._ferror;
+ var _clock=env._clock;
+ var _cos=env._cos;
+ var _tanh=env._tanh;
+ var _unlink=env._unlink;
+ var _write=env._write;
+ var __isLeapYear=env.__isLeapYear;
+ var _ftell=env._ftell;
+ var _isupper=env._isupper;
+ var _gmtime_r=env._gmtime_r;
+ var _islower=env._islower;
+ var _tmpnam=env._tmpnam;
+ var _tmpfile=env._tmpfile;
+ var _send=env._send;
+ var _abort=env._abort;
+ var _setvbuf=env._setvbuf;
+ var _atan2=env._atan2;
+ var _setlocale=env._setlocale;
+ var _isgraph=env._isgraph;
+ var _modf=env._modf;
+ var _strerror_r=env._strerror_r;
+ var _fscanf=env._fscanf;
+ var ___setErrNo=env.___setErrNo;
+ var _isalpha=env._isalpha;
+ var _srand=env._srand;
+ var _mktime=env._mktime;
+ var _putchar=env._putchar;
+ var _gmtime=env._gmtime;
+ var _localeconv=env._localeconv;
+ var _sprintf=env._sprintf;
+ var _localtime=env._localtime;
+ var _read=env._read;
+ var _fwrite=env._fwrite;
+ var _time=env._time;
+ var _fprintf=env._fprintf;
+ var _exit=env._exit;
+ var _freopen=env._freopen;
+ var _llvm_pow_f64=env._llvm_pow_f64;
+ var _fgetc=env._fgetc;
+ var _fmod=env._fmod;
+ var _lseek=env._lseek;
+ var _rmdir=env._rmdir;
+ var _asin=env._asin;
+ var _floor=env._floor;
+ var _pwrite=env._pwrite;
+ var _localtime_r=env._localtime_r;
+ var _tzset=env._tzset;
+ var _open=env._open;
+ var _remove=env._remove;
+ var _snprintf=env._snprintf;
+ var __scanString=env.__scanString;
+ var _strftime=env._strftime;
+ var _fseek=env._fseek;
+ var _iscntrl=env._iscntrl;
+ var _isxdigit=env._isxdigit;
+ var _fclose=env._fclose;
+ var _log=env._log;
+ var _recv=env._recv;
+ var _tan=env._tan;
+ var _copysign=env._copysign;
+ var __getFloat=env.__getFloat;
+ var _fputc=env._fputc;
+ var _ispunct=env._ispunct;
+ var _ceil=env._ceil;
+ var _isspace=env._isspace;
+ var _fopen=env._fopen;
+ var _sin=env._sin;
+ var _acos=env._acos;
+ var _cosh=env._cosh;
+ var ___buildEnvironment=env.___buildEnvironment;
+ var _difftime=env._difftime;
+ var _ungetc=env._ungetc;
+ var _system=env._system;
+ var _fflush=env._fflush;
+ var _log10=env._log10;
+ var _fileno=env._fileno;
+ var __exit=env.__exit;
+ var __arraySum=env.__arraySum;
+ var _fgets=env._fgets;
+ var _atan=env._atan;
+ var _pread=env._pread;
+ var _mkport=env._mkport;
+ var _toupper=env._toupper;
+ var _feof=env._feof;
+ var ___errno_location=env.___errno_location;
+ var _clearerr=env._clearerr;
+ var _getenv=env._getenv;
+ var _strerror=env._strerror;
+ var _emscripten_longjmp=env._emscripten_longjmp;
+ var __formatString=env.__formatString;
+ var _fputs=env._fputs;
+ var _sqrt=env._sqrt;
+ var tempFloat = 0.0;
+
+// EMSCRIPTEN_START_FUNCS
+function _malloc(i12) {
+ i12 = i12 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0, i30 = 0, i31 = 0, i32 = 0;
+ i1 = STACKTOP;
+ do {
+ if (i12 >>> 0 < 245) {
+ if (i12 >>> 0 < 11) {
+ i12 = 16;
+ } else {
+ i12 = i12 + 11 & -8;
+ }
+ i20 = i12 >>> 3;
+ i18 = HEAP32[3228] | 0;
+ i21 = i18 >>> i20;
+ if ((i21 & 3 | 0) != 0) {
+ i6 = (i21 & 1 ^ 1) + i20 | 0;
+ i5 = i6 << 1;
+ i3 = 12952 + (i5 << 2) | 0;
+ i5 = 12952 + (i5 + 2 << 2) | 0;
+ i7 = HEAP32[i5 >> 2] | 0;
+ i2 = i7 + 8 | 0;
+ i4 = HEAP32[i2 >> 2] | 0;
+ do {
+ if ((i3 | 0) != (i4 | 0)) {
+ if (i4 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i8 = i4 + 12 | 0;
+ if ((HEAP32[i8 >> 2] | 0) == (i7 | 0)) {
+ HEAP32[i8 >> 2] = i3;
+ HEAP32[i5 >> 2] = i4;
+ break;
+ } else {
+ _abort();
+ }
+ } else {
+ HEAP32[3228] = i18 & ~(1 << i6);
+ }
+ } while (0);
+ i32 = i6 << 3;
+ HEAP32[i7 + 4 >> 2] = i32 | 3;
+ i32 = i7 + (i32 | 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ i32 = i2;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ if (i12 >>> 0 > (HEAP32[12920 >> 2] | 0) >>> 0) {
+ if ((i21 | 0) != 0) {
+ i7 = 2 << i20;
+ i7 = i21 << i20 & (i7 | 0 - i7);
+ i7 = (i7 & 0 - i7) + -1 | 0;
+ i2 = i7 >>> 12 & 16;
+ i7 = i7 >>> i2;
+ i6 = i7 >>> 5 & 8;
+ i7 = i7 >>> i6;
+ i5 = i7 >>> 2 & 4;
+ i7 = i7 >>> i5;
+ i4 = i7 >>> 1 & 2;
+ i7 = i7 >>> i4;
+ i3 = i7 >>> 1 & 1;
+ i3 = (i6 | i2 | i5 | i4 | i3) + (i7 >>> i3) | 0;
+ i7 = i3 << 1;
+ i4 = 12952 + (i7 << 2) | 0;
+ i7 = 12952 + (i7 + 2 << 2) | 0;
+ i5 = HEAP32[i7 >> 2] | 0;
+ i2 = i5 + 8 | 0;
+ i6 = HEAP32[i2 >> 2] | 0;
+ do {
+ if ((i4 | 0) != (i6 | 0)) {
+ if (i6 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i8 = i6 + 12 | 0;
+ if ((HEAP32[i8 >> 2] | 0) == (i5 | 0)) {
+ HEAP32[i8 >> 2] = i4;
+ HEAP32[i7 >> 2] = i6;
+ break;
+ } else {
+ _abort();
+ }
+ } else {
+ HEAP32[3228] = i18 & ~(1 << i3);
+ }
+ } while (0);
+ i6 = i3 << 3;
+ i4 = i6 - i12 | 0;
+ HEAP32[i5 + 4 >> 2] = i12 | 3;
+ i3 = i5 + i12 | 0;
+ HEAP32[i5 + (i12 | 4) >> 2] = i4 | 1;
+ HEAP32[i5 + i6 >> 2] = i4;
+ i6 = HEAP32[12920 >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ i5 = HEAP32[12932 >> 2] | 0;
+ i8 = i6 >>> 3;
+ i9 = i8 << 1;
+ i6 = 12952 + (i9 << 2) | 0;
+ i7 = HEAP32[3228] | 0;
+ i8 = 1 << i8;
+ if ((i7 & i8 | 0) != 0) {
+ i7 = 12952 + (i9 + 2 << 2) | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ if (i8 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i28 = i7;
+ i27 = i8;
+ }
+ } else {
+ HEAP32[3228] = i7 | i8;
+ i28 = 12952 + (i9 + 2 << 2) | 0;
+ i27 = i6;
+ }
+ HEAP32[i28 >> 2] = i5;
+ HEAP32[i27 + 12 >> 2] = i5;
+ HEAP32[i5 + 8 >> 2] = i27;
+ HEAP32[i5 + 12 >> 2] = i6;
+ }
+ HEAP32[12920 >> 2] = i4;
+ HEAP32[12932 >> 2] = i3;
+ i32 = i2;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i18 = HEAP32[12916 >> 2] | 0;
+ if ((i18 | 0) != 0) {
+ i2 = (i18 & 0 - i18) + -1 | 0;
+ i31 = i2 >>> 12 & 16;
+ i2 = i2 >>> i31;
+ i30 = i2 >>> 5 & 8;
+ i2 = i2 >>> i30;
+ i32 = i2 >>> 2 & 4;
+ i2 = i2 >>> i32;
+ i6 = i2 >>> 1 & 2;
+ i2 = i2 >>> i6;
+ i3 = i2 >>> 1 & 1;
+ i3 = HEAP32[13216 + ((i30 | i31 | i32 | i6 | i3) + (i2 >>> i3) << 2) >> 2] | 0;
+ i2 = (HEAP32[i3 + 4 >> 2] & -8) - i12 | 0;
+ i6 = i3;
+ while (1) {
+ i5 = HEAP32[i6 + 16 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ i5 = HEAP32[i6 + 20 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ }
+ i6 = (HEAP32[i5 + 4 >> 2] & -8) - i12 | 0;
+ i4 = i6 >>> 0 < i2 >>> 0;
+ i2 = i4 ? i6 : i2;
+ i6 = i5;
+ i3 = i4 ? i5 : i3;
+ }
+ i6 = HEAP32[12928 >> 2] | 0;
+ if (i3 >>> 0 < i6 >>> 0) {
+ _abort();
+ }
+ i4 = i3 + i12 | 0;
+ if (!(i3 >>> 0 < i4 >>> 0)) {
+ _abort();
+ }
+ i5 = HEAP32[i3 + 24 >> 2] | 0;
+ i7 = HEAP32[i3 + 12 >> 2] | 0;
+ do {
+ if ((i7 | 0) == (i3 | 0)) {
+ i8 = i3 + 20 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ if ((i7 | 0) == 0) {
+ i8 = i3 + 16 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ if ((i7 | 0) == 0) {
+ i26 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i10 = i7 + 20 | 0;
+ i9 = HEAP32[i10 >> 2] | 0;
+ if ((i9 | 0) != 0) {
+ i7 = i9;
+ i8 = i10;
+ continue;
+ }
+ i10 = i7 + 16 | 0;
+ i9 = HEAP32[i10 >> 2] | 0;
+ if ((i9 | 0) == 0) {
+ break;
+ } else {
+ i7 = i9;
+ i8 = i10;
+ }
+ }
+ if (i8 >>> 0 < i6 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i8 >> 2] = 0;
+ i26 = i7;
+ break;
+ }
+ } else {
+ i8 = HEAP32[i3 + 8 >> 2] | 0;
+ if (i8 >>> 0 < i6 >>> 0) {
+ _abort();
+ }
+ i6 = i8 + 12 | 0;
+ if ((HEAP32[i6 >> 2] | 0) != (i3 | 0)) {
+ _abort();
+ }
+ i9 = i7 + 8 | 0;
+ if ((HEAP32[i9 >> 2] | 0) == (i3 | 0)) {
+ HEAP32[i6 >> 2] = i7;
+ HEAP32[i9 >> 2] = i8;
+ i26 = i7;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ do {
+ if ((i5 | 0) != 0) {
+ i7 = HEAP32[i3 + 28 >> 2] | 0;
+ i6 = 13216 + (i7 << 2) | 0;
+ if ((i3 | 0) == (HEAP32[i6 >> 2] | 0)) {
+ HEAP32[i6 >> 2] = i26;
+ if ((i26 | 0) == 0) {
+ HEAP32[12916 >> 2] = HEAP32[12916 >> 2] & ~(1 << i7);
+ break;
+ }
+ } else {
+ if (i5 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i6 = i5 + 16 | 0;
+ if ((HEAP32[i6 >> 2] | 0) == (i3 | 0)) {
+ HEAP32[i6 >> 2] = i26;
+ } else {
+ HEAP32[i5 + 20 >> 2] = i26;
+ }
+ if ((i26 | 0) == 0) {
+ break;
+ }
+ }
+ if (i26 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i26 + 24 >> 2] = i5;
+ i5 = HEAP32[i3 + 16 >> 2] | 0;
+ do {
+ if ((i5 | 0) != 0) {
+ if (i5 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i26 + 16 >> 2] = i5;
+ HEAP32[i5 + 24 >> 2] = i26;
+ break;
+ }
+ }
+ } while (0);
+ i5 = HEAP32[i3 + 20 >> 2] | 0;
+ if ((i5 | 0) != 0) {
+ if (i5 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i26 + 20 >> 2] = i5;
+ HEAP32[i5 + 24 >> 2] = i26;
+ break;
+ }
+ }
+ }
+ } while (0);
+ if (i2 >>> 0 < 16) {
+ i32 = i2 + i12 | 0;
+ HEAP32[i3 + 4 >> 2] = i32 | 3;
+ i32 = i3 + (i32 + 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ } else {
+ HEAP32[i3 + 4 >> 2] = i12 | 3;
+ HEAP32[i3 + (i12 | 4) >> 2] = i2 | 1;
+ HEAP32[i3 + (i2 + i12) >> 2] = i2;
+ i6 = HEAP32[12920 >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ i5 = HEAP32[12932 >> 2] | 0;
+ i8 = i6 >>> 3;
+ i9 = i8 << 1;
+ i6 = 12952 + (i9 << 2) | 0;
+ i7 = HEAP32[3228] | 0;
+ i8 = 1 << i8;
+ if ((i7 & i8 | 0) != 0) {
+ i7 = 12952 + (i9 + 2 << 2) | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ if (i8 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i25 = i7;
+ i24 = i8;
+ }
+ } else {
+ HEAP32[3228] = i7 | i8;
+ i25 = 12952 + (i9 + 2 << 2) | 0;
+ i24 = i6;
+ }
+ HEAP32[i25 >> 2] = i5;
+ HEAP32[i24 + 12 >> 2] = i5;
+ HEAP32[i5 + 8 >> 2] = i24;
+ HEAP32[i5 + 12 >> 2] = i6;
+ }
+ HEAP32[12920 >> 2] = i2;
+ HEAP32[12932 >> 2] = i4;
+ }
+ i32 = i3 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ }
+ } else {
+ if (!(i12 >>> 0 > 4294967231)) {
+ i24 = i12 + 11 | 0;
+ i12 = i24 & -8;
+ i26 = HEAP32[12916 >> 2] | 0;
+ if ((i26 | 0) != 0) {
+ i25 = 0 - i12 | 0;
+ i24 = i24 >>> 8;
+ if ((i24 | 0) != 0) {
+ if (i12 >>> 0 > 16777215) {
+ i27 = 31;
+ } else {
+ i31 = (i24 + 1048320 | 0) >>> 16 & 8;
+ i32 = i24 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i27 = (i32 + 245760 | 0) >>> 16 & 2;
+ i27 = 14 - (i30 | i31 | i27) + (i32 << i27 >>> 15) | 0;
+ i27 = i12 >>> (i27 + 7 | 0) & 1 | i27 << 1;
+ }
+ } else {
+ i27 = 0;
+ }
+ i30 = HEAP32[13216 + (i27 << 2) >> 2] | 0;
+ L126 : do {
+ if ((i30 | 0) == 0) {
+ i29 = 0;
+ i24 = 0;
+ } else {
+ if ((i27 | 0) == 31) {
+ i24 = 0;
+ } else {
+ i24 = 25 - (i27 >>> 1) | 0;
+ }
+ i29 = 0;
+ i28 = i12 << i24;
+ i24 = 0;
+ while (1) {
+ i32 = HEAP32[i30 + 4 >> 2] & -8;
+ i31 = i32 - i12 | 0;
+ if (i31 >>> 0 < i25 >>> 0) {
+ if ((i32 | 0) == (i12 | 0)) {
+ i25 = i31;
+ i29 = i30;
+ i24 = i30;
+ break L126;
+ } else {
+ i25 = i31;
+ i24 = i30;
+ }
+ }
+ i31 = HEAP32[i30 + 20 >> 2] | 0;
+ i30 = HEAP32[i30 + (i28 >>> 31 << 2) + 16 >> 2] | 0;
+ i29 = (i31 | 0) == 0 | (i31 | 0) == (i30 | 0) ? i29 : i31;
+ if ((i30 | 0) == 0) {
+ break;
+ } else {
+ i28 = i28 << 1;
+ }
+ }
+ }
+ } while (0);
+ if ((i29 | 0) == 0 & (i24 | 0) == 0) {
+ i32 = 2 << i27;
+ i26 = i26 & (i32 | 0 - i32);
+ if ((i26 | 0) == 0) {
+ break;
+ }
+ i32 = (i26 & 0 - i26) + -1 | 0;
+ i28 = i32 >>> 12 & 16;
+ i32 = i32 >>> i28;
+ i27 = i32 >>> 5 & 8;
+ i32 = i32 >>> i27;
+ i30 = i32 >>> 2 & 4;
+ i32 = i32 >>> i30;
+ i31 = i32 >>> 1 & 2;
+ i32 = i32 >>> i31;
+ i29 = i32 >>> 1 & 1;
+ i29 = HEAP32[13216 + ((i27 | i28 | i30 | i31 | i29) + (i32 >>> i29) << 2) >> 2] | 0;
+ }
+ if ((i29 | 0) != 0) {
+ while (1) {
+ i27 = (HEAP32[i29 + 4 >> 2] & -8) - i12 | 0;
+ i26 = i27 >>> 0 < i25 >>> 0;
+ i25 = i26 ? i27 : i25;
+ i24 = i26 ? i29 : i24;
+ i26 = HEAP32[i29 + 16 >> 2] | 0;
+ if ((i26 | 0) != 0) {
+ i29 = i26;
+ continue;
+ }
+ i29 = HEAP32[i29 + 20 >> 2] | 0;
+ if ((i29 | 0) == 0) {
+ break;
+ }
+ }
+ }
+ if ((i24 | 0) != 0 ? i25 >>> 0 < ((HEAP32[12920 >> 2] | 0) - i12 | 0) >>> 0 : 0) {
+ i4 = HEAP32[12928 >> 2] | 0;
+ if (i24 >>> 0 < i4 >>> 0) {
+ _abort();
+ }
+ i2 = i24 + i12 | 0;
+ if (!(i24 >>> 0 < i2 >>> 0)) {
+ _abort();
+ }
+ i3 = HEAP32[i24 + 24 >> 2] | 0;
+ i6 = HEAP32[i24 + 12 >> 2] | 0;
+ do {
+ if ((i6 | 0) == (i24 | 0)) {
+ i6 = i24 + 20 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ i6 = i24 + 16 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ i22 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i8 = i5 + 20 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ if ((i7 | 0) != 0) {
+ i5 = i7;
+ i6 = i8;
+ continue;
+ }
+ i7 = i5 + 16 | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ if ((i8 | 0) == 0) {
+ break;
+ } else {
+ i5 = i8;
+ i6 = i7;
+ }
+ }
+ if (i6 >>> 0 < i4 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i6 >> 2] = 0;
+ i22 = i5;
+ break;
+ }
+ } else {
+ i5 = HEAP32[i24 + 8 >> 2] | 0;
+ if (i5 >>> 0 < i4 >>> 0) {
+ _abort();
+ }
+ i7 = i5 + 12 | 0;
+ if ((HEAP32[i7 >> 2] | 0) != (i24 | 0)) {
+ _abort();
+ }
+ i4 = i6 + 8 | 0;
+ if ((HEAP32[i4 >> 2] | 0) == (i24 | 0)) {
+ HEAP32[i7 >> 2] = i6;
+ HEAP32[i4 >> 2] = i5;
+ i22 = i6;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ do {
+ if ((i3 | 0) != 0) {
+ i4 = HEAP32[i24 + 28 >> 2] | 0;
+ i5 = 13216 + (i4 << 2) | 0;
+ if ((i24 | 0) == (HEAP32[i5 >> 2] | 0)) {
+ HEAP32[i5 >> 2] = i22;
+ if ((i22 | 0) == 0) {
+ HEAP32[12916 >> 2] = HEAP32[12916 >> 2] & ~(1 << i4);
+ break;
+ }
+ } else {
+ if (i3 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i4 = i3 + 16 | 0;
+ if ((HEAP32[i4 >> 2] | 0) == (i24 | 0)) {
+ HEAP32[i4 >> 2] = i22;
+ } else {
+ HEAP32[i3 + 20 >> 2] = i22;
+ }
+ if ((i22 | 0) == 0) {
+ break;
+ }
+ }
+ if (i22 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i22 + 24 >> 2] = i3;
+ i3 = HEAP32[i24 + 16 >> 2] | 0;
+ do {
+ if ((i3 | 0) != 0) {
+ if (i3 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i22 + 16 >> 2] = i3;
+ HEAP32[i3 + 24 >> 2] = i22;
+ break;
+ }
+ }
+ } while (0);
+ i3 = HEAP32[i24 + 20 >> 2] | 0;
+ if ((i3 | 0) != 0) {
+ if (i3 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i22 + 20 >> 2] = i3;
+ HEAP32[i3 + 24 >> 2] = i22;
+ break;
+ }
+ }
+ }
+ } while (0);
+ L204 : do {
+ if (!(i25 >>> 0 < 16)) {
+ HEAP32[i24 + 4 >> 2] = i12 | 3;
+ HEAP32[i24 + (i12 | 4) >> 2] = i25 | 1;
+ HEAP32[i24 + (i25 + i12) >> 2] = i25;
+ i4 = i25 >>> 3;
+ if (i25 >>> 0 < 256) {
+ i6 = i4 << 1;
+ i3 = 12952 + (i6 << 2) | 0;
+ i5 = HEAP32[3228] | 0;
+ i4 = 1 << i4;
+ if ((i5 & i4 | 0) != 0) {
+ i5 = 12952 + (i6 + 2 << 2) | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ if (i4 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i21 = i5;
+ i20 = i4;
+ }
+ } else {
+ HEAP32[3228] = i5 | i4;
+ i21 = 12952 + (i6 + 2 << 2) | 0;
+ i20 = i3;
+ }
+ HEAP32[i21 >> 2] = i2;
+ HEAP32[i20 + 12 >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i20;
+ HEAP32[i24 + (i12 + 12) >> 2] = i3;
+ break;
+ }
+ i3 = i25 >>> 8;
+ if ((i3 | 0) != 0) {
+ if (i25 >>> 0 > 16777215) {
+ i3 = 31;
+ } else {
+ i31 = (i3 + 1048320 | 0) >>> 16 & 8;
+ i32 = i3 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i3 = (i32 + 245760 | 0) >>> 16 & 2;
+ i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
+ i3 = i25 >>> (i3 + 7 | 0) & 1 | i3 << 1;
+ }
+ } else {
+ i3 = 0;
+ }
+ i6 = 13216 + (i3 << 2) | 0;
+ HEAP32[i24 + (i12 + 28) >> 2] = i3;
+ HEAP32[i24 + (i12 + 20) >> 2] = 0;
+ HEAP32[i24 + (i12 + 16) >> 2] = 0;
+ i4 = HEAP32[12916 >> 2] | 0;
+ i5 = 1 << i3;
+ if ((i4 & i5 | 0) == 0) {
+ HEAP32[12916 >> 2] = i4 | i5;
+ HEAP32[i6 >> 2] = i2;
+ HEAP32[i24 + (i12 + 24) >> 2] = i6;
+ HEAP32[i24 + (i12 + 12) >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i2;
+ break;
+ }
+ i4 = HEAP32[i6 >> 2] | 0;
+ if ((i3 | 0) == 31) {
+ i3 = 0;
+ } else {
+ i3 = 25 - (i3 >>> 1) | 0;
+ }
+ L225 : do {
+ if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i25 | 0)) {
+ i3 = i25 << i3;
+ while (1) {
+ i6 = i4 + (i3 >>> 31 << 2) + 16 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) == (i25 | 0)) {
+ i18 = i5;
+ break L225;
+ } else {
+ i3 = i3 << 1;
+ i4 = i5;
+ }
+ }
+ if (i6 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i6 >> 2] = i2;
+ HEAP32[i24 + (i12 + 24) >> 2] = i4;
+ HEAP32[i24 + (i12 + 12) >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i2;
+ break L204;
+ }
+ } else {
+ i18 = i4;
+ }
+ } while (0);
+ i4 = i18 + 8 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ i5 = HEAP32[12928 >> 2] | 0;
+ if (i18 >>> 0 < i5 >>> 0) {
+ _abort();
+ }
+ if (i3 >>> 0 < i5 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i3 + 12 >> 2] = i2;
+ HEAP32[i4 >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i3;
+ HEAP32[i24 + (i12 + 12) >> 2] = i18;
+ HEAP32[i24 + (i12 + 24) >> 2] = 0;
+ break;
+ }
+ } else {
+ i32 = i25 + i12 | 0;
+ HEAP32[i24 + 4 >> 2] = i32 | 3;
+ i32 = i24 + (i32 + 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ }
+ } while (0);
+ i32 = i24 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ }
+ } else {
+ i12 = -1;
+ }
+ }
+ } while (0);
+ i18 = HEAP32[12920 >> 2] | 0;
+ if (!(i12 >>> 0 > i18 >>> 0)) {
+ i3 = i18 - i12 | 0;
+ i2 = HEAP32[12932 >> 2] | 0;
+ if (i3 >>> 0 > 15) {
+ HEAP32[12932 >> 2] = i2 + i12;
+ HEAP32[12920 >> 2] = i3;
+ HEAP32[i2 + (i12 + 4) >> 2] = i3 | 1;
+ HEAP32[i2 + i18 >> 2] = i3;
+ HEAP32[i2 + 4 >> 2] = i12 | 3;
+ } else {
+ HEAP32[12920 >> 2] = 0;
+ HEAP32[12932 >> 2] = 0;
+ HEAP32[i2 + 4 >> 2] = i18 | 3;
+ i32 = i2 + (i18 + 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ }
+ i32 = i2 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i18 = HEAP32[12924 >> 2] | 0;
+ if (i12 >>> 0 < i18 >>> 0) {
+ i31 = i18 - i12 | 0;
+ HEAP32[12924 >> 2] = i31;
+ i32 = HEAP32[12936 >> 2] | 0;
+ HEAP32[12936 >> 2] = i32 + i12;
+ HEAP32[i32 + (i12 + 4) >> 2] = i31 | 1;
+ HEAP32[i32 + 4 >> 2] = i12 | 3;
+ i32 = i32 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ do {
+ if ((HEAP32[3346] | 0) == 0) {
+ i18 = _sysconf(30) | 0;
+ if ((i18 + -1 & i18 | 0) == 0) {
+ HEAP32[13392 >> 2] = i18;
+ HEAP32[13388 >> 2] = i18;
+ HEAP32[13396 >> 2] = -1;
+ HEAP32[13400 >> 2] = -1;
+ HEAP32[13404 >> 2] = 0;
+ HEAP32[13356 >> 2] = 0;
+ HEAP32[3346] = (_time(0) | 0) & -16 ^ 1431655768;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ i20 = i12 + 48 | 0;
+ i25 = HEAP32[13392 >> 2] | 0;
+ i21 = i12 + 47 | 0;
+ i22 = i25 + i21 | 0;
+ i25 = 0 - i25 | 0;
+ i18 = i22 & i25;
+ if (!(i18 >>> 0 > i12 >>> 0)) {
+ i32 = 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i24 = HEAP32[13352 >> 2] | 0;
+ if ((i24 | 0) != 0 ? (i31 = HEAP32[13344 >> 2] | 0, i32 = i31 + i18 | 0, i32 >>> 0 <= i31 >>> 0 | i32 >>> 0 > i24 >>> 0) : 0) {
+ i32 = 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ L269 : do {
+ if ((HEAP32[13356 >> 2] & 4 | 0) == 0) {
+ i26 = HEAP32[12936 >> 2] | 0;
+ L271 : do {
+ if ((i26 | 0) != 0) {
+ i24 = 13360 | 0;
+ while (1) {
+ i27 = HEAP32[i24 >> 2] | 0;
+ if (!(i27 >>> 0 > i26 >>> 0) ? (i23 = i24 + 4 | 0, (i27 + (HEAP32[i23 >> 2] | 0) | 0) >>> 0 > i26 >>> 0) : 0) {
+ break;
+ }
+ i24 = HEAP32[i24 + 8 >> 2] | 0;
+ if ((i24 | 0) == 0) {
+ i13 = 182;
+ break L271;
+ }
+ }
+ if ((i24 | 0) != 0) {
+ i25 = i22 - (HEAP32[12924 >> 2] | 0) & i25;
+ if (i25 >>> 0 < 2147483647) {
+ i13 = _sbrk(i25 | 0) | 0;
+ i26 = (i13 | 0) == ((HEAP32[i24 >> 2] | 0) + (HEAP32[i23 >> 2] | 0) | 0);
+ i22 = i13;
+ i24 = i25;
+ i23 = i26 ? i13 : -1;
+ i25 = i26 ? i25 : 0;
+ i13 = 191;
+ } else {
+ i25 = 0;
+ }
+ } else {
+ i13 = 182;
+ }
+ } else {
+ i13 = 182;
+ }
+ } while (0);
+ do {
+ if ((i13 | 0) == 182) {
+ i23 = _sbrk(0) | 0;
+ if ((i23 | 0) != (-1 | 0)) {
+ i24 = i23;
+ i22 = HEAP32[13388 >> 2] | 0;
+ i25 = i22 + -1 | 0;
+ if ((i25 & i24 | 0) == 0) {
+ i25 = i18;
+ } else {
+ i25 = i18 - i24 + (i25 + i24 & 0 - i22) | 0;
+ }
+ i24 = HEAP32[13344 >> 2] | 0;
+ i26 = i24 + i25 | 0;
+ if (i25 >>> 0 > i12 >>> 0 & i25 >>> 0 < 2147483647) {
+ i22 = HEAP32[13352 >> 2] | 0;
+ if ((i22 | 0) != 0 ? i26 >>> 0 <= i24 >>> 0 | i26 >>> 0 > i22 >>> 0 : 0) {
+ i25 = 0;
+ break;
+ }
+ i22 = _sbrk(i25 | 0) | 0;
+ i13 = (i22 | 0) == (i23 | 0);
+ i24 = i25;
+ i23 = i13 ? i23 : -1;
+ i25 = i13 ? i25 : 0;
+ i13 = 191;
+ } else {
+ i25 = 0;
+ }
+ } else {
+ i25 = 0;
+ }
+ }
+ } while (0);
+ L291 : do {
+ if ((i13 | 0) == 191) {
+ i13 = 0 - i24 | 0;
+ if ((i23 | 0) != (-1 | 0)) {
+ i17 = i23;
+ i14 = i25;
+ i13 = 202;
+ break L269;
+ }
+ do {
+ if ((i22 | 0) != (-1 | 0) & i24 >>> 0 < 2147483647 & i24 >>> 0 < i20 >>> 0 ? (i19 = HEAP32[13392 >> 2] | 0, i19 = i21 - i24 + i19 & 0 - i19, i19 >>> 0 < 2147483647) : 0) {
+ if ((_sbrk(i19 | 0) | 0) == (-1 | 0)) {
+ _sbrk(i13 | 0) | 0;
+ break L291;
+ } else {
+ i24 = i19 + i24 | 0;
+ break;
+ }
+ }
+ } while (0);
+ if ((i22 | 0) != (-1 | 0)) {
+ i17 = i22;
+ i14 = i24;
+ i13 = 202;
+ break L269;
+ }
+ }
+ } while (0);
+ HEAP32[13356 >> 2] = HEAP32[13356 >> 2] | 4;
+ i13 = 199;
+ } else {
+ i25 = 0;
+ i13 = 199;
+ }
+ } while (0);
+ if ((((i13 | 0) == 199 ? i18 >>> 0 < 2147483647 : 0) ? (i17 = _sbrk(i18 | 0) | 0, i16 = _sbrk(0) | 0, (i16 | 0) != (-1 | 0) & (i17 | 0) != (-1 | 0) & i17 >>> 0 < i16 >>> 0) : 0) ? (i15 = i16 - i17 | 0, i14 = i15 >>> 0 > (i12 + 40 | 0) >>> 0, i14) : 0) {
+ i14 = i14 ? i15 : i25;
+ i13 = 202;
+ }
+ if ((i13 | 0) == 202) {
+ i15 = (HEAP32[13344 >> 2] | 0) + i14 | 0;
+ HEAP32[13344 >> 2] = i15;
+ if (i15 >>> 0 > (HEAP32[13348 >> 2] | 0) >>> 0) {
+ HEAP32[13348 >> 2] = i15;
+ }
+ i15 = HEAP32[12936 >> 2] | 0;
+ L311 : do {
+ if ((i15 | 0) != 0) {
+ i21 = 13360 | 0;
+ while (1) {
+ i16 = HEAP32[i21 >> 2] | 0;
+ i19 = i21 + 4 | 0;
+ i20 = HEAP32[i19 >> 2] | 0;
+ if ((i17 | 0) == (i16 + i20 | 0)) {
+ i13 = 214;
+ break;
+ }
+ i18 = HEAP32[i21 + 8 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ break;
+ } else {
+ i21 = i18;
+ }
+ }
+ if (((i13 | 0) == 214 ? (HEAP32[i21 + 12 >> 2] & 8 | 0) == 0 : 0) ? i15 >>> 0 >= i16 >>> 0 & i15 >>> 0 < i17 >>> 0 : 0) {
+ HEAP32[i19 >> 2] = i20 + i14;
+ i2 = (HEAP32[12924 >> 2] | 0) + i14 | 0;
+ i3 = i15 + 8 | 0;
+ if ((i3 & 7 | 0) == 0) {
+ i3 = 0;
+ } else {
+ i3 = 0 - i3 & 7;
+ }
+ i32 = i2 - i3 | 0;
+ HEAP32[12936 >> 2] = i15 + i3;
+ HEAP32[12924 >> 2] = i32;
+ HEAP32[i15 + (i3 + 4) >> 2] = i32 | 1;
+ HEAP32[i15 + (i2 + 4) >> 2] = 40;
+ HEAP32[12940 >> 2] = HEAP32[13400 >> 2];
+ break;
+ }
+ if (i17 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ HEAP32[12928 >> 2] = i17;
+ }
+ i19 = i17 + i14 | 0;
+ i16 = 13360 | 0;
+ while (1) {
+ if ((HEAP32[i16 >> 2] | 0) == (i19 | 0)) {
+ i13 = 224;
+ break;
+ }
+ i18 = HEAP32[i16 + 8 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ break;
+ } else {
+ i16 = i18;
+ }
+ }
+ if ((i13 | 0) == 224 ? (HEAP32[i16 + 12 >> 2] & 8 | 0) == 0 : 0) {
+ HEAP32[i16 >> 2] = i17;
+ i6 = i16 + 4 | 0;
+ HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + i14;
+ i6 = i17 + 8 | 0;
+ if ((i6 & 7 | 0) == 0) {
+ i6 = 0;
+ } else {
+ i6 = 0 - i6 & 7;
+ }
+ i7 = i17 + (i14 + 8) | 0;
+ if ((i7 & 7 | 0) == 0) {
+ i13 = 0;
+ } else {
+ i13 = 0 - i7 & 7;
+ }
+ i15 = i17 + (i13 + i14) | 0;
+ i8 = i6 + i12 | 0;
+ i7 = i17 + i8 | 0;
+ i10 = i15 - (i17 + i6) - i12 | 0;
+ HEAP32[i17 + (i6 + 4) >> 2] = i12 | 3;
+ L348 : do {
+ if ((i15 | 0) != (HEAP32[12936 >> 2] | 0)) {
+ if ((i15 | 0) == (HEAP32[12932 >> 2] | 0)) {
+ i32 = (HEAP32[12920 >> 2] | 0) + i10 | 0;
+ HEAP32[12920 >> 2] = i32;
+ HEAP32[12932 >> 2] = i7;
+ HEAP32[i17 + (i8 + 4) >> 2] = i32 | 1;
+ HEAP32[i17 + (i32 + i8) >> 2] = i32;
+ break;
+ }
+ i12 = i14 + 4 | 0;
+ i18 = HEAP32[i17 + (i12 + i13) >> 2] | 0;
+ if ((i18 & 3 | 0) == 1) {
+ i11 = i18 & -8;
+ i16 = i18 >>> 3;
+ do {
+ if (!(i18 >>> 0 < 256)) {
+ i9 = HEAP32[i17 + ((i13 | 24) + i14) >> 2] | 0;
+ i19 = HEAP32[i17 + (i14 + 12 + i13) >> 2] | 0;
+ do {
+ if ((i19 | 0) == (i15 | 0)) {
+ i19 = i13 | 16;
+ i18 = i17 + (i12 + i19) | 0;
+ i16 = HEAP32[i18 >> 2] | 0;
+ if ((i16 | 0) == 0) {
+ i18 = i17 + (i19 + i14) | 0;
+ i16 = HEAP32[i18 >> 2] | 0;
+ if ((i16 | 0) == 0) {
+ i5 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i20 = i16 + 20 | 0;
+ i19 = HEAP32[i20 >> 2] | 0;
+ if ((i19 | 0) != 0) {
+ i16 = i19;
+ i18 = i20;
+ continue;
+ }
+ i19 = i16 + 16 | 0;
+ i20 = HEAP32[i19 >> 2] | 0;
+ if ((i20 | 0) == 0) {
+ break;
+ } else {
+ i16 = i20;
+ i18 = i19;
+ }
+ }
+ if (i18 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i18 >> 2] = 0;
+ i5 = i16;
+ break;
+ }
+ } else {
+ i18 = HEAP32[i17 + ((i13 | 8) + i14) >> 2] | 0;
+ if (i18 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i18 + 12 | 0;
+ if ((HEAP32[i16 >> 2] | 0) != (i15 | 0)) {
+ _abort();
+ }
+ i20 = i19 + 8 | 0;
+ if ((HEAP32[i20 >> 2] | 0) == (i15 | 0)) {
+ HEAP32[i16 >> 2] = i19;
+ HEAP32[i20 >> 2] = i18;
+ i5 = i19;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ if ((i9 | 0) != 0) {
+ i16 = HEAP32[i17 + (i14 + 28 + i13) >> 2] | 0;
+ i18 = 13216 + (i16 << 2) | 0;
+ if ((i15 | 0) == (HEAP32[i18 >> 2] | 0)) {
+ HEAP32[i18 >> 2] = i5;
+ if ((i5 | 0) == 0) {
+ HEAP32[12916 >> 2] = HEAP32[12916 >> 2] & ~(1 << i16);
+ break;
+ }
+ } else {
+ if (i9 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i9 + 16 | 0;
+ if ((HEAP32[i16 >> 2] | 0) == (i15 | 0)) {
+ HEAP32[i16 >> 2] = i5;
+ } else {
+ HEAP32[i9 + 20 >> 2] = i5;
+ }
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ }
+ if (i5 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i5 + 24 >> 2] = i9;
+ i15 = i13 | 16;
+ i9 = HEAP32[i17 + (i15 + i14) >> 2] | 0;
+ do {
+ if ((i9 | 0) != 0) {
+ if (i9 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i5 + 16 >> 2] = i9;
+ HEAP32[i9 + 24 >> 2] = i5;
+ break;
+ }
+ }
+ } while (0);
+ i9 = HEAP32[i17 + (i12 + i15) >> 2] | 0;
+ if ((i9 | 0) != 0) {
+ if (i9 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i5 + 20 >> 2] = i9;
+ HEAP32[i9 + 24 >> 2] = i5;
+ break;
+ }
+ }
+ }
+ } else {
+ i5 = HEAP32[i17 + ((i13 | 8) + i14) >> 2] | 0;
+ i12 = HEAP32[i17 + (i14 + 12 + i13) >> 2] | 0;
+ i18 = 12952 + (i16 << 1 << 2) | 0;
+ if ((i5 | 0) != (i18 | 0)) {
+ if (i5 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ if ((HEAP32[i5 + 12 >> 2] | 0) != (i15 | 0)) {
+ _abort();
+ }
+ }
+ if ((i12 | 0) == (i5 | 0)) {
+ HEAP32[3228] = HEAP32[3228] & ~(1 << i16);
+ break;
+ }
+ if ((i12 | 0) != (i18 | 0)) {
+ if (i12 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i12 + 8 | 0;
+ if ((HEAP32[i16 >> 2] | 0) == (i15 | 0)) {
+ i9 = i16;
+ } else {
+ _abort();
+ }
+ } else {
+ i9 = i12 + 8 | 0;
+ }
+ HEAP32[i5 + 12 >> 2] = i12;
+ HEAP32[i9 >> 2] = i5;
+ }
+ } while (0);
+ i15 = i17 + ((i11 | i13) + i14) | 0;
+ i10 = i11 + i10 | 0;
+ }
+ i5 = i15 + 4 | 0;
+ HEAP32[i5 >> 2] = HEAP32[i5 >> 2] & -2;
+ HEAP32[i17 + (i8 + 4) >> 2] = i10 | 1;
+ HEAP32[i17 + (i10 + i8) >> 2] = i10;
+ i5 = i10 >>> 3;
+ if (i10 >>> 0 < 256) {
+ i10 = i5 << 1;
+ i2 = 12952 + (i10 << 2) | 0;
+ i9 = HEAP32[3228] | 0;
+ i5 = 1 << i5;
+ if ((i9 & i5 | 0) != 0) {
+ i9 = 12952 + (i10 + 2 << 2) | 0;
+ i5 = HEAP32[i9 >> 2] | 0;
+ if (i5 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i3 = i9;
+ i4 = i5;
+ }
+ } else {
+ HEAP32[3228] = i9 | i5;
+ i3 = 12952 + (i10 + 2 << 2) | 0;
+ i4 = i2;
+ }
+ HEAP32[i3 >> 2] = i7;
+ HEAP32[i4 + 12 >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i4;
+ HEAP32[i17 + (i8 + 12) >> 2] = i2;
+ break;
+ }
+ i3 = i10 >>> 8;
+ if ((i3 | 0) != 0) {
+ if (i10 >>> 0 > 16777215) {
+ i3 = 31;
+ } else {
+ i31 = (i3 + 1048320 | 0) >>> 16 & 8;
+ i32 = i3 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i3 = (i32 + 245760 | 0) >>> 16 & 2;
+ i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
+ i3 = i10 >>> (i3 + 7 | 0) & 1 | i3 << 1;
+ }
+ } else {
+ i3 = 0;
+ }
+ i4 = 13216 + (i3 << 2) | 0;
+ HEAP32[i17 + (i8 + 28) >> 2] = i3;
+ HEAP32[i17 + (i8 + 20) >> 2] = 0;
+ HEAP32[i17 + (i8 + 16) >> 2] = 0;
+ i9 = HEAP32[12916 >> 2] | 0;
+ i5 = 1 << i3;
+ if ((i9 & i5 | 0) == 0) {
+ HEAP32[12916 >> 2] = i9 | i5;
+ HEAP32[i4 >> 2] = i7;
+ HEAP32[i17 + (i8 + 24) >> 2] = i4;
+ HEAP32[i17 + (i8 + 12) >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i7;
+ break;
+ }
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((i3 | 0) == 31) {
+ i3 = 0;
+ } else {
+ i3 = 25 - (i3 >>> 1) | 0;
+ }
+ L445 : do {
+ if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i10 | 0)) {
+ i3 = i10 << i3;
+ while (1) {
+ i5 = i4 + (i3 >>> 31 << 2) + 16 | 0;
+ i9 = HEAP32[i5 >> 2] | 0;
+ if ((i9 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i9 + 4 >> 2] & -8 | 0) == (i10 | 0)) {
+ i2 = i9;
+ break L445;
+ } else {
+ i3 = i3 << 1;
+ i4 = i9;
+ }
+ }
+ if (i5 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i5 >> 2] = i7;
+ HEAP32[i17 + (i8 + 24) >> 2] = i4;
+ HEAP32[i17 + (i8 + 12) >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i7;
+ break L348;
+ }
+ } else {
+ i2 = i4;
+ }
+ } while (0);
+ i4 = i2 + 8 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ i5 = HEAP32[12928 >> 2] | 0;
+ if (i2 >>> 0 < i5 >>> 0) {
+ _abort();
+ }
+ if (i3 >>> 0 < i5 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i3 + 12 >> 2] = i7;
+ HEAP32[i4 >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i3;
+ HEAP32[i17 + (i8 + 12) >> 2] = i2;
+ HEAP32[i17 + (i8 + 24) >> 2] = 0;
+ break;
+ }
+ } else {
+ i32 = (HEAP32[12924 >> 2] | 0) + i10 | 0;
+ HEAP32[12924 >> 2] = i32;
+ HEAP32[12936 >> 2] = i7;
+ HEAP32[i17 + (i8 + 4) >> 2] = i32 | 1;
+ }
+ } while (0);
+ i32 = i17 + (i6 | 8) | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i3 = 13360 | 0;
+ while (1) {
+ i2 = HEAP32[i3 >> 2] | 0;
+ if (!(i2 >>> 0 > i15 >>> 0) ? (i11 = HEAP32[i3 + 4 >> 2] | 0, i10 = i2 + i11 | 0, i10 >>> 0 > i15 >>> 0) : 0) {
+ break;
+ }
+ i3 = HEAP32[i3 + 8 >> 2] | 0;
+ }
+ i3 = i2 + (i11 + -39) | 0;
+ if ((i3 & 7 | 0) == 0) {
+ i3 = 0;
+ } else {
+ i3 = 0 - i3 & 7;
+ }
+ i2 = i2 + (i11 + -47 + i3) | 0;
+ i2 = i2 >>> 0 < (i15 + 16 | 0) >>> 0 ? i15 : i2;
+ i3 = i2 + 8 | 0;
+ i4 = i17 + 8 | 0;
+ if ((i4 & 7 | 0) == 0) {
+ i4 = 0;
+ } else {
+ i4 = 0 - i4 & 7;
+ }
+ i32 = i14 + -40 - i4 | 0;
+ HEAP32[12936 >> 2] = i17 + i4;
+ HEAP32[12924 >> 2] = i32;
+ HEAP32[i17 + (i4 + 4) >> 2] = i32 | 1;
+ HEAP32[i17 + (i14 + -36) >> 2] = 40;
+ HEAP32[12940 >> 2] = HEAP32[13400 >> 2];
+ HEAP32[i2 + 4 >> 2] = 27;
+ HEAP32[i3 + 0 >> 2] = HEAP32[13360 >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[13364 >> 2];
+ HEAP32[i3 + 8 >> 2] = HEAP32[13368 >> 2];
+ HEAP32[i3 + 12 >> 2] = HEAP32[13372 >> 2];
+ HEAP32[13360 >> 2] = i17;
+ HEAP32[13364 >> 2] = i14;
+ HEAP32[13372 >> 2] = 0;
+ HEAP32[13368 >> 2] = i3;
+ i4 = i2 + 28 | 0;
+ HEAP32[i4 >> 2] = 7;
+ if ((i2 + 32 | 0) >>> 0 < i10 >>> 0) {
+ while (1) {
+ i3 = i4 + 4 | 0;
+ HEAP32[i3 >> 2] = 7;
+ if ((i4 + 8 | 0) >>> 0 < i10 >>> 0) {
+ i4 = i3;
+ } else {
+ break;
+ }
+ }
+ }
+ if ((i2 | 0) != (i15 | 0)) {
+ i2 = i2 - i15 | 0;
+ i3 = i15 + (i2 + 4) | 0;
+ HEAP32[i3 >> 2] = HEAP32[i3 >> 2] & -2;
+ HEAP32[i15 + 4 >> 2] = i2 | 1;
+ HEAP32[i15 + i2 >> 2] = i2;
+ i3 = i2 >>> 3;
+ if (i2 >>> 0 < 256) {
+ i4 = i3 << 1;
+ i2 = 12952 + (i4 << 2) | 0;
+ i5 = HEAP32[3228] | 0;
+ i3 = 1 << i3;
+ if ((i5 & i3 | 0) != 0) {
+ i4 = 12952 + (i4 + 2 << 2) | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ if (i3 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i7 = i4;
+ i8 = i3;
+ }
+ } else {
+ HEAP32[3228] = i5 | i3;
+ i7 = 12952 + (i4 + 2 << 2) | 0;
+ i8 = i2;
+ }
+ HEAP32[i7 >> 2] = i15;
+ HEAP32[i8 + 12 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i8;
+ HEAP32[i15 + 12 >> 2] = i2;
+ break;
+ }
+ i3 = i2 >>> 8;
+ if ((i3 | 0) != 0) {
+ if (i2 >>> 0 > 16777215) {
+ i3 = 31;
+ } else {
+ i31 = (i3 + 1048320 | 0) >>> 16 & 8;
+ i32 = i3 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i3 = (i32 + 245760 | 0) >>> 16 & 2;
+ i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
+ i3 = i2 >>> (i3 + 7 | 0) & 1 | i3 << 1;
+ }
+ } else {
+ i3 = 0;
+ }
+ i7 = 13216 + (i3 << 2) | 0;
+ HEAP32[i15 + 28 >> 2] = i3;
+ HEAP32[i15 + 20 >> 2] = 0;
+ HEAP32[i15 + 16 >> 2] = 0;
+ i4 = HEAP32[12916 >> 2] | 0;
+ i5 = 1 << i3;
+ if ((i4 & i5 | 0) == 0) {
+ HEAP32[12916 >> 2] = i4 | i5;
+ HEAP32[i7 >> 2] = i15;
+ HEAP32[i15 + 24 >> 2] = i7;
+ HEAP32[i15 + 12 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i15;
+ break;
+ }
+ i4 = HEAP32[i7 >> 2] | 0;
+ if ((i3 | 0) == 31) {
+ i3 = 0;
+ } else {
+ i3 = 25 - (i3 >>> 1) | 0;
+ }
+ L499 : do {
+ if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i2 | 0)) {
+ i3 = i2 << i3;
+ while (1) {
+ i7 = i4 + (i3 >>> 31 << 2) + 16 | 0;
+ i5 = HEAP32[i7 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) == (i2 | 0)) {
+ i6 = i5;
+ break L499;
+ } else {
+ i3 = i3 << 1;
+ i4 = i5;
+ }
+ }
+ if (i7 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i7 >> 2] = i15;
+ HEAP32[i15 + 24 >> 2] = i4;
+ HEAP32[i15 + 12 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i15;
+ break L311;
+ }
+ } else {
+ i6 = i4;
+ }
+ } while (0);
+ i4 = i6 + 8 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ i2 = HEAP32[12928 >> 2] | 0;
+ if (i6 >>> 0 < i2 >>> 0) {
+ _abort();
+ }
+ if (i3 >>> 0 < i2 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i3 + 12 >> 2] = i15;
+ HEAP32[i4 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i3;
+ HEAP32[i15 + 12 >> 2] = i6;
+ HEAP32[i15 + 24 >> 2] = 0;
+ break;
+ }
+ }
+ } else {
+ i32 = HEAP32[12928 >> 2] | 0;
+ if ((i32 | 0) == 0 | i17 >>> 0 < i32 >>> 0) {
+ HEAP32[12928 >> 2] = i17;
+ }
+ HEAP32[13360 >> 2] = i17;
+ HEAP32[13364 >> 2] = i14;
+ HEAP32[13372 >> 2] = 0;
+ HEAP32[12948 >> 2] = HEAP32[3346];
+ HEAP32[12944 >> 2] = -1;
+ i2 = 0;
+ do {
+ i32 = i2 << 1;
+ i31 = 12952 + (i32 << 2) | 0;
+ HEAP32[12952 + (i32 + 3 << 2) >> 2] = i31;
+ HEAP32[12952 + (i32 + 2 << 2) >> 2] = i31;
+ i2 = i2 + 1 | 0;
+ } while ((i2 | 0) != 32);
+ i2 = i17 + 8 | 0;
+ if ((i2 & 7 | 0) == 0) {
+ i2 = 0;
+ } else {
+ i2 = 0 - i2 & 7;
+ }
+ i32 = i14 + -40 - i2 | 0;
+ HEAP32[12936 >> 2] = i17 + i2;
+ HEAP32[12924 >> 2] = i32;
+ HEAP32[i17 + (i2 + 4) >> 2] = i32 | 1;
+ HEAP32[i17 + (i14 + -36) >> 2] = 40;
+ HEAP32[12940 >> 2] = HEAP32[13400 >> 2];
+ }
+ } while (0);
+ i2 = HEAP32[12924 >> 2] | 0;
+ if (i2 >>> 0 > i12 >>> 0) {
+ i31 = i2 - i12 | 0;
+ HEAP32[12924 >> 2] = i31;
+ i32 = HEAP32[12936 >> 2] | 0;
+ HEAP32[12936 >> 2] = i32 + i12;
+ HEAP32[i32 + (i12 + 4) >> 2] = i31 | 1;
+ HEAP32[i32 + 4 >> 2] = i12 | 3;
+ i32 = i32 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ }
+ HEAP32[(___errno_location() | 0) >> 2] = 12;
+ i32 = 0;
+ STACKTOP = i1;
+ return i32 | 0;
+}
+function _llex(i2, i3) {
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ var i1 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i12 = i1;
+ i4 = i2 + 60 | 0;
+ HEAP32[(HEAP32[i4 >> 2] | 0) + 4 >> 2] = 0;
+ i5 = i2 + 56 | 0;
+ L1 : while (1) {
+ i13 = HEAP32[i2 >> 2] | 0;
+ L3 : while (1) {
+ switch (i13 | 0) {
+ case 11:
+ case 9:
+ case 12:
+ case 32:
+ {
+ break;
+ }
+ case 91:
+ {
+ i9 = 25;
+ break L1;
+ }
+ case 62:
+ {
+ i9 = 45;
+ break L1;
+ }
+ case 46:
+ {
+ i9 = 161;
+ break L1;
+ }
+ case 13:
+ case 10:
+ {
+ i9 = 4;
+ break L3;
+ }
+ case 45:
+ {
+ break L3;
+ }
+ case 61:
+ {
+ i9 = 29;
+ break L1;
+ }
+ case 39:
+ case 34:
+ {
+ i9 = 69;
+ break L1;
+ }
+ case 126:
+ {
+ i9 = 53;
+ break L1;
+ }
+ case 60:
+ {
+ i9 = 37;
+ break L1;
+ }
+ case 58:
+ {
+ i9 = 61;
+ break L1;
+ }
+ case 57:
+ case 56:
+ case 55:
+ case 54:
+ case 53:
+ case 52:
+ case 51:
+ case 50:
+ case 49:
+ case 48:
+ {
+ i20 = i13;
+ break L1;
+ }
+ case -1:
+ {
+ i2 = 286;
+ i9 = 306;
+ break L1;
+ }
+ default:
+ {
+ i9 = 283;
+ break L1;
+ }
+ }
+ i13 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i13 >> 2] | 0;
+ HEAP32[i13 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i13 = _luaZ_fill(i13) | 0;
+ } else {
+ i27 = i13 + 4 | 0;
+ i13 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i13 + 1;
+ i13 = HEAPU8[i13] | 0;
+ }
+ HEAP32[i2 >> 2] = i13;
+ }
+ if ((i9 | 0) == 4) {
+ i9 = 0;
+ _inclinenumber(i2);
+ continue;
+ }
+ i13 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i13 >> 2] | 0;
+ HEAP32[i13 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i13 = _luaZ_fill(i13) | 0;
+ } else {
+ i27 = i13 + 4 | 0;
+ i13 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i13 + 1;
+ i13 = HEAPU8[i13] | 0;
+ }
+ HEAP32[i2 >> 2] = i13;
+ if ((i13 | 0) != 45) {
+ i2 = 45;
+ i9 = 306;
+ break;
+ }
+ i13 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i13 >> 2] | 0;
+ HEAP32[i13 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i13 = _luaZ_fill(i13) | 0;
+ } else {
+ i27 = i13 + 4 | 0;
+ i13 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i13 + 1;
+ i13 = HEAPU8[i13] | 0;
+ }
+ HEAP32[i2 >> 2] = i13;
+ do {
+ if ((i13 | 0) == 91) {
+ i13 = _skip_sep(i2) | 0;
+ HEAP32[(HEAP32[i4 >> 2] | 0) + 4 >> 2] = 0;
+ if ((i13 | 0) > -1) {
+ _read_long_string(i2, 0, i13);
+ HEAP32[(HEAP32[i4 >> 2] | 0) + 4 >> 2] = 0;
+ continue L1;
+ } else {
+ i13 = HEAP32[i2 >> 2] | 0;
+ break;
+ }
+ }
+ } while (0);
+ while (1) {
+ if ((i13 | 0) == -1 | (i13 | 0) == 13 | (i13 | 0) == 10) {
+ continue L1;
+ }
+ i13 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i13 >> 2] | 0;
+ HEAP32[i13 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i13 = _luaZ_fill(i13) | 0;
+ } else {
+ i27 = i13 + 4 | 0;
+ i13 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i13 + 1;
+ i13 = HEAPU8[i13] | 0;
+ }
+ HEAP32[i2 >> 2] = i13;
+ }
+ }
+ if ((i9 | 0) == 25) {
+ i9 = _skip_sep(i2) | 0;
+ if ((i9 | 0) > -1) {
+ _read_long_string(i2, i3, i9);
+ i27 = 289;
+ STACKTOP = i1;
+ return i27 | 0;
+ }
+ if ((i9 | 0) == -1) {
+ i27 = 91;
+ STACKTOP = i1;
+ return i27 | 0;
+ } else {
+ _lexerror(i2, 12272, 289);
+ }
+ } else if ((i9 | 0) == 29) {
+ i3 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i3 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i3 = _luaZ_fill(i3) | 0;
+ } else {
+ i27 = i3 + 4 | 0;
+ i3 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i3 + 1;
+ i3 = HEAPU8[i3] | 0;
+ }
+ HEAP32[i2 >> 2] = i3;
+ if ((i3 | 0) != 61) {
+ i27 = 61;
+ STACKTOP = i1;
+ return i27 | 0;
+ }
+ i3 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i3 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i3 = _luaZ_fill(i3) | 0;
+ } else {
+ i27 = i3 + 4 | 0;
+ i3 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i3 + 1;
+ i3 = HEAPU8[i3] | 0;
+ }
+ HEAP32[i2 >> 2] = i3;
+ i27 = 281;
+ STACKTOP = i1;
+ return i27 | 0;
+ } else if ((i9 | 0) == 37) {
+ i3 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i3 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i3 = _luaZ_fill(i3) | 0;
+ } else {
+ i27 = i3 + 4 | 0;
+ i3 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i3 + 1;
+ i3 = HEAPU8[i3] | 0;
+ }
+ HEAP32[i2 >> 2] = i3;
+ if ((i3 | 0) != 61) {
+ i27 = 60;
+ STACKTOP = i1;
+ return i27 | 0;
+ }
+ i3 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i3 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i3 = _luaZ_fill(i3) | 0;
+ } else {
+ i27 = i3 + 4 | 0;
+ i3 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i3 + 1;
+ i3 = HEAPU8[i3] | 0;
+ }
+ HEAP32[i2 >> 2] = i3;
+ i27 = 283;
+ STACKTOP = i1;
+ return i27 | 0;
+ } else if ((i9 | 0) == 45) {
+ i3 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i3 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i3 = _luaZ_fill(i3) | 0;
+ } else {
+ i27 = i3 + 4 | 0;
+ i3 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i3 + 1;
+ i3 = HEAPU8[i3] | 0;
+ }
+ HEAP32[i2 >> 2] = i3;
+ if ((i3 | 0) != 61) {
+ i27 = 62;
+ STACKTOP = i1;
+ return i27 | 0;
+ }
+ i3 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i3 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i3 = _luaZ_fill(i3) | 0;
+ } else {
+ i27 = i3 + 4 | 0;
+ i3 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i3 + 1;
+ i3 = HEAPU8[i3] | 0;
+ }
+ HEAP32[i2 >> 2] = i3;
+ i27 = 282;
+ STACKTOP = i1;
+ return i27 | 0;
+ } else if ((i9 | 0) == 53) {
+ i3 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i3 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i3 = _luaZ_fill(i3) | 0;
+ } else {
+ i27 = i3 + 4 | 0;
+ i3 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i3 + 1;
+ i3 = HEAPU8[i3] | 0;
+ }
+ HEAP32[i2 >> 2] = i3;
+ if ((i3 | 0) != 61) {
+ i27 = 126;
+ STACKTOP = i1;
+ return i27 | 0;
+ }
+ i3 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i3 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i3 = _luaZ_fill(i3) | 0;
+ } else {
+ i27 = i3 + 4 | 0;
+ i3 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i3 + 1;
+ i3 = HEAPU8[i3] | 0;
+ }
+ HEAP32[i2 >> 2] = i3;
+ i27 = 284;
+ STACKTOP = i1;
+ return i27 | 0;
+ } else if ((i9 | 0) == 61) {
+ i3 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i3 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i3 = _luaZ_fill(i3) | 0;
+ } else {
+ i27 = i3 + 4 | 0;
+ i3 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i3 + 1;
+ i3 = HEAPU8[i3] | 0;
+ }
+ HEAP32[i2 >> 2] = i3;
+ if ((i3 | 0) != 58) {
+ i27 = 58;
+ STACKTOP = i1;
+ return i27 | 0;
+ }
+ i3 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i3 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i3 = _luaZ_fill(i3) | 0;
+ } else {
+ i27 = i3 + 4 | 0;
+ i3 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i3 + 1;
+ i3 = HEAPU8[i3] | 0;
+ }
+ HEAP32[i2 >> 2] = i3;
+ i27 = 285;
+ STACKTOP = i1;
+ return i27 | 0;
+ } else if ((i9 | 0) == 69) {
+ i14 = HEAP32[i4 >> 2] | 0;
+ i7 = i14 + 4 | 0;
+ i15 = HEAP32[i7 >> 2] | 0;
+ i8 = i14 + 8 | 0;
+ i6 = HEAP32[i8 >> 2] | 0;
+ do {
+ if ((i15 + 1 | 0) >>> 0 > i6 >>> 0) {
+ if (i6 >>> 0 > 2147483645) {
+ _lexerror(i2, 12368, 0);
+ }
+ i16 = i6 << 1;
+ i15 = HEAP32[i2 + 52 >> 2] | 0;
+ if ((i16 | 0) == -2) {
+ _luaM_toobig(i15);
+ } else {
+ i24 = _luaM_realloc_(i15, HEAP32[i14 >> 2] | 0, i6, i16) | 0;
+ HEAP32[i14 >> 2] = i24;
+ HEAP32[i8 >> 2] = i16;
+ i23 = HEAP32[i7 >> 2] | 0;
+ break;
+ }
+ } else {
+ i23 = i15;
+ i24 = HEAP32[i14 >> 2] | 0;
+ }
+ } while (0);
+ i6 = i13 & 255;
+ HEAP32[i7 >> 2] = i23 + 1;
+ HEAP8[i24 + i23 | 0] = i6;
+ i7 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i14 = _luaZ_fill(i7) | 0;
+ } else {
+ i27 = i7 + 4 | 0;
+ i14 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i14 + 1;
+ i14 = HEAPU8[i14] | 0;
+ }
+ HEAP32[i2 >> 2] = i14;
+ L139 : do {
+ if ((i14 | 0) != (i13 | 0)) {
+ i7 = i2 + 52 | 0;
+ L141 : while (1) {
+ L143 : do {
+ if ((i14 | 0) == 92) {
+ i8 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i8 >> 2] | 0;
+ HEAP32[i8 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i8 = _luaZ_fill(i8) | 0;
+ } else {
+ i27 = i8 + 4 | 0;
+ i8 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i8 + 1;
+ i8 = HEAPU8[i8] | 0;
+ }
+ HEAP32[i2 >> 2] = i8;
+ switch (i8 | 0) {
+ case 13:
+ case 10:
+ {
+ _inclinenumber(i2);
+ i8 = 10;
+ break;
+ }
+ case 39:
+ case 34:
+ case 92:
+ {
+ i9 = 124;
+ break;
+ }
+ case 122:
+ {
+ i8 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i8 >> 2] | 0;
+ HEAP32[i8 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i14 = _luaZ_fill(i8) | 0;
+ } else {
+ i27 = i8 + 4 | 0;
+ i14 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i14 + 1;
+ i14 = HEAPU8[i14] | 0;
+ }
+ HEAP32[i2 >> 2] = i14;
+ if ((HEAP8[i14 + 10913 | 0] & 8) == 0) {
+ break L143;
+ }
+ while (1) {
+ if ((i14 | 0) == 13 | (i14 | 0) == 10) {
+ _inclinenumber(i2);
+ i14 = HEAP32[i2 >> 2] | 0;
+ } else {
+ i8 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i8 >> 2] | 0;
+ HEAP32[i8 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i14 = _luaZ_fill(i8) | 0;
+ } else {
+ i27 = i8 + 4 | 0;
+ i14 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i14 + 1;
+ i14 = HEAPU8[i14] | 0;
+ }
+ HEAP32[i2 >> 2] = i14;
+ }
+ if ((HEAP8[i14 + 10913 | 0] & 8) == 0) {
+ break L143;
+ }
+ }
+ }
+ case 118:
+ {
+ i8 = 11;
+ i9 = 124;
+ break;
+ }
+ case 120:
+ {
+ HEAP32[i12 >> 2] = 120;
+ i14 = 1;
+ i8 = 0;
+ while (1) {
+ i9 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i9 >> 2] | 0;
+ HEAP32[i9 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i9 = _luaZ_fill(i9) | 0;
+ } else {
+ i27 = i9 + 4 | 0;
+ i9 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i9 + 1;
+ i9 = HEAPU8[i9] | 0;
+ }
+ HEAP32[i2 >> 2] = i9;
+ HEAP32[i12 + (i14 << 2) >> 2] = i9;
+ if ((HEAP8[i9 + 10913 | 0] & 16) == 0) {
+ i9 = 100;
+ break L141;
+ }
+ i8 = (_luaO_hexavalue(i9) | 0) + (i8 << 4) | 0;
+ i14 = i14 + 1 | 0;
+ if ((i14 | 0) >= 3) {
+ i9 = 124;
+ break;
+ }
+ }
+ break;
+ }
+ case -1:
+ {
+ i14 = -1;
+ break L143;
+ }
+ case 98:
+ {
+ i8 = 8;
+ i9 = 124;
+ break;
+ }
+ case 102:
+ {
+ i8 = 12;
+ i9 = 124;
+ break;
+ }
+ case 110:
+ {
+ i8 = 10;
+ i9 = 124;
+ break;
+ }
+ case 114:
+ {
+ i8 = 13;
+ i9 = 124;
+ break;
+ }
+ case 116:
+ {
+ i8 = 9;
+ i9 = 124;
+ break;
+ }
+ case 97:
+ {
+ i8 = 7;
+ i9 = 124;
+ break;
+ }
+ default:
+ {
+ if ((HEAP8[i8 + 10913 | 0] & 2) == 0) {
+ i9 = 116;
+ break L141;
+ } else {
+ i15 = i8;
+ i14 = 0;
+ i8 = 0;
+ }
+ do {
+ if ((HEAP8[i15 + 10913 | 0] & 2) == 0) {
+ break;
+ }
+ HEAP32[i12 + (i14 << 2) >> 2] = i15;
+ i8 = i15 + -48 + (i8 * 10 | 0) | 0;
+ i15 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i15 >> 2] | 0;
+ HEAP32[i15 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i15 = _luaZ_fill(i15) | 0;
+ } else {
+ i27 = i15 + 4 | 0;
+ i15 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i15 + 1;
+ i15 = HEAPU8[i15] | 0;
+ }
+ HEAP32[i2 >> 2] = i15;
+ i14 = i14 + 1 | 0;
+ } while ((i14 | 0) < 3);
+ if ((i8 | 0) > 255) {
+ i9 = 123;
+ break L141;
+ }
+ }
+ }
+ if ((i9 | 0) == 124) {
+ i9 = 0;
+ i14 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i14 >> 2] | 0;
+ HEAP32[i14 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i14 = _luaZ_fill(i14) | 0;
+ } else {
+ i27 = i14 + 4 | 0;
+ i14 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i14 + 1;
+ i14 = HEAPU8[i14] | 0;
+ }
+ HEAP32[i2 >> 2] = i14;
+ }
+ i15 = HEAP32[i4 >> 2] | 0;
+ i14 = i15 + 4 | 0;
+ i18 = HEAP32[i14 >> 2] | 0;
+ i16 = i15 + 8 | 0;
+ i17 = HEAP32[i16 >> 2] | 0;
+ if ((i18 + 1 | 0) >>> 0 > i17 >>> 0) {
+ if (i17 >>> 0 > 2147483645) {
+ i9 = 131;
+ break L141;
+ }
+ i18 = i17 << 1;
+ i19 = HEAP32[i7 >> 2] | 0;
+ if ((i18 | 0) == -2) {
+ i9 = 133;
+ break L141;
+ }
+ i27 = _luaM_realloc_(i19, HEAP32[i15 >> 2] | 0, i17, i18) | 0;
+ HEAP32[i15 >> 2] = i27;
+ HEAP32[i16 >> 2] = i18;
+ i18 = HEAP32[i14 >> 2] | 0;
+ i15 = i27;
+ } else {
+ i15 = HEAP32[i15 >> 2] | 0;
+ }
+ HEAP32[i14 >> 2] = i18 + 1;
+ HEAP8[i15 + i18 | 0] = i8;
+ i14 = HEAP32[i2 >> 2] | 0;
+ } else if ((i14 | 0) == -1) {
+ i9 = 82;
+ break L141;
+ } else if ((i14 | 0) == 13 | (i14 | 0) == 10) {
+ i9 = 83;
+ break L141;
+ } else {
+ i15 = HEAP32[i4 >> 2] | 0;
+ i8 = i15 + 4 | 0;
+ i18 = HEAP32[i8 >> 2] | 0;
+ i17 = i15 + 8 | 0;
+ i16 = HEAP32[i17 >> 2] | 0;
+ if ((i18 + 1 | 0) >>> 0 > i16 >>> 0) {
+ if (i16 >>> 0 > 2147483645) {
+ i9 = 139;
+ break L141;
+ }
+ i19 = i16 << 1;
+ i18 = HEAP32[i7 >> 2] | 0;
+ if ((i19 | 0) == -2) {
+ i9 = 141;
+ break L141;
+ }
+ i27 = _luaM_realloc_(i18, HEAP32[i15 >> 2] | 0, i16, i19) | 0;
+ HEAP32[i15 >> 2] = i27;
+ HEAP32[i17 >> 2] = i19;
+ i18 = HEAP32[i8 >> 2] | 0;
+ i15 = i27;
+ } else {
+ i15 = HEAP32[i15 >> 2] | 0;
+ }
+ HEAP32[i8 >> 2] = i18 + 1;
+ HEAP8[i15 + i18 | 0] = i14;
+ i8 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i8 >> 2] | 0;
+ HEAP32[i8 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i14 = _luaZ_fill(i8) | 0;
+ } else {
+ i27 = i8 + 4 | 0;
+ i14 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i14 + 1;
+ i14 = HEAPU8[i14] | 0;
+ }
+ HEAP32[i2 >> 2] = i14;
+ }
+ } while (0);
+ if ((i14 | 0) == (i13 | 0)) {
+ break L139;
+ }
+ }
+ if ((i9 | 0) == 82) {
+ _lexerror(i2, 12400, 286);
+ } else if ((i9 | 0) == 83) {
+ _lexerror(i2, 12400, 289);
+ } else if ((i9 | 0) == 100) {
+ _escerror(i2, i12, i14 + 1 | 0, 12480);
+ } else if ((i9 | 0) == 116) {
+ _escerror(i2, i2, 1, 12424);
+ } else if ((i9 | 0) == 123) {
+ _escerror(i2, i12, i14, 12448);
+ } else if ((i9 | 0) == 131) {
+ _lexerror(i2, 12368, 0);
+ } else if ((i9 | 0) == 133) {
+ _luaM_toobig(i19);
+ } else if ((i9 | 0) == 139) {
+ _lexerror(i2, 12368, 0);
+ } else if ((i9 | 0) == 141) {
+ _luaM_toobig(i18);
+ }
+ }
+ } while (0);
+ i7 = HEAP32[i4 >> 2] | 0;
+ i8 = i7 + 4 | 0;
+ i13 = HEAP32[i8 >> 2] | 0;
+ i12 = i7 + 8 | 0;
+ i9 = HEAP32[i12 >> 2] | 0;
+ do {
+ if ((i13 + 1 | 0) >>> 0 > i9 >>> 0) {
+ if (i9 >>> 0 > 2147483645) {
+ _lexerror(i2, 12368, 0);
+ }
+ i14 = i9 << 1;
+ i13 = HEAP32[i2 + 52 >> 2] | 0;
+ if ((i14 | 0) == -2) {
+ _luaM_toobig(i13);
+ } else {
+ i11 = _luaM_realloc_(i13, HEAP32[i7 >> 2] | 0, i9, i14) | 0;
+ HEAP32[i7 >> 2] = i11;
+ HEAP32[i12 >> 2] = i14;
+ i10 = HEAP32[i8 >> 2] | 0;
+ break;
+ }
+ } else {
+ i10 = i13;
+ i11 = HEAP32[i7 >> 2] | 0;
+ }
+ } while (0);
+ HEAP32[i8 >> 2] = i10 + 1;
+ HEAP8[i11 + i10 | 0] = i6;
+ i5 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i5 = _luaZ_fill(i5) | 0;
+ } else {
+ i27 = i5 + 4 | 0;
+ i5 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i5 + 1;
+ i5 = HEAPU8[i5] | 0;
+ }
+ HEAP32[i2 >> 2] = i5;
+ i5 = HEAP32[i4 >> 2] | 0;
+ i4 = HEAP32[i2 + 52 >> 2] | 0;
+ i5 = _luaS_newlstr(i4, (HEAP32[i5 >> 2] | 0) + 1 | 0, (HEAP32[i5 + 4 >> 2] | 0) + -2 | 0) | 0;
+ i6 = i4 + 8 | 0;
+ i7 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i6 >> 2] = i7 + 16;
+ HEAP32[i7 >> 2] = i5;
+ HEAP32[i7 + 8 >> 2] = HEAPU8[i5 + 4 | 0] | 64;
+ i7 = _luaH_set(i4, HEAP32[(HEAP32[i2 + 48 >> 2] | 0) + 4 >> 2] | 0, (HEAP32[i6 >> 2] | 0) + -16 | 0) | 0;
+ i2 = i7 + 8 | 0;
+ if ((HEAP32[i2 >> 2] | 0) == 0 ? (HEAP32[i7 >> 2] = 1, HEAP32[i2 >> 2] = 1, (HEAP32[(HEAP32[i4 + 12 >> 2] | 0) + 12 >> 2] | 0) > 0) : 0) {
+ _luaC_step(i4);
+ }
+ HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + -16;
+ HEAP32[i3 >> 2] = i5;
+ i27 = 289;
+ STACKTOP = i1;
+ return i27 | 0;
+ } else if ((i9 | 0) == 161) {
+ i10 = HEAP32[i4 >> 2] | 0;
+ i9 = i10 + 4 | 0;
+ i13 = HEAP32[i9 >> 2] | 0;
+ i12 = i10 + 8 | 0;
+ i11 = HEAP32[i12 >> 2] | 0;
+ do {
+ if ((i13 + 1 | 0) >>> 0 > i11 >>> 0) {
+ if (i11 >>> 0 > 2147483645) {
+ _lexerror(i2, 12368, 0);
+ }
+ i13 = i11 << 1;
+ i20 = HEAP32[i2 + 52 >> 2] | 0;
+ if ((i13 | 0) == -2) {
+ _luaM_toobig(i20);
+ } else {
+ i25 = _luaM_realloc_(i20, HEAP32[i10 >> 2] | 0, i11, i13) | 0;
+ HEAP32[i10 >> 2] = i25;
+ HEAP32[i12 >> 2] = i13;
+ i26 = HEAP32[i9 >> 2] | 0;
+ break;
+ }
+ } else {
+ i26 = i13;
+ i25 = HEAP32[i10 >> 2] | 0;
+ }
+ } while (0);
+ HEAP32[i9 >> 2] = i26 + 1;
+ HEAP8[i25 + i26 | 0] = 46;
+ i9 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i9 >> 2] | 0;
+ HEAP32[i9 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i20 = _luaZ_fill(i9) | 0;
+ } else {
+ i27 = i9 + 4 | 0;
+ i20 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i20 + 1;
+ i20 = HEAPU8[i20] | 0;
+ }
+ HEAP32[i2 >> 2] = i20;
+ if ((i20 | 0) != 0 ? (_memchr(12304, i20, 2) | 0) != 0 : 0) {
+ i6 = HEAP32[i4 >> 2] | 0;
+ i3 = i6 + 4 | 0;
+ i9 = HEAP32[i3 >> 2] | 0;
+ i8 = i6 + 8 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ do {
+ if ((i9 + 1 | 0) >>> 0 > i7 >>> 0) {
+ if (i7 >>> 0 > 2147483645) {
+ _lexerror(i2, 12368, 0);
+ }
+ i9 = i7 << 1;
+ i10 = HEAP32[i2 + 52 >> 2] | 0;
+ if ((i9 | 0) == -2) {
+ _luaM_toobig(i10);
+ } else {
+ i21 = _luaM_realloc_(i10, HEAP32[i6 >> 2] | 0, i7, i9) | 0;
+ HEAP32[i6 >> 2] = i21;
+ HEAP32[i8 >> 2] = i9;
+ i22 = HEAP32[i3 >> 2] | 0;
+ break;
+ }
+ } else {
+ i22 = i9;
+ i21 = HEAP32[i6 >> 2] | 0;
+ }
+ } while (0);
+ HEAP32[i3 >> 2] = i22 + 1;
+ HEAP8[i21 + i22 | 0] = i20;
+ i3 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i3 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i3 = _luaZ_fill(i3) | 0;
+ } else {
+ i27 = i3 + 4 | 0;
+ i3 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i3 + 1;
+ i3 = HEAPU8[i3] | 0;
+ }
+ HEAP32[i2 >> 2] = i3;
+ if ((i3 | 0) == 0) {
+ i27 = 279;
+ STACKTOP = i1;
+ return i27 | 0;
+ }
+ if ((_memchr(12304, i3, 2) | 0) == 0) {
+ i27 = 279;
+ STACKTOP = i1;
+ return i27 | 0;
+ }
+ i6 = HEAP32[i4 >> 2] | 0;
+ i7 = i6 + 4 | 0;
+ i9 = HEAP32[i7 >> 2] | 0;
+ i8 = i6 + 8 | 0;
+ i4 = HEAP32[i8 >> 2] | 0;
+ do {
+ if ((i9 + 1 | 0) >>> 0 > i4 >>> 0) {
+ if (i4 >>> 0 > 2147483645) {
+ _lexerror(i2, 12368, 0);
+ }
+ i10 = i4 << 1;
+ i9 = HEAP32[i2 + 52 >> 2] | 0;
+ if ((i10 | 0) == -2) {
+ _luaM_toobig(i9);
+ } else {
+ i18 = _luaM_realloc_(i9, HEAP32[i6 >> 2] | 0, i4, i10) | 0;
+ HEAP32[i6 >> 2] = i18;
+ HEAP32[i8 >> 2] = i10;
+ i19 = HEAP32[i7 >> 2] | 0;
+ break;
+ }
+ } else {
+ i19 = i9;
+ i18 = HEAP32[i6 >> 2] | 0;
+ }
+ } while (0);
+ HEAP32[i7 >> 2] = i19 + 1;
+ HEAP8[i18 + i19 | 0] = i3;
+ i3 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i3 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i3 = _luaZ_fill(i3) | 0;
+ } else {
+ i27 = i3 + 4 | 0;
+ i3 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i3 + 1;
+ i3 = HEAPU8[i3] | 0;
+ }
+ HEAP32[i2 >> 2] = i3;
+ i27 = 280;
+ STACKTOP = i1;
+ return i27 | 0;
+ }
+ if ((HEAP8[i20 + 10913 | 0] & 2) == 0) {
+ i27 = 46;
+ STACKTOP = i1;
+ return i27 | 0;
+ }
+ } else if ((i9 | 0) == 283) {
+ if ((HEAP8[i13 + 10913 | 0] & 1) == 0) {
+ i3 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i3 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i3 = _luaZ_fill(i3) | 0;
+ } else {
+ i27 = i3 + 4 | 0;
+ i3 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i3 + 1;
+ i3 = HEAPU8[i3] | 0;
+ }
+ HEAP32[i2 >> 2] = i3;
+ i27 = i13;
+ STACKTOP = i1;
+ return i27 | 0;
+ }
+ i10 = i2 + 52 | 0;
+ while (1) {
+ i11 = HEAP32[i4 >> 2] | 0;
+ i9 = i11 + 4 | 0;
+ i12 = HEAP32[i9 >> 2] | 0;
+ i19 = i11 + 8 | 0;
+ i18 = HEAP32[i19 >> 2] | 0;
+ if ((i12 + 1 | 0) >>> 0 > i18 >>> 0) {
+ if (i18 >>> 0 > 2147483645) {
+ i9 = 288;
+ break;
+ }
+ i21 = i18 << 1;
+ i12 = HEAP32[i10 >> 2] | 0;
+ if ((i21 | 0) == -2) {
+ i9 = 290;
+ break;
+ }
+ i27 = _luaM_realloc_(i12, HEAP32[i11 >> 2] | 0, i18, i21) | 0;
+ HEAP32[i11 >> 2] = i27;
+ HEAP32[i19 >> 2] = i21;
+ i12 = HEAP32[i9 >> 2] | 0;
+ i11 = i27;
+ } else {
+ i11 = HEAP32[i11 >> 2] | 0;
+ }
+ HEAP32[i9 >> 2] = i12 + 1;
+ HEAP8[i11 + i12 | 0] = i13;
+ i9 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i9 >> 2] | 0;
+ HEAP32[i9 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i13 = _luaZ_fill(i9) | 0;
+ } else {
+ i27 = i9 + 4 | 0;
+ i13 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i13 + 1;
+ i13 = HEAPU8[i13] | 0;
+ }
+ HEAP32[i2 >> 2] = i13;
+ if ((HEAP8[i13 + 10913 | 0] & 3) == 0) {
+ i9 = 296;
+ break;
+ }
+ }
+ if ((i9 | 0) == 288) {
+ _lexerror(i2, 12368, 0);
+ } else if ((i9 | 0) == 290) {
+ _luaM_toobig(i12);
+ } else if ((i9 | 0) == 296) {
+ i6 = HEAP32[i4 >> 2] | 0;
+ i4 = HEAP32[i10 >> 2] | 0;
+ i6 = _luaS_newlstr(i4, HEAP32[i6 >> 2] | 0, HEAP32[i6 + 4 >> 2] | 0) | 0;
+ i7 = i4 + 8 | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = i8 + 16;
+ HEAP32[i8 >> 2] = i6;
+ i5 = i6 + 4 | 0;
+ HEAP32[i8 + 8 >> 2] = HEAPU8[i5] | 64;
+ i8 = _luaH_set(i4, HEAP32[(HEAP32[i2 + 48 >> 2] | 0) + 4 >> 2] | 0, (HEAP32[i7 >> 2] | 0) + -16 | 0) | 0;
+ i2 = i8 + 8 | 0;
+ if ((HEAP32[i2 >> 2] | 0) == 0 ? (HEAP32[i8 >> 2] = 1, HEAP32[i2 >> 2] = 1, (HEAP32[(HEAP32[i4 + 12 >> 2] | 0) + 12 >> 2] | 0) > 0) : 0) {
+ _luaC_step(i4);
+ }
+ HEAP32[i7 >> 2] = (HEAP32[i7 >> 2] | 0) + -16;
+ HEAP32[i3 >> 2] = i6;
+ if ((HEAP8[i5] | 0) != 4) {
+ i27 = 288;
+ STACKTOP = i1;
+ return i27 | 0;
+ }
+ i2 = HEAP8[i6 + 6 | 0] | 0;
+ if (i2 << 24 >> 24 == 0) {
+ i27 = 288;
+ STACKTOP = i1;
+ return i27 | 0;
+ }
+ i27 = i2 & 255 | 256;
+ STACKTOP = i1;
+ return i27 | 0;
+ }
+ } else if ((i9 | 0) == 306) {
+ STACKTOP = i1;
+ return i2 | 0;
+ }
+ i9 = HEAP32[i4 >> 2] | 0;
+ i12 = i9 + 4 | 0;
+ i13 = HEAP32[i12 >> 2] | 0;
+ i11 = i9 + 8 | 0;
+ i10 = HEAP32[i11 >> 2] | 0;
+ do {
+ if ((i13 + 1 | 0) >>> 0 > i10 >>> 0) {
+ if (i10 >>> 0 > 2147483645) {
+ _lexerror(i2, 12368, 0);
+ }
+ i18 = i10 << 1;
+ i13 = HEAP32[i2 + 52 >> 2] | 0;
+ if ((i18 | 0) == -2) {
+ _luaM_toobig(i13);
+ } else {
+ i16 = _luaM_realloc_(i13, HEAP32[i9 >> 2] | 0, i10, i18) | 0;
+ HEAP32[i9 >> 2] = i16;
+ HEAP32[i11 >> 2] = i18;
+ i17 = HEAP32[i12 >> 2] | 0;
+ break;
+ }
+ } else {
+ i17 = i13;
+ i16 = HEAP32[i9 >> 2] | 0;
+ }
+ } while (0);
+ HEAP32[i12 >> 2] = i17 + 1;
+ HEAP8[i16 + i17 | 0] = i20;
+ i9 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i9 >> 2] | 0;
+ HEAP32[i9 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i9 = _luaZ_fill(i9) | 0;
+ } else {
+ i27 = i9 + 4 | 0;
+ i9 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i9 + 1;
+ i9 = HEAPU8[i9] | 0;
+ }
+ HEAP32[i2 >> 2] = i9;
+ if ((i20 | 0) == 48) {
+ if ((i9 | 0) != 0) {
+ if ((_memchr(12320, i9, 3) | 0) == 0) {
+ i15 = i9;
+ i9 = 12312;
+ } else {
+ i10 = HEAP32[i4 >> 2] | 0;
+ i13 = i10 + 4 | 0;
+ i16 = HEAP32[i13 >> 2] | 0;
+ i11 = i10 + 8 | 0;
+ i12 = HEAP32[i11 >> 2] | 0;
+ do {
+ if ((i16 + 1 | 0) >>> 0 > i12 >>> 0) {
+ if (i12 >>> 0 > 2147483645) {
+ _lexerror(i2, 12368, 0);
+ }
+ i17 = i12 << 1;
+ i16 = HEAP32[i2 + 52 >> 2] | 0;
+ if ((i17 | 0) == -2) {
+ _luaM_toobig(i16);
+ } else {
+ i15 = _luaM_realloc_(i16, HEAP32[i10 >> 2] | 0, i12, i17) | 0;
+ HEAP32[i10 >> 2] = i15;
+ HEAP32[i11 >> 2] = i17;
+ i14 = HEAP32[i13 >> 2] | 0;
+ break;
+ }
+ } else {
+ i14 = i16;
+ i15 = HEAP32[i10 >> 2] | 0;
+ }
+ } while (0);
+ HEAP32[i13 >> 2] = i14 + 1;
+ HEAP8[i15 + i14 | 0] = i9;
+ i9 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i9 >> 2] | 0;
+ HEAP32[i9 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i15 = _luaZ_fill(i9) | 0;
+ } else {
+ i27 = i9 + 4 | 0;
+ i15 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i15 + 1;
+ i15 = HEAPU8[i15] | 0;
+ }
+ HEAP32[i2 >> 2] = i15;
+ i9 = 12328;
+ }
+ } else {
+ i15 = 0;
+ i9 = 12312;
+ }
+ } else {
+ i15 = i9;
+ i9 = 12312;
+ }
+ i10 = i2 + 52 | 0;
+ while (1) {
+ if ((i15 | 0) != 0) {
+ if ((_memchr(i9, i15, 3) | 0) != 0) {
+ i12 = HEAP32[i4 >> 2] | 0;
+ i11 = i12 + 4 | 0;
+ i16 = HEAP32[i11 >> 2] | 0;
+ i14 = i12 + 8 | 0;
+ i13 = HEAP32[i14 >> 2] | 0;
+ if ((i16 + 1 | 0) >>> 0 > i13 >>> 0) {
+ if (i13 >>> 0 > 2147483645) {
+ i9 = 227;
+ break;
+ }
+ i17 = i13 << 1;
+ i16 = HEAP32[i10 >> 2] | 0;
+ if ((i17 | 0) == -2) {
+ i9 = 229;
+ break;
+ }
+ i27 = _luaM_realloc_(i16, HEAP32[i12 >> 2] | 0, i13, i17) | 0;
+ HEAP32[i12 >> 2] = i27;
+ HEAP32[i14 >> 2] = i17;
+ i16 = HEAP32[i11 >> 2] | 0;
+ i12 = i27;
+ } else {
+ i12 = HEAP32[i12 >> 2] | 0;
+ }
+ HEAP32[i11 >> 2] = i16 + 1;
+ HEAP8[i12 + i16 | 0] = i15;
+ i11 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i11 >> 2] | 0;
+ HEAP32[i11 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i15 = _luaZ_fill(i11) | 0;
+ } else {
+ i27 = i11 + 4 | 0;
+ i15 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i15 + 1;
+ i15 = HEAPU8[i15] | 0;
+ }
+ HEAP32[i2 >> 2] = i15;
+ if ((i15 | 0) != 0) {
+ if ((_memchr(12336, i15, 3) | 0) != 0) {
+ i12 = HEAP32[i4 >> 2] | 0;
+ i11 = i12 + 4 | 0;
+ i16 = HEAP32[i11 >> 2] | 0;
+ i14 = i12 + 8 | 0;
+ i13 = HEAP32[i14 >> 2] | 0;
+ if ((i16 + 1 | 0) >>> 0 > i13 >>> 0) {
+ if (i13 >>> 0 > 2147483645) {
+ i9 = 239;
+ break;
+ }
+ i17 = i13 << 1;
+ i16 = HEAP32[i10 >> 2] | 0;
+ if ((i17 | 0) == -2) {
+ i9 = 241;
+ break;
+ }
+ i27 = _luaM_realloc_(i16, HEAP32[i12 >> 2] | 0, i13, i17) | 0;
+ HEAP32[i12 >> 2] = i27;
+ HEAP32[i14 >> 2] = i17;
+ i16 = HEAP32[i11 >> 2] | 0;
+ i12 = i27;
+ } else {
+ i12 = HEAP32[i12 >> 2] | 0;
+ }
+ HEAP32[i11 >> 2] = i16 + 1;
+ HEAP8[i12 + i16 | 0] = i15;
+ i11 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i11 >> 2] | 0;
+ HEAP32[i11 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i15 = _luaZ_fill(i11) | 0;
+ } else {
+ i27 = i11 + 4 | 0;
+ i15 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i15 + 1;
+ i15 = HEAPU8[i15] | 0;
+ }
+ HEAP32[i2 >> 2] = i15;
+ }
+ } else {
+ i15 = 0;
+ }
+ }
+ } else {
+ i15 = 0;
+ }
+ i12 = HEAP32[i4 >> 2] | 0;
+ i11 = i12 + 4 | 0;
+ i17 = HEAP32[i11 >> 2] | 0;
+ i14 = i12 + 8 | 0;
+ i13 = HEAP32[i14 >> 2] | 0;
+ i16 = (i17 + 1 | 0) >>> 0 > i13 >>> 0;
+ if (!((HEAP8[i15 + 10913 | 0] & 16) != 0 | (i15 | 0) == 46)) {
+ i9 = 259;
+ break;
+ }
+ if (i16) {
+ if (i13 >>> 0 > 2147483645) {
+ i9 = 251;
+ break;
+ }
+ i17 = i13 << 1;
+ i16 = HEAP32[i10 >> 2] | 0;
+ if ((i17 | 0) == -2) {
+ i9 = 253;
+ break;
+ }
+ i27 = _luaM_realloc_(i16, HEAP32[i12 >> 2] | 0, i13, i17) | 0;
+ HEAP32[i12 >> 2] = i27;
+ HEAP32[i14 >> 2] = i17;
+ i17 = HEAP32[i11 >> 2] | 0;
+ i12 = i27;
+ } else {
+ i12 = HEAP32[i12 >> 2] | 0;
+ }
+ HEAP32[i11 >> 2] = i17 + 1;
+ HEAP8[i12 + i17 | 0] = i15;
+ i11 = HEAP32[i5 >> 2] | 0;
+ i27 = HEAP32[i11 >> 2] | 0;
+ HEAP32[i11 >> 2] = i27 + -1;
+ if ((i27 | 0) == 0) {
+ i15 = _luaZ_fill(i11) | 0;
+ } else {
+ i27 = i11 + 4 | 0;
+ i15 = HEAP32[i27 >> 2] | 0;
+ HEAP32[i27 >> 2] = i15 + 1;
+ i15 = HEAPU8[i15] | 0;
+ }
+ HEAP32[i2 >> 2] = i15;
+ }
+ if ((i9 | 0) == 227) {
+ _lexerror(i2, 12368, 0);
+ } else if ((i9 | 0) == 229) {
+ _luaM_toobig(i16);
+ } else if ((i9 | 0) == 239) {
+ _lexerror(i2, 12368, 0);
+ } else if ((i9 | 0) == 241) {
+ _luaM_toobig(i16);
+ } else if ((i9 | 0) == 251) {
+ _lexerror(i2, 12368, 0);
+ } else if ((i9 | 0) == 253) {
+ _luaM_toobig(i16);
+ } else if ((i9 | 0) == 259) {
+ do {
+ if (i16) {
+ if (i13 >>> 0 > 2147483645) {
+ _lexerror(i2, 12368, 0);
+ }
+ i5 = i13 << 1;
+ i9 = HEAP32[i10 >> 2] | 0;
+ if ((i5 | 0) == -2) {
+ _luaM_toobig(i9);
+ } else {
+ i7 = _luaM_realloc_(i9, HEAP32[i12 >> 2] | 0, i13, i5) | 0;
+ HEAP32[i12 >> 2] = i7;
+ HEAP32[i14 >> 2] = i5;
+ i8 = HEAP32[i11 >> 2] | 0;
+ break;
+ }
+ } else {
+ i8 = i17;
+ i7 = HEAP32[i12 >> 2] | 0;
+ }
+ } while (0);
+ HEAP32[i11 >> 2] = i8 + 1;
+ HEAP8[i7 + i8 | 0] = 0;
+ i5 = i2 + 76 | 0;
+ i7 = HEAP8[i5] | 0;
+ i10 = HEAP32[i4 >> 2] | 0;
+ i8 = HEAP32[i10 >> 2] | 0;
+ i10 = HEAP32[i10 + 4 >> 2] | 0;
+ if ((i10 | 0) == 0) {
+ i7 = -1;
+ } else {
+ do {
+ i10 = i10 + -1 | 0;
+ i9 = i8 + i10 | 0;
+ if ((HEAP8[i9] | 0) == 46) {
+ HEAP8[i9] = i7;
+ }
+ } while ((i10 | 0) != 0);
+ i7 = HEAP32[i4 >> 2] | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ i7 = (HEAP32[i7 + 4 >> 2] | 0) + -1 | 0;
+ }
+ if ((_luaO_str2d(i8, i7, i3) | 0) != 0) {
+ i27 = 287;
+ STACKTOP = i1;
+ return i27 | 0;
+ }
+ i9 = HEAP8[i5] | 0;
+ i8 = HEAP8[HEAP32[(_localeconv() | 0) >> 2] | 0] | 0;
+ HEAP8[i5] = i8;
+ i10 = HEAP32[i4 >> 2] | 0;
+ i7 = HEAP32[i10 >> 2] | 0;
+ i10 = HEAP32[i10 + 4 >> 2] | 0;
+ if ((i10 | 0) == 0) {
+ i8 = -1;
+ } else {
+ do {
+ i10 = i10 + -1 | 0;
+ i11 = i7 + i10 | 0;
+ if ((HEAP8[i11] | 0) == i9 << 24 >> 24) {
+ HEAP8[i11] = i8;
+ }
+ } while ((i10 | 0) != 0);
+ i8 = HEAP32[i4 >> 2] | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ i8 = (HEAP32[i8 + 4 >> 2] | 0) + -1 | 0;
+ }
+ if ((_luaO_str2d(i7, i8, i3) | 0) != 0) {
+ i27 = 287;
+ STACKTOP = i1;
+ return i27 | 0;
+ }
+ i1 = HEAP8[i5] | 0;
+ i4 = HEAP32[i4 >> 2] | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ i4 = HEAP32[i4 + 4 >> 2] | 0;
+ if ((i4 | 0) == 0) {
+ _lexerror(i2, 12344, 287);
+ } else {
+ i6 = i4;
+ }
+ do {
+ i6 = i6 + -1 | 0;
+ i4 = i3 + i6 | 0;
+ if ((HEAP8[i4] | 0) == i1 << 24 >> 24) {
+ HEAP8[i4] = 46;
+ }
+ } while ((i6 | 0) != 0);
+ _lexerror(i2, 12344, 287);
+ }
+ return 0;
+}
+function _luaV_execute(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0, i30 = 0, i31 = 0, i32 = 0, i33 = 0, i34 = 0, i35 = 0, i36 = 0, d37 = 0.0, d38 = 0.0, d39 = 0.0;
+ i12 = STACKTOP;
+ STACKTOP = STACKTOP + 32 | 0;
+ i13 = i12 + 24 | 0;
+ i10 = i12 + 16 | 0;
+ i9 = i12 + 8 | 0;
+ i8 = i12;
+ i3 = i1 + 16 | 0;
+ i4 = i1 + 40 | 0;
+ i6 = i1 + 12 | 0;
+ i5 = i1 + 8 | 0;
+ i11 = i1 + 24 | 0;
+ i17 = i1 + 48 | 0;
+ i2 = i1 + 20 | 0;
+ i16 = i1 + 6 | 0;
+ i7 = i1 + 44 | 0;
+ i19 = HEAP32[i3 >> 2] | 0;
+ L1 : while (1) {
+ i22 = HEAP32[HEAP32[i19 >> 2] >> 2] | 0;
+ i18 = i22 + 12 | 0;
+ i23 = HEAP32[(HEAP32[i18 >> 2] | 0) + 8 >> 2] | 0;
+ i20 = i19 + 24 | 0;
+ i21 = i19 + 28 | 0;
+ i22 = i22 + 16 | 0;
+ i24 = i19 + 4 | 0;
+ i25 = HEAP32[i20 >> 2] | 0;
+ L3 : while (1) {
+ i28 = HEAP32[i21 >> 2] | 0;
+ HEAP32[i21 >> 2] = i28 + 4;
+ i28 = HEAP32[i28 >> 2] | 0;
+ i27 = HEAP8[i4] | 0;
+ do {
+ if (!((i27 & 12) == 0)) {
+ i26 = (HEAP32[i17 >> 2] | 0) + -1 | 0;
+ HEAP32[i17 >> 2] = i26;
+ i26 = (i26 | 0) == 0;
+ if (!i26 ? (i27 & 4) == 0 : 0) {
+ break;
+ }
+ i25 = HEAP32[i3 >> 2] | 0;
+ i29 = i27 & 255;
+ if ((i29 & 8 | 0) == 0 | i26 ^ 1) {
+ i27 = 0;
+ } else {
+ HEAP32[i17 >> 2] = HEAP32[i7 >> 2];
+ i27 = 1;
+ }
+ i26 = i25 + 18 | 0;
+ i30 = HEAPU8[i26] | 0;
+ if ((i30 & 128 | 0) == 0) {
+ if (i27) {
+ _luaD_hook(i1, 3, -1);
+ }
+ do {
+ if ((i29 & 4 | 0) == 0) {
+ i29 = i25 + 28 | 0;
+ } else {
+ i34 = HEAP32[(HEAP32[HEAP32[i25 >> 2] >> 2] | 0) + 12 >> 2] | 0;
+ i29 = i25 + 28 | 0;
+ i32 = HEAP32[i29 >> 2] | 0;
+ i35 = HEAP32[i34 + 12 >> 2] | 0;
+ i33 = (i32 - i35 >> 2) + -1 | 0;
+ i34 = HEAP32[i34 + 20 >> 2] | 0;
+ i31 = (i34 | 0) == 0;
+ if (i31) {
+ i30 = 0;
+ } else {
+ i30 = HEAP32[i34 + (i33 << 2) >> 2] | 0;
+ }
+ if ((i33 | 0) != 0 ? (i14 = HEAP32[i2 >> 2] | 0, i32 >>> 0 > i14 >>> 0) : 0) {
+ if (i31) {
+ i31 = 0;
+ } else {
+ i31 = HEAP32[i34 + ((i14 - i35 >> 2) + -1 << 2) >> 2] | 0;
+ }
+ if ((i30 | 0) == (i31 | 0)) {
+ break;
+ }
+ }
+ _luaD_hook(i1, 2, i30);
+ }
+ } while (0);
+ HEAP32[i2 >> 2] = HEAP32[i29 >> 2];
+ if ((HEAP8[i16] | 0) == 1) {
+ i15 = 23;
+ break L1;
+ }
+ } else {
+ HEAP8[i26] = i30 & 127;
+ }
+ i25 = HEAP32[i20 >> 2] | 0;
+ }
+ } while (0);
+ i26 = i28 >>> 6 & 255;
+ i27 = i25 + (i26 << 4) | 0;
+ switch (i28 & 63 | 0) {
+ case 9:
+ {
+ i28 = HEAP32[i22 + (i28 >>> 23 << 2) >> 2] | 0;
+ i35 = HEAP32[i28 + 8 >> 2] | 0;
+ i33 = i27;
+ i34 = HEAP32[i33 + 4 >> 2] | 0;
+ i36 = i35;
+ HEAP32[i36 >> 2] = HEAP32[i33 >> 2];
+ HEAP32[i36 + 4 >> 2] = i34;
+ i36 = i25 + (i26 << 4) + 8 | 0;
+ HEAP32[i35 + 8 >> 2] = HEAP32[i36 >> 2];
+ if ((HEAP32[i36 >> 2] & 64 | 0) == 0) {
+ continue L3;
+ }
+ i26 = HEAP32[i27 >> 2] | 0;
+ if ((HEAP8[i26 + 5 | 0] & 3) == 0) {
+ continue L3;
+ }
+ if ((HEAP8[i28 + 5 | 0] & 4) == 0) {
+ continue L3;
+ }
+ _luaC_barrier_(i1, i28, i26);
+ continue L3;
+ }
+ case 10:
+ {
+ i26 = i28 >>> 23;
+ if ((i26 & 256 | 0) == 0) {
+ i26 = i25 + (i26 << 4) | 0;
+ } else {
+ i26 = i23 + ((i26 & 255) << 4) | 0;
+ }
+ i28 = i28 >>> 14;
+ if ((i28 & 256 | 0) == 0) {
+ i25 = i25 + ((i28 & 511) << 4) | 0;
+ } else {
+ i25 = i23 + ((i28 & 255) << 4) | 0;
+ }
+ _luaV_settable(i1, i27, i26, i25);
+ i25 = HEAP32[i20 >> 2] | 0;
+ continue L3;
+ }
+ case 17:
+ {
+ i29 = i28 >>> 23;
+ if ((i29 & 256 | 0) == 0) {
+ i29 = i25 + (i29 << 4) | 0;
+ } else {
+ i29 = i23 + ((i29 & 255) << 4) | 0;
+ }
+ i28 = i28 >>> 14;
+ if ((i28 & 256 | 0) == 0) {
+ i28 = i25 + ((i28 & 511) << 4) | 0;
+ } else {
+ i28 = i23 + ((i28 & 255) << 4) | 0;
+ }
+ if ((HEAP32[i29 + 8 >> 2] | 0) == 3 ? (HEAP32[i28 + 8 >> 2] | 0) == 3 : 0) {
+ d37 = +HEAPF64[i29 >> 3];
+ d38 = +HEAPF64[i28 >> 3];
+ HEAPF64[i27 >> 3] = d37 - d38 * +Math_floor(+(d37 / d38));
+ HEAP32[i25 + (i26 << 4) + 8 >> 2] = 3;
+ continue L3;
+ }
+ _luaV_arith(i1, i27, i29, i28, 10);
+ i25 = HEAP32[i20 >> 2] | 0;
+ continue L3;
+ }
+ case 23:
+ {
+ if ((i26 | 0) != 0) {
+ _luaF_close(i1, (HEAP32[i20 >> 2] | 0) + (i26 + -1 << 4) | 0);
+ }
+ HEAP32[i21 >> 2] = (HEAP32[i21 >> 2] | 0) + ((i28 >>> 14) + -131071 << 2);
+ continue L3;
+ }
+ case 24:
+ {
+ i27 = i28 >>> 23;
+ if ((i27 & 256 | 0) == 0) {
+ i27 = i25 + (i27 << 4) | 0;
+ } else {
+ i27 = i23 + ((i27 & 255) << 4) | 0;
+ }
+ i28 = i28 >>> 14;
+ if ((i28 & 256 | 0) == 0) {
+ i25 = i25 + ((i28 & 511) << 4) | 0;
+ } else {
+ i25 = i23 + ((i28 & 255) << 4) | 0;
+ }
+ if ((HEAP32[i27 + 8 >> 2] | 0) == (HEAP32[i25 + 8 >> 2] | 0)) {
+ i27 = (_luaV_equalobj_(i1, i27, i25) | 0) != 0;
+ } else {
+ i27 = 0;
+ }
+ i25 = HEAP32[i21 >> 2] | 0;
+ if ((i27 & 1 | 0) == (i26 | 0)) {
+ i26 = HEAP32[i25 >> 2] | 0;
+ i27 = i26 >>> 6 & 255;
+ if ((i27 | 0) != 0) {
+ _luaF_close(i1, (HEAP32[i20 >> 2] | 0) + (i27 + -1 << 4) | 0);
+ i25 = HEAP32[i21 >> 2] | 0;
+ }
+ i25 = i25 + ((i26 >>> 14) + -131070 << 2) | 0;
+ } else {
+ i25 = i25 + 4 | 0;
+ }
+ HEAP32[i21 >> 2] = i25;
+ i25 = HEAP32[i20 >> 2] | 0;
+ continue L3;
+ }
+ case 18:
+ {
+ i29 = i28 >>> 23;
+ if ((i29 & 256 | 0) == 0) {
+ i29 = i25 + (i29 << 4) | 0;
+ } else {
+ i29 = i23 + ((i29 & 255) << 4) | 0;
+ }
+ i28 = i28 >>> 14;
+ if ((i28 & 256 | 0) == 0) {
+ i28 = i25 + ((i28 & 511) << 4) | 0;
+ } else {
+ i28 = i23 + ((i28 & 255) << 4) | 0;
+ }
+ if ((HEAP32[i29 + 8 >> 2] | 0) == 3 ? (HEAP32[i28 + 8 >> 2] | 0) == 3 : 0) {
+ HEAPF64[i27 >> 3] = +Math_pow(+(+HEAPF64[i29 >> 3]), +(+HEAPF64[i28 >> 3]));
+ HEAP32[i25 + (i26 << 4) + 8 >> 2] = 3;
+ continue L3;
+ }
+ _luaV_arith(i1, i27, i29, i28, 11);
+ i25 = HEAP32[i20 >> 2] | 0;
+ continue L3;
+ }
+ case 1:
+ {
+ i36 = i28 >>> 14;
+ i33 = i23 + (i36 << 4) | 0;
+ i34 = HEAP32[i33 + 4 >> 2] | 0;
+ i35 = i27;
+ HEAP32[i35 >> 2] = HEAP32[i33 >> 2];
+ HEAP32[i35 + 4 >> 2] = i34;
+ HEAP32[i25 + (i26 << 4) + 8 >> 2] = HEAP32[i23 + (i36 << 4) + 8 >> 2];
+ continue L3;
+ }
+ case 0:
+ {
+ i36 = i28 >>> 23;
+ i33 = i25 + (i36 << 4) | 0;
+ i34 = HEAP32[i33 + 4 >> 2] | 0;
+ i35 = i27;
+ HEAP32[i35 >> 2] = HEAP32[i33 >> 2];
+ HEAP32[i35 + 4 >> 2] = i34;
+ HEAP32[i25 + (i26 << 4) + 8 >> 2] = HEAP32[i25 + (i36 << 4) + 8 >> 2];
+ continue L3;
+ }
+ case 2:
+ {
+ i36 = HEAP32[i21 >> 2] | 0;
+ HEAP32[i21 >> 2] = i36 + 4;
+ i36 = (HEAP32[i36 >> 2] | 0) >>> 6;
+ i33 = i23 + (i36 << 4) | 0;
+ i34 = HEAP32[i33 + 4 >> 2] | 0;
+ i35 = i27;
+ HEAP32[i35 >> 2] = HEAP32[i33 >> 2];
+ HEAP32[i35 + 4 >> 2] = i34;
+ HEAP32[i25 + (i26 << 4) + 8 >> 2] = HEAP32[i23 + (i36 << 4) + 8 >> 2];
+ continue L3;
+ }
+ case 5:
+ {
+ i36 = HEAP32[(HEAP32[i22 + (i28 >>> 23 << 2) >> 2] | 0) + 8 >> 2] | 0;
+ i33 = i36;
+ i34 = HEAP32[i33 + 4 >> 2] | 0;
+ i35 = i27;
+ HEAP32[i35 >> 2] = HEAP32[i33 >> 2];
+ HEAP32[i35 + 4 >> 2] = i34;
+ HEAP32[i25 + (i26 << 4) + 8 >> 2] = HEAP32[i36 + 8 >> 2];
+ continue L3;
+ }
+ case 3:
+ {
+ HEAP32[i27 >> 2] = i28 >>> 23;
+ HEAP32[i25 + (i26 << 4) + 8 >> 2] = 1;
+ if ((i28 & 8372224 | 0) == 0) {
+ continue L3;
+ }
+ HEAP32[i21 >> 2] = (HEAP32[i21 >> 2] | 0) + 4;
+ continue L3;
+ }
+ case 7:
+ {
+ i26 = i28 >>> 14;
+ if ((i26 & 256 | 0) == 0) {
+ i26 = i25 + ((i26 & 511) << 4) | 0;
+ } else {
+ i26 = i23 + ((i26 & 255) << 4) | 0;
+ }
+ _luaV_gettable(i1, i25 + (i28 >>> 23 << 4) | 0, i26, i27);
+ i25 = HEAP32[i20 >> 2] | 0;
+ continue L3;
+ }
+ case 12:
+ {
+ i36 = i28 >>> 23;
+ i29 = i25 + (i36 << 4) | 0;
+ i26 = i26 + 1 | 0;
+ i33 = i29;
+ i34 = HEAP32[i33 + 4 >> 2] | 0;
+ i35 = i25 + (i26 << 4) | 0;
+ HEAP32[i35 >> 2] = HEAP32[i33 >> 2];
+ HEAP32[i35 + 4 >> 2] = i34;
+ HEAP32[i25 + (i26 << 4) + 8 >> 2] = HEAP32[i25 + (i36 << 4) + 8 >> 2];
+ i26 = i28 >>> 14;
+ if ((i26 & 256 | 0) == 0) {
+ i25 = i25 + ((i26 & 511) << 4) | 0;
+ } else {
+ i25 = i23 + ((i26 & 255) << 4) | 0;
+ }
+ _luaV_gettable(i1, i29, i25, i27);
+ i25 = HEAP32[i20 >> 2] | 0;
+ continue L3;
+ }
+ case 13:
+ {
+ i29 = i28 >>> 23;
+ if ((i29 & 256 | 0) == 0) {
+ i29 = i25 + (i29 << 4) | 0;
+ } else {
+ i29 = i23 + ((i29 & 255) << 4) | 0;
+ }
+ i28 = i28 >>> 14;
+ if ((i28 & 256 | 0) == 0) {
+ i28 = i25 + ((i28 & 511) << 4) | 0;
+ } else {
+ i28 = i23 + ((i28 & 255) << 4) | 0;
+ }
+ if ((HEAP32[i29 + 8 >> 2] | 0) == 3 ? (HEAP32[i28 + 8 >> 2] | 0) == 3 : 0) {
+ HEAPF64[i27 >> 3] = +HEAPF64[i29 >> 3] + +HEAPF64[i28 >> 3];
+ HEAP32[i25 + (i26 << 4) + 8 >> 2] = 3;
+ continue L3;
+ }
+ _luaV_arith(i1, i27, i29, i28, 6);
+ i25 = HEAP32[i20 >> 2] | 0;
+ continue L3;
+ }
+ case 14:
+ {
+ i29 = i28 >>> 23;
+ if ((i29 & 256 | 0) == 0) {
+ i29 = i25 + (i29 << 4) | 0;
+ } else {
+ i29 = i23 + ((i29 & 255) << 4) | 0;
+ }
+ i28 = i28 >>> 14;
+ if ((i28 & 256 | 0) == 0) {
+ i28 = i25 + ((i28 & 511) << 4) | 0;
+ } else {
+ i28 = i23 + ((i28 & 255) << 4) | 0;
+ }
+ if ((HEAP32[i29 + 8 >> 2] | 0) == 3 ? (HEAP32[i28 + 8 >> 2] | 0) == 3 : 0) {
+ HEAPF64[i27 >> 3] = +HEAPF64[i29 >> 3] - +HEAPF64[i28 >> 3];
+ HEAP32[i25 + (i26 << 4) + 8 >> 2] = 3;
+ continue L3;
+ }
+ _luaV_arith(i1, i27, i29, i28, 7);
+ i25 = HEAP32[i20 >> 2] | 0;
+ continue L3;
+ }
+ case 6:
+ {
+ i26 = i28 >>> 14;
+ if ((i26 & 256 | 0) == 0) {
+ i25 = i25 + ((i26 & 511) << 4) | 0;
+ } else {
+ i25 = i23 + ((i26 & 255) << 4) | 0;
+ }
+ _luaV_gettable(i1, HEAP32[(HEAP32[i22 + (i28 >>> 23 << 2) >> 2] | 0) + 8 >> 2] | 0, i25, i27);
+ i25 = HEAP32[i20 >> 2] | 0;
+ continue L3;
+ }
+ case 4:
+ {
+ i26 = i28 >>> 23;
+ while (1) {
+ HEAP32[i27 + 8 >> 2] = 0;
+ if ((i26 | 0) == 0) {
+ continue L3;
+ } else {
+ i26 = i26 + -1 | 0;
+ i27 = i27 + 16 | 0;
+ }
+ }
+ }
+ case 8:
+ {
+ i27 = i28 >>> 23;
+ if ((i27 & 256 | 0) == 0) {
+ i27 = i25 + (i27 << 4) | 0;
+ } else {
+ i27 = i23 + ((i27 & 255) << 4) | 0;
+ }
+ i28 = i28 >>> 14;
+ if ((i28 & 256 | 0) == 0) {
+ i25 = i25 + ((i28 & 511) << 4) | 0;
+ } else {
+ i25 = i23 + ((i28 & 255) << 4) | 0;
+ }
+ _luaV_settable(i1, HEAP32[(HEAP32[i22 + (i26 << 2) >> 2] | 0) + 8 >> 2] | 0, i27, i25);
+ i25 = HEAP32[i20 >> 2] | 0;
+ continue L3;
+ }
+ case 11:
+ {
+ i29 = i28 >>> 23;
+ i28 = i28 >>> 14 & 511;
+ i30 = _luaH_new(i1) | 0;
+ HEAP32[i27 >> 2] = i30;
+ HEAP32[i25 + (i26 << 4) + 8 >> 2] = 69;
+ if ((i28 | i29 | 0) != 0) {
+ i36 = _luaO_fb2int(i29) | 0;
+ _luaH_resize(i1, i30, i36, _luaO_fb2int(i28) | 0);
+ }
+ if ((HEAP32[(HEAP32[i6 >> 2] | 0) + 12 >> 2] | 0) > 0) {
+ HEAP32[i5 >> 2] = i25 + (i26 + 1 << 4);
+ _luaC_step(i1);
+ HEAP32[i5 >> 2] = HEAP32[i24 >> 2];
+ }
+ i25 = HEAP32[i20 >> 2] | 0;
+ continue L3;
+ }
+ case 19:
+ {
+ i36 = i28 >>> 23;
+ i28 = i25 + (i36 << 4) | 0;
+ if ((HEAP32[i25 + (i36 << 4) + 8 >> 2] | 0) == 3) {
+ HEAPF64[i27 >> 3] = -+HEAPF64[i28 >> 3];
+ HEAP32[i25 + (i26 << 4) + 8 >> 2] = 3;
+ continue L3;
+ } else {
+ _luaV_arith(i1, i27, i28, i28, 12);
+ i25 = HEAP32[i20 >> 2] | 0;
+ continue L3;
+ }
+ }
+ case 15:
+ {
+ i29 = i28 >>> 23;
+ if ((i29 & 256 | 0) == 0) {
+ i29 = i25 + (i29 << 4) | 0;
+ } else {
+ i29 = i23 + ((i29 & 255) << 4) | 0;
+ }
+ i28 = i28 >>> 14;
+ if ((i28 & 256 | 0) == 0) {
+ i28 = i25 + ((i28 & 511) << 4) | 0;
+ } else {
+ i28 = i23 + ((i28 & 255) << 4) | 0;
+ }
+ if ((HEAP32[i29 + 8 >> 2] | 0) == 3 ? (HEAP32[i28 + 8 >> 2] | 0) == 3 : 0) {
+ HEAPF64[i27 >> 3] = +HEAPF64[i29 >> 3] * +HEAPF64[i28 >> 3];
+ HEAP32[i25 + (i26 << 4) + 8 >> 2] = 3;
+ continue L3;
+ }
+ _luaV_arith(i1, i27, i29, i28, 8);
+ i25 = HEAP32[i20 >> 2] | 0;
+ continue L3;
+ }
+ case 16:
+ {
+ i29 = i28 >>> 23;
+ if ((i29 & 256 | 0) == 0) {
+ i29 = i25 + (i29 << 4) | 0;
+ } else {
+ i29 = i23 + ((i29 & 255) << 4) | 0;
+ }
+ i28 = i28 >>> 14;
+ if ((i28 & 256 | 0) == 0) {
+ i28 = i25 + ((i28 & 511) << 4) | 0;
+ } else {
+ i28 = i23 + ((i28 & 255) << 4) | 0;
+ }
+ if ((HEAP32[i29 + 8 >> 2] | 0) == 3 ? (HEAP32[i28 + 8 >> 2] | 0) == 3 : 0) {
+ HEAPF64[i27 >> 3] = +HEAPF64[i29 >> 3] / +HEAPF64[i28 >> 3];
+ HEAP32[i25 + (i26 << 4) + 8 >> 2] = 3;
+ continue L3;
+ }
+ _luaV_arith(i1, i27, i29, i28, 9);
+ i25 = HEAP32[i20 >> 2] | 0;
+ continue L3;
+ }
+ case 20:
+ {
+ i29 = i28 >>> 23;
+ i28 = HEAP32[i25 + (i29 << 4) + 8 >> 2] | 0;
+ if ((i28 | 0) != 0) {
+ if ((i28 | 0) == 1) {
+ i28 = (HEAP32[i25 + (i29 << 4) >> 2] | 0) == 0;
+ } else {
+ i28 = 0;
+ }
+ } else {
+ i28 = 1;
+ }
+ HEAP32[i27 >> 2] = i28 & 1;
+ HEAP32[i25 + (i26 << 4) + 8 >> 2] = 1;
+ continue L3;
+ }
+ case 21:
+ {
+ _luaV_objlen(i1, i27, i25 + (i28 >>> 23 << 4) | 0);
+ i25 = HEAP32[i20 >> 2] | 0;
+ continue L3;
+ }
+ case 22:
+ {
+ i27 = i28 >>> 23;
+ i28 = i28 >>> 14 & 511;
+ HEAP32[i5 >> 2] = i25 + (i28 + 1 << 4);
+ _luaV_concat(i1, 1 - i27 + i28 | 0);
+ i25 = HEAP32[i20 >> 2] | 0;
+ i28 = i25 + (i27 << 4) | 0;
+ i34 = i28;
+ i35 = HEAP32[i34 + 4 >> 2] | 0;
+ i36 = i25 + (i26 << 4) | 0;
+ HEAP32[i36 >> 2] = HEAP32[i34 >> 2];
+ HEAP32[i36 + 4 >> 2] = i35;
+ HEAP32[i25 + (i26 << 4) + 8 >> 2] = HEAP32[i25 + (i27 << 4) + 8 >> 2];
+ if ((HEAP32[(HEAP32[i6 >> 2] | 0) + 12 >> 2] | 0) > 0) {
+ if (!(i26 >>> 0 < i27 >>> 0)) {
+ i28 = i25 + (i26 + 1 << 4) | 0;
+ }
+ HEAP32[i5 >> 2] = i28;
+ _luaC_step(i1);
+ HEAP32[i5 >> 2] = HEAP32[i24 >> 2];
+ }
+ i25 = HEAP32[i20 >> 2] | 0;
+ HEAP32[i5 >> 2] = HEAP32[i24 >> 2];
+ continue L3;
+ }
+ case 25:
+ {
+ i27 = i28 >>> 23;
+ if ((i27 & 256 | 0) == 0) {
+ i27 = i25 + (i27 << 4) | 0;
+ } else {
+ i27 = i23 + ((i27 & 255) << 4) | 0;
+ }
+ i28 = i28 >>> 14;
+ if ((i28 & 256 | 0) == 0) {
+ i25 = i25 + ((i28 & 511) << 4) | 0;
+ } else {
+ i25 = i23 + ((i28 & 255) << 4) | 0;
+ }
+ i36 = (_luaV_lessthan(i1, i27, i25) | 0) == (i26 | 0);
+ i26 = HEAP32[i21 >> 2] | 0;
+ if (i36) {
+ i25 = HEAP32[i26 >> 2] | 0;
+ i27 = i25 >>> 6 & 255;
+ if ((i27 | 0) != 0) {
+ _luaF_close(i1, (HEAP32[i20 >> 2] | 0) + (i27 + -1 << 4) | 0);
+ i26 = HEAP32[i21 >> 2] | 0;
+ }
+ i25 = i26 + ((i25 >>> 14) + -131070 << 2) | 0;
+ } else {
+ i25 = i26 + 4 | 0;
+ }
+ HEAP32[i21 >> 2] = i25;
+ i25 = HEAP32[i20 >> 2] | 0;
+ continue L3;
+ }
+ case 27:
+ {
+ i29 = HEAP32[i25 + (i26 << 4) + 8 >> 2] | 0;
+ i26 = (i29 | 0) == 0;
+ if ((i28 & 8372224 | 0) == 0) {
+ if (!i26) {
+ if (!((i29 | 0) == 1 ? (HEAP32[i27 >> 2] | 0) == 0 : 0)) {
+ i15 = 192;
+ }
+ }
+ } else {
+ if (!i26) {
+ if ((i29 | 0) == 1 ? (HEAP32[i27 >> 2] | 0) == 0 : 0) {
+ i15 = 192;
+ }
+ } else {
+ i15 = 192;
+ }
+ }
+ if ((i15 | 0) == 192) {
+ i15 = 0;
+ HEAP32[i21 >> 2] = (HEAP32[i21 >> 2] | 0) + 4;
+ continue L3;
+ }
+ i27 = HEAP32[i21 >> 2] | 0;
+ i26 = HEAP32[i27 >> 2] | 0;
+ i28 = i26 >>> 6 & 255;
+ if ((i28 | 0) != 0) {
+ _luaF_close(i1, (HEAP32[i20 >> 2] | 0) + (i28 + -1 << 4) | 0);
+ i27 = HEAP32[i21 >> 2] | 0;
+ }
+ HEAP32[i21 >> 2] = i27 + ((i26 >>> 14) + -131070 << 2);
+ continue L3;
+ }
+ case 26:
+ {
+ i27 = i28 >>> 23;
+ if ((i27 & 256 | 0) == 0) {
+ i27 = i25 + (i27 << 4) | 0;
+ } else {
+ i27 = i23 + ((i27 & 255) << 4) | 0;
+ }
+ i28 = i28 >>> 14;
+ if ((i28 & 256 | 0) == 0) {
+ i25 = i25 + ((i28 & 511) << 4) | 0;
+ } else {
+ i25 = i23 + ((i28 & 255) << 4) | 0;
+ }
+ i36 = (_luaV_lessequal(i1, i27, i25) | 0) == (i26 | 0);
+ i26 = HEAP32[i21 >> 2] | 0;
+ if (i36) {
+ i25 = HEAP32[i26 >> 2] | 0;
+ i27 = i25 >>> 6 & 255;
+ if ((i27 | 0) != 0) {
+ _luaF_close(i1, (HEAP32[i20 >> 2] | 0) + (i27 + -1 << 4) | 0);
+ i26 = HEAP32[i21 >> 2] | 0;
+ }
+ i25 = i26 + ((i25 >>> 14) + -131070 << 2) | 0;
+ } else {
+ i25 = i26 + 4 | 0;
+ }
+ HEAP32[i21 >> 2] = i25;
+ i25 = HEAP32[i20 >> 2] | 0;
+ continue L3;
+ }
+ case 28:
+ {
+ i30 = i28 >>> 23;
+ i29 = i25 + (i30 << 4) | 0;
+ i30 = HEAP32[i25 + (i30 << 4) + 8 >> 2] | 0;
+ i31 = (i30 | 0) == 0;
+ if ((i28 & 8372224 | 0) == 0) {
+ if (!i31) {
+ if (!((i30 | 0) == 1 ? (HEAP32[i29 >> 2] | 0) == 0 : 0)) {
+ i15 = 203;
+ }
+ }
+ } else {
+ if (!i31) {
+ if ((i30 | 0) == 1 ? (HEAP32[i29 >> 2] | 0) == 0 : 0) {
+ i15 = 203;
+ }
+ } else {
+ i15 = 203;
+ }
+ }
+ if ((i15 | 0) == 203) {
+ i15 = 0;
+ HEAP32[i21 >> 2] = (HEAP32[i21 >> 2] | 0) + 4;
+ continue L3;
+ }
+ i36 = i29;
+ i28 = HEAP32[i36 + 4 >> 2] | 0;
+ HEAP32[i27 >> 2] = HEAP32[i36 >> 2];
+ HEAP32[i27 + 4 >> 2] = i28;
+ HEAP32[i25 + (i26 << 4) + 8 >> 2] = i30;
+ i27 = HEAP32[i21 >> 2] | 0;
+ i26 = HEAP32[i27 >> 2] | 0;
+ i28 = i26 >>> 6 & 255;
+ if ((i28 | 0) != 0) {
+ _luaF_close(i1, (HEAP32[i20 >> 2] | 0) + (i28 + -1 << 4) | 0);
+ i27 = HEAP32[i21 >> 2] | 0;
+ }
+ HEAP32[i21 >> 2] = i27 + ((i26 >>> 14) + -131070 << 2);
+ continue L3;
+ }
+ case 30:
+ {
+ i28 = i28 >>> 23;
+ if ((i28 | 0) != 0) {
+ HEAP32[i5 >> 2] = i25 + (i26 + i28 << 4);
+ }
+ if ((_luaD_precall(i1, i27, -1) | 0) == 0) {
+ i15 = 218;
+ break L3;
+ }
+ i25 = HEAP32[i20 >> 2] | 0;
+ continue L3;
+ }
+ case 29:
+ {
+ i29 = i28 >>> 23;
+ i28 = i28 >>> 14 & 511;
+ if ((i29 | 0) != 0) {
+ HEAP32[i5 >> 2] = i25 + (i26 + i29 << 4);
+ }
+ if ((_luaD_precall(i1, i27, i28 + -1 | 0) | 0) == 0) {
+ i15 = 213;
+ break L3;
+ }
+ if ((i28 | 0) != 0) {
+ HEAP32[i5 >> 2] = HEAP32[i24 >> 2];
+ }
+ i25 = HEAP32[i20 >> 2] | 0;
+ continue L3;
+ }
+ case 32:
+ {
+ d39 = +HEAPF64[i25 + (i26 + 2 << 4) >> 3];
+ d38 = d39 + +HEAPF64[i27 >> 3];
+ d37 = +HEAPF64[i25 + (i26 + 1 << 4) >> 3];
+ if (d39 > 0.0) {
+ if (!(d38 <= d37)) {
+ continue L3;
+ }
+ } else {
+ if (!(d37 <= d38)) {
+ continue L3;
+ }
+ }
+ HEAP32[i21 >> 2] = (HEAP32[i21 >> 2] | 0) + ((i28 >>> 14) + -131071 << 2);
+ HEAPF64[i27 >> 3] = d38;
+ HEAP32[i25 + (i26 << 4) + 8 >> 2] = 3;
+ i36 = i26 + 3 | 0;
+ HEAPF64[i25 + (i36 << 4) >> 3] = d38;
+ HEAP32[i25 + (i36 << 4) + 8 >> 2] = 3;
+ continue L3;
+ }
+ case 33:
+ {
+ i32 = i26 + 1 | 0;
+ i30 = i25 + (i32 << 4) | 0;
+ i31 = i26 + 2 | 0;
+ i29 = i25 + (i31 << 4) | 0;
+ i26 = i25 + (i26 << 4) + 8 | 0;
+ i33 = HEAP32[i26 >> 2] | 0;
+ if ((i33 | 0) != 3) {
+ if ((i33 & 15 | 0) != 4) {
+ i15 = 239;
+ break L1;
+ }
+ i36 = HEAP32[i27 >> 2] | 0;
+ if ((_luaO_str2d(i36 + 16 | 0, HEAP32[i36 + 12 >> 2] | 0, i8) | 0) == 0) {
+ i15 = 239;
+ break L1;
+ }
+ HEAPF64[i27 >> 3] = +HEAPF64[i8 >> 3];
+ HEAP32[i26 >> 2] = 3;
+ if ((i27 | 0) == 0) {
+ i15 = 239;
+ break L1;
+ }
+ }
+ i33 = i25 + (i32 << 4) + 8 | 0;
+ i32 = HEAP32[i33 >> 2] | 0;
+ if ((i32 | 0) != 3) {
+ if ((i32 & 15 | 0) != 4) {
+ i15 = 244;
+ break L1;
+ }
+ i36 = HEAP32[i30 >> 2] | 0;
+ if ((_luaO_str2d(i36 + 16 | 0, HEAP32[i36 + 12 >> 2] | 0, i9) | 0) == 0) {
+ i15 = 244;
+ break L1;
+ }
+ HEAPF64[i30 >> 3] = +HEAPF64[i9 >> 3];
+ HEAP32[i33 >> 2] = 3;
+ }
+ i31 = i25 + (i31 << 4) + 8 | 0;
+ i30 = HEAP32[i31 >> 2] | 0;
+ if ((i30 | 0) != 3) {
+ if ((i30 & 15 | 0) != 4) {
+ i15 = 249;
+ break L1;
+ }
+ i36 = HEAP32[i29 >> 2] | 0;
+ if ((_luaO_str2d(i36 + 16 | 0, HEAP32[i36 + 12 >> 2] | 0, i10) | 0) == 0) {
+ i15 = 249;
+ break L1;
+ }
+ HEAPF64[i29 >> 3] = +HEAPF64[i10 >> 3];
+ HEAP32[i31 >> 2] = 3;
+ }
+ HEAPF64[i27 >> 3] = +HEAPF64[i27 >> 3] - +HEAPF64[i29 >> 3];
+ HEAP32[i26 >> 2] = 3;
+ HEAP32[i21 >> 2] = (HEAP32[i21 >> 2] | 0) + ((i28 >>> 14) + -131071 << 2);
+ continue L3;
+ }
+ case 31:
+ {
+ i15 = 223;
+ break L3;
+ }
+ case 34:
+ {
+ i35 = i26 + 3 | 0;
+ i36 = i25 + (i35 << 4) | 0;
+ i33 = i26 + 2 | 0;
+ i34 = i26 + 5 | 0;
+ i32 = i25 + (i33 << 4) | 0;
+ i31 = HEAP32[i32 + 4 >> 2] | 0;
+ i30 = i25 + (i34 << 4) | 0;
+ HEAP32[i30 >> 2] = HEAP32[i32 >> 2];
+ HEAP32[i30 + 4 >> 2] = i31;
+ HEAP32[i25 + (i34 << 4) + 8 >> 2] = HEAP32[i25 + (i33 << 4) + 8 >> 2];
+ i34 = i26 + 1 | 0;
+ i33 = i26 + 4 | 0;
+ i30 = i25 + (i34 << 4) | 0;
+ i31 = HEAP32[i30 + 4 >> 2] | 0;
+ i32 = i25 + (i33 << 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i30 >> 2];
+ HEAP32[i32 + 4 >> 2] = i31;
+ HEAP32[i25 + (i33 << 4) + 8 >> 2] = HEAP32[i25 + (i34 << 4) + 8 >> 2];
+ i33 = i27;
+ i34 = HEAP32[i33 + 4 >> 2] | 0;
+ i27 = i36;
+ HEAP32[i27 >> 2] = HEAP32[i33 >> 2];
+ HEAP32[i27 + 4 >> 2] = i34;
+ HEAP32[i25 + (i35 << 4) + 8 >> 2] = HEAP32[i25 + (i26 << 4) + 8 >> 2];
+ HEAP32[i5 >> 2] = i25 + (i26 + 6 << 4);
+ _luaD_call(i1, i36, i28 >>> 14 & 511, 1);
+ i36 = HEAP32[i20 >> 2] | 0;
+ HEAP32[i5 >> 2] = HEAP32[i24 >> 2];
+ i27 = HEAP32[i21 >> 2] | 0;
+ HEAP32[i21 >> 2] = i27 + 4;
+ i27 = HEAP32[i27 >> 2] | 0;
+ i25 = i36;
+ i28 = i27;
+ i27 = i36 + ((i27 >>> 6 & 255) << 4) | 0;
+ break;
+ }
+ case 35:
+ {
+ break;
+ }
+ case 36:
+ {
+ i29 = i28 >>> 23;
+ i28 = i28 >>> 14 & 511;
+ if ((i29 | 0) == 0) {
+ i29 = ((HEAP32[i5 >> 2] | 0) - i27 >> 4) + -1 | 0;
+ }
+ if ((i28 | 0) == 0) {
+ i28 = HEAP32[i21 >> 2] | 0;
+ HEAP32[i21 >> 2] = i28 + 4;
+ i28 = (HEAP32[i28 >> 2] | 0) >>> 6;
+ }
+ i27 = HEAP32[i27 >> 2] | 0;
+ i30 = i29 + -50 + (i28 * 50 | 0) | 0;
+ if ((i30 | 0) > (HEAP32[i27 + 28 >> 2] | 0)) {
+ _luaH_resizearray(i1, i27, i30);
+ }
+ if ((i29 | 0) > 0) {
+ i28 = i27 + 5 | 0;
+ while (1) {
+ i36 = i29 + i26 | 0;
+ i32 = i25 + (i36 << 4) | 0;
+ i31 = i30 + -1 | 0;
+ _luaH_setint(i1, i27, i30, i32);
+ if (((HEAP32[i25 + (i36 << 4) + 8 >> 2] & 64 | 0) != 0 ? !((HEAP8[(HEAP32[i32 >> 2] | 0) + 5 | 0] & 3) == 0) : 0) ? !((HEAP8[i28] & 4) == 0) : 0) {
+ _luaC_barrierback_(i1, i27);
+ }
+ i29 = i29 + -1 | 0;
+ if ((i29 | 0) > 0) {
+ i30 = i31;
+ } else {
+ break;
+ }
+ }
+ }
+ HEAP32[i5 >> 2] = HEAP32[i24 >> 2];
+ continue L3;
+ }
+ case 37:
+ {
+ i29 = HEAP32[(HEAP32[(HEAP32[i18 >> 2] | 0) + 16 >> 2] | 0) + (i28 >>> 14 << 2) >> 2] | 0;
+ i28 = i29 + 32 | 0;
+ i33 = HEAP32[i28 >> 2] | 0;
+ i30 = HEAP32[i29 + 40 >> 2] | 0;
+ i31 = HEAP32[i29 + 28 >> 2] | 0;
+ L323 : do {
+ if ((i33 | 0) == 0) {
+ i15 = 276;
+ } else {
+ if ((i30 | 0) > 0) {
+ i34 = i33 + 16 | 0;
+ i32 = 0;
+ while (1) {
+ i35 = HEAPU8[i31 + (i32 << 3) + 5 | 0] | 0;
+ if ((HEAP8[i31 + (i32 << 3) + 4 | 0] | 0) == 0) {
+ i36 = HEAP32[(HEAP32[i22 + (i35 << 2) >> 2] | 0) + 8 >> 2] | 0;
+ } else {
+ i36 = i25 + (i35 << 4) | 0;
+ }
+ i35 = i32 + 1 | 0;
+ if ((HEAP32[(HEAP32[i34 + (i32 << 2) >> 2] | 0) + 8 >> 2] | 0) != (i36 | 0)) {
+ i15 = 276;
+ break L323;
+ }
+ if ((i35 | 0) < (i30 | 0)) {
+ i32 = i35;
+ } else {
+ break;
+ }
+ }
+ }
+ HEAP32[i27 >> 2] = i33;
+ HEAP32[i25 + (i26 << 4) + 8 >> 2] = 70;
+ }
+ } while (0);
+ if ((i15 | 0) == 276) {
+ i15 = 0;
+ i32 = _luaF_newLclosure(i1, i30) | 0;
+ HEAP32[i32 + 12 >> 2] = i29;
+ HEAP32[i27 >> 2] = i32;
+ HEAP32[i25 + (i26 << 4) + 8 >> 2] = 70;
+ if ((i30 | 0) > 0) {
+ i27 = i32 + 16 | 0;
+ i34 = 0;
+ do {
+ i33 = HEAPU8[i31 + (i34 << 3) + 5 | 0] | 0;
+ if ((HEAP8[i31 + (i34 << 3) + 4 | 0] | 0) == 0) {
+ HEAP32[i27 + (i34 << 2) >> 2] = HEAP32[i22 + (i33 << 2) >> 2];
+ } else {
+ HEAP32[i27 + (i34 << 2) >> 2] = _luaF_findupval(i1, i25 + (i33 << 4) | 0) | 0;
+ }
+ i34 = i34 + 1 | 0;
+ } while ((i34 | 0) != (i30 | 0));
+ }
+ if (!((HEAP8[i29 + 5 | 0] & 4) == 0)) {
+ _luaC_barrierproto_(i1, i29, i32);
+ }
+ HEAP32[i28 >> 2] = i32;
+ }
+ if ((HEAP32[(HEAP32[i6 >> 2] | 0) + 12 >> 2] | 0) > 0) {
+ HEAP32[i5 >> 2] = i25 + (i26 + 1 << 4);
+ _luaC_step(i1);
+ HEAP32[i5 >> 2] = HEAP32[i24 >> 2];
+ }
+ i25 = HEAP32[i20 >> 2] | 0;
+ continue L3;
+ }
+ case 38:
+ {
+ i36 = i28 >>> 23;
+ i29 = i36 + -1 | 0;
+ i30 = (i25 - (HEAP32[i19 >> 2] | 0) >> 4) - (HEAPU8[(HEAP32[i18 >> 2] | 0) + 76 | 0] | 0) | 0;
+ i28 = i30 + -1 | 0;
+ if ((i36 | 0) == 0) {
+ if (((HEAP32[i11 >> 2] | 0) - (HEAP32[i5 >> 2] | 0) >> 4 | 0) <= (i28 | 0)) {
+ _luaD_growstack(i1, i28);
+ }
+ i27 = HEAP32[i20 >> 2] | 0;
+ HEAP32[i5 >> 2] = i27 + (i28 + i26 << 4);
+ i29 = i28;
+ i25 = i27;
+ i27 = i27 + (i26 << 4) | 0;
+ }
+ if ((i29 | 0) <= 0) {
+ continue L3;
+ }
+ i26 = 1 - i30 | 0;
+ i30 = 0;
+ while (1) {
+ if ((i30 | 0) < (i28 | 0)) {
+ i36 = i30 + i26 | 0;
+ i33 = i25 + (i36 << 4) | 0;
+ i34 = HEAP32[i33 + 4 >> 2] | 0;
+ i35 = i27 + (i30 << 4) | 0;
+ HEAP32[i35 >> 2] = HEAP32[i33 >> 2];
+ HEAP32[i35 + 4 >> 2] = i34;
+ HEAP32[i27 + (i30 << 4) + 8 >> 2] = HEAP32[i25 + (i36 << 4) + 8 >> 2];
+ } else {
+ HEAP32[i27 + (i30 << 4) + 8 >> 2] = 0;
+ }
+ i30 = i30 + 1 | 0;
+ if ((i30 | 0) == (i29 | 0)) {
+ continue L3;
+ }
+ }
+ }
+ default:
+ {
+ continue L3;
+ }
+ }
+ i26 = HEAP32[i27 + 24 >> 2] | 0;
+ if ((i26 | 0) == 0) {
+ continue;
+ }
+ i34 = i27 + 16 | 0;
+ i35 = HEAP32[i34 + 4 >> 2] | 0;
+ i36 = i27;
+ HEAP32[i36 >> 2] = HEAP32[i34 >> 2];
+ HEAP32[i36 + 4 >> 2] = i35;
+ HEAP32[i27 + 8 >> 2] = i26;
+ HEAP32[i21 >> 2] = (HEAP32[i21 >> 2] | 0) + ((i28 >>> 14) + -131071 << 2);
+ }
+ if ((i15 | 0) == 213) {
+ i15 = 0;
+ i19 = HEAP32[i3 >> 2] | 0;
+ i36 = i19 + 18 | 0;
+ HEAP8[i36] = HEAPU8[i36] | 4;
+ continue;
+ } else if ((i15 | 0) == 218) {
+ i15 = 0;
+ i22 = HEAP32[i3 >> 2] | 0;
+ i19 = HEAP32[i22 + 8 >> 2] | 0;
+ i23 = HEAP32[i22 >> 2] | 0;
+ i24 = HEAP32[i19 >> 2] | 0;
+ i20 = i22 + 24 | 0;
+ i21 = (HEAP32[i20 >> 2] | 0) + (HEAPU8[(HEAP32[(HEAP32[i23 >> 2] | 0) + 12 >> 2] | 0) + 76 | 0] << 4) | 0;
+ if ((HEAP32[(HEAP32[i18 >> 2] | 0) + 56 >> 2] | 0) > 0) {
+ _luaF_close(i1, HEAP32[i19 + 24 >> 2] | 0);
+ }
+ if (i23 >>> 0 < i21 >>> 0) {
+ i25 = i23;
+ i18 = 0;
+ do {
+ i34 = i25;
+ i35 = HEAP32[i34 + 4 >> 2] | 0;
+ i36 = i24 + (i18 << 4) | 0;
+ HEAP32[i36 >> 2] = HEAP32[i34 >> 2];
+ HEAP32[i36 + 4 >> 2] = i35;
+ HEAP32[i24 + (i18 << 4) + 8 >> 2] = HEAP32[i23 + (i18 << 4) + 8 >> 2];
+ i18 = i18 + 1 | 0;
+ i25 = i23 + (i18 << 4) | 0;
+ } while (i25 >>> 0 < i21 >>> 0);
+ }
+ i36 = i23;
+ HEAP32[i19 + 24 >> 2] = i24 + ((HEAP32[i20 >> 2] | 0) - i36 >> 4 << 4);
+ i36 = i24 + ((HEAP32[i5 >> 2] | 0) - i36 >> 4 << 4) | 0;
+ HEAP32[i5 >> 2] = i36;
+ HEAP32[i19 + 4 >> 2] = i36;
+ HEAP32[i19 + 28 >> 2] = HEAP32[i22 + 28 >> 2];
+ i36 = i19 + 18 | 0;
+ HEAP8[i36] = HEAPU8[i36] | 64;
+ HEAP32[i3 >> 2] = i19;
+ continue;
+ } else if ((i15 | 0) == 223) {
+ i15 = 0;
+ i20 = i28 >>> 23;
+ if ((i20 | 0) != 0) {
+ HEAP32[i5 >> 2] = i25 + (i20 + -1 + i26 << 4);
+ }
+ if ((HEAP32[(HEAP32[i18 >> 2] | 0) + 56 >> 2] | 0) > 0) {
+ _luaF_close(i1, i25);
+ }
+ i18 = _luaD_poscall(i1, i27) | 0;
+ if ((HEAP8[i19 + 18 | 0] & 4) == 0) {
+ i15 = 228;
+ break;
+ }
+ i19 = HEAP32[i3 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ continue;
+ }
+ HEAP32[i5 >> 2] = HEAP32[i19 + 4 >> 2];
+ continue;
+ }
+ }
+ if ((i15 | 0) == 23) {
+ if (!i27) {
+ i36 = HEAP32[i29 >> 2] | 0;
+ i36 = i36 + -4 | 0;
+ HEAP32[i29 >> 2] = i36;
+ i36 = HEAP8[i26] | 0;
+ i36 = i36 & 255;
+ i36 = i36 | 128;
+ i36 = i36 & 255;
+ HEAP8[i26] = i36;
+ i36 = HEAP32[i5 >> 2] | 0;
+ i36 = i36 + -16 | 0;
+ HEAP32[i25 >> 2] = i36;
+ _luaD_throw(i1, 1);
+ }
+ HEAP32[i17 >> 2] = 1;
+ i36 = HEAP32[i29 >> 2] | 0;
+ i36 = i36 + -4 | 0;
+ HEAP32[i29 >> 2] = i36;
+ i36 = HEAP8[i26] | 0;
+ i36 = i36 & 255;
+ i36 = i36 | 128;
+ i36 = i36 & 255;
+ HEAP8[i26] = i36;
+ i36 = HEAP32[i5 >> 2] | 0;
+ i36 = i36 + -16 | 0;
+ HEAP32[i25 >> 2] = i36;
+ _luaD_throw(i1, 1);
+ } else if ((i15 | 0) == 228) {
+ STACKTOP = i12;
+ return;
+ } else if ((i15 | 0) == 239) {
+ _luaG_runerror(i1, 9040, i13);
+ } else if ((i15 | 0) == 244) {
+ _luaG_runerror(i1, 9080, i13);
+ } else if ((i15 | 0) == 249) {
+ _luaG_runerror(i1, 9112, i13);
+ }
+}
+function ___floatscan(i8, i2, i11) {
+ i8 = i8 | 0;
+ i2 = i2 | 0;
+ i11 = i11 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i9 = 0, i10 = 0, i12 = 0, i13 = 0, d14 = 0.0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, d28 = 0.0, i29 = 0, d30 = 0.0, d31 = 0.0, d32 = 0.0, d33 = 0.0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 512 | 0;
+ i5 = i1;
+ if ((i2 | 0) == 1) {
+ i2 = 53;
+ i3 = -1074;
+ } else if ((i2 | 0) == 2) {
+ i2 = 53;
+ i3 = -1074;
+ } else if ((i2 | 0) == 0) {
+ i2 = 24;
+ i3 = -149;
+ } else {
+ d31 = 0.0;
+ STACKTOP = i1;
+ return +d31;
+ }
+ i9 = i8 + 4 | 0;
+ i10 = i8 + 100 | 0;
+ do {
+ i4 = HEAP32[i9 >> 2] | 0;
+ if (i4 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
+ HEAP32[i9 >> 2] = i4 + 1;
+ i21 = HEAPU8[i4] | 0;
+ } else {
+ i21 = ___shgetc(i8) | 0;
+ }
+ } while ((_isspace(i21 | 0) | 0) != 0);
+ do {
+ if ((i21 | 0) == 43 | (i21 | 0) == 45) {
+ i4 = 1 - (((i21 | 0) == 45) << 1) | 0;
+ i7 = HEAP32[i9 >> 2] | 0;
+ if (i7 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
+ HEAP32[i9 >> 2] = i7 + 1;
+ i21 = HEAPU8[i7] | 0;
+ break;
+ } else {
+ i21 = ___shgetc(i8) | 0;
+ break;
+ }
+ } else {
+ i4 = 1;
+ }
+ } while (0);
+ i7 = 0;
+ do {
+ if ((i21 | 32 | 0) != (HEAP8[13408 + i7 | 0] | 0)) {
+ break;
+ }
+ do {
+ if (i7 >>> 0 < 7) {
+ i12 = HEAP32[i9 >> 2] | 0;
+ if (i12 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
+ HEAP32[i9 >> 2] = i12 + 1;
+ i21 = HEAPU8[i12] | 0;
+ break;
+ } else {
+ i21 = ___shgetc(i8) | 0;
+ break;
+ }
+ }
+ } while (0);
+ i7 = i7 + 1 | 0;
+ } while (i7 >>> 0 < 8);
+ do {
+ if ((i7 | 0) == 3) {
+ i13 = 23;
+ } else if ((i7 | 0) != 8) {
+ i12 = (i11 | 0) == 0;
+ if (!(i7 >>> 0 < 4 | i12)) {
+ if ((i7 | 0) == 8) {
+ break;
+ } else {
+ i13 = 23;
+ break;
+ }
+ }
+ L34 : do {
+ if ((i7 | 0) == 0) {
+ i7 = 0;
+ do {
+ if ((i21 | 32 | 0) != (HEAP8[13424 + i7 | 0] | 0)) {
+ break L34;
+ }
+ do {
+ if (i7 >>> 0 < 2) {
+ i15 = HEAP32[i9 >> 2] | 0;
+ if (i15 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
+ HEAP32[i9 >> 2] = i15 + 1;
+ i21 = HEAPU8[i15] | 0;
+ break;
+ } else {
+ i21 = ___shgetc(i8) | 0;
+ break;
+ }
+ }
+ } while (0);
+ i7 = i7 + 1 | 0;
+ } while (i7 >>> 0 < 3);
+ }
+ } while (0);
+ if ((i7 | 0) == 0) {
+ do {
+ if ((i21 | 0) == 48) {
+ i7 = HEAP32[i9 >> 2] | 0;
+ if (i7 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
+ HEAP32[i9 >> 2] = i7 + 1;
+ i7 = HEAPU8[i7] | 0;
+ } else {
+ i7 = ___shgetc(i8) | 0;
+ }
+ if ((i7 | 32 | 0) != 120) {
+ if ((HEAP32[i10 >> 2] | 0) == 0) {
+ i21 = 48;
+ break;
+ }
+ HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
+ i21 = 48;
+ break;
+ }
+ i5 = HEAP32[i9 >> 2] | 0;
+ if (i5 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
+ HEAP32[i9 >> 2] = i5 + 1;
+ i21 = HEAPU8[i5] | 0;
+ i19 = 0;
+ } else {
+ i21 = ___shgetc(i8) | 0;
+ i19 = 0;
+ }
+ while (1) {
+ if ((i21 | 0) == 46) {
+ i13 = 70;
+ break;
+ } else if ((i21 | 0) != 48) {
+ i5 = 0;
+ i7 = 0;
+ i15 = 0;
+ i16 = 0;
+ i18 = 0;
+ i20 = 0;
+ d28 = 1.0;
+ i17 = 0;
+ d14 = 0.0;
+ break;
+ }
+ i5 = HEAP32[i9 >> 2] | 0;
+ if (i5 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
+ HEAP32[i9 >> 2] = i5 + 1;
+ i21 = HEAPU8[i5] | 0;
+ i19 = 1;
+ continue;
+ } else {
+ i21 = ___shgetc(i8) | 0;
+ i19 = 1;
+ continue;
+ }
+ }
+ L66 : do {
+ if ((i13 | 0) == 70) {
+ i5 = HEAP32[i9 >> 2] | 0;
+ if (i5 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
+ HEAP32[i9 >> 2] = i5 + 1;
+ i21 = HEAPU8[i5] | 0;
+ } else {
+ i21 = ___shgetc(i8) | 0;
+ }
+ if ((i21 | 0) == 48) {
+ i15 = -1;
+ i16 = -1;
+ while (1) {
+ i5 = HEAP32[i9 >> 2] | 0;
+ if (i5 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
+ HEAP32[i9 >> 2] = i5 + 1;
+ i21 = HEAPU8[i5] | 0;
+ } else {
+ i21 = ___shgetc(i8) | 0;
+ }
+ if ((i21 | 0) != 48) {
+ i5 = 0;
+ i7 = 0;
+ i19 = 1;
+ i18 = 1;
+ i20 = 0;
+ d28 = 1.0;
+ i17 = 0;
+ d14 = 0.0;
+ break L66;
+ }
+ i29 = _i64Add(i15 | 0, i16 | 0, -1, -1) | 0;
+ i15 = i29;
+ i16 = tempRet0;
+ }
+ } else {
+ i5 = 0;
+ i7 = 0;
+ i15 = 0;
+ i16 = 0;
+ i18 = 1;
+ i20 = 0;
+ d28 = 1.0;
+ i17 = 0;
+ d14 = 0.0;
+ }
+ }
+ } while (0);
+ L79 : while (1) {
+ i24 = i21 + -48 | 0;
+ do {
+ if (!(i24 >>> 0 < 10)) {
+ i23 = i21 | 32;
+ i22 = (i21 | 0) == 46;
+ if (!((i23 + -97 | 0) >>> 0 < 6 | i22)) {
+ break L79;
+ }
+ if (i22) {
+ if ((i18 | 0) == 0) {
+ i15 = i7;
+ i16 = i5;
+ i18 = 1;
+ break;
+ } else {
+ i21 = 46;
+ break L79;
+ }
+ } else {
+ i24 = (i21 | 0) > 57 ? i23 + -87 | 0 : i24;
+ i13 = 84;
+ break;
+ }
+ } else {
+ i13 = 84;
+ }
+ } while (0);
+ if ((i13 | 0) == 84) {
+ i13 = 0;
+ do {
+ if (!((i5 | 0) < 0 | (i5 | 0) == 0 & i7 >>> 0 < 8)) {
+ if ((i5 | 0) < 0 | (i5 | 0) == 0 & i7 >>> 0 < 14) {
+ d31 = d28 * .0625;
+ d30 = d31;
+ d14 = d14 + d31 * +(i24 | 0);
+ break;
+ }
+ if ((i24 | 0) != 0 & (i20 | 0) == 0) {
+ i20 = 1;
+ d30 = d28;
+ d14 = d14 + d28 * .5;
+ } else {
+ d30 = d28;
+ }
+ } else {
+ d30 = d28;
+ i17 = i24 + (i17 << 4) | 0;
+ }
+ } while (0);
+ i7 = _i64Add(i7 | 0, i5 | 0, 1, 0) | 0;
+ i5 = tempRet0;
+ i19 = 1;
+ d28 = d30;
+ }
+ i21 = HEAP32[i9 >> 2] | 0;
+ if (i21 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
+ HEAP32[i9 >> 2] = i21 + 1;
+ i21 = HEAPU8[i21] | 0;
+ continue;
+ } else {
+ i21 = ___shgetc(i8) | 0;
+ continue;
+ }
+ }
+ if ((i19 | 0) == 0) {
+ i2 = (HEAP32[i10 >> 2] | 0) == 0;
+ if (!i2) {
+ HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
+ }
+ if (!i12) {
+ if (!i2 ? (i6 = HEAP32[i9 >> 2] | 0, HEAP32[i9 >> 2] = i6 + -1, (i18 | 0) != 0) : 0) {
+ HEAP32[i9 >> 2] = i6 + -2;
+ }
+ } else {
+ ___shlim(i8, 0);
+ }
+ d31 = +(i4 | 0) * 0.0;
+ STACKTOP = i1;
+ return +d31;
+ }
+ i13 = (i18 | 0) == 0;
+ i6 = i13 ? i7 : i15;
+ i13 = i13 ? i5 : i16;
+ if ((i5 | 0) < 0 | (i5 | 0) == 0 & i7 >>> 0 < 8) {
+ do {
+ i17 = i17 << 4;
+ i7 = _i64Add(i7 | 0, i5 | 0, 1, 0) | 0;
+ i5 = tempRet0;
+ } while ((i5 | 0) < 0 | (i5 | 0) == 0 & i7 >>> 0 < 8);
+ }
+ do {
+ if ((i21 | 32 | 0) == 112) {
+ i7 = _scanexp(i8, i11) | 0;
+ i5 = tempRet0;
+ if ((i7 | 0) == 0 & (i5 | 0) == -2147483648) {
+ if (i12) {
+ ___shlim(i8, 0);
+ d31 = 0.0;
+ STACKTOP = i1;
+ return +d31;
+ } else {
+ if ((HEAP32[i10 >> 2] | 0) == 0) {
+ i7 = 0;
+ i5 = 0;
+ break;
+ }
+ HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
+ i7 = 0;
+ i5 = 0;
+ break;
+ }
+ }
+ } else {
+ if ((HEAP32[i10 >> 2] | 0) == 0) {
+ i7 = 0;
+ i5 = 0;
+ } else {
+ HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
+ i7 = 0;
+ i5 = 0;
+ }
+ }
+ } while (0);
+ i6 = _bitshift64Shl(i6 | 0, i13 | 0, 2) | 0;
+ i6 = _i64Add(i6 | 0, tempRet0 | 0, -32, -1) | 0;
+ i5 = _i64Add(i6 | 0, tempRet0 | 0, i7 | 0, i5 | 0) | 0;
+ i6 = tempRet0;
+ if ((i17 | 0) == 0) {
+ d31 = +(i4 | 0) * 0.0;
+ STACKTOP = i1;
+ return +d31;
+ }
+ if ((i6 | 0) > 0 | (i6 | 0) == 0 & i5 >>> 0 > (0 - i3 | 0) >>> 0) {
+ HEAP32[(___errno_location() | 0) >> 2] = 34;
+ d31 = +(i4 | 0) * 1.7976931348623157e+308 * 1.7976931348623157e+308;
+ STACKTOP = i1;
+ return +d31;
+ }
+ i29 = i3 + -106 | 0;
+ i27 = ((i29 | 0) < 0) << 31 >> 31;
+ if ((i6 | 0) < (i27 | 0) | (i6 | 0) == (i27 | 0) & i5 >>> 0 < i29 >>> 0) {
+ HEAP32[(___errno_location() | 0) >> 2] = 34;
+ d31 = +(i4 | 0) * 2.2250738585072014e-308 * 2.2250738585072014e-308;
+ STACKTOP = i1;
+ return +d31;
+ }
+ if ((i17 | 0) > -1) {
+ do {
+ i17 = i17 << 1;
+ if (!(d14 >= .5)) {
+ d28 = d14;
+ } else {
+ d28 = d14 + -1.0;
+ i17 = i17 | 1;
+ }
+ d14 = d14 + d28;
+ i5 = _i64Add(i5 | 0, i6 | 0, -1, -1) | 0;
+ i6 = tempRet0;
+ } while ((i17 | 0) > -1);
+ }
+ i3 = _i64Subtract(32, 0, i3 | 0, ((i3 | 0) < 0) << 31 >> 31 | 0) | 0;
+ i3 = _i64Add(i5 | 0, i6 | 0, i3 | 0, tempRet0 | 0) | 0;
+ i29 = tempRet0;
+ if (0 > (i29 | 0) | 0 == (i29 | 0) & i2 >>> 0 > i3 >>> 0) {
+ i2 = (i3 | 0) < 0 ? 0 : i3;
+ }
+ if ((i2 | 0) < 53) {
+ d28 = +(i4 | 0);
+ d30 = +_copysign(+(+_scalbn(1.0, 84 - i2 | 0)), +d28);
+ if ((i2 | 0) < 32 & d14 != 0.0) {
+ i29 = i17 & 1;
+ i17 = (i29 ^ 1) + i17 | 0;
+ d14 = (i29 | 0) == 0 ? 0.0 : d14;
+ }
+ } else {
+ d28 = +(i4 | 0);
+ d30 = 0.0;
+ }
+ d14 = d28 * d14 + (d30 + d28 * +(i17 >>> 0)) - d30;
+ if (!(d14 != 0.0)) {
+ HEAP32[(___errno_location() | 0) >> 2] = 34;
+ }
+ d31 = +_scalbnl(d14, i5);
+ STACKTOP = i1;
+ return +d31;
+ }
+ } while (0);
+ i7 = i3 + i2 | 0;
+ i6 = 0 - i7 | 0;
+ i20 = 0;
+ while (1) {
+ if ((i21 | 0) == 46) {
+ i13 = 139;
+ break;
+ } else if ((i21 | 0) != 48) {
+ i25 = 0;
+ i22 = 0;
+ i19 = 0;
+ break;
+ }
+ i15 = HEAP32[i9 >> 2] | 0;
+ if (i15 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
+ HEAP32[i9 >> 2] = i15 + 1;
+ i21 = HEAPU8[i15] | 0;
+ i20 = 1;
+ continue;
+ } else {
+ i21 = ___shgetc(i8) | 0;
+ i20 = 1;
+ continue;
+ }
+ }
+ L168 : do {
+ if ((i13 | 0) == 139) {
+ i15 = HEAP32[i9 >> 2] | 0;
+ if (i15 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
+ HEAP32[i9 >> 2] = i15 + 1;
+ i21 = HEAPU8[i15] | 0;
+ } else {
+ i21 = ___shgetc(i8) | 0;
+ }
+ if ((i21 | 0) == 48) {
+ i25 = -1;
+ i22 = -1;
+ while (1) {
+ i15 = HEAP32[i9 >> 2] | 0;
+ if (i15 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
+ HEAP32[i9 >> 2] = i15 + 1;
+ i21 = HEAPU8[i15] | 0;
+ } else {
+ i21 = ___shgetc(i8) | 0;
+ }
+ if ((i21 | 0) != 48) {
+ i20 = 1;
+ i19 = 1;
+ break L168;
+ }
+ i29 = _i64Add(i25 | 0, i22 | 0, -1, -1) | 0;
+ i25 = i29;
+ i22 = tempRet0;
+ }
+ } else {
+ i25 = 0;
+ i22 = 0;
+ i19 = 1;
+ }
+ }
+ } while (0);
+ HEAP32[i5 >> 2] = 0;
+ i26 = i21 + -48 | 0;
+ i27 = (i21 | 0) == 46;
+ L182 : do {
+ if (i26 >>> 0 < 10 | i27) {
+ i15 = i5 + 496 | 0;
+ i24 = 0;
+ i23 = 0;
+ i18 = 0;
+ i17 = 0;
+ i16 = 0;
+ while (1) {
+ do {
+ if (i27) {
+ if ((i19 | 0) == 0) {
+ i25 = i24;
+ i22 = i23;
+ i19 = 1;
+ } else {
+ break L182;
+ }
+ } else {
+ i27 = _i64Add(i24 | 0, i23 | 0, 1, 0) | 0;
+ i23 = tempRet0;
+ i29 = (i21 | 0) != 48;
+ if ((i17 | 0) >= 125) {
+ if (!i29) {
+ i24 = i27;
+ break;
+ }
+ HEAP32[i15 >> 2] = HEAP32[i15 >> 2] | 1;
+ i24 = i27;
+ break;
+ }
+ i20 = i5 + (i17 << 2) | 0;
+ if ((i18 | 0) != 0) {
+ i26 = i21 + -48 + ((HEAP32[i20 >> 2] | 0) * 10 | 0) | 0;
+ }
+ HEAP32[i20 >> 2] = i26;
+ i18 = i18 + 1 | 0;
+ i21 = (i18 | 0) == 9;
+ i24 = i27;
+ i20 = 1;
+ i18 = i21 ? 0 : i18;
+ i17 = (i21 & 1) + i17 | 0;
+ i16 = i29 ? i27 : i16;
+ }
+ } while (0);
+ i21 = HEAP32[i9 >> 2] | 0;
+ if (i21 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
+ HEAP32[i9 >> 2] = i21 + 1;
+ i21 = HEAPU8[i21] | 0;
+ } else {
+ i21 = ___shgetc(i8) | 0;
+ }
+ i26 = i21 + -48 | 0;
+ i27 = (i21 | 0) == 46;
+ if (!(i26 >>> 0 < 10 | i27)) {
+ i13 = 162;
+ break;
+ }
+ }
+ } else {
+ i24 = 0;
+ i23 = 0;
+ i18 = 0;
+ i17 = 0;
+ i16 = 0;
+ i13 = 162;
+ }
+ } while (0);
+ if ((i13 | 0) == 162) {
+ i13 = (i19 | 0) == 0;
+ i25 = i13 ? i24 : i25;
+ i22 = i13 ? i23 : i22;
+ }
+ i13 = (i20 | 0) != 0;
+ if (i13 ? (i21 | 32 | 0) == 101 : 0) {
+ i15 = _scanexp(i8, i11) | 0;
+ i11 = tempRet0;
+ do {
+ if ((i15 | 0) == 0 & (i11 | 0) == -2147483648) {
+ if (i12) {
+ ___shlim(i8, 0);
+ d31 = 0.0;
+ STACKTOP = i1;
+ return +d31;
+ } else {
+ if ((HEAP32[i10 >> 2] | 0) == 0) {
+ i15 = 0;
+ i11 = 0;
+ break;
+ }
+ HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
+ i15 = 0;
+ i11 = 0;
+ break;
+ }
+ }
+ } while (0);
+ i9 = _i64Add(i15 | 0, i11 | 0, i25 | 0, i22 | 0) | 0;
+ i22 = tempRet0;
+ } else {
+ if ((i21 | 0) > -1 ? (HEAP32[i10 >> 2] | 0) != 0 : 0) {
+ HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
+ i9 = i25;
+ } else {
+ i9 = i25;
+ }
+ }
+ if (!i13) {
+ HEAP32[(___errno_location() | 0) >> 2] = 22;
+ ___shlim(i8, 0);
+ d31 = 0.0;
+ STACKTOP = i1;
+ return +d31;
+ }
+ i8 = HEAP32[i5 >> 2] | 0;
+ if ((i8 | 0) == 0) {
+ d31 = +(i4 | 0) * 0.0;
+ STACKTOP = i1;
+ return +d31;
+ }
+ do {
+ if ((i9 | 0) == (i24 | 0) & (i22 | 0) == (i23 | 0) & ((i23 | 0) < 0 | (i23 | 0) == 0 & i24 >>> 0 < 10)) {
+ if (!(i2 >>> 0 > 30) ? (i8 >>> i2 | 0) != 0 : 0) {
+ break;
+ }
+ d31 = +(i4 | 0) * +(i8 >>> 0);
+ STACKTOP = i1;
+ return +d31;
+ }
+ } while (0);
+ i29 = (i3 | 0) / -2 | 0;
+ i27 = ((i29 | 0) < 0) << 31 >> 31;
+ if ((i22 | 0) > (i27 | 0) | (i22 | 0) == (i27 | 0) & i9 >>> 0 > i29 >>> 0) {
+ HEAP32[(___errno_location() | 0) >> 2] = 34;
+ d31 = +(i4 | 0) * 1.7976931348623157e+308 * 1.7976931348623157e+308;
+ STACKTOP = i1;
+ return +d31;
+ }
+ i29 = i3 + -106 | 0;
+ i27 = ((i29 | 0) < 0) << 31 >> 31;
+ if ((i22 | 0) < (i27 | 0) | (i22 | 0) == (i27 | 0) & i9 >>> 0 < i29 >>> 0) {
+ HEAP32[(___errno_location() | 0) >> 2] = 34;
+ d31 = +(i4 | 0) * 2.2250738585072014e-308 * 2.2250738585072014e-308;
+ STACKTOP = i1;
+ return +d31;
+ }
+ if ((i18 | 0) != 0) {
+ if ((i18 | 0) < 9) {
+ i8 = i5 + (i17 << 2) | 0;
+ i10 = HEAP32[i8 >> 2] | 0;
+ do {
+ i10 = i10 * 10 | 0;
+ i18 = i18 + 1 | 0;
+ } while ((i18 | 0) != 9);
+ HEAP32[i8 >> 2] = i10;
+ }
+ i17 = i17 + 1 | 0;
+ }
+ do {
+ if ((i16 | 0) < 9 ? (i16 | 0) <= (i9 | 0) & (i9 | 0) < 18 : 0) {
+ if ((i9 | 0) == 9) {
+ d31 = +(i4 | 0) * +((HEAP32[i5 >> 2] | 0) >>> 0);
+ STACKTOP = i1;
+ return +d31;
+ }
+ if ((i9 | 0) < 9) {
+ d31 = +(i4 | 0) * +((HEAP32[i5 >> 2] | 0) >>> 0) / +(HEAP32[13440 + (8 - i9 << 2) >> 2] | 0);
+ STACKTOP = i1;
+ return +d31;
+ }
+ i10 = i2 + 27 + (Math_imul(i9, -3) | 0) | 0;
+ i8 = HEAP32[i5 >> 2] | 0;
+ if ((i10 | 0) <= 30 ? (i8 >>> i10 | 0) != 0 : 0) {
+ break;
+ }
+ d31 = +(i4 | 0) * +(i8 >>> 0) * +(HEAP32[13440 + (i9 + -10 << 2) >> 2] | 0);
+ STACKTOP = i1;
+ return +d31;
+ }
+ } while (0);
+ i8 = (i9 | 0) % 9 | 0;
+ if ((i8 | 0) == 0) {
+ i8 = 0;
+ i10 = 0;
+ } else {
+ i11 = (i9 | 0) > -1 ? i8 : i8 + 9 | 0;
+ i12 = HEAP32[13440 + (8 - i11 << 2) >> 2] | 0;
+ if ((i17 | 0) != 0) {
+ i10 = 1e9 / (i12 | 0) | 0;
+ i8 = 0;
+ i16 = 0;
+ i15 = 0;
+ while (1) {
+ i27 = i5 + (i15 << 2) | 0;
+ i13 = HEAP32[i27 >> 2] | 0;
+ i29 = ((i13 >>> 0) / (i12 >>> 0) | 0) + i16 | 0;
+ HEAP32[i27 >> 2] = i29;
+ i16 = Math_imul((i13 >>> 0) % (i12 >>> 0) | 0, i10) | 0;
+ i13 = i15 + 1 | 0;
+ if ((i15 | 0) == (i8 | 0) & (i29 | 0) == 0) {
+ i8 = i13 & 127;
+ i9 = i9 + -9 | 0;
+ }
+ if ((i13 | 0) == (i17 | 0)) {
+ break;
+ } else {
+ i15 = i13;
+ }
+ }
+ if ((i16 | 0) != 0) {
+ HEAP32[i5 + (i17 << 2) >> 2] = i16;
+ i17 = i17 + 1 | 0;
+ }
+ } else {
+ i8 = 0;
+ i17 = 0;
+ }
+ i10 = 0;
+ i9 = 9 - i11 + i9 | 0;
+ }
+ L280 : while (1) {
+ i11 = i5 + (i8 << 2) | 0;
+ if ((i9 | 0) < 18) {
+ do {
+ i13 = 0;
+ i11 = i17 + 127 | 0;
+ while (1) {
+ i11 = i11 & 127;
+ i12 = i5 + (i11 << 2) | 0;
+ i15 = _bitshift64Shl(HEAP32[i12 >> 2] | 0, 0, 29) | 0;
+ i15 = _i64Add(i15 | 0, tempRet0 | 0, i13 | 0, 0) | 0;
+ i13 = tempRet0;
+ if (i13 >>> 0 > 0 | (i13 | 0) == 0 & i15 >>> 0 > 1e9) {
+ i29 = ___udivdi3(i15 | 0, i13 | 0, 1e9, 0) | 0;
+ i15 = ___uremdi3(i15 | 0, i13 | 0, 1e9, 0) | 0;
+ i13 = i29;
+ } else {
+ i13 = 0;
+ }
+ HEAP32[i12 >> 2] = i15;
+ i12 = (i11 | 0) == (i8 | 0);
+ if (!((i11 | 0) != (i17 + 127 & 127 | 0) | i12)) {
+ i17 = (i15 | 0) == 0 ? i11 : i17;
+ }
+ if (i12) {
+ break;
+ } else {
+ i11 = i11 + -1 | 0;
+ }
+ }
+ i10 = i10 + -29 | 0;
+ } while ((i13 | 0) == 0);
+ } else {
+ if ((i9 | 0) != 18) {
+ break;
+ }
+ do {
+ if (!((HEAP32[i11 >> 2] | 0) >>> 0 < 9007199)) {
+ i9 = 18;
+ break L280;
+ }
+ i13 = 0;
+ i12 = i17 + 127 | 0;
+ while (1) {
+ i12 = i12 & 127;
+ i15 = i5 + (i12 << 2) | 0;
+ i16 = _bitshift64Shl(HEAP32[i15 >> 2] | 0, 0, 29) | 0;
+ i16 = _i64Add(i16 | 0, tempRet0 | 0, i13 | 0, 0) | 0;
+ i13 = tempRet0;
+ if (i13 >>> 0 > 0 | (i13 | 0) == 0 & i16 >>> 0 > 1e9) {
+ i29 = ___udivdi3(i16 | 0, i13 | 0, 1e9, 0) | 0;
+ i16 = ___uremdi3(i16 | 0, i13 | 0, 1e9, 0) | 0;
+ i13 = i29;
+ } else {
+ i13 = 0;
+ }
+ HEAP32[i15 >> 2] = i16;
+ i15 = (i12 | 0) == (i8 | 0);
+ if (!((i12 | 0) != (i17 + 127 & 127 | 0) | i15)) {
+ i17 = (i16 | 0) == 0 ? i12 : i17;
+ }
+ if (i15) {
+ break;
+ } else {
+ i12 = i12 + -1 | 0;
+ }
+ }
+ i10 = i10 + -29 | 0;
+ } while ((i13 | 0) == 0);
+ }
+ i8 = i8 + 127 & 127;
+ if ((i8 | 0) == (i17 | 0)) {
+ i29 = i17 + 127 & 127;
+ i17 = i5 + ((i17 + 126 & 127) << 2) | 0;
+ HEAP32[i17 >> 2] = HEAP32[i17 >> 2] | HEAP32[i5 + (i29 << 2) >> 2];
+ i17 = i29;
+ }
+ HEAP32[i5 + (i8 << 2) >> 2] = i13;
+ i9 = i9 + 9 | 0;
+ }
+ L311 : while (1) {
+ i11 = i17 + 1 & 127;
+ i12 = i5 + ((i17 + 127 & 127) << 2) | 0;
+ while (1) {
+ i15 = (i9 | 0) == 18;
+ i13 = (i9 | 0) > 27 ? 9 : 1;
+ while (1) {
+ i16 = 0;
+ while (1) {
+ i18 = i16 + i8 & 127;
+ if ((i18 | 0) == (i17 | 0)) {
+ i16 = 2;
+ break;
+ }
+ i18 = HEAP32[i5 + (i18 << 2) >> 2] | 0;
+ i19 = HEAP32[13432 + (i16 << 2) >> 2] | 0;
+ if (i18 >>> 0 < i19 >>> 0) {
+ i16 = 2;
+ break;
+ }
+ i20 = i16 + 1 | 0;
+ if (i18 >>> 0 > i19 >>> 0) {
+ break;
+ }
+ if ((i20 | 0) < 2) {
+ i16 = i20;
+ } else {
+ i16 = i20;
+ break;
+ }
+ }
+ if ((i16 | 0) == 2 & i15) {
+ break L311;
+ }
+ i10 = i13 + i10 | 0;
+ if ((i8 | 0) == (i17 | 0)) {
+ i8 = i17;
+ } else {
+ break;
+ }
+ }
+ i15 = (1 << i13) + -1 | 0;
+ i19 = 1e9 >>> i13;
+ i18 = i8;
+ i16 = 0;
+ do {
+ i27 = i5 + (i8 << 2) | 0;
+ i29 = HEAP32[i27 >> 2] | 0;
+ i20 = (i29 >>> i13) + i16 | 0;
+ HEAP32[i27 >> 2] = i20;
+ i16 = Math_imul(i29 & i15, i19) | 0;
+ i20 = (i8 | 0) == (i18 | 0) & (i20 | 0) == 0;
+ i8 = i8 + 1 & 127;
+ i9 = i20 ? i9 + -9 | 0 : i9;
+ i18 = i20 ? i8 : i18;
+ } while ((i8 | 0) != (i17 | 0));
+ if ((i16 | 0) == 0) {
+ i8 = i18;
+ continue;
+ }
+ if ((i11 | 0) != (i18 | 0)) {
+ break;
+ }
+ HEAP32[i12 >> 2] = HEAP32[i12 >> 2] | 1;
+ i8 = i18;
+ }
+ HEAP32[i5 + (i17 << 2) >> 2] = i16;
+ i8 = i18;
+ i17 = i11;
+ }
+ i9 = i8 & 127;
+ if ((i9 | 0) == (i17 | 0)) {
+ HEAP32[i5 + (i11 + -1 << 2) >> 2] = 0;
+ i17 = i11;
+ }
+ d28 = +((HEAP32[i5 + (i9 << 2) >> 2] | 0) >>> 0);
+ i9 = i8 + 1 & 127;
+ if ((i9 | 0) == (i17 | 0)) {
+ i17 = i17 + 1 & 127;
+ HEAP32[i5 + (i17 + -1 << 2) >> 2] = 0;
+ }
+ d14 = +(i4 | 0);
+ d30 = d14 * (d28 * 1.0e9 + +((HEAP32[i5 + (i9 << 2) >> 2] | 0) >>> 0));
+ i4 = i10 + 53 | 0;
+ i3 = i4 - i3 | 0;
+ if ((i3 | 0) < (i2 | 0)) {
+ i2 = (i3 | 0) < 0 ? 0 : i3;
+ i9 = 1;
+ } else {
+ i9 = 0;
+ }
+ if ((i2 | 0) < 53) {
+ d33 = +_copysign(+(+_scalbn(1.0, 105 - i2 | 0)), +d30);
+ d32 = +_fmod(+d30, +(+_scalbn(1.0, 53 - i2 | 0)));
+ d28 = d33;
+ d31 = d32;
+ d30 = d33 + (d30 - d32);
+ } else {
+ d28 = 0.0;
+ d31 = 0.0;
+ }
+ i11 = i8 + 2 & 127;
+ if ((i11 | 0) != (i17 | 0)) {
+ i5 = HEAP32[i5 + (i11 << 2) >> 2] | 0;
+ do {
+ if (!(i5 >>> 0 < 5e8)) {
+ if (i5 >>> 0 > 5e8) {
+ d31 = d14 * .75 + d31;
+ break;
+ }
+ if ((i8 + 3 & 127 | 0) == (i17 | 0)) {
+ d31 = d14 * .5 + d31;
+ break;
+ } else {
+ d31 = d14 * .75 + d31;
+ break;
+ }
+ } else {
+ if ((i5 | 0) == 0 ? (i8 + 3 & 127 | 0) == (i17 | 0) : 0) {
+ break;
+ }
+ d31 = d14 * .25 + d31;
+ }
+ } while (0);
+ if ((53 - i2 | 0) > 1 ? !(+_fmod(+d31, 1.0) != 0.0) : 0) {
+ d31 = d31 + 1.0;
+ }
+ }
+ d14 = d30 + d31 - d28;
+ do {
+ if ((i4 & 2147483647 | 0) > (-2 - i7 | 0)) {
+ if (+Math_abs(+d14) >= 9007199254740992.0) {
+ i9 = (i9 | 0) != 0 & (i2 | 0) == (i3 | 0) ? 0 : i9;
+ i10 = i10 + 1 | 0;
+ d14 = d14 * .5;
+ }
+ if ((i10 + 50 | 0) <= (i6 | 0) ? !((i9 | 0) != 0 & d31 != 0.0) : 0) {
+ break;
+ }
+ HEAP32[(___errno_location() | 0) >> 2] = 34;
+ }
+ } while (0);
+ d33 = +_scalbnl(d14, i10);
+ STACKTOP = i1;
+ return +d33;
+ } else if ((i7 | 0) == 3) {
+ i2 = HEAP32[i9 >> 2] | 0;
+ if (i2 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
+ HEAP32[i9 >> 2] = i2 + 1;
+ i2 = HEAPU8[i2] | 0;
+ } else {
+ i2 = ___shgetc(i8) | 0;
+ }
+ if ((i2 | 0) == 40) {
+ i2 = 1;
+ } else {
+ if ((HEAP32[i10 >> 2] | 0) == 0) {
+ d33 = nan;
+ STACKTOP = i1;
+ return +d33;
+ }
+ HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
+ d33 = nan;
+ STACKTOP = i1;
+ return +d33;
+ }
+ while (1) {
+ i3 = HEAP32[i9 >> 2] | 0;
+ if (i3 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0) {
+ HEAP32[i9 >> 2] = i3 + 1;
+ i3 = HEAPU8[i3] | 0;
+ } else {
+ i3 = ___shgetc(i8) | 0;
+ }
+ if (!((i3 + -48 | 0) >>> 0 < 10 | (i3 + -65 | 0) >>> 0 < 26) ? !((i3 + -97 | 0) >>> 0 < 26 | (i3 | 0) == 95) : 0) {
+ break;
+ }
+ i2 = i2 + 1 | 0;
+ }
+ if ((i3 | 0) == 41) {
+ d33 = nan;
+ STACKTOP = i1;
+ return +d33;
+ }
+ i3 = (HEAP32[i10 >> 2] | 0) == 0;
+ if (!i3) {
+ HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
+ }
+ if (i12) {
+ HEAP32[(___errno_location() | 0) >> 2] = 22;
+ ___shlim(i8, 0);
+ d33 = 0.0;
+ STACKTOP = i1;
+ return +d33;
+ }
+ if ((i2 | 0) == 0 | i3) {
+ d33 = nan;
+ STACKTOP = i1;
+ return +d33;
+ }
+ while (1) {
+ i2 = i2 + -1 | 0;
+ HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
+ if ((i2 | 0) == 0) {
+ d14 = nan;
+ break;
+ }
+ }
+ STACKTOP = i1;
+ return +d14;
+ } else {
+ if ((HEAP32[i10 >> 2] | 0) != 0) {
+ HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
+ }
+ HEAP32[(___errno_location() | 0) >> 2] = 22;
+ ___shlim(i8, 0);
+ d33 = 0.0;
+ STACKTOP = i1;
+ return +d33;
+ }
+ }
+ } while (0);
+ if ((i13 | 0) == 23) {
+ i2 = (HEAP32[i10 >> 2] | 0) == 0;
+ if (!i2) {
+ HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
+ }
+ if (!(i7 >>> 0 < 4 | (i11 | 0) == 0 | i2)) {
+ do {
+ HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + -1;
+ i7 = i7 + -1 | 0;
+ } while (i7 >>> 0 > 3);
+ }
+ }
+ d33 = +(i4 | 0) * inf;
+ STACKTOP = i1;
+ return +d33;
+}
+function _statement(i4) {
+ i4 = i4 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 160 | 0;
+ i8 = i2 + 120 | 0;
+ i24 = i2 + 96 | 0;
+ i15 = i2 + 72 | 0;
+ i25 = i2 + 48 | 0;
+ i20 = i2 + 24 | 0;
+ i21 = i2;
+ i19 = i4 + 4 | 0;
+ i6 = HEAP32[i19 >> 2] | 0;
+ i3 = i4 + 48 | 0;
+ i9 = HEAP32[i3 >> 2] | 0;
+ i1 = i4 + 52 | 0;
+ i26 = (HEAP32[i1 >> 2] | 0) + 38 | 0;
+ i27 = (HEAP16[i26 >> 1] | 0) + 1 << 16 >> 16;
+ HEAP16[i26 >> 1] = i27;
+ if ((i27 & 65535) > 200) {
+ i27 = i9 + 12 | 0;
+ i26 = HEAP32[(HEAP32[i27 >> 2] | 0) + 52 >> 2] | 0;
+ i5 = HEAP32[(HEAP32[i9 >> 2] | 0) + 64 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ i29 = 6552;
+ HEAP32[i8 >> 2] = 6360;
+ i28 = i8 + 4 | 0;
+ HEAP32[i28 >> 2] = 200;
+ i28 = i8 + 8 | 0;
+ HEAP32[i28 >> 2] = i29;
+ i28 = _luaO_pushfstring(i26, 6592, i8) | 0;
+ i29 = HEAP32[i27 >> 2] | 0;
+ _luaX_syntaxerror(i29, i28);
+ }
+ HEAP32[i8 >> 2] = i5;
+ i28 = _luaO_pushfstring(i26, 6568, i8) | 0;
+ HEAP32[i8 >> 2] = 6360;
+ i29 = i8 + 4 | 0;
+ HEAP32[i29 >> 2] = 200;
+ i29 = i8 + 8 | 0;
+ HEAP32[i29 >> 2] = i28;
+ i29 = _luaO_pushfstring(i26, 6592, i8) | 0;
+ i28 = HEAP32[i27 >> 2] | 0;
+ _luaX_syntaxerror(i28, i29);
+ }
+ i5 = i4 + 16 | 0;
+ L8 : do {
+ switch (HEAP32[i5 >> 2] | 0) {
+ case 59:
+ {
+ _luaX_next(i4);
+ break;
+ }
+ case 267:
+ {
+ HEAP32[i21 >> 2] = -1;
+ _test_then_block(i4, i21);
+ while (1) {
+ i8 = HEAP32[i5 >> 2] | 0;
+ if ((i8 | 0) == 260) {
+ i7 = 10;
+ break;
+ } else if ((i8 | 0) != 261) {
+ break;
+ }
+ _test_then_block(i4, i21);
+ }
+ if ((i7 | 0) == 10) {
+ _luaX_next(i4);
+ i7 = HEAP32[i3 >> 2] | 0;
+ HEAP8[i20 + 10 | 0] = 0;
+ HEAP8[i20 + 8 | 0] = HEAP8[i7 + 46 | 0] | 0;
+ i29 = HEAP32[(HEAP32[i7 + 12 >> 2] | 0) + 64 >> 2] | 0;
+ HEAP16[i20 + 4 >> 1] = HEAP32[i29 + 28 >> 2];
+ HEAP16[i20 + 6 >> 1] = HEAP32[i29 + 16 >> 2];
+ HEAP8[i20 + 9 | 0] = 0;
+ i29 = i7 + 16 | 0;
+ HEAP32[i20 >> 2] = HEAP32[i29 >> 2];
+ HEAP32[i29 >> 2] = i20;
+ L16 : do {
+ i8 = HEAP32[i5 >> 2] | 0;
+ switch (i8 | 0) {
+ case 277:
+ case 286:
+ case 262:
+ case 261:
+ case 260:
+ {
+ break L16;
+ }
+ default:
+ {}
+ }
+ _statement(i4);
+ } while ((i8 | 0) != 274);
+ _leaveblock(i7);
+ }
+ _check_match(i4, 262, 267, i6);
+ _luaK_patchtohere(i9, HEAP32[i21 >> 2] | 0);
+ break;
+ }
+ case 259:
+ {
+ _luaX_next(i4);
+ i7 = HEAP32[i3 >> 2] | 0;
+ HEAP8[i20 + 10 | 0] = 0;
+ HEAP8[i20 + 8 | 0] = HEAP8[i7 + 46 | 0] | 0;
+ i29 = HEAP32[(HEAP32[i7 + 12 >> 2] | 0) + 64 >> 2] | 0;
+ HEAP16[i20 + 4 >> 1] = HEAP32[i29 + 28 >> 2];
+ HEAP16[i20 + 6 >> 1] = HEAP32[i29 + 16 >> 2];
+ HEAP8[i20 + 9 | 0] = 0;
+ i29 = i7 + 16 | 0;
+ HEAP32[i20 >> 2] = HEAP32[i29 >> 2];
+ HEAP32[i29 >> 2] = i20;
+ L22 : do {
+ i8 = HEAP32[i5 >> 2] | 0;
+ switch (i8 | 0) {
+ case 277:
+ case 286:
+ case 262:
+ case 261:
+ case 260:
+ {
+ break L22;
+ }
+ default:
+ {}
+ }
+ _statement(i4);
+ } while ((i8 | 0) != 274);
+ _leaveblock(i7);
+ _check_match(i4, 262, 259, i6);
+ break;
+ }
+ case 269:
+ {
+ _luaX_next(i4);
+ i6 = HEAP32[i5 >> 2] | 0;
+ if ((i6 | 0) == 265) {
+ _luaX_next(i4);
+ i7 = HEAP32[i3 >> 2] | 0;
+ if ((HEAP32[i5 >> 2] | 0) == 288) {
+ i29 = HEAP32[i4 + 24 >> 2] | 0;
+ _luaX_next(i4);
+ _new_localvar(i4, i29);
+ i29 = HEAP32[i3 >> 2] | 0;
+ i27 = i29 + 46 | 0;
+ i28 = (HEAPU8[i27] | 0) + 1 | 0;
+ HEAP8[i27] = i28;
+ HEAP32[(HEAP32[(HEAP32[i29 >> 2] | 0) + 24 >> 2] | 0) + ((HEAP16[(HEAP32[HEAP32[(HEAP32[i29 + 12 >> 2] | 0) + 64 >> 2] >> 2] | 0) + ((i28 & 255) + -1 + (HEAP32[i29 + 40 >> 2] | 0) << 1) >> 1] | 0) * 12 | 0) + 4 >> 2] = HEAP32[i29 + 20 >> 2];
+ _body(i4, i25, 0, HEAP32[i19 >> 2] | 0);
+ HEAP32[(HEAP32[(HEAP32[i7 >> 2] | 0) + 24 >> 2] | 0) + ((HEAP16[(HEAP32[HEAP32[(HEAP32[i7 + 12 >> 2] | 0) + 64 >> 2] >> 2] | 0) + ((HEAP32[i7 + 40 >> 2] | 0) + (HEAP32[i25 + 8 >> 2] | 0) << 1) >> 1] | 0) * 12 | 0) + 4 >> 2] = HEAP32[i7 + 20 >> 2];
+ break L8;
+ } else {
+ _error_expected(i4, 288);
+ }
+ }
+ if ((i6 | 0) != 288) {
+ _error_expected(i4, 288);
+ }
+ i7 = i4 + 24 | 0;
+ i6 = 1;
+ while (1) {
+ i8 = HEAP32[i7 >> 2] | 0;
+ _luaX_next(i4);
+ _new_localvar(i4, i8);
+ i8 = HEAP32[i5 >> 2] | 0;
+ if ((i8 | 0) == 61) {
+ i7 = 81;
+ break;
+ } else if ((i8 | 0) != 44) {
+ i7 = 83;
+ break;
+ }
+ _luaX_next(i4);
+ if ((HEAP32[i5 >> 2] | 0) == 288) {
+ i6 = i6 + 1 | 0;
+ } else {
+ i7 = 78;
+ break;
+ }
+ }
+ do {
+ if ((i7 | 0) == 78) {
+ _error_expected(i4, 288);
+ } else if ((i7 | 0) == 81) {
+ _luaX_next(i4);
+ _subexpr(i4, i15, 0) | 0;
+ if ((HEAP32[i5 >> 2] | 0) == 44) {
+ i8 = 1;
+ do {
+ _luaX_next(i4);
+ _luaK_exp2nextreg(HEAP32[i3 >> 2] | 0, i15);
+ _subexpr(i4, i15, 0) | 0;
+ i8 = i8 + 1 | 0;
+ } while ((HEAP32[i5 >> 2] | 0) == 44);
+ } else {
+ i8 = 1;
+ }
+ i5 = HEAP32[i15 >> 2] | 0;
+ i4 = HEAP32[i3 >> 2] | 0;
+ i8 = i6 - i8 | 0;
+ if ((i5 | 0) == 0) {
+ i17 = i8;
+ i18 = i4;
+ i7 = 88;
+ break;
+ } else if (!((i5 | 0) == 13 | (i5 | 0) == 12)) {
+ _luaK_exp2nextreg(i4, i15);
+ i17 = i8;
+ i18 = i4;
+ i7 = 88;
+ break;
+ }
+ i5 = i8 + 1 | 0;
+ i5 = (i5 | 0) < 0 ? 0 : i5;
+ _luaK_setreturns(i4, i15, i5);
+ if ((i5 | 0) > 1) {
+ _luaK_reserveregs(i4, i5 + -1 | 0);
+ }
+ } else if ((i7 | 0) == 83) {
+ HEAP32[i15 >> 2] = 0;
+ i17 = i6;
+ i18 = HEAP32[i3 >> 2] | 0;
+ i7 = 88;
+ }
+ } while (0);
+ if ((i7 | 0) == 88 ? (i17 | 0) > 0 : 0) {
+ i29 = HEAPU8[i18 + 48 | 0] | 0;
+ _luaK_reserveregs(i18, i17);
+ _luaK_nil(i18, i29, i17);
+ }
+ i5 = HEAP32[i3 >> 2] | 0;
+ i4 = i5 + 46 | 0;
+ i7 = (HEAPU8[i4] | 0) + i6 | 0;
+ HEAP8[i4] = i7;
+ if ((i6 | 0) != 0 ? (i11 = i5 + 20 | 0, i14 = i5 + 40 | 0, i12 = HEAP32[(HEAP32[i5 >> 2] | 0) + 24 >> 2] | 0, i13 = HEAP32[HEAP32[(HEAP32[i5 + 12 >> 2] | 0) + 64 >> 2] >> 2] | 0, HEAP32[i12 + ((HEAP16[i13 + ((i7 & 255) - i6 + (HEAP32[i14 >> 2] | 0) << 1) >> 1] | 0) * 12 | 0) + 4 >> 2] = HEAP32[i11 >> 2], i16 = i6 + -1 | 0, (i16 | 0) != 0) : 0) {
+ do {
+ HEAP32[i12 + ((HEAP16[i13 + ((HEAPU8[i4] | 0) - i16 + (HEAP32[i14 >> 2] | 0) << 1) >> 1] | 0) * 12 | 0) + 4 >> 2] = HEAP32[i11 >> 2];
+ i16 = i16 + -1 | 0;
+ } while ((i16 | 0) != 0);
+ }
+ break;
+ }
+ case 264:
+ {
+ HEAP8[i24 + 10 | 0] = 1;
+ HEAP8[i24 + 8 | 0] = HEAP8[i9 + 46 | 0] | 0;
+ i29 = HEAP32[(HEAP32[i9 + 12 >> 2] | 0) + 64 >> 2] | 0;
+ HEAP16[i24 + 4 >> 1] = HEAP32[i29 + 28 >> 2];
+ HEAP16[i24 + 6 >> 1] = HEAP32[i29 + 16 >> 2];
+ HEAP8[i24 + 9 | 0] = 0;
+ i29 = i9 + 16 | 0;
+ HEAP32[i24 >> 2] = HEAP32[i29 >> 2];
+ HEAP32[i29 >> 2] = i24;
+ _luaX_next(i4);
+ if ((HEAP32[i5 >> 2] | 0) != 288) {
+ _error_expected(i4, 288);
+ }
+ i14 = i4 + 24 | 0;
+ i13 = HEAP32[i14 >> 2] | 0;
+ _luaX_next(i4);
+ i11 = HEAP32[i5 >> 2] | 0;
+ if ((i11 | 0) == 268 | (i11 | 0) == 44) {
+ i12 = HEAP32[i3 >> 2] | 0;
+ i11 = HEAPU8[i12 + 48 | 0] | 0;
+ _new_localvar(i4, _luaX_newstring(i4, 6744, 15) | 0);
+ _new_localvar(i4, _luaX_newstring(i4, 6760, 11) | 0);
+ _new_localvar(i4, _luaX_newstring(i4, 6776, 13) | 0);
+ _new_localvar(i4, i13);
+ i13 = HEAP32[i5 >> 2] | 0;
+ do {
+ if ((i13 | 0) == 44) {
+ i15 = 4;
+ while (1) {
+ _luaX_next(i4);
+ if ((HEAP32[i5 >> 2] | 0) != 288) {
+ i7 = 40;
+ break;
+ }
+ i13 = HEAP32[i14 >> 2] | 0;
+ _luaX_next(i4);
+ _new_localvar(i4, i13);
+ i13 = HEAP32[i5 >> 2] | 0;
+ if ((i13 | 0) == 44) {
+ i15 = i15 + 1 | 0;
+ } else {
+ i7 = 42;
+ break;
+ }
+ }
+ if ((i7 | 0) == 40) {
+ _error_expected(i4, 288);
+ } else if ((i7 | 0) == 42) {
+ i22 = i13;
+ i10 = i15 + -2 | 0;
+ break;
+ }
+ } else {
+ i22 = i13;
+ i10 = 1;
+ }
+ } while (0);
+ if ((i22 | 0) != 268) {
+ _error_expected(i4, 268);
+ }
+ _luaX_next(i4);
+ i13 = HEAP32[i19 >> 2] | 0;
+ _subexpr(i4, i8, 0) | 0;
+ if ((HEAP32[i5 >> 2] | 0) == 44) {
+ i14 = 1;
+ do {
+ _luaX_next(i4);
+ _luaK_exp2nextreg(HEAP32[i3 >> 2] | 0, i8);
+ _subexpr(i4, i8, 0) | 0;
+ i14 = i14 + 1 | 0;
+ } while ((HEAP32[i5 >> 2] | 0) == 44);
+ } else {
+ i14 = 1;
+ }
+ i5 = HEAP32[i3 >> 2] | 0;
+ i14 = 3 - i14 | 0;
+ i15 = HEAP32[i8 >> 2] | 0;
+ if ((i15 | 0) == 0) {
+ i7 = 51;
+ } else if ((i15 | 0) == 13 | (i15 | 0) == 12) {
+ i15 = i14 + 1 | 0;
+ i15 = (i15 | 0) < 0 ? 0 : i15;
+ _luaK_setreturns(i5, i8, i15);
+ if ((i15 | 0) > 1) {
+ _luaK_reserveregs(i5, i15 + -1 | 0);
+ }
+ } else {
+ _luaK_exp2nextreg(i5, i8);
+ i7 = 51;
+ }
+ if ((i7 | 0) == 51 ? (i14 | 0) > 0 : 0) {
+ i29 = HEAPU8[i5 + 48 | 0] | 0;
+ _luaK_reserveregs(i5, i14);
+ _luaK_nil(i5, i29, i14);
+ }
+ _luaK_checkstack(i12, 3);
+ _forbody(i4, i11, i13, i10, 0);
+ } else if ((i11 | 0) == 61) {
+ i11 = HEAP32[i3 >> 2] | 0;
+ i7 = i11 + 48 | 0;
+ i10 = HEAPU8[i7] | 0;
+ _new_localvar(i4, _luaX_newstring(i4, 6792, 11) | 0);
+ _new_localvar(i4, _luaX_newstring(i4, 6808, 11) | 0);
+ _new_localvar(i4, _luaX_newstring(i4, 6824, 10) | 0);
+ _new_localvar(i4, i13);
+ if ((HEAP32[i5 >> 2] | 0) != 61) {
+ _error_expected(i4, 61);
+ }
+ _luaX_next(i4);
+ _subexpr(i4, i8, 0) | 0;
+ _luaK_exp2nextreg(HEAP32[i3 >> 2] | 0, i8);
+ if ((HEAP32[i5 >> 2] | 0) != 44) {
+ _error_expected(i4, 44);
+ }
+ _luaX_next(i4);
+ _subexpr(i4, i8, 0) | 0;
+ _luaK_exp2nextreg(HEAP32[i3 >> 2] | 0, i8);
+ if ((HEAP32[i5 >> 2] | 0) == 44) {
+ _luaX_next(i4);
+ _subexpr(i4, i8, 0) | 0;
+ _luaK_exp2nextreg(HEAP32[i3 >> 2] | 0, i8);
+ } else {
+ i29 = HEAPU8[i7] | 0;
+ _luaK_codek(i11, i29, _luaK_numberK(i11, 1.0) | 0) | 0;
+ _luaK_reserveregs(i11, 1);
+ }
+ _forbody(i4, i10, i6, 1, 1);
+ } else {
+ _luaX_syntaxerror(i4, 6720);
+ }
+ _check_match(i4, 262, 264, i6);
+ _leaveblock(i9);
+ break;
+ }
+ case 265:
+ {
+ _luaX_next(i4);
+ if ((HEAP32[i5 >> 2] | 0) != 288) {
+ _error_expected(i4, 288);
+ }
+ i8 = HEAP32[i4 + 24 >> 2] | 0;
+ _luaX_next(i4);
+ i9 = HEAP32[i3 >> 2] | 0;
+ if ((_singlevaraux(i9, i8, i20, 1) | 0) == 0) {
+ _singlevaraux(i9, HEAP32[i4 + 72 >> 2] | 0, i20, 1) | 0;
+ i29 = _luaK_stringK(HEAP32[i3 >> 2] | 0, i8) | 0;
+ HEAP32[i25 + 16 >> 2] = -1;
+ HEAP32[i25 + 20 >> 2] = -1;
+ HEAP32[i25 >> 2] = 4;
+ HEAP32[i25 + 8 >> 2] = i29;
+ _luaK_indexed(i9, i20, i25);
+ }
+ while (1) {
+ i8 = HEAP32[i5 >> 2] | 0;
+ if ((i8 | 0) == 58) {
+ i7 = 70;
+ break;
+ } else if ((i8 | 0) != 46) {
+ i5 = 0;
+ break;
+ }
+ _fieldsel(i4, i20);
+ }
+ if ((i7 | 0) == 70) {
+ _fieldsel(i4, i20);
+ i5 = 1;
+ }
+ _body(i4, i21, i5, i6);
+ _luaK_storevar(HEAP32[i3 >> 2] | 0, i20, i21);
+ _luaK_fixline(HEAP32[i3 >> 2] | 0, i6);
+ break;
+ }
+ case 278:
+ {
+ _luaX_next(i4);
+ i7 = _luaK_getlabel(i9) | 0;
+ _subexpr(i4, i20, 0) | 0;
+ if ((HEAP32[i20 >> 2] | 0) == 1) {
+ HEAP32[i20 >> 2] = 3;
+ }
+ _luaK_goiftrue(HEAP32[i3 >> 2] | 0, i20);
+ i8 = HEAP32[i20 + 20 >> 2] | 0;
+ HEAP8[i21 + 10 | 0] = 1;
+ HEAP8[i21 + 8 | 0] = HEAP8[i9 + 46 | 0] | 0;
+ i29 = HEAP32[(HEAP32[i9 + 12 >> 2] | 0) + 64 >> 2] | 0;
+ HEAP16[i21 + 4 >> 1] = HEAP32[i29 + 28 >> 2];
+ HEAP16[i21 + 6 >> 1] = HEAP32[i29 + 16 >> 2];
+ HEAP8[i21 + 9 | 0] = 0;
+ i29 = i9 + 16 | 0;
+ HEAP32[i21 >> 2] = HEAP32[i29 >> 2];
+ HEAP32[i29 >> 2] = i21;
+ if ((HEAP32[i5 >> 2] | 0) != 259) {
+ _error_expected(i4, 259);
+ }
+ _luaX_next(i4);
+ i10 = HEAP32[i3 >> 2] | 0;
+ HEAP8[i20 + 10 | 0] = 0;
+ HEAP8[i20 + 8 | 0] = HEAP8[i10 + 46 | 0] | 0;
+ i29 = HEAP32[(HEAP32[i10 + 12 >> 2] | 0) + 64 >> 2] | 0;
+ HEAP16[i20 + 4 >> 1] = HEAP32[i29 + 28 >> 2];
+ HEAP16[i20 + 6 >> 1] = HEAP32[i29 + 16 >> 2];
+ HEAP8[i20 + 9 | 0] = 0;
+ i29 = i10 + 16 | 0;
+ HEAP32[i20 >> 2] = HEAP32[i29 >> 2];
+ HEAP32[i29 >> 2] = i20;
+ L119 : do {
+ i11 = HEAP32[i5 >> 2] | 0;
+ switch (i11 | 0) {
+ case 277:
+ case 286:
+ case 262:
+ case 261:
+ case 260:
+ {
+ break L119;
+ }
+ default:
+ {}
+ }
+ _statement(i4);
+ } while ((i11 | 0) != 274);
+ _leaveblock(i10);
+ _luaK_patchlist(i9, _luaK_jump(i9) | 0, i7);
+ _check_match(i4, 262, 278, i6);
+ _leaveblock(i9);
+ _luaK_patchtohere(i9, i8);
+ break;
+ }
+ case 273:
+ {
+ i7 = _luaK_getlabel(i9) | 0;
+ HEAP8[i24 + 10 | 0] = 1;
+ i28 = i9 + 46 | 0;
+ HEAP8[i24 + 8 | 0] = HEAP8[i28] | 0;
+ i11 = i9 + 12 | 0;
+ i29 = HEAP32[(HEAP32[i11 >> 2] | 0) + 64 >> 2] | 0;
+ HEAP16[i24 + 4 >> 1] = HEAP32[i29 + 28 >> 2];
+ HEAP16[i24 + 6 >> 1] = HEAP32[i29 + 16 >> 2];
+ HEAP8[i24 + 9 | 0] = 0;
+ i29 = i9 + 16 | 0;
+ HEAP32[i24 >> 2] = HEAP32[i29 >> 2];
+ HEAP32[i29 >> 2] = i24;
+ HEAP8[i15 + 10 | 0] = 0;
+ i10 = i15 + 8 | 0;
+ HEAP8[i10] = HEAP8[i28] | 0;
+ i11 = HEAP32[(HEAP32[i11 >> 2] | 0) + 64 >> 2] | 0;
+ HEAP16[i15 + 4 >> 1] = HEAP32[i11 + 28 >> 2];
+ HEAP16[i15 + 6 >> 1] = HEAP32[i11 + 16 >> 2];
+ i11 = i15 + 9 | 0;
+ HEAP8[i11] = 0;
+ HEAP32[i15 >> 2] = HEAP32[i29 >> 2];
+ HEAP32[i29 >> 2] = i15;
+ _luaX_next(i4);
+ L124 : do {
+ i12 = HEAP32[i5 >> 2] | 0;
+ switch (i12 | 0) {
+ case 277:
+ case 286:
+ case 262:
+ case 261:
+ case 260:
+ {
+ break L124;
+ }
+ default:
+ {}
+ }
+ _statement(i4);
+ } while ((i12 | 0) != 274);
+ _check_match(i4, 277, 273, i6);
+ _subexpr(i4, i8, 0) | 0;
+ if ((HEAP32[i8 >> 2] | 0) == 1) {
+ HEAP32[i8 >> 2] = 3;
+ }
+ _luaK_goiftrue(HEAP32[i3 >> 2] | 0, i8);
+ i4 = HEAP32[i8 + 20 >> 2] | 0;
+ if ((HEAP8[i11] | 0) != 0) {
+ _luaK_patchclose(i9, i4, HEAPU8[i10] | 0);
+ }
+ _leaveblock(i9);
+ _luaK_patchlist(i9, i4, i7);
+ _leaveblock(i9);
+ break;
+ }
+ case 285:
+ {
+ _luaX_next(i4);
+ if ((HEAP32[i5 >> 2] | 0) != 288) {
+ _error_expected(i4, 288);
+ }
+ i10 = HEAP32[i4 + 24 >> 2] | 0;
+ _luaX_next(i4);
+ i15 = HEAP32[i3 >> 2] | 0;
+ i9 = i4 + 64 | 0;
+ i14 = HEAP32[i9 >> 2] | 0;
+ i12 = i14 + 24 | 0;
+ i11 = i15 + 16 | 0;
+ i16 = HEAP16[(HEAP32[i11 >> 2] | 0) + 4 >> 1] | 0;
+ i13 = i14 + 28 | 0;
+ L138 : do {
+ if ((i16 | 0) < (HEAP32[i13 >> 2] | 0)) {
+ while (1) {
+ i17 = i16 + 1 | 0;
+ if ((_luaS_eqstr(i10, HEAP32[(HEAP32[i12 >> 2] | 0) + (i16 << 4) >> 2] | 0) | 0) != 0) {
+ break;
+ }
+ if ((i17 | 0) < (HEAP32[i13 >> 2] | 0)) {
+ i16 = i17;
+ } else {
+ break L138;
+ }
+ }
+ i28 = i15 + 12 | 0;
+ i29 = HEAP32[(HEAP32[i28 >> 2] | 0) + 52 >> 2] | 0;
+ i27 = HEAP32[(HEAP32[i12 >> 2] | 0) + (i16 << 4) + 8 >> 2] | 0;
+ HEAP32[i8 >> 2] = i10 + 16;
+ HEAP32[i8 + 4 >> 2] = i27;
+ i29 = _luaO_pushfstring(i29, 6680, i8) | 0;
+ _semerror(HEAP32[i28 >> 2] | 0, i29);
+ }
+ } while (0);
+ if ((HEAP32[i5 >> 2] | 0) != 285) {
+ _error_expected(i4, 285);
+ }
+ _luaX_next(i4);
+ i8 = HEAP32[i15 + 20 >> 2] | 0;
+ i15 = HEAP32[i13 >> 2] | 0;
+ i14 = i14 + 32 | 0;
+ if ((i15 | 0) < (HEAP32[i14 >> 2] | 0)) {
+ i14 = HEAP32[i12 >> 2] | 0;
+ } else {
+ i14 = _luaM_growaux_(HEAP32[i1 >> 2] | 0, HEAP32[i12 >> 2] | 0, i14, 16, 32767, 6312) | 0;
+ HEAP32[i12 >> 2] = i14;
+ }
+ HEAP32[i14 + (i15 << 4) >> 2] = i10;
+ i29 = HEAP32[i12 >> 2] | 0;
+ HEAP32[i29 + (i15 << 4) + 8 >> 2] = i6;
+ HEAP8[i29 + (i15 << 4) + 12 | 0] = HEAP8[(HEAP32[i3 >> 2] | 0) + 46 | 0] | 0;
+ HEAP32[(HEAP32[i12 >> 2] | 0) + (i15 << 4) + 4 >> 2] = i8;
+ HEAP32[i13 >> 2] = (HEAP32[i13 >> 2] | 0) + 1;
+ L152 : while (1) {
+ switch (HEAP32[i5 >> 2] | 0) {
+ case 285:
+ case 59:
+ {
+ break;
+ }
+ case 286:
+ case 262:
+ case 261:
+ case 260:
+ {
+ i7 = 108;
+ break L152;
+ }
+ default:
+ {
+ break L152;
+ }
+ }
+ _statement(i4);
+ }
+ if ((i7 | 0) == 108) {
+ HEAP8[(HEAP32[i12 >> 2] | 0) + (i15 << 4) + 12 | 0] = HEAP8[(HEAP32[i11 >> 2] | 0) + 8 | 0] | 0;
+ }
+ i5 = (HEAP32[i12 >> 2] | 0) + (i15 << 4) | 0;
+ i8 = HEAP32[i9 >> 2] | 0;
+ i7 = HEAP16[(HEAP32[(HEAP32[i3 >> 2] | 0) + 16 >> 2] | 0) + 6 >> 1] | 0;
+ i6 = i8 + 16 | 0;
+ if ((i7 | 0) < (HEAP32[i6 >> 2] | 0)) {
+ i8 = i8 + 12 | 0;
+ do {
+ while (1) {
+ if ((_luaS_eqstr(HEAP32[(HEAP32[i8 >> 2] | 0) + (i7 << 4) >> 2] | 0, HEAP32[i5 >> 2] | 0) | 0) == 0) {
+ break;
+ }
+ _closegoto(i4, i7, i5);
+ if ((i7 | 0) >= (HEAP32[i6 >> 2] | 0)) {
+ break L8;
+ }
+ }
+ i7 = i7 + 1 | 0;
+ } while ((i7 | 0) < (HEAP32[i6 >> 2] | 0));
+ }
+ break;
+ }
+ case 274:
+ {
+ _luaX_next(i4);
+ i6 = HEAP32[i3 >> 2] | 0;
+ L166 : do {
+ switch (HEAP32[i5 >> 2] | 0) {
+ case 59:
+ case 277:
+ case 286:
+ case 262:
+ case 261:
+ case 260:
+ {
+ i8 = 0;
+ i7 = 0;
+ break;
+ }
+ default:
+ {
+ _subexpr(i4, i24, 0) | 0;
+ if ((HEAP32[i5 >> 2] | 0) == 44) {
+ i7 = 1;
+ do {
+ _luaX_next(i4);
+ _luaK_exp2nextreg(HEAP32[i3 >> 2] | 0, i24);
+ _subexpr(i4, i24, 0) | 0;
+ i7 = i7 + 1 | 0;
+ } while ((HEAP32[i5 >> 2] | 0) == 44);
+ } else {
+ i7 = 1;
+ }
+ if (!(((HEAP32[i24 >> 2] | 0) + -12 | 0) >>> 0 < 2)) {
+ if ((i7 | 0) == 1) {
+ i8 = _luaK_exp2anyreg(i6, i24) | 0;
+ i7 = 1;
+ break L166;
+ } else {
+ _luaK_exp2nextreg(i6, i24);
+ i8 = HEAPU8[i6 + 46 | 0] | 0;
+ break L166;
+ }
+ } else {
+ _luaK_setreturns(i6, i24, -1);
+ if ((HEAP32[i24 >> 2] | 0) == 12 & (i7 | 0) == 1) {
+ i29 = (HEAP32[(HEAP32[i6 >> 2] | 0) + 12 >> 2] | 0) + (HEAP32[i24 + 8 >> 2] << 2) | 0;
+ HEAP32[i29 >> 2] = HEAP32[i29 >> 2] & -64 | 30;
+ }
+ i8 = HEAPU8[i6 + 46 | 0] | 0;
+ i7 = -1;
+ break L166;
+ }
+ }
+ }
+ } while (0);
+ _luaK_ret(i6, i8, i7);
+ if ((HEAP32[i5 >> 2] | 0) == 59) {
+ _luaX_next(i4);
+ }
+ break;
+ }
+ case 266:
+ case 258:
+ {
+ i6 = _luaK_jump(i9) | 0;
+ i7 = HEAP32[i19 >> 2] | 0;
+ i29 = (HEAP32[i5 >> 2] | 0) == 266;
+ _luaX_next(i4);
+ do {
+ if (i29) {
+ if ((HEAP32[i5 >> 2] | 0) == 288) {
+ i23 = HEAP32[i4 + 24 >> 2] | 0;
+ _luaX_next(i4);
+ break;
+ } else {
+ _error_expected(i4, 288);
+ }
+ } else {
+ i23 = _luaS_new(HEAP32[i1 >> 2] | 0, 6304) | 0;
+ }
+ } while (0);
+ i10 = HEAP32[i4 + 64 >> 2] | 0;
+ i9 = i10 + 12 | 0;
+ i5 = i10 + 16 | 0;
+ i8 = HEAP32[i5 >> 2] | 0;
+ i10 = i10 + 20 | 0;
+ if ((i8 | 0) < (HEAP32[i10 >> 2] | 0)) {
+ i10 = HEAP32[i9 >> 2] | 0;
+ } else {
+ i10 = _luaM_growaux_(HEAP32[i1 >> 2] | 0, HEAP32[i9 >> 2] | 0, i10, 16, 32767, 6312) | 0;
+ HEAP32[i9 >> 2] = i10;
+ }
+ HEAP32[i10 + (i8 << 4) >> 2] = i23;
+ i29 = HEAP32[i9 >> 2] | 0;
+ HEAP32[i29 + (i8 << 4) + 8 >> 2] = i7;
+ HEAP8[i29 + (i8 << 4) + 12 | 0] = HEAP8[(HEAP32[i3 >> 2] | 0) + 46 | 0] | 0;
+ HEAP32[(HEAP32[i9 >> 2] | 0) + (i8 << 4) + 4 >> 2] = i6;
+ HEAP32[i5 >> 2] = (HEAP32[i5 >> 2] | 0) + 1;
+ _findlabel(i4, i8) | 0;
+ break;
+ }
+ default:
+ {
+ i6 = i8 + 8 | 0;
+ _suffixedexp(i4, i6);
+ i29 = HEAP32[i5 >> 2] | 0;
+ if ((i29 | 0) == 44 | (i29 | 0) == 61) {
+ HEAP32[i8 >> 2] = 0;
+ _assignment(i4, i8, 1);
+ break L8;
+ }
+ if ((HEAP32[i6 >> 2] | 0) == 12) {
+ i29 = (HEAP32[(HEAP32[i9 >> 2] | 0) + 12 >> 2] | 0) + (HEAP32[i8 + 16 >> 2] << 2) | 0;
+ HEAP32[i29 >> 2] = HEAP32[i29 >> 2] & -8372225 | 16384;
+ break L8;
+ } else {
+ _luaX_syntaxerror(i4, 6344);
+ }
+ }
+ }
+ } while (0);
+ i29 = HEAP32[i3 >> 2] | 0;
+ HEAP8[i29 + 48 | 0] = HEAP8[i29 + 46 | 0] | 0;
+ i29 = (HEAP32[i1 >> 2] | 0) + 38 | 0;
+ HEAP16[i29 >> 1] = (HEAP16[i29 >> 1] | 0) + -1 << 16 >> 16;
+ STACKTOP = i2;
+ return;
+}
+function _match(i1, i12, i11) {
+ i1 = i1 | 0;
+ i12 = i12 | 0;
+ i11 = i11 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0, i30 = 0, i31 = 0, i32 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i8 = i2;
+ i32 = HEAP32[i1 >> 2] | 0;
+ HEAP32[i1 >> 2] = i32 + -1;
+ if ((i32 | 0) == 0) {
+ _luaL_error(HEAP32[i1 + 16 >> 2] | 0, 7272, i8) | 0;
+ }
+ i14 = i1 + 12 | 0;
+ i22 = HEAP32[i14 >> 2] | 0;
+ L4 : do {
+ if ((i22 | 0) != (i11 | 0)) {
+ i3 = i1 + 8 | 0;
+ i9 = i1 + 16 | 0;
+ i16 = i1 + 4 | 0;
+ i10 = i1 + 20 | 0;
+ L6 : while (1) {
+ i19 = i12 + 1 | 0;
+ i20 = i12 + -1 | 0;
+ L8 : while (1) {
+ i23 = HEAP8[i11] | 0;
+ i21 = i23 << 24 >> 24;
+ L10 : do {
+ if ((i21 | 0) == 36) {
+ i7 = i11 + 1 | 0;
+ if ((i7 | 0) == (i22 | 0)) {
+ i7 = 23;
+ break L6;
+ } else {
+ i22 = i7;
+ i21 = i7;
+ i7 = 89;
+ }
+ } else if ((i21 | 0) == 37) {
+ i21 = i11 + 1 | 0;
+ i23 = HEAP8[i21] | 0;
+ switch (i23 << 24 >> 24 | 0) {
+ case 57:
+ case 56:
+ case 55:
+ case 54:
+ case 53:
+ case 52:
+ case 51:
+ case 50:
+ case 49:
+ case 48:
+ {
+ i7 = 69;
+ break L8;
+ }
+ case 98:
+ {
+ i7 = 25;
+ break L8;
+ }
+ case 102:
+ {
+ break;
+ }
+ default:
+ {
+ if ((i21 | 0) == (i22 | 0)) {
+ _luaL_error(HEAP32[i9 >> 2] | 0, 7368, i8) | 0;
+ }
+ i22 = i11 + 2 | 0;
+ i7 = 89;
+ break L10;
+ }
+ }
+ i22 = i11 + 2 | 0;
+ if ((HEAP8[i22] | 0) == 91) {
+ i21 = 91;
+ } else {
+ _luaL_error(HEAP32[i9 >> 2] | 0, 7296, i8) | 0;
+ i21 = HEAP8[i22] | 0;
+ }
+ i23 = i11 + 3 | 0;
+ i21 = i21 << 24 >> 24;
+ if ((i21 | 0) == 91) {
+ i21 = (HEAP8[i23] | 0) == 94 ? i11 + 4 | 0 : i23;
+ while (1) {
+ if ((i21 | 0) == (HEAP32[i14 >> 2] | 0)) {
+ _luaL_error(HEAP32[i9 >> 2] | 0, 7408, i8) | 0;
+ }
+ i11 = i21 + 1 | 0;
+ if ((HEAP8[i21] | 0) == 37) {
+ i11 = i11 >>> 0 < (HEAP32[i14 >> 2] | 0) >>> 0 ? i21 + 2 | 0 : i11;
+ }
+ if ((HEAP8[i11] | 0) == 93) {
+ break;
+ } else {
+ i21 = i11;
+ }
+ }
+ i11 = i11 + 1 | 0;
+ } else if ((i21 | 0) == 37) {
+ if ((i23 | 0) == (HEAP32[i14 >> 2] | 0)) {
+ _luaL_error(HEAP32[i9 >> 2] | 0, 7368, i8) | 0;
+ }
+ i11 = i11 + 4 | 0;
+ } else {
+ i11 = i23;
+ }
+ if ((i12 | 0) == (HEAP32[i16 >> 2] | 0)) {
+ i25 = 0;
+ } else {
+ i25 = HEAP8[i20] | 0;
+ }
+ i24 = i25 & 255;
+ i21 = i11 + -1 | 0;
+ i26 = (HEAP8[i23] | 0) == 94;
+ i28 = i26 ? i23 : i22;
+ i27 = i26 & 1;
+ i26 = i27 ^ 1;
+ i30 = i28 + 1 | 0;
+ L41 : do {
+ if (i30 >>> 0 < i21 >>> 0) {
+ while (1) {
+ i32 = HEAP8[i30] | 0;
+ i29 = i28 + 2 | 0;
+ i31 = HEAP8[i29] | 0;
+ do {
+ if (i32 << 24 >> 24 == 37) {
+ if ((_match_class(i24, i31 & 255) | 0) == 0) {
+ i28 = i29;
+ } else {
+ break L41;
+ }
+ } else {
+ if (i31 << 24 >> 24 == 45 ? (i18 = i28 + 3 | 0, i18 >>> 0 < i21 >>> 0) : 0) {
+ if ((i32 & 255) > (i25 & 255)) {
+ i28 = i18;
+ break;
+ }
+ if ((HEAPU8[i18] | 0) < (i25 & 255)) {
+ i28 = i18;
+ break;
+ } else {
+ break L41;
+ }
+ }
+ if (i32 << 24 >> 24 == i25 << 24 >> 24) {
+ break L41;
+ } else {
+ i28 = i30;
+ }
+ }
+ } while (0);
+ i30 = i28 + 1 | 0;
+ if (!(i30 >>> 0 < i21 >>> 0)) {
+ i26 = i27;
+ break;
+ }
+ }
+ } else {
+ i26 = i27;
+ }
+ } while (0);
+ if ((i26 | 0) != 0) {
+ i12 = 0;
+ break L4;
+ }
+ i24 = HEAP8[i12] | 0;
+ i25 = i24 & 255;
+ i27 = (HEAP8[i23] | 0) == 94;
+ i26 = i27 ? i23 : i22;
+ i22 = i27 & 1;
+ i23 = i22 ^ 1;
+ i30 = i26 + 1 | 0;
+ L55 : do {
+ if (i30 >>> 0 < i21 >>> 0) {
+ do {
+ i29 = HEAP8[i30] | 0;
+ i28 = i26 + 2 | 0;
+ i27 = HEAP8[i28] | 0;
+ do {
+ if (i29 << 24 >> 24 == 37) {
+ if ((_match_class(i25, i27 & 255) | 0) == 0) {
+ i26 = i28;
+ } else {
+ i22 = i23;
+ break L55;
+ }
+ } else {
+ if (i27 << 24 >> 24 == 45 ? (i17 = i26 + 3 | 0, i17 >>> 0 < i21 >>> 0) : 0) {
+ if ((i29 & 255) > (i24 & 255)) {
+ i26 = i17;
+ break;
+ }
+ if ((HEAPU8[i17] | 0) < (i24 & 255)) {
+ i26 = i17;
+ break;
+ } else {
+ i22 = i23;
+ break L55;
+ }
+ }
+ if (i29 << 24 >> 24 == i24 << 24 >> 24) {
+ i22 = i23;
+ break L55;
+ } else {
+ i26 = i30;
+ }
+ }
+ } while (0);
+ i30 = i26 + 1 | 0;
+ } while (i30 >>> 0 < i21 >>> 0);
+ }
+ } while (0);
+ if ((i22 | 0) == 0) {
+ i12 = 0;
+ break L4;
+ }
+ } else if ((i21 | 0) == 40) {
+ i7 = 7;
+ break L6;
+ } else if ((i21 | 0) != 41) {
+ i21 = i11 + 1 | 0;
+ if (i23 << 24 >> 24 == 91) {
+ i7 = (HEAP8[i21] | 0) == 94 ? i11 + 2 | 0 : i21;
+ while (1) {
+ if ((i7 | 0) == (i22 | 0)) {
+ _luaL_error(HEAP32[i9 >> 2] | 0, 7408, i8) | 0;
+ }
+ i22 = i7 + 1 | 0;
+ if ((HEAP8[i7] | 0) == 37) {
+ i7 = i22 >>> 0 < (HEAP32[i14 >> 2] | 0) >>> 0 ? i7 + 2 | 0 : i22;
+ } else {
+ i7 = i22;
+ }
+ if ((HEAP8[i7] | 0) == 93) {
+ break;
+ }
+ i22 = HEAP32[i14 >> 2] | 0;
+ }
+ i22 = i7 + 1 | 0;
+ i7 = 89;
+ } else {
+ i22 = i21;
+ i7 = 89;
+ }
+ } else {
+ i7 = 16;
+ break L6;
+ }
+ } while (0);
+ L80 : do {
+ if ((i7 | 0) == 89) {
+ i7 = 0;
+ do {
+ if ((HEAP32[i3 >> 2] | 0) >>> 0 > i12 >>> 0) {
+ i23 = HEAP8[i12] | 0;
+ i24 = i23 & 255;
+ i26 = HEAP8[i11] | 0;
+ i25 = i26 << 24 >> 24;
+ L85 : do {
+ if ((i25 | 0) == 46) {
+ i23 = HEAP8[i22] | 0;
+ } else if ((i25 | 0) == 37) {
+ i25 = _match_class(i24, HEAPU8[i21] | 0) | 0;
+ i7 = 104;
+ } else if ((i25 | 0) == 91) {
+ i7 = i22 + -1 | 0;
+ i25 = (HEAP8[i21] | 0) == 94;
+ i27 = i25 ? i21 : i11;
+ i26 = i25 & 1;
+ i25 = i26 ^ 1;
+ i30 = i27 + 1 | 0;
+ if (i30 >>> 0 < i7 >>> 0) {
+ while (1) {
+ i31 = HEAP8[i30] | 0;
+ i29 = i27 + 2 | 0;
+ i28 = HEAP8[i29] | 0;
+ do {
+ if (i31 << 24 >> 24 == 37) {
+ if ((_match_class(i24, i28 & 255) | 0) == 0) {
+ i27 = i29;
+ } else {
+ i7 = 104;
+ break L85;
+ }
+ } else {
+ if (i28 << 24 >> 24 == 45 ? (i13 = i27 + 3 | 0, i13 >>> 0 < i7 >>> 0) : 0) {
+ if ((i31 & 255) > (i23 & 255)) {
+ i27 = i13;
+ break;
+ }
+ if ((HEAPU8[i13] | 0) < (i23 & 255)) {
+ i27 = i13;
+ break;
+ } else {
+ i7 = 104;
+ break L85;
+ }
+ }
+ if (i31 << 24 >> 24 == i23 << 24 >> 24) {
+ i7 = 104;
+ break L85;
+ } else {
+ i27 = i30;
+ }
+ }
+ } while (0);
+ i30 = i27 + 1 | 0;
+ if (!(i30 >>> 0 < i7 >>> 0)) {
+ i25 = i26;
+ i7 = 104;
+ break;
+ }
+ }
+ } else {
+ i25 = i26;
+ i7 = 104;
+ }
+ } else {
+ i25 = i26 << 24 >> 24 == i23 << 24 >> 24 | 0;
+ i7 = 104;
+ }
+ } while (0);
+ if ((i7 | 0) == 104) {
+ i7 = 0;
+ i23 = HEAP8[i22] | 0;
+ if ((i25 | 0) == 0) {
+ break;
+ }
+ }
+ i23 = i23 << 24 >> 24;
+ if ((i23 | 0) == 45) {
+ i7 = 109;
+ break L6;
+ } else if ((i23 | 0) == 42) {
+ i7 = 112;
+ break L6;
+ } else if ((i23 | 0) == 43) {
+ break L6;
+ } else if ((i23 | 0) != 63) {
+ i12 = i19;
+ i11 = i22;
+ break L8;
+ }
+ i11 = i22 + 1 | 0;
+ i21 = _match(i1, i19, i11) | 0;
+ if ((i21 | 0) == 0) {
+ break L80;
+ } else {
+ i12 = i21;
+ break L4;
+ }
+ } else {
+ i23 = HEAP8[i22] | 0;
+ }
+ } while (0);
+ if (!(i23 << 24 >> 24 == 45 | i23 << 24 >> 24 == 63 | i23 << 24 >> 24 == 42)) {
+ i12 = 0;
+ break L4;
+ }
+ i11 = i22 + 1 | 0;
+ }
+ } while (0);
+ i22 = HEAP32[i14 >> 2] | 0;
+ if ((i11 | 0) == (i22 | 0)) {
+ break L4;
+ }
+ }
+ if ((i7 | 0) == 25) {
+ i7 = 0;
+ i21 = i11 + 2 | 0;
+ if (!((i22 + -1 | 0) >>> 0 > i21 >>> 0)) {
+ _luaL_error(HEAP32[i9 >> 2] | 0, 7440, i8) | 0;
+ }
+ i20 = HEAP8[i12] | 0;
+ if (!(i20 << 24 >> 24 == (HEAP8[i21] | 0))) {
+ i12 = 0;
+ break L4;
+ }
+ i21 = HEAP8[i11 + 3 | 0] | 0;
+ i22 = HEAP32[i3 >> 2] | 0;
+ if (i19 >>> 0 < i22 >>> 0) {
+ i24 = 1;
+ } else {
+ i12 = 0;
+ break L4;
+ }
+ while (1) {
+ i23 = HEAP8[i19] | 0;
+ if (i23 << 24 >> 24 == i21 << 24 >> 24) {
+ i24 = i24 + -1 | 0;
+ if ((i24 | 0) == 0) {
+ break;
+ }
+ } else {
+ i24 = (i23 << 24 >> 24 == i20 << 24 >> 24) + i24 | 0;
+ }
+ i12 = i19 + 1 | 0;
+ if (i12 >>> 0 < i22 >>> 0) {
+ i32 = i19;
+ i19 = i12;
+ i12 = i32;
+ } else {
+ i12 = 0;
+ break L4;
+ }
+ }
+ i12 = i12 + 2 | 0;
+ i11 = i11 + 4 | 0;
+ } else if ((i7 | 0) == 69) {
+ i7 = 0;
+ i20 = i23 & 255;
+ i19 = i20 + -49 | 0;
+ if (((i19 | 0) >= 0 ? (i19 | 0) < (HEAP32[i10 >> 2] | 0) : 0) ? (i15 = HEAP32[i1 + (i19 << 3) + 28 >> 2] | 0, !((i15 | 0) == -1)) : 0) {
+ i20 = i15;
+ } else {
+ i19 = HEAP32[i9 >> 2] | 0;
+ HEAP32[i8 >> 2] = i20 + -48;
+ i20 = _luaL_error(i19, 7336, i8) | 0;
+ i19 = i20;
+ i20 = HEAP32[i1 + (i20 << 3) + 28 >> 2] | 0;
+ }
+ if (((HEAP32[i3 >> 2] | 0) - i12 | 0) >>> 0 < i20 >>> 0) {
+ i12 = 0;
+ break L4;
+ }
+ if ((_memcmp(HEAP32[i1 + (i19 << 3) + 24 >> 2] | 0, i12, i20) | 0) != 0) {
+ i12 = 0;
+ break L4;
+ }
+ i12 = i12 + i20 | 0;
+ if ((i12 | 0) == 0) {
+ i12 = 0;
+ break L4;
+ }
+ i11 = i11 + 2 | 0;
+ }
+ i22 = HEAP32[i14 >> 2] | 0;
+ if ((i11 | 0) == (i22 | 0)) {
+ break L4;
+ }
+ }
+ if ((i7 | 0) == 7) {
+ i3 = i11 + 1 | 0;
+ if ((HEAP8[i3] | 0) == 41) {
+ i3 = HEAP32[i10 >> 2] | 0;
+ if ((i3 | 0) > 31) {
+ _luaL_error(HEAP32[i9 >> 2] | 0, 7200, i8) | 0;
+ }
+ HEAP32[i1 + (i3 << 3) + 24 >> 2] = i12;
+ HEAP32[i1 + (i3 << 3) + 28 >> 2] = -2;
+ HEAP32[i10 >> 2] = i3 + 1;
+ i12 = _match(i1, i12, i11 + 2 | 0) | 0;
+ if ((i12 | 0) != 0) {
+ break;
+ }
+ HEAP32[i10 >> 2] = (HEAP32[i10 >> 2] | 0) + -1;
+ i12 = 0;
+ break;
+ } else {
+ i4 = HEAP32[i10 >> 2] | 0;
+ if ((i4 | 0) > 31) {
+ _luaL_error(HEAP32[i9 >> 2] | 0, 7200, i8) | 0;
+ }
+ HEAP32[i1 + (i4 << 3) + 24 >> 2] = i12;
+ HEAP32[i1 + (i4 << 3) + 28 >> 2] = -1;
+ HEAP32[i10 >> 2] = i4 + 1;
+ i12 = _match(i1, i12, i3) | 0;
+ if ((i12 | 0) != 0) {
+ break;
+ }
+ HEAP32[i10 >> 2] = (HEAP32[i10 >> 2] | 0) + -1;
+ i12 = 0;
+ break;
+ }
+ } else if ((i7 | 0) == 16) {
+ i3 = i11 + 1 | 0;
+ i5 = HEAP32[i10 >> 2] | 0;
+ while (1) {
+ i4 = i5 + -1 | 0;
+ if ((i5 | 0) <= 0) {
+ i7 = 19;
+ break;
+ }
+ if ((HEAP32[i1 + (i4 << 3) + 28 >> 2] | 0) == -1) {
+ break;
+ } else {
+ i5 = i4;
+ }
+ }
+ if ((i7 | 0) == 19) {
+ i4 = _luaL_error(HEAP32[i9 >> 2] | 0, 7488, i8) | 0;
+ }
+ i5 = i1 + (i4 << 3) + 28 | 0;
+ HEAP32[i5 >> 2] = i12 - (HEAP32[i1 + (i4 << 3) + 24 >> 2] | 0);
+ i12 = _match(i1, i12, i3) | 0;
+ if ((i12 | 0) != 0) {
+ break;
+ }
+ HEAP32[i5 >> 2] = -1;
+ i12 = 0;
+ break;
+ } else if ((i7 | 0) == 23) {
+ i12 = (i12 | 0) == (HEAP32[i3 >> 2] | 0) ? i12 : 0;
+ break;
+ } else if ((i7 | 0) == 109) {
+ i4 = i22 + 1 | 0;
+ i8 = _match(i1, i12, i4) | 0;
+ if ((i8 | 0) != 0) {
+ i12 = i8;
+ break;
+ }
+ i8 = i22 + -1 | 0;
+ while (1) {
+ if (!((HEAP32[i3 >> 2] | 0) >>> 0 > i12 >>> 0)) {
+ i12 = 0;
+ break L4;
+ }
+ i9 = HEAP8[i12] | 0;
+ i10 = i9 & 255;
+ i14 = HEAP8[i11] | 0;
+ i13 = i14 << 24 >> 24;
+ L139 : do {
+ if ((i13 | 0) == 91) {
+ i6 = (HEAP8[i21] | 0) == 94;
+ i13 = i6 ? i21 : i11;
+ i6 = i6 & 1;
+ i7 = i6 ^ 1;
+ i14 = i13 + 1 | 0;
+ if (i14 >>> 0 < i8 >>> 0) {
+ while (1) {
+ i17 = HEAP8[i14] | 0;
+ i15 = i13 + 2 | 0;
+ i16 = HEAP8[i15] | 0;
+ do {
+ if (i17 << 24 >> 24 == 37) {
+ if ((_match_class(i10, i16 & 255) | 0) == 0) {
+ i13 = i15;
+ } else {
+ i6 = i7;
+ i7 = 147;
+ break L139;
+ }
+ } else {
+ if (i16 << 24 >> 24 == 45 ? (i5 = i13 + 3 | 0, i5 >>> 0 < i8 >>> 0) : 0) {
+ if ((i17 & 255) > (i9 & 255)) {
+ i13 = i5;
+ break;
+ }
+ if ((HEAPU8[i5] | 0) < (i9 & 255)) {
+ i13 = i5;
+ break;
+ } else {
+ i6 = i7;
+ i7 = 147;
+ break L139;
+ }
+ }
+ if (i17 << 24 >> 24 == i9 << 24 >> 24) {
+ i6 = i7;
+ i7 = 147;
+ break L139;
+ } else {
+ i13 = i14;
+ }
+ }
+ } while (0);
+ i14 = i13 + 1 | 0;
+ if (!(i14 >>> 0 < i8 >>> 0)) {
+ i7 = 147;
+ break;
+ }
+ }
+ } else {
+ i7 = 147;
+ }
+ } else if ((i13 | 0) == 37) {
+ i6 = _match_class(i10, HEAPU8[i21] | 0) | 0;
+ i7 = 147;
+ } else if ((i13 | 0) != 46) {
+ i6 = i14 << 24 >> 24 == i9 << 24 >> 24 | 0;
+ i7 = 147;
+ }
+ } while (0);
+ if ((i7 | 0) == 147 ? (i7 = 0, (i6 | 0) == 0) : 0) {
+ i12 = 0;
+ break L4;
+ }
+ i9 = i12 + 1 | 0;
+ i12 = _match(i1, i9, i4) | 0;
+ if ((i12 | 0) == 0) {
+ i12 = i9;
+ } else {
+ break L4;
+ }
+ }
+ } else if ((i7 | 0) == 112) {
+ i19 = i12;
+ }
+ i10 = HEAP32[i3 >> 2] | 0;
+ if (i10 >>> 0 > i19 >>> 0) {
+ i5 = i22 + -1 | 0;
+ i8 = i19;
+ i6 = 0;
+ do {
+ i8 = HEAP8[i8] | 0;
+ i9 = i8 & 255;
+ i13 = HEAP8[i11] | 0;
+ i12 = i13 << 24 >> 24;
+ L183 : do {
+ if ((i12 | 0) == 37) {
+ i10 = _match_class(i9, HEAPU8[i21] | 0) | 0;
+ i7 = 129;
+ } else if ((i12 | 0) == 91) {
+ i7 = (HEAP8[i21] | 0) == 94;
+ i12 = i7 ? i21 : i11;
+ i10 = i7 & 1;
+ i7 = i10 ^ 1;
+ i13 = i12 + 1 | 0;
+ if (i13 >>> 0 < i5 >>> 0) {
+ while (1) {
+ i14 = HEAP8[i13] | 0;
+ i16 = i12 + 2 | 0;
+ i15 = HEAP8[i16] | 0;
+ do {
+ if (i14 << 24 >> 24 == 37) {
+ if ((_match_class(i9, i15 & 255) | 0) == 0) {
+ i12 = i16;
+ } else {
+ i10 = i7;
+ i7 = 129;
+ break L183;
+ }
+ } else {
+ if (i15 << 24 >> 24 == 45 ? (i4 = i12 + 3 | 0, i4 >>> 0 < i5 >>> 0) : 0) {
+ if ((i14 & 255) > (i8 & 255)) {
+ i12 = i4;
+ break;
+ }
+ if ((HEAPU8[i4] | 0) < (i8 & 255)) {
+ i12 = i4;
+ break;
+ } else {
+ i10 = i7;
+ i7 = 129;
+ break L183;
+ }
+ }
+ if (i14 << 24 >> 24 == i8 << 24 >> 24) {
+ i10 = i7;
+ i7 = 129;
+ break L183;
+ } else {
+ i12 = i13;
+ }
+ }
+ } while (0);
+ i13 = i12 + 1 | 0;
+ if (!(i13 >>> 0 < i5 >>> 0)) {
+ i7 = 129;
+ break;
+ }
+ }
+ } else {
+ i7 = 129;
+ }
+ } else if ((i12 | 0) != 46) {
+ i10 = i13 << 24 >> 24 == i8 << 24 >> 24 | 0;
+ i7 = 129;
+ }
+ } while (0);
+ if ((i7 | 0) == 129) {
+ i7 = 0;
+ if ((i10 | 0) == 0) {
+ break;
+ }
+ i10 = HEAP32[i3 >> 2] | 0;
+ }
+ i6 = i6 + 1 | 0;
+ i8 = i19 + i6 | 0;
+ } while (i10 >>> 0 > i8 >>> 0);
+ if (!((i6 | 0) > -1)) {
+ i12 = 0;
+ break;
+ }
+ } else {
+ i6 = 0;
+ }
+ i3 = i22 + 1 | 0;
+ while (1) {
+ i12 = _match(i1, i19 + i6 | 0, i3) | 0;
+ if ((i12 | 0) != 0) {
+ break L4;
+ }
+ if ((i6 | 0) > 0) {
+ i6 = i6 + -1 | 0;
+ } else {
+ i12 = 0;
+ break;
+ }
+ }
+ }
+ } while (0);
+ HEAP32[i1 >> 2] = (HEAP32[i1 >> 2] | 0) + 1;
+ STACKTOP = i2;
+ return i12 | 0;
+}
+function _free(i7) {
+ i7 = i7 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0;
+ i1 = STACKTOP;
+ if ((i7 | 0) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i15 = i7 + -8 | 0;
+ i16 = HEAP32[12928 >> 2] | 0;
+ if (i15 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ i13 = HEAP32[i7 + -4 >> 2] | 0;
+ i12 = i13 & 3;
+ if ((i12 | 0) == 1) {
+ _abort();
+ }
+ i8 = i13 & -8;
+ i6 = i7 + (i8 + -8) | 0;
+ do {
+ if ((i13 & 1 | 0) == 0) {
+ i19 = HEAP32[i15 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i15 = -8 - i19 | 0;
+ i13 = i7 + i15 | 0;
+ i12 = i19 + i8 | 0;
+ if (i13 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ if ((i13 | 0) == (HEAP32[12932 >> 2] | 0)) {
+ i2 = i7 + (i8 + -4) | 0;
+ if ((HEAP32[i2 >> 2] & 3 | 0) != 3) {
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ HEAP32[12920 >> 2] = i12;
+ HEAP32[i2 >> 2] = HEAP32[i2 >> 2] & -2;
+ HEAP32[i7 + (i15 + 4) >> 2] = i12 | 1;
+ HEAP32[i6 >> 2] = i12;
+ STACKTOP = i1;
+ return;
+ }
+ i18 = i19 >>> 3;
+ if (i19 >>> 0 < 256) {
+ i2 = HEAP32[i7 + (i15 + 8) >> 2] | 0;
+ i11 = HEAP32[i7 + (i15 + 12) >> 2] | 0;
+ i14 = 12952 + (i18 << 1 << 2) | 0;
+ if ((i2 | 0) != (i14 | 0)) {
+ if (i2 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ if ((HEAP32[i2 + 12 >> 2] | 0) != (i13 | 0)) {
+ _abort();
+ }
+ }
+ if ((i11 | 0) == (i2 | 0)) {
+ HEAP32[3228] = HEAP32[3228] & ~(1 << i18);
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ if ((i11 | 0) != (i14 | 0)) {
+ if (i11 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ i14 = i11 + 8 | 0;
+ if ((HEAP32[i14 >> 2] | 0) == (i13 | 0)) {
+ i17 = i14;
+ } else {
+ _abort();
+ }
+ } else {
+ i17 = i11 + 8 | 0;
+ }
+ HEAP32[i2 + 12 >> 2] = i11;
+ HEAP32[i17 >> 2] = i2;
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ i17 = HEAP32[i7 + (i15 + 24) >> 2] | 0;
+ i18 = HEAP32[i7 + (i15 + 12) >> 2] | 0;
+ do {
+ if ((i18 | 0) == (i13 | 0)) {
+ i19 = i7 + (i15 + 20) | 0;
+ i18 = HEAP32[i19 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ i19 = i7 + (i15 + 16) | 0;
+ i18 = HEAP32[i19 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ i14 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i21 = i18 + 20 | 0;
+ i20 = HEAP32[i21 >> 2] | 0;
+ if ((i20 | 0) != 0) {
+ i18 = i20;
+ i19 = i21;
+ continue;
+ }
+ i20 = i18 + 16 | 0;
+ i21 = HEAP32[i20 >> 2] | 0;
+ if ((i21 | 0) == 0) {
+ break;
+ } else {
+ i18 = i21;
+ i19 = i20;
+ }
+ }
+ if (i19 >>> 0 < i16 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i19 >> 2] = 0;
+ i14 = i18;
+ break;
+ }
+ } else {
+ i19 = HEAP32[i7 + (i15 + 8) >> 2] | 0;
+ if (i19 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ i16 = i19 + 12 | 0;
+ if ((HEAP32[i16 >> 2] | 0) != (i13 | 0)) {
+ _abort();
+ }
+ i20 = i18 + 8 | 0;
+ if ((HEAP32[i20 >> 2] | 0) == (i13 | 0)) {
+ HEAP32[i16 >> 2] = i18;
+ HEAP32[i20 >> 2] = i19;
+ i14 = i18;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ if ((i17 | 0) != 0) {
+ i18 = HEAP32[i7 + (i15 + 28) >> 2] | 0;
+ i16 = 13216 + (i18 << 2) | 0;
+ if ((i13 | 0) == (HEAP32[i16 >> 2] | 0)) {
+ HEAP32[i16 >> 2] = i14;
+ if ((i14 | 0) == 0) {
+ HEAP32[12916 >> 2] = HEAP32[12916 >> 2] & ~(1 << i18);
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ } else {
+ if (i17 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i17 + 16 | 0;
+ if ((HEAP32[i16 >> 2] | 0) == (i13 | 0)) {
+ HEAP32[i16 >> 2] = i14;
+ } else {
+ HEAP32[i17 + 20 >> 2] = i14;
+ }
+ if ((i14 | 0) == 0) {
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ }
+ if (i14 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i14 + 24 >> 2] = i17;
+ i16 = HEAP32[i7 + (i15 + 16) >> 2] | 0;
+ do {
+ if ((i16 | 0) != 0) {
+ if (i16 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i14 + 16 >> 2] = i16;
+ HEAP32[i16 + 24 >> 2] = i14;
+ break;
+ }
+ }
+ } while (0);
+ i15 = HEAP32[i7 + (i15 + 20) >> 2] | 0;
+ if ((i15 | 0) != 0) {
+ if (i15 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i14 + 20 >> 2] = i15;
+ HEAP32[i15 + 24 >> 2] = i14;
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ } else {
+ i2 = i13;
+ i11 = i12;
+ }
+ } else {
+ i2 = i13;
+ i11 = i12;
+ }
+ } else {
+ i2 = i15;
+ i11 = i8;
+ }
+ } while (0);
+ if (!(i2 >>> 0 < i6 >>> 0)) {
+ _abort();
+ }
+ i12 = i7 + (i8 + -4) | 0;
+ i13 = HEAP32[i12 >> 2] | 0;
+ if ((i13 & 1 | 0) == 0) {
+ _abort();
+ }
+ if ((i13 & 2 | 0) == 0) {
+ if ((i6 | 0) == (HEAP32[12936 >> 2] | 0)) {
+ i21 = (HEAP32[12924 >> 2] | 0) + i11 | 0;
+ HEAP32[12924 >> 2] = i21;
+ HEAP32[12936 >> 2] = i2;
+ HEAP32[i2 + 4 >> 2] = i21 | 1;
+ if ((i2 | 0) != (HEAP32[12932 >> 2] | 0)) {
+ STACKTOP = i1;
+ return;
+ }
+ HEAP32[12932 >> 2] = 0;
+ HEAP32[12920 >> 2] = 0;
+ STACKTOP = i1;
+ return;
+ }
+ if ((i6 | 0) == (HEAP32[12932 >> 2] | 0)) {
+ i21 = (HEAP32[12920 >> 2] | 0) + i11 | 0;
+ HEAP32[12920 >> 2] = i21;
+ HEAP32[12932 >> 2] = i2;
+ HEAP32[i2 + 4 >> 2] = i21 | 1;
+ HEAP32[i2 + i21 >> 2] = i21;
+ STACKTOP = i1;
+ return;
+ }
+ i11 = (i13 & -8) + i11 | 0;
+ i12 = i13 >>> 3;
+ do {
+ if (!(i13 >>> 0 < 256)) {
+ i10 = HEAP32[i7 + (i8 + 16) >> 2] | 0;
+ i15 = HEAP32[i7 + (i8 | 4) >> 2] | 0;
+ do {
+ if ((i15 | 0) == (i6 | 0)) {
+ i13 = i7 + (i8 + 12) | 0;
+ i12 = HEAP32[i13 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ i13 = i7 + (i8 + 8) | 0;
+ i12 = HEAP32[i13 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ i9 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i14 = i12 + 20 | 0;
+ i15 = HEAP32[i14 >> 2] | 0;
+ if ((i15 | 0) != 0) {
+ i12 = i15;
+ i13 = i14;
+ continue;
+ }
+ i14 = i12 + 16 | 0;
+ i15 = HEAP32[i14 >> 2] | 0;
+ if ((i15 | 0) == 0) {
+ break;
+ } else {
+ i12 = i15;
+ i13 = i14;
+ }
+ }
+ if (i13 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i13 >> 2] = 0;
+ i9 = i12;
+ break;
+ }
+ } else {
+ i13 = HEAP32[i7 + i8 >> 2] | 0;
+ if (i13 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i14 = i13 + 12 | 0;
+ if ((HEAP32[i14 >> 2] | 0) != (i6 | 0)) {
+ _abort();
+ }
+ i12 = i15 + 8 | 0;
+ if ((HEAP32[i12 >> 2] | 0) == (i6 | 0)) {
+ HEAP32[i14 >> 2] = i15;
+ HEAP32[i12 >> 2] = i13;
+ i9 = i15;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ if ((i10 | 0) != 0) {
+ i12 = HEAP32[i7 + (i8 + 20) >> 2] | 0;
+ i13 = 13216 + (i12 << 2) | 0;
+ if ((i6 | 0) == (HEAP32[i13 >> 2] | 0)) {
+ HEAP32[i13 >> 2] = i9;
+ if ((i9 | 0) == 0) {
+ HEAP32[12916 >> 2] = HEAP32[12916 >> 2] & ~(1 << i12);
+ break;
+ }
+ } else {
+ if (i10 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i12 = i10 + 16 | 0;
+ if ((HEAP32[i12 >> 2] | 0) == (i6 | 0)) {
+ HEAP32[i12 >> 2] = i9;
+ } else {
+ HEAP32[i10 + 20 >> 2] = i9;
+ }
+ if ((i9 | 0) == 0) {
+ break;
+ }
+ }
+ if (i9 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i9 + 24 >> 2] = i10;
+ i6 = HEAP32[i7 + (i8 + 8) >> 2] | 0;
+ do {
+ if ((i6 | 0) != 0) {
+ if (i6 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i9 + 16 >> 2] = i6;
+ HEAP32[i6 + 24 >> 2] = i9;
+ break;
+ }
+ }
+ } while (0);
+ i6 = HEAP32[i7 + (i8 + 12) >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ if (i6 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i9 + 20 >> 2] = i6;
+ HEAP32[i6 + 24 >> 2] = i9;
+ break;
+ }
+ }
+ }
+ } else {
+ i9 = HEAP32[i7 + i8 >> 2] | 0;
+ i7 = HEAP32[i7 + (i8 | 4) >> 2] | 0;
+ i8 = 12952 + (i12 << 1 << 2) | 0;
+ if ((i9 | 0) != (i8 | 0)) {
+ if (i9 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ if ((HEAP32[i9 + 12 >> 2] | 0) != (i6 | 0)) {
+ _abort();
+ }
+ }
+ if ((i7 | 0) == (i9 | 0)) {
+ HEAP32[3228] = HEAP32[3228] & ~(1 << i12);
+ break;
+ }
+ if ((i7 | 0) != (i8 | 0)) {
+ if (i7 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i8 = i7 + 8 | 0;
+ if ((HEAP32[i8 >> 2] | 0) == (i6 | 0)) {
+ i10 = i8;
+ } else {
+ _abort();
+ }
+ } else {
+ i10 = i7 + 8 | 0;
+ }
+ HEAP32[i9 + 12 >> 2] = i7;
+ HEAP32[i10 >> 2] = i9;
+ }
+ } while (0);
+ HEAP32[i2 + 4 >> 2] = i11 | 1;
+ HEAP32[i2 + i11 >> 2] = i11;
+ if ((i2 | 0) == (HEAP32[12932 >> 2] | 0)) {
+ HEAP32[12920 >> 2] = i11;
+ STACKTOP = i1;
+ return;
+ }
+ } else {
+ HEAP32[i12 >> 2] = i13 & -2;
+ HEAP32[i2 + 4 >> 2] = i11 | 1;
+ HEAP32[i2 + i11 >> 2] = i11;
+ }
+ i6 = i11 >>> 3;
+ if (i11 >>> 0 < 256) {
+ i7 = i6 << 1;
+ i3 = 12952 + (i7 << 2) | 0;
+ i8 = HEAP32[3228] | 0;
+ i6 = 1 << i6;
+ if ((i8 & i6 | 0) != 0) {
+ i6 = 12952 + (i7 + 2 << 2) | 0;
+ i7 = HEAP32[i6 >> 2] | 0;
+ if (i7 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i4 = i6;
+ i5 = i7;
+ }
+ } else {
+ HEAP32[3228] = i8 | i6;
+ i4 = 12952 + (i7 + 2 << 2) | 0;
+ i5 = i3;
+ }
+ HEAP32[i4 >> 2] = i2;
+ HEAP32[i5 + 12 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i5;
+ HEAP32[i2 + 12 >> 2] = i3;
+ STACKTOP = i1;
+ return;
+ }
+ i4 = i11 >>> 8;
+ if ((i4 | 0) != 0) {
+ if (i11 >>> 0 > 16777215) {
+ i4 = 31;
+ } else {
+ i20 = (i4 + 1048320 | 0) >>> 16 & 8;
+ i21 = i4 << i20;
+ i19 = (i21 + 520192 | 0) >>> 16 & 4;
+ i21 = i21 << i19;
+ i4 = (i21 + 245760 | 0) >>> 16 & 2;
+ i4 = 14 - (i19 | i20 | i4) + (i21 << i4 >>> 15) | 0;
+ i4 = i11 >>> (i4 + 7 | 0) & 1 | i4 << 1;
+ }
+ } else {
+ i4 = 0;
+ }
+ i5 = 13216 + (i4 << 2) | 0;
+ HEAP32[i2 + 28 >> 2] = i4;
+ HEAP32[i2 + 20 >> 2] = 0;
+ HEAP32[i2 + 16 >> 2] = 0;
+ i7 = HEAP32[12916 >> 2] | 0;
+ i6 = 1 << i4;
+ L199 : do {
+ if ((i7 & i6 | 0) != 0) {
+ i5 = HEAP32[i5 >> 2] | 0;
+ if ((i4 | 0) == 31) {
+ i4 = 0;
+ } else {
+ i4 = 25 - (i4 >>> 1) | 0;
+ }
+ L204 : do {
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) != (i11 | 0)) {
+ i4 = i11 << i4;
+ i7 = i5;
+ while (1) {
+ i6 = i7 + (i4 >>> 31 << 2) + 16 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) == (i11 | 0)) {
+ i3 = i5;
+ break L204;
+ } else {
+ i4 = i4 << 1;
+ i7 = i5;
+ }
+ }
+ if (i6 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i6 >> 2] = i2;
+ HEAP32[i2 + 24 >> 2] = i7;
+ HEAP32[i2 + 12 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i2;
+ break L199;
+ }
+ } else {
+ i3 = i5;
+ }
+ } while (0);
+ i5 = i3 + 8 | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ i6 = HEAP32[12928 >> 2] | 0;
+ if (i3 >>> 0 < i6 >>> 0) {
+ _abort();
+ }
+ if (i4 >>> 0 < i6 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i4 + 12 >> 2] = i2;
+ HEAP32[i5 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i4;
+ HEAP32[i2 + 12 >> 2] = i3;
+ HEAP32[i2 + 24 >> 2] = 0;
+ break;
+ }
+ } else {
+ HEAP32[12916 >> 2] = i7 | i6;
+ HEAP32[i5 >> 2] = i2;
+ HEAP32[i2 + 24 >> 2] = i5;
+ HEAP32[i2 + 12 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i2;
+ }
+ } while (0);
+ i21 = (HEAP32[12944 >> 2] | 0) + -1 | 0;
+ HEAP32[12944 >> 2] = i21;
+ if ((i21 | 0) == 0) {
+ i2 = 13368 | 0;
+ } else {
+ STACKTOP = i1;
+ return;
+ }
+ while (1) {
+ i2 = HEAP32[i2 >> 2] | 0;
+ if ((i2 | 0) == 0) {
+ break;
+ } else {
+ i2 = i2 + 8 | 0;
+ }
+ }
+ HEAP32[12944 >> 2] = -1;
+ STACKTOP = i1;
+ return;
+}
+function _dispose_chunk(i6, i7) {
+ i6 = i6 | 0;
+ i7 = i7 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0;
+ i1 = STACKTOP;
+ i5 = i6 + i7 | 0;
+ i10 = HEAP32[i6 + 4 >> 2] | 0;
+ do {
+ if ((i10 & 1 | 0) == 0) {
+ i14 = HEAP32[i6 >> 2] | 0;
+ if ((i10 & 3 | 0) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i10 = i6 + (0 - i14) | 0;
+ i11 = i14 + i7 | 0;
+ i15 = HEAP32[12928 >> 2] | 0;
+ if (i10 >>> 0 < i15 >>> 0) {
+ _abort();
+ }
+ if ((i10 | 0) == (HEAP32[12932 >> 2] | 0)) {
+ i2 = i6 + (i7 + 4) | 0;
+ if ((HEAP32[i2 >> 2] & 3 | 0) != 3) {
+ i2 = i10;
+ i12 = i11;
+ break;
+ }
+ HEAP32[12920 >> 2] = i11;
+ HEAP32[i2 >> 2] = HEAP32[i2 >> 2] & -2;
+ HEAP32[i6 + (4 - i14) >> 2] = i11 | 1;
+ HEAP32[i5 >> 2] = i11;
+ STACKTOP = i1;
+ return;
+ }
+ i17 = i14 >>> 3;
+ if (i14 >>> 0 < 256) {
+ i2 = HEAP32[i6 + (8 - i14) >> 2] | 0;
+ i12 = HEAP32[i6 + (12 - i14) >> 2] | 0;
+ i13 = 12952 + (i17 << 1 << 2) | 0;
+ if ((i2 | 0) != (i13 | 0)) {
+ if (i2 >>> 0 < i15 >>> 0) {
+ _abort();
+ }
+ if ((HEAP32[i2 + 12 >> 2] | 0) != (i10 | 0)) {
+ _abort();
+ }
+ }
+ if ((i12 | 0) == (i2 | 0)) {
+ HEAP32[3228] = HEAP32[3228] & ~(1 << i17);
+ i2 = i10;
+ i12 = i11;
+ break;
+ }
+ if ((i12 | 0) != (i13 | 0)) {
+ if (i12 >>> 0 < i15 >>> 0) {
+ _abort();
+ }
+ i13 = i12 + 8 | 0;
+ if ((HEAP32[i13 >> 2] | 0) == (i10 | 0)) {
+ i16 = i13;
+ } else {
+ _abort();
+ }
+ } else {
+ i16 = i12 + 8 | 0;
+ }
+ HEAP32[i2 + 12 >> 2] = i12;
+ HEAP32[i16 >> 2] = i2;
+ i2 = i10;
+ i12 = i11;
+ break;
+ }
+ i16 = HEAP32[i6 + (24 - i14) >> 2] | 0;
+ i18 = HEAP32[i6 + (12 - i14) >> 2] | 0;
+ do {
+ if ((i18 | 0) == (i10 | 0)) {
+ i19 = 16 - i14 | 0;
+ i18 = i6 + (i19 + 4) | 0;
+ i17 = HEAP32[i18 >> 2] | 0;
+ if ((i17 | 0) == 0) {
+ i18 = i6 + i19 | 0;
+ i17 = HEAP32[i18 >> 2] | 0;
+ if ((i17 | 0) == 0) {
+ i13 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i19 = i17 + 20 | 0;
+ i20 = HEAP32[i19 >> 2] | 0;
+ if ((i20 | 0) != 0) {
+ i17 = i20;
+ i18 = i19;
+ continue;
+ }
+ i20 = i17 + 16 | 0;
+ i19 = HEAP32[i20 >> 2] | 0;
+ if ((i19 | 0) == 0) {
+ break;
+ } else {
+ i17 = i19;
+ i18 = i20;
+ }
+ }
+ if (i18 >>> 0 < i15 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i18 >> 2] = 0;
+ i13 = i17;
+ break;
+ }
+ } else {
+ i17 = HEAP32[i6 + (8 - i14) >> 2] | 0;
+ if (i17 >>> 0 < i15 >>> 0) {
+ _abort();
+ }
+ i19 = i17 + 12 | 0;
+ if ((HEAP32[i19 >> 2] | 0) != (i10 | 0)) {
+ _abort();
+ }
+ i15 = i18 + 8 | 0;
+ if ((HEAP32[i15 >> 2] | 0) == (i10 | 0)) {
+ HEAP32[i19 >> 2] = i18;
+ HEAP32[i15 >> 2] = i17;
+ i13 = i18;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ if ((i16 | 0) != 0) {
+ i15 = HEAP32[i6 + (28 - i14) >> 2] | 0;
+ i17 = 13216 + (i15 << 2) | 0;
+ if ((i10 | 0) == (HEAP32[i17 >> 2] | 0)) {
+ HEAP32[i17 >> 2] = i13;
+ if ((i13 | 0) == 0) {
+ HEAP32[12916 >> 2] = HEAP32[12916 >> 2] & ~(1 << i15);
+ i2 = i10;
+ i12 = i11;
+ break;
+ }
+ } else {
+ if (i16 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i15 = i16 + 16 | 0;
+ if ((HEAP32[i15 >> 2] | 0) == (i10 | 0)) {
+ HEAP32[i15 >> 2] = i13;
+ } else {
+ HEAP32[i16 + 20 >> 2] = i13;
+ }
+ if ((i13 | 0) == 0) {
+ i2 = i10;
+ i12 = i11;
+ break;
+ }
+ }
+ if (i13 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i13 + 24 >> 2] = i16;
+ i14 = 16 - i14 | 0;
+ i15 = HEAP32[i6 + i14 >> 2] | 0;
+ do {
+ if ((i15 | 0) != 0) {
+ if (i15 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i13 + 16 >> 2] = i15;
+ HEAP32[i15 + 24 >> 2] = i13;
+ break;
+ }
+ }
+ } while (0);
+ i14 = HEAP32[i6 + (i14 + 4) >> 2] | 0;
+ if ((i14 | 0) != 0) {
+ if (i14 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i13 + 20 >> 2] = i14;
+ HEAP32[i14 + 24 >> 2] = i13;
+ i2 = i10;
+ i12 = i11;
+ break;
+ }
+ } else {
+ i2 = i10;
+ i12 = i11;
+ }
+ } else {
+ i2 = i10;
+ i12 = i11;
+ }
+ } else {
+ i2 = i6;
+ i12 = i7;
+ }
+ } while (0);
+ i10 = HEAP32[12928 >> 2] | 0;
+ if (i5 >>> 0 < i10 >>> 0) {
+ _abort();
+ }
+ i11 = i6 + (i7 + 4) | 0;
+ i13 = HEAP32[i11 >> 2] | 0;
+ if ((i13 & 2 | 0) == 0) {
+ if ((i5 | 0) == (HEAP32[12936 >> 2] | 0)) {
+ i20 = (HEAP32[12924 >> 2] | 0) + i12 | 0;
+ HEAP32[12924 >> 2] = i20;
+ HEAP32[12936 >> 2] = i2;
+ HEAP32[i2 + 4 >> 2] = i20 | 1;
+ if ((i2 | 0) != (HEAP32[12932 >> 2] | 0)) {
+ STACKTOP = i1;
+ return;
+ }
+ HEAP32[12932 >> 2] = 0;
+ HEAP32[12920 >> 2] = 0;
+ STACKTOP = i1;
+ return;
+ }
+ if ((i5 | 0) == (HEAP32[12932 >> 2] | 0)) {
+ i20 = (HEAP32[12920 >> 2] | 0) + i12 | 0;
+ HEAP32[12920 >> 2] = i20;
+ HEAP32[12932 >> 2] = i2;
+ HEAP32[i2 + 4 >> 2] = i20 | 1;
+ HEAP32[i2 + i20 >> 2] = i20;
+ STACKTOP = i1;
+ return;
+ }
+ i12 = (i13 & -8) + i12 | 0;
+ i11 = i13 >>> 3;
+ do {
+ if (!(i13 >>> 0 < 256)) {
+ i9 = HEAP32[i6 + (i7 + 24) >> 2] | 0;
+ i11 = HEAP32[i6 + (i7 + 12) >> 2] | 0;
+ do {
+ if ((i11 | 0) == (i5 | 0)) {
+ i13 = i6 + (i7 + 20) | 0;
+ i11 = HEAP32[i13 >> 2] | 0;
+ if ((i11 | 0) == 0) {
+ i13 = i6 + (i7 + 16) | 0;
+ i11 = HEAP32[i13 >> 2] | 0;
+ if ((i11 | 0) == 0) {
+ i8 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i15 = i11 + 20 | 0;
+ i14 = HEAP32[i15 >> 2] | 0;
+ if ((i14 | 0) != 0) {
+ i11 = i14;
+ i13 = i15;
+ continue;
+ }
+ i14 = i11 + 16 | 0;
+ i15 = HEAP32[i14 >> 2] | 0;
+ if ((i15 | 0) == 0) {
+ break;
+ } else {
+ i11 = i15;
+ i13 = i14;
+ }
+ }
+ if (i13 >>> 0 < i10 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i13 >> 2] = 0;
+ i8 = i11;
+ break;
+ }
+ } else {
+ i13 = HEAP32[i6 + (i7 + 8) >> 2] | 0;
+ if (i13 >>> 0 < i10 >>> 0) {
+ _abort();
+ }
+ i10 = i13 + 12 | 0;
+ if ((HEAP32[i10 >> 2] | 0) != (i5 | 0)) {
+ _abort();
+ }
+ i14 = i11 + 8 | 0;
+ if ((HEAP32[i14 >> 2] | 0) == (i5 | 0)) {
+ HEAP32[i10 >> 2] = i11;
+ HEAP32[i14 >> 2] = i13;
+ i8 = i11;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ if ((i9 | 0) != 0) {
+ i10 = HEAP32[i6 + (i7 + 28) >> 2] | 0;
+ i11 = 13216 + (i10 << 2) | 0;
+ if ((i5 | 0) == (HEAP32[i11 >> 2] | 0)) {
+ HEAP32[i11 >> 2] = i8;
+ if ((i8 | 0) == 0) {
+ HEAP32[12916 >> 2] = HEAP32[12916 >> 2] & ~(1 << i10);
+ break;
+ }
+ } else {
+ if (i9 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i10 = i9 + 16 | 0;
+ if ((HEAP32[i10 >> 2] | 0) == (i5 | 0)) {
+ HEAP32[i10 >> 2] = i8;
+ } else {
+ HEAP32[i9 + 20 >> 2] = i8;
+ }
+ if ((i8 | 0) == 0) {
+ break;
+ }
+ }
+ if (i8 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i8 + 24 >> 2] = i9;
+ i5 = HEAP32[i6 + (i7 + 16) >> 2] | 0;
+ do {
+ if ((i5 | 0) != 0) {
+ if (i5 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i8 + 16 >> 2] = i5;
+ HEAP32[i5 + 24 >> 2] = i8;
+ break;
+ }
+ }
+ } while (0);
+ i5 = HEAP32[i6 + (i7 + 20) >> 2] | 0;
+ if ((i5 | 0) != 0) {
+ if (i5 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i8 + 20 >> 2] = i5;
+ HEAP32[i5 + 24 >> 2] = i8;
+ break;
+ }
+ }
+ }
+ } else {
+ i8 = HEAP32[i6 + (i7 + 8) >> 2] | 0;
+ i6 = HEAP32[i6 + (i7 + 12) >> 2] | 0;
+ i7 = 12952 + (i11 << 1 << 2) | 0;
+ if ((i8 | 0) != (i7 | 0)) {
+ if (i8 >>> 0 < i10 >>> 0) {
+ _abort();
+ }
+ if ((HEAP32[i8 + 12 >> 2] | 0) != (i5 | 0)) {
+ _abort();
+ }
+ }
+ if ((i6 | 0) == (i8 | 0)) {
+ HEAP32[3228] = HEAP32[3228] & ~(1 << i11);
+ break;
+ }
+ if ((i6 | 0) != (i7 | 0)) {
+ if (i6 >>> 0 < i10 >>> 0) {
+ _abort();
+ }
+ i7 = i6 + 8 | 0;
+ if ((HEAP32[i7 >> 2] | 0) == (i5 | 0)) {
+ i9 = i7;
+ } else {
+ _abort();
+ }
+ } else {
+ i9 = i6 + 8 | 0;
+ }
+ HEAP32[i8 + 12 >> 2] = i6;
+ HEAP32[i9 >> 2] = i8;
+ }
+ } while (0);
+ HEAP32[i2 + 4 >> 2] = i12 | 1;
+ HEAP32[i2 + i12 >> 2] = i12;
+ if ((i2 | 0) == (HEAP32[12932 >> 2] | 0)) {
+ HEAP32[12920 >> 2] = i12;
+ STACKTOP = i1;
+ return;
+ }
+ } else {
+ HEAP32[i11 >> 2] = i13 & -2;
+ HEAP32[i2 + 4 >> 2] = i12 | 1;
+ HEAP32[i2 + i12 >> 2] = i12;
+ }
+ i6 = i12 >>> 3;
+ if (i12 >>> 0 < 256) {
+ i7 = i6 << 1;
+ i5 = 12952 + (i7 << 2) | 0;
+ i8 = HEAP32[3228] | 0;
+ i6 = 1 << i6;
+ if ((i8 & i6 | 0) != 0) {
+ i7 = 12952 + (i7 + 2 << 2) | 0;
+ i6 = HEAP32[i7 >> 2] | 0;
+ if (i6 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i4 = i7;
+ i3 = i6;
+ }
+ } else {
+ HEAP32[3228] = i8 | i6;
+ i4 = 12952 + (i7 + 2 << 2) | 0;
+ i3 = i5;
+ }
+ HEAP32[i4 >> 2] = i2;
+ HEAP32[i3 + 12 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i3;
+ HEAP32[i2 + 12 >> 2] = i5;
+ STACKTOP = i1;
+ return;
+ }
+ i3 = i12 >>> 8;
+ if ((i3 | 0) != 0) {
+ if (i12 >>> 0 > 16777215) {
+ i3 = 31;
+ } else {
+ i19 = (i3 + 1048320 | 0) >>> 16 & 8;
+ i20 = i3 << i19;
+ i18 = (i20 + 520192 | 0) >>> 16 & 4;
+ i20 = i20 << i18;
+ i3 = (i20 + 245760 | 0) >>> 16 & 2;
+ i3 = 14 - (i18 | i19 | i3) + (i20 << i3 >>> 15) | 0;
+ i3 = i12 >>> (i3 + 7 | 0) & 1 | i3 << 1;
+ }
+ } else {
+ i3 = 0;
+ }
+ i6 = 13216 + (i3 << 2) | 0;
+ HEAP32[i2 + 28 >> 2] = i3;
+ HEAP32[i2 + 20 >> 2] = 0;
+ HEAP32[i2 + 16 >> 2] = 0;
+ i5 = HEAP32[12916 >> 2] | 0;
+ i4 = 1 << i3;
+ if ((i5 & i4 | 0) == 0) {
+ HEAP32[12916 >> 2] = i5 | i4;
+ HEAP32[i6 >> 2] = i2;
+ HEAP32[i2 + 24 >> 2] = i6;
+ HEAP32[i2 + 12 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i2;
+ STACKTOP = i1;
+ return;
+ }
+ i4 = HEAP32[i6 >> 2] | 0;
+ if ((i3 | 0) == 31) {
+ i3 = 0;
+ } else {
+ i3 = 25 - (i3 >>> 1) | 0;
+ }
+ L194 : do {
+ if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i12 | 0)) {
+ i3 = i12 << i3;
+ i6 = i4;
+ while (1) {
+ i5 = i6 + (i3 >>> 31 << 2) + 16 | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ if ((i4 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i4 + 4 >> 2] & -8 | 0) == (i12 | 0)) {
+ break L194;
+ } else {
+ i3 = i3 << 1;
+ i6 = i4;
+ }
+ }
+ if (i5 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i5 >> 2] = i2;
+ HEAP32[i2 + 24 >> 2] = i6;
+ HEAP32[i2 + 12 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i2;
+ STACKTOP = i1;
+ return;
+ }
+ } while (0);
+ i3 = i4 + 8 | 0;
+ i6 = HEAP32[i3 >> 2] | 0;
+ i5 = HEAP32[12928 >> 2] | 0;
+ if (i4 >>> 0 < i5 >>> 0) {
+ _abort();
+ }
+ if (i6 >>> 0 < i5 >>> 0) {
+ _abort();
+ }
+ HEAP32[i6 + 12 >> 2] = i2;
+ HEAP32[i3 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i6;
+ HEAP32[i2 + 12 >> 2] = i4;
+ HEAP32[i2 + 24 >> 2] = 0;
+ STACKTOP = i1;
+ return;
+}
+function _singlestep(i2) {
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i14 = i1;
+ i3 = i2 + 12 | 0;
+ i8 = HEAP32[i3 >> 2] | 0;
+ i6 = i8 + 61 | 0;
+ switch (HEAPU8[i6] | 0) {
+ case 0:
+ {
+ if ((HEAP32[i8 + 84 >> 2] | 0) != 0) {
+ i21 = i8 + 16 | 0;
+ i22 = HEAP32[i21 >> 2] | 0;
+ _propagatemark(i8);
+ i22 = (HEAP32[i21 >> 2] | 0) - i22 | 0;
+ STACKTOP = i1;
+ return i22 | 0;
+ }
+ HEAP8[i6] = 1;
+ i6 = i8 + 20 | 0;
+ HEAP32[i6 >> 2] = HEAP32[i8 + 16 >> 2];
+ i8 = HEAP32[i3 >> 2] | 0;
+ i7 = i8 + 16 | 0;
+ i14 = HEAP32[i7 >> 2] | 0;
+ if ((i2 | 0) != 0 ? !((HEAP8[i2 + 5 | 0] & 3) == 0) : 0) {
+ _reallymarkobject(i8, i2);
+ }
+ if ((HEAP32[i8 + 48 >> 2] & 64 | 0) != 0 ? (i13 = HEAP32[i8 + 40 >> 2] | 0, !((HEAP8[i13 + 5 | 0] & 3) == 0)) : 0) {
+ _reallymarkobject(i8, i13);
+ }
+ _markmt(i8);
+ i13 = i8 + 112 | 0;
+ i15 = HEAP32[i8 + 132 >> 2] | 0;
+ if ((i15 | 0) != (i13 | 0)) {
+ do {
+ if (((HEAP8[i15 + 5 | 0] & 7) == 0 ? (i12 = HEAP32[i15 + 8 >> 2] | 0, (HEAP32[i12 + 8 >> 2] & 64 | 0) != 0) : 0) ? (i11 = HEAP32[i12 >> 2] | 0, !((HEAP8[i11 + 5 | 0] & 3) == 0)) : 0) {
+ _reallymarkobject(i8, i11);
+ }
+ i15 = HEAP32[i15 + 20 >> 2] | 0;
+ } while ((i15 | 0) != (i13 | 0));
+ }
+ i16 = i8 + 84 | 0;
+ if ((HEAP32[i16 >> 2] | 0) != 0) {
+ do {
+ _propagatemark(i8);
+ } while ((HEAP32[i16 >> 2] | 0) != 0);
+ }
+ i17 = (HEAP32[i7 >> 2] | 0) - i14 | 0;
+ i11 = i8 + 92 | 0;
+ i12 = HEAP32[i11 >> 2] | 0;
+ i21 = i8 + 88 | 0;
+ i22 = HEAP32[i21 >> 2] | 0;
+ i15 = i8 + 96 | 0;
+ i13 = HEAP32[i15 >> 2] | 0;
+ HEAP32[i15 >> 2] = 0;
+ HEAP32[i21 >> 2] = 0;
+ HEAP32[i11 >> 2] = 0;
+ HEAP32[i16 >> 2] = i22;
+ if ((i22 | 0) != 0) {
+ do {
+ _propagatemark(i8);
+ } while ((HEAP32[i16 >> 2] | 0) != 0);
+ }
+ HEAP32[i16 >> 2] = i12;
+ if ((i12 | 0) != 0) {
+ do {
+ _propagatemark(i8);
+ } while ((HEAP32[i16 >> 2] | 0) != 0);
+ }
+ HEAP32[i16 >> 2] = i13;
+ if ((i13 | 0) != 0) {
+ do {
+ _propagatemark(i8);
+ } while ((HEAP32[i16 >> 2] | 0) != 0);
+ }
+ i18 = HEAP32[i7 >> 2] | 0;
+ while (1) {
+ i13 = HEAP32[i15 >> 2] | 0;
+ HEAP32[i15 >> 2] = 0;
+ i12 = 0;
+ L42 : while (1) {
+ i14 = i13;
+ while (1) {
+ if ((i14 | 0) == 0) {
+ break L42;
+ }
+ i13 = HEAP32[i14 + 24 >> 2] | 0;
+ if ((_traverseephemeron(i8, i14) | 0) == 0) {
+ i14 = i13;
+ } else {
+ break;
+ }
+ }
+ if ((HEAP32[i16 >> 2] | 0) == 0) {
+ i12 = 1;
+ continue;
+ }
+ while (1) {
+ _propagatemark(i8);
+ if ((HEAP32[i16 >> 2] | 0) == 0) {
+ i12 = 1;
+ continue L42;
+ }
+ }
+ }
+ if ((i12 | 0) == 0) {
+ break;
+ }
+ }
+ _clearvalues(i8, HEAP32[i11 >> 2] | 0, 0);
+ i14 = i8 + 100 | 0;
+ _clearvalues(i8, HEAP32[i14 >> 2] | 0, 0);
+ i13 = HEAP32[i11 >> 2] | 0;
+ i12 = HEAP32[i14 >> 2] | 0;
+ i21 = HEAP32[i7 >> 2] | 0;
+ i20 = HEAP32[i3 >> 2] | 0;
+ i19 = i20 + 104 | 0;
+ while (1) {
+ i22 = HEAP32[i19 >> 2] | 0;
+ if ((i22 | 0) == 0) {
+ break;
+ } else {
+ i19 = i22;
+ }
+ }
+ i17 = i17 - i18 + i21 | 0;
+ i20 = i20 + 72 | 0;
+ i21 = HEAP32[i20 >> 2] | 0;
+ L55 : do {
+ if ((i21 | 0) != 0) {
+ while (1) {
+ i18 = i21;
+ while (1) {
+ i22 = i18 + 5 | 0;
+ i21 = HEAP8[i22] | 0;
+ if ((i21 & 3) == 0) {
+ break;
+ }
+ HEAP8[i22] = i21 & 255 | 8;
+ HEAP32[i20 >> 2] = HEAP32[i18 >> 2];
+ HEAP32[i18 >> 2] = HEAP32[i19 >> 2];
+ HEAP32[i19 >> 2] = i18;
+ i19 = HEAP32[i20 >> 2] | 0;
+ if ((i19 | 0) == 0) {
+ break L55;
+ } else {
+ i22 = i18;
+ i18 = i19;
+ i19 = i22;
+ }
+ }
+ i21 = HEAP32[i18 >> 2] | 0;
+ if ((i21 | 0) == 0) {
+ break;
+ } else {
+ i20 = i18;
+ }
+ }
+ }
+ } while (0);
+ i19 = HEAP32[i8 + 104 >> 2] | 0;
+ if ((i19 | 0) != 0) {
+ i18 = i8 + 60 | 0;
+ do {
+ i22 = i19 + 5 | 0;
+ HEAP8[i22] = HEAP8[i18] & 3 | HEAP8[i22] & 184;
+ _reallymarkobject(i8, i19);
+ i19 = HEAP32[i19 >> 2] | 0;
+ } while ((i19 | 0) != 0);
+ }
+ if ((HEAP32[i16 >> 2] | 0) != 0) {
+ do {
+ _propagatemark(i8);
+ } while ((HEAP32[i16 >> 2] | 0) != 0);
+ }
+ i18 = HEAP32[i7 >> 2] | 0;
+ while (1) {
+ i20 = HEAP32[i15 >> 2] | 0;
+ HEAP32[i15 >> 2] = 0;
+ i19 = 0;
+ L74 : while (1) {
+ i21 = i20;
+ while (1) {
+ if ((i21 | 0) == 0) {
+ break L74;
+ }
+ i20 = HEAP32[i21 + 24 >> 2] | 0;
+ if ((_traverseephemeron(i8, i21) | 0) == 0) {
+ i21 = i20;
+ } else {
+ break;
+ }
+ }
+ if ((HEAP32[i16 >> 2] | 0) == 0) {
+ i19 = 1;
+ continue;
+ }
+ while (1) {
+ _propagatemark(i8);
+ if ((HEAP32[i16 >> 2] | 0) == 0) {
+ i19 = 1;
+ continue L74;
+ }
+ }
+ }
+ if ((i19 | 0) == 0) {
+ break;
+ }
+ }
+ i16 = i17 - i18 | 0;
+ i15 = HEAP32[i15 >> 2] | 0;
+ if ((i15 | 0) != 0) {
+ do {
+ i22 = 1 << HEAPU8[i15 + 7 | 0];
+ i19 = HEAP32[i15 + 16 >> 2] | 0;
+ i17 = i19 + (i22 << 5) | 0;
+ if ((i22 | 0) > 0) {
+ do {
+ i18 = i19 + 8 | 0;
+ do {
+ if ((HEAP32[i18 >> 2] | 0) != 0 ? (i9 = i19 + 24 | 0, i10 = HEAP32[i9 >> 2] | 0, (i10 & 64 | 0) != 0) : 0) {
+ i20 = HEAP32[i19 + 16 >> 2] | 0;
+ if ((i10 & 15 | 0) == 4) {
+ if ((i20 | 0) == 0) {
+ break;
+ }
+ if ((HEAP8[i20 + 5 | 0] & 3) == 0) {
+ break;
+ }
+ _reallymarkobject(i8, i20);
+ break;
+ } else {
+ i20 = i20 + 5 | 0;
+ if ((HEAP8[i20] & 3) == 0) {
+ break;
+ }
+ HEAP32[i18 >> 2] = 0;
+ if ((HEAP8[i20] & 3) == 0) {
+ break;
+ }
+ HEAP32[i9 >> 2] = 11;
+ break;
+ }
+ }
+ } while (0);
+ i19 = i19 + 32 | 0;
+ } while (i19 >>> 0 < i17 >>> 0);
+ }
+ i15 = HEAP32[i15 + 24 >> 2] | 0;
+ } while ((i15 | 0) != 0);
+ }
+ i10 = HEAP32[i14 >> 2] | 0;
+ if ((i10 | 0) != 0) {
+ do {
+ i22 = 1 << HEAPU8[i10 + 7 | 0];
+ i17 = HEAP32[i10 + 16 >> 2] | 0;
+ i9 = i17 + (i22 << 5) | 0;
+ if ((i22 | 0) > 0) {
+ do {
+ i15 = i17 + 8 | 0;
+ do {
+ if ((HEAP32[i15 >> 2] | 0) != 0 ? (i5 = i17 + 24 | 0, i4 = HEAP32[i5 >> 2] | 0, (i4 & 64 | 0) != 0) : 0) {
+ i18 = HEAP32[i17 + 16 >> 2] | 0;
+ if ((i4 & 15 | 0) == 4) {
+ if ((i18 | 0) == 0) {
+ break;
+ }
+ if ((HEAP8[i18 + 5 | 0] & 3) == 0) {
+ break;
+ }
+ _reallymarkobject(i8, i18);
+ break;
+ } else {
+ i18 = i18 + 5 | 0;
+ if ((HEAP8[i18] & 3) == 0) {
+ break;
+ }
+ HEAP32[i15 >> 2] = 0;
+ if ((HEAP8[i18] & 3) == 0) {
+ break;
+ }
+ HEAP32[i5 >> 2] = 11;
+ break;
+ }
+ }
+ } while (0);
+ i17 = i17 + 32 | 0;
+ } while (i17 >>> 0 < i9 >>> 0);
+ }
+ i10 = HEAP32[i10 + 24 >> 2] | 0;
+ } while ((i10 | 0) != 0);
+ }
+ _clearvalues(i8, HEAP32[i11 >> 2] | 0, i13);
+ _clearvalues(i8, HEAP32[i14 >> 2] | 0, i12);
+ i4 = i8 + 60 | 0;
+ HEAP8[i4] = HEAPU8[i4] ^ 3;
+ i4 = i16 + (HEAP32[i7 >> 2] | 0) | 0;
+ HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + i4;
+ i3 = HEAP32[i3 >> 2] | 0;
+ HEAP8[i3 + 61 | 0] = 2;
+ HEAP32[i3 + 64 >> 2] = 0;
+ i7 = i3 + 72 | 0;
+ i5 = 0;
+ do {
+ i5 = i5 + 1 | 0;
+ i6 = _sweeplist(i2, i7, 1) | 0;
+ } while ((i6 | 0) == (i7 | 0));
+ HEAP32[i3 + 80 >> 2] = i6;
+ i6 = i3 + 68 | 0;
+ i7 = 0;
+ do {
+ i7 = i7 + 1 | 0;
+ i8 = _sweeplist(i2, i6, 1) | 0;
+ } while ((i8 | 0) == (i6 | 0));
+ HEAP32[i3 + 76 >> 2] = i8;
+ i22 = ((i7 + i5 | 0) * 5 | 0) + i4 | 0;
+ STACKTOP = i1;
+ return i22 | 0;
+ }
+ case 2:
+ {
+ i3 = i8 + 64 | 0;
+ i4 = i8 + 32 | 0;
+ i8 = i8 + 24 | 0;
+ i5 = 0;
+ while (1) {
+ i10 = HEAP32[i3 >> 2] | 0;
+ i11 = i10 + i5 | 0;
+ i9 = HEAP32[i4 >> 2] | 0;
+ if ((i11 | 0) >= (i9 | 0)) {
+ i2 = i10;
+ break;
+ }
+ _sweeplist(i2, (HEAP32[i8 >> 2] | 0) + (i11 << 2) | 0, -3) | 0;
+ i5 = i5 + 1 | 0;
+ if ((i5 | 0) >= 80) {
+ i7 = 96;
+ break;
+ }
+ }
+ if ((i7 | 0) == 96) {
+ i2 = HEAP32[i3 >> 2] | 0;
+ i9 = HEAP32[i4 >> 2] | 0;
+ }
+ i22 = i2 + i5 | 0;
+ HEAP32[i3 >> 2] = i22;
+ if ((i22 | 0) >= (i9 | 0)) {
+ HEAP8[i6] = 3;
+ }
+ i22 = i5 * 5 | 0;
+ STACKTOP = i1;
+ return i22 | 0;
+ }
+ case 5:
+ {
+ i2 = i8 + 16 | 0;
+ HEAP32[i2 >> 2] = HEAP32[i8 + 32 >> 2] << 2;
+ i22 = i8 + 84 | 0;
+ i3 = i8 + 172 | 0;
+ HEAP32[i22 + 0 >> 2] = 0;
+ HEAP32[i22 + 4 >> 2] = 0;
+ HEAP32[i22 + 8 >> 2] = 0;
+ HEAP32[i22 + 12 >> 2] = 0;
+ HEAP32[i22 + 16 >> 2] = 0;
+ i3 = HEAP32[i3 >> 2] | 0;
+ if ((i3 | 0) != 0 ? !((HEAP8[i3 + 5 | 0] & 3) == 0) : 0) {
+ _reallymarkobject(i8, i3);
+ }
+ if ((HEAP32[i8 + 48 >> 2] & 64 | 0) != 0 ? (i15 = HEAP32[i8 + 40 >> 2] | 0, !((HEAP8[i15 + 5 | 0] & 3) == 0)) : 0) {
+ _reallymarkobject(i8, i15);
+ }
+ _markmt(i8);
+ i4 = HEAP32[i8 + 104 >> 2] | 0;
+ if ((i4 | 0) != 0) {
+ i3 = i8 + 60 | 0;
+ do {
+ i22 = i4 + 5 | 0;
+ HEAP8[i22] = HEAP8[i3] & 3 | HEAP8[i22] & 184;
+ _reallymarkobject(i8, i4);
+ i4 = HEAP32[i4 >> 2] | 0;
+ } while ((i4 | 0) != 0);
+ }
+ HEAP8[i6] = 0;
+ i22 = HEAP32[i2 >> 2] | 0;
+ STACKTOP = i1;
+ return i22 | 0;
+ }
+ case 3:
+ {
+ i3 = i8 + 80 | 0;
+ i4 = HEAP32[i3 >> 2] | 0;
+ if ((i4 | 0) == 0) {
+ HEAP8[i6] = 4;
+ i22 = 0;
+ STACKTOP = i1;
+ return i22 | 0;
+ } else {
+ HEAP32[i3 >> 2] = _sweeplist(i2, i4, 80) | 0;
+ i22 = 400;
+ STACKTOP = i1;
+ return i22 | 0;
+ }
+ }
+ case 4:
+ {
+ i4 = i8 + 76 | 0;
+ i5 = HEAP32[i4 >> 2] | 0;
+ if ((i5 | 0) != 0) {
+ HEAP32[i4 >> 2] = _sweeplist(i2, i5, 80) | 0;
+ i22 = 400;
+ STACKTOP = i1;
+ return i22 | 0;
+ }
+ HEAP32[i14 >> 2] = HEAP32[i8 + 172 >> 2];
+ _sweeplist(i2, i14, 1) | 0;
+ i3 = HEAP32[i3 >> 2] | 0;
+ if ((HEAP8[i3 + 62 | 0] | 0) != 1) {
+ i4 = (HEAP32[i3 + 32 >> 2] | 0) / 2 | 0;
+ if ((HEAP32[i3 + 28 >> 2] | 0) >>> 0 < i4 >>> 0) {
+ _luaS_resize(i2, i4);
+ }
+ i21 = i3 + 144 | 0;
+ i22 = i3 + 152 | 0;
+ HEAP32[i21 >> 2] = _luaM_realloc_(i2, HEAP32[i21 >> 2] | 0, HEAP32[i22 >> 2] | 0, 0) | 0;
+ HEAP32[i22 >> 2] = 0;
+ }
+ HEAP8[i6] = 5;
+ i22 = 5;
+ STACKTOP = i1;
+ return i22 | 0;
+ }
+ default:
+ {
+ i22 = 0;
+ STACKTOP = i1;
+ return i22 | 0;
+ }
+ }
+ return 0;
+}
+function _pmain(i3) {
+ i3 = i3 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i2 = i1;
+ i7 = _lua_tointegerx(i3, 1, 0) | 0;
+ i4 = _lua_touserdata(i3, 2) | 0;
+ i5 = HEAP32[i4 >> 2] | 0;
+ if ((i5 | 0) != 0 ? (HEAP8[i5] | 0) != 0 : 0) {
+ HEAP32[20] = i5;
+ }
+ i12 = HEAP32[i4 + 4 >> 2] | 0;
+ do {
+ if ((i12 | 0) == 0) {
+ i5 = 0;
+ i6 = 0;
+ i8 = 0;
+ i9 = 1;
+ i10 = 1;
+ } else {
+ i9 = 0;
+ i8 = 0;
+ i11 = 0;
+ i6 = 0;
+ i5 = 1;
+ L6 : while (1) {
+ if ((HEAP8[i12] | 0) != 45) {
+ i10 = 18;
+ break;
+ }
+ switch (HEAP8[i12 + 1 | 0] | 0) {
+ case 108:
+ {
+ i10 = 12;
+ break;
+ }
+ case 69:
+ {
+ i9 = 1;
+ break;
+ }
+ case 45:
+ {
+ i10 = 7;
+ break L6;
+ }
+ case 105:
+ {
+ if ((HEAP8[i12 + 2 | 0] | 0) == 0) {
+ i11 = 1;
+ i6 = 1;
+ } else {
+ i5 = -1;
+ break L6;
+ }
+ break;
+ }
+ case 101:
+ {
+ i8 = 1;
+ i10 = 12;
+ break;
+ }
+ case 118:
+ {
+ if ((HEAP8[i12 + 2 | 0] | 0) == 0) {
+ i11 = 1;
+ } else {
+ i5 = -1;
+ break L6;
+ }
+ break;
+ }
+ case 0:
+ {
+ i10 = 18;
+ break L6;
+ }
+ default:
+ {
+ i10 = 16;
+ break L6;
+ }
+ }
+ if ((i10 | 0) == 12) {
+ i10 = 0;
+ if ((HEAP8[i12 + 2 | 0] | 0) == 0) {
+ i12 = i5 + 1 | 0;
+ i13 = HEAP32[i4 + (i12 << 2) >> 2] | 0;
+ if ((i13 | 0) == 0) {
+ i10 = 15;
+ break;
+ }
+ if ((HEAP8[i13] | 0) == 45) {
+ i10 = 15;
+ break;
+ } else {
+ i5 = i12;
+ }
+ }
+ }
+ i5 = i5 + 1 | 0;
+ i12 = HEAP32[i4 + (i5 << 2) >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ i5 = 0;
+ i12 = i9;
+ i10 = 23;
+ break;
+ }
+ }
+ if ((i10 | 0) == 7) {
+ if ((HEAP8[i12 + 2 | 0] | 0) == 0) {
+ i5 = i5 + 1 | 0;
+ i5 = (HEAP32[i4 + (i5 << 2) >> 2] | 0) == 0 ? 0 : i5;
+ i10 = 18;
+ } else {
+ i5 = -1;
+ }
+ } else if ((i10 | 0) == 15) {
+ i5 = 0 - i5 | 0;
+ i10 = 18;
+ } else if ((i10 | 0) == 16) {
+ i5 = 0 - i5 | 0;
+ i10 = 18;
+ }
+ if ((i10 | 0) == 18) {
+ if ((i5 | 0) >= 0) {
+ i12 = i9;
+ i10 = 23;
+ }
+ }
+ if ((i10 | 0) == 23) {
+ if ((i11 | 0) == 0) {
+ i9 = 1;
+ } else {
+ i9 = HEAP32[_stdout >> 2] | 0;
+ _fwrite(440, 1, 51, i9 | 0) | 0;
+ _fputc(10, i9 | 0) | 0;
+ _fflush(i9 | 0) | 0;
+ i9 = 0;
+ }
+ if ((i12 | 0) == 0) {
+ i10 = 1;
+ break;
+ }
+ _lua_pushboolean(i3, 1);
+ _lua_setfield(i3, -1001e3, 96);
+ i10 = 0;
+ break;
+ }
+ i3 = HEAP32[i4 + (0 - i5 << 2) >> 2] | 0;
+ i4 = HEAP32[_stderr >> 2] | 0;
+ HEAP32[i2 >> 2] = HEAP32[20];
+ _fprintf(i4 | 0, 496, i2 | 0) | 0;
+ _fflush(i4 | 0) | 0;
+ i13 = HEAP8[i3 + 1 | 0] | 0;
+ if (i13 << 24 >> 24 == 108 | i13 << 24 >> 24 == 101) {
+ HEAP32[i2 >> 2] = i3;
+ _fprintf(i4 | 0, 504, i2 | 0) | 0;
+ _fflush(i4 | 0) | 0;
+ } else {
+ HEAP32[i2 >> 2] = i3;
+ _fprintf(i4 | 0, 528, i2 | 0) | 0;
+ _fflush(i4 | 0) | 0;
+ }
+ HEAP32[i2 >> 2] = HEAP32[20];
+ _fprintf(i4 | 0, 560, i2 | 0) | 0;
+ _fflush(i4 | 0) | 0;
+ i13 = 0;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ } while (0);
+ _luaL_checkversion_(i3, 502.0);
+ _lua_gc(i3, 0, 0) | 0;
+ _luaL_openlibs(i3);
+ _lua_gc(i3, 1, 0) | 0;
+ do {
+ if (i10) {
+ i10 = _getenv(409 | 0) | 0;
+ if ((i10 | 0) == 0) {
+ i10 = _getenv(425 | 0) | 0;
+ if ((i10 | 0) == 0) {
+ break;
+ } else {
+ i11 = 424;
+ }
+ } else {
+ i11 = 408;
+ }
+ if ((HEAP8[i10] | 0) == 64) {
+ i13 = _luaL_loadfilex(i3, i10 + 1 | 0, 0) | 0;
+ if ((i13 | 0) == 0) {
+ i12 = _lua_gettop(i3) | 0;
+ _lua_pushcclosure(i3, 142, 0);
+ _lua_insert(i3, i12);
+ HEAP32[48] = i3;
+ _signal(2, 1) | 0;
+ i13 = _lua_pcallk(i3, 0, 0, i12, 0, 0) | 0;
+ _signal(2, 0) | 0;
+ _lua_remove(i3, i12);
+ if ((i13 | 0) == 0) {
+ break;
+ }
+ }
+ if ((_lua_type(i3, -1) | 0) == 0) {
+ i13 = 0;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ i11 = _lua_tolstring(i3, -1, 0) | 0;
+ i12 = HEAP32[20] | 0;
+ i10 = HEAP32[_stderr >> 2] | 0;
+ if ((i12 | 0) != 0) {
+ HEAP32[i2 >> 2] = i12;
+ _fprintf(i10 | 0, 496, i2 | 0) | 0;
+ _fflush(i10 | 0) | 0;
+ }
+ HEAP32[i2 >> 2] = (i11 | 0) == 0 ? 48 : i11;
+ _fprintf(i10 | 0, 912, i2 | 0) | 0;
+ _fflush(i10 | 0) | 0;
+ _lua_settop(i3, -2);
+ _lua_gc(i3, 2, 0) | 0;
+ } else {
+ i13 = _luaL_loadbufferx(i3, i10, _strlen(i10 | 0) | 0, i11, 0) | 0;
+ if ((i13 | 0) == 0) {
+ i12 = _lua_gettop(i3) | 0;
+ _lua_pushcclosure(i3, 142, 0);
+ _lua_insert(i3, i12);
+ HEAP32[48] = i3;
+ _signal(2, 1) | 0;
+ i13 = _lua_pcallk(i3, 0, 0, i12, 0, 0) | 0;
+ _signal(2, 0) | 0;
+ _lua_remove(i3, i12);
+ if ((i13 | 0) == 0) {
+ break;
+ }
+ }
+ if ((_lua_type(i3, -1) | 0) == 0) {
+ i13 = 0;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ i11 = _lua_tolstring(i3, -1, 0) | 0;
+ i10 = HEAP32[20] | 0;
+ i12 = HEAP32[_stderr >> 2] | 0;
+ if ((i10 | 0) != 0) {
+ HEAP32[i2 >> 2] = i10;
+ _fprintf(i12 | 0, 496, i2 | 0) | 0;
+ _fflush(i12 | 0) | 0;
+ }
+ HEAP32[i2 >> 2] = (i11 | 0) == 0 ? 48 : i11;
+ _fprintf(i12 | 0, 912, i2 | 0) | 0;
+ _fflush(i12 | 0) | 0;
+ _lua_settop(i3, -2);
+ _lua_gc(i3, 2, 0) | 0;
+ }
+ if ((i13 | 0) != 0) {
+ i13 = 0;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ }
+ } while (0);
+ i7 = (i5 | 0) > 0 ? i5 : i7;
+ L67 : do {
+ if ((i7 | 0) > 1) {
+ i10 = 1;
+ while (1) {
+ i11 = HEAP32[i4 + (i10 << 2) >> 2] | 0;
+ i12 = HEAP8[i11 + 1 | 0] | 0;
+ if ((i12 | 0) == 108) {
+ i11 = i11 + 2 | 0;
+ if ((HEAP8[i11] | 0) == 0) {
+ i10 = i10 + 1 | 0;
+ i11 = HEAP32[i4 + (i10 << 2) >> 2] | 0;
+ }
+ _lua_getglobal(i3, 400);
+ _lua_pushstring(i3, i11) | 0;
+ i12 = (_lua_gettop(i3) | 0) + -1 | 0;
+ _lua_pushcclosure(i3, 142, 0);
+ _lua_insert(i3, i12);
+ HEAP32[48] = i3;
+ _signal(2, 1) | 0;
+ i13 = _lua_pcallk(i3, 1, 1, i12, 0, 0) | 0;
+ _signal(2, 0) | 0;
+ _lua_remove(i3, i12);
+ if ((i13 | 0) != 0) {
+ i10 = 58;
+ break;
+ }
+ _lua_setglobal(i3, i11);
+ } else if ((i12 | 0) == 101) {
+ i11 = i11 + 2 | 0;
+ if ((HEAP8[i11] | 0) == 0) {
+ i10 = i10 + 1 | 0;
+ i11 = HEAP32[i4 + (i10 << 2) >> 2] | 0;
+ }
+ if ((_luaL_loadbufferx(i3, i11, _strlen(i11 | 0) | 0, 384, 0) | 0) != 0) {
+ i10 = 50;
+ break;
+ }
+ i12 = _lua_gettop(i3) | 0;
+ _lua_pushcclosure(i3, 142, 0);
+ _lua_insert(i3, i12);
+ HEAP32[48] = i3;
+ _signal(2, 1) | 0;
+ i13 = _lua_pcallk(i3, 0, 0, i12, 0, 0) | 0;
+ _signal(2, 0) | 0;
+ _lua_remove(i3, i12);
+ if ((i13 | 0) != 0) {
+ i10 = 50;
+ break;
+ }
+ }
+ i10 = i10 + 1 | 0;
+ if ((i10 | 0) >= (i7 | 0)) {
+ break L67;
+ }
+ }
+ if ((i10 | 0) == 50) {
+ if ((_lua_type(i3, -1) | 0) == 0) {
+ i13 = 0;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ i5 = _lua_tolstring(i3, -1, 0) | 0;
+ i6 = HEAP32[20] | 0;
+ i4 = HEAP32[_stderr >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ HEAP32[i2 >> 2] = i6;
+ _fprintf(i4 | 0, 496, i2 | 0) | 0;
+ _fflush(i4 | 0) | 0;
+ }
+ HEAP32[i2 >> 2] = (i5 | 0) == 0 ? 48 : i5;
+ _fprintf(i4 | 0, 912, i2 | 0) | 0;
+ _fflush(i4 | 0) | 0;
+ _lua_settop(i3, -2);
+ _lua_gc(i3, 2, 0) | 0;
+ i13 = 0;
+ STACKTOP = i1;
+ return i13 | 0;
+ } else if ((i10 | 0) == 58) {
+ if ((_lua_type(i3, -1) | 0) == 0) {
+ i13 = 0;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ i5 = _lua_tolstring(i3, -1, 0) | 0;
+ i6 = HEAP32[20] | 0;
+ i4 = HEAP32[_stderr >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ HEAP32[i2 >> 2] = i6;
+ _fprintf(i4 | 0, 496, i2 | 0) | 0;
+ _fflush(i4 | 0) | 0;
+ }
+ HEAP32[i2 >> 2] = (i5 | 0) == 0 ? 48 : i5;
+ _fprintf(i4 | 0, 912, i2 | 0) | 0;
+ _fflush(i4 | 0) | 0;
+ _lua_settop(i3, -2);
+ _lua_gc(i3, 2, 0) | 0;
+ i13 = 0;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ }
+ } while (0);
+ do {
+ if ((i5 | 0) != 0) {
+ i10 = 0;
+ while (1) {
+ if ((HEAP32[i4 + (i10 << 2) >> 2] | 0) == 0) {
+ break;
+ } else {
+ i10 = i10 + 1 | 0;
+ }
+ }
+ i11 = i5 + 1 | 0;
+ i7 = i10 - i11 | 0;
+ _luaL_checkstack(i3, i7 + 3 | 0, 352);
+ if ((i11 | 0) < (i10 | 0)) {
+ i12 = i11;
+ do {
+ _lua_pushstring(i3, HEAP32[i4 + (i12 << 2) >> 2] | 0) | 0;
+ i12 = i12 + 1 | 0;
+ } while ((i12 | 0) != (i10 | 0));
+ }
+ _lua_createtable(i3, i7, i11);
+ if ((i10 | 0) > 0) {
+ i11 = 0;
+ do {
+ _lua_pushstring(i3, HEAP32[i4 + (i11 << 2) >> 2] | 0) | 0;
+ _lua_rawseti(i3, -2, i11 - i5 | 0);
+ i11 = i11 + 1 | 0;
+ } while ((i11 | 0) != (i10 | 0));
+ }
+ _lua_setglobal(i3, 328);
+ i10 = HEAP32[i4 + (i5 << 2) >> 2] | 0;
+ if ((_strcmp(i10, 336) | 0) == 0) {
+ i13 = (_strcmp(HEAP32[i4 + (i5 + -1 << 2) >> 2] | 0, 344) | 0) == 0;
+ i10 = i13 ? i10 : 0;
+ }
+ i10 = _luaL_loadfilex(i3, i10, 0) | 0;
+ i4 = ~i7;
+ _lua_insert(i3, i4);
+ if ((i10 | 0) == 0) {
+ i13 = (_lua_gettop(i3) | 0) - i7 | 0;
+ _lua_pushcclosure(i3, 142, 0);
+ _lua_insert(i3, i13);
+ HEAP32[48] = i3;
+ _signal(2, 1) | 0;
+ i10 = _lua_pcallk(i3, i7, -1, i13, 0, 0) | 0;
+ _signal(2, 0) | 0;
+ _lua_remove(i3, i13);
+ if ((i10 | 0) == 0) {
+ break;
+ }
+ } else {
+ _lua_settop(i3, i4);
+ }
+ if ((_lua_type(i3, -1) | 0) != 0) {
+ i7 = _lua_tolstring(i3, -1, 0) | 0;
+ i11 = HEAP32[20] | 0;
+ i4 = HEAP32[_stderr >> 2] | 0;
+ if ((i11 | 0) != 0) {
+ HEAP32[i2 >> 2] = i11;
+ _fprintf(i4 | 0, 496, i2 | 0) | 0;
+ _fflush(i4 | 0) | 0;
+ }
+ HEAP32[i2 >> 2] = (i7 | 0) == 0 ? 48 : i7;
+ _fprintf(i4 | 0, 912, i2 | 0) | 0;
+ _fflush(i4 | 0) | 0;
+ _lua_settop(i3, -2);
+ _lua_gc(i3, 2, 0) | 0;
+ }
+ if ((i10 | 0) != 0) {
+ i13 = 0;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ }
+ } while (0);
+ if ((i6 | 0) == 0) {
+ if (!((i8 | i5 | 0) != 0 | i9 ^ 1)) {
+ i13 = HEAP32[_stdout >> 2] | 0;
+ _fwrite(440, 1, 51, i13 | 0) | 0;
+ _fputc(10, i13 | 0) | 0;
+ _fflush(i13 | 0) | 0;
+ _dotty(i3);
+ }
+ } else {
+ _dotty(i3);
+ }
+ _lua_pushboolean(i3, 1);
+ i13 = 1;
+ STACKTOP = i1;
+ return i13 | 0;
+}
+function _DumpFunction(i6, i2) {
+ i6 = i6 | 0;
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0, i30 = 0;
+ i5 = STACKTOP;
+ STACKTOP = STACKTOP + 64 | 0;
+ i17 = i5 + 56 | 0;
+ i19 = i5 + 52 | 0;
+ i20 = i5 + 48 | 0;
+ i18 = i5;
+ i21 = i5 + 60 | 0;
+ i22 = i5 + 44 | 0;
+ i1 = i5 + 40 | 0;
+ i16 = i5 + 36 | 0;
+ i23 = i5 + 32 | 0;
+ i3 = i5 + 28 | 0;
+ i7 = i5 + 24 | 0;
+ i8 = i5 + 20 | 0;
+ i9 = i5 + 16 | 0;
+ i10 = i5 + 12 | 0;
+ i12 = i5 + 8 | 0;
+ HEAP32[i17 >> 2] = HEAP32[i6 + 64 >> 2];
+ i4 = i2 + 16 | 0;
+ i28 = HEAP32[i4 >> 2] | 0;
+ if ((i28 | 0) == 0) {
+ i28 = FUNCTION_TABLE_iiiii[HEAP32[i2 + 4 >> 2] & 3](HEAP32[i2 >> 2] | 0, i17, 4, HEAP32[i2 + 8 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i28;
+ }
+ HEAP32[i17 >> 2] = HEAP32[i6 + 68 >> 2];
+ if ((i28 | 0) == 0) {
+ i28 = FUNCTION_TABLE_iiiii[HEAP32[i2 + 4 >> 2] & 3](HEAP32[i2 >> 2] | 0, i17, 4, HEAP32[i2 + 8 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i28;
+ }
+ HEAP8[i17] = HEAP8[i6 + 76 | 0] | 0;
+ if ((i28 | 0) == 0) {
+ i28 = FUNCTION_TABLE_iiiii[HEAP32[i2 + 4 >> 2] & 3](HEAP32[i2 >> 2] | 0, i17, 1, HEAP32[i2 + 8 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i28;
+ }
+ HEAP8[i17] = HEAP8[i6 + 77 | 0] | 0;
+ if ((i28 | 0) == 0) {
+ i28 = FUNCTION_TABLE_iiiii[HEAP32[i2 + 4 >> 2] & 3](HEAP32[i2 >> 2] | 0, i17, 1, HEAP32[i2 + 8 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i28;
+ }
+ HEAP8[i17] = HEAP8[i6 + 78 | 0] | 0;
+ if ((i28 | 0) == 0) {
+ i28 = FUNCTION_TABLE_iiiii[HEAP32[i2 + 4 >> 2] & 3](HEAP32[i2 >> 2] | 0, i17, 1, HEAP32[i2 + 8 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i28;
+ }
+ i25 = HEAP32[i6 + 12 >> 2] | 0;
+ i24 = HEAP32[i6 + 48 >> 2] | 0;
+ HEAP32[i23 >> 2] = i24;
+ if ((i28 | 0) == 0) {
+ i26 = i2 + 4 | 0;
+ i27 = i2 + 8 | 0;
+ i28 = FUNCTION_TABLE_iiiii[HEAP32[i26 >> 2] & 3](HEAP32[i2 >> 2] | 0, i23, 4, HEAP32[i27 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i28;
+ if ((i28 | 0) == 0) {
+ i28 = FUNCTION_TABLE_iiiii[HEAP32[i26 >> 2] & 3](HEAP32[i2 >> 2] | 0, i25, i24 << 2, HEAP32[i27 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i28;
+ i25 = HEAP32[i6 + 44 >> 2] | 0;
+ HEAP32[i22 >> 2] = i25;
+ if ((i28 | 0) == 0) {
+ i28 = FUNCTION_TABLE_iiiii[HEAP32[i2 + 4 >> 2] & 3](HEAP32[i2 >> 2] | 0, i22, 4, HEAP32[i2 + 8 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i28;
+ }
+ } else {
+ i11 = 13;
+ }
+ } else {
+ i11 = 13;
+ }
+ if ((i11 | 0) == 13) {
+ i25 = HEAP32[i6 + 44 >> 2] | 0;
+ HEAP32[i22 >> 2] = i25;
+ }
+ if ((i25 | 0) > 0) {
+ i24 = i6 + 8 | 0;
+ i23 = i2 + 4 | 0;
+ i22 = i2 + 8 | 0;
+ i26 = 0;
+ do {
+ i30 = HEAP32[i24 >> 2] | 0;
+ i27 = i30 + (i26 << 4) | 0;
+ i30 = i30 + (i26 << 4) + 8 | 0;
+ i29 = HEAP32[i30 >> 2] | 0;
+ HEAP8[i17] = i29 & 15;
+ if ((i28 | 0) == 0) {
+ i28 = FUNCTION_TABLE_iiiii[HEAP32[i23 >> 2] & 3](HEAP32[i2 >> 2] | 0, i17, 1, HEAP32[i22 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i28;
+ i29 = HEAP32[i30 >> 2] | 0;
+ }
+ i29 = i29 & 15;
+ do {
+ if ((i29 | 0) == 3) {
+ HEAPF64[i18 >> 3] = +HEAPF64[i27 >> 3];
+ if ((i28 | 0) == 0) {
+ i28 = FUNCTION_TABLE_iiiii[HEAP32[i23 >> 2] & 3](HEAP32[i2 >> 2] | 0, i18, 8, HEAP32[i22 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i28;
+ }
+ } else if ((i29 | 0) == 1) {
+ HEAP8[i21] = HEAP32[i27 >> 2];
+ if ((i28 | 0) == 0) {
+ i28 = FUNCTION_TABLE_iiiii[HEAP32[i23 >> 2] & 3](HEAP32[i2 >> 2] | 0, i21, 1, HEAP32[i22 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i28;
+ }
+ } else if ((i29 | 0) == 4) {
+ i27 = HEAP32[i27 >> 2] | 0;
+ if ((i27 | 0) == 0) {
+ HEAP32[i19 >> 2] = 0;
+ if ((i28 | 0) != 0) {
+ break;
+ }
+ i28 = FUNCTION_TABLE_iiiii[HEAP32[i23 >> 2] & 3](HEAP32[i2 >> 2] | 0, i19, 4, HEAP32[i22 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i28;
+ break;
+ }
+ HEAP32[i20 >> 2] = (HEAP32[i27 + 12 >> 2] | 0) + 1;
+ if ((i28 | 0) == 0) {
+ i28 = FUNCTION_TABLE_iiiii[HEAP32[i23 >> 2] & 3](HEAP32[i2 >> 2] | 0, i20, 4, HEAP32[i22 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i28;
+ if ((i28 | 0) == 0) {
+ i28 = FUNCTION_TABLE_iiiii[HEAP32[i23 >> 2] & 3](HEAP32[i2 >> 2] | 0, i27 + 16 | 0, HEAP32[i20 >> 2] | 0, HEAP32[i22 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i28;
+ }
+ }
+ }
+ } while (0);
+ i26 = i26 + 1 | 0;
+ } while ((i26 | 0) != (i25 | 0));
+ }
+ i18 = HEAP32[i6 + 56 >> 2] | 0;
+ HEAP32[i17 >> 2] = i18;
+ if ((i28 | 0) == 0) {
+ i28 = FUNCTION_TABLE_iiiii[HEAP32[i2 + 4 >> 2] & 3](HEAP32[i2 >> 2] | 0, i17, 4, HEAP32[i2 + 8 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i28;
+ }
+ if ((i18 | 0) > 0) {
+ i17 = i6 + 16 | 0;
+ i19 = 0;
+ do {
+ _DumpFunction(HEAP32[(HEAP32[i17 >> 2] | 0) + (i19 << 2) >> 2] | 0, i2);
+ i19 = i19 + 1 | 0;
+ } while ((i19 | 0) != (i18 | 0));
+ i28 = HEAP32[i4 >> 2] | 0;
+ }
+ i17 = i6 + 40 | 0;
+ i18 = HEAP32[i17 >> 2] | 0;
+ HEAP32[i16 >> 2] = i18;
+ if ((i28 | 0) == 0) {
+ i28 = FUNCTION_TABLE_iiiii[HEAP32[i2 + 4 >> 2] & 3](HEAP32[i2 >> 2] | 0, i16, 4, HEAP32[i2 + 8 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i28;
+ }
+ if ((i18 | 0) > 0) {
+ i19 = i6 + 28 | 0;
+ i16 = i2 + 4 | 0;
+ i20 = i2 + 8 | 0;
+ i21 = 0;
+ do {
+ i22 = HEAP32[i19 >> 2] | 0;
+ HEAP8[i1] = HEAP8[i22 + (i21 << 3) + 4 | 0] | 0;
+ if ((i28 | 0) == 0) {
+ i28 = FUNCTION_TABLE_iiiii[HEAP32[i16 >> 2] & 3](HEAP32[i2 >> 2] | 0, i1, 1, HEAP32[i20 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i28;
+ i22 = HEAP32[i19 >> 2] | 0;
+ }
+ HEAP8[i1] = HEAP8[i22 + (i21 << 3) + 5 | 0] | 0;
+ if ((i28 | 0) == 0) {
+ i28 = FUNCTION_TABLE_iiiii[HEAP32[i16 >> 2] & 3](HEAP32[i2 >> 2] | 0, i1, 1, HEAP32[i20 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i28;
+ }
+ i21 = i21 + 1 | 0;
+ } while ((i21 | 0) != (i18 | 0));
+ }
+ i16 = i2 + 12 | 0;
+ if ((HEAP32[i16 >> 2] | 0) == 0 ? (i13 = HEAP32[i6 + 36 >> 2] | 0, (i13 | 0) != 0) : 0) {
+ HEAP32[i12 >> 2] = (HEAP32[i13 + 12 >> 2] | 0) + 1;
+ if ((i28 | 0) == 0 ? (i14 = i2 + 4 | 0, i15 = i2 + 8 | 0, i30 = FUNCTION_TABLE_iiiii[HEAP32[i14 >> 2] & 3](HEAP32[i2 >> 2] | 0, i12, 4, HEAP32[i15 >> 2] | 0) | 0, HEAP32[i4 >> 2] = i30, (i30 | 0) == 0) : 0) {
+ HEAP32[i4 >> 2] = FUNCTION_TABLE_iiiii[HEAP32[i14 >> 2] & 3](HEAP32[i2 >> 2] | 0, i13 + 16 | 0, HEAP32[i12 >> 2] | 0, HEAP32[i15 >> 2] | 0) | 0;
+ }
+ } else {
+ i12 = i10;
+ i11 = 50;
+ }
+ if ((i11 | 0) == 50) {
+ HEAP32[i10 >> 2] = 0;
+ if ((i28 | 0) == 0) {
+ HEAP32[i4 >> 2] = FUNCTION_TABLE_iiiii[HEAP32[i2 + 4 >> 2] & 3](HEAP32[i2 >> 2] | 0, i12, 4, HEAP32[i2 + 8 >> 2] | 0) | 0;
+ }
+ }
+ if ((HEAP32[i16 >> 2] | 0) == 0) {
+ i11 = HEAP32[i6 + 52 >> 2] | 0;
+ } else {
+ i11 = 0;
+ }
+ i10 = HEAP32[i6 + 20 >> 2] | 0;
+ HEAP32[i9 >> 2] = i11;
+ i14 = HEAP32[i4 >> 2] | 0;
+ if ((i14 | 0) == 0) {
+ i12 = i2 + 4 | 0;
+ i13 = i2 + 8 | 0;
+ i14 = FUNCTION_TABLE_iiiii[HEAP32[i12 >> 2] & 3](HEAP32[i2 >> 2] | 0, i9, 4, HEAP32[i13 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i14;
+ if ((i14 | 0) == 0) {
+ i14 = FUNCTION_TABLE_iiiii[HEAP32[i12 >> 2] & 3](HEAP32[i2 >> 2] | 0, i10, i11 << 2, HEAP32[i13 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i14;
+ }
+ }
+ if ((HEAP32[i16 >> 2] | 0) == 0) {
+ i9 = HEAP32[i6 + 60 >> 2] | 0;
+ } else {
+ i9 = 0;
+ }
+ HEAP32[i8 >> 2] = i9;
+ if ((i14 | 0) == 0) {
+ i14 = FUNCTION_TABLE_iiiii[HEAP32[i2 + 4 >> 2] & 3](HEAP32[i2 >> 2] | 0, i8, 4, HEAP32[i2 + 8 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i14;
+ }
+ if ((i9 | 0) > 0) {
+ i10 = i6 + 24 | 0;
+ i11 = i2 + 4 | 0;
+ i8 = i2 + 8 | 0;
+ i12 = 0;
+ do {
+ i13 = HEAP32[(HEAP32[i10 >> 2] | 0) + (i12 * 12 | 0) >> 2] | 0;
+ if ((i13 | 0) == 0) {
+ HEAP32[i1 >> 2] = 0;
+ if ((i14 | 0) == 0) {
+ i14 = FUNCTION_TABLE_iiiii[HEAP32[i11 >> 2] & 3](HEAP32[i2 >> 2] | 0, i1, 4, HEAP32[i8 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i14;
+ }
+ } else {
+ HEAP32[i3 >> 2] = (HEAP32[i13 + 12 >> 2] | 0) + 1;
+ if ((i14 | 0) == 0) {
+ i14 = FUNCTION_TABLE_iiiii[HEAP32[i11 >> 2] & 3](HEAP32[i2 >> 2] | 0, i3, 4, HEAP32[i8 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i14;
+ if ((i14 | 0) == 0) {
+ i14 = FUNCTION_TABLE_iiiii[HEAP32[i11 >> 2] & 3](HEAP32[i2 >> 2] | 0, i13 + 16 | 0, HEAP32[i3 >> 2] | 0, HEAP32[i8 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i14;
+ }
+ }
+ }
+ i13 = HEAP32[i10 >> 2] | 0;
+ HEAP32[i1 >> 2] = HEAP32[i13 + (i12 * 12 | 0) + 4 >> 2];
+ if ((i14 | 0) == 0) {
+ i14 = FUNCTION_TABLE_iiiii[HEAP32[i11 >> 2] & 3](HEAP32[i2 >> 2] | 0, i1, 4, HEAP32[i8 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i14;
+ i13 = HEAP32[i10 >> 2] | 0;
+ }
+ HEAP32[i1 >> 2] = HEAP32[i13 + (i12 * 12 | 0) + 8 >> 2];
+ if ((i14 | 0) == 0) {
+ i14 = FUNCTION_TABLE_iiiii[HEAP32[i11 >> 2] & 3](HEAP32[i2 >> 2] | 0, i1, 4, HEAP32[i8 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i14;
+ }
+ i12 = i12 + 1 | 0;
+ } while ((i12 | 0) != (i9 | 0));
+ }
+ if ((HEAP32[i16 >> 2] | 0) == 0) {
+ i8 = HEAP32[i17 >> 2] | 0;
+ } else {
+ i8 = 0;
+ }
+ HEAP32[i7 >> 2] = i8;
+ if ((i14 | 0) == 0) {
+ i14 = FUNCTION_TABLE_iiiii[HEAP32[i2 + 4 >> 2] & 3](HEAP32[i2 >> 2] | 0, i7, 4, HEAP32[i2 + 8 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i14;
+ }
+ if ((i8 | 0) <= 0) {
+ STACKTOP = i5;
+ return;
+ }
+ i7 = i6 + 28 | 0;
+ i6 = i2 + 4 | 0;
+ i9 = i2 + 8 | 0;
+ i10 = 0;
+ do {
+ i11 = HEAP32[(HEAP32[i7 >> 2] | 0) + (i10 << 3) >> 2] | 0;
+ if ((i11 | 0) == 0) {
+ HEAP32[i1 >> 2] = 0;
+ if ((i14 | 0) == 0) {
+ i14 = FUNCTION_TABLE_iiiii[HEAP32[i6 >> 2] & 3](HEAP32[i2 >> 2] | 0, i1, 4, HEAP32[i9 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i14;
+ }
+ } else {
+ HEAP32[i3 >> 2] = (HEAP32[i11 + 12 >> 2] | 0) + 1;
+ if ((i14 | 0) == 0) {
+ i14 = FUNCTION_TABLE_iiiii[HEAP32[i6 >> 2] & 3](HEAP32[i2 >> 2] | 0, i3, 4, HEAP32[i9 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i14;
+ if ((i14 | 0) == 0) {
+ i14 = FUNCTION_TABLE_iiiii[HEAP32[i6 >> 2] & 3](HEAP32[i2 >> 2] | 0, i11 + 16 | 0, HEAP32[i3 >> 2] | 0, HEAP32[i9 >> 2] | 0) | 0;
+ HEAP32[i4 >> 2] = i14;
+ }
+ }
+ }
+ i10 = i10 + 1 | 0;
+ } while ((i10 | 0) != (i8 | 0));
+ STACKTOP = i5;
+ return;
+}
+function _LoadFunction(i2, i6) {
+ i2 = i2 | 0;
+ i6 = i6 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i1;
+ i5 = i1 + 8 | 0;
+ i4 = i2 + 4 | 0;
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i3, 4) | 0) != 0) {
+ _error(i2, 8824);
+ }
+ i8 = HEAP32[i3 >> 2] | 0;
+ if ((i8 | 0) < 0) {
+ _error(i2, 8872);
+ }
+ HEAP32[i6 + 64 >> 2] = i8;
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i3, 4) | 0) != 0) {
+ _error(i2, 8824);
+ }
+ i8 = HEAP32[i3 >> 2] | 0;
+ if ((i8 | 0) < 0) {
+ _error(i2, 8872);
+ }
+ HEAP32[i6 + 68 >> 2] = i8;
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i3, 1) | 0) != 0) {
+ _error(i2, 8824);
+ }
+ HEAP8[i6 + 76 | 0] = HEAP8[i3] | 0;
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i3, 1) | 0) != 0) {
+ _error(i2, 8824);
+ }
+ HEAP8[i6 + 77 | 0] = HEAP8[i3] | 0;
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i3, 1) | 0) != 0) {
+ _error(i2, 8824);
+ }
+ HEAP8[i6 + 78 | 0] = HEAP8[i3] | 0;
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i3, 4) | 0) != 0) {
+ _error(i2, 8824);
+ }
+ i9 = HEAP32[i3 >> 2] | 0;
+ if ((i9 | 0) < 0) {
+ _error(i2, 8872);
+ }
+ i8 = HEAP32[i2 >> 2] | 0;
+ if ((i9 + 1 | 0) >>> 0 > 1073741823) {
+ _luaM_toobig(i8);
+ }
+ i14 = i9 << 2;
+ i13 = _luaM_realloc_(i8, 0, 0, i14) | 0;
+ HEAP32[i6 + 12 >> 2] = i13;
+ HEAP32[i6 + 48 >> 2] = i9;
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i13, i14) | 0) != 0) {
+ _error(i2, 8824);
+ }
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i3, 4) | 0) != 0) {
+ _error(i2, 8824);
+ }
+ i8 = HEAP32[i3 >> 2] | 0;
+ if ((i8 | 0) < 0) {
+ _error(i2, 8872);
+ }
+ i9 = HEAP32[i2 >> 2] | 0;
+ if ((i8 + 1 | 0) >>> 0 > 268435455) {
+ _luaM_toobig(i9);
+ }
+ i11 = _luaM_realloc_(i9, 0, 0, i8 << 4) | 0;
+ i9 = i6 + 8 | 0;
+ HEAP32[i9 >> 2] = i11;
+ HEAP32[i6 + 44 >> 2] = i8;
+ i12 = (i8 | 0) > 0;
+ L43 : do {
+ if (i12) {
+ i10 = 0;
+ do {
+ HEAP32[i11 + (i10 << 4) + 8 >> 2] = 0;
+ i10 = i10 + 1 | 0;
+ } while ((i10 | 0) != (i8 | 0));
+ if (i12) {
+ i10 = i2 + 8 | 0;
+ i13 = 0;
+ while (1) {
+ i12 = i11 + (i13 << 4) | 0;
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i3, 1) | 0) != 0) {
+ i9 = 34;
+ break;
+ }
+ i14 = HEAP8[i3] | 0;
+ if ((i14 | 0) == 4) {
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i3, 4) | 0) != 0) {
+ i9 = 44;
+ break;
+ }
+ i14 = HEAP32[i3 >> 2] | 0;
+ if ((i14 | 0) == 0) {
+ i14 = 0;
+ } else {
+ i14 = _luaZ_openspace(HEAP32[i2 >> 2] | 0, HEAP32[i10 >> 2] | 0, i14) | 0;
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i14, HEAP32[i3 >> 2] | 0) | 0) != 0) {
+ i9 = 47;
+ break;
+ }
+ i14 = _luaS_newlstr(HEAP32[i2 >> 2] | 0, i14, (HEAP32[i3 >> 2] | 0) + -1 | 0) | 0;
+ }
+ HEAP32[i12 >> 2] = i14;
+ HEAP32[i11 + (i13 << 4) + 8 >> 2] = HEAPU8[i14 + 4 | 0] | 64;
+ } else if ((i14 | 0) == 1) {
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i3, 1) | 0) != 0) {
+ i9 = 38;
+ break;
+ }
+ HEAP32[i12 >> 2] = HEAP8[i3] | 0;
+ HEAP32[i11 + (i13 << 4) + 8 >> 2] = 1;
+ } else if ((i14 | 0) == 3) {
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i3, 8) | 0) != 0) {
+ i9 = 41;
+ break;
+ }
+ HEAPF64[i12 >> 3] = +HEAPF64[i3 >> 3];
+ HEAP32[i11 + (i13 << 4) + 8 >> 2] = 3;
+ } else if ((i14 | 0) == 0) {
+ HEAP32[i11 + (i13 << 4) + 8 >> 2] = 0;
+ }
+ i13 = i13 + 1 | 0;
+ if ((i13 | 0) >= (i8 | 0)) {
+ break L43;
+ }
+ i11 = HEAP32[i9 >> 2] | 0;
+ }
+ if ((i9 | 0) == 34) {
+ _error(i2, 8824);
+ } else if ((i9 | 0) == 38) {
+ _error(i2, 8824);
+ } else if ((i9 | 0) == 41) {
+ _error(i2, 8824);
+ } else if ((i9 | 0) == 44) {
+ _error(i2, 8824);
+ } else if ((i9 | 0) == 47) {
+ _error(i2, 8824);
+ }
+ }
+ }
+ } while (0);
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i3, 4) | 0) != 0) {
+ _error(i2, 8824);
+ }
+ i8 = HEAP32[i3 >> 2] | 0;
+ if ((i8 | 0) < 0) {
+ _error(i2, 8872);
+ }
+ i9 = HEAP32[i2 >> 2] | 0;
+ if ((i8 + 1 | 0) >>> 0 > 1073741823) {
+ _luaM_toobig(i9);
+ }
+ i11 = _luaM_realloc_(i9, 0, 0, i8 << 2) | 0;
+ i9 = i6 + 16 | 0;
+ HEAP32[i9 >> 2] = i11;
+ HEAP32[i6 + 56 >> 2] = i8;
+ i10 = (i8 | 0) > 0;
+ if (i10) {
+ i12 = 0;
+ while (1) {
+ HEAP32[i11 + (i12 << 2) >> 2] = 0;
+ i12 = i12 + 1 | 0;
+ if ((i12 | 0) == (i8 | 0)) {
+ break;
+ }
+ i11 = HEAP32[i9 >> 2] | 0;
+ }
+ if (i10) {
+ i10 = 0;
+ do {
+ i14 = _luaF_newproto(HEAP32[i2 >> 2] | 0) | 0;
+ HEAP32[(HEAP32[i9 >> 2] | 0) + (i10 << 2) >> 2] = i14;
+ _LoadFunction(i2, HEAP32[(HEAP32[i9 >> 2] | 0) + (i10 << 2) >> 2] | 0);
+ i10 = i10 + 1 | 0;
+ } while ((i10 | 0) != (i8 | 0));
+ }
+ }
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i3, 4) | 0) != 0) {
+ _error(i2, 8824);
+ }
+ i9 = HEAP32[i3 >> 2] | 0;
+ if ((i9 | 0) < 0) {
+ _error(i2, 8872);
+ }
+ i8 = HEAP32[i2 >> 2] | 0;
+ if ((i9 + 1 | 0) >>> 0 > 536870911) {
+ _luaM_toobig(i8);
+ }
+ i10 = _luaM_realloc_(i8, 0, 0, i9 << 3) | 0;
+ i8 = i6 + 28 | 0;
+ HEAP32[i8 >> 2] = i10;
+ HEAP32[i6 + 40 >> 2] = i9;
+ L98 : do {
+ if ((i9 | 0) > 0) {
+ HEAP32[i10 >> 2] = 0;
+ if ((i9 | 0) == 1) {
+ i10 = 0;
+ } else {
+ i10 = 1;
+ while (1) {
+ HEAP32[(HEAP32[i8 >> 2] | 0) + (i10 << 3) >> 2] = 0;
+ i10 = i10 + 1 | 0;
+ if ((i10 | 0) == (i9 | 0)) {
+ i10 = 0;
+ break;
+ }
+ }
+ }
+ while (1) {
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i3, 1) | 0) != 0) {
+ i9 = 73;
+ break;
+ }
+ HEAP8[(HEAP32[i8 >> 2] | 0) + (i10 << 3) + 4 | 0] = HEAP8[i3] | 0;
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i3, 1) | 0) != 0) {
+ i9 = 75;
+ break;
+ }
+ HEAP8[(HEAP32[i8 >> 2] | 0) + (i10 << 3) + 5 | 0] = HEAP8[i3] | 0;
+ i10 = i10 + 1 | 0;
+ if ((i10 | 0) >= (i9 | 0)) {
+ break L98;
+ }
+ }
+ if ((i9 | 0) == 73) {
+ _error(i2, 8824);
+ } else if ((i9 | 0) == 75) {
+ _error(i2, 8824);
+ }
+ }
+ } while (0);
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i3, 4) | 0) != 0) {
+ _error(i2, 8824);
+ }
+ i9 = HEAP32[i3 >> 2] | 0;
+ do {
+ if ((i9 | 0) != 0) {
+ i9 = _luaZ_openspace(HEAP32[i2 >> 2] | 0, HEAP32[i2 + 8 >> 2] | 0, i9) | 0;
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i9, HEAP32[i3 >> 2] | 0) | 0) == 0) {
+ i7 = _luaS_newlstr(HEAP32[i2 >> 2] | 0, i9, (HEAP32[i3 >> 2] | 0) + -1 | 0) | 0;
+ break;
+ } else {
+ _error(i2, 8824);
+ }
+ } else {
+ i7 = 0;
+ }
+ } while (0);
+ HEAP32[i6 + 36 >> 2] = i7;
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i3, 4) | 0) != 0) {
+ _error(i2, 8824);
+ }
+ i7 = HEAP32[i3 >> 2] | 0;
+ if ((i7 | 0) < 0) {
+ _error(i2, 8872);
+ }
+ i9 = HEAP32[i2 >> 2] | 0;
+ if ((i7 + 1 | 0) >>> 0 > 1073741823) {
+ _luaM_toobig(i9);
+ }
+ i14 = i7 << 2;
+ i13 = _luaM_realloc_(i9, 0, 0, i14) | 0;
+ HEAP32[i6 + 20 >> 2] = i13;
+ HEAP32[i6 + 52 >> 2] = i7;
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i13, i14) | 0) != 0) {
+ _error(i2, 8824);
+ }
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i3, 4) | 0) != 0) {
+ _error(i2, 8824);
+ }
+ i7 = HEAP32[i3 >> 2] | 0;
+ if ((i7 | 0) < 0) {
+ _error(i2, 8872);
+ }
+ i9 = HEAP32[i2 >> 2] | 0;
+ if ((i7 + 1 | 0) >>> 0 > 357913941) {
+ _luaM_toobig(i9);
+ }
+ i10 = _luaM_realloc_(i9, 0, 0, i7 * 12 | 0) | 0;
+ i9 = i6 + 24 | 0;
+ HEAP32[i9 >> 2] = i10;
+ HEAP32[i6 + 60 >> 2] = i7;
+ L141 : do {
+ if ((i7 | 0) > 0) {
+ HEAP32[i10 >> 2] = 0;
+ if ((i7 | 0) != 1) {
+ i6 = 1;
+ do {
+ HEAP32[(HEAP32[i9 >> 2] | 0) + (i6 * 12 | 0) >> 2] = 0;
+ i6 = i6 + 1 | 0;
+ } while ((i6 | 0) != (i7 | 0));
+ }
+ i6 = i2 + 8 | 0;
+ i10 = 0;
+ while (1) {
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i3, 4) | 0) != 0) {
+ i9 = 102;
+ break;
+ }
+ i11 = HEAP32[i3 >> 2] | 0;
+ if ((i11 | 0) == 0) {
+ i11 = 0;
+ } else {
+ i11 = _luaZ_openspace(HEAP32[i2 >> 2] | 0, HEAP32[i6 >> 2] | 0, i11) | 0;
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i11, HEAP32[i3 >> 2] | 0) | 0) != 0) {
+ i9 = 105;
+ break;
+ }
+ i11 = _luaS_newlstr(HEAP32[i2 >> 2] | 0, i11, (HEAP32[i3 >> 2] | 0) + -1 | 0) | 0;
+ }
+ HEAP32[(HEAP32[i9 >> 2] | 0) + (i10 * 12 | 0) >> 2] = i11;
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i3, 4) | 0) != 0) {
+ i9 = 108;
+ break;
+ }
+ i11 = HEAP32[i3 >> 2] | 0;
+ if ((i11 | 0) < 0) {
+ i9 = 110;
+ break;
+ }
+ HEAP32[(HEAP32[i9 >> 2] | 0) + (i10 * 12 | 0) + 4 >> 2] = i11;
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i3, 4) | 0) != 0) {
+ i9 = 112;
+ break;
+ }
+ i11 = HEAP32[i3 >> 2] | 0;
+ if ((i11 | 0) < 0) {
+ i9 = 114;
+ break;
+ }
+ HEAP32[(HEAP32[i9 >> 2] | 0) + (i10 * 12 | 0) + 8 >> 2] = i11;
+ i10 = i10 + 1 | 0;
+ if ((i10 | 0) >= (i7 | 0)) {
+ break L141;
+ }
+ }
+ if ((i9 | 0) == 102) {
+ _error(i2, 8824);
+ } else if ((i9 | 0) == 105) {
+ _error(i2, 8824);
+ } else if ((i9 | 0) == 108) {
+ _error(i2, 8824);
+ } else if ((i9 | 0) == 110) {
+ _error(i2, 8872);
+ } else if ((i9 | 0) == 112) {
+ _error(i2, 8824);
+ } else if ((i9 | 0) == 114) {
+ _error(i2, 8872);
+ }
+ }
+ } while (0);
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i5, 4) | 0) != 0) {
+ _error(i2, 8824);
+ }
+ i6 = HEAP32[i5 >> 2] | 0;
+ if ((i6 | 0) < 0) {
+ _error(i2, 8872);
+ }
+ if ((i6 | 0) <= 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i5 = i2 + 8 | 0;
+ i7 = 0;
+ while (1) {
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i3, 4) | 0) != 0) {
+ i9 = 123;
+ break;
+ }
+ i9 = HEAP32[i3 >> 2] | 0;
+ if ((i9 | 0) == 0) {
+ i9 = 0;
+ } else {
+ i9 = _luaZ_openspace(HEAP32[i2 >> 2] | 0, HEAP32[i5 >> 2] | 0, i9) | 0;
+ if ((_luaZ_read(HEAP32[i4 >> 2] | 0, i9, HEAP32[i3 >> 2] | 0) | 0) != 0) {
+ i9 = 126;
+ break;
+ }
+ i9 = _luaS_newlstr(HEAP32[i2 >> 2] | 0, i9, (HEAP32[i3 >> 2] | 0) + -1 | 0) | 0;
+ }
+ HEAP32[(HEAP32[i8 >> 2] | 0) + (i7 << 3) >> 2] = i9;
+ i7 = i7 + 1 | 0;
+ if ((i7 | 0) >= (i6 | 0)) {
+ i9 = 129;
+ break;
+ }
+ }
+ if ((i9 | 0) == 123) {
+ _error(i2, 8824);
+ } else if ((i9 | 0) == 126) {
+ _error(i2, 8824);
+ } else if ((i9 | 0) == 129) {
+ STACKTOP = i1;
+ return;
+ }
+}
+function _exp2reg(i4, i1, i7) {
+ i4 = i4 | 0;
+ i1 = i1 | 0;
+ i7 = i7 | 0;
+ var i2 = 0, i3 = 0, i5 = 0, i6 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0;
+ i5 = STACKTOP;
+ _discharge2reg(i4, i1, i7);
+ i6 = i1 + 16 | 0;
+ do {
+ if ((HEAP32[i1 >> 2] | 0) == 10 ? (i10 = HEAP32[i1 + 8 >> 2] | 0, !((i10 | 0) == -1)) : 0) {
+ i22 = HEAP32[i6 >> 2] | 0;
+ if ((i22 | 0) == -1) {
+ HEAP32[i6 >> 2] = i10;
+ break;
+ }
+ i20 = HEAP32[(HEAP32[i4 >> 2] | 0) + 12 >> 2] | 0;
+ while (1) {
+ i19 = i20 + (i22 << 2) | 0;
+ i21 = HEAP32[i19 >> 2] | 0;
+ i23 = (i21 >>> 14) + -131071 | 0;
+ if ((i23 | 0) == -1) {
+ break;
+ }
+ i23 = i22 + 1 + i23 | 0;
+ if ((i23 | 0) == -1) {
+ break;
+ } else {
+ i22 = i23;
+ }
+ }
+ i10 = i10 + ~i22 | 0;
+ if ((((i10 | 0) > -1 ? i10 : 0 - i10 | 0) | 0) > 131071) {
+ _luaX_syntaxerror(HEAP32[i4 + 12 >> 2] | 0, 10624);
+ } else {
+ HEAP32[i19 >> 2] = (i10 << 14) + 2147467264 | i21 & 16383;
+ break;
+ }
+ }
+ } while (0);
+ i21 = HEAP32[i6 >> 2] | 0;
+ i10 = i1 + 20 | 0;
+ i19 = HEAP32[i10 >> 2] | 0;
+ if ((i21 | 0) == (i19 | 0)) {
+ HEAP32[i6 >> 2] = -1;
+ HEAP32[i10 >> 2] = -1;
+ i25 = i1 + 8 | 0;
+ HEAP32[i25 >> 2] = i7;
+ HEAP32[i1 >> 2] = 6;
+ STACKTOP = i5;
+ return;
+ }
+ L18 : do {
+ if ((i21 | 0) == -1) {
+ i18 = 20;
+ } else {
+ i20 = HEAP32[(HEAP32[i4 >> 2] | 0) + 12 >> 2] | 0;
+ while (1) {
+ i23 = i20 + (i21 << 2) | 0;
+ if ((i21 | 0) > 0 ? (i18 = HEAP32[i20 + (i21 + -1 << 2) >> 2] | 0, (HEAP8[5584 + (i18 & 63) | 0] | 0) < 0) : 0) {
+ i22 = i18;
+ } else {
+ i22 = HEAP32[i23 >> 2] | 0;
+ }
+ if ((i22 & 63 | 0) != 28) {
+ i18 = 28;
+ break L18;
+ }
+ i22 = ((HEAP32[i23 >> 2] | 0) >>> 14) + -131071 | 0;
+ if ((i22 | 0) == -1) {
+ i18 = 20;
+ break L18;
+ }
+ i21 = i21 + 1 + i22 | 0;
+ if ((i21 | 0) == -1) {
+ i18 = 20;
+ break;
+ }
+ }
+ }
+ } while (0);
+ L29 : do {
+ if ((i18 | 0) == 20) {
+ if ((i19 | 0) == -1) {
+ i15 = -1;
+ i8 = -1;
+ } else {
+ i20 = HEAP32[(HEAP32[i4 >> 2] | 0) + 12 >> 2] | 0;
+ while (1) {
+ i21 = i20 + (i19 << 2) | 0;
+ if ((i19 | 0) > 0 ? (i17 = HEAP32[i20 + (i19 + -1 << 2) >> 2] | 0, (HEAP8[5584 + (i17 & 63) | 0] | 0) < 0) : 0) {
+ i22 = i17;
+ } else {
+ i22 = HEAP32[i21 >> 2] | 0;
+ }
+ if ((i22 & 63 | 0) != 28) {
+ i18 = 28;
+ break L29;
+ }
+ i21 = ((HEAP32[i21 >> 2] | 0) >>> 14) + -131071 | 0;
+ if ((i21 | 0) == -1) {
+ i15 = -1;
+ i8 = -1;
+ break L29;
+ }
+ i19 = i19 + 1 + i21 | 0;
+ if ((i19 | 0) == -1) {
+ i15 = -1;
+ i8 = -1;
+ break;
+ }
+ }
+ }
+ }
+ } while (0);
+ do {
+ if ((i18 | 0) == 28) {
+ i17 = i4 + 28 | 0;
+ do {
+ if ((HEAP32[i1 >> 2] | 0) != 10) {
+ i21 = HEAP32[i17 >> 2] | 0;
+ HEAP32[i17 >> 2] = -1;
+ i18 = _luaK_code(i4, 2147450903) | 0;
+ if (!((i21 | 0) == -1)) {
+ if (!((i18 | 0) == -1)) {
+ i23 = HEAP32[(HEAP32[i4 >> 2] | 0) + 12 >> 2] | 0;
+ i22 = i18;
+ while (1) {
+ i20 = i23 + (i22 << 2) | 0;
+ i19 = HEAP32[i20 >> 2] | 0;
+ i24 = (i19 >>> 14) + -131071 | 0;
+ if ((i24 | 0) == -1) {
+ break;
+ }
+ i24 = i22 + 1 + i24 | 0;
+ if ((i24 | 0) == -1) {
+ break;
+ } else {
+ i22 = i24;
+ }
+ }
+ i21 = i21 + ~i22 | 0;
+ if ((((i21 | 0) > -1 ? i21 : 0 - i21 | 0) | 0) > 131071) {
+ _luaX_syntaxerror(HEAP32[i4 + 12 >> 2] | 0, 10624);
+ } else {
+ HEAP32[i20 >> 2] = (i21 << 14) + 2147467264 | i19 & 16383;
+ i16 = i18;
+ break;
+ }
+ } else {
+ i16 = i21;
+ }
+ } else {
+ i16 = i18;
+ }
+ } else {
+ i16 = -1;
+ }
+ } while (0);
+ i24 = i4 + 20 | 0;
+ i25 = i4 + 24 | 0;
+ HEAP32[i25 >> 2] = HEAP32[i24 >> 2];
+ i19 = i7 << 6;
+ i18 = _luaK_code(i4, i19 | 16387) | 0;
+ HEAP32[i25 >> 2] = HEAP32[i24 >> 2];
+ i19 = _luaK_code(i4, i19 | 8388611) | 0;
+ HEAP32[i25 >> 2] = HEAP32[i24 >> 2];
+ if (!((i16 | 0) == -1)) {
+ i22 = HEAP32[i17 >> 2] | 0;
+ if ((i22 | 0) == -1) {
+ HEAP32[i17 >> 2] = i16;
+ i15 = i18;
+ i8 = i19;
+ break;
+ }
+ i17 = HEAP32[(HEAP32[i4 >> 2] | 0) + 12 >> 2] | 0;
+ while (1) {
+ i21 = i17 + (i22 << 2) | 0;
+ i20 = HEAP32[i21 >> 2] | 0;
+ i23 = (i20 >>> 14) + -131071 | 0;
+ if ((i23 | 0) == -1) {
+ break;
+ }
+ i23 = i22 + 1 + i23 | 0;
+ if ((i23 | 0) == -1) {
+ break;
+ } else {
+ i22 = i23;
+ }
+ }
+ i16 = i16 + ~i22 | 0;
+ if ((((i16 | 0) > -1 ? i16 : 0 - i16 | 0) | 0) > 131071) {
+ _luaX_syntaxerror(HEAP32[i4 + 12 >> 2] | 0, 10624);
+ } else {
+ HEAP32[i21 >> 2] = (i16 << 14) + 2147467264 | i20 & 16383;
+ i15 = i18;
+ i8 = i19;
+ break;
+ }
+ } else {
+ i15 = i18;
+ i8 = i19;
+ }
+ }
+ } while (0);
+ i16 = HEAP32[i4 + 20 >> 2] | 0;
+ HEAP32[i4 + 24 >> 2] = i16;
+ i22 = HEAP32[i10 >> 2] | 0;
+ L67 : do {
+ if (!((i22 | 0) == -1)) {
+ i19 = (i7 | 0) == 255;
+ i17 = i7 << 6 & 16320;
+ i18 = HEAP32[(HEAP32[i4 >> 2] | 0) + 12 >> 2] | 0;
+ while (1) {
+ i20 = i18 + (i22 << 2) | 0;
+ i23 = HEAP32[i20 >> 2] | 0;
+ i21 = (i23 >>> 14) + -131071 | 0;
+ if ((i21 | 0) == -1) {
+ i21 = -1;
+ } else {
+ i21 = i22 + 1 + i21 | 0;
+ }
+ if ((i22 | 0) > 0 ? (i14 = i18 + (i22 + -1 << 2) | 0, i13 = HEAP32[i14 >> 2] | 0, (HEAP8[5584 + (i13 & 63) | 0] | 0) < 0) : 0) {
+ i24 = i14;
+ i25 = i13;
+ } else {
+ i24 = i20;
+ i25 = i23;
+ }
+ if ((i25 & 63 | 0) == 28) {
+ i23 = i25 >>> 23;
+ if (i19 | (i23 | 0) == (i7 | 0)) {
+ i23 = i25 & 8372224 | i23 << 6 | 27;
+ } else {
+ i23 = i25 & -16321 | i17;
+ }
+ HEAP32[i24 >> 2] = i23;
+ i22 = i16 + ~i22 | 0;
+ if ((((i22 | 0) > -1 ? i22 : 0 - i22 | 0) | 0) > 131071) {
+ i18 = 58;
+ break;
+ }
+ i22 = HEAP32[i20 >> 2] & 16383 | (i22 << 14) + 2147467264;
+ } else {
+ i22 = i15 + ~i22 | 0;
+ if ((((i22 | 0) > -1 ? i22 : 0 - i22 | 0) | 0) > 131071) {
+ i18 = 61;
+ break;
+ }
+ i22 = i23 & 16383 | (i22 << 14) + 2147467264;
+ }
+ HEAP32[i20 >> 2] = i22;
+ if ((i21 | 0) == -1) {
+ break L67;
+ } else {
+ i22 = i21;
+ }
+ }
+ if ((i18 | 0) == 58) {
+ _luaX_syntaxerror(HEAP32[i4 + 12 >> 2] | 0, 10624);
+ } else if ((i18 | 0) == 61) {
+ _luaX_syntaxerror(HEAP32[i4 + 12 >> 2] | 0, 10624);
+ }
+ }
+ } while (0);
+ i20 = HEAP32[i6 >> 2] | 0;
+ if ((i20 | 0) == -1) {
+ HEAP32[i6 >> 2] = -1;
+ HEAP32[i10 >> 2] = -1;
+ i25 = i1 + 8 | 0;
+ HEAP32[i25 >> 2] = i7;
+ HEAP32[i1 >> 2] = 6;
+ STACKTOP = i5;
+ return;
+ }
+ i13 = i7 << 6;
+ i15 = i13 & 16320;
+ i14 = HEAP32[(HEAP32[i4 >> 2] | 0) + 12 >> 2] | 0;
+ if ((i7 | 0) == 255) {
+ while (1) {
+ i17 = i14 + (i20 << 2) | 0;
+ i19 = HEAP32[i17 >> 2] | 0;
+ i18 = (i19 >>> 14) + -131071 | 0;
+ if ((i18 | 0) == -1) {
+ i18 = -1;
+ } else {
+ i18 = i20 + 1 + i18 | 0;
+ }
+ if ((i20 | 0) > 0 ? (i12 = i14 + (i20 + -1 << 2) | 0, i11 = HEAP32[i12 >> 2] | 0, (HEAP8[5584 + (i11 & 63) | 0] | 0) < 0) : 0) {
+ i22 = i12;
+ i21 = i11;
+ } else {
+ i22 = i17;
+ i21 = i19;
+ }
+ if ((i21 & 63 | 0) == 28) {
+ HEAP32[i22 >> 2] = i21 & 8372224 | i21 >>> 23 << 6 | 27;
+ i19 = i16 + ~i20 | 0;
+ if ((((i19 | 0) > -1 ? i19 : 0 - i19 | 0) | 0) > 131071) {
+ i18 = 87;
+ break;
+ }
+ i19 = HEAP32[i17 >> 2] & 16383 | (i19 << 14) + 2147467264;
+ } else {
+ i20 = i8 + ~i20 | 0;
+ if ((((i20 | 0) > -1 ? i20 : 0 - i20 | 0) | 0) > 131071) {
+ i18 = 90;
+ break;
+ }
+ i19 = i19 & 16383 | (i20 << 14) + 2147467264;
+ }
+ HEAP32[i17 >> 2] = i19;
+ if ((i18 | 0) == -1) {
+ i18 = 93;
+ break;
+ } else {
+ i20 = i18;
+ }
+ }
+ if ((i18 | 0) == 87) {
+ i25 = i4 + 12 | 0;
+ i25 = HEAP32[i25 >> 2] | 0;
+ _luaX_syntaxerror(i25, 10624);
+ } else if ((i18 | 0) == 90) {
+ i25 = i4 + 12 | 0;
+ i25 = HEAP32[i25 >> 2] | 0;
+ _luaX_syntaxerror(i25, 10624);
+ } else if ((i18 | 0) == 93) {
+ HEAP32[i6 >> 2] = -1;
+ HEAP32[i10 >> 2] = -1;
+ i25 = i1 + 8 | 0;
+ HEAP32[i25 >> 2] = i7;
+ HEAP32[i1 >> 2] = 6;
+ STACKTOP = i5;
+ return;
+ }
+ } else {
+ i9 = i20;
+ }
+ while (1) {
+ i11 = i14 + (i9 << 2) | 0;
+ i17 = HEAP32[i11 >> 2] | 0;
+ i12 = (i17 >>> 14) + -131071 | 0;
+ if ((i12 | 0) == -1) {
+ i12 = -1;
+ } else {
+ i12 = i9 + 1 + i12 | 0;
+ }
+ if ((i9 | 0) > 0 ? (i3 = i14 + (i9 + -1 << 2) | 0, i2 = HEAP32[i3 >> 2] | 0, (HEAP8[5584 + (i2 & 63) | 0] | 0) < 0) : 0) {
+ i18 = i3;
+ i19 = i2;
+ } else {
+ i18 = i11;
+ i19 = i17;
+ }
+ if ((i19 & 63 | 0) == 28) {
+ if ((i19 >>> 23 | 0) == (i7 | 0)) {
+ i17 = i19 & 8372224 | i13 | 27;
+ } else {
+ i17 = i19 & -16321 | i15;
+ }
+ HEAP32[i18 >> 2] = i17;
+ i9 = i16 + ~i9 | 0;
+ if ((((i9 | 0) > -1 ? i9 : 0 - i9 | 0) | 0) > 131071) {
+ i18 = 87;
+ break;
+ }
+ i9 = HEAP32[i11 >> 2] & 16383 | (i9 << 14) + 2147467264;
+ } else {
+ i9 = i8 + ~i9 | 0;
+ if ((((i9 | 0) > -1 ? i9 : 0 - i9 | 0) | 0) > 131071) {
+ i18 = 90;
+ break;
+ }
+ i9 = i17 & 16383 | (i9 << 14) + 2147467264;
+ }
+ HEAP32[i11 >> 2] = i9;
+ if ((i12 | 0) == -1) {
+ i18 = 93;
+ break;
+ } else {
+ i9 = i12;
+ }
+ }
+ if ((i18 | 0) == 87) {
+ i25 = i4 + 12 | 0;
+ i25 = HEAP32[i25 >> 2] | 0;
+ _luaX_syntaxerror(i25, 10624);
+ } else if ((i18 | 0) == 90) {
+ i25 = i4 + 12 | 0;
+ i25 = HEAP32[i25 >> 2] | 0;
+ _luaX_syntaxerror(i25, 10624);
+ } else if ((i18 | 0) == 93) {
+ HEAP32[i6 >> 2] = -1;
+ HEAP32[i10 >> 2] = -1;
+ i25 = i1 + 8 | 0;
+ HEAP32[i25 >> 2] = i7;
+ HEAP32[i1 >> 2] = 6;
+ STACKTOP = i5;
+ return;
+ }
+}
+function _propagatemark(i2) {
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0;
+ i1 = STACKTOP;
+ i15 = i2 + 84 | 0;
+ i3 = HEAP32[i15 >> 2] | 0;
+ i10 = i3 + 5 | 0;
+ HEAP8[i10] = HEAPU8[i10] | 4;
+ switch (HEAPU8[i3 + 4 | 0] | 0) {
+ case 5:
+ {
+ i9 = i3 + 24 | 0;
+ HEAP32[i15 >> 2] = HEAP32[i9 >> 2];
+ i15 = i3 + 8 | 0;
+ i14 = HEAP32[i15 >> 2] | 0;
+ do {
+ if ((i14 | 0) != 0) {
+ if ((HEAP8[i14 + 6 | 0] & 8) == 0) {
+ i11 = _luaT_gettm(i14, 3, HEAP32[i2 + 196 >> 2] | 0) | 0;
+ i14 = HEAP32[i15 >> 2] | 0;
+ if ((i14 | 0) != 0) {
+ i6 = 5;
+ }
+ } else {
+ i11 = 0;
+ i6 = 5;
+ }
+ if ((i6 | 0) == 5) {
+ if (!((HEAP8[i14 + 5 | 0] & 3) == 0)) {
+ _reallymarkobject(i2, i14);
+ }
+ }
+ if (((i11 | 0) != 0 ? (HEAP32[i11 + 8 >> 2] & 15 | 0) == 4 : 0) ? (i13 = (HEAP32[i11 >> 2] | 0) + 16 | 0, i12 = _strchr(i13, 107) | 0, i12 = (i12 | 0) != 0, i13 = (_strchr(i13, 118) | 0) == 0, !(i13 & (i12 ^ 1))) : 0) {
+ HEAP8[i10] = HEAP8[i10] & 251;
+ if (i12) {
+ if (i13) {
+ _traverseephemeron(i2, i3) | 0;
+ break;
+ } else {
+ i15 = i2 + 100 | 0;
+ HEAP32[i9 >> 2] = HEAP32[i15 >> 2];
+ HEAP32[i15 >> 2] = i3;
+ break;
+ }
+ }
+ i15 = 1 << HEAPU8[i3 + 7 | 0];
+ i5 = HEAP32[i3 + 16 >> 2] | 0;
+ i4 = i5 + (i15 << 5) | 0;
+ i8 = (HEAP32[i3 + 28 >> 2] | 0) > 0 | 0;
+ if ((i15 | 0) > 0) {
+ do {
+ i12 = i5 + 8 | 0;
+ i10 = i5 + 24 | 0;
+ i11 = (HEAP32[i10 >> 2] & 64 | 0) == 0;
+ do {
+ if ((HEAP32[i12 >> 2] | 0) == 0) {
+ if (!i11 ? !((HEAP8[(HEAP32[i5 + 16 >> 2] | 0) + 5 | 0] & 3) == 0) : 0) {
+ HEAP32[i10 >> 2] = 11;
+ }
+ } else {
+ if (!i11 ? (i7 = HEAP32[i5 + 16 >> 2] | 0, !((HEAP8[i7 + 5 | 0] & 3) == 0)) : 0) {
+ _reallymarkobject(i2, i7);
+ }
+ if ((i8 | 0) == 0) {
+ i10 = HEAP32[i12 >> 2] | 0;
+ if ((i10 & 64 | 0) != 0) {
+ i8 = HEAP32[i5 >> 2] | 0;
+ if ((i10 & 15 | 0) != 4) {
+ i8 = (HEAP8[i8 + 5 | 0] & 3) != 0 | 0;
+ break;
+ }
+ if ((i8 | 0) != 0 ? !((HEAP8[i8 + 5 | 0] & 3) == 0) : 0) {
+ _reallymarkobject(i2, i8);
+ i8 = 0;
+ } else {
+ i8 = 0;
+ }
+ } else {
+ i8 = 0;
+ }
+ }
+ }
+ } while (0);
+ i5 = i5 + 32 | 0;
+ } while (i5 >>> 0 < i4 >>> 0);
+ }
+ if ((i8 | 0) == 0) {
+ i15 = i2 + 88 | 0;
+ HEAP32[i9 >> 2] = HEAP32[i15 >> 2];
+ HEAP32[i15 >> 2] = i3;
+ break;
+ } else {
+ i15 = i2 + 92 | 0;
+ HEAP32[i9 >> 2] = HEAP32[i15 >> 2];
+ HEAP32[i15 >> 2] = i3;
+ break;
+ }
+ } else {
+ i6 = 33;
+ }
+ } else {
+ i6 = 33;
+ }
+ } while (0);
+ if ((i6 | 0) == 33) {
+ i7 = i3 + 16 | 0;
+ i10 = HEAP32[i7 >> 2] | 0;
+ i6 = i10 + (1 << HEAPU8[i3 + 7 | 0] << 5) | 0;
+ i9 = i3 + 28 | 0;
+ i13 = HEAP32[i9 >> 2] | 0;
+ if ((i13 | 0) > 0) {
+ i10 = i3 + 12 | 0;
+ i11 = 0;
+ do {
+ i12 = HEAP32[i10 >> 2] | 0;
+ if ((HEAP32[i12 + (i11 << 4) + 8 >> 2] & 64 | 0) != 0 ? (i8 = HEAP32[i12 + (i11 << 4) >> 2] | 0, !((HEAP8[i8 + 5 | 0] & 3) == 0)) : 0) {
+ _reallymarkobject(i2, i8);
+ i13 = HEAP32[i9 >> 2] | 0;
+ }
+ i11 = i11 + 1 | 0;
+ } while ((i11 | 0) < (i13 | 0));
+ i7 = HEAP32[i7 >> 2] | 0;
+ } else {
+ i7 = i10;
+ }
+ if (i7 >>> 0 < i6 >>> 0) {
+ do {
+ i10 = i7 + 8 | 0;
+ i11 = HEAP32[i10 >> 2] | 0;
+ i9 = i7 + 24 | 0;
+ i8 = (HEAP32[i9 >> 2] & 64 | 0) == 0;
+ if ((i11 | 0) == 0) {
+ if (!i8 ? !((HEAP8[(HEAP32[i7 + 16 >> 2] | 0) + 5 | 0] & 3) == 0) : 0) {
+ HEAP32[i9 >> 2] = 11;
+ }
+ } else {
+ if (!i8 ? (i5 = HEAP32[i7 + 16 >> 2] | 0, !((HEAP8[i5 + 5 | 0] & 3) == 0)) : 0) {
+ _reallymarkobject(i2, i5);
+ i11 = HEAP32[i10 >> 2] | 0;
+ }
+ if ((i11 & 64 | 0) != 0 ? (i4 = HEAP32[i7 >> 2] | 0, !((HEAP8[i4 + 5 | 0] & 3) == 0)) : 0) {
+ _reallymarkobject(i2, i4);
+ }
+ }
+ i7 = i7 + 32 | 0;
+ } while (i7 >>> 0 < i6 >>> 0);
+ }
+ }
+ i3 = (HEAP32[i3 + 28 >> 2] << 4) + 32 + (32 << HEAPU8[i3 + 7 | 0]) | 0;
+ break;
+ }
+ case 8:
+ {
+ i7 = i3 + 60 | 0;
+ HEAP32[i15 >> 2] = HEAP32[i7 >> 2];
+ i4 = i2 + 88 | 0;
+ HEAP32[i7 >> 2] = HEAP32[i4 >> 2];
+ HEAP32[i4 >> 2] = i3;
+ HEAP8[i10] = HEAP8[i10] & 251;
+ i4 = i3 + 28 | 0;
+ i7 = HEAP32[i4 >> 2] | 0;
+ if ((i7 | 0) == 0) {
+ i3 = 1;
+ } else {
+ i5 = i3 + 8 | 0;
+ i6 = HEAP32[i5 >> 2] | 0;
+ if (i7 >>> 0 < i6 >>> 0) {
+ do {
+ if ((HEAP32[i7 + 8 >> 2] & 64 | 0) != 0 ? (i11 = HEAP32[i7 >> 2] | 0, !((HEAP8[i11 + 5 | 0] & 3) == 0)) : 0) {
+ _reallymarkobject(i2, i11);
+ i6 = HEAP32[i5 >> 2] | 0;
+ }
+ i7 = i7 + 16 | 0;
+ } while (i7 >>> 0 < i6 >>> 0);
+ }
+ if ((HEAP8[i2 + 61 | 0] | 0) == 1) {
+ i3 = i3 + 32 | 0;
+ i4 = (HEAP32[i4 >> 2] | 0) + (HEAP32[i3 >> 2] << 4) | 0;
+ if (i7 >>> 0 < i4 >>> 0) {
+ do {
+ HEAP32[i7 + 8 >> 2] = 0;
+ i7 = i7 + 16 | 0;
+ } while (i7 >>> 0 < i4 >>> 0);
+ }
+ } else {
+ i3 = i3 + 32 | 0;
+ }
+ i3 = (HEAP32[i3 >> 2] << 4) + 112 | 0;
+ }
+ break;
+ }
+ case 9:
+ {
+ HEAP32[i15 >> 2] = HEAP32[i3 + 72 >> 2];
+ i5 = i3 + 32 | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ if ((i4 | 0) != 0 ? !((HEAP8[i4 + 5 | 0] & 3) == 0) : 0) {
+ HEAP32[i5 >> 2] = 0;
+ }
+ i4 = HEAP32[i3 + 36 >> 2] | 0;
+ if ((i4 | 0) != 0 ? !((HEAP8[i4 + 5 | 0] & 3) == 0) : 0) {
+ _reallymarkobject(i2, i4);
+ }
+ i4 = i3 + 44 | 0;
+ i8 = HEAP32[i4 >> 2] | 0;
+ if ((i8 | 0) > 0) {
+ i5 = i3 + 8 | 0;
+ i6 = 0;
+ do {
+ i7 = HEAP32[i5 >> 2] | 0;
+ if ((HEAP32[i7 + (i6 << 4) + 8 >> 2] & 64 | 0) != 0 ? (i9 = HEAP32[i7 + (i6 << 4) >> 2] | 0, !((HEAP8[i9 + 5 | 0] & 3) == 0)) : 0) {
+ _reallymarkobject(i2, i9);
+ i8 = HEAP32[i4 >> 2] | 0;
+ }
+ i6 = i6 + 1 | 0;
+ } while ((i6 | 0) < (i8 | 0));
+ }
+ i5 = i3 + 40 | 0;
+ i8 = HEAP32[i5 >> 2] | 0;
+ if ((i8 | 0) > 0) {
+ i6 = i3 + 28 | 0;
+ i7 = 0;
+ do {
+ i9 = HEAP32[(HEAP32[i6 >> 2] | 0) + (i7 << 3) >> 2] | 0;
+ if ((i9 | 0) != 0 ? !((HEAP8[i9 + 5 | 0] & 3) == 0) : 0) {
+ _reallymarkobject(i2, i9);
+ i8 = HEAP32[i5 >> 2] | 0;
+ }
+ i7 = i7 + 1 | 0;
+ } while ((i7 | 0) < (i8 | 0));
+ }
+ i6 = i3 + 56 | 0;
+ i8 = HEAP32[i6 >> 2] | 0;
+ if ((i8 | 0) > 0) {
+ i7 = i3 + 16 | 0;
+ i9 = 0;
+ do {
+ i10 = HEAP32[(HEAP32[i7 >> 2] | 0) + (i9 << 2) >> 2] | 0;
+ if ((i10 | 0) != 0 ? !((HEAP8[i10 + 5 | 0] & 3) == 0) : 0) {
+ _reallymarkobject(i2, i10);
+ i8 = HEAP32[i6 >> 2] | 0;
+ }
+ i9 = i9 + 1 | 0;
+ } while ((i9 | 0) < (i8 | 0));
+ }
+ i7 = i3 + 60 | 0;
+ i11 = HEAP32[i7 >> 2] | 0;
+ if ((i11 | 0) > 0) {
+ i8 = i3 + 24 | 0;
+ i9 = 0;
+ do {
+ i10 = HEAP32[(HEAP32[i8 >> 2] | 0) + (i9 * 12 | 0) >> 2] | 0;
+ if ((i10 | 0) != 0 ? !((HEAP8[i10 + 5 | 0] & 3) == 0) : 0) {
+ _reallymarkobject(i2, i10);
+ i11 = HEAP32[i7 >> 2] | 0;
+ }
+ i9 = i9 + 1 | 0;
+ } while ((i9 | 0) < (i11 | 0));
+ i8 = HEAP32[i6 >> 2] | 0;
+ }
+ i3 = (i11 * 12 | 0) + 80 + (HEAP32[i4 >> 2] << 4) + (HEAP32[i5 >> 2] << 3) + ((HEAP32[i3 + 48 >> 2] | 0) + i8 + (HEAP32[i3 + 52 >> 2] | 0) << 2) | 0;
+ break;
+ }
+ case 38:
+ {
+ HEAP32[i15 >> 2] = HEAP32[i3 + 8 >> 2];
+ i4 = i3 + 6 | 0;
+ i5 = HEAP8[i4] | 0;
+ if (i5 << 24 >> 24 == 0) {
+ i7 = i5 & 255;
+ } else {
+ i6 = 0;
+ do {
+ if ((HEAP32[i3 + (i6 << 4) + 24 >> 2] & 64 | 0) != 0 ? (i14 = HEAP32[i3 + (i6 << 4) + 16 >> 2] | 0, !((HEAP8[i14 + 5 | 0] & 3) == 0)) : 0) {
+ _reallymarkobject(i2, i14);
+ i5 = HEAP8[i4] | 0;
+ }
+ i6 = i6 + 1 | 0;
+ i7 = i5 & 255;
+ } while ((i6 | 0) < (i7 | 0));
+ }
+ i3 = (i7 << 4) + 16 | 0;
+ break;
+ }
+ case 6:
+ {
+ HEAP32[i15 >> 2] = HEAP32[i3 + 8 >> 2];
+ i4 = HEAP32[i3 + 12 >> 2] | 0;
+ if ((i4 | 0) != 0 ? !((HEAP8[i4 + 5 | 0] & 3) == 0) : 0) {
+ _reallymarkobject(i2, i4);
+ }
+ i4 = i3 + 6 | 0;
+ i6 = HEAP8[i4] | 0;
+ if (i6 << 24 >> 24 == 0) {
+ i7 = i6 & 255;
+ } else {
+ i5 = 0;
+ do {
+ i7 = HEAP32[i3 + (i5 << 2) + 16 >> 2] | 0;
+ if ((i7 | 0) != 0 ? !((HEAP8[i7 + 5 | 0] & 3) == 0) : 0) {
+ _reallymarkobject(i2, i7);
+ i6 = HEAP8[i4] | 0;
+ }
+ i5 = i5 + 1 | 0;
+ i7 = i6 & 255;
+ } while ((i5 | 0) < (i7 | 0));
+ }
+ i3 = (i7 << 2) + 16 | 0;
+ break;
+ }
+ default:
+ {
+ STACKTOP = i1;
+ return;
+ }
+ }
+ i15 = i2 + 16 | 0;
+ HEAP32[i15 >> 2] = (HEAP32[i15 >> 2] | 0) + i3;
+ STACKTOP = i1;
+ return;
+}
+function _strstr(i8, i4) {
+ i8 = i8 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i5 = 0, i6 = 0, i7 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 1056 | 0;
+ i6 = i1 + 1024 | 0;
+ i2 = i1;
+ i10 = HEAP8[i4] | 0;
+ if (i10 << 24 >> 24 == 0) {
+ i20 = i8;
+ STACKTOP = i1;
+ return i20 | 0;
+ }
+ i8 = _strchr(i8, i10 << 24 >> 24) | 0;
+ if ((i8 | 0) == 0) {
+ i20 = 0;
+ STACKTOP = i1;
+ return i20 | 0;
+ }
+ i13 = HEAP8[i4 + 1 | 0] | 0;
+ if (i13 << 24 >> 24 == 0) {
+ i20 = i8;
+ STACKTOP = i1;
+ return i20 | 0;
+ }
+ i11 = i8 + 1 | 0;
+ i9 = HEAP8[i11] | 0;
+ if (i9 << 24 >> 24 == 0) {
+ i20 = 0;
+ STACKTOP = i1;
+ return i20 | 0;
+ }
+ i15 = HEAP8[i4 + 2 | 0] | 0;
+ if (i15 << 24 >> 24 == 0) {
+ i2 = i13 & 255 | (i10 & 255) << 8;
+ i3 = i9;
+ i4 = HEAPU8[i8] << 8 | i9 & 255;
+ while (1) {
+ i5 = i4 & 65535;
+ if ((i5 | 0) == (i2 | 0)) {
+ break;
+ }
+ i11 = i11 + 1 | 0;
+ i4 = HEAP8[i11] | 0;
+ if (i4 << 24 >> 24 == 0) {
+ i3 = 0;
+ break;
+ } else {
+ i3 = i4;
+ i4 = i4 & 255 | i5 << 8;
+ }
+ }
+ i20 = i3 << 24 >> 24 == 0 ? 0 : i11 + -1 | 0;
+ STACKTOP = i1;
+ return i20 | 0;
+ }
+ i16 = i8 + 2 | 0;
+ i11 = HEAP8[i16] | 0;
+ if (i11 << 24 >> 24 == 0) {
+ i20 = 0;
+ STACKTOP = i1;
+ return i20 | 0;
+ }
+ i18 = HEAP8[i4 + 3 | 0] | 0;
+ if (i18 << 24 >> 24 == 0) {
+ i2 = (i13 & 255) << 16 | (i10 & 255) << 24 | (i15 & 255) << 8;
+ i4 = (i11 & 255) << 8 | (i9 & 255) << 16 | HEAPU8[i8] << 24;
+ if ((i4 | 0) == (i2 | 0)) {
+ i3 = 0;
+ } else {
+ do {
+ i16 = i16 + 1 | 0;
+ i3 = HEAP8[i16] | 0;
+ i4 = (i3 & 255 | i4) << 8;
+ i3 = i3 << 24 >> 24 == 0;
+ } while (!(i3 | (i4 | 0) == (i2 | 0)));
+ }
+ i20 = i3 ? 0 : i16 + -2 | 0;
+ STACKTOP = i1;
+ return i20 | 0;
+ }
+ i16 = i8 + 3 | 0;
+ i17 = HEAP8[i16] | 0;
+ if (i17 << 24 >> 24 == 0) {
+ i20 = 0;
+ STACKTOP = i1;
+ return i20 | 0;
+ }
+ if ((HEAP8[i4 + 4 | 0] | 0) == 0) {
+ i2 = (i13 & 255) << 16 | (i10 & 255) << 24 | (i15 & 255) << 8 | i18 & 255;
+ i3 = (i11 & 255) << 8 | (i9 & 255) << 16 | i17 & 255 | HEAPU8[i8] << 24;
+ if ((i3 | 0) == (i2 | 0)) {
+ i4 = 0;
+ } else {
+ do {
+ i16 = i16 + 1 | 0;
+ i4 = HEAP8[i16] | 0;
+ i3 = i4 & 255 | i3 << 8;
+ i4 = i4 << 24 >> 24 == 0;
+ } while (!(i4 | (i3 | 0) == (i2 | 0)));
+ }
+ i20 = i4 ? 0 : i16 + -3 | 0;
+ STACKTOP = i1;
+ return i20 | 0;
+ }
+ HEAP32[i6 + 0 >> 2] = 0;
+ HEAP32[i6 + 4 >> 2] = 0;
+ HEAP32[i6 + 8 >> 2] = 0;
+ HEAP32[i6 + 12 >> 2] = 0;
+ HEAP32[i6 + 16 >> 2] = 0;
+ HEAP32[i6 + 20 >> 2] = 0;
+ HEAP32[i6 + 24 >> 2] = 0;
+ HEAP32[i6 + 28 >> 2] = 0;
+ i9 = 0;
+ while (1) {
+ if ((HEAP8[i8 + i9 | 0] | 0) == 0) {
+ i14 = 0;
+ i12 = 80;
+ break;
+ }
+ i20 = i10 & 255;
+ i3 = i6 + (i20 >>> 5 << 2) | 0;
+ HEAP32[i3 >> 2] = HEAP32[i3 >> 2] | 1 << (i20 & 31);
+ i3 = i9 + 1 | 0;
+ HEAP32[i2 + (i20 << 2) >> 2] = i3;
+ i10 = HEAP8[i4 + i3 | 0] | 0;
+ if (i10 << 24 >> 24 == 0) {
+ break;
+ } else {
+ i9 = i3;
+ }
+ }
+ if ((i12 | 0) == 80) {
+ STACKTOP = i1;
+ return i14 | 0;
+ }
+ L49 : do {
+ if (i3 >>> 0 > 1) {
+ i14 = 1;
+ i11 = -1;
+ i12 = 0;
+ L50 : while (1) {
+ i10 = 1;
+ while (1) {
+ i13 = i14;
+ L54 : while (1) {
+ i14 = 1;
+ while (1) {
+ i15 = HEAP8[i4 + (i14 + i11) | 0] | 0;
+ i16 = HEAP8[i4 + i13 | 0] | 0;
+ if (!(i15 << 24 >> 24 == i16 << 24 >> 24)) {
+ break L54;
+ }
+ i15 = i14 + 1 | 0;
+ if ((i14 | 0) == (i10 | 0)) {
+ break;
+ }
+ i13 = i15 + i12 | 0;
+ if (i13 >>> 0 < i3 >>> 0) {
+ i14 = i15;
+ } else {
+ break L50;
+ }
+ }
+ i12 = i12 + i10 | 0;
+ i13 = i12 + 1 | 0;
+ if (!(i13 >>> 0 < i3 >>> 0)) {
+ break L50;
+ }
+ }
+ i10 = i13 - i11 | 0;
+ if (!((i15 & 255) > (i16 & 255))) {
+ break;
+ }
+ i14 = i13 + 1 | 0;
+ if (i14 >>> 0 < i3 >>> 0) {
+ i12 = i13;
+ } else {
+ break L50;
+ }
+ }
+ i14 = i12 + 2 | 0;
+ if (i14 >>> 0 < i3 >>> 0) {
+ i11 = i12;
+ i12 = i12 + 1 | 0;
+ } else {
+ i11 = i12;
+ i10 = 1;
+ break;
+ }
+ }
+ i16 = 1;
+ i12 = -1;
+ i14 = 0;
+ while (1) {
+ i13 = 1;
+ while (1) {
+ i15 = i16;
+ L69 : while (1) {
+ i18 = 1;
+ while (1) {
+ i17 = HEAP8[i4 + (i18 + i12) | 0] | 0;
+ i16 = HEAP8[i4 + i15 | 0] | 0;
+ if (!(i17 << 24 >> 24 == i16 << 24 >> 24)) {
+ break L69;
+ }
+ i16 = i18 + 1 | 0;
+ if ((i18 | 0) == (i13 | 0)) {
+ break;
+ }
+ i15 = i16 + i14 | 0;
+ if (i15 >>> 0 < i3 >>> 0) {
+ i18 = i16;
+ } else {
+ i14 = i12;
+ break L49;
+ }
+ }
+ i14 = i14 + i13 | 0;
+ i15 = i14 + 1 | 0;
+ if (!(i15 >>> 0 < i3 >>> 0)) {
+ i14 = i12;
+ break L49;
+ }
+ }
+ i13 = i15 - i12 | 0;
+ if (!((i17 & 255) < (i16 & 255))) {
+ break;
+ }
+ i16 = i15 + 1 | 0;
+ if (i16 >>> 0 < i3 >>> 0) {
+ i14 = i15;
+ } else {
+ i14 = i12;
+ break L49;
+ }
+ }
+ i16 = i14 + 2 | 0;
+ if (i16 >>> 0 < i3 >>> 0) {
+ i12 = i14;
+ i14 = i14 + 1 | 0;
+ } else {
+ i13 = 1;
+ break;
+ }
+ }
+ } else {
+ i11 = -1;
+ i14 = -1;
+ i10 = 1;
+ i13 = 1;
+ }
+ } while (0);
+ i15 = (i14 + 1 | 0) >>> 0 > (i11 + 1 | 0) >>> 0;
+ i12 = i15 ? i13 : i10;
+ i11 = i15 ? i14 : i11;
+ i10 = i11 + 1 | 0;
+ if ((_memcmp(i4, i4 + i12 | 0, i10) | 0) == 0) {
+ i15 = i3 - i12 | 0;
+ i16 = i3 | 63;
+ if ((i3 | 0) != (i12 | 0)) {
+ i14 = i8;
+ i13 = 0;
+ i17 = i8;
+ L82 : while (1) {
+ i18 = i14;
+ do {
+ if ((i17 - i18 | 0) >>> 0 < i3 >>> 0) {
+ i19 = _memchr(i17, 0, i16) | 0;
+ if ((i19 | 0) != 0) {
+ if ((i19 - i18 | 0) >>> 0 < i3 >>> 0) {
+ i14 = 0;
+ i12 = 80;
+ break L82;
+ } else {
+ i17 = i19;
+ break;
+ }
+ } else {
+ i17 = i17 + i16 | 0;
+ break;
+ }
+ }
+ } while (0);
+ i18 = HEAPU8[i14 + i9 | 0] | 0;
+ if ((1 << (i18 & 31) & HEAP32[i6 + (i18 >>> 5 << 2) >> 2] | 0) == 0) {
+ i14 = i14 + i3 | 0;
+ i13 = 0;
+ continue;
+ }
+ i20 = HEAP32[i2 + (i18 << 2) >> 2] | 0;
+ i18 = i3 - i20 | 0;
+ if ((i3 | 0) != (i20 | 0)) {
+ i14 = i14 + ((i13 | 0) != 0 & i18 >>> 0 < i12 >>> 0 ? i15 : i18) | 0;
+ i13 = 0;
+ continue;
+ }
+ i20 = i10 >>> 0 > i13 >>> 0 ? i10 : i13;
+ i18 = HEAP8[i4 + i20 | 0] | 0;
+ L96 : do {
+ if (i18 << 24 >> 24 == 0) {
+ i19 = i10;
+ } else {
+ while (1) {
+ i19 = i20 + 1 | 0;
+ if (!(i18 << 24 >> 24 == (HEAP8[i14 + i20 | 0] | 0))) {
+ break;
+ }
+ i18 = HEAP8[i4 + i19 | 0] | 0;
+ if (i18 << 24 >> 24 == 0) {
+ i19 = i10;
+ break L96;
+ } else {
+ i20 = i19;
+ }
+ }
+ i14 = i14 + (i20 - i11) | 0;
+ i13 = 0;
+ continue L82;
+ }
+ } while (0);
+ while (1) {
+ if (!(i19 >>> 0 > i13 >>> 0)) {
+ break;
+ }
+ i18 = i19 + -1 | 0;
+ if ((HEAP8[i4 + i18 | 0] | 0) == (HEAP8[i14 + i18 | 0] | 0)) {
+ i19 = i18;
+ } else {
+ break;
+ }
+ }
+ if ((i19 | 0) == (i13 | 0)) {
+ i12 = 80;
+ break;
+ }
+ i14 = i14 + i12 | 0;
+ i13 = i15;
+ }
+ if ((i12 | 0) == 80) {
+ STACKTOP = i1;
+ return i14 | 0;
+ }
+ } else {
+ i5 = i16;
+ i7 = i3;
+ }
+ } else {
+ i7 = i3 - i11 + -1 | 0;
+ i5 = i3 | 63;
+ i7 = (i11 >>> 0 > i7 >>> 0 ? i11 : i7) + 1 | 0;
+ }
+ i12 = i4 + i10 | 0;
+ i14 = i8;
+ L111 : while (1) {
+ i13 = i14;
+ do {
+ if ((i8 - i13 | 0) >>> 0 < i3 >>> 0) {
+ i15 = _memchr(i8, 0, i5) | 0;
+ if ((i15 | 0) != 0) {
+ if ((i15 - i13 | 0) >>> 0 < i3 >>> 0) {
+ i14 = 0;
+ i12 = 80;
+ break L111;
+ } else {
+ i8 = i15;
+ break;
+ }
+ } else {
+ i8 = i8 + i5 | 0;
+ break;
+ }
+ }
+ } while (0);
+ i13 = HEAPU8[i14 + i9 | 0] | 0;
+ if ((1 << (i13 & 31) & HEAP32[i6 + (i13 >>> 5 << 2) >> 2] | 0) == 0) {
+ i14 = i14 + i3 | 0;
+ continue;
+ }
+ i13 = HEAP32[i2 + (i13 << 2) >> 2] | 0;
+ if ((i3 | 0) != (i13 | 0)) {
+ i14 = i14 + (i3 - i13) | 0;
+ continue;
+ }
+ i15 = HEAP8[i12] | 0;
+ L125 : do {
+ if (i15 << 24 >> 24 == 0) {
+ i13 = i10;
+ } else {
+ i16 = i10;
+ while (1) {
+ i13 = i16 + 1 | 0;
+ if (!(i15 << 24 >> 24 == (HEAP8[i14 + i16 | 0] | 0))) {
+ break;
+ }
+ i15 = HEAP8[i4 + i13 | 0] | 0;
+ if (i15 << 24 >> 24 == 0) {
+ i13 = i10;
+ break L125;
+ } else {
+ i16 = i13;
+ }
+ }
+ i14 = i14 + (i16 - i11) | 0;
+ continue L111;
+ }
+ } while (0);
+ do {
+ if ((i13 | 0) == 0) {
+ i12 = 80;
+ break L111;
+ }
+ i13 = i13 + -1 | 0;
+ } while ((HEAP8[i4 + i13 | 0] | 0) == (HEAP8[i14 + i13 | 0] | 0));
+ i14 = i14 + i7 | 0;
+ }
+ if ((i12 | 0) == 80) {
+ STACKTOP = i1;
+ return i14 | 0;
+ }
+ return 0;
+}
+function _str_format(i2) {
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, d21 = 0.0, i22 = 0;
+ i12 = STACKTOP;
+ STACKTOP = STACKTOP + 1104 | 0;
+ i4 = i12;
+ i7 = i12 + 1060 | 0;
+ i9 = i12 + 1082 | 0;
+ i20 = i12 + 1056 | 0;
+ i10 = i12 + 16 | 0;
+ i5 = i12 + 1064 | 0;
+ i6 = i12 + 8 | 0;
+ i8 = _lua_gettop(i2) | 0;
+ i16 = _luaL_checklstring(i2, 1, i20) | 0;
+ i20 = HEAP32[i20 >> 2] | 0;
+ i3 = i16 + i20 | 0;
+ _luaL_buffinit(i2, i10);
+ L1 : do {
+ if ((i20 | 0) > 0) {
+ i1 = i10 + 8 | 0;
+ i13 = i10 + 4 | 0;
+ i14 = i5 + 1 | 0;
+ i19 = 1;
+ L3 : while (1) {
+ while (1) {
+ i15 = HEAP8[i16] | 0;
+ if (i15 << 24 >> 24 == 37) {
+ i18 = i16 + 1 | 0;
+ if ((HEAP8[i18] | 0) != 37) {
+ break;
+ }
+ i15 = HEAP32[i1 >> 2] | 0;
+ if (i15 >>> 0 < (HEAP32[i13 >> 2] | 0) >>> 0) {
+ i17 = 37;
+ } else {
+ _luaL_prepbuffsize(i10, 1) | 0;
+ i15 = HEAP32[i1 >> 2] | 0;
+ i17 = HEAP8[i18] | 0;
+ }
+ HEAP32[i1 >> 2] = i15 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i15 | 0] = i17;
+ i16 = i16 + 2 | 0;
+ } else {
+ i17 = HEAP32[i1 >> 2] | 0;
+ if (!(i17 >>> 0 < (HEAP32[i13 >> 2] | 0) >>> 0)) {
+ _luaL_prepbuffsize(i10, 1) | 0;
+ i17 = HEAP32[i1 >> 2] | 0;
+ i15 = HEAP8[i16] | 0;
+ }
+ HEAP32[i1 >> 2] = i17 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i17 | 0] = i15;
+ i16 = i16 + 1 | 0;
+ }
+ if (!(i16 >>> 0 < i3 >>> 0)) {
+ break L1;
+ }
+ }
+ i17 = _luaL_prepbuffsize(i10, 512) | 0;
+ i15 = i19 + 1 | 0;
+ if ((i19 | 0) >= (i8 | 0)) {
+ _luaL_argerror(i2, i15, 7648) | 0;
+ }
+ i19 = HEAP8[i18] | 0;
+ L22 : do {
+ if (i19 << 24 >> 24 == 0) {
+ i19 = 0;
+ i20 = i18;
+ } else {
+ i20 = i18;
+ while (1) {
+ i16 = i20 + 1 | 0;
+ if ((_memchr(7800, i19 << 24 >> 24, 6) | 0) == 0) {
+ break L22;
+ }
+ i19 = HEAP8[i16] | 0;
+ if (i19 << 24 >> 24 == 0) {
+ i19 = 0;
+ i20 = i16;
+ break;
+ } else {
+ i20 = i16;
+ }
+ }
+ }
+ } while (0);
+ i16 = i18;
+ if ((i20 - i16 | 0) >>> 0 > 5) {
+ _luaL_error(i2, 7808, i4) | 0;
+ i19 = HEAP8[i20] | 0;
+ }
+ i19 = ((i19 & 255) + -48 | 0) >>> 0 < 10 ? i20 + 1 | 0 : i20;
+ i19 = ((HEAPU8[i19] | 0) + -48 | 0) >>> 0 < 10 ? i19 + 1 | 0 : i19;
+ i20 = HEAP8[i19] | 0;
+ if (i20 << 24 >> 24 == 46) {
+ i20 = i19 + 1 | 0;
+ i19 = ((HEAPU8[i20] | 0) + -48 | 0) >>> 0 < 10 ? i19 + 2 | 0 : i20;
+ i19 = ((HEAPU8[i19] | 0) + -48 | 0) >>> 0 < 10 ? i19 + 1 | 0 : i19;
+ i20 = HEAP8[i19] | 0;
+ }
+ if (((i20 & 255) + -48 | 0) >>> 0 < 10) {
+ _luaL_error(i2, 7840, i4) | 0;
+ }
+ HEAP8[i5] = 37;
+ i16 = i19 - i16 | 0;
+ _memcpy(i14 | 0, i18 | 0, i16 + 1 | 0) | 0;
+ HEAP8[i5 + (i16 + 2) | 0] = 0;
+ i16 = i19 + 1 | 0;
+ i18 = HEAP8[i19] | 0;
+ L36 : do {
+ switch (i18 | 0) {
+ case 115:
+ {
+ i18 = _luaL_tolstring(i2, i15, i6) | 0;
+ if ((_strchr(i5, 46) | 0) == 0 ? (HEAP32[i6 >> 2] | 0) >>> 0 > 99 : 0) {
+ _luaL_addvalue(i10);
+ i17 = 0;
+ break L36;
+ }
+ HEAP32[i4 >> 2] = i18;
+ i17 = _sprintf(i17 | 0, i5 | 0, i4 | 0) | 0;
+ _lua_settop(i2, -2);
+ break;
+ }
+ case 88:
+ case 120:
+ case 117:
+ case 111:
+ {
+ d21 = +_luaL_checknumber(i2, i15);
+ i18 = ~~d21 >>> 0;
+ d21 = d21 - +(i18 >>> 0);
+ if (!(d21 > -1.0 & d21 < 1.0)) {
+ _luaL_argerror(i2, i15, 7696) | 0;
+ }
+ i20 = _strlen(i5 | 0) | 0;
+ i22 = i5 + (i20 + -1) | 0;
+ i19 = HEAP8[i22] | 0;
+ HEAP8[i22] = 108;
+ HEAP8[i22 + 1 | 0] = 0;
+ HEAP8[i5 + i20 | 0] = i19;
+ HEAP8[i5 + (i20 + 1) | 0] = 0;
+ HEAP32[i4 >> 2] = i18;
+ i17 = _sprintf(i17 | 0, i5 | 0, i4 | 0) | 0;
+ break;
+ }
+ case 99:
+ {
+ HEAP32[i4 >> 2] = _luaL_checkinteger(i2, i15) | 0;
+ i17 = _sprintf(i17 | 0, i5 | 0, i4 | 0) | 0;
+ break;
+ }
+ case 113:
+ {
+ i17 = _luaL_checklstring(i2, i15, i7) | 0;
+ i18 = HEAP32[i1 >> 2] | 0;
+ if (!(i18 >>> 0 < (HEAP32[i13 >> 2] | 0) >>> 0)) {
+ _luaL_prepbuffsize(i10, 1) | 0;
+ i18 = HEAP32[i1 >> 2] | 0;
+ }
+ HEAP32[i1 >> 2] = i18 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i18 | 0] = 34;
+ i22 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = i22 + -1;
+ if ((i22 | 0) != 0) {
+ while (1) {
+ i18 = HEAP8[i17] | 0;
+ do {
+ if (i18 << 24 >> 24 == 10 | i18 << 24 >> 24 == 92 | i18 << 24 >> 24 == 34) {
+ i18 = HEAP32[i1 >> 2] | 0;
+ if (!(i18 >>> 0 < (HEAP32[i13 >> 2] | 0) >>> 0)) {
+ _luaL_prepbuffsize(i10, 1) | 0;
+ i18 = HEAP32[i1 >> 2] | 0;
+ }
+ HEAP32[i1 >> 2] = i18 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i18 | 0] = 92;
+ i18 = HEAP32[i1 >> 2] | 0;
+ if (!(i18 >>> 0 < (HEAP32[i13 >> 2] | 0) >>> 0)) {
+ _luaL_prepbuffsize(i10, 1) | 0;
+ i18 = HEAP32[i1 >> 2] | 0;
+ }
+ i22 = HEAP8[i17] | 0;
+ HEAP32[i1 >> 2] = i18 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i18 | 0] = i22;
+ } else if (i18 << 24 >> 24 == 0) {
+ i18 = 0;
+ i11 = 44;
+ } else {
+ if ((_iscntrl(i18 & 255 | 0) | 0) != 0) {
+ i18 = HEAP8[i17] | 0;
+ i11 = 44;
+ break;
+ }
+ i18 = HEAP32[i1 >> 2] | 0;
+ if (!(i18 >>> 0 < (HEAP32[i13 >> 2] | 0) >>> 0)) {
+ _luaL_prepbuffsize(i10, 1) | 0;
+ i18 = HEAP32[i1 >> 2] | 0;
+ }
+ i22 = HEAP8[i17] | 0;
+ HEAP32[i1 >> 2] = i18 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i18 | 0] = i22;
+ }
+ } while (0);
+ if ((i11 | 0) == 44) {
+ i11 = 0;
+ i18 = i18 & 255;
+ if (((HEAPU8[i17 + 1 | 0] | 0) + -48 | 0) >>> 0 < 10) {
+ HEAP32[i4 >> 2] = i18;
+ _sprintf(i9 | 0, 7792, i4 | 0) | 0;
+ } else {
+ HEAP32[i4 >> 2] = i18;
+ _sprintf(i9 | 0, 7784, i4 | 0) | 0;
+ }
+ _luaL_addstring(i10, i9);
+ }
+ i22 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = i22 + -1;
+ if ((i22 | 0) == 0) {
+ break;
+ } else {
+ i17 = i17 + 1 | 0;
+ }
+ }
+ }
+ i17 = HEAP32[i1 >> 2] | 0;
+ if (!(i17 >>> 0 < (HEAP32[i13 >> 2] | 0) >>> 0)) {
+ _luaL_prepbuffsize(i10, 1) | 0;
+ i17 = HEAP32[i1 >> 2] | 0;
+ }
+ HEAP32[i1 >> 2] = i17 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i17 | 0] = 34;
+ i17 = 0;
+ break;
+ }
+ case 71:
+ case 103:
+ case 102:
+ case 69:
+ case 101:
+ {
+ HEAP8[i5 + (_strlen(i5 | 0) | 0) | 0] = 0;
+ d21 = +_luaL_checknumber(i2, i15);
+ HEAPF64[tempDoublePtr >> 3] = d21;
+ HEAP32[i4 >> 2] = HEAP32[tempDoublePtr >> 2];
+ HEAP32[i4 + 4 >> 2] = HEAP32[tempDoublePtr + 4 >> 2];
+ i17 = _sprintf(i17 | 0, i5 | 0, i4 | 0) | 0;
+ break;
+ }
+ case 105:
+ case 100:
+ {
+ d21 = +_luaL_checknumber(i2, i15);
+ i18 = ~~d21;
+ d21 = d21 - +(i18 | 0);
+ if (!(d21 > -1.0 & d21 < 1.0)) {
+ _luaL_argerror(i2, i15, 7664) | 0;
+ }
+ i22 = _strlen(i5 | 0) | 0;
+ i19 = i5 + (i22 + -1) | 0;
+ i20 = HEAP8[i19] | 0;
+ HEAP8[i19] = 108;
+ HEAP8[i19 + 1 | 0] = 0;
+ HEAP8[i5 + i22 | 0] = i20;
+ HEAP8[i5 + (i22 + 1) | 0] = 0;
+ HEAP32[i4 >> 2] = i18;
+ i17 = _sprintf(i17 | 0, i5 | 0, i4 | 0) | 0;
+ break;
+ }
+ default:
+ {
+ break L3;
+ }
+ }
+ } while (0);
+ HEAP32[i1 >> 2] = (HEAP32[i1 >> 2] | 0) + i17;
+ if (i16 >>> 0 < i3 >>> 0) {
+ i19 = i15;
+ } else {
+ break L1;
+ }
+ }
+ HEAP32[i4 >> 2] = i18;
+ i22 = _luaL_error(i2, 7744, i4) | 0;
+ STACKTOP = i12;
+ return i22 | 0;
+ }
+ } while (0);
+ _luaL_pushresult(i10);
+ i22 = 1;
+ STACKTOP = i12;
+ return i22 | 0;
+}
+function _luaD_precall(i3, i17, i4) {
+ i3 = i3 | 0;
+ i17 = i17 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i2 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i8 = i1;
+ i6 = i3 + 28 | 0;
+ i2 = i3 + 8 | 0;
+ i13 = i3 + 24 | 0;
+ i14 = i3 + 32 | 0;
+ while (1) {
+ i15 = HEAP32[i6 >> 2] | 0;
+ i16 = i17;
+ i12 = i15;
+ i5 = i16 - i12 | 0;
+ i11 = HEAP32[i17 + 8 >> 2] & 63;
+ if ((i11 | 0) == 38) {
+ i11 = 4;
+ break;
+ } else if ((i11 | 0) == 22) {
+ i11 = 3;
+ break;
+ } else if ((i11 | 0) == 6) {
+ i11 = 31;
+ break;
+ }
+ i11 = _luaT_gettmbyobj(i3, i17, 16) | 0;
+ i15 = i16 - (HEAP32[i6 >> 2] | 0) | 0;
+ i16 = i11 + 8 | 0;
+ if ((HEAP32[i16 >> 2] & 15 | 0) != 6) {
+ i11 = 54;
+ break;
+ }
+ i19 = HEAP32[i2 >> 2] | 0;
+ if (i19 >>> 0 > i17 >>> 0) {
+ while (1) {
+ i18 = i19 + -16 | 0;
+ i22 = i18;
+ i21 = HEAP32[i22 + 4 >> 2] | 0;
+ i20 = i19;
+ HEAP32[i20 >> 2] = HEAP32[i22 >> 2];
+ HEAP32[i20 + 4 >> 2] = i21;
+ HEAP32[i19 + 8 >> 2] = HEAP32[i19 + -8 >> 2];
+ if (i18 >>> 0 > i17 >>> 0) {
+ i19 = i18;
+ } else {
+ break;
+ }
+ }
+ i19 = HEAP32[i2 >> 2] | 0;
+ }
+ i17 = i19 + 16 | 0;
+ HEAP32[i2 >> 2] = i17;
+ if (((HEAP32[i13 >> 2] | 0) - i17 | 0) < 16) {
+ i18 = HEAP32[i14 >> 2] | 0;
+ if ((i18 | 0) > 1e6) {
+ i11 = 60;
+ break;
+ }
+ i17 = (i17 - (HEAP32[i6 >> 2] | 0) >> 4) + 5 | 0;
+ i18 = i18 << 1;
+ i18 = (i18 | 0) > 1e6 ? 1e6 : i18;
+ i17 = (i18 | 0) < (i17 | 0) ? i17 : i18;
+ if ((i17 | 0) > 1e6) {
+ i11 = 62;
+ break;
+ }
+ _luaD_reallocstack(i3, i17);
+ }
+ i22 = HEAP32[i6 >> 2] | 0;
+ i17 = i22 + i15 | 0;
+ i19 = i11;
+ i20 = HEAP32[i19 + 4 >> 2] | 0;
+ i21 = i17;
+ HEAP32[i21 >> 2] = HEAP32[i19 >> 2];
+ HEAP32[i21 + 4 >> 2] = i20;
+ HEAP32[i22 + (i15 + 8) >> 2] = HEAP32[i16 >> 2];
+ }
+ if ((i11 | 0) == 3) {
+ i10 = i17;
+ } else if ((i11 | 0) == 4) {
+ i10 = (HEAP32[i17 >> 2] | 0) + 12 | 0;
+ } else if ((i11 | 0) == 31) {
+ i10 = HEAP32[(HEAP32[i17 >> 2] | 0) + 12 >> 2] | 0;
+ i18 = HEAP32[i2 >> 2] | 0;
+ i16 = i18;
+ i11 = i10 + 78 | 0;
+ i17 = HEAPU8[i11] | 0;
+ do {
+ if (((HEAP32[i13 >> 2] | 0) - i16 >> 4 | 0) <= (i17 | 0)) {
+ i13 = HEAP32[i14 >> 2] | 0;
+ if ((i13 | 0) > 1e6) {
+ _luaD_throw(i3, 6);
+ }
+ i12 = i17 + 5 + (i16 - i12 >> 4) | 0;
+ i13 = i13 << 1;
+ i13 = (i13 | 0) > 1e6 ? 1e6 : i13;
+ i12 = (i13 | 0) < (i12 | 0) ? i12 : i13;
+ if ((i12 | 0) > 1e6) {
+ _luaD_reallocstack(i3, 1000200);
+ _luaG_runerror(i3, 2224, i8);
+ } else {
+ _luaD_reallocstack(i3, i12);
+ i7 = HEAP32[i6 >> 2] | 0;
+ i9 = HEAP32[i2 >> 2] | 0;
+ break;
+ }
+ } else {
+ i7 = i15;
+ i9 = i18;
+ }
+ } while (0);
+ i6 = i7 + i5 | 0;
+ i22 = i9 - i6 >> 4;
+ i12 = i22 + -1 | 0;
+ i8 = i10 + 76 | 0;
+ i13 = HEAP8[i8] | 0;
+ if ((i22 | 0) > (i13 & 255 | 0)) {
+ i8 = i13;
+ } else {
+ i13 = i9;
+ while (1) {
+ i9 = i13 + 16 | 0;
+ HEAP32[i2 >> 2] = i9;
+ HEAP32[i13 + 8 >> 2] = 0;
+ i12 = i12 + 1 | 0;
+ i13 = HEAP8[i8] | 0;
+ if ((i12 | 0) < (i13 & 255 | 0)) {
+ i13 = i9;
+ } else {
+ i8 = i13;
+ break;
+ }
+ }
+ }
+ if ((HEAP8[i10 + 77 | 0] | 0) != 0) {
+ i5 = i8 & 255;
+ if (!(i8 << 24 >> 24 == 0) ? (i22 = 0 - i12 | 0, HEAP32[i2 >> 2] = i9 + 16, i19 = i9 + (i22 << 4) | 0, i20 = HEAP32[i19 + 4 >> 2] | 0, i21 = i9, HEAP32[i21 >> 2] = HEAP32[i19 >> 2], HEAP32[i21 + 4 >> 2] = i20, i22 = i9 + (i22 << 4) + 8 | 0, HEAP32[i9 + 8 >> 2] = HEAP32[i22 >> 2], HEAP32[i22 >> 2] = 0, (i8 & 255) > 1) : 0) {
+ i7 = 1;
+ do {
+ i21 = HEAP32[i2 >> 2] | 0;
+ i22 = i7 - i12 | 0;
+ HEAP32[i2 >> 2] = i21 + 16;
+ i18 = i9 + (i22 << 4) | 0;
+ i19 = HEAP32[i18 + 4 >> 2] | 0;
+ i20 = i21;
+ HEAP32[i20 >> 2] = HEAP32[i18 >> 2];
+ HEAP32[i20 + 4 >> 2] = i19;
+ i22 = i9 + (i22 << 4) + 8 | 0;
+ HEAP32[i21 + 8 >> 2] = HEAP32[i22 >> 2];
+ HEAP32[i22 >> 2] = 0;
+ i7 = i7 + 1 | 0;
+ } while ((i7 | 0) < (i5 | 0));
+ }
+ } else {
+ i9 = i7 + (i5 + 16) | 0;
+ }
+ i7 = i3 + 16 | 0;
+ i5 = HEAP32[(HEAP32[i7 >> 2] | 0) + 12 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ i5 = _luaE_extendCI(i3) | 0;
+ }
+ HEAP32[i7 >> 2] = i5;
+ HEAP16[i5 + 16 >> 1] = i4;
+ HEAP32[i5 >> 2] = i6;
+ HEAP32[i5 + 24 >> 2] = i9;
+ i22 = i9 + (HEAPU8[i11] << 4) | 0;
+ HEAP32[i5 + 4 >> 2] = i22;
+ i4 = i5 + 28 | 0;
+ HEAP32[i4 >> 2] = HEAP32[i10 + 12 >> 2];
+ i6 = i5 + 18 | 0;
+ HEAP8[i6] = 1;
+ HEAP32[i2 >> 2] = i22;
+ if ((HEAP32[(HEAP32[i3 + 12 >> 2] | 0) + 12 >> 2] | 0) > 0) {
+ _luaC_step(i3);
+ }
+ if ((HEAP8[i3 + 40 | 0] & 1) == 0) {
+ i22 = 0;
+ STACKTOP = i1;
+ return i22 | 0;
+ }
+ HEAP32[i4 >> 2] = (HEAP32[i4 >> 2] | 0) + 4;
+ i2 = HEAP32[i5 + 8 >> 2] | 0;
+ if (!((HEAP8[i2 + 18 | 0] & 1) == 0) ? (HEAP32[(HEAP32[i2 + 28 >> 2] | 0) + -4 >> 2] & 63 | 0) == 30 : 0) {
+ HEAP8[i6] = HEAPU8[i6] | 64;
+ i2 = 4;
+ } else {
+ i2 = 0;
+ }
+ _luaD_hook(i3, i2, -1);
+ HEAP32[i4 >> 2] = (HEAP32[i4 >> 2] | 0) + -4;
+ i22 = 0;
+ STACKTOP = i1;
+ return i22 | 0;
+ } else if ((i11 | 0) == 54) {
+ _luaG_typeerror(i3, i17, 2520);
+ } else if ((i11 | 0) == 60) {
+ _luaD_throw(i3, 6);
+ } else if ((i11 | 0) == 62) {
+ _luaD_reallocstack(i3, 1000200);
+ _luaG_runerror(i3, 2224, i8);
+ }
+ i7 = HEAP32[i10 >> 2] | 0;
+ i9 = HEAP32[i2 >> 2] | 0;
+ do {
+ if (((HEAP32[i13 >> 2] | 0) - i9 | 0) < 336) {
+ i10 = HEAP32[i14 >> 2] | 0;
+ if ((i10 | 0) > 1e6) {
+ _luaD_throw(i3, 6);
+ }
+ i9 = (i9 - i12 >> 4) + 25 | 0;
+ i10 = i10 << 1;
+ i10 = (i10 | 0) > 1e6 ? 1e6 : i10;
+ i9 = (i10 | 0) < (i9 | 0) ? i9 : i10;
+ if ((i9 | 0) > 1e6) {
+ _luaD_reallocstack(i3, 1000200);
+ _luaG_runerror(i3, 2224, i8);
+ } else {
+ _luaD_reallocstack(i3, i9);
+ break;
+ }
+ }
+ } while (0);
+ i8 = i3 + 16 | 0;
+ i9 = HEAP32[(HEAP32[i8 >> 2] | 0) + 12 >> 2] | 0;
+ if ((i9 | 0) == 0) {
+ i9 = _luaE_extendCI(i3) | 0;
+ }
+ HEAP32[i8 >> 2] = i9;
+ HEAP16[i9 + 16 >> 1] = i4;
+ HEAP32[i9 >> 2] = (HEAP32[i6 >> 2] | 0) + i5;
+ HEAP32[i9 + 4 >> 2] = (HEAP32[i2 >> 2] | 0) + 320;
+ HEAP8[i9 + 18 | 0] = 0;
+ if ((HEAP32[(HEAP32[i3 + 12 >> 2] | 0) + 12 >> 2] | 0) > 0) {
+ _luaC_step(i3);
+ }
+ i5 = i3 + 40 | 0;
+ if (!((HEAP8[i5] & 1) == 0)) {
+ _luaD_hook(i3, 0, -1);
+ }
+ i7 = FUNCTION_TABLE_ii[i7 & 255](i3) | 0;
+ i7 = (HEAP32[i2 >> 2] | 0) + (0 - i7 << 4) | 0;
+ i4 = HEAP32[i8 >> 2] | 0;
+ i5 = HEAPU8[i5] | 0;
+ if ((i5 & 6 | 0) == 0) {
+ i5 = i7;
+ i6 = i4 + 8 | 0;
+ } else {
+ if ((i5 & 2 | 0) == 0) {
+ i5 = i7;
+ } else {
+ i5 = i7 - (HEAP32[i6 >> 2] | 0) | 0;
+ _luaD_hook(i3, 1, -1);
+ i5 = (HEAP32[i6 >> 2] | 0) + i5 | 0;
+ }
+ i6 = i4 + 8 | 0;
+ HEAP32[i3 + 20 >> 2] = HEAP32[(HEAP32[i6 >> 2] | 0) + 28 >> 2];
+ }
+ i3 = HEAP32[i4 >> 2] | 0;
+ i4 = HEAP16[i4 + 16 >> 1] | 0;
+ HEAP32[i8 >> 2] = HEAP32[i6 >> 2];
+ L82 : do {
+ if (!(i4 << 16 >> 16 == 0)) {
+ i4 = i4 << 16 >> 16;
+ while (1) {
+ if (!(i5 >>> 0 < (HEAP32[i2 >> 2] | 0) >>> 0)) {
+ break;
+ }
+ i6 = i3 + 16 | 0;
+ i20 = i5;
+ i21 = HEAP32[i20 + 4 >> 2] | 0;
+ i22 = i3;
+ HEAP32[i22 >> 2] = HEAP32[i20 >> 2];
+ HEAP32[i22 + 4 >> 2] = i21;
+ HEAP32[i3 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ i4 = i4 + -1 | 0;
+ if ((i4 | 0) == 0) {
+ i3 = i6;
+ break L82;
+ }
+ i5 = i5 + 16 | 0;
+ i3 = i6;
+ }
+ if ((i4 | 0) > 0) {
+ i5 = i4;
+ i6 = i3;
+ while (1) {
+ i5 = i5 + -1 | 0;
+ HEAP32[i6 + 8 >> 2] = 0;
+ if ((i5 | 0) <= 0) {
+ break;
+ } else {
+ i6 = i6 + 16 | 0;
+ }
+ }
+ i3 = i3 + (i4 << 4) | 0;
+ }
+ }
+ } while (0);
+ HEAP32[i2 >> 2] = i3;
+ i22 = 1;
+ STACKTOP = i1;
+ return i22 | 0;
+}
+function _lua_getinfo(i1, i6, i29) {
+ i1 = i1 | 0;
+ i6 = i6 | 0;
+ i29 = i29 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i30 = 0, i31 = 0, i32 = 0, i33 = 0, i34 = 0, i35 = 0, i36 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i2 = i3;
+ if ((HEAP8[i6] | 0) == 62) {
+ i10 = i1 + 8 | 0;
+ i7 = (HEAP32[i10 >> 2] | 0) + -16 | 0;
+ HEAP32[i10 >> 2] = i7;
+ i6 = i6 + 1 | 0;
+ i10 = 0;
+ } else {
+ i7 = HEAP32[i29 + 96 >> 2] | 0;
+ i10 = i7;
+ i7 = HEAP32[i7 >> 2] | 0;
+ }
+ i8 = i7 + 8 | 0;
+ if ((HEAP32[i8 >> 2] & 31 | 0) == 6) {
+ i9 = HEAP32[i7 >> 2] | 0;
+ } else {
+ i9 = 0;
+ }
+ i34 = HEAP8[i6] | 0;
+ L8 : do {
+ if (i34 << 24 >> 24 == 0) {
+ i33 = 1;
+ } else {
+ i12 = (i9 | 0) == 0;
+ i27 = i29 + 16 | 0;
+ i28 = i29 + 24 | 0;
+ i21 = i29 + 28 | 0;
+ i25 = i29 + 12 | 0;
+ i26 = i29 + 36 | 0;
+ i19 = i9 + 4 | 0;
+ i24 = i9 + 12 | 0;
+ i18 = (i10 | 0) == 0;
+ i23 = i29 + 20 | 0;
+ i17 = i10 + 18 | 0;
+ i22 = i10 + 28 | 0;
+ i15 = i29 + 32 | 0;
+ i14 = i29 + 34 | 0;
+ i13 = i29 + 33 | 0;
+ i11 = i9 + 6 | 0;
+ i16 = i29 + 35 | 0;
+ i20 = i29 + 8 | 0;
+ i30 = i29 + 4 | 0;
+ i29 = i10 + 8 | 0;
+ i31 = i1 + 12 | 0;
+ i32 = i6;
+ i33 = 1;
+ while (1) {
+ L12 : do {
+ switch (i34 << 24 >> 24 | 0) {
+ case 116:
+ {
+ if (i18) {
+ i34 = 0;
+ } else {
+ i34 = HEAPU8[i17] & 64;
+ }
+ HEAP8[i16] = i34;
+ break;
+ }
+ case 110:
+ {
+ L18 : do {
+ if ((!i18 ? (HEAP8[i17] & 64) == 0 : 0) ? (i5 = HEAP32[i29 >> 2] | 0, !((HEAP8[i5 + 18 | 0] & 1) == 0)) : 0) {
+ i36 = HEAP32[(HEAP32[HEAP32[i5 >> 2] >> 2] | 0) + 12 >> 2] | 0;
+ i35 = HEAP32[i36 + 12 >> 2] | 0;
+ i34 = ((HEAP32[i5 + 28 >> 2] | 0) - i35 >> 2) + -1 | 0;
+ i35 = HEAP32[i35 + (i34 << 2) >> 2] | 0;
+ switch (i35 & 63 | 0) {
+ case 10:
+ case 8:
+ {
+ i34 = 1;
+ i4 = 46;
+ break;
+ }
+ case 24:
+ {
+ i34 = 5;
+ i4 = 46;
+ break;
+ }
+ case 13:
+ {
+ i34 = 6;
+ i4 = 46;
+ break;
+ }
+ case 14:
+ {
+ i34 = 7;
+ i4 = 46;
+ break;
+ }
+ case 15:
+ {
+ i34 = 8;
+ i4 = 46;
+ break;
+ }
+ case 16:
+ {
+ i34 = 9;
+ i4 = 46;
+ break;
+ }
+ case 17:
+ {
+ i34 = 10;
+ i4 = 46;
+ break;
+ }
+ case 18:
+ {
+ i34 = 11;
+ i4 = 46;
+ break;
+ }
+ case 19:
+ {
+ i34 = 12;
+ i4 = 46;
+ break;
+ }
+ case 21:
+ {
+ i34 = 4;
+ i4 = 46;
+ break;
+ }
+ case 25:
+ {
+ i34 = 13;
+ i4 = 46;
+ break;
+ }
+ case 26:
+ {
+ i34 = 14;
+ i4 = 46;
+ break;
+ }
+ case 22:
+ {
+ i34 = 15;
+ i4 = 46;
+ break;
+ }
+ case 7:
+ case 6:
+ case 12:
+ {
+ i34 = 0;
+ i4 = 46;
+ break;
+ }
+ case 34:
+ {
+ i34 = 2120;
+ i35 = 2120;
+ break;
+ }
+ case 30:
+ case 29:
+ {
+ i36 = _getobjname(i36, i34, i35 >>> 6 & 255, i30) | 0;
+ HEAP32[i20 >> 2] = i36;
+ if ((i36 | 0) == 0) {
+ break L18;
+ } else {
+ break L12;
+ }
+ }
+ default:
+ {
+ i4 = 47;
+ break L18;
+ }
+ }
+ if ((i4 | 0) == 46) {
+ i4 = 0;
+ i34 = (HEAP32[(HEAP32[i31 >> 2] | 0) + (i34 << 2) + 184 >> 2] | 0) + 16 | 0;
+ i35 = 2136;
+ }
+ HEAP32[i30 >> 2] = i34;
+ HEAP32[i20 >> 2] = i35;
+ break L12;
+ } else {
+ i4 = 47;
+ }
+ } while (0);
+ if ((i4 | 0) == 47) {
+ i4 = 0;
+ HEAP32[i20 >> 2] = 0;
+ }
+ HEAP32[i20 >> 2] = 2112;
+ HEAP32[i30 >> 2] = 0;
+ break;
+ }
+ case 108:
+ {
+ if (!i18 ? !((HEAP8[i17] & 1) == 0) : 0) {
+ i35 = HEAP32[(HEAP32[HEAP32[i10 >> 2] >> 2] | 0) + 12 >> 2] | 0;
+ i34 = HEAP32[i35 + 20 >> 2] | 0;
+ if ((i34 | 0) == 0) {
+ i34 = 0;
+ } else {
+ i34 = HEAP32[i34 + (((HEAP32[i22 >> 2] | 0) - (HEAP32[i35 + 12 >> 2] | 0) >> 2) + -1 << 2) >> 2] | 0;
+ }
+ } else {
+ i34 = -1;
+ }
+ HEAP32[i23 >> 2] = i34;
+ break;
+ }
+ case 83:
+ {
+ if (!i12 ? (HEAP8[i19] | 0) != 38 : 0) {
+ i34 = HEAP32[i24 >> 2] | 0;
+ i35 = HEAP32[i34 + 36 >> 2] | 0;
+ if ((i35 | 0) == 0) {
+ i35 = 2168;
+ } else {
+ i35 = i35 + 16 | 0;
+ }
+ HEAP32[i27 >> 2] = i35;
+ i36 = HEAP32[i34 + 64 >> 2] | 0;
+ HEAP32[i28 >> 2] = i36;
+ HEAP32[i21 >> 2] = HEAP32[i34 + 68 >> 2];
+ i34 = (i36 | 0) == 0 ? 2176 : 2184;
+ } else {
+ HEAP32[i27 >> 2] = 2152;
+ HEAP32[i28 >> 2] = -1;
+ HEAP32[i21 >> 2] = -1;
+ i35 = 2152;
+ i34 = 2160;
+ }
+ HEAP32[i25 >> 2] = i34;
+ _luaO_chunkid(i26, i35, 60);
+ break;
+ }
+ case 117:
+ {
+ if (!i12) {
+ HEAP8[i15] = HEAP8[i11] | 0;
+ if ((HEAP8[i19] | 0) != 38) {
+ HEAP8[i14] = HEAP8[(HEAP32[i24 >> 2] | 0) + 77 | 0] | 0;
+ HEAP8[i13] = HEAP8[(HEAP32[i24 >> 2] | 0) + 76 | 0] | 0;
+ break L12;
+ }
+ } else {
+ HEAP8[i15] = 0;
+ }
+ HEAP8[i14] = 1;
+ HEAP8[i13] = 0;
+ break;
+ }
+ case 102:
+ case 76:
+ {
+ break;
+ }
+ default:
+ {
+ i33 = 0;
+ }
+ }
+ } while (0);
+ i32 = i32 + 1 | 0;
+ i34 = HEAP8[i32] | 0;
+ if (i34 << 24 >> 24 == 0) {
+ break L8;
+ }
+ }
+ }
+ } while (0);
+ if ((_strchr(i6, 102) | 0) != 0) {
+ i36 = i1 + 8 | 0;
+ i35 = HEAP32[i36 >> 2] | 0;
+ i31 = i7;
+ i32 = HEAP32[i31 + 4 >> 2] | 0;
+ i34 = i35;
+ HEAP32[i34 >> 2] = HEAP32[i31 >> 2];
+ HEAP32[i34 + 4 >> 2] = i32;
+ HEAP32[i35 + 8 >> 2] = HEAP32[i8 >> 2];
+ HEAP32[i36 >> 2] = (HEAP32[i36 >> 2] | 0) + 16;
+ }
+ if ((_strchr(i6, 76) | 0) == 0) {
+ STACKTOP = i3;
+ return i33 | 0;
+ }
+ if ((i9 | 0) != 0 ? (HEAP8[i9 + 4 | 0] | 0) != 38 : 0) {
+ i6 = i9 + 12 | 0;
+ i5 = HEAP32[(HEAP32[i6 >> 2] | 0) + 20 >> 2] | 0;
+ i4 = _luaH_new(i1) | 0;
+ i36 = i1 + 8 | 0;
+ i35 = HEAP32[i36 >> 2] | 0;
+ HEAP32[i35 >> 2] = i4;
+ HEAP32[i35 + 8 >> 2] = 69;
+ HEAP32[i36 >> 2] = (HEAP32[i36 >> 2] | 0) + 16;
+ HEAP32[i2 >> 2] = 1;
+ HEAP32[i2 + 8 >> 2] = 1;
+ if ((HEAP32[(HEAP32[i6 >> 2] | 0) + 52 >> 2] | 0) > 0) {
+ i7 = 0;
+ } else {
+ STACKTOP = i3;
+ return i33 | 0;
+ }
+ do {
+ _luaH_setint(i1, i4, HEAP32[i5 + (i7 << 2) >> 2] | 0, i2);
+ i7 = i7 + 1 | 0;
+ } while ((i7 | 0) < (HEAP32[(HEAP32[i6 >> 2] | 0) + 52 >> 2] | 0));
+ STACKTOP = i3;
+ return i33 | 0;
+ }
+ i36 = i1 + 8 | 0;
+ i35 = HEAP32[i36 >> 2] | 0;
+ HEAP32[i35 + 8 >> 2] = 0;
+ HEAP32[i36 >> 2] = i35 + 16;
+ STACKTOP = i3;
+ return i33 | 0;
+}
+function _read_long_string(i3, i1, i5) {
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0;
+ i2 = STACKTOP;
+ i14 = HEAP32[i3 >> 2] | 0;
+ i4 = i3 + 60 | 0;
+ i13 = HEAP32[i4 >> 2] | 0;
+ i15 = i13 + 4 | 0;
+ i16 = HEAP32[i15 >> 2] | 0;
+ i10 = i13 + 8 | 0;
+ i12 = HEAP32[i10 >> 2] | 0;
+ do {
+ if ((i16 + 1 | 0) >>> 0 > i12 >>> 0) {
+ if (i12 >>> 0 > 2147483645) {
+ _lexerror(i3, 12368, 0);
+ }
+ i16 = i12 << 1;
+ i17 = HEAP32[i3 + 52 >> 2] | 0;
+ if ((i16 | 0) == -2) {
+ _luaM_toobig(i17);
+ } else {
+ i8 = _luaM_realloc_(i17, HEAP32[i13 >> 2] | 0, i12, i16) | 0;
+ HEAP32[i13 >> 2] = i8;
+ HEAP32[i10 >> 2] = i16;
+ i9 = HEAP32[i15 >> 2] | 0;
+ break;
+ }
+ } else {
+ i9 = i16;
+ i8 = HEAP32[i13 >> 2] | 0;
+ }
+ } while (0);
+ HEAP32[i15 >> 2] = i9 + 1;
+ HEAP8[i8 + i9 | 0] = i14;
+ i9 = i3 + 56 | 0;
+ i8 = HEAP32[i9 >> 2] | 0;
+ i18 = HEAP32[i8 >> 2] | 0;
+ HEAP32[i8 >> 2] = i18 + -1;
+ if ((i18 | 0) == 0) {
+ i12 = _luaZ_fill(i8) | 0;
+ } else {
+ i18 = i8 + 4 | 0;
+ i12 = HEAP32[i18 >> 2] | 0;
+ HEAP32[i18 >> 2] = i12 + 1;
+ i12 = HEAPU8[i12] | 0;
+ }
+ HEAP32[i3 >> 2] = i12;
+ if ((i12 | 0) == 13 | (i12 | 0) == 10) {
+ _inclinenumber(i3);
+ i11 = 13;
+ }
+ L17 : while (1) {
+ if ((i11 | 0) == 13) {
+ i11 = 0;
+ i12 = HEAP32[i3 >> 2] | 0;
+ }
+ i8 = (i1 | 0) == 0;
+ i10 = i3 + 52 | 0;
+ L21 : do {
+ if (i8) {
+ while (1) {
+ if ((i12 | 0) == 13 | (i12 | 0) == 10) {
+ break L21;
+ } else if ((i12 | 0) == 93) {
+ i11 = 22;
+ break L21;
+ } else if ((i12 | 0) == -1) {
+ i11 = 21;
+ break L17;
+ }
+ i12 = HEAP32[i9 >> 2] | 0;
+ i18 = HEAP32[i12 >> 2] | 0;
+ HEAP32[i12 >> 2] = i18 + -1;
+ if ((i18 | 0) == 0) {
+ i12 = _luaZ_fill(i12) | 0;
+ } else {
+ i18 = i12 + 4 | 0;
+ i12 = HEAP32[i18 >> 2] | 0;
+ HEAP32[i18 >> 2] = i12 + 1;
+ i12 = HEAPU8[i12] | 0;
+ }
+ HEAP32[i3 >> 2] = i12;
+ }
+ } else {
+ while (1) {
+ if ((i12 | 0) == 13 | (i12 | 0) == 10) {
+ break L21;
+ } else if ((i12 | 0) == 93) {
+ i11 = 22;
+ break L21;
+ } else if ((i12 | 0) == -1) {
+ i11 = 21;
+ break L17;
+ }
+ i14 = HEAP32[i4 >> 2] | 0;
+ i13 = i14 + 4 | 0;
+ i17 = HEAP32[i13 >> 2] | 0;
+ i16 = i14 + 8 | 0;
+ i15 = HEAP32[i16 >> 2] | 0;
+ if ((i17 + 1 | 0) >>> 0 > i15 >>> 0) {
+ if (i15 >>> 0 > 2147483645) {
+ i11 = 46;
+ break L17;
+ }
+ i17 = i15 << 1;
+ i18 = HEAP32[i10 >> 2] | 0;
+ if ((i17 | 0) == -2) {
+ i11 = 48;
+ break L17;
+ }
+ i18 = _luaM_realloc_(i18, HEAP32[i14 >> 2] | 0, i15, i17) | 0;
+ HEAP32[i14 >> 2] = i18;
+ HEAP32[i16 >> 2] = i17;
+ i17 = HEAP32[i13 >> 2] | 0;
+ i14 = i18;
+ } else {
+ i14 = HEAP32[i14 >> 2] | 0;
+ }
+ HEAP32[i13 >> 2] = i17 + 1;
+ HEAP8[i14 + i17 | 0] = i12;
+ i12 = HEAP32[i9 >> 2] | 0;
+ i18 = HEAP32[i12 >> 2] | 0;
+ HEAP32[i12 >> 2] = i18 + -1;
+ if ((i18 | 0) == 0) {
+ i12 = _luaZ_fill(i12) | 0;
+ } else {
+ i18 = i12 + 4 | 0;
+ i12 = HEAP32[i18 >> 2] | 0;
+ HEAP32[i18 >> 2] = i12 + 1;
+ i12 = HEAPU8[i12] | 0;
+ }
+ HEAP32[i3 >> 2] = i12;
+ }
+ }
+ } while (0);
+ if ((i11 | 0) == 22) {
+ if ((_skip_sep(i3) | 0) == (i5 | 0)) {
+ i11 = 23;
+ break;
+ } else {
+ i11 = 13;
+ continue;
+ }
+ }
+ i12 = HEAP32[i4 >> 2] | 0;
+ i11 = i12 + 4 | 0;
+ i15 = HEAP32[i11 >> 2] | 0;
+ i14 = i12 + 8 | 0;
+ i13 = HEAP32[i14 >> 2] | 0;
+ if ((i15 + 1 | 0) >>> 0 > i13 >>> 0) {
+ if (i13 >>> 0 > 2147483645) {
+ i11 = 37;
+ break;
+ }
+ i15 = i13 << 1;
+ i10 = HEAP32[i10 >> 2] | 0;
+ if ((i15 | 0) == -2) {
+ i11 = 39;
+ break;
+ }
+ i10 = _luaM_realloc_(i10, HEAP32[i12 >> 2] | 0, i13, i15) | 0;
+ HEAP32[i12 >> 2] = i10;
+ HEAP32[i14 >> 2] = i15;
+ i15 = HEAP32[i11 >> 2] | 0;
+ } else {
+ i10 = HEAP32[i12 >> 2] | 0;
+ }
+ HEAP32[i11 >> 2] = i15 + 1;
+ HEAP8[i10 + i15 | 0] = 10;
+ _inclinenumber(i3);
+ if (!i8) {
+ i11 = 13;
+ continue;
+ }
+ HEAP32[(HEAP32[i4 >> 2] | 0) + 4 >> 2] = 0;
+ i11 = 13;
+ }
+ if ((i11 | 0) == 21) {
+ _lexerror(i3, (i1 | 0) != 0 ? 12512 : 12536, 286);
+ } else if ((i11 | 0) == 23) {
+ i15 = HEAP32[i3 >> 2] | 0;
+ i13 = HEAP32[i4 >> 2] | 0;
+ i14 = i13 + 4 | 0;
+ i16 = HEAP32[i14 >> 2] | 0;
+ i11 = i13 + 8 | 0;
+ i12 = HEAP32[i11 >> 2] | 0;
+ do {
+ if ((i16 + 1 | 0) >>> 0 > i12 >>> 0) {
+ if (i12 >>> 0 > 2147483645) {
+ _lexerror(i3, 12368, 0);
+ }
+ i17 = i12 << 1;
+ i16 = HEAP32[i10 >> 2] | 0;
+ if ((i17 | 0) == -2) {
+ _luaM_toobig(i16);
+ } else {
+ i6 = _luaM_realloc_(i16, HEAP32[i13 >> 2] | 0, i12, i17) | 0;
+ HEAP32[i13 >> 2] = i6;
+ HEAP32[i11 >> 2] = i17;
+ i7 = HEAP32[i14 >> 2] | 0;
+ break;
+ }
+ } else {
+ i7 = i16;
+ i6 = HEAP32[i13 >> 2] | 0;
+ }
+ } while (0);
+ HEAP32[i14 >> 2] = i7 + 1;
+ HEAP8[i6 + i7 | 0] = i15;
+ i6 = HEAP32[i9 >> 2] | 0;
+ i18 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i6 >> 2] = i18 + -1;
+ if ((i18 | 0) == 0) {
+ i6 = _luaZ_fill(i6) | 0;
+ } else {
+ i18 = i6 + 4 | 0;
+ i6 = HEAP32[i18 >> 2] | 0;
+ HEAP32[i18 >> 2] = i6 + 1;
+ i6 = HEAPU8[i6] | 0;
+ }
+ HEAP32[i3 >> 2] = i6;
+ if (i8) {
+ STACKTOP = i2;
+ return;
+ }
+ i4 = HEAP32[i4 >> 2] | 0;
+ i5 = i5 + 2 | 0;
+ i6 = HEAP32[i10 >> 2] | 0;
+ i5 = _luaS_newlstr(i6, (HEAP32[i4 >> 2] | 0) + i5 | 0, (HEAP32[i4 + 4 >> 2] | 0) - (i5 << 1) | 0) | 0;
+ i4 = i6 + 8 | 0;
+ i7 = HEAP32[i4 >> 2] | 0;
+ HEAP32[i4 >> 2] = i7 + 16;
+ HEAP32[i7 >> 2] = i5;
+ HEAP32[i7 + 8 >> 2] = HEAPU8[i5 + 4 | 0] | 0 | 64;
+ i7 = _luaH_set(i6, HEAP32[(HEAP32[i3 + 48 >> 2] | 0) + 4 >> 2] | 0, (HEAP32[i4 >> 2] | 0) + -16 | 0) | 0;
+ i3 = i7 + 8 | 0;
+ if ((HEAP32[i3 >> 2] | 0) == 0 ? (HEAP32[i7 >> 2] = 1, HEAP32[i3 >> 2] = 1, (HEAP32[(HEAP32[i6 + 12 >> 2] | 0) + 12 >> 2] | 0) > 0) : 0) {
+ _luaC_step(i6);
+ }
+ HEAP32[i4 >> 2] = (HEAP32[i4 >> 2] | 0) + -16;
+ HEAP32[i1 >> 2] = i5;
+ STACKTOP = i2;
+ return;
+ } else if ((i11 | 0) == 37) {
+ _lexerror(i3, 12368, 0);
+ } else if ((i11 | 0) == 39) {
+ _luaM_toobig(i10);
+ } else if ((i11 | 0) == 46) {
+ _lexerror(i3, 12368, 0);
+ } else if ((i11 | 0) == 48) {
+ _luaM_toobig(i18);
+ }
+}
+function _try_realloc_chunk(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0;
+ i2 = STACKTOP;
+ i4 = i1 + 4 | 0;
+ i6 = HEAP32[i4 >> 2] | 0;
+ i8 = i6 & -8;
+ i5 = i1 + i8 | 0;
+ i10 = HEAP32[12928 >> 2] | 0;
+ if (i1 >>> 0 < i10 >>> 0) {
+ _abort();
+ }
+ i12 = i6 & 3;
+ if (!((i12 | 0) != 1 & i1 >>> 0 < i5 >>> 0)) {
+ _abort();
+ }
+ i7 = i1 + (i8 | 4) | 0;
+ i13 = HEAP32[i7 >> 2] | 0;
+ if ((i13 & 1 | 0) == 0) {
+ _abort();
+ }
+ if ((i12 | 0) == 0) {
+ if (i3 >>> 0 < 256) {
+ i15 = 0;
+ STACKTOP = i2;
+ return i15 | 0;
+ }
+ if (!(i8 >>> 0 < (i3 + 4 | 0) >>> 0) ? !((i8 - i3 | 0) >>> 0 > HEAP32[13392 >> 2] << 1 >>> 0) : 0) {
+ i15 = i1;
+ STACKTOP = i2;
+ return i15 | 0;
+ }
+ i15 = 0;
+ STACKTOP = i2;
+ return i15 | 0;
+ }
+ if (!(i8 >>> 0 < i3 >>> 0)) {
+ i5 = i8 - i3 | 0;
+ if (!(i5 >>> 0 > 15)) {
+ i15 = i1;
+ STACKTOP = i2;
+ return i15 | 0;
+ }
+ HEAP32[i4 >> 2] = i6 & 1 | i3 | 2;
+ HEAP32[i1 + (i3 + 4) >> 2] = i5 | 3;
+ HEAP32[i7 >> 2] = HEAP32[i7 >> 2] | 1;
+ _dispose_chunk(i1 + i3 | 0, i5);
+ i15 = i1;
+ STACKTOP = i2;
+ return i15 | 0;
+ }
+ if ((i5 | 0) == (HEAP32[12936 >> 2] | 0)) {
+ i5 = (HEAP32[12924 >> 2] | 0) + i8 | 0;
+ if (!(i5 >>> 0 > i3 >>> 0)) {
+ i15 = 0;
+ STACKTOP = i2;
+ return i15 | 0;
+ }
+ i15 = i5 - i3 | 0;
+ HEAP32[i4 >> 2] = i6 & 1 | i3 | 2;
+ HEAP32[i1 + (i3 + 4) >> 2] = i15 | 1;
+ HEAP32[12936 >> 2] = i1 + i3;
+ HEAP32[12924 >> 2] = i15;
+ i15 = i1;
+ STACKTOP = i2;
+ return i15 | 0;
+ }
+ if ((i5 | 0) == (HEAP32[12932 >> 2] | 0)) {
+ i7 = (HEAP32[12920 >> 2] | 0) + i8 | 0;
+ if (i7 >>> 0 < i3 >>> 0) {
+ i15 = 0;
+ STACKTOP = i2;
+ return i15 | 0;
+ }
+ i5 = i7 - i3 | 0;
+ if (i5 >>> 0 > 15) {
+ HEAP32[i4 >> 2] = i6 & 1 | i3 | 2;
+ HEAP32[i1 + (i3 + 4) >> 2] = i5 | 1;
+ HEAP32[i1 + i7 >> 2] = i5;
+ i15 = i1 + (i7 + 4) | 0;
+ HEAP32[i15 >> 2] = HEAP32[i15 >> 2] & -2;
+ i3 = i1 + i3 | 0;
+ } else {
+ HEAP32[i4 >> 2] = i6 & 1 | i7 | 2;
+ i3 = i1 + (i7 + 4) | 0;
+ HEAP32[i3 >> 2] = HEAP32[i3 >> 2] | 1;
+ i3 = 0;
+ i5 = 0;
+ }
+ HEAP32[12920 >> 2] = i5;
+ HEAP32[12932 >> 2] = i3;
+ i15 = i1;
+ STACKTOP = i2;
+ return i15 | 0;
+ }
+ if ((i13 & 2 | 0) != 0) {
+ i15 = 0;
+ STACKTOP = i2;
+ return i15 | 0;
+ }
+ i7 = (i13 & -8) + i8 | 0;
+ if (i7 >>> 0 < i3 >>> 0) {
+ i15 = 0;
+ STACKTOP = i2;
+ return i15 | 0;
+ }
+ i6 = i7 - i3 | 0;
+ i12 = i13 >>> 3;
+ do {
+ if (!(i13 >>> 0 < 256)) {
+ i11 = HEAP32[i1 + (i8 + 24) >> 2] | 0;
+ i13 = HEAP32[i1 + (i8 + 12) >> 2] | 0;
+ do {
+ if ((i13 | 0) == (i5 | 0)) {
+ i13 = i1 + (i8 + 20) | 0;
+ i12 = HEAP32[i13 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ i13 = i1 + (i8 + 16) | 0;
+ i12 = HEAP32[i13 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ i9 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i15 = i12 + 20 | 0;
+ i14 = HEAP32[i15 >> 2] | 0;
+ if ((i14 | 0) != 0) {
+ i12 = i14;
+ i13 = i15;
+ continue;
+ }
+ i15 = i12 + 16 | 0;
+ i14 = HEAP32[i15 >> 2] | 0;
+ if ((i14 | 0) == 0) {
+ break;
+ } else {
+ i12 = i14;
+ i13 = i15;
+ }
+ }
+ if (i13 >>> 0 < i10 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i13 >> 2] = 0;
+ i9 = i12;
+ break;
+ }
+ } else {
+ i12 = HEAP32[i1 + (i8 + 8) >> 2] | 0;
+ if (i12 >>> 0 < i10 >>> 0) {
+ _abort();
+ }
+ i14 = i12 + 12 | 0;
+ if ((HEAP32[i14 >> 2] | 0) != (i5 | 0)) {
+ _abort();
+ }
+ i10 = i13 + 8 | 0;
+ if ((HEAP32[i10 >> 2] | 0) == (i5 | 0)) {
+ HEAP32[i14 >> 2] = i13;
+ HEAP32[i10 >> 2] = i12;
+ i9 = i13;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ if ((i11 | 0) != 0) {
+ i10 = HEAP32[i1 + (i8 + 28) >> 2] | 0;
+ i12 = 13216 + (i10 << 2) | 0;
+ if ((i5 | 0) == (HEAP32[i12 >> 2] | 0)) {
+ HEAP32[i12 >> 2] = i9;
+ if ((i9 | 0) == 0) {
+ HEAP32[12916 >> 2] = HEAP32[12916 >> 2] & ~(1 << i10);
+ break;
+ }
+ } else {
+ if (i11 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i10 = i11 + 16 | 0;
+ if ((HEAP32[i10 >> 2] | 0) == (i5 | 0)) {
+ HEAP32[i10 >> 2] = i9;
+ } else {
+ HEAP32[i11 + 20 >> 2] = i9;
+ }
+ if ((i9 | 0) == 0) {
+ break;
+ }
+ }
+ if (i9 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i9 + 24 >> 2] = i11;
+ i5 = HEAP32[i1 + (i8 + 16) >> 2] | 0;
+ do {
+ if ((i5 | 0) != 0) {
+ if (i5 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i9 + 16 >> 2] = i5;
+ HEAP32[i5 + 24 >> 2] = i9;
+ break;
+ }
+ }
+ } while (0);
+ i5 = HEAP32[i1 + (i8 + 20) >> 2] | 0;
+ if ((i5 | 0) != 0) {
+ if (i5 >>> 0 < (HEAP32[12928 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i9 + 20 >> 2] = i5;
+ HEAP32[i5 + 24 >> 2] = i9;
+ break;
+ }
+ }
+ }
+ } else {
+ i9 = HEAP32[i1 + (i8 + 8) >> 2] | 0;
+ i8 = HEAP32[i1 + (i8 + 12) >> 2] | 0;
+ i13 = 12952 + (i12 << 1 << 2) | 0;
+ if ((i9 | 0) != (i13 | 0)) {
+ if (i9 >>> 0 < i10 >>> 0) {
+ _abort();
+ }
+ if ((HEAP32[i9 + 12 >> 2] | 0) != (i5 | 0)) {
+ _abort();
+ }
+ }
+ if ((i8 | 0) == (i9 | 0)) {
+ HEAP32[3228] = HEAP32[3228] & ~(1 << i12);
+ break;
+ }
+ if ((i8 | 0) != (i13 | 0)) {
+ if (i8 >>> 0 < i10 >>> 0) {
+ _abort();
+ }
+ i10 = i8 + 8 | 0;
+ if ((HEAP32[i10 >> 2] | 0) == (i5 | 0)) {
+ i11 = i10;
+ } else {
+ _abort();
+ }
+ } else {
+ i11 = i8 + 8 | 0;
+ }
+ HEAP32[i9 + 12 >> 2] = i8;
+ HEAP32[i11 >> 2] = i9;
+ }
+ } while (0);
+ if (i6 >>> 0 < 16) {
+ HEAP32[i4 >> 2] = i7 | HEAP32[i4 >> 2] & 1 | 2;
+ i15 = i1 + (i7 | 4) | 0;
+ HEAP32[i15 >> 2] = HEAP32[i15 >> 2] | 1;
+ i15 = i1;
+ STACKTOP = i2;
+ return i15 | 0;
+ } else {
+ HEAP32[i4 >> 2] = HEAP32[i4 >> 2] & 1 | i3 | 2;
+ HEAP32[i1 + (i3 + 4) >> 2] = i6 | 3;
+ i15 = i1 + (i7 | 4) | 0;
+ HEAP32[i15 >> 2] = HEAP32[i15 >> 2] | 1;
+ _dispose_chunk(i1 + i3 | 0, i6);
+ i15 = i1;
+ STACKTOP = i2;
+ return i15 | 0;
+ }
+ return 0;
+}
+function _luaK_posfix(i3, i16, i1, i4, i14) {
+ i3 = i3 | 0;
+ i16 = i16 | 0;
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i14 = i14 | 0;
+ var i2 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i15 = 0;
+ i2 = STACKTOP;
+ switch (i16 | 0) {
+ case 14:
+ {
+ _luaK_dischargevars(i3, i4);
+ i6 = i4 + 16 | 0;
+ i5 = HEAP32[i1 + 16 >> 2] | 0;
+ do {
+ if (!((i5 | 0) == -1)) {
+ i9 = HEAP32[i6 >> 2] | 0;
+ if ((i9 | 0) == -1) {
+ HEAP32[i6 >> 2] = i5;
+ break;
+ }
+ i7 = HEAP32[(HEAP32[i3 >> 2] | 0) + 12 >> 2] | 0;
+ while (1) {
+ i6 = i7 + (i9 << 2) | 0;
+ i8 = HEAP32[i6 >> 2] | 0;
+ i10 = (i8 >>> 14) + -131071 | 0;
+ if ((i10 | 0) == -1) {
+ break;
+ }
+ i10 = i9 + 1 + i10 | 0;
+ if ((i10 | 0) == -1) {
+ break;
+ } else {
+ i9 = i10;
+ }
+ }
+ i5 = i5 + ~i9 | 0;
+ if ((((i5 | 0) > -1 ? i5 : 0 - i5 | 0) | 0) > 131071) {
+ _luaX_syntaxerror(HEAP32[i3 + 12 >> 2] | 0, 10624);
+ } else {
+ HEAP32[i6 >> 2] = (i5 << 14) + 2147467264 | i8 & 16383;
+ break;
+ }
+ }
+ } while (0);
+ HEAP32[i1 + 0 >> 2] = HEAP32[i4 + 0 >> 2];
+ HEAP32[i1 + 4 >> 2] = HEAP32[i4 + 4 >> 2];
+ HEAP32[i1 + 8 >> 2] = HEAP32[i4 + 8 >> 2];
+ HEAP32[i1 + 12 >> 2] = HEAP32[i4 + 12 >> 2];
+ HEAP32[i1 + 16 >> 2] = HEAP32[i4 + 16 >> 2];
+ HEAP32[i1 + 20 >> 2] = HEAP32[i4 + 20 >> 2];
+ STACKTOP = i2;
+ return;
+ }
+ case 13:
+ {
+ _luaK_dischargevars(i3, i4);
+ i6 = i4 + 20 | 0;
+ i5 = HEAP32[i1 + 20 >> 2] | 0;
+ do {
+ if (!((i5 | 0) == -1)) {
+ i9 = HEAP32[i6 >> 2] | 0;
+ if ((i9 | 0) == -1) {
+ HEAP32[i6 >> 2] = i5;
+ break;
+ }
+ i7 = HEAP32[(HEAP32[i3 >> 2] | 0) + 12 >> 2] | 0;
+ while (1) {
+ i8 = i7 + (i9 << 2) | 0;
+ i6 = HEAP32[i8 >> 2] | 0;
+ i10 = (i6 >>> 14) + -131071 | 0;
+ if ((i10 | 0) == -1) {
+ break;
+ }
+ i10 = i9 + 1 + i10 | 0;
+ if ((i10 | 0) == -1) {
+ break;
+ } else {
+ i9 = i10;
+ }
+ }
+ i5 = i5 + ~i9 | 0;
+ if ((((i5 | 0) > -1 ? i5 : 0 - i5 | 0) | 0) > 131071) {
+ _luaX_syntaxerror(HEAP32[i3 + 12 >> 2] | 0, 10624);
+ } else {
+ HEAP32[i8 >> 2] = (i5 << 14) + 2147467264 | i6 & 16383;
+ break;
+ }
+ }
+ } while (0);
+ HEAP32[i1 + 0 >> 2] = HEAP32[i4 + 0 >> 2];
+ HEAP32[i1 + 4 >> 2] = HEAP32[i4 + 4 >> 2];
+ HEAP32[i1 + 8 >> 2] = HEAP32[i4 + 8 >> 2];
+ HEAP32[i1 + 12 >> 2] = HEAP32[i4 + 12 >> 2];
+ HEAP32[i1 + 16 >> 2] = HEAP32[i4 + 16 >> 2];
+ HEAP32[i1 + 20 >> 2] = HEAP32[i4 + 20 >> 2];
+ STACKTOP = i2;
+ return;
+ }
+ case 6:
+ {
+ i12 = i4 + 16 | 0;
+ i13 = i4 + 20 | 0;
+ i16 = (HEAP32[i12 >> 2] | 0) == (HEAP32[i13 >> 2] | 0);
+ _luaK_dischargevars(i3, i4);
+ do {
+ if (!i16) {
+ if ((HEAP32[i4 >> 2] | 0) == 6) {
+ i10 = HEAP32[i4 + 8 >> 2] | 0;
+ if ((HEAP32[i12 >> 2] | 0) == (HEAP32[i13 >> 2] | 0)) {
+ break;
+ }
+ if ((i10 | 0) >= (HEAPU8[i3 + 46 | 0] | 0 | 0)) {
+ _exp2reg(i3, i4, i10);
+ break;
+ }
+ }
+ _luaK_exp2nextreg(i3, i4);
+ }
+ } while (0);
+ if ((HEAP32[i4 >> 2] | 0) == 11 ? (i5 = i4 + 8 | 0, i7 = HEAP32[i5 >> 2] | 0, i8 = (HEAP32[i3 >> 2] | 0) + 12 | 0, i9 = HEAP32[i8 >> 2] | 0, i6 = HEAP32[i9 + (i7 << 2) >> 2] | 0, (i6 & 63 | 0) == 22) : 0) {
+ i4 = i1 + 8 | 0;
+ if (((HEAP32[i1 >> 2] | 0) == 6 ? (i11 = HEAP32[i4 >> 2] | 0, (i11 & 256 | 0) == 0) : 0) ? (HEAPU8[i3 + 46 | 0] | 0 | 0) <= (i11 | 0) : 0) {
+ i6 = i3 + 48 | 0;
+ HEAP8[i6] = (HEAP8[i6] | 0) + -1 << 24 >> 24;
+ i6 = HEAP32[i5 >> 2] | 0;
+ i16 = HEAP32[i8 >> 2] | 0;
+ i9 = i16;
+ i7 = i6;
+ i6 = HEAP32[i16 + (i6 << 2) >> 2] | 0;
+ }
+ HEAP32[i9 + (i7 << 2) >> 2] = HEAP32[i4 >> 2] << 23 | i6 & 8388607;
+ HEAP32[i1 >> 2] = 11;
+ HEAP32[i4 >> 2] = HEAP32[i5 >> 2];
+ STACKTOP = i2;
+ return;
+ }
+ _luaK_exp2nextreg(i3, i4);
+ _codearith(i3, 22, i1, i4, i14);
+ STACKTOP = i2;
+ return;
+ }
+ case 9:
+ case 8:
+ case 7:
+ {
+ i7 = i16 + 17 | 0;
+ i6 = _luaK_exp2RK(i3, i1) | 0;
+ i5 = _luaK_exp2RK(i3, i4) | 0;
+ if (((HEAP32[i4 >> 2] | 0) == 6 ? (i15 = HEAP32[i4 + 8 >> 2] | 0, (i15 & 256 | 0) == 0) : 0) ? (HEAPU8[i3 + 46 | 0] | 0 | 0) <= (i15 | 0) : 0) {
+ i16 = i3 + 48 | 0;
+ HEAP8[i16] = (HEAP8[i16] | 0) + -1 << 24 >> 24;
+ }
+ i4 = i1 + 8 | 0;
+ if (((HEAP32[i1 >> 2] | 0) == 6 ? (i10 = HEAP32[i4 >> 2] | 0, (i10 & 256 | 0) == 0) : 0) ? (HEAPU8[i3 + 46 | 0] | 0 | 0) <= (i10 | 0) : 0) {
+ i16 = i3 + 48 | 0;
+ HEAP8[i16] = (HEAP8[i16] | 0) + -1 << 24 >> 24;
+ }
+ HEAP32[i4 >> 2] = _condjump(i3, i7, 1, i6, i5) | 0;
+ HEAP32[i1 >> 2] = 10;
+ STACKTOP = i2;
+ return;
+ }
+ case 12:
+ case 11:
+ case 10:
+ {
+ i7 = i16 + 14 | 0;
+ i6 = _luaK_exp2RK(i3, i1) | 0;
+ i5 = _luaK_exp2RK(i3, i4) | 0;
+ if (((HEAP32[i4 >> 2] | 0) == 6 ? (i13 = HEAP32[i4 + 8 >> 2] | 0, (i13 & 256 | 0) == 0) : 0) ? (HEAPU8[i3 + 46 | 0] | 0 | 0) <= (i13 | 0) : 0) {
+ i16 = i3 + 48 | 0;
+ HEAP8[i16] = (HEAP8[i16] | 0) + -1 << 24 >> 24;
+ }
+ i4 = i1 + 8 | 0;
+ if (((HEAP32[i1 >> 2] | 0) == 6 ? (i12 = HEAP32[i4 >> 2] | 0, (i12 & 256 | 0) == 0) : 0) ? (HEAPU8[i3 + 46 | 0] | 0 | 0) <= (i12 | 0) : 0) {
+ i16 = i3 + 48 | 0;
+ HEAP8[i16] = (HEAP8[i16] | 0) + -1 << 24 >> 24;
+ }
+ i8 = (i7 | 0) == 24;
+ HEAP32[i4 >> 2] = _condjump(i3, i7, i8 & 1 ^ 1, i8 ? i6 : i5, i8 ? i5 : i6) | 0;
+ HEAP32[i1 >> 2] = 10;
+ STACKTOP = i2;
+ return;
+ }
+ case 5:
+ case 4:
+ case 3:
+ case 2:
+ case 1:
+ case 0:
+ {
+ _codearith(i3, i16 + 13 | 0, i1, i4, i14);
+ STACKTOP = i2;
+ return;
+ }
+ default:
+ {
+ STACKTOP = i2;
+ return;
+ }
+ }
+}
+function _body(i1, i4, i13, i5) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i13 = i13 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0;
+ i6 = STACKTOP;
+ STACKTOP = STACKTOP + 64 | 0;
+ i3 = i6 + 12 | 0;
+ i14 = i6;
+ i2 = i1 + 48 | 0;
+ i19 = HEAP32[i2 >> 2] | 0;
+ i18 = i1 + 52 | 0;
+ i17 = HEAP32[i18 >> 2] | 0;
+ i16 = HEAP32[i19 >> 2] | 0;
+ i19 = i19 + 36 | 0;
+ i23 = i16 + 56 | 0;
+ i24 = HEAP32[i23 >> 2] | 0;
+ i15 = i16 + 16 | 0;
+ if (((HEAP32[i19 >> 2] | 0) >= (i24 | 0) ? (i21 = _luaM_growaux_(i17, HEAP32[i15 >> 2] | 0, i23, 4, 262143, 6512) | 0, HEAP32[i15 >> 2] = i21, i20 = HEAP32[i23 >> 2] | 0, (i24 | 0) < (i20 | 0)) : 0) ? (i22 = i24 + 1 | 0, HEAP32[i21 + (i24 << 2) >> 2] = 0, (i22 | 0) < (i20 | 0)) : 0) {
+ while (1) {
+ i21 = i22 + 1 | 0;
+ HEAP32[(HEAP32[i15 >> 2] | 0) + (i22 << 2) >> 2] = 0;
+ if ((i21 | 0) == (i20 | 0)) {
+ break;
+ } else {
+ i22 = i21;
+ }
+ }
+ }
+ i20 = _luaF_newproto(i17) | 0;
+ i24 = HEAP32[i19 >> 2] | 0;
+ HEAP32[i19 >> 2] = i24 + 1;
+ HEAP32[(HEAP32[i15 >> 2] | 0) + (i24 << 2) >> 2] = i20;
+ if (!((HEAP8[i20 + 5 | 0] & 3) == 0) ? !((HEAP8[i16 + 5 | 0] & 4) == 0) : 0) {
+ _luaC_barrier_(i17, i16, i20);
+ }
+ HEAP32[i3 >> 2] = i20;
+ HEAP32[i20 + 64 >> 2] = i5;
+ i16 = HEAP32[i18 >> 2] | 0;
+ HEAP32[i3 + 8 >> 2] = HEAP32[i2 >> 2];
+ i17 = i3 + 12 | 0;
+ HEAP32[i17 >> 2] = i1;
+ HEAP32[i2 >> 2] = i3;
+ HEAP32[i3 + 20 >> 2] = 0;
+ HEAP32[i3 + 24 >> 2] = 0;
+ HEAP32[i3 + 28 >> 2] = -1;
+ HEAP32[i3 + 32 >> 2] = 0;
+ HEAP32[i3 + 36 >> 2] = 0;
+ i22 = i3 + 44 | 0;
+ i15 = i1 + 64 | 0;
+ HEAP32[i22 + 0 >> 2] = 0;
+ HEAP8[i22 + 4 | 0] = 0;
+ HEAP32[i3 + 40 >> 2] = HEAP32[(HEAP32[i15 >> 2] | 0) + 4 >> 2];
+ i15 = i3 + 16 | 0;
+ HEAP32[i15 >> 2] = 0;
+ HEAP32[i20 + 36 >> 2] = HEAP32[i1 + 68 >> 2];
+ HEAP8[i20 + 78 | 0] = 2;
+ i22 = _luaH_new(i16) | 0;
+ HEAP32[i3 + 4 >> 2] = i22;
+ i23 = i16 + 8 | 0;
+ i24 = HEAP32[i23 >> 2] | 0;
+ HEAP32[i24 >> 2] = i22;
+ HEAP32[i24 + 8 >> 2] = 69;
+ i24 = (HEAP32[i23 >> 2] | 0) + 16 | 0;
+ HEAP32[i23 >> 2] = i24;
+ if (((HEAP32[i16 + 24 >> 2] | 0) - i24 | 0) < 16) {
+ _luaD_growstack(i16, 0);
+ }
+ HEAP8[i14 + 10 | 0] = 0;
+ HEAP8[i14 + 8 | 0] = HEAP8[i3 + 46 | 0] | 0;
+ i24 = HEAP32[(HEAP32[i17 >> 2] | 0) + 64 >> 2] | 0;
+ HEAP16[i14 + 4 >> 1] = HEAP32[i24 + 28 >> 2];
+ HEAP16[i14 + 6 >> 1] = HEAP32[i24 + 16 >> 2];
+ HEAP8[i14 + 9 | 0] = 0;
+ HEAP32[i14 >> 2] = HEAP32[i15 >> 2];
+ HEAP32[i15 >> 2] = i14;
+ i14 = i1 + 16 | 0;
+ if ((HEAP32[i14 >> 2] | 0) != 40) {
+ _error_expected(i1, 40);
+ }
+ _luaX_next(i1);
+ if ((i13 | 0) != 0) {
+ _new_localvar(i1, _luaX_newstring(i1, 6456, 4) | 0);
+ i24 = HEAP32[i2 >> 2] | 0;
+ i22 = i24 + 46 | 0;
+ i23 = (HEAPU8[i22] | 0) + 1 | 0;
+ HEAP8[i22] = i23;
+ HEAP32[(HEAP32[(HEAP32[i24 >> 2] | 0) + 24 >> 2] | 0) + ((HEAP16[(HEAP32[HEAP32[(HEAP32[i24 + 12 >> 2] | 0) + 64 >> 2] >> 2] | 0) + ((i23 & 255) + -1 + (HEAP32[i24 + 40 >> 2] | 0) << 1) >> 1] | 0) * 12 | 0) + 4 >> 2] = HEAP32[i24 + 20 >> 2];
+ }
+ i13 = HEAP32[i2 >> 2] | 0;
+ i15 = HEAP32[i13 >> 2] | 0;
+ i16 = i15 + 77 | 0;
+ HEAP8[i16] = 0;
+ i19 = HEAP32[i14 >> 2] | 0;
+ L20 : do {
+ if ((i19 | 0) != 41) {
+ i17 = i1 + 24 | 0;
+ i18 = 0;
+ while (1) {
+ if ((i19 | 0) == 280) {
+ i17 = 18;
+ break;
+ } else if ((i19 | 0) != 288) {
+ i17 = 19;
+ break;
+ }
+ i24 = HEAP32[i17 >> 2] | 0;
+ _luaX_next(i1);
+ _new_localvar(i1, i24);
+ i18 = i18 + 1 | 0;
+ if ((HEAP8[i16] | 0) != 0) {
+ i11 = i18;
+ break L20;
+ }
+ if ((HEAP32[i14 >> 2] | 0) != 44) {
+ i11 = i18;
+ break L20;
+ }
+ _luaX_next(i1);
+ i19 = HEAP32[i14 >> 2] | 0;
+ }
+ if ((i17 | 0) == 18) {
+ _luaX_next(i1);
+ HEAP8[i16] = 1;
+ i11 = i18;
+ break;
+ } else if ((i17 | 0) == 19) {
+ _luaX_syntaxerror(i1, 6464);
+ }
+ } else {
+ i11 = 0;
+ }
+ } while (0);
+ i18 = HEAP32[i2 >> 2] | 0;
+ i16 = i18 + 46 | 0;
+ i17 = (HEAPU8[i16] | 0) + i11 | 0;
+ HEAP8[i16] = i17;
+ if ((i11 | 0) != 0 ? (i8 = i18 + 20 | 0, i9 = i18 + 40 | 0, i7 = HEAP32[(HEAP32[i18 >> 2] | 0) + 24 >> 2] | 0, i10 = HEAP32[HEAP32[(HEAP32[i18 + 12 >> 2] | 0) + 64 >> 2] >> 2] | 0, HEAP32[i7 + ((HEAP16[i10 + ((i17 & 255) - i11 + (HEAP32[i9 >> 2] | 0) << 1) >> 1] | 0) * 12 | 0) + 4 >> 2] = HEAP32[i8 >> 2], i12 = i11 + -1 | 0, (i12 | 0) != 0) : 0) {
+ do {
+ HEAP32[i7 + ((HEAP16[i10 + ((HEAPU8[i16] | 0) - i12 + (HEAP32[i9 >> 2] | 0) << 1) >> 1] | 0) * 12 | 0) + 4 >> 2] = HEAP32[i8 >> 2];
+ i12 = i12 + -1 | 0;
+ } while ((i12 | 0) != 0);
+ }
+ i24 = i13 + 46 | 0;
+ HEAP8[i15 + 76 | 0] = HEAP8[i24] | 0;
+ _luaK_reserveregs(i13, HEAPU8[i24] | 0);
+ if ((HEAP32[i14 >> 2] | 0) != 41) {
+ _error_expected(i1, 41);
+ }
+ _luaX_next(i1);
+ L39 : while (1) {
+ i7 = HEAP32[i14 >> 2] | 0;
+ switch (i7 | 0) {
+ case 277:
+ case 286:
+ case 262:
+ case 261:
+ case 260:
+ {
+ i17 = 30;
+ break L39;
+ }
+ default:
+ {}
+ }
+ _statement(i1);
+ if ((i7 | 0) == 274) {
+ i17 = 30;
+ break;
+ }
+ }
+ if ((i17 | 0) == 30) {
+ HEAP32[(HEAP32[i3 >> 2] | 0) + 68 >> 2] = HEAP32[i1 + 4 >> 2];
+ _check_match(i1, 262, 265, i5);
+ i24 = HEAP32[(HEAP32[i2 >> 2] | 0) + 8 >> 2] | 0;
+ i23 = _luaK_codeABx(i24, 37, 0, (HEAP32[i24 + 36 >> 2] | 0) + -1 | 0) | 0;
+ HEAP32[i4 + 16 >> 2] = -1;
+ HEAP32[i4 + 20 >> 2] = -1;
+ HEAP32[i4 >> 2] = 11;
+ HEAP32[i4 + 8 >> 2] = i23;
+ _luaK_exp2nextreg(i24, i4);
+ _close_func(i1);
+ STACKTOP = i6;
+ return;
+ }
+}
+function _luaH_newkey(i3, i2, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, d21 = 0.0;
+ i4 = STACKTOP;
+ STACKTOP = STACKTOP + 144 | 0;
+ i8 = i4 + 8 | 0;
+ i10 = i4;
+ i5 = i4 + 16 | 0;
+ i6 = i1 + 8 | 0;
+ i11 = HEAP32[i6 >> 2] | 0;
+ if ((i11 | 0) == 0) {
+ _luaG_runerror(i3, 7968, i8);
+ } else if ((i11 | 0) == 3) {
+ i15 = 3;
+ }
+ if ((i15 | 0) == 3 ? (d21 = +HEAPF64[i1 >> 3], !(d21 == d21 & 0.0 == 0.0)) : 0) {
+ _luaG_runerror(i3, 7992, i8);
+ }
+ i13 = _mainposition(i2, i1) | 0;
+ i14 = i13 + 8 | 0;
+ do {
+ if ((HEAP32[i14 >> 2] | 0) != 0 | (i13 | 0) == 8016) {
+ i18 = i2 + 20 | 0;
+ i11 = i2 + 16 | 0;
+ i17 = HEAP32[i11 >> 2] | 0;
+ i16 = HEAP32[i18 >> 2] | 0;
+ while (1) {
+ if (!(i16 >>> 0 > i17 >>> 0)) {
+ break;
+ }
+ i12 = i16 + -32 | 0;
+ HEAP32[i18 >> 2] = i12;
+ if ((HEAP32[i16 + -8 >> 2] | 0) == 0) {
+ i15 = 37;
+ break;
+ } else {
+ i16 = i12;
+ }
+ }
+ if ((i15 | 0) == 37) {
+ i5 = _mainposition(i2, i13 + 16 | 0) | 0;
+ if ((i5 | 0) == (i13 | 0)) {
+ i20 = i13 + 28 | 0;
+ HEAP32[i16 + -4 >> 2] = HEAP32[i20 >> 2];
+ HEAP32[i20 >> 2] = i12;
+ break;
+ } else {
+ i7 = i5;
+ }
+ do {
+ i5 = i7 + 28 | 0;
+ i7 = HEAP32[i5 >> 2] | 0;
+ } while ((i7 | 0) != (i13 | 0));
+ HEAP32[i5 >> 2] = i12;
+ HEAP32[i12 + 0 >> 2] = HEAP32[i13 + 0 >> 2];
+ HEAP32[i12 + 4 >> 2] = HEAP32[i13 + 4 >> 2];
+ HEAP32[i12 + 8 >> 2] = HEAP32[i13 + 8 >> 2];
+ HEAP32[i12 + 12 >> 2] = HEAP32[i13 + 12 >> 2];
+ HEAP32[i12 + 16 >> 2] = HEAP32[i13 + 16 >> 2];
+ HEAP32[i12 + 20 >> 2] = HEAP32[i13 + 20 >> 2];
+ HEAP32[i12 + 24 >> 2] = HEAP32[i13 + 24 >> 2];
+ HEAP32[i12 + 28 >> 2] = HEAP32[i13 + 28 >> 2];
+ HEAP32[i13 + 28 >> 2] = 0;
+ HEAP32[i14 >> 2] = 0;
+ i12 = i13;
+ break;
+ }
+ i13 = i5 + 0 | 0;
+ i12 = i13 + 124 | 0;
+ do {
+ HEAP32[i13 >> 2] = 0;
+ i13 = i13 + 4 | 0;
+ } while ((i13 | 0) < (i12 | 0));
+ i15 = i2 + 12 | 0;
+ i13 = HEAP32[i2 + 28 >> 2] | 0;
+ i12 = 0;
+ i20 = 1;
+ i16 = 0;
+ i14 = 1;
+ while (1) {
+ if ((i14 | 0) > (i13 | 0)) {
+ if ((i20 | 0) > (i13 | 0)) {
+ break;
+ } else {
+ i19 = i13;
+ }
+ } else {
+ i19 = i14;
+ }
+ if ((i20 | 0) > (i19 | 0)) {
+ i18 = i20;
+ i17 = 0;
+ } else {
+ i18 = HEAP32[i15 >> 2] | 0;
+ i17 = 0;
+ while (1) {
+ i17 = ((HEAP32[i18 + (i20 + -1 << 4) + 8 >> 2] | 0) != 0) + i17 | 0;
+ if ((i20 | 0) >= (i19 | 0)) {
+ break;
+ } else {
+ i20 = i20 + 1 | 0;
+ }
+ }
+ i18 = i19 + 1 | 0;
+ }
+ i20 = i5 + (i16 << 2) | 0;
+ HEAP32[i20 >> 2] = (HEAP32[i20 >> 2] | 0) + i17;
+ i12 = i17 + i12 | 0;
+ i16 = i16 + 1 | 0;
+ if ((i16 | 0) < 31) {
+ i20 = i18;
+ i14 = i14 << 1;
+ } else {
+ break;
+ }
+ }
+ i14 = 0;
+ i15 = 1 << (HEAPU8[i2 + 7 | 0] | 0);
+ i13 = 0;
+ L32 : while (1) {
+ i16 = i15;
+ while (1) {
+ i15 = i16 + -1 | 0;
+ if ((i16 | 0) == 0) {
+ break L32;
+ }
+ i16 = HEAP32[i11 >> 2] | 0;
+ if ((HEAP32[i16 + (i15 << 5) + 8 >> 2] | 0) == 0) {
+ i16 = i15;
+ } else {
+ break;
+ }
+ }
+ if (((HEAP32[i16 + (i15 << 5) + 24 >> 2] | 0) == 3 ? (d21 = +HEAPF64[i16 + (i15 << 5) + 16 >> 3], HEAPF64[i10 >> 3] = d21 + 6755399441055744.0, i9 = HEAP32[i10 >> 2] | 0, +(i9 | 0) == d21) : 0) ? (i9 + -1 | 0) >>> 0 < 1073741824 : 0) {
+ i16 = i5 + ((_luaO_ceillog2(i9) | 0) << 2) | 0;
+ HEAP32[i16 >> 2] = (HEAP32[i16 >> 2] | 0) + 1;
+ i16 = 1;
+ } else {
+ i16 = 0;
+ }
+ i14 = i16 + i14 | 0;
+ i13 = i13 + 1 | 0;
+ }
+ i9 = i14 + i12 | 0;
+ if (((HEAP32[i6 >> 2] | 0) == 3 ? (d21 = +HEAPF64[i1 >> 3], HEAPF64[i8 >> 3] = d21 + 6755399441055744.0, i7 = HEAP32[i8 >> 2] | 0, +(i7 | 0) == d21) : 0) ? (i7 + -1 | 0) >>> 0 < 1073741824 : 0) {
+ i6 = i5 + ((_luaO_ceillog2(i7) | 0) << 2) | 0;
+ HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + 1;
+ i6 = 1;
+ } else {
+ i6 = 0;
+ }
+ i7 = i9 + i6 | 0;
+ L49 : do {
+ if ((i7 | 0) > 0) {
+ i14 = 0;
+ i10 = 0;
+ i6 = 0;
+ i8 = 0;
+ i11 = 0;
+ i9 = 1;
+ while (1) {
+ i15 = HEAP32[i5 + (i6 << 2) >> 2] | 0;
+ if ((i15 | 0) > 0) {
+ i15 = i15 + i10 | 0;
+ i14 = (i15 | 0) > (i14 | 0);
+ i10 = i15;
+ i8 = i14 ? i9 : i8;
+ i11 = i14 ? i15 : i11;
+ }
+ if ((i10 | 0) == (i7 | 0)) {
+ break L49;
+ }
+ i9 = i9 << 1;
+ i14 = (i9 | 0) / 2 | 0;
+ if ((i14 | 0) < (i7 | 0)) {
+ i6 = i6 + 1 | 0;
+ } else {
+ break;
+ }
+ }
+ } else {
+ i8 = 0;
+ i11 = 0;
+ }
+ } while (0);
+ _luaH_resize(i3, i2, i8, i12 + 1 + i13 - i11 | 0);
+ i5 = _luaH_get(i2, i1) | 0;
+ if ((i5 | 0) != 5192) {
+ i20 = i5;
+ STACKTOP = i4;
+ return i20 | 0;
+ }
+ i20 = _luaH_newkey(i3, i2, i1) | 0;
+ STACKTOP = i4;
+ return i20 | 0;
+ } else {
+ i12 = i13;
+ }
+ } while (0);
+ i18 = i1;
+ i19 = HEAP32[i18 + 4 >> 2] | 0;
+ i20 = i12 + 16 | 0;
+ HEAP32[i20 >> 2] = HEAP32[i18 >> 2];
+ HEAP32[i20 + 4 >> 2] = i19;
+ HEAP32[i12 + 24 >> 2] = HEAP32[i6 >> 2];
+ if (((HEAP32[i6 >> 2] & 64 | 0) != 0 ? !((HEAP8[(HEAP32[i1 >> 2] | 0) + 5 | 0] & 3) == 0) : 0) ? !((HEAP8[i2 + 5 | 0] & 4) == 0) : 0) {
+ _luaC_barrierback_(i3, i2);
+ }
+ i20 = i12;
+ STACKTOP = i4;
+ return i20 | 0;
+}
+function _luaV_concat(i7, i10) {
+ i7 = i7 | 0;
+ i10 = i10 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i8 = 0, i9 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0;
+ i5 = STACKTOP;
+ STACKTOP = STACKTOP + 48 | 0;
+ i9 = i5;
+ i8 = i5 + 8 | 0;
+ i6 = i7 + 8 | 0;
+ i2 = i7 + 12 | 0;
+ i3 = i7 + 28 | 0;
+ i4 = i7 + 16 | 0;
+ i11 = HEAP32[i6 >> 2] | 0;
+ L1 : while (1) {
+ i14 = i11 + -32 | 0;
+ i12 = i11 + -24 | 0;
+ i17 = HEAP32[i12 >> 2] | 0;
+ i13 = i11 + -16 | 0;
+ do {
+ if ((i17 & 15 | 0) == 4 | (i17 | 0) == 3) {
+ i15 = i11 + -8 | 0;
+ i16 = HEAP32[i15 >> 2] | 0;
+ if ((i16 & 15 | 0) == 4) {
+ i16 = i13;
+ } else {
+ if ((i16 | 0) != 3) {
+ i1 = 7;
+ break;
+ }
+ HEAPF64[tempDoublePtr >> 3] = +HEAPF64[i13 >> 3];
+ HEAP32[i9 >> 2] = HEAP32[tempDoublePtr >> 2];
+ HEAP32[i9 + 4 >> 2] = HEAP32[tempDoublePtr + 4 >> 2];
+ i16 = _luaS_newlstr(i7, i8, _sprintf(i8 | 0, 8936, i9 | 0) | 0) | 0;
+ HEAP32[i13 >> 2] = i16;
+ HEAP32[i15 >> 2] = HEAPU8[i16 + 4 | 0] | 0 | 64;
+ i16 = i13;
+ i17 = HEAP32[i12 >> 2] | 0;
+ }
+ i16 = HEAP32[(HEAP32[i16 >> 2] | 0) + 12 >> 2] | 0;
+ i18 = (i17 & 15 | 0) == 4;
+ if ((i16 | 0) == 0) {
+ if (i18) {
+ i12 = 2;
+ break;
+ }
+ if ((i17 | 0) != 3) {
+ i12 = 2;
+ break;
+ }
+ HEAPF64[tempDoublePtr >> 3] = +HEAPF64[i14 >> 3];
+ HEAP32[i9 >> 2] = HEAP32[tempDoublePtr >> 2];
+ HEAP32[i9 + 4 >> 2] = HEAP32[tempDoublePtr + 4 >> 2];
+ i18 = _luaS_newlstr(i7, i8, _sprintf(i8 | 0, 8936, i9 | 0) | 0) | 0;
+ HEAP32[i14 >> 2] = i18;
+ HEAP32[i12 >> 2] = HEAPU8[i18 + 4 | 0] | 0 | 64;
+ i12 = 2;
+ break;
+ }
+ if (i18 ? (HEAP32[(HEAP32[i14 >> 2] | 0) + 12 >> 2] | 0) == 0 : 0) {
+ i16 = i13;
+ i17 = HEAP32[i16 + 4 >> 2] | 0;
+ i18 = i14;
+ HEAP32[i18 >> 2] = HEAP32[i16 >> 2];
+ HEAP32[i18 + 4 >> 2] = i17;
+ HEAP32[i12 >> 2] = HEAP32[i15 >> 2];
+ i12 = 2;
+ break;
+ }
+ L19 : do {
+ if ((i10 | 0) > 1) {
+ i12 = 1;
+ do {
+ i15 = ~i12;
+ i14 = i11 + (i15 << 4) | 0;
+ i15 = i11 + (i15 << 4) + 8 | 0;
+ i13 = HEAP32[i15 >> 2] | 0;
+ if ((i13 & 15 | 0) != 4) {
+ if ((i13 | 0) != 3) {
+ break L19;
+ }
+ HEAPF64[tempDoublePtr >> 3] = +HEAPF64[i14 >> 3];
+ HEAP32[i9 >> 2] = HEAP32[tempDoublePtr >> 2];
+ HEAP32[i9 + 4 >> 2] = HEAP32[tempDoublePtr + 4 >> 2];
+ i18 = _luaS_newlstr(i7, i8, _sprintf(i8 | 0, 8936, i9 | 0) | 0) | 0;
+ HEAP32[i14 >> 2] = i18;
+ HEAP32[i15 >> 2] = HEAPU8[i18 + 4 | 0] | 0 | 64;
+ }
+ i13 = HEAP32[(HEAP32[i14 >> 2] | 0) + 12 >> 2] | 0;
+ if (!(i13 >>> 0 < (-3 - i16 | 0) >>> 0)) {
+ i1 = 24;
+ break L1;
+ }
+ i16 = i13 + i16 | 0;
+ i12 = i12 + 1 | 0;
+ } while ((i12 | 0) < (i10 | 0));
+ } else {
+ i12 = 1;
+ }
+ } while (0);
+ i14 = _luaZ_openspace(i7, (HEAP32[i2 >> 2] | 0) + 144 | 0, i16) | 0;
+ i15 = i12;
+ i13 = 0;
+ do {
+ i17 = HEAP32[i11 + (0 - i15 << 4) >> 2] | 0;
+ i18 = HEAP32[i17 + 12 >> 2] | 0;
+ _memcpy(i14 + i13 | 0, i17 + 16 | 0, i18 | 0) | 0;
+ i13 = i18 + i13 | 0;
+ i15 = i15 + -1 | 0;
+ } while ((i15 | 0) > 0);
+ i18 = 0 - i12 | 0;
+ i17 = _luaS_newlstr(i7, i14, i13) | 0;
+ HEAP32[i11 + (i18 << 4) >> 2] = i17;
+ HEAP32[i11 + (i18 << 4) + 8 >> 2] = HEAPU8[i17 + 4 | 0] | 0 | 64;
+ } else {
+ i1 = 7;
+ }
+ } while (0);
+ if ((i1 | 0) == 7) {
+ i1 = 0;
+ i15 = _luaT_gettmbyobj(i7, i14, 15) | 0;
+ if ((HEAP32[i15 + 8 >> 2] | 0) == 0) {
+ i15 = _luaT_gettmbyobj(i7, i13, 15) | 0;
+ if ((HEAP32[i15 + 8 >> 2] | 0) == 0) {
+ i1 = 10;
+ break;
+ }
+ }
+ i18 = i14 - (HEAP32[i3 >> 2] | 0) | 0;
+ i16 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i6 >> 2] = i16 + 16;
+ i20 = i15;
+ i19 = HEAP32[i20 + 4 >> 2] | 0;
+ i17 = i16;
+ HEAP32[i17 >> 2] = HEAP32[i20 >> 2];
+ HEAP32[i17 + 4 >> 2] = i19;
+ HEAP32[i16 + 8 >> 2] = HEAP32[i15 + 8 >> 2];
+ i15 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i6 >> 2] = i15 + 16;
+ i16 = i14;
+ i17 = HEAP32[i16 + 4 >> 2] | 0;
+ i14 = i15;
+ HEAP32[i14 >> 2] = HEAP32[i16 >> 2];
+ HEAP32[i14 + 4 >> 2] = i17;
+ HEAP32[i15 + 8 >> 2] = HEAP32[i12 >> 2];
+ i12 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i6 >> 2] = i12 + 16;
+ i15 = i13;
+ i14 = HEAP32[i15 + 4 >> 2] | 0;
+ i17 = i12;
+ HEAP32[i17 >> 2] = HEAP32[i15 >> 2];
+ HEAP32[i17 + 4 >> 2] = i14;
+ HEAP32[i12 + 8 >> 2] = HEAP32[i11 + -8 >> 2];
+ _luaD_call(i7, (HEAP32[i6 >> 2] | 0) + -48 | 0, 1, HEAP8[(HEAP32[i4 >> 2] | 0) + 18 | 0] & 1);
+ i12 = HEAP32[i3 >> 2] | 0;
+ i17 = HEAP32[i6 >> 2] | 0;
+ i14 = i17 + -16 | 0;
+ HEAP32[i6 >> 2] = i14;
+ i15 = HEAP32[i14 + 4 >> 2] | 0;
+ i16 = i12 + i18 | 0;
+ HEAP32[i16 >> 2] = HEAP32[i14 >> 2];
+ HEAP32[i16 + 4 >> 2] = i15;
+ HEAP32[i12 + (i18 + 8) >> 2] = HEAP32[i17 + -8 >> 2];
+ i12 = 2;
+ }
+ i10 = i10 + 1 - i12 | 0;
+ i11 = (HEAP32[i6 >> 2] | 0) + (1 - i12 << 4) | 0;
+ HEAP32[i6 >> 2] = i11;
+ if ((i10 | 0) <= 1) {
+ i1 = 30;
+ break;
+ }
+ }
+ if ((i1 | 0) == 10) {
+ _luaG_concaterror(i7, i14, i13);
+ } else if ((i1 | 0) == 24) {
+ _luaG_runerror(i7, 9e3, i9);
+ } else if ((i1 | 0) == 30) {
+ STACKTOP = i5;
+ return;
+ }
+}
+function _str_gsub(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 1344 | 0;
+ i4 = i3;
+ i5 = i3 + 1336 | 0;
+ i14 = i3 + 1332 | 0;
+ i10 = i3 + 1328 | 0;
+ i6 = i3 + 1048 | 0;
+ i2 = i3 + 8 | 0;
+ i20 = _luaL_checklstring(i1, 1, i14) | 0;
+ i13 = _luaL_checklstring(i1, 2, i10) | 0;
+ i8 = _lua_type(i1, 3) | 0;
+ i9 = _luaL_optinteger(i1, 4, (HEAP32[i14 >> 2] | 0) + 1 | 0) | 0;
+ i7 = (HEAP8[i13] | 0) == 94;
+ if (!((i8 + -3 | 0) >>> 0 < 2 | (i8 | 0) == 6 | (i8 | 0) == 5)) {
+ _luaL_argerror(i1, 3, 7528) | 0;
+ }
+ _luaL_buffinit(i1, i2);
+ if (i7) {
+ i15 = (HEAP32[i10 >> 2] | 0) + -1 | 0;
+ HEAP32[i10 >> 2] = i15;
+ i13 = i13 + 1 | 0;
+ } else {
+ i15 = HEAP32[i10 >> 2] | 0;
+ }
+ i11 = i6 + 16 | 0;
+ HEAP32[i11 >> 2] = i1;
+ HEAP32[i6 >> 2] = 200;
+ i12 = i6 + 4 | 0;
+ HEAP32[i12 >> 2] = i20;
+ i10 = i6 + 8 | 0;
+ HEAP32[i10 >> 2] = i20 + (HEAP32[i14 >> 2] | 0);
+ HEAP32[i6 + 12 >> 2] = i13 + i15;
+ i14 = i6 + 20 | 0;
+ i15 = i2 + 8 | 0;
+ i18 = i2 + 4 | 0;
+ i16 = i6 + 28 | 0;
+ i17 = i6 + 24 | 0;
+ i22 = 0;
+ while (1) {
+ if (!(i22 >>> 0 < i9 >>> 0)) {
+ i19 = 48;
+ break;
+ }
+ HEAP32[i14 >> 2] = 0;
+ i21 = _match(i6, i20, i13) | 0;
+ if ((i21 | 0) != 0) {
+ i22 = i22 + 1 | 0;
+ i23 = HEAP32[i11 >> 2] | 0;
+ if ((i8 | 0) == 5) {
+ do {
+ if ((HEAP32[i14 >> 2] | 0) > 0) {
+ i24 = HEAP32[i16 >> 2] | 0;
+ if (!((i24 | 0) == -1)) {
+ i25 = HEAP32[i17 >> 2] | 0;
+ if ((i24 | 0) == -2) {
+ _lua_pushinteger(i23, i25 + 1 - (HEAP32[i12 >> 2] | 0) | 0);
+ break;
+ } else {
+ i19 = i23;
+ }
+ } else {
+ _luaL_error(i23, 7248, i4) | 0;
+ i19 = HEAP32[i11 >> 2] | 0;
+ i25 = HEAP32[i17 >> 2] | 0;
+ }
+ _lua_pushlstring(i19, i25, i24) | 0;
+ } else {
+ _lua_pushlstring(i23, i20, i21 - i20 | 0) | 0;
+ }
+ } while (0);
+ _lua_gettable(i23, 3);
+ i19 = 37;
+ } else if ((i8 | 0) != 6) {
+ i24 = _lua_tolstring(i23, 3, i5) | 0;
+ if ((HEAP32[i5 >> 2] | 0) != 0) {
+ i23 = i21 - i20 | 0;
+ i25 = 0;
+ do {
+ i26 = i24 + i25 | 0;
+ i27 = HEAP8[i26] | 0;
+ do {
+ if (i27 << 24 >> 24 == 37) {
+ i25 = i25 + 1 | 0;
+ i26 = i24 + i25 | 0;
+ i28 = HEAP8[i26] | 0;
+ i27 = i28 << 24 >> 24;
+ if (((i28 & 255) + -48 | 0) >>> 0 < 10) {
+ if (i28 << 24 >> 24 == 48) {
+ _luaL_addlstring(i2, i20, i23);
+ break;
+ } else {
+ _push_onecapture(i6, i27 + -49 | 0, i20, i21);
+ _luaL_addvalue(i2);
+ break;
+ }
+ }
+ if (!(i28 << 24 >> 24 == 37)) {
+ i28 = HEAP32[i11 >> 2] | 0;
+ HEAP32[i4 >> 2] = 37;
+ _luaL_error(i28, 7600, i4) | 0;
+ }
+ i27 = HEAP32[i15 >> 2] | 0;
+ if (!(i27 >>> 0 < (HEAP32[i18 >> 2] | 0) >>> 0)) {
+ _luaL_prepbuffsize(i2, 1) | 0;
+ i27 = HEAP32[i15 >> 2] | 0;
+ }
+ i28 = HEAP8[i26] | 0;
+ HEAP32[i15 >> 2] = i27 + 1;
+ HEAP8[(HEAP32[i2 >> 2] | 0) + i27 | 0] = i28;
+ } else {
+ i28 = HEAP32[i15 >> 2] | 0;
+ if (!(i28 >>> 0 < (HEAP32[i18 >> 2] | 0) >>> 0)) {
+ _luaL_prepbuffsize(i2, 1) | 0;
+ i28 = HEAP32[i15 >> 2] | 0;
+ i27 = HEAP8[i26] | 0;
+ }
+ HEAP32[i15 >> 2] = i28 + 1;
+ HEAP8[(HEAP32[i2 >> 2] | 0) + i28 | 0] = i27;
+ }
+ } while (0);
+ i25 = i25 + 1 | 0;
+ } while (i25 >>> 0 < (HEAP32[i5 >> 2] | 0) >>> 0);
+ }
+ } else {
+ _lua_pushvalue(i23, 3);
+ i19 = HEAP32[i14 >> 2] | 0;
+ i19 = (i19 | 0) != 0 | (i20 | 0) == 0 ? i19 : 1;
+ _luaL_checkstack(HEAP32[i11 >> 2] | 0, i19, 7200);
+ if ((i19 | 0) > 0) {
+ i24 = 0;
+ do {
+ _push_onecapture(i6, i24, i20, i21);
+ i24 = i24 + 1 | 0;
+ } while ((i24 | 0) != (i19 | 0));
+ }
+ _lua_callk(i23, i19, 1, 0, 0);
+ i19 = 37;
+ }
+ if ((i19 | 0) == 37) {
+ i19 = 0;
+ if ((_lua_toboolean(i23, -1) | 0) != 0) {
+ if ((_lua_isstring(i23, -1) | 0) == 0) {
+ HEAP32[i4 >> 2] = _lua_typename(i23, _lua_type(i23, -1) | 0) | 0;
+ _luaL_error(i23, 7560, i4) | 0;
+ }
+ } else {
+ _lua_settop(i23, -2);
+ _lua_pushlstring(i23, i20, i21 - i20 | 0) | 0;
+ }
+ _luaL_addvalue(i2);
+ }
+ if (i21 >>> 0 > i20 >>> 0) {
+ i20 = i21;
+ } else {
+ i19 = 43;
+ }
+ } else {
+ i19 = 43;
+ }
+ if ((i19 | 0) == 43) {
+ i19 = 0;
+ if (!(i20 >>> 0 < (HEAP32[i10 >> 2] | 0) >>> 0)) {
+ i19 = 48;
+ break;
+ }
+ i21 = HEAP32[i15 >> 2] | 0;
+ if (!(i21 >>> 0 < (HEAP32[i18 >> 2] | 0) >>> 0)) {
+ _luaL_prepbuffsize(i2, 1) | 0;
+ i21 = HEAP32[i15 >> 2] | 0;
+ }
+ i28 = HEAP8[i20] | 0;
+ HEAP32[i15 >> 2] = i21 + 1;
+ HEAP8[(HEAP32[i2 >> 2] | 0) + i21 | 0] = i28;
+ i20 = i20 + 1 | 0;
+ }
+ if (i7) {
+ i19 = 48;
+ break;
+ }
+ }
+ if ((i19 | 0) == 48) {
+ _luaL_addlstring(i2, i20, (HEAP32[i10 >> 2] | 0) - i20 | 0);
+ _luaL_pushresult(i2);
+ _lua_pushinteger(i1, i22);
+ STACKTOP = i3;
+ return 2;
+ }
+ return 0;
+}
+function _constructor(i11, i13) {
+ i11 = i11 | 0;
+ i13 = i13 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i12 = 0, i14 = 0, i15 = 0, i16 = 0;
+ i5 = STACKTOP;
+ STACKTOP = STACKTOP + 64 | 0;
+ i10 = i5 + 40 | 0;
+ i8 = i5;
+ i12 = i11 + 48 | 0;
+ i6 = HEAP32[i12 >> 2] | 0;
+ i9 = HEAP32[i11 + 4 >> 2] | 0;
+ i2 = _luaK_codeABC(i6, 11, 0, 0, 0) | 0;
+ i7 = i8 + 36 | 0;
+ HEAP32[i7 >> 2] = 0;
+ i4 = i8 + 28 | 0;
+ HEAP32[i4 >> 2] = 0;
+ i3 = i8 + 32 | 0;
+ HEAP32[i3 >> 2] = 0;
+ i1 = i8 + 24 | 0;
+ HEAP32[i1 >> 2] = i13;
+ HEAP32[i13 + 16 >> 2] = -1;
+ HEAP32[i13 + 20 >> 2] = -1;
+ HEAP32[i13 >> 2] = 11;
+ HEAP32[i13 + 8 >> 2] = i2;
+ HEAP32[i8 + 16 >> 2] = -1;
+ HEAP32[i8 + 20 >> 2] = -1;
+ HEAP32[i8 >> 2] = 0;
+ HEAP32[i8 + 8 >> 2] = 0;
+ _luaK_exp2nextreg(HEAP32[i12 >> 2] | 0, i13);
+ i13 = i11 + 16 | 0;
+ if ((HEAP32[i13 >> 2] | 0) != 123) {
+ _error_expected(i11, 123);
+ }
+ _luaX_next(i11);
+ L4 : do {
+ if ((HEAP32[i13 >> 2] | 0) != 125) {
+ L5 : while (1) {
+ if ((HEAP32[i8 >> 2] | 0) != 0 ? (_luaK_exp2nextreg(i6, i8), HEAP32[i8 >> 2] = 0, (HEAP32[i7 >> 2] | 0) == 50) : 0) {
+ _luaK_setlist(i6, HEAP32[(HEAP32[i1 >> 2] | 0) + 8 >> 2] | 0, HEAP32[i3 >> 2] | 0, 50);
+ HEAP32[i7 >> 2] = 0;
+ }
+ i14 = HEAP32[i13 >> 2] | 0;
+ do {
+ if ((i14 | 0) == 288) {
+ if ((_luaX_lookahead(i11) | 0) == 61) {
+ _recfield(i11, i8);
+ break;
+ }
+ _subexpr(i11, i8, 0) | 0;
+ i14 = HEAP32[i12 >> 2] | 0;
+ i15 = HEAP32[i3 >> 2] | 0;
+ if ((i15 | 0) > 2147483645) {
+ i12 = 10;
+ break L5;
+ }
+ HEAP32[i3 >> 2] = i15 + 1;
+ HEAP32[i7 >> 2] = (HEAP32[i7 >> 2] | 0) + 1;
+ } else if ((i14 | 0) == 91) {
+ _recfield(i11, i8);
+ } else {
+ _subexpr(i11, i8, 0) | 0;
+ i14 = HEAP32[i12 >> 2] | 0;
+ i15 = HEAP32[i3 >> 2] | 0;
+ if ((i15 | 0) > 2147483645) {
+ i12 = 17;
+ break L5;
+ }
+ HEAP32[i3 >> 2] = i15 + 1;
+ HEAP32[i7 >> 2] = (HEAP32[i7 >> 2] | 0) + 1;
+ }
+ } while (0);
+ i14 = HEAP32[i13 >> 2] | 0;
+ if ((i14 | 0) == 44) {
+ _luaX_next(i11);
+ } else if ((i14 | 0) == 59) {
+ _luaX_next(i11);
+ } else {
+ break L4;
+ }
+ if ((HEAP32[i13 >> 2] | 0) == 125) {
+ break L4;
+ }
+ }
+ if ((i12 | 0) == 10) {
+ i12 = i14 + 12 | 0;
+ i13 = HEAP32[(HEAP32[i12 >> 2] | 0) + 52 >> 2] | 0;
+ i14 = HEAP32[(HEAP32[i14 >> 2] | 0) + 64 >> 2] | 0;
+ if ((i14 | 0) == 0) {
+ i16 = 6552;
+ HEAP32[i10 >> 2] = 6528;
+ i15 = i10 + 4 | 0;
+ HEAP32[i15 >> 2] = 2147483645;
+ i15 = i10 + 8 | 0;
+ HEAP32[i15 >> 2] = i16;
+ i15 = _luaO_pushfstring(i13, 6592, i10) | 0;
+ i16 = HEAP32[i12 >> 2] | 0;
+ _luaX_syntaxerror(i16, i15);
+ }
+ HEAP32[i10 >> 2] = i14;
+ i15 = _luaO_pushfstring(i13, 6568, i10) | 0;
+ HEAP32[i10 >> 2] = 6528;
+ i16 = i10 + 4 | 0;
+ HEAP32[i16 >> 2] = 2147483645;
+ i16 = i10 + 8 | 0;
+ HEAP32[i16 >> 2] = i15;
+ i16 = _luaO_pushfstring(i13, 6592, i10) | 0;
+ i15 = HEAP32[i12 >> 2] | 0;
+ _luaX_syntaxerror(i15, i16);
+ } else if ((i12 | 0) == 17) {
+ i13 = i14 + 12 | 0;
+ i12 = HEAP32[(HEAP32[i13 >> 2] | 0) + 52 >> 2] | 0;
+ i14 = HEAP32[(HEAP32[i14 >> 2] | 0) + 64 >> 2] | 0;
+ if ((i14 | 0) == 0) {
+ i15 = 6552;
+ HEAP32[i10 >> 2] = 6528;
+ i16 = i10 + 4 | 0;
+ HEAP32[i16 >> 2] = 2147483645;
+ i16 = i10 + 8 | 0;
+ HEAP32[i16 >> 2] = i15;
+ i16 = _luaO_pushfstring(i12, 6592, i10) | 0;
+ i15 = HEAP32[i13 >> 2] | 0;
+ _luaX_syntaxerror(i15, i16);
+ }
+ HEAP32[i10 >> 2] = i14;
+ i15 = _luaO_pushfstring(i12, 6568, i10) | 0;
+ HEAP32[i10 >> 2] = 6528;
+ i16 = i10 + 4 | 0;
+ HEAP32[i16 >> 2] = 2147483645;
+ i16 = i10 + 8 | 0;
+ HEAP32[i16 >> 2] = i15;
+ i16 = _luaO_pushfstring(i12, 6592, i10) | 0;
+ i15 = HEAP32[i13 >> 2] | 0;
+ _luaX_syntaxerror(i15, i16);
+ }
+ }
+ } while (0);
+ _check_match(i11, 125, 123, i9);
+ i9 = HEAP32[i7 >> 2] | 0;
+ do {
+ if ((i9 | 0) != 0) {
+ i10 = HEAP32[i8 >> 2] | 0;
+ if ((i10 | 0) != 0) if ((i10 | 0) == 13 | (i10 | 0) == 12) {
+ _luaK_setreturns(i6, i8, -1);
+ _luaK_setlist(i6, HEAP32[(HEAP32[i1 >> 2] | 0) + 8 >> 2] | 0, HEAP32[i3 >> 2] | 0, -1);
+ HEAP32[i3 >> 2] = (HEAP32[i3 >> 2] | 0) + -1;
+ break;
+ } else {
+ _luaK_exp2nextreg(i6, i8);
+ i9 = HEAP32[i7 >> 2] | 0;
+ }
+ _luaK_setlist(i6, HEAP32[(HEAP32[i1 >> 2] | 0) + 8 >> 2] | 0, HEAP32[i3 >> 2] | 0, i9);
+ }
+ } while (0);
+ i16 = HEAP32[(HEAP32[(HEAP32[i6 >> 2] | 0) + 12 >> 2] | 0) + (i2 << 2) >> 2] & 8388607;
+ i16 = (_luaO_int2fb(HEAP32[i3 >> 2] | 0) | 0) << 23 | i16;
+ HEAP32[(HEAP32[(HEAP32[i6 >> 2] | 0) + 12 >> 2] | 0) + (i2 << 2) >> 2] = i16;
+ i16 = (_luaO_int2fb(HEAP32[i4 >> 2] | 0) | 0) << 14 & 8372224 | i16 & -8372225;
+ HEAP32[(HEAP32[(HEAP32[i6 >> 2] | 0) + 12 >> 2] | 0) + (i2 << 2) >> 2] = i16;
+ STACKTOP = i5;
+ return;
+}
+function _luaK_prefix(i4, i14, i7, i13) {
+ i4 = i4 | 0;
+ i14 = i14 | 0;
+ i7 = i7 | 0;
+ i13 = i13 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i5 = 0, i6 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 32 | 0;
+ i12 = i1;
+ HEAP32[i12 + 20 >> 2] = -1;
+ HEAP32[i12 + 16 >> 2] = -1;
+ HEAP32[i12 >> 2] = 5;
+ HEAPF64[i12 + 8 >> 3] = 0.0;
+ if ((i14 | 0) == 1) {
+ _luaK_dischargevars(i4, i7);
+ switch (HEAP32[i7 >> 2] | 0) {
+ case 2:
+ case 5:
+ case 4:
+ {
+ HEAP32[i7 >> 2] = 3;
+ break;
+ }
+ case 10:
+ {
+ i13 = HEAP32[(HEAP32[i4 >> 2] | 0) + 12 >> 2] | 0;
+ i12 = HEAP32[i7 + 8 >> 2] | 0;
+ i10 = i13 + (i12 << 2) | 0;
+ if (!((i12 | 0) > 0 ? (i11 = i13 + (i12 + -1 << 2) | 0, i9 = HEAP32[i11 >> 2] | 0, (HEAP8[5584 + (i9 & 63) | 0] | 0) < 0) : 0)) {
+ i11 = i10;
+ i9 = HEAP32[i10 >> 2] | 0;
+ }
+ HEAP32[i11 >> 2] = ((i9 & 16320 | 0) == 0) << 6 | i9 & -16321;
+ break;
+ }
+ case 6:
+ {
+ i8 = 25;
+ break;
+ }
+ case 3:
+ case 1:
+ {
+ HEAP32[i7 >> 2] = 2;
+ break;
+ }
+ case 11:
+ {
+ i12 = i4 + 48 | 0;
+ i8 = HEAP8[i12] | 0;
+ i11 = (i8 & 255) + 1 | 0;
+ i9 = (HEAP32[i4 >> 2] | 0) + 78 | 0;
+ do {
+ if (i11 >>> 0 > (HEAPU8[i9] | 0) >>> 0) {
+ if (i11 >>> 0 > 249) {
+ _luaX_syntaxerror(HEAP32[i4 + 12 >> 2] | 0, 10536);
+ } else {
+ HEAP8[i9] = i11;
+ i10 = HEAP8[i12] | 0;
+ break;
+ }
+ } else {
+ i10 = i8;
+ }
+ } while (0);
+ i14 = (i10 & 255) + 1 | 0;
+ HEAP8[i12] = i14;
+ _discharge2reg(i4, i7, (i14 & 255) + -1 | 0);
+ if ((HEAP32[i7 >> 2] | 0) == 6) {
+ i8 = 25;
+ } else {
+ i9 = i7 + 8 | 0;
+ i8 = 28;
+ }
+ break;
+ }
+ default:
+ {}
+ }
+ if ((i8 | 0) == 25) {
+ i8 = i7 + 8 | 0;
+ i9 = HEAP32[i8 >> 2] | 0;
+ if ((i9 & 256 | 0) == 0 ? (HEAPU8[i4 + 46 | 0] | 0) <= (i9 | 0) : 0) {
+ i9 = i4 + 48 | 0;
+ HEAP8[i9] = (HEAP8[i9] | 0) + -1 << 24 >> 24;
+ i9 = i8;
+ i8 = 28;
+ } else {
+ i9 = i8;
+ i8 = 28;
+ }
+ }
+ if ((i8 | 0) == 28) {
+ HEAP32[i9 >> 2] = _luaK_code(i4, HEAP32[i9 >> 2] << 23 | 20) | 0;
+ HEAP32[i7 >> 2] = 11;
+ }
+ i14 = i7 + 20 | 0;
+ i8 = HEAP32[i14 >> 2] | 0;
+ i7 = i7 + 16 | 0;
+ i9 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i14 >> 2] = i9;
+ HEAP32[i7 >> 2] = i8;
+ if (!((i9 | 0) == -1)) {
+ i8 = HEAP32[(HEAP32[i4 >> 2] | 0) + 12 >> 2] | 0;
+ do {
+ i12 = i8 + (i9 << 2) | 0;
+ if ((i9 | 0) > 0 ? (i5 = i8 + (i9 + -1 << 2) | 0, i6 = HEAP32[i5 >> 2] | 0, (HEAP8[5584 + (i6 & 63) | 0] | 0) < 0) : 0) {
+ i10 = i5;
+ i11 = i6;
+ } else {
+ i10 = i12;
+ i11 = HEAP32[i12 >> 2] | 0;
+ }
+ if ((i11 & 63 | 0) == 28) {
+ HEAP32[i10 >> 2] = i11 & 8372224 | i11 >>> 23 << 6 | 27;
+ }
+ i10 = ((HEAP32[i12 >> 2] | 0) >>> 14) + -131071 | 0;
+ if ((i10 | 0) == -1) {
+ break;
+ }
+ i9 = i9 + 1 + i10 | 0;
+ } while (!((i9 | 0) == -1));
+ i8 = HEAP32[i7 >> 2] | 0;
+ }
+ if ((i8 | 0) == -1) {
+ STACKTOP = i1;
+ return;
+ }
+ i4 = HEAP32[(HEAP32[i4 >> 2] | 0) + 12 >> 2] | 0;
+ while (1) {
+ i6 = i4 + (i8 << 2) | 0;
+ if ((i8 | 0) > 0 ? (i2 = i4 + (i8 + -1 << 2) | 0, i3 = HEAP32[i2 >> 2] | 0, (HEAP8[5584 + (i3 & 63) | 0] | 0) < 0) : 0) {
+ i7 = i2;
+ i5 = i3;
+ } else {
+ i7 = i6;
+ i5 = HEAP32[i6 >> 2] | 0;
+ }
+ if ((i5 & 63 | 0) == 28) {
+ HEAP32[i7 >> 2] = i5 & 8372224 | i5 >>> 23 << 6 | 27;
+ }
+ i5 = ((HEAP32[i6 >> 2] | 0) >>> 14) + -131071 | 0;
+ if ((i5 | 0) == -1) {
+ i8 = 54;
+ break;
+ }
+ i8 = i8 + 1 + i5 | 0;
+ if ((i8 | 0) == -1) {
+ i8 = 54;
+ break;
+ }
+ }
+ if ((i8 | 0) == 54) {
+ STACKTOP = i1;
+ return;
+ }
+ } else if ((i14 | 0) == 0) {
+ if (((HEAP32[i7 >> 2] | 0) == 5 ? (HEAP32[i7 + 16 >> 2] | 0) == -1 : 0) ? (HEAP32[i7 + 20 >> 2] | 0) == -1 : 0) {
+ i14 = i7 + 8 | 0;
+ HEAPF64[i14 >> 3] = -+HEAPF64[i14 >> 3];
+ STACKTOP = i1;
+ return;
+ }
+ _luaK_dischargevars(i4, i7);
+ if ((HEAP32[i7 >> 2] | 0) == 6) {
+ i2 = HEAP32[i7 + 8 >> 2] | 0;
+ if ((HEAP32[i7 + 16 >> 2] | 0) != (HEAP32[i7 + 20 >> 2] | 0)) {
+ if ((i2 | 0) < (HEAPU8[i4 + 46 | 0] | 0)) {
+ i8 = 10;
+ } else {
+ _exp2reg(i4, i7, i2);
+ }
+ }
+ } else {
+ i8 = 10;
+ }
+ if ((i8 | 0) == 10) {
+ _luaK_exp2nextreg(i4, i7);
+ }
+ _codearith(i4, 19, i7, i12, i13);
+ STACKTOP = i1;
+ return;
+ } else if ((i14 | 0) == 2) {
+ _luaK_dischargevars(i4, i7);
+ if ((HEAP32[i7 >> 2] | 0) == 6) {
+ i2 = HEAP32[i7 + 8 >> 2] | 0;
+ if ((HEAP32[i7 + 16 >> 2] | 0) != (HEAP32[i7 + 20 >> 2] | 0)) {
+ if ((i2 | 0) < (HEAPU8[i4 + 46 | 0] | 0)) {
+ i8 = 52;
+ } else {
+ _exp2reg(i4, i7, i2);
+ }
+ }
+ } else {
+ i8 = 52;
+ }
+ if ((i8 | 0) == 52) {
+ _luaK_exp2nextreg(i4, i7);
+ }
+ _codearith(i4, 21, i7, i12, i13);
+ STACKTOP = i1;
+ return;
+ } else {
+ STACKTOP = i1;
+ return;
+ }
+}
+function _subexpr(i6, i3, i7) {
+ i6 = i6 | 0;
+ i3 = i3 | 0;
+ i7 = i7 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i5 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 48 | 0;
+ i11 = i2 + 24 | 0;
+ i5 = i2;
+ i4 = i6 + 48 | 0;
+ i9 = HEAP32[i4 >> 2] | 0;
+ i1 = i6 + 52 | 0;
+ i12 = (HEAP32[i1 >> 2] | 0) + 38 | 0;
+ i13 = (HEAP16[i12 >> 1] | 0) + 1 << 16 >> 16;
+ HEAP16[i12 >> 1] = i13;
+ if ((i13 & 65535) > 200) {
+ i10 = i9 + 12 | 0;
+ i12 = HEAP32[(HEAP32[i10 >> 2] | 0) + 52 >> 2] | 0;
+ i13 = HEAP32[(HEAP32[i9 >> 2] | 0) + 64 >> 2] | 0;
+ if ((i13 | 0) == 0) {
+ i15 = 6552;
+ HEAP32[i11 >> 2] = 6360;
+ i14 = i11 + 4 | 0;
+ HEAP32[i14 >> 2] = 200;
+ i14 = i11 + 8 | 0;
+ HEAP32[i14 >> 2] = i15;
+ i14 = _luaO_pushfstring(i12, 6592, i11) | 0;
+ i15 = HEAP32[i10 >> 2] | 0;
+ _luaX_syntaxerror(i15, i14);
+ }
+ HEAP32[i11 >> 2] = i13;
+ i14 = _luaO_pushfstring(i12, 6568, i11) | 0;
+ HEAP32[i11 >> 2] = 6360;
+ i15 = i11 + 4 | 0;
+ HEAP32[i15 >> 2] = 200;
+ i15 = i11 + 8 | 0;
+ HEAP32[i15 >> 2] = i14;
+ i15 = _luaO_pushfstring(i12, 6592, i11) | 0;
+ i14 = HEAP32[i10 >> 2] | 0;
+ _luaX_syntaxerror(i14, i15);
+ }
+ i10 = i6 + 16 | 0;
+ L8 : do {
+ switch (HEAP32[i10 >> 2] | 0) {
+ case 287:
+ {
+ HEAP32[i3 + 16 >> 2] = -1;
+ HEAP32[i3 + 20 >> 2] = -1;
+ HEAP32[i3 >> 2] = 5;
+ HEAP32[i3 + 8 >> 2] = 0;
+ HEAPF64[i3 + 8 >> 3] = +HEAPF64[i6 + 24 >> 3];
+ i8 = 20;
+ break;
+ }
+ case 271:
+ {
+ i9 = 1;
+ i8 = 8;
+ break;
+ }
+ case 289:
+ {
+ i8 = _luaK_stringK(i9, HEAP32[i6 + 24 >> 2] | 0) | 0;
+ HEAP32[i3 + 16 >> 2] = -1;
+ HEAP32[i3 + 20 >> 2] = -1;
+ HEAP32[i3 >> 2] = 4;
+ HEAP32[i3 + 8 >> 2] = i8;
+ i8 = 20;
+ break;
+ }
+ case 265:
+ {
+ _luaX_next(i6);
+ _body(i6, i3, 0, HEAP32[i6 + 4 >> 2] | 0);
+ break;
+ }
+ case 276:
+ {
+ HEAP32[i3 + 16 >> 2] = -1;
+ HEAP32[i3 + 20 >> 2] = -1;
+ HEAP32[i3 >> 2] = 2;
+ HEAP32[i3 + 8 >> 2] = 0;
+ i8 = 20;
+ break;
+ }
+ case 45:
+ {
+ i9 = 0;
+ i8 = 8;
+ break;
+ }
+ case 35:
+ {
+ i9 = 2;
+ i8 = 8;
+ break;
+ }
+ case 123:
+ {
+ _constructor(i6, i3);
+ break;
+ }
+ case 263:
+ {
+ HEAP32[i3 + 16 >> 2] = -1;
+ HEAP32[i3 + 20 >> 2] = -1;
+ HEAP32[i3 >> 2] = 3;
+ HEAP32[i3 + 8 >> 2] = 0;
+ i8 = 20;
+ break;
+ }
+ case 280:
+ {
+ if ((HEAP8[(HEAP32[i9 >> 2] | 0) + 77 | 0] | 0) == 0) {
+ _luaX_syntaxerror(i6, 6408);
+ } else {
+ i8 = _luaK_codeABC(i9, 38, 0, 1, 0) | 0;
+ HEAP32[i3 + 16 >> 2] = -1;
+ HEAP32[i3 + 20 >> 2] = -1;
+ HEAP32[i3 >> 2] = 13;
+ HEAP32[i3 + 8 >> 2] = i8;
+ i8 = 20;
+ break L8;
+ }
+ break;
+ }
+ case 270:
+ {
+ HEAP32[i3 + 16 >> 2] = -1;
+ HEAP32[i3 + 20 >> 2] = -1;
+ HEAP32[i3 >> 2] = 1;
+ HEAP32[i3 + 8 >> 2] = 0;
+ i8 = 20;
+ break;
+ }
+ default:
+ {
+ _suffixedexp(i6, i3);
+ }
+ }
+ } while (0);
+ if ((i8 | 0) == 8) {
+ i15 = HEAP32[i6 + 4 >> 2] | 0;
+ _luaX_next(i6);
+ _subexpr(i6, i3, 8) | 0;
+ _luaK_prefix(HEAP32[i4 >> 2] | 0, i9, i3, i15);
+ } else if ((i8 | 0) == 20) {
+ _luaX_next(i6);
+ }
+ switch (HEAP32[i10 >> 2] | 0) {
+ case 257:
+ {
+ i9 = 13;
+ break;
+ }
+ case 272:
+ {
+ i9 = 14;
+ break;
+ }
+ case 47:
+ {
+ i9 = 3;
+ break;
+ }
+ case 37:
+ {
+ i9 = 4;
+ break;
+ }
+ case 43:
+ {
+ i9 = 0;
+ break;
+ }
+ case 284:
+ {
+ i9 = 10;
+ break;
+ }
+ case 281:
+ {
+ i9 = 7;
+ break;
+ }
+ case 62:
+ {
+ i9 = 11;
+ break;
+ }
+ case 282:
+ {
+ i9 = 12;
+ break;
+ }
+ case 45:
+ {
+ i9 = 1;
+ break;
+ }
+ case 42:
+ {
+ i9 = 2;
+ break;
+ }
+ case 60:
+ {
+ i9 = 8;
+ break;
+ }
+ case 283:
+ {
+ i9 = 9;
+ break;
+ }
+ case 94:
+ {
+ i9 = 5;
+ break;
+ }
+ case 279:
+ {
+ i9 = 6;
+ break;
+ }
+ default:
+ {
+ i15 = 15;
+ i14 = HEAP32[i1 >> 2] | 0;
+ i14 = i14 + 38 | 0;
+ i13 = HEAP16[i14 >> 1] | 0;
+ i13 = i13 + -1 << 16 >> 16;
+ HEAP16[i14 >> 1] = i13;
+ STACKTOP = i2;
+ return i15 | 0;
+ }
+ }
+ i8 = i6 + 4 | 0;
+ while (1) {
+ if ((HEAPU8[6376 + (i9 << 1) | 0] | 0) <= (i7 | 0)) {
+ i8 = 39;
+ break;
+ }
+ i15 = HEAP32[i8 >> 2] | 0;
+ _luaX_next(i6);
+ _luaK_infix(HEAP32[i4 >> 2] | 0, i9, i3);
+ i10 = _subexpr(i6, i5, HEAPU8[6377 + (i9 << 1) | 0] | 0) | 0;
+ _luaK_posfix(HEAP32[i4 >> 2] | 0, i9, i3, i5, i15);
+ if ((i10 | 0) == 15) {
+ i9 = 15;
+ i8 = 39;
+ break;
+ } else {
+ i9 = i10;
+ }
+ }
+ if ((i8 | 0) == 39) {
+ i15 = HEAP32[i1 >> 2] | 0;
+ i15 = i15 + 38 | 0;
+ i14 = HEAP16[i15 >> 1] | 0;
+ i14 = i14 + -1 << 16 >> 16;
+ HEAP16[i15 >> 1] = i14;
+ STACKTOP = i2;
+ return i9 | 0;
+ }
+ return 0;
+}
+function _luaV_lessequal(i5, i3, i2) {
+ i5 = i5 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ var i1 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0;
+ i1 = STACKTOP;
+ i4 = i3 + 8 | 0;
+ i7 = HEAP32[i4 >> 2] | 0;
+ if ((i7 | 0) == 3) {
+ if ((HEAP32[i2 + 8 >> 2] | 0) == 3) {
+ i9 = +HEAPF64[i3 >> 3] <= +HEAPF64[i2 >> 3] | 0;
+ STACKTOP = i1;
+ return i9 | 0;
+ }
+ } else {
+ if ((i7 & 15 | 0) == 4 ? (HEAP32[i2 + 8 >> 2] & 15 | 0) == 4 : 0) {
+ i3 = HEAP32[i3 >> 2] | 0;
+ i6 = HEAP32[i2 >> 2] | 0;
+ i4 = i3 + 16 | 0;
+ i5 = i6 + 16 | 0;
+ i7 = _strcmp(i4, i5) | 0;
+ L8 : do {
+ if ((i7 | 0) == 0) {
+ i2 = HEAP32[i3 + 12 >> 2] | 0;
+ i3 = HEAP32[i6 + 12 >> 2] | 0;
+ i6 = i5;
+ while (1) {
+ i5 = _strlen(i4 | 0) | 0;
+ i7 = (i5 | 0) == (i2 | 0);
+ if ((i5 | 0) == (i3 | 0)) {
+ break;
+ }
+ if (i7) {
+ i7 = -1;
+ break L8;
+ }
+ i5 = i5 + 1 | 0;
+ i4 = i4 + i5 | 0;
+ i6 = i6 + i5 | 0;
+ i7 = _strcmp(i4, i6) | 0;
+ if ((i7 | 0) == 0) {
+ i2 = i2 - i5 | 0;
+ i3 = i3 - i5 | 0;
+ } else {
+ break L8;
+ }
+ }
+ i7 = i7 & 1 ^ 1;
+ }
+ } while (0);
+ i9 = (i7 | 0) < 1 | 0;
+ STACKTOP = i1;
+ return i9 | 0;
+ }
+ }
+ i7 = i5 + 8 | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ i9 = _luaT_gettmbyobj(i5, i3, 14) | 0;
+ if ((HEAP32[i9 + 8 >> 2] | 0) == 0) {
+ i9 = _luaT_gettmbyobj(i5, i2, 14) | 0;
+ if ((HEAP32[i9 + 8 >> 2] | 0) == 0) {
+ i8 = HEAP32[i7 >> 2] | 0;
+ i9 = _luaT_gettmbyobj(i5, i2, 13) | 0;
+ if ((HEAP32[i9 + 8 >> 2] | 0) == 0) {
+ i9 = _luaT_gettmbyobj(i5, i3, 13) | 0;
+ if ((HEAP32[i9 + 8 >> 2] | 0) == 0) {
+ _luaG_ordererror(i5, i3, i2);
+ } else {
+ i6 = i9;
+ }
+ } else {
+ i6 = i9;
+ }
+ i10 = i5 + 28 | 0;
+ i9 = i8 - (HEAP32[i10 >> 2] | 0) | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = i8 + 16;
+ i13 = i6;
+ i11 = HEAP32[i13 + 4 >> 2] | 0;
+ i12 = i8;
+ HEAP32[i12 >> 2] = HEAP32[i13 >> 2];
+ HEAP32[i12 + 4 >> 2] = i11;
+ HEAP32[i8 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ i8 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = i8 + 16;
+ i12 = i2;
+ i11 = HEAP32[i12 + 4 >> 2] | 0;
+ i6 = i8;
+ HEAP32[i6 >> 2] = HEAP32[i12 >> 2];
+ HEAP32[i6 + 4 >> 2] = i11;
+ HEAP32[i8 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ i2 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = i2 + 16;
+ i8 = i3;
+ i6 = HEAP32[i8 + 4 >> 2] | 0;
+ i3 = i2;
+ HEAP32[i3 >> 2] = HEAP32[i8 >> 2];
+ HEAP32[i3 + 4 >> 2] = i6;
+ HEAP32[i2 + 8 >> 2] = HEAP32[i4 >> 2];
+ _luaD_call(i5, (HEAP32[i7 >> 2] | 0) + -48 | 0, 1, HEAP8[(HEAP32[i5 + 16 >> 2] | 0) + 18 | 0] & 1);
+ i3 = HEAP32[i10 >> 2] | 0;
+ i2 = HEAP32[i7 >> 2] | 0;
+ i5 = i2 + -16 | 0;
+ HEAP32[i7 >> 2] = i5;
+ i6 = HEAP32[i5 + 4 >> 2] | 0;
+ i8 = i3 + i9 | 0;
+ HEAP32[i8 >> 2] = HEAP32[i5 >> 2];
+ HEAP32[i8 + 4 >> 2] = i6;
+ HEAP32[i3 + (i9 + 8) >> 2] = HEAP32[i2 + -8 >> 2];
+ i3 = HEAP32[i7 >> 2] | 0;
+ i2 = HEAP32[i3 + 8 >> 2] | 0;
+ if ((i2 | 0) != 0) {
+ if ((i2 | 0) == 1) {
+ i2 = (HEAP32[i3 >> 2] | 0) != 0;
+ } else {
+ i2 = 1;
+ }
+ } else {
+ i2 = 0;
+ }
+ i13 = i2 & 1 ^ 1;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ }
+ i10 = i5 + 28 | 0;
+ i13 = i8 - (HEAP32[i10 >> 2] | 0) | 0;
+ i11 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = i11 + 16;
+ i6 = i9;
+ i8 = HEAP32[i6 + 4 >> 2] | 0;
+ i12 = i11;
+ HEAP32[i12 >> 2] = HEAP32[i6 >> 2];
+ HEAP32[i12 + 4 >> 2] = i8;
+ HEAP32[i11 + 8 >> 2] = HEAP32[i9 + 8 >> 2];
+ i9 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = i9 + 16;
+ i11 = i3;
+ i12 = HEAP32[i11 + 4 >> 2] | 0;
+ i3 = i9;
+ HEAP32[i3 >> 2] = HEAP32[i11 >> 2];
+ HEAP32[i3 + 4 >> 2] = i12;
+ HEAP32[i9 + 8 >> 2] = HEAP32[i4 >> 2];
+ i3 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = i3 + 16;
+ i9 = i2;
+ i12 = HEAP32[i9 + 4 >> 2] | 0;
+ i11 = i3;
+ HEAP32[i11 >> 2] = HEAP32[i9 >> 2];
+ HEAP32[i11 + 4 >> 2] = i12;
+ HEAP32[i3 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ _luaD_call(i5, (HEAP32[i7 >> 2] | 0) + -48 | 0, 1, HEAP8[(HEAP32[i5 + 16 >> 2] | 0) + 18 | 0] & 1);
+ i2 = HEAP32[i10 >> 2] | 0;
+ i3 = HEAP32[i7 >> 2] | 0;
+ i10 = i3 + -16 | 0;
+ HEAP32[i7 >> 2] = i10;
+ i11 = HEAP32[i10 + 4 >> 2] | 0;
+ i12 = i2 + i13 | 0;
+ HEAP32[i12 >> 2] = HEAP32[i10 >> 2];
+ HEAP32[i12 + 4 >> 2] = i11;
+ HEAP32[i2 + (i13 + 8) >> 2] = HEAP32[i3 + -8 >> 2];
+ i2 = HEAP32[i7 >> 2] | 0;
+ i3 = HEAP32[i2 + 8 >> 2] | 0;
+ if ((i3 | 0) != 0) {
+ if ((i3 | 0) == 1) {
+ i2 = (HEAP32[i2 >> 2] | 0) != 0;
+ } else {
+ i2 = 1;
+ }
+ } else {
+ i2 = 0;
+ }
+ i13 = i2 & 1;
+ STACKTOP = i1;
+ return i13 | 0;
+}
+function ___udivmoddi4(i6, i8, i2, i4, i1) {
+ i6 = i6 | 0;
+ i8 = i8 | 0;
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ i1 = i1 | 0;
+ var i3 = 0, i5 = 0, i7 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0;
+ i5 = i6;
+ i9 = i8;
+ i7 = i9;
+ i10 = i2;
+ i3 = i4;
+ i11 = i3;
+ if ((i7 | 0) == 0) {
+ i2 = (i1 | 0) != 0;
+ if ((i11 | 0) == 0) {
+ if (i2) {
+ HEAP32[i1 >> 2] = (i5 >>> 0) % (i10 >>> 0);
+ HEAP32[i1 + 4 >> 2] = 0;
+ }
+ i11 = 0;
+ i12 = (i5 >>> 0) / (i10 >>> 0) >>> 0;
+ return (tempRet0 = i11, i12) | 0;
+ } else {
+ if (!i2) {
+ i11 = 0;
+ i12 = 0;
+ return (tempRet0 = i11, i12) | 0;
+ }
+ HEAP32[i1 >> 2] = i6 | 0;
+ HEAP32[i1 + 4 >> 2] = i8 & 0;
+ i11 = 0;
+ i12 = 0;
+ return (tempRet0 = i11, i12) | 0;
+ }
+ }
+ i12 = (i11 | 0) == 0;
+ do {
+ if ((i10 | 0) != 0) {
+ if (!i12) {
+ i10 = (_llvm_ctlz_i32(i11 | 0) | 0) - (_llvm_ctlz_i32(i7 | 0) | 0) | 0;
+ if (i10 >>> 0 <= 31) {
+ i11 = i10 + 1 | 0;
+ i12 = 31 - i10 | 0;
+ i8 = i10 - 31 >> 31;
+ i9 = i11;
+ i6 = i5 >>> (i11 >>> 0) & i8 | i7 << i12;
+ i8 = i7 >>> (i11 >>> 0) & i8;
+ i11 = 0;
+ i7 = i5 << i12;
+ break;
+ }
+ if ((i1 | 0) == 0) {
+ i11 = 0;
+ i12 = 0;
+ return (tempRet0 = i11, i12) | 0;
+ }
+ HEAP32[i1 >> 2] = i6 | 0;
+ HEAP32[i1 + 4 >> 2] = i9 | i8 & 0;
+ i11 = 0;
+ i12 = 0;
+ return (tempRet0 = i11, i12) | 0;
+ }
+ i11 = i10 - 1 | 0;
+ if ((i11 & i10 | 0) != 0) {
+ i12 = (_llvm_ctlz_i32(i10 | 0) | 0) + 33 - (_llvm_ctlz_i32(i7 | 0) | 0) | 0;
+ i15 = 64 - i12 | 0;
+ i10 = 32 - i12 | 0;
+ i13 = i10 >> 31;
+ i14 = i12 - 32 | 0;
+ i8 = i14 >> 31;
+ i9 = i12;
+ i6 = i10 - 1 >> 31 & i7 >>> (i14 >>> 0) | (i7 << i10 | i5 >>> (i12 >>> 0)) & i8;
+ i8 = i8 & i7 >>> (i12 >>> 0);
+ i11 = i5 << i15 & i13;
+ i7 = (i7 << i15 | i5 >>> (i14 >>> 0)) & i13 | i5 << i10 & i12 - 33 >> 31;
+ break;
+ }
+ if ((i1 | 0) != 0) {
+ HEAP32[i1 >> 2] = i11 & i5;
+ HEAP32[i1 + 4 >> 2] = 0;
+ }
+ if ((i10 | 0) == 1) {
+ i14 = i9 | i8 & 0;
+ i15 = i6 | 0 | 0;
+ return (tempRet0 = i14, i15) | 0;
+ } else {
+ i15 = _llvm_cttz_i32(i10 | 0) | 0;
+ i14 = i7 >>> (i15 >>> 0) | 0;
+ i15 = i7 << 32 - i15 | i5 >>> (i15 >>> 0) | 0;
+ return (tempRet0 = i14, i15) | 0;
+ }
+ } else {
+ if (i12) {
+ if ((i1 | 0) != 0) {
+ HEAP32[i1 >> 2] = (i7 >>> 0) % (i10 >>> 0);
+ HEAP32[i1 + 4 >> 2] = 0;
+ }
+ i14 = 0;
+ i15 = (i7 >>> 0) / (i10 >>> 0) >>> 0;
+ return (tempRet0 = i14, i15) | 0;
+ }
+ if ((i5 | 0) == 0) {
+ if ((i1 | 0) != 0) {
+ HEAP32[i1 >> 2] = 0;
+ HEAP32[i1 + 4 >> 2] = (i7 >>> 0) % (i11 >>> 0);
+ }
+ i14 = 0;
+ i15 = (i7 >>> 0) / (i11 >>> 0) >>> 0;
+ return (tempRet0 = i14, i15) | 0;
+ }
+ i10 = i11 - 1 | 0;
+ if ((i10 & i11 | 0) == 0) {
+ if ((i1 | 0) != 0) {
+ HEAP32[i1 >> 2] = i6 | 0;
+ HEAP32[i1 + 4 >> 2] = i10 & i7 | i8 & 0;
+ }
+ i14 = 0;
+ i15 = i7 >>> ((_llvm_cttz_i32(i11 | 0) | 0) >>> 0);
+ return (tempRet0 = i14, i15) | 0;
+ }
+ i10 = (_llvm_ctlz_i32(i11 | 0) | 0) - (_llvm_ctlz_i32(i7 | 0) | 0) | 0;
+ if (i10 >>> 0 <= 30) {
+ i8 = i10 + 1 | 0;
+ i15 = 31 - i10 | 0;
+ i9 = i8;
+ i6 = i7 << i15 | i5 >>> (i8 >>> 0);
+ i8 = i7 >>> (i8 >>> 0);
+ i11 = 0;
+ i7 = i5 << i15;
+ break;
+ }
+ if ((i1 | 0) == 0) {
+ i14 = 0;
+ i15 = 0;
+ return (tempRet0 = i14, i15) | 0;
+ }
+ HEAP32[i1 >> 2] = i6 | 0;
+ HEAP32[i1 + 4 >> 2] = i9 | i8 & 0;
+ i14 = 0;
+ i15 = 0;
+ return (tempRet0 = i14, i15) | 0;
+ }
+ } while (0);
+ if ((i9 | 0) == 0) {
+ i12 = i6;
+ i2 = 0;
+ i6 = 0;
+ } else {
+ i2 = i2 | 0 | 0;
+ i3 = i3 | i4 & 0;
+ i4 = _i64Add(i2, i3, -1, -1) | 0;
+ i5 = tempRet0;
+ i10 = i8;
+ i12 = i6;
+ i6 = 0;
+ while (1) {
+ i8 = i11 >>> 31 | i7 << 1;
+ i11 = i6 | i11 << 1;
+ i7 = i12 << 1 | i7 >>> 31 | 0;
+ i10 = i12 >>> 31 | i10 << 1 | 0;
+ _i64Subtract(i4, i5, i7, i10) | 0;
+ i12 = tempRet0;
+ i15 = i12 >> 31 | ((i12 | 0) < 0 ? -1 : 0) << 1;
+ i6 = i15 & 1;
+ i12 = _i64Subtract(i7, i10, i15 & i2, (((i12 | 0) < 0 ? -1 : 0) >> 31 | ((i12 | 0) < 0 ? -1 : 0) << 1) & i3) | 0;
+ i10 = tempRet0;
+ i9 = i9 - 1 | 0;
+ if ((i9 | 0) == 0) {
+ break;
+ } else {
+ i7 = i8;
+ }
+ }
+ i7 = i8;
+ i8 = i10;
+ i2 = 0;
+ }
+ i3 = 0;
+ if ((i1 | 0) != 0) {
+ HEAP32[i1 >> 2] = i12;
+ HEAP32[i1 + 4 >> 2] = i8;
+ }
+ i14 = (i11 | 0) >>> 31 | (i7 | i3) << 1 | (i3 << 1 | i11 >>> 31) & 0 | i2;
+ i15 = (i11 << 1 | 0 >>> 31) & -2 | i6;
+ return (tempRet0 = i14, i15) | 0;
+}
+function _leaveblock(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i5 = i3;
+ i7 = i1 + 16 | 0;
+ i4 = HEAP32[i7 >> 2] | 0;
+ i2 = i1 + 12 | 0;
+ i6 = HEAP32[i2 >> 2] | 0;
+ if ((HEAP32[i4 >> 2] | 0) != 0 ? (HEAP8[i4 + 9 | 0] | 0) != 0 : 0) {
+ i16 = _luaK_jump(i1) | 0;
+ _luaK_patchclose(i1, i16, HEAPU8[i4 + 8 | 0] | 0);
+ _luaK_patchtohere(i1, i16);
+ }
+ L5 : do {
+ if ((HEAP8[i4 + 10 | 0] | 0) != 0) {
+ i15 = i6 + 52 | 0;
+ i14 = _luaS_new(HEAP32[i15 >> 2] | 0, 6304) | 0;
+ i13 = i6 + 64 | 0;
+ i16 = HEAP32[i13 >> 2] | 0;
+ i10 = i16 + 24 | 0;
+ i8 = i6 + 48 | 0;
+ i11 = HEAP32[(HEAP32[i8 >> 2] | 0) + 20 >> 2] | 0;
+ i12 = i16 + 28 | 0;
+ i9 = HEAP32[i12 >> 2] | 0;
+ i16 = i16 + 32 | 0;
+ if ((i9 | 0) < (HEAP32[i16 >> 2] | 0)) {
+ i15 = HEAP32[i10 >> 2] | 0;
+ } else {
+ i15 = _luaM_growaux_(HEAP32[i15 >> 2] | 0, HEAP32[i10 >> 2] | 0, i16, 16, 32767, 6312) | 0;
+ HEAP32[i10 >> 2] = i15;
+ }
+ HEAP32[i15 + (i9 << 4) >> 2] = i14;
+ i16 = HEAP32[i10 >> 2] | 0;
+ HEAP32[i16 + (i9 << 4) + 8 >> 2] = 0;
+ HEAP8[i16 + (i9 << 4) + 12 | 0] = HEAP8[(HEAP32[i8 >> 2] | 0) + 46 | 0] | 0;
+ HEAP32[(HEAP32[i10 >> 2] | 0) + (i9 << 4) + 4 >> 2] = i11;
+ HEAP32[i12 >> 2] = (HEAP32[i12 >> 2] | 0) + 1;
+ i10 = HEAP32[i13 >> 2] | 0;
+ i9 = (HEAP32[i10 + 24 >> 2] | 0) + (i9 << 4) | 0;
+ i11 = HEAP16[(HEAP32[(HEAP32[i8 >> 2] | 0) + 16 >> 2] | 0) + 6 >> 1] | 0;
+ i8 = i10 + 16 | 0;
+ if ((i11 | 0) < (HEAP32[i8 >> 2] | 0)) {
+ i10 = i10 + 12 | 0;
+ do {
+ while (1) {
+ if ((_luaS_eqstr(HEAP32[(HEAP32[i10 >> 2] | 0) + (i11 << 4) >> 2] | 0, HEAP32[i9 >> 2] | 0) | 0) == 0) {
+ break;
+ }
+ _closegoto(i6, i11, i9);
+ if ((i11 | 0) >= (HEAP32[i8 >> 2] | 0)) {
+ break L5;
+ }
+ }
+ i11 = i11 + 1 | 0;
+ } while ((i11 | 0) < (HEAP32[i8 >> 2] | 0));
+ }
+ }
+ } while (0);
+ HEAP32[i7 >> 2] = HEAP32[i4 >> 2];
+ i7 = i4 + 8 | 0;
+ i9 = HEAP8[i7] | 0;
+ i10 = i1 + 46 | 0;
+ i8 = (HEAP32[i2 >> 2] | 0) + 64 | 0;
+ i14 = (HEAP32[i8 >> 2] | 0) + 4 | 0;
+ HEAP32[i14 >> 2] = (i9 & 255) - (HEAPU8[i10] | 0) + (HEAP32[i14 >> 2] | 0);
+ i14 = HEAP8[i10] | 0;
+ if ((i14 & 255) > (i9 & 255)) {
+ i13 = i1 + 20 | 0;
+ i11 = i1 + 40 | 0;
+ i12 = (HEAP32[i1 >> 2] | 0) + 24 | 0;
+ do {
+ i16 = HEAP32[i13 >> 2] | 0;
+ i14 = i14 + -1 << 24 >> 24;
+ HEAP8[i10] = i14;
+ HEAP32[(HEAP32[i12 >> 2] | 0) + ((HEAP16[(HEAP32[HEAP32[i8 >> 2] >> 2] | 0) + ((HEAP32[i11 >> 2] | 0) + (i14 & 255) << 1) >> 1] | 0) * 12 | 0) + 8 >> 2] = i16;
+ i14 = HEAP8[i10] | 0;
+ } while ((i14 & 255) > (i9 & 255));
+ }
+ HEAP8[i1 + 48 | 0] = i14;
+ i10 = HEAP32[i6 + 64 >> 2] | 0;
+ HEAP32[i10 + 28 >> 2] = HEAP16[i4 + 4 >> 1] | 0;
+ i9 = HEAP16[i4 + 6 >> 1] | 0;
+ if ((HEAP32[i4 >> 2] | 0) == 0) {
+ if ((i9 | 0) >= (HEAP32[i10 + 16 >> 2] | 0)) {
+ STACKTOP = i3;
+ return;
+ }
+ i10 = HEAP32[i10 + 12 >> 2] | 0;
+ i11 = HEAP32[i10 + (i9 << 4) >> 2] | 0;
+ if ((HEAP8[i11 + 4 | 0] | 0) != 4) {
+ i16 = 6200;
+ i15 = i6 + 52 | 0;
+ i15 = HEAP32[i15 >> 2] | 0;
+ i14 = i11 + 16 | 0;
+ i13 = i10 + (i9 << 4) + 8 | 0;
+ i13 = HEAP32[i13 >> 2] | 0;
+ HEAP32[i5 >> 2] = i14;
+ i14 = i5 + 4 | 0;
+ HEAP32[i14 >> 2] = i13;
+ i16 = _luaO_pushfstring(i15, i16, i5) | 0;
+ _semerror(i6, i16);
+ }
+ i16 = (HEAP8[i11 + 6 | 0] | 0) != 0 ? 6160 : 6200;
+ i15 = i6 + 52 | 0;
+ i15 = HEAP32[i15 >> 2] | 0;
+ i14 = i11 + 16 | 0;
+ i13 = i10 + (i9 << 4) + 8 | 0;
+ i13 = HEAP32[i13 >> 2] | 0;
+ HEAP32[i5 >> 2] = i14;
+ i14 = i5 + 4 | 0;
+ HEAP32[i14 >> 2] = i13;
+ i16 = _luaO_pushfstring(i15, i16, i5) | 0;
+ _semerror(i6, i16);
+ }
+ i6 = HEAP32[i8 >> 2] | 0;
+ i5 = i6 + 16 | 0;
+ if ((i9 | 0) >= (HEAP32[i5 >> 2] | 0)) {
+ STACKTOP = i3;
+ return;
+ }
+ i6 = i6 + 12 | 0;
+ i4 = i4 + 9 | 0;
+ do {
+ i10 = HEAP32[i6 >> 2] | 0;
+ i8 = i10 + (i9 << 4) + 12 | 0;
+ i11 = HEAP8[i7] | 0;
+ i12 = i11 & 255;
+ if ((HEAPU8[i8] | 0) > (i11 & 255)) {
+ if ((HEAP8[i4] | 0) != 0) {
+ _luaK_patchclose(i1, HEAP32[i10 + (i9 << 4) + 4 >> 2] | 0, i12);
+ i11 = HEAP8[i7] | 0;
+ }
+ HEAP8[i8] = i11;
+ }
+ i9 = ((_findlabel(HEAP32[i2 >> 2] | 0, i9) | 0) == 0) + i9 | 0;
+ } while ((i9 | 0) < (HEAP32[i5 >> 2] | 0));
+ STACKTOP = i3;
+ return;
+}
+function _getobjname(i3, i7, i9, i2) {
+ i3 = i3 | 0;
+ i7 = i7 | 0;
+ i9 = i9 | 0;
+ i2 = i2 | 0;
+ var i1 = 0, i4 = 0, i5 = 0, i6 = 0, i8 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0;
+ i1 = STACKTOP;
+ i4 = i3 + 12 | 0;
+ L1 : while (1) {
+ i13 = _luaF_getlocalname(i3, i9 + 1 | 0, i7) | 0;
+ HEAP32[i2 >> 2] = i13;
+ if ((i13 | 0) != 0) {
+ i2 = 2040;
+ i4 = 42;
+ break;
+ }
+ if ((i7 | 0) <= 0) {
+ i2 = 0;
+ i4 = 42;
+ break;
+ }
+ i6 = HEAP32[i4 >> 2] | 0;
+ i8 = 0;
+ i5 = -1;
+ do {
+ i12 = HEAP32[i6 + (i8 << 2) >> 2] | 0;
+ i13 = i12 & 63;
+ i11 = i12 >>> 6 & 255;
+ switch (i13 | 0) {
+ case 27:
+ {
+ i10 = i8;
+ i5 = (i11 | 0) == (i9 | 0) ? i8 : i5;
+ break;
+ }
+ case 30:
+ case 29:
+ {
+ i10 = i8;
+ i5 = (i11 | 0) > (i9 | 0) ? i5 : i8;
+ break;
+ }
+ case 23:
+ {
+ i10 = (i12 >>> 14) + -131071 | 0;
+ i13 = i8 + 1 + i10 | 0;
+ i10 = ((i8 | 0) >= (i13 | 0) | (i13 | 0) > (i7 | 0) ? 0 : i10) + i8 | 0;
+ break;
+ }
+ case 4:
+ {
+ if ((i11 | 0) > (i9 | 0)) {
+ i10 = i8;
+ } else {
+ i10 = i8;
+ i5 = (i11 + (i12 >>> 23) | 0) < (i9 | 0) ? i5 : i8;
+ }
+ break;
+ }
+ case 34:
+ {
+ i10 = i8;
+ i5 = (i11 + 2 | 0) > (i9 | 0) ? i5 : i8;
+ break;
+ }
+ default:
+ {
+ i10 = i8;
+ i5 = (HEAP8[5584 + i13 | 0] & 64) != 0 & (i11 | 0) == (i9 | 0) ? i8 : i5;
+ }
+ }
+ i8 = i10 + 1 | 0;
+ } while ((i8 | 0) < (i7 | 0));
+ if ((i5 | 0) == -1) {
+ i2 = 0;
+ i4 = 42;
+ break;
+ }
+ i7 = HEAP32[i6 + (i5 << 2) >> 2] | 0;
+ i9 = i7 & 63;
+ switch (i9 | 0) {
+ case 0:
+ {
+ break;
+ }
+ case 7:
+ case 6:
+ {
+ i4 = 17;
+ break L1;
+ }
+ case 5:
+ {
+ i4 = 29;
+ break L1;
+ }
+ case 1:
+ {
+ i4 = 32;
+ break L1;
+ }
+ case 2:
+ {
+ i4 = 33;
+ break L1;
+ }
+ case 12:
+ {
+ i4 = 36;
+ break L1;
+ }
+ default:
+ {
+ i2 = 0;
+ i4 = 42;
+ break L1;
+ }
+ }
+ i9 = i7 >>> 23;
+ if (i9 >>> 0 < (i7 >>> 6 & 255) >>> 0) {
+ i7 = i5;
+ } else {
+ i2 = 0;
+ i4 = 42;
+ break;
+ }
+ }
+ if ((i4 | 0) == 17) {
+ i6 = i7 >>> 14;
+ i8 = i6 & 511;
+ i7 = i7 >>> 23;
+ if ((i9 | 0) != 7) {
+ i7 = HEAP32[(HEAP32[i3 + 28 >> 2] | 0) + (i7 << 3) >> 2] | 0;
+ if ((i7 | 0) == 0) {
+ i7 = 2104;
+ } else {
+ i7 = i7 + 16 | 0;
+ }
+ } else {
+ i7 = _luaF_getlocalname(i3, i7 + 1 | 0, i5) | 0;
+ }
+ if ((i6 & 256 | 0) == 0) {
+ i3 = _getobjname(i3, i5, i8, i2) | 0;
+ if (!((i3 | 0) != 0 ? (HEAP8[i3] | 0) == 99 : 0)) {
+ i4 = 26;
+ }
+ } else {
+ i5 = i6 & 255;
+ i3 = HEAP32[i3 + 8 >> 2] | 0;
+ if ((HEAP32[i3 + (i5 << 4) + 8 >> 2] & 15 | 0) == 4) {
+ HEAP32[i2 >> 2] = (HEAP32[i3 + (i5 << 4) >> 2] | 0) + 16;
+ } else {
+ i4 = 26;
+ }
+ }
+ if ((i4 | 0) == 26) {
+ HEAP32[i2 >> 2] = 2104;
+ }
+ if ((i7 | 0) == 0) {
+ i13 = 2064;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ i13 = (_strcmp(i7, 2048) | 0) == 0;
+ i13 = i13 ? 2056 : 2064;
+ STACKTOP = i1;
+ return i13 | 0;
+ } else if ((i4 | 0) == 29) {
+ i3 = HEAP32[(HEAP32[i3 + 28 >> 2] | 0) + (i7 >>> 23 << 3) >> 2] | 0;
+ if ((i3 | 0) == 0) {
+ i3 = 2104;
+ } else {
+ i3 = i3 + 16 | 0;
+ }
+ HEAP32[i2 >> 2] = i3;
+ i13 = 2072;
+ STACKTOP = i1;
+ return i13 | 0;
+ } else if ((i4 | 0) == 32) {
+ i5 = i7 >>> 14;
+ } else if ((i4 | 0) == 33) {
+ i5 = (HEAP32[i6 + (i5 + 1 << 2) >> 2] | 0) >>> 6;
+ } else if ((i4 | 0) == 36) {
+ i4 = i7 >>> 14;
+ if ((i4 & 256 | 0) == 0) {
+ i3 = _getobjname(i3, i5, i4 & 511, i2) | 0;
+ if ((i3 | 0) != 0 ? (HEAP8[i3] | 0) == 99 : 0) {
+ i13 = 2096;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ } else {
+ i4 = i4 & 255;
+ i3 = HEAP32[i3 + 8 >> 2] | 0;
+ if ((HEAP32[i3 + (i4 << 4) + 8 >> 2] & 15 | 0) == 4) {
+ HEAP32[i2 >> 2] = (HEAP32[i3 + (i4 << 4) >> 2] | 0) + 16;
+ i13 = 2096;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ }
+ HEAP32[i2 >> 2] = 2104;
+ i13 = 2096;
+ STACKTOP = i1;
+ return i13 | 0;
+ } else if ((i4 | 0) == 42) {
+ STACKTOP = i1;
+ return i2 | 0;
+ }
+ i3 = HEAP32[i3 + 8 >> 2] | 0;
+ if ((HEAP32[i3 + (i5 << 4) + 8 >> 2] & 15 | 0) != 4) {
+ i13 = 0;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ HEAP32[i2 >> 2] = (HEAP32[i3 + (i5 << 4) >> 2] | 0) + 16;
+ i13 = 2080;
+ STACKTOP = i1;
+ return i13 | 0;
+}
+function _assignment(i2, i16, i5) {
+ i2 = i2 | 0;
+ i16 = i16 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 80 | 0;
+ i6 = i3 + 56 | 0;
+ i1 = i3 + 32 | 0;
+ i8 = i3;
+ i4 = i16 + 8 | 0;
+ if (!(((HEAP32[i4 >> 2] | 0) + -7 | 0) >>> 0 < 3)) {
+ _luaX_syntaxerror(i2, 6344);
+ }
+ i13 = i2 + 16 | 0;
+ i14 = HEAP32[i13 >> 2] | 0;
+ do {
+ if ((i14 | 0) == 44) {
+ _luaX_next(i2);
+ HEAP32[i8 >> 2] = i16;
+ i14 = i8 + 8 | 0;
+ _suffixedexp(i2, i14);
+ i15 = i2 + 48 | 0;
+ if ((HEAP32[i14 >> 2] | 0) != 9 ? (i10 = HEAP32[i15 >> 2] | 0, i11 = HEAP8[i10 + 48 | 0] | 0, i9 = i11 & 255, (i16 | 0) != 0) : 0) {
+ i13 = i8 + 16 | 0;
+ i12 = i11 & 255;
+ i18 = 0;
+ do {
+ if ((HEAP32[i16 + 8 >> 2] | 0) == 9) {
+ i17 = i16 + 16 | 0;
+ i19 = i17 + 3 | 0;
+ i20 = HEAPU8[i19] | 0;
+ i21 = HEAP32[i14 >> 2] | 0;
+ if ((i20 | 0) == (i21 | 0)) {
+ i21 = i17 + 2 | 0;
+ if ((HEAPU8[i21] | 0) == (HEAP32[i13 >> 2] | 0)) {
+ HEAP8[i19] = 7;
+ HEAP8[i21] = i11;
+ i20 = HEAP32[i14 >> 2] | 0;
+ i18 = 1;
+ }
+ } else {
+ i20 = i21;
+ }
+ if ((i20 | 0) == 7 ? (HEAP16[i17 >> 1] | 0) == (HEAP32[i13 >> 2] | 0) : 0) {
+ HEAP16[i17 >> 1] = i12;
+ i18 = 1;
+ }
+ }
+ i16 = HEAP32[i16 >> 2] | 0;
+ } while ((i16 | 0) != 0);
+ if ((i18 | 0) != 0) {
+ _luaK_codeABC(i10, (HEAP32[i14 >> 2] | 0) == 7 ? 0 : 5, i9, HEAP32[i13 >> 2] | 0, 0) | 0;
+ _luaK_reserveregs(i10, 1);
+ }
+ }
+ i9 = HEAP32[i15 >> 2] | 0;
+ if (((HEAPU16[(HEAP32[i2 + 52 >> 2] | 0) + 38 >> 1] | 0) + i5 | 0) <= 200) {
+ _assignment(i2, i8, i5 + 1 | 0);
+ i7 = i1;
+ break;
+ }
+ i8 = i9 + 12 | 0;
+ i5 = HEAP32[(HEAP32[i8 >> 2] | 0) + 52 >> 2] | 0;
+ i9 = HEAP32[(HEAP32[i9 >> 2] | 0) + 64 >> 2] | 0;
+ if ((i9 | 0) == 0) {
+ i20 = 6552;
+ HEAP32[i6 >> 2] = 6360;
+ i21 = i6 + 4 | 0;
+ HEAP32[i21 >> 2] = 200;
+ i21 = i6 + 8 | 0;
+ HEAP32[i21 >> 2] = i20;
+ i21 = _luaO_pushfstring(i5, 6592, i6) | 0;
+ i20 = HEAP32[i8 >> 2] | 0;
+ _luaX_syntaxerror(i20, i21);
+ }
+ HEAP32[i6 >> 2] = i9;
+ i20 = _luaO_pushfstring(i5, 6568, i6) | 0;
+ HEAP32[i6 >> 2] = 6360;
+ i21 = i6 + 4 | 0;
+ HEAP32[i21 >> 2] = 200;
+ i21 = i6 + 8 | 0;
+ HEAP32[i21 >> 2] = i20;
+ i21 = _luaO_pushfstring(i5, 6592, i6) | 0;
+ i20 = HEAP32[i8 >> 2] | 0;
+ _luaX_syntaxerror(i20, i21);
+ } else if ((i14 | 0) == 61) {
+ _luaX_next(i2);
+ _subexpr(i2, i1, 0) | 0;
+ i6 = i2 + 48 | 0;
+ if ((HEAP32[i13 >> 2] | 0) == 44) {
+ i9 = 1;
+ do {
+ _luaX_next(i2);
+ _luaK_exp2nextreg(HEAP32[i6 >> 2] | 0, i1);
+ _subexpr(i2, i1, 0) | 0;
+ i9 = i9 + 1 | 0;
+ } while ((HEAP32[i13 >> 2] | 0) == 44);
+ } else {
+ i9 = 1;
+ }
+ i8 = HEAP32[i6 >> 2] | 0;
+ if ((i9 | 0) == (i5 | 0)) {
+ _luaK_setoneret(i8, i1);
+ _luaK_storevar(HEAP32[i6 >> 2] | 0, i4, i1);
+ STACKTOP = i3;
+ return;
+ }
+ i7 = i5 - i9 | 0;
+ i10 = HEAP32[i1 >> 2] | 0;
+ if ((i10 | 0) == 13 | (i10 | 0) == 12) {
+ i10 = i7 + 1 | 0;
+ i10 = (i10 | 0) < 0 ? 0 : i10;
+ _luaK_setreturns(i8, i1, i10);
+ if ((i10 | 0) > 1) {
+ _luaK_reserveregs(i8, i10 + -1 | 0);
+ }
+ } else if ((i10 | 0) == 0) {
+ i12 = 30;
+ } else {
+ _luaK_exp2nextreg(i8, i1);
+ i12 = 30;
+ }
+ if ((i12 | 0) == 30 ? (i7 | 0) > 0 : 0) {
+ i21 = HEAPU8[i8 + 48 | 0] | 0;
+ _luaK_reserveregs(i8, i7);
+ _luaK_nil(i8, i21, i7);
+ }
+ if ((i9 | 0) > (i5 | 0)) {
+ i21 = (HEAP32[i6 >> 2] | 0) + 48 | 0;
+ HEAP8[i21] = i7 + (HEAPU8[i21] | 0);
+ i7 = i1;
+ } else {
+ i7 = i1;
+ }
+ } else {
+ _error_expected(i2, 61);
+ }
+ } while (0);
+ i21 = HEAP32[i2 + 48 >> 2] | 0;
+ i20 = (HEAPU8[i21 + 48 | 0] | 0) + -1 | 0;
+ HEAP32[i1 + 16 >> 2] = -1;
+ HEAP32[i1 + 20 >> 2] = -1;
+ HEAP32[i7 >> 2] = 6;
+ HEAP32[i1 + 8 >> 2] = i20;
+ _luaK_storevar(i21, i4, i1);
+ STACKTOP = i3;
+ return;
+}
+function _str_find_aux(i3, i7) {
+ i3 = i3 | 0;
+ i7 = i7 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i5 = 0, i6 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 288 | 0;
+ i9 = i1 + 284 | 0;
+ i5 = i1 + 280 | 0;
+ i4 = i1;
+ i2 = _luaL_checklstring(i3, 1, i9) | 0;
+ i8 = _luaL_checklstring(i3, 2, i5) | 0;
+ i12 = _luaL_optinteger(i3, 3, 1) | 0;
+ i10 = HEAP32[i9 >> 2] | 0;
+ if (!((i12 | 0) > -1)) {
+ if (i10 >>> 0 < (0 - i12 | 0) >>> 0) {
+ i12 = 1;
+ } else {
+ i12 = i12 + 1 + i10 | 0;
+ i6 = 4;
+ }
+ } else {
+ i6 = 4;
+ }
+ if ((i6 | 0) == 4) {
+ if ((i12 | 0) != 0) {
+ if (i12 >>> 0 > (i10 + 1 | 0) >>> 0) {
+ _lua_pushnil(i3);
+ i13 = 1;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ } else {
+ i12 = 1;
+ }
+ }
+ i7 = (i7 | 0) != 0;
+ L10 : do {
+ if (i7) {
+ i13 = (_lua_toboolean(i3, 4) | 0) == 0;
+ i10 = HEAP32[i5 >> 2] | 0;
+ if (i13) {
+ i11 = 0;
+ do {
+ i13 = i8 + i11 | 0;
+ if ((_strpbrk(i13, 7512) | 0) != 0) {
+ i6 = 20;
+ break L10;
+ }
+ i11 = i11 + 1 + (_strlen(i13 | 0) | 0) | 0;
+ } while (!(i11 >>> 0 > i10 >>> 0));
+ }
+ i11 = i2 + (i12 + -1) | 0;
+ i9 = (HEAP32[i9 >> 2] | 0) - i12 + 1 | 0;
+ L17 : do {
+ if ((i10 | 0) == 0) {
+ if ((i11 | 0) == 0) {
+ break L10;
+ }
+ } else {
+ if (i10 >>> 0 > i9 >>> 0) {
+ break L10;
+ }
+ i4 = i10 + -1 | 0;
+ if ((i4 | 0) == (i9 | 0)) {
+ break L10;
+ }
+ i7 = HEAP8[i8] | 0;
+ i8 = i8 + 1 | 0;
+ i9 = i9 - i4 | 0;
+ i12 = i11;
+ while (1) {
+ i11 = _memchr(i12, i7, i9) | 0;
+ if ((i11 | 0) == 0) {
+ break L10;
+ }
+ i10 = i11 + 1 | 0;
+ if ((_memcmp(i10, i8, i4) | 0) == 0) {
+ break L17;
+ }
+ i11 = i10;
+ i9 = i12 + i9 | 0;
+ if ((i9 | 0) == (i11 | 0)) {
+ break L10;
+ } else {
+ i9 = i9 - i11 | 0;
+ i12 = i10;
+ }
+ }
+ }
+ } while (0);
+ i13 = i11 - i2 | 0;
+ _lua_pushinteger(i3, i13 + 1 | 0);
+ _lua_pushinteger(i3, i13 + (HEAP32[i5 >> 2] | 0) | 0);
+ i13 = 2;
+ STACKTOP = i1;
+ return i13 | 0;
+ } else {
+ i6 = 20;
+ }
+ } while (0);
+ L28 : do {
+ if ((i6 | 0) == 20) {
+ i6 = i2 + (i12 + -1) | 0;
+ i10 = (HEAP8[i8] | 0) == 94;
+ if (i10) {
+ i12 = (HEAP32[i5 >> 2] | 0) + -1 | 0;
+ HEAP32[i5 >> 2] = i12;
+ i8 = i8 + 1 | 0;
+ } else {
+ i12 = HEAP32[i5 >> 2] | 0;
+ }
+ i5 = i4 + 16 | 0;
+ HEAP32[i5 >> 2] = i3;
+ HEAP32[i4 >> 2] = 200;
+ HEAP32[i4 + 4 >> 2] = i2;
+ i11 = i4 + 8 | 0;
+ HEAP32[i11 >> 2] = i2 + (HEAP32[i9 >> 2] | 0);
+ HEAP32[i4 + 12 >> 2] = i8 + i12;
+ i9 = i4 + 20 | 0;
+ L34 : do {
+ if (i10) {
+ HEAP32[i9 >> 2] = 0;
+ i8 = _match(i4, i6, i8) | 0;
+ if ((i8 | 0) == 0) {
+ break L28;
+ }
+ } else {
+ while (1) {
+ HEAP32[i9 >> 2] = 0;
+ i10 = _match(i4, i6, i8) | 0;
+ if ((i10 | 0) != 0) {
+ i8 = i10;
+ break L34;
+ }
+ if (!(i6 >>> 0 < (HEAP32[i11 >> 2] | 0) >>> 0)) {
+ break L28;
+ }
+ i6 = i6 + 1 | 0;
+ }
+ }
+ } while (0);
+ if (i7) {
+ _lua_pushinteger(i3, 1 - i2 + i6 | 0);
+ _lua_pushinteger(i3, i8 - i2 | 0);
+ i2 = HEAP32[i9 >> 2] | 0;
+ _luaL_checkstack(HEAP32[i5 >> 2] | 0, i2, 7200);
+ if ((i2 | 0) > 0) {
+ i3 = 0;
+ do {
+ _push_onecapture(i4, i3, 0, 0);
+ i3 = i3 + 1 | 0;
+ } while ((i3 | 0) != (i2 | 0));
+ }
+ i13 = i2 + 2 | 0;
+ STACKTOP = i1;
+ return i13 | 0;
+ } else {
+ i3 = HEAP32[i9 >> 2] | 0;
+ i2 = (i3 | 0) != 0 | (i6 | 0) == 0 ? i3 : 1;
+ _luaL_checkstack(HEAP32[i5 >> 2] | 0, i2, 7200);
+ if ((i2 | 0) > 0) {
+ i3 = 0;
+ } else {
+ i13 = i3;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ do {
+ _push_onecapture(i4, i3, i6, i8);
+ i3 = i3 + 1 | 0;
+ } while ((i3 | 0) != (i2 | 0));
+ STACKTOP = i1;
+ return i2 | 0;
+ }
+ }
+ } while (0);
+ _lua_pushnil(i3);
+ i13 = 1;
+ STACKTOP = i1;
+ return i13 | 0;
+}
+function _luaO_pushvfstring(i2, i13, i10) {
+ i2 = i2 | 0;
+ i13 = i13 | 0;
+ i10 = i10 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i11 = 0, i12 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, d18 = 0.0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 48 | 0;
+ i7 = i3;
+ i9 = i3 + 32 | 0;
+ i8 = i3 + 8 | 0;
+ i14 = _strchr(i13, 37) | 0;
+ i6 = i2 + 24 | 0;
+ i4 = i2 + 8 | 0;
+ i15 = HEAP32[i4 >> 2] | 0;
+ i17 = (HEAP32[i6 >> 2] | 0) - i15 | 0;
+ L1 : do {
+ if ((i14 | 0) == 0) {
+ i5 = i13;
+ i11 = i17;
+ i12 = i15;
+ i1 = 0;
+ } else {
+ i16 = 0;
+ L3 : while (1) {
+ if ((i17 | 0) < 48) {
+ _luaD_growstack(i2, 2);
+ i15 = HEAP32[i4 >> 2] | 0;
+ }
+ HEAP32[i4 >> 2] = i15 + 16;
+ i13 = _luaS_newlstr(i2, i13, i14 - i13 | 0) | 0;
+ HEAP32[i15 >> 2] = i13;
+ HEAP32[i15 + 8 >> 2] = HEAPU8[i13 + 4 | 0] | 64;
+ i13 = HEAP8[i14 + 1 | 0] | 0;
+ switch (i13 | 0) {
+ case 115:
+ {
+ i17 = HEAP32[i10 >> 2] | 0;
+ i13 = HEAP32[i17 >> 2] | 0;
+ HEAP32[i10 >> 2] = i17 + 4;
+ i13 = (i13 | 0) == 0 ? 5480 : i13;
+ i15 = _strlen(i13 | 0) | 0;
+ i17 = HEAP32[i4 >> 2] | 0;
+ HEAP32[i4 >> 2] = i17 + 16;
+ i15 = _luaS_newlstr(i2, i13, i15) | 0;
+ HEAP32[i17 >> 2] = i15;
+ HEAP32[i17 + 8 >> 2] = HEAPU8[i15 + 4 | 0] | 64;
+ break;
+ }
+ case 100:
+ {
+ i17 = HEAP32[i4 >> 2] | 0;
+ HEAP32[i4 >> 2] = i17 + 16;
+ i13 = HEAP32[i10 >> 2] | 0;
+ i15 = HEAP32[i13 >> 2] | 0;
+ HEAP32[i10 >> 2] = i13 + 4;
+ HEAPF64[i17 >> 3] = +(i15 | 0);
+ HEAP32[i17 + 8 >> 2] = 3;
+ break;
+ }
+ case 37:
+ {
+ i17 = HEAP32[i4 >> 2] | 0;
+ HEAP32[i4 >> 2] = i17 + 16;
+ i15 = _luaS_newlstr(i2, 5496, 1) | 0;
+ HEAP32[i17 >> 2] = i15;
+ HEAP32[i17 + 8 >> 2] = HEAPU8[i15 + 4 | 0] | 64;
+ break;
+ }
+ case 99:
+ {
+ i15 = HEAP32[i10 >> 2] | 0;
+ i17 = HEAP32[i15 >> 2] | 0;
+ HEAP32[i10 >> 2] = i15 + 4;
+ HEAP8[i9] = i17;
+ i17 = HEAP32[i4 >> 2] | 0;
+ HEAP32[i4 >> 2] = i17 + 16;
+ i15 = _luaS_newlstr(i2, i9, 1) | 0;
+ HEAP32[i17 >> 2] = i15;
+ HEAP32[i17 + 8 >> 2] = HEAPU8[i15 + 4 | 0] | 64;
+ break;
+ }
+ case 102:
+ {
+ i17 = HEAP32[i4 >> 2] | 0;
+ HEAP32[i4 >> 2] = i17 + 16;
+ i15 = HEAP32[i10 >> 2] | 0;
+ d18 = +HEAPF64[i15 >> 3];
+ HEAP32[i10 >> 2] = i15 + 8;
+ HEAPF64[i17 >> 3] = d18;
+ HEAP32[i17 + 8 >> 2] = 3;
+ break;
+ }
+ case 112:
+ {
+ i17 = HEAP32[i10 >> 2] | 0;
+ i15 = HEAP32[i17 >> 2] | 0;
+ HEAP32[i10 >> 2] = i17 + 4;
+ HEAP32[i7 >> 2] = i15;
+ i15 = _sprintf(i8 | 0, 5488, i7 | 0) | 0;
+ i17 = HEAP32[i4 >> 2] | 0;
+ HEAP32[i4 >> 2] = i17 + 16;
+ i15 = _luaS_newlstr(i2, i8, i15) | 0;
+ HEAP32[i17 >> 2] = i15;
+ HEAP32[i17 + 8 >> 2] = HEAPU8[i15 + 4 | 0] | 64;
+ break;
+ }
+ default:
+ {
+ break L3;
+ }
+ }
+ i16 = i16 + 2 | 0;
+ i13 = i14 + 2 | 0;
+ i14 = _strchr(i13, 37) | 0;
+ i15 = HEAP32[i4 >> 2] | 0;
+ i17 = (HEAP32[i6 >> 2] | 0) - i15 | 0;
+ if ((i14 | 0) == 0) {
+ i5 = i13;
+ i11 = i17;
+ i12 = i15;
+ i1 = i16;
+ break L1;
+ }
+ }
+ HEAP32[i7 >> 2] = i13;
+ _luaG_runerror(i2, 5504, i7);
+ }
+ } while (0);
+ if ((i11 | 0) < 32) {
+ _luaD_growstack(i2, 1);
+ i12 = HEAP32[i4 >> 2] | 0;
+ }
+ i17 = _strlen(i5 | 0) | 0;
+ HEAP32[i4 >> 2] = i12 + 16;
+ i17 = _luaS_newlstr(i2, i5, i17) | 0;
+ HEAP32[i12 >> 2] = i17;
+ HEAP32[i12 + 8 >> 2] = HEAPU8[i17 + 4 | 0] | 64;
+ if ((i1 | 0) <= 0) {
+ i17 = HEAP32[i4 >> 2] | 0;
+ i17 = i17 + -16 | 0;
+ i17 = HEAP32[i17 >> 2] | 0;
+ i17 = i17 + 16 | 0;
+ STACKTOP = i3;
+ return i17 | 0;
+ }
+ _luaV_concat(i2, i1 | 1);
+ i17 = HEAP32[i4 >> 2] | 0;
+ i17 = i17 + -16 | 0;
+ i17 = HEAP32[i17 >> 2] | 0;
+ i17 = i17 + 16 | 0;
+ STACKTOP = i3;
+ return i17 | 0;
+}
+function _luaH_getn(i6) {
+ i6 = i6 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, d11 = 0.0, i12 = 0, i13 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i2 = i1;
+ i3 = i6 + 28 | 0;
+ i12 = HEAP32[i3 >> 2] | 0;
+ if ((i12 | 0) != 0 ? (i4 = HEAP32[i6 + 12 >> 2] | 0, (HEAP32[i4 + (i12 + -1 << 4) + 8 >> 2] | 0) == 0) : 0) {
+ if (i12 >>> 0 > 1) {
+ i10 = 0;
+ } else {
+ i13 = 0;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ do {
+ i2 = (i10 + i12 | 0) >>> 1;
+ i3 = (HEAP32[i4 + (i2 + -1 << 4) + 8 >> 2] | 0) == 0;
+ i12 = i3 ? i2 : i12;
+ i10 = i3 ? i10 : i2;
+ } while ((i12 - i10 | 0) >>> 0 > 1);
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ i4 = i6 + 16 | 0;
+ if ((HEAP32[i4 >> 2] | 0) == 8016) {
+ i13 = i12;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ i5 = i6 + 12 | 0;
+ i6 = i6 + 7 | 0;
+ i9 = i2 + 4 | 0;
+ i8 = i12 + 1 | 0;
+ i13 = i12;
+ i10 = i12;
+ while (1) {
+ i12 = i8 + -1 | 0;
+ L15 : do {
+ if (i12 >>> 0 < i13 >>> 0) {
+ i12 = (HEAP32[i5 >> 2] | 0) + (i12 << 4) | 0;
+ } else {
+ d11 = +(i8 | 0);
+ HEAPF64[i2 >> 3] = d11 + 1.0;
+ i13 = (HEAP32[i9 >> 2] | 0) + (HEAP32[i2 >> 2] | 0) | 0;
+ if ((i13 | 0) < 0) {
+ i12 = 0 - i13 | 0;
+ i13 = (i13 | 0) == (i12 | 0) ? 0 : i12;
+ }
+ i12 = (HEAP32[i4 >> 2] | 0) + (((i13 | 0) % ((1 << (HEAPU8[i6] | 0)) + -1 | 1 | 0) | 0) << 5) | 0;
+ while (1) {
+ if ((HEAP32[i12 + 24 >> 2] | 0) == 3 ? +HEAPF64[i12 + 16 >> 3] == d11 : 0) {
+ break;
+ }
+ i12 = HEAP32[i12 + 28 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ i12 = 5192;
+ break L15;
+ }
+ }
+ }
+ } while (0);
+ if ((HEAP32[i12 + 8 >> 2] | 0) == 0) {
+ break;
+ }
+ i10 = i8 << 1;
+ if (i10 >>> 0 > 2147483645) {
+ i7 = 21;
+ break;
+ }
+ i12 = i8;
+ i8 = i10;
+ i13 = HEAP32[i3 >> 2] | 0;
+ i10 = i12;
+ }
+ if ((i7 | 0) == 21) {
+ i8 = i2 + 4 | 0;
+ i7 = 1;
+ while (1) {
+ i10 = i7 + -1 | 0;
+ L34 : do {
+ if (i10 >>> 0 < (HEAP32[i3 >> 2] | 0) >>> 0) {
+ i9 = (HEAP32[i5 >> 2] | 0) + (i10 << 4) | 0;
+ } else {
+ d11 = +(i7 | 0);
+ HEAPF64[i2 >> 3] = d11 + 1.0;
+ i9 = (HEAP32[i8 >> 2] | 0) + (HEAP32[i2 >> 2] | 0) | 0;
+ if ((i9 | 0) < 0) {
+ i12 = 0 - i9 | 0;
+ i9 = (i9 | 0) == (i12 | 0) ? 0 : i12;
+ }
+ i9 = (HEAP32[i4 >> 2] | 0) + (((i9 | 0) % ((1 << (HEAPU8[i6] | 0)) + -1 | 1 | 0) | 0) << 5) | 0;
+ while (1) {
+ if ((HEAP32[i9 + 24 >> 2] | 0) == 3 ? +HEAPF64[i9 + 16 >> 3] == d11 : 0) {
+ break;
+ }
+ i9 = HEAP32[i9 + 28 >> 2] | 0;
+ if ((i9 | 0) == 0) {
+ i9 = 5192;
+ break L34;
+ }
+ }
+ }
+ } while (0);
+ if ((HEAP32[i9 + 8 >> 2] | 0) == 0) {
+ break;
+ }
+ i7 = i7 + 1 | 0;
+ }
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ if (!((i8 - i10 | 0) >>> 0 > 1)) {
+ i13 = i10;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ i7 = i2 + 4 | 0;
+ do {
+ i9 = (i8 + i10 | 0) >>> 1;
+ i12 = i9 + -1 | 0;
+ L55 : do {
+ if (i12 >>> 0 < (HEAP32[i3 >> 2] | 0) >>> 0) {
+ i12 = (HEAP32[i5 >> 2] | 0) + (i12 << 4) | 0;
+ } else {
+ d11 = +(i9 | 0);
+ HEAPF64[i2 >> 3] = d11 + 1.0;
+ i13 = (HEAP32[i7 >> 2] | 0) + (HEAP32[i2 >> 2] | 0) | 0;
+ if ((i13 | 0) < 0) {
+ i12 = 0 - i13 | 0;
+ i13 = (i13 | 0) == (i12 | 0) ? 0 : i12;
+ }
+ i12 = (HEAP32[i4 >> 2] | 0) + (((i13 | 0) % ((1 << (HEAPU8[i6] | 0)) + -1 | 1 | 0) | 0) << 5) | 0;
+ while (1) {
+ if ((HEAP32[i12 + 24 >> 2] | 0) == 3 ? +HEAPF64[i12 + 16 >> 3] == d11 : 0) {
+ break;
+ }
+ i12 = HEAP32[i12 + 28 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ i12 = 5192;
+ break L55;
+ }
+ }
+ }
+ } while (0);
+ i12 = (HEAP32[i12 + 8 >> 2] | 0) == 0;
+ i8 = i12 ? i9 : i8;
+ i10 = i12 ? i10 : i9;
+ } while ((i8 - i10 | 0) >>> 0 > 1);
+ STACKTOP = i1;
+ return i10 | 0;
+}
+function _lua_resume(i4, i3, i7) {
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i7 = i7 | 0;
+ var i1 = 0, i2 = 0, i5 = 0, i6 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0;
+ i1 = STACKTOP;
+ if ((i3 | 0) == 0) {
+ i5 = 1;
+ } else {
+ i5 = (HEAPU16[i3 + 38 >> 1] | 0) + 1 & 65535;
+ }
+ i3 = i4 + 38 | 0;
+ HEAP16[i3 >> 1] = i5;
+ i5 = i4 + 36 | 0;
+ HEAP16[i5 >> 1] = 0;
+ i6 = i4 + 8 | 0;
+ i13 = _luaD_rawrunprotected(i4, 4, (HEAP32[i6 >> 2] | 0) + (0 - i7 << 4) | 0) | 0;
+ if ((i13 | 0) == -1) {
+ i18 = 2;
+ HEAP16[i5 >> 1] = 1;
+ i17 = HEAP16[i3 >> 1] | 0;
+ i17 = i17 + -1 << 16 >> 16;
+ HEAP16[i3 >> 1] = i17;
+ STACKTOP = i1;
+ return i18 | 0;
+ }
+ if (!(i13 >>> 0 > 1)) {
+ i18 = i13;
+ HEAP16[i5 >> 1] = 1;
+ i17 = HEAP16[i3 >> 1] | 0;
+ i17 = i17 + -1 << 16 >> 16;
+ HEAP16[i3 >> 1] = i17;
+ STACKTOP = i1;
+ return i18 | 0;
+ }
+ i7 = i4 + 16 | 0;
+ i12 = i4 + 28 | 0;
+ i11 = i4 + 41 | 0;
+ i10 = i4 + 68 | 0;
+ i9 = i4 + 32 | 0;
+ i8 = i4 + 12 | 0;
+ L10 : while (1) {
+ i15 = HEAP32[i7 >> 2] | 0;
+ if ((i15 | 0) == 0) {
+ break;
+ }
+ while (1) {
+ i14 = i15 + 18 | 0;
+ if (!((HEAP8[i14] & 16) == 0)) {
+ break;
+ }
+ i15 = HEAP32[i15 + 8 >> 2] | 0;
+ if ((i15 | 0) == 0) {
+ break L10;
+ }
+ }
+ i16 = HEAP32[i12 >> 2] | 0;
+ i17 = HEAP32[i15 + 20 >> 2] | 0;
+ i18 = i16 + i17 | 0;
+ _luaF_close(i4, i18);
+ if ((i13 | 0) == 4) {
+ i19 = HEAP32[(HEAP32[i8 >> 2] | 0) + 180 >> 2] | 0;
+ HEAP32[i18 >> 2] = i19;
+ HEAP32[i16 + (i17 + 8) >> 2] = HEAPU8[i19 + 4 | 0] | 0 | 64;
+ } else if ((i13 | 0) == 6) {
+ i19 = _luaS_newlstr(i4, 2424, 23) | 0;
+ HEAP32[i18 >> 2] = i19;
+ HEAP32[i16 + (i17 + 8) >> 2] = HEAPU8[i19 + 4 | 0] | 0 | 64;
+ } else {
+ i19 = HEAP32[i6 >> 2] | 0;
+ i21 = i19 + -16 | 0;
+ i20 = HEAP32[i21 + 4 >> 2] | 0;
+ HEAP32[i18 >> 2] = HEAP32[i21 >> 2];
+ HEAP32[i18 + 4 >> 2] = i20;
+ HEAP32[i16 + (i17 + 8) >> 2] = HEAP32[i19 + -8 >> 2];
+ }
+ i17 = i16 + (i17 + 16) | 0;
+ HEAP32[i6 >> 2] = i17;
+ HEAP32[i7 >> 2] = i15;
+ HEAP8[i11] = HEAP8[i15 + 36 | 0] | 0;
+ HEAP16[i5 >> 1] = 0;
+ if ((i15 | 0) != 0) {
+ i16 = i15;
+ do {
+ i18 = HEAP32[i16 + 4 >> 2] | 0;
+ i17 = i17 >>> 0 < i18 >>> 0 ? i18 : i17;
+ i16 = HEAP32[i16 + 8 >> 2] | 0;
+ } while ((i16 | 0) != 0);
+ }
+ i16 = i17 - (HEAP32[i12 >> 2] | 0) | 0;
+ i17 = (i16 >> 4) + 1 | 0;
+ i17 = ((i17 | 0) / 8 | 0) + 10 + i17 | 0;
+ i17 = (i17 | 0) > 1e6 ? 1e6 : i17;
+ if ((i16 | 0) <= 15999984 ? (i17 | 0) < (HEAP32[i9 >> 2] | 0) : 0) {
+ _luaD_reallocstack(i4, i17);
+ }
+ HEAP32[i10 >> 2] = HEAP32[i15 + 32 >> 2];
+ HEAP8[i14] = HEAPU8[i14] | 0 | 32;
+ HEAP8[i15 + 37 | 0] = i13;
+ i13 = _luaD_rawrunprotected(i4, 5, 0) | 0;
+ if (!(i13 >>> 0 > 1)) {
+ i2 = 24;
+ break;
+ }
+ }
+ if ((i2 | 0) == 24) {
+ HEAP16[i5 >> 1] = 1;
+ i21 = HEAP16[i3 >> 1] | 0;
+ i21 = i21 + -1 << 16 >> 16;
+ HEAP16[i3 >> 1] = i21;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ HEAP8[i4 + 6 | 0] = i13;
+ i2 = HEAP32[i6 >> 2] | 0;
+ if ((i13 | 0) == 4) {
+ i21 = HEAP32[(HEAP32[i8 >> 2] | 0) + 180 >> 2] | 0;
+ HEAP32[i2 >> 2] = i21;
+ HEAP32[i2 + 8 >> 2] = HEAPU8[i21 + 4 | 0] | 0 | 64;
+ } else if ((i13 | 0) == 6) {
+ i21 = _luaS_newlstr(i4, 2424, 23) | 0;
+ HEAP32[i2 >> 2] = i21;
+ HEAP32[i2 + 8 >> 2] = HEAPU8[i21 + 4 | 0] | 0 | 64;
+ } else {
+ i19 = i2 + -16 | 0;
+ i20 = HEAP32[i19 + 4 >> 2] | 0;
+ i21 = i2;
+ HEAP32[i21 >> 2] = HEAP32[i19 >> 2];
+ HEAP32[i21 + 4 >> 2] = i20;
+ HEAP32[i2 + 8 >> 2] = HEAP32[i2 + -8 >> 2];
+ }
+ i21 = i2 + 16 | 0;
+ HEAP32[i6 >> 2] = i21;
+ HEAP32[(HEAP32[i7 >> 2] | 0) + 4 >> 2] = i21;
+ i21 = i13;
+ HEAP16[i5 >> 1] = 1;
+ i20 = HEAP16[i3 >> 1] | 0;
+ i20 = i20 + -1 << 16 >> 16;
+ HEAP16[i3 >> 1] = i20;
+ STACKTOP = i1;
+ return i21 | 0;
+}
+function _luaK_goiftrue(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0;
+ i2 = STACKTOP;
+ _luaK_dischargevars(i1, i3);
+ i12 = HEAP32[i3 >> 2] | 0;
+ do {
+ if ((i12 | 0) == 10) {
+ i9 = HEAP32[(HEAP32[i1 >> 2] | 0) + 12 >> 2] | 0;
+ i5 = i3 + 8 | 0;
+ i8 = HEAP32[i5 >> 2] | 0;
+ i7 = i9 + (i8 << 2) | 0;
+ if (!((i8 | 0) > 0 ? (i10 = i9 + (i8 + -1 << 2) | 0, i6 = HEAP32[i10 >> 2] | 0, (HEAP8[5584 + (i6 & 63) | 0] | 0) < 0) : 0)) {
+ i10 = i7;
+ i6 = HEAP32[i7 >> 2] | 0;
+ }
+ HEAP32[i10 >> 2] = ((i6 & 16320 | 0) == 0) << 6 | i6 & -16321;
+ i5 = HEAP32[i5 >> 2] | 0;
+ i8 = 18;
+ } else if (!((i12 | 0) == 2 | (i12 | 0) == 5 | (i12 | 0) == 4)) {
+ i5 = i3 + 8 | 0;
+ if ((i12 | 0) == 6) {
+ i8 = 14;
+ } else if ((i12 | 0) == 11 ? (i11 = HEAP32[(HEAP32[(HEAP32[i1 >> 2] | 0) + 12 >> 2] | 0) + (HEAP32[i5 >> 2] << 2) >> 2] | 0, (i11 & 63 | 0) == 20) : 0) {
+ i5 = i1 + 20 | 0;
+ HEAP32[i5 >> 2] = (HEAP32[i5 >> 2] | 0) + -1;
+ i5 = _condjump(i1, 27, i11 >>> 23, 0, 1) | 0;
+ i8 = 18;
+ break;
+ } else {
+ i8 = 9;
+ }
+ if ((i8 | 0) == 9) {
+ i12 = i1 + 48 | 0;
+ i10 = HEAP8[i12] | 0;
+ i11 = (i10 & 255) + 1 | 0;
+ i6 = (HEAP32[i1 >> 2] | 0) + 78 | 0;
+ do {
+ if (i11 >>> 0 > (HEAPU8[i6] | 0) >>> 0) {
+ if (i11 >>> 0 > 249) {
+ _luaX_syntaxerror(HEAP32[i1 + 12 >> 2] | 0, 10536);
+ } else {
+ HEAP8[i6] = i11;
+ i9 = HEAP8[i12] | 0;
+ break;
+ }
+ } else {
+ i9 = i10;
+ }
+ } while (0);
+ i11 = (i9 & 255) + 1 | 0;
+ HEAP8[i12] = i11;
+ _discharge2reg(i1, i3, (i11 & 255) + -1 | 0);
+ if ((HEAP32[i3 >> 2] | 0) == 6) {
+ i8 = 14;
+ }
+ }
+ if (((i8 | 0) == 14 ? (i7 = HEAP32[i5 >> 2] | 0, (i7 & 256 | 0) == 0) : 0) ? (HEAPU8[i1 + 46 | 0] | 0) <= (i7 | 0) : 0) {
+ i12 = i1 + 48 | 0;
+ HEAP8[i12] = (HEAP8[i12] | 0) + -1 << 24 >> 24;
+ }
+ i5 = _condjump(i1, 28, 255, HEAP32[i5 >> 2] | 0, 0) | 0;
+ i8 = 18;
+ }
+ } while (0);
+ do {
+ if ((i8 | 0) == 18 ? (i4 = i3 + 20 | 0, !((i5 | 0) == -1)) : 0) {
+ i8 = HEAP32[i4 >> 2] | 0;
+ if ((i8 | 0) == -1) {
+ HEAP32[i4 >> 2] = i5;
+ break;
+ }
+ i4 = HEAP32[(HEAP32[i1 >> 2] | 0) + 12 >> 2] | 0;
+ while (1) {
+ i7 = i4 + (i8 << 2) | 0;
+ i6 = HEAP32[i7 >> 2] | 0;
+ i9 = (i6 >>> 14) + -131071 | 0;
+ if ((i9 | 0) == -1) {
+ break;
+ }
+ i9 = i8 + 1 + i9 | 0;
+ if ((i9 | 0) == -1) {
+ break;
+ } else {
+ i8 = i9;
+ }
+ }
+ i4 = i5 + ~i8 | 0;
+ if ((((i4 | 0) > -1 ? i4 : 0 - i4 | 0) | 0) > 131071) {
+ _luaX_syntaxerror(HEAP32[i1 + 12 >> 2] | 0, 10624);
+ } else {
+ HEAP32[i7 >> 2] = (i4 << 14) + 2147467264 | i6 & 16383;
+ break;
+ }
+ }
+ } while (0);
+ i3 = i3 + 16 | 0;
+ i4 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i1 + 24 >> 2] = HEAP32[i1 + 20 >> 2];
+ i5 = i1 + 28 | 0;
+ if ((i4 | 0) == -1) {
+ HEAP32[i3 >> 2] = -1;
+ STACKTOP = i2;
+ return;
+ }
+ i8 = HEAP32[i5 >> 2] | 0;
+ if ((i8 | 0) == -1) {
+ HEAP32[i5 >> 2] = i4;
+ HEAP32[i3 >> 2] = -1;
+ STACKTOP = i2;
+ return;
+ }
+ i7 = HEAP32[(HEAP32[i1 >> 2] | 0) + 12 >> 2] | 0;
+ while (1) {
+ i5 = i7 + (i8 << 2) | 0;
+ i6 = HEAP32[i5 >> 2] | 0;
+ i9 = (i6 >>> 14) + -131071 | 0;
+ if ((i9 | 0) == -1) {
+ break;
+ }
+ i9 = i8 + 1 + i9 | 0;
+ if ((i9 | 0) == -1) {
+ break;
+ } else {
+ i8 = i9;
+ }
+ }
+ i4 = i4 + ~i8 | 0;
+ if ((((i4 | 0) > -1 ? i4 : 0 - i4 | 0) | 0) > 131071) {
+ _luaX_syntaxerror(HEAP32[i1 + 12 >> 2] | 0, 10624);
+ }
+ HEAP32[i5 >> 2] = (i4 << 14) + 2147467264 | i6 & 16383;
+ HEAP32[i3 >> 2] = -1;
+ STACKTOP = i2;
+ return;
+}
+function _luaO_str2d(i1, i3, i5) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, d9 = 0.0, i10 = 0, i11 = 0, i12 = 0, i13 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i2;
+ if ((_strpbrk(i1, 5464) | 0) != 0) {
+ i13 = 0;
+ STACKTOP = i2;
+ return i13 | 0;
+ }
+ do {
+ if ((_strpbrk(i1, 5472) | 0) == 0) {
+ d9 = +_strtod(i1, i4);
+ i10 = HEAP32[i4 >> 2] | 0;
+ } else {
+ HEAP32[i4 >> 2] = i1;
+ i8 = i1;
+ while (1) {
+ i6 = HEAP8[i8] | 0;
+ i10 = i8 + 1 | 0;
+ if ((HEAP8[(i6 & 255) + 10913 | 0] & 8) == 0) {
+ break;
+ } else {
+ i8 = i10;
+ }
+ }
+ if (i6 << 24 >> 24 == 43) {
+ i6 = 0;
+ i8 = i10;
+ } else if (i6 << 24 >> 24 == 45) {
+ i6 = 1;
+ i8 = i10;
+ } else {
+ i6 = 0;
+ }
+ if ((HEAP8[i8] | 0) == 48 ? (i13 = HEAP8[i8 + 1 | 0] | 0, i13 << 24 >> 24 == 88 | i13 << 24 >> 24 == 120) : 0) {
+ i10 = i8 + 2 | 0;
+ i8 = HEAP8[i10] | 0;
+ i12 = i8 & 255;
+ i11 = HEAP8[i12 + 10913 | 0] | 0;
+ if ((i11 & 16) == 0) {
+ d9 = 0.0;
+ i11 = i8;
+ i8 = 0;
+ } else {
+ d9 = 0.0;
+ i8 = 0;
+ while (1) {
+ if ((i11 & 2) == 0) {
+ i11 = (i12 | 32) + -87 | 0;
+ } else {
+ i11 = i12 + -48 | 0;
+ }
+ d9 = d9 * 16.0 + +(i11 | 0);
+ i8 = i8 + 1 | 0;
+ i10 = i10 + 1 | 0;
+ i13 = HEAP8[i10] | 0;
+ i12 = i13 & 255;
+ i11 = HEAP8[i12 + 10913 | 0] | 0;
+ if ((i11 & 16) == 0) {
+ i11 = i13;
+ break;
+ }
+ }
+ }
+ if (i11 << 24 >> 24 == 46) {
+ i10 = i10 + 1 | 0;
+ i13 = HEAPU8[i10] | 0;
+ i11 = HEAP8[i13 + 10913 | 0] | 0;
+ if ((i11 & 16) == 0) {
+ i12 = 0;
+ } else {
+ i12 = 0;
+ do {
+ if ((i11 & 2) == 0) {
+ i11 = (i13 | 32) + -87 | 0;
+ } else {
+ i11 = i13 + -48 | 0;
+ }
+ d9 = d9 * 16.0 + +(i11 | 0);
+ i12 = i12 + 1 | 0;
+ i10 = i10 + 1 | 0;
+ i13 = HEAPU8[i10] | 0;
+ i11 = HEAP8[i13 + 10913 | 0] | 0;
+ } while (!((i11 & 16) == 0));
+ }
+ } else {
+ i12 = 0;
+ }
+ if ((i12 | i8 | 0) != 0) {
+ i8 = Math_imul(i12, -4) | 0;
+ HEAP32[i4 >> 2] = i10;
+ i13 = HEAP8[i10] | 0;
+ if (i13 << 24 >> 24 == 80 | i13 << 24 >> 24 == 112) {
+ i13 = i10 + 1 | 0;
+ i11 = HEAP8[i13] | 0;
+ if (i11 << 24 >> 24 == 45) {
+ i11 = 1;
+ i13 = i10 + 2 | 0;
+ } else if (i11 << 24 >> 24 == 43) {
+ i11 = 0;
+ i13 = i10 + 2 | 0;
+ } else {
+ i11 = 0;
+ }
+ i12 = HEAP8[i13] | 0;
+ if (!((HEAP8[(i12 & 255) + 10913 | 0] & 2) == 0)) {
+ i10 = i13;
+ i7 = 0;
+ do {
+ i10 = i10 + 1 | 0;
+ i7 = (i12 << 24 >> 24) + -48 + (i7 * 10 | 0) | 0;
+ i12 = HEAP8[i10] | 0;
+ } while (!((HEAP8[(i12 & 255) + 10913 | 0] & 2) == 0));
+ i8 = ((i11 | 0) == 0 ? i7 : 0 - i7 | 0) + i8 | 0;
+ i7 = 29;
+ }
+ } else {
+ i7 = 29;
+ }
+ if ((i7 | 0) == 29) {
+ HEAP32[i4 >> 2] = i10;
+ }
+ if ((i6 | 0) != 0) {
+ d9 = -d9;
+ }
+ d9 = +_ldexp(d9, i8);
+ break;
+ }
+ }
+ HEAPF64[i5 >> 3] = 0.0;
+ i13 = 0;
+ STACKTOP = i2;
+ return i13 | 0;
+ }
+ } while (0);
+ HEAPF64[i5 >> 3] = d9;
+ if ((i10 | 0) == (i1 | 0)) {
+ i13 = 0;
+ STACKTOP = i2;
+ return i13 | 0;
+ }
+ if (!((HEAP8[(HEAPU8[i10] | 0) + 10913 | 0] & 8) == 0)) {
+ do {
+ i10 = i10 + 1 | 0;
+ } while (!((HEAP8[(HEAPU8[i10] | 0) + 10913 | 0] & 8) == 0));
+ HEAP32[i4 >> 2] = i10;
+ }
+ i13 = (i10 | 0) == (i1 + i3 | 0) | 0;
+ STACKTOP = i2;
+ return i13 | 0;
+}
+function _luaV_equalobj_(i2, i4, i5) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i3 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0;
+ i1 = STACKTOP;
+ i3 = i4 + 8 | 0;
+ L1 : do {
+ switch (HEAP32[i3 >> 2] & 63 | 0) {
+ case 7:
+ {
+ i6 = HEAP32[i4 >> 2] | 0;
+ i7 = HEAP32[i5 >> 2] | 0;
+ if ((i6 | 0) == (i7 | 0)) {
+ i7 = 1;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ if ((i2 | 0) == 0) {
+ i7 = 0;
+ STACKTOP = i1;
+ return i7 | 0;
+ } else {
+ i6 = _get_equalTM(i2, HEAP32[i6 + 8 >> 2] | 0, HEAP32[i7 + 8 >> 2] | 0) | 0;
+ break L1;
+ }
+ }
+ case 5:
+ {
+ i7 = HEAP32[i4 >> 2] | 0;
+ i6 = HEAP32[i5 >> 2] | 0;
+ if ((i7 | 0) == (i6 | 0)) {
+ i7 = 1;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ if ((i2 | 0) == 0) {
+ i7 = 0;
+ STACKTOP = i1;
+ return i7 | 0;
+ } else {
+ i6 = _get_equalTM(i2, HEAP32[i7 + 8 >> 2] | 0, HEAP32[i6 + 8 >> 2] | 0) | 0;
+ break L1;
+ }
+ }
+ case 4:
+ {
+ i7 = (HEAP32[i4 >> 2] | 0) == (HEAP32[i5 >> 2] | 0) | 0;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ case 20:
+ {
+ i7 = _luaS_eqlngstr(HEAP32[i4 >> 2] | 0, HEAP32[i5 >> 2] | 0) | 0;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ case 3:
+ {
+ i7 = +HEAPF64[i4 >> 3] == +HEAPF64[i5 >> 3] | 0;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ case 1:
+ {
+ i7 = (HEAP32[i4 >> 2] | 0) == (HEAP32[i5 >> 2] | 0) | 0;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ case 22:
+ {
+ i7 = (HEAP32[i4 >> 2] | 0) == (HEAP32[i5 >> 2] | 0) | 0;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ case 2:
+ {
+ i7 = (HEAP32[i4 >> 2] | 0) == (HEAP32[i5 >> 2] | 0) | 0;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ case 0:
+ {
+ i7 = 1;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ default:
+ {
+ i7 = (HEAP32[i4 >> 2] | 0) == (HEAP32[i5 >> 2] | 0) | 0;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ }
+ } while (0);
+ if ((i6 | 0) == 0) {
+ i7 = 0;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ i7 = i2 + 8 | 0;
+ i10 = HEAP32[i7 >> 2] | 0;
+ i9 = i2 + 28 | 0;
+ i8 = i10 - (HEAP32[i9 >> 2] | 0) | 0;
+ HEAP32[i7 >> 2] = i10 + 16;
+ i13 = i6;
+ i12 = HEAP32[i13 + 4 >> 2] | 0;
+ i11 = i10;
+ HEAP32[i11 >> 2] = HEAP32[i13 >> 2];
+ HEAP32[i11 + 4 >> 2] = i12;
+ HEAP32[i10 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ i10 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = i10 + 16;
+ i11 = i4;
+ i4 = HEAP32[i11 + 4 >> 2] | 0;
+ i6 = i10;
+ HEAP32[i6 >> 2] = HEAP32[i11 >> 2];
+ HEAP32[i6 + 4 >> 2] = i4;
+ HEAP32[i10 + 8 >> 2] = HEAP32[i3 >> 2];
+ i3 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = i3 + 16;
+ i10 = i5;
+ i6 = HEAP32[i10 + 4 >> 2] | 0;
+ i4 = i3;
+ HEAP32[i4 >> 2] = HEAP32[i10 >> 2];
+ HEAP32[i4 + 4 >> 2] = i6;
+ HEAP32[i3 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ _luaD_call(i2, (HEAP32[i7 >> 2] | 0) + -48 | 0, 1, HEAP8[(HEAP32[i2 + 16 >> 2] | 0) + 18 | 0] & 1);
+ i2 = HEAP32[i9 >> 2] | 0;
+ i3 = HEAP32[i7 >> 2] | 0;
+ i4 = i3 + -16 | 0;
+ HEAP32[i7 >> 2] = i4;
+ i5 = HEAP32[i4 + 4 >> 2] | 0;
+ i6 = i2 + i8 | 0;
+ HEAP32[i6 >> 2] = HEAP32[i4 >> 2];
+ HEAP32[i6 + 4 >> 2] = i5;
+ HEAP32[i2 + (i8 + 8) >> 2] = HEAP32[i3 + -8 >> 2];
+ i2 = HEAP32[i7 >> 2] | 0;
+ i3 = HEAP32[i2 + 8 >> 2] | 0;
+ if ((i3 | 0) != 0) {
+ if ((i3 | 0) == 1) {
+ i2 = (HEAP32[i2 >> 2] | 0) != 0;
+ } else {
+ i2 = 1;
+ }
+ } else {
+ i2 = 0;
+ }
+ i13 = i2 & 1;
+ STACKTOP = i1;
+ return i13 | 0;
+}
+function _forbody(i1, i5, i6, i4, i9) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ i6 = i6 | 0;
+ i4 = i4 | 0;
+ i9 = i9 | 0;
+ var i2 = 0, i3 = 0, i7 = 0, i8 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 32 | 0;
+ i8 = i3 + 12 | 0;
+ i19 = i3;
+ i11 = i1 + 48 | 0;
+ i7 = HEAP32[i11 >> 2] | 0;
+ i18 = i7 + 46 | 0;
+ i22 = (HEAPU8[i18] | 0) + 3 | 0;
+ HEAP8[i18] = i22;
+ i21 = i7 + 20 | 0;
+ i17 = i7 + 12 | 0;
+ i2 = i7 + 40 | 0;
+ i20 = HEAP32[(HEAP32[i7 >> 2] | 0) + 24 >> 2] | 0;
+ i10 = HEAP32[HEAP32[(HEAP32[i17 >> 2] | 0) + 64 >> 2] >> 2] | 0;
+ HEAP32[i20 + ((HEAP16[i10 + ((i22 & 255) + -3 + (HEAP32[i2 >> 2] | 0) << 1) >> 1] | 0) * 12 | 0) + 4 >> 2] = HEAP32[i21 >> 2];
+ HEAP32[i20 + ((HEAP16[i10 + ((HEAPU8[i18] | 0) + -2 + (HEAP32[i2 >> 2] | 0) << 1) >> 1] | 0) * 12 | 0) + 4 >> 2] = HEAP32[i21 >> 2];
+ HEAP32[i20 + ((HEAP16[i10 + ((HEAPU8[i18] | 0) + -1 + (HEAP32[i2 >> 2] | 0) << 1) >> 1] | 0) * 12 | 0) + 4 >> 2] = HEAP32[i21 >> 2];
+ i2 = i1 + 16 | 0;
+ if ((HEAP32[i2 >> 2] | 0) != 259) {
+ _error_expected(i1, 259);
+ }
+ _luaX_next(i1);
+ i10 = (i9 | 0) != 0;
+ if (i10) {
+ i9 = _luaK_codeABx(i7, 33, i5, 131070) | 0;
+ } else {
+ i9 = _luaK_jump(i7) | 0;
+ }
+ HEAP8[i19 + 10 | 0] = 0;
+ HEAP8[i19 + 8 | 0] = HEAP8[i18] | 0;
+ i17 = HEAP32[(HEAP32[i17 >> 2] | 0) + 64 >> 2] | 0;
+ HEAP16[i19 + 4 >> 1] = HEAP32[i17 + 28 >> 2];
+ HEAP16[i19 + 6 >> 1] = HEAP32[i17 + 16 >> 2];
+ HEAP8[i19 + 9 | 0] = 0;
+ i17 = i7 + 16 | 0;
+ HEAP32[i19 >> 2] = HEAP32[i17 >> 2];
+ HEAP32[i17 >> 2] = i19;
+ i19 = HEAP32[i11 >> 2] | 0;
+ i17 = i19 + 46 | 0;
+ i18 = (HEAPU8[i17] | 0) + i4 | 0;
+ HEAP8[i17] = i18;
+ if ((i4 | 0) != 0 ? (i13 = i19 + 20 | 0, i12 = i19 + 40 | 0, i14 = HEAP32[(HEAP32[i19 >> 2] | 0) + 24 >> 2] | 0, i15 = HEAP32[HEAP32[(HEAP32[i19 + 12 >> 2] | 0) + 64 >> 2] >> 2] | 0, HEAP32[i14 + ((HEAP16[i15 + ((i18 & 255) - i4 + (HEAP32[i12 >> 2] | 0) << 1) >> 1] | 0) * 12 | 0) + 4 >> 2] = HEAP32[i13 >> 2], i16 = i4 + -1 | 0, (i16 | 0) != 0) : 0) {
+ do {
+ HEAP32[i14 + ((HEAP16[i15 + ((HEAPU8[i17] | 0) - i16 + (HEAP32[i12 >> 2] | 0) << 1) >> 1] | 0) * 12 | 0) + 4 >> 2] = HEAP32[i13 >> 2];
+ i16 = i16 + -1 | 0;
+ } while ((i16 | 0) != 0);
+ }
+ _luaK_reserveregs(i7, i4);
+ i11 = HEAP32[i11 >> 2] | 0;
+ HEAP8[i8 + 10 | 0] = 0;
+ HEAP8[i8 + 8 | 0] = HEAP8[i11 + 46 | 0] | 0;
+ i22 = HEAP32[(HEAP32[i11 + 12 >> 2] | 0) + 64 >> 2] | 0;
+ HEAP16[i8 + 4 >> 1] = HEAP32[i22 + 28 >> 2];
+ HEAP16[i8 + 6 >> 1] = HEAP32[i22 + 16 >> 2];
+ HEAP8[i8 + 9 | 0] = 0;
+ i22 = i11 + 16 | 0;
+ HEAP32[i8 >> 2] = HEAP32[i22 >> 2];
+ HEAP32[i22 >> 2] = i8;
+ L13 : do {
+ i8 = HEAP32[i2 >> 2] | 0;
+ switch (i8 | 0) {
+ case 277:
+ case 286:
+ case 262:
+ case 261:
+ case 260:
+ {
+ break L13;
+ }
+ default:
+ {}
+ }
+ _statement(i1);
+ } while ((i8 | 0) != 274);
+ _leaveblock(i11);
+ _leaveblock(i7);
+ _luaK_patchtohere(i7, i9);
+ if (i10) {
+ i21 = _luaK_codeABx(i7, 32, i5, 131070) | 0;
+ i22 = i9 + 1 | 0;
+ _luaK_patchlist(i7, i21, i22);
+ _luaK_fixline(i7, i6);
+ STACKTOP = i3;
+ return;
+ } else {
+ _luaK_codeABC(i7, 34, i5, 0, i4) | 0;
+ _luaK_fixline(i7, i6);
+ i21 = _luaK_codeABx(i7, 35, i5 + 2 | 0, 131070) | 0;
+ i22 = i9 + 1 | 0;
+ _luaK_patchlist(i7, i21, i22);
+ _luaK_fixline(i7, i6);
+ STACKTOP = i3;
+ return;
+ }
+}
+function _dotty(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0;
+ i6 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i6;
+ i4 = i6 + 4 | 0;
+ i2 = HEAP32[20] | 0;
+ HEAP32[20] = 0;
+ _lua_settop(i1, 0);
+ if ((_pushline(i1, 1) | 0) == 0) {
+ _lua_settop(i1, 0);
+ i10 = HEAP32[_stdout >> 2] | 0;
+ _fputc(10, i10 | 0) | 0;
+ _fflush(i10 | 0) | 0;
+ HEAP32[20] = i2;
+ STACKTOP = i6;
+ return;
+ }
+ i5 = HEAP32[_stderr >> 2] | 0;
+ L4 : while (1) {
+ i8 = _lua_tolstring(i1, 1, i4) | 0;
+ i8 = _luaL_loadbufferx(i1, i8, HEAP32[i4 >> 2] | 0, 256, 0) | 0;
+ L6 : do {
+ if ((i8 | 0) == 3) {
+ while (1) {
+ i8 = _lua_tolstring(i1, -1, i3) | 0;
+ i7 = HEAP32[i3 >> 2] | 0;
+ if (!(i7 >>> 0 > 4)) {
+ break;
+ }
+ if ((_strcmp(i8 + (i7 + -5) | 0, 264) | 0) != 0) {
+ break;
+ }
+ _lua_settop(i1, -2);
+ if ((_pushline(i1, 0) | 0) == 0) {
+ i7 = 23;
+ break L4;
+ }
+ _lua_pushlstring(i1, 184, 1) | 0;
+ _lua_insert(i1, -2);
+ _lua_concat(i1, 3);
+ i8 = _lua_tolstring(i1, 1, i4) | 0;
+ i8 = _luaL_loadbufferx(i1, i8, HEAP32[i4 >> 2] | 0, 256, 0) | 0;
+ if ((i8 | 0) != 3) {
+ i7 = 9;
+ break L6;
+ }
+ }
+ _lua_remove(i1, 1);
+ i8 = 3;
+ i7 = 10;
+ } else {
+ i7 = 9;
+ }
+ } while (0);
+ do {
+ if ((i7 | 0) == 9) {
+ _lua_remove(i1, 1);
+ if ((i8 | 0) == -1) {
+ i7 = 23;
+ break L4;
+ } else if ((i8 | 0) != 0) {
+ i7 = 10;
+ break;
+ }
+ i9 = _lua_gettop(i1) | 0;
+ _lua_pushcclosure(i1, 142, 0);
+ _lua_insert(i1, i9);
+ HEAP32[48] = i1;
+ _signal(2, 1) | 0;
+ i10 = _lua_pcallk(i1, 0, -1, i9, 0, 0) | 0;
+ _signal(2, 0) | 0;
+ _lua_remove(i1, i9);
+ if ((i10 | 0) == 0) {
+ i7 = 17;
+ } else {
+ i9 = 0;
+ i7 = 12;
+ }
+ }
+ } while (0);
+ if ((i7 | 0) == 10) {
+ i9 = (i8 | 0) == 0;
+ i7 = 12;
+ }
+ do {
+ if ((i7 | 0) == 12) {
+ i7 = 0;
+ if ((_lua_type(i1, -1) | 0) == 0) {
+ if (i9) {
+ i7 = 17;
+ break;
+ } else {
+ break;
+ }
+ }
+ i10 = _lua_tolstring(i1, -1, 0) | 0;
+ i8 = HEAP32[20] | 0;
+ if ((i8 | 0) != 0) {
+ HEAP32[i3 >> 2] = i8;
+ _fprintf(i5 | 0, 496, i3 | 0) | 0;
+ _fflush(i5 | 0) | 0;
+ }
+ HEAP32[i3 >> 2] = (i10 | 0) == 0 ? 48 : i10;
+ _fprintf(i5 | 0, 912, i3 | 0) | 0;
+ _fflush(i5 | 0) | 0;
+ _lua_settop(i1, -2);
+ _lua_gc(i1, 2, 0) | 0;
+ if (i9) {
+ i7 = 17;
+ }
+ }
+ } while (0);
+ if (((i7 | 0) == 17 ? (0, (_lua_gettop(i1) | 0) > 0) : 0) ? (_luaL_checkstack(i1, 20, 112), _lua_getglobal(i1, 144), _lua_insert(i1, 1), (_lua_pcallk(i1, (_lua_gettop(i1) | 0) + -1 | 0, 0, 0, 0, 0) | 0) != 0) : 0) {
+ i7 = HEAP32[20] | 0;
+ HEAP32[i3 >> 2] = _lua_tolstring(i1, -1, 0) | 0;
+ i8 = _lua_pushfstring(i1, 152, i3) | 0;
+ if ((i7 | 0) != 0) {
+ HEAP32[i3 >> 2] = i7;
+ _fprintf(i5 | 0, 496, i3 | 0) | 0;
+ _fflush(i5 | 0) | 0;
+ }
+ HEAP32[i3 >> 2] = i8;
+ _fprintf(i5 | 0, 912, i3 | 0) | 0;
+ _fflush(i5 | 0) | 0;
+ }
+ _lua_settop(i1, 0);
+ if ((_pushline(i1, 1) | 0) == 0) {
+ i7 = 23;
+ break;
+ }
+ }
+ if ((i7 | 0) == 23) {
+ _lua_settop(i1, 0);
+ i10 = HEAP32[_stdout >> 2] | 0;
+ _fputc(10, i10 | 0) | 0;
+ _fflush(i10 | 0) | 0;
+ HEAP32[20] = i2;
+ STACKTOP = i6;
+ return;
+ }
+}
+function _test_then_block(i5, i1) {
+ i5 = i5 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 48 | 0;
+ i10 = i2 + 24 | 0;
+ i9 = i2;
+ i8 = i5 + 48 | 0;
+ i4 = HEAP32[i8 >> 2] | 0;
+ _luaX_next(i5);
+ _subexpr(i5, i9, 0) | 0;
+ i3 = i5 + 16 | 0;
+ if ((HEAP32[i3 >> 2] | 0) != 275) {
+ _error_expected(i5, 275);
+ }
+ _luaX_next(i5);
+ i14 = HEAP32[i3 >> 2] | 0;
+ do {
+ if ((i14 | 0) == 258 | (i14 | 0) == 266) {
+ _luaK_goiffalse(HEAP32[i8 >> 2] | 0, i9);
+ HEAP8[i10 + 10 | 0] = 0;
+ HEAP8[i10 + 8 | 0] = HEAP8[i4 + 46 | 0] | 0;
+ i11 = HEAP32[(HEAP32[i4 + 12 >> 2] | 0) + 64 >> 2] | 0;
+ HEAP16[i10 + 4 >> 1] = HEAP32[i11 + 28 >> 2];
+ HEAP16[i10 + 6 >> 1] = HEAP32[i11 + 16 >> 2];
+ HEAP8[i10 + 9 | 0] = 0;
+ i11 = i4 + 16 | 0;
+ HEAP32[i10 >> 2] = HEAP32[i11 >> 2];
+ HEAP32[i11 >> 2] = i10;
+ i11 = HEAP32[i9 + 16 >> 2] | 0;
+ i10 = HEAP32[i5 + 4 >> 2] | 0;
+ i14 = (HEAP32[i3 >> 2] | 0) == 266;
+ _luaX_next(i5);
+ do {
+ if (i14) {
+ if ((HEAP32[i3 >> 2] | 0) == 288) {
+ i7 = HEAP32[i5 + 24 >> 2] | 0;
+ _luaX_next(i5);
+ break;
+ } else {
+ _error_expected(i5, 288);
+ }
+ } else {
+ i7 = _luaS_new(HEAP32[i5 + 52 >> 2] | 0, 6304) | 0;
+ }
+ } while (0);
+ i14 = HEAP32[i5 + 64 >> 2] | 0;
+ i12 = i14 + 12 | 0;
+ i13 = i14 + 16 | 0;
+ i9 = HEAP32[i13 >> 2] | 0;
+ i14 = i14 + 20 | 0;
+ if ((i9 | 0) < (HEAP32[i14 >> 2] | 0)) {
+ i14 = HEAP32[i12 >> 2] | 0;
+ } else {
+ i14 = _luaM_growaux_(HEAP32[i5 + 52 >> 2] | 0, HEAP32[i12 >> 2] | 0, i14, 16, 32767, 6312) | 0;
+ HEAP32[i12 >> 2] = i14;
+ }
+ HEAP32[i14 + (i9 << 4) >> 2] = i7;
+ i14 = HEAP32[i12 >> 2] | 0;
+ HEAP32[i14 + (i9 << 4) + 8 >> 2] = i10;
+ HEAP8[i14 + (i9 << 4) + 12 | 0] = HEAP8[(HEAP32[i8 >> 2] | 0) + 46 | 0] | 0;
+ HEAP32[(HEAP32[i12 >> 2] | 0) + (i9 << 4) + 4 >> 2] = i11;
+ HEAP32[i13 >> 2] = (HEAP32[i13 >> 2] | 0) + 1;
+ _findlabel(i5, i9) | 0;
+ L18 : while (1) {
+ switch (HEAP32[i3 >> 2] | 0) {
+ case 286:
+ case 262:
+ case 261:
+ case 260:
+ {
+ break L18;
+ }
+ case 285:
+ case 59:
+ {
+ break;
+ }
+ default:
+ {
+ i6 = 16;
+ break L18;
+ }
+ }
+ _statement(i5);
+ }
+ if ((i6 | 0) == 16) {
+ i6 = _luaK_jump(i4) | 0;
+ break;
+ }
+ _leaveblock(i4);
+ STACKTOP = i2;
+ return;
+ } else {
+ _luaK_goiftrue(HEAP32[i8 >> 2] | 0, i9);
+ HEAP8[i10 + 10 | 0] = 0;
+ HEAP8[i10 + 8 | 0] = HEAP8[i4 + 46 | 0] | 0;
+ i6 = HEAP32[(HEAP32[i4 + 12 >> 2] | 0) + 64 >> 2] | 0;
+ HEAP16[i10 + 4 >> 1] = HEAP32[i6 + 28 >> 2];
+ HEAP16[i10 + 6 >> 1] = HEAP32[i6 + 16 >> 2];
+ HEAP8[i10 + 9 | 0] = 0;
+ i6 = i4 + 16 | 0;
+ HEAP32[i10 >> 2] = HEAP32[i6 >> 2];
+ HEAP32[i6 >> 2] = i10;
+ i6 = HEAP32[i9 + 20 >> 2] | 0;
+ }
+ } while (0);
+ L26 : do {
+ i7 = HEAP32[i3 >> 2] | 0;
+ switch (i7 | 0) {
+ case 277:
+ case 286:
+ case 262:
+ case 261:
+ case 260:
+ {
+ break L26;
+ }
+ default:
+ {}
+ }
+ _statement(i5);
+ } while ((i7 | 0) != 274);
+ _leaveblock(i4);
+ if (((HEAP32[i3 >> 2] | 0) + -260 | 0) >>> 0 < 2) {
+ _luaK_concat(i4, i1, _luaK_jump(i4) | 0);
+ }
+ _luaK_patchtohere(i4, i6);
+ STACKTOP = i2;
+ return;
+}
+function _luaL_gsub(i2, i13, i11, i10) {
+ i2 = i2 | 0;
+ i13 = i13 | 0;
+ i11 = i11 | 0;
+ i10 = i10 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i12 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 1056 | 0;
+ i8 = i1;
+ i4 = i1 + 8 | 0;
+ i9 = _strlen(i11 | 0) | 0;
+ i6 = i4 + 12 | 0;
+ HEAP32[i6 >> 2] = i2;
+ i3 = i4 + 16 | 0;
+ HEAP32[i4 >> 2] = i3;
+ i5 = i4 + 8 | 0;
+ HEAP32[i5 >> 2] = 0;
+ i7 = i4 + 4 | 0;
+ HEAP32[i7 >> 2] = 1024;
+ i12 = _strstr(i13, i11) | 0;
+ if ((i12 | 0) == 0) {
+ i14 = 0;
+ i17 = 1024;
+ i16 = i2;
+ } else {
+ i14 = 0;
+ i17 = 1024;
+ i16 = i2;
+ do {
+ i15 = i12 - i13 | 0;
+ if ((i17 - i14 | 0) >>> 0 < i15 >>> 0) {
+ i17 = i17 << 1;
+ i17 = (i17 - i14 | 0) >>> 0 < i15 >>> 0 ? i14 + i15 | 0 : i17;
+ if (i17 >>> 0 < i14 >>> 0 | (i17 - i14 | 0) >>> 0 < i15 >>> 0) {
+ _luaL_error(i16, 1272, i8) | 0;
+ }
+ i14 = _lua_newuserdata(i16, i17) | 0;
+ _memcpy(i14 | 0, HEAP32[i4 >> 2] | 0, HEAP32[i5 >> 2] | 0) | 0;
+ if ((HEAP32[i4 >> 2] | 0) != (i3 | 0)) {
+ _lua_remove(i16, -2);
+ }
+ HEAP32[i4 >> 2] = i14;
+ HEAP32[i7 >> 2] = i17;
+ i16 = i14;
+ i14 = HEAP32[i5 >> 2] | 0;
+ } else {
+ i16 = HEAP32[i4 >> 2] | 0;
+ }
+ _memcpy(i16 + i14 | 0, i13 | 0, i15 | 0) | 0;
+ i15 = (HEAP32[i5 >> 2] | 0) + i15 | 0;
+ HEAP32[i5 >> 2] = i15;
+ i13 = _strlen(i10 | 0) | 0;
+ i14 = HEAP32[i6 >> 2] | 0;
+ i16 = HEAP32[i7 >> 2] | 0;
+ if ((i16 - i15 | 0) >>> 0 < i13 >>> 0) {
+ i16 = i16 << 1;
+ i16 = (i16 - i15 | 0) >>> 0 < i13 >>> 0 ? i15 + i13 | 0 : i16;
+ if (i16 >>> 0 < i15 >>> 0 | (i16 - i15 | 0) >>> 0 < i13 >>> 0) {
+ _luaL_error(i14, 1272, i8) | 0;
+ }
+ i15 = _lua_newuserdata(i14, i16) | 0;
+ _memcpy(i15 | 0, HEAP32[i4 >> 2] | 0, HEAP32[i5 >> 2] | 0) | 0;
+ if ((HEAP32[i4 >> 2] | 0) != (i3 | 0)) {
+ _lua_remove(i14, -2);
+ }
+ HEAP32[i4 >> 2] = i15;
+ HEAP32[i7 >> 2] = i16;
+ i14 = i15;
+ i15 = HEAP32[i5 >> 2] | 0;
+ } else {
+ i14 = HEAP32[i4 >> 2] | 0;
+ }
+ _memcpy(i14 + i15 | 0, i10 | 0, i13 | 0) | 0;
+ i14 = (HEAP32[i5 >> 2] | 0) + i13 | 0;
+ HEAP32[i5 >> 2] = i14;
+ i13 = i12 + i9 | 0;
+ i12 = _strstr(i13, i11) | 0;
+ i16 = HEAP32[i6 >> 2] | 0;
+ i17 = HEAP32[i7 >> 2] | 0;
+ } while ((i12 | 0) != 0);
+ }
+ i9 = _strlen(i13 | 0) | 0;
+ if ((i17 - i14 | 0) >>> 0 < i9 >>> 0) {
+ i10 = i17 << 1;
+ i10 = (i10 - i14 | 0) >>> 0 < i9 >>> 0 ? i14 + i9 | 0 : i10;
+ if (i10 >>> 0 < i14 >>> 0 | (i10 - i14 | 0) >>> 0 < i9 >>> 0) {
+ _luaL_error(i16, 1272, i8) | 0;
+ }
+ i8 = _lua_newuserdata(i16, i10) | 0;
+ _memcpy(i8 | 0, HEAP32[i4 >> 2] | 0, HEAP32[i5 >> 2] | 0) | 0;
+ if ((HEAP32[i4 >> 2] | 0) != (i3 | 0)) {
+ _lua_remove(i16, -2);
+ }
+ HEAP32[i4 >> 2] = i8;
+ HEAP32[i7 >> 2] = i10;
+ i14 = HEAP32[i5 >> 2] | 0;
+ } else {
+ i8 = HEAP32[i4 >> 2] | 0;
+ }
+ _memcpy(i8 + i14 | 0, i13 | 0, i9 | 0) | 0;
+ i17 = (HEAP32[i5 >> 2] | 0) + i9 | 0;
+ HEAP32[i5 >> 2] = i17;
+ i5 = HEAP32[i6 >> 2] | 0;
+ _lua_pushlstring(i5, HEAP32[i4 >> 2] | 0, i17) | 0;
+ if ((HEAP32[i4 >> 2] | 0) == (i3 | 0)) {
+ i17 = _lua_tolstring(i2, -1, 0) | 0;
+ STACKTOP = i1;
+ return i17 | 0;
+ }
+ _lua_remove(i5, -2);
+ i17 = _lua_tolstring(i2, -1, 0) | 0;
+ STACKTOP = i1;
+ return i17 | 0;
+}
+function _luaK_goiffalse(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0;
+ i2 = STACKTOP;
+ _luaK_dischargevars(i1, i3);
+ i9 = HEAP32[i3 >> 2] | 0;
+ do {
+ if ((i9 | 0) == 10) {
+ i4 = HEAP32[i3 + 8 >> 2] | 0;
+ i8 = 15;
+ } else if (!((i9 | 0) == 3 | (i9 | 0) == 1)) {
+ i4 = i3 + 8 | 0;
+ if ((i9 | 0) == 6) {
+ i8 = 11;
+ } else if ((i9 | 0) == 11 ? (i10 = HEAP32[(HEAP32[(HEAP32[i1 >> 2] | 0) + 12 >> 2] | 0) + (HEAP32[i4 >> 2] << 2) >> 2] | 0, (i10 & 63 | 0) == 20) : 0) {
+ i4 = i1 + 20 | 0;
+ HEAP32[i4 >> 2] = (HEAP32[i4 >> 2] | 0) + -1;
+ i4 = _condjump(i1, 27, i10 >>> 23, 0, 0) | 0;
+ i8 = 15;
+ break;
+ } else {
+ i8 = 6;
+ }
+ if ((i8 | 0) == 6) {
+ i9 = i1 + 48 | 0;
+ i11 = HEAP8[i9] | 0;
+ i10 = (i11 & 255) + 1 | 0;
+ i12 = (HEAP32[i1 >> 2] | 0) + 78 | 0;
+ do {
+ if (i10 >>> 0 > (HEAPU8[i12] | 0) >>> 0) {
+ if (i10 >>> 0 > 249) {
+ _luaX_syntaxerror(HEAP32[i1 + 12 >> 2] | 0, 10536);
+ } else {
+ HEAP8[i12] = i10;
+ i7 = HEAP8[i9] | 0;
+ break;
+ }
+ } else {
+ i7 = i11;
+ }
+ } while (0);
+ i12 = (i7 & 255) + 1 | 0;
+ HEAP8[i9] = i12;
+ _discharge2reg(i1, i3, (i12 & 255) + -1 | 0);
+ if ((HEAP32[i3 >> 2] | 0) == 6) {
+ i8 = 11;
+ }
+ }
+ if (((i8 | 0) == 11 ? (i6 = HEAP32[i4 >> 2] | 0, (i6 & 256 | 0) == 0) : 0) ? (HEAPU8[i1 + 46 | 0] | 0 | 0) <= (i6 | 0) : 0) {
+ i12 = i1 + 48 | 0;
+ HEAP8[i12] = (HEAP8[i12] | 0) + -1 << 24 >> 24;
+ }
+ i4 = _condjump(i1, 28, 255, HEAP32[i4 >> 2] | 0, 1) | 0;
+ i8 = 15;
+ }
+ } while (0);
+ do {
+ if ((i8 | 0) == 15 ? (i5 = i3 + 16 | 0, !((i4 | 0) == -1)) : 0) {
+ i8 = HEAP32[i5 >> 2] | 0;
+ if ((i8 | 0) == -1) {
+ HEAP32[i5 >> 2] = i4;
+ break;
+ }
+ i5 = HEAP32[(HEAP32[i1 >> 2] | 0) + 12 >> 2] | 0;
+ while (1) {
+ i7 = i5 + (i8 << 2) | 0;
+ i6 = HEAP32[i7 >> 2] | 0;
+ i9 = (i6 >>> 14) + -131071 | 0;
+ if ((i9 | 0) == -1) {
+ break;
+ }
+ i9 = i8 + 1 + i9 | 0;
+ if ((i9 | 0) == -1) {
+ break;
+ } else {
+ i8 = i9;
+ }
+ }
+ i4 = i4 + ~i8 | 0;
+ if ((((i4 | 0) > -1 ? i4 : 0 - i4 | 0) | 0) > 131071) {
+ _luaX_syntaxerror(HEAP32[i1 + 12 >> 2] | 0, 10624);
+ } else {
+ HEAP32[i7 >> 2] = (i4 << 14) + 2147467264 | i6 & 16383;
+ break;
+ }
+ }
+ } while (0);
+ i3 = i3 + 20 | 0;
+ i4 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i1 + 24 >> 2] = HEAP32[i1 + 20 >> 2];
+ i5 = i1 + 28 | 0;
+ if ((i4 | 0) == -1) {
+ HEAP32[i3 >> 2] = -1;
+ STACKTOP = i2;
+ return;
+ }
+ i8 = HEAP32[i5 >> 2] | 0;
+ if ((i8 | 0) == -1) {
+ HEAP32[i5 >> 2] = i4;
+ HEAP32[i3 >> 2] = -1;
+ STACKTOP = i2;
+ return;
+ }
+ i7 = HEAP32[(HEAP32[i1 >> 2] | 0) + 12 >> 2] | 0;
+ while (1) {
+ i5 = i7 + (i8 << 2) | 0;
+ i6 = HEAP32[i5 >> 2] | 0;
+ i9 = (i6 >>> 14) + -131071 | 0;
+ if ((i9 | 0) == -1) {
+ break;
+ }
+ i9 = i8 + 1 + i9 | 0;
+ if ((i9 | 0) == -1) {
+ break;
+ } else {
+ i8 = i9;
+ }
+ }
+ i4 = i4 + ~i8 | 0;
+ if ((((i4 | 0) > -1 ? i4 : 0 - i4 | 0) | 0) > 131071) {
+ _luaX_syntaxerror(HEAP32[i1 + 12 >> 2] | 0, 10624);
+ }
+ HEAP32[i5 >> 2] = (i4 << 14) + 2147467264 | i6 & 16383;
+ HEAP32[i3 >> 2] = -1;
+ STACKTOP = i2;
+ return;
+}
+function _luaV_settable(i2, i11, i7, i9) {
+ i2 = i2 | 0;
+ i11 = i11 | 0;
+ i7 = i7 | 0;
+ i9 = i9 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i8 = 0, i10 = 0, i12 = 0, i13 = 0, i14 = 0;
+ i6 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i5 = i6;
+ i4 = i2 + 12 | 0;
+ i3 = i11;
+ i13 = HEAP32[i11 + 8 >> 2] | 0;
+ i12 = 0;
+ while (1) {
+ i11 = i3 + 8 | 0;
+ if ((i13 | 0) != 69) {
+ i14 = _luaT_gettmbyobj(i2, i3, 1) | 0;
+ i13 = HEAP32[i14 + 8 >> 2] | 0;
+ if ((i13 | 0) == 0) {
+ i1 = 16;
+ break;
+ }
+ } else {
+ i8 = HEAP32[i3 >> 2] | 0;
+ i13 = _luaH_get(i8, i7) | 0;
+ if ((HEAP32[i13 + 8 >> 2] | 0) != 0) {
+ i10 = i13;
+ break;
+ }
+ i14 = HEAP32[i8 + 8 >> 2] | 0;
+ if ((i14 | 0) == 0) {
+ i1 = 9;
+ break;
+ }
+ if (!((HEAP8[i14 + 6 | 0] & 2) == 0)) {
+ i1 = 9;
+ break;
+ }
+ i14 = _luaT_gettm(i14, 1, HEAP32[(HEAP32[i4 >> 2] | 0) + 188 >> 2] | 0) | 0;
+ if ((i14 | 0) == 0) {
+ i1 = 9;
+ break;
+ }
+ i13 = HEAP32[i14 + 8 >> 2] | 0;
+ }
+ i12 = i12 + 1 | 0;
+ if ((i13 & 15 | 0) == 6) {
+ i1 = 18;
+ break;
+ }
+ if ((i12 | 0) < 100) {
+ i3 = i14;
+ } else {
+ i1 = 19;
+ break;
+ }
+ }
+ if ((i1 | 0) == 9) {
+ if ((i13 | 0) == 5192) {
+ i10 = _luaH_newkey(i2, i8, i7) | 0;
+ } else {
+ i10 = i13;
+ }
+ } else if ((i1 | 0) == 16) {
+ _luaG_typeerror(i2, i3, 8944);
+ } else if ((i1 | 0) == 18) {
+ i13 = i2 + 8 | 0;
+ i8 = HEAP32[i13 >> 2] | 0;
+ HEAP32[i13 >> 2] = i8 + 16;
+ i5 = i14;
+ i12 = HEAP32[i5 + 4 >> 2] | 0;
+ i10 = i8;
+ HEAP32[i10 >> 2] = HEAP32[i5 >> 2];
+ HEAP32[i10 + 4 >> 2] = i12;
+ HEAP32[i8 + 8 >> 2] = HEAP32[i14 + 8 >> 2];
+ i14 = HEAP32[i13 >> 2] | 0;
+ HEAP32[i13 >> 2] = i14 + 16;
+ i8 = i3;
+ i10 = HEAP32[i8 + 4 >> 2] | 0;
+ i12 = i14;
+ HEAP32[i12 >> 2] = HEAP32[i8 >> 2];
+ HEAP32[i12 + 4 >> 2] = i10;
+ HEAP32[i14 + 8 >> 2] = HEAP32[i11 >> 2];
+ i14 = HEAP32[i13 >> 2] | 0;
+ HEAP32[i13 >> 2] = i14 + 16;
+ i12 = i7;
+ i11 = HEAP32[i12 + 4 >> 2] | 0;
+ i10 = i14;
+ HEAP32[i10 >> 2] = HEAP32[i12 >> 2];
+ HEAP32[i10 + 4 >> 2] = i11;
+ HEAP32[i14 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ i14 = HEAP32[i13 >> 2] | 0;
+ HEAP32[i13 >> 2] = i14 + 16;
+ i10 = i9;
+ i11 = HEAP32[i10 + 4 >> 2] | 0;
+ i12 = i14;
+ HEAP32[i12 >> 2] = HEAP32[i10 >> 2];
+ HEAP32[i12 + 4 >> 2] = i11;
+ HEAP32[i14 + 8 >> 2] = HEAP32[i9 + 8 >> 2];
+ _luaD_call(i2, (HEAP32[i13 >> 2] | 0) + -64 | 0, 0, HEAP8[(HEAP32[i2 + 16 >> 2] | 0) + 18 | 0] & 1);
+ STACKTOP = i6;
+ return;
+ } else if ((i1 | 0) == 19) {
+ _luaG_runerror(i2, 8976, i5);
+ }
+ i12 = i9;
+ i13 = HEAP32[i12 + 4 >> 2] | 0;
+ i14 = i10;
+ HEAP32[i14 >> 2] = HEAP32[i12 >> 2];
+ HEAP32[i14 + 4 >> 2] = i13;
+ i14 = i9 + 8 | 0;
+ HEAP32[i10 + 8 >> 2] = HEAP32[i14 >> 2];
+ HEAP8[i8 + 6 | 0] = 0;
+ if ((HEAP32[i14 >> 2] & 64 | 0) == 0) {
+ STACKTOP = i6;
+ return;
+ }
+ if ((HEAP8[(HEAP32[i9 >> 2] | 0) + 5 | 0] & 3) == 0) {
+ STACKTOP = i6;
+ return;
+ }
+ if ((HEAP8[i8 + 5 | 0] & 4) == 0) {
+ STACKTOP = i6;
+ return;
+ }
+ _luaC_barrierback_(i2, i8);
+ STACKTOP = i6;
+ return;
+}
+function _luaK_code(i4, i5) {
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0;
+ i2 = STACKTOP;
+ i1 = HEAP32[i4 >> 2] | 0;
+ i7 = i4 + 28 | 0;
+ i15 = HEAP32[i7 >> 2] | 0;
+ i3 = i4 + 20 | 0;
+ i8 = HEAP32[i3 >> 2] | 0;
+ do {
+ if (!((i15 | 0) == -1)) {
+ i11 = HEAP32[i1 + 12 >> 2] | 0;
+ while (1) {
+ i12 = i11 + (i15 << 2) | 0;
+ i14 = HEAP32[i12 >> 2] | 0;
+ i13 = (i14 >>> 14) + -131071 | 0;
+ if ((i13 | 0) == -1) {
+ i13 = -1;
+ } else {
+ i13 = i15 + 1 + i13 | 0;
+ }
+ if ((i15 | 0) > 0 ? (i9 = i11 + (i15 + -1 << 2) | 0, i10 = HEAP32[i9 >> 2] | 0, (HEAP8[5584 + (i10 & 63) | 0] | 0) < 0) : 0) {
+ i17 = i9;
+ i16 = i10;
+ } else {
+ i17 = i12;
+ i16 = i14;
+ }
+ if ((i16 & 63 | 0) == 28) {
+ HEAP32[i17 >> 2] = i16 & 8372224 | i16 >>> 23 << 6 | 27;
+ i14 = i8 + ~i15 | 0;
+ if ((((i14 | 0) > -1 ? i14 : 0 - i14 | 0) | 0) > 131071) {
+ i8 = 10;
+ break;
+ }
+ i14 = HEAP32[i12 >> 2] & 16383 | (i14 << 14) + 2147467264;
+ } else {
+ i15 = i8 + ~i15 | 0;
+ if ((((i15 | 0) > -1 ? i15 : 0 - i15 | 0) | 0) > 131071) {
+ i8 = 13;
+ break;
+ }
+ i14 = (i15 << 14) + 2147467264 | i14 & 16383;
+ }
+ HEAP32[i12 >> 2] = i14;
+ if ((i13 | 0) == -1) {
+ i8 = 16;
+ break;
+ } else {
+ i15 = i13;
+ }
+ }
+ if ((i8 | 0) == 10) {
+ _luaX_syntaxerror(HEAP32[i4 + 12 >> 2] | 0, 10624);
+ } else if ((i8 | 0) == 13) {
+ _luaX_syntaxerror(HEAP32[i4 + 12 >> 2] | 0, 10624);
+ } else if ((i8 | 0) == 16) {
+ i6 = HEAP32[i3 >> 2] | 0;
+ break;
+ }
+ } else {
+ i6 = i8;
+ }
+ } while (0);
+ HEAP32[i7 >> 2] = -1;
+ i7 = i1 + 48 | 0;
+ if ((i6 | 0) < (HEAP32[i7 >> 2] | 0)) {
+ i7 = i1 + 12 | 0;
+ } else {
+ i6 = i1 + 12 | 0;
+ HEAP32[i6 >> 2] = _luaM_growaux_(HEAP32[(HEAP32[i4 + 12 >> 2] | 0) + 52 >> 2] | 0, HEAP32[i6 >> 2] | 0, i7, 4, 2147483645, 10616) | 0;
+ i7 = i6;
+ i6 = HEAP32[i3 >> 2] | 0;
+ }
+ HEAP32[(HEAP32[i7 >> 2] | 0) + (i6 << 2) >> 2] = i5;
+ i5 = HEAP32[i3 >> 2] | 0;
+ i6 = i1 + 52 | 0;
+ i4 = i4 + 12 | 0;
+ if ((i5 | 0) < (HEAP32[i6 >> 2] | 0)) {
+ i15 = i1 + 20 | 0;
+ i17 = i5;
+ i16 = HEAP32[i4 >> 2] | 0;
+ i16 = i16 + 8 | 0;
+ i16 = HEAP32[i16 >> 2] | 0;
+ i15 = HEAP32[i15 >> 2] | 0;
+ i17 = i15 + (i17 << 2) | 0;
+ HEAP32[i17 >> 2] = i16;
+ i17 = HEAP32[i3 >> 2] | 0;
+ i16 = i17 + 1 | 0;
+ HEAP32[i3 >> 2] = i16;
+ STACKTOP = i2;
+ return i17 | 0;
+ } else {
+ i15 = i1 + 20 | 0;
+ HEAP32[i15 >> 2] = _luaM_growaux_(HEAP32[(HEAP32[i4 >> 2] | 0) + 52 >> 2] | 0, HEAP32[i15 >> 2] | 0, i6, 4, 2147483645, 10616) | 0;
+ i17 = HEAP32[i3 >> 2] | 0;
+ i16 = HEAP32[i4 >> 2] | 0;
+ i16 = i16 + 8 | 0;
+ i16 = HEAP32[i16 >> 2] | 0;
+ i15 = HEAP32[i15 >> 2] | 0;
+ i17 = i15 + (i17 << 2) | 0;
+ HEAP32[i17 >> 2] = i16;
+ i17 = HEAP32[i3 >> 2] | 0;
+ i16 = i17 + 1 | 0;
+ HEAP32[i3 >> 2] = i16;
+ STACKTOP = i2;
+ return i17 | 0;
+ }
+ return 0;
+}
+function _luaH_next(i9, i5, i2) {
+ i9 = i9 | 0;
+ i5 = i5 | 0;
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, d14 = 0.0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i8 = i1 + 8 | 0;
+ i11 = i1;
+ i3 = i2 + 8 | 0;
+ i10 = HEAP32[i3 >> 2] | 0;
+ do {
+ if ((i10 | 0) != 0) {
+ if ((((i10 | 0) == 3 ? (d14 = +HEAPF64[i2 >> 3], HEAPF64[i11 >> 3] = d14 + 6755399441055744.0, i12 = HEAP32[i11 >> 2] | 0, +(i12 | 0) == d14) : 0) ? (i12 | 0) > 0 : 0) ? (i13 = HEAP32[i5 + 28 >> 2] | 0, (i12 | 0) <= (i13 | 0)) : 0) {
+ i6 = i13;
+ i7 = i12 + -1 | 0;
+ break;
+ }
+ i10 = _mainposition(i5, i2) | 0;
+ while (1) {
+ i4 = i10 + 16 | 0;
+ i11 = i10 + 24 | 0;
+ i12 = HEAP32[i11 >> 2] | 0;
+ if ((i12 | 0) == (HEAP32[i3 >> 2] | 0)) {
+ if ((_luaV_equalobj_(0, i4, i2) | 0) != 0) {
+ i4 = 15;
+ break;
+ }
+ i12 = HEAP32[i11 >> 2] | 0;
+ }
+ if (((i12 | 0) == 11 ? (HEAP32[i3 >> 2] & 64 | 0) != 0 : 0) ? (HEAP32[i4 >> 2] | 0) == (HEAP32[i2 >> 2] | 0) : 0) {
+ i4 = 15;
+ break;
+ }
+ i10 = HEAP32[i10 + 28 >> 2] | 0;
+ if ((i10 | 0) == 0) {
+ i4 = 18;
+ break;
+ }
+ }
+ if ((i4 | 0) == 15) {
+ i7 = HEAP32[i5 + 28 >> 2] | 0;
+ i6 = i7;
+ i7 = (i10 - (HEAP32[i5 + 16 >> 2] | 0) >> 5) + i7 | 0;
+ break;
+ } else if ((i4 | 0) == 18) {
+ _luaG_runerror(i9, 8064, i8);
+ }
+ } else {
+ i6 = HEAP32[i5 + 28 >> 2] | 0;
+ i7 = -1;
+ }
+ } while (0);
+ i8 = i5 + 12 | 0;
+ while (1) {
+ i9 = i7 + 1 | 0;
+ if ((i9 | 0) >= (i6 | 0)) {
+ break;
+ }
+ i11 = HEAP32[i8 >> 2] | 0;
+ i10 = i11 + (i9 << 4) + 8 | 0;
+ if ((HEAP32[i10 >> 2] | 0) == 0) {
+ i7 = i9;
+ } else {
+ i4 = 21;
+ break;
+ }
+ }
+ if ((i4 | 0) == 21) {
+ HEAPF64[i2 >> 3] = +(i7 + 2 | 0);
+ HEAP32[i3 >> 2] = 3;
+ i11 = i11 + (i9 << 4) | 0;
+ i12 = HEAP32[i11 + 4 >> 2] | 0;
+ i13 = i2 + 16 | 0;
+ HEAP32[i13 >> 2] = HEAP32[i11 >> 2];
+ HEAP32[i13 + 4 >> 2] = i12;
+ HEAP32[i2 + 24 >> 2] = HEAP32[i10 >> 2];
+ i13 = 1;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ i8 = i9 - i6 | 0;
+ i6 = 1 << (HEAPU8[i5 + 7 | 0] | 0);
+ if ((i8 | 0) >= (i6 | 0)) {
+ i13 = 0;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ i7 = i5 + 16 | 0;
+ i5 = HEAP32[i7 >> 2] | 0;
+ while (1) {
+ i9 = i8 + 1 | 0;
+ if ((HEAP32[i5 + (i8 << 5) + 8 >> 2] | 0) != 0) {
+ break;
+ }
+ if ((i9 | 0) < (i6 | 0)) {
+ i8 = i9;
+ } else {
+ i2 = 0;
+ i4 = 27;
+ break;
+ }
+ }
+ if ((i4 | 0) == 27) {
+ STACKTOP = i1;
+ return i2 | 0;
+ }
+ i11 = i5 + (i8 << 5) + 16 | 0;
+ i10 = HEAP32[i11 + 4 >> 2] | 0;
+ i13 = i2;
+ HEAP32[i13 >> 2] = HEAP32[i11 >> 2];
+ HEAP32[i13 + 4 >> 2] = i10;
+ HEAP32[i3 >> 2] = HEAP32[i5 + (i8 << 5) + 24 >> 2];
+ i13 = HEAP32[i7 >> 2] | 0;
+ i10 = i13 + (i8 << 5) | 0;
+ i11 = HEAP32[i10 + 4 >> 2] | 0;
+ i12 = i2 + 16 | 0;
+ HEAP32[i12 >> 2] = HEAP32[i10 >> 2];
+ HEAP32[i12 + 4 >> 2] = i11;
+ HEAP32[i2 + 24 >> 2] = HEAP32[i13 + (i8 << 5) + 8 >> 2];
+ i13 = 1;
+ STACKTOP = i1;
+ return i13 | 0;
+}
+function _g_read(i1, i3, i2) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ var i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0;
+ i4 = STACKTOP;
+ STACKTOP = STACKTOP + 1056 | 0;
+ i7 = i4 + 8 | 0;
+ i9 = i4;
+ i10 = _lua_gettop(i1) | 0;
+ _clearerr(i3 | 0);
+ L1 : do {
+ if ((i10 | 0) == 1) {
+ i11 = i2 + 1 | 0;
+ i12 = _read_line(i1, i3, 1) | 0;
+ } else {
+ _luaL_checkstack(i1, i10 + 19 | 0, 3256);
+ i6 = i7 + 8 | 0;
+ i5 = i7 + 8 | 0;
+ i10 = i10 + -2 | 0;
+ i11 = i2;
+ L4 : while (1) {
+ do {
+ if ((_lua_type(i1, i11) | 0) == 3) {
+ i12 = _lua_tointegerx(i1, i11, 0) | 0;
+ if ((i12 | 0) == 0) {
+ i12 = _fgetc(i3 | 0) | 0;
+ _ungetc(i12 | 0, i3 | 0) | 0;
+ _lua_pushlstring(i1, 0, 0) | 0;
+ i12 = (i12 | 0) != -1 | 0;
+ break;
+ } else {
+ _luaL_buffinit(i1, i7);
+ i12 = _fread(_luaL_prepbuffsize(i7, i12) | 0, 1, i12 | 0, i3 | 0) | 0;
+ HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + i12;
+ _luaL_pushresult(i7);
+ i12 = (i12 | 0) != 0 | 0;
+ break;
+ }
+ } else {
+ i12 = _lua_tolstring(i1, i11, 0) | 0;
+ if (!((i12 | 0) != 0 ? (HEAP8[i12] | 0) == 42 : 0)) {
+ _luaL_argerror(i1, i11, 3280) | 0;
+ }
+ i12 = HEAP8[i12 + 1 | 0] | 0;
+ if ((i12 | 0) == 110) {
+ HEAP32[i7 >> 2] = i9;
+ if ((_fscanf(i3 | 0, 3312, i7 | 0) | 0) != 1) {
+ i8 = 14;
+ break L4;
+ }
+ _lua_pushnumber(i1, +HEAPF64[i9 >> 3]);
+ i12 = 1;
+ break;
+ } else if ((i12 | 0) == 108) {
+ i12 = _read_line(i1, i3, 1) | 0;
+ break;
+ } else if ((i12 | 0) == 76) {
+ i12 = _read_line(i1, i3, 0) | 0;
+ break;
+ } else if ((i12 | 0) == 97) {
+ _luaL_buffinit(i1, i7);
+ i12 = _fread(_luaL_prepbuffsize(i7, 1024) | 0, 1, 1024, i3 | 0) | 0;
+ HEAP32[i5 >> 2] = (HEAP32[i5 >> 2] | 0) + i12;
+ if (!(i12 >>> 0 < 1024)) {
+ i12 = 1024;
+ do {
+ i12 = i12 << (i12 >>> 0 < 1073741824);
+ i13 = _fread(_luaL_prepbuffsize(i7, i12) | 0, 1, i12 | 0, i3 | 0) | 0;
+ HEAP32[i5 >> 2] = (HEAP32[i5 >> 2] | 0) + i13;
+ } while (!(i13 >>> 0 < i12 >>> 0));
+ }
+ _luaL_pushresult(i7);
+ i12 = 1;
+ break;
+ } else {
+ break L4;
+ }
+ }
+ } while (0);
+ i11 = i11 + 1 | 0;
+ if ((i10 | 0) == 0 | (i12 | 0) == 0) {
+ break L1;
+ } else {
+ i10 = i10 + -1 | 0;
+ }
+ }
+ if ((i8 | 0) == 14) {
+ _lua_pushnil(i1);
+ i11 = i11 + 1 | 0;
+ i12 = 0;
+ break;
+ }
+ i13 = _luaL_argerror(i1, i11, 3296) | 0;
+ STACKTOP = i4;
+ return i13 | 0;
+ }
+ } while (0);
+ if ((_ferror(i3 | 0) | 0) != 0) {
+ i13 = _luaL_fileresult(i1, 0, 0) | 0;
+ STACKTOP = i4;
+ return i13 | 0;
+ }
+ if ((i12 | 0) == 0) {
+ _lua_settop(i1, -2);
+ _lua_pushnil(i1);
+ }
+ i13 = i11 - i2 | 0;
+ STACKTOP = i4;
+ return i13 | 0;
+}
+function _luaY_parser(i8, i12, i10, i11, i9, i13) {
+ i8 = i8 | 0;
+ i12 = i12 | 0;
+ i10 = i10 | 0;
+ i11 = i11 | 0;
+ i9 = i9 | 0;
+ i13 = i13 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i14 = 0, i15 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 176 | 0;
+ i5 = i2 + 156 | 0;
+ i7 = i2 + 80 | 0;
+ i4 = i2;
+ i6 = i2 + 104 | 0;
+ i3 = _luaF_newLclosure(i8, 1) | 0;
+ i15 = i8 + 8 | 0;
+ i14 = HEAP32[i15 >> 2] | 0;
+ HEAP32[i14 >> 2] = i3;
+ HEAP32[i14 + 8 >> 2] = 70;
+ i14 = (HEAP32[i15 >> 2] | 0) + 16 | 0;
+ HEAP32[i15 >> 2] = i14;
+ if (((HEAP32[i8 + 24 >> 2] | 0) - i14 | 0) < 16) {
+ _luaD_growstack(i8, 0);
+ }
+ i14 = _luaF_newproto(i8) | 0;
+ HEAP32[i3 + 12 >> 2] = i14;
+ HEAP32[i6 >> 2] = i14;
+ i9 = _luaS_new(i8, i9) | 0;
+ HEAP32[(HEAP32[i6 >> 2] | 0) + 36 >> 2] = i9;
+ HEAP32[i4 + 60 >> 2] = i10;
+ i9 = i4 + 64 | 0;
+ HEAP32[i9 >> 2] = i11;
+ HEAP32[i11 + 28 >> 2] = 0;
+ HEAP32[i11 + 16 >> 2] = 0;
+ HEAP32[i11 + 4 >> 2] = 0;
+ _luaX_setinput(i8, i4, i12, HEAP32[(HEAP32[i6 >> 2] | 0) + 36 >> 2] | 0, i13);
+ i10 = HEAP32[i4 + 52 >> 2] | 0;
+ i13 = i4 + 48 | 0;
+ HEAP32[i6 + 8 >> 2] = HEAP32[i13 >> 2];
+ i8 = i6 + 12 | 0;
+ HEAP32[i8 >> 2] = i4;
+ HEAP32[i13 >> 2] = i6;
+ HEAP32[i6 + 20 >> 2] = 0;
+ HEAP32[i6 + 24 >> 2] = 0;
+ HEAP32[i6 + 28 >> 2] = -1;
+ HEAP32[i6 + 32 >> 2] = 0;
+ HEAP32[i6 + 36 >> 2] = 0;
+ i13 = i6 + 44 | 0;
+ HEAP32[i13 + 0 >> 2] = 0;
+ HEAP8[i13 + 4 | 0] = 0;
+ HEAP32[i6 + 40 >> 2] = HEAP32[(HEAP32[i9 >> 2] | 0) + 4 >> 2];
+ i9 = i6 + 16 | 0;
+ HEAP32[i9 >> 2] = 0;
+ i13 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i13 + 36 >> 2] = HEAP32[i4 + 68 >> 2];
+ HEAP8[i13 + 78 | 0] = 2;
+ i13 = _luaH_new(i10) | 0;
+ HEAP32[i6 + 4 >> 2] = i13;
+ i14 = i10 + 8 | 0;
+ i15 = HEAP32[i14 >> 2] | 0;
+ HEAP32[i15 >> 2] = i13;
+ HEAP32[i15 + 8 >> 2] = 69;
+ i15 = (HEAP32[i14 >> 2] | 0) + 16 | 0;
+ HEAP32[i14 >> 2] = i15;
+ if (((HEAP32[i10 + 24 >> 2] | 0) - i15 | 0) < 16) {
+ _luaD_growstack(i10, 0);
+ }
+ HEAP8[i5 + 10 | 0] = 0;
+ HEAP8[i5 + 8 | 0] = HEAP8[i6 + 46 | 0] | 0;
+ i15 = HEAP32[(HEAP32[i8 >> 2] | 0) + 64 >> 2] | 0;
+ HEAP16[i5 + 4 >> 1] = HEAP32[i15 + 28 >> 2];
+ HEAP16[i5 + 6 >> 1] = HEAP32[i15 + 16 >> 2];
+ HEAP8[i5 + 9 | 0] = 0;
+ HEAP32[i5 >> 2] = HEAP32[i9 >> 2];
+ HEAP32[i9 >> 2] = i5;
+ HEAP8[(HEAP32[i6 >> 2] | 0) + 77 | 0] = 1;
+ HEAP32[i7 + 16 >> 2] = -1;
+ HEAP32[i7 + 20 >> 2] = -1;
+ HEAP32[i7 >> 2] = 7;
+ HEAP32[i7 + 8 >> 2] = 0;
+ _newupvalue(i6, HEAP32[i4 + 72 >> 2] | 0, i7) | 0;
+ _luaX_next(i4);
+ i5 = i4 + 16 | 0;
+ L7 : while (1) {
+ i6 = HEAP32[i5 >> 2] | 0;
+ switch (i6 | 0) {
+ case 277:
+ case 286:
+ case 262:
+ case 261:
+ case 260:
+ {
+ break L7;
+ }
+ default:
+ {}
+ }
+ _statement(i4);
+ if ((i6 | 0) == 274) {
+ i1 = 8;
+ break;
+ }
+ }
+ if ((i1 | 0) == 8) {
+ i6 = HEAP32[i5 >> 2] | 0;
+ }
+ if ((i6 | 0) == 286) {
+ _close_func(i4);
+ STACKTOP = i2;
+ return i3 | 0;
+ } else {
+ _error_expected(i4, 286);
+ }
+ return 0;
+}
+function _luaV_lessthan(i5, i4, i2) {
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0;
+ i1 = STACKTOP;
+ i6 = i4 + 8 | 0;
+ i7 = HEAP32[i6 >> 2] | 0;
+ if ((i7 | 0) == 3) {
+ if ((HEAP32[i2 + 8 >> 2] | 0) == 3) {
+ i9 = +HEAPF64[i4 >> 3] < +HEAPF64[i2 >> 3] | 0;
+ STACKTOP = i1;
+ return i9 | 0;
+ }
+ } else {
+ if ((i7 & 15 | 0) == 4 ? (HEAP32[i2 + 8 >> 2] & 15 | 0) == 4 : 0) {
+ i6 = HEAP32[i4 >> 2] | 0;
+ i4 = HEAP32[i2 >> 2] | 0;
+ i3 = i6 + 16 | 0;
+ i5 = i4 + 16 | 0;
+ i7 = _strcmp(i3, i5) | 0;
+ L8 : do {
+ if ((i7 | 0) == 0) {
+ i2 = HEAP32[i6 + 12 >> 2] | 0;
+ i4 = HEAP32[i4 + 12 >> 2] | 0;
+ while (1) {
+ i7 = _strlen(i3 | 0) | 0;
+ i6 = (i7 | 0) == (i2 | 0);
+ if ((i7 | 0) == (i4 | 0)) {
+ break;
+ }
+ if (i6) {
+ i7 = -1;
+ break L8;
+ }
+ i6 = i7 + 1 | 0;
+ i3 = i3 + i6 | 0;
+ i5 = i5 + i6 | 0;
+ i7 = _strcmp(i3, i5) | 0;
+ if ((i7 | 0) == 0) {
+ i2 = i2 - i6 | 0;
+ i4 = i4 - i6 | 0;
+ } else {
+ break L8;
+ }
+ }
+ i7 = i6 & 1 ^ 1;
+ }
+ } while (0);
+ i9 = i7 >>> 31;
+ STACKTOP = i1;
+ return i9 | 0;
+ }
+ }
+ i8 = i5 + 8 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ i9 = _luaT_gettmbyobj(i5, i4, 13) | 0;
+ if ((HEAP32[i9 + 8 >> 2] | 0) == 0) {
+ i9 = _luaT_gettmbyobj(i5, i2, 13) | 0;
+ if ((HEAP32[i9 + 8 >> 2] | 0) == 0) {
+ _luaG_ordererror(i5, i4, i2);
+ } else {
+ i3 = i9;
+ }
+ } else {
+ i3 = i9;
+ }
+ i10 = i5 + 28 | 0;
+ i9 = i7 - (HEAP32[i10 >> 2] | 0) | 0;
+ i11 = HEAP32[i8 >> 2] | 0;
+ HEAP32[i8 >> 2] = i11 + 16;
+ i13 = i3;
+ i12 = HEAP32[i13 + 4 >> 2] | 0;
+ i7 = i11;
+ HEAP32[i7 >> 2] = HEAP32[i13 >> 2];
+ HEAP32[i7 + 4 >> 2] = i12;
+ HEAP32[i11 + 8 >> 2] = HEAP32[i3 + 8 >> 2];
+ i3 = HEAP32[i8 >> 2] | 0;
+ HEAP32[i8 >> 2] = i3 + 16;
+ i11 = i4;
+ i7 = HEAP32[i11 + 4 >> 2] | 0;
+ i4 = i3;
+ HEAP32[i4 >> 2] = HEAP32[i11 >> 2];
+ HEAP32[i4 + 4 >> 2] = i7;
+ HEAP32[i3 + 8 >> 2] = HEAP32[i6 >> 2];
+ i3 = HEAP32[i8 >> 2] | 0;
+ HEAP32[i8 >> 2] = i3 + 16;
+ i4 = i2;
+ i7 = HEAP32[i4 + 4 >> 2] | 0;
+ i6 = i3;
+ HEAP32[i6 >> 2] = HEAP32[i4 >> 2];
+ HEAP32[i6 + 4 >> 2] = i7;
+ HEAP32[i3 + 8 >> 2] = HEAP32[i2 + 8 >> 2];
+ _luaD_call(i5, (HEAP32[i8 >> 2] | 0) + -48 | 0, 1, HEAP8[(HEAP32[i5 + 16 >> 2] | 0) + 18 | 0] & 1);
+ i2 = HEAP32[i10 >> 2] | 0;
+ i3 = HEAP32[i8 >> 2] | 0;
+ i5 = i3 + -16 | 0;
+ HEAP32[i8 >> 2] = i5;
+ i6 = HEAP32[i5 + 4 >> 2] | 0;
+ i7 = i2 + i9 | 0;
+ HEAP32[i7 >> 2] = HEAP32[i5 >> 2];
+ HEAP32[i7 + 4 >> 2] = i6;
+ HEAP32[i2 + (i9 + 8) >> 2] = HEAP32[i3 + -8 >> 2];
+ i2 = HEAP32[i8 >> 2] | 0;
+ i3 = HEAP32[i2 + 8 >> 2] | 0;
+ if ((i3 | 0) != 0) {
+ if ((i3 | 0) == 1) {
+ i2 = (HEAP32[i2 >> 2] | 0) != 0;
+ } else {
+ i2 = 1;
+ }
+ } else {
+ i2 = 0;
+ }
+ i13 = i2 & 1;
+ STACKTOP = i1;
+ return i13 | 0;
+}
+function _discharge2reg(i4, i3, i1) {
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, d11 = 0.0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 32 | 0;
+ i9 = i2 + 16 | 0;
+ i8 = i2;
+ _luaK_dischargevars(i4, i3);
+ i10 = HEAP32[i3 >> 2] | 0;
+ L1 : do {
+ switch (i10 | 0) {
+ case 5:
+ {
+ d11 = +HEAPF64[i3 + 8 >> 3];
+ HEAPF64[i9 >> 3] = d11;
+ i5 = HEAP32[(HEAP32[i4 + 12 >> 2] | 0) + 52 >> 2] | 0;
+ HEAPF64[i8 >> 3] = d11;
+ HEAP32[i8 + 8 >> 2] = 3;
+ if (d11 != d11 | 0.0 != 0.0 | d11 == 0.0) {
+ i10 = i5 + 8 | 0;
+ i7 = HEAP32[i10 >> 2] | 0;
+ HEAP32[i10 >> 2] = i7 + 16;
+ i5 = _luaS_newlstr(i5, i9, 8) | 0;
+ HEAP32[i7 >> 2] = i5;
+ HEAP32[i7 + 8 >> 2] = HEAPU8[i5 + 4 | 0] | 0 | 64;
+ i5 = _addk(i4, (HEAP32[i10 >> 2] | 0) + -16 | 0, i8) | 0;
+ HEAP32[i10 >> 2] = (HEAP32[i10 >> 2] | 0) + -16;
+ } else {
+ i5 = _addk(i4, i8, i8) | 0;
+ }
+ i6 = i1 << 6;
+ if ((i5 | 0) < 262144) {
+ _luaK_code(i4, i6 | i5 << 14 | 1) | 0;
+ break L1;
+ } else {
+ _luaK_code(i4, i6 | 2) | 0;
+ _luaK_code(i4, i5 << 6 | 39) | 0;
+ break L1;
+ }
+ }
+ case 2:
+ case 3:
+ {
+ _luaK_code(i4, i1 << 6 | ((i10 | 0) == 2) << 23 | 3) | 0;
+ break;
+ }
+ case 4:
+ {
+ i6 = HEAP32[i3 + 8 >> 2] | 0;
+ i5 = i1 << 6;
+ if ((i6 | 0) < 262144) {
+ _luaK_code(i4, i5 | i6 << 14 | 1) | 0;
+ break L1;
+ } else {
+ _luaK_code(i4, i5 | 2) | 0;
+ _luaK_code(i4, i6 << 6 | 39) | 0;
+ break L1;
+ }
+ }
+ case 1:
+ {
+ i9 = i1 + 1 | 0;
+ i8 = HEAP32[i4 + 20 >> 2] | 0;
+ do {
+ if ((i8 | 0) > (HEAP32[i4 + 24 >> 2] | 0) ? (i5 = (HEAP32[(HEAP32[i4 >> 2] | 0) + 12 >> 2] | 0) + (i8 + -1 << 2) | 0, i6 = HEAP32[i5 >> 2] | 0, (i6 & 63 | 0) == 4) : 0) {
+ i10 = i6 >>> 6 & 255;
+ i8 = i10 + (i6 >>> 23) | 0;
+ if (!((i10 | 0) <= (i1 | 0) ? (i8 + 1 | 0) >= (i1 | 0) : 0)) {
+ i7 = 6;
+ }
+ if ((i7 | 0) == 6 ? (i10 | 0) < (i1 | 0) | (i10 | 0) > (i9 | 0) : 0) {
+ break;
+ }
+ i4 = (i10 | 0) < (i1 | 0) ? i10 : i1;
+ HEAP32[i5 >> 2] = i4 << 6 & 16320 | i6 & 8372287 | ((i8 | 0) > (i1 | 0) ? i8 : i1) - i4 << 23;
+ break L1;
+ }
+ } while (0);
+ _luaK_code(i4, i1 << 6 | 4) | 0;
+ break;
+ }
+ case 6:
+ {
+ i5 = HEAP32[i3 + 8 >> 2] | 0;
+ if ((i5 | 0) != (i1 | 0)) {
+ _luaK_code(i4, i5 << 23 | i1 << 6) | 0;
+ }
+ break;
+ }
+ case 11:
+ {
+ i10 = (HEAP32[(HEAP32[i4 >> 2] | 0) + 12 >> 2] | 0) + (HEAP32[i3 + 8 >> 2] << 2) | 0;
+ HEAP32[i10 >> 2] = HEAP32[i10 >> 2] & -16321 | i1 << 6 & 16320;
+ break;
+ }
+ default:
+ {
+ STACKTOP = i2;
+ return;
+ }
+ }
+ } while (0);
+ HEAP32[i3 + 8 >> 2] = i1;
+ HEAP32[i3 >> 2] = 6;
+ STACKTOP = i2;
+ return;
+}
+function _unroll(i3, i4) {
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i2 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0;
+ i9 = STACKTOP;
+ i11 = i3 + 16 | 0;
+ i13 = HEAP32[i11 >> 2] | 0;
+ i5 = i3 + 72 | 0;
+ if ((i13 | 0) == (i5 | 0)) {
+ STACKTOP = i9;
+ return;
+ }
+ i6 = i3 + 8 | 0;
+ i10 = i3 + 40 | 0;
+ i7 = i3 + 20 | 0;
+ i8 = i3 + 28 | 0;
+ i4 = i3 + 68 | 0;
+ do {
+ i12 = i13 + 18 | 0;
+ i14 = HEAP8[i12] | 0;
+ if ((i14 & 1) == 0) {
+ i14 = i14 & 255;
+ if ((i14 & 16 | 0) != 0) {
+ HEAP8[i12] = i14 & 239;
+ HEAP32[i4 >> 2] = HEAP32[i13 + 32 >> 2];
+ }
+ if ((HEAP16[i13 + 16 >> 1] | 0) == -1 ? (i2 = (HEAP32[i11 >> 2] | 0) + 4 | 0, i1 = HEAP32[i6 >> 2] | 0, (HEAP32[i2 >> 2] | 0) >>> 0 < i1 >>> 0) : 0) {
+ HEAP32[i2 >> 2] = i1;
+ }
+ i14 = HEAP8[i12] | 0;
+ if ((i14 & 32) == 0) {
+ HEAP8[i13 + 37 | 0] = 1;
+ }
+ HEAP8[i12] = i14 & 199 | 8;
+ i14 = FUNCTION_TABLE_ii[HEAP32[i13 + 28 >> 2] & 255](i3) | 0;
+ i14 = (HEAP32[i6 >> 2] | 0) + (0 - i14 << 4) | 0;
+ i13 = HEAP32[i11 >> 2] | 0;
+ i12 = HEAPU8[i10] | 0;
+ if ((i12 & 6 | 0) == 0) {
+ i15 = i13 + 8 | 0;
+ } else {
+ if ((i12 & 2 | 0) != 0) {
+ i14 = i14 - (HEAP32[i8 >> 2] | 0) | 0;
+ _luaD_hook(i3, 1, -1);
+ i14 = (HEAP32[i8 >> 2] | 0) + i14 | 0;
+ }
+ i15 = i13 + 8 | 0;
+ HEAP32[i7 >> 2] = HEAP32[(HEAP32[i15 >> 2] | 0) + 28 >> 2];
+ }
+ i12 = HEAP32[i13 >> 2] | 0;
+ i13 = HEAP16[i13 + 16 >> 1] | 0;
+ HEAP32[i11 >> 2] = HEAP32[i15 >> 2];
+ L25 : do {
+ if (!(i13 << 16 >> 16 == 0)) {
+ i15 = i13 << 16 >> 16;
+ if (i14 >>> 0 < (HEAP32[i6 >> 2] | 0) >>> 0) {
+ i13 = i14;
+ i14 = i15;
+ i15 = i12;
+ while (1) {
+ i12 = i15 + 16 | 0;
+ i18 = i13;
+ i17 = HEAP32[i18 + 4 >> 2] | 0;
+ i16 = i15;
+ HEAP32[i16 >> 2] = HEAP32[i18 >> 2];
+ HEAP32[i16 + 4 >> 2] = i17;
+ HEAP32[i15 + 8 >> 2] = HEAP32[i13 + 8 >> 2];
+ i14 = i14 + -1 | 0;
+ i13 = i13 + 16 | 0;
+ if ((i14 | 0) == 0) {
+ break L25;
+ }
+ if (i13 >>> 0 < (HEAP32[i6 >> 2] | 0) >>> 0) {
+ i15 = i12;
+ } else {
+ i13 = i14;
+ break;
+ }
+ }
+ } else {
+ i13 = i15;
+ }
+ if ((i13 | 0) > 0) {
+ i14 = i13;
+ i15 = i12;
+ while (1) {
+ i14 = i14 + -1 | 0;
+ HEAP32[i15 + 8 >> 2] = 0;
+ if ((i14 | 0) <= 0) {
+ break;
+ } else {
+ i15 = i15 + 16 | 0;
+ }
+ }
+ i12 = i12 + (i13 << 4) | 0;
+ }
+ }
+ } while (0);
+ HEAP32[i6 >> 2] = i12;
+ } else {
+ _luaV_finishOp(i3);
+ _luaV_execute(i3);
+ }
+ i13 = HEAP32[i11 >> 2] | 0;
+ } while ((i13 | 0) != (i5 | 0));
+ STACKTOP = i9;
+ return;
+}
+function _traverseephemeron(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0;
+ i3 = STACKTOP;
+ i11 = i2 + 16 | 0;
+ i9 = HEAP32[i11 >> 2] | 0;
+ i5 = i9 + (1 << (HEAPU8[i2 + 7 | 0] | 0) << 5) | 0;
+ i10 = i2 + 28 | 0;
+ i13 = HEAP32[i10 >> 2] | 0;
+ if ((i13 | 0) > 0) {
+ i9 = i2 + 12 | 0;
+ i12 = 0;
+ i8 = 0;
+ do {
+ i14 = HEAP32[i9 >> 2] | 0;
+ if ((HEAP32[i14 + (i12 << 4) + 8 >> 2] & 64 | 0) != 0 ? (i7 = HEAP32[i14 + (i12 << 4) >> 2] | 0, !((HEAP8[i7 + 5 | 0] & 3) == 0)) : 0) {
+ _reallymarkobject(i1, i7);
+ i13 = HEAP32[i10 >> 2] | 0;
+ i8 = 1;
+ }
+ i12 = i12 + 1 | 0;
+ } while ((i12 | 0) < (i13 | 0));
+ i9 = HEAP32[i11 >> 2] | 0;
+ } else {
+ i8 = 0;
+ }
+ if (i9 >>> 0 < i5 >>> 0) {
+ i7 = 0;
+ i10 = 0;
+ do {
+ i11 = i9 + 8 | 0;
+ i12 = HEAP32[i11 >> 2] | 0;
+ i14 = i9 + 24 | 0;
+ i13 = HEAP32[i14 >> 2] | 0;
+ i15 = (i13 & 64 | 0) == 0;
+ L14 : do {
+ if ((i12 | 0) == 0) {
+ if (!i15 ? !((HEAP8[(HEAP32[i9 + 16 >> 2] | 0) + 5 | 0] & 3) == 0) : 0) {
+ HEAP32[i14 >> 2] = 11;
+ }
+ } else {
+ do {
+ if (i15) {
+ i6 = i12;
+ i4 = 18;
+ } else {
+ i14 = HEAP32[i9 + 16 >> 2] | 0;
+ if ((i13 & 15 | 0) == 4) {
+ if ((i14 | 0) == 0) {
+ i6 = i12;
+ i4 = 18;
+ break;
+ }
+ if ((HEAP8[i14 + 5 | 0] & 3) == 0) {
+ i6 = i12;
+ i4 = 18;
+ break;
+ }
+ _reallymarkobject(i1, i14);
+ i6 = HEAP32[i11 >> 2] | 0;
+ i4 = 18;
+ break;
+ }
+ i11 = (i12 & 64 | 0) == 0;
+ if ((HEAP8[i14 + 5 | 0] & 3) == 0) {
+ if (i11) {
+ break L14;
+ } else {
+ break;
+ }
+ }
+ if (i11) {
+ i7 = 1;
+ break L14;
+ }
+ i7 = 1;
+ i10 = (HEAP8[(HEAP32[i9 >> 2] | 0) + 5 | 0] & 3) == 0 ? i10 : 1;
+ break L14;
+ }
+ } while (0);
+ if ((i4 | 0) == 18 ? (i4 = 0, (i6 & 64 | 0) == 0) : 0) {
+ break;
+ }
+ i11 = HEAP32[i9 >> 2] | 0;
+ if (!((HEAP8[i11 + 5 | 0] & 3) == 0)) {
+ _reallymarkobject(i1, i11);
+ i8 = 1;
+ }
+ }
+ } while (0);
+ i9 = i9 + 32 | 0;
+ } while (i9 >>> 0 < i5 >>> 0);
+ if ((i10 | 0) != 0) {
+ i15 = i1 + 96 | 0;
+ HEAP32[i2 + 24 >> 2] = HEAP32[i15 >> 2];
+ HEAP32[i15 >> 2] = i2;
+ i15 = i8;
+ STACKTOP = i3;
+ return i15 | 0;
+ }
+ if ((i7 | 0) != 0) {
+ i15 = i1 + 100 | 0;
+ HEAP32[i2 + 24 >> 2] = HEAP32[i15 >> 2];
+ HEAP32[i15 >> 2] = i2;
+ i15 = i8;
+ STACKTOP = i3;
+ return i15 | 0;
+ }
+ }
+ i15 = i1 + 88 | 0;
+ HEAP32[i2 + 24 >> 2] = HEAP32[i15 >> 2];
+ HEAP32[i15 >> 2] = i2;
+ i15 = i8;
+ STACKTOP = i3;
+ return i15 | 0;
+}
+function _luaV_gettable(i2, i7, i5, i1) {
+ i2 = i2 | 0;
+ i7 = i7 | 0;
+ i5 = i5 | 0;
+ i1 = i1 | 0;
+ var i3 = 0, i4 = 0, i6 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0;
+ i6 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i6;
+ i8 = i2 + 12 | 0;
+ i3 = i7;
+ i10 = HEAP32[i7 + 8 >> 2] | 0;
+ i9 = 0;
+ while (1) {
+ i7 = i3 + 8 | 0;
+ if ((i10 | 0) != 69) {
+ i12 = _luaT_gettmbyobj(i2, i3, 0) | 0;
+ i10 = HEAP32[i12 + 8 >> 2] | 0;
+ if ((i10 | 0) == 0) {
+ i8 = 11;
+ break;
+ }
+ } else {
+ i12 = HEAP32[i3 >> 2] | 0;
+ i11 = _luaH_get(i12, i5) | 0;
+ i10 = i11 + 8 | 0;
+ if ((HEAP32[i10 >> 2] | 0) != 0) {
+ i8 = 9;
+ break;
+ }
+ i12 = HEAP32[i12 + 8 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ i8 = 9;
+ break;
+ }
+ if (!((HEAP8[i12 + 6 | 0] & 1) == 0)) {
+ i8 = 9;
+ break;
+ }
+ i12 = _luaT_gettm(i12, 0, HEAP32[(HEAP32[i8 >> 2] | 0) + 184 >> 2] | 0) | 0;
+ if ((i12 | 0) == 0) {
+ i8 = 9;
+ break;
+ }
+ i10 = HEAP32[i12 + 8 >> 2] | 0;
+ }
+ i9 = i9 + 1 | 0;
+ if ((i10 & 15 | 0) == 6) {
+ i8 = 13;
+ break;
+ }
+ if ((i9 | 0) < 100) {
+ i3 = i12;
+ } else {
+ i8 = 14;
+ break;
+ }
+ }
+ if ((i8 | 0) == 9) {
+ i9 = i11;
+ i11 = HEAP32[i9 + 4 >> 2] | 0;
+ i12 = i1;
+ HEAP32[i12 >> 2] = HEAP32[i9 >> 2];
+ HEAP32[i12 + 4 >> 2] = i11;
+ HEAP32[i1 + 8 >> 2] = HEAP32[i10 >> 2];
+ STACKTOP = i6;
+ return;
+ } else if ((i8 | 0) == 11) {
+ _luaG_typeerror(i2, i3, 8944);
+ } else if ((i8 | 0) == 13) {
+ i10 = i2 + 28 | 0;
+ i11 = i1 - (HEAP32[i10 >> 2] | 0) | 0;
+ i8 = i2 + 8 | 0;
+ i9 = HEAP32[i8 >> 2] | 0;
+ HEAP32[i8 >> 2] = i9 + 16;
+ i13 = i12;
+ i1 = HEAP32[i13 + 4 >> 2] | 0;
+ i4 = i9;
+ HEAP32[i4 >> 2] = HEAP32[i13 >> 2];
+ HEAP32[i4 + 4 >> 2] = i1;
+ HEAP32[i9 + 8 >> 2] = HEAP32[i12 + 8 >> 2];
+ i12 = HEAP32[i8 >> 2] | 0;
+ HEAP32[i8 >> 2] = i12 + 16;
+ i9 = HEAP32[i3 + 4 >> 2] | 0;
+ i4 = i12;
+ HEAP32[i4 >> 2] = HEAP32[i3 >> 2];
+ HEAP32[i4 + 4 >> 2] = i9;
+ HEAP32[i12 + 8 >> 2] = HEAP32[i7 >> 2];
+ i12 = HEAP32[i8 >> 2] | 0;
+ HEAP32[i8 >> 2] = i12 + 16;
+ i4 = i5;
+ i9 = HEAP32[i4 + 4 >> 2] | 0;
+ i7 = i12;
+ HEAP32[i7 >> 2] = HEAP32[i4 >> 2];
+ HEAP32[i7 + 4 >> 2] = i9;
+ HEAP32[i12 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ _luaD_call(i2, (HEAP32[i8 >> 2] | 0) + -48 | 0, 1, HEAP8[(HEAP32[i2 + 16 >> 2] | 0) + 18 | 0] & 1);
+ i12 = HEAP32[i10 >> 2] | 0;
+ i10 = HEAP32[i8 >> 2] | 0;
+ i7 = i10 + -16 | 0;
+ HEAP32[i8 >> 2] = i7;
+ i8 = HEAP32[i7 + 4 >> 2] | 0;
+ i9 = i12 + i11 | 0;
+ HEAP32[i9 >> 2] = HEAP32[i7 >> 2];
+ HEAP32[i9 + 4 >> 2] = i8;
+ HEAP32[i12 + (i11 + 8) >> 2] = HEAP32[i10 + -8 >> 2];
+ STACKTOP = i6;
+ return;
+ } else if ((i8 | 0) == 14) {
+ _luaG_runerror(i2, 8952, i4);
+ }
+}
+function _db_getinfo(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 112 | 0;
+ i3 = i2;
+ if ((_lua_type(i1, 1) | 0) == 8) {
+ i4 = _lua_tothread(i1, 1) | 0;
+ i7 = 1;
+ } else {
+ i4 = i1;
+ i7 = 0;
+ }
+ i5 = i7 | 2;
+ i6 = _luaL_optlstring(i1, i5, 11784, 0) | 0;
+ i7 = i7 + 1 | 0;
+ do {
+ if ((_lua_isnumber(i1, i7) | 0) != 0) {
+ if ((_lua_getstack(i4, _lua_tointegerx(i1, i7, 0) | 0, i3) | 0) == 0) {
+ _lua_pushnil(i1);
+ i7 = 1;
+ STACKTOP = i2;
+ return i7 | 0;
+ }
+ } else {
+ if ((_lua_type(i1, i7) | 0) == 6) {
+ HEAP32[i3 >> 2] = i6;
+ _lua_pushfstring(i1, 11792, i3) | 0;
+ i6 = _lua_tolstring(i1, -1, 0) | 0;
+ _lua_pushvalue(i1, i7);
+ _lua_xmove(i1, i4, 1);
+ break;
+ }
+ i7 = _luaL_argerror(i1, i7, 11800) | 0;
+ STACKTOP = i2;
+ return i7 | 0;
+ }
+ } while (0);
+ if ((_lua_getinfo(i4, i6, i3) | 0) == 0) {
+ i7 = _luaL_argerror(i1, i5, 11832) | 0;
+ STACKTOP = i2;
+ return i7 | 0;
+ }
+ _lua_createtable(i1, 0, 2);
+ if ((_strchr(i6, 83) | 0) != 0) {
+ _lua_pushstring(i1, HEAP32[i3 + 16 >> 2] | 0) | 0;
+ _lua_setfield(i1, -2, 11848);
+ _lua_pushstring(i1, i3 + 36 | 0) | 0;
+ _lua_setfield(i1, -2, 11856);
+ _lua_pushinteger(i1, HEAP32[i3 + 24 >> 2] | 0);
+ _lua_setfield(i1, -2, 11872);
+ _lua_pushinteger(i1, HEAP32[i3 + 28 >> 2] | 0);
+ _lua_setfield(i1, -2, 11888);
+ _lua_pushstring(i1, HEAP32[i3 + 12 >> 2] | 0) | 0;
+ _lua_setfield(i1, -2, 11904);
+ }
+ if ((_strchr(i6, 108) | 0) != 0) {
+ _lua_pushinteger(i1, HEAP32[i3 + 20 >> 2] | 0);
+ _lua_setfield(i1, -2, 11912);
+ }
+ if ((_strchr(i6, 117) | 0) != 0) {
+ _lua_pushinteger(i1, HEAPU8[i3 + 32 | 0] | 0);
+ _lua_setfield(i1, -2, 11928);
+ _lua_pushinteger(i1, HEAPU8[i3 + 33 | 0] | 0);
+ _lua_setfield(i1, -2, 11936);
+ _lua_pushboolean(i1, HEAP8[i3 + 34 | 0] | 0);
+ _lua_setfield(i1, -2, 11944);
+ }
+ if ((_strchr(i6, 110) | 0) != 0) {
+ _lua_pushstring(i1, HEAP32[i3 + 4 >> 2] | 0) | 0;
+ _lua_setfield(i1, -2, 11960);
+ _lua_pushstring(i1, HEAP32[i3 + 8 >> 2] | 0) | 0;
+ _lua_setfield(i1, -2, 11968);
+ }
+ if ((_strchr(i6, 116) | 0) != 0) {
+ _lua_pushboolean(i1, HEAP8[i3 + 35 | 0] | 0);
+ _lua_setfield(i1, -2, 11984);
+ }
+ if ((_strchr(i6, 76) | 0) != 0) {
+ if ((i4 | 0) == (i1 | 0)) {
+ _lua_pushvalue(i1, -2);
+ _lua_remove(i1, -3);
+ } else {
+ _lua_xmove(i4, i1, 1);
+ }
+ _lua_setfield(i1, -2, 12e3);
+ }
+ if ((_strchr(i6, 102) | 0) == 0) {
+ i7 = 1;
+ STACKTOP = i2;
+ return i7 | 0;
+ }
+ if ((i4 | 0) == (i1 | 0)) {
+ _lua_pushvalue(i1, -2);
+ _lua_remove(i1, -3);
+ } else {
+ _lua_xmove(i4, i1, 1);
+ }
+ _lua_setfield(i1, -2, 12016);
+ i7 = 1;
+ STACKTOP = i2;
+ return i7 | 0;
+}
+function _luaL_traceback(i4, i1, i9, i7) {
+ i4 = i4 | 0;
+ i1 = i1 | 0;
+ i9 = i9 | 0;
+ i7 = i7 | 0;
+ var i2 = 0, i3 = 0, i5 = 0, i6 = 0, i8 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 208 | 0;
+ i6 = i3;
+ i5 = i3 + 100 | 0;
+ i2 = _lua_gettop(i4) | 0;
+ i8 = 1;
+ i10 = 1;
+ while (1) {
+ if ((_lua_getstack(i1, i8, i6) | 0) == 0) {
+ break;
+ } else {
+ i10 = i8;
+ i8 = i8 << 1;
+ }
+ }
+ if ((i10 | 0) < (i8 | 0)) {
+ while (1) {
+ i11 = (i8 + i10 | 0) / 2 | 0;
+ i12 = (_lua_getstack(i1, i11, i6) | 0) == 0;
+ i8 = i12 ? i11 : i8;
+ i10 = i12 ? i10 : i11 + 1 | 0;
+ if ((i10 | 0) >= (i8 | 0)) {
+ i10 = i8;
+ break;
+ }
+ }
+ } else {
+ i10 = i8;
+ }
+ i8 = (i10 + -1 | 0) > 22 ? 12 : 0;
+ if ((i9 | 0) != 0) {
+ HEAP32[i6 >> 2] = i9;
+ _lua_pushfstring(i4, 944, i6) | 0;
+ }
+ _lua_pushlstring(i4, 952, 16) | 0;
+ if ((_lua_getstack(i1, i7, i5) | 0) == 0) {
+ i17 = _lua_gettop(i4) | 0;
+ i17 = i17 - i2 | 0;
+ _lua_concat(i4, i17);
+ STACKTOP = i3;
+ return;
+ }
+ i10 = i10 + -11 | 0;
+ i13 = i5 + 36 | 0;
+ i9 = i5 + 20 | 0;
+ i16 = i5 + 8 | 0;
+ i12 = i5 + 12 | 0;
+ i15 = i5 + 24 | 0;
+ i14 = i5 + 35 | 0;
+ i11 = i5 + 4 | 0;
+ do {
+ i7 = i7 + 1 | 0;
+ if ((i7 | 0) == (i8 | 0)) {
+ _lua_pushlstring(i4, 976, 5) | 0;
+ i7 = i10;
+ } else {
+ _lua_getinfo(i1, 984, i5) | 0;
+ HEAP32[i6 >> 2] = i13;
+ _lua_pushfstring(i4, 992, i6) | 0;
+ i17 = HEAP32[i9 >> 2] | 0;
+ if ((i17 | 0) > 0) {
+ HEAP32[i6 >> 2] = i17;
+ _lua_pushfstring(i4, 1e3, i6) | 0;
+ }
+ _lua_pushlstring(i4, 1008, 4) | 0;
+ do {
+ if ((HEAP8[HEAP32[i16 >> 2] | 0] | 0) == 0) {
+ i17 = HEAP8[HEAP32[i12 >> 2] | 0] | 0;
+ if (i17 << 24 >> 24 == 109) {
+ _lua_pushlstring(i4, 1800, 10) | 0;
+ break;
+ } else if (i17 << 24 >> 24 == 67) {
+ if ((_pushglobalfuncname(i4, i5) | 0) == 0) {
+ _lua_pushlstring(i4, 1112, 1) | 0;
+ break;
+ } else {
+ HEAP32[i6 >> 2] = _lua_tolstring(i4, -1, 0) | 0;
+ _lua_pushfstring(i4, 1784, i6) | 0;
+ _lua_remove(i4, -2);
+ break;
+ }
+ } else {
+ i17 = HEAP32[i15 >> 2] | 0;
+ HEAP32[i6 >> 2] = i13;
+ HEAP32[i6 + 4 >> 2] = i17;
+ _lua_pushfstring(i4, 1816, i6) | 0;
+ break;
+ }
+ } else {
+ HEAP32[i6 >> 2] = HEAP32[i11 >> 2];
+ _lua_pushfstring(i4, 1784, i6) | 0;
+ }
+ } while (0);
+ if ((HEAP8[i14] | 0) != 0) {
+ _lua_pushlstring(i4, 1016, 20) | 0;
+ }
+ _lua_concat(i4, (_lua_gettop(i4) | 0) - i2 | 0);
+ }
+ } while ((_lua_getstack(i1, i7, i5) | 0) != 0);
+ i17 = _lua_gettop(i4) | 0;
+ i17 = i17 - i2 | 0;
+ _lua_concat(i4, i17);
+ STACKTOP = i3;
+ return;
+}
+function _luaK_exp2RK(i3, i1) {
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, d11 = 0.0, i12 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 32 | 0;
+ i7 = i2 + 16 | 0;
+ i6 = i2;
+ i4 = i1 + 16 | 0;
+ i5 = i1 + 20 | 0;
+ i10 = (HEAP32[i4 >> 2] | 0) == (HEAP32[i5 >> 2] | 0);
+ _luaK_dischargevars(i3, i1);
+ do {
+ if (!i10) {
+ if ((HEAP32[i1 >> 2] | 0) == 6) {
+ i10 = HEAP32[i1 + 8 >> 2] | 0;
+ if ((HEAP32[i4 >> 2] | 0) == (HEAP32[i5 >> 2] | 0)) {
+ break;
+ }
+ if ((i10 | 0) >= (HEAPU8[i3 + 46 | 0] | 0 | 0)) {
+ _exp2reg(i3, i1, i10);
+ break;
+ }
+ }
+ _luaK_exp2nextreg(i3, i1);
+ }
+ } while (0);
+ i10 = HEAP32[i1 >> 2] | 0;
+ switch (i10 | 0) {
+ case 4:
+ {
+ i8 = HEAP32[i1 + 8 >> 2] | 0;
+ i9 = 18;
+ break;
+ }
+ case 1:
+ case 3:
+ case 2:
+ {
+ if ((HEAP32[i3 + 32 >> 2] | 0) < 256) {
+ if ((i10 | 0) == 1) {
+ HEAP32[i6 + 8 >> 2] = 0;
+ HEAP32[i7 >> 2] = HEAP32[i3 + 4 >> 2];
+ HEAP32[i7 + 8 >> 2] = 69;
+ i3 = _addk(i3, i7, i6) | 0;
+ } else {
+ HEAP32[i7 >> 2] = (i10 | 0) == 2;
+ HEAP32[i7 + 8 >> 2] = 1;
+ i3 = _addk(i3, i7, i7) | 0;
+ }
+ HEAP32[i1 + 8 >> 2] = i3;
+ HEAP32[i1 >> 2] = 4;
+ i10 = i3 | 256;
+ STACKTOP = i2;
+ return i10 | 0;
+ }
+ break;
+ }
+ case 5:
+ {
+ i9 = i1 + 8 | 0;
+ d11 = +HEAPF64[i9 >> 3];
+ HEAPF64[i7 >> 3] = d11;
+ i8 = HEAP32[(HEAP32[i3 + 12 >> 2] | 0) + 52 >> 2] | 0;
+ HEAPF64[i6 >> 3] = d11;
+ HEAP32[i6 + 8 >> 2] = 3;
+ if (d11 != d11 | 0.0 != 0.0 | d11 == 0.0) {
+ i10 = i8 + 8 | 0;
+ i12 = HEAP32[i10 >> 2] | 0;
+ HEAP32[i10 >> 2] = i12 + 16;
+ i8 = _luaS_newlstr(i8, i7, 8) | 0;
+ HEAP32[i12 >> 2] = i8;
+ HEAP32[i12 + 8 >> 2] = HEAPU8[i8 + 4 | 0] | 0 | 64;
+ i8 = _addk(i3, (HEAP32[i10 >> 2] | 0) + -16 | 0, i6) | 0;
+ HEAP32[i10 >> 2] = (HEAP32[i10 >> 2] | 0) + -16;
+ } else {
+ i8 = _addk(i3, i6, i6) | 0;
+ }
+ HEAP32[i9 >> 2] = i8;
+ HEAP32[i1 >> 2] = 4;
+ i9 = 18;
+ break;
+ }
+ default:
+ {}
+ }
+ if ((i9 | 0) == 18 ? (i8 | 0) < 256 : 0) {
+ i12 = i8 | 256;
+ STACKTOP = i2;
+ return i12 | 0;
+ }
+ _luaK_dischargevars(i3, i1);
+ if ((HEAP32[i1 >> 2] | 0) == 6) {
+ i7 = i1 + 8 | 0;
+ i6 = HEAP32[i7 >> 2] | 0;
+ if ((HEAP32[i4 >> 2] | 0) == (HEAP32[i5 >> 2] | 0)) {
+ i12 = i6;
+ STACKTOP = i2;
+ return i12 | 0;
+ }
+ if ((i6 | 0) >= (HEAPU8[i3 + 46 | 0] | 0 | 0)) {
+ _exp2reg(i3, i1, i6);
+ i12 = HEAP32[i7 >> 2] | 0;
+ STACKTOP = i2;
+ return i12 | 0;
+ }
+ } else {
+ i7 = i1 + 8 | 0;
+ }
+ _luaK_exp2nextreg(i3, i1);
+ i12 = HEAP32[i7 >> 2] | 0;
+ STACKTOP = i2;
+ return i12 | 0;
+}
+function _os_date(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 1264 | 0;
+ i4 = i2;
+ i7 = i2 + 1048 | 0;
+ i6 = i2 + 1256 | 0;
+ i3 = i2 + 8 | 0;
+ i5 = i2 + 1056 | 0;
+ i12 = _luaL_optlstring(i1, 1, 6064, 0) | 0;
+ if ((_lua_type(i1, 2) | 0) < 1) {
+ i8 = _time(0) | 0;
+ } else {
+ i8 = ~~+_luaL_checknumber(i1, 2);
+ }
+ HEAP32[i7 >> 2] = i8;
+ if ((HEAP8[i12] | 0) == 33) {
+ i12 = i12 + 1 | 0;
+ i10 = _gmtime(i7 | 0) | 0;
+ } else {
+ i10 = _localtime(i7 | 0) | 0;
+ }
+ if ((i10 | 0) == 0) {
+ _lua_pushnil(i1);
+ STACKTOP = i2;
+ return 1;
+ }
+ if ((_strcmp(i12, 6072) | 0) == 0) {
+ _lua_createtable(i1, 0, 9);
+ _lua_pushinteger(i1, HEAP32[i10 >> 2] | 0);
+ _lua_setfield(i1, -2, 5864);
+ _lua_pushinteger(i1, HEAP32[i10 + 4 >> 2] | 0);
+ _lua_setfield(i1, -2, 5872);
+ _lua_pushinteger(i1, HEAP32[i10 + 8 >> 2] | 0);
+ _lua_setfield(i1, -2, 5880);
+ _lua_pushinteger(i1, HEAP32[i10 + 12 >> 2] | 0);
+ _lua_setfield(i1, -2, 5888);
+ _lua_pushinteger(i1, (HEAP32[i10 + 16 >> 2] | 0) + 1 | 0);
+ _lua_setfield(i1, -2, 5896);
+ _lua_pushinteger(i1, (HEAP32[i10 + 20 >> 2] | 0) + 1900 | 0);
+ _lua_setfield(i1, -2, 5904);
+ _lua_pushinteger(i1, (HEAP32[i10 + 24 >> 2] | 0) + 1 | 0);
+ _lua_setfield(i1, -2, 6080);
+ _lua_pushinteger(i1, (HEAP32[i10 + 28 >> 2] | 0) + 1 | 0);
+ _lua_setfield(i1, -2, 6088);
+ i3 = HEAP32[i10 + 32 >> 2] | 0;
+ if ((i3 | 0) < 0) {
+ STACKTOP = i2;
+ return 1;
+ }
+ _lua_pushboolean(i1, i3);
+ _lua_setfield(i1, -2, 5912);
+ STACKTOP = i2;
+ return 1;
+ }
+ HEAP8[i6] = 37;
+ _luaL_buffinit(i1, i3);
+ i11 = i3 + 8 | 0;
+ i9 = i3 + 4 | 0;
+ i8 = i6 + 1 | 0;
+ i7 = i6 + 2 | 0;
+ while (1) {
+ i14 = HEAP8[i12] | 0;
+ if (i14 << 24 >> 24 == 0) {
+ break;
+ } else if (!(i14 << 24 >> 24 == 37)) {
+ i13 = HEAP32[i11 >> 2] | 0;
+ if (!(i13 >>> 0 < (HEAP32[i9 >> 2] | 0) >>> 0)) {
+ _luaL_prepbuffsize(i3, 1) | 0;
+ i13 = HEAP32[i11 >> 2] | 0;
+ i14 = HEAP8[i12] | 0;
+ }
+ HEAP32[i11 >> 2] = i13 + 1;
+ HEAP8[(HEAP32[i3 >> 2] | 0) + i13 | 0] = i14;
+ i12 = i12 + 1 | 0;
+ continue;
+ }
+ i13 = i12 + 1 | 0;
+ i12 = i12 + 2 | 0;
+ i14 = HEAP8[i13] | 0;
+ if (!(i14 << 24 >> 24 == 0) ? (_memchr(6096, i14 << 24 >> 24, 23) | 0) != 0 : 0) {
+ HEAP8[i8] = i14;
+ HEAP8[i7] = 0;
+ } else {
+ HEAP32[i4 >> 2] = i13;
+ _luaL_argerror(i1, 1, _lua_pushfstring(i1, 6120, i4) | 0) | 0;
+ i12 = i13;
+ }
+ _luaL_addlstring(i3, i5, _strftime(i5 | 0, 200, i6 | 0, i10 | 0) | 0);
+ }
+ _luaL_pushresult(i3);
+ STACKTOP = i2;
+ return 1;
+}
+function _luaV_finishOp(i3) {
+ i3 = i3 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0;
+ i1 = STACKTOP;
+ i8 = HEAP32[i3 + 16 >> 2] | 0;
+ i7 = i8 + 24 | 0;
+ i4 = HEAP32[i7 >> 2] | 0;
+ i5 = i8 + 28 | 0;
+ i2 = HEAP32[(HEAP32[i5 >> 2] | 0) + -4 >> 2] | 0;
+ i6 = i2 & 63;
+ switch (i6 | 0) {
+ case 34:
+ {
+ HEAP32[i3 + 8 >> 2] = HEAP32[i8 + 4 >> 2];
+ STACKTOP = i1;
+ return;
+ }
+ case 24:
+ case 25:
+ case 26:
+ {
+ i7 = i3 + 8 | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ i9 = HEAP32[i8 + -8 >> 2] | 0;
+ if ((i9 | 0) != 0) {
+ if ((i9 | 0) == 1) {
+ i9 = (HEAP32[i8 + -16 >> 2] | 0) == 0;
+ } else {
+ i9 = 0;
+ }
+ } else {
+ i9 = 1;
+ }
+ i9 = i9 & 1;
+ i10 = i9 ^ 1;
+ HEAP32[i7 >> 2] = i8 + -16;
+ if ((i6 | 0) == 26) {
+ i8 = (HEAP32[(_luaT_gettmbyobj(i3, i4 + (i2 >>> 23 << 4) | 0, 14) | 0) + 8 >> 2] | 0) == 0;
+ i10 = i8 ? i9 : i10;
+ }
+ if ((i10 | 0) == (i2 >>> 6 & 255 | 0)) {
+ STACKTOP = i1;
+ return;
+ }
+ HEAP32[i5 >> 2] = (HEAP32[i5 >> 2] | 0) + 4;
+ STACKTOP = i1;
+ return;
+ }
+ case 22:
+ {
+ i5 = i3 + 8 | 0;
+ i10 = HEAP32[i5 >> 2] | 0;
+ i6 = i10 + -32 | 0;
+ i4 = i6 - (i4 + (i2 >>> 23 << 4)) | 0;
+ i12 = i10 + -16 | 0;
+ i11 = HEAP32[i12 + 4 >> 2] | 0;
+ i9 = i10 + -48 | 0;
+ HEAP32[i9 >> 2] = HEAP32[i12 >> 2];
+ HEAP32[i9 + 4 >> 2] = i11;
+ HEAP32[i10 + -40 >> 2] = HEAP32[i10 + -8 >> 2];
+ if ((i4 | 0) > 16) {
+ HEAP32[i5 >> 2] = i6;
+ _luaV_concat(i3, i4 >> 4);
+ }
+ i10 = HEAP32[i5 >> 2] | 0;
+ i11 = HEAP32[i7 >> 2] | 0;
+ i12 = i2 >>> 6 & 255;
+ i6 = i10 + -16 | 0;
+ i7 = HEAP32[i6 + 4 >> 2] | 0;
+ i9 = i11 + (i12 << 4) | 0;
+ HEAP32[i9 >> 2] = HEAP32[i6 >> 2];
+ HEAP32[i9 + 4 >> 2] = i7;
+ HEAP32[i11 + (i12 << 4) + 8 >> 2] = HEAP32[i10 + -8 >> 2];
+ HEAP32[i5 >> 2] = HEAP32[i8 + 4 >> 2];
+ STACKTOP = i1;
+ return;
+ }
+ case 12:
+ case 7:
+ case 6:
+ case 21:
+ case 19:
+ case 18:
+ case 17:
+ case 16:
+ case 15:
+ case 14:
+ case 13:
+ {
+ i12 = i3 + 8 | 0;
+ i11 = HEAP32[i12 >> 2] | 0;
+ i8 = i11 + -16 | 0;
+ HEAP32[i12 >> 2] = i8;
+ i12 = i2 >>> 6 & 255;
+ i9 = HEAP32[i8 + 4 >> 2] | 0;
+ i10 = i4 + (i12 << 4) | 0;
+ HEAP32[i10 >> 2] = HEAP32[i8 >> 2];
+ HEAP32[i10 + 4 >> 2] = i9;
+ HEAP32[i4 + (i12 << 4) + 8 >> 2] = HEAP32[i11 + -8 >> 2];
+ STACKTOP = i1;
+ return;
+ }
+ case 29:
+ {
+ if ((i2 & 8372224 | 0) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ HEAP32[i3 + 8 >> 2] = HEAP32[i8 + 4 >> 2];
+ STACKTOP = i1;
+ return;
+ }
+ default:
+ {
+ STACKTOP = i1;
+ return;
+ }
+ }
+}
+function _auxsort(i2, i4, i5) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i3 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i1;
+ if ((i4 | 0) >= (i5 | 0)) {
+ STACKTOP = i1;
+ return;
+ }
+ while (1) {
+ _lua_rawgeti(i2, 1, i4);
+ _lua_rawgeti(i2, 1, i5);
+ if ((_sort_comp(i2, -1, -2) | 0) == 0) {
+ _lua_settop(i2, -3);
+ } else {
+ _lua_rawseti(i2, 1, i4);
+ _lua_rawseti(i2, 1, i5);
+ }
+ i6 = i5 - i4 | 0;
+ if ((i6 | 0) == 1) {
+ i2 = 24;
+ break;
+ }
+ i7 = (i5 + i4 | 0) / 2 | 0;
+ _lua_rawgeti(i2, 1, i7);
+ _lua_rawgeti(i2, 1, i4);
+ do {
+ if ((_sort_comp(i2, -2, -1) | 0) == 0) {
+ _lua_settop(i2, -2);
+ _lua_rawgeti(i2, 1, i5);
+ if ((_sort_comp(i2, -1, -2) | 0) == 0) {
+ _lua_settop(i2, -3);
+ break;
+ } else {
+ _lua_rawseti(i2, 1, i7);
+ _lua_rawseti(i2, 1, i5);
+ break;
+ }
+ } else {
+ _lua_rawseti(i2, 1, i7);
+ _lua_rawseti(i2, 1, i4);
+ }
+ } while (0);
+ if ((i6 | 0) == 2) {
+ i2 = 24;
+ break;
+ }
+ _lua_rawgeti(i2, 1, i7);
+ _lua_pushvalue(i2, -1);
+ i6 = i5 + -1 | 0;
+ _lua_rawgeti(i2, 1, i6);
+ _lua_rawseti(i2, 1, i7);
+ _lua_rawseti(i2, 1, i6);
+ i7 = i4;
+ i9 = i6;
+ while (1) {
+ i8 = i7 + 1 | 0;
+ _lua_rawgeti(i2, 1, i8);
+ if ((_sort_comp(i2, -1, -2) | 0) != 0) {
+ i7 = i8;
+ while (1) {
+ if ((i7 | 0) >= (i5 | 0)) {
+ _luaL_error(i2, 8216, i3) | 0;
+ }
+ _lua_settop(i2, -2);
+ i8 = i7 + 1 | 0;
+ _lua_rawgeti(i2, 1, i8);
+ if ((_sort_comp(i2, -1, -2) | 0) == 0) {
+ break;
+ } else {
+ i7 = i8;
+ }
+ }
+ }
+ i10 = i9 + -1 | 0;
+ _lua_rawgeti(i2, 1, i10);
+ if ((_sort_comp(i2, -3, -1) | 0) != 0) {
+ i9 = i10;
+ while (1) {
+ if ((i9 | 0) <= (i4 | 0)) {
+ _luaL_error(i2, 8216, i3) | 0;
+ }
+ _lua_settop(i2, -2);
+ i10 = i9 + -1 | 0;
+ _lua_rawgeti(i2, 1, i10);
+ if ((_sort_comp(i2, -3, -1) | 0) == 0) {
+ break;
+ } else {
+ i9 = i10;
+ }
+ }
+ }
+ if ((i9 | 0) <= (i8 | 0)) {
+ break;
+ }
+ _lua_rawseti(i2, 1, i8);
+ _lua_rawseti(i2, 1, i10);
+ i7 = i8;
+ i9 = i10;
+ }
+ _lua_settop(i2, -4);
+ _lua_rawgeti(i2, 1, i6);
+ _lua_rawgeti(i2, 1, i8);
+ _lua_rawseti(i2, 1, i6);
+ _lua_rawseti(i2, 1, i8);
+ i8 = (i8 - i4 | 0) < (i5 - i8 | 0);
+ i9 = i7 + 2 | 0;
+ i10 = i8 ? i9 : i4;
+ i6 = i8 ? i5 : i7;
+ _auxsort(i2, i8 ? i4 : i9, i8 ? i7 : i5);
+ if ((i10 | 0) < (i6 | 0)) {
+ i4 = i10;
+ i5 = i6;
+ } else {
+ i2 = 24;
+ break;
+ }
+ }
+ if ((i2 | 0) == 24) {
+ STACKTOP = i1;
+ return;
+ }
+}
+function _skip_sep(i3) {
+ i3 = i3 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0;
+ i1 = STACKTOP;
+ i2 = HEAP32[i3 >> 2] | 0;
+ i4 = i3 + 60 | 0;
+ i10 = HEAP32[i4 >> 2] | 0;
+ i8 = i10 + 4 | 0;
+ i11 = HEAP32[i8 >> 2] | 0;
+ i7 = i10 + 8 | 0;
+ i5 = HEAP32[i7 >> 2] | 0;
+ do {
+ if ((i11 + 1 | 0) >>> 0 > i5 >>> 0) {
+ if (i5 >>> 0 > 2147483645) {
+ _lexerror(i3, 12368, 0);
+ }
+ i12 = i5 << 1;
+ i11 = HEAP32[i3 + 52 >> 2] | 0;
+ if ((i12 | 0) == -2) {
+ _luaM_toobig(i11);
+ } else {
+ i9 = _luaM_realloc_(i11, HEAP32[i10 >> 2] | 0, i5, i12) | 0;
+ HEAP32[i10 >> 2] = i9;
+ HEAP32[i7 >> 2] = i12;
+ i6 = HEAP32[i8 >> 2] | 0;
+ break;
+ }
+ } else {
+ i6 = i11;
+ i9 = HEAP32[i10 >> 2] | 0;
+ }
+ } while (0);
+ HEAP32[i8 >> 2] = i6 + 1;
+ HEAP8[i9 + i6 | 0] = i2;
+ i5 = i3 + 56 | 0;
+ i6 = HEAP32[i5 >> 2] | 0;
+ i13 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i6 >> 2] = i13 + -1;
+ if ((i13 | 0) == 0) {
+ i6 = _luaZ_fill(i6) | 0;
+ } else {
+ i13 = i6 + 4 | 0;
+ i6 = HEAP32[i13 >> 2] | 0;
+ HEAP32[i13 >> 2] = i6 + 1;
+ i6 = HEAPU8[i6] | 0;
+ }
+ HEAP32[i3 >> 2] = i6;
+ if ((i6 | 0) != 61) {
+ i12 = i6;
+ i13 = 0;
+ i12 = (i12 | 0) != (i2 | 0);
+ i12 = i12 << 31 >> 31;
+ i13 = i12 ^ i13;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ i6 = i3 + 52 | 0;
+ i7 = 0;
+ while (1) {
+ i9 = HEAP32[i4 >> 2] | 0;
+ i8 = i9 + 4 | 0;
+ i10 = HEAP32[i8 >> 2] | 0;
+ i11 = i9 + 8 | 0;
+ i12 = HEAP32[i11 >> 2] | 0;
+ if ((i10 + 1 | 0) >>> 0 > i12 >>> 0) {
+ if (i12 >>> 0 > 2147483645) {
+ i4 = 16;
+ break;
+ }
+ i13 = i12 << 1;
+ i10 = HEAP32[i6 >> 2] | 0;
+ if ((i13 | 0) == -2) {
+ i4 = 18;
+ break;
+ }
+ i12 = _luaM_realloc_(i10, HEAP32[i9 >> 2] | 0, i12, i13) | 0;
+ HEAP32[i9 >> 2] = i12;
+ HEAP32[i11 >> 2] = i13;
+ i10 = HEAP32[i8 >> 2] | 0;
+ i9 = i12;
+ } else {
+ i9 = HEAP32[i9 >> 2] | 0;
+ }
+ HEAP32[i8 >> 2] = i10 + 1;
+ HEAP8[i9 + i10 | 0] = 61;
+ i8 = HEAP32[i5 >> 2] | 0;
+ i13 = HEAP32[i8 >> 2] | 0;
+ HEAP32[i8 >> 2] = i13 + -1;
+ if ((i13 | 0) == 0) {
+ i8 = _luaZ_fill(i8) | 0;
+ } else {
+ i13 = i8 + 4 | 0;
+ i8 = HEAP32[i13 >> 2] | 0;
+ HEAP32[i13 >> 2] = i8 + 1;
+ i8 = HEAPU8[i8] | 0;
+ }
+ HEAP32[i3 >> 2] = i8;
+ i7 = i7 + 1 | 0;
+ if ((i8 | 0) != 61) {
+ i4 = 24;
+ break;
+ }
+ }
+ if ((i4 | 0) == 16) {
+ _lexerror(i3, 12368, 0);
+ } else if ((i4 | 0) == 18) {
+ _luaM_toobig(i10);
+ } else if ((i4 | 0) == 24) {
+ i13 = (i8 | 0) != (i2 | 0);
+ i13 = i13 << 31 >> 31;
+ i13 = i13 ^ i7;
+ STACKTOP = i1;
+ return i13 | 0;
+ }
+ return 0;
+}
+function _luaV_arith(i8, i2, i3, i5, i4) {
+ i8 = i8 | 0;
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i6 = 0, i7 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, d14 = 0.0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 32 | 0;
+ i9 = i1 + 24 | 0;
+ i13 = i1 + 16 | 0;
+ i12 = i1;
+ i6 = i3 + 8 | 0;
+ i11 = HEAP32[i6 >> 2] | 0;
+ if ((i11 | 0) != 3) {
+ if ((i11 & 15 | 0) == 4 ? (i11 = HEAP32[i3 >> 2] | 0, (_luaO_str2d(i11 + 16 | 0, HEAP32[i11 + 12 >> 2] | 0, i13) | 0) != 0) : 0) {
+ HEAPF64[i12 >> 3] = +HEAPF64[i13 >> 3];
+ HEAP32[i12 + 8 >> 2] = 3;
+ i10 = 5;
+ }
+ } else {
+ i12 = i3;
+ i10 = 5;
+ }
+ do {
+ if ((i10 | 0) == 5) {
+ i10 = HEAP32[i5 + 8 >> 2] | 0;
+ if ((i10 | 0) == 3) {
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ d14 = +HEAPF64[i5 >> 3];
+ } else {
+ if ((i10 & 15 | 0) != 4) {
+ break;
+ }
+ i13 = HEAP32[i5 >> 2] | 0;
+ if ((_luaO_str2d(i13 + 16 | 0, HEAP32[i13 + 12 >> 2] | 0, i9) | 0) == 0) {
+ break;
+ }
+ d14 = +HEAPF64[i9 >> 3];
+ }
+ HEAPF64[i2 >> 3] = +_luaO_arith(i4 + -6 | 0, +HEAPF64[i12 >> 3], d14);
+ HEAP32[i2 + 8 >> 2] = 3;
+ STACKTOP = i1;
+ return;
+ }
+ } while (0);
+ i9 = _luaT_gettmbyobj(i8, i3, i4) | 0;
+ if ((HEAP32[i9 + 8 >> 2] | 0) == 0) {
+ i4 = _luaT_gettmbyobj(i8, i5, i4) | 0;
+ if ((HEAP32[i4 + 8 >> 2] | 0) == 0) {
+ _luaG_aritherror(i8, i3, i5);
+ } else {
+ i7 = i4;
+ }
+ } else {
+ i7 = i9;
+ }
+ i12 = i8 + 28 | 0;
+ i13 = i2 - (HEAP32[i12 >> 2] | 0) | 0;
+ i9 = i8 + 8 | 0;
+ i11 = HEAP32[i9 >> 2] | 0;
+ HEAP32[i9 >> 2] = i11 + 16;
+ i2 = i7;
+ i10 = HEAP32[i2 + 4 >> 2] | 0;
+ i4 = i11;
+ HEAP32[i4 >> 2] = HEAP32[i2 >> 2];
+ HEAP32[i4 + 4 >> 2] = i10;
+ HEAP32[i11 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ i11 = HEAP32[i9 >> 2] | 0;
+ HEAP32[i9 >> 2] = i11 + 16;
+ i4 = i3;
+ i10 = HEAP32[i4 + 4 >> 2] | 0;
+ i7 = i11;
+ HEAP32[i7 >> 2] = HEAP32[i4 >> 2];
+ HEAP32[i7 + 4 >> 2] = i10;
+ HEAP32[i11 + 8 >> 2] = HEAP32[i6 >> 2];
+ i11 = HEAP32[i9 >> 2] | 0;
+ HEAP32[i9 >> 2] = i11 + 16;
+ i6 = i5;
+ i7 = HEAP32[i6 + 4 >> 2] | 0;
+ i10 = i11;
+ HEAP32[i10 >> 2] = HEAP32[i6 >> 2];
+ HEAP32[i10 + 4 >> 2] = i7;
+ HEAP32[i11 + 8 >> 2] = HEAP32[i5 + 8 >> 2];
+ _luaD_call(i8, (HEAP32[i9 >> 2] | 0) + -48 | 0, 1, HEAP8[(HEAP32[i8 + 16 >> 2] | 0) + 18 | 0] & 1);
+ i12 = HEAP32[i12 >> 2] | 0;
+ i11 = HEAP32[i9 >> 2] | 0;
+ i8 = i11 + -16 | 0;
+ HEAP32[i9 >> 2] = i8;
+ i9 = HEAP32[i8 + 4 >> 2] | 0;
+ i10 = i12 + i13 | 0;
+ HEAP32[i10 >> 2] = HEAP32[i8 >> 2];
+ HEAP32[i10 + 4 >> 2] = i9;
+ HEAP32[i12 + (i13 + 8) >> 2] = HEAP32[i11 + -8 >> 2];
+ STACKTOP = i1;
+ return;
+}
+function _new_localvar(i1, i8) {
+ i1 = i1 | 0;
+ i8 = i8 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i3;
+ i5 = HEAP32[i1 + 48 >> 2] | 0;
+ i2 = HEAP32[i1 + 64 >> 2] | 0;
+ i7 = HEAP32[i5 >> 2] | 0;
+ i10 = i7 + 60 | 0;
+ i11 = HEAP32[i10 >> 2] | 0;
+ i6 = i5 + 44 | 0;
+ if ((HEAP16[i6 >> 1] | 0) < (i11 | 0)) {
+ i9 = i7 + 24 | 0;
+ i10 = i11;
+ } else {
+ i9 = i7 + 24 | 0;
+ HEAP32[i9 >> 2] = _luaM_growaux_(HEAP32[i1 + 52 >> 2] | 0, HEAP32[i9 >> 2] | 0, i10, 12, 32767, 6496) | 0;
+ i10 = HEAP32[i10 >> 2] | 0;
+ }
+ if ((i11 | 0) < (i10 | 0)) {
+ i12 = i11;
+ while (1) {
+ i11 = i12 + 1 | 0;
+ HEAP32[(HEAP32[i9 >> 2] | 0) + (i12 * 12 | 0) >> 2] = 0;
+ if ((i11 | 0) == (i10 | 0)) {
+ break;
+ } else {
+ i12 = i11;
+ }
+ }
+ }
+ i10 = HEAP16[i6 >> 1] | 0;
+ HEAP32[(HEAP32[i9 >> 2] | 0) + ((i10 << 16 >> 16) * 12 | 0) >> 2] = i8;
+ if (!((HEAP8[i8 + 5 | 0] & 3) == 0) ? !((HEAP8[i7 + 5 | 0] & 4) == 0) : 0) {
+ _luaC_barrier_(HEAP32[i1 + 52 >> 2] | 0, i7, i8);
+ i7 = HEAP16[i6 >> 1] | 0;
+ } else {
+ i7 = i10;
+ }
+ HEAP16[i6 >> 1] = i7 + 1 << 16 >> 16;
+ i6 = i2 + 4 | 0;
+ i8 = HEAP32[i6 >> 2] | 0;
+ if ((i8 + 1 - (HEAP32[i5 + 40 >> 2] | 0) | 0) > 200) {
+ i10 = i5 + 12 | 0;
+ i9 = HEAP32[(HEAP32[i10 >> 2] | 0) + 52 >> 2] | 0;
+ i5 = HEAP32[(HEAP32[i5 >> 2] | 0) + 64 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ i11 = 6552;
+ HEAP32[i4 >> 2] = 6496;
+ i12 = i4 + 4 | 0;
+ HEAP32[i12 >> 2] = 200;
+ i12 = i4 + 8 | 0;
+ HEAP32[i12 >> 2] = i11;
+ i12 = _luaO_pushfstring(i9, 6592, i4) | 0;
+ i11 = HEAP32[i10 >> 2] | 0;
+ _luaX_syntaxerror(i11, i12);
+ }
+ HEAP32[i4 >> 2] = i5;
+ i11 = _luaO_pushfstring(i9, 6568, i4) | 0;
+ HEAP32[i4 >> 2] = 6496;
+ i12 = i4 + 4 | 0;
+ HEAP32[i12 >> 2] = 200;
+ i12 = i4 + 8 | 0;
+ HEAP32[i12 >> 2] = i11;
+ i12 = _luaO_pushfstring(i9, 6592, i4) | 0;
+ i11 = HEAP32[i10 >> 2] | 0;
+ _luaX_syntaxerror(i11, i12);
+ }
+ i4 = i2 + 8 | 0;
+ if ((i8 + 2 | 0) > (HEAP32[i4 >> 2] | 0)) {
+ i11 = _luaM_growaux_(HEAP32[i1 + 52 >> 2] | 0, HEAP32[i2 >> 2] | 0, i4, 2, 2147483645, 6496) | 0;
+ HEAP32[i2 >> 2] = i11;
+ i12 = HEAP32[i6 >> 2] | 0;
+ i10 = i12 + 1 | 0;
+ HEAP32[i6 >> 2] = i10;
+ i12 = i11 + (i12 << 1) | 0;
+ HEAP16[i12 >> 1] = i7;
+ STACKTOP = i3;
+ return;
+ } else {
+ i12 = i8;
+ i11 = HEAP32[i2 >> 2] | 0;
+ i10 = i12 + 1 | 0;
+ HEAP32[i6 >> 2] = i10;
+ i12 = i11 + (i12 << 1) | 0;
+ HEAP16[i12 >> 1] = i7;
+ STACKTOP = i3;
+ return;
+ }
+}
+function _luaC_fullgc(i1, i5) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0;
+ i2 = STACKTOP;
+ i4 = i1 + 12 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ i6 = i3 + 62 | 0;
+ i8 = HEAP8[i6] | 0;
+ i5 = (i5 | 0) != 0;
+ if (!i5) {
+ HEAP8[i6] = 0;
+ i9 = (HEAP32[i4 >> 2] | 0) + 104 | 0;
+ i10 = HEAP32[i9 >> 2] | 0;
+ if ((i10 | 0) != 0) {
+ do {
+ i11 = i10 + 5 | 0;
+ HEAP8[i11] = HEAP8[i11] & 191;
+ _GCTM(i1, 1);
+ i10 = HEAP32[i9 >> 2] | 0;
+ } while ((i10 | 0) != 0);
+ if ((HEAP8[i6] | 0) == 2) {
+ i9 = 7;
+ } else {
+ i9 = 6;
+ }
+ } else {
+ i9 = 6;
+ }
+ } else {
+ HEAP8[i6] = 1;
+ i9 = 6;
+ }
+ if ((i9 | 0) == 6 ? (HEAPU8[i3 + 61 | 0] | 0) < 2 : 0) {
+ i9 = 7;
+ }
+ if ((i9 | 0) == 7) {
+ i9 = HEAP32[i4 >> 2] | 0;
+ HEAP8[i9 + 61 | 0] = 2;
+ HEAP32[i9 + 64 >> 2] = 0;
+ i10 = i9 + 72 | 0;
+ do {
+ i11 = _sweeplist(i1, i10, 1) | 0;
+ } while ((i11 | 0) == (i10 | 0));
+ HEAP32[i9 + 80 >> 2] = i11;
+ i11 = i9 + 68 | 0;
+ do {
+ i10 = _sweeplist(i1, i11, 1) | 0;
+ } while ((i10 | 0) == (i11 | 0));
+ HEAP32[i9 + 76 >> 2] = i10;
+ }
+ i11 = HEAP32[i4 >> 2] | 0;
+ i9 = i11 + 61 | 0;
+ if ((HEAP8[i9] | 0) == 5) {
+ i9 = 5;
+ } else {
+ do {
+ _singlestep(i1) | 0;
+ } while ((HEAP8[i9] | 0) != 5);
+ i9 = HEAP32[i4 >> 2] | 0;
+ i11 = i9;
+ i9 = HEAP8[i9 + 61 | 0] | 0;
+ }
+ i10 = i11 + 61 | 0;
+ if ((1 << (i9 & 255) & -33 | 0) == 0) {
+ do {
+ _singlestep(i1) | 0;
+ } while ((1 << HEAPU8[i10] & -33 | 0) == 0);
+ i9 = HEAP32[i4 >> 2] | 0;
+ i11 = i9;
+ i9 = HEAP8[i9 + 61 | 0] | 0;
+ }
+ i10 = i11 + 61 | 0;
+ if (!(i9 << 24 >> 24 == 5)) {
+ do {
+ _singlestep(i1) | 0;
+ } while ((HEAP8[i10] | 0) != 5);
+ }
+ if (i8 << 24 >> 24 == 2 ? (i7 = (HEAP32[i4 >> 2] | 0) + 61 | 0, (HEAP8[i7] | 0) != 0) : 0) {
+ do {
+ _singlestep(i1) | 0;
+ } while ((HEAP8[i7] | 0) != 0);
+ }
+ HEAP8[i6] = i8;
+ i6 = HEAP32[i3 + 8 >> 2] | 0;
+ i7 = HEAP32[i3 + 12 >> 2] | 0;
+ i8 = (i7 + i6 | 0) / 100 | 0;
+ i9 = HEAP32[i3 + 156 >> 2] | 0;
+ if ((i9 | 0) < (2147483644 / (i8 | 0) | 0 | 0)) {
+ i8 = Math_imul(i9, i8) | 0;
+ } else {
+ i8 = 2147483644;
+ }
+ _luaE_setdebt(i3, i6 - i8 + i7 | 0);
+ if (i5) {
+ STACKTOP = i2;
+ return;
+ }
+ i3 = (HEAP32[i4 >> 2] | 0) + 104 | 0;
+ i4 = HEAP32[i3 >> 2] | 0;
+ if ((i4 | 0) == 0) {
+ STACKTOP = i2;
+ return;
+ }
+ do {
+ i11 = i4 + 5 | 0;
+ HEAP8[i11] = HEAP8[i11] & 191;
+ _GCTM(i1, 1);
+ i4 = HEAP32[i3 >> 2] | 0;
+ } while ((i4 | 0) != 0);
+ STACKTOP = i2;
+ return;
+}
+function _scanexp(i3, i6) {
+ i3 = i3 | 0;
+ i6 = i6 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i5 = 0, i7 = 0, i8 = 0;
+ i1 = STACKTOP;
+ i2 = i3 + 4 | 0;
+ i5 = HEAP32[i2 >> 2] | 0;
+ i4 = i3 + 100 | 0;
+ if (i5 >>> 0 < (HEAP32[i4 >> 2] | 0) >>> 0) {
+ HEAP32[i2 >> 2] = i5 + 1;
+ i8 = HEAPU8[i5] | 0;
+ } else {
+ i8 = ___shgetc(i3) | 0;
+ }
+ if ((i8 | 0) == 43 | (i8 | 0) == 45) {
+ i5 = (i8 | 0) == 45 | 0;
+ i7 = HEAP32[i2 >> 2] | 0;
+ if (i7 >>> 0 < (HEAP32[i4 >> 2] | 0) >>> 0) {
+ HEAP32[i2 >> 2] = i7 + 1;
+ i8 = HEAPU8[i7] | 0;
+ } else {
+ i8 = ___shgetc(i3) | 0;
+ }
+ if (!((i8 + -48 | 0) >>> 0 < 10 | (i6 | 0) == 0) ? (HEAP32[i4 >> 2] | 0) != 0 : 0) {
+ HEAP32[i2 >> 2] = (HEAP32[i2 >> 2] | 0) + -1;
+ }
+ } else {
+ i5 = 0;
+ }
+ if ((i8 + -48 | 0) >>> 0 > 9) {
+ if ((HEAP32[i4 >> 2] | 0) == 0) {
+ i7 = -2147483648;
+ i8 = 0;
+ tempRet0 = i7;
+ STACKTOP = i1;
+ return i8 | 0;
+ }
+ HEAP32[i2 >> 2] = (HEAP32[i2 >> 2] | 0) + -1;
+ i7 = -2147483648;
+ i8 = 0;
+ tempRet0 = i7;
+ STACKTOP = i1;
+ return i8 | 0;
+ } else {
+ i6 = 0;
+ }
+ while (1) {
+ i6 = i8 + -48 + i6 | 0;
+ i7 = HEAP32[i2 >> 2] | 0;
+ if (i7 >>> 0 < (HEAP32[i4 >> 2] | 0) >>> 0) {
+ HEAP32[i2 >> 2] = i7 + 1;
+ i8 = HEAPU8[i7] | 0;
+ } else {
+ i8 = ___shgetc(i3) | 0;
+ }
+ if (!((i8 + -48 | 0) >>> 0 < 10 & (i6 | 0) < 214748364)) {
+ break;
+ }
+ i6 = i6 * 10 | 0;
+ }
+ i7 = ((i6 | 0) < 0) << 31 >> 31;
+ if ((i8 + -48 | 0) >>> 0 < 10) {
+ do {
+ i7 = ___muldi3(i6 | 0, i7 | 0, 10, 0) | 0;
+ i6 = tempRet0;
+ i8 = _i64Add(i8 | 0, ((i8 | 0) < 0) << 31 >> 31 | 0, -48, -1) | 0;
+ i6 = _i64Add(i8 | 0, tempRet0 | 0, i7 | 0, i6 | 0) | 0;
+ i7 = tempRet0;
+ i8 = HEAP32[i2 >> 2] | 0;
+ if (i8 >>> 0 < (HEAP32[i4 >> 2] | 0) >>> 0) {
+ HEAP32[i2 >> 2] = i8 + 1;
+ i8 = HEAPU8[i8] | 0;
+ } else {
+ i8 = ___shgetc(i3) | 0;
+ }
+ } while ((i8 + -48 | 0) >>> 0 < 10 & ((i7 | 0) < 21474836 | (i7 | 0) == 21474836 & i6 >>> 0 < 2061584302));
+ }
+ if ((i8 + -48 | 0) >>> 0 < 10) {
+ do {
+ i8 = HEAP32[i2 >> 2] | 0;
+ if (i8 >>> 0 < (HEAP32[i4 >> 2] | 0) >>> 0) {
+ HEAP32[i2 >> 2] = i8 + 1;
+ i8 = HEAPU8[i8] | 0;
+ } else {
+ i8 = ___shgetc(i3) | 0;
+ }
+ } while ((i8 + -48 | 0) >>> 0 < 10);
+ }
+ if ((HEAP32[i4 >> 2] | 0) != 0) {
+ HEAP32[i2 >> 2] = (HEAP32[i2 >> 2] | 0) + -1;
+ }
+ i3 = (i5 | 0) != 0;
+ i2 = _i64Subtract(0, 0, i6 | 0, i7 | 0) | 0;
+ i4 = i3 ? tempRet0 : i7;
+ i8 = i3 ? i2 : i6;
+ tempRet0 = i4;
+ STACKTOP = i1;
+ return i8 | 0;
+}
+function _sweeplist(i3, i8, i9) {
+ i3 = i3 | 0;
+ i8 = i8 | 0;
+ i9 = i9 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i10 = 0, i11 = 0, i12 = 0;
+ i1 = STACKTOP;
+ i5 = i3 + 12 | 0;
+ i7 = HEAP32[i5 >> 2] | 0;
+ i6 = HEAPU8[i7 + 60 | 0] | 0;
+ i2 = i6 ^ 3;
+ i7 = (HEAP8[i7 + 62 | 0] | 0) == 2;
+ i4 = i7 ? 255 : 184;
+ i6 = i7 ? 64 : i6 & 3;
+ i7 = i7 ? 64 : 0;
+ i10 = HEAP32[i8 >> 2] | 0;
+ L1 : do {
+ if ((i10 | 0) == 0) {
+ i10 = 0;
+ } else {
+ i11 = i9;
+ L2 : while (1) {
+ i9 = i11 + -1 | 0;
+ if ((i11 | 0) == 0) {
+ break L1;
+ }
+ i11 = i10 + 5 | 0;
+ i12 = HEAPU8[i11] | 0;
+ L5 : do {
+ if (((i12 ^ 3) & i2 | 0) == 0) {
+ HEAP32[i8 >> 2] = HEAP32[i10 >> 2];
+ switch (HEAPU8[i10 + 4 | 0] | 0) {
+ case 4:
+ {
+ i12 = (HEAP32[i5 >> 2] | 0) + 28 | 0;
+ HEAP32[i12 >> 2] = (HEAP32[i12 >> 2] | 0) + -1;
+ break;
+ }
+ case 38:
+ {
+ _luaM_realloc_(i3, i10, (HEAPU8[i10 + 6 | 0] << 4) + 16 | 0, 0) | 0;
+ break L5;
+ }
+ case 6:
+ {
+ _luaM_realloc_(i3, i10, (HEAPU8[i10 + 6 | 0] << 2) + 16 | 0, 0) | 0;
+ break L5;
+ }
+ case 20:
+ {
+ break;
+ }
+ case 5:
+ {
+ _luaH_free(i3, i10);
+ break L5;
+ }
+ case 10:
+ {
+ _luaF_freeupval(i3, i10);
+ break L5;
+ }
+ case 8:
+ {
+ _luaE_freethread(i3, i10);
+ break L5;
+ }
+ case 9:
+ {
+ _luaF_freeproto(i3, i10);
+ break L5;
+ }
+ case 7:
+ {
+ _luaM_realloc_(i3, i10, (HEAP32[i10 + 16 >> 2] | 0) + 24 | 0, 0) | 0;
+ break L5;
+ }
+ default:
+ {
+ break L5;
+ }
+ }
+ _luaM_realloc_(i3, i10, (HEAP32[i10 + 12 >> 2] | 0) + 17 | 0, 0) | 0;
+ } else {
+ if ((i12 & i7 | 0) != 0) {
+ i2 = 0;
+ break L2;
+ }
+ if (((HEAP8[i10 + 4 | 0] | 0) == 8 ? (HEAP32[i10 + 28 >> 2] | 0) != 0 : 0) ? (_sweeplist(i3, i10 + 56 | 0, -3) | 0, _luaE_freeCI(i10), (HEAP8[(HEAP32[i5 >> 2] | 0) + 62 | 0] | 0) != 1) : 0) {
+ _luaD_shrinkstack(i10);
+ }
+ HEAP8[i11] = i12 & i4 | i6;
+ i8 = i10;
+ }
+ } while (0);
+ i10 = HEAP32[i8 >> 2] | 0;
+ if ((i10 | 0) == 0) {
+ i10 = 0;
+ break L1;
+ } else {
+ i11 = i9;
+ }
+ }
+ STACKTOP = i1;
+ return i2 | 0;
+ }
+ } while (0);
+ i12 = (i10 | 0) == 0 ? 0 : i8;
+ STACKTOP = i1;
+ return i12 | 0;
+}
+function _resume(i1, i6) {
+ i1 = i1 | 0;
+ i6 = i6 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0;
+ i2 = STACKTOP;
+ i3 = i1 + 16 | 0;
+ i5 = HEAP32[i3 >> 2] | 0;
+ if ((HEAPU16[i1 + 38 >> 1] | 0) > 199) {
+ _resume_error(i1, 2240, i6);
+ }
+ i4 = i1 + 6 | 0;
+ i7 = HEAP8[i4] | 0;
+ if (i7 << 24 >> 24 == 0) {
+ if ((i5 | 0) != (i1 + 72 | 0)) {
+ _resume_error(i1, 2448, i6);
+ }
+ if ((_luaD_precall(i1, i6 + -16 | 0, -1) | 0) != 0) {
+ STACKTOP = i2;
+ return;
+ }
+ _luaV_execute(i1);
+ STACKTOP = i2;
+ return;
+ } else if (i7 << 24 >> 24 == 1) {
+ HEAP8[i4] = 0;
+ i4 = i1 + 28 | 0;
+ HEAP32[i5 >> 2] = (HEAP32[i4 >> 2] | 0) + (HEAP32[i5 + 20 >> 2] | 0);
+ i8 = i5 + 18 | 0;
+ i7 = HEAP8[i8] | 0;
+ if ((i7 & 1) == 0) {
+ i9 = HEAP32[i5 + 28 >> 2] | 0;
+ if ((i9 | 0) != 0) {
+ HEAP8[i5 + 37 | 0] = 1;
+ HEAP8[i8] = i7 & 255 | 8;
+ i6 = FUNCTION_TABLE_ii[i9 & 255](i1) | 0;
+ i6 = (HEAP32[i1 + 8 >> 2] | 0) + (0 - i6 << 4) | 0;
+ }
+ i5 = HEAP32[i3 >> 2] | 0;
+ i7 = HEAPU8[i1 + 40 | 0] | 0;
+ if ((i7 & 6 | 0) == 0) {
+ i7 = i5 + 8 | 0;
+ } else {
+ if ((i7 & 2 | 0) != 0) {
+ i6 = i6 - (HEAP32[i4 >> 2] | 0) | 0;
+ _luaD_hook(i1, 1, -1);
+ i6 = (HEAP32[i4 >> 2] | 0) + i6 | 0;
+ }
+ i7 = i5 + 8 | 0;
+ HEAP32[i1 + 20 >> 2] = HEAP32[(HEAP32[i7 >> 2] | 0) + 28 >> 2];
+ }
+ i4 = HEAP32[i5 >> 2] | 0;
+ i5 = HEAP16[i5 + 16 >> 1] | 0;
+ HEAP32[i3 >> 2] = HEAP32[i7 >> 2];
+ i3 = i1 + 8 | 0;
+ L27 : do {
+ if (!(i5 << 16 >> 16 == 0)) {
+ i5 = i5 << 16 >> 16;
+ while (1) {
+ if (!(i6 >>> 0 < (HEAP32[i3 >> 2] | 0) >>> 0)) {
+ break;
+ }
+ i7 = i4 + 16 | 0;
+ i10 = i6;
+ i8 = HEAP32[i10 + 4 >> 2] | 0;
+ i9 = i4;
+ HEAP32[i9 >> 2] = HEAP32[i10 >> 2];
+ HEAP32[i9 + 4 >> 2] = i8;
+ HEAP32[i4 + 8 >> 2] = HEAP32[i6 + 8 >> 2];
+ i5 = i5 + -1 | 0;
+ if ((i5 | 0) == 0) {
+ i4 = i7;
+ break L27;
+ }
+ i6 = i6 + 16 | 0;
+ i4 = i7;
+ }
+ if ((i5 | 0) > 0) {
+ i7 = i5;
+ i6 = i4;
+ while (1) {
+ i7 = i7 + -1 | 0;
+ HEAP32[i6 + 8 >> 2] = 0;
+ if ((i7 | 0) <= 0) {
+ break;
+ } else {
+ i6 = i6 + 16 | 0;
+ }
+ }
+ i4 = i4 + (i5 << 4) | 0;
+ }
+ }
+ } while (0);
+ HEAP32[i3 >> 2] = i4;
+ } else {
+ _luaV_execute(i1);
+ }
+ _unroll(i1, 0);
+ STACKTOP = i2;
+ return;
+ } else {
+ _resume_error(i1, 2488, i6);
+ }
+}
+function _lua_setupvalue(i1, i5, i3) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0;
+ i2 = STACKTOP;
+ i6 = HEAP32[i1 + 16 >> 2] | 0;
+ do {
+ if ((i5 | 0) <= 0) {
+ if (!((i5 | 0) < -1000999)) {
+ i5 = (HEAP32[i1 + 8 >> 2] | 0) + (i5 << 4) | 0;
+ break;
+ }
+ if ((i5 | 0) == -1001e3) {
+ i5 = (HEAP32[i1 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i5 = -1001e3 - i5 | 0;
+ i6 = HEAP32[i6 >> 2] | 0;
+ if ((HEAP32[i6 + 8 >> 2] | 0) != 22 ? (i4 = HEAP32[i6 >> 2] | 0, (i5 | 0) <= (HEAPU8[i4 + 6 | 0] | 0 | 0)) : 0) {
+ i5 = i4 + (i5 + -1 << 4) + 16 | 0;
+ } else {
+ i5 = 5192;
+ }
+ } else {
+ i4 = (HEAP32[i6 >> 2] | 0) + (i5 << 4) | 0;
+ i5 = i4 >>> 0 < (HEAP32[i1 + 8 >> 2] | 0) >>> 0 ? i4 : 5192;
+ }
+ } while (0);
+ i4 = HEAP32[i5 + 8 >> 2] & 63;
+ do {
+ if ((i4 | 0) == 6) {
+ i5 = HEAP32[i5 >> 2] | 0;
+ i4 = HEAP32[i5 + 12 >> 2] | 0;
+ if ((i3 | 0) <= 0) {
+ i6 = 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ if ((HEAP32[i4 + 40 >> 2] | 0) < (i3 | 0)) {
+ i6 = 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ i6 = i3 + -1 | 0;
+ i3 = HEAP32[i5 + 16 + (i6 << 2) >> 2] | 0;
+ i5 = HEAP32[i3 + 8 >> 2] | 0;
+ i4 = HEAP32[(HEAP32[i4 + 28 >> 2] | 0) + (i6 << 3) >> 2] | 0;
+ if ((i4 | 0) == 0) {
+ i4 = 936;
+ } else {
+ i4 = i4 + 16 | 0;
+ }
+ } else if ((i4 | 0) == 38) {
+ i6 = HEAP32[i5 >> 2] | 0;
+ if ((i3 | 0) <= 0) {
+ i6 = 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ if ((HEAPU8[i6 + 6 | 0] | 0 | 0) >= (i3 | 0)) {
+ i4 = 936;
+ i5 = i6 + (i3 + -1 << 4) + 16 | 0;
+ i3 = i6;
+ break;
+ } else {
+ i6 = 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ } else {
+ i6 = 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ } while (0);
+ i6 = i1 + 8 | 0;
+ i7 = HEAP32[i6 >> 2] | 0;
+ i10 = i7 + -16 | 0;
+ HEAP32[i6 >> 2] = i10;
+ i9 = HEAP32[i10 + 4 >> 2] | 0;
+ i8 = i5;
+ HEAP32[i8 >> 2] = HEAP32[i10 >> 2];
+ HEAP32[i8 + 4 >> 2] = i9;
+ HEAP32[i5 + 8 >> 2] = HEAP32[i7 + -8 >> 2];
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((HEAP32[i5 + 8 >> 2] & 64 | 0) == 0) {
+ i10 = i4;
+ STACKTOP = i2;
+ return i10 | 0;
+ }
+ i5 = HEAP32[i5 >> 2] | 0;
+ if ((HEAP8[i5 + 5 | 0] & 3) == 0) {
+ i10 = i4;
+ STACKTOP = i2;
+ return i10 | 0;
+ }
+ if ((HEAP8[i3 + 5 | 0] & 4) == 0) {
+ i10 = i4;
+ STACKTOP = i2;
+ return i10 | 0;
+ }
+ _luaC_barrier_(i1, i3, i5);
+ i10 = i4;
+ STACKTOP = i2;
+ return i10 | 0;
+}
+function _luaC_forcestep(i2) {
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0;
+ i1 = STACKTOP;
+ i3 = HEAP32[i2 + 12 >> 2] | 0;
+ do {
+ if ((HEAP8[i3 + 62 | 0] | 0) == 2) {
+ i4 = i3 + 20 | 0;
+ i6 = HEAP32[i4 >> 2] | 0;
+ do {
+ if ((i6 | 0) != 0) {
+ i5 = i3 + 61 | 0;
+ if ((HEAP8[i5] | 0) != 5) {
+ do {
+ _singlestep(i2) | 0;
+ } while ((HEAP8[i5] | 0) != 5);
+ }
+ HEAP8[i5] = 0;
+ i5 = HEAP32[i3 + 8 >> 2] | 0;
+ i7 = HEAP32[i3 + 12 >> 2] | 0;
+ if ((i7 + i5 | 0) >>> 0 > (Math_imul(HEAP32[i3 + 160 >> 2] | 0, (i6 >>> 0) / 100 | 0) | 0) >>> 0) {
+ HEAP32[i4 >> 2] = 0;
+ break;
+ } else {
+ HEAP32[i4 >> 2] = i6;
+ break;
+ }
+ } else {
+ _luaC_fullgc(i2, 0);
+ i5 = HEAP32[i3 + 8 >> 2] | 0;
+ i7 = HEAP32[i3 + 12 >> 2] | 0;
+ HEAP32[i4 >> 2] = i7 + i5;
+ }
+ } while (0);
+ i4 = i5 + i7 | 0;
+ i5 = (i4 | 0) / 100 | 0;
+ i6 = HEAP32[i3 + 156 >> 2] | 0;
+ if ((i6 | 0) < (2147483644 / (i5 | 0) | 0 | 0)) {
+ i5 = Math_imul(i6, i5) | 0;
+ } else {
+ i5 = 2147483644;
+ }
+ _luaE_setdebt(i3, i4 - i5 | 0);
+ i5 = i3 + 61 | 0;
+ } else {
+ i4 = i3 + 12 | 0;
+ i5 = HEAP32[i3 + 164 >> 2] | 0;
+ i7 = (i5 | 0) < 40 ? 40 : i5;
+ i5 = ((HEAP32[i4 >> 2] | 0) / 200 | 0) + 1 | 0;
+ if ((i5 | 0) < (2147483644 / (i7 | 0) | 0 | 0)) {
+ i8 = Math_imul(i5, i7) | 0;
+ } else {
+ i8 = 2147483644;
+ }
+ i5 = i3 + 61 | 0;
+ do {
+ i8 = i8 - (_singlestep(i2) | 0) | 0;
+ i9 = (HEAP8[i5] | 0) == 5;
+ if (!((i8 | 0) > -1600)) {
+ i6 = 17;
+ break;
+ }
+ } while (!i9);
+ if ((i6 | 0) == 17 ? !i9 : 0) {
+ _luaE_setdebt(i3, ((i8 | 0) / (i7 | 0) | 0) * 200 | 0);
+ break;
+ }
+ i6 = (HEAP32[i3 + 20 >> 2] | 0) / 100 | 0;
+ i7 = HEAP32[i3 + 156 >> 2] | 0;
+ if ((i7 | 0) < (2147483644 / (i6 | 0) | 0 | 0)) {
+ i6 = Math_imul(i7, i6) | 0;
+ } else {
+ i6 = 2147483644;
+ }
+ _luaE_setdebt(i3, (HEAP32[i3 + 8 >> 2] | 0) - i6 + (HEAP32[i4 >> 2] | 0) | 0);
+ }
+ } while (0);
+ i3 = i3 + 104 | 0;
+ if ((HEAP32[i3 >> 2] | 0) == 0) {
+ STACKTOP = i1;
+ return;
+ } else {
+ i4 = 0;
+ }
+ while (1) {
+ if ((i4 | 0) >= 4 ? (HEAP8[i5] | 0) != 5 : 0) {
+ i6 = 26;
+ break;
+ }
+ _GCTM(i2, 1);
+ if ((HEAP32[i3 >> 2] | 0) == 0) {
+ i6 = 26;
+ break;
+ } else {
+ i4 = i4 + 1 | 0;
+ }
+ }
+ if ((i6 | 0) == 26) {
+ STACKTOP = i1;
+ return;
+ }
+}
+function _luaL_loadfilex(i1, i9, i7) {
+ i1 = i1 | 0;
+ i9 = i9 | 0;
+ i7 = i7 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i8 = 0, i10 = 0, i11 = 0;
+ i5 = STACKTOP;
+ STACKTOP = STACKTOP + 1056 | 0;
+ i3 = i5;
+ i6 = i5 + 16 | 0;
+ i8 = i5 + 12 | 0;
+ i2 = (_lua_gettop(i1) | 0) + 1 | 0;
+ i4 = (i9 | 0) == 0;
+ if (!i4) {
+ HEAP32[i3 >> 2] = i9;
+ _lua_pushfstring(i1, 1304, i3) | 0;
+ i10 = _fopen(i9 | 0, 1312) | 0;
+ HEAP32[i6 + 4 >> 2] = i10;
+ if ((i10 | 0) == 0) {
+ i10 = _strerror(HEAP32[(___errno_location() | 0) >> 2] | 0) | 0;
+ i9 = (_lua_tolstring(i1, i2, 0) | 0) + 1 | 0;
+ HEAP32[i3 >> 2] = 1320;
+ HEAP32[i3 + 4 >> 2] = i9;
+ HEAP32[i3 + 8 >> 2] = i10;
+ _lua_pushfstring(i1, 1720, i3) | 0;
+ _lua_remove(i1, i2);
+ i10 = 7;
+ STACKTOP = i5;
+ return i10 | 0;
+ }
+ } else {
+ _lua_pushlstring(i1, 1296, 6) | 0;
+ HEAP32[i6 + 4 >> 2] = HEAP32[_stdin >> 2];
+ }
+ if ((_skipcomment(i6, i8) | 0) != 0) {
+ i10 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i6 >> 2] = i10 + 1;
+ HEAP8[i6 + i10 + 8 | 0] = 10;
+ }
+ i10 = HEAP32[i8 >> 2] | 0;
+ do {
+ if (!((i10 | 0) != 27 | i4)) {
+ i11 = i6 + 4 | 0;
+ i10 = _freopen(i9 | 0, 1328, HEAP32[i11 >> 2] | 0) | 0;
+ HEAP32[i11 >> 2] = i10;
+ if ((i10 | 0) != 0) {
+ _skipcomment(i6, i8) | 0;
+ i10 = HEAP32[i8 >> 2] | 0;
+ break;
+ }
+ i11 = _strerror(HEAP32[(___errno_location() | 0) >> 2] | 0) | 0;
+ i10 = (_lua_tolstring(i1, i2, 0) | 0) + 1 | 0;
+ HEAP32[i3 >> 2] = 1336;
+ HEAP32[i3 + 4 >> 2] = i10;
+ HEAP32[i3 + 8 >> 2] = i11;
+ _lua_pushfstring(i1, 1720, i3) | 0;
+ _lua_remove(i1, i2);
+ i11 = 7;
+ STACKTOP = i5;
+ return i11 | 0;
+ }
+ } while (0);
+ if (!((i10 | 0) == -1)) {
+ i11 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i6 >> 2] = i11 + 1;
+ HEAP8[i6 + i11 + 8 | 0] = i10;
+ }
+ i7 = _lua_load(i1, 1, i6, _lua_tolstring(i1, -1, 0) | 0, i7) | 0;
+ i8 = HEAP32[i6 + 4 >> 2] | 0;
+ i6 = _ferror(i8 | 0) | 0;
+ if (!i4) {
+ _fclose(i8 | 0) | 0;
+ }
+ if ((i6 | 0) == 0) {
+ _lua_remove(i1, i2);
+ i11 = i7;
+ STACKTOP = i5;
+ return i11 | 0;
+ } else {
+ _lua_settop(i1, i2);
+ i11 = _strerror(HEAP32[(___errno_location() | 0) >> 2] | 0) | 0;
+ i10 = (_lua_tolstring(i1, i2, 0) | 0) + 1 | 0;
+ HEAP32[i3 >> 2] = 1344;
+ HEAP32[i3 + 4 >> 2] = i10;
+ HEAP32[i3 + 8 >> 2] = i11;
+ _lua_pushfstring(i1, 1720, i3) | 0;
+ _lua_remove(i1, i2);
+ i11 = 7;
+ STACKTOP = i5;
+ return i11 | 0;
+ }
+ return 0;
+}
+function _newupvalue(i3, i1, i2) {
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0;
+ i4 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i12 = i4;
+ i5 = HEAP32[i3 >> 2] | 0;
+ i9 = i5 + 40 | 0;
+ i7 = HEAP32[i9 >> 2] | 0;
+ i6 = i3 + 47 | 0;
+ i10 = HEAPU8[i6] | 0;
+ if ((i10 + 1 | 0) >>> 0 > 255) {
+ i11 = i3 + 12 | 0;
+ i8 = HEAP32[(HEAP32[i11 >> 2] | 0) + 52 >> 2] | 0;
+ i13 = HEAP32[i5 + 64 >> 2] | 0;
+ if ((i13 | 0) == 0) {
+ i15 = 6552;
+ HEAP32[i12 >> 2] = 6880;
+ i14 = i12 + 4 | 0;
+ HEAP32[i14 >> 2] = 255;
+ i14 = i12 + 8 | 0;
+ HEAP32[i14 >> 2] = i15;
+ i14 = _luaO_pushfstring(i8, 6592, i12) | 0;
+ i15 = HEAP32[i11 >> 2] | 0;
+ _luaX_syntaxerror(i15, i14);
+ }
+ HEAP32[i12 >> 2] = i13;
+ i14 = _luaO_pushfstring(i8, 6568, i12) | 0;
+ HEAP32[i12 >> 2] = 6880;
+ i15 = i12 + 4 | 0;
+ HEAP32[i15 >> 2] = 255;
+ i15 = i12 + 8 | 0;
+ HEAP32[i15 >> 2] = i14;
+ i15 = _luaO_pushfstring(i8, 6592, i12) | 0;
+ i14 = HEAP32[i11 >> 2] | 0;
+ _luaX_syntaxerror(i14, i15);
+ }
+ if ((i10 | 0) < (i7 | 0)) {
+ i8 = i7;
+ } else {
+ i8 = i5 + 28 | 0;
+ HEAP32[i8 >> 2] = _luaM_growaux_(HEAP32[(HEAP32[i3 + 12 >> 2] | 0) + 52 >> 2] | 0, HEAP32[i8 >> 2] | 0, i9, 8, 255, 6880) | 0;
+ i8 = HEAP32[i9 >> 2] | 0;
+ }
+ i9 = i5 + 28 | 0;
+ if ((i7 | 0) < (i8 | 0)) {
+ while (1) {
+ i10 = i7 + 1 | 0;
+ HEAP32[(HEAP32[i9 >> 2] | 0) + (i7 << 3) >> 2] = 0;
+ if ((i10 | 0) < (i8 | 0)) {
+ i7 = i10;
+ } else {
+ break;
+ }
+ }
+ }
+ HEAP8[(HEAP32[i9 >> 2] | 0) + ((HEAPU8[i6] | 0) << 3) + 4 | 0] = (HEAP32[i2 >> 2] | 0) == 7 | 0;
+ HEAP8[(HEAP32[i9 >> 2] | 0) + ((HEAPU8[i6] | 0) << 3) + 5 | 0] = HEAP32[i2 + 8 >> 2];
+ HEAP32[(HEAP32[i9 >> 2] | 0) + ((HEAPU8[i6] | 0) << 3) >> 2] = i1;
+ if ((HEAP8[i1 + 5 | 0] & 3) == 0) {
+ i15 = HEAP8[i6] | 0;
+ i14 = i15 + 1 << 24 >> 24;
+ HEAP8[i6] = i14;
+ i15 = i15 & 255;
+ STACKTOP = i4;
+ return i15 | 0;
+ }
+ if ((HEAP8[i5 + 5 | 0] & 4) == 0) {
+ i15 = HEAP8[i6] | 0;
+ i14 = i15 + 1 << 24 >> 24;
+ HEAP8[i6] = i14;
+ i15 = i15 & 255;
+ STACKTOP = i4;
+ return i15 | 0;
+ }
+ _luaC_barrier_(HEAP32[(HEAP32[i3 + 12 >> 2] | 0) + 52 >> 2] | 0, i5, i1);
+ i15 = HEAP8[i6] | 0;
+ i14 = i15 + 1 << 24 >> 24;
+ HEAP8[i6] = i14;
+ i15 = i15 & 255;
+ STACKTOP = i4;
+ return i15 | 0;
+}
+function _close_func(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0;
+ i6 = STACKTOP;
+ i2 = HEAP32[i1 + 52 >> 2] | 0;
+ i5 = i1 + 48 | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ _luaK_ret(i4, 0, 0);
+ _leaveblock(i4);
+ i7 = i4 + 20 | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ if ((i8 + 1 | 0) >>> 0 > 1073741823) {
+ _luaM_toobig(i2);
+ }
+ i10 = i3 + 12 | 0;
+ i9 = i3 + 48 | 0;
+ HEAP32[i10 >> 2] = _luaM_realloc_(i2, HEAP32[i10 >> 2] | 0, HEAP32[i9 >> 2] << 2, i8 << 2) | 0;
+ HEAP32[i9 >> 2] = HEAP32[i7 >> 2];
+ i8 = HEAP32[i7 >> 2] | 0;
+ if ((i8 + 1 | 0) >>> 0 > 1073741823) {
+ _luaM_toobig(i2);
+ }
+ i9 = i3 + 20 | 0;
+ i10 = i3 + 52 | 0;
+ HEAP32[i9 >> 2] = _luaM_realloc_(i2, HEAP32[i9 >> 2] | 0, HEAP32[i10 >> 2] << 2, i8 << 2) | 0;
+ HEAP32[i10 >> 2] = HEAP32[i7 >> 2];
+ i8 = i4 + 32 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ if ((i7 + 1 | 0) >>> 0 > 268435455) {
+ _luaM_toobig(i2);
+ }
+ i9 = i3 + 8 | 0;
+ i10 = i3 + 44 | 0;
+ HEAP32[i9 >> 2] = _luaM_realloc_(i2, HEAP32[i9 >> 2] | 0, HEAP32[i10 >> 2] << 4, i7 << 4) | 0;
+ HEAP32[i10 >> 2] = HEAP32[i8 >> 2];
+ i8 = i4 + 36 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ if ((i7 + 1 | 0) >>> 0 > 1073741823) {
+ _luaM_toobig(i2);
+ }
+ i9 = i3 + 16 | 0;
+ i10 = i3 + 56 | 0;
+ HEAP32[i9 >> 2] = _luaM_realloc_(i2, HEAP32[i9 >> 2] | 0, HEAP32[i10 >> 2] << 2, i7 << 2) | 0;
+ HEAP32[i10 >> 2] = HEAP32[i8 >> 2];
+ i7 = i4 + 44 | 0;
+ i8 = HEAP16[i7 >> 1] | 0;
+ if ((i8 + 1 | 0) >>> 0 > 357913941) {
+ _luaM_toobig(i2);
+ }
+ i10 = i3 + 24 | 0;
+ i9 = i3 + 60 | 0;
+ HEAP32[i10 >> 2] = _luaM_realloc_(i2, HEAP32[i10 >> 2] | 0, (HEAP32[i9 >> 2] | 0) * 12 | 0, i8 * 12 | 0) | 0;
+ HEAP32[i9 >> 2] = HEAP16[i7 >> 1] | 0;
+ i9 = i4 + 47 | 0;
+ i8 = i3 + 28 | 0;
+ i10 = i3 + 40 | 0;
+ HEAP32[i8 >> 2] = _luaM_realloc_(i2, HEAP32[i8 >> 2] | 0, HEAP32[i10 >> 2] << 3, HEAPU8[i9] << 3) | 0;
+ HEAP32[i10 >> 2] = HEAPU8[i9] | 0;
+ HEAP32[i5 >> 2] = HEAP32[i4 + 8 >> 2];
+ if (((HEAP32[i1 + 16 >> 2] | 0) + -288 | 0) >>> 0 < 2) {
+ i10 = HEAP32[i1 + 24 >> 2] | 0;
+ _luaX_newstring(i1, i10 + 16 | 0, HEAP32[i10 + 12 >> 2] | 0) | 0;
+ }
+ i10 = i2 + 8 | 0;
+ HEAP32[i10 >> 2] = (HEAP32[i10 >> 2] | 0) + -16;
+ if ((HEAP32[(HEAP32[i2 + 12 >> 2] | 0) + 12 >> 2] | 0) <= 0) {
+ STACKTOP = i6;
+ return;
+ }
+ _luaC_step(i2);
+ STACKTOP = i6;
+ return;
+}
+function _lua_topointer(i3, i6) {
+ i3 = i3 | 0;
+ i6 = i6 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i5 = 0, i7 = 0, i8 = 0, i9 = 0;
+ i1 = STACKTOP;
+ i4 = HEAP32[i3 + 16 >> 2] | 0;
+ i5 = (i6 | 0) > 0;
+ do {
+ if (!i5) {
+ if (!((i6 | 0) < -1000999)) {
+ i7 = (HEAP32[i3 + 8 >> 2] | 0) + (i6 << 4) | 0;
+ break;
+ }
+ if ((i6 | 0) == -1001e3) {
+ i7 = (HEAP32[i3 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i8 = -1001e3 - i6 | 0;
+ i9 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP32[i9 + 8 >> 2] | 0) != 22 ? (i7 = HEAP32[i9 >> 2] | 0, (i8 | 0) <= (HEAPU8[i7 + 6 | 0] | 0 | 0)) : 0) {
+ i7 = i7 + (i8 + -1 << 4) + 16 | 0;
+ } else {
+ i7 = 5192;
+ }
+ } else {
+ i7 = (HEAP32[i4 >> 2] | 0) + (i6 << 4) | 0;
+ i7 = i7 >>> 0 < (HEAP32[i3 + 8 >> 2] | 0) >>> 0 ? i7 : 5192;
+ }
+ } while (0);
+ switch (HEAP32[i7 + 8 >> 2] & 63 | 0) {
+ case 22:
+ {
+ i9 = HEAP32[i7 >> 2] | 0;
+ STACKTOP = i1;
+ return i9 | 0;
+ }
+ case 2:
+ case 7:
+ {
+ do {
+ if (!i5) {
+ if (!((i6 | 0) < -1000999)) {
+ i2 = (HEAP32[i3 + 8 >> 2] | 0) + (i6 << 4) | 0;
+ break;
+ }
+ if ((i6 | 0) == -1001e3) {
+ i2 = (HEAP32[i3 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i3 = -1001e3 - i6 | 0;
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP32[i4 + 8 >> 2] | 0) != 22 ? (i2 = HEAP32[i4 >> 2] | 0, (i3 | 0) <= (HEAPU8[i2 + 6 | 0] | 0 | 0)) : 0) {
+ i2 = i2 + (i3 + -1 << 4) + 16 | 0;
+ } else {
+ i2 = 5192;
+ }
+ } else {
+ i2 = (HEAP32[i4 >> 2] | 0) + (i6 << 4) | 0;
+ i2 = i2 >>> 0 < (HEAP32[i3 + 8 >> 2] | 0) >>> 0 ? i2 : 5192;
+ }
+ } while (0);
+ i3 = HEAP32[i2 + 8 >> 2] & 15;
+ if ((i3 | 0) == 7) {
+ i9 = (HEAP32[i2 >> 2] | 0) + 24 | 0;
+ STACKTOP = i1;
+ return i9 | 0;
+ } else if ((i3 | 0) == 2) {
+ i9 = HEAP32[i2 >> 2] | 0;
+ STACKTOP = i1;
+ return i9 | 0;
+ } else {
+ i9 = 0;
+ STACKTOP = i1;
+ return i9 | 0;
+ }
+ }
+ case 8:
+ {
+ i9 = HEAP32[i7 >> 2] | 0;
+ STACKTOP = i1;
+ return i9 | 0;
+ }
+ case 5:
+ {
+ i9 = HEAP32[i7 >> 2] | 0;
+ STACKTOP = i1;
+ return i9 | 0;
+ }
+ case 38:
+ {
+ i9 = HEAP32[i7 >> 2] | 0;
+ STACKTOP = i1;
+ return i9 | 0;
+ }
+ case 6:
+ {
+ i9 = HEAP32[i7 >> 2] | 0;
+ STACKTOP = i1;
+ return i9 | 0;
+ }
+ default:
+ {
+ i9 = 0;
+ STACKTOP = i1;
+ return i9 | 0;
+ }
+ }
+ return 0;
+}
+function _luaH_get(i4, i6) {
+ i4 = i4 | 0;
+ i6 = i6 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, d5 = 0.0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, d11 = 0.0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i8 = i3 + 8 | 0;
+ i9 = i3;
+ i7 = i6 + 8 | 0;
+ i10 = HEAP32[i7 >> 2] & 63;
+ if ((i10 | 0) == 4) {
+ i6 = HEAP32[i6 >> 2] | 0;
+ i7 = (HEAP32[i4 + 16 >> 2] | 0) + (((1 << (HEAPU8[i4 + 7 | 0] | 0)) + -1 & HEAP32[i6 + 8 >> 2]) << 5) | 0;
+ while (1) {
+ if ((HEAP32[i7 + 24 >> 2] | 0) == 68 ? (HEAP32[i7 + 16 >> 2] | 0) == (i6 | 0) : 0) {
+ break;
+ }
+ i4 = HEAP32[i7 + 28 >> 2] | 0;
+ if ((i4 | 0) == 0) {
+ i2 = 5192;
+ i1 = 22;
+ break;
+ } else {
+ i7 = i4;
+ }
+ }
+ if ((i1 | 0) == 22) {
+ STACKTOP = i3;
+ return i2 | 0;
+ }
+ i10 = i7;
+ STACKTOP = i3;
+ return i10 | 0;
+ } else if ((i10 | 0) == 3) {
+ d11 = +HEAPF64[i6 >> 3];
+ HEAPF64[i9 >> 3] = d11 + 6755399441055744.0;
+ i9 = HEAP32[i9 >> 2] | 0;
+ d5 = +(i9 | 0);
+ if (d5 == d11) {
+ i6 = i9 + -1 | 0;
+ if (i6 >>> 0 < (HEAP32[i4 + 28 >> 2] | 0) >>> 0) {
+ i10 = (HEAP32[i4 + 12 >> 2] | 0) + (i6 << 4) | 0;
+ STACKTOP = i3;
+ return i10 | 0;
+ }
+ HEAPF64[i8 >> 3] = d5 + 1.0;
+ i6 = (HEAP32[i8 + 4 >> 2] | 0) + (HEAP32[i8 >> 2] | 0) | 0;
+ if ((i6 | 0) < 0) {
+ i7 = 0 - i6 | 0;
+ i6 = (i6 | 0) == (i7 | 0) ? 0 : i7;
+ }
+ i4 = (HEAP32[i4 + 16 >> 2] | 0) + (((i6 | 0) % ((1 << (HEAPU8[i4 + 7 | 0] | 0)) + -1 | 1 | 0) | 0) << 5) | 0;
+ while (1) {
+ if ((HEAP32[i4 + 24 >> 2] | 0) == 3 ? +HEAPF64[i4 + 16 >> 3] == d5 : 0) {
+ break;
+ }
+ i6 = HEAP32[i4 + 28 >> 2] | 0;
+ if ((i6 | 0) == 0) {
+ i2 = 5192;
+ i1 = 22;
+ break;
+ } else {
+ i4 = i6;
+ }
+ }
+ if ((i1 | 0) == 22) {
+ STACKTOP = i3;
+ return i2 | 0;
+ }
+ i10 = i4;
+ STACKTOP = i3;
+ return i10 | 0;
+ }
+ } else if ((i10 | 0) == 0) {
+ i10 = 5192;
+ STACKTOP = i3;
+ return i10 | 0;
+ }
+ i8 = _mainposition(i4, i6) | 0;
+ while (1) {
+ if ((HEAP32[i8 + 24 >> 2] | 0) == (HEAP32[i7 >> 2] | 0) ? (_luaV_equalobj_(0, i8 + 16 | 0, i6) | 0) != 0 : 0) {
+ break;
+ }
+ i4 = HEAP32[i8 + 28 >> 2] | 0;
+ if ((i4 | 0) == 0) {
+ i2 = 5192;
+ i1 = 22;
+ break;
+ } else {
+ i8 = i4;
+ }
+ }
+ if ((i1 | 0) == 22) {
+ STACKTOP = i3;
+ return i2 | 0;
+ }
+ i10 = i8;
+ STACKTOP = i3;
+ return i10 | 0;
+}
+function _suffixedexp(i1, i8) {
+ i1 = i1 | 0;
+ i8 = i8 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 80 | 0;
+ i10 = i2 + 48 | 0;
+ i3 = i2 + 24 | 0;
+ i6 = i2;
+ i4 = i1 + 48 | 0;
+ i9 = HEAP32[i4 >> 2] | 0;
+ i5 = HEAP32[i1 + 4 >> 2] | 0;
+ i7 = i1 + 16 | 0;
+ i12 = HEAP32[i7 >> 2] | 0;
+ if ((i12 | 0) == 40) {
+ _luaX_next(i1);
+ _subexpr(i1, i8, 0) | 0;
+ _check_match(i1, 41, 40, i5);
+ _luaK_dischargevars(HEAP32[i4 >> 2] | 0, i8);
+ i11 = i1 + 24 | 0;
+ } else if ((i12 | 0) == 288) {
+ i11 = i1 + 24 | 0;
+ i13 = HEAP32[i11 >> 2] | 0;
+ _luaX_next(i1);
+ i12 = HEAP32[i4 >> 2] | 0;
+ if ((_singlevaraux(i12, i13, i8, 1) | 0) == 0) {
+ _singlevaraux(i12, HEAP32[i1 + 72 >> 2] | 0, i8, 1) | 0;
+ i13 = _luaK_stringK(HEAP32[i4 >> 2] | 0, i13) | 0;
+ HEAP32[i10 + 16 >> 2] = -1;
+ HEAP32[i10 + 20 >> 2] = -1;
+ HEAP32[i10 >> 2] = 4;
+ HEAP32[i10 + 8 >> 2] = i13;
+ _luaK_indexed(i12, i8, i10);
+ }
+ } else {
+ _luaX_syntaxerror(i1, 6656);
+ }
+ i10 = i6 + 16 | 0;
+ i12 = i6 + 20 | 0;
+ i13 = i6 + 8 | 0;
+ L7 : while (1) {
+ switch (HEAP32[i7 >> 2] | 0) {
+ case 46:
+ {
+ _fieldsel(i1, i8);
+ continue L7;
+ }
+ case 91:
+ {
+ _luaK_exp2anyregup(i9, i8);
+ _luaX_next(i1);
+ _subexpr(i1, i3, 0) | 0;
+ _luaK_exp2val(HEAP32[i4 >> 2] | 0, i3);
+ if ((HEAP32[i7 >> 2] | 0) != 93) {
+ i3 = 10;
+ break L7;
+ }
+ _luaX_next(i1);
+ _luaK_indexed(i9, i8, i3);
+ continue L7;
+ }
+ case 58:
+ {
+ _luaX_next(i1);
+ if ((HEAP32[i7 >> 2] | 0) != 288) {
+ i3 = 13;
+ break L7;
+ }
+ i14 = HEAP32[i11 >> 2] | 0;
+ _luaX_next(i1);
+ i14 = _luaK_stringK(HEAP32[i4 >> 2] | 0, i14) | 0;
+ HEAP32[i10 >> 2] = -1;
+ HEAP32[i12 >> 2] = -1;
+ HEAP32[i6 >> 2] = 4;
+ HEAP32[i13 >> 2] = i14;
+ _luaK_self(i9, i8, i6);
+ _funcargs(i1, i8, i5);
+ continue L7;
+ }
+ case 123:
+ case 289:
+ case 40:
+ {
+ _luaK_exp2nextreg(i9, i8);
+ _funcargs(i1, i8, i5);
+ continue L7;
+ }
+ default:
+ {
+ i3 = 16;
+ break L7;
+ }
+ }
+ }
+ if ((i3 | 0) == 10) {
+ _error_expected(i1, 93);
+ } else if ((i3 | 0) == 13) {
+ _error_expected(i1, 288);
+ } else if ((i3 | 0) == 16) {
+ STACKTOP = i2;
+ return;
+ }
+}
+function _luaK_patchlist(i2, i7, i3) {
+ i2 = i2 | 0;
+ i7 = i7 | 0;
+ i3 = i3 | 0;
+ var i1 = 0, i4 = 0, i5 = 0, i6 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0;
+ i1 = STACKTOP;
+ if ((HEAP32[i2 + 20 >> 2] | 0) == (i3 | 0)) {
+ HEAP32[i2 + 24 >> 2] = i3;
+ i3 = i2 + 28 | 0;
+ if ((i7 | 0) == -1) {
+ STACKTOP = i1;
+ return;
+ }
+ i6 = HEAP32[i3 >> 2] | 0;
+ if ((i6 | 0) == -1) {
+ HEAP32[i3 >> 2] = i7;
+ STACKTOP = i1;
+ return;
+ }
+ i5 = HEAP32[(HEAP32[i2 >> 2] | 0) + 12 >> 2] | 0;
+ while (1) {
+ i3 = i5 + (i6 << 2) | 0;
+ i4 = HEAP32[i3 >> 2] | 0;
+ i8 = (i4 >>> 14) + -131071 | 0;
+ if ((i8 | 0) == -1) {
+ break;
+ }
+ i8 = i6 + 1 + i8 | 0;
+ if ((i8 | 0) == -1) {
+ break;
+ } else {
+ i6 = i8;
+ }
+ }
+ i5 = ~i6 + i7 | 0;
+ if ((((i5 | 0) > -1 ? i5 : 0 - i5 | 0) | 0) > 131071) {
+ _luaX_syntaxerror(HEAP32[i2 + 12 >> 2] | 0, 10624);
+ }
+ HEAP32[i3 >> 2] = (i5 << 14) + 2147467264 | i4 & 16383;
+ STACKTOP = i1;
+ return;
+ }
+ if ((i7 | 0) == -1) {
+ STACKTOP = i1;
+ return;
+ }
+ i6 = HEAP32[(HEAP32[i2 >> 2] | 0) + 12 >> 2] | 0;
+ i10 = i7;
+ while (1) {
+ i7 = i6 + (i10 << 2) | 0;
+ i9 = HEAP32[i7 >> 2] | 0;
+ i8 = (i9 >>> 14) + -131071 | 0;
+ if ((i8 | 0) == -1) {
+ i8 = -1;
+ } else {
+ i8 = i10 + 1 + i8 | 0;
+ }
+ if ((i10 | 0) > 0 ? (i4 = i6 + (i10 + -1 << 2) | 0, i5 = HEAP32[i4 >> 2] | 0, (HEAP8[5584 + (i5 & 63) | 0] | 0) < 0) : 0) {
+ i12 = i4;
+ i11 = i5;
+ } else {
+ i12 = i7;
+ i11 = i9;
+ }
+ if ((i11 & 63 | 0) == 28) {
+ HEAP32[i12 >> 2] = i11 & 8372224 | i11 >>> 23 << 6 | 27;
+ i9 = ~i10 + i3 | 0;
+ if ((((i9 | 0) > -1 ? i9 : 0 - i9 | 0) | 0) > 131071) {
+ i3 = 20;
+ break;
+ }
+ i9 = HEAP32[i7 >> 2] & 16383 | (i9 << 14) + 2147467264;
+ } else {
+ i10 = ~i10 + i3 | 0;
+ if ((((i10 | 0) > -1 ? i10 : 0 - i10 | 0) | 0) > 131071) {
+ i3 = 23;
+ break;
+ }
+ i9 = i9 & 16383 | (i10 << 14) + 2147467264;
+ }
+ HEAP32[i7 >> 2] = i9;
+ if ((i8 | 0) == -1) {
+ i3 = 26;
+ break;
+ } else {
+ i10 = i8;
+ }
+ }
+ if ((i3 | 0) == 20) {
+ _luaX_syntaxerror(HEAP32[i2 + 12 >> 2] | 0, 10624);
+ } else if ((i3 | 0) == 23) {
+ _luaX_syntaxerror(HEAP32[i2 + 12 >> 2] | 0, 10624);
+ } else if ((i3 | 0) == 26) {
+ STACKTOP = i1;
+ return;
+ }
+}
+function _luaG_typeerror(i5, i6, i1) {
+ i5 = i5 | 0;
+ i6 = i6 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 32 | 0;
+ i3 = i2;
+ i2 = i2 + 16 | 0;
+ i8 = HEAP32[i5 + 16 >> 2] | 0;
+ HEAP32[i2 >> 2] = 0;
+ i4 = HEAP32[8528 + ((HEAP32[i6 + 8 >> 2] & 15) + 1 << 2) >> 2] | 0;
+ L1 : do {
+ if (!((HEAP8[i8 + 18 | 0] & 1) == 0)) {
+ i7 = HEAP32[HEAP32[i8 >> 2] >> 2] | 0;
+ i10 = HEAP8[i7 + 6 | 0] | 0;
+ L3 : do {
+ if (!(i10 << 24 >> 24 == 0)) {
+ i9 = i7 + 16 | 0;
+ i11 = i10 & 255;
+ i10 = 0;
+ while (1) {
+ i12 = i10 + 1 | 0;
+ if ((HEAP32[(HEAP32[i9 + (i10 << 2) >> 2] | 0) + 8 >> 2] | 0) == (i6 | 0)) {
+ break;
+ }
+ if ((i12 | 0) < (i11 | 0)) {
+ i10 = i12;
+ } else {
+ break L3;
+ }
+ }
+ i9 = HEAP32[(HEAP32[(HEAP32[i7 + 12 >> 2] | 0) + 28 >> 2] | 0) + (i10 << 3) >> 2] | 0;
+ if ((i9 | 0) == 0) {
+ i9 = 2104;
+ } else {
+ i9 = i9 + 16 | 0;
+ }
+ HEAP32[i2 >> 2] = i9;
+ i11 = i9;
+ i10 = 2072;
+ HEAP32[i3 >> 2] = i1;
+ i12 = i3 + 4 | 0;
+ HEAP32[i12 >> 2] = i10;
+ i12 = i3 + 8 | 0;
+ HEAP32[i12 >> 2] = i11;
+ i12 = i3 + 12 | 0;
+ HEAP32[i12 >> 2] = i4;
+ _luaG_runerror(i5, 1840, i3);
+ }
+ } while (0);
+ i9 = HEAP32[i8 + 24 >> 2] | 0;
+ i10 = HEAP32[i8 + 4 >> 2] | 0;
+ if (i9 >>> 0 < i10 >>> 0) {
+ i12 = i9;
+ while (1) {
+ i11 = i12 + 16 | 0;
+ if ((i12 | 0) == (i6 | 0)) {
+ break;
+ }
+ if (i11 >>> 0 < i10 >>> 0) {
+ i12 = i11;
+ } else {
+ break L1;
+ }
+ }
+ i12 = HEAP32[i7 + 12 >> 2] | 0;
+ i6 = _getobjname(i12, ((HEAP32[i8 + 28 >> 2] | 0) - (HEAP32[i12 + 12 >> 2] | 0) >> 2) + -1 | 0, i6 - i9 >> 4, i2) | 0;
+ if ((i6 | 0) != 0) {
+ i11 = HEAP32[i2 >> 2] | 0;
+ i10 = i6;
+ HEAP32[i3 >> 2] = i1;
+ i12 = i3 + 4 | 0;
+ HEAP32[i12 >> 2] = i10;
+ i12 = i3 + 8 | 0;
+ HEAP32[i12 >> 2] = i11;
+ i12 = i3 + 12 | 0;
+ HEAP32[i12 >> 2] = i4;
+ _luaG_runerror(i5, 1840, i3);
+ }
+ }
+ }
+ } while (0);
+ HEAP32[i3 >> 2] = i1;
+ HEAP32[i3 + 4 >> 2] = i4;
+ _luaG_runerror(i5, 1880, i3);
+}
+function _lua_setmetatable(i1, i7) {
+ i1 = i1 | 0;
+ i7 = i7 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i8 = 0;
+ i4 = STACKTOP;
+ i6 = HEAP32[i1 + 16 >> 2] | 0;
+ do {
+ if ((i7 | 0) <= 0) {
+ if (!((i7 | 0) < -1000999)) {
+ i5 = (HEAP32[i1 + 8 >> 2] | 0) + (i7 << 4) | 0;
+ break;
+ }
+ if ((i7 | 0) == -1001e3) {
+ i5 = (HEAP32[i1 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i7 = -1001e3 - i7 | 0;
+ i6 = HEAP32[i6 >> 2] | 0;
+ if ((HEAP32[i6 + 8 >> 2] | 0) != 22 ? (i5 = HEAP32[i6 >> 2] | 0, (i7 | 0) <= (HEAPU8[i5 + 6 | 0] | 0 | 0)) : 0) {
+ i5 = i5 + (i7 + -1 << 4) + 16 | 0;
+ } else {
+ i5 = 5192;
+ }
+ } else {
+ i5 = (HEAP32[i6 >> 2] | 0) + (i7 << 4) | 0;
+ i5 = i5 >>> 0 < (HEAP32[i1 + 8 >> 2] | 0) >>> 0 ? i5 : 5192;
+ }
+ } while (0);
+ i6 = i1 + 8 | 0;
+ i7 = HEAP32[i6 >> 2] | 0;
+ if ((HEAP32[i7 + -8 >> 2] | 0) == 0) {
+ i7 = 0;
+ } else {
+ i7 = HEAP32[i7 + -16 >> 2] | 0;
+ }
+ i8 = HEAP32[i5 + 8 >> 2] & 15;
+ if ((i8 | 0) == 5) {
+ HEAP32[(HEAP32[i5 >> 2] | 0) + 8 >> 2] = i7;
+ if ((i7 | 0) == 0) {
+ i8 = HEAP32[i6 >> 2] | 0;
+ i8 = i8 + -16 | 0;
+ HEAP32[i6 >> 2] = i8;
+ STACKTOP = i4;
+ return 1;
+ }
+ if (!((HEAP8[i7 + 5 | 0] & 3) == 0) ? (i2 = HEAP32[i5 >> 2] | 0, !((HEAP8[i2 + 5 | 0] & 4) == 0)) : 0) {
+ _luaC_barrierback_(i1, i2);
+ }
+ _luaC_checkfinalizer(i1, HEAP32[i5 >> 2] | 0, i7);
+ i8 = HEAP32[i6 >> 2] | 0;
+ i8 = i8 + -16 | 0;
+ HEAP32[i6 >> 2] = i8;
+ STACKTOP = i4;
+ return 1;
+ } else if ((i8 | 0) == 7) {
+ HEAP32[(HEAP32[i5 >> 2] | 0) + 8 >> 2] = i7;
+ if ((i7 | 0) == 0) {
+ i8 = HEAP32[i6 >> 2] | 0;
+ i8 = i8 + -16 | 0;
+ HEAP32[i6 >> 2] = i8;
+ STACKTOP = i4;
+ return 1;
+ }
+ if (!((HEAP8[i7 + 5 | 0] & 3) == 0) ? (i3 = HEAP32[i5 >> 2] | 0, !((HEAP8[i3 + 5 | 0] & 4) == 0)) : 0) {
+ _luaC_barrier_(i1, i3, i7);
+ }
+ _luaC_checkfinalizer(i1, HEAP32[i5 >> 2] | 0, i7);
+ i8 = HEAP32[i6 >> 2] | 0;
+ i8 = i8 + -16 | 0;
+ HEAP32[i6 >> 2] = i8;
+ STACKTOP = i4;
+ return 1;
+ } else {
+ HEAP32[(HEAP32[i1 + 12 >> 2] | 0) + (i8 << 2) + 252 >> 2] = i7;
+ i8 = HEAP32[i6 >> 2] | 0;
+ i8 = i8 + -16 | 0;
+ HEAP32[i6 >> 2] = i8;
+ STACKTOP = i4;
+ return 1;
+ }
+ return 0;
+}
+function _recfield(i2, i10) {
+ i2 = i2 | 0;
+ i10 = i10 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 64 | 0;
+ i9 = i1 + 48 | 0;
+ i6 = i1 + 24 | 0;
+ i3 = i1;
+ i13 = i2 + 48 | 0;
+ i8 = HEAP32[i13 >> 2] | 0;
+ i5 = i8 + 48 | 0;
+ i4 = HEAP8[i5] | 0;
+ i7 = i2 + 16 | 0;
+ do {
+ if ((HEAP32[i7 >> 2] | 0) != 288) {
+ _luaX_next(i2);
+ _subexpr(i2, i6, 0) | 0;
+ _luaK_exp2val(HEAP32[i13 >> 2] | 0, i6);
+ if ((HEAP32[i7 >> 2] | 0) == 93) {
+ _luaX_next(i2);
+ i11 = i10 + 28 | 0;
+ break;
+ } else {
+ _error_expected(i2, 93);
+ }
+ } else {
+ i12 = i10 + 28 | 0;
+ if ((HEAP32[i12 >> 2] | 0) <= 2147483645) {
+ i11 = HEAP32[i2 + 24 >> 2] | 0;
+ _luaX_next(i2);
+ i11 = _luaK_stringK(HEAP32[i13 >> 2] | 0, i11) | 0;
+ HEAP32[i6 + 16 >> 2] = -1;
+ HEAP32[i6 + 20 >> 2] = -1;
+ HEAP32[i6 >> 2] = 4;
+ HEAP32[i6 + 8 >> 2] = i11;
+ i11 = i12;
+ break;
+ }
+ i14 = i8 + 12 | 0;
+ i13 = HEAP32[(HEAP32[i14 >> 2] | 0) + 52 >> 2] | 0;
+ i12 = HEAP32[(HEAP32[i8 >> 2] | 0) + 64 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ i16 = 6552;
+ HEAP32[i9 >> 2] = 6528;
+ i15 = i9 + 4 | 0;
+ HEAP32[i15 >> 2] = 2147483645;
+ i15 = i9 + 8 | 0;
+ HEAP32[i15 >> 2] = i16;
+ i15 = _luaO_pushfstring(i13, 6592, i9) | 0;
+ i16 = HEAP32[i14 >> 2] | 0;
+ _luaX_syntaxerror(i16, i15);
+ }
+ HEAP32[i9 >> 2] = i12;
+ i15 = _luaO_pushfstring(i13, 6568, i9) | 0;
+ HEAP32[i9 >> 2] = 6528;
+ i16 = i9 + 4 | 0;
+ HEAP32[i16 >> 2] = 2147483645;
+ i16 = i9 + 8 | 0;
+ HEAP32[i16 >> 2] = i15;
+ i16 = _luaO_pushfstring(i13, 6592, i9) | 0;
+ i15 = HEAP32[i14 >> 2] | 0;
+ _luaX_syntaxerror(i15, i16);
+ }
+ } while (0);
+ HEAP32[i11 >> 2] = (HEAP32[i11 >> 2] | 0) + 1;
+ if ((HEAP32[i7 >> 2] | 0) == 61) {
+ _luaX_next(i2);
+ i16 = _luaK_exp2RK(i8, i6) | 0;
+ _subexpr(i2, i3, 0) | 0;
+ i15 = HEAP32[(HEAP32[i10 + 24 >> 2] | 0) + 8 >> 2] | 0;
+ _luaK_codeABC(i8, 10, i15, i16, _luaK_exp2RK(i8, i3) | 0) | 0;
+ HEAP8[i5] = i4;
+ STACKTOP = i1;
+ return;
+ } else {
+ _error_expected(i2, 61);
+ }
+}
+function _lua_newstate(i3, i6) {
+ i3 = i3 | 0;
+ i6 = i6 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i5 = 0, i7 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 32 | 0;
+ i5 = i1 + 8 | 0;
+ i4 = i1;
+ i2 = FUNCTION_TABLE_iiiii[i3 & 3](i6, 0, 8, 400) | 0;
+ if ((i2 | 0) == 0) {
+ i6 = 0;
+ STACKTOP = i1;
+ return i6 | 0;
+ }
+ i7 = i2 + 112 | 0;
+ HEAP32[i2 >> 2] = 0;
+ HEAP8[i2 + 4 | 0] = 8;
+ HEAP8[i2 + 172 | 0] = 33;
+ HEAP8[i2 + 5 | 0] = 1;
+ HEAP8[i2 + 174 | 0] = 0;
+ HEAP32[i2 + 12 >> 2] = i7;
+ HEAP32[i2 + 28 >> 2] = 0;
+ HEAP32[i2 + 16 >> 2] = 0;
+ HEAP32[i2 + 32 >> 2] = 0;
+ HEAP32[i2 + 64 >> 2] = 0;
+ HEAP16[i2 + 38 >> 1] = 0;
+ HEAP32[i2 + 52 >> 2] = 0;
+ HEAP8[i2 + 40 | 0] = 0;
+ HEAP32[i2 + 44 >> 2] = 0;
+ HEAP8[i2 + 41 | 0] = 1;
+ HEAP32[i2 + 48 >> 2] = 0;
+ HEAP32[i2 + 56 >> 2] = 0;
+ HEAP16[i2 + 36 >> 1] = 1;
+ HEAP8[i2 + 6 | 0] = 0;
+ HEAP32[i2 + 68 >> 2] = 0;
+ HEAP32[i7 >> 2] = i3;
+ HEAP32[i2 + 116 >> 2] = i6;
+ HEAP32[i2 + 284 >> 2] = i2;
+ i3 = _time(0) | 0;
+ HEAP32[i4 >> 2] = i3;
+ HEAP32[i5 >> 2] = i2;
+ HEAP32[i5 + 4 >> 2] = i4;
+ HEAP32[i5 + 8 >> 2] = 5192;
+ HEAP32[i5 + 12 >> 2] = 1;
+ HEAP32[i2 + 168 >> 2] = _luaS_hash(i5, 16, i3) | 0;
+ i4 = i2 + 224 | 0;
+ HEAP32[i2 + 240 >> 2] = i4;
+ HEAP32[i2 + 244 >> 2] = i4;
+ HEAP8[i2 + 175 | 0] = 0;
+ i4 = i2 + 132 | 0;
+ HEAP32[i2 + 160 >> 2] = 0;
+ HEAP32[i2 + 256 >> 2] = 0;
+ HEAP32[i2 + 264 >> 2] = 0;
+ HEAP32[i2 + 280 >> 2] = 0;
+ HEAP32[i4 + 0 >> 2] = 0;
+ HEAP32[i4 + 4 >> 2] = 0;
+ HEAP32[i4 + 8 >> 2] = 0;
+ HEAP32[i4 + 12 >> 2] = 0;
+ HEAP32[i2 + 288 >> 2] = _lua_version(0) | 0;
+ HEAP8[i2 + 173 | 0] = 5;
+ i4 = i2 + 120 | 0;
+ i5 = i2 + 180 | 0;
+ i3 = i5 + 40 | 0;
+ do {
+ HEAP32[i5 >> 2] = 0;
+ i5 = i5 + 4 | 0;
+ } while ((i5 | 0) < (i3 | 0));
+ HEAP32[i4 >> 2] = 400;
+ HEAP32[i2 + 124 >> 2] = 0;
+ HEAP32[i2 + 268 >> 2] = 200;
+ HEAP32[i2 + 272 >> 2] = 200;
+ HEAP32[i2 + 276 >> 2] = 200;
+ i5 = i2 + 364 | 0;
+ i3 = i5 + 36 | 0;
+ do {
+ HEAP32[i5 >> 2] = 0;
+ i5 = i5 + 4 | 0;
+ } while ((i5 | 0) < (i3 | 0));
+ if ((_luaD_rawrunprotected(i2, 8, 0) | 0) == 0) {
+ i7 = i2;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ _close_state(i2);
+ i7 = 0;
+ STACKTOP = i1;
+ return i7 | 0;
+}
+function _luaU_undump(i1, i7, i8, i9) {
+ i1 = i1 | 0;
+ i7 = i7 | 0;
+ i8 = i8 | 0;
+ i9 = i9 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 64 | 0;
+ i4 = i2 + 16 | 0;
+ i5 = i2 + 34 | 0;
+ i3 = i2;
+ i6 = HEAP8[i9] | 0;
+ if (i6 << 24 >> 24 == 27) {
+ HEAP32[i3 + 12 >> 2] = 8800;
+ } else if (i6 << 24 >> 24 == 61 | i6 << 24 >> 24 == 64) {
+ HEAP32[i3 + 12 >> 2] = i9 + 1;
+ } else {
+ HEAP32[i3 + 12 >> 2] = i9;
+ }
+ HEAP32[i3 >> 2] = i1;
+ HEAP32[i3 + 4 >> 2] = i7;
+ HEAP32[i3 + 8 >> 2] = i8;
+ HEAP32[i4 >> 2] = 1635077147;
+ HEAP8[i4 + 4 | 0] = 82;
+ HEAP8[i4 + 5 | 0] = 0;
+ HEAP8[i4 + 6 | 0] = 1;
+ HEAP8[i4 + 7 | 0] = 4;
+ HEAP8[i4 + 8 | 0] = 4;
+ HEAP8[i4 + 9 | 0] = 4;
+ HEAP8[i4 + 10 | 0] = 8;
+ i9 = i4 + 12 | 0;
+ HEAP8[i4 + 11 | 0] = 0;
+ HEAP8[i9 + 0 | 0] = HEAP8[8816 | 0] | 0;
+ HEAP8[i9 + 1 | 0] = HEAP8[8817 | 0] | 0;
+ HEAP8[i9 + 2 | 0] = HEAP8[8818 | 0] | 0;
+ HEAP8[i9 + 3 | 0] = HEAP8[8819 | 0] | 0;
+ HEAP8[i9 + 4 | 0] = HEAP8[8820 | 0] | 0;
+ HEAP8[i9 + 5 | 0] = HEAP8[8821 | 0] | 0;
+ HEAP8[i5] = 27;
+ if ((_luaZ_read(i7, i5 + 1 | 0, 17) | 0) != 0) {
+ _error(i3, 8824);
+ }
+ if ((_memcmp(i4, i5, 18) | 0) == 0) {
+ i4 = _luaF_newLclosure(i1, 1) | 0;
+ i5 = i1 + 8 | 0;
+ i9 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i9 >> 2] = i4;
+ HEAP32[i9 + 8 >> 2] = 70;
+ i9 = (HEAP32[i5 >> 2] | 0) + 16 | 0;
+ HEAP32[i5 >> 2] = i9;
+ if (((HEAP32[i1 + 24 >> 2] | 0) - i9 | 0) < 16) {
+ _luaD_growstack(i1, 0);
+ }
+ i9 = _luaF_newproto(i1) | 0;
+ i6 = i4 + 12 | 0;
+ HEAP32[i6 >> 2] = i9;
+ _LoadFunction(i3, i9);
+ i6 = HEAP32[i6 >> 2] | 0;
+ i3 = HEAP32[i6 + 40 >> 2] | 0;
+ if ((i3 | 0) == 1) {
+ i9 = i4;
+ STACKTOP = i2;
+ return i9 | 0;
+ }
+ i9 = _luaF_newLclosure(i1, i3) | 0;
+ HEAP32[i9 + 12 >> 2] = i6;
+ i8 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i8 + -16 >> 2] = i9;
+ HEAP32[i8 + -8 >> 2] = 70;
+ STACKTOP = i2;
+ return i9 | 0;
+ }
+ if ((_memcmp(i4, i5, 4) | 0) != 0) {
+ _error(i3, 8888);
+ }
+ if ((_memcmp(i4, i5, 6) | 0) != 0) {
+ _error(i3, 8896);
+ }
+ if ((_memcmp(i4, i5, 12) | 0) == 0) {
+ _error(i3, 8872);
+ } else {
+ _error(i3, 8920);
+ }
+ return 0;
+}
+function _lua_compare(i2, i7, i5, i3) {
+ i2 = i2 | 0;
+ i7 = i7 | 0;
+ i5 = i5 | 0;
+ i3 = i3 | 0;
+ var i1 = 0, i4 = 0, i6 = 0, i8 = 0;
+ i1 = STACKTOP;
+ i4 = HEAP32[i2 + 16 >> 2] | 0;
+ do {
+ if ((i7 | 0) <= 0) {
+ if (!((i7 | 0) < -1000999)) {
+ i6 = (HEAP32[i2 + 8 >> 2] | 0) + (i7 << 4) | 0;
+ break;
+ }
+ if ((i7 | 0) == -1001e3) {
+ i6 = (HEAP32[i2 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i7 = -1001e3 - i7 | 0;
+ i8 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP32[i8 + 8 >> 2] | 0) != 22 ? (i6 = HEAP32[i8 >> 2] | 0, (i7 | 0) <= (HEAPU8[i6 + 6 | 0] | 0 | 0)) : 0) {
+ i6 = i6 + (i7 + -1 << 4) + 16 | 0;
+ } else {
+ i6 = 5192;
+ }
+ } else {
+ i6 = (HEAP32[i4 >> 2] | 0) + (i7 << 4) | 0;
+ i6 = i6 >>> 0 < (HEAP32[i2 + 8 >> 2] | 0) >>> 0 ? i6 : 5192;
+ }
+ } while (0);
+ do {
+ if ((i5 | 0) <= 0) {
+ if (!((i5 | 0) < -1000999)) {
+ i4 = (HEAP32[i2 + 8 >> 2] | 0) + (i5 << 4) | 0;
+ break;
+ }
+ if ((i5 | 0) == -1001e3) {
+ i4 = (HEAP32[i2 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i5 = -1001e3 - i5 | 0;
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP32[i4 + 8 >> 2] | 0) == 22) {
+ i8 = 0;
+ STACKTOP = i1;
+ return i8 | 0;
+ }
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((i5 | 0) > (HEAPU8[i4 + 6 | 0] | 0 | 0)) {
+ i8 = 0;
+ STACKTOP = i1;
+ return i8 | 0;
+ } else {
+ i4 = i4 + (i5 + -1 << 4) + 16 | 0;
+ break;
+ }
+ } else {
+ i4 = (HEAP32[i4 >> 2] | 0) + (i5 << 4) | 0;
+ i4 = i4 >>> 0 < (HEAP32[i2 + 8 >> 2] | 0) >>> 0 ? i4 : 5192;
+ }
+ } while (0);
+ if ((i6 | 0) == 5192 | (i4 | 0) == 5192) {
+ i8 = 0;
+ STACKTOP = i1;
+ return i8 | 0;
+ }
+ if ((i3 | 0) == 1) {
+ i8 = _luaV_lessthan(i2, i6, i4) | 0;
+ STACKTOP = i1;
+ return i8 | 0;
+ } else if ((i3 | 0) == 2) {
+ i8 = _luaV_lessequal(i2, i6, i4) | 0;
+ STACKTOP = i1;
+ return i8 | 0;
+ } else if ((i3 | 0) == 0) {
+ if ((HEAP32[i6 + 8 >> 2] | 0) == (HEAP32[i4 + 8 >> 2] | 0)) {
+ i2 = (_luaV_equalobj_(i2, i6, i4) | 0) != 0;
+ } else {
+ i2 = 0;
+ }
+ i8 = i2 & 1;
+ STACKTOP = i1;
+ return i8 | 0;
+ } else {
+ i8 = 0;
+ STACKTOP = i1;
+ return i8 | 0;
+ }
+ return 0;
+}
+function _lexerror(i7, i3, i8) {
+ i7 = i7 | 0;
+ i3 = i3 | 0;
+ i8 = i8 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i5 = 0, i6 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0;
+ i12 = STACKTOP;
+ STACKTOP = STACKTOP + 80 | 0;
+ i2 = i12;
+ i12 = i12 + 12 | 0;
+ _luaO_chunkid(i12, (HEAP32[i7 + 68 >> 2] | 0) + 16 | 0, 60);
+ i1 = i7 + 52 | 0;
+ i4 = HEAP32[i1 >> 2] | 0;
+ i13 = HEAP32[i7 + 4 >> 2] | 0;
+ HEAP32[i2 >> 2] = i12;
+ HEAP32[i2 + 4 >> 2] = i13;
+ HEAP32[i2 + 8 >> 2] = i3;
+ i4 = _luaO_pushfstring(i4, 12592, i2) | 0;
+ if ((i8 | 0) == 0) {
+ i13 = HEAP32[i1 >> 2] | 0;
+ _luaD_throw(i13, 3);
+ }
+ i3 = HEAP32[i1 >> 2] | 0;
+ do {
+ if (!((i8 + -287 | 0) >>> 0 < 3)) {
+ if ((i8 | 0) >= 257) {
+ i5 = HEAP32[12096 + (i8 + -257 << 2) >> 2] | 0;
+ if ((i8 | 0) >= 286) {
+ break;
+ }
+ HEAP32[i2 >> 2] = i5;
+ i5 = _luaO_pushfstring(i3, 12256, i2) | 0;
+ break;
+ }
+ if ((HEAP8[i8 + 10913 | 0] & 4) == 0) {
+ HEAP32[i2 >> 2] = i8;
+ i5 = _luaO_pushfstring(i3, 12240, i2) | 0;
+ break;
+ } else {
+ HEAP32[i2 >> 2] = i8;
+ i5 = _luaO_pushfstring(i3, 12232, i2) | 0;
+ break;
+ }
+ } else {
+ i11 = i7 + 60 | 0;
+ i12 = HEAP32[i11 >> 2] | 0;
+ i10 = i12 + 4 | 0;
+ i13 = HEAP32[i10 >> 2] | 0;
+ i8 = i12 + 8 | 0;
+ i9 = HEAP32[i8 >> 2] | 0;
+ do {
+ if ((i13 + 1 | 0) >>> 0 > i9 >>> 0) {
+ if (i9 >>> 0 > 2147483645) {
+ _lexerror(i7, 12368, 0);
+ }
+ i7 = i9 << 1;
+ if ((i7 | 0) == -2) {
+ _luaM_toobig(i3);
+ } else {
+ i6 = _luaM_realloc_(i3, HEAP32[i12 >> 2] | 0, i9, i7) | 0;
+ HEAP32[i12 >> 2] = i6;
+ HEAP32[i8 >> 2] = i7;
+ i5 = HEAP32[i10 >> 2] | 0;
+ break;
+ }
+ } else {
+ i5 = i13;
+ i6 = HEAP32[i12 >> 2] | 0;
+ }
+ } while (0);
+ HEAP32[i10 >> 2] = i5 + 1;
+ HEAP8[i6 + i5 | 0] = 0;
+ i5 = HEAP32[i1 >> 2] | 0;
+ HEAP32[i2 >> 2] = HEAP32[HEAP32[i11 >> 2] >> 2];
+ i5 = _luaO_pushfstring(i5, 12256, i2) | 0;
+ }
+ } while (0);
+ HEAP32[i2 >> 2] = i4;
+ HEAP32[i2 + 4 >> 2] = i5;
+ _luaO_pushfstring(i3, 12608, i2) | 0;
+ i13 = HEAP32[i1 >> 2] | 0;
+ _luaD_throw(i13, 3);
+}
+function _luaV_objlen(i2, i5, i1) {
+ i2 = i2 | 0;
+ i5 = i5 | 0;
+ i1 = i1 | 0;
+ var i3 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0;
+ i3 = STACKTOP;
+ i4 = i1 + 8 | 0;
+ i8 = HEAP32[i4 >> 2] & 15;
+ do {
+ if ((i8 | 0) == 5) {
+ i7 = HEAP32[i1 >> 2] | 0;
+ i8 = HEAP32[i7 + 8 >> 2] | 0;
+ if (((i8 | 0) != 0 ? (HEAP8[i8 + 6 | 0] & 16) == 0 : 0) ? (i6 = _luaT_gettm(i8, 4, HEAP32[(HEAP32[i2 + 12 >> 2] | 0) + 200 >> 2] | 0) | 0, (i6 | 0) != 0) : 0) {
+ i7 = i6;
+ break;
+ }
+ HEAPF64[i5 >> 3] = +(_luaH_getn(i7) | 0);
+ HEAP32[i5 + 8 >> 2] = 3;
+ STACKTOP = i3;
+ return;
+ } else if ((i8 | 0) != 4) {
+ i6 = _luaT_gettmbyobj(i2, i1, 4) | 0;
+ if ((HEAP32[i6 + 8 >> 2] | 0) == 0) {
+ _luaG_typeerror(i2, i1, 9024);
+ } else {
+ i7 = i6;
+ }
+ } else {
+ HEAPF64[i5 >> 3] = +((HEAP32[(HEAP32[i1 >> 2] | 0) + 12 >> 2] | 0) >>> 0);
+ HEAP32[i5 + 8 >> 2] = 3;
+ STACKTOP = i3;
+ return;
+ }
+ } while (0);
+ i6 = i2 + 28 | 0;
+ i8 = i5 - (HEAP32[i6 >> 2] | 0) | 0;
+ i5 = i2 + 8 | 0;
+ i11 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = i11 + 16;
+ i12 = i7;
+ i10 = HEAP32[i12 + 4 >> 2] | 0;
+ i9 = i11;
+ HEAP32[i9 >> 2] = HEAP32[i12 >> 2];
+ HEAP32[i9 + 4 >> 2] = i10;
+ HEAP32[i11 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ i7 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = i7 + 16;
+ i11 = i1;
+ i9 = HEAP32[i11 + 4 >> 2] | 0;
+ i10 = i7;
+ HEAP32[i10 >> 2] = HEAP32[i11 >> 2];
+ HEAP32[i10 + 4 >> 2] = i9;
+ HEAP32[i7 + 8 >> 2] = HEAP32[i4 >> 2];
+ i7 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = i7 + 16;
+ i10 = i1;
+ i9 = HEAP32[i10 + 4 >> 2] | 0;
+ i1 = i7;
+ HEAP32[i1 >> 2] = HEAP32[i10 >> 2];
+ HEAP32[i1 + 4 >> 2] = i9;
+ HEAP32[i7 + 8 >> 2] = HEAP32[i4 >> 2];
+ _luaD_call(i2, (HEAP32[i5 >> 2] | 0) + -48 | 0, 1, HEAP8[(HEAP32[i2 + 16 >> 2] | 0) + 18 | 0] & 1);
+ i7 = HEAP32[i6 >> 2] | 0;
+ i6 = HEAP32[i5 >> 2] | 0;
+ i2 = i6 + -16 | 0;
+ HEAP32[i5 >> 2] = i2;
+ i4 = HEAP32[i2 + 4 >> 2] | 0;
+ i5 = i7 + i8 | 0;
+ HEAP32[i5 >> 2] = HEAP32[i2 >> 2];
+ HEAP32[i5 + 4 >> 2] = i4;
+ HEAP32[i7 + (i8 + 8) >> 2] = HEAP32[i6 + -8 >> 2];
+ STACKTOP = i3;
+ return;
+}
+function _get_equalTM(i6, i5, i4) {
+ i6 = i6 | 0;
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i7 = 0;
+ i1 = STACKTOP;
+ L1 : do {
+ if (((i5 | 0) != 0 ? (HEAP8[i5 + 6 | 0] & 32) == 0 : 0) ? (i7 = i6 + 12 | 0, i2 = _luaT_gettm(i5, 5, HEAP32[(HEAP32[i7 >> 2] | 0) + 204 >> 2] | 0) | 0, (i2 | 0) != 0) : 0) {
+ if ((i5 | 0) != (i4 | 0)) {
+ if (((i4 | 0) != 0 ? (HEAP8[i4 + 6 | 0] & 32) == 0 : 0) ? (i3 = _luaT_gettm(i4, 5, HEAP32[(HEAP32[i7 >> 2] | 0) + 204 >> 2] | 0) | 0, (i3 | 0) != 0) : 0) {
+ i4 = HEAP32[i2 + 8 >> 2] | 0;
+ L9 : do {
+ if ((i4 | 0) == (HEAP32[i3 + 8 >> 2] | 0)) {
+ switch (i4 & 63 | 0) {
+ case 3:
+ {
+ i3 = +HEAPF64[i2 >> 3] == +HEAPF64[i3 >> 3] | 0;
+ break;
+ }
+ case 22:
+ {
+ i3 = (HEAP32[i2 >> 2] | 0) == (HEAP32[i3 >> 2] | 0) | 0;
+ break;
+ }
+ case 5:
+ {
+ if ((HEAP32[i2 >> 2] | 0) == (HEAP32[i3 >> 2] | 0)) {
+ break L1;
+ } else {
+ break L9;
+ }
+ }
+ case 1:
+ {
+ i3 = (HEAP32[i2 >> 2] | 0) == (HEAP32[i3 >> 2] | 0) | 0;
+ break;
+ }
+ case 4:
+ {
+ i3 = (HEAP32[i2 >> 2] | 0) == (HEAP32[i3 >> 2] | 0) | 0;
+ break;
+ }
+ case 0:
+ {
+ break L1;
+ }
+ case 7:
+ {
+ if ((HEAP32[i2 >> 2] | 0) == (HEAP32[i3 >> 2] | 0)) {
+ break L1;
+ } else {
+ break L9;
+ }
+ }
+ case 2:
+ {
+ i3 = (HEAP32[i2 >> 2] | 0) == (HEAP32[i3 >> 2] | 0) | 0;
+ break;
+ }
+ case 20:
+ {
+ i3 = _luaS_eqlngstr(HEAP32[i2 >> 2] | 0, HEAP32[i3 >> 2] | 0) | 0;
+ break;
+ }
+ default:
+ {
+ i3 = (HEAP32[i2 >> 2] | 0) == (HEAP32[i3 >> 2] | 0) | 0;
+ }
+ }
+ if ((i3 | 0) != 0) {
+ break L1;
+ }
+ }
+ } while (0);
+ i2 = 0;
+ } else {
+ i2 = 0;
+ }
+ }
+ } else {
+ i2 = 0;
+ }
+ } while (0);
+ STACKTOP = i1;
+ return i2 | 0;
+}
+function _luaS_newlstr(i2, i4, i3) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ var i1 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0;
+ i1 = STACKTOP;
+ if (!(i3 >>> 0 < 41)) {
+ if ((i3 + 1 | 0) >>> 0 > 4294967277) {
+ _luaM_toobig(i2);
+ }
+ i10 = HEAP32[(HEAP32[i2 + 12 >> 2] | 0) + 56 >> 2] | 0;
+ i11 = _luaC_newobj(i2, 20, i3 + 17 | 0, 0, 0) | 0;
+ HEAP32[i11 + 12 >> 2] = i3;
+ HEAP32[i11 + 8 >> 2] = i10;
+ HEAP8[i11 + 6 | 0] = 0;
+ i10 = i11 + 16 | 0;
+ _memcpy(i10 | 0, i4 | 0, i3 | 0) | 0;
+ HEAP8[i10 + i3 | 0] = 0;
+ STACKTOP = i1;
+ return i11 | 0;
+ }
+ i5 = HEAP32[i2 + 12 >> 2] | 0;
+ i6 = HEAP32[i5 + 56 >> 2] ^ i3;
+ i7 = (i3 >>> 5) + 1 | 0;
+ if (!(i7 >>> 0 > i3 >>> 0)) {
+ i8 = i3;
+ do {
+ i6 = (i6 << 5) + (i6 >>> 2) + (HEAPU8[i4 + (i8 + -1) | 0] | 0) ^ i6;
+ i8 = i8 - i7 | 0;
+ } while (!(i8 >>> 0 < i7 >>> 0));
+ }
+ i10 = i5 + 32 | 0;
+ i9 = HEAP32[i10 >> 2] | 0;
+ i7 = i5 + 24 | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ i11 = HEAP32[i8 + ((i9 + -1 & i6) << 2) >> 2] | 0;
+ L12 : do {
+ if ((i11 | 0) != 0) {
+ while (1) {
+ if (((i6 | 0) == (HEAP32[i11 + 8 >> 2] | 0) ? (HEAP32[i11 + 12 >> 2] | 0) == (i3 | 0) : 0) ? (_memcmp(i4, i11 + 16 | 0, i3) | 0) == 0 : 0) {
+ break;
+ }
+ i11 = HEAP32[i11 >> 2] | 0;
+ if ((i11 | 0) == 0) {
+ break L12;
+ }
+ }
+ i2 = i11 + 5 | 0;
+ i3 = (HEAPU8[i2] | 0) ^ 3;
+ if ((((HEAPU8[i5 + 60 | 0] | 0) ^ 3) & i3 | 0) != 0) {
+ STACKTOP = i1;
+ return i11 | 0;
+ }
+ HEAP8[i2] = i3;
+ STACKTOP = i1;
+ return i11 | 0;
+ }
+ } while (0);
+ i5 = i5 + 28 | 0;
+ if ((HEAP32[i5 >> 2] | 0) >>> 0 >= i9 >>> 0 & (i9 | 0) < 1073741823) {
+ _luaS_resize(i2, i9 << 1);
+ i9 = HEAP32[i10 >> 2] | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ }
+ i11 = _luaC_newobj(i2, 4, i3 + 17 | 0, i8 + ((i9 + -1 & i6) << 2) | 0, 0) | 0;
+ HEAP32[i11 + 12 >> 2] = i3;
+ HEAP32[i11 + 8 >> 2] = i6;
+ HEAP8[i11 + 6 | 0] = 0;
+ i10 = i11 + 16 | 0;
+ _memcpy(i10 | 0, i4 | 0, i3 | 0) | 0;
+ HEAP8[i10 + i3 | 0] = 0;
+ HEAP32[i5 >> 2] = (HEAP32[i5 >> 2] | 0) + 1;
+ STACKTOP = i1;
+ return i11 | 0;
+}
+function _lua_pcallk(i3, i7, i2, i9, i6, i5) {
+ i3 = i3 | 0;
+ i7 = i7 | 0;
+ i2 = i2 | 0;
+ i9 = i9 | 0;
+ i6 = i6 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i4 = 0, i8 = 0, i10 = 0, i11 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i1;
+ if ((i9 | 0) == 0) {
+ i9 = 0;
+ } else {
+ i10 = HEAP32[i3 + 16 >> 2] | 0;
+ do {
+ if ((i9 | 0) <= 0) {
+ if (!((i9 | 0) < -1000999)) {
+ i8 = (HEAP32[i3 + 8 >> 2] | 0) + (i9 << 4) | 0;
+ break;
+ }
+ if ((i9 | 0) == -1001e3) {
+ i8 = (HEAP32[i3 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i9 = -1001e3 - i9 | 0;
+ i10 = HEAP32[i10 >> 2] | 0;
+ if ((HEAP32[i10 + 8 >> 2] | 0) != 22 ? (i8 = HEAP32[i10 >> 2] | 0, (i9 | 0) <= (HEAPU8[i8 + 6 | 0] | 0)) : 0) {
+ i8 = i8 + (i9 + -1 << 4) + 16 | 0;
+ } else {
+ i8 = 5192;
+ }
+ } else {
+ i8 = (HEAP32[i10 >> 2] | 0) + (i9 << 4) | 0;
+ i8 = i8 >>> 0 < (HEAP32[i3 + 8 >> 2] | 0) >>> 0 ? i8 : 5192;
+ }
+ } while (0);
+ i9 = i8 - (HEAP32[i3 + 28 >> 2] | 0) | 0;
+ }
+ i8 = i3 + 8 | 0;
+ i7 = (HEAP32[i8 >> 2] | 0) + (~i7 << 4) | 0;
+ HEAP32[i4 >> 2] = i7;
+ if ((i5 | 0) != 0 ? (HEAP16[i3 + 36 >> 1] | 0) == 0 : 0) {
+ i11 = HEAP32[i3 + 16 >> 2] | 0;
+ HEAP32[i11 + 28 >> 2] = i5;
+ HEAP32[i11 + 24 >> 2] = i6;
+ HEAP32[i11 + 20 >> 2] = (HEAP32[i4 >> 2] | 0) - (HEAP32[i3 + 28 >> 2] | 0);
+ HEAP8[i11 + 36 | 0] = HEAP8[i3 + 41 | 0] | 0;
+ i10 = i3 + 68 | 0;
+ i7 = i11 + 32 | 0;
+ HEAP32[i7 >> 2] = HEAP32[i10 >> 2];
+ HEAP32[i10 >> 2] = i9;
+ i9 = i11 + 18 | 0;
+ HEAP8[i9] = HEAPU8[i9] | 16;
+ _luaD_call(i3, HEAP32[i4 >> 2] | 0, i2, 1);
+ HEAP8[i9] = HEAP8[i9] & 239;
+ HEAP32[i10 >> 2] = HEAP32[i7 >> 2];
+ i4 = 0;
+ } else {
+ HEAP32[i4 + 4 >> 2] = i2;
+ i4 = _luaD_pcall(i3, 3, i4, i7 - (HEAP32[i3 + 28 >> 2] | 0) | 0, i9) | 0;
+ }
+ if (!((i2 | 0) == -1)) {
+ STACKTOP = i1;
+ return i4 | 0;
+ }
+ i2 = (HEAP32[i3 + 16 >> 2] | 0) + 4 | 0;
+ i3 = HEAP32[i8 >> 2] | 0;
+ if (!((HEAP32[i2 >> 2] | 0) >>> 0 < i3 >>> 0)) {
+ STACKTOP = i1;
+ return i4 | 0;
+ }
+ HEAP32[i2 >> 2] = i3;
+ STACKTOP = i1;
+ return i4 | 0;
+}
+function _lua_getupvalue(i1, i6, i3) {
+ i1 = i1 | 0;
+ i6 = i6 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0, i5 = 0, i7 = 0, i8 = 0;
+ i2 = STACKTOP;
+ i5 = HEAP32[i1 + 16 >> 2] | 0;
+ do {
+ if ((i6 | 0) <= 0) {
+ if (!((i6 | 0) < -1000999)) {
+ i4 = (HEAP32[i1 + 8 >> 2] | 0) + (i6 << 4) | 0;
+ break;
+ }
+ if ((i6 | 0) == -1001e3) {
+ i4 = (HEAP32[i1 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i6 = -1001e3 - i6 | 0;
+ i5 = HEAP32[i5 >> 2] | 0;
+ if ((HEAP32[i5 + 8 >> 2] | 0) != 22 ? (i4 = HEAP32[i5 >> 2] | 0, (i6 | 0) <= (HEAPU8[i4 + 6 | 0] | 0 | 0)) : 0) {
+ i4 = i4 + (i6 + -1 << 4) + 16 | 0;
+ } else {
+ i4 = 5192;
+ }
+ } else {
+ i4 = (HEAP32[i5 >> 2] | 0) + (i6 << 4) | 0;
+ i4 = i4 >>> 0 < (HEAP32[i1 + 8 >> 2] | 0) >>> 0 ? i4 : 5192;
+ }
+ } while (0);
+ i5 = HEAP32[i4 + 8 >> 2] & 63;
+ do {
+ if ((i5 | 0) == 38) {
+ i5 = HEAP32[i4 >> 2] | 0;
+ if ((i3 | 0) <= 0) {
+ i6 = 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ if ((HEAPU8[i5 + 6 | 0] | 0 | 0) < (i3 | 0)) {
+ i6 = 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ } else {
+ i4 = 936;
+ i3 = i5 + (i3 + -1 << 4) + 16 | 0;
+ break;
+ }
+ } else if ((i5 | 0) == 6) {
+ i5 = HEAP32[i4 >> 2] | 0;
+ i4 = HEAP32[i5 + 12 >> 2] | 0;
+ if ((i3 | 0) <= 0) {
+ i6 = 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ if ((HEAP32[i4 + 40 >> 2] | 0) < (i3 | 0)) {
+ i6 = 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ i6 = i3 + -1 | 0;
+ i3 = HEAP32[(HEAP32[i5 + 16 + (i6 << 2) >> 2] | 0) + 8 >> 2] | 0;
+ i4 = HEAP32[(HEAP32[i4 + 28 >> 2] | 0) + (i6 << 3) >> 2] | 0;
+ if ((i4 | 0) == 0) {
+ i4 = 936;
+ } else {
+ i4 = i4 + 16 | 0;
+ }
+ } else {
+ i6 = 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ } while (0);
+ i6 = i1 + 8 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ i8 = i3;
+ i7 = HEAP32[i8 + 4 >> 2] | 0;
+ i1 = i5;
+ HEAP32[i1 >> 2] = HEAP32[i8 >> 2];
+ HEAP32[i1 + 4 >> 2] = i7;
+ HEAP32[i5 + 8 >> 2] = HEAP32[i3 + 8 >> 2];
+ HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + 16;
+ i6 = i4;
+ STACKTOP = i2;
+ return i6 | 0;
+}
+function _lua_copy(i1, i8, i4) {
+ i1 = i1 | 0;
+ i8 = i8 | 0;
+ i4 = i4 | 0;
+ var i2 = 0, i3 = 0, i5 = 0, i6 = 0, i7 = 0, i9 = 0;
+ i2 = STACKTOP;
+ i3 = i1 + 16 | 0;
+ i6 = HEAP32[i3 >> 2] | 0;
+ do {
+ if ((i8 | 0) <= 0) {
+ if (!((i8 | 0) < -1000999)) {
+ i7 = (HEAP32[i1 + 8 >> 2] | 0) + (i8 << 4) | 0;
+ break;
+ }
+ if ((i8 | 0) == -1001e3) {
+ i7 = (HEAP32[i1 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i8 = -1001e3 - i8 | 0;
+ i9 = HEAP32[i6 >> 2] | 0;
+ if ((HEAP32[i9 + 8 >> 2] | 0) != 22 ? (i7 = HEAP32[i9 >> 2] | 0, (i8 | 0) <= (HEAPU8[i7 + 6 | 0] | 0 | 0)) : 0) {
+ i7 = i7 + (i8 + -1 << 4) + 16 | 0;
+ } else {
+ i7 = 5192;
+ }
+ } else {
+ i7 = (HEAP32[i6 >> 2] | 0) + (i8 << 4) | 0;
+ i7 = i7 >>> 0 < (HEAP32[i1 + 8 >> 2] | 0) >>> 0 ? i7 : 5192;
+ }
+ } while (0);
+ do {
+ if ((i4 | 0) <= 0) {
+ if (!((i4 | 0) < -1000999)) {
+ i5 = (HEAP32[i1 + 8 >> 2] | 0) + (i4 << 4) | 0;
+ break;
+ }
+ if ((i4 | 0) == -1001e3) {
+ i5 = (HEAP32[i1 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i8 = -1001e3 - i4 | 0;
+ i6 = HEAP32[i6 >> 2] | 0;
+ if ((HEAP32[i6 + 8 >> 2] | 0) != 22 ? (i5 = HEAP32[i6 >> 2] | 0, (i8 | 0) <= (HEAPU8[i5 + 6 | 0] | 0 | 0)) : 0) {
+ i5 = i5 + (i8 + -1 << 4) + 16 | 0;
+ } else {
+ i5 = 5192;
+ }
+ } else {
+ i5 = (HEAP32[i6 >> 2] | 0) + (i4 << 4) | 0;
+ i5 = i5 >>> 0 < (HEAP32[i1 + 8 >> 2] | 0) >>> 0 ? i5 : 5192;
+ }
+ } while (0);
+ i8 = i7;
+ i9 = HEAP32[i8 + 4 >> 2] | 0;
+ i6 = i5;
+ HEAP32[i6 >> 2] = HEAP32[i8 >> 2];
+ HEAP32[i6 + 4 >> 2] = i9;
+ i6 = i7 + 8 | 0;
+ HEAP32[i5 + 8 >> 2] = HEAP32[i6 >> 2];
+ if (!((i4 | 0) < -1001e3)) {
+ STACKTOP = i2;
+ return;
+ }
+ if ((HEAP32[i6 >> 2] & 64 | 0) == 0) {
+ STACKTOP = i2;
+ return;
+ }
+ i4 = HEAP32[i7 >> 2] | 0;
+ if ((HEAP8[i4 + 5 | 0] & 3) == 0) {
+ STACKTOP = i2;
+ return;
+ }
+ i3 = HEAP32[HEAP32[HEAP32[i3 >> 2] >> 2] >> 2] | 0;
+ if ((HEAP8[i3 + 5 | 0] & 4) == 0) {
+ STACKTOP = i2;
+ return;
+ }
+ _luaC_barrier_(i1, i3, i4);
+ STACKTOP = i2;
+ return;
+}
+function _lua_tolstring(i4, i5, i1) {
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0;
+ i2 = STACKTOP;
+ i7 = i4 + 16 | 0;
+ i10 = HEAP32[i7 >> 2] | 0;
+ i6 = (i5 | 0) > 0;
+ do {
+ if (!i6) {
+ if (!((i5 | 0) < -1000999)) {
+ i8 = (HEAP32[i4 + 8 >> 2] | 0) + (i5 << 4) | 0;
+ break;
+ }
+ if ((i5 | 0) == -1001e3) {
+ i8 = (HEAP32[i4 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i9 = -1001e3 - i5 | 0;
+ i10 = HEAP32[i10 >> 2] | 0;
+ if ((HEAP32[i10 + 8 >> 2] | 0) != 22 ? (i8 = HEAP32[i10 >> 2] | 0, (i9 | 0) <= (HEAPU8[i8 + 6 | 0] | 0 | 0)) : 0) {
+ i8 = i8 + (i9 + -1 << 4) + 16 | 0;
+ } else {
+ i8 = 5192;
+ }
+ } else {
+ i8 = (HEAP32[i10 >> 2] | 0) + (i5 << 4) | 0;
+ i8 = i8 >>> 0 < (HEAP32[i4 + 8 >> 2] | 0) >>> 0 ? i8 : 5192;
+ }
+ } while (0);
+ do {
+ if ((HEAP32[i8 + 8 >> 2] & 15 | 0) != 4) {
+ if ((_luaV_tostring(i4, i8) | 0) == 0) {
+ if ((i1 | 0) == 0) {
+ i10 = 0;
+ STACKTOP = i2;
+ return i10 | 0;
+ }
+ HEAP32[i1 >> 2] = 0;
+ i10 = 0;
+ STACKTOP = i2;
+ return i10 | 0;
+ }
+ i8 = i4 + 12 | 0;
+ if ((HEAP32[(HEAP32[i8 >> 2] | 0) + 12 >> 2] | 0) > 0) {
+ _luaC_step(i4);
+ }
+ i7 = HEAP32[i7 >> 2] | 0;
+ if (i6) {
+ i3 = (HEAP32[i7 >> 2] | 0) + (i5 << 4) | 0;
+ i8 = i3 >>> 0 < (HEAP32[i4 + 8 >> 2] | 0) >>> 0 ? i3 : 5192;
+ break;
+ }
+ if (!((i5 | 0) < -1000999)) {
+ i8 = (HEAP32[i4 + 8 >> 2] | 0) + (i5 << 4) | 0;
+ break;
+ }
+ if ((i5 | 0) == -1001e3) {
+ i8 = (HEAP32[i8 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i4 = -1001e3 - i5 | 0;
+ i5 = HEAP32[i7 >> 2] | 0;
+ if ((HEAP32[i5 + 8 >> 2] | 0) != 22 ? (i3 = HEAP32[i5 >> 2] | 0, (i4 | 0) <= (HEAPU8[i3 + 6 | 0] | 0 | 0)) : 0) {
+ i8 = i3 + (i4 + -1 << 4) + 16 | 0;
+ } else {
+ i8 = 5192;
+ }
+ }
+ } while (0);
+ i3 = HEAP32[i8 >> 2] | 0;
+ if ((i1 | 0) != 0) {
+ HEAP32[i1 >> 2] = HEAP32[i3 + 12 >> 2];
+ }
+ i10 = i3 + 16 | 0;
+ STACKTOP = i2;
+ return i10 | 0;
+}
+function _luaD_pcall(i3, i6, i5, i13, i14) {
+ i3 = i3 | 0;
+ i6 = i6 | 0;
+ i5 = i5 | 0;
+ i13 = i13 | 0;
+ i14 = i14 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0;
+ i1 = STACKTOP;
+ i10 = i3 + 16 | 0;
+ i11 = HEAP32[i10 >> 2] | 0;
+ i12 = i3 + 41 | 0;
+ i7 = HEAP8[i12] | 0;
+ i9 = i3 + 36 | 0;
+ i8 = HEAP16[i9 >> 1] | 0;
+ i4 = i3 + 68 | 0;
+ i2 = HEAP32[i4 >> 2] | 0;
+ HEAP32[i4 >> 2] = i14;
+ i5 = _luaD_rawrunprotected(i3, i6, i5) | 0;
+ if ((i5 | 0) == 0) {
+ HEAP32[i4 >> 2] = i2;
+ STACKTOP = i1;
+ return i5 | 0;
+ }
+ i6 = i3 + 28 | 0;
+ i14 = HEAP32[i6 >> 2] | 0;
+ i15 = i14 + i13 | 0;
+ _luaF_close(i3, i15);
+ if ((i5 | 0) == 6) {
+ i16 = _luaS_newlstr(i3, 2424, 23) | 0;
+ HEAP32[i15 >> 2] = i16;
+ HEAP32[i14 + (i13 + 8) >> 2] = HEAPU8[i16 + 4 | 0] | 0 | 64;
+ } else if ((i5 | 0) == 4) {
+ i16 = HEAP32[(HEAP32[i3 + 12 >> 2] | 0) + 180 >> 2] | 0;
+ HEAP32[i15 >> 2] = i16;
+ HEAP32[i14 + (i13 + 8) >> 2] = HEAPU8[i16 + 4 | 0] | 0 | 64;
+ } else {
+ i16 = HEAP32[i3 + 8 >> 2] | 0;
+ i18 = i16 + -16 | 0;
+ i17 = HEAP32[i18 + 4 >> 2] | 0;
+ HEAP32[i15 >> 2] = HEAP32[i18 >> 2];
+ HEAP32[i15 + 4 >> 2] = i17;
+ HEAP32[i14 + (i13 + 8) >> 2] = HEAP32[i16 + -8 >> 2];
+ }
+ i13 = i14 + (i13 + 16) | 0;
+ HEAP32[i3 + 8 >> 2] = i13;
+ HEAP32[i10 >> 2] = i11;
+ HEAP8[i12] = i7;
+ HEAP16[i9 >> 1] = i8;
+ if ((i11 | 0) != 0) {
+ do {
+ i7 = HEAP32[i11 + 4 >> 2] | 0;
+ i13 = i13 >>> 0 < i7 >>> 0 ? i7 : i13;
+ i11 = HEAP32[i11 + 8 >> 2] | 0;
+ } while ((i11 | 0) != 0);
+ }
+ i6 = i13 - (HEAP32[i6 >> 2] | 0) | 0;
+ i7 = (i6 >> 4) + 1 | 0;
+ i7 = ((i7 | 0) / 8 | 0) + 10 + i7 | 0;
+ i7 = (i7 | 0) > 1e6 ? 1e6 : i7;
+ if ((i6 | 0) > 15999984) {
+ HEAP32[i4 >> 2] = i2;
+ STACKTOP = i1;
+ return i5 | 0;
+ }
+ if ((i7 | 0) >= (HEAP32[i3 + 32 >> 2] | 0)) {
+ HEAP32[i4 >> 2] = i2;
+ STACKTOP = i1;
+ return i5 | 0;
+ }
+ _luaD_reallocstack(i3, i7);
+ HEAP32[i4 >> 2] = i2;
+ STACKTOP = i1;
+ return i5 | 0;
+}
+function _luaH_resize(i1, i4, i6, i9) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i6 = i6 | 0;
+ i9 = i9 | 0;
+ var i2 = 0, i3 = 0, i5 = 0, i7 = 0, i8 = 0, i10 = 0, i11 = 0;
+ i3 = STACKTOP;
+ i8 = i4 + 28 | 0;
+ i5 = HEAP32[i8 >> 2] | 0;
+ i7 = HEAPU8[i4 + 7 | 0] | 0;
+ i2 = HEAP32[i4 + 16 >> 2] | 0;
+ if ((i5 | 0) < (i6 | 0)) {
+ if ((i6 + 1 | 0) >>> 0 > 268435455) {
+ _luaM_toobig(i1);
+ }
+ i11 = i4 + 12 | 0;
+ i10 = _luaM_realloc_(i1, HEAP32[i11 >> 2] | 0, i5 << 4, i6 << 4) | 0;
+ HEAP32[i11 >> 2] = i10;
+ i11 = HEAP32[i8 >> 2] | 0;
+ if ((i11 | 0) < (i6 | 0)) {
+ do {
+ HEAP32[i10 + (i11 << 4) + 8 >> 2] = 0;
+ i11 = i11 + 1 | 0;
+ } while ((i11 | 0) != (i6 | 0));
+ }
+ HEAP32[i8 >> 2] = i6;
+ }
+ _setnodevector(i1, i4, i9);
+ do {
+ if ((i5 | 0) > (i6 | 0)) {
+ HEAP32[i8 >> 2] = i6;
+ i8 = i4 + 12 | 0;
+ i9 = i6;
+ do {
+ i10 = HEAP32[i8 >> 2] | 0;
+ if ((HEAP32[i10 + (i9 << 4) + 8 >> 2] | 0) == 0) {
+ i9 = i9 + 1 | 0;
+ } else {
+ i11 = i9 + 1 | 0;
+ _luaH_setint(i1, i4, i11, i10 + (i9 << 4) | 0);
+ i9 = i11;
+ }
+ } while ((i9 | 0) != (i5 | 0));
+ if ((i6 + 1 | 0) >>> 0 > 268435455) {
+ _luaM_toobig(i1);
+ } else {
+ i11 = i4 + 12 | 0;
+ HEAP32[i11 >> 2] = _luaM_realloc_(i1, HEAP32[i11 >> 2] | 0, i5 << 4, i6 << 4) | 0;
+ break;
+ }
+ }
+ } while (0);
+ i5 = 1 << i7;
+ if ((i5 | 0) > 0) {
+ i6 = i5;
+ do {
+ i6 = i6 + -1 | 0;
+ i7 = i2 + (i6 << 5) + 8 | 0;
+ if ((HEAP32[i7 >> 2] | 0) != 0) {
+ i8 = i2 + (i6 << 5) + 16 | 0;
+ i9 = _luaH_get(i4, i8) | 0;
+ if ((i9 | 0) == 5192) {
+ i9 = _luaH_newkey(i1, i4, i8) | 0;
+ }
+ i8 = i2 + (i6 << 5) | 0;
+ i10 = HEAP32[i8 + 4 >> 2] | 0;
+ i11 = i9;
+ HEAP32[i11 >> 2] = HEAP32[i8 >> 2];
+ HEAP32[i11 + 4 >> 2] = i10;
+ HEAP32[i9 + 8 >> 2] = HEAP32[i7 >> 2];
+ }
+ } while ((i6 | 0) > 0);
+ }
+ if ((i2 | 0) == 8016) {
+ STACKTOP = i3;
+ return;
+ }
+ _luaM_realloc_(i1, i2, i5 << 5, 0) | 0;
+ STACKTOP = i3;
+ return;
+}
+function _codearith(i4, i3, i2, i6, i5) {
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i6 = i6 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, d13 = 0.0;
+ i7 = STACKTOP;
+ if (((((((HEAP32[i2 >> 2] | 0) == 5 ? (HEAP32[i2 + 16 >> 2] | 0) == -1 : 0) ? (HEAP32[i2 + 20 >> 2] | 0) == -1 : 0) ? (HEAP32[i6 >> 2] | 0) == 5 : 0) ? (HEAP32[i6 + 16 >> 2] | 0) == -1 : 0) ? (HEAP32[i6 + 20 >> 2] | 0) == -1 : 0) ? (d13 = +HEAPF64[i6 + 8 >> 3], !((i3 & -2 | 0) == 16 & d13 == 0.0)) : 0) {
+ i12 = i2 + 8 | 0;
+ HEAPF64[i12 >> 3] = +_luaO_arith(i3 + -13 | 0, +HEAPF64[i12 >> 3], d13);
+ STACKTOP = i7;
+ return;
+ }
+ if ((i3 | 0) == 19 | (i3 | 0) == 21) {
+ i11 = 0;
+ } else {
+ i11 = _luaK_exp2RK(i4, i6) | 0;
+ }
+ i12 = _luaK_exp2RK(i4, i2) | 0;
+ if ((i12 | 0) > (i11 | 0)) {
+ if (((HEAP32[i2 >> 2] | 0) == 6 ? (i8 = HEAP32[i2 + 8 >> 2] | 0, (i8 & 256 | 0) == 0) : 0) ? (HEAPU8[i4 + 46 | 0] | 0 | 0) <= (i8 | 0) : 0) {
+ i10 = i4 + 48 | 0;
+ HEAP8[i10] = (HEAP8[i10] | 0) + -1 << 24 >> 24;
+ }
+ if (((HEAP32[i6 >> 2] | 0) == 6 ? (i1 = HEAP32[i6 + 8 >> 2] | 0, (i1 & 256 | 0) == 0) : 0) ? (HEAPU8[i4 + 46 | 0] | 0 | 0) <= (i1 | 0) : 0) {
+ i10 = i4 + 48 | 0;
+ HEAP8[i10] = (HEAP8[i10] | 0) + -1 << 24 >> 24;
+ }
+ } else {
+ if (((HEAP32[i6 >> 2] | 0) == 6 ? (i10 = HEAP32[i6 + 8 >> 2] | 0, (i10 & 256 | 0) == 0) : 0) ? (HEAPU8[i4 + 46 | 0] | 0 | 0) <= (i10 | 0) : 0) {
+ i10 = i4 + 48 | 0;
+ HEAP8[i10] = (HEAP8[i10] | 0) + -1 << 24 >> 24;
+ }
+ if (((HEAP32[i2 >> 2] | 0) == 6 ? (i9 = HEAP32[i2 + 8 >> 2] | 0, (i9 & 256 | 0) == 0) : 0) ? (HEAPU8[i4 + 46 | 0] | 0 | 0) <= (i9 | 0) : 0) {
+ i10 = i4 + 48 | 0;
+ HEAP8[i10] = (HEAP8[i10] | 0) + -1 << 24 >> 24;
+ }
+ }
+ HEAP32[i2 + 8 >> 2] = _luaK_code(i4, i11 << 14 | i3 | i12 << 23) | 0;
+ HEAP32[i2 >> 2] = 11;
+ HEAP32[(HEAP32[(HEAP32[i4 >> 2] | 0) + 20 >> 2] | 0) + ((HEAP32[i4 + 20 >> 2] | 0) + -1 << 2) >> 2] = i5;
+ STACKTOP = i7;
+ return;
+}
+function _GCTM(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0;
+ i4 = STACKTOP;
+ STACKTOP = STACKTOP + 32 | 0;
+ i2 = i4 + 16 | 0;
+ i5 = i4;
+ i6 = HEAP32[i1 + 12 >> 2] | 0;
+ i9 = i6 + 104 | 0;
+ i8 = HEAP32[i9 >> 2] | 0;
+ HEAP32[i9 >> 2] = HEAP32[i8 >> 2];
+ i9 = i6 + 68 | 0;
+ HEAP32[i8 >> 2] = HEAP32[i9 >> 2];
+ HEAP32[i9 >> 2] = i8;
+ i9 = i8 + 5 | 0;
+ i7 = HEAPU8[i9] | 0;
+ HEAP8[i9] = i7 & 239;
+ if ((HEAPU8[i6 + 61 | 0] | 0) >= 2) {
+ HEAP8[i9] = HEAP8[i6 + 60 | 0] & 3 | i7 & 168;
+ }
+ HEAP32[i5 >> 2] = i8;
+ i7 = i5 + 8 | 0;
+ HEAP32[i7 >> 2] = HEAPU8[i8 + 4 | 0] | 0 | 64;
+ i8 = _luaT_gettmbyobj(i1, i5, 2) | 0;
+ if ((i8 | 0) == 0) {
+ STACKTOP = i4;
+ return;
+ }
+ i9 = i8 + 8 | 0;
+ if ((HEAP32[i9 >> 2] & 15 | 0) != 6) {
+ STACKTOP = i4;
+ return;
+ }
+ i12 = i1 + 41 | 0;
+ i13 = HEAP8[i12] | 0;
+ i10 = i6 + 63 | 0;
+ i11 = HEAP8[i10] | 0;
+ HEAP8[i12] = 0;
+ HEAP8[i10] = 0;
+ i6 = i1 + 8 | 0;
+ i14 = HEAP32[i6 >> 2] | 0;
+ i16 = i8;
+ i15 = HEAP32[i16 + 4 >> 2] | 0;
+ i8 = i14;
+ HEAP32[i8 >> 2] = HEAP32[i16 >> 2];
+ HEAP32[i8 + 4 >> 2] = i15;
+ HEAP32[i14 + 8 >> 2] = HEAP32[i9 >> 2];
+ i9 = HEAP32[i6 >> 2] | 0;
+ i14 = i5;
+ i8 = HEAP32[i14 + 4 >> 2] | 0;
+ i5 = i9 + 16 | 0;
+ HEAP32[i5 >> 2] = HEAP32[i14 >> 2];
+ HEAP32[i5 + 4 >> 2] = i8;
+ HEAP32[i9 + 24 >> 2] = HEAP32[i7 >> 2];
+ i5 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i6 >> 2] = i5 + 32;
+ i5 = _luaD_pcall(i1, 7, 0, i5 - (HEAP32[i1 + 28 >> 2] | 0) | 0, 0) | 0;
+ HEAP8[i12] = i13;
+ HEAP8[i10] = i11;
+ if ((i5 | 0) == 0 | (i3 | 0) == 0) {
+ STACKTOP = i4;
+ return;
+ }
+ if ((i5 | 0) != 2) {
+ i16 = i5;
+ _luaD_throw(i1, i16);
+ }
+ i3 = HEAP32[i6 >> 2] | 0;
+ if ((HEAP32[i3 + -8 >> 2] & 15 | 0) == 4) {
+ i3 = (HEAP32[i3 + -16 >> 2] | 0) + 16 | 0;
+ } else {
+ i3 = 2528;
+ }
+ HEAP32[i2 >> 2] = i3;
+ _luaO_pushfstring(i1, 2544, i2) | 0;
+ i16 = 5;
+ _luaD_throw(i1, i16);
+}
+function _lua_gc(i3, i5, i4) {
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i2 = 0;
+ i1 = STACKTOP;
+ i2 = HEAP32[i3 + 12 >> 2] | 0;
+ L1 : do {
+ switch (i5 | 0) {
+ case 8:
+ {
+ i5 = i2 + 160 | 0;
+ i2 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = i4;
+ break;
+ }
+ case 11:
+ {
+ _luaC_changemode(i3, 0);
+ i2 = 0;
+ break;
+ }
+ case 2:
+ {
+ _luaC_fullgc(i3, 0);
+ i2 = 0;
+ break;
+ }
+ case 5:
+ {
+ if ((HEAP8[i2 + 62 | 0] | 0) == 2) {
+ i2 = (HEAP32[i2 + 20 >> 2] | 0) == 0 | 0;
+ _luaC_forcestep(i3);
+ break L1;
+ }
+ i4 = (i4 << 10) + -1600 | 0;
+ if ((HEAP8[i2 + 63 | 0] | 0) == 0) {
+ i5 = i4;
+ _luaE_setdebt(i2, i5);
+ _luaC_forcestep(i3);
+ i5 = i2 + 61 | 0;
+ i5 = HEAP8[i5] | 0;
+ i5 = i5 << 24 >> 24 == 5;
+ i5 = i5 & 1;
+ STACKTOP = i1;
+ return i5 | 0;
+ }
+ i5 = (HEAP32[i2 + 12 >> 2] | 0) + i4 | 0;
+ _luaE_setdebt(i2, i5);
+ _luaC_forcestep(i3);
+ i5 = i2 + 61 | 0;
+ i5 = HEAP8[i5] | 0;
+ i5 = i5 << 24 >> 24 == 5;
+ i5 = i5 & 1;
+ STACKTOP = i1;
+ return i5 | 0;
+ }
+ case 4:
+ {
+ i2 = (HEAP32[i2 + 12 >> 2] | 0) + (HEAP32[i2 + 8 >> 2] | 0) & 1023;
+ break;
+ }
+ case 1:
+ {
+ _luaE_setdebt(i2, 0);
+ HEAP8[i2 + 63 | 0] = 1;
+ i2 = 0;
+ break;
+ }
+ case 3:
+ {
+ i2 = ((HEAP32[i2 + 12 >> 2] | 0) + (HEAP32[i2 + 8 >> 2] | 0) | 0) >>> 10;
+ break;
+ }
+ case 7:
+ {
+ i5 = i2 + 164 | 0;
+ i2 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = i4;
+ break;
+ }
+ case 0:
+ {
+ HEAP8[i2 + 63 | 0] = 0;
+ i2 = 0;
+ break;
+ }
+ case 6:
+ {
+ i5 = i2 + 156 | 0;
+ i2 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = i4;
+ break;
+ }
+ case 9:
+ {
+ i2 = HEAPU8[i2 + 63 | 0] | 0;
+ break;
+ }
+ case 10:
+ {
+ _luaC_changemode(i3, 2);
+ i2 = 0;
+ break;
+ }
+ default:
+ {
+ i2 = -1;
+ }
+ }
+ } while (0);
+ STACKTOP = i1;
+ return i2 | 0;
+}
+function _os_time(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 64 | 0;
+ i4 = i2;
+ i5 = i2 + 48 | 0;
+ i3 = i2 + 4 | 0;
+ if ((_lua_type(i1, 1) | 0) < 1) {
+ i3 = _time(0) | 0;
+ } else {
+ _luaL_checktype(i1, 1, 5);
+ _lua_settop(i1, 1);
+ _lua_getfield(i1, -1, 5864);
+ i6 = _lua_tointegerx(i1, -1, i4) | 0;
+ i6 = (HEAP32[i4 >> 2] | 0) == 0 ? 0 : i6;
+ _lua_settop(i1, -2);
+ HEAP32[i3 >> 2] = i6;
+ _lua_getfield(i1, -1, 5872);
+ i6 = _lua_tointegerx(i1, -1, i4) | 0;
+ i6 = (HEAP32[i4 >> 2] | 0) == 0 ? 0 : i6;
+ _lua_settop(i1, -2);
+ HEAP32[i3 + 4 >> 2] = i6;
+ _lua_getfield(i1, -1, 5880);
+ i6 = _lua_tointegerx(i1, -1, i4) | 0;
+ i6 = (HEAP32[i4 >> 2] | 0) == 0 ? 12 : i6;
+ _lua_settop(i1, -2);
+ HEAP32[i3 + 8 >> 2] = i6;
+ _lua_getfield(i1, -1, 5888);
+ i6 = _lua_tointegerx(i1, -1, i5) | 0;
+ if ((HEAP32[i5 >> 2] | 0) == 0) {
+ HEAP32[i4 >> 2] = 5888;
+ i6 = _luaL_error(i1, 5920, i4) | 0;
+ } else {
+ _lua_settop(i1, -2);
+ }
+ HEAP32[i3 + 12 >> 2] = i6;
+ _lua_getfield(i1, -1, 5896);
+ i6 = _lua_tointegerx(i1, -1, i5) | 0;
+ if ((HEAP32[i5 >> 2] | 0) == 0) {
+ HEAP32[i4 >> 2] = 5896;
+ i6 = _luaL_error(i1, 5920, i4) | 0;
+ } else {
+ _lua_settop(i1, -2);
+ }
+ HEAP32[i3 + 16 >> 2] = i6 + -1;
+ _lua_getfield(i1, -1, 5904);
+ i6 = _lua_tointegerx(i1, -1, i5) | 0;
+ if ((HEAP32[i5 >> 2] | 0) == 0) {
+ HEAP32[i4 >> 2] = 5904;
+ i6 = _luaL_error(i1, 5920, i4) | 0;
+ } else {
+ _lua_settop(i1, -2);
+ }
+ HEAP32[i3 + 20 >> 2] = i6 + -1900;
+ _lua_getfield(i1, -1, 5912);
+ if ((_lua_type(i1, -1) | 0) == 0) {
+ i4 = -1;
+ } else {
+ i4 = _lua_toboolean(i1, -1) | 0;
+ }
+ _lua_settop(i1, -2);
+ HEAP32[i3 + 32 >> 2] = i4;
+ i3 = _mktime(i3 | 0) | 0;
+ }
+ if ((i3 | 0) == -1) {
+ _lua_pushnil(i1);
+ STACKTOP = i2;
+ return 1;
+ } else {
+ _lua_pushnumber(i1, +(i3 | 0));
+ STACKTOP = i2;
+ return 1;
+ }
+ return 0;
+}
+function _addk(i6, i4, i3) {
+ i6 = i6 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ var i1 = 0, i2 = 0, i5 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i10 = i1;
+ i2 = HEAP32[(HEAP32[i6 + 12 >> 2] | 0) + 52 >> 2] | 0;
+ i8 = _luaH_set(i2, HEAP32[i6 + 4 >> 2] | 0, i4) | 0;
+ i4 = HEAP32[i6 >> 2] | 0;
+ i9 = i8 + 8 | 0;
+ if (((HEAP32[i9 >> 2] | 0) == 3 ? (HEAPF64[i10 >> 3] = +HEAPF64[i8 >> 3] + 6755399441055744.0, i7 = HEAP32[i10 >> 2] | 0, i5 = HEAP32[i4 + 8 >> 2] | 0, (HEAP32[i5 + (i7 << 4) + 8 >> 2] | 0) == (HEAP32[i3 + 8 >> 2] | 0)) : 0) ? (_luaV_equalobj_(0, i5 + (i7 << 4) | 0, i3) | 0) != 0 : 0) {
+ i10 = i7;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ i5 = i4 + 44 | 0;
+ i10 = HEAP32[i5 >> 2] | 0;
+ i7 = i6 + 32 | 0;
+ i6 = HEAP32[i7 >> 2] | 0;
+ HEAPF64[i8 >> 3] = +(i6 | 0);
+ HEAP32[i9 >> 2] = 3;
+ i9 = HEAP32[i5 >> 2] | 0;
+ if ((i6 | 0) >= (i9 | 0)) {
+ i9 = i4 + 8 | 0;
+ HEAP32[i9 >> 2] = _luaM_growaux_(i2, HEAP32[i9 >> 2] | 0, i5, 16, 67108863, 10600) | 0;
+ i9 = HEAP32[i5 >> 2] | 0;
+ }
+ i8 = HEAP32[i4 + 8 >> 2] | 0;
+ if ((i10 | 0) < (i9 | 0)) {
+ while (1) {
+ i9 = i10 + 1 | 0;
+ HEAP32[i8 + (i10 << 4) + 8 >> 2] = 0;
+ if ((i9 | 0) < (HEAP32[i5 >> 2] | 0)) {
+ i10 = i9;
+ } else {
+ break;
+ }
+ }
+ }
+ i5 = i3;
+ i9 = HEAP32[i5 + 4 >> 2] | 0;
+ i10 = i8 + (i6 << 4) | 0;
+ HEAP32[i10 >> 2] = HEAP32[i5 >> 2];
+ HEAP32[i10 + 4 >> 2] = i9;
+ i10 = i3 + 8 | 0;
+ HEAP32[i8 + (i6 << 4) + 8 >> 2] = HEAP32[i10 >> 2];
+ HEAP32[i7 >> 2] = (HEAP32[i7 >> 2] | 0) + 1;
+ if ((HEAP32[i10 >> 2] & 64 | 0) == 0) {
+ i10 = i6;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ i3 = HEAP32[i3 >> 2] | 0;
+ if ((HEAP8[i3 + 5 | 0] & 3) == 0) {
+ i10 = i6;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ if ((HEAP8[i4 + 5 | 0] & 4) == 0) {
+ i10 = i6;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ _luaC_barrier_(i2, i4, i3);
+ i10 = i6;
+ STACKTOP = i1;
+ return i10 | 0;
+}
+function _singlevaraux(i5, i4, i2, i11) {
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ i2 = i2 | 0;
+ i11 = i11 | 0;
+ var i1 = 0, i3 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0;
+ i1 = STACKTOP;
+ if ((i5 | 0) == 0) {
+ i11 = 0;
+ STACKTOP = i1;
+ return i11 | 0;
+ }
+ i7 = i5 + 12 | 0;
+ i8 = i5 + 40 | 0;
+ i9 = HEAPU8[i5 + 46 | 0] | 0;
+ while (1) {
+ i6 = i9 + -1 | 0;
+ i10 = HEAP32[i5 >> 2] | 0;
+ if ((i9 | 0) <= 0) {
+ break;
+ }
+ if ((_luaS_eqstr(i4, HEAP32[(HEAP32[i10 + 24 >> 2] | 0) + ((HEAP16[(HEAP32[HEAP32[(HEAP32[i7 >> 2] | 0) + 64 >> 2] >> 2] | 0) + ((HEAP32[i8 >> 2] | 0) + i6 << 1) >> 1] | 0) * 12 | 0) >> 2] | 0) | 0) == 0) {
+ i9 = i6;
+ } else {
+ i3 = 5;
+ break;
+ }
+ }
+ if ((i3 | 0) == 5) {
+ HEAP32[i2 + 16 >> 2] = -1;
+ HEAP32[i2 + 20 >> 2] = -1;
+ HEAP32[i2 >> 2] = 7;
+ HEAP32[i2 + 8 >> 2] = i6;
+ if ((i11 | 0) != 0) {
+ i11 = 7;
+ STACKTOP = i1;
+ return i11 | 0;
+ }
+ i2 = i5 + 16 | 0;
+ do {
+ i2 = HEAP32[i2 >> 2] | 0;
+ } while ((HEAPU8[i2 + 8 | 0] | 0) > (i6 | 0));
+ HEAP8[i2 + 9 | 0] = 1;
+ i11 = 7;
+ STACKTOP = i1;
+ return i11 | 0;
+ }
+ i7 = HEAP32[i10 + 28 >> 2] | 0;
+ i6 = i5 + 47 | 0;
+ L17 : do {
+ if ((HEAP8[i6] | 0) != 0) {
+ i8 = 0;
+ while (1) {
+ i9 = i8 + 1 | 0;
+ if ((_luaS_eqstr(HEAP32[i7 + (i8 << 3) >> 2] | 0, i4) | 0) != 0) {
+ break;
+ }
+ if ((i9 | 0) < (HEAPU8[i6] | 0)) {
+ i8 = i9;
+ } else {
+ i3 = 13;
+ break L17;
+ }
+ }
+ if ((i8 | 0) < 0) {
+ i3 = 13;
+ }
+ } else {
+ i3 = 13;
+ }
+ } while (0);
+ do {
+ if ((i3 | 0) == 13) {
+ if ((_singlevaraux(HEAP32[i5 + 8 >> 2] | 0, i4, i2, 0) | 0) == 0) {
+ i11 = 0;
+ STACKTOP = i1;
+ return i11 | 0;
+ } else {
+ i8 = _newupvalue(i5, i4, i2) | 0;
+ break;
+ }
+ }
+ } while (0);
+ HEAP32[i2 + 16 >> 2] = -1;
+ HEAP32[i2 + 20 >> 2] = -1;
+ HEAP32[i2 >> 2] = 8;
+ HEAP32[i2 + 8 >> 2] = i8;
+ i11 = 8;
+ STACKTOP = i1;
+ return i11 | 0;
+}
+function _mainposition(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i2;
+ switch (HEAP32[i3 + 8 >> 2] & 63 | 0) {
+ case 3:
+ {
+ HEAPF64[i4 >> 3] = +HEAPF64[i3 >> 3] + 1.0;
+ i3 = (HEAP32[i4 + 4 >> 2] | 0) + (HEAP32[i4 >> 2] | 0) | 0;
+ if ((i3 | 0) < 0) {
+ i4 = 0 - i3 | 0;
+ i3 = (i3 | 0) == (i4 | 0) ? 0 : i4;
+ }
+ i5 = (HEAP32[i1 + 16 >> 2] | 0) + (((i3 | 0) % ((1 << HEAPU8[i1 + 7 | 0]) + -1 | 1 | 0) | 0) << 5) | 0;
+ STACKTOP = i2;
+ return i5 | 0;
+ }
+ case 2:
+ {
+ i5 = (HEAP32[i1 + 16 >> 2] | 0) + ((((HEAP32[i3 >> 2] | 0) >>> 0) % (((1 << HEAPU8[i1 + 7 | 0]) + -1 | 1) >>> 0) | 0) << 5) | 0;
+ STACKTOP = i2;
+ return i5 | 0;
+ }
+ case 20:
+ {
+ i5 = HEAP32[i3 >> 2] | 0;
+ i4 = i5 + 6 | 0;
+ if ((HEAP8[i4] | 0) == 0) {
+ i6 = i5 + 8 | 0;
+ HEAP32[i6 >> 2] = _luaS_hash(i5 + 16 | 0, HEAP32[i5 + 12 >> 2] | 0, HEAP32[i6 >> 2] | 0) | 0;
+ HEAP8[i4] = 1;
+ i5 = HEAP32[i3 >> 2] | 0;
+ }
+ i6 = (HEAP32[i1 + 16 >> 2] | 0) + (((1 << HEAPU8[i1 + 7 | 0]) + -1 & HEAP32[i5 + 8 >> 2]) << 5) | 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ case 22:
+ {
+ i6 = (HEAP32[i1 + 16 >> 2] | 0) + ((((HEAP32[i3 >> 2] | 0) >>> 0) % (((1 << HEAPU8[i1 + 7 | 0]) + -1 | 1) >>> 0) | 0) << 5) | 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ case 4:
+ {
+ i6 = (HEAP32[i1 + 16 >> 2] | 0) + (((1 << HEAPU8[i1 + 7 | 0]) + -1 & HEAP32[(HEAP32[i3 >> 2] | 0) + 8 >> 2]) << 5) | 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ case 1:
+ {
+ i6 = (HEAP32[i1 + 16 >> 2] | 0) + (((1 << HEAPU8[i1 + 7 | 0]) + -1 & HEAP32[i3 >> 2]) << 5) | 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ default:
+ {
+ i6 = (HEAP32[i1 + 16 >> 2] | 0) + ((((HEAP32[i3 >> 2] | 0) >>> 0) % (((1 << HEAPU8[i1 + 7 | 0]) + -1 | 1) >>> 0) | 0) << 5) | 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ }
+ return 0;
+}
+function _clearvalues(i2, i5, i1) {
+ i2 = i2 | 0;
+ i5 = i5 | 0;
+ i1 = i1 | 0;
+ var i3 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0;
+ i4 = STACKTOP;
+ if ((i5 | 0) == (i1 | 0)) {
+ STACKTOP = i4;
+ return;
+ }
+ do {
+ i7 = i5 + 16 | 0;
+ i9 = HEAP32[i7 >> 2] | 0;
+ i6 = i9 + (1 << (HEAPU8[i5 + 7 | 0] | 0) << 5) | 0;
+ i8 = i5 + 28 | 0;
+ if ((HEAP32[i8 >> 2] | 0) > 0) {
+ i11 = i5 + 12 | 0;
+ i12 = 0;
+ do {
+ i13 = HEAP32[i11 >> 2] | 0;
+ i10 = i13 + (i12 << 4) + 8 | 0;
+ i9 = HEAP32[i10 >> 2] | 0;
+ do {
+ if ((i9 & 64 | 0) != 0) {
+ i13 = HEAP32[i13 + (i12 << 4) >> 2] | 0;
+ if ((i9 & 15 | 0) != 4) {
+ if ((HEAP8[i13 + 5 | 0] & 3) == 0) {
+ break;
+ }
+ HEAP32[i10 >> 2] = 0;
+ break;
+ }
+ if ((i13 | 0) != 0 ? !((HEAP8[i13 + 5 | 0] & 3) == 0) : 0) {
+ _reallymarkobject(i2, i13);
+ }
+ }
+ } while (0);
+ i12 = i12 + 1 | 0;
+ } while ((i12 | 0) < (HEAP32[i8 >> 2] | 0));
+ i7 = HEAP32[i7 >> 2] | 0;
+ } else {
+ i7 = i9;
+ }
+ if (i7 >>> 0 < i6 >>> 0) {
+ do {
+ i8 = i7 + 8 | 0;
+ i9 = HEAP32[i8 >> 2] | 0;
+ do {
+ if (!((i9 | 0) == 0 | (i9 & 64 | 0) == 0)) {
+ i10 = HEAP32[i7 >> 2] | 0;
+ if ((i9 & 15 | 0) == 4) {
+ if ((i10 | 0) == 0) {
+ break;
+ }
+ if ((HEAP8[i10 + 5 | 0] & 3) == 0) {
+ break;
+ }
+ _reallymarkobject(i2, i10);
+ break;
+ }
+ if ((!((HEAP8[i10 + 5 | 0] & 3) == 0) ? (HEAP32[i8 >> 2] = 0, i3 = i7 + 24 | 0, (HEAP32[i3 >> 2] & 64 | 0) != 0) : 0) ? !((HEAP8[(HEAP32[i7 + 16 >> 2] | 0) + 5 | 0] & 3) == 0) : 0) {
+ HEAP32[i3 >> 2] = 11;
+ }
+ }
+ } while (0);
+ i7 = i7 + 32 | 0;
+ } while (i7 >>> 0 < i6 >>> 0);
+ }
+ i5 = HEAP32[i5 + 24 >> 2] | 0;
+ } while ((i5 | 0) != (i1 | 0));
+ STACKTOP = i4;
+ return;
+}
+function _reallymarkobject(i1, i4) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ var i2 = 0, i3 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i3 = STACKTOP;
+ i2 = i4 + 5 | 0;
+ HEAP8[i2] = HEAP8[i2] & 252;
+ switch (HEAPU8[i4 + 4 | 0] | 0 | 0) {
+ case 6:
+ {
+ i7 = i1 + 84 | 0;
+ HEAP32[i4 + 8 >> 2] = HEAP32[i7 >> 2];
+ HEAP32[i7 >> 2] = i4;
+ STACKTOP = i3;
+ return;
+ }
+ case 20:
+ case 4:
+ {
+ i4 = (HEAP32[i4 + 12 >> 2] | 0) + 17 | 0;
+ break;
+ }
+ case 7:
+ {
+ i5 = HEAP32[i4 + 8 >> 2] | 0;
+ if ((i5 | 0) != 0 ? !((HEAP8[i5 + 5 | 0] & 3) == 0) : 0) {
+ _reallymarkobject(i1, i5);
+ }
+ i5 = HEAP32[i4 + 12 >> 2] | 0;
+ if ((i5 | 0) != 0 ? !((HEAP8[i5 + 5 | 0] & 3) == 0) : 0) {
+ _reallymarkobject(i1, i5);
+ }
+ i4 = (HEAP32[i4 + 16 >> 2] | 0) + 24 | 0;
+ break;
+ }
+ case 8:
+ {
+ i7 = i1 + 84 | 0;
+ HEAP32[i4 + 60 >> 2] = HEAP32[i7 >> 2];
+ HEAP32[i7 >> 2] = i4;
+ STACKTOP = i3;
+ return;
+ }
+ case 10:
+ {
+ i6 = i4 + 8 | 0;
+ i7 = HEAP32[i6 >> 2] | 0;
+ if ((HEAP32[i7 + 8 >> 2] & 64 | 0) != 0 ? (i5 = HEAP32[i7 >> 2] | 0, !((HEAP8[i5 + 5 | 0] & 3) == 0)) : 0) {
+ _reallymarkobject(i1, i5);
+ i7 = HEAP32[i6 >> 2] | 0;
+ }
+ if ((i7 | 0) == (i4 + 16 | 0)) {
+ i4 = 32;
+ } else {
+ STACKTOP = i3;
+ return;
+ }
+ break;
+ }
+ case 5:
+ {
+ i7 = i1 + 84 | 0;
+ HEAP32[i4 + 24 >> 2] = HEAP32[i7 >> 2];
+ HEAP32[i7 >> 2] = i4;
+ STACKTOP = i3;
+ return;
+ }
+ case 38:
+ {
+ i7 = i1 + 84 | 0;
+ HEAP32[i4 + 8 >> 2] = HEAP32[i7 >> 2];
+ HEAP32[i7 >> 2] = i4;
+ STACKTOP = i3;
+ return;
+ }
+ case 9:
+ {
+ i7 = i1 + 84 | 0;
+ HEAP32[i4 + 72 >> 2] = HEAP32[i7 >> 2];
+ HEAP32[i7 >> 2] = i4;
+ STACKTOP = i3;
+ return;
+ }
+ default:
+ {
+ STACKTOP = i3;
+ return;
+ }
+ }
+ HEAP8[i2] = HEAPU8[i2] | 0 | 4;
+ i7 = i1 + 16 | 0;
+ HEAP32[i7 >> 2] = (HEAP32[i7 >> 2] | 0) + i4;
+ STACKTOP = i3;
+ return;
+}
+function _lua_upvaluejoin(i1, i9, i7, i6, i3) {
+ i1 = i1 | 0;
+ i9 = i9 | 0;
+ i7 = i7 | 0;
+ i6 = i6 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0, i5 = 0, i8 = 0, i10 = 0;
+ i2 = STACKTOP;
+ i5 = HEAP32[i1 + 16 >> 2] | 0;
+ do {
+ if ((i9 | 0) <= 0) {
+ if (!((i9 | 0) < -1000999)) {
+ i8 = (HEAP32[i1 + 8 >> 2] | 0) + (i9 << 4) | 0;
+ break;
+ }
+ if ((i9 | 0) == -1001e3) {
+ i8 = (HEAP32[i1 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i10 = -1001e3 - i9 | 0;
+ i9 = HEAP32[i5 >> 2] | 0;
+ if ((HEAP32[i9 + 8 >> 2] | 0) != 22 ? (i8 = HEAP32[i9 >> 2] | 0, (i10 | 0) <= (HEAPU8[i8 + 6 | 0] | 0 | 0)) : 0) {
+ i8 = i8 + (i10 + -1 << 4) + 16 | 0;
+ } else {
+ i8 = 5192;
+ }
+ } else {
+ i8 = (HEAP32[i5 >> 2] | 0) + (i9 << 4) | 0;
+ i8 = i8 >>> 0 < (HEAP32[i1 + 8 >> 2] | 0) >>> 0 ? i8 : 5192;
+ }
+ } while (0);
+ i8 = HEAP32[i8 >> 2] | 0;
+ i7 = i8 + 16 + (i7 + -1 << 2) | 0;
+ do {
+ if ((i6 | 0) <= 0) {
+ if (!((i6 | 0) < -1000999)) {
+ i4 = (HEAP32[i1 + 8 >> 2] | 0) + (i6 << 4) | 0;
+ break;
+ }
+ if ((i6 | 0) == -1001e3) {
+ i4 = (HEAP32[i1 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i6 = -1001e3 - i6 | 0;
+ i5 = HEAP32[i5 >> 2] | 0;
+ if ((HEAP32[i5 + 8 >> 2] | 0) != 22 ? (i4 = HEAP32[i5 >> 2] | 0, (i6 | 0) <= (HEAPU8[i4 + 6 | 0] | 0 | 0)) : 0) {
+ i4 = i4 + (i6 + -1 << 4) + 16 | 0;
+ } else {
+ i4 = 5192;
+ }
+ } else {
+ i4 = (HEAP32[i5 >> 2] | 0) + (i6 << 4) | 0;
+ i4 = i4 >>> 0 < (HEAP32[i1 + 8 >> 2] | 0) >>> 0 ? i4 : 5192;
+ }
+ } while (0);
+ i3 = (HEAP32[i4 >> 2] | 0) + 16 + (i3 + -1 << 2) | 0;
+ HEAP32[i7 >> 2] = HEAP32[i3 >> 2];
+ i3 = HEAP32[i3 >> 2] | 0;
+ if ((HEAP8[i3 + 5 | 0] & 3) == 0) {
+ STACKTOP = i2;
+ return;
+ }
+ if ((HEAP8[i8 + 5 | 0] & 4) == 0) {
+ STACKTOP = i2;
+ return;
+ }
+ _luaC_barrier_(i1, i8, i3);
+ STACKTOP = i2;
+ return;
+}
+function _lua_upvalueid(i5, i7, i1) {
+ i5 = i5 | 0;
+ i7 = i7 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i6 = 0, i8 = 0, i9 = 0, i10 = 0;
+ i2 = STACKTOP;
+ i4 = HEAP32[i5 + 16 >> 2] | 0;
+ i6 = (i7 | 0) > 0;
+ do {
+ if (!i6) {
+ if (!((i7 | 0) < -1000999)) {
+ i8 = (HEAP32[i5 + 8 >> 2] | 0) + (i7 << 4) | 0;
+ break;
+ }
+ if ((i7 | 0) == -1001e3) {
+ i8 = (HEAP32[i5 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i10 = -1001e3 - i7 | 0;
+ i9 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP32[i9 + 8 >> 2] | 0) != 22 ? (i8 = HEAP32[i9 >> 2] | 0, (i10 | 0) <= (HEAPU8[i8 + 6 | 0] | 0 | 0)) : 0) {
+ i8 = i8 + (i10 + -1 << 4) + 16 | 0;
+ } else {
+ i8 = 5192;
+ }
+ } else {
+ i8 = (HEAP32[i4 >> 2] | 0) + (i7 << 4) | 0;
+ i8 = i8 >>> 0 < (HEAP32[i5 + 8 >> 2] | 0) >>> 0 ? i8 : 5192;
+ }
+ } while (0);
+ i9 = HEAP32[i8 + 8 >> 2] & 63;
+ if ((i9 | 0) == 38) {
+ i10 = (HEAP32[i8 >> 2] | 0) + (i1 + -1 << 4) + 16 | 0;
+ STACKTOP = i2;
+ return i10 | 0;
+ } else if ((i9 | 0) == 6) {
+ do {
+ if (!i6) {
+ if (!((i7 | 0) < -1000999)) {
+ i3 = (HEAP32[i5 + 8 >> 2] | 0) + (i7 << 4) | 0;
+ break;
+ }
+ if ((i7 | 0) == -1001e3) {
+ i3 = (HEAP32[i5 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i5 = -1001e3 - i7 | 0;
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP32[i4 + 8 >> 2] | 0) != 22 ? (i3 = HEAP32[i4 >> 2] | 0, (i5 | 0) <= (HEAPU8[i3 + 6 | 0] | 0 | 0)) : 0) {
+ i3 = i3 + (i5 + -1 << 4) + 16 | 0;
+ } else {
+ i3 = 5192;
+ }
+ } else {
+ i3 = (HEAP32[i4 >> 2] | 0) + (i7 << 4) | 0;
+ i3 = i3 >>> 0 < (HEAP32[i5 + 8 >> 2] | 0) >>> 0 ? i3 : 5192;
+ }
+ } while (0);
+ i10 = HEAP32[(HEAP32[i3 >> 2] | 0) + 16 + (i1 + -1 << 2) >> 2] | 0;
+ STACKTOP = i2;
+ return i10 | 0;
+ } else {
+ i10 = 0;
+ STACKTOP = i2;
+ return i10 | 0;
+ }
+ return 0;
+}
+function _lua_rawequal(i2, i6, i4) {
+ i2 = i2 | 0;
+ i6 = i6 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i3 = 0, i5 = 0, i7 = 0;
+ i1 = STACKTOP;
+ i3 = HEAP32[i2 + 16 >> 2] | 0;
+ do {
+ if ((i6 | 0) <= 0) {
+ if (!((i6 | 0) < -1000999)) {
+ i5 = (HEAP32[i2 + 8 >> 2] | 0) + (i6 << 4) | 0;
+ break;
+ }
+ if ((i6 | 0) == -1001e3) {
+ i5 = (HEAP32[i2 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i7 = -1001e3 - i6 | 0;
+ i6 = HEAP32[i3 >> 2] | 0;
+ if ((HEAP32[i6 + 8 >> 2] | 0) != 22 ? (i5 = HEAP32[i6 >> 2] | 0, (i7 | 0) <= (HEAPU8[i5 + 6 | 0] | 0 | 0)) : 0) {
+ i5 = i5 + (i7 + -1 << 4) + 16 | 0;
+ } else {
+ i5 = 5192;
+ }
+ } else {
+ i5 = (HEAP32[i3 >> 2] | 0) + (i6 << 4) | 0;
+ i5 = i5 >>> 0 < (HEAP32[i2 + 8 >> 2] | 0) >>> 0 ? i5 : 5192;
+ }
+ } while (0);
+ do {
+ if ((i4 | 0) <= 0) {
+ if (!((i4 | 0) < -1000999)) {
+ i2 = (HEAP32[i2 + 8 >> 2] | 0) + (i4 << 4) | 0;
+ break;
+ }
+ if ((i4 | 0) == -1001e3) {
+ i2 = (HEAP32[i2 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i2 = -1001e3 - i4 | 0;
+ i3 = HEAP32[i3 >> 2] | 0;
+ if ((HEAP32[i3 + 8 >> 2] | 0) == 22) {
+ i7 = 0;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ i3 = HEAP32[i3 >> 2] | 0;
+ if ((i2 | 0) > (HEAPU8[i3 + 6 | 0] | 0 | 0)) {
+ i7 = 0;
+ STACKTOP = i1;
+ return i7 | 0;
+ } else {
+ i2 = i3 + (i2 + -1 << 4) + 16 | 0;
+ break;
+ }
+ } else {
+ i3 = (HEAP32[i3 >> 2] | 0) + (i4 << 4) | 0;
+ i2 = i3 >>> 0 < (HEAP32[i2 + 8 >> 2] | 0) >>> 0 ? i3 : 5192;
+ }
+ } while (0);
+ if ((i5 | 0) == 5192 | (i2 | 0) == 5192) {
+ i7 = 0;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ if ((HEAP32[i5 + 8 >> 2] | 0) == (HEAP32[i2 + 8 >> 2] | 0)) {
+ i2 = (_luaV_equalobj_(0, i5, i2) | 0) != 0;
+ } else {
+ i2 = 0;
+ }
+ i7 = i2 & 1;
+ STACKTOP = i1;
+ return i7 | 0;
+}
+function _luaO_chunkid(i1, i4, i6) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i6 = i6 | 0;
+ var i2 = 0, i3 = 0, i5 = 0, i7 = 0, i8 = 0, i9 = 0;
+ i2 = STACKTOP;
+ i3 = _strlen(i4 | 0) | 0;
+ i5 = HEAP8[i4] | 0;
+ if (i5 << 24 >> 24 == 64) {
+ if (i3 >>> 0 > i6 >>> 0) {
+ HEAP8[i1 + 0 | 0] = HEAP8[5552 | 0] | 0;
+ HEAP8[i1 + 1 | 0] = HEAP8[5553 | 0] | 0;
+ HEAP8[i1 + 2 | 0] = HEAP8[5554 | 0] | 0;
+ _memcpy(i1 + 3 | 0, i4 + (4 - i6 + i3) | 0, i6 + -3 | 0) | 0;
+ STACKTOP = i2;
+ return;
+ } else {
+ _memcpy(i1 | 0, i4 + 1 | 0, i3 | 0) | 0;
+ STACKTOP = i2;
+ return;
+ }
+ } else if (i5 << 24 >> 24 == 61) {
+ i4 = i4 + 1 | 0;
+ if (i3 >>> 0 > i6 >>> 0) {
+ i9 = i6 + -1 | 0;
+ _memcpy(i1 | 0, i4 | 0, i9 | 0) | 0;
+ HEAP8[i1 + i9 | 0] = 0;
+ STACKTOP = i2;
+ return;
+ } else {
+ _memcpy(i1 | 0, i4 | 0, i3 | 0) | 0;
+ STACKTOP = i2;
+ return;
+ }
+ } else {
+ i5 = _strchr(i4, 10) | 0;
+ i9 = i1 + 0 | 0;
+ i8 = 5560 | 0;
+ i7 = i9 + 9 | 0;
+ do {
+ HEAP8[i9] = HEAP8[i8] | 0;
+ i9 = i9 + 1 | 0;
+ i8 = i8 + 1 | 0;
+ } while ((i9 | 0) < (i7 | 0));
+ i7 = i1 + 9 | 0;
+ i6 = i6 + -15 | 0;
+ i8 = (i5 | 0) == 0;
+ if (i3 >>> 0 < i6 >>> 0 & i8) {
+ _memcpy(i7 | 0, i4 | 0, i3 | 0) | 0;
+ i3 = i3 + 9 | 0;
+ } else {
+ if (!i8) {
+ i3 = i5 - i4 | 0;
+ }
+ i3 = i3 >>> 0 > i6 >>> 0 ? i6 : i3;
+ _memcpy(i7 | 0, i4 | 0, i3 | 0) | 0;
+ i9 = i1 + (i3 + 9) | 0;
+ HEAP8[i9 + 0 | 0] = HEAP8[5552 | 0] | 0;
+ HEAP8[i9 + 1 | 0] = HEAP8[5553 | 0] | 0;
+ HEAP8[i9 + 2 | 0] = HEAP8[5554 | 0] | 0;
+ i3 = i3 + 12 | 0;
+ }
+ i9 = i1 + i3 | 0;
+ HEAP8[i9 + 0 | 0] = HEAP8[5576 | 0] | 0;
+ HEAP8[i9 + 1 | 0] = HEAP8[5577 | 0] | 0;
+ HEAP8[i9 + 2 | 0] = HEAP8[5578 | 0] | 0;
+ STACKTOP = i2;
+ return;
+ }
+}
+function _luaS_resize(i4, i1) {
+ i4 = i4 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0;
+ i3 = STACKTOP;
+ i5 = HEAP32[i4 + 12 >> 2] | 0;
+ i2 = i5 + 24 | 0;
+ _luaC_runtilstate(i4, -5);
+ i5 = i5 + 32 | 0;
+ i8 = HEAP32[i5 >> 2] | 0;
+ L1 : do {
+ if ((i8 | 0) < (i1 | 0)) {
+ if ((i1 + 1 | 0) >>> 0 > 1073741823) {
+ _luaM_toobig(i4);
+ }
+ i7 = _luaM_realloc_(i4, HEAP32[i2 >> 2] | 0, i8 << 2, i1 << 2) | 0;
+ HEAP32[i2 >> 2] = i7;
+ i6 = HEAP32[i5 >> 2] | 0;
+ if ((i6 | 0) < (i1 | 0)) {
+ i8 = i6;
+ while (1) {
+ HEAP32[i7 + (i8 << 2) >> 2] = 0;
+ i8 = i8 + 1 | 0;
+ if ((i8 | 0) == (i1 | 0)) {
+ i8 = i6;
+ break L1;
+ }
+ i7 = HEAP32[i2 >> 2] | 0;
+ }
+ } else {
+ i8 = i6;
+ }
+ }
+ } while (0);
+ if ((i8 | 0) > 0) {
+ i6 = i1 + -1 | 0;
+ i7 = 0;
+ do {
+ i10 = (HEAP32[i2 >> 2] | 0) + (i7 << 2) | 0;
+ i9 = HEAP32[i10 >> 2] | 0;
+ HEAP32[i10 >> 2] = 0;
+ if ((i9 | 0) != 0) {
+ while (1) {
+ i8 = HEAP32[i9 >> 2] | 0;
+ i10 = HEAP32[i9 + 8 >> 2] & i6;
+ HEAP32[i9 >> 2] = HEAP32[(HEAP32[i2 >> 2] | 0) + (i10 << 2) >> 2];
+ HEAP32[(HEAP32[i2 >> 2] | 0) + (i10 << 2) >> 2] = i9;
+ i10 = i9 + 5 | 0;
+ HEAP8[i10] = HEAP8[i10] & 191;
+ if ((i8 | 0) == 0) {
+ break;
+ } else {
+ i9 = i8;
+ }
+ }
+ i8 = HEAP32[i5 >> 2] | 0;
+ }
+ i7 = i7 + 1 | 0;
+ } while ((i7 | 0) < (i8 | 0));
+ }
+ if ((i8 | 0) <= (i1 | 0)) {
+ HEAP32[i5 >> 2] = i1;
+ STACKTOP = i3;
+ return;
+ }
+ if ((i1 + 1 | 0) >>> 0 > 1073741823) {
+ _luaM_toobig(i4);
+ }
+ HEAP32[i2 >> 2] = _luaM_realloc_(i4, HEAP32[i2 >> 2] | 0, i8 << 2, i1 << 2) | 0;
+ HEAP32[i5 >> 2] = i1;
+ STACKTOP = i3;
+ return;
+}
+function _luaD_poscall(i6, i7) {
+ i6 = i6 | 0;
+ i7 = i7 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0;
+ i1 = STACKTOP;
+ i4 = i6 + 16 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ i5 = HEAPU8[i6 + 40 | 0] | 0;
+ if ((i5 & 6 | 0) == 0) {
+ i8 = i3 + 8 | 0;
+ } else {
+ if ((i5 & 2 | 0) != 0) {
+ i8 = i6 + 28 | 0;
+ i7 = i7 - (HEAP32[i8 >> 2] | 0) | 0;
+ _luaD_hook(i6, 1, -1);
+ i7 = (HEAP32[i8 >> 2] | 0) + i7 | 0;
+ }
+ i8 = i3 + 8 | 0;
+ HEAP32[i6 + 20 >> 2] = HEAP32[(HEAP32[i8 >> 2] | 0) + 28 >> 2];
+ }
+ i5 = HEAP32[i3 >> 2] | 0;
+ i9 = HEAP16[i3 + 16 >> 1] | 0;
+ i3 = i9 << 16 >> 16;
+ HEAP32[i4 >> 2] = HEAP32[i8 >> 2];
+ i4 = i6 + 8 | 0;
+ if (i9 << 16 >> 16 == 0) {
+ i9 = i5;
+ HEAP32[i4 >> 2] = i9;
+ i9 = i3 + 1 | 0;
+ STACKTOP = i1;
+ return i9 | 0;
+ } else {
+ i6 = i3;
+ }
+ while (1) {
+ if (!(i7 >>> 0 < (HEAP32[i4 >> 2] | 0) >>> 0)) {
+ break;
+ }
+ i8 = i5 + 16 | 0;
+ i11 = i7;
+ i10 = HEAP32[i11 + 4 >> 2] | 0;
+ i9 = i5;
+ HEAP32[i9 >> 2] = HEAP32[i11 >> 2];
+ HEAP32[i9 + 4 >> 2] = i10;
+ HEAP32[i5 + 8 >> 2] = HEAP32[i7 + 8 >> 2];
+ i6 = i6 + -1 | 0;
+ if ((i6 | 0) == 0) {
+ i2 = 12;
+ break;
+ } else {
+ i7 = i7 + 16 | 0;
+ i5 = i8;
+ }
+ }
+ if ((i2 | 0) == 12) {
+ HEAP32[i4 >> 2] = i8;
+ i11 = i3 + 1 | 0;
+ STACKTOP = i1;
+ return i11 | 0;
+ }
+ if ((i6 | 0) > 0) {
+ i2 = i6;
+ i7 = i5;
+ } else {
+ i11 = i5;
+ HEAP32[i4 >> 2] = i11;
+ i11 = i3 + 1 | 0;
+ STACKTOP = i1;
+ return i11 | 0;
+ }
+ while (1) {
+ i2 = i2 + -1 | 0;
+ HEAP32[i7 + 8 >> 2] = 0;
+ if ((i2 | 0) <= 0) {
+ break;
+ } else {
+ i7 = i7 + 16 | 0;
+ }
+ }
+ i11 = i5 + (i6 << 4) | 0;
+ HEAP32[i4 >> 2] = i11;
+ i11 = i3 + 1 | 0;
+ STACKTOP = i1;
+ return i11 | 0;
+}
+function _lua_rawset(i1, i4) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ var i2 = 0, i3 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0;
+ i2 = STACKTOP;
+ i5 = HEAP32[i1 + 16 >> 2] | 0;
+ do {
+ if ((i4 | 0) <= 0) {
+ if (!((i4 | 0) < -1000999)) {
+ i5 = (HEAP32[i1 + 8 >> 2] | 0) + (i4 << 4) | 0;
+ break;
+ }
+ if ((i4 | 0) == -1001e3) {
+ i5 = (HEAP32[i1 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i4 = -1001e3 - i4 | 0;
+ i5 = HEAP32[i5 >> 2] | 0;
+ if ((HEAP32[i5 + 8 >> 2] | 0) != 22 ? (i3 = HEAP32[i5 >> 2] | 0, (i4 | 0) <= (HEAPU8[i3 + 6 | 0] | 0 | 0)) : 0) {
+ i5 = i3 + (i4 + -1 << 4) + 16 | 0;
+ } else {
+ i5 = 5192;
+ }
+ } else {
+ i3 = (HEAP32[i5 >> 2] | 0) + (i4 << 4) | 0;
+ i5 = i3 >>> 0 < (HEAP32[i1 + 8 >> 2] | 0) >>> 0 ? i3 : 5192;
+ }
+ } while (0);
+ i4 = i1 + 8 | 0;
+ i6 = HEAP32[i4 >> 2] | 0;
+ i3 = _luaH_set(i1, HEAP32[i5 >> 2] | 0, i6 + -32 | 0) | 0;
+ i9 = i6 + -16 | 0;
+ i8 = HEAP32[i9 + 4 >> 2] | 0;
+ i7 = i3;
+ HEAP32[i7 >> 2] = HEAP32[i9 >> 2];
+ HEAP32[i7 + 4 >> 2] = i8;
+ HEAP32[i3 + 8 >> 2] = HEAP32[i6 + -8 >> 2];
+ HEAP8[(HEAP32[i5 >> 2] | 0) + 6 | 0] = 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP32[i3 + -8 >> 2] & 64 | 0) == 0) {
+ i9 = i3;
+ i9 = i9 + -32 | 0;
+ HEAP32[i4 >> 2] = i9;
+ STACKTOP = i2;
+ return;
+ }
+ if ((HEAP8[(HEAP32[i3 + -16 >> 2] | 0) + 5 | 0] & 3) == 0) {
+ i9 = i3;
+ i9 = i9 + -32 | 0;
+ HEAP32[i4 >> 2] = i9;
+ STACKTOP = i2;
+ return;
+ }
+ i5 = HEAP32[i5 >> 2] | 0;
+ if ((HEAP8[i5 + 5 | 0] & 4) == 0) {
+ i9 = i3;
+ i9 = i9 + -32 | 0;
+ HEAP32[i4 >> 2] = i9;
+ STACKTOP = i2;
+ return;
+ }
+ _luaC_barrierback_(i1, i5);
+ i9 = HEAP32[i4 >> 2] | 0;
+ i9 = i9 + -32 | 0;
+ HEAP32[i4 >> 2] = i9;
+ STACKTOP = i2;
+ return;
+}
+function _saveSetjmp(i4, i3, i1) {
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ var i2 = 0;
+ setjmpId = setjmpId + 1 | 0;
+ HEAP32[i4 >> 2] = setjmpId;
+ while ((i2 | 0) < 40) {
+ if ((HEAP32[i1 + (i2 << 2) >> 2] | 0) == 0) {
+ HEAP32[i1 + (i2 << 2) >> 2] = setjmpId;
+ HEAP32[i1 + ((i2 << 2) + 4) >> 2] = i3;
+ HEAP32[i1 + ((i2 << 2) + 8) >> 2] = 0;
+ return 0;
+ }
+ i2 = i2 + 2 | 0;
+ }
+ _putchar(116);
+ _putchar(111);
+ _putchar(111);
+ _putchar(32);
+ _putchar(109);
+ _putchar(97);
+ _putchar(110);
+ _putchar(121);
+ _putchar(32);
+ _putchar(115);
+ _putchar(101);
+ _putchar(116);
+ _putchar(106);
+ _putchar(109);
+ _putchar(112);
+ _putchar(115);
+ _putchar(32);
+ _putchar(105);
+ _putchar(110);
+ _putchar(32);
+ _putchar(97);
+ _putchar(32);
+ _putchar(102);
+ _putchar(117);
+ _putchar(110);
+ _putchar(99);
+ _putchar(116);
+ _putchar(105);
+ _putchar(111);
+ _putchar(110);
+ _putchar(32);
+ _putchar(99);
+ _putchar(97);
+ _putchar(108);
+ _putchar(108);
+ _putchar(44);
+ _putchar(32);
+ _putchar(98);
+ _putchar(117);
+ _putchar(105);
+ _putchar(108);
+ _putchar(100);
+ _putchar(32);
+ _putchar(119);
+ _putchar(105);
+ _putchar(116);
+ _putchar(104);
+ _putchar(32);
+ _putchar(97);
+ _putchar(32);
+ _putchar(104);
+ _putchar(105);
+ _putchar(103);
+ _putchar(104);
+ _putchar(101);
+ _putchar(114);
+ _putchar(32);
+ _putchar(118);
+ _putchar(97);
+ _putchar(108);
+ _putchar(117);
+ _putchar(101);
+ _putchar(32);
+ _putchar(102);
+ _putchar(111);
+ _putchar(114);
+ _putchar(32);
+ _putchar(77);
+ _putchar(65);
+ _putchar(88);
+ _putchar(95);
+ _putchar(83);
+ _putchar(69);
+ _putchar(84);
+ _putchar(74);
+ _putchar(77);
+ _putchar(80);
+ _putchar(83);
+ _putchar(10);
+ abort(0);
+ return 0;
+}
+function _lua_newthread(i5) {
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0;
+ i1 = STACKTOP;
+ i3 = i5 + 12 | 0;
+ if ((HEAP32[(HEAP32[i3 >> 2] | 0) + 12 >> 2] | 0) > 0) {
+ _luaC_step(i5);
+ }
+ i2 = _luaC_newobj(i5, 8, 112, 0, 0) | 0;
+ i6 = i5 + 8 | 0;
+ i4 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i4 >> 2] = i2;
+ HEAP32[i4 + 8 >> 2] = 72;
+ HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + 16;
+ HEAP32[i2 + 12 >> 2] = HEAP32[i3 >> 2];
+ i6 = i2 + 28 | 0;
+ HEAP32[i6 >> 2] = 0;
+ i4 = i2 + 16 | 0;
+ HEAP32[i4 >> 2] = 0;
+ i3 = i2 + 32 | 0;
+ HEAP32[i3 >> 2] = 0;
+ HEAP32[i2 + 64 >> 2] = 0;
+ HEAP16[i2 + 38 >> 1] = 0;
+ i9 = i2 + 52 | 0;
+ HEAP32[i9 >> 2] = 0;
+ i8 = i2 + 40 | 0;
+ HEAP8[i8] = 0;
+ i10 = i2 + 44 | 0;
+ HEAP32[i10 >> 2] = 0;
+ HEAP8[i2 + 41 | 0] = 1;
+ i7 = i2 + 48 | 0;
+ HEAP32[i7 >> 2] = 0;
+ HEAP32[i2 + 56 >> 2] = 0;
+ HEAP16[i2 + 36 >> 1] = 1;
+ HEAP8[i2 + 6 | 0] = 0;
+ HEAP32[i2 + 68 >> 2] = 0;
+ HEAP8[i8] = HEAP8[i5 + 40 | 0] | 0;
+ i8 = HEAP32[i5 + 44 >> 2] | 0;
+ HEAP32[i10 >> 2] = i8;
+ HEAP32[i9 >> 2] = HEAP32[i5 + 52 >> 2];
+ HEAP32[i7 >> 2] = i8;
+ i5 = _luaM_realloc_(i5, 0, 0, 640) | 0;
+ HEAP32[i6 >> 2] = i5;
+ HEAP32[i3 >> 2] = 40;
+ i6 = 0;
+ do {
+ HEAP32[i5 + (i6 << 4) + 8 >> 2] = 0;
+ i6 = i6 + 1 | 0;
+ } while ((i6 | 0) != 40);
+ HEAP32[i2 + 24 >> 2] = i5 + ((HEAP32[i3 >> 2] | 0) + -5 << 4);
+ i10 = i2 + 72 | 0;
+ HEAP32[i2 + 80 >> 2] = 0;
+ HEAP32[i2 + 84 >> 2] = 0;
+ HEAP8[i2 + 90 | 0] = 0;
+ HEAP32[i10 >> 2] = i5;
+ HEAP32[i2 + 8 >> 2] = i5 + 16;
+ HEAP32[i5 + 8 >> 2] = 0;
+ HEAP32[i2 + 76 >> 2] = i5 + 336;
+ HEAP32[i4 >> 2] = i10;
+ STACKTOP = i1;
+ return i2 | 0;
+}
+function _luaK_self(i2, i5, i3) {
+ i2 = i2 | 0;
+ i5 = i5 | 0;
+ i3 = i3 | 0;
+ var i1 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0;
+ i1 = STACKTOP;
+ _luaK_dischargevars(i2, i5);
+ if ((HEAP32[i5 >> 2] | 0) == 6) {
+ i6 = i5 + 8 | 0;
+ i8 = HEAP32[i6 >> 2] | 0;
+ if ((HEAP32[i5 + 16 >> 2] | 0) != (HEAP32[i5 + 20 >> 2] | 0)) {
+ if ((i8 | 0) < (HEAPU8[i2 + 46 | 0] | 0 | 0)) {
+ i7 = 6;
+ } else {
+ _exp2reg(i2, i5, i8);
+ }
+ }
+ } else {
+ i6 = i5 + 8 | 0;
+ i7 = 6;
+ }
+ if ((i7 | 0) == 6) {
+ _luaK_exp2nextreg(i2, i5);
+ }
+ i8 = HEAP32[i6 >> 2] | 0;
+ if (((HEAP32[i5 >> 2] | 0) == 6 ? (i8 & 256 | 0) == 0 : 0) ? (HEAPU8[i2 + 46 | 0] | 0 | 0) <= (i8 | 0) : 0) {
+ i10 = i2 + 48 | 0;
+ HEAP8[i10] = (HEAP8[i10] | 0) + -1 << 24 >> 24;
+ }
+ i7 = i2 + 48 | 0;
+ HEAP32[i6 >> 2] = HEAPU8[i7] | 0;
+ HEAP32[i5 >> 2] = 6;
+ i10 = HEAP8[i7] | 0;
+ i5 = (i10 & 255) + 2 | 0;
+ i9 = (HEAP32[i2 >> 2] | 0) + 78 | 0;
+ do {
+ if (i5 >>> 0 > (HEAPU8[i9] | 0) >>> 0) {
+ if (i5 >>> 0 > 249) {
+ _luaX_syntaxerror(HEAP32[i2 + 12 >> 2] | 0, 10536);
+ } else {
+ HEAP8[i9] = i5;
+ i4 = HEAP8[i7] | 0;
+ break;
+ }
+ } else {
+ i4 = i10;
+ }
+ } while (0);
+ HEAP8[i7] = (i4 & 255) + 2;
+ i10 = HEAP32[i6 >> 2] | 0;
+ _luaK_code(i2, i8 << 23 | i10 << 6 | (_luaK_exp2RK(i2, i3) | 0) << 14 | 12) | 0;
+ if ((HEAP32[i3 >> 2] | 0) != 6) {
+ STACKTOP = i1;
+ return;
+ }
+ i3 = HEAP32[i3 + 8 >> 2] | 0;
+ if ((i3 & 256 | 0) != 0) {
+ STACKTOP = i1;
+ return;
+ }
+ if ((HEAPU8[i2 + 46 | 0] | 0 | 0) > (i3 | 0)) {
+ STACKTOP = i1;
+ return;
+ }
+ HEAP8[i7] = (HEAP8[i7] | 0) + -1 << 24 >> 24;
+ STACKTOP = i1;
+ return;
+}
+function _luaD_rawrunprotected(i10, i9, i11) {
+ i10 = i10 | 0;
+ i9 = i9 | 0;
+ i11 = i11 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i12 = 0, i13 = 0;
+ i7 = STACKTOP;
+ STACKTOP = STACKTOP + 176 | 0;
+ i8 = STACKTOP;
+ STACKTOP = STACKTOP + 168 | 0;
+ HEAP32[i8 >> 2] = 0;
+ i6 = i7;
+ i5 = i10 + 38 | 0;
+ i4 = HEAP16[i5 >> 1] | 0;
+ i1 = i6 + 160 | 0;
+ HEAP32[i1 >> 2] = 0;
+ i3 = i10 + 64 | 0;
+ HEAP32[i6 >> 2] = HEAP32[i3 >> 2];
+ HEAP32[i3 >> 2] = i6;
+ _saveSetjmp(i6 + 4 | 0, 1, i8 | 0) | 0;
+ __THREW__ = 0;
+ i13 = __THREW__;
+ __THREW__ = 0;
+ if ((i13 | 0) != 0 & (threwValue | 0) != 0) {
+ i12 = _testSetjmp(HEAP32[i13 >> 2] | 0, i8) | 0;
+ if ((i12 | 0) == 0) {
+ _longjmp(i13 | 0, threwValue | 0);
+ }
+ tempRet0 = threwValue;
+ } else {
+ i12 = -1;
+ }
+ if ((i12 | 0) == 1) {
+ i12 = tempRet0;
+ } else {
+ i12 = 0;
+ }
+ while (1) {
+ if ((i12 | 0) != 0) {
+ i2 = 6;
+ break;
+ }
+ __THREW__ = 0;
+ invoke_vii(i9 | 0, i10 | 0, i11 | 0);
+ i13 = __THREW__;
+ __THREW__ = 0;
+ if ((i13 | 0) != 0 & (threwValue | 0) != 0) {
+ i12 = _testSetjmp(HEAP32[i13 >> 2] | 0, i8) | 0;
+ if ((i12 | 0) == 0) {
+ _longjmp(i13 | 0, threwValue | 0);
+ }
+ tempRet0 = threwValue;
+ } else {
+ i12 = -1;
+ }
+ if ((i12 | 0) == 1) {
+ i12 = tempRet0;
+ } else {
+ break;
+ }
+ }
+ if ((i2 | 0) == 6) {
+ i13 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i3 >> 2] = i13;
+ HEAP16[i5 >> 1] = i4;
+ i13 = HEAP32[i1 >> 2] | 0;
+ STACKTOP = i7;
+ return i13 | 0;
+ }
+ i13 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i3 >> 2] = i13;
+ HEAP16[i5 >> 1] = i4;
+ i13 = HEAP32[i1 >> 2] | 0;
+ STACKTOP = i7;
+ return i13 | 0;
+}
+function _luaB_tonumber(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, d6 = 0.0, i7 = 0, d8 = 0.0, i9 = 0, i10 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i2 + 4 | 0;
+ i4 = i2;
+ do {
+ if ((_lua_type(i1, 2) | 0) >= 1) {
+ i9 = _luaL_checklstring(i1, 1, i4) | 0;
+ i3 = i9 + (HEAP32[i4 >> 2] | 0) | 0;
+ i5 = _luaL_checkinteger(i1, 2) | 0;
+ if (!((i5 + -2 | 0) >>> 0 < 35)) {
+ _luaL_argerror(i1, 2, 9648) | 0;
+ }
+ i10 = _strspn(i9, 9672) | 0;
+ i7 = i9 + i10 | 0;
+ i4 = HEAP8[i7] | 0;
+ if (i4 << 24 >> 24 == 43) {
+ i4 = 0;
+ i7 = i9 + (i10 + 1) | 0;
+ } else if (i4 << 24 >> 24 == 45) {
+ i4 = 1;
+ i7 = i9 + (i10 + 1) | 0;
+ } else {
+ i4 = 0;
+ }
+ if ((_isalnum(HEAPU8[i7] | 0 | 0) | 0) != 0) {
+ d6 = +(i5 | 0);
+ d8 = 0.0;
+ do {
+ i9 = HEAP8[i7] | 0;
+ i10 = i9 & 255;
+ if ((i10 + -48 | 0) >>> 0 < 10) {
+ i9 = (i9 << 24 >> 24) + -48 | 0;
+ } else {
+ i9 = (_toupper(i10 | 0) | 0) + -55 | 0;
+ }
+ if ((i9 | 0) >= (i5 | 0)) {
+ break;
+ }
+ d8 = d6 * d8 + +(i9 | 0);
+ i7 = i7 + 1 | 0;
+ } while ((_isalnum(HEAPU8[i7] | 0 | 0) | 0) != 0);
+ if ((i7 + (_strspn(i7, 9672) | 0) | 0) == (i3 | 0)) {
+ if ((i4 | 0) != 0) {
+ d8 = -d8;
+ }
+ _lua_pushnumber(i1, d8);
+ STACKTOP = i2;
+ return 1;
+ }
+ }
+ } else {
+ d6 = +_lua_tonumberx(i1, 1, i3);
+ if ((HEAP32[i3 >> 2] | 0) == 0) {
+ _luaL_checkany(i1, 1);
+ break;
+ }
+ _lua_pushnumber(i1, d6);
+ STACKTOP = i2;
+ return 1;
+ }
+ } while (0);
+ _lua_pushnil(i1);
+ STACKTOP = i2;
+ return 1;
+}
+function _luaK_storevar(i1, i5, i3) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0, i6 = 0, i7 = 0;
+ i2 = STACKTOP;
+ i7 = HEAP32[i5 >> 2] | 0;
+ if ((i7 | 0) == 7) {
+ if (((HEAP32[i3 >> 2] | 0) == 6 ? (i6 = HEAP32[i3 + 8 >> 2] | 0, (i6 & 256 | 0) == 0) : 0) ? (HEAPU8[i1 + 46 | 0] | 0) <= (i6 | 0) : 0) {
+ i7 = i1 + 48 | 0;
+ HEAP8[i7] = (HEAP8[i7] | 0) + -1 << 24 >> 24;
+ }
+ _exp2reg(i1, i3, HEAP32[i5 + 8 >> 2] | 0);
+ STACKTOP = i2;
+ return;
+ } else if ((i7 | 0) == 9) {
+ i4 = i5 + 8 | 0;
+ i7 = (HEAP8[i4 + 3 | 0] | 0) == 7 ? 10 : 8;
+ i6 = _luaK_exp2RK(i1, i3) | 0;
+ _luaK_code(i1, i6 << 14 | i7 | HEAPU8[i4 + 2 | 0] << 6 | HEAPU16[i4 >> 1] << 23) | 0;
+ } else if ((i7 | 0) == 8) {
+ _luaK_dischargevars(i1, i3);
+ if ((HEAP32[i3 >> 2] | 0) == 6) {
+ i6 = i3 + 8 | 0;
+ i7 = HEAP32[i6 >> 2] | 0;
+ if ((HEAP32[i3 + 16 >> 2] | 0) != (HEAP32[i3 + 20 >> 2] | 0)) {
+ if ((i7 | 0) < (HEAPU8[i1 + 46 | 0] | 0)) {
+ i4 = 12;
+ } else {
+ _exp2reg(i1, i3, i7);
+ i7 = HEAP32[i6 >> 2] | 0;
+ }
+ }
+ } else {
+ i6 = i3 + 8 | 0;
+ i4 = 12;
+ }
+ if ((i4 | 0) == 12) {
+ _luaK_exp2nextreg(i1, i3);
+ i7 = HEAP32[i6 >> 2] | 0;
+ }
+ _luaK_code(i1, i7 << 6 | HEAP32[i5 + 8 >> 2] << 23 | 9) | 0;
+ }
+ if ((HEAP32[i3 >> 2] | 0) != 6) {
+ STACKTOP = i2;
+ return;
+ }
+ i3 = HEAP32[i3 + 8 >> 2] | 0;
+ if ((i3 & 256 | 0) != 0) {
+ STACKTOP = i2;
+ return;
+ }
+ if ((HEAPU8[i1 + 46 | 0] | 0) > (i3 | 0)) {
+ STACKTOP = i2;
+ return;
+ }
+ i7 = i1 + 48 | 0;
+ HEAP8[i7] = (HEAP8[i7] | 0) + -1 << 24 >> 24;
+ STACKTOP = i2;
+ return;
+}
+function _closegoto(i10, i3, i9) {
+ i10 = i10 | 0;
+ i3 = i3 | 0;
+ i9 = i9 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i11 = 0, i12 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i7 = i1;
+ i4 = HEAP32[i10 + 48 >> 2] | 0;
+ i6 = HEAP32[i10 + 64 >> 2] | 0;
+ i2 = i6 + 12 | 0;
+ i5 = HEAP32[i2 >> 2] | 0;
+ i8 = HEAP8[i5 + (i3 << 4) + 12 | 0] | 0;
+ if ((i8 & 255) < (HEAPU8[i9 + 12 | 0] | 0)) {
+ i11 = HEAP32[i10 + 52 >> 2] | 0;
+ i12 = HEAP32[i5 + (i3 << 4) + 8 >> 2] | 0;
+ i8 = (HEAP32[(HEAP32[(HEAP32[i4 >> 2] | 0) + 24 >> 2] | 0) + ((HEAP16[(HEAP32[HEAP32[(HEAP32[i4 + 12 >> 2] | 0) + 64 >> 2] >> 2] | 0) + ((HEAP32[i4 + 40 >> 2] | 0) + (i8 & 255) << 1) >> 1] | 0) * 12 | 0) >> 2] | 0) + 16 | 0;
+ HEAP32[i7 >> 2] = (HEAP32[i5 + (i3 << 4) >> 2] | 0) + 16;
+ HEAP32[i7 + 4 >> 2] = i12;
+ HEAP32[i7 + 8 >> 2] = i8;
+ _semerror(i10, _luaO_pushfstring(i11, 6248, i7) | 0);
+ }
+ _luaK_patchlist(i4, HEAP32[i5 + (i3 << 4) + 4 >> 2] | 0, HEAP32[i9 + 4 >> 2] | 0);
+ i4 = i6 + 16 | 0;
+ i5 = (HEAP32[i4 >> 2] | 0) + -1 | 0;
+ if ((i5 | 0) <= (i3 | 0)) {
+ i12 = i5;
+ HEAP32[i4 >> 2] = i12;
+ STACKTOP = i1;
+ return;
+ }
+ do {
+ i12 = HEAP32[i2 >> 2] | 0;
+ i5 = i12 + (i3 << 4) | 0;
+ i3 = i3 + 1 | 0;
+ i12 = i12 + (i3 << 4) | 0;
+ HEAP32[i5 + 0 >> 2] = HEAP32[i12 + 0 >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[i12 + 4 >> 2];
+ HEAP32[i5 + 8 >> 2] = HEAP32[i12 + 8 >> 2];
+ HEAP32[i5 + 12 >> 2] = HEAP32[i12 + 12 >> 2];
+ i5 = (HEAP32[i4 >> 2] | 0) + -1 | 0;
+ } while ((i3 | 0) < (i5 | 0));
+ HEAP32[i4 >> 2] = i5;
+ STACKTOP = i1;
+ return;
+}
+function _luaM_growaux_(i4, i5, i1, i7, i8, i9) {
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ i1 = i1 | 0;
+ i7 = i7 | 0;
+ i8 = i8 | 0;
+ i9 = i9 | 0;
+ var i2 = 0, i3 = 0, i6 = 0, i10 = 0, i11 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i10 = i2;
+ i6 = HEAP32[i1 >> 2] | 0;
+ if ((i6 | 0) >= ((i8 | 0) / 2 | 0 | 0)) {
+ if ((i6 | 0) < (i8 | 0)) {
+ i3 = i8;
+ } else {
+ HEAP32[i10 >> 2] = i9;
+ HEAP32[i10 + 4 >> 2] = i8;
+ _luaG_runerror(i4, 4112, i10);
+ }
+ } else {
+ i3 = i6 << 1;
+ i3 = (i3 | 0) < 4 ? 4 : i3;
+ }
+ if ((i3 + 1 | 0) >>> 0 > (4294967293 / (i7 >>> 0) | 0) >>> 0) {
+ _luaM_toobig(i4);
+ }
+ i6 = Math_imul(i6, i7) | 0;
+ i8 = Math_imul(i3, i7) | 0;
+ i9 = HEAP32[i4 + 12 >> 2] | 0;
+ i7 = (i5 | 0) != 0;
+ i11 = i9 + 4 | 0;
+ i10 = FUNCTION_TABLE_iiiii[HEAP32[i9 >> 2] & 3](HEAP32[i11 >> 2] | 0, i5, i6, i8) | 0;
+ if ((i10 | 0) != 0 | (i8 | 0) == 0) {
+ i5 = i9 + 12 | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ i6 = 0 - i6 | 0;
+ i11 = i7 ? i6 : 0;
+ i11 = i11 + i8 | 0;
+ i11 = i11 + i4 | 0;
+ HEAP32[i5 >> 2] = i11;
+ HEAP32[i1 >> 2] = i3;
+ STACKTOP = i2;
+ return i10 | 0;
+ }
+ if ((HEAP8[i9 + 63 | 0] | 0) == 0) {
+ _luaD_throw(i4, 4);
+ }
+ _luaC_fullgc(i4, 1);
+ i10 = FUNCTION_TABLE_iiiii[HEAP32[i9 >> 2] & 3](HEAP32[i11 >> 2] | 0, i5, i6, i8) | 0;
+ if ((i10 | 0) == 0) {
+ _luaD_throw(i4, 4);
+ } else {
+ i5 = i9 + 12 | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ i6 = 0 - i6 | 0;
+ i11 = i7 ? i6 : 0;
+ i11 = i11 + i8 | 0;
+ i11 = i11 + i4 | 0;
+ HEAP32[i5 >> 2] = i11;
+ HEAP32[i1 >> 2] = i3;
+ STACKTOP = i2;
+ return i10 | 0;
+ }
+ return 0;
+}
+function _luaD_hook(i5, i14, i13) {
+ i5 = i5 | 0;
+ i14 = i14 | 0;
+ i13 = i13 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i15 = 0, i16 = 0;
+ i11 = STACKTOP;
+ STACKTOP = STACKTOP + 112 | 0;
+ i4 = i11;
+ i3 = HEAP32[i5 + 52 >> 2] | 0;
+ if ((i3 | 0) == 0) {
+ STACKTOP = i11;
+ return;
+ }
+ i8 = i5 + 41 | 0;
+ if ((HEAP8[i8] | 0) == 0) {
+ STACKTOP = i11;
+ return;
+ }
+ i10 = HEAP32[i5 + 16 >> 2] | 0;
+ i6 = i5 + 8 | 0;
+ i15 = HEAP32[i6 >> 2] | 0;
+ i1 = i5 + 28 | 0;
+ i16 = i15;
+ i12 = HEAP32[i1 >> 2] | 0;
+ i7 = i16 - i12 | 0;
+ i9 = i10 + 4 | 0;
+ i12 = (HEAP32[i9 >> 2] | 0) - i12 | 0;
+ HEAP32[i4 >> 2] = i14;
+ HEAP32[i4 + 20 >> 2] = i13;
+ HEAP32[i4 + 96 >> 2] = i10;
+ do {
+ if (((HEAP32[i5 + 24 >> 2] | 0) - i16 | 0) < 336) {
+ i14 = HEAP32[i5 + 32 >> 2] | 0;
+ if ((i14 | 0) > 1e6) {
+ _luaD_throw(i5, 6);
+ }
+ i13 = (i7 >> 4) + 25 | 0;
+ i14 = i14 << 1;
+ i14 = (i14 | 0) > 1e6 ? 1e6 : i14;
+ i13 = (i14 | 0) < (i13 | 0) ? i13 : i14;
+ if ((i13 | 0) > 1e6) {
+ _luaD_reallocstack(i5, 1000200);
+ _luaG_runerror(i5, 2224, i4);
+ } else {
+ _luaD_reallocstack(i5, i13);
+ i2 = HEAP32[i6 >> 2] | 0;
+ break;
+ }
+ } else {
+ i2 = i15;
+ }
+ } while (0);
+ HEAP32[i9 >> 2] = i2 + 320;
+ HEAP8[i8] = 0;
+ i16 = i10 + 18 | 0;
+ HEAP8[i16] = HEAPU8[i16] | 2;
+ FUNCTION_TABLE_vii[i3 & 15](i5, i4);
+ HEAP8[i8] = 1;
+ HEAP32[i9 >> 2] = (HEAP32[i1 >> 2] | 0) + i12;
+ HEAP32[i6 >> 2] = (HEAP32[i1 >> 2] | 0) + i7;
+ HEAP8[i16] = HEAP8[i16] & 253;
+ STACKTOP = i11;
+ return;
+}
+function _funcargs(i10, i2, i1) {
+ i10 = i10 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 32 | 0;
+ i6 = i3;
+ i9 = i10 + 48 | 0;
+ i5 = HEAP32[i9 >> 2] | 0;
+ i7 = i10 + 16 | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ if ((i8 | 0) == 289) {
+ i9 = _luaK_stringK(i5, HEAP32[i10 + 24 >> 2] | 0) | 0;
+ HEAP32[i6 + 16 >> 2] = -1;
+ HEAP32[i6 + 20 >> 2] = -1;
+ HEAP32[i6 >> 2] = 4;
+ HEAP32[i6 + 8 >> 2] = i9;
+ _luaX_next(i10);
+ } else if ((i8 | 0) == 40) {
+ _luaX_next(i10);
+ if ((HEAP32[i7 >> 2] | 0) == 41) {
+ HEAP32[i6 >> 2] = 0;
+ } else {
+ _subexpr(i10, i6, 0) | 0;
+ if ((HEAP32[i7 >> 2] | 0) == 44) {
+ do {
+ _luaX_next(i10);
+ _luaK_exp2nextreg(HEAP32[i9 >> 2] | 0, i6);
+ _subexpr(i10, i6, 0) | 0;
+ } while ((HEAP32[i7 >> 2] | 0) == 44);
+ }
+ _luaK_setreturns(i5, i6, -1);
+ }
+ _check_match(i10, 41, 40, i1);
+ } else if ((i8 | 0) == 123) {
+ _constructor(i10, i6);
+ } else {
+ _luaX_syntaxerror(i10, 6624);
+ }
+ i8 = i2 + 8 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ i9 = HEAP32[i6 >> 2] | 0;
+ if ((i9 | 0) == 0) {
+ i4 = 13;
+ } else if ((i9 | 0) == 13 | (i9 | 0) == 12) {
+ i6 = 0;
+ } else {
+ _luaK_exp2nextreg(i5, i6);
+ i4 = 13;
+ }
+ if ((i4 | 0) == 13) {
+ i6 = (HEAPU8[i5 + 48 | 0] | 0) - i7 | 0;
+ }
+ i10 = _luaK_codeABC(i5, 29, i7, i6, 2) | 0;
+ HEAP32[i2 + 16 >> 2] = -1;
+ HEAP32[i2 + 20 >> 2] = -1;
+ HEAP32[i2 >> 2] = 12;
+ HEAP32[i8 >> 2] = i10;
+ _luaK_fixline(i5, i1);
+ HEAP8[i5 + 48 | 0] = i7 + 1;
+ STACKTOP = i3;
+ return;
+}
+function _luaD_reallocstack(i3, i6) {
+ i3 = i3 | 0;
+ i6 = i6 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i5 = 0, i7 = 0, i8 = 0, i9 = 0;
+ i1 = STACKTOP;
+ i2 = i3 + 28 | 0;
+ i8 = HEAP32[i2 >> 2] | 0;
+ i7 = i3 + 32 | 0;
+ i9 = HEAP32[i7 >> 2] | 0;
+ if ((i6 + 1 | 0) >>> 0 > 268435455) {
+ _luaM_toobig(i3);
+ }
+ i5 = _luaM_realloc_(i3, i8, i9 << 4, i6 << 4) | 0;
+ HEAP32[i2 >> 2] = i5;
+ if ((i9 | 0) < (i6 | 0)) {
+ do {
+ HEAP32[i5 + (i9 << 4) + 8 >> 2] = 0;
+ i9 = i9 + 1 | 0;
+ } while ((i9 | 0) != (i6 | 0));
+ }
+ HEAP32[i7 >> 2] = i6;
+ HEAP32[i3 + 24 >> 2] = i5 + (i6 + -5 << 4);
+ i6 = i3 + 8 | 0;
+ HEAP32[i6 >> 2] = i5 + ((HEAP32[i6 >> 2] | 0) - i8 >> 4 << 4);
+ i6 = HEAP32[i3 + 56 >> 2] | 0;
+ if ((i6 | 0) != 0 ? (i4 = i6 + 8 | 0, HEAP32[i4 >> 2] = i5 + ((HEAP32[i4 >> 2] | 0) - i8 >> 4 << 4), i4 = HEAP32[i6 >> 2] | 0, (i4 | 0) != 0) : 0) {
+ do {
+ i9 = i4 + 8 | 0;
+ HEAP32[i9 >> 2] = (HEAP32[i2 >> 2] | 0) + ((HEAP32[i9 >> 2] | 0) - i8 >> 4 << 4);
+ i4 = HEAP32[i4 >> 2] | 0;
+ } while ((i4 | 0) != 0);
+ }
+ i3 = HEAP32[i3 + 16 >> 2] | 0;
+ if ((i3 | 0) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ do {
+ i9 = i3 + 4 | 0;
+ HEAP32[i9 >> 2] = (HEAP32[i2 >> 2] | 0) + ((HEAP32[i9 >> 2] | 0) - i8 >> 4 << 4);
+ HEAP32[i3 >> 2] = (HEAP32[i2 >> 2] | 0) + ((HEAP32[i3 >> 2] | 0) - i8 >> 4 << 4);
+ if (!((HEAP8[i3 + 18 | 0] & 1) == 0)) {
+ i9 = i3 + 24 | 0;
+ HEAP32[i9 >> 2] = (HEAP32[i2 >> 2] | 0) + ((HEAP32[i9 >> 2] | 0) - i8 >> 4 << 4);
+ }
+ i3 = HEAP32[i3 + 8 >> 2] | 0;
+ } while ((i3 | 0) != 0);
+ STACKTOP = i1;
+ return;
+}
+function _luaF_close(i7, i6) {
+ i7 = i7 | 0;
+ i6 = i6 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0;
+ i1 = STACKTOP;
+ i4 = HEAP32[i7 + 12 >> 2] | 0;
+ i3 = i7 + 56 | 0;
+ i8 = HEAP32[i3 >> 2] | 0;
+ if ((i8 | 0) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i5 = i4 + 60 | 0;
+ i2 = i4 + 68 | 0;
+ while (1) {
+ i9 = i8 + 8 | 0;
+ if ((HEAP32[i9 >> 2] | 0) >>> 0 < i6 >>> 0) {
+ i2 = 10;
+ break;
+ }
+ HEAP32[i3 >> 2] = HEAP32[i8 >> 2];
+ if ((((HEAPU8[i5] | 0) ^ 3) & ((HEAPU8[i8 + 5 | 0] | 0) ^ 3) | 0) == 0) {
+ if ((HEAP32[i9 >> 2] | 0) != (i8 + 16 | 0)) {
+ i9 = i8 + 16 | 0;
+ i10 = i9 + 4 | 0;
+ HEAP32[(HEAP32[i10 >> 2] | 0) + 16 >> 2] = HEAP32[i9 >> 2];
+ HEAP32[(HEAP32[i9 >> 2] | 0) + 20 >> 2] = HEAP32[i10 >> 2];
+ }
+ _luaM_realloc_(i7, i8, 32, 0) | 0;
+ } else {
+ i11 = i8 + 16 | 0;
+ i10 = i11 + 4 | 0;
+ HEAP32[(HEAP32[i10 >> 2] | 0) + 16 >> 2] = HEAP32[i11 >> 2];
+ HEAP32[(HEAP32[i11 >> 2] | 0) + 20 >> 2] = HEAP32[i10 >> 2];
+ i11 = HEAP32[i9 >> 2] | 0;
+ i10 = i8 + 16 | 0;
+ i14 = i11;
+ i13 = HEAP32[i14 + 4 >> 2] | 0;
+ i12 = i10;
+ HEAP32[i12 >> 2] = HEAP32[i14 >> 2];
+ HEAP32[i12 + 4 >> 2] = i13;
+ HEAP32[i8 + 24 >> 2] = HEAP32[i11 + 8 >> 2];
+ HEAP32[i9 >> 2] = i10;
+ HEAP32[i8 >> 2] = HEAP32[i2 >> 2];
+ HEAP32[i2 >> 2] = i8;
+ _luaC_checkupvalcolor(i4, i8);
+ }
+ i8 = HEAP32[i3 >> 2] | 0;
+ if ((i8 | 0) == 0) {
+ i2 = 10;
+ break;
+ }
+ }
+ if ((i2 | 0) == 10) {
+ STACKTOP = i1;
+ return;
+ }
+}
+function _luaK_dischargevars(i3, i1) {
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i2 = STACKTOP;
+ switch (HEAP32[i1 >> 2] | 0) {
+ case 12:
+ {
+ HEAP32[i1 >> 2] = 6;
+ i6 = i1 + 8 | 0;
+ HEAP32[i6 >> 2] = (HEAP32[(HEAP32[(HEAP32[i3 >> 2] | 0) + 12 >> 2] | 0) + (HEAP32[i6 >> 2] << 2) >> 2] | 0) >>> 6 & 255;
+ STACKTOP = i2;
+ return;
+ }
+ case 13:
+ {
+ i6 = (HEAP32[(HEAP32[i3 >> 2] | 0) + 12 >> 2] | 0) + (HEAP32[i1 + 8 >> 2] << 2) | 0;
+ HEAP32[i6 >> 2] = HEAP32[i6 >> 2] & 8388607 | 16777216;
+ HEAP32[i1 >> 2] = 11;
+ STACKTOP = i2;
+ return;
+ }
+ case 9:
+ {
+ i4 = i1 + 8 | 0;
+ i5 = HEAP16[i4 >> 1] | 0;
+ if ((i5 & 256 | 0) == 0 ? (HEAPU8[i3 + 46 | 0] | 0) <= (i5 | 0) : 0) {
+ i6 = i3 + 48 | 0;
+ HEAP8[i6] = (HEAP8[i6] | 0) + -1 << 24 >> 24;
+ }
+ i5 = i4 + 2 | 0;
+ if ((HEAP8[i4 + 3 | 0] | 0) == 7) {
+ if ((HEAPU8[i3 + 46 | 0] | 0) > (HEAPU8[i5] | 0)) {
+ i6 = 7;
+ } else {
+ i6 = i3 + 48 | 0;
+ HEAP8[i6] = (HEAP8[i6] | 0) + -1 << 24 >> 24;
+ i6 = 7;
+ }
+ } else {
+ i6 = 6;
+ }
+ HEAP32[i4 >> 2] = _luaK_code(i3, HEAPU8[i5] << 23 | i6 | HEAP16[i4 >> 1] << 14) | 0;
+ HEAP32[i1 >> 2] = 11;
+ STACKTOP = i2;
+ return;
+ }
+ case 7:
+ {
+ HEAP32[i1 >> 2] = 6;
+ STACKTOP = i2;
+ return;
+ }
+ case 8:
+ {
+ i6 = i1 + 8 | 0;
+ HEAP32[i6 >> 2] = _luaK_code(i3, HEAP32[i6 >> 2] << 23 | 5) | 0;
+ HEAP32[i1 >> 2] = 11;
+ STACKTOP = i2;
+ return;
+ }
+ default:
+ {
+ STACKTOP = i2;
+ return;
+ }
+ }
+}
+function _gmatch_aux(i10) {
+ i10 = i10 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i11 = 0, i12 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 288 | 0;
+ i2 = i1 + 8 | 0;
+ i12 = i1 + 4 | 0;
+ i3 = i1;
+ i8 = _lua_tolstring(i10, -1001001, i12) | 0;
+ i7 = _lua_tolstring(i10, -1001002, i3) | 0;
+ i5 = i2 + 16 | 0;
+ HEAP32[i5 >> 2] = i10;
+ HEAP32[i2 >> 2] = 200;
+ HEAP32[i2 + 4 >> 2] = i8;
+ i9 = i2 + 8 | 0;
+ HEAP32[i9 >> 2] = i8 + (HEAP32[i12 >> 2] | 0);
+ HEAP32[i2 + 12 >> 2] = i7 + (HEAP32[i3 >> 2] | 0);
+ i3 = i8 + (_lua_tointegerx(i10, -1001003, 0) | 0) | 0;
+ if (i3 >>> 0 > (HEAP32[i9 >> 2] | 0) >>> 0) {
+ i12 = 0;
+ STACKTOP = i1;
+ return i12 | 0;
+ }
+ i11 = i2 + 20 | 0;
+ while (1) {
+ HEAP32[i11 >> 2] = 0;
+ i4 = _match(i2, i3, i7) | 0;
+ i12 = i3 + 1 | 0;
+ if ((i4 | 0) != 0) {
+ break;
+ }
+ if (i12 >>> 0 > (HEAP32[i9 >> 2] | 0) >>> 0) {
+ i2 = 0;
+ i6 = 7;
+ break;
+ } else {
+ i3 = i12;
+ }
+ }
+ if ((i6 | 0) == 7) {
+ STACKTOP = i1;
+ return i2 | 0;
+ }
+ _lua_pushinteger(i10, i4 - i8 + ((i4 | 0) == (i3 | 0)) | 0);
+ _lua_replace(i10, -1001003);
+ i7 = HEAP32[i11 >> 2] | 0;
+ i6 = (i7 | 0) != 0 | (i3 | 0) == 0 ? i7 : 1;
+ _luaL_checkstack(HEAP32[i5 >> 2] | 0, i6, 7200);
+ if ((i6 | 0) > 0) {
+ i5 = 0;
+ } else {
+ i12 = i7;
+ STACKTOP = i1;
+ return i12 | 0;
+ }
+ while (1) {
+ _push_onecapture(i2, i5, i3, i4);
+ i5 = i5 + 1 | 0;
+ if ((i5 | 0) == (i6 | 0)) {
+ i2 = i6;
+ break;
+ }
+ }
+ STACKTOP = i1;
+ return i2 | 0;
+}
+function _lua_rawseti(i1, i5, i3) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0, i6 = 0;
+ i2 = STACKTOP;
+ i6 = HEAP32[i1 + 16 >> 2] | 0;
+ do {
+ if ((i5 | 0) <= 0) {
+ if (!((i5 | 0) < -1000999)) {
+ i5 = (HEAP32[i1 + 8 >> 2] | 0) + (i5 << 4) | 0;
+ break;
+ }
+ if ((i5 | 0) == -1001e3) {
+ i5 = (HEAP32[i1 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i5 = -1001e3 - i5 | 0;
+ i6 = HEAP32[i6 >> 2] | 0;
+ if ((HEAP32[i6 + 8 >> 2] | 0) != 22 ? (i4 = HEAP32[i6 >> 2] | 0, (i5 | 0) <= (HEAPU8[i4 + 6 | 0] | 0 | 0)) : 0) {
+ i5 = i4 + (i5 + -1 << 4) + 16 | 0;
+ } else {
+ i5 = 5192;
+ }
+ } else {
+ i4 = (HEAP32[i6 >> 2] | 0) + (i5 << 4) | 0;
+ i5 = i4 >>> 0 < (HEAP32[i1 + 8 >> 2] | 0) >>> 0 ? i4 : 5192;
+ }
+ } while (0);
+ i4 = i1 + 8 | 0;
+ _luaH_setint(i1, HEAP32[i5 >> 2] | 0, i3, (HEAP32[i4 >> 2] | 0) + -16 | 0);
+ i3 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP32[i3 + -8 >> 2] & 64 | 0) == 0) {
+ i6 = i3;
+ i6 = i6 + -16 | 0;
+ HEAP32[i4 >> 2] = i6;
+ STACKTOP = i2;
+ return;
+ }
+ if ((HEAP8[(HEAP32[i3 + -16 >> 2] | 0) + 5 | 0] & 3) == 0) {
+ i6 = i3;
+ i6 = i6 + -16 | 0;
+ HEAP32[i4 >> 2] = i6;
+ STACKTOP = i2;
+ return;
+ }
+ i5 = HEAP32[i5 >> 2] | 0;
+ if ((HEAP8[i5 + 5 | 0] & 4) == 0) {
+ i6 = i3;
+ i6 = i6 + -16 | 0;
+ HEAP32[i4 >> 2] = i6;
+ STACKTOP = i2;
+ return;
+ }
+ _luaC_barrierback_(i1, i5);
+ i6 = HEAP32[i4 >> 2] | 0;
+ i6 = i6 + -16 | 0;
+ HEAP32[i4 >> 2] = i6;
+ STACKTOP = i2;
+ return;
+}
+function _ll_require(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 1056 | 0;
+ i5 = i2;
+ i4 = i2 + 8 | 0;
+ i3 = _luaL_checklstring(i1, 1, 0) | 0;
+ _lua_settop(i1, 1);
+ _lua_getfield(i1, -1001e3, 4576);
+ _lua_getfield(i1, 2, i3);
+ if ((_lua_toboolean(i1, -1) | 0) != 0) {
+ STACKTOP = i2;
+ return 1;
+ }
+ _lua_settop(i1, -2);
+ _luaL_buffinit(i1, i4);
+ _lua_getfield(i1, -1001001, 4240);
+ if ((_lua_type(i1, 3) | 0) == 5) {
+ i6 = 1;
+ } else {
+ _luaL_error(i1, 4656, i5) | 0;
+ i6 = 1;
+ }
+ while (1) {
+ _lua_rawgeti(i1, 3, i6);
+ if ((_lua_type(i1, -1) | 0) == 0) {
+ _lua_settop(i1, -2);
+ _luaL_pushresult(i4);
+ i7 = _lua_tolstring(i1, -1, 0) | 0;
+ HEAP32[i5 >> 2] = i3;
+ HEAP32[i5 + 4 >> 2] = i7;
+ _luaL_error(i1, 4696, i5) | 0;
+ }
+ _lua_pushstring(i1, i3) | 0;
+ _lua_callk(i1, 1, 2, 0, 0);
+ if ((_lua_type(i1, -2) | 0) == 6) {
+ break;
+ }
+ if ((_lua_isstring(i1, -2) | 0) == 0) {
+ _lua_settop(i1, -3);
+ } else {
+ _lua_settop(i1, -2);
+ _luaL_addvalue(i4);
+ }
+ i6 = i6 + 1 | 0;
+ }
+ _lua_pushstring(i1, i3) | 0;
+ _lua_insert(i1, -2);
+ _lua_callk(i1, 2, 1, 0, 0);
+ if ((_lua_type(i1, -1) | 0) != 0) {
+ _lua_setfield(i1, 2, i3);
+ }
+ _lua_getfield(i1, 2, i3);
+ if ((_lua_type(i1, -1) | 0) != 0) {
+ STACKTOP = i2;
+ return 1;
+ }
+ _lua_pushboolean(i1, 1);
+ _lua_pushvalue(i1, -1);
+ _lua_setfield(i1, 2, i3);
+ STACKTOP = i2;
+ return 1;
+}
+function _f_parser(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i2;
+ i5 = HEAP32[i3 >> 2] | 0;
+ i8 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = i8 + -1;
+ if ((i8 | 0) == 0) {
+ i6 = _luaZ_fill(i5) | 0;
+ } else {
+ i8 = i5 + 4 | 0;
+ i6 = HEAP32[i8 >> 2] | 0;
+ HEAP32[i8 >> 2] = i6 + 1;
+ i6 = HEAPU8[i6] | 0;
+ }
+ i5 = HEAP32[i3 + 52 >> 2] | 0;
+ i7 = (i5 | 0) == 0;
+ if ((i6 | 0) == 27) {
+ if (!i7 ? (_strchr(i5, 98) | 0) == 0 : 0) {
+ HEAP32[i4 >> 2] = 2360;
+ HEAP32[i4 + 4 >> 2] = i5;
+ _luaO_pushfstring(i1, 2376, i4) | 0;
+ _luaD_throw(i1, 3);
+ }
+ i8 = _luaU_undump(i1, HEAP32[i3 >> 2] | 0, i3 + 4 | 0, HEAP32[i3 + 56 >> 2] | 0) | 0;
+ } else {
+ if (!i7 ? (_strchr(i5, 116) | 0) == 0 : 0) {
+ HEAP32[i4 >> 2] = 2368;
+ HEAP32[i4 + 4 >> 2] = i5;
+ _luaO_pushfstring(i1, 2376, i4) | 0;
+ _luaD_throw(i1, 3);
+ }
+ i8 = _luaY_parser(i1, HEAP32[i3 >> 2] | 0, i3 + 4 | 0, i3 + 16 | 0, HEAP32[i3 + 56 >> 2] | 0, i6) | 0;
+ }
+ i7 = i8 + 6 | 0;
+ if ((HEAP8[i7] | 0) == 0) {
+ STACKTOP = i2;
+ return;
+ }
+ i5 = i8 + 16 | 0;
+ i6 = i8 + 5 | 0;
+ i4 = 0;
+ do {
+ i3 = _luaF_newupval(i1) | 0;
+ HEAP32[i5 + (i4 << 2) >> 2] = i3;
+ if (!((HEAP8[i3 + 5 | 0] & 3) == 0) ? !((HEAP8[i6] & 4) == 0) : 0) {
+ _luaC_barrier_(i1, i8, i3);
+ }
+ i4 = i4 + 1 | 0;
+ } while ((i4 | 0) < (HEAPU8[i7] | 0));
+ STACKTOP = i2;
+ return;
+}
+function _str_rep(i9) {
+ i9 = i9 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i10 = 0, i11 = 0, i12 = 0;
+ i6 = STACKTOP;
+ STACKTOP = STACKTOP + 1056 | 0;
+ i4 = i6;
+ i2 = i6 + 1044 | 0;
+ i3 = i6 + 1040 | 0;
+ i1 = _luaL_checklstring(i9, 1, i2) | 0;
+ i8 = _luaL_checkinteger(i9, 2) | 0;
+ i5 = _luaL_optlstring(i9, 3, 7040, i3) | 0;
+ if ((i8 | 0) < 1) {
+ _lua_pushlstring(i9, 7040, 0) | 0;
+ i12 = 1;
+ STACKTOP = i6;
+ return i12 | 0;
+ }
+ i7 = HEAP32[i2 >> 2] | 0;
+ i10 = HEAP32[i3 >> 2] | 0;
+ i11 = i10 + i7 | 0;
+ if (!(i11 >>> 0 < i7 >>> 0) ? i11 >>> 0 < (2147483647 / (i8 >>> 0) | 0) >>> 0 : 0) {
+ i7 = (Math_imul(i10, i8 + -1 | 0) | 0) + (Math_imul(i7, i8) | 0) | 0;
+ i11 = _luaL_buffinitsize(i9, i4, i7) | 0;
+ _memcpy(i11 | 0, i1 | 0, HEAP32[i2 >> 2] | 0) | 0;
+ if ((i8 | 0) > 1) {
+ while (1) {
+ i8 = i8 + -1 | 0;
+ i9 = HEAP32[i2 >> 2] | 0;
+ i10 = i11 + i9 | 0;
+ i12 = HEAP32[i3 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ i12 = i9;
+ } else {
+ _memcpy(i10 | 0, i5 | 0, i12 | 0) | 0;
+ i12 = HEAP32[i2 >> 2] | 0;
+ i10 = i11 + ((HEAP32[i3 >> 2] | 0) + i9) | 0;
+ }
+ _memcpy(i10 | 0, i1 | 0, i12 | 0) | 0;
+ if ((i8 | 0) <= 1) {
+ break;
+ } else {
+ i11 = i10;
+ }
+ }
+ }
+ _luaL_pushresultsize(i4, i7);
+ i12 = 1;
+ STACKTOP = i6;
+ return i12 | 0;
+ }
+ i12 = _luaL_error(i9, 7168, i4) | 0;
+ STACKTOP = i6;
+ return i12 | 0;
+}
+function ___strchrnul(i6, i2) {
+ i6 = i6 | 0;
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i7 = 0;
+ i1 = STACKTOP;
+ i3 = i2 & 255;
+ if ((i3 | 0) == 0) {
+ i7 = i6 + (_strlen(i6 | 0) | 0) | 0;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ L5 : do {
+ if ((i6 & 3 | 0) != 0) {
+ i4 = i2 & 255;
+ while (1) {
+ i5 = HEAP8[i6] | 0;
+ if (i5 << 24 >> 24 == 0) {
+ i4 = i6;
+ i5 = 13;
+ break;
+ }
+ i7 = i6 + 1 | 0;
+ if (i5 << 24 >> 24 == i4 << 24 >> 24) {
+ i4 = i6;
+ i5 = 13;
+ break;
+ }
+ if ((i7 & 3 | 0) == 0) {
+ i4 = i7;
+ break L5;
+ } else {
+ i6 = i7;
+ }
+ }
+ if ((i5 | 0) == 13) {
+ STACKTOP = i1;
+ return i4 | 0;
+ }
+ } else {
+ i4 = i6;
+ }
+ } while (0);
+ i3 = Math_imul(i3, 16843009) | 0;
+ i6 = HEAP32[i4 >> 2] | 0;
+ L15 : do {
+ if (((i6 & -2139062144 ^ -2139062144) & i6 + -16843009 | 0) == 0) {
+ while (1) {
+ i7 = i6 ^ i3;
+ i5 = i4 + 4 | 0;
+ if (((i7 & -2139062144 ^ -2139062144) & i7 + -16843009 | 0) != 0) {
+ break L15;
+ }
+ i6 = HEAP32[i5 >> 2] | 0;
+ if (((i6 & -2139062144 ^ -2139062144) & i6 + -16843009 | 0) == 0) {
+ i4 = i5;
+ } else {
+ i4 = i5;
+ break;
+ }
+ }
+ }
+ } while (0);
+ i2 = i2 & 255;
+ while (1) {
+ i7 = HEAP8[i4] | 0;
+ if (i7 << 24 >> 24 == 0 | i7 << 24 >> 24 == i2 << 24 >> 24) {
+ break;
+ } else {
+ i4 = i4 + 1 | 0;
+ }
+ }
+ STACKTOP = i1;
+ return i4 | 0;
+}
+function _lua_replace(i2, i6) {
+ i2 = i2 | 0;
+ i6 = i6 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0;
+ i3 = STACKTOP;
+ i7 = i2 + 8 | 0;
+ i9 = HEAP32[i7 >> 2] | 0;
+ i5 = i9 + -16 | 0;
+ i4 = i2 + 16 | 0;
+ i12 = HEAP32[i4 >> 2] | 0;
+ do {
+ if ((i6 | 0) <= 0) {
+ if (!((i6 | 0) < -1000999)) {
+ i10 = i9 + (i6 << 4) | 0;
+ break;
+ }
+ if ((i6 | 0) == -1001e3) {
+ i10 = (HEAP32[i2 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i11 = -1001e3 - i6 | 0;
+ i12 = HEAP32[i12 >> 2] | 0;
+ if ((HEAP32[i12 + 8 >> 2] | 0) != 22 ? (i10 = HEAP32[i12 >> 2] | 0, (i11 | 0) <= (HEAPU8[i10 + 6 | 0] | 0 | 0)) : 0) {
+ i10 = i10 + (i11 + -1 << 4) + 16 | 0;
+ } else {
+ i10 = 5192;
+ }
+ } else {
+ i10 = (HEAP32[i12 >> 2] | 0) + (i6 << 4) | 0;
+ i10 = i10 >>> 0 < i9 >>> 0 ? i10 : 5192;
+ }
+ } while (0);
+ i13 = i5;
+ i11 = HEAP32[i13 + 4 >> 2] | 0;
+ i12 = i10;
+ HEAP32[i12 >> 2] = HEAP32[i13 >> 2];
+ HEAP32[i12 + 4 >> 2] = i11;
+ i9 = i9 + -8 | 0;
+ HEAP32[i10 + 8 >> 2] = HEAP32[i9 >> 2];
+ if ((((i6 | 0) < -1001e3 ? (HEAP32[i9 >> 2] & 64 | 0) != 0 : 0) ? (i1 = HEAP32[i5 >> 2] | 0, !((HEAP8[i1 + 5 | 0] & 3) == 0)) : 0) ? (i8 = HEAP32[HEAP32[HEAP32[i4 >> 2] >> 2] >> 2] | 0, !((HEAP8[i8 + 5 | 0] & 4) == 0)) : 0) {
+ _luaC_barrier_(i2, i8, i1);
+ }
+ HEAP32[i7 >> 2] = (HEAP32[i7 >> 2] | 0) + -16;
+ STACKTOP = i3;
+ return;
+}
+function _memchr(i4, i3, i6) {
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i6 = i6 | 0;
+ var i1 = 0, i2 = 0, i5 = 0, i7 = 0;
+ i1 = STACKTOP;
+ i2 = i3 & 255;
+ i7 = (i6 | 0) == 0;
+ L1 : do {
+ if ((i4 & 3 | 0) == 0 | i7) {
+ i5 = i6;
+ i6 = 5;
+ } else {
+ i5 = i3 & 255;
+ while (1) {
+ if ((HEAP8[i4] | 0) == i5 << 24 >> 24) {
+ i5 = i6;
+ i6 = 6;
+ break L1;
+ }
+ i4 = i4 + 1 | 0;
+ i6 = i6 + -1 | 0;
+ i7 = (i6 | 0) == 0;
+ if ((i4 & 3 | 0) == 0 | i7) {
+ i5 = i6;
+ i6 = 5;
+ break;
+ }
+ }
+ }
+ } while (0);
+ if ((i6 | 0) == 5) {
+ if (i7) {
+ i5 = 0;
+ } else {
+ i6 = 6;
+ }
+ }
+ L8 : do {
+ if ((i6 | 0) == 6) {
+ i3 = i3 & 255;
+ if (!((HEAP8[i4] | 0) == i3 << 24 >> 24)) {
+ i2 = Math_imul(i2, 16843009) | 0;
+ L11 : do {
+ if (i5 >>> 0 > 3) {
+ do {
+ i7 = HEAP32[i4 >> 2] ^ i2;
+ if (((i7 & -2139062144 ^ -2139062144) & i7 + -16843009 | 0) != 0) {
+ break L11;
+ }
+ i4 = i4 + 4 | 0;
+ i5 = i5 + -4 | 0;
+ } while (i5 >>> 0 > 3);
+ }
+ } while (0);
+ if ((i5 | 0) == 0) {
+ i5 = 0;
+ } else {
+ while (1) {
+ if ((HEAP8[i4] | 0) == i3 << 24 >> 24) {
+ break L8;
+ }
+ i4 = i4 + 1 | 0;
+ i5 = i5 + -1 | 0;
+ if ((i5 | 0) == 0) {
+ i5 = 0;
+ break;
+ }
+ }
+ }
+ }
+ }
+ } while (0);
+ STACKTOP = i1;
+ return ((i5 | 0) != 0 ? i4 : 0) | 0;
+}
+function _lua_insert(i2, i5) {
+ i2 = i2 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0;
+ i1 = STACKTOP;
+ i4 = HEAP32[i2 + 16 >> 2] | 0;
+ do {
+ if ((i5 | 0) <= 0) {
+ if (!((i5 | 0) < -1000999)) {
+ i3 = (HEAP32[i2 + 8 >> 2] | 0) + (i5 << 4) | 0;
+ break;
+ }
+ if ((i5 | 0) == -1001e3) {
+ i3 = (HEAP32[i2 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i5 = -1001e3 - i5 | 0;
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP32[i4 + 8 >> 2] | 0) != 22 ? (i3 = HEAP32[i4 >> 2] | 0, (i5 | 0) <= (HEAPU8[i3 + 6 | 0] | 0 | 0)) : 0) {
+ i3 = i3 + (i5 + -1 << 4) + 16 | 0;
+ } else {
+ i3 = 5192;
+ }
+ } else {
+ i3 = (HEAP32[i4 >> 2] | 0) + (i5 << 4) | 0;
+ i3 = i3 >>> 0 < (HEAP32[i2 + 8 >> 2] | 0) >>> 0 ? i3 : 5192;
+ }
+ } while (0);
+ i2 = i2 + 8 | 0;
+ i4 = HEAP32[i2 >> 2] | 0;
+ if (i4 >>> 0 > i3 >>> 0) {
+ while (1) {
+ i5 = i4 + -16 | 0;
+ i8 = i5;
+ i7 = HEAP32[i8 + 4 >> 2] | 0;
+ i6 = i4;
+ HEAP32[i6 >> 2] = HEAP32[i8 >> 2];
+ HEAP32[i6 + 4 >> 2] = i7;
+ HEAP32[i4 + 8 >> 2] = HEAP32[i4 + -8 >> 2];
+ if (i5 >>> 0 > i3 >>> 0) {
+ i4 = i5;
+ } else {
+ break;
+ }
+ }
+ i4 = HEAP32[i2 >> 2] | 0;
+ }
+ i6 = i4;
+ i7 = HEAP32[i6 + 4 >> 2] | 0;
+ i8 = i3;
+ HEAP32[i8 >> 2] = HEAP32[i6 >> 2];
+ HEAP32[i8 + 4 >> 2] = i7;
+ HEAP32[i3 + 8 >> 2] = HEAP32[i4 + 8 >> 2];
+ STACKTOP = i1;
+ return;
+}
+function _findlocal(i6, i4, i1, i2) {
+ i6 = i6 | 0;
+ i4 = i4 | 0;
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i3 = 0, i5 = 0, i7 = 0, i8 = 0;
+ i3 = STACKTOP;
+ do {
+ if ((HEAP8[i4 + 18 | 0] & 1) == 0) {
+ i7 = (HEAP32[i4 >> 2] | 0) + 16 | 0;
+ i5 = 7;
+ } else {
+ if ((i1 | 0) >= 0) {
+ i8 = HEAP32[i4 + 24 >> 2] | 0;
+ i7 = HEAP32[(HEAP32[HEAP32[i4 >> 2] >> 2] | 0) + 12 >> 2] | 0;
+ i7 = _luaF_getlocalname(i7, i1, ((HEAP32[i4 + 28 >> 2] | 0) - (HEAP32[i7 + 12 >> 2] | 0) >> 2) + -1 | 0) | 0;
+ if ((i7 | 0) == 0) {
+ i7 = i8;
+ i5 = 7;
+ break;
+ } else {
+ break;
+ }
+ }
+ i5 = HEAP32[i4 >> 2] | 0;
+ i6 = HEAPU8[(HEAP32[(HEAP32[i5 >> 2] | 0) + 12 >> 2] | 0) + 76 | 0] | 0;
+ if ((((HEAP32[i4 + 24 >> 2] | 0) - i5 >> 4) - i6 | 0) <= (0 - i1 | 0)) {
+ i8 = 0;
+ STACKTOP = i3;
+ return i8 | 0;
+ }
+ HEAP32[i2 >> 2] = i5 + (i6 - i1 << 4);
+ i8 = 2208;
+ STACKTOP = i3;
+ return i8 | 0;
+ }
+ } while (0);
+ if ((i5 | 0) == 7) {
+ if ((HEAP32[i6 + 16 >> 2] | 0) == (i4 | 0)) {
+ i4 = i6 + 8 | 0;
+ } else {
+ i4 = HEAP32[i4 + 12 >> 2] | 0;
+ }
+ if (((HEAP32[i4 >> 2] | 0) - i7 >> 4 | 0) >= (i1 | 0) & (i1 | 0) > 0) {
+ i8 = i7;
+ i7 = 2192;
+ } else {
+ i8 = 0;
+ STACKTOP = i3;
+ return i8 | 0;
+ }
+ }
+ HEAP32[i2 >> 2] = i8 + (i1 + -1 << 4);
+ i8 = i7;
+ STACKTOP = i3;
+ return i8 | 0;
+}
+function _luaH_setint(i4, i5, i6, i1) {
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ i6 = i6 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, d7 = 0.0, i8 = 0, i9 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 32 | 0;
+ i8 = i2 + 16 | 0;
+ i3 = i2;
+ i9 = i6 + -1 | 0;
+ L1 : do {
+ if (i9 >>> 0 < (HEAP32[i5 + 28 >> 2] | 0) >>> 0) {
+ i9 = (HEAP32[i5 + 12 >> 2] | 0) + (i9 << 4) | 0;
+ i8 = 10;
+ } else {
+ d7 = +(i6 | 0);
+ HEAPF64[i8 >> 3] = d7 + 1.0;
+ i8 = (HEAP32[i8 + 4 >> 2] | 0) + (HEAP32[i8 >> 2] | 0) | 0;
+ if ((i8 | 0) < 0) {
+ i9 = 0 - i8 | 0;
+ i8 = (i8 | 0) == (i9 | 0) ? 0 : i9;
+ }
+ i9 = (HEAP32[i5 + 16 >> 2] | 0) + (((i8 | 0) % ((1 << (HEAPU8[i5 + 7 | 0] | 0)) + -1 | 1 | 0) | 0) << 5) | 0;
+ while (1) {
+ if ((HEAP32[i9 + 24 >> 2] | 0) == 3 ? +HEAPF64[i9 + 16 >> 3] == d7 : 0) {
+ break;
+ }
+ i9 = HEAP32[i9 + 28 >> 2] | 0;
+ if ((i9 | 0) == 0) {
+ i8 = 12;
+ break L1;
+ }
+ }
+ i8 = 10;
+ }
+ } while (0);
+ if ((i8 | 0) == 10) {
+ if ((i9 | 0) == 5192) {
+ d7 = +(i6 | 0);
+ i8 = 12;
+ }
+ }
+ if ((i8 | 0) == 12) {
+ HEAPF64[i3 >> 3] = d7;
+ HEAP32[i3 + 8 >> 2] = 3;
+ i9 = _luaH_newkey(i4, i5, i3) | 0;
+ }
+ i5 = i1;
+ i6 = HEAP32[i5 + 4 >> 2] | 0;
+ i8 = i9;
+ HEAP32[i8 >> 2] = HEAP32[i5 >> 2];
+ HEAP32[i8 + 4 >> 2] = i6;
+ HEAP32[i9 + 8 >> 2] = HEAP32[i1 + 8 >> 2];
+ STACKTOP = i2;
+ return;
+}
+function _lua_tounsignedx(i6, i8, i1) {
+ i6 = i6 | 0;
+ i8 = i8 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i7 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 32 | 0;
+ i4 = i2 + 8 | 0;
+ i3 = i2;
+ i7 = HEAP32[i6 + 16 >> 2] | 0;
+ do {
+ if ((i8 | 0) <= 0) {
+ if (!((i8 | 0) < -1000999)) {
+ i5 = (HEAP32[i6 + 8 >> 2] | 0) + (i8 << 4) | 0;
+ break;
+ }
+ if ((i8 | 0) == -1001e3) {
+ i5 = (HEAP32[i6 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i6 = -1001e3 - i8 | 0;
+ i7 = HEAP32[i7 >> 2] | 0;
+ if ((HEAP32[i7 + 8 >> 2] | 0) != 22 ? (i5 = HEAP32[i7 >> 2] | 0, (i6 | 0) <= (HEAPU8[i5 + 6 | 0] | 0 | 0)) : 0) {
+ i5 = i5 + (i6 + -1 << 4) + 16 | 0;
+ } else {
+ i5 = 5192;
+ }
+ } else {
+ i5 = (HEAP32[i7 >> 2] | 0) + (i8 << 4) | 0;
+ i5 = i5 >>> 0 < (HEAP32[i6 + 8 >> 2] | 0) >>> 0 ? i5 : 5192;
+ }
+ } while (0);
+ if ((HEAP32[i5 + 8 >> 2] | 0) != 3) {
+ i5 = _luaV_tonumber(i5, i4) | 0;
+ if ((i5 | 0) == 0) {
+ if ((i1 | 0) == 0) {
+ i8 = 0;
+ STACKTOP = i2;
+ return i8 | 0;
+ }
+ HEAP32[i1 >> 2] = 0;
+ i8 = 0;
+ STACKTOP = i2;
+ return i8 | 0;
+ }
+ }
+ HEAPF64[i3 >> 3] = +HEAPF64[i5 >> 3] + 6755399441055744.0;
+ i3 = HEAP32[i3 >> 2] | 0;
+ if ((i1 | 0) == 0) {
+ i8 = i3;
+ STACKTOP = i2;
+ return i8 | 0;
+ }
+ HEAP32[i1 >> 2] = 1;
+ i8 = i3;
+ STACKTOP = i2;
+ return i8 | 0;
+}
+function _luaC_freeallobjects(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0;
+ i2 = STACKTOP;
+ i5 = i1 + 12 | 0;
+ i3 = HEAP32[i5 >> 2] | 0;
+ i7 = i3 + 104 | 0;
+ while (1) {
+ i4 = HEAP32[i7 >> 2] | 0;
+ if ((i4 | 0) == 0) {
+ break;
+ } else {
+ i7 = i4;
+ }
+ }
+ i4 = i3 + 72 | 0;
+ i6 = HEAP32[i4 >> 2] | 0;
+ if ((i6 | 0) == 0) {
+ i5 = i3;
+ } else {
+ while (1) {
+ i8 = i6 + 5 | 0;
+ HEAP8[i8] = HEAPU8[i8] | 0 | 8;
+ HEAP32[i4 >> 2] = HEAP32[i6 >> 2];
+ HEAP32[i6 >> 2] = HEAP32[i7 >> 2];
+ HEAP32[i7 >> 2] = i6;
+ i7 = HEAP32[i4 >> 2] | 0;
+ if ((i7 | 0) == 0) {
+ break;
+ } else {
+ i8 = i6;
+ i6 = i7;
+ i7 = i8;
+ }
+ }
+ i5 = HEAP32[i5 >> 2] | 0;
+ }
+ i5 = i5 + 104 | 0;
+ i6 = HEAP32[i5 >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ do {
+ i8 = i6 + 5 | 0;
+ HEAP8[i8] = HEAP8[i8] & 191;
+ _GCTM(i1, 0);
+ i6 = HEAP32[i5 >> 2] | 0;
+ } while ((i6 | 0) != 0);
+ }
+ HEAP8[i3 + 60 | 0] = 3;
+ HEAP8[i3 + 62 | 0] = 0;
+ _sweeplist(i1, i4, -3) | 0;
+ _sweeplist(i1, i3 + 68 | 0, -3) | 0;
+ i4 = i3 + 32 | 0;
+ if ((HEAP32[i4 >> 2] | 0) <= 0) {
+ STACKTOP = i2;
+ return;
+ }
+ i3 = i3 + 24 | 0;
+ i5 = 0;
+ do {
+ _sweeplist(i1, (HEAP32[i3 >> 2] | 0) + (i5 << 2) | 0, -3) | 0;
+ i5 = i5 + 1 | 0;
+ } while ((i5 | 0) < (HEAP32[i4 >> 2] | 0));
+ STACKTOP = i2;
+ return;
+}
+function _strspn(i1, i5) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i6 = 0, i7 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 32 | 0;
+ i3 = i2;
+ HEAP32[i3 + 0 >> 2] = 0;
+ HEAP32[i3 + 4 >> 2] = 0;
+ HEAP32[i3 + 8 >> 2] = 0;
+ HEAP32[i3 + 12 >> 2] = 0;
+ HEAP32[i3 + 16 >> 2] = 0;
+ HEAP32[i3 + 20 >> 2] = 0;
+ HEAP32[i3 + 24 >> 2] = 0;
+ HEAP32[i3 + 28 >> 2] = 0;
+ i4 = HEAP8[i5] | 0;
+ if (i4 << 24 >> 24 == 0) {
+ i6 = 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ if ((HEAP8[i5 + 1 | 0] | 0) == 0) {
+ i3 = i1;
+ while (1) {
+ if ((HEAP8[i3] | 0) == i4 << 24 >> 24) {
+ i3 = i3 + 1 | 0;
+ } else {
+ break;
+ }
+ }
+ i6 = i3 - i1 | 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ do {
+ i7 = i4 & 255;
+ i6 = i3 + (i7 >>> 5 << 2) | 0;
+ HEAP32[i6 >> 2] = HEAP32[i6 >> 2] | 1 << (i7 & 31);
+ i5 = i5 + 1 | 0;
+ i4 = HEAP8[i5] | 0;
+ } while (!(i4 << 24 >> 24 == 0));
+ i5 = HEAP8[i1] | 0;
+ L12 : do {
+ if (i5 << 24 >> 24 == 0) {
+ i4 = i1;
+ } else {
+ i4 = i1;
+ while (1) {
+ i7 = i5 & 255;
+ i6 = i4 + 1 | 0;
+ if ((HEAP32[i3 + (i7 >>> 5 << 2) >> 2] & 1 << (i7 & 31) | 0) == 0) {
+ break L12;
+ }
+ i5 = HEAP8[i6] | 0;
+ if (i5 << 24 >> 24 == 0) {
+ i4 = i6;
+ break;
+ } else {
+ i4 = i6;
+ }
+ }
+ }
+ } while (0);
+ i7 = i4 - i1 | 0;
+ STACKTOP = i2;
+ return i7 | 0;
+}
+function _lua_remove(i2, i4) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i3 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i1 = STACKTOP;
+ i5 = HEAP32[i2 + 16 >> 2] | 0;
+ do {
+ if ((i4 | 0) <= 0) {
+ if (!((i4 | 0) < -1000999)) {
+ i3 = (HEAP32[i2 + 8 >> 2] | 0) + (i4 << 4) | 0;
+ break;
+ }
+ if ((i4 | 0) == -1001e3) {
+ i3 = (HEAP32[i2 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i4 = -1001e3 - i4 | 0;
+ i5 = HEAP32[i5 >> 2] | 0;
+ if ((HEAP32[i5 + 8 >> 2] | 0) != 22 ? (i3 = HEAP32[i5 >> 2] | 0, (i4 | 0) <= (HEAPU8[i3 + 6 | 0] | 0 | 0)) : 0) {
+ i3 = i3 + (i4 + -1 << 4) + 16 | 0;
+ } else {
+ i3 = 5192;
+ }
+ } else {
+ i3 = (HEAP32[i5 >> 2] | 0) + (i4 << 4) | 0;
+ i3 = i3 >>> 0 < (HEAP32[i2 + 8 >> 2] | 0) >>> 0 ? i3 : 5192;
+ }
+ } while (0);
+ i4 = i3 + 16 | 0;
+ i2 = i2 + 8 | 0;
+ i5 = HEAP32[i2 >> 2] | 0;
+ if (!(i4 >>> 0 < i5 >>> 0)) {
+ i5 = i5 + -16 | 0;
+ HEAP32[i2 >> 2] = i5;
+ STACKTOP = i1;
+ return;
+ }
+ while (1) {
+ i7 = i4;
+ i6 = HEAP32[i7 + 4 >> 2] | 0;
+ i5 = i3;
+ HEAP32[i5 >> 2] = HEAP32[i7 >> 2];
+ HEAP32[i5 + 4 >> 2] = i6;
+ HEAP32[i3 + 8 >> 2] = HEAP32[i3 + 24 >> 2];
+ i5 = i4 + 16 | 0;
+ i3 = HEAP32[i2 >> 2] | 0;
+ if (i5 >>> 0 < i3 >>> 0) {
+ i3 = i4;
+ i4 = i5;
+ } else {
+ break;
+ }
+ }
+ i7 = i3 + -16 | 0;
+ HEAP32[i2 >> 2] = i7;
+ STACKTOP = i1;
+ return;
+}
+function _luaD_protectedparser(i1, i4, i3, i2) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ var i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0;
+ i5 = STACKTOP;
+ STACKTOP = STACKTOP + 64 | 0;
+ i13 = i5;
+ i6 = i1 + 36 | 0;
+ HEAP16[i6 >> 1] = (HEAP16[i6 >> 1] | 0) + 1 << 16 >> 16;
+ HEAP32[i13 >> 2] = i4;
+ HEAP32[i13 + 56 >> 2] = i3;
+ HEAP32[i13 + 52 >> 2] = i2;
+ i10 = i13 + 16 | 0;
+ HEAP32[i10 >> 2] = 0;
+ i9 = i13 + 24 | 0;
+ HEAP32[i9 >> 2] = 0;
+ i8 = i13 + 28 | 0;
+ HEAP32[i8 >> 2] = 0;
+ i7 = i13 + 36 | 0;
+ HEAP32[i7 >> 2] = 0;
+ i2 = i13 + 40 | 0;
+ HEAP32[i2 >> 2] = 0;
+ i3 = i13 + 48 | 0;
+ HEAP32[i3 >> 2] = 0;
+ i12 = i13 + 4 | 0;
+ HEAP32[i12 >> 2] = 0;
+ i11 = i13 + 12 | 0;
+ HEAP32[i11 >> 2] = 0;
+ i4 = _luaD_pcall(i1, 6, i13, (HEAP32[i1 + 8 >> 2] | 0) - (HEAP32[i1 + 28 >> 2] | 0) | 0, HEAP32[i1 + 68 >> 2] | 0) | 0;
+ HEAP32[i12 >> 2] = _luaM_realloc_(i1, HEAP32[i12 >> 2] | 0, HEAP32[i11 >> 2] | 0, 0) | 0;
+ HEAP32[i11 >> 2] = 0;
+ _luaM_realloc_(i1, HEAP32[i10 >> 2] | 0, HEAP32[i9 >> 2] << 1, 0) | 0;
+ _luaM_realloc_(i1, HEAP32[i8 >> 2] | 0, HEAP32[i7 >> 2] << 4, 0) | 0;
+ _luaM_realloc_(i1, HEAP32[i2 >> 2] | 0, HEAP32[i3 >> 2] << 4, 0) | 0;
+ HEAP16[i6 >> 1] = (HEAP16[i6 >> 1] | 0) + -1 << 16 >> 16;
+ STACKTOP = i5;
+ return i4 | 0;
+}
+function _markmt(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = HEAP32[i1 + 252 >> 2] | 0;
+ if ((i3 | 0) != 0 ? !((HEAP8[i3 + 5 | 0] & 3) == 0) : 0) {
+ _reallymarkobject(i1, i3);
+ }
+ i3 = HEAP32[i1 + 256 >> 2] | 0;
+ if ((i3 | 0) != 0 ? !((HEAP8[i3 + 5 | 0] & 3) == 0) : 0) {
+ _reallymarkobject(i1, i3);
+ }
+ i3 = HEAP32[i1 + 260 >> 2] | 0;
+ if ((i3 | 0) != 0 ? !((HEAP8[i3 + 5 | 0] & 3) == 0) : 0) {
+ _reallymarkobject(i1, i3);
+ }
+ i3 = HEAP32[i1 + 264 >> 2] | 0;
+ if ((i3 | 0) != 0 ? !((HEAP8[i3 + 5 | 0] & 3) == 0) : 0) {
+ _reallymarkobject(i1, i3);
+ }
+ i3 = HEAP32[i1 + 268 >> 2] | 0;
+ if ((i3 | 0) != 0 ? !((HEAP8[i3 + 5 | 0] & 3) == 0) : 0) {
+ _reallymarkobject(i1, i3);
+ }
+ i3 = HEAP32[i1 + 272 >> 2] | 0;
+ if ((i3 | 0) != 0 ? !((HEAP8[i3 + 5 | 0] & 3) == 0) : 0) {
+ _reallymarkobject(i1, i3);
+ }
+ i3 = HEAP32[i1 + 276 >> 2] | 0;
+ if ((i3 | 0) != 0 ? !((HEAP8[i3 + 5 | 0] & 3) == 0) : 0) {
+ _reallymarkobject(i1, i3);
+ }
+ i3 = HEAP32[i1 + 280 >> 2] | 0;
+ if ((i3 | 0) != 0 ? !((HEAP8[i3 + 5 | 0] & 3) == 0) : 0) {
+ _reallymarkobject(i1, i3);
+ }
+ i3 = HEAP32[i1 + 284 >> 2] | 0;
+ if ((i3 | 0) == 0) {
+ STACKTOP = i2;
+ return;
+ }
+ if ((HEAP8[i3 + 5 | 0] & 3) == 0) {
+ STACKTOP = i2;
+ return;
+ }
+ _reallymarkobject(i1, i3);
+ STACKTOP = i2;
+ return;
+}
+function _findlabel(i9, i2) {
+ i9 = i9 | 0;
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0;
+ i1 = STACKTOP;
+ i3 = i9 + 48 | 0;
+ i7 = HEAP32[(HEAP32[i3 >> 2] | 0) + 16 >> 2] | 0;
+ i10 = HEAP32[i9 + 64 >> 2] | 0;
+ i4 = HEAP32[i10 + 12 >> 2] | 0;
+ i6 = i7 + 4 | 0;
+ i13 = HEAP16[i6 >> 1] | 0;
+ i5 = i10 + 28 | 0;
+ if ((i13 | 0) >= (HEAP32[i5 >> 2] | 0)) {
+ i15 = 0;
+ STACKTOP = i1;
+ return i15 | 0;
+ }
+ i10 = i10 + 24 | 0;
+ i11 = i4 + (i2 << 4) | 0;
+ while (1) {
+ i14 = HEAP32[i10 >> 2] | 0;
+ i12 = i14 + (i13 << 4) | 0;
+ i15 = i13 + 1 | 0;
+ if ((_luaS_eqstr(HEAP32[i12 >> 2] | 0, HEAP32[i11 >> 2] | 0) | 0) != 0) {
+ break;
+ }
+ if ((i15 | 0) < (HEAP32[i5 >> 2] | 0)) {
+ i13 = i15;
+ } else {
+ i2 = 0;
+ i8 = 10;
+ break;
+ }
+ }
+ if ((i8 | 0) == 10) {
+ STACKTOP = i1;
+ return i2 | 0;
+ }
+ i8 = HEAP8[i14 + (i13 << 4) + 12 | 0] | 0;
+ do {
+ if ((HEAPU8[i4 + (i2 << 4) + 12 | 0] | 0) > (i8 & 255)) {
+ if ((HEAP8[i7 + 9 | 0] | 0) == 0 ? (HEAP32[i5 >> 2] | 0) <= (HEAP16[i6 >> 1] | 0) : 0) {
+ break;
+ }
+ _luaK_patchclose(HEAP32[i3 >> 2] | 0, HEAP32[i4 + (i2 << 4) + 4 >> 2] | 0, i8 & 255);
+ }
+ } while (0);
+ _closegoto(i9, i2, i12);
+ i15 = 1;
+ STACKTOP = i1;
+ return i15 | 0;
+}
+function _lua_getmetatable(i1, i5) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ i4 = HEAP32[i1 + 16 >> 2] | 0;
+ do {
+ if ((i5 | 0) <= 0) {
+ if (!((i5 | 0) < -1000999)) {
+ i4 = (HEAP32[i1 + 8 >> 2] | 0) + (i5 << 4) | 0;
+ break;
+ }
+ if ((i5 | 0) == -1001e3) {
+ i4 = (HEAP32[i1 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i5 = -1001e3 - i5 | 0;
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP32[i4 + 8 >> 2] | 0) != 22 ? (i3 = HEAP32[i4 >> 2] | 0, (i5 | 0) <= (HEAPU8[i3 + 6 | 0] | 0 | 0)) : 0) {
+ i4 = i3 + (i5 + -1 << 4) + 16 | 0;
+ } else {
+ i4 = 5192;
+ }
+ } else {
+ i3 = (HEAP32[i4 >> 2] | 0) + (i5 << 4) | 0;
+ i4 = i3 >>> 0 < (HEAP32[i1 + 8 >> 2] | 0) >>> 0 ? i3 : 5192;
+ }
+ } while (0);
+ i3 = HEAP32[i4 + 8 >> 2] & 15;
+ if ((i3 | 0) == 7) {
+ i3 = HEAP32[(HEAP32[i4 >> 2] | 0) + 8 >> 2] | 0;
+ } else if ((i3 | 0) == 5) {
+ i3 = HEAP32[(HEAP32[i4 >> 2] | 0) + 8 >> 2] | 0;
+ } else {
+ i3 = HEAP32[(HEAP32[i1 + 12 >> 2] | 0) + (i3 << 2) + 252 >> 2] | 0;
+ }
+ if ((i3 | 0) == 0) {
+ i5 = 0;
+ STACKTOP = i2;
+ return i5 | 0;
+ }
+ i5 = i1 + 8 | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i4 >> 2] = i3;
+ HEAP32[i4 + 8 >> 2] = 69;
+ HEAP32[i5 >> 2] = (HEAP32[i5 >> 2] | 0) + 16;
+ i5 = 1;
+ STACKTOP = i2;
+ return i5 | 0;
+}
+function _str_byte(i2) {
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i6 = i1;
+ i4 = i1 + 4 | 0;
+ i3 = _luaL_checklstring(i2, 1, i4) | 0;
+ i5 = _luaL_optinteger(i2, 2, 1) | 0;
+ i7 = HEAP32[i4 >> 2] | 0;
+ if (!((i5 | 0) > -1)) {
+ if (i7 >>> 0 < (0 - i5 | 0) >>> 0) {
+ i5 = 0;
+ } else {
+ i5 = i5 + 1 + i7 | 0;
+ }
+ }
+ i8 = _luaL_optinteger(i2, 3, i5) | 0;
+ i7 = HEAP32[i4 >> 2] | 0;
+ if (!((i8 | 0) > -1)) {
+ if (i7 >>> 0 < (0 - i8 | 0) >>> 0) {
+ i8 = 0;
+ } else {
+ i8 = i8 + 1 + i7 | 0;
+ }
+ }
+ i9 = (i5 | 0) == 0 ? 1 : i5;
+ i10 = i8 >>> 0 > i7 >>> 0 ? i7 : i8;
+ if (i9 >>> 0 > i10 >>> 0) {
+ i10 = 0;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ i4 = i10 - i9 + 1 | 0;
+ if ((i10 | 0) == -1) {
+ i10 = _luaL_error(i2, 7944, i6) | 0;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ _luaL_checkstack(i2, i4, 7944);
+ if ((i4 | 0) <= 0) {
+ i10 = i4;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ i6 = i9 + -1 | 0;
+ i8 = ~i8;
+ i7 = ~i7;
+ i5 = 0 - (i8 >>> 0 > i7 >>> 0 ? i8 : i7) - (i5 >>> 0 > 1 ? i5 : 1) | 0;
+ i7 = 0;
+ do {
+ _lua_pushinteger(i2, HEAPU8[i3 + (i6 + i7) | 0] | 0);
+ i7 = i7 + 1 | 0;
+ } while ((i7 | 0) != (i5 | 0));
+ STACKTOP = i1;
+ return i4 | 0;
+}
+function _lua_setuservalue(i1, i5) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i6 = 0;
+ i3 = STACKTOP;
+ i6 = HEAP32[i1 + 16 >> 2] | 0;
+ do {
+ if ((i5 | 0) <= 0) {
+ if (!((i5 | 0) < -1000999)) {
+ i5 = (HEAP32[i1 + 8 >> 2] | 0) + (i5 << 4) | 0;
+ break;
+ }
+ if ((i5 | 0) == -1001e3) {
+ i5 = (HEAP32[i1 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i5 = -1001e3 - i5 | 0;
+ i6 = HEAP32[i6 >> 2] | 0;
+ if ((HEAP32[i6 + 8 >> 2] | 0) != 22 ? (i4 = HEAP32[i6 >> 2] | 0, (i5 | 0) <= (HEAPU8[i4 + 6 | 0] | 0 | 0)) : 0) {
+ i5 = i4 + (i5 + -1 << 4) + 16 | 0;
+ } else {
+ i5 = 5192;
+ }
+ } else {
+ i4 = (HEAP32[i6 >> 2] | 0) + (i5 << 4) | 0;
+ i5 = i4 >>> 0 < (HEAP32[i1 + 8 >> 2] | 0) >>> 0 ? i4 : 5192;
+ }
+ } while (0);
+ i4 = i1 + 8 | 0;
+ i6 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP32[i6 + -8 >> 2] | 0) != 0) {
+ HEAP32[(HEAP32[i5 >> 2] | 0) + 12 >> 2] = HEAP32[i6 + -16 >> 2];
+ i6 = HEAP32[(HEAP32[i4 >> 2] | 0) + -16 >> 2] | 0;
+ if (!((HEAP8[i6 + 5 | 0] & 3) == 0) ? (i2 = HEAP32[i5 >> 2] | 0, !((HEAP8[i2 + 5 | 0] & 4) == 0)) : 0) {
+ _luaC_barrier_(i1, i2, i6);
+ }
+ } else {
+ HEAP32[(HEAP32[i5 >> 2] | 0) + 12 >> 2] = 0;
+ }
+ HEAP32[i4 >> 2] = (HEAP32[i4 >> 2] | 0) + -16;
+ STACKTOP = i3;
+ return;
+}
+function _f_luaopen(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i6 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i5 = i6;
+ i4 = HEAP32[i1 + 12 >> 2] | 0;
+ i2 = _luaM_realloc_(i1, 0, 0, 640) | 0;
+ HEAP32[i1 + 28 >> 2] = i2;
+ i3 = i1 + 32 | 0;
+ HEAP32[i3 >> 2] = 40;
+ i7 = 0;
+ do {
+ HEAP32[i2 + (i7 << 4) + 8 >> 2] = 0;
+ i7 = i7 + 1 | 0;
+ } while ((i7 | 0) != 40);
+ HEAP32[i1 + 24 >> 2] = i2 + ((HEAP32[i3 >> 2] | 0) + -5 << 4);
+ i7 = i1 + 72 | 0;
+ HEAP32[i1 + 80 >> 2] = 0;
+ HEAP32[i1 + 84 >> 2] = 0;
+ HEAP8[i1 + 90 | 0] = 0;
+ HEAP32[i7 >> 2] = i2;
+ HEAP32[i1 + 8 >> 2] = i2 + 16;
+ HEAP32[i2 + 8 >> 2] = 0;
+ HEAP32[i1 + 76 >> 2] = i2 + 336;
+ HEAP32[i1 + 16 >> 2] = i7;
+ i7 = _luaH_new(i1) | 0;
+ HEAP32[i4 + 40 >> 2] = i7;
+ HEAP32[i4 + 48 >> 2] = 69;
+ _luaH_resize(i1, i7, 2, 0);
+ HEAP32[i5 >> 2] = i1;
+ i3 = i5 + 8 | 0;
+ HEAP32[i3 >> 2] = 72;
+ _luaH_setint(i1, i7, 1, i5);
+ HEAP32[i5 >> 2] = _luaH_new(i1) | 0;
+ HEAP32[i3 >> 2] = 69;
+ _luaH_setint(i1, i7, 2, i5);
+ _luaS_resize(i1, 32);
+ _luaT_init(i1);
+ _luaX_init(i1);
+ i7 = _luaS_newlstr(i1, 6896, 17) | 0;
+ HEAP32[i4 + 180 >> 2] = i7;
+ i7 = i7 + 5 | 0;
+ HEAP8[i7] = HEAPU8[i7] | 0 | 32;
+ HEAP8[i4 + 63 | 0] = 1;
+ STACKTOP = i6;
+ return;
+}
+function _lua_tointegerx(i6, i7, i1) {
+ i6 = i6 | 0;
+ i7 = i7 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i2;
+ i5 = HEAP32[i6 + 16 >> 2] | 0;
+ do {
+ if ((i7 | 0) <= 0) {
+ if (!((i7 | 0) < -1000999)) {
+ i4 = (HEAP32[i6 + 8 >> 2] | 0) + (i7 << 4) | 0;
+ break;
+ }
+ if ((i7 | 0) == -1001e3) {
+ i4 = (HEAP32[i6 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i6 = -1001e3 - i7 | 0;
+ i5 = HEAP32[i5 >> 2] | 0;
+ if ((HEAP32[i5 + 8 >> 2] | 0) != 22 ? (i4 = HEAP32[i5 >> 2] | 0, (i6 | 0) <= (HEAPU8[i4 + 6 | 0] | 0 | 0)) : 0) {
+ i4 = i4 + (i6 + -1 << 4) + 16 | 0;
+ } else {
+ i4 = 5192;
+ }
+ } else {
+ i4 = (HEAP32[i5 >> 2] | 0) + (i7 << 4) | 0;
+ i4 = i4 >>> 0 < (HEAP32[i6 + 8 >> 2] | 0) >>> 0 ? i4 : 5192;
+ }
+ } while (0);
+ if ((HEAP32[i4 + 8 >> 2] | 0) != 3) {
+ i4 = _luaV_tonumber(i4, i3) | 0;
+ if ((i4 | 0) == 0) {
+ if ((i1 | 0) == 0) {
+ i7 = 0;
+ STACKTOP = i2;
+ return i7 | 0;
+ }
+ HEAP32[i1 >> 2] = 0;
+ i7 = 0;
+ STACKTOP = i2;
+ return i7 | 0;
+ }
+ }
+ i3 = ~~+HEAPF64[i4 >> 3];
+ if ((i1 | 0) == 0) {
+ i7 = i3;
+ STACKTOP = i2;
+ return i7 | 0;
+ }
+ HEAP32[i1 >> 2] = 1;
+ i7 = i3;
+ STACKTOP = i2;
+ return i7 | 0;
+}
+function _close_state(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i2 = STACKTOP;
+ i6 = i1 + 12 | 0;
+ i3 = HEAP32[i6 >> 2] | 0;
+ i4 = i1 + 28 | 0;
+ _luaF_close(i1, HEAP32[i4 >> 2] | 0);
+ _luaC_freeallobjects(i1);
+ i6 = HEAP32[i6 >> 2] | 0;
+ _luaM_realloc_(i1, HEAP32[i6 + 24 >> 2] | 0, HEAP32[i6 + 32 >> 2] << 2, 0) | 0;
+ i6 = i3 + 144 | 0;
+ i5 = i3 + 152 | 0;
+ HEAP32[i6 >> 2] = _luaM_realloc_(i1, HEAP32[i6 >> 2] | 0, HEAP32[i5 >> 2] | 0, 0) | 0;
+ HEAP32[i5 >> 2] = 0;
+ i5 = HEAP32[i4 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ i5 = HEAP32[i3 >> 2] | 0;
+ i6 = i3 + 4 | 0;
+ i6 = HEAP32[i6 >> 2] | 0;
+ FUNCTION_TABLE_iiiii[i5 & 3](i6, i1, 400, 0) | 0;
+ STACKTOP = i2;
+ return;
+ }
+ HEAP32[i1 + 16 >> 2] = i1 + 72;
+ i7 = i1 + 84 | 0;
+ i6 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = 0;
+ if ((i6 | 0) != 0) {
+ while (1) {
+ i5 = HEAP32[i6 + 12 >> 2] | 0;
+ _luaM_realloc_(i1, i6, 40, 0) | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ } else {
+ i6 = i5;
+ }
+ }
+ i5 = HEAP32[i4 >> 2] | 0;
+ }
+ _luaM_realloc_(i1, i5, HEAP32[i1 + 32 >> 2] << 4, 0) | 0;
+ i6 = HEAP32[i3 >> 2] | 0;
+ i7 = i3 + 4 | 0;
+ i7 = HEAP32[i7 >> 2] | 0;
+ FUNCTION_TABLE_iiiii[i6 & 3](i7, i1, 400, 0) | 0;
+ STACKTOP = i2;
+ return;
+}
+function _ll_module(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 112 | 0;
+ i4 = i2;
+ i5 = i2 + 4 | 0;
+ i6 = _luaL_checklstring(i1, 1, 0) | 0;
+ i3 = _lua_gettop(i1) | 0;
+ _luaL_pushmodule(i1, i6, 1);
+ _lua_getfield(i1, -1, 4728);
+ i7 = (_lua_type(i1, -1) | 0) == 0;
+ _lua_settop(i1, -2);
+ if (i7) {
+ _lua_pushvalue(i1, -1);
+ _lua_setfield(i1, -2, 4784);
+ _lua_pushstring(i1, i6) | 0;
+ _lua_setfield(i1, -2, 4728);
+ i7 = _strrchr(i6, 46) | 0;
+ _lua_pushlstring(i1, i6, ((i7 | 0) == 0 ? i6 : i7 + 1 | 0) - i6 | 0) | 0;
+ _lua_setfield(i1, -2, 4792);
+ }
+ _lua_pushvalue(i1, -1);
+ if (!(((_lua_getstack(i1, 1, i5) | 0) != 0 ? (_lua_getinfo(i1, 4736, i5) | 0) != 0 : 0) ? (_lua_iscfunction(i1, -1) | 0) == 0 : 0)) {
+ _luaL_error(i1, 4744, i4) | 0;
+ }
+ _lua_pushvalue(i1, -2);
+ _lua_setupvalue(i1, -2, 1) | 0;
+ _lua_settop(i1, -2);
+ if ((i3 | 0) < 2) {
+ STACKTOP = i2;
+ return 1;
+ } else {
+ i4 = 2;
+ }
+ while (1) {
+ if ((_lua_type(i1, i4) | 0) == 6) {
+ _lua_pushvalue(i1, i4);
+ _lua_pushvalue(i1, -2);
+ _lua_callk(i1, 1, 0, 0, 0);
+ }
+ if ((i4 | 0) == (i3 | 0)) {
+ break;
+ } else {
+ i4 = i4 + 1 | 0;
+ }
+ }
+ STACKTOP = i2;
+ return 1;
+}
+function _strcspn(i2, i5) {
+ i2 = i2 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i6 = 0, i7 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 32 | 0;
+ i3 = i1;
+ i4 = HEAP8[i5] | 0;
+ if (!(i4 << 24 >> 24 == 0) ? (HEAP8[i5 + 1 | 0] | 0) != 0 : 0) {
+ HEAP32[i3 + 0 >> 2] = 0;
+ HEAP32[i3 + 4 >> 2] = 0;
+ HEAP32[i3 + 8 >> 2] = 0;
+ HEAP32[i3 + 12 >> 2] = 0;
+ HEAP32[i3 + 16 >> 2] = 0;
+ HEAP32[i3 + 20 >> 2] = 0;
+ HEAP32[i3 + 24 >> 2] = 0;
+ HEAP32[i3 + 28 >> 2] = 0;
+ do {
+ i7 = i4 & 255;
+ i6 = i3 + (i7 >>> 5 << 2) | 0;
+ HEAP32[i6 >> 2] = HEAP32[i6 >> 2] | 1 << (i7 & 31);
+ i5 = i5 + 1 | 0;
+ i4 = HEAP8[i5] | 0;
+ } while (!(i4 << 24 >> 24 == 0));
+ i5 = HEAP8[i2] | 0;
+ L7 : do {
+ if (i5 << 24 >> 24 == 0) {
+ i4 = i2;
+ } else {
+ i4 = i2;
+ while (1) {
+ i7 = i5 & 255;
+ i6 = i4 + 1 | 0;
+ if ((HEAP32[i3 + (i7 >>> 5 << 2) >> 2] & 1 << (i7 & 31) | 0) != 0) {
+ break L7;
+ }
+ i5 = HEAP8[i6] | 0;
+ if (i5 << 24 >> 24 == 0) {
+ i4 = i6;
+ break;
+ } else {
+ i4 = i6;
+ }
+ }
+ }
+ } while (0);
+ i7 = i4 - i2 | 0;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ i7 = (___strchrnul(i2, i4 << 24 >> 24) | 0) - i2 | 0;
+ STACKTOP = i1;
+ return i7 | 0;
+}
+function _main(i4, i5) {
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i6 = 0, i7 = 0, i8 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i2 = i1;
+ i3 = _luaL_newstate() | 0;
+ if ((i3 | 0) == 0) {
+ i4 = HEAP32[i5 >> 2] | 0;
+ i3 = HEAP32[_stderr >> 2] | 0;
+ if ((i4 | 0) != 0) {
+ HEAP32[i2 >> 2] = i4;
+ _fprintf(i3 | 0, 496, i2 | 0) | 0;
+ _fflush(i3 | 0) | 0;
+ }
+ HEAP32[i2 >> 2] = 8;
+ _fprintf(i3 | 0, 912, i2 | 0) | 0;
+ _fflush(i3 | 0) | 0;
+ i8 = 1;
+ STACKTOP = i1;
+ return i8 | 0;
+ }
+ _lua_pushcclosure(i3, 141, 0);
+ _lua_pushinteger(i3, i4);
+ _lua_pushlightuserdata(i3, i5);
+ i6 = _lua_pcallk(i3, 2, 1, 0, 0, 0) | 0;
+ i7 = _lua_toboolean(i3, -1) | 0;
+ i6 = (i6 | 0) == 0;
+ if (!i6) {
+ if ((_lua_type(i3, -1) | 0) == 4) {
+ i8 = _lua_tolstring(i3, -1, 0) | 0;
+ } else {
+ i8 = 0;
+ }
+ i4 = HEAP32[20] | 0;
+ i5 = HEAP32[_stderr >> 2] | 0;
+ if ((i4 | 0) != 0) {
+ HEAP32[i2 >> 2] = i4;
+ _fprintf(i5 | 0, 496, i2 | 0) | 0;
+ _fflush(i5 | 0) | 0;
+ }
+ HEAP32[i2 >> 2] = (i8 | 0) == 0 ? 48 : i8;
+ _fprintf(i5 | 0, 912, i2 | 0) | 0;
+ _fflush(i5 | 0) | 0;
+ _lua_settop(i3, -2);
+ }
+ _lua_close(i3);
+ i8 = i6 & (i7 | 0) != 0 & 1 ^ 1;
+ STACKTOP = i1;
+ return i8 | 0;
+}
+function _db_sethook(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0;
+ i4 = STACKTOP;
+ if ((_lua_type(i1, 1) | 0) == 8) {
+ i2 = _lua_tothread(i1, 1) | 0;
+ i5 = 1;
+ } else {
+ i2 = i1;
+ i5 = 0;
+ }
+ i3 = i5 + 1 | 0;
+ if ((_lua_type(i1, i3) | 0) < 1) {
+ _lua_settop(i1, i3);
+ i6 = 0;
+ i7 = 0;
+ i5 = 0;
+ } else {
+ i6 = _luaL_checklstring(i1, i5 | 2, 0) | 0;
+ _luaL_checktype(i1, i3, 6);
+ i5 = _luaL_optinteger(i1, i5 + 3 | 0, 0) | 0;
+ i7 = (_strchr(i6, 99) | 0) != 0 | 0;
+ i8 = (_strchr(i6, 114) | 0) == 0;
+ i7 = i8 ? i7 : i7 | 2;
+ i8 = (_strchr(i6, 108) | 0) == 0;
+ i8 = i8 ? i7 : i7 | 4;
+ i6 = i5;
+ i7 = 9;
+ i5 = (i5 | 0) > 0 ? i8 | 8 : i8;
+ }
+ if ((_luaL_getsubtable(i1, -1001e3, 11584) | 0) != 0) {
+ _lua_pushthread(i2) | 0;
+ _lua_xmove(i2, i1, 1);
+ _lua_pushvalue(i1, i3);
+ _lua_rawset(i1, -3);
+ _lua_sethook(i2, i7, i5, i6) | 0;
+ STACKTOP = i4;
+ return 0;
+ }
+ _lua_pushstring(i1, 11592) | 0;
+ _lua_setfield(i1, -2, 11600);
+ _lua_pushvalue(i1, -1);
+ _lua_setmetatable(i1, -2) | 0;
+ _lua_pushthread(i2) | 0;
+ _lua_xmove(i2, i1, 1);
+ _lua_pushvalue(i1, i3);
+ _lua_rawset(i1, -3);
+ _lua_sethook(i2, i7, i5, i6) | 0;
+ STACKTOP = i4;
+ return 0;
+}
+function _tconcat(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 1056 | 0;
+ i6 = i3;
+ i2 = i3 + 16 | 0;
+ i5 = i3 + 8 | 0;
+ i4 = _luaL_optlstring(i1, 2, 8208, i5) | 0;
+ _luaL_checktype(i1, 1, 5);
+ i8 = _luaL_optinteger(i1, 3, 1) | 0;
+ if ((_lua_type(i1, 4) | 0) < 1) {
+ i7 = _luaL_len(i1, 1) | 0;
+ } else {
+ i7 = _luaL_checkinteger(i1, 4) | 0;
+ }
+ _luaL_buffinit(i1, i2);
+ if ((i8 | 0) >= (i7 | 0)) {
+ if ((i8 | 0) != (i7 | 0)) {
+ _luaL_pushresult(i2);
+ STACKTOP = i3;
+ return 1;
+ }
+ } else {
+ do {
+ _lua_rawgeti(i1, 1, i8);
+ if ((_lua_isstring(i1, -1) | 0) == 0) {
+ HEAP32[i6 >> 2] = _lua_typename(i1, _lua_type(i1, -1) | 0) | 0;
+ HEAP32[i6 + 4 >> 2] = i8;
+ _luaL_error(i1, 8360, i6) | 0;
+ }
+ _luaL_addvalue(i2);
+ _luaL_addlstring(i2, i4, HEAP32[i5 >> 2] | 0);
+ i8 = i8 + 1 | 0;
+ } while ((i8 | 0) != (i7 | 0));
+ }
+ _lua_rawgeti(i1, 1, i7);
+ if ((_lua_isstring(i1, -1) | 0) == 0) {
+ HEAP32[i6 >> 2] = _lua_typename(i1, _lua_type(i1, -1) | 0) | 0;
+ HEAP32[i6 + 4 >> 2] = i7;
+ _luaL_error(i1, 8360, i6) | 0;
+ }
+ _luaL_addvalue(i2);
+ _luaL_pushresult(i2);
+ STACKTOP = i3;
+ return 1;
+}
+function _searcher_Croot(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i2;
+ i4 = _luaL_checklstring(i1, 1, 0) | 0;
+ i5 = _strchr(i4, 46) | 0;
+ if ((i5 | 0) == 0) {
+ i6 = 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ _lua_pushlstring(i1, i4, i5 - i4 | 0) | 0;
+ i5 = _lua_tolstring(i1, -1, 0) | 0;
+ _lua_getfield(i1, -1001001, 4440);
+ i6 = _lua_tolstring(i1, -1, 0) | 0;
+ if ((i6 | 0) == 0) {
+ HEAP32[i3 >> 2] = 4440;
+ _luaL_error(i1, 5032, i3) | 0;
+ }
+ i5 = _searchpath(i1, i5, i6, 4936, 4848) | 0;
+ if ((i5 | 0) == 0) {
+ i6 = 1;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ i6 = _loadfunc(i1, i5, i4) | 0;
+ if ((i6 | 0) == 2) {
+ HEAP32[i3 >> 2] = i4;
+ HEAP32[i3 + 4 >> 2] = i5;
+ _lua_pushfstring(i1, 4856, i3) | 0;
+ i6 = 1;
+ STACKTOP = i2;
+ return i6 | 0;
+ } else if ((i6 | 0) == 0) {
+ _lua_pushstring(i1, i5) | 0;
+ i6 = 2;
+ STACKTOP = i2;
+ return i6 | 0;
+ } else {
+ i4 = _lua_tolstring(i1, 1, 0) | 0;
+ i6 = _lua_tolstring(i1, -1, 0) | 0;
+ HEAP32[i3 >> 2] = i4;
+ HEAP32[i3 + 4 >> 2] = i5;
+ HEAP32[i3 + 8 >> 2] = i6;
+ i6 = _luaL_error(i1, 4888, i3) | 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ return 0;
+}
+function _lua_tonumberx(i5, i7, i1) {
+ i5 = i5 | 0;
+ i7 = i7 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i6 = 0, d8 = 0.0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i2;
+ i6 = HEAP32[i5 + 16 >> 2] | 0;
+ do {
+ if ((i7 | 0) <= 0) {
+ if (!((i7 | 0) < -1000999)) {
+ i4 = (HEAP32[i5 + 8 >> 2] | 0) + (i7 << 4) | 0;
+ break;
+ }
+ if ((i7 | 0) == -1001e3) {
+ i4 = (HEAP32[i5 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i5 = -1001e3 - i7 | 0;
+ i6 = HEAP32[i6 >> 2] | 0;
+ if ((HEAP32[i6 + 8 >> 2] | 0) != 22 ? (i4 = HEAP32[i6 >> 2] | 0, (i5 | 0) <= (HEAPU8[i4 + 6 | 0] | 0 | 0)) : 0) {
+ i4 = i4 + (i5 + -1 << 4) + 16 | 0;
+ } else {
+ i4 = 5192;
+ }
+ } else {
+ i4 = (HEAP32[i6 >> 2] | 0) + (i7 << 4) | 0;
+ i4 = i4 >>> 0 < (HEAP32[i5 + 8 >> 2] | 0) >>> 0 ? i4 : 5192;
+ }
+ } while (0);
+ if ((HEAP32[i4 + 8 >> 2] | 0) != 3) {
+ i4 = _luaV_tonumber(i4, i3) | 0;
+ if ((i4 | 0) == 0) {
+ if ((i1 | 0) == 0) {
+ d8 = 0.0;
+ STACKTOP = i2;
+ return +d8;
+ }
+ HEAP32[i1 >> 2] = 0;
+ d8 = 0.0;
+ STACKTOP = i2;
+ return +d8;
+ }
+ }
+ if ((i1 | 0) != 0) {
+ HEAP32[i1 >> 2] = 1;
+ }
+ d8 = +HEAPF64[i4 >> 3];
+ STACKTOP = i2;
+ return +d8;
+}
+function _luaopen_package(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _luaL_getsubtable(i1, -1001e3, 4184) | 0;
+ _lua_createtable(i1, 0, 1);
+ _lua_pushcclosure(i1, 158, 0);
+ _lua_setfield(i1, -2, 4192);
+ _lua_setmetatable(i1, -2) | 0;
+ _lua_createtable(i1, 0, 3);
+ _luaL_setfuncs(i1, 4200, 0);
+ _lua_createtable(i1, 4, 0);
+ _lua_pushvalue(i1, -2);
+ _lua_pushcclosure(i1, 159, 1);
+ _lua_rawseti(i1, -2, 1);
+ _lua_pushvalue(i1, -2);
+ _lua_pushcclosure(i1, 160, 1);
+ _lua_rawseti(i1, -2, 2);
+ _lua_pushvalue(i1, -2);
+ _lua_pushcclosure(i1, 161, 1);
+ _lua_rawseti(i1, -2, 3);
+ _lua_pushvalue(i1, -2);
+ _lua_pushcclosure(i1, 162, 1);
+ _lua_rawseti(i1, -2, 4);
+ _lua_pushvalue(i1, -1);
+ _lua_setfield(i1, -3, 4232);
+ _lua_setfield(i1, -2, 4240);
+ _setpath(i1, 4256, 4264, 4280, 4296);
+ _setpath(i1, 4440, 4448, 4464, 4480);
+ _lua_pushlstring(i1, 4552, 10) | 0;
+ _lua_setfield(i1, -2, 4568);
+ _luaL_getsubtable(i1, -1001e3, 4576) | 0;
+ _lua_setfield(i1, -2, 4584);
+ _luaL_getsubtable(i1, -1001e3, 4592) | 0;
+ _lua_setfield(i1, -2, 4608);
+ _lua_rawgeti(i1, -1001e3, 2);
+ _lua_pushvalue(i1, -2);
+ _luaL_setfuncs(i1, 4616, 1);
+ _lua_settop(i1, -2);
+ STACKTOP = i2;
+ return 1;
+}
+function _lua_rawlen(i3, i5) {
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i4 = 0;
+ i1 = STACKTOP;
+ i4 = HEAP32[i3 + 16 >> 2] | 0;
+ do {
+ if ((i5 | 0) <= 0) {
+ if (!((i5 | 0) < -1000999)) {
+ i2 = (HEAP32[i3 + 8 >> 2] | 0) + (i5 << 4) | 0;
+ break;
+ }
+ if ((i5 | 0) == -1001e3) {
+ i2 = (HEAP32[i3 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i3 = -1001e3 - i5 | 0;
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP32[i4 + 8 >> 2] | 0) != 22 ? (i2 = HEAP32[i4 >> 2] | 0, (i3 | 0) <= (HEAPU8[i2 + 6 | 0] | 0 | 0)) : 0) {
+ i2 = i2 + (i3 + -1 << 4) + 16 | 0;
+ } else {
+ i2 = 5192;
+ }
+ } else {
+ i2 = (HEAP32[i4 >> 2] | 0) + (i5 << 4) | 0;
+ i2 = i2 >>> 0 < (HEAP32[i3 + 8 >> 2] | 0) >>> 0 ? i2 : 5192;
+ }
+ } while (0);
+ i3 = HEAP32[i2 + 8 >> 2] & 15;
+ if ((i3 | 0) == 5) {
+ i5 = _luaH_getn(HEAP32[i2 >> 2] | 0) | 0;
+ STACKTOP = i1;
+ return i5 | 0;
+ } else if ((i3 | 0) == 4) {
+ i5 = HEAP32[(HEAP32[i2 >> 2] | 0) + 12 >> 2] | 0;
+ STACKTOP = i1;
+ return i5 | 0;
+ } else if ((i3 | 0) == 7) {
+ i5 = HEAP32[(HEAP32[i2 >> 2] | 0) + 16 >> 2] | 0;
+ STACKTOP = i1;
+ return i5 | 0;
+ } else {
+ i5 = 0;
+ STACKTOP = i1;
+ return i5 | 0;
+ }
+ return 0;
+}
+function _searchpath(i3, i5, i6, i7, i8) {
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ i6 = i6 | 0;
+ i7 = i7 | 0;
+ i8 = i8 | 0;
+ var i1 = 0, i2 = 0, i4 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 1056 | 0;
+ i4 = i2;
+ i1 = i2 + 8 | 0;
+ _luaL_buffinit(i3, i1);
+ if ((HEAP8[i7] | 0) != 0) {
+ i5 = _luaL_gsub(i3, i5, i7, i8) | 0;
+ }
+ while (1) {
+ i7 = HEAP8[i6] | 0;
+ if (i7 << 24 >> 24 == 59) {
+ i6 = i6 + 1 | 0;
+ continue;
+ } else if (i7 << 24 >> 24 == 0) {
+ i3 = 12;
+ break;
+ }
+ i8 = _strchr(i6, 59) | 0;
+ if ((i8 | 0) == 0) {
+ i8 = i6 + (_strlen(i6 | 0) | 0) | 0;
+ }
+ _lua_pushlstring(i3, i6, i8 - i6 | 0) | 0;
+ if ((i8 | 0) == 0) {
+ i3 = 12;
+ break;
+ }
+ i6 = _luaL_gsub(i3, _lua_tolstring(i3, -1, 0) | 0, 5064, i5) | 0;
+ _lua_remove(i3, -2);
+ i7 = _fopen(i6 | 0, 5088) | 0;
+ if ((i7 | 0) != 0) {
+ i3 = 10;
+ break;
+ }
+ HEAP32[i4 >> 2] = i6;
+ _lua_pushfstring(i3, 5072, i4) | 0;
+ _lua_remove(i3, -2);
+ _luaL_addvalue(i1);
+ i6 = i8;
+ }
+ if ((i3 | 0) == 10) {
+ _fclose(i7 | 0) | 0;
+ i8 = i6;
+ STACKTOP = i2;
+ return i8 | 0;
+ } else if ((i3 | 0) == 12) {
+ _luaL_pushresult(i1);
+ i8 = 0;
+ STACKTOP = i2;
+ return i8 | 0;
+ }
+ return 0;
+}
+function _io_readline(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i2;
+ i4 = _lua_touserdata(i1, -1001001) | 0;
+ i5 = _lua_tointegerx(i1, -1001002, 0) | 0;
+ if ((HEAP32[i4 + 4 >> 2] | 0) == 0) {
+ i6 = _luaL_error(i1, 3344, i3) | 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ _lua_settop(i1, 1);
+ if ((i5 | 0) >= 1) {
+ i6 = 1;
+ while (1) {
+ _lua_pushvalue(i1, -1001003 - i6 | 0);
+ if ((i6 | 0) == (i5 | 0)) {
+ break;
+ } else {
+ i6 = i6 + 1 | 0;
+ }
+ }
+ }
+ i4 = _g_read(i1, HEAP32[i4 >> 2] | 0, 2) | 0;
+ if ((_lua_type(i1, 0 - i4 | 0) | 0) != 0) {
+ i6 = i4;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ if ((i4 | 0) > 1) {
+ HEAP32[i3 >> 2] = _lua_tolstring(i1, 1 - i4 | 0, 0) | 0;
+ i6 = _luaL_error(i1, 3368, i3) | 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ if ((_lua_toboolean(i1, -1001003) | 0) == 0) {
+ i6 = 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ _lua_settop(i1, 0);
+ _lua_pushvalue(i1, -1001001);
+ i5 = (_luaL_checkudata(i1, 1, 2832) | 0) + 4 | 0;
+ i6 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = 0;
+ FUNCTION_TABLE_ii[i6 & 255](i1) | 0;
+ i6 = 0;
+ STACKTOP = i2;
+ return i6 | 0;
+}
+function _luaK_setreturns(i3, i5, i6) {
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ i6 = i6 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i7 = 0, i8 = 0;
+ i2 = STACKTOP;
+ i4 = HEAP32[i5 >> 2] | 0;
+ if ((i4 | 0) == 13) {
+ i7 = i5 + 8 | 0;
+ i8 = HEAP32[i3 >> 2] | 0;
+ i4 = HEAP32[i8 + 12 >> 2] | 0;
+ i5 = i4 + (HEAP32[i7 >> 2] << 2) | 0;
+ HEAP32[i5 >> 2] = HEAP32[i5 >> 2] & 8388607 | (i6 << 23) + 8388608;
+ i7 = i4 + (HEAP32[i7 >> 2] << 2) | 0;
+ i4 = i3 + 48 | 0;
+ HEAP32[i7 >> 2] = (HEAPU8[i4] | 0) << 6 | HEAP32[i7 >> 2] & -16321;
+ i7 = HEAP8[i4] | 0;
+ i5 = (i7 & 255) + 1 | 0;
+ i6 = i8 + 78 | 0;
+ do {
+ if (i5 >>> 0 > (HEAPU8[i6] | 0) >>> 0) {
+ if (i5 >>> 0 > 249) {
+ _luaX_syntaxerror(HEAP32[i3 + 12 >> 2] | 0, 10536);
+ } else {
+ HEAP8[i6] = i5;
+ i1 = HEAP8[i4] | 0;
+ break;
+ }
+ } else {
+ i1 = i7;
+ }
+ } while (0);
+ HEAP8[i4] = (i1 & 255) + 1;
+ STACKTOP = i2;
+ return;
+ } else if ((i4 | 0) == 12) {
+ i8 = (HEAP32[(HEAP32[i3 >> 2] | 0) + 12 >> 2] | 0) + (HEAP32[i5 + 8 >> 2] << 2) | 0;
+ HEAP32[i8 >> 2] = HEAP32[i8 >> 2] & -8372225 | (i6 << 14) + 16384 & 8372224;
+ STACKTOP = i2;
+ return;
+ } else {
+ STACKTOP = i2;
+ return;
+ }
+}
+function _luaZ_read(i2, i9, i8) {
+ i2 = i2 | 0;
+ i9 = i9 | 0;
+ i8 = i8 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i10 = 0, i11 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i1;
+ if ((i8 | 0) == 0) {
+ i11 = 0;
+ STACKTOP = i1;
+ return i11 | 0;
+ }
+ i7 = i2 + 16 | 0;
+ i6 = i2 + 8 | 0;
+ i4 = i2 + 12 | 0;
+ i5 = i2 + 4 | 0;
+ i11 = HEAP32[i2 >> 2] | 0;
+ while (1) {
+ if ((i11 | 0) == 0) {
+ i10 = FUNCTION_TABLE_iiii[HEAP32[i6 >> 2] & 3](HEAP32[i7 >> 2] | 0, HEAP32[i4 >> 2] | 0, i3) | 0;
+ if ((i10 | 0) == 0) {
+ i2 = 9;
+ break;
+ }
+ i11 = HEAP32[i3 >> 2] | 0;
+ if ((i11 | 0) == 0) {
+ i2 = 9;
+ break;
+ }
+ HEAP32[i2 >> 2] = i11;
+ HEAP32[i5 >> 2] = i10;
+ } else {
+ i10 = HEAP32[i5 >> 2] | 0;
+ }
+ i11 = i8 >>> 0 > i11 >>> 0 ? i11 : i8;
+ _memcpy(i9 | 0, i10 | 0, i11 | 0) | 0;
+ i10 = (HEAP32[i2 >> 2] | 0) - i11 | 0;
+ HEAP32[i2 >> 2] = i10;
+ HEAP32[i5 >> 2] = (HEAP32[i5 >> 2] | 0) + i11;
+ if ((i8 | 0) == (i11 | 0)) {
+ i8 = 0;
+ i2 = 9;
+ break;
+ } else {
+ i8 = i8 - i11 | 0;
+ i9 = i9 + i11 | 0;
+ i11 = i10;
+ }
+ }
+ if ((i2 | 0) == 9) {
+ STACKTOP = i1;
+ return i8 | 0;
+ }
+ return 0;
+}
+function _lua_load(i1, i5, i4, i3, i6) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i6 = i6 | 0;
+ var i2 = 0, i7 = 0, i8 = 0, i9 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 32 | 0;
+ i7 = i2;
+ _luaZ_init(i1, i7, i5, i4);
+ i3 = _luaD_protectedparser(i1, i7, (i3 | 0) == 0 ? 928 : i3, i6) | 0;
+ if ((i3 | 0) != 0) {
+ STACKTOP = i2;
+ return i3 | 0;
+ }
+ i4 = HEAP32[(HEAP32[i1 + 8 >> 2] | 0) + -16 >> 2] | 0;
+ if ((HEAP8[i4 + 6 | 0] | 0) != 1) {
+ STACKTOP = i2;
+ return i3 | 0;
+ }
+ i5 = _luaH_getint(HEAP32[(HEAP32[i1 + 12 >> 2] | 0) + 40 >> 2] | 0, 2) | 0;
+ i4 = i4 + 16 | 0;
+ i6 = HEAP32[(HEAP32[i4 >> 2] | 0) + 8 >> 2] | 0;
+ i9 = i5;
+ i8 = HEAP32[i9 + 4 >> 2] | 0;
+ i7 = i6;
+ HEAP32[i7 >> 2] = HEAP32[i9 >> 2];
+ HEAP32[i7 + 4 >> 2] = i8;
+ i7 = i5 + 8 | 0;
+ HEAP32[i6 + 8 >> 2] = HEAP32[i7 >> 2];
+ if ((HEAP32[i7 >> 2] & 64 | 0) == 0) {
+ STACKTOP = i2;
+ return i3 | 0;
+ }
+ i5 = HEAP32[i5 >> 2] | 0;
+ if ((HEAP8[i5 + 5 | 0] & 3) == 0) {
+ STACKTOP = i2;
+ return i3 | 0;
+ }
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP8[i4 + 5 | 0] & 4) == 0) {
+ STACKTOP = i2;
+ return i3 | 0;
+ }
+ _luaC_barrier_(i1, i4, i5);
+ STACKTOP = i2;
+ return i3 | 0;
+}
+function _g_write(i1, i4, i8) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i8 = i8 | 0;
+ var i2 = 0, i3 = 0, i5 = 0, i6 = 0, i7 = 0, i9 = 0, d10 = 0.0;
+ i5 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i2 = i5;
+ i3 = i5 + 8 | 0;
+ i7 = _lua_gettop(i1) | 0;
+ if ((i7 | 0) == (i8 | 0)) {
+ i9 = 1;
+ STACKTOP = i5;
+ return i9 | 0;
+ }
+ i6 = i8;
+ i7 = i7 - i8 | 0;
+ i9 = 1;
+ while (1) {
+ i7 = i7 + -1 | 0;
+ if ((_lua_type(i1, i6) | 0) == 3) {
+ if ((i9 | 0) == 0) {
+ i8 = 0;
+ } else {
+ d10 = +_lua_tonumberx(i1, i6, 0);
+ HEAPF64[tempDoublePtr >> 3] = d10;
+ HEAP32[i2 >> 2] = HEAP32[tempDoublePtr >> 2];
+ HEAP32[i2 + 4 >> 2] = HEAP32[tempDoublePtr + 4 >> 2];
+ i8 = (_fprintf(i4 | 0, 3072, i2 | 0) | 0) > 0;
+ }
+ } else {
+ i8 = _luaL_checklstring(i1, i6, i3) | 0;
+ if ((i9 | 0) == 0) {
+ i8 = 0;
+ } else {
+ i8 = _fwrite(i8 | 0, 1, HEAP32[i3 >> 2] | 0, i4 | 0) | 0;
+ i8 = (i8 | 0) == (HEAP32[i3 >> 2] | 0);
+ }
+ }
+ if ((i7 | 0) == 0) {
+ break;
+ } else {
+ i6 = i6 + 1 | 0;
+ i9 = i8 & 1;
+ }
+ }
+ if (i8) {
+ i9 = 1;
+ STACKTOP = i5;
+ return i9 | 0;
+ }
+ i9 = _luaL_fileresult(i1, 0, 0) | 0;
+ STACKTOP = i5;
+ return i9 | 0;
+}
+function _lua_getuservalue(i2, i5) {
+ i2 = i2 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i3 = 0, i4 = 0;
+ i1 = STACKTOP;
+ i4 = HEAP32[i2 + 16 >> 2] | 0;
+ do {
+ if ((i5 | 0) <= 0) {
+ if (!((i5 | 0) < -1000999)) {
+ i3 = (HEAP32[i2 + 8 >> 2] | 0) + (i5 << 4) | 0;
+ break;
+ }
+ if ((i5 | 0) == -1001e3) {
+ i3 = (HEAP32[i2 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i5 = -1001e3 - i5 | 0;
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP32[i4 + 8 >> 2] | 0) != 22 ? (i3 = HEAP32[i4 >> 2] | 0, (i5 | 0) <= (HEAPU8[i3 + 6 | 0] | 0 | 0)) : 0) {
+ i3 = i3 + (i5 + -1 << 4) + 16 | 0;
+ } else {
+ i3 = 5192;
+ }
+ } else {
+ i3 = (HEAP32[i4 >> 2] | 0) + (i5 << 4) | 0;
+ i3 = i3 >>> 0 < (HEAP32[i2 + 8 >> 2] | 0) >>> 0 ? i3 : 5192;
+ }
+ } while (0);
+ i3 = HEAP32[(HEAP32[i3 >> 2] | 0) + 12 >> 2] | 0;
+ i2 = i2 + 8 | 0;
+ i4 = HEAP32[i2 >> 2] | 0;
+ if ((i3 | 0) == 0) {
+ HEAP32[i4 + 8 >> 2] = 0;
+ i5 = i4;
+ i5 = i5 + 16 | 0;
+ HEAP32[i2 >> 2] = i5;
+ STACKTOP = i1;
+ return;
+ } else {
+ HEAP32[i4 >> 2] = i3;
+ HEAP32[i4 + 8 >> 2] = 69;
+ i5 = HEAP32[i2 >> 2] | 0;
+ i5 = i5 + 16 | 0;
+ HEAP32[i2 >> 2] = i5;
+ STACKTOP = i1;
+ return;
+ }
+}
+function _luaL_addlstring(i7, i6, i1) {
+ i7 = i7 | 0;
+ i6 = i6 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i8 = 0, i9 = 0;
+ i5 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = HEAP32[i7 + 12 >> 2] | 0;
+ i3 = i7 + 4 | 0;
+ i9 = HEAP32[i3 >> 2] | 0;
+ i2 = i7 + 8 | 0;
+ i8 = HEAP32[i2 >> 2] | 0;
+ if (!((i9 - i8 | 0) >>> 0 < i1 >>> 0)) {
+ i7 = HEAP32[i7 >> 2] | 0;
+ i9 = i8;
+ i9 = i7 + i9 | 0;
+ _memcpy(i9 | 0, i6 | 0, i1 | 0) | 0;
+ i9 = HEAP32[i2 >> 2] | 0;
+ i9 = i9 + i1 | 0;
+ HEAP32[i2 >> 2] = i9;
+ STACKTOP = i5;
+ return;
+ }
+ i9 = i9 << 1;
+ i9 = (i9 - i8 | 0) >>> 0 < i1 >>> 0 ? i8 + i1 | 0 : i9;
+ if (i9 >>> 0 < i8 >>> 0 | (i9 - i8 | 0) >>> 0 < i1 >>> 0) {
+ _luaL_error(i4, 1272, i5) | 0;
+ }
+ i8 = _lua_newuserdata(i4, i9) | 0;
+ _memcpy(i8 | 0, HEAP32[i7 >> 2] | 0, HEAP32[i2 >> 2] | 0) | 0;
+ if ((HEAP32[i7 >> 2] | 0) != (i7 + 16 | 0)) {
+ _lua_remove(i4, -2);
+ }
+ HEAP32[i7 >> 2] = i8;
+ HEAP32[i3 >> 2] = i9;
+ i9 = HEAP32[i2 >> 2] | 0;
+ i9 = i8 + i9 | 0;
+ _memcpy(i9 | 0, i6 | 0, i1 | 0) | 0;
+ i9 = HEAP32[i2 >> 2] | 0;
+ i9 = i9 + i1 | 0;
+ HEAP32[i2 >> 2] = i9;
+ STACKTOP = i5;
+ return;
+}
+function _lua_rawgeti(i3, i6, i1) {
+ i3 = i3 | 0;
+ i6 = i6 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i4 = 0, i5 = 0, i7 = 0;
+ i2 = STACKTOP;
+ i5 = HEAP32[i3 + 16 >> 2] | 0;
+ do {
+ if ((i6 | 0) <= 0) {
+ if (!((i6 | 0) < -1000999)) {
+ i4 = (HEAP32[i3 + 8 >> 2] | 0) + (i6 << 4) | 0;
+ break;
+ }
+ if ((i6 | 0) == -1001e3) {
+ i4 = (HEAP32[i3 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i6 = -1001e3 - i6 | 0;
+ i5 = HEAP32[i5 >> 2] | 0;
+ if ((HEAP32[i5 + 8 >> 2] | 0) != 22 ? (i4 = HEAP32[i5 >> 2] | 0, (i6 | 0) <= (HEAPU8[i4 + 6 | 0] | 0 | 0)) : 0) {
+ i4 = i4 + (i6 + -1 << 4) + 16 | 0;
+ } else {
+ i4 = 5192;
+ }
+ } else {
+ i4 = (HEAP32[i5 >> 2] | 0) + (i6 << 4) | 0;
+ i4 = i4 >>> 0 < (HEAP32[i3 + 8 >> 2] | 0) >>> 0 ? i4 : 5192;
+ }
+ } while (0);
+ i4 = _luaH_getint(HEAP32[i4 >> 2] | 0, i1) | 0;
+ i6 = i3 + 8 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ i7 = i4;
+ i1 = HEAP32[i7 + 4 >> 2] | 0;
+ i3 = i5;
+ HEAP32[i3 >> 2] = HEAP32[i7 >> 2];
+ HEAP32[i3 + 4 >> 2] = i1;
+ HEAP32[i5 + 8 >> 2] = HEAP32[i4 + 8 >> 2];
+ HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + 16;
+ STACKTOP = i2;
+ return;
+}
+function _lua_setfield(i1, i6, i3) {
+ i1 = i1 | 0;
+ i6 = i6 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0, i5 = 0;
+ i2 = STACKTOP;
+ i5 = HEAP32[i1 + 16 >> 2] | 0;
+ do {
+ if ((i6 | 0) <= 0) {
+ if (!((i6 | 0) < -1000999)) {
+ i4 = (HEAP32[i1 + 8 >> 2] | 0) + (i6 << 4) | 0;
+ break;
+ }
+ if ((i6 | 0) == -1001e3) {
+ i4 = (HEAP32[i1 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i6 = -1001e3 - i6 | 0;
+ i5 = HEAP32[i5 >> 2] | 0;
+ if ((HEAP32[i5 + 8 >> 2] | 0) != 22 ? (i4 = HEAP32[i5 >> 2] | 0, (i6 | 0) <= (HEAPU8[i4 + 6 | 0] | 0 | 0)) : 0) {
+ i4 = i4 + (i6 + -1 << 4) + 16 | 0;
+ } else {
+ i4 = 5192;
+ }
+ } else {
+ i4 = (HEAP32[i5 >> 2] | 0) + (i6 << 4) | 0;
+ i4 = i4 >>> 0 < (HEAP32[i1 + 8 >> 2] | 0) >>> 0 ? i4 : 5192;
+ }
+ } while (0);
+ i6 = i1 + 8 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i6 >> 2] = i5 + 16;
+ i3 = _luaS_new(i1, i3) | 0;
+ HEAP32[i5 >> 2] = i3;
+ HEAP32[i5 + 8 >> 2] = HEAPU8[i3 + 4 | 0] | 0 | 64;
+ i5 = HEAP32[i6 >> 2] | 0;
+ _luaV_settable(i1, i4, i5 + -16 | 0, i5 + -32 | 0);
+ HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + -32;
+ STACKTOP = i2;
+ return;
+}
+function _luaopen_io(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0;
+ i2 = STACKTOP;
+ _lua_createtable(i1, 0, 11);
+ _luaL_setfuncs(i1, 2680, 0);
+ _luaL_newmetatable(i1, 2832) | 0;
+ _lua_pushvalue(i1, -1);
+ _lua_setfield(i1, -2, 2872);
+ _luaL_setfuncs(i1, 2880, 0);
+ _lua_settop(i1, -2);
+ i5 = HEAP32[_stdin >> 2] | 0;
+ i4 = _lua_newuserdata(i1, 8) | 0;
+ i3 = i4 + 4 | 0;
+ HEAP32[i3 >> 2] = 0;
+ _luaL_setmetatable(i1, 2832);
+ HEAP32[i4 >> 2] = i5;
+ HEAP32[i3 >> 2] = 154;
+ _lua_pushvalue(i1, -1);
+ _lua_setfield(i1, -1001e3, 2776);
+ _lua_setfield(i1, -2, 2792);
+ i3 = HEAP32[_stdout >> 2] | 0;
+ i4 = _lua_newuserdata(i1, 8) | 0;
+ i5 = i4 + 4 | 0;
+ HEAP32[i5 >> 2] = 0;
+ _luaL_setmetatable(i1, 2832);
+ HEAP32[i4 >> 2] = i3;
+ HEAP32[i5 >> 2] = 154;
+ _lua_pushvalue(i1, -1);
+ _lua_setfield(i1, -1001e3, 2800);
+ _lua_setfield(i1, -2, 2816);
+ i5 = HEAP32[_stderr >> 2] | 0;
+ i4 = _lua_newuserdata(i1, 8) | 0;
+ i3 = i4 + 4 | 0;
+ HEAP32[i3 >> 2] = 0;
+ _luaL_setmetatable(i1, 2832);
+ HEAP32[i4 >> 2] = i5;
+ HEAP32[i3 >> 2] = 154;
+ _lua_setfield(i1, -2, 2824);
+ STACKTOP = i2;
+ return 1;
+}
+function _lua_pushcclosure(i1, i4, i5) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0;
+ i2 = STACKTOP;
+ if ((i5 | 0) == 0) {
+ i6 = HEAP32[i1 + 8 >> 2] | 0;
+ HEAP32[i6 >> 2] = i4;
+ HEAP32[i6 + 8 >> 2] = 22;
+ i6 = i1 + 8 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ i5 = i5 + 16 | 0;
+ HEAP32[i6 >> 2] = i5;
+ STACKTOP = i2;
+ return;
+ }
+ if ((HEAP32[(HEAP32[i1 + 12 >> 2] | 0) + 12 >> 2] | 0) > 0) {
+ _luaC_step(i1);
+ }
+ i3 = _luaF_newCclosure(i1, i5) | 0;
+ HEAP32[i3 + 12 >> 2] = i4;
+ i4 = i1 + 8 | 0;
+ i6 = (HEAP32[i4 >> 2] | 0) + (0 - i5 << 4) | 0;
+ HEAP32[i4 >> 2] = i6;
+ do {
+ i5 = i5 + -1 | 0;
+ i9 = i6 + (i5 << 4) | 0;
+ i8 = HEAP32[i9 + 4 >> 2] | 0;
+ i7 = i3 + (i5 << 4) + 16 | 0;
+ HEAP32[i7 >> 2] = HEAP32[i9 >> 2];
+ HEAP32[i7 + 4 >> 2] = i8;
+ HEAP32[i3 + (i5 << 4) + 24 >> 2] = HEAP32[i6 + (i5 << 4) + 8 >> 2];
+ i6 = HEAP32[i4 >> 2] | 0;
+ } while ((i5 | 0) != 0);
+ HEAP32[i6 >> 2] = i3;
+ HEAP32[i6 + 8 >> 2] = 102;
+ i9 = i1 + 8 | 0;
+ i8 = HEAP32[i9 >> 2] | 0;
+ i8 = i8 + 16 | 0;
+ HEAP32[i9 >> 2] = i8;
+ STACKTOP = i2;
+ return;
+}
+function _luaF_findupval(i3, i4) {
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i2 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i1 = STACKTOP;
+ i2 = HEAP32[i3 + 12 >> 2] | 0;
+ i6 = i3 + 56 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ L1 : do {
+ if ((i5 | 0) == 0) {
+ i5 = i6;
+ } else {
+ while (1) {
+ i7 = HEAP32[i5 + 8 >> 2] | 0;
+ if (i7 >>> 0 < i4 >>> 0) {
+ i5 = i6;
+ break L1;
+ }
+ if ((i7 | 0) == (i4 | 0)) {
+ break;
+ }
+ i6 = HEAP32[i5 >> 2] | 0;
+ if ((i6 | 0) == 0) {
+ break L1;
+ } else {
+ i7 = i5;
+ i5 = i6;
+ i6 = i7;
+ }
+ }
+ i4 = i5 + 5 | 0;
+ i3 = (HEAPU8[i4] | 0) ^ 3;
+ if ((((HEAPU8[i2 + 60 | 0] | 0) ^ 3) & i3 | 0) != 0) {
+ i7 = i5;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ HEAP8[i4] = i3;
+ i7 = i5;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ } while (0);
+ i7 = _luaC_newobj(i3, 10, 32, i5, 0) | 0;
+ HEAP32[i7 + 8 >> 2] = i4;
+ i4 = i7 + 16 | 0;
+ HEAP32[i4 >> 2] = i2 + 112;
+ i6 = i2 + 132 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i4 + 4 >> 2] = i5;
+ HEAP32[i5 + 16 >> 2] = i7;
+ HEAP32[i6 >> 2] = i7;
+ STACKTOP = i1;
+ return i7 | 0;
+}
+function _luaC_checkfinalizer(i5, i4, i6) {
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ i6 = i6 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i7 = 0, i8 = 0;
+ i3 = STACKTOP;
+ i1 = HEAP32[i5 + 12 >> 2] | 0;
+ i2 = i4 + 5 | 0;
+ if ((HEAP8[i2] & 24) != 0 | (i6 | 0) == 0) {
+ STACKTOP = i3;
+ return;
+ }
+ if (!((HEAP8[i6 + 6 | 0] & 4) == 0)) {
+ STACKTOP = i3;
+ return;
+ }
+ if ((_luaT_gettm(i6, 2, HEAP32[i1 + 192 >> 2] | 0) | 0) == 0) {
+ STACKTOP = i3;
+ return;
+ }
+ i7 = i1 + 76 | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ if ((i8 | 0) == (i4 | 0)) {
+ do {
+ i6 = _sweeplist(i5, i8, 1) | 0;
+ } while ((i6 | 0) == (i8 | 0));
+ HEAP32[i7 >> 2] = i6;
+ }
+ i5 = i1 + 68 | 0;
+ while (1) {
+ i6 = HEAP32[i5 >> 2] | 0;
+ if ((i6 | 0) == (i4 | 0)) {
+ break;
+ } else {
+ i5 = i6;
+ }
+ }
+ HEAP32[i5 >> 2] = HEAP32[i4 >> 2];
+ i8 = i1 + 72 | 0;
+ HEAP32[i4 >> 2] = HEAP32[i8 >> 2];
+ HEAP32[i8 >> 2] = i4;
+ i4 = HEAPU8[i2] | 0 | 16;
+ HEAP8[i2] = i4;
+ if ((HEAPU8[i1 + 61 | 0] | 0) < 2) {
+ HEAP8[i2] = i4 & 191;
+ STACKTOP = i3;
+ return;
+ } else {
+ HEAP8[i2] = HEAP8[i1 + 60 | 0] & 3 | i4 & 184;
+ STACKTOP = i3;
+ return;
+ }
+}
+function _io_lines(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i2;
+ if ((_lua_type(i1, 1) | 0) == -1) {
+ _lua_pushnil(i1);
+ }
+ if ((_lua_type(i1, 1) | 0) == 0) {
+ _lua_getfield(i1, -1001e3, 2776);
+ _lua_replace(i1, 1);
+ if ((HEAP32[(_luaL_checkudata(i1, 1, 2832) | 0) + 4 >> 2] | 0) != 0) {
+ i4 = 0;
+ _aux_lines(i1, i4);
+ STACKTOP = i2;
+ return 1;
+ }
+ _luaL_error(i1, 3080, i3) | 0;
+ i4 = 0;
+ _aux_lines(i1, i4);
+ STACKTOP = i2;
+ return 1;
+ } else {
+ i4 = _luaL_checklstring(i1, 1, 0) | 0;
+ i6 = _lua_newuserdata(i1, 8) | 0;
+ i5 = i6 + 4 | 0;
+ HEAP32[i5 >> 2] = 0;
+ _luaL_setmetatable(i1, 2832);
+ HEAP32[i6 >> 2] = 0;
+ HEAP32[i5 >> 2] = 156;
+ i5 = _fopen(i4 | 0, 3480) | 0;
+ HEAP32[i6 >> 2] = i5;
+ if ((i5 | 0) == 0) {
+ i6 = _strerror(HEAP32[(___errno_location() | 0) >> 2] | 0) | 0;
+ HEAP32[i3 >> 2] = i4;
+ HEAP32[i3 + 4 >> 2] = i6;
+ _luaL_error(i1, 3520, i3) | 0;
+ }
+ _lua_replace(i1, 1);
+ i6 = 1;
+ _aux_lines(i1, i6);
+ STACKTOP = i2;
+ return 1;
+ }
+ return 0;
+}
+function _luaC_changemode(i2, i6) {
+ i2 = i2 | 0;
+ i6 = i6 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0;
+ i1 = STACKTOP;
+ i3 = i2 + 12 | 0;
+ i5 = HEAP32[i3 >> 2] | 0;
+ i4 = i5 + 62 | 0;
+ if ((HEAPU8[i4] | 0) == (i6 | 0)) {
+ STACKTOP = i1;
+ return;
+ }
+ if ((i6 | 0) == 2) {
+ i3 = i5 + 61 | 0;
+ if ((HEAP8[i3] | 0) != 0) {
+ do {
+ _singlestep(i2) | 0;
+ } while ((HEAP8[i3] | 0) != 0);
+ }
+ HEAP32[i5 + 20 >> 2] = (HEAP32[i5 + 12 >> 2] | 0) + (HEAP32[i5 + 8 >> 2] | 0);
+ HEAP8[i4] = 2;
+ STACKTOP = i1;
+ return;
+ }
+ HEAP8[i4] = 0;
+ i4 = HEAP32[i3 >> 2] | 0;
+ HEAP8[i4 + 61 | 0] = 2;
+ HEAP32[i4 + 64 >> 2] = 0;
+ i5 = i4 + 72 | 0;
+ do {
+ i6 = _sweeplist(i2, i5, 1) | 0;
+ } while ((i6 | 0) == (i5 | 0));
+ HEAP32[i4 + 80 >> 2] = i6;
+ i5 = i4 + 68 | 0;
+ do {
+ i6 = _sweeplist(i2, i5, 1) | 0;
+ } while ((i6 | 0) == (i5 | 0));
+ HEAP32[i4 + 76 >> 2] = i6;
+ i3 = (HEAP32[i3 >> 2] | 0) + 61 | 0;
+ if ((1 << HEAPU8[i3] & -29 | 0) != 0) {
+ STACKTOP = i1;
+ return;
+ }
+ do {
+ _singlestep(i2) | 0;
+ } while ((1 << HEAPU8[i3] & -29 | 0) == 0);
+ STACKTOP = i1;
+ return;
+}
+function _lua_rawget(i1, i5) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i6 = 0;
+ i2 = STACKTOP;
+ i4 = HEAP32[i1 + 16 >> 2] | 0;
+ do {
+ if ((i5 | 0) <= 0) {
+ if (!((i5 | 0) < -1000999)) {
+ i3 = (HEAP32[i1 + 8 >> 2] | 0) + (i5 << 4) | 0;
+ break;
+ }
+ if ((i5 | 0) == -1001e3) {
+ i3 = (HEAP32[i1 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i5 = -1001e3 - i5 | 0;
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP32[i4 + 8 >> 2] | 0) != 22 ? (i3 = HEAP32[i4 >> 2] | 0, (i5 | 0) <= (HEAPU8[i3 + 6 | 0] | 0 | 0)) : 0) {
+ i3 = i3 + (i5 + -1 << 4) + 16 | 0;
+ } else {
+ i3 = 5192;
+ }
+ } else {
+ i3 = (HEAP32[i4 >> 2] | 0) + (i5 << 4) | 0;
+ i3 = i3 >>> 0 < (HEAP32[i1 + 8 >> 2] | 0) >>> 0 ? i3 : 5192;
+ }
+ } while (0);
+ i5 = i1 + 8 | 0;
+ i4 = _luaH_get(HEAP32[i3 >> 2] | 0, (HEAP32[i5 >> 2] | 0) + -16 | 0) | 0;
+ i5 = HEAP32[i5 >> 2] | 0;
+ i6 = i4;
+ i1 = HEAP32[i6 + 4 >> 2] | 0;
+ i3 = i5 + -16 | 0;
+ HEAP32[i3 >> 2] = HEAP32[i6 >> 2];
+ HEAP32[i3 + 4 >> 2] = i1;
+ HEAP32[i5 + -8 >> 2] = HEAP32[i4 + 8 >> 2];
+ STACKTOP = i2;
+ return;
+}
+function _lua_isstring(i2, i4) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i3 = 0;
+ i1 = STACKTOP;
+ i3 = HEAP32[i2 + 16 >> 2] | 0;
+ do {
+ if ((i4 | 0) <= 0) {
+ if (!((i4 | 0) < -1000999)) {
+ i2 = (HEAP32[i2 + 8 >> 2] | 0) + (i4 << 4) | 0;
+ break;
+ }
+ if ((i4 | 0) == -1001e3) {
+ i2 = (HEAP32[i2 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i2 = -1001e3 - i4 | 0;
+ i3 = HEAP32[i3 >> 2] | 0;
+ if ((HEAP32[i3 + 8 >> 2] | 0) == 22) {
+ i4 = 0;
+ i4 = i4 & 1;
+ STACKTOP = i1;
+ return i4 | 0;
+ }
+ i3 = HEAP32[i3 >> 2] | 0;
+ if ((i2 | 0) > (HEAPU8[i3 + 6 | 0] | 0 | 0)) {
+ i4 = 0;
+ i4 = i4 & 1;
+ STACKTOP = i1;
+ return i4 | 0;
+ } else {
+ i2 = i3 + (i2 + -1 << 4) + 16 | 0;
+ break;
+ }
+ } else {
+ i3 = (HEAP32[i3 >> 2] | 0) + (i4 << 4) | 0;
+ i2 = i3 >>> 0 < (HEAP32[i2 + 8 >> 2] | 0) >>> 0 ? i3 : 5192;
+ }
+ } while (0);
+ if ((i2 | 0) == 5192) {
+ i4 = 0;
+ i4 = i4 & 1;
+ STACKTOP = i1;
+ return i4 | 0;
+ }
+ i4 = ((HEAP32[i2 + 8 >> 2] & 15) + -3 | 0) >>> 0 < 2;
+ i4 = i4 & 1;
+ STACKTOP = i1;
+ return i4 | 0;
+}
+function _setnodevector(i5, i1, i3) {
+ i5 = i5 | 0;
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0, i6 = 0, i7 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ if ((i3 | 0) == 0) {
+ HEAP32[i1 + 16 >> 2] = 8016;
+ i6 = 0;
+ i7 = 8016;
+ i4 = 0;
+ i5 = i1 + 7 | 0;
+ HEAP8[i5] = i4;
+ i6 = i7 + (i6 << 5) | 0;
+ i7 = i1 + 20 | 0;
+ HEAP32[i7 >> 2] = i6;
+ STACKTOP = i2;
+ return;
+ }
+ i4 = _luaO_ceillog2(i3) | 0;
+ if ((i4 | 0) > 30) {
+ _luaG_runerror(i5, 8048, i2);
+ }
+ i3 = 1 << i4;
+ if ((i3 + 1 | 0) >>> 0 > 134217727) {
+ _luaM_toobig(i5);
+ }
+ i6 = _luaM_realloc_(i5, 0, 0, i3 << 5) | 0;
+ i5 = i1 + 16 | 0;
+ HEAP32[i5 >> 2] = i6;
+ if ((i3 | 0) > 0) {
+ i7 = 0;
+ do {
+ HEAP32[i6 + (i7 << 5) + 28 >> 2] = 0;
+ HEAP32[i6 + (i7 << 5) + 24 >> 2] = 0;
+ HEAP32[i6 + (i7 << 5) + 8 >> 2] = 0;
+ i7 = i7 + 1 | 0;
+ i6 = HEAP32[i5 >> 2] | 0;
+ } while ((i7 | 0) != (i3 | 0));
+ }
+ i7 = i3;
+ i4 = i4 & 255;
+ i5 = i1 + 7 | 0;
+ HEAP8[i5] = i4;
+ i6 = i6 + (i7 << 5) | 0;
+ i7 = i1 + 20 | 0;
+ HEAP32[i7 >> 2] = i6;
+ STACKTOP = i2;
+ return;
+}
+function _lua_pushvalue(i1, i5) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i6 = 0, i7 = 0;
+ i2 = STACKTOP;
+ i4 = HEAP32[i1 + 16 >> 2] | 0;
+ do {
+ if ((i5 | 0) <= 0) {
+ if (!((i5 | 0) < -1000999)) {
+ i3 = (HEAP32[i1 + 8 >> 2] | 0) + (i5 << 4) | 0;
+ break;
+ }
+ if ((i5 | 0) == -1001e3) {
+ i3 = (HEAP32[i1 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i5 = -1001e3 - i5 | 0;
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP32[i4 + 8 >> 2] | 0) != 22 ? (i3 = HEAP32[i4 >> 2] | 0, (i5 | 0) <= (HEAPU8[i3 + 6 | 0] | 0 | 0)) : 0) {
+ i3 = i3 + (i5 + -1 << 4) + 16 | 0;
+ } else {
+ i3 = 5192;
+ }
+ } else {
+ i3 = (HEAP32[i4 >> 2] | 0) + (i5 << 4) | 0;
+ i3 = i3 >>> 0 < (HEAP32[i1 + 8 >> 2] | 0) >>> 0 ? i3 : 5192;
+ }
+ } while (0);
+ i5 = i1 + 8 | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ i7 = i3;
+ i6 = HEAP32[i7 + 4 >> 2] | 0;
+ i1 = i4;
+ HEAP32[i1 >> 2] = HEAP32[i7 >> 2];
+ HEAP32[i1 + 4 >> 2] = i6;
+ HEAP32[i4 + 8 >> 2] = HEAP32[i3 + 8 >> 2];
+ HEAP32[i5 >> 2] = (HEAP32[i5 >> 2] | 0) + 16;
+ STACKTOP = i2;
+ return;
+}
+function _luaL_setfuncs(i3, i6, i1) {
+ i3 = i3 | 0;
+ i6 = i6 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i4 = 0, i5 = 0, i7 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i2;
+ _luaL_checkversion_(i3, 502.0);
+ if ((_lua_checkstack(i3, i1 + 20 | 0) | 0) == 0) {
+ HEAP32[i4 >> 2] = 1472;
+ _luaL_error(i3, 1216, i4) | 0;
+ }
+ if ((HEAP32[i6 >> 2] | 0) == 0) {
+ i7 = ~i1;
+ _lua_settop(i3, i7);
+ STACKTOP = i2;
+ return;
+ }
+ i4 = -2 - i1 | 0;
+ i5 = 0 - i1 | 0;
+ if ((i1 | 0) <= 0) {
+ do {
+ _lua_pushcclosure(i3, HEAP32[i6 + 4 >> 2] | 0, i1);
+ _lua_setfield(i3, i4, HEAP32[i6 >> 2] | 0);
+ i6 = i6 + 8 | 0;
+ } while ((HEAP32[i6 >> 2] | 0) != 0);
+ i7 = ~i1;
+ _lua_settop(i3, i7);
+ STACKTOP = i2;
+ return;
+ }
+ do {
+ i7 = 0;
+ do {
+ _lua_pushvalue(i3, i5);
+ i7 = i7 + 1 | 0;
+ } while ((i7 | 0) != (i1 | 0));
+ _lua_pushcclosure(i3, HEAP32[i6 + 4 >> 2] | 0, i1);
+ _lua_setfield(i3, i4, HEAP32[i6 >> 2] | 0);
+ i6 = i6 + 8 | 0;
+ } while ((HEAP32[i6 >> 2] | 0) != 0);
+ i7 = ~i1;
+ _lua_settop(i3, i7);
+ STACKTOP = i2;
+ return;
+}
+function _lua_touserdata(i3, i5) {
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i4 = 0;
+ i1 = STACKTOP;
+ i4 = HEAP32[i3 + 16 >> 2] | 0;
+ do {
+ if ((i5 | 0) <= 0) {
+ if (!((i5 | 0) < -1000999)) {
+ i2 = (HEAP32[i3 + 8 >> 2] | 0) + (i5 << 4) | 0;
+ break;
+ }
+ if ((i5 | 0) == -1001e3) {
+ i2 = (HEAP32[i3 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i3 = -1001e3 - i5 | 0;
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP32[i4 + 8 >> 2] | 0) != 22 ? (i2 = HEAP32[i4 >> 2] | 0, (i3 | 0) <= (HEAPU8[i2 + 6 | 0] | 0 | 0)) : 0) {
+ i2 = i2 + (i3 + -1 << 4) + 16 | 0;
+ } else {
+ i2 = 5192;
+ }
+ } else {
+ i2 = (HEAP32[i4 >> 2] | 0) + (i5 << 4) | 0;
+ i2 = i2 >>> 0 < (HEAP32[i3 + 8 >> 2] | 0) >>> 0 ? i2 : 5192;
+ }
+ } while (0);
+ i3 = HEAP32[i2 + 8 >> 2] & 15;
+ if ((i3 | 0) == 2) {
+ i5 = HEAP32[i2 >> 2] | 0;
+ STACKTOP = i1;
+ return i5 | 0;
+ } else if ((i3 | 0) == 7) {
+ i5 = (HEAP32[i2 >> 2] | 0) + 24 | 0;
+ STACKTOP = i1;
+ return i5 | 0;
+ } else {
+ i5 = 0;
+ STACKTOP = i1;
+ return i5 | 0;
+ }
+ return 0;
+}
+function _luaL_checkoption(i2, i3, i6, i4) {
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ i6 = i6 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i5 = 0, i7 = 0, i8 = 0, i9 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i5 = i1;
+ if ((i6 | 0) == 0) {
+ i6 = _lua_tolstring(i2, i3, 0) | 0;
+ if ((i6 | 0) == 0) {
+ i9 = _lua_typename(i2, 4) | 0;
+ i6 = _lua_typename(i2, _lua_type(i2, i3) | 0) | 0;
+ HEAP32[i5 >> 2] = i9;
+ HEAP32[i5 + 4 >> 2] = i6;
+ _luaL_argerror(i2, i3, _lua_pushfstring(i2, 1744, i5) | 0) | 0;
+ i6 = 0;
+ }
+ } else {
+ i6 = _luaL_optlstring(i2, i3, i6, 0) | 0;
+ }
+ i9 = HEAP32[i4 >> 2] | 0;
+ L6 : do {
+ if ((i9 | 0) != 0) {
+ i8 = 0;
+ while (1) {
+ i7 = i8 + 1 | 0;
+ if ((_strcmp(i9, i6) | 0) == 0) {
+ break;
+ }
+ i9 = HEAP32[i4 + (i7 << 2) >> 2] | 0;
+ if ((i9 | 0) == 0) {
+ break L6;
+ } else {
+ i8 = i7;
+ }
+ }
+ STACKTOP = i1;
+ return i8 | 0;
+ }
+ } while (0);
+ HEAP32[i5 >> 2] = i6;
+ i9 = _luaL_argerror(i2, i3, _lua_pushfstring(i2, 1192, i5) | 0) | 0;
+ STACKTOP = i1;
+ return i9 | 0;
+}
+function _lua_toboolean(i3, i5) {
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i4 = 0;
+ i1 = STACKTOP;
+ i4 = HEAP32[i3 + 16 >> 2] | 0;
+ do {
+ if ((i5 | 0) <= 0) {
+ if (!((i5 | 0) < -1000999)) {
+ i3 = (HEAP32[i3 + 8 >> 2] | 0) + (i5 << 4) | 0;
+ break;
+ }
+ if ((i5 | 0) == -1001e3) {
+ i3 = (HEAP32[i3 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i3 = -1001e3 - i5 | 0;
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP32[i4 + 8 >> 2] | 0) != 22 ? (i2 = HEAP32[i4 >> 2] | 0, (i3 | 0) <= (HEAPU8[i2 + 6 | 0] | 0 | 0)) : 0) {
+ i3 = i2 + (i3 + -1 << 4) + 16 | 0;
+ } else {
+ i3 = 5192;
+ }
+ } else {
+ i2 = (HEAP32[i4 >> 2] | 0) + (i5 << 4) | 0;
+ i3 = i2 >>> 0 < (HEAP32[i3 + 8 >> 2] | 0) >>> 0 ? i2 : 5192;
+ }
+ } while (0);
+ i2 = HEAP32[i3 + 8 >> 2] | 0;
+ if ((i2 | 0) == 0) {
+ i5 = 0;
+ i5 = i5 & 1;
+ STACKTOP = i1;
+ return i5 | 0;
+ }
+ if ((i2 | 0) != 1) {
+ i5 = 1;
+ i5 = i5 & 1;
+ STACKTOP = i1;
+ return i5 | 0;
+ }
+ i5 = (HEAP32[i3 >> 2] | 0) != 0;
+ i5 = i5 & 1;
+ STACKTOP = i1;
+ return i5 | 0;
+}
+function _lua_getfield(i1, i6, i3) {
+ i1 = i1 | 0;
+ i6 = i6 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0, i5 = 0;
+ i2 = STACKTOP;
+ i5 = HEAP32[i1 + 16 >> 2] | 0;
+ do {
+ if ((i6 | 0) <= 0) {
+ if (!((i6 | 0) < -1000999)) {
+ i4 = (HEAP32[i1 + 8 >> 2] | 0) + (i6 << 4) | 0;
+ break;
+ }
+ if ((i6 | 0) == -1001e3) {
+ i4 = (HEAP32[i1 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i6 = -1001e3 - i6 | 0;
+ i5 = HEAP32[i5 >> 2] | 0;
+ if ((HEAP32[i5 + 8 >> 2] | 0) != 22 ? (i4 = HEAP32[i5 >> 2] | 0, (i6 | 0) <= (HEAPU8[i4 + 6 | 0] | 0 | 0)) : 0) {
+ i4 = i4 + (i6 + -1 << 4) + 16 | 0;
+ } else {
+ i4 = 5192;
+ }
+ } else {
+ i4 = (HEAP32[i5 >> 2] | 0) + (i6 << 4) | 0;
+ i4 = i4 >>> 0 < (HEAP32[i1 + 8 >> 2] | 0) >>> 0 ? i4 : 5192;
+ }
+ } while (0);
+ i5 = i1 + 8 | 0;
+ i6 = HEAP32[i5 >> 2] | 0;
+ i3 = _luaS_new(i1, i3) | 0;
+ HEAP32[i6 >> 2] = i3;
+ HEAP32[i6 + 8 >> 2] = HEAPU8[i3 + 4 | 0] | 0 | 64;
+ i6 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = i6 + 16;
+ _luaV_gettable(i1, i4, i6, i6);
+ STACKTOP = i2;
+ return;
+}
+function _luaL_argerror(i1, i6, i3) {
+ i1 = i1 | 0;
+ i6 = i6 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0, i5 = 0, i7 = 0, i8 = 0;
+ i4 = STACKTOP;
+ STACKTOP = STACKTOP + 112 | 0;
+ i2 = i4;
+ i5 = i4 + 12 | 0;
+ if ((_lua_getstack(i1, 0, i5) | 0) == 0) {
+ HEAP32[i2 >> 2] = i6;
+ HEAP32[i2 + 4 >> 2] = i3;
+ i8 = _luaL_error(i1, 1040, i2) | 0;
+ STACKTOP = i4;
+ return i8 | 0;
+ }
+ _lua_getinfo(i1, 1064, i5) | 0;
+ if ((_strcmp(HEAP32[i5 + 8 >> 2] | 0, 1072) | 0) == 0) {
+ i6 = i6 + -1 | 0;
+ if ((i6 | 0) == 0) {
+ HEAP32[i2 >> 2] = HEAP32[i5 + 4 >> 2];
+ HEAP32[i2 + 4 >> 2] = i3;
+ i8 = _luaL_error(i1, 1080, i2) | 0;
+ STACKTOP = i4;
+ return i8 | 0;
+ }
+ }
+ i7 = i5 + 4 | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ if ((i8 | 0) == 0) {
+ if ((_pushglobalfuncname(i1, i5) | 0) == 0) {
+ i8 = 1112;
+ } else {
+ i8 = _lua_tolstring(i1, -1, 0) | 0;
+ }
+ HEAP32[i7 >> 2] = i8;
+ }
+ HEAP32[i2 >> 2] = i6;
+ HEAP32[i2 + 4 >> 2] = i8;
+ HEAP32[i2 + 8 >> 2] = i3;
+ i8 = _luaL_error(i1, 1120, i2) | 0;
+ STACKTOP = i4;
+ return i8 | 0;
+}
+function _match_class(i3, i2) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ var i1 = 0;
+ i1 = STACKTOP;
+ switch (_tolower(i2 | 0) | 0) {
+ case 117:
+ {
+ i3 = _isupper(i3 | 0) | 0;
+ break;
+ }
+ case 97:
+ {
+ i3 = _isalpha(i3 | 0) | 0;
+ break;
+ }
+ case 99:
+ {
+ i3 = _iscntrl(i3 | 0) | 0;
+ break;
+ }
+ case 120:
+ {
+ i3 = _isxdigit(i3 | 0) | 0;
+ break;
+ }
+ case 119:
+ {
+ i3 = _isalnum(i3 | 0) | 0;
+ break;
+ }
+ case 112:
+ {
+ i3 = _ispunct(i3 | 0) | 0;
+ break;
+ }
+ case 100:
+ {
+ i3 = (i3 + -48 | 0) >>> 0 < 10 | 0;
+ break;
+ }
+ case 108:
+ {
+ i3 = _islower(i3 | 0) | 0;
+ break;
+ }
+ case 122:
+ {
+ i3 = (i3 | 0) == 0 | 0;
+ break;
+ }
+ case 103:
+ {
+ i3 = _isgraph(i3 | 0) | 0;
+ break;
+ }
+ case 115:
+ {
+ i3 = _isspace(i3 | 0) | 0;
+ break;
+ }
+ default:
+ {
+ i3 = (i2 | 0) == (i3 | 0) | 0;
+ STACKTOP = i1;
+ return i3 | 0;
+ }
+ }
+ if ((_islower(i2 | 0) | 0) != 0) {
+ STACKTOP = i1;
+ return i3 | 0;
+ }
+ i3 = (i3 | 0) == 0 | 0;
+ STACKTOP = i1;
+ return i3 | 0;
+}
+function _condjump(i1, i3, i6, i4, i5) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i6 = i6 | 0;
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i7 = 0, i8 = 0, i9 = 0;
+ i2 = STACKTOP;
+ _luaK_code(i1, i6 << 6 | i3 | i4 << 23 | i5 << 14) | 0;
+ i3 = i1 + 28 | 0;
+ i6 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i3 >> 2] = -1;
+ i3 = _luaK_code(i1, 2147450903) | 0;
+ if ((i6 | 0) == -1) {
+ i9 = i3;
+ STACKTOP = i2;
+ return i9 | 0;
+ }
+ if ((i3 | 0) == -1) {
+ i9 = i6;
+ STACKTOP = i2;
+ return i9 | 0;
+ }
+ i8 = HEAP32[(HEAP32[i1 >> 2] | 0) + 12 >> 2] | 0;
+ i7 = i3;
+ while (1) {
+ i4 = i8 + (i7 << 2) | 0;
+ i5 = HEAP32[i4 >> 2] | 0;
+ i9 = (i5 >>> 14) + -131071 | 0;
+ if ((i9 | 0) == -1) {
+ break;
+ }
+ i9 = i7 + 1 + i9 | 0;
+ if ((i9 | 0) == -1) {
+ break;
+ } else {
+ i7 = i9;
+ }
+ }
+ i6 = i6 + ~i7 | 0;
+ if ((((i6 | 0) > -1 ? i6 : 0 - i6 | 0) | 0) > 131071) {
+ _luaX_syntaxerror(HEAP32[i1 + 12 >> 2] | 0, 10624);
+ }
+ HEAP32[i4 >> 2] = (i6 << 14) + 2147467264 | i5 & 16383;
+ i9 = i3;
+ STACKTOP = i2;
+ return i9 | 0;
+}
+function _skipcomment(i6, i1) {
+ i6 = i6 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i7 = 0, i8 = 0;
+ i2 = STACKTOP;
+ HEAP32[i6 >> 2] = 0;
+ i3 = i6 + 4 | 0;
+ i5 = 1712;
+ while (1) {
+ i7 = _fgetc(HEAP32[i3 >> 2] | 0) | 0;
+ if ((i7 | 0) == -1) {
+ i4 = 3;
+ break;
+ }
+ i8 = i5 + 1 | 0;
+ if ((i7 | 0) != (HEAPU8[i5] | 0)) {
+ break;
+ }
+ i5 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i6 >> 2] = i5 + 1;
+ HEAP8[i6 + i5 + 8 | 0] = i7;
+ if ((HEAP8[i8] | 0) == 0) {
+ i4 = 6;
+ break;
+ } else {
+ i5 = i8;
+ }
+ }
+ if ((i4 | 0) == 3) {
+ HEAP32[i1 >> 2] = -1;
+ i8 = 0;
+ STACKTOP = i2;
+ return i8 | 0;
+ } else if ((i4 | 0) == 6) {
+ HEAP32[i6 >> 2] = 0;
+ i7 = _fgetc(HEAP32[i3 >> 2] | 0) | 0;
+ }
+ HEAP32[i1 >> 2] = i7;
+ if ((i7 | 0) != 35) {
+ i8 = 0;
+ STACKTOP = i2;
+ return i8 | 0;
+ }
+ do {
+ i8 = _fgetc(HEAP32[i3 >> 2] | 0) | 0;
+ } while (!((i8 | 0) == 10 | (i8 | 0) == -1));
+ HEAP32[i1 >> 2] = _fgetc(HEAP32[i3 >> 2] | 0) | 0;
+ i8 = 1;
+ STACKTOP = i2;
+ return i8 | 0;
+}
+function _lua_isnumber(i4, i6) {
+ i4 = i4 | 0;
+ i6 = i6 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i5 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i2 = i1;
+ i5 = HEAP32[i4 + 16 >> 2] | 0;
+ do {
+ if ((i6 | 0) <= 0) {
+ if (!((i6 | 0) < -1000999)) {
+ i3 = (HEAP32[i4 + 8 >> 2] | 0) + (i6 << 4) | 0;
+ break;
+ }
+ if ((i6 | 0) == -1001e3) {
+ i3 = (HEAP32[i4 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i4 = -1001e3 - i6 | 0;
+ i5 = HEAP32[i5 >> 2] | 0;
+ if ((HEAP32[i5 + 8 >> 2] | 0) != 22 ? (i3 = HEAP32[i5 >> 2] | 0, (i4 | 0) <= (HEAPU8[i3 + 6 | 0] | 0 | 0)) : 0) {
+ i3 = i3 + (i4 + -1 << 4) + 16 | 0;
+ } else {
+ i3 = 5192;
+ }
+ } else {
+ i3 = (HEAP32[i5 >> 2] | 0) + (i6 << 4) | 0;
+ i3 = i3 >>> 0 < (HEAP32[i4 + 8 >> 2] | 0) >>> 0 ? i3 : 5192;
+ }
+ } while (0);
+ if ((HEAP32[i3 + 8 >> 2] | 0) == 3) {
+ i6 = 1;
+ i6 = i6 & 1;
+ STACKTOP = i1;
+ return i6 | 0;
+ }
+ i6 = (_luaV_tonumber(i3, i2) | 0) != 0;
+ i6 = i6 & 1;
+ STACKTOP = i1;
+ return i6 | 0;
+}
+function ___shgetc(i3) {
+ i3 = i3 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0;
+ i2 = STACKTOP;
+ i7 = i3 + 104 | 0;
+ i6 = HEAP32[i7 >> 2] | 0;
+ if (!((i6 | 0) != 0 ? (HEAP32[i3 + 108 >> 2] | 0) >= (i6 | 0) : 0)) {
+ i8 = 3;
+ }
+ if ((i8 | 0) == 3 ? (i1 = ___uflow(i3) | 0, (i1 | 0) >= 0) : 0) {
+ i7 = HEAP32[i7 >> 2] | 0;
+ i6 = HEAP32[i3 + 8 >> 2] | 0;
+ if ((i7 | 0) != 0 ? (i4 = HEAP32[i3 + 4 >> 2] | 0, i5 = i7 - (HEAP32[i3 + 108 >> 2] | 0) + -1 | 0, (i6 - i4 | 0) > (i5 | 0)) : 0) {
+ HEAP32[i3 + 100 >> 2] = i4 + i5;
+ } else {
+ HEAP32[i3 + 100 >> 2] = i6;
+ }
+ i4 = HEAP32[i3 + 4 >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ i8 = i3 + 108 | 0;
+ HEAP32[i8 >> 2] = i6 + 1 - i4 + (HEAP32[i8 >> 2] | 0);
+ }
+ i3 = i4 + -1 | 0;
+ if ((HEAPU8[i3] | 0 | 0) == (i1 | 0)) {
+ i8 = i1;
+ STACKTOP = i2;
+ return i8 | 0;
+ }
+ HEAP8[i3] = i1;
+ i8 = i1;
+ STACKTOP = i2;
+ return i8 | 0;
+ }
+ HEAP32[i3 + 100 >> 2] = 0;
+ i8 = -1;
+ STACKTOP = i2;
+ return i8 | 0;
+}
+function _lua_type(i2, i4) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i3 = 0;
+ i1 = STACKTOP;
+ i3 = HEAP32[i2 + 16 >> 2] | 0;
+ do {
+ if ((i4 | 0) <= 0) {
+ if (!((i4 | 0) < -1000999)) {
+ i2 = (HEAP32[i2 + 8 >> 2] | 0) + (i4 << 4) | 0;
+ break;
+ }
+ if ((i4 | 0) == -1001e3) {
+ i2 = (HEAP32[i2 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i2 = -1001e3 - i4 | 0;
+ i3 = HEAP32[i3 >> 2] | 0;
+ if ((HEAP32[i3 + 8 >> 2] | 0) == 22) {
+ i4 = -1;
+ STACKTOP = i1;
+ return i4 | 0;
+ }
+ i3 = HEAP32[i3 >> 2] | 0;
+ if ((i2 | 0) > (HEAPU8[i3 + 6 | 0] | 0 | 0)) {
+ i4 = -1;
+ STACKTOP = i1;
+ return i4 | 0;
+ } else {
+ i2 = i3 + (i2 + -1 << 4) + 16 | 0;
+ break;
+ }
+ } else {
+ i3 = (HEAP32[i3 >> 2] | 0) + (i4 << 4) | 0;
+ i2 = i3 >>> 0 < (HEAP32[i2 + 8 >> 2] | 0) >>> 0 ? i3 : 5192;
+ }
+ } while (0);
+ if ((i2 | 0) == 5192) {
+ i4 = -1;
+ STACKTOP = i1;
+ return i4 | 0;
+ }
+ i4 = HEAP32[i2 + 8 >> 2] & 15;
+ STACKTOP = i1;
+ return i4 | 0;
+}
+function _g_iofile(i4, i1, i5) {
+ i4 = i4 | 0;
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i6 = 0, i7 = 0, i8 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i2;
+ if ((_lua_type(i4, 1) | 0) < 1) {
+ _lua_getfield(i4, -1001e3, i1);
+ STACKTOP = i2;
+ return;
+ }
+ i6 = _lua_tolstring(i4, 1, 0) | 0;
+ if ((i6 | 0) != 0) {
+ i7 = _lua_newuserdata(i4, 8) | 0;
+ i8 = i7 + 4 | 0;
+ HEAP32[i8 >> 2] = 0;
+ _luaL_setmetatable(i4, 2832);
+ HEAP32[i7 >> 2] = 0;
+ HEAP32[i8 >> 2] = 156;
+ i5 = _fopen(i6 | 0, i5 | 0) | 0;
+ HEAP32[i7 >> 2] = i5;
+ if ((i5 | 0) == 0) {
+ i8 = _strerror(HEAP32[(___errno_location() | 0) >> 2] | 0) | 0;
+ HEAP32[i3 >> 2] = i6;
+ HEAP32[i3 + 4 >> 2] = i8;
+ _luaL_error(i4, 3520, i3) | 0;
+ }
+ } else {
+ if ((HEAP32[(_luaL_checkudata(i4, 1, 2832) | 0) + 4 >> 2] | 0) == 0) {
+ _luaL_error(i4, 3080, i3) | 0;
+ }
+ _lua_pushvalue(i4, 1);
+ }
+ _lua_setfield(i4, -1001e3, i1);
+ _lua_getfield(i4, -1001e3, i1);
+ STACKTOP = i2;
+ return;
+}
+function _lua_getlocal(i4, i5, i2) {
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0, i6 = 0, i7 = 0, i8 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i1;
+ if ((i5 | 0) == 0) {
+ i3 = HEAP32[i4 + 8 >> 2] | 0;
+ if ((HEAP32[i3 + -8 >> 2] | 0) != 70) {
+ i5 = 0;
+ STACKTOP = i1;
+ return i5 | 0;
+ }
+ i5 = _luaF_getlocalname(HEAP32[(HEAP32[i3 + -16 >> 2] | 0) + 12 >> 2] | 0, i2, 0) | 0;
+ STACKTOP = i1;
+ return i5 | 0;
+ } else {
+ HEAP32[i3 >> 2] = 0;
+ i2 = _findlocal(i4, HEAP32[i5 + 96 >> 2] | 0, i2, i3) | 0;
+ if ((i2 | 0) == 0) {
+ i5 = 0;
+ STACKTOP = i1;
+ return i5 | 0;
+ }
+ i3 = HEAP32[i3 >> 2] | 0;
+ i5 = i4 + 8 | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ i8 = i3;
+ i7 = HEAP32[i8 + 4 >> 2] | 0;
+ i6 = i4;
+ HEAP32[i6 >> 2] = HEAP32[i8 >> 2];
+ HEAP32[i6 + 4 >> 2] = i7;
+ HEAP32[i4 + 8 >> 2] = HEAP32[i3 + 8 >> 2];
+ HEAP32[i5 >> 2] = (HEAP32[i5 >> 2] | 0) + 16;
+ i5 = i2;
+ STACKTOP = i1;
+ return i5 | 0;
+ }
+ return 0;
+}
+function _lua_checkstack(i7, i4) {
+ i7 = i7 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i5 = 0, i6 = 0, i8 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i1;
+ HEAP32[i3 >> 2] = i4;
+ i2 = HEAP32[i7 + 16 >> 2] | 0;
+ i5 = i7 + 8 | 0;
+ i6 = HEAP32[i5 >> 2] | 0;
+ i8 = i6;
+ do {
+ if (((HEAP32[i7 + 24 >> 2] | 0) - i8 >> 4 | 0) <= (i4 | 0)) {
+ if (((i8 - (HEAP32[i7 + 28 >> 2] | 0) >> 4) + 5 | 0) > (1e6 - i4 | 0)) {
+ i8 = 0;
+ STACKTOP = i1;
+ return i8 | 0;
+ }
+ i6 = (_luaD_rawrunprotected(i7, 2, i3) | 0) == 0;
+ if (i6) {
+ i5 = HEAP32[i5 >> 2] | 0;
+ i4 = HEAP32[i3 >> 2] | 0;
+ i3 = i6 & 1;
+ break;
+ } else {
+ i8 = 0;
+ STACKTOP = i1;
+ return i8 | 0;
+ }
+ } else {
+ i5 = i6;
+ i3 = 1;
+ }
+ } while (0);
+ i2 = i2 + 4 | 0;
+ i4 = i5 + (i4 << 4) | 0;
+ if (!((HEAP32[i2 >> 2] | 0) >>> 0 < i4 >>> 0)) {
+ i8 = i3;
+ STACKTOP = i1;
+ return i8 | 0;
+ }
+ HEAP32[i2 >> 2] = i4;
+ i8 = i3;
+ STACKTOP = i1;
+ return i8 | 0;
+}
+function _luaK_exp2nextreg(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i2 = STACKTOP;
+ _luaK_dischargevars(i1, i3);
+ if (((HEAP32[i3 >> 2] | 0) == 6 ? (i4 = HEAP32[i3 + 8 >> 2] | 0, (i4 & 256 | 0) == 0) : 0) ? (HEAPU8[i1 + 46 | 0] | 0 | 0) <= (i4 | 0) : 0) {
+ i7 = i1 + 48 | 0;
+ HEAP8[i7] = (HEAP8[i7] | 0) + -1 << 24 >> 24;
+ }
+ i4 = i1 + 48 | 0;
+ i5 = HEAP8[i4] | 0;
+ i6 = (i5 & 255) + 1 | 0;
+ i7 = (HEAP32[i1 >> 2] | 0) + 78 | 0;
+ if (!(i6 >>> 0 > (HEAPU8[i7] | 0) >>> 0)) {
+ i7 = i5;
+ i7 = i7 & 255;
+ i7 = i7 + 1 | 0;
+ i6 = i7 & 255;
+ HEAP8[i4] = i6;
+ i7 = i7 & 255;
+ i7 = i7 + -1 | 0;
+ _exp2reg(i1, i3, i7);
+ STACKTOP = i2;
+ return;
+ }
+ if (i6 >>> 0 > 249) {
+ _luaX_syntaxerror(HEAP32[i1 + 12 >> 2] | 0, 10536);
+ }
+ HEAP8[i7] = i6;
+ i7 = HEAP8[i4] | 0;
+ i7 = i7 & 255;
+ i7 = i7 + 1 | 0;
+ i6 = i7 & 255;
+ HEAP8[i4] = i6;
+ i7 = i7 & 255;
+ i7 = i7 + -1 | 0;
+ _exp2reg(i1, i3, i7);
+ STACKTOP = i2;
+ return;
+}
+function _lua_next(i2, i4) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i3 = 0, i5 = 0;
+ i1 = STACKTOP;
+ i5 = HEAP32[i2 + 16 >> 2] | 0;
+ do {
+ if ((i4 | 0) <= 0) {
+ if (!((i4 | 0) < -1000999)) {
+ i4 = (HEAP32[i2 + 8 >> 2] | 0) + (i4 << 4) | 0;
+ break;
+ }
+ if ((i4 | 0) == -1001e3) {
+ i4 = (HEAP32[i2 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i4 = -1001e3 - i4 | 0;
+ i5 = HEAP32[i5 >> 2] | 0;
+ if ((HEAP32[i5 + 8 >> 2] | 0) != 22 ? (i3 = HEAP32[i5 >> 2] | 0, (i4 | 0) <= (HEAPU8[i3 + 6 | 0] | 0 | 0)) : 0) {
+ i4 = i3 + (i4 + -1 << 4) + 16 | 0;
+ } else {
+ i4 = 5192;
+ }
+ } else {
+ i3 = (HEAP32[i5 >> 2] | 0) + (i4 << 4) | 0;
+ i4 = i3 >>> 0 < (HEAP32[i2 + 8 >> 2] | 0) >>> 0 ? i3 : 5192;
+ }
+ } while (0);
+ i3 = i2 + 8 | 0;
+ i2 = _luaH_next(i2, HEAP32[i4 >> 2] | 0, (HEAP32[i3 >> 2] | 0) + -16 | 0) | 0;
+ i4 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i3 >> 2] = (i2 | 0) == 0 ? i4 + -16 | 0 : i4 + 16 | 0;
+ STACKTOP = i1;
+ return i2 | 0;
+}
+function _inclinenumber(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i2 = STACKTOP;
+ i4 = HEAP32[i1 >> 2] | 0;
+ i3 = i1 + 56 | 0;
+ i5 = HEAP32[i3 >> 2] | 0;
+ i6 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = i6 + -1;
+ if ((i6 | 0) == 0) {
+ i5 = _luaZ_fill(i5) | 0;
+ } else {
+ i6 = i5 + 4 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i6 >> 2] = i5 + 1;
+ i5 = HEAPU8[i5] | 0;
+ }
+ HEAP32[i1 >> 2] = i5;
+ if ((i5 | 0) == 13 | (i5 | 0) == 10 ? (i5 | 0) != (i4 | 0) : 0) {
+ i3 = HEAP32[i3 >> 2] | 0;
+ i6 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i3 >> 2] = i6 + -1;
+ if ((i6 | 0) == 0) {
+ i3 = _luaZ_fill(i3) | 0;
+ } else {
+ i6 = i3 + 4 | 0;
+ i3 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i6 >> 2] = i3 + 1;
+ i3 = HEAPU8[i3] | 0;
+ }
+ HEAP32[i1 >> 2] = i3;
+ }
+ i5 = i1 + 4 | 0;
+ i6 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = i6 + 1;
+ if ((i6 | 0) > 2147483643) {
+ _luaX_syntaxerror(i1, 12560);
+ } else {
+ STACKTOP = i2;
+ return;
+ }
+}
+function _lua_yieldk(i5, i6, i1, i7) {
+ i5 = i5 | 0;
+ i6 = i6 | 0;
+ i1 = i1 | 0;
+ i7 = i7 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i2;
+ i3 = HEAP32[i5 + 16 >> 2] | 0;
+ if ((HEAP16[i5 + 36 >> 1] | 0) != 0) {
+ if ((HEAP32[(HEAP32[i5 + 12 >> 2] | 0) + 172 >> 2] | 0) == (i5 | 0)) {
+ _luaG_runerror(i5, 2312, i4);
+ } else {
+ _luaG_runerror(i5, 2264, i4);
+ }
+ }
+ HEAP8[i5 + 6 | 0] = 1;
+ HEAP32[i3 + 20 >> 2] = (HEAP32[i3 >> 2] | 0) - (HEAP32[i5 + 28 >> 2] | 0);
+ if (!((HEAP8[i3 + 18 | 0] & 1) == 0)) {
+ STACKTOP = i2;
+ return 0;
+ }
+ HEAP32[i3 + 28 >> 2] = i7;
+ if ((i7 | 0) == 0) {
+ i4 = i5 + 8 | 0;
+ i4 = HEAP32[i4 >> 2] | 0;
+ i7 = ~i6;
+ i7 = i4 + (i7 << 4) | 0;
+ HEAP32[i3 >> 2] = i7;
+ _luaD_throw(i5, 1);
+ }
+ HEAP32[i3 + 24 >> 2] = i1;
+ i4 = i5 + 8 | 0;
+ i4 = HEAP32[i4 >> 2] | 0;
+ i7 = ~i6;
+ i7 = i4 + (i7 << 4) | 0;
+ HEAP32[i3 >> 2] = i7;
+ _luaD_throw(i5, 1);
+ return 0;
+}
+function _luaH_getint(i4, i6) {
+ i4 = i4 | 0;
+ i6 = i6 | 0;
+ var i1 = 0, i2 = 0, d3 = 0.0, i5 = 0, i7 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i5 = i1;
+ i7 = i6 + -1 | 0;
+ if (i7 >>> 0 < (HEAP32[i4 + 28 >> 2] | 0) >>> 0) {
+ i7 = (HEAP32[i4 + 12 >> 2] | 0) + (i7 << 4) | 0;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ d3 = +(i6 | 0);
+ HEAPF64[i5 >> 3] = d3 + 1.0;
+ i5 = (HEAP32[i5 + 4 >> 2] | 0) + (HEAP32[i5 >> 2] | 0) | 0;
+ if ((i5 | 0) < 0) {
+ i6 = 0 - i5 | 0;
+ i5 = (i5 | 0) == (i6 | 0) ? 0 : i6;
+ }
+ i4 = (HEAP32[i4 + 16 >> 2] | 0) + (((i5 | 0) % ((1 << (HEAPU8[i4 + 7 | 0] | 0)) + -1 | 1 | 0) | 0) << 5) | 0;
+ while (1) {
+ if ((HEAP32[i4 + 24 >> 2] | 0) == 3 ? +HEAPF64[i4 + 16 >> 3] == d3 : 0) {
+ break;
+ }
+ i4 = HEAP32[i4 + 28 >> 2] | 0;
+ if ((i4 | 0) == 0) {
+ i4 = 5192;
+ i2 = 10;
+ break;
+ }
+ }
+ if ((i2 | 0) == 10) {
+ STACKTOP = i1;
+ return i4 | 0;
+ }
+ i7 = i4;
+ STACKTOP = i1;
+ return i7 | 0;
+}
+function _luaL_checkversion_(i1, d4) {
+ i1 = i1 | 0;
+ d4 = +d4;
+ var i2 = 0, i3 = 0, i5 = 0, d6 = 0.0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i2;
+ i5 = _lua_version(i1) | 0;
+ if ((i5 | 0) == (_lua_version(0) | 0)) {
+ d6 = +HEAPF64[i5 >> 3];
+ if (d6 != d4) {
+ HEAPF64[tempDoublePtr >> 3] = d4;
+ HEAP32[i3 >> 2] = HEAP32[tempDoublePtr >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[tempDoublePtr + 4 >> 2];
+ i5 = i3 + 8 | 0;
+ HEAPF64[tempDoublePtr >> 3] = d6;
+ HEAP32[i5 >> 2] = HEAP32[tempDoublePtr >> 2];
+ HEAP32[i5 + 4 >> 2] = HEAP32[tempDoublePtr + 4 >> 2];
+ _luaL_error(i1, 1528, i3) | 0;
+ }
+ } else {
+ _luaL_error(i1, 1496, i3) | 0;
+ }
+ _lua_pushnumber(i1, -4660.0);
+ if ((_lua_tointegerx(i1, -1, 0) | 0) == -4660 ? (_lua_tounsignedx(i1, -1, 0) | 0) == -4660 : 0) {
+ _lua_settop(i1, -2);
+ STACKTOP = i2;
+ return;
+ }
+ _luaL_error(i1, 1584, i3) | 0;
+ _lua_settop(i1, -2);
+ STACKTOP = i2;
+ return;
+}
+function _math_random(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, d3 = 0.0, i4 = 0, i5 = 0, d6 = 0.0, d7 = 0.0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i2;
+ d3 = +((_rand() | 0) % 2147483647 | 0 | 0) / 2147483647.0;
+ i5 = _lua_gettop(i1) | 0;
+ if ((i5 | 0) == 0) {
+ _lua_pushnumber(i1, d3);
+ i5 = 1;
+ STACKTOP = i2;
+ return i5 | 0;
+ } else if ((i5 | 0) == 1) {
+ d6 = +_luaL_checknumber(i1, 1);
+ if (!(d6 >= 1.0)) {
+ _luaL_argerror(i1, 1, 4056) | 0;
+ }
+ _lua_pushnumber(i1, +Math_floor(+(d3 * d6)) + 1.0);
+ i5 = 1;
+ STACKTOP = i2;
+ return i5 | 0;
+ } else if ((i5 | 0) == 2) {
+ d6 = +_luaL_checknumber(i1, 1);
+ d7 = +_luaL_checknumber(i1, 2);
+ if (!(d6 <= d7)) {
+ _luaL_argerror(i1, 2, 4056) | 0;
+ }
+ _lua_pushnumber(i1, d6 + +Math_floor(+(d3 * (d7 - d6 + 1.0))));
+ i5 = 1;
+ STACKTOP = i2;
+ return i5 | 0;
+ } else {
+ i5 = _luaL_error(i1, 4080, i4) | 0;
+ STACKTOP = i2;
+ return i5 | 0;
+ }
+ return 0;
+}
+function _push_onecapture(i2, i3, i4, i6) {
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ i6 = i6 | 0;
+ var i1 = 0, i5 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i5 = i1;
+ if ((HEAP32[i2 + 20 >> 2] | 0) <= (i3 | 0)) {
+ i2 = HEAP32[i2 + 16 >> 2] | 0;
+ if ((i3 | 0) == 0) {
+ _lua_pushlstring(i2, i4, i6 - i4 | 0) | 0;
+ STACKTOP = i1;
+ return;
+ } else {
+ _luaL_error(i2, 7224, i5) | 0;
+ STACKTOP = i1;
+ return;
+ }
+ }
+ i4 = HEAP32[i2 + (i3 << 3) + 28 >> 2] | 0;
+ if (!((i4 | 0) == -1)) {
+ i5 = HEAP32[i2 + 16 >> 2] | 0;
+ i3 = HEAP32[i2 + (i3 << 3) + 24 >> 2] | 0;
+ if ((i4 | 0) == -2) {
+ _lua_pushinteger(i5, i3 + 1 - (HEAP32[i2 + 4 >> 2] | 0) | 0);
+ STACKTOP = i1;
+ return;
+ }
+ } else {
+ i6 = i2 + 16 | 0;
+ _luaL_error(HEAP32[i6 >> 2] | 0, 7248, i5) | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ i3 = HEAP32[i2 + (i3 << 3) + 24 >> 2] | 0;
+ }
+ _lua_pushlstring(i5, i3, i4) | 0;
+ STACKTOP = i1;
+ return;
+}
+function _luaK_nil(i7, i6, i5) {
+ i7 = i7 | 0;
+ i6 = i6 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0;
+ i2 = STACKTOP;
+ i9 = i5 + i6 | 0;
+ i1 = i9 + -1 | 0;
+ i10 = HEAP32[i7 + 20 >> 2] | 0;
+ do {
+ if ((i10 | 0) > (HEAP32[i7 + 24 >> 2] | 0) ? (i4 = (HEAP32[(HEAP32[i7 >> 2] | 0) + 12 >> 2] | 0) + (i10 + -1 << 2) | 0, i3 = HEAP32[i4 >> 2] | 0, (i3 & 63 | 0) == 4) : 0) {
+ i11 = i3 >>> 6 & 255;
+ i10 = i11 + (i3 >>> 23) | 0;
+ if (!((i11 | 0) <= (i6 | 0) ? (i10 + 1 | 0) >= (i6 | 0) : 0)) {
+ i8 = 5;
+ }
+ if ((i8 | 0) == 5 ? (i11 | 0) < (i6 | 0) | (i11 | 0) > (i9 | 0) : 0) {
+ break;
+ }
+ i5 = (i11 | 0) < (i6 | 0) ? i11 : i6;
+ HEAP32[i4 >> 2] = ((i10 | 0) > (i1 | 0) ? i10 : i1) - i5 << 23 | i5 << 6 & 16320 | i3 & 8372287;
+ STACKTOP = i2;
+ return;
+ }
+ } while (0);
+ _luaK_code(i7, i6 << 6 | (i5 << 23) + -8388608 | 4) | 0;
+ STACKTOP = i2;
+ return;
+}
+function _lua_settable(i1, i5) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ i4 = HEAP32[i1 + 16 >> 2] | 0;
+ do {
+ if ((i5 | 0) <= 0) {
+ if (!((i5 | 0) < -1000999)) {
+ i3 = (HEAP32[i1 + 8 >> 2] | 0) + (i5 << 4) | 0;
+ break;
+ }
+ if ((i5 | 0) == -1001e3) {
+ i3 = (HEAP32[i1 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i5 = -1001e3 - i5 | 0;
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP32[i4 + 8 >> 2] | 0) != 22 ? (i3 = HEAP32[i4 >> 2] | 0, (i5 | 0) <= (HEAPU8[i3 + 6 | 0] | 0 | 0)) : 0) {
+ i3 = i3 + (i5 + -1 << 4) + 16 | 0;
+ } else {
+ i3 = 5192;
+ }
+ } else {
+ i3 = (HEAP32[i4 >> 2] | 0) + (i5 << 4) | 0;
+ i3 = i3 >>> 0 < (HEAP32[i1 + 8 >> 2] | 0) >>> 0 ? i3 : 5192;
+ }
+ } while (0);
+ i5 = i1 + 8 | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ _luaV_settable(i1, i3, i4 + -32 | 0, i4 + -16 | 0);
+ HEAP32[i5 >> 2] = (HEAP32[i5 >> 2] | 0) + -32;
+ STACKTOP = i2;
+ return;
+}
+function _luaL_findtable(i3, i6, i5, i4) {
+ i3 = i3 | 0;
+ i6 = i6 | 0;
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i2 = 0, i7 = 0;
+ i2 = STACKTOP;
+ if ((i6 | 0) != 0) {
+ _lua_pushvalue(i3, i6);
+ }
+ while (1) {
+ i6 = _strchr(i5, 46) | 0;
+ if ((i6 | 0) == 0) {
+ i6 = i5 + (_strlen(i5 | 0) | 0) | 0;
+ }
+ i7 = i6 - i5 | 0;
+ _lua_pushlstring(i3, i5, i7) | 0;
+ _lua_rawget(i3, -2);
+ if ((_lua_type(i3, -1) | 0) != 0) {
+ if ((_lua_type(i3, -1) | 0) != 5) {
+ break;
+ }
+ } else {
+ _lua_settop(i3, -2);
+ _lua_createtable(i3, 0, (HEAP8[i6] | 0) == 46 ? 1 : i4);
+ _lua_pushlstring(i3, i5, i7) | 0;
+ _lua_pushvalue(i3, -2);
+ _lua_settable(i3, -4);
+ }
+ _lua_remove(i3, -2);
+ if ((HEAP8[i6] | 0) == 46) {
+ i5 = i6 + 1 | 0;
+ } else {
+ i3 = 0;
+ i1 = 10;
+ break;
+ }
+ }
+ if ((i1 | 0) == 10) {
+ STACKTOP = i2;
+ return i3 | 0;
+ }
+ _lua_settop(i3, -3);
+ i7 = i5;
+ STACKTOP = i2;
+ return i7 | 0;
+}
+function _luaD_call(i1, i4, i5, i8) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ i8 = i8 | 0;
+ var i2 = 0, i3 = 0, i6 = 0, i7 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i7 = i3;
+ i2 = i1 + 38 | 0;
+ i6 = (HEAP16[i2 >> 1] | 0) + 1 << 16 >> 16;
+ HEAP16[i2 >> 1] = i6;
+ if ((i6 & 65535) > 199) {
+ if (i6 << 16 >> 16 == 200) {
+ _luaG_runerror(i1, 2240, i7);
+ }
+ if ((i6 & 65535) > 224) {
+ _luaD_throw(i1, 6);
+ }
+ }
+ i6 = (i8 | 0) != 0;
+ if (!i6) {
+ i8 = i1 + 36 | 0;
+ HEAP16[i8 >> 1] = (HEAP16[i8 >> 1] | 0) + 1 << 16 >> 16;
+ }
+ if ((_luaD_precall(i1, i4, i5) | 0) == 0) {
+ _luaV_execute(i1);
+ }
+ if (i6) {
+ i8 = HEAP16[i2 >> 1] | 0;
+ i8 = i8 + -1 << 16 >> 16;
+ HEAP16[i2 >> 1] = i8;
+ STACKTOP = i3;
+ return;
+ }
+ i8 = i1 + 36 | 0;
+ HEAP16[i8 >> 1] = (HEAP16[i8 >> 1] | 0) + -1 << 16 >> 16;
+ i8 = HEAP16[i2 >> 1] | 0;
+ i8 = i8 + -1 << 16 >> 16;
+ HEAP16[i2 >> 1] = i8;
+ STACKTOP = i3;
+ return;
+}
+function _pushline(i6, i1) {
+ i6 = i6 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i7 = 0, i8 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 528 | 0;
+ i4 = i2;
+ i3 = i2 + 8 | 0;
+ i7 = (i1 | 0) != 0;
+ _lua_getglobal(i6, i7 ? 288 : 296);
+ i8 = _lua_tolstring(i6, -1, 0) | 0;
+ if ((i8 | 0) == 0) {
+ i8 = i7 ? 312 : 320;
+ }
+ i7 = HEAP32[_stdout >> 2] | 0;
+ _fputs(i8 | 0, i7 | 0) | 0;
+ _fflush(i7 | 0) | 0;
+ i8 = (_fgets(i3 | 0, 512, HEAP32[_stdin >> 2] | 0) | 0) == 0;
+ _lua_settop(i6, -2);
+ if (i8) {
+ i8 = 0;
+ STACKTOP = i2;
+ return i8 | 0;
+ }
+ i7 = _strlen(i3 | 0) | 0;
+ if ((i7 | 0) != 0 ? (i5 = i3 + (i7 + -1) | 0, (HEAP8[i5] | 0) == 10) : 0) {
+ HEAP8[i5] = 0;
+ }
+ if ((i1 | 0) != 0 ? (HEAP8[i3] | 0) == 61 : 0) {
+ HEAP32[i4 >> 2] = i3 + 1;
+ _lua_pushfstring(i6, 272, i4) | 0;
+ i8 = 1;
+ STACKTOP = i2;
+ return i8 | 0;
+ }
+ _lua_pushstring(i6, i3) | 0;
+ i8 = 1;
+ STACKTOP = i2;
+ return i8 | 0;
+}
+function _db_getlocal(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 112 | 0;
+ i4 = i2;
+ if ((_lua_type(i1, 1) | 0) == 8) {
+ i3 = _lua_tothread(i1, 1) | 0;
+ i6 = 1;
+ } else {
+ i3 = i1;
+ i6 = 0;
+ }
+ i5 = _luaL_checkinteger(i1, i6 | 2) | 0;
+ i6 = i6 + 1 | 0;
+ if ((_lua_type(i1, i6) | 0) == 6) {
+ _lua_pushvalue(i1, i6);
+ _lua_pushstring(i1, _lua_getlocal(i1, 0, i5) | 0) | 0;
+ i6 = 1;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ if ((_lua_getstack(i3, _luaL_checkinteger(i1, i6) | 0, i4) | 0) == 0) {
+ i6 = _luaL_argerror(i1, i6, 11560) | 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ i4 = _lua_getlocal(i3, i4, i5) | 0;
+ if ((i4 | 0) == 0) {
+ _lua_pushnil(i1);
+ i6 = 1;
+ STACKTOP = i2;
+ return i6 | 0;
+ } else {
+ _lua_xmove(i3, i1, 1);
+ _lua_pushstring(i1, i4) | 0;
+ _lua_pushvalue(i1, -2);
+ i6 = 2;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ return 0;
+}
+function _luaB_print(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i2 = i3;
+ i4 = i3 + 4 | 0;
+ i6 = _lua_gettop(i1) | 0;
+ _lua_getglobal(i1, 9584);
+ i5 = HEAP32[_stdout >> 2] | 0;
+ L1 : do {
+ if ((i6 | 0) >= 1) {
+ i7 = 1;
+ while (1) {
+ _lua_pushvalue(i1, -1);
+ _lua_pushvalue(i1, i7);
+ _lua_callk(i1, 1, 1, 0, 0);
+ i8 = _lua_tolstring(i1, -1, i4) | 0;
+ if ((i8 | 0) == 0) {
+ break;
+ }
+ if ((i7 | 0) > 1) {
+ _fputc(9, i5 | 0) | 0;
+ }
+ _fwrite(i8 | 0, 1, HEAP32[i4 >> 2] | 0, i5 | 0) | 0;
+ _lua_settop(i1, -2);
+ if ((i7 | 0) < (i6 | 0)) {
+ i7 = i7 + 1 | 0;
+ } else {
+ break L1;
+ }
+ }
+ i8 = _luaL_error(i1, 9816, i2) | 0;
+ STACKTOP = i3;
+ return i8 | 0;
+ }
+ } while (0);
+ _fputc(10, i5 | 0) | 0;
+ _fflush(i5 | 0) | 0;
+ i8 = 0;
+ STACKTOP = i3;
+ return i8 | 0;
+}
+function _luaB_load(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i5 = i2;
+ i6 = _lua_tolstring(i1, 1, i5) | 0;
+ i4 = _luaL_optlstring(i1, 3, 9872, 0) | 0;
+ i3 = (_lua_type(i1, 4) | 0) != -1;
+ if ((i6 | 0) == 0) {
+ i6 = _luaL_optlstring(i1, 2, 9880, 0) | 0;
+ _luaL_checktype(i1, 1, 6);
+ _lua_settop(i1, 5);
+ i4 = _lua_load(i1, 3, 0, i6, i4) | 0;
+ } else {
+ i7 = _luaL_optlstring(i1, 2, i6, 0) | 0;
+ i4 = _luaL_loadbufferx(i1, i6, HEAP32[i5 >> 2] | 0, i7, i4) | 0;
+ }
+ if ((i4 | 0) != 0) {
+ _lua_pushnil(i1);
+ _lua_insert(i1, -2);
+ i7 = 2;
+ STACKTOP = i2;
+ return i7 | 0;
+ }
+ if (!i3) {
+ i7 = 1;
+ STACKTOP = i2;
+ return i7 | 0;
+ }
+ _lua_pushvalue(i1, i3 ? 4 : 0);
+ if ((_lua_setupvalue(i1, -2, 1) | 0) != 0) {
+ i7 = 1;
+ STACKTOP = i2;
+ return i7 | 0;
+ }
+ _lua_settop(i1, -2);
+ i7 = 1;
+ STACKTOP = i2;
+ return i7 | 0;
+}
+function _db_debug(i2) {
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 256 | 0;
+ i6 = i1;
+ i4 = i1 + 4 | 0;
+ i3 = HEAP32[_stderr >> 2] | 0;
+ _fwrite(12040, 11, 1, i3 | 0) | 0;
+ _fflush(i3 | 0) | 0;
+ i5 = HEAP32[_stdin >> 2] | 0;
+ if ((_fgets(i4 | 0, 250, i5 | 0) | 0) == 0) {
+ STACKTOP = i1;
+ return 0;
+ }
+ while (1) {
+ if ((_strcmp(i4, 12056) | 0) == 0) {
+ i2 = 7;
+ break;
+ }
+ if (!((_luaL_loadbufferx(i2, i4, _strlen(i4 | 0) | 0, 12064, 0) | 0) == 0 ? (_lua_pcallk(i2, 0, 0, 0, 0, 0) | 0) == 0 : 0)) {
+ HEAP32[i6 >> 2] = _lua_tolstring(i2, -1, 0) | 0;
+ _fprintf(i3 | 0, 12088, i6 | 0) | 0;
+ _fflush(i3 | 0) | 0;
+ }
+ _lua_settop(i2, 0);
+ _fwrite(12040, 11, 1, i3 | 0) | 0;
+ _fflush(i3 | 0) | 0;
+ if ((_fgets(i4 | 0, 250, i5 | 0) | 0) == 0) {
+ i2 = 7;
+ break;
+ }
+ }
+ if ((i2 | 0) == 7) {
+ STACKTOP = i1;
+ return 0;
+ }
+ return 0;
+}
+function _luaL_prepbuffsize(i2, i7) {
+ i2 = i2 | 0;
+ i7 = i7 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i8 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i1 = HEAP32[i2 + 12 >> 2] | 0;
+ i4 = i2 + 4 | 0;
+ i8 = HEAP32[i4 >> 2] | 0;
+ i5 = i2 + 8 | 0;
+ i6 = HEAP32[i5 >> 2] | 0;
+ if (!((i8 - i6 | 0) >>> 0 < i7 >>> 0)) {
+ i7 = HEAP32[i2 >> 2] | 0;
+ i8 = i6;
+ i8 = i7 + i8 | 0;
+ STACKTOP = i3;
+ return i8 | 0;
+ }
+ i8 = i8 << 1;
+ i8 = (i8 - i6 | 0) >>> 0 < i7 >>> 0 ? i6 + i7 | 0 : i8;
+ if (i8 >>> 0 < i6 >>> 0 | (i8 - i6 | 0) >>> 0 < i7 >>> 0) {
+ _luaL_error(i1, 1272, i3) | 0;
+ }
+ i6 = _lua_newuserdata(i1, i8) | 0;
+ _memcpy(i6 | 0, HEAP32[i2 >> 2] | 0, HEAP32[i5 >> 2] | 0) | 0;
+ if ((HEAP32[i2 >> 2] | 0) != (i2 + 16 | 0)) {
+ _lua_remove(i1, -2);
+ }
+ HEAP32[i2 >> 2] = i6;
+ HEAP32[i4 >> 2] = i8;
+ i7 = i6;
+ i8 = HEAP32[i5 >> 2] | 0;
+ i8 = i7 + i8 | 0;
+ STACKTOP = i3;
+ return i8 | 0;
+}
+function _luaG_runerror(i1, i5, i4) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ var i2 = 0, i3 = 0, i6 = 0, i7 = 0;
+ i6 = STACKTOP;
+ STACKTOP = STACKTOP + 96 | 0;
+ i2 = i6;
+ i3 = i6 + 32 | 0;
+ i6 = i6 + 16 | 0;
+ HEAP32[i6 >> 2] = i4;
+ i4 = _luaO_pushvfstring(i1, i5, i6) | 0;
+ i6 = HEAP32[i1 + 16 >> 2] | 0;
+ if ((HEAP8[i6 + 18 | 0] & 1) == 0) {
+ _luaG_errormsg(i1);
+ }
+ i5 = HEAP32[(HEAP32[HEAP32[i6 >> 2] >> 2] | 0) + 12 >> 2] | 0;
+ i7 = HEAP32[i5 + 20 >> 2] | 0;
+ if ((i7 | 0) == 0) {
+ i6 = 0;
+ } else {
+ i6 = HEAP32[i7 + (((HEAP32[i6 + 28 >> 2] | 0) - (HEAP32[i5 + 12 >> 2] | 0) >> 2) + -1 << 2) >> 2] | 0;
+ }
+ i5 = HEAP32[i5 + 36 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ HEAP8[i3] = 63;
+ HEAP8[i3 + 1 | 0] = 0;
+ } else {
+ _luaO_chunkid(i3, i5 + 16 | 0, 60);
+ }
+ HEAP32[i2 >> 2] = i3;
+ HEAP32[i2 + 4 >> 2] = i6;
+ HEAP32[i2 + 8 >> 2] = i4;
+ _luaO_pushfstring(i1, 2024, i2) | 0;
+ _luaG_errormsg(i1);
+}
+function _db_upvaluejoin(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 112 | 0;
+ i4 = i3;
+ i2 = _luaL_checkinteger(i1, 2) | 0;
+ _luaL_checktype(i1, 1, 6);
+ _lua_pushvalue(i1, 1);
+ _lua_getinfo(i1, 11728, i4) | 0;
+ if (!((i2 | 0) > 0 ? (i2 | 0) <= (HEAPU8[i4 + 32 | 0] | 0 | 0) : 0)) {
+ _luaL_argerror(i1, 2, 11736) | 0;
+ }
+ i5 = _luaL_checkinteger(i1, 4) | 0;
+ _luaL_checktype(i1, 3, 6);
+ _lua_pushvalue(i1, 3);
+ _lua_getinfo(i1, 11728, i4) | 0;
+ if (!((i5 | 0) > 0 ? (i5 | 0) <= (HEAPU8[i4 + 32 | 0] | 0 | 0) : 0)) {
+ _luaL_argerror(i1, 4, 11736) | 0;
+ }
+ if ((_lua_iscfunction(i1, 1) | 0) != 0) {
+ _luaL_argerror(i1, 1, 11760) | 0;
+ }
+ if ((_lua_iscfunction(i1, 3) | 0) == 0) {
+ _lua_upvaluejoin(i1, 1, i2, 3, i5);
+ STACKTOP = i3;
+ return 0;
+ }
+ _luaL_argerror(i1, 3, 11760) | 0;
+ _lua_upvaluejoin(i1, 1, i2, 3, i5);
+ STACKTOP = i3;
+ return 0;
+}
+function _luaK_jump(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0;
+ i3 = STACKTOP;
+ i2 = i1 + 28 | 0;
+ i7 = HEAP32[i2 >> 2] | 0;
+ HEAP32[i2 >> 2] = -1;
+ i2 = _luaK_code(i1, 2147450903) | 0;
+ if ((i7 | 0) == -1) {
+ i9 = i2;
+ STACKTOP = i3;
+ return i9 | 0;
+ }
+ if ((i2 | 0) == -1) {
+ i9 = i7;
+ STACKTOP = i3;
+ return i9 | 0;
+ }
+ i6 = HEAP32[(HEAP32[i1 >> 2] | 0) + 12 >> 2] | 0;
+ i8 = i2;
+ while (1) {
+ i5 = i6 + (i8 << 2) | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ i9 = (i4 >>> 14) + -131071 | 0;
+ if ((i9 | 0) == -1) {
+ break;
+ }
+ i9 = i8 + 1 + i9 | 0;
+ if ((i9 | 0) == -1) {
+ break;
+ } else {
+ i8 = i9;
+ }
+ }
+ i6 = i7 + ~i8 | 0;
+ if ((((i6 | 0) > -1 ? i6 : 0 - i6 | 0) | 0) > 131071) {
+ _luaX_syntaxerror(HEAP32[i1 + 12 >> 2] | 0, 10624);
+ }
+ HEAP32[i5 >> 2] = (i6 << 14) + 2147467264 | i4 & 16383;
+ i9 = i2;
+ STACKTOP = i3;
+ return i9 | 0;
+}
+function _findfield(i2, i3, i4) {
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ var i1 = 0;
+ i1 = STACKTOP;
+ L1 : do {
+ if (((i4 | 0) != 0 ? (_lua_type(i2, -1) | 0) == 5 : 0) ? (_lua_pushnil(i2), (_lua_next(i2, -2) | 0) != 0) : 0) {
+ i4 = i4 + -1 | 0;
+ while (1) {
+ if ((_lua_type(i2, -2) | 0) == 4) {
+ if ((_lua_rawequal(i2, i3, -1) | 0) != 0) {
+ i3 = 7;
+ break;
+ }
+ if ((_findfield(i2, i3, i4) | 0) != 0) {
+ i3 = 9;
+ break;
+ }
+ }
+ _lua_settop(i2, -2);
+ if ((_lua_next(i2, -2) | 0) == 0) {
+ i2 = 0;
+ break L1;
+ }
+ }
+ if ((i3 | 0) == 7) {
+ _lua_settop(i2, -2);
+ i2 = 1;
+ break;
+ } else if ((i3 | 0) == 9) {
+ _lua_remove(i2, -2);
+ _lua_pushlstring(i2, 1776, 1) | 0;
+ _lua_insert(i2, -2);
+ _lua_concat(i2, 3);
+ i2 = 1;
+ break;
+ }
+ } else {
+ i2 = 0;
+ }
+ } while (0);
+ STACKTOP = i1;
+ return i2 | 0;
+}
+function _db_gethook(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i2 = i3;
+ if ((_lua_type(i1, 1) | 0) == 8) {
+ i4 = _lua_tothread(i1, 1) | 0;
+ } else {
+ i4 = i1;
+ }
+ i5 = _lua_gethookmask(i4) | 0;
+ i6 = _lua_gethook(i4) | 0;
+ if ((i6 | 0) != 0 & (i6 | 0) != 9) {
+ _lua_pushlstring(i1, 12024, 13) | 0;
+ } else {
+ _luaL_getsubtable(i1, -1001e3, 11584) | 0;
+ _lua_pushthread(i4) | 0;
+ _lua_xmove(i4, i1, 1);
+ _lua_rawget(i1, -2);
+ _lua_remove(i1, -2);
+ }
+ if ((i5 & 1 | 0) == 0) {
+ i6 = 0;
+ } else {
+ HEAP8[i2] = 99;
+ i6 = 1;
+ }
+ if ((i5 & 2 | 0) != 0) {
+ HEAP8[i2 + i6 | 0] = 114;
+ i6 = i6 + 1 | 0;
+ }
+ if ((i5 & 4 | 0) != 0) {
+ HEAP8[i2 + i6 | 0] = 108;
+ i6 = i6 + 1 | 0;
+ }
+ HEAP8[i2 + i6 | 0] = 0;
+ _lua_pushstring(i1, i2) | 0;
+ _lua_pushinteger(i1, _lua_gethookcount(i4) | 0);
+ STACKTOP = i3;
+ return 3;
+}
+function _lua_tothread(i3, i5) {
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i4 = 0;
+ i1 = STACKTOP;
+ i4 = HEAP32[i3 + 16 >> 2] | 0;
+ do {
+ if ((i5 | 0) <= 0) {
+ if (!((i5 | 0) < -1000999)) {
+ i2 = (HEAP32[i3 + 8 >> 2] | 0) + (i5 << 4) | 0;
+ break;
+ }
+ if ((i5 | 0) == -1001e3) {
+ i2 = (HEAP32[i3 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i3 = -1001e3 - i5 | 0;
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP32[i4 + 8 >> 2] | 0) != 22 ? (i2 = HEAP32[i4 >> 2] | 0, (i3 | 0) <= (HEAPU8[i2 + 6 | 0] | 0 | 0)) : 0) {
+ i2 = i2 + (i3 + -1 << 4) + 16 | 0;
+ } else {
+ i2 = 5192;
+ }
+ } else {
+ i2 = (HEAP32[i4 >> 2] | 0) + (i5 << 4) | 0;
+ i2 = i2 >>> 0 < (HEAP32[i3 + 8 >> 2] | 0) >>> 0 ? i2 : 5192;
+ }
+ } while (0);
+ if ((HEAP32[i2 + 8 >> 2] | 0) != 72) {
+ i5 = 0;
+ STACKTOP = i1;
+ return i5 | 0;
+ }
+ i5 = HEAP32[i2 >> 2] | 0;
+ STACKTOP = i1;
+ return i5 | 0;
+}
+function _luaD_throw(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0;
+ i3 = i1 + 64 | 0;
+ i4 = HEAP32[i3 >> 2] | 0;
+ if ((i4 | 0) != 0) {
+ HEAP32[i4 + 160 >> 2] = i2;
+ _longjmp((HEAP32[i3 >> 2] | 0) + 4 | 0, 1);
+ }
+ HEAP8[i1 + 6 | 0] = i2;
+ i4 = i1 + 12 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ i5 = HEAP32[i3 + 172 >> 2] | 0;
+ if ((HEAP32[i5 + 64 >> 2] | 0) != 0) {
+ i6 = HEAP32[i1 + 8 >> 2] | 0;
+ i9 = i5 + 8 | 0;
+ i5 = HEAP32[i9 >> 2] | 0;
+ HEAP32[i9 >> 2] = i5 + 16;
+ i9 = i6 + -16 | 0;
+ i8 = HEAP32[i9 + 4 >> 2] | 0;
+ i7 = i5;
+ HEAP32[i7 >> 2] = HEAP32[i9 >> 2];
+ HEAP32[i7 + 4 >> 2] = i8;
+ HEAP32[i5 + 8 >> 2] = HEAP32[i6 + -8 >> 2];
+ _luaD_throw(HEAP32[(HEAP32[i4 >> 2] | 0) + 172 >> 2] | 0, i2);
+ }
+ i2 = HEAP32[i3 + 168 >> 2] | 0;
+ if ((i2 | 0) == 0) {
+ _abort();
+ }
+ FUNCTION_TABLE_ii[i2 & 255](i1) | 0;
+ _abort();
+}
+function _lua_len(i1, i5) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ i4 = HEAP32[i1 + 16 >> 2] | 0;
+ do {
+ if ((i5 | 0) <= 0) {
+ if (!((i5 | 0) < -1000999)) {
+ i3 = (HEAP32[i1 + 8 >> 2] | 0) + (i5 << 4) | 0;
+ break;
+ }
+ if ((i5 | 0) == -1001e3) {
+ i3 = (HEAP32[i1 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i5 = -1001e3 - i5 | 0;
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP32[i4 + 8 >> 2] | 0) != 22 ? (i3 = HEAP32[i4 >> 2] | 0, (i5 | 0) <= (HEAPU8[i3 + 6 | 0] | 0 | 0)) : 0) {
+ i3 = i3 + (i5 + -1 << 4) + 16 | 0;
+ } else {
+ i3 = 5192;
+ }
+ } else {
+ i3 = (HEAP32[i4 >> 2] | 0) + (i5 << 4) | 0;
+ i3 = i3 >>> 0 < (HEAP32[i1 + 8 >> 2] | 0) >>> 0 ? i3 : 5192;
+ }
+ } while (0);
+ i5 = i1 + 8 | 0;
+ _luaV_objlen(i1, HEAP32[i5 >> 2] | 0, i3);
+ HEAP32[i5 >> 2] = (HEAP32[i5 >> 2] | 0) + 16;
+ STACKTOP = i2;
+ return;
+}
+function _read_line(i4, i5, i1) {
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i6 = 0, i7 = 0, i8 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 1040 | 0;
+ i2 = i3;
+ _luaL_buffinit(i4, i2);
+ i7 = _luaL_prepbuffsize(i2, 1024) | 0;
+ L1 : do {
+ if ((_fgets(i7 | 0, 1024, i5 | 0) | 0) != 0) {
+ i6 = i2 + 8 | 0;
+ while (1) {
+ i8 = _strlen(i7 | 0) | 0;
+ if ((i8 | 0) != 0 ? (HEAP8[i7 + (i8 + -1) | 0] | 0) == 10 : 0) {
+ break;
+ }
+ HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + i8;
+ i7 = _luaL_prepbuffsize(i2, 1024) | 0;
+ if ((_fgets(i7 | 0, 1024, i5 | 0) | 0) == 0) {
+ break L1;
+ }
+ }
+ HEAP32[i6 >> 2] = i8 - i1 + (HEAP32[i6 >> 2] | 0);
+ _luaL_pushresult(i2);
+ i8 = 1;
+ STACKTOP = i3;
+ return i8 | 0;
+ }
+ } while (0);
+ _luaL_pushresult(i2);
+ i8 = (_lua_rawlen(i4, -1) | 0) != 0 | 0;
+ STACKTOP = i3;
+ return i8 | 0;
+}
+function _luaL_tolstring(i1, i5, i4) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ var i2 = 0, i3 = 0, i6 = 0, i7 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i2;
+ do {
+ if ((_luaL_callmeta(i1, i5, 1384) | 0) == 0) {
+ i6 = _lua_type(i1, i5) | 0;
+ if ((i6 | 0) == 0) {
+ _lua_pushlstring(i1, 1416, 3) | 0;
+ break;
+ } else if ((i6 | 0) == 1) {
+ i6 = (_lua_toboolean(i1, i5) | 0) != 0;
+ _lua_pushstring(i1, i6 ? 1400 : 1408) | 0;
+ break;
+ } else if ((i6 | 0) == 4 | (i6 | 0) == 3) {
+ _lua_pushvalue(i1, i5);
+ break;
+ } else {
+ i7 = _lua_typename(i1, _lua_type(i1, i5) | 0) | 0;
+ i6 = _lua_topointer(i1, i5) | 0;
+ HEAP32[i3 >> 2] = i7;
+ HEAP32[i3 + 4 >> 2] = i6;
+ _lua_pushfstring(i1, 1424, i3) | 0;
+ break;
+ }
+ }
+ } while (0);
+ i7 = _lua_tolstring(i1, -1, i4) | 0;
+ STACKTOP = i2;
+ return i7 | 0;
+}
+function _save(i7, i1) {
+ i7 = i7 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i8 = 0;
+ i2 = STACKTOP;
+ i4 = HEAP32[i7 + 60 >> 2] | 0;
+ i3 = i4 + 4 | 0;
+ i8 = HEAP32[i3 >> 2] | 0;
+ i6 = i4 + 8 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if (!((i8 + 1 | 0) >>> 0 > i5 >>> 0)) {
+ i6 = HEAP32[i4 >> 2] | 0;
+ i7 = i1 & 255;
+ i5 = i8 + 1 | 0;
+ HEAP32[i3 >> 2] = i5;
+ i8 = i6 + i8 | 0;
+ HEAP8[i8] = i7;
+ STACKTOP = i2;
+ return;
+ }
+ if (i5 >>> 0 > 2147483645) {
+ _lexerror(i7, 12368, 0);
+ }
+ i8 = i5 << 1;
+ i7 = HEAP32[i7 + 52 >> 2] | 0;
+ if ((i8 | 0) == -2) {
+ _luaM_toobig(i7);
+ }
+ i7 = _luaM_realloc_(i7, HEAP32[i4 >> 2] | 0, i5, i8) | 0;
+ HEAP32[i4 >> 2] = i7;
+ HEAP32[i6 >> 2] = i8;
+ i8 = HEAP32[i3 >> 2] | 0;
+ i6 = i7;
+ i7 = i1 & 255;
+ i5 = i8 + 1 | 0;
+ HEAP32[i3 >> 2] = i5;
+ i8 = i6 + i8 | 0;
+ HEAP8[i8] = i7;
+ STACKTOP = i2;
+ return;
+}
+function _luaK_patchtohere(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0;
+ i2 = STACKTOP;
+ HEAP32[i1 + 24 >> 2] = HEAP32[i1 + 20 >> 2];
+ i4 = i1 + 28 | 0;
+ if ((i3 | 0) == -1) {
+ STACKTOP = i2;
+ return;
+ }
+ i7 = HEAP32[i4 >> 2] | 0;
+ if ((i7 | 0) == -1) {
+ HEAP32[i4 >> 2] = i3;
+ STACKTOP = i2;
+ return;
+ }
+ i4 = HEAP32[(HEAP32[i1 >> 2] | 0) + 12 >> 2] | 0;
+ while (1) {
+ i6 = i4 + (i7 << 2) | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ i8 = (i5 >>> 14) + -131071 | 0;
+ if ((i8 | 0) == -1) {
+ break;
+ }
+ i8 = i7 + 1 + i8 | 0;
+ if ((i8 | 0) == -1) {
+ break;
+ } else {
+ i7 = i8;
+ }
+ }
+ i3 = ~i7 + i3 | 0;
+ if ((((i3 | 0) > -1 ? i3 : 0 - i3 | 0) | 0) > 131071) {
+ _luaX_syntaxerror(HEAP32[i1 + 12 >> 2] | 0, 10624);
+ }
+ HEAP32[i6 >> 2] = (i3 << 14) + 2147467264 | i5 & 16383;
+ STACKTOP = i2;
+ return;
+}
+function _tinsert(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i7 = i2;
+ _luaL_checktype(i1, 1, 5);
+ i4 = _luaL_len(i1, 1) | 0;
+ i3 = i4 + 1 | 0;
+ i6 = _lua_gettop(i1) | 0;
+ if ((i6 | 0) == 3) {
+ i5 = 2;
+ } else if ((i6 | 0) != 2) {
+ i7 = _luaL_error(i1, 8320, i7) | 0;
+ STACKTOP = i2;
+ return i7 | 0;
+ }
+ if ((i5 | 0) == 2) {
+ i5 = _luaL_checkinteger(i1, 2) | 0;
+ if ((i5 | 0) < 1 | (i5 | 0) > (i3 | 0)) {
+ _luaL_argerror(i1, 2, 8256) | 0;
+ }
+ if ((i4 | 0) < (i5 | 0)) {
+ i3 = i5;
+ } else {
+ while (1) {
+ i4 = i3 + -1 | 0;
+ _lua_rawgeti(i1, 1, i4);
+ _lua_rawseti(i1, 1, i3);
+ if ((i4 | 0) > (i5 | 0)) {
+ i3 = i4;
+ } else {
+ i3 = i5;
+ break;
+ }
+ }
+ }
+ }
+ _lua_rawseti(i1, 1, i3);
+ i7 = 0;
+ STACKTOP = i2;
+ return i7 | 0;
+}
+function _lua_iscfunction(i3, i5) {
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i4 = 0;
+ i1 = STACKTOP;
+ i4 = HEAP32[i3 + 16 >> 2] | 0;
+ do {
+ if ((i5 | 0) <= 0) {
+ if (!((i5 | 0) < -1000999)) {
+ i2 = (HEAP32[i3 + 8 >> 2] | 0) + (i5 << 4) | 0;
+ break;
+ }
+ if ((i5 | 0) == -1001e3) {
+ i2 = (HEAP32[i3 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i3 = -1001e3 - i5 | 0;
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP32[i4 + 8 >> 2] | 0) != 22 ? (i2 = HEAP32[i4 >> 2] | 0, (i3 | 0) <= (HEAPU8[i2 + 6 | 0] | 0 | 0)) : 0) {
+ i2 = i2 + (i3 + -1 << 4) + 16 | 0;
+ } else {
+ i2 = 5192;
+ }
+ } else {
+ i2 = (HEAP32[i4 >> 2] | 0) + (i5 << 4) | 0;
+ i2 = i2 >>> 0 < (HEAP32[i3 + 8 >> 2] | 0) >>> 0 ? i2 : 5192;
+ }
+ } while (0);
+ i5 = HEAP32[i2 + 8 >> 2] | 0;
+ STACKTOP = i1;
+ return ((i5 | 0) == 22 | (i5 | 0) == 102) & 1 | 0;
+}
+function _lua_gettable(i1, i5) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ i4 = HEAP32[i1 + 16 >> 2] | 0;
+ do {
+ if ((i5 | 0) <= 0) {
+ if (!((i5 | 0) < -1000999)) {
+ i3 = (HEAP32[i1 + 8 >> 2] | 0) + (i5 << 4) | 0;
+ break;
+ }
+ if ((i5 | 0) == -1001e3) {
+ i3 = (HEAP32[i1 + 12 >> 2] | 0) + 40 | 0;
+ break;
+ }
+ i5 = -1001e3 - i5 | 0;
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((HEAP32[i4 + 8 >> 2] | 0) != 22 ? (i3 = HEAP32[i4 >> 2] | 0, (i5 | 0) <= (HEAPU8[i3 + 6 | 0] | 0 | 0)) : 0) {
+ i3 = i3 + (i5 + -1 << 4) + 16 | 0;
+ } else {
+ i3 = 5192;
+ }
+ } else {
+ i3 = (HEAP32[i4 >> 2] | 0) + (i5 << 4) | 0;
+ i3 = i3 >>> 0 < (HEAP32[i1 + 8 >> 2] | 0) >>> 0 ? i3 : 5192;
+ }
+ } while (0);
+ i5 = (HEAP32[i1 + 8 >> 2] | 0) + -16 | 0;
+ _luaV_gettable(i1, i3, i5, i5);
+ STACKTOP = i2;
+ return;
+}
+function _luaG_errormsg(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0;
+ i2 = HEAP32[i1 + 68 >> 2] | 0;
+ if ((i2 | 0) == 0) {
+ _luaD_throw(i1, 2);
+ }
+ i4 = HEAP32[i1 + 28 >> 2] | 0;
+ i3 = i4 + (i2 + 8) | 0;
+ if ((HEAP32[i3 >> 2] & 15 | 0) != 6) {
+ _luaD_throw(i1, 6);
+ }
+ i5 = i1 + 8 | 0;
+ i6 = HEAP32[i5 >> 2] | 0;
+ i9 = i6 + -16 | 0;
+ i8 = HEAP32[i9 + 4 >> 2] | 0;
+ i7 = i6;
+ HEAP32[i7 >> 2] = HEAP32[i9 >> 2];
+ HEAP32[i7 + 4 >> 2] = i8;
+ HEAP32[i6 + 8 >> 2] = HEAP32[i6 + -8 >> 2];
+ i6 = HEAP32[i5 >> 2] | 0;
+ i7 = i4 + i2 | 0;
+ i2 = HEAP32[i7 + 4 >> 2] | 0;
+ i4 = i6 + -16 | 0;
+ HEAP32[i4 >> 2] = HEAP32[i7 >> 2];
+ HEAP32[i4 + 4 >> 2] = i2;
+ HEAP32[i6 + -8 >> 2] = HEAP32[i3 >> 2];
+ i4 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = i4 + 16;
+ _luaD_call(i1, i4 + -16 | 0, 1, 0);
+ _luaD_throw(i1, 2);
+}
+function _luaB_costatus(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0;
+ i4 = STACKTOP;
+ STACKTOP = STACKTOP + 112 | 0;
+ i3 = i4;
+ i2 = _lua_tothread(i1, 1) | 0;
+ if ((i2 | 0) == 0) {
+ _luaL_argerror(i1, 1, 10856) | 0;
+ }
+ do {
+ if ((i2 | 0) != (i1 | 0)) {
+ i5 = _lua_status(i2) | 0;
+ if ((i5 | 0) == 0) {
+ if ((_lua_getstack(i2, 0, i3) | 0) > 0) {
+ _lua_pushlstring(i1, 10896, 6) | 0;
+ break;
+ }
+ if ((_lua_gettop(i2) | 0) == 0) {
+ _lua_pushlstring(i1, 10904, 4) | 0;
+ break;
+ } else {
+ _lua_pushlstring(i1, 10880, 9) | 0;
+ break;
+ }
+ } else if ((i5 | 0) == 1) {
+ _lua_pushlstring(i1, 10880, 9) | 0;
+ break;
+ } else {
+ _lua_pushlstring(i1, 10904, 4) | 0;
+ break;
+ }
+ } else {
+ _lua_pushlstring(i1, 10728, 7) | 0;
+ }
+ } while (0);
+ STACKTOP = i4;
+ return 1;
+}
+function _searcher_Lua(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i2;
+ i4 = _luaL_checklstring(i1, 1, 0) | 0;
+ _lua_getfield(i1, -1001001, 4256);
+ i5 = _lua_tolstring(i1, -1, 0) | 0;
+ if ((i5 | 0) == 0) {
+ HEAP32[i3 >> 2] = 4256;
+ _luaL_error(i1, 5032, i3) | 0;
+ }
+ i4 = _searchpath(i1, i4, i5, 4936, 4848) | 0;
+ if ((i4 | 0) == 0) {
+ i5 = 1;
+ STACKTOP = i2;
+ return i5 | 0;
+ }
+ if ((_luaL_loadfilex(i1, i4, 0) | 0) == 0) {
+ _lua_pushstring(i1, i4) | 0;
+ i5 = 2;
+ STACKTOP = i2;
+ return i5 | 0;
+ } else {
+ i6 = _lua_tolstring(i1, 1, 0) | 0;
+ i5 = _lua_tolstring(i1, -1, 0) | 0;
+ HEAP32[i3 >> 2] = i6;
+ HEAP32[i3 + 4 >> 2] = i4;
+ HEAP32[i3 + 8 >> 2] = i5;
+ i5 = _luaL_error(i1, 4888, i3) | 0;
+ STACKTOP = i2;
+ return i5 | 0;
+ }
+ return 0;
+}
+function _str_sub(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i3;
+ i2 = _luaL_checklstring(i1, 1, i4) | 0;
+ i5 = _luaL_checkinteger(i1, 2) | 0;
+ i6 = HEAP32[i4 >> 2] | 0;
+ if (!((i5 | 0) > -1)) {
+ if (i6 >>> 0 < (0 - i5 | 0) >>> 0) {
+ i5 = 0;
+ } else {
+ i5 = i5 + 1 + i6 | 0;
+ }
+ }
+ i6 = _luaL_optinteger(i1, 3, -1) | 0;
+ i4 = HEAP32[i4 >> 2] | 0;
+ if (!((i6 | 0) > -1)) {
+ if (i4 >>> 0 < (0 - i6 | 0) >>> 0) {
+ i6 = 0;
+ } else {
+ i6 = i6 + 1 + i4 | 0;
+ }
+ }
+ i5 = (i5 | 0) == 0 ? 1 : i5;
+ i4 = i6 >>> 0 > i4 >>> 0 ? i4 : i6;
+ if (i5 >>> 0 > i4 >>> 0) {
+ _lua_pushlstring(i1, 7040, 0) | 0;
+ STACKTOP = i3;
+ return 1;
+ } else {
+ _lua_pushlstring(i1, i2 + (i5 + -1) | 0, 1 - i5 + i4 | 0) | 0;
+ STACKTOP = i3;
+ return 1;
+ }
+ return 0;
+}
+function _searcher_C(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i2;
+ i4 = _luaL_checklstring(i1, 1, 0) | 0;
+ _lua_getfield(i1, -1001001, 4440);
+ i5 = _lua_tolstring(i1, -1, 0) | 0;
+ if ((i5 | 0) == 0) {
+ HEAP32[i3 >> 2] = 4440;
+ _luaL_error(i1, 5032, i3) | 0;
+ }
+ i5 = _searchpath(i1, i4, i5, 4936, 4848) | 0;
+ if ((i5 | 0) == 0) {
+ i5 = 1;
+ STACKTOP = i2;
+ return i5 | 0;
+ }
+ if ((_loadfunc(i1, i5, i4) | 0) == 0) {
+ _lua_pushstring(i1, i5) | 0;
+ i5 = 2;
+ STACKTOP = i2;
+ return i5 | 0;
+ } else {
+ i6 = _lua_tolstring(i1, 1, 0) | 0;
+ i4 = _lua_tolstring(i1, -1, 0) | 0;
+ HEAP32[i3 >> 2] = i6;
+ HEAP32[i3 + 4 >> 2] = i5;
+ HEAP32[i3 + 8 >> 2] = i4;
+ i5 = _luaL_error(i1, 4888, i3) | 0;
+ STACKTOP = i2;
+ return i5 | 0;
+ }
+ return 0;
+}
+function _io_open(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i5 = STACKTOP;
+ i2 = _luaL_checklstring(i1, 1, 0) | 0;
+ i3 = _luaL_optlstring(i1, 2, 3480, 0) | 0;
+ i4 = _lua_newuserdata(i1, 8) | 0;
+ i6 = i4 + 4 | 0;
+ HEAP32[i6 >> 2] = 0;
+ _luaL_setmetatable(i1, 2832);
+ HEAP32[i4 >> 2] = 0;
+ HEAP32[i6 >> 2] = 156;
+ i6 = HEAP8[i3] | 0;
+ if (!((!(i6 << 24 >> 24 == 0) ? (i7 = i3 + 1 | 0, (_memchr(3552, i6 << 24 >> 24, 4) | 0) != 0) : 0) ? (i6 = (HEAP8[i7] | 0) == 43 ? i3 + 2 | 0 : i7, (HEAP8[(HEAP8[i6] | 0) == 98 ? i6 + 1 | 0 : i6] | 0) == 0) : 0)) {
+ _luaL_argerror(i1, 2, 3560) | 0;
+ }
+ i7 = _fopen(i2 | 0, i3 | 0) | 0;
+ HEAP32[i4 >> 2] = i7;
+ if ((i7 | 0) != 0) {
+ i7 = 1;
+ STACKTOP = i5;
+ return i7 | 0;
+ }
+ i7 = _luaL_fileresult(i1, 0, i2) | 0;
+ STACKTOP = i5;
+ return i7 | 0;
+}
+function _unpack(i2) {
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i6 = i1;
+ _luaL_checktype(i2, 1, 5);
+ i5 = _luaL_optinteger(i2, 2, 1) | 0;
+ if ((_lua_type(i2, 3) | 0) < 1) {
+ i3 = _luaL_len(i2, 1) | 0;
+ } else {
+ i3 = _luaL_checkinteger(i2, 3) | 0;
+ }
+ if ((i5 | 0) > (i3 | 0)) {
+ i6 = 0;
+ STACKTOP = i1;
+ return i6 | 0;
+ }
+ i7 = i3 - i5 | 0;
+ i4 = i7 + 1 | 0;
+ if ((i7 | 0) >= 0 ? (_lua_checkstack(i2, i4) | 0) != 0 : 0) {
+ _lua_rawgeti(i2, 1, i5);
+ if ((i5 | 0) >= (i3 | 0)) {
+ i7 = i4;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ do {
+ i5 = i5 + 1 | 0;
+ _lua_rawgeti(i2, 1, i5);
+ } while ((i5 | 0) != (i3 | 0));
+ STACKTOP = i1;
+ return i4 | 0;
+ }
+ i7 = _luaL_error(i2, 8280, i6) | 0;
+ STACKTOP = i1;
+ return i7 | 0;
+}
+function _luaF_getlocalname(i4, i6, i2) {
+ i4 = i4 | 0;
+ i6 = i6 | 0;
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0, i5 = 0;
+ i1 = STACKTOP;
+ i3 = HEAP32[i4 + 60 >> 2] | 0;
+ if ((i3 | 0) <= 0) {
+ i6 = 0;
+ STACKTOP = i1;
+ return i6 | 0;
+ }
+ i4 = HEAP32[i4 + 24 >> 2] | 0;
+ i5 = 0;
+ while (1) {
+ if ((HEAP32[i4 + (i5 * 12 | 0) + 4 >> 2] | 0) > (i2 | 0)) {
+ i3 = 0;
+ i2 = 8;
+ break;
+ }
+ if ((HEAP32[i4 + (i5 * 12 | 0) + 8 >> 2] | 0) > (i2 | 0)) {
+ i6 = i6 + -1 | 0;
+ if ((i6 | 0) == 0) {
+ i2 = 6;
+ break;
+ }
+ }
+ i5 = i5 + 1 | 0;
+ if ((i5 | 0) >= (i3 | 0)) {
+ i3 = 0;
+ i2 = 8;
+ break;
+ }
+ }
+ if ((i2 | 0) == 6) {
+ i6 = (HEAP32[i4 + (i5 * 12 | 0) >> 2] | 0) + 16 | 0;
+ STACKTOP = i1;
+ return i6 | 0;
+ } else if ((i2 | 0) == 8) {
+ STACKTOP = i1;
+ return i3 | 0;
+ }
+ return 0;
+}
+function _luaK_concat(i1, i4, i3) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0;
+ i2 = STACKTOP;
+ if ((i3 | 0) == -1) {
+ STACKTOP = i2;
+ return;
+ }
+ i7 = HEAP32[i4 >> 2] | 0;
+ if ((i7 | 0) == -1) {
+ HEAP32[i4 >> 2] = i3;
+ STACKTOP = i2;
+ return;
+ }
+ i4 = HEAP32[(HEAP32[i1 >> 2] | 0) + 12 >> 2] | 0;
+ while (1) {
+ i6 = i4 + (i7 << 2) | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ i8 = (i5 >>> 14) + -131071 | 0;
+ if ((i8 | 0) == -1) {
+ break;
+ }
+ i8 = i7 + 1 + i8 | 0;
+ if ((i8 | 0) == -1) {
+ break;
+ } else {
+ i7 = i8;
+ }
+ }
+ i3 = ~i7 + i3 | 0;
+ if ((((i3 | 0) > -1 ? i3 : 0 - i3 | 0) | 0) > 131071) {
+ _luaX_syntaxerror(HEAP32[i1 + 12 >> 2] | 0, 10624);
+ }
+ HEAP32[i6 >> 2] = i5 & 16383 | (i3 << 14) + 2147467264;
+ STACKTOP = i2;
+ return;
+}
+function _scalbn(d3, i2) {
+ d3 = +d3;
+ i2 = i2 | 0;
+ var i1 = 0, i4 = 0;
+ i1 = STACKTOP;
+ if ((i2 | 0) > 1023) {
+ d3 = d3 * 8.98846567431158e+307;
+ i4 = i2 + -1023 | 0;
+ if ((i4 | 0) > 1023) {
+ i2 = i2 + -2046 | 0;
+ i2 = (i2 | 0) > 1023 ? 1023 : i2;
+ d3 = d3 * 8.98846567431158e+307;
+ } else {
+ i2 = i4;
+ }
+ } else {
+ if ((i2 | 0) < -1022) {
+ d3 = d3 * 2.2250738585072014e-308;
+ i4 = i2 + 1022 | 0;
+ if ((i4 | 0) < -1022) {
+ i2 = i2 + 2044 | 0;
+ i2 = (i2 | 0) < -1022 ? -1022 : i2;
+ d3 = d3 * 2.2250738585072014e-308;
+ } else {
+ i2 = i4;
+ }
+ }
+ }
+ i2 = _bitshift64Shl(i2 + 1023 | 0, 0, 52) | 0;
+ i4 = tempRet0;
+ HEAP32[tempDoublePtr >> 2] = i2;
+ HEAP32[tempDoublePtr + 4 >> 2] = i4;
+ d3 = d3 * +HEAPF64[tempDoublePtr >> 3];
+ STACKTOP = i1;
+ return +d3;
+}
+function _luaK_numberK(i1, d6) {
+ i1 = i1 | 0;
+ d6 = +d6;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i7 = 0, i8 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 32 | 0;
+ i4 = i2 + 16 | 0;
+ i3 = i2;
+ HEAPF64[i4 >> 3] = d6;
+ i5 = HEAP32[(HEAP32[i1 + 12 >> 2] | 0) + 52 >> 2] | 0;
+ HEAPF64[i3 >> 3] = d6;
+ HEAP32[i3 + 8 >> 2] = 3;
+ if (d6 != d6 | 0.0 != 0.0 | d6 == 0.0) {
+ i7 = i5 + 8 | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = i8 + 16;
+ i5 = _luaS_newlstr(i5, i4, 8) | 0;
+ HEAP32[i8 >> 2] = i5;
+ HEAP32[i8 + 8 >> 2] = HEAPU8[i5 + 4 | 0] | 0 | 64;
+ i5 = _addk(i1, (HEAP32[i7 >> 2] | 0) + -16 | 0, i3) | 0;
+ HEAP32[i7 >> 2] = (HEAP32[i7 >> 2] | 0) + -16;
+ STACKTOP = i2;
+ return i5 | 0;
+ } else {
+ i8 = _addk(i1, i3, i3) | 0;
+ STACKTOP = i2;
+ return i8 | 0;
+ }
+ return 0;
+}
+function _auxresume(i2, i3, i4) {
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ var i1 = 0;
+ i1 = STACKTOP;
+ do {
+ if ((_lua_checkstack(i3, i4) | 0) != 0) {
+ if ((_lua_status(i3) | 0) == 0 ? (_lua_gettop(i3) | 0) == 0 : 0) {
+ _lua_pushlstring(i2, 10792, 28) | 0;
+ i4 = -1;
+ break;
+ }
+ _lua_xmove(i2, i3, i4);
+ if (!((_lua_resume(i3, i2, i4) | 0) >>> 0 < 2)) {
+ _lua_xmove(i3, i2, 1);
+ i4 = -1;
+ break;
+ }
+ i4 = _lua_gettop(i3) | 0;
+ if ((_lua_checkstack(i2, i4 + 1 | 0) | 0) == 0) {
+ _lua_settop(i3, ~i4);
+ _lua_pushlstring(i2, 10824, 26) | 0;
+ i4 = -1;
+ break;
+ } else {
+ _lua_xmove(i3, i2, i4);
+ break;
+ }
+ } else {
+ _lua_pushlstring(i2, 10760, 28) | 0;
+ i4 = -1;
+ }
+ } while (0);
+ STACKTOP = i1;
+ return i4 | 0;
+}
+function _luaX_setinput(i2, i1, i4, i3, i5) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ var i6 = 0, i7 = 0;
+ i6 = STACKTOP;
+ HEAP8[i1 + 76 | 0] = 46;
+ i7 = i1 + 52 | 0;
+ HEAP32[i7 >> 2] = i2;
+ HEAP32[i1 >> 2] = i5;
+ HEAP32[i1 + 32 >> 2] = 286;
+ HEAP32[i1 + 56 >> 2] = i4;
+ HEAP32[i1 + 48 >> 2] = 0;
+ HEAP32[i1 + 4 >> 2] = 1;
+ HEAP32[i1 + 8 >> 2] = 1;
+ HEAP32[i1 + 68 >> 2] = i3;
+ i5 = _luaS_new(i2, 12264) | 0;
+ HEAP32[i1 + 72 >> 2] = i5;
+ i5 = i5 + 5 | 0;
+ HEAP8[i5] = HEAPU8[i5] | 0 | 32;
+ i5 = i1 + 60 | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ i4 = _luaM_realloc_(HEAP32[i7 >> 2] | 0, HEAP32[i4 >> 2] | 0, HEAP32[i4 + 8 >> 2] | 0, 32) | 0;
+ HEAP32[HEAP32[i5 >> 2] >> 2] = i4;
+ HEAP32[(HEAP32[i5 >> 2] | 0) + 8 >> 2] = 32;
+ STACKTOP = i6;
+ return;
+}
+function _luaL_optlstring(i2, i4, i6, i5) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ i6 = i6 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i3 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i1;
+ if ((_lua_type(i2, i4) | 0) >= 1) {
+ i5 = _lua_tolstring(i2, i4, i5) | 0;
+ if ((i5 | 0) != 0) {
+ i6 = i5;
+ STACKTOP = i1;
+ return i6 | 0;
+ }
+ i5 = _lua_typename(i2, 4) | 0;
+ i6 = _lua_typename(i2, _lua_type(i2, i4) | 0) | 0;
+ HEAP32[i3 >> 2] = i5;
+ HEAP32[i3 + 4 >> 2] = i6;
+ _luaL_argerror(i2, i4, _lua_pushfstring(i2, 1744, i3) | 0) | 0;
+ i6 = 0;
+ STACKTOP = i1;
+ return i6 | 0;
+ }
+ if ((i5 | 0) == 0) {
+ STACKTOP = i1;
+ return i6 | 0;
+ }
+ if ((i6 | 0) == 0) {
+ i2 = 0;
+ } else {
+ i2 = _strlen(i6 | 0) | 0;
+ }
+ HEAP32[i5 >> 2] = i2;
+ STACKTOP = i1;
+ return i6 | 0;
+}
+function _lua_xmove(i3, i4, i1) {
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0;
+ i2 = STACKTOP;
+ if ((i3 | 0) == (i4 | 0)) {
+ STACKTOP = i2;
+ return;
+ }
+ i3 = i3 + 8 | 0;
+ i5 = (HEAP32[i3 >> 2] | 0) + (0 - i1 << 4) | 0;
+ HEAP32[i3 >> 2] = i5;
+ if ((i1 | 0) <= 0) {
+ STACKTOP = i2;
+ return;
+ }
+ i4 = i4 + 8 | 0;
+ i6 = 0;
+ while (1) {
+ i7 = HEAP32[i4 >> 2] | 0;
+ HEAP32[i4 >> 2] = i7 + 16;
+ i10 = i5 + (i6 << 4) | 0;
+ i9 = HEAP32[i10 + 4 >> 2] | 0;
+ i8 = i7;
+ HEAP32[i8 >> 2] = HEAP32[i10 >> 2];
+ HEAP32[i8 + 4 >> 2] = i9;
+ HEAP32[i7 + 8 >> 2] = HEAP32[i5 + (i6 << 4) + 8 >> 2];
+ i6 = i6 + 1 | 0;
+ if ((i6 | 0) == (i1 | 0)) {
+ break;
+ }
+ i5 = HEAP32[i3 >> 2] | 0;
+ }
+ STACKTOP = i2;
+ return;
+}
+function _luaM_realloc_(i7, i10, i3, i2) {
+ i7 = i7 | 0;
+ i10 = i10 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ var i1 = 0, i4 = 0, i5 = 0, i6 = 0, i8 = 0, i9 = 0;
+ i5 = STACKTOP;
+ i6 = HEAP32[i7 + 12 >> 2] | 0;
+ i4 = (i10 | 0) != 0;
+ i9 = i6 + 4 | 0;
+ i8 = FUNCTION_TABLE_iiiii[HEAP32[i6 >> 2] & 3](HEAP32[i9 >> 2] | 0, i10, i3, i2) | 0;
+ if (!((i8 | 0) != 0 | (i2 | 0) == 0)) {
+ if ((HEAP8[i6 + 63 | 0] | 0) == 0) {
+ _luaD_throw(i7, 4);
+ }
+ _luaC_fullgc(i7, 1);
+ i8 = FUNCTION_TABLE_iiiii[HEAP32[i6 >> 2] & 3](HEAP32[i9 >> 2] | 0, i10, i3, i2) | 0;
+ if ((i8 | 0) == 0) {
+ _luaD_throw(i7, 4);
+ } else {
+ i1 = i8;
+ }
+ } else {
+ i1 = i8;
+ }
+ i6 = i6 + 12 | 0;
+ HEAP32[i6 >> 2] = (i4 ? 0 - i3 | 0 : 0) + i2 + (HEAP32[i6 >> 2] | 0);
+ STACKTOP = i5;
+ return i1 | 0;
+}
+function _realloc(i2, i3) {
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ var i1 = 0, i4 = 0, i5 = 0;
+ i1 = STACKTOP;
+ do {
+ if ((i2 | 0) != 0) {
+ if (i3 >>> 0 > 4294967231) {
+ HEAP32[(___errno_location() | 0) >> 2] = 12;
+ i4 = 0;
+ break;
+ }
+ if (i3 >>> 0 < 11) {
+ i4 = 16;
+ } else {
+ i4 = i3 + 11 & -8;
+ }
+ i4 = _try_realloc_chunk(i2 + -8 | 0, i4) | 0;
+ if ((i4 | 0) != 0) {
+ i4 = i4 + 8 | 0;
+ break;
+ }
+ i4 = _malloc(i3) | 0;
+ if ((i4 | 0) == 0) {
+ i4 = 0;
+ } else {
+ i5 = HEAP32[i2 + -4 >> 2] | 0;
+ i5 = (i5 & -8) - ((i5 & 3 | 0) == 0 ? 8 : 4) | 0;
+ _memcpy(i4 | 0, i2 | 0, (i5 >>> 0 < i3 >>> 0 ? i5 : i3) | 0) | 0;
+ _free(i2);
+ }
+ } else {
+ i4 = _malloc(i3) | 0;
+ }
+ } while (0);
+ STACKTOP = i1;
+ return i4 | 0;
+}
+function _lua_setlocal(i3, i5, i4) {
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i2 = 0, i6 = 0, i7 = 0, i8 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i2 = i1;
+ HEAP32[i2 >> 2] = 0;
+ i4 = _findlocal(i3, HEAP32[i5 + 96 >> 2] | 0, i4, i2) | 0;
+ i3 = i3 + 8 | 0;
+ if ((i4 | 0) == 0) {
+ i5 = HEAP32[i3 >> 2] | 0;
+ i5 = i5 + -16 | 0;
+ HEAP32[i3 >> 2] = i5;
+ STACKTOP = i1;
+ return i4 | 0;
+ }
+ i6 = HEAP32[i3 >> 2] | 0;
+ i5 = HEAP32[i2 >> 2] | 0;
+ i8 = i6 + -16 | 0;
+ i7 = HEAP32[i8 + 4 >> 2] | 0;
+ i2 = i5;
+ HEAP32[i2 >> 2] = HEAP32[i8 >> 2];
+ HEAP32[i2 + 4 >> 2] = i7;
+ HEAP32[i5 + 8 >> 2] = HEAP32[i6 + -8 >> 2];
+ i5 = HEAP32[i3 >> 2] | 0;
+ i5 = i5 + -16 | 0;
+ HEAP32[i3 >> 2] = i5;
+ STACKTOP = i1;
+ return i4 | 0;
+}
+function ___remdi3(i1, i4, i5, i6) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ i6 = i6 | 0;
+ var i2 = 0, i3 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 8 | 0;
+ i2 = i3 | 0;
+ i7 = i4 >> 31 | ((i4 | 0) < 0 ? -1 : 0) << 1;
+ i8 = ((i4 | 0) < 0 ? -1 : 0) >> 31 | ((i4 | 0) < 0 ? -1 : 0) << 1;
+ i9 = i6 >> 31 | ((i6 | 0) < 0 ? -1 : 0) << 1;
+ i10 = ((i6 | 0) < 0 ? -1 : 0) >> 31 | ((i6 | 0) < 0 ? -1 : 0) << 1;
+ i1 = _i64Subtract(i7 ^ i1, i8 ^ i4, i7, i8) | 0;
+ i4 = tempRet0;
+ ___udivmoddi4(i1, i4, _i64Subtract(i9 ^ i5, i10 ^ i6, i9, i10) | 0, tempRet0, i2) | 0;
+ i9 = _i64Subtract(HEAP32[i2 >> 2] ^ i7, HEAP32[i2 + 4 >> 2] ^ i8, i7, i8) | 0;
+ i8 = tempRet0;
+ STACKTOP = i3;
+ return (tempRet0 = i8, i9) | 0;
+}
+function _luaC_barrierproto_(i3, i4, i2) {
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ i2 = i2 | 0;
+ var i1 = 0, i5 = 0;
+ i1 = STACKTOP;
+ if ((HEAP32[i4 + 32 >> 2] | 0) != 0) {
+ i5 = HEAP32[i3 + 12 >> 2] | 0;
+ i3 = i4 + 5 | 0;
+ HEAP8[i3] = HEAP8[i3] & 251;
+ i5 = i5 + 88 | 0;
+ HEAP32[i4 + 72 >> 2] = HEAP32[i5 >> 2];
+ HEAP32[i5 >> 2] = i4;
+ STACKTOP = i1;
+ return;
+ }
+ if ((HEAP8[i2 + 5 | 0] & 3) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i5 = i4 + 5 | 0;
+ i4 = HEAP8[i5] | 0;
+ if ((i4 & 4) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i3 = HEAP32[i3 + 12 >> 2] | 0;
+ if ((HEAPU8[i3 + 61 | 0] | 0) < 2) {
+ _reallymarkobject(i3, i2);
+ STACKTOP = i1;
+ return;
+ } else {
+ HEAP8[i5] = HEAP8[i3 + 60 | 0] & 3 | i4 & 184;
+ STACKTOP = i1;
+ return;
+ }
+}
+function _luaL_openlibs(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _luaL_requiref(i1, 2592, 144, 1);
+ _lua_settop(i1, -2);
+ _luaL_requiref(i1, 2600, 145, 1);
+ _lua_settop(i1, -2);
+ _luaL_requiref(i1, 2608, 146, 1);
+ _lua_settop(i1, -2);
+ _luaL_requiref(i1, 2624, 147, 1);
+ _lua_settop(i1, -2);
+ _luaL_requiref(i1, 2632, 148, 1);
+ _lua_settop(i1, -2);
+ _luaL_requiref(i1, 2640, 149, 1);
+ _lua_settop(i1, -2);
+ _luaL_requiref(i1, 2648, 150, 1);
+ _lua_settop(i1, -2);
+ _luaL_requiref(i1, 2656, 151, 1);
+ _lua_settop(i1, -2);
+ _luaL_requiref(i1, 2664, 152, 1);
+ _lua_settop(i1, -2);
+ _luaL_requiref(i1, 2672, 153, 1);
+ _lua_settop(i1, -2);
+ _luaL_getsubtable(i1, -1001e3, 2576) | 0;
+ _lua_settop(i1, -2);
+ STACKTOP = i2;
+ return;
+}
+function _luaX_token2str(i4, i3) {
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ var i1 = 0, i2 = 0, i5 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i2 = i1;
+ if ((i3 | 0) >= 257) {
+ i5 = HEAP32[12096 + (i3 + -257 << 2) >> 2] | 0;
+ if ((i3 | 0) >= 286) {
+ STACKTOP = i1;
+ return i5 | 0;
+ }
+ i4 = HEAP32[i4 + 52 >> 2] | 0;
+ HEAP32[i2 >> 2] = i5;
+ i5 = _luaO_pushfstring(i4, 12256, i2) | 0;
+ STACKTOP = i1;
+ return i5 | 0;
+ }
+ i4 = HEAP32[i4 + 52 >> 2] | 0;
+ if ((HEAP8[i3 + 10913 | 0] & 4) == 0) {
+ HEAP32[i2 >> 2] = i3;
+ i5 = _luaO_pushfstring(i4, 12240, i2) | 0;
+ STACKTOP = i1;
+ return i5 | 0;
+ } else {
+ HEAP32[i2 >> 2] = i3;
+ i5 = _luaO_pushfstring(i4, 12232, i2) | 0;
+ STACKTOP = i1;
+ return i5 | 0;
+ }
+ return 0;
+}
+function _luaL_buffinitsize(i6, i1, i7) {
+ i6 = i6 | 0;
+ i1 = i1 | 0;
+ i7 = i7 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i8 = 0;
+ i2 = STACKTOP;
+ HEAP32[i1 + 12 >> 2] = i6;
+ i3 = i1 + 16 | 0;
+ HEAP32[i1 >> 2] = i3;
+ i5 = i1 + 8 | 0;
+ HEAP32[i5 >> 2] = 0;
+ i4 = i1 + 4 | 0;
+ HEAP32[i4 >> 2] = 1024;
+ if (!(i7 >>> 0 > 1024)) {
+ i7 = i3;
+ i8 = 0;
+ i8 = i7 + i8 | 0;
+ STACKTOP = i2;
+ return i8 | 0;
+ }
+ i8 = i7 >>> 0 > 2048 ? i7 : 2048;
+ i7 = _lua_newuserdata(i6, i8) | 0;
+ _memcpy(i7 | 0, HEAP32[i1 >> 2] | 0, HEAP32[i5 >> 2] | 0) | 0;
+ if ((HEAP32[i1 >> 2] | 0) != (i3 | 0)) {
+ _lua_remove(i6, -2);
+ }
+ HEAP32[i1 >> 2] = i7;
+ HEAP32[i4 >> 2] = i8;
+ i8 = HEAP32[i5 >> 2] | 0;
+ i8 = i7 + i8 | 0;
+ STACKTOP = i2;
+ return i8 | 0;
+}
+function _luaE_freethread(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i2 = STACKTOP;
+ i4 = i3 + 28 | 0;
+ _luaF_close(i3, HEAP32[i4 >> 2] | 0);
+ i5 = HEAP32[i4 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ _luaM_realloc_(i1, i3, 112, 0) | 0;
+ STACKTOP = i2;
+ return;
+ }
+ HEAP32[i3 + 16 >> 2] = i3 + 72;
+ i7 = i3 + 84 | 0;
+ i6 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = 0;
+ if ((i6 | 0) != 0) {
+ while (1) {
+ i5 = HEAP32[i6 + 12 >> 2] | 0;
+ _luaM_realloc_(i3, i6, 40, 0) | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ } else {
+ i6 = i5;
+ }
+ }
+ i5 = HEAP32[i4 >> 2] | 0;
+ }
+ _luaM_realloc_(i3, i5, HEAP32[i3 + 32 >> 2] << 4, 0) | 0;
+ _luaM_realloc_(i1, i3, 112, 0) | 0;
+ STACKTOP = i2;
+ return;
+}
+function ___toread(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i3 = STACKTOP;
+ i4 = i1 + 74 | 0;
+ i2 = HEAP8[i4] | 0;
+ HEAP8[i4] = i2 + 255 | i2;
+ i4 = i1 + 20 | 0;
+ i2 = i1 + 44 | 0;
+ if ((HEAP32[i4 >> 2] | 0) >>> 0 > (HEAP32[i2 >> 2] | 0) >>> 0) {
+ FUNCTION_TABLE_iiii[HEAP32[i1 + 36 >> 2] & 3](i1, 0, 0) | 0;
+ }
+ HEAP32[i1 + 16 >> 2] = 0;
+ HEAP32[i1 + 28 >> 2] = 0;
+ HEAP32[i4 >> 2] = 0;
+ i4 = HEAP32[i1 >> 2] | 0;
+ if ((i4 & 20 | 0) == 0) {
+ i4 = HEAP32[i2 >> 2] | 0;
+ HEAP32[i1 + 8 >> 2] = i4;
+ HEAP32[i1 + 4 >> 2] = i4;
+ i4 = 0;
+ STACKTOP = i3;
+ return i4 | 0;
+ }
+ if ((i4 & 4 | 0) == 0) {
+ i4 = -1;
+ STACKTOP = i3;
+ return i4 | 0;
+ }
+ HEAP32[i1 >> 2] = i4 | 32;
+ i4 = -1;
+ STACKTOP = i3;
+ return i4 | 0;
+}
+function _lua_callk(i3, i7, i4, i6, i5) {
+ i3 = i3 | 0;
+ i7 = i7 | 0;
+ i4 = i4 | 0;
+ i6 = i6 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i8 = 0;
+ i1 = STACKTOP;
+ i2 = i3 + 8 | 0;
+ i7 = (HEAP32[i2 >> 2] | 0) + (~i7 << 4) | 0;
+ if ((i5 | 0) != 0 ? (HEAP16[i3 + 36 >> 1] | 0) == 0 : 0) {
+ i8 = i3 + 16 | 0;
+ HEAP32[(HEAP32[i8 >> 2] | 0) + 28 >> 2] = i5;
+ HEAP32[(HEAP32[i8 >> 2] | 0) + 24 >> 2] = i6;
+ _luaD_call(i3, i7, i4, 1);
+ } else {
+ _luaD_call(i3, i7, i4, 0);
+ }
+ if (!((i4 | 0) == -1)) {
+ STACKTOP = i1;
+ return;
+ }
+ i3 = (HEAP32[i3 + 16 >> 2] | 0) + 4 | 0;
+ i2 = HEAP32[i2 >> 2] | 0;
+ if (!((HEAP32[i3 >> 2] | 0) >>> 0 < i2 >>> 0)) {
+ STACKTOP = i1;
+ return;
+ }
+ HEAP32[i3 >> 2] = i2;
+ STACKTOP = i1;
+ return;
+}
+function _luaX_newstring(i3, i5, i4) {
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i2 = 0, i6 = 0;
+ i1 = STACKTOP;
+ i2 = HEAP32[i3 + 52 >> 2] | 0;
+ i5 = _luaS_newlstr(i2, i5, i4) | 0;
+ i4 = i2 + 8 | 0;
+ i6 = HEAP32[i4 >> 2] | 0;
+ HEAP32[i4 >> 2] = i6 + 16;
+ HEAP32[i6 >> 2] = i5;
+ HEAP32[i6 + 8 >> 2] = HEAPU8[i5 + 4 | 0] | 0 | 64;
+ i6 = _luaH_set(i2, HEAP32[(HEAP32[i3 + 48 >> 2] | 0) + 4 >> 2] | 0, (HEAP32[i4 >> 2] | 0) + -16 | 0) | 0;
+ i3 = i6 + 8 | 0;
+ if ((HEAP32[i3 >> 2] | 0) == 0 ? (HEAP32[i6 >> 2] = 1, HEAP32[i3 >> 2] = 1, (HEAP32[(HEAP32[i2 + 12 >> 2] | 0) + 12 >> 2] | 0) > 0) : 0) {
+ _luaC_step(i2);
+ }
+ HEAP32[i4 >> 2] = (HEAP32[i4 >> 2] | 0) + -16;
+ STACKTOP = i1;
+ return i5 | 0;
+}
+function _strtod(i3, i2) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ var i1 = 0, i4 = 0, d5 = 0.0, i6 = 0, i7 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 112 | 0;
+ i4 = i1;
+ i7 = i4 + 0 | 0;
+ i6 = i7 + 112 | 0;
+ do {
+ HEAP32[i7 >> 2] = 0;
+ i7 = i7 + 4 | 0;
+ } while ((i7 | 0) < (i6 | 0));
+ i6 = i4 + 4 | 0;
+ HEAP32[i6 >> 2] = i3;
+ i7 = i4 + 8 | 0;
+ HEAP32[i7 >> 2] = -1;
+ HEAP32[i4 + 44 >> 2] = i3;
+ HEAP32[i4 + 76 >> 2] = -1;
+ ___shlim(i4, 0);
+ d5 = +___floatscan(i4, 1, 1);
+ i4 = (HEAP32[i6 >> 2] | 0) - (HEAP32[i7 >> 2] | 0) + (HEAP32[i4 + 108 >> 2] | 0) | 0;
+ if ((i2 | 0) == 0) {
+ STACKTOP = i1;
+ return +d5;
+ }
+ if ((i4 | 0) != 0) {
+ i3 = i3 + i4 | 0;
+ }
+ HEAP32[i2 >> 2] = i3;
+ STACKTOP = i1;
+ return +d5;
+}
+function _f_seek(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, d6 = 0.0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = _luaL_checkudata(i1, 1, 2832) | 0;
+ if ((HEAP32[i3 + 4 >> 2] | 0) == 0) {
+ _luaL_error(i1, 3080, i2) | 0;
+ }
+ i3 = HEAP32[i3 >> 2] | 0;
+ i5 = _luaL_checkoption(i1, 2, 3208, 3184) | 0;
+ d6 = +_luaL_optnumber(i1, 3, 0.0);
+ i4 = ~~d6;
+ if (!(+(i4 | 0) == d6)) {
+ _luaL_argerror(i1, 3, 3224) | 0;
+ }
+ if ((_fseek(i3 | 0, i4 | 0, HEAP32[3168 + (i5 << 2) >> 2] | 0) | 0) == 0) {
+ _lua_pushnumber(i1, +(_ftell(i3 | 0) | 0));
+ i5 = 1;
+ STACKTOP = i2;
+ return i5 | 0;
+ } else {
+ i5 = _luaL_fileresult(i1, 0, 0) | 0;
+ STACKTOP = i2;
+ return i5 | 0;
+ }
+ return 0;
+}
+function _setpath(i1, i4, i8, i7, i3) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i8 = i8 | 0;
+ i7 = i7 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i5 = 0, i6 = 0;
+ i2 = STACKTOP;
+ i8 = _getenv(i8 | 0) | 0;
+ if ((i8 | 0) == 0) {
+ i7 = _getenv(i7 | 0) | 0;
+ if ((i7 | 0) != 0) {
+ i5 = i7;
+ i6 = 3;
+ }
+ } else {
+ i5 = i8;
+ i6 = 3;
+ }
+ if ((i6 | 0) == 3 ? (_lua_getfield(i1, -1001e3, 4832), i8 = _lua_toboolean(i1, -1) | 0, _lua_settop(i1, -2), (i8 | 0) == 0) : 0) {
+ _luaL_gsub(i1, _luaL_gsub(i1, i5, 4808, 4816) | 0, 4824, i3) | 0;
+ _lua_remove(i1, -2);
+ _lua_setfield(i1, -2, i4);
+ STACKTOP = i2;
+ return;
+ }
+ _lua_pushstring(i1, i3) | 0;
+ _lua_setfield(i1, -2, i4);
+ STACKTOP = i2;
+ return;
+}
+function _luaU_header(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ HEAP8[i1] = 1635077147;
+ HEAP8[i1 + 1 | 0] = 6387020;
+ HEAP8[i1 + 2 | 0] = 24949;
+ HEAP8[i1 + 3 | 0] = 97;
+ HEAP8[i1 + 4 | 0] = 82;
+ HEAP8[i1 + 5 | 0] = 0;
+ HEAP8[i1 + 6 | 0] = 1;
+ HEAP8[i1 + 7 | 0] = 4;
+ HEAP8[i1 + 8 | 0] = 4;
+ HEAP8[i1 + 9 | 0] = 4;
+ HEAP8[i1 + 10 | 0] = 8;
+ i3 = i1 + 12 | 0;
+ HEAP8[i1 + 11 | 0] = 0;
+ HEAP8[i3 + 0 | 0] = HEAP8[8816 | 0] | 0;
+ HEAP8[i3 + 1 | 0] = HEAP8[8817 | 0] | 0;
+ HEAP8[i3 + 2 | 0] = HEAP8[8818 | 0] | 0;
+ HEAP8[i3 + 3 | 0] = HEAP8[8819 | 0] | 0;
+ HEAP8[i3 + 4 | 0] = HEAP8[8820 | 0] | 0;
+ HEAP8[i3 + 5 | 0] = HEAP8[8821 | 0] | 0;
+ STACKTOP = i2;
+ return;
+}
+function _db_setlocal(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 112 | 0;
+ i3 = i2;
+ if ((_lua_type(i1, 1) | 0) == 8) {
+ i5 = _lua_tothread(i1, 1) | 0;
+ i4 = 1;
+ } else {
+ i5 = i1;
+ i4 = 0;
+ }
+ i6 = i4 + 1 | 0;
+ if ((_lua_getstack(i5, _luaL_checkinteger(i1, i6) | 0, i3) | 0) == 0) {
+ i6 = _luaL_argerror(i1, i6, 11560) | 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ } else {
+ i6 = i4 + 3 | 0;
+ _luaL_checkany(i1, i6);
+ _lua_settop(i1, i6);
+ _lua_xmove(i1, i5, 1);
+ _lua_pushstring(i1, _lua_setlocal(i5, i3, _luaL_checkinteger(i1, i4 | 2) | 0) | 0) | 0;
+ i6 = 1;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ return 0;
+}
+function _tremove(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0;
+ i2 = STACKTOP;
+ _luaL_checktype(i1, 1, 5);
+ i3 = _luaL_len(i1, 1) | 0;
+ i4 = _luaL_optinteger(i1, 2, i3) | 0;
+ if ((i4 | 0) != (i3 | 0) ? (i4 | 0) < 1 | (i4 | 0) > (i3 + 1 | 0) : 0) {
+ _luaL_argerror(i1, 1, 8256) | 0;
+ }
+ _lua_rawgeti(i1, 1, i4);
+ if ((i4 | 0) >= (i3 | 0)) {
+ i5 = i4;
+ _lua_pushnil(i1);
+ _lua_rawseti(i1, 1, i5);
+ STACKTOP = i2;
+ return 1;
+ }
+ while (1) {
+ i5 = i4 + 1 | 0;
+ _lua_rawgeti(i1, 1, i5);
+ _lua_rawseti(i1, 1, i4);
+ if ((i5 | 0) == (i3 | 0)) {
+ break;
+ } else {
+ i4 = i5;
+ }
+ }
+ _lua_pushnil(i1);
+ _lua_rawseti(i1, 1, i3);
+ STACKTOP = i2;
+ return 1;
+}
+function _luaL_checkudata(i1, i7, i5) {
+ i1 = i1 | 0;
+ i7 = i7 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i6 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i2;
+ i3 = _lua_touserdata(i1, i7) | 0;
+ if (((i3 | 0) != 0 ? (_lua_getmetatable(i1, i7) | 0) != 0 : 0) ? (_lua_getfield(i1, -1001e3, i5), i6 = (_lua_rawequal(i1, -1, -2) | 0) == 0, i6 = i6 ? 0 : i3, _lua_settop(i1, -3), (i6 | 0) != 0) : 0) {
+ i7 = i6;
+ STACKTOP = i2;
+ return i7 | 0;
+ }
+ i6 = _lua_typename(i1, _lua_type(i1, i7) | 0) | 0;
+ HEAP32[i4 >> 2] = i5;
+ HEAP32[i4 + 4 >> 2] = i6;
+ _luaL_argerror(i1, i7, _lua_pushfstring(i1, 1744, i4) | 0) | 0;
+ i7 = 0;
+ STACKTOP = i2;
+ return i7 | 0;
+}
+function _luaL_error(i1, i5, i7) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ i7 = i7 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i6 = 0;
+ i4 = STACKTOP;
+ STACKTOP = STACKTOP + 128 | 0;
+ i3 = i4;
+ i2 = i4 + 24 | 0;
+ i4 = i4 + 8 | 0;
+ HEAP32[i4 >> 2] = i7;
+ if ((_lua_getstack(i1, 1, i2) | 0) != 0 ? (_lua_getinfo(i1, 1152, i2) | 0, i6 = HEAP32[i2 + 20 >> 2] | 0, (i6 | 0) > 0) : 0) {
+ HEAP32[i3 >> 2] = i2 + 36;
+ HEAP32[i3 + 4 >> 2] = i6;
+ _lua_pushfstring(i1, 1160, i3) | 0;
+ _lua_pushvfstring(i1, i5, i4) | 0;
+ _lua_concat(i1, 2);
+ _lua_error(i1) | 0;
+ }
+ _lua_pushlstring(i1, 1168, 0) | 0;
+ _lua_pushvfstring(i1, i5, i4) | 0;
+ _lua_concat(i1, 2);
+ _lua_error(i1) | 0;
+ return 0;
+}
+function _luaK_infix(i1, i4, i3) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ L1 : do {
+ switch (i4 | 0) {
+ case 6:
+ {
+ _luaK_exp2nextreg(i1, i3);
+ break;
+ }
+ case 5:
+ case 4:
+ case 3:
+ case 2:
+ case 1:
+ case 0:
+ {
+ if (((HEAP32[i3 >> 2] | 0) == 5 ? (HEAP32[i3 + 16 >> 2] | 0) == -1 : 0) ? (HEAP32[i3 + 20 >> 2] | 0) == -1 : 0) {
+ break L1;
+ }
+ _luaK_exp2RK(i1, i3) | 0;
+ break;
+ }
+ case 13:
+ {
+ _luaK_goiftrue(i1, i3);
+ break;
+ }
+ case 14:
+ {
+ _luaK_goiffalse(i1, i3);
+ break;
+ }
+ default:
+ {
+ _luaK_exp2RK(i1, i3) | 0;
+ }
+ }
+ } while (0);
+ STACKTOP = i2;
+ return;
+}
+function _luaD_shrinkstack(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0;
+ i2 = STACKTOP;
+ i4 = HEAP32[i1 + 8 >> 2] | 0;
+ i3 = HEAP32[i1 + 16 >> 2] | 0;
+ if ((i3 | 0) != 0) {
+ do {
+ i5 = HEAP32[i3 + 4 >> 2] | 0;
+ i4 = i4 >>> 0 < i5 >>> 0 ? i5 : i4;
+ i3 = HEAP32[i3 + 8 >> 2] | 0;
+ } while ((i3 | 0) != 0);
+ }
+ i3 = i4 - (HEAP32[i1 + 28 >> 2] | 0) | 0;
+ i4 = (i3 >> 4) + 1 | 0;
+ i4 = ((i4 | 0) / 8 | 0) + 10 + i4 | 0;
+ i4 = (i4 | 0) > 1e6 ? 1e6 : i4;
+ if ((i3 | 0) > 15999984) {
+ STACKTOP = i2;
+ return;
+ }
+ if ((i4 | 0) >= (HEAP32[i1 + 32 >> 2] | 0)) {
+ STACKTOP = i2;
+ return;
+ }
+ _luaD_reallocstack(i1, i4);
+ STACKTOP = i2;
+ return;
+}
+function _luaF_newproto(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ i1 = _luaC_newobj(i1, 9, 80, 0, 0) | 0;
+ HEAP32[i1 + 8 >> 2] = 0;
+ HEAP32[i1 + 44 >> 2] = 0;
+ HEAP32[i1 + 16 >> 2] = 0;
+ HEAP32[i1 + 56 >> 2] = 0;
+ HEAP32[i1 + 12 >> 2] = 0;
+ HEAP32[i1 + 32 >> 2] = 0;
+ HEAP32[i1 + 48 >> 2] = 0;
+ HEAP32[i1 + 20 >> 2] = 0;
+ HEAP32[i1 + 52 >> 2] = 0;
+ HEAP32[i1 + 28 >> 2] = 0;
+ HEAP32[i1 + 40 >> 2] = 0;
+ HEAP8[i1 + 76 | 0] = 0;
+ HEAP8[i1 + 77 | 0] = 0;
+ HEAP8[i1 + 78 | 0] = 0;
+ HEAP32[i1 + 24 >> 2] = 0;
+ HEAP32[i1 + 60 >> 2] = 0;
+ HEAP32[i1 + 64 >> 2] = 0;
+ HEAP32[i1 + 68 >> 2] = 0;
+ HEAP32[i1 + 36 >> 2] = 0;
+ STACKTOP = i2;
+ return i1 | 0;
+}
+function _luaF_freeproto(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i3 = 0;
+ i3 = STACKTOP;
+ _luaM_realloc_(i2, HEAP32[i1 + 12 >> 2] | 0, HEAP32[i1 + 48 >> 2] << 2, 0) | 0;
+ _luaM_realloc_(i2, HEAP32[i1 + 16 >> 2] | 0, HEAP32[i1 + 56 >> 2] << 2, 0) | 0;
+ _luaM_realloc_(i2, HEAP32[i1 + 8 >> 2] | 0, HEAP32[i1 + 44 >> 2] << 4, 0) | 0;
+ _luaM_realloc_(i2, HEAP32[i1 + 20 >> 2] | 0, HEAP32[i1 + 52 >> 2] << 2, 0) | 0;
+ _luaM_realloc_(i2, HEAP32[i1 + 24 >> 2] | 0, (HEAP32[i1 + 60 >> 2] | 0) * 12 | 0, 0) | 0;
+ _luaM_realloc_(i2, HEAP32[i1 + 28 >> 2] | 0, HEAP32[i1 + 40 >> 2] << 3, 0) | 0;
+ _luaM_realloc_(i2, i1, 80, 0) | 0;
+ STACKTOP = i3;
+ return;
+}
+function _luaK_patchclose(i3, i7, i4) {
+ i3 = i3 | 0;
+ i7 = i7 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i2 = 0, i5 = 0, i6 = 0, i8 = 0;
+ i2 = STACKTOP;
+ if ((i7 | 0) == -1) {
+ STACKTOP = i2;
+ return;
+ }
+ i3 = HEAP32[(HEAP32[i3 >> 2] | 0) + 12 >> 2] | 0;
+ i4 = (i4 << 6) + 64 & 16320;
+ while (1) {
+ i6 = i3 + (i7 << 2) | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ i8 = (i5 >>> 14) + -131071 | 0;
+ if ((i8 | 0) == -1) {
+ break;
+ }
+ i7 = i7 + 1 + i8 | 0;
+ HEAP32[i6 >> 2] = i5 & -16321 | i4;
+ if ((i7 | 0) == -1) {
+ i1 = 6;
+ break;
+ }
+ }
+ if ((i1 | 0) == 6) {
+ STACKTOP = i2;
+ return;
+ }
+ HEAP32[i6 >> 2] = i5 & -16321 | i4;
+ STACKTOP = i2;
+ return;
+}
+function _loadfunc(i1, i4, i5) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i6 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i2;
+ i6 = _luaL_gsub(i1, i5, 4936, 4944) | 0;
+ i5 = _strchr(i6, 45) | 0;
+ do {
+ if ((i5 | 0) != 0) {
+ HEAP32[i3 >> 2] = _lua_pushlstring(i1, i6, i5 - i6 | 0) | 0;
+ i6 = _ll_loadfunc(i1, i4, _lua_pushfstring(i1, 4952, i3) | 0) | 0;
+ if ((i6 | 0) == 2) {
+ i6 = i5 + 1 | 0;
+ break;
+ } else {
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ }
+ } while (0);
+ HEAP32[i3 >> 2] = i6;
+ i6 = _ll_loadfunc(i1, i4, _lua_pushfstring(i1, 4952, i3) | 0) | 0;
+ STACKTOP = i2;
+ return i6 | 0;
+}
+function _luaK_setlist(i1, i3, i4, i5) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ i4 = ((i4 + -1 | 0) / 50 | 0) + 1 | 0;
+ i5 = (i5 | 0) == -1 ? 0 : i5;
+ if ((i4 | 0) < 512) {
+ _luaK_code(i1, i3 << 6 | i5 << 23 | i4 << 14 | 36) | 0;
+ i4 = i3 + 1 | 0;
+ i4 = i4 & 255;
+ i5 = i1 + 48 | 0;
+ HEAP8[i5] = i4;
+ STACKTOP = i2;
+ return;
+ }
+ if ((i4 | 0) >= 67108864) {
+ _luaX_syntaxerror(HEAP32[i1 + 12 >> 2] | 0, 10576);
+ }
+ _luaK_code(i1, i3 << 6 | i5 << 23 | 36) | 0;
+ _luaK_code(i1, i4 << 6 | 39) | 0;
+ i4 = i3 + 1 | 0;
+ i4 = i4 & 255;
+ i5 = i1 + 48 | 0;
+ HEAP8[i5] = i4;
+ STACKTOP = i2;
+ return;
+}
+function _lua_getstack(i2, i6, i3) {
+ i2 = i2 | 0;
+ i6 = i6 | 0;
+ i3 = i3 | 0;
+ var i1 = 0, i4 = 0, i5 = 0;
+ i1 = STACKTOP;
+ L1 : do {
+ if ((i6 | 0) >= 0) {
+ i5 = HEAP32[i2 + 16 >> 2] | 0;
+ if ((i6 | 0) > 0) {
+ i4 = i2 + 72 | 0;
+ do {
+ if ((i5 | 0) == (i4 | 0)) {
+ i2 = 0;
+ break L1;
+ }
+ i6 = i6 + -1 | 0;
+ i5 = HEAP32[i5 + 8 >> 2] | 0;
+ } while ((i6 | 0) > 0);
+ if ((i6 | 0) != 0) {
+ i2 = 0;
+ break;
+ }
+ }
+ if ((i5 | 0) != (i2 + 72 | 0)) {
+ HEAP32[i3 + 96 >> 2] = i5;
+ i2 = 1;
+ } else {
+ i2 = 0;
+ }
+ } else {
+ i2 = 0;
+ }
+ } while (0);
+ STACKTOP = i1;
+ return i2 | 0;
+}
+function _luaC_checkupvalcolor(i1, i5) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ i4 = i5 + 5 | 0;
+ i3 = HEAPU8[i4] | 0;
+ if ((i3 & 7 | 0) != 0) {
+ STACKTOP = i2;
+ return;
+ }
+ if ((HEAP8[i1 + 62 | 0] | 0) != 2 ? (HEAPU8[i1 + 61 | 0] | 0) >= 2 : 0) {
+ HEAP8[i4] = HEAP8[i1 + 60 | 0] & 3 | i3 & 184;
+ STACKTOP = i2;
+ return;
+ }
+ HEAP8[i4] = i3 & 187 | 4;
+ i3 = HEAP32[i5 + 8 >> 2] | 0;
+ if ((HEAP32[i3 + 8 >> 2] & 64 | 0) == 0) {
+ STACKTOP = i2;
+ return;
+ }
+ i3 = HEAP32[i3 >> 2] | 0;
+ if ((HEAP8[i3 + 5 | 0] & 3) == 0) {
+ STACKTOP = i2;
+ return;
+ }
+ _reallymarkobject(i1, i3);
+ STACKTOP = i2;
+ return;
+}
+function _luaB_collectgarbage(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ i4 = HEAP32[10160 + ((_luaL_checkoption(i1, 1, 10040, 9976) | 0) << 2) >> 2] | 0;
+ i3 = _lua_gc(i1, i4, _luaL_optinteger(i1, 2, 0) | 0) | 0;
+ if ((i4 | 0) == 3) {
+ i4 = _lua_gc(i1, 4, 0) | 0;
+ _lua_pushnumber(i1, +(i3 | 0) + +(i4 | 0) * .0009765625);
+ _lua_pushinteger(i1, i4);
+ i4 = 2;
+ STACKTOP = i2;
+ return i4 | 0;
+ } else if ((i4 | 0) == 9 | (i4 | 0) == 5) {
+ _lua_pushboolean(i1, i3);
+ i4 = 1;
+ STACKTOP = i2;
+ return i4 | 0;
+ } else {
+ _lua_pushinteger(i1, i3);
+ i4 = 1;
+ STACKTOP = i2;
+ return i4 | 0;
+ }
+ return 0;
+}
+function _maxn(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, d3 = 0.0, d4 = 0.0;
+ i2 = STACKTOP;
+ _luaL_checktype(i1, 1, 5);
+ _lua_pushnil(i1);
+ L1 : do {
+ if ((_lua_next(i1, 1) | 0) == 0) {
+ d3 = 0.0;
+ } else {
+ d4 = 0.0;
+ while (1) {
+ while (1) {
+ _lua_settop(i1, -2);
+ if ((_lua_type(i1, -1) | 0) == 3 ? (d3 = +_lua_tonumberx(i1, -1, 0), d3 > d4) : 0) {
+ break;
+ }
+ if ((_lua_next(i1, 1) | 0) == 0) {
+ d3 = d4;
+ break L1;
+ }
+ }
+ if ((_lua_next(i1, 1) | 0) == 0) {
+ break;
+ } else {
+ d4 = d3;
+ }
+ }
+ }
+ } while (0);
+ _lua_pushnumber(i1, d3);
+ STACKTOP = i2;
+ return 1;
+}
+function _str_char(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 1040 | 0;
+ i4 = i2;
+ i3 = _lua_gettop(i1) | 0;
+ i5 = _luaL_buffinitsize(i1, i4, i3) | 0;
+ if ((i3 | 0) < 1) {
+ _luaL_pushresultsize(i4, i3);
+ STACKTOP = i2;
+ return 1;
+ } else {
+ i6 = 1;
+ }
+ while (1) {
+ i7 = _luaL_checkinteger(i1, i6) | 0;
+ if ((i7 & 255 | 0) != (i7 | 0)) {
+ _luaL_argerror(i1, i6, 7920) | 0;
+ }
+ HEAP8[i5 + (i6 + -1) | 0] = i7;
+ if ((i6 | 0) == (i3 | 0)) {
+ break;
+ } else {
+ i6 = i6 + 1 | 0;
+ }
+ }
+ _luaL_pushresultsize(i4, i3);
+ STACKTOP = i2;
+ return 1;
+}
+function _memcpy(i3, i2, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i4 = 0;
+ if ((i1 | 0) >= 4096) return _emscripten_memcpy_big(i3 | 0, i2 | 0, i1 | 0) | 0;
+ i4 = i3 | 0;
+ if ((i3 & 3) == (i2 & 3)) {
+ while (i3 & 3) {
+ if ((i1 | 0) == 0) return i4 | 0;
+ HEAP8[i3] = HEAP8[i2] | 0;
+ i3 = i3 + 1 | 0;
+ i2 = i2 + 1 | 0;
+ i1 = i1 - 1 | 0;
+ }
+ while ((i1 | 0) >= 4) {
+ HEAP32[i3 >> 2] = HEAP32[i2 >> 2];
+ i3 = i3 + 4 | 0;
+ i2 = i2 + 4 | 0;
+ i1 = i1 - 4 | 0;
+ }
+ }
+ while ((i1 | 0) > 0) {
+ HEAP8[i3] = HEAP8[i2] | 0;
+ i3 = i3 + 1 | 0;
+ i2 = i2 + 1 | 0;
+ i1 = i1 - 1 | 0;
+ }
+ return i4 | 0;
+}
+function _luaK_exp2val(i1, i5) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i6 = 0;
+ i2 = STACKTOP;
+ i3 = i5 + 16 | 0;
+ i4 = i5 + 20 | 0;
+ if ((HEAP32[i3 >> 2] | 0) == (HEAP32[i4 >> 2] | 0)) {
+ _luaK_dischargevars(i1, i5);
+ STACKTOP = i2;
+ return;
+ }
+ _luaK_dischargevars(i1, i5);
+ if ((HEAP32[i5 >> 2] | 0) == 6) {
+ i6 = HEAP32[i5 + 8 >> 2] | 0;
+ if ((HEAP32[i3 >> 2] | 0) == (HEAP32[i4 >> 2] | 0)) {
+ STACKTOP = i2;
+ return;
+ }
+ if ((i6 | 0) >= (HEAPU8[i1 + 46 | 0] | 0 | 0)) {
+ _exp2reg(i1, i5, i6);
+ STACKTOP = i2;
+ return;
+ }
+ }
+ _luaK_exp2nextreg(i1, i5);
+ STACKTOP = i2;
+ return;
+}
+function _str_reverse(i5) {
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i6 = 0, i7 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 1056 | 0;
+ i4 = i2 + 1040 | 0;
+ i1 = i2;
+ i3 = _luaL_checklstring(i5, 1, i4) | 0;
+ i5 = _luaL_buffinitsize(i5, i1, HEAP32[i4 >> 2] | 0) | 0;
+ i6 = HEAP32[i4 >> 2] | 0;
+ if ((i6 | 0) == 0) {
+ i7 = 0;
+ _luaL_pushresultsize(i1, i7);
+ STACKTOP = i2;
+ return 1;
+ } else {
+ i7 = 0;
+ }
+ do {
+ HEAP8[i5 + i7 | 0] = HEAP8[i3 + (i6 + ~i7) | 0] | 0;
+ i7 = i7 + 1 | 0;
+ i6 = HEAP32[i4 >> 2] | 0;
+ } while (i7 >>> 0 < i6 >>> 0);
+ _luaL_pushresultsize(i1, i6);
+ STACKTOP = i2;
+ return 1;
+}
+function _str_upper(i5) {
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i6 = 0, i7 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 1056 | 0;
+ i4 = i1 + 1040 | 0;
+ i2 = i1;
+ i3 = _luaL_checklstring(i5, 1, i4) | 0;
+ i5 = _luaL_buffinitsize(i5, i2, HEAP32[i4 >> 2] | 0) | 0;
+ if ((HEAP32[i4 >> 2] | 0) == 0) {
+ i7 = 0;
+ _luaL_pushresultsize(i2, i7);
+ STACKTOP = i1;
+ return 1;
+ } else {
+ i6 = 0;
+ }
+ do {
+ HEAP8[i5 + i6 | 0] = _toupper(HEAPU8[i3 + i6 | 0] | 0 | 0) | 0;
+ i6 = i6 + 1 | 0;
+ i7 = HEAP32[i4 >> 2] | 0;
+ } while (i6 >>> 0 < i7 >>> 0);
+ _luaL_pushresultsize(i2, i7);
+ STACKTOP = i1;
+ return 1;
+}
+function _str_lower(i5) {
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i6 = 0, i7 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 1056 | 0;
+ i4 = i1 + 1040 | 0;
+ i2 = i1;
+ i3 = _luaL_checklstring(i5, 1, i4) | 0;
+ i5 = _luaL_buffinitsize(i5, i2, HEAP32[i4 >> 2] | 0) | 0;
+ if ((HEAP32[i4 >> 2] | 0) == 0) {
+ i7 = 0;
+ _luaL_pushresultsize(i2, i7);
+ STACKTOP = i1;
+ return 1;
+ } else {
+ i6 = 0;
+ }
+ do {
+ HEAP8[i5 + i6 | 0] = _tolower(HEAPU8[i3 + i6 | 0] | 0 | 0) | 0;
+ i6 = i6 + 1 | 0;
+ i7 = HEAP32[i4 >> 2] | 0;
+ } while (i6 >>> 0 < i7 >>> 0);
+ _luaL_pushresultsize(i2, i7);
+ STACKTOP = i1;
+ return 1;
+}
+function ___divdi3(i1, i2, i3, i4) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ var i5 = 0, i6 = 0, i7 = 0, i8 = 0;
+ i5 = i2 >> 31 | ((i2 | 0) < 0 ? -1 : 0) << 1;
+ i6 = ((i2 | 0) < 0 ? -1 : 0) >> 31 | ((i2 | 0) < 0 ? -1 : 0) << 1;
+ i7 = i4 >> 31 | ((i4 | 0) < 0 ? -1 : 0) << 1;
+ i8 = ((i4 | 0) < 0 ? -1 : 0) >> 31 | ((i4 | 0) < 0 ? -1 : 0) << 1;
+ i1 = _i64Subtract(i5 ^ i1, i6 ^ i2, i5, i6) | 0;
+ i2 = tempRet0;
+ i5 = i7 ^ i5;
+ i6 = i8 ^ i6;
+ i7 = _i64Subtract((___udivmoddi4(i1, i2, _i64Subtract(i7 ^ i3, i8 ^ i4, i7, i8) | 0, tempRet0, 0) | 0) ^ i5, tempRet0 ^ i6, i5, i6) | 0;
+ return i7 | 0;
+}
+function _luaK_setoneret(i1, i4) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = HEAP32[i4 >> 2] | 0;
+ if ((i3 | 0) == 13) {
+ i3 = (HEAP32[(HEAP32[i1 >> 2] | 0) + 12 >> 2] | 0) + (HEAP32[i4 + 8 >> 2] << 2) | 0;
+ HEAP32[i3 >> 2] = HEAP32[i3 >> 2] & 8388607 | 16777216;
+ HEAP32[i4 >> 2] = 11;
+ STACKTOP = i2;
+ return;
+ } else if ((i3 | 0) == 12) {
+ HEAP32[i4 >> 2] = 6;
+ i4 = i4 + 8 | 0;
+ HEAP32[i4 >> 2] = (HEAP32[(HEAP32[(HEAP32[i1 >> 2] | 0) + 12 >> 2] | 0) + (HEAP32[i4 >> 2] << 2) >> 2] | 0) >>> 6 & 255;
+ STACKTOP = i2;
+ return;
+ } else {
+ STACKTOP = i2;
+ return;
+ }
+}
+function _luaV_tostring(i6, i1) {
+ i6 = i6 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 48 | 0;
+ i3 = i2;
+ i4 = i2 + 8 | 0;
+ i5 = i1 + 8 | 0;
+ if ((HEAP32[i5 >> 2] | 0) != 3) {
+ i6 = 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ HEAPF64[tempDoublePtr >> 3] = +HEAPF64[i1 >> 3];
+ HEAP32[i3 >> 2] = HEAP32[tempDoublePtr >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[tempDoublePtr + 4 >> 2];
+ i6 = _luaS_newlstr(i6, i4, _sprintf(i4 | 0, 8936, i3 | 0) | 0) | 0;
+ HEAP32[i1 >> 2] = i6;
+ HEAP32[i5 >> 2] = HEAPU8[i6 + 4 | 0] | 0 | 64;
+ i6 = 1;
+ STACKTOP = i2;
+ return i6 | 0;
+}
+function _strcmp(i4, i2) {
+ i4 = i4 | 0;
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0, i5 = 0;
+ i1 = STACKTOP;
+ i5 = HEAP8[i4] | 0;
+ i3 = HEAP8[i2] | 0;
+ if (i5 << 24 >> 24 != i3 << 24 >> 24 | i5 << 24 >> 24 == 0 | i3 << 24 >> 24 == 0) {
+ i4 = i5;
+ i5 = i3;
+ i4 = i4 & 255;
+ i5 = i5 & 255;
+ i5 = i4 - i5 | 0;
+ STACKTOP = i1;
+ return i5 | 0;
+ }
+ do {
+ i4 = i4 + 1 | 0;
+ i2 = i2 + 1 | 0;
+ i5 = HEAP8[i4] | 0;
+ i3 = HEAP8[i2] | 0;
+ } while (!(i5 << 24 >> 24 != i3 << 24 >> 24 | i5 << 24 >> 24 == 0 | i3 << 24 >> 24 == 0));
+ i4 = i5 & 255;
+ i5 = i3 & 255;
+ i5 = i4 - i5 | 0;
+ STACKTOP = i1;
+ return i5 | 0;
+}
+function _lua_pushstring(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0;
+ i2 = STACKTOP;
+ if ((i3 | 0) == 0) {
+ i3 = i1 + 8 | 0;
+ i1 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i1 + 8 >> 2] = 0;
+ HEAP32[i3 >> 2] = i1 + 16;
+ i3 = 0;
+ STACKTOP = i2;
+ return i3 | 0;
+ }
+ if ((HEAP32[(HEAP32[i1 + 12 >> 2] | 0) + 12 >> 2] | 0) > 0) {
+ _luaC_step(i1);
+ }
+ i3 = _luaS_new(i1, i3) | 0;
+ i1 = i1 + 8 | 0;
+ i4 = HEAP32[i1 >> 2] | 0;
+ HEAP32[i4 >> 2] = i3;
+ HEAP32[i4 + 8 >> 2] = HEAPU8[i3 + 4 | 0] | 0 | 64;
+ HEAP32[i1 >> 2] = (HEAP32[i1 >> 2] | 0) + 16;
+ i3 = i3 + 16 | 0;
+ STACKTOP = i2;
+ return i3 | 0;
+}
+function _luaK_exp2anyreg(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0, i5 = 0;
+ i2 = STACKTOP;
+ _luaK_dischargevars(i1, i3);
+ if ((HEAP32[i3 >> 2] | 0) == 6) {
+ i5 = i3 + 8 | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ if ((HEAP32[i3 + 16 >> 2] | 0) == (HEAP32[i3 + 20 >> 2] | 0)) {
+ i5 = i4;
+ STACKTOP = i2;
+ return i5 | 0;
+ }
+ if ((i4 | 0) >= (HEAPU8[i1 + 46 | 0] | 0 | 0)) {
+ _exp2reg(i1, i3, i4);
+ i5 = HEAP32[i5 >> 2] | 0;
+ STACKTOP = i2;
+ return i5 | 0;
+ }
+ } else {
+ i5 = i3 + 8 | 0;
+ }
+ _luaK_exp2nextreg(i1, i3);
+ i5 = HEAP32[i5 >> 2] | 0;
+ STACKTOP = i2;
+ return i5 | 0;
+}
+function _check_match(i1, i4, i5, i6) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ i6 = i6 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i2;
+ if ((HEAP32[i1 + 16 >> 2] | 0) == (i4 | 0)) {
+ _luaX_next(i1);
+ STACKTOP = i2;
+ return;
+ }
+ if ((HEAP32[i1 + 4 >> 2] | 0) == (i6 | 0)) {
+ _error_expected(i1, i4);
+ } else {
+ i2 = HEAP32[i1 + 52 >> 2] | 0;
+ i4 = _luaX_token2str(i1, i4) | 0;
+ i5 = _luaX_token2str(i1, i5) | 0;
+ HEAP32[i3 >> 2] = i4;
+ HEAP32[i3 + 4 >> 2] = i5;
+ HEAP32[i3 + 8 >> 2] = i6;
+ _luaX_syntaxerror(i1, _luaO_pushfstring(i2, 6840, i3) | 0);
+ }
+}
+function _fieldsel(i1, i6) {
+ i1 = i1 | 0;
+ i6 = i6 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i7 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 32 | 0;
+ i3 = i2;
+ i5 = i1 + 48 | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ _luaK_exp2anyregup(i4, i6);
+ _luaX_next(i1);
+ if ((HEAP32[i1 + 16 >> 2] | 0) == 288) {
+ i7 = HEAP32[i1 + 24 >> 2] | 0;
+ _luaX_next(i1);
+ i5 = _luaK_stringK(HEAP32[i5 >> 2] | 0, i7) | 0;
+ HEAP32[i3 + 16 >> 2] = -1;
+ HEAP32[i3 + 20 >> 2] = -1;
+ HEAP32[i3 >> 2] = 4;
+ HEAP32[i3 + 8 >> 2] = i5;
+ _luaK_indexed(i4, i6, i3);
+ STACKTOP = i2;
+ return;
+ } else {
+ _error_expected(i1, 288);
+ }
+}
+function _luaK_exp2anyregup(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0;
+ i2 = STACKTOP;
+ if ((HEAP32[i3 >> 2] | 0) == 8 ? (HEAP32[i3 + 16 >> 2] | 0) == (HEAP32[i3 + 20 >> 2] | 0) : 0) {
+ STACKTOP = i2;
+ return;
+ }
+ _luaK_dischargevars(i1, i3);
+ if ((HEAP32[i3 >> 2] | 0) == 6) {
+ i4 = HEAP32[i3 + 8 >> 2] | 0;
+ if ((HEAP32[i3 + 16 >> 2] | 0) == (HEAP32[i3 + 20 >> 2] | 0)) {
+ STACKTOP = i2;
+ return;
+ }
+ if ((i4 | 0) >= (HEAPU8[i1 + 46 | 0] | 0 | 0)) {
+ _exp2reg(i1, i3, i4);
+ STACKTOP = i2;
+ return;
+ }
+ }
+ _luaK_exp2nextreg(i1, i3);
+ STACKTOP = i2;
+ return;
+}
+function _lua_settop(i3, i5) {
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i4 = 0;
+ i1 = STACKTOP;
+ if (!((i5 | 0) > -1)) {
+ i4 = i3 + 8 | 0;
+ HEAP32[i4 >> 2] = (HEAP32[i4 >> 2] | 0) + (i5 + 1 << 4);
+ STACKTOP = i1;
+ return;
+ }
+ i2 = i3 + 8 | 0;
+ i4 = HEAP32[i2 >> 2] | 0;
+ i3 = (HEAP32[HEAP32[i3 + 16 >> 2] >> 2] | 0) + (i5 + 1 << 4) | 0;
+ if (i4 >>> 0 < i3 >>> 0) {
+ while (1) {
+ i5 = i4 + 16 | 0;
+ HEAP32[i4 + 8 >> 2] = 0;
+ if (i5 >>> 0 < i3 >>> 0) {
+ i4 = i5;
+ } else {
+ break;
+ }
+ }
+ HEAP32[i2 >> 2] = i5;
+ }
+ HEAP32[i2 >> 2] = i3;
+ STACKTOP = i1;
+ return;
+}
+function _luaL_fileresult(i1, i6, i5) {
+ i1 = i1 | 0;
+ i6 = i6 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i2;
+ i3 = HEAP32[(___errno_location() | 0) >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ _lua_pushboolean(i1, 1);
+ i6 = 1;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ _lua_pushnil(i1);
+ i6 = _strerror(i3 | 0) | 0;
+ if ((i5 | 0) == 0) {
+ _lua_pushstring(i1, i6) | 0;
+ } else {
+ HEAP32[i4 >> 2] = i5;
+ HEAP32[i4 + 4 >> 2] = i6;
+ _lua_pushfstring(i1, 1176, i4) | 0;
+ }
+ _lua_pushinteger(i1, i3);
+ i6 = 3;
+ STACKTOP = i2;
+ return i6 | 0;
+}
+function _luaL_pushmodule(i1, i4, i5) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i2;
+ _luaL_findtable(i1, -1001e3, 1432, 1) | 0;
+ _lua_getfield(i1, -1, i4);
+ if ((_lua_type(i1, -1) | 0) == 5) {
+ _lua_remove(i1, -2);
+ STACKTOP = i2;
+ return;
+ }
+ _lua_settop(i1, -2);
+ _lua_rawgeti(i1, -1001e3, 2);
+ if ((_luaL_findtable(i1, 0, i4, i5) | 0) != 0) {
+ HEAP32[i3 >> 2] = i4;
+ _luaL_error(i1, 1440, i3) | 0;
+ }
+ _lua_pushvalue(i1, -1);
+ _lua_setfield(i1, -3, i4);
+ _lua_remove(i1, -2);
+ STACKTOP = i2;
+ return;
+}
+function _b_replace(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i6 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = _luaL_checkunsigned(i1, 1) | 0;
+ i5 = _luaL_checkunsigned(i1, 2) | 0;
+ i4 = _luaL_checkinteger(i1, 3) | 0;
+ i2 = _luaL_optinteger(i1, 4, 1) | 0;
+ if (!((i4 | 0) > -1)) {
+ _luaL_argerror(i1, 3, 10440) | 0;
+ }
+ if ((i2 | 0) <= 0) {
+ _luaL_argerror(i1, 4, 10472) | 0;
+ }
+ if ((i2 + i4 | 0) > 32) {
+ _luaL_error(i1, 10496, i6) | 0;
+ }
+ i2 = ~(-2 << i2 + -1);
+ _lua_pushunsigned(i1, i3 & ~(i2 << i4) | (i5 & i2) << i4);
+ STACKTOP = i6;
+ return 1;
+}
+function _luaT_gettmbyobj(i1, i5, i3) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0;
+ i2 = STACKTOP;
+ i4 = HEAP32[i5 + 8 >> 2] & 15;
+ if ((i4 | 0) == 5) {
+ i4 = HEAP32[(HEAP32[i5 >> 2] | 0) + 8 >> 2] | 0;
+ } else if ((i4 | 0) == 7) {
+ i4 = HEAP32[(HEAP32[i5 >> 2] | 0) + 8 >> 2] | 0;
+ } else {
+ i4 = HEAP32[(HEAP32[i1 + 12 >> 2] | 0) + (i4 << 2) + 252 >> 2] | 0;
+ }
+ if ((i4 | 0) == 0) {
+ i5 = 5192;
+ STACKTOP = i2;
+ return i5 | 0;
+ }
+ i5 = _luaH_getstr(i4, HEAP32[(HEAP32[i1 + 12 >> 2] | 0) + (i3 << 2) + 184 >> 2] | 0) | 0;
+ STACKTOP = i2;
+ return i5 | 0;
+}
+function _luaS_eqstr(i2, i3) {
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ var i1 = 0, i4 = 0;
+ i1 = STACKTOP;
+ i4 = HEAP8[i2 + 4 | 0] | 0;
+ do {
+ if (i4 << 24 >> 24 == (HEAP8[i3 + 4 | 0] | 0)) {
+ if (i4 << 24 >> 24 == 4) {
+ i2 = (i2 | 0) == (i3 | 0);
+ break;
+ }
+ i4 = HEAP32[i2 + 12 >> 2] | 0;
+ if ((i2 | 0) != (i3 | 0)) {
+ if ((i4 | 0) == (HEAP32[i3 + 12 >> 2] | 0)) {
+ i2 = (_memcmp(i2 + 16 | 0, i3 + 16 | 0, i4) | 0) == 0;
+ } else {
+ i2 = 0;
+ }
+ } else {
+ i2 = 1;
+ }
+ } else {
+ i2 = 0;
+ }
+ } while (0);
+ STACKTOP = i1;
+ return i2 & 1 | 0;
+}
+function _lua_concat(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0;
+ i2 = STACKTOP;
+ if ((i3 | 0) > 1) {
+ if ((HEAP32[(HEAP32[i1 + 12 >> 2] | 0) + 12 >> 2] | 0) > 0) {
+ _luaC_step(i1);
+ }
+ _luaV_concat(i1, i3);
+ STACKTOP = i2;
+ return;
+ } else {
+ if ((i3 | 0) != 0) {
+ STACKTOP = i2;
+ return;
+ }
+ i3 = i1 + 8 | 0;
+ i4 = HEAP32[i3 >> 2] | 0;
+ i1 = _luaS_newlstr(i1, 936, 0) | 0;
+ HEAP32[i4 >> 2] = i1;
+ HEAP32[i4 + 8 >> 2] = HEAPU8[i1 + 4 | 0] | 0 | 64;
+ HEAP32[i3 >> 2] = (HEAP32[i3 >> 2] | 0) + 16;
+ STACKTOP = i2;
+ return;
+ }
+}
+function _ll_loadfunc(i1, i4, i3) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_getfield(i1, -1001e3, 4184);
+ _lua_getfield(i1, -1, i4);
+ i4 = _lua_touserdata(i1, -1) | 0;
+ _lua_settop(i1, -3);
+ if ((i4 | 0) == 0) {
+ _lua_pushlstring(i1, 4968, 58) | 0;
+ i4 = 1;
+ STACKTOP = i2;
+ return i4 | 0;
+ }
+ if ((HEAP8[i3] | 0) == 42) {
+ _lua_pushboolean(i1, 1);
+ i4 = 0;
+ STACKTOP = i2;
+ return i4 | 0;
+ } else {
+ _lua_pushlstring(i1, 4968, 58) | 0;
+ i4 = 2;
+ STACKTOP = i2;
+ return i4 | 0;
+ }
+ return 0;
+}
+function _memset(i1, i4, i3) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i2 = i1 + i3 | 0;
+ if ((i3 | 0) >= 20) {
+ i4 = i4 & 255;
+ i7 = i1 & 3;
+ i6 = i4 | i4 << 8 | i4 << 16 | i4 << 24;
+ i5 = i2 & ~3;
+ if (i7) {
+ i7 = i1 + 4 - i7 | 0;
+ while ((i1 | 0) < (i7 | 0)) {
+ HEAP8[i1] = i4;
+ i1 = i1 + 1 | 0;
+ }
+ }
+ while ((i1 | 0) < (i5 | 0)) {
+ HEAP32[i1 >> 2] = i6;
+ i1 = i1 + 4 | 0;
+ }
+ }
+ while ((i1 | 0) < (i2 | 0)) {
+ HEAP8[i1] = i4;
+ i1 = i1 + 1 | 0;
+ }
+ return i1 - i3 | 0;
+}
+function _luaD_growstack(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = HEAP32[i1 + 32 >> 2] | 0;
+ if ((i4 | 0) > 1e6) {
+ _luaD_throw(i1, 6);
+ }
+ i3 = i3 + 5 + ((HEAP32[i1 + 8 >> 2] | 0) - (HEAP32[i1 + 28 >> 2] | 0) >> 4) | 0;
+ i4 = i4 << 1;
+ i4 = (i4 | 0) > 1e6 ? 1e6 : i4;
+ i3 = (i4 | 0) < (i3 | 0) ? i3 : i4;
+ if ((i3 | 0) > 1e6) {
+ _luaD_reallocstack(i1, 1000200);
+ _luaG_runerror(i1, 2224, i2);
+ } else {
+ _luaD_reallocstack(i1, i3);
+ STACKTOP = i2;
+ return;
+ }
+}
+function _luaL_callmeta(i1, i4, i3) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ i4 = _lua_absindex(i1, i4) | 0;
+ if ((_lua_getmetatable(i1, i4) | 0) == 0) {
+ i4 = 0;
+ STACKTOP = i2;
+ return i4 | 0;
+ }
+ _lua_pushstring(i1, i3) | 0;
+ _lua_rawget(i1, -2);
+ if ((_lua_type(i1, -1) | 0) == 0) {
+ _lua_settop(i1, -3);
+ i4 = 0;
+ STACKTOP = i2;
+ return i4 | 0;
+ } else {
+ _lua_remove(i1, -2);
+ _lua_pushvalue(i1, i4);
+ _lua_callk(i1, 1, 1, 0, 0);
+ i4 = 1;
+ STACKTOP = i2;
+ return i4 | 0;
+ }
+ return 0;
+}
+function _luaK_reserveregs(i8, i7) {
+ i8 = i8 | 0;
+ i7 = i7 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i3 = STACKTOP;
+ i2 = i8 + 48 | 0;
+ i6 = HEAP8[i2] | 0;
+ i4 = (i6 & 255) + i7 | 0;
+ i5 = (HEAP32[i8 >> 2] | 0) + 78 | 0;
+ do {
+ if ((i4 | 0) > (HEAPU8[i5] | 0 | 0)) {
+ if ((i4 | 0) > 249) {
+ _luaX_syntaxerror(HEAP32[i8 + 12 >> 2] | 0, 10536);
+ } else {
+ HEAP8[i5] = i4;
+ i1 = HEAP8[i2] | 0;
+ break;
+ }
+ } else {
+ i1 = i6;
+ }
+ } while (0);
+ HEAP8[i2] = (i1 & 255) + i7;
+ STACKTOP = i3;
+ return;
+}
+function _aux_lines(i1, i5) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i6 = 0;
+ i4 = STACKTOP;
+ i3 = _lua_gettop(i1) | 0;
+ i2 = i3 + -1 | 0;
+ if ((i3 | 0) >= 19) {
+ _luaL_argerror(i1, 17, 3320) | 0;
+ }
+ _lua_pushvalue(i1, 1);
+ _lua_pushinteger(i1, i2);
+ _lua_pushboolean(i1, i5);
+ if ((i3 | 0) >= 2) {
+ i5 = 1;
+ while (1) {
+ i6 = i5 + 1 | 0;
+ _lua_pushvalue(i1, i6);
+ if ((i5 | 0) < (i2 | 0)) {
+ i5 = i6;
+ } else {
+ break;
+ }
+ }
+ }
+ _lua_pushcclosure(i1, 155, i3 + 2 | 0);
+ STACKTOP = i4;
+ return;
+}
+function _memcmp(i2, i4, i3) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ var i1 = 0, i5 = 0, i6 = 0;
+ i1 = STACKTOP;
+ L1 : do {
+ if ((i3 | 0) == 0) {
+ i2 = 0;
+ } else {
+ while (1) {
+ i6 = HEAP8[i2] | 0;
+ i5 = HEAP8[i4] | 0;
+ if (!(i6 << 24 >> 24 == i5 << 24 >> 24)) {
+ break;
+ }
+ i3 = i3 + -1 | 0;
+ if ((i3 | 0) == 0) {
+ i2 = 0;
+ break L1;
+ } else {
+ i2 = i2 + 1 | 0;
+ i4 = i4 + 1 | 0;
+ }
+ }
+ i2 = (i6 & 255) - (i5 & 255) | 0;
+ }
+ } while (0);
+ STACKTOP = i1;
+ return i2 | 0;
+}
+function _b_arshift(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0;
+ i2 = STACKTOP;
+ i3 = _luaL_checkunsigned(i1, 1) | 0;
+ i4 = _luaL_checkinteger(i1, 2) | 0;
+ if ((i4 | 0) > -1 & (i3 | 0) < 0) {
+ if ((i4 | 0) > 31) {
+ i3 = -1;
+ } else {
+ i3 = i3 >>> i4 | ~(-1 >>> i4);
+ }
+ _lua_pushunsigned(i1, i3);
+ STACKTOP = i2;
+ return 1;
+ }
+ i5 = 0 - i4 | 0;
+ if ((i4 | 0) > 0) {
+ i3 = (i4 | 0) > 31 ? 0 : i3 >>> i4;
+ } else {
+ i3 = (i5 | 0) > 31 ? 0 : i3 << i5;
+ }
+ _lua_pushunsigned(i1, i3);
+ STACKTOP = i2;
+ return 1;
+}
+function _luaL_checkunsigned(i1, i5) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i6 = 0, i7 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i3;
+ i6 = i3 + 8 | 0;
+ i2 = _lua_tounsignedx(i1, i5, i6) | 0;
+ if ((HEAP32[i6 >> 2] | 0) != 0) {
+ STACKTOP = i3;
+ return i2 | 0;
+ }
+ i7 = _lua_typename(i1, 3) | 0;
+ i6 = _lua_typename(i1, _lua_type(i1, i5) | 0) | 0;
+ HEAP32[i4 >> 2] = i7;
+ HEAP32[i4 + 4 >> 2] = i6;
+ _luaL_argerror(i1, i5, _lua_pushfstring(i1, 1744, i4) | 0) | 0;
+ STACKTOP = i3;
+ return i2 | 0;
+}
+function _luaB_loadfile(i2) {
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i1 = STACKTOP;
+ i4 = _luaL_optlstring(i2, 1, 0, 0) | 0;
+ i5 = _luaL_optlstring(i2, 2, 0, 0) | 0;
+ i3 = (_lua_type(i2, 3) | 0) != -1;
+ i6 = i3 ? 3 : 0;
+ if ((_luaL_loadfilex(i2, i4, i5) | 0) == 0) {
+ if (i3 ? (_lua_pushvalue(i2, i6), (_lua_setupvalue(i2, -2, 1) | 0) == 0) : 0) {
+ _lua_settop(i2, -2);
+ i2 = 1;
+ } else {
+ i2 = 1;
+ }
+ } else {
+ _lua_pushnil(i2);
+ _lua_insert(i2, -2);
+ i2 = 2;
+ }
+ STACKTOP = i1;
+ return i2 | 0;
+}
+function _luaL_checkinteger(i1, i5) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i6 = 0, i7 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i3;
+ i6 = i3 + 8 | 0;
+ i2 = _lua_tointegerx(i1, i5, i6) | 0;
+ if ((HEAP32[i6 >> 2] | 0) != 0) {
+ STACKTOP = i3;
+ return i2 | 0;
+ }
+ i7 = _lua_typename(i1, 3) | 0;
+ i6 = _lua_typename(i1, _lua_type(i1, i5) | 0) | 0;
+ HEAP32[i4 >> 2] = i7;
+ HEAP32[i4 + 4 >> 2] = i6;
+ _luaL_argerror(i1, i5, _lua_pushfstring(i1, 1744, i4) | 0) | 0;
+ STACKTOP = i3;
+ return i2 | 0;
+}
+function _luaB_select(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i3 = STACKTOP;
+ i2 = _lua_gettop(i1) | 0;
+ if ((_lua_type(i1, 1) | 0) == 4 ? (HEAP8[_lua_tolstring(i1, 1, 0) | 0] | 0) == 35 : 0) {
+ _lua_pushinteger(i1, i2 + -1 | 0);
+ i4 = 1;
+ STACKTOP = i3;
+ return i4 | 0;
+ }
+ i4 = _luaL_checkinteger(i1, 1) | 0;
+ if ((i4 | 0) < 0) {
+ i4 = i4 + i2 | 0;
+ } else {
+ i4 = (i4 | 0) > (i2 | 0) ? i2 : i4;
+ }
+ if ((i4 | 0) <= 0) {
+ _luaL_argerror(i1, 1, 9760) | 0;
+ }
+ i4 = i2 - i4 | 0;
+ STACKTOP = i3;
+ return i4 | 0;
+}
+function _luaX_next(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ HEAP32[i1 + 8 >> 2] = HEAP32[i1 + 4 >> 2];
+ i3 = i1 + 32 | 0;
+ if ((HEAP32[i3 >> 2] | 0) == 286) {
+ HEAP32[i1 + 16 >> 2] = _llex(i1, i1 + 24 | 0) | 0;
+ STACKTOP = i2;
+ return;
+ } else {
+ i1 = i1 + 16 | 0;
+ HEAP32[i1 + 0 >> 2] = HEAP32[i3 + 0 >> 2];
+ HEAP32[i1 + 4 >> 2] = HEAP32[i3 + 4 >> 2];
+ HEAP32[i1 + 8 >> 2] = HEAP32[i3 + 8 >> 2];
+ HEAP32[i1 + 12 >> 2] = HEAP32[i3 + 12 >> 2];
+ HEAP32[i3 >> 2] = 286;
+ STACKTOP = i2;
+ return;
+ }
+}
+function _lua_setglobal(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i3 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i3 = STACKTOP;
+ i5 = _luaH_getint(HEAP32[(HEAP32[i1 + 12 >> 2] | 0) + 40 >> 2] | 0, 2) | 0;
+ i4 = i1 + 8 | 0;
+ i6 = HEAP32[i4 >> 2] | 0;
+ HEAP32[i4 >> 2] = i6 + 16;
+ i2 = _luaS_new(i1, i2) | 0;
+ HEAP32[i6 >> 2] = i2;
+ HEAP32[i6 + 8 >> 2] = HEAPU8[i2 + 4 | 0] | 0 | 64;
+ i2 = HEAP32[i4 >> 2] | 0;
+ _luaV_settable(i1, i5, i2 + -16 | 0, i2 + -32 | 0);
+ HEAP32[i4 >> 2] = (HEAP32[i4 >> 2] | 0) + -32;
+ STACKTOP = i3;
+ return;
+}
+function _luaL_checknumber(i1, i5) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ var d2 = 0.0, i3 = 0, i4 = 0, i6 = 0, i7 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i3;
+ i6 = i3 + 8 | 0;
+ d2 = +_lua_tonumberx(i1, i5, i6);
+ if ((HEAP32[i6 >> 2] | 0) != 0) {
+ STACKTOP = i3;
+ return +d2;
+ }
+ i7 = _lua_typename(i1, 3) | 0;
+ i6 = _lua_typename(i1, _lua_type(i1, i5) | 0) | 0;
+ HEAP32[i4 >> 2] = i7;
+ HEAP32[i4 + 4 >> 2] = i6;
+ _luaL_argerror(i1, i5, _lua_pushfstring(i1, 1744, i4) | 0) | 0;
+ STACKTOP = i3;
+ return +d2;
+}
+function _luaZ_fill(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i2;
+ i3 = FUNCTION_TABLE_iiii[HEAP32[i1 + 8 >> 2] & 3](HEAP32[i1 + 16 >> 2] | 0, HEAP32[i1 + 12 >> 2] | 0, i4) | 0;
+ if ((i3 | 0) == 0) {
+ i4 = -1;
+ STACKTOP = i2;
+ return i4 | 0;
+ }
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((i4 | 0) == 0) {
+ i4 = -1;
+ STACKTOP = i2;
+ return i4 | 0;
+ }
+ HEAP32[i1 >> 2] = i4 + -1;
+ HEAP32[i1 + 4 >> 2] = i3 + 1;
+ i4 = HEAPU8[i3] | 0;
+ STACKTOP = i2;
+ return i4 | 0;
+}
+function _lua_createtable(i1, i3, i4) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ var i2 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i2 = STACKTOP;
+ if ((HEAP32[(HEAP32[i1 + 12 >> 2] | 0) + 12 >> 2] | 0) > 0) {
+ _luaC_step(i1);
+ }
+ i5 = _luaH_new(i1) | 0;
+ i6 = i1 + 8 | 0;
+ i7 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i7 >> 2] = i5;
+ HEAP32[i7 + 8 >> 2] = 69;
+ HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + 16;
+ if (!((i3 | 0) > 0 | (i4 | 0) > 0)) {
+ STACKTOP = i2;
+ return;
+ }
+ _luaH_resize(i1, i5, i3, i4);
+ STACKTOP = i2;
+ return;
+}
+function _generic_reader(i1, i3, i2) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ _luaL_checkstack(i1, 2, 9888);
+ _lua_pushvalue(i1, 1);
+ _lua_callk(i1, 0, 1, 0, 0);
+ if ((_lua_type(i1, -1) | 0) == 0) {
+ _lua_settop(i1, -2);
+ HEAP32[i2 >> 2] = 0;
+ i2 = 0;
+ STACKTOP = i3;
+ return i2 | 0;
+ }
+ if ((_lua_isstring(i1, -1) | 0) == 0) {
+ _luaL_error(i1, 9920, i3) | 0;
+ }
+ _lua_replace(i1, 5);
+ i2 = _lua_tolstring(i1, 5, i2) | 0;
+ STACKTOP = i3;
+ return i2 | 0;
+}
+function _luaZ_openspace(i5, i1, i6) {
+ i5 = i5 | 0;
+ i1 = i1 | 0;
+ i6 = i6 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ i4 = i1 + 8 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ if (!(i3 >>> 0 < i6 >>> 0)) {
+ i6 = HEAP32[i1 >> 2] | 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ i6 = i6 >>> 0 < 32 ? 32 : i6;
+ if ((i6 + 1 | 0) >>> 0 > 4294967293) {
+ _luaM_toobig(i5);
+ }
+ i5 = _luaM_realloc_(i5, HEAP32[i1 >> 2] | 0, i3, i6) | 0;
+ HEAP32[i1 >> 2] = i5;
+ HEAP32[i4 >> 2] = i6;
+ i6 = i5;
+ STACKTOP = i2;
+ return i6 | 0;
+}
+function _luaH_getstr(i4, i3) {
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ var i1 = 0, i2 = 0;
+ i2 = STACKTOP;
+ i4 = (HEAP32[i4 + 16 >> 2] | 0) + (((1 << (HEAPU8[i4 + 7 | 0] | 0)) + -1 & HEAP32[i3 + 8 >> 2]) << 5) | 0;
+ while (1) {
+ if ((HEAP32[i4 + 24 >> 2] | 0) == 68 ? (HEAP32[i4 + 16 >> 2] | 0) == (i3 | 0) : 0) {
+ break;
+ }
+ i4 = HEAP32[i4 + 28 >> 2] | 0;
+ if ((i4 | 0) == 0) {
+ i3 = 5192;
+ i1 = 6;
+ break;
+ }
+ }
+ if ((i1 | 0) == 6) {
+ STACKTOP = i2;
+ return i3 | 0;
+ }
+ STACKTOP = i2;
+ return i4 | 0;
+}
+function _b_extract(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0;
+ i5 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i2 = _luaL_checkunsigned(i1, 1) | 0;
+ i3 = _luaL_checkinteger(i1, 2) | 0;
+ i4 = _luaL_optinteger(i1, 3, 1) | 0;
+ if (!((i3 | 0) > -1)) {
+ _luaL_argerror(i1, 2, 10440) | 0;
+ }
+ if ((i4 | 0) <= 0) {
+ _luaL_argerror(i1, 3, 10472) | 0;
+ }
+ if ((i4 + i3 | 0) > 32) {
+ _luaL_error(i1, 10496, i5) | 0;
+ }
+ _lua_pushunsigned(i1, i2 >>> i3 & ~(-2 << i4 + -1));
+ STACKTOP = i5;
+ return 1;
+}
+function _luaL_checklstring(i1, i4, i5) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i6 = 0, i7 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i2;
+ i5 = _lua_tolstring(i1, i4, i5) | 0;
+ if ((i5 | 0) != 0) {
+ STACKTOP = i2;
+ return i5 | 0;
+ }
+ i7 = _lua_typename(i1, 4) | 0;
+ i6 = _lua_typename(i1, _lua_type(i1, i4) | 0) | 0;
+ HEAP32[i3 >> 2] = i7;
+ HEAP32[i3 + 4 >> 2] = i6;
+ _luaL_argerror(i1, i4, _lua_pushfstring(i1, 1744, i3) | 0) | 0;
+ STACKTOP = i2;
+ return i5 | 0;
+}
+function _db_traceback(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i2 = STACKTOP;
+ if ((_lua_type(i1, 1) | 0) == 8) {
+ i3 = _lua_tothread(i1, 1) | 0;
+ i4 = 1;
+ } else {
+ i3 = i1;
+ i4 = 0;
+ }
+ i5 = i4 + 1 | 0;
+ i6 = _lua_tolstring(i1, i5, 0) | 0;
+ if ((i6 | 0) == 0 ? (_lua_type(i1, i5) | 0) >= 1 : 0) {
+ _lua_pushvalue(i1, i5);
+ STACKTOP = i2;
+ return 1;
+ }
+ _luaL_traceback(i1, i3, i6, _luaL_optinteger(i1, i4 | 2, (i3 | 0) == (i1 | 0) | 0) | 0);
+ STACKTOP = i2;
+ return 1;
+}
+function _f_setvbuf(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = _luaL_checkudata(i1, 1, 2832) | 0;
+ if ((HEAP32[i3 + 4 >> 2] | 0) == 0) {
+ _luaL_error(i1, 3080, i2) | 0;
+ }
+ i5 = HEAP32[i3 >> 2] | 0;
+ i4 = _luaL_checkoption(i1, 2, 0, 3128) | 0;
+ i3 = _luaL_optinteger(i1, 3, 1024) | 0;
+ i3 = _luaL_fileresult(i1, (_setvbuf(i5 | 0, 0, HEAP32[3112 + (i4 << 2) >> 2] | 0, i3 | 0) | 0) == 0 | 0, 0) | 0;
+ STACKTOP = i2;
+ return i3 | 0;
+}
+function _luaU_dump(i3, i1, i4, i2, i5) {
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i2 = i2 | 0;
+ i5 = i5 | 0;
+ var i6 = 0, i7 = 0, i8 = 0;
+ i6 = STACKTOP;
+ STACKTOP = STACKTOP + 48 | 0;
+ i8 = i6 + 20 | 0;
+ i7 = i6;
+ HEAP32[i7 >> 2] = i3;
+ HEAP32[i7 + 4 >> 2] = i4;
+ HEAP32[i7 + 8 >> 2] = i2;
+ HEAP32[i7 + 12 >> 2] = i5;
+ i5 = i7 + 16 | 0;
+ _luaU_header(i8);
+ HEAP32[i5 >> 2] = FUNCTION_TABLE_iiiii[i4 & 3](i3, i8, 18, i2) | 0;
+ _DumpFunction(i1, i7);
+ STACKTOP = i6;
+ return HEAP32[i5 >> 2] | 0;
+}
+function _luaB_setmetatable(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = _lua_type(i1, 2) | 0;
+ _luaL_checktype(i1, 1, 5);
+ if (!((i3 | 0) == 0 | (i3 | 0) == 5)) {
+ _luaL_argerror(i1, 2, 9680) | 0;
+ }
+ if ((_luaL_getmetafield(i1, 1, 9704) | 0) == 0) {
+ _lua_settop(i1, 2);
+ _lua_setmetatable(i1, 1) | 0;
+ i3 = 1;
+ STACKTOP = i2;
+ return i3 | 0;
+ } else {
+ i3 = _luaL_error(i1, 9720, i2) | 0;
+ STACKTOP = i2;
+ return i3 | 0;
+ }
+ return 0;
+}
+function _getF(i3, i2, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i4 = 0;
+ i3 = STACKTOP;
+ i4 = HEAP32[i2 >> 2] | 0;
+ if ((i4 | 0) > 0) {
+ HEAP32[i1 >> 2] = i4;
+ HEAP32[i2 >> 2] = 0;
+ i4 = i2 + 8 | 0;
+ STACKTOP = i3;
+ return i4 | 0;
+ }
+ i4 = i2 + 4 | 0;
+ if ((_feof(HEAP32[i4 >> 2] | 0) | 0) != 0) {
+ i4 = 0;
+ STACKTOP = i3;
+ return i4 | 0;
+ }
+ i2 = i2 + 8 | 0;
+ HEAP32[i1 >> 2] = _fread(i2 | 0, 1, 1024, HEAP32[i4 >> 2] | 0) | 0;
+ i4 = i2;
+ STACKTOP = i3;
+ return i4 | 0;
+}
+function _luaL_where(i1, i6) {
+ i1 = i1 | 0;
+ i6 = i6 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0;
+ i4 = STACKTOP;
+ STACKTOP = STACKTOP + 112 | 0;
+ i3 = i4;
+ i2 = i4 + 8 | 0;
+ if ((_lua_getstack(i1, i6, i2) | 0) != 0 ? (_lua_getinfo(i1, 1152, i2) | 0, i5 = HEAP32[i2 + 20 >> 2] | 0, (i5 | 0) > 0) : 0) {
+ HEAP32[i3 >> 2] = i2 + 36;
+ HEAP32[i3 + 4 >> 2] = i5;
+ _lua_pushfstring(i1, 1160, i3) | 0;
+ STACKTOP = i4;
+ return;
+ }
+ _lua_pushlstring(i1, 1168, 0) | 0;
+ STACKTOP = i4;
+ return;
+}
+function _hookf(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _luaL_getsubtable(i1, -1001e3, 11584) | 0;
+ _lua_pushthread(i1) | 0;
+ _lua_rawget(i1, -2);
+ if ((_lua_type(i1, -1) | 0) != 6) {
+ STACKTOP = i2;
+ return;
+ }
+ _lua_pushstring(i1, HEAP32[11608 + (HEAP32[i3 >> 2] << 2) >> 2] | 0) | 0;
+ i3 = HEAP32[i3 + 20 >> 2] | 0;
+ if ((i3 | 0) > -1) {
+ _lua_pushinteger(i1, i3);
+ } else {
+ _lua_pushnil(i1);
+ }
+ _lua_callk(i1, 2, 0, 0, 0);
+ STACKTOP = i2;
+ return;
+}
+function _luaV_tonumber(i5, i2) {
+ i5 = i5 | 0;
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0, i4 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i1;
+ i4 = HEAP32[i5 + 8 >> 2] | 0;
+ if ((i4 | 0) != 3) {
+ if ((i4 & 15 | 0) == 4 ? (i5 = HEAP32[i5 >> 2] | 0, (_luaO_str2d(i5 + 16 | 0, HEAP32[i5 + 12 >> 2] | 0, i3) | 0) != 0) : 0) {
+ HEAPF64[i2 >> 3] = +HEAPF64[i3 >> 3];
+ HEAP32[i2 + 8 >> 2] = 3;
+ } else {
+ i2 = 0;
+ }
+ } else {
+ i2 = i5;
+ }
+ STACKTOP = i1;
+ return i2 | 0;
+}
+function _luaO_arith(i3, d1, d2) {
+ i3 = i3 | 0;
+ d1 = +d1;
+ d2 = +d2;
+ switch (i3 | 0) {
+ case 4:
+ {
+ d1 = d1 - +Math_floor(+(d1 / d2)) * d2;
+ break;
+ }
+ case 6:
+ {
+ d1 = -d1;
+ break;
+ }
+ case 0:
+ {
+ d1 = d1 + d2;
+ break;
+ }
+ case 1:
+ {
+ d1 = d1 - d2;
+ break;
+ }
+ case 5:
+ {
+ d1 = +Math_pow(+d1, +d2);
+ break;
+ }
+ case 3:
+ {
+ d1 = d1 / d2;
+ break;
+ }
+ case 2:
+ {
+ d1 = d1 * d2;
+ break;
+ }
+ default:
+ {
+ d1 = 0.0;
+ }
+ }
+ return +d1;
+}
+function _luaB_coresume(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = _lua_tothread(i1, 1) | 0;
+ if ((i3 | 0) == 0) {
+ _luaL_argerror(i1, 1, 10856) | 0;
+ }
+ i3 = _auxresume(i1, i3, (_lua_gettop(i1) | 0) + -1 | 0) | 0;
+ if ((i3 | 0) < 0) {
+ _lua_pushboolean(i1, 0);
+ _lua_insert(i1, -2);
+ i3 = 2;
+ STACKTOP = i2;
+ return i3 | 0;
+ } else {
+ _lua_pushboolean(i1, 1);
+ _lua_insert(i1, ~i3);
+ i3 = i3 + 1 | 0;
+ STACKTOP = i2;
+ return i3 | 0;
+ }
+ return 0;
+}
+function _pairsmeta(i1, i5, i4, i3) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ if ((_luaL_getmetafield(i1, 1, i5) | 0) != 0) {
+ _lua_pushvalue(i1, 1);
+ _lua_callk(i1, 1, 3, 0, 0);
+ STACKTOP = i2;
+ return;
+ }
+ _luaL_checktype(i1, 1, 5);
+ _lua_pushcclosure(i1, i3, 0);
+ _lua_pushvalue(i1, 1);
+ if ((i4 | 0) == 0) {
+ _lua_pushnil(i1);
+ STACKTOP = i2;
+ return;
+ } else {
+ _lua_pushinteger(i1, 0);
+ STACKTOP = i2;
+ return;
+ }
+}
+function _io_close(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ if ((_lua_type(i1, 1) | 0) == -1) {
+ _lua_getfield(i1, -1001e3, 2800);
+ }
+ if ((HEAP32[(_luaL_checkudata(i1, 1, 2832) | 0) + 4 >> 2] | 0) == 0) {
+ _luaL_error(i1, 3080, i2) | 0;
+ }
+ i4 = (_luaL_checkudata(i1, 1, 2832) | 0) + 4 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ HEAP32[i4 >> 2] = 0;
+ i1 = FUNCTION_TABLE_ii[i3 & 255](i1) | 0;
+ STACKTOP = i2;
+ return i1 | 0;
+}
+function _pack(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = _lua_gettop(i1) | 0;
+ _lua_createtable(i1, i3, 1);
+ _lua_pushinteger(i1, i3);
+ _lua_setfield(i1, -2, 8312);
+ if ((i3 | 0) <= 0) {
+ STACKTOP = i2;
+ return 1;
+ }
+ _lua_pushvalue(i1, 1);
+ _lua_rawseti(i1, -2, 1);
+ _lua_replace(i1, 1);
+ if ((i3 | 0) <= 1) {
+ STACKTOP = i2;
+ return 1;
+ }
+ do {
+ _lua_rawseti(i1, 1, i3);
+ i3 = i3 + -1 | 0;
+ } while ((i3 | 0) > 1);
+ STACKTOP = i2;
+ return 1;
+}
+function _luaL_execresult(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ if ((i3 | 0) == -1) {
+ i3 = HEAP32[(___errno_location() | 0) >> 2] | 0;
+ _lua_pushnil(i1);
+ _lua_pushstring(i1, _strerror(i3 | 0) | 0) | 0;
+ _lua_pushinteger(i1, i3);
+ STACKTOP = i2;
+ return 3;
+ } else if ((i3 | 0) == 0) {
+ _lua_pushboolean(i1, 1);
+ } else {
+ _lua_pushnil(i1);
+ }
+ _lua_pushstring(i1, 1184) | 0;
+ _lua_pushinteger(i1, i3);
+ STACKTOP = i2;
+ return 3;
+}
+function _lua_getglobal(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i3 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i3 = STACKTOP;
+ i4 = _luaH_getint(HEAP32[(HEAP32[i1 + 12 >> 2] | 0) + 40 >> 2] | 0, 2) | 0;
+ i5 = i1 + 8 | 0;
+ i6 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = i6 + 16;
+ i2 = _luaS_new(i1, i2) | 0;
+ HEAP32[i6 >> 2] = i2;
+ HEAP32[i6 + 8 >> 2] = HEAPU8[i2 + 4 | 0] | 0 | 64;
+ i2 = (HEAP32[i5 >> 2] | 0) + -16 | 0;
+ _luaV_gettable(i1, i4, i2, i2);
+ STACKTOP = i3;
+ return;
+}
+function _luaL_checktype(i1, i5, i4) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ var i2 = 0, i3 = 0, i6 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i2;
+ if ((_lua_type(i1, i5) | 0) == (i4 | 0)) {
+ STACKTOP = i2;
+ return;
+ }
+ i6 = _lua_typename(i1, i4) | 0;
+ i4 = _lua_typename(i1, _lua_type(i1, i5) | 0) | 0;
+ HEAP32[i3 >> 2] = i6;
+ HEAP32[i3 + 4 >> 2] = i4;
+ _luaL_argerror(i1, i5, _lua_pushfstring(i1, 1744, i3) | 0) | 0;
+ STACKTOP = i2;
+ return;
+}
+function _luaC_newobj(i7, i4, i6, i5, i1) {
+ i7 = i7 | 0;
+ i4 = i4 | 0;
+ i6 = i6 | 0;
+ i5 = i5 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = HEAP32[i7 + 12 >> 2] | 0;
+ i7 = _luaM_realloc_(i7, 0, i4 & 15, i6) | 0;
+ i6 = i7 + i1 | 0;
+ i5 = (i5 | 0) == 0 ? i3 + 68 | 0 : i5;
+ HEAP8[i7 + (i1 + 5) | 0] = HEAP8[i3 + 60 | 0] & 3;
+ HEAP8[i7 + (i1 + 4) | 0] = i4;
+ HEAP32[i6 >> 2] = HEAP32[i5 >> 2];
+ HEAP32[i5 >> 2] = i6;
+ STACKTOP = i2;
+ return i6 | 0;
+}
+function _luaL_requiref(i1, i3, i5, i4) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_pushcclosure(i1, i5, 0);
+ _lua_pushstring(i1, i3) | 0;
+ _lua_callk(i1, 1, 1, 0, 0);
+ _luaL_getsubtable(i1, -1001e3, 1432) | 0;
+ _lua_pushvalue(i1, -2);
+ _lua_setfield(i1, -2, i3);
+ _lua_settop(i1, -2);
+ if ((i4 | 0) == 0) {
+ STACKTOP = i2;
+ return;
+ }
+ _lua_pushvalue(i1, -1);
+ _lua_setglobal(i1, i3);
+ STACKTOP = i2;
+ return;
+}
+function _luaG_ordererror(i1, i3, i4) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = HEAP32[8528 + ((HEAP32[i3 + 8 >> 2] & 15) + 1 << 2) >> 2] | 0;
+ i4 = HEAP32[8528 + ((HEAP32[i4 + 8 >> 2] & 15) + 1 << 2) >> 2] | 0;
+ if ((i3 | 0) == (i4 | 0)) {
+ HEAP32[i2 >> 2] = i3;
+ _luaG_runerror(i1, 1952, i2);
+ } else {
+ HEAP32[i2 >> 2] = i3;
+ HEAP32[i2 + 4 >> 2] = i4;
+ _luaG_runerror(i1, 1992, i2);
+ }
+}
+function _io_popen(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = _luaL_checklstring(i1, 1, 0) | 0;
+ _luaL_optlstring(i1, 2, 3480, 0) | 0;
+ i5 = _lua_newuserdata(i1, 8) | 0;
+ i4 = i5 + 4 | 0;
+ HEAP32[i4 >> 2] = 0;
+ _luaL_setmetatable(i1, 2832);
+ _luaL_error(i1, 3488, i2) | 0;
+ HEAP32[i5 >> 2] = 0;
+ HEAP32[i4 >> 2] = 157;
+ i1 = _luaL_fileresult(i1, 0, i3) | 0;
+ STACKTOP = i2;
+ return i1 | 0;
+}
+function _sort_comp(i1, i3, i4) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ if ((_lua_type(i1, 2) | 0) == 0) {
+ i4 = _lua_compare(i1, i3, i4, 1) | 0;
+ STACKTOP = i2;
+ return i4 | 0;
+ } else {
+ _lua_pushvalue(i1, 2);
+ _lua_pushvalue(i1, i3 + -1 | 0);
+ _lua_pushvalue(i1, i4 + -2 | 0);
+ _lua_callk(i1, 2, 1, 0, 0);
+ i4 = _lua_toboolean(i1, -1) | 0;
+ _lua_settop(i1, -2);
+ STACKTOP = i2;
+ return i4 | 0;
+ }
+ return 0;
+}
+function _db_upvalueid(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 112 | 0;
+ i4 = i3;
+ i2 = _luaL_checkinteger(i1, 2) | 0;
+ _luaL_checktype(i1, 1, 6);
+ _lua_pushvalue(i1, 1);
+ _lua_getinfo(i1, 11728, i4) | 0;
+ if (!((i2 | 0) > 0 ? (i2 | 0) <= (HEAPU8[i4 + 32 | 0] | 0 | 0) : 0)) {
+ _luaL_argerror(i1, 2, 11736) | 0;
+ }
+ _lua_pushlightuserdata(i1, _lua_upvalueid(i1, 1, i2) | 0);
+ STACKTOP = i3;
+ return 1;
+}
+function _luaL_getmetafield(i2, i4, i3) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ var i1 = 0;
+ i1 = STACKTOP;
+ do {
+ if ((_lua_getmetatable(i2, i4) | 0) != 0) {
+ _lua_pushstring(i2, i3) | 0;
+ _lua_rawget(i2, -2);
+ if ((_lua_type(i2, -1) | 0) == 0) {
+ _lua_settop(i2, -3);
+ i2 = 0;
+ break;
+ } else {
+ _lua_remove(i2, -2);
+ i2 = 1;
+ break;
+ }
+ } else {
+ i2 = 0;
+ }
+ } while (0);
+ STACKTOP = i1;
+ return i2 | 0;
+}
+function _luaF_freeupval(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0, i5 = 0;
+ i2 = STACKTOP;
+ if ((HEAP32[i3 + 8 >> 2] | 0) == (i3 + 16 | 0)) {
+ _luaM_realloc_(i1, i3, 32, 0) | 0;
+ STACKTOP = i2;
+ return;
+ }
+ i4 = i3 + 16 | 0;
+ i5 = i4 + 4 | 0;
+ HEAP32[(HEAP32[i5 >> 2] | 0) + 16 >> 2] = HEAP32[i4 >> 2];
+ HEAP32[(HEAP32[i4 >> 2] | 0) + 20 >> 2] = HEAP32[i5 >> 2];
+ _luaM_realloc_(i1, i3, 32, 0) | 0;
+ STACKTOP = i2;
+ return;
+}
+function _luaL_addvalue(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i2;
+ i5 = HEAP32[i1 + 12 >> 2] | 0;
+ i3 = _lua_tolstring(i5, -1, i4) | 0;
+ i6 = i1 + 16 | 0;
+ if ((HEAP32[i1 >> 2] | 0) != (i6 | 0)) {
+ _lua_insert(i5, -2);
+ }
+ _luaL_addlstring(i1, i3, HEAP32[i4 >> 2] | 0);
+ _lua_remove(i5, (HEAP32[i1 >> 2] | 0) != (i6 | 0) ? -2 : -1);
+ STACKTOP = i2;
+ return;
+}
+function _escerror(i1, i4, i3, i2) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ var i5 = 0, i6 = 0;
+ HEAP32[(HEAP32[i1 + 60 >> 2] | 0) + 4 >> 2] = 0;
+ _save(i1, 92);
+ L1 : do {
+ if ((i3 | 0) > 0) {
+ i5 = 0;
+ do {
+ i6 = HEAP32[i4 + (i5 << 2) >> 2] | 0;
+ if ((i6 | 0) == -1) {
+ break L1;
+ }
+ _save(i1, i6);
+ i5 = i5 + 1 | 0;
+ } while ((i5 | 0) < (i3 | 0));
+ }
+ } while (0);
+ _lexerror(i1, i2, 289);
+}
+function _pushglobalfuncname(i1, i4) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = _lua_gettop(i1) | 0;
+ _lua_getinfo(i1, 1768, i4) | 0;
+ _lua_rawgeti(i1, -1001e3, 2);
+ i4 = i3 + 1 | 0;
+ if ((_findfield(i1, i4, 2) | 0) == 0) {
+ _lua_settop(i1, i3);
+ i4 = 0;
+ STACKTOP = i2;
+ return i4 | 0;
+ } else {
+ _lua_copy(i1, -1, i4);
+ _lua_settop(i1, -3);
+ i4 = 1;
+ STACKTOP = i2;
+ return i4 | 0;
+ }
+ return 0;
+}
+function copyTempDouble(i1) {
+ i1 = i1 | 0;
+ HEAP8[tempDoublePtr] = HEAP8[i1];
+ HEAP8[tempDoublePtr + 1 | 0] = HEAP8[i1 + 1 | 0];
+ HEAP8[tempDoublePtr + 2 | 0] = HEAP8[i1 + 2 | 0];
+ HEAP8[tempDoublePtr + 3 | 0] = HEAP8[i1 + 3 | 0];
+ HEAP8[tempDoublePtr + 4 | 0] = HEAP8[i1 + 4 | 0];
+ HEAP8[tempDoublePtr + 5 | 0] = HEAP8[i1 + 5 | 0];
+ HEAP8[tempDoublePtr + 6 | 0] = HEAP8[i1 + 6 | 0];
+ HEAP8[tempDoublePtr + 7 | 0] = HEAP8[i1 + 7 | 0];
+}
+function _lua_pushlstring(i1, i3, i4) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ if ((HEAP32[(HEAP32[i1 + 12 >> 2] | 0) + 12 >> 2] | 0) > 0) {
+ _luaC_step(i1);
+ }
+ i4 = _luaS_newlstr(i1, i3, i4) | 0;
+ i3 = i1 + 8 | 0;
+ i1 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i1 >> 2] = i4;
+ HEAP32[i1 + 8 >> 2] = HEAPU8[i4 + 4 | 0] | 0 | 64;
+ HEAP32[i3 >> 2] = (HEAP32[i3 >> 2] | 0) + 16;
+ STACKTOP = i2;
+ return i4 + 16 | 0;
+}
+function _ll_searchpath(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0;
+ i2 = STACKTOP;
+ i5 = _luaL_checklstring(i1, 1, 0) | 0;
+ i4 = _luaL_checklstring(i1, 2, 0) | 0;
+ i3 = _luaL_optlstring(i1, 3, 4936, 0) | 0;
+ if ((_searchpath(i1, i5, i4, i3, _luaL_optlstring(i1, 4, 4848, 0) | 0) | 0) != 0) {
+ i5 = 1;
+ STACKTOP = i2;
+ return i5 | 0;
+ }
+ _lua_pushnil(i1);
+ _lua_insert(i1, -2);
+ i5 = 2;
+ STACKTOP = i2;
+ return i5 | 0;
+}
+function _math_log(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, d3 = 0.0, d4 = 0.0;
+ i2 = STACKTOP;
+ d3 = +_luaL_checknumber(i1, 1);
+ do {
+ if ((_lua_type(i1, 2) | 0) >= 1) {
+ d4 = +_luaL_checknumber(i1, 2);
+ if (d4 == 10.0) {
+ d3 = +_log10(+d3);
+ break;
+ } else {
+ d3 = +Math_log(+d3) / +Math_log(+d4);
+ break;
+ }
+ } else {
+ d3 = +Math_log(+d3);
+ }
+ } while (0);
+ _lua_pushnumber(i1, d3);
+ STACKTOP = i2;
+ return 1;
+}
+function _luaT_init(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0;
+ i2 = STACKTOP;
+ i3 = i1 + 12 | 0;
+ i4 = 0;
+ do {
+ i5 = _luaS_new(i1, HEAP32[8576 + (i4 << 2) >> 2] | 0) | 0;
+ HEAP32[(HEAP32[i3 >> 2] | 0) + (i4 << 2) + 184 >> 2] = i5;
+ i5 = (HEAP32[(HEAP32[i3 >> 2] | 0) + (i4 << 2) + 184 >> 2] | 0) + 5 | 0;
+ HEAP8[i5] = HEAPU8[i5] | 0 | 32;
+ i4 = i4 + 1 | 0;
+ } while ((i4 | 0) != 17);
+ STACKTOP = i2;
+ return;
+}
+function _f_gc(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ i3 = _luaL_checkudata(i1, 1, 2832) | 0;
+ if ((HEAP32[i3 + 4 >> 2] | 0) == 0) {
+ STACKTOP = i2;
+ return 0;
+ }
+ if ((HEAP32[i3 >> 2] | 0) == 0) {
+ STACKTOP = i2;
+ return 0;
+ }
+ i4 = (_luaL_checkudata(i1, 1, 2832) | 0) + 4 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ HEAP32[i4 >> 2] = 0;
+ FUNCTION_TABLE_ii[i3 & 255](i1) | 0;
+ STACKTOP = i2;
+ return 0;
+}
+function ___shlim(i1, i5) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i6 = 0;
+ i2 = STACKTOP;
+ HEAP32[i1 + 104 >> 2] = i5;
+ i4 = HEAP32[i1 + 8 >> 2] | 0;
+ i3 = HEAP32[i1 + 4 >> 2] | 0;
+ i6 = i4 - i3 | 0;
+ HEAP32[i1 + 108 >> 2] = i6;
+ if ((i5 | 0) != 0 & (i6 | 0) > (i5 | 0)) {
+ HEAP32[i1 + 100 >> 2] = i3 + i5;
+ STACKTOP = i2;
+ return;
+ } else {
+ HEAP32[i1 + 100 >> 2] = i4;
+ STACKTOP = i2;
+ return;
+ }
+}
+function _lua_sethook(i4, i6, i1, i5) {
+ i4 = i4 | 0;
+ i6 = i6 | 0;
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = (i6 | 0) == 0 | (i1 | 0) == 0;
+ i3 = HEAP32[i4 + 16 >> 2] | 0;
+ if (!((HEAP8[i3 + 18 | 0] & 1) == 0)) {
+ HEAP32[i4 + 20 >> 2] = HEAP32[i3 + 28 >> 2];
+ }
+ HEAP32[i4 + 52 >> 2] = i2 ? 0 : i6;
+ HEAP32[i4 + 44 >> 2] = i5;
+ HEAP32[i4 + 48 >> 2] = i5;
+ HEAP8[i4 + 40 | 0] = i2 ? 0 : i1 & 255;
+ return 1;
+}
+function _io_tmpfile(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ i4 = _lua_newuserdata(i1, 8) | 0;
+ i3 = i4 + 4 | 0;
+ HEAP32[i3 >> 2] = 0;
+ _luaL_setmetatable(i1, 2832);
+ HEAP32[i4 >> 2] = 0;
+ HEAP32[i3 >> 2] = 156;
+ i3 = _tmpfile() | 0;
+ HEAP32[i4 >> 2] = i3;
+ if ((i3 | 0) != 0) {
+ i4 = 1;
+ STACKTOP = i2;
+ return i4 | 0;
+ }
+ i4 = _luaL_fileresult(i1, 0, 0) | 0;
+ STACKTOP = i2;
+ return i4 | 0;
+}
+function _luaL_checkstack(i1, i5, i4) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i2;
+ if ((_lua_checkstack(i1, i5 + 20 | 0) | 0) != 0) {
+ STACKTOP = i2;
+ return;
+ }
+ if ((i4 | 0) == 0) {
+ _luaL_error(i1, 1240, i3) | 0;
+ STACKTOP = i2;
+ return;
+ } else {
+ HEAP32[i3 >> 2] = i4;
+ _luaL_error(i1, 1216, i3) | 0;
+ STACKTOP = i2;
+ return;
+ }
+}
+function _b_rshift(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0;
+ i2 = STACKTOP;
+ i4 = _luaL_checkunsigned(i1, 1) | 0;
+ i3 = _luaL_checkinteger(i1, 2) | 0;
+ i5 = 0 - i3 | 0;
+ if ((i3 | 0) > 0) {
+ i5 = (i3 | 0) > 31 ? 0 : i4 >>> i3;
+ _lua_pushunsigned(i1, i5);
+ STACKTOP = i2;
+ return 1;
+ } else {
+ i5 = (i5 | 0) > 31 ? 0 : i4 << i5;
+ _lua_pushunsigned(i1, i5);
+ STACKTOP = i2;
+ return 1;
+ }
+ return 0;
+}
+function _b_lshift(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ i3 = _luaL_checkunsigned(i1, 1) | 0;
+ i4 = _luaL_checkinteger(i1, 2) | 0;
+ if ((i4 | 0) < 0) {
+ i4 = 0 - i4 | 0;
+ i4 = (i4 | 0) > 31 ? 0 : i3 >>> i4;
+ _lua_pushunsigned(i1, i4);
+ STACKTOP = i2;
+ return 1;
+ } else {
+ i4 = (i4 | 0) > 31 ? 0 : i3 << i4;
+ _lua_pushunsigned(i1, i4);
+ STACKTOP = i2;
+ return 1;
+ }
+ return 0;
+}
+function _math_min(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, d5 = 0.0, d6 = 0.0;
+ i2 = STACKTOP;
+ i3 = _lua_gettop(i1) | 0;
+ d5 = +_luaL_checknumber(i1, 1);
+ if ((i3 | 0) >= 2) {
+ i4 = 2;
+ while (1) {
+ d6 = +_luaL_checknumber(i1, i4);
+ d5 = d6 < d5 ? d6 : d5;
+ if ((i4 | 0) == (i3 | 0)) {
+ break;
+ } else {
+ i4 = i4 + 1 | 0;
+ }
+ }
+ }
+ _lua_pushnumber(i1, d5);
+ STACKTOP = i2;
+ return 1;
+}
+function _math_max(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, d5 = 0.0, d6 = 0.0;
+ i2 = STACKTOP;
+ i3 = _lua_gettop(i1) | 0;
+ d5 = +_luaL_checknumber(i1, 1);
+ if ((i3 | 0) >= 2) {
+ i4 = 2;
+ while (1) {
+ d6 = +_luaL_checknumber(i1, i4);
+ d5 = d6 > d5 ? d6 : d5;
+ if ((i4 | 0) == (i3 | 0)) {
+ break;
+ } else {
+ i4 = i4 + 1 | 0;
+ }
+ }
+ }
+ _lua_pushnumber(i1, d5);
+ STACKTOP = i2;
+ return 1;
+}
+function _io_type(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ _luaL_checkany(i1, 1);
+ i3 = _luaL_testudata(i1, 1, 2832) | 0;
+ if ((i3 | 0) == 0) {
+ _lua_pushnil(i1);
+ STACKTOP = i2;
+ return 1;
+ }
+ if ((HEAP32[i3 + 4 >> 2] | 0) == 0) {
+ _lua_pushlstring(i1, 3456, 11) | 0;
+ STACKTOP = i2;
+ return 1;
+ } else {
+ _lua_pushlstring(i1, 3472, 4) | 0;
+ STACKTOP = i2;
+ return 1;
+ }
+ return 0;
+}
+function _luaF_newLclosure(i3, i2) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ var i1 = 0, i4 = 0;
+ i1 = STACKTOP;
+ i3 = _luaC_newobj(i3, 6, (i2 << 2) + 16 | 0, 0, 0) | 0;
+ HEAP32[i3 + 12 >> 2] = 0;
+ HEAP8[i3 + 6 | 0] = i2;
+ if ((i2 | 0) == 0) {
+ STACKTOP = i1;
+ return i3 | 0;
+ }
+ i4 = i3 + 16 | 0;
+ do {
+ i2 = i2 + -1 | 0;
+ HEAP32[i4 + (i2 << 2) >> 2] = 0;
+ } while ((i2 | 0) != 0);
+ STACKTOP = i1;
+ return i3 | 0;
+}
+function _io_flush(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i2;
+ _lua_getfield(i1, -1001e3, 2800);
+ i3 = _lua_touserdata(i1, -1) | 0;
+ if ((HEAP32[i3 + 4 >> 2] | 0) == 0) {
+ HEAP32[i4 >> 2] = 2804;
+ _luaL_error(i1, 3424, i4) | 0;
+ }
+ i4 = _luaL_fileresult(i1, (_fflush(HEAP32[i3 >> 2] | 0) | 0) == 0 | 0, 0) | 0;
+ STACKTOP = i2;
+ return i4 | 0;
+}
+function _b_test(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0;
+ i2 = STACKTOP;
+ i3 = _lua_gettop(i1) | 0;
+ if ((i3 | 0) < 1) {
+ i3 = 1;
+ } else {
+ i4 = 1;
+ i5 = -1;
+ while (1) {
+ i5 = (_luaL_checkunsigned(i1, i4) | 0) & i5;
+ if ((i4 | 0) == (i3 | 0)) {
+ break;
+ } else {
+ i4 = i4 + 1 | 0;
+ }
+ }
+ i3 = (i5 | 0) != 0;
+ }
+ _lua_pushboolean(i1, i3 & 1);
+ STACKTOP = i2;
+ return 1;
+}
+function ___muldsi3(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i3 = 0, i4 = 0, i5 = 0, i6 = 0;
+ i6 = i2 & 65535;
+ i4 = i1 & 65535;
+ i3 = Math_imul(i4, i6) | 0;
+ i5 = i2 >>> 16;
+ i4 = (i3 >>> 16) + (Math_imul(i4, i5) | 0) | 0;
+ i1 = i1 >>> 16;
+ i2 = Math_imul(i1, i6) | 0;
+ return (tempRet0 = (i4 >>> 16) + (Math_imul(i1, i5) | 0) + (((i4 & 65535) + i2 | 0) >>> 16) | 0, i4 + i2 << 16 | i3 & 65535 | 0) | 0;
+}
+function _str_dump(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 1056 | 0;
+ i3 = i2 + 8 | 0;
+ _luaL_checktype(i1, 1, 6);
+ _lua_settop(i1, 1);
+ _luaL_buffinit(i1, i3);
+ if ((_lua_dump(i1, 2, i3) | 0) == 0) {
+ _luaL_pushresult(i3);
+ i3 = 1;
+ STACKTOP = i2;
+ return i3 | 0;
+ } else {
+ i3 = _luaL_error(i1, 7888, i2) | 0;
+ STACKTOP = i2;
+ return i3 | 0;
+ }
+ return 0;
+}
+function ___memrchr(i2, i3, i5) {
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i4 = 0;
+ i1 = STACKTOP;
+ i3 = i3 & 255;
+ while (1) {
+ i4 = i5 + -1 | 0;
+ if ((i5 | 0) == 0) {
+ i5 = 0;
+ i2 = 4;
+ break;
+ }
+ i5 = i2 + i4 | 0;
+ if ((HEAP8[i5] | 0) == i3 << 24 >> 24) {
+ i2 = 4;
+ break;
+ } else {
+ i5 = i4;
+ }
+ }
+ if ((i2 | 0) == 4) {
+ STACKTOP = i1;
+ return i5 | 0;
+ }
+ return 0;
+}
+function _luaL_getsubtable(i1, i3, i4) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_getfield(i1, i3, i4);
+ if ((_lua_type(i1, -1) | 0) == 5) {
+ i4 = 1;
+ STACKTOP = i2;
+ return i4 | 0;
+ }
+ _lua_settop(i1, -2);
+ i3 = _lua_absindex(i1, i3) | 0;
+ _lua_createtable(i1, 0, 0);
+ _lua_pushvalue(i1, -1);
+ _lua_setfield(i1, i3, i4);
+ i4 = 0;
+ STACKTOP = i2;
+ return i4 | 0;
+}
+function _luaE_freeCI(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ i4 = (HEAP32[i1 + 16 >> 2] | 0) + 12 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ HEAP32[i4 >> 2] = 0;
+ if ((i3 | 0) == 0) {
+ STACKTOP = i2;
+ return;
+ }
+ while (1) {
+ i4 = HEAP32[i3 + 12 >> 2] | 0;
+ _luaM_realloc_(i1, i3, 40, 0) | 0;
+ if ((i4 | 0) == 0) {
+ break;
+ } else {
+ i3 = i4;
+ }
+ }
+ STACKTOP = i2;
+ return;
+}
+function _f_tostring(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i2;
+ i4 = _luaL_checkudata(i1, 1, 2832) | 0;
+ if ((HEAP32[i4 + 4 >> 2] | 0) == 0) {
+ _lua_pushlstring(i1, 3040, 13) | 0;
+ STACKTOP = i2;
+ return 1;
+ } else {
+ HEAP32[i3 >> 2] = HEAP32[i4 >> 2];
+ _lua_pushfstring(i1, 3056, i3) | 0;
+ STACKTOP = i2;
+ return 1;
+ }
+ return 0;
+}
+function _lua_newuserdata(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0;
+ i2 = STACKTOP;
+ if ((HEAP32[(HEAP32[i1 + 12 >> 2] | 0) + 12 >> 2] | 0) > 0) {
+ _luaC_step(i1);
+ }
+ i3 = _luaS_newudata(i1, i3, 0) | 0;
+ i1 = i1 + 8 | 0;
+ i4 = HEAP32[i1 >> 2] | 0;
+ HEAP32[i4 >> 2] = i3;
+ HEAP32[i4 + 8 >> 2] = 71;
+ HEAP32[i1 >> 2] = (HEAP32[i1 >> 2] | 0) + 16;
+ STACKTOP = i2;
+ return i3 + 24 | 0;
+}
+function _luaL_pushresultsize(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0, i5 = 0;
+ i2 = STACKTOP;
+ i5 = i1 + 8 | 0;
+ i4 = (HEAP32[i5 >> 2] | 0) + i3 | 0;
+ HEAP32[i5 >> 2] = i4;
+ i3 = HEAP32[i1 + 12 >> 2] | 0;
+ _lua_pushlstring(i3, HEAP32[i1 >> 2] | 0, i4) | 0;
+ if ((HEAP32[i1 >> 2] | 0) == (i1 + 16 | 0)) {
+ STACKTOP = i2;
+ return;
+ }
+ _lua_remove(i3, -2);
+ STACKTOP = i2;
+ return;
+}
+function _luaL_testudata(i2, i5, i4) {
+ i2 = i2 | 0;
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i3 = 0;
+ i1 = STACKTOP;
+ i3 = _lua_touserdata(i2, i5) | 0;
+ if ((i3 | 0) != 0 ? (_lua_getmetatable(i2, i5) | 0) != 0 : 0) {
+ _lua_getfield(i2, -1001e3, i4);
+ i5 = (_lua_rawequal(i2, -1, -2) | 0) == 0;
+ _lua_settop(i2, -3);
+ i2 = i5 ? 0 : i3;
+ } else {
+ i2 = 0;
+ }
+ STACKTOP = i1;
+ return i2 | 0;
+}
+function _finishpcall(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ if ((_lua_checkstack(i1, 1) | 0) == 0) {
+ _lua_settop(i1, 0);
+ _lua_pushboolean(i1, 0);
+ _lua_pushstring(i1, 9632) | 0;
+ i3 = 2;
+ STACKTOP = i2;
+ return i3 | 0;
+ } else {
+ _lua_pushboolean(i1, i3);
+ _lua_replace(i1, 1);
+ i3 = _lua_gettop(i1) | 0;
+ STACKTOP = i2;
+ return i3 | 0;
+ }
+ return 0;
+}
+function _searcher_preload(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i2;
+ i3 = _luaL_checklstring(i1, 1, 0) | 0;
+ _lua_getfield(i1, -1001e3, 4592);
+ _lua_getfield(i1, -1, i3);
+ if ((_lua_type(i1, -1) | 0) != 0) {
+ STACKTOP = i2;
+ return 1;
+ }
+ HEAP32[i4 >> 2] = i3;
+ _lua_pushfstring(i1, 5096, i4) | 0;
+ STACKTOP = i2;
+ return 1;
+}
+function _luaB_auxwrap(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i3 = STACKTOP;
+ i2 = _lua_tothread(i1, -1001001) | 0;
+ i2 = _auxresume(i1, i2, _lua_gettop(i1) | 0) | 0;
+ if ((i2 | 0) >= 0) {
+ STACKTOP = i3;
+ return i2 | 0;
+ }
+ if ((_lua_isstring(i1, -1) | 0) == 0) {
+ _lua_error(i1) | 0;
+ }
+ _luaL_where(i1, 1);
+ _lua_insert(i1, -2);
+ _lua_concat(i1, 2);
+ _lua_error(i1) | 0;
+ return 0;
+}
+function _ll_loadlib(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = _luaL_checklstring(i1, 1, 0) | 0;
+ i3 = _ll_loadfunc(i1, i3, _luaL_checklstring(i1, 2, 0) | 0) | 0;
+ if ((i3 | 0) == 0) {
+ i3 = 1;
+ STACKTOP = i2;
+ return i3 | 0;
+ }
+ _lua_pushnil(i1);
+ _lua_insert(i1, -2);
+ _lua_pushstring(i1, (i3 | 0) == 1 ? 5176 : 5184) | 0;
+ i3 = 3;
+ STACKTOP = i2;
+ return i3 | 0;
+}
+function _luaS_hash(i2, i4, i3) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ var i1 = 0, i5 = 0;
+ i1 = STACKTOP;
+ i5 = i3 ^ i4;
+ i3 = (i4 >>> 5) + 1 | 0;
+ if (i3 >>> 0 > i4 >>> 0) {
+ STACKTOP = i1;
+ return i5 | 0;
+ }
+ do {
+ i5 = (i5 << 5) + (i5 >>> 2) + (HEAPU8[i2 + (i4 + -1) | 0] | 0) ^ i5;
+ i4 = i4 - i3 | 0;
+ } while (!(i4 >>> 0 < i3 >>> 0));
+ STACKTOP = i1;
+ return i5 | 0;
+}
+function _b_and(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0;
+ i2 = STACKTOP;
+ i3 = _lua_gettop(i1) | 0;
+ if ((i3 | 0) < 1) {
+ i5 = -1;
+ } else {
+ i4 = 1;
+ i5 = -1;
+ while (1) {
+ i5 = (_luaL_checkunsigned(i1, i4) | 0) & i5;
+ if ((i4 | 0) == (i3 | 0)) {
+ break;
+ } else {
+ i4 = i4 + 1 | 0;
+ }
+ }
+ }
+ _lua_pushunsigned(i1, i5);
+ STACKTOP = i2;
+ return 1;
+}
+function _luaopen_string(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_createtable(i1, 0, 14);
+ _luaL_setfuncs(i1, 6920, 0);
+ _lua_createtable(i1, 0, 1);
+ _lua_pushlstring(i1, 7040, 0) | 0;
+ _lua_pushvalue(i1, -2);
+ _lua_setmetatable(i1, -2) | 0;
+ _lua_settop(i1, -2);
+ _lua_pushvalue(i1, -2);
+ _lua_setfield(i1, -2, 7048);
+ _lua_settop(i1, -2);
+ STACKTOP = i2;
+ return 1;
+}
+function _b_xor(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0;
+ i2 = STACKTOP;
+ i3 = _lua_gettop(i1) | 0;
+ if ((i3 | 0) < 1) {
+ i5 = 0;
+ } else {
+ i4 = 1;
+ i5 = 0;
+ while (1) {
+ i5 = (_luaL_checkunsigned(i1, i4) | 0) ^ i5;
+ if ((i4 | 0) == (i3 | 0)) {
+ break;
+ } else {
+ i4 = i4 + 1 | 0;
+ }
+ }
+ }
+ _lua_pushunsigned(i1, i5);
+ STACKTOP = i2;
+ return 1;
+}
+function _luaB_assert(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i2;
+ if ((_lua_toboolean(i1, 1) | 0) == 0) {
+ HEAP32[i3 >> 2] = _luaL_optlstring(i1, 2, 10216, 0) | 0;
+ i3 = _luaL_error(i1, 10208, i3) | 0;
+ STACKTOP = i2;
+ return i3 | 0;
+ } else {
+ i3 = _lua_gettop(i1) | 0;
+ STACKTOP = i2;
+ return i3 | 0;
+ }
+ return 0;
+}
+function _b_or(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0;
+ i2 = STACKTOP;
+ i3 = _lua_gettop(i1) | 0;
+ if ((i3 | 0) < 1) {
+ i5 = 0;
+ } else {
+ i4 = 1;
+ i5 = 0;
+ while (1) {
+ i5 = _luaL_checkunsigned(i1, i4) | 0 | i5;
+ if ((i4 | 0) == (i3 | 0)) {
+ break;
+ } else {
+ i4 = i4 + 1 | 0;
+ }
+ }
+ }
+ _lua_pushunsigned(i1, i5);
+ STACKTOP = i2;
+ return 1;
+}
+function _io_write(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i2;
+ _lua_getfield(i1, -1001e3, 2800);
+ i3 = _lua_touserdata(i1, -1) | 0;
+ if ((HEAP32[i3 + 4 >> 2] | 0) == 0) {
+ HEAP32[i4 >> 2] = 2804;
+ _luaL_error(i1, 3424, i4) | 0;
+ }
+ i4 = _g_write(i1, HEAP32[i3 >> 2] | 0, 1) | 0;
+ STACKTOP = i2;
+ return i4 | 0;
+}
+function _luaK_checkstack(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0;
+ i2 = STACKTOP;
+ i3 = (HEAPU8[i1 + 48 | 0] | 0) + i3 | 0;
+ i4 = (HEAP32[i1 >> 2] | 0) + 78 | 0;
+ if ((i3 | 0) <= (HEAPU8[i4] | 0 | 0)) {
+ STACKTOP = i2;
+ return;
+ }
+ if ((i3 | 0) > 249) {
+ _luaX_syntaxerror(HEAP32[i1 + 12 >> 2] | 0, 10536);
+ }
+ HEAP8[i4] = i3;
+ STACKTOP = i2;
+ return;
+}
+function _io_read(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i2;
+ _lua_getfield(i1, -1001e3, 2776);
+ i3 = _lua_touserdata(i1, -1) | 0;
+ if ((HEAP32[i3 + 4 >> 2] | 0) == 0) {
+ HEAP32[i4 >> 2] = 2780;
+ _luaL_error(i1, 3424, i4) | 0;
+ }
+ i4 = _g_read(i1, HEAP32[i3 >> 2] | 0, 1) | 0;
+ STACKTOP = i2;
+ return i4 | 0;
+}
+function _db_setupvalue(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ _luaL_checkany(i1, 3);
+ i3 = _luaL_checkinteger(i1, 2) | 0;
+ _luaL_checktype(i1, 1, 6);
+ i3 = _lua_setupvalue(i1, 1, i3) | 0;
+ if ((i3 | 0) == 0) {
+ i3 = 0;
+ STACKTOP = i2;
+ return i3 | 0;
+ }
+ _lua_pushstring(i1, i3) | 0;
+ _lua_insert(i1, -1);
+ i3 = 1;
+ STACKTOP = i2;
+ return i3 | 0;
+}
+function ___uflow(i2) {
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i1;
+ if ((HEAP32[i2 + 8 >> 2] | 0) == 0 ? (___toread(i2) | 0) != 0 : 0) {
+ i2 = -1;
+ } else {
+ if ((FUNCTION_TABLE_iiii[HEAP32[i2 + 32 >> 2] & 3](i2, i3, 1) | 0) == 1) {
+ i2 = HEAPU8[i3] | 0;
+ } else {
+ i2 = -1;
+ }
+ }
+ STACKTOP = i1;
+ return i2 | 0;
+}
+function _llvm_cttz_i32(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = HEAP8[cttz_i8 + (i1 & 255) | 0] | 0;
+ if ((i2 | 0) < 8) return i2 | 0;
+ i2 = HEAP8[cttz_i8 + (i1 >> 8 & 255) | 0] | 0;
+ if ((i2 | 0) < 8) return i2 + 8 | 0;
+ i2 = HEAP8[cttz_i8 + (i1 >> 16 & 255) | 0] | 0;
+ if ((i2 | 0) < 8) return i2 + 16 | 0;
+ return (HEAP8[cttz_i8 + (i1 >>> 24) | 0] | 0) + 24 | 0;
+}
+function _llvm_ctlz_i32(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = HEAP8[ctlz_i8 + (i1 >>> 24) | 0] | 0;
+ if ((i2 | 0) < 8) return i2 | 0;
+ i2 = HEAP8[ctlz_i8 + (i1 >> 16 & 255) | 0] | 0;
+ if ((i2 | 0) < 8) return i2 + 8 | 0;
+ i2 = HEAP8[ctlz_i8 + (i1 >> 8 & 255) | 0] | 0;
+ if ((i2 | 0) < 8) return i2 + 16 | 0;
+ return (HEAP8[ctlz_i8 + (i1 & 255) | 0] | 0) + 24 | 0;
+}
+function _luaO_ceillog2(i2) {
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0, i4 = 0;
+ i1 = STACKTOP;
+ i2 = i2 + -1 | 0;
+ if (i2 >>> 0 > 255) {
+ i3 = 0;
+ while (1) {
+ i3 = i3 + 8 | 0;
+ i4 = i2 >>> 8;
+ if (i2 >>> 0 > 65535) {
+ i2 = i4;
+ } else {
+ i2 = i4;
+ break;
+ }
+ }
+ } else {
+ i3 = 0;
+ }
+ STACKTOP = i1;
+ return (HEAPU8[5208 + i2 | 0] | 0) + i3 | 0;
+}
+function _os_exit(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ if ((_lua_type(i1, 1) | 0) == 1) {
+ i3 = (_lua_toboolean(i1, 1) | 0) == 0 | 0;
+ } else {
+ i3 = _luaL_optinteger(i1, 1, 0) | 0;
+ }
+ if ((_lua_toboolean(i1, 2) | 0) != 0) {
+ _lua_close(i1);
+ }
+ if ((i1 | 0) == 0) {
+ STACKTOP = i2;
+ return 0;
+ } else {
+ _exit(i3 | 0);
+ }
+ return 0;
+}
+function _luaL_newmetatable(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_getfield(i1, -1001e3, i3);
+ if ((_lua_type(i1, -1) | 0) != 0) {
+ i3 = 0;
+ STACKTOP = i2;
+ return i3 | 0;
+ }
+ _lua_settop(i1, -2);
+ _lua_createtable(i1, 0, 0);
+ _lua_pushvalue(i1, -1);
+ _lua_setfield(i1, -1001e3, i3);
+ i3 = 1;
+ STACKTOP = i2;
+ return i3 | 0;
+}
+function _luaH_free(i1, i4) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = HEAP32[i4 + 16 >> 2] | 0;
+ if ((i3 | 0) != 8016) {
+ _luaM_realloc_(i1, i3, 32 << (HEAPU8[i4 + 7 | 0] | 0), 0) | 0;
+ }
+ _luaM_realloc_(i1, HEAP32[i4 + 12 >> 2] | 0, HEAP32[i4 + 28 >> 2] << 4, 0) | 0;
+ _luaM_realloc_(i1, i4, 32, 0) | 0;
+ STACKTOP = i2;
+ return;
+}
+function _luaO_int2fb(i3) {
+ i3 = i3 | 0;
+ var i1 = 0, i2 = 0, i4 = 0;
+ i1 = STACKTOP;
+ if (i3 >>> 0 < 8) {
+ STACKTOP = i1;
+ return i3 | 0;
+ }
+ if (i3 >>> 0 > 15) {
+ i2 = 1;
+ do {
+ i4 = i3 + 1 | 0;
+ i3 = i4 >>> 1;
+ i2 = i2 + 1 | 0;
+ } while (i4 >>> 0 > 31);
+ i2 = i2 << 3;
+ } else {
+ i2 = 8;
+ }
+ i4 = i2 | i3 + -8;
+ STACKTOP = i1;
+ return i4 | 0;
+}
+function _luaK_codek(i3, i4, i1) {
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ i4 = i4 << 6;
+ if ((i1 | 0) < 262144) {
+ i4 = _luaK_code(i3, i4 | i1 << 14 | 1) | 0;
+ STACKTOP = i2;
+ return i4 | 0;
+ } else {
+ i4 = _luaK_code(i3, i4 | 2) | 0;
+ _luaK_code(i3, i1 << 6 | 39) | 0;
+ STACKTOP = i2;
+ return i4 | 0;
+ }
+ return 0;
+}
+function _luaB_xpcall(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = _lua_gettop(i1) | 0;
+ if ((i3 | 0) <= 1) {
+ _luaL_argerror(i1, 2, 9616) | 0;
+ }
+ _lua_pushvalue(i1, 1);
+ _lua_copy(i1, 2, 1);
+ _lua_replace(i1, 2);
+ i3 = _finishpcall(i1, (_lua_pcallk(i1, i3 + -2 | 0, -1, 1, 0, 166) | 0) == 0 | 0) | 0;
+ STACKTOP = i2;
+ return i3 | 0;
+}
+function _luaS_newudata(i1, i3, i4) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ if (i3 >>> 0 > 4294967269) {
+ _luaM_toobig(i1);
+ } else {
+ i1 = _luaC_newobj(i1, 7, i3 + 24 | 0, 0, 0) | 0;
+ HEAP32[i1 + 16 >> 2] = i3;
+ HEAP32[i1 + 8 >> 2] = 0;
+ HEAP32[i1 + 12 >> 2] = i4;
+ STACKTOP = i2;
+ return i1 | 0;
+ }
+ return 0;
+}
+function _lua_dump(i1, i4, i5) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = HEAP32[i1 + 8 >> 2] | 0;
+ if ((HEAP32[i3 + -8 >> 2] | 0) != 70) {
+ i5 = 1;
+ STACKTOP = i2;
+ return i5 | 0;
+ }
+ i5 = _luaU_dump(i1, HEAP32[(HEAP32[i3 + -16 >> 2] | 0) + 12 >> 2] | 0, i4, i5, 0) | 0;
+ STACKTOP = i2;
+ return i5 | 0;
+}
+function _luaS_eqlngstr(i2, i4) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i3 = 0;
+ i1 = STACKTOP;
+ i3 = HEAP32[i2 + 12 >> 2] | 0;
+ if ((i2 | 0) != (i4 | 0)) {
+ if ((i3 | 0) == (HEAP32[i4 + 12 >> 2] | 0)) {
+ i2 = (_memcmp(i2 + 16 | 0, i4 + 16 | 0, i3) | 0) == 0;
+ } else {
+ i2 = 0;
+ }
+ } else {
+ i2 = 1;
+ }
+ STACKTOP = i1;
+ return i2 & 1 | 0;
+}
+function _luaC_barrier_(i4, i3, i1) {
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ i4 = HEAP32[i4 + 12 >> 2] | 0;
+ if ((HEAPU8[i4 + 61 | 0] | 0) < 2) {
+ _reallymarkobject(i4, i1);
+ STACKTOP = i2;
+ return;
+ } else {
+ i3 = i3 + 5 | 0;
+ HEAP8[i3] = HEAP8[i4 + 60 | 0] & 3 | HEAP8[i3] & 184;
+ STACKTOP = i2;
+ return;
+ }
+}
+function _db_getupvalue(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = _luaL_checkinteger(i1, 2) | 0;
+ _luaL_checktype(i1, 1, 6);
+ i3 = _lua_getupvalue(i1, 1, i3) | 0;
+ if ((i3 | 0) == 0) {
+ i3 = 0;
+ STACKTOP = i2;
+ return i3 | 0;
+ }
+ _lua_pushstring(i1, i3) | 0;
+ _lua_insert(i1, -2);
+ i3 = 2;
+ STACKTOP = i2;
+ return i3 | 0;
+}
+function _os_execute(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ i4 = _luaL_optlstring(i1, 1, 0, 0) | 0;
+ i3 = _system(i4 | 0) | 0;
+ if ((i4 | 0) == 0) {
+ _lua_pushboolean(i1, i3);
+ i4 = 1;
+ STACKTOP = i2;
+ return i4 | 0;
+ } else {
+ i4 = _luaL_execresult(i1, i3) | 0;
+ STACKTOP = i2;
+ return i4 | 0;
+ }
+ return 0;
+}
+function _lua_pushfstring(i4, i5, i1) {
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i2;
+ if ((HEAP32[(HEAP32[i4 + 12 >> 2] | 0) + 12 >> 2] | 0) > 0) {
+ _luaC_step(i4);
+ }
+ HEAP32[i3 >> 2] = i1;
+ i5 = _luaO_pushvfstring(i4, i5, i3) | 0;
+ STACKTOP = i2;
+ return i5 | 0;
+}
+function _luaB_dofile(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = _luaL_optlstring(i1, 1, 0, 0) | 0;
+ _lua_settop(i1, 1);
+ if ((_luaL_loadfilex(i1, i3, 0) | 0) == 0) {
+ _lua_callk(i1, 0, -1, 0, 164);
+ i3 = (_lua_gettop(i1) | 0) + -1 | 0;
+ STACKTOP = i2;
+ return i3 | 0;
+ } else {
+ _lua_error(i1) | 0;
+ }
+ return 0;
+}
+function _f_write(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = _luaL_checkudata(i1, 1, 2832) | 0;
+ if ((HEAP32[i3 + 4 >> 2] | 0) == 0) {
+ _luaL_error(i1, 3080, i2) | 0;
+ }
+ i3 = HEAP32[i3 >> 2] | 0;
+ _lua_pushvalue(i1, 1);
+ i3 = _g_write(i1, i3, 2) | 0;
+ STACKTOP = i2;
+ return i3 | 0;
+}
+function _lua_getctx(i3, i1) {
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ i3 = HEAP32[i3 + 16 >> 2] | 0;
+ if ((HEAP8[i3 + 18 | 0] & 8) == 0) {
+ i3 = 0;
+ STACKTOP = i2;
+ return i3 | 0;
+ }
+ if ((i1 | 0) != 0) {
+ HEAP32[i1 >> 2] = HEAP32[i3 + 24 >> 2];
+ }
+ i3 = HEAPU8[i3 + 37 | 0] | 0;
+ STACKTOP = i2;
+ return i3 | 0;
+}
+function _f_flush(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = _luaL_checkudata(i1, 1, 2832) | 0;
+ if ((HEAP32[i3 + 4 >> 2] | 0) == 0) {
+ _luaL_error(i1, 3080, i2) | 0;
+ }
+ i3 = _luaL_fileresult(i1, (_fflush(HEAP32[i3 >> 2] | 0) | 0) == 0 | 0, 0) | 0;
+ STACKTOP = i2;
+ return i3 | 0;
+}
+function _os_tmpname(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 32 | 0;
+ i3 = i2 + 4 | 0;
+ if ((_tmpnam(i3 | 0) | 0) == 0) {
+ i3 = _luaL_error(i1, 5824, i2) | 0;
+ STACKTOP = i2;
+ return i3 | 0;
+ } else {
+ _lua_pushstring(i1, i3) | 0;
+ i3 = 1;
+ STACKTOP = i2;
+ return i3 | 0;
+ }
+ return 0;
+}
+function _traceback(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = _lua_tolstring(i1, 1, 0) | 0;
+ if ((i3 | 0) == 0) {
+ if ((_lua_type(i1, 1) | 0) >= 1 ? (_luaL_callmeta(i1, 1, 216) | 0) == 0 : 0) {
+ _lua_pushlstring(i1, 232, 18) | 0;
+ }
+ } else {
+ _luaL_traceback(i1, i1, i3, 1);
+ }
+ STACKTOP = i2;
+ return 1;
+}
+function _luaH_new(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ i1 = _luaC_newobj(i1, 5, 32, 0, 0) | 0;
+ HEAP32[i1 + 8 >> 2] = 0;
+ HEAP8[i1 + 6 | 0] = -1;
+ HEAP32[i1 + 12 >> 2] = 0;
+ HEAP32[i1 + 28 >> 2] = 0;
+ HEAP32[i1 + 16 >> 2] = 8016;
+ HEAP8[i1 + 7 | 0] = 0;
+ HEAP32[i1 + 20 >> 2] = 8016;
+ STACKTOP = i2;
+ return i1 | 0;
+}
+function _luaL_len(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i4 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i2 + 4 | 0;
+ _lua_len(i1, i3);
+ i3 = _lua_tointegerx(i1, -1, i4) | 0;
+ if ((HEAP32[i4 >> 2] | 0) == 0) {
+ _luaL_error(i1, 1352, i2) | 0;
+ }
+ _lua_settop(i1, -2);
+ STACKTOP = i2;
+ return i3 | 0;
+}
+function _getS(i3, i2, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i4 = 0, i5 = 0;
+ i3 = STACKTOP;
+ i5 = i2 + 4 | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ if ((i4 | 0) == 0) {
+ i5 = 0;
+ STACKTOP = i3;
+ return i5 | 0;
+ }
+ HEAP32[i1 >> 2] = i4;
+ HEAP32[i5 >> 2] = 0;
+ i5 = HEAP32[i2 >> 2] | 0;
+ STACKTOP = i3;
+ return i5 | 0;
+}
+function _luaC_runtilstate(i1, i4) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = (HEAP32[i1 + 12 >> 2] | 0) + 61 | 0;
+ if ((1 << (HEAPU8[i3] | 0) & i4 | 0) != 0) {
+ STACKTOP = i2;
+ return;
+ }
+ do {
+ _singlestep(i1) | 0;
+ } while ((1 << (HEAPU8[i3] | 0) & i4 | 0) == 0);
+ STACKTOP = i2;
+ return;
+}
+function _luaX_init(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0;
+ i2 = STACKTOP;
+ i3 = 0;
+ do {
+ i4 = _luaS_new(i1, HEAP32[12096 + (i3 << 2) >> 2] | 0) | 0;
+ i5 = i4 + 5 | 0;
+ HEAP8[i5] = HEAPU8[i5] | 0 | 32;
+ i3 = i3 + 1 | 0;
+ HEAP8[i4 + 6 | 0] = i3;
+ } while ((i3 | 0) != 22);
+ STACKTOP = i2;
+ return;
+}
+function _luaK_indexed(i5, i1, i4) {
+ i5 = i5 | 0;
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ var i2 = 0, i3 = 0;
+ i3 = STACKTOP;
+ i2 = i1 + 8 | 0;
+ HEAP8[i2 + 2 | 0] = HEAP32[i2 >> 2];
+ HEAP16[i2 >> 1] = _luaK_exp2RK(i5, i4) | 0;
+ HEAP8[i2 + 3 | 0] = (HEAP32[i1 >> 2] | 0) == 8 ? 8 : 7;
+ HEAP32[i1 >> 2] = 9;
+ STACKTOP = i3;
+ return;
+}
+function _db_setuservalue(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ if ((_lua_type(i1, 1) | 0) == 2) {
+ _luaL_argerror(i1, 1, 11680) | 0;
+ }
+ _luaL_checktype(i1, 1, 7);
+ if ((_lua_type(i1, 2) | 0) >= 1) {
+ _luaL_checktype(i1, 2, 5);
+ }
+ _lua_settop(i1, 2);
+ _lua_setuservalue(i1, 1);
+ STACKTOP = i2;
+ return 1;
+}
+function _ll_seeall(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _luaL_checktype(i1, 1, 5);
+ if ((_lua_getmetatable(i1, 1) | 0) == 0) {
+ _lua_createtable(i1, 0, 1);
+ _lua_pushvalue(i1, -1);
+ _lua_setmetatable(i1, 1) | 0;
+ }
+ _lua_rawgeti(i1, -1001e3, 2);
+ _lua_setfield(i1, -2, 5168);
+ STACKTOP = i2;
+ return 0;
+}
+function _luaL_loadbufferx(i3, i5, i4, i2, i1) {
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i6 = 0, i7 = 0;
+ i6 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i7 = i6;
+ HEAP32[i7 >> 2] = i5;
+ HEAP32[i7 + 4 >> 2] = i4;
+ i5 = _lua_load(i3, 2, i7, i2, i1) | 0;
+ STACKTOP = i6;
+ return i5 | 0;
+}
+function _luaT_gettm(i1, i3, i4) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ i4 = _luaH_getstr(i1, i4) | 0;
+ if ((HEAP32[i4 + 8 >> 2] | 0) != 0) {
+ STACKTOP = i2;
+ return i4 | 0;
+ }
+ i4 = i1 + 6 | 0;
+ HEAP8[i4] = HEAPU8[i4] | 0 | 1 << i3;
+ i4 = 0;
+ STACKTOP = i2;
+ return i4 | 0;
+}
+function _luaL_pushresult(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = HEAP32[i1 + 12 >> 2] | 0;
+ _lua_pushlstring(i3, HEAP32[i1 >> 2] | 0, HEAP32[i1 + 8 >> 2] | 0) | 0;
+ if ((HEAP32[i1 >> 2] | 0) == (i1 + 16 | 0)) {
+ STACKTOP = i2;
+ return;
+ }
+ _lua_remove(i3, -2);
+ STACKTOP = i2;
+ return;
+}
+function _resume_error(i1, i3, i2) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ var i4 = 0;
+ i4 = i1 + 8 | 0;
+ HEAP32[i4 >> 2] = i2;
+ i3 = _luaS_new(i1, i3) | 0;
+ HEAP32[i2 >> 2] = i3;
+ HEAP32[i2 + 8 >> 2] = HEAPU8[i3 + 4 | 0] | 0 | 64;
+ HEAP32[i4 >> 2] = (HEAP32[i4 >> 2] | 0) + 16;
+ _luaD_throw(i1, -1);
+}
+function _lua_absindex(i3, i1) {
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ if ((i1 + 1000999 | 0) >>> 0 > 1000999) {
+ i3 = i1;
+ STACKTOP = i2;
+ return i3 | 0;
+ }
+ i3 = ((HEAP32[i3 + 8 >> 2] | 0) - (HEAP32[HEAP32[i3 + 16 >> 2] >> 2] | 0) >> 4) + i1 | 0;
+ STACKTOP = i2;
+ return i3 | 0;
+}
+function ___uremdi3(i4, i3, i2, i1) {
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i5 = 0, i6 = 0;
+ i6 = STACKTOP;
+ STACKTOP = STACKTOP + 8 | 0;
+ i5 = i6 | 0;
+ ___udivmoddi4(i4, i3, i2, i1, i5) | 0;
+ STACKTOP = i6;
+ return (tempRet0 = HEAP32[i5 + 4 >> 2] | 0, HEAP32[i5 >> 2] | 0) | 0;
+}
+function _f_read(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = _luaL_checkudata(i1, 1, 2832) | 0;
+ if ((HEAP32[i3 + 4 >> 2] | 0) == 0) {
+ _luaL_error(i1, 3080, i2) | 0;
+ }
+ i3 = _g_read(i1, HEAP32[i3 >> 2] | 0, 2) | 0;
+ STACKTOP = i2;
+ return i3 | 0;
+}
+function _sort(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ _luaL_checktype(i1, 1, 5);
+ i3 = _luaL_len(i1, 1) | 0;
+ _luaL_checkstack(i1, 40, 8208);
+ if ((_lua_type(i1, 2) | 0) >= 1) {
+ _luaL_checktype(i1, 2, 6);
+ }
+ _lua_settop(i1, 2);
+ _auxsort(i1, 1, i3);
+ STACKTOP = i2;
+ return 0;
+}
+function _luaB_error(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = _luaL_optinteger(i1, 2, 1) | 0;
+ _lua_settop(i1, 1);
+ if (!((_lua_isstring(i1, 1) | 0) != 0 & (i2 | 0) > 0)) {
+ _lua_error(i1) | 0;
+ }
+ _luaL_where(i1, i2);
+ _lua_pushvalue(i1, 1);
+ _lua_concat(i1, 2);
+ _lua_error(i1) | 0;
+ return 0;
+}
+function _error(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i3 = 0, i4 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = HEAP32[i1 >> 2] | 0;
+ HEAP32[i3 >> 2] = HEAP32[i1 + 12 >> 2];
+ HEAP32[i3 + 4 >> 2] = i2;
+ _luaO_pushfstring(i4, 8840, i3) | 0;
+ _luaD_throw(HEAP32[i1 >> 2] | 0, 3);
+}
+function _ipairsaux(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = _luaL_checkinteger(i1, 2) | 0;
+ _luaL_checktype(i1, 1, 5);
+ i3 = i3 + 1 | 0;
+ _lua_pushinteger(i1, i3);
+ _lua_rawgeti(i1, 1, i3);
+ i1 = (_lua_type(i1, -1) | 0) == 0;
+ STACKTOP = i2;
+ return (i1 ? 1 : 2) | 0;
+}
+function _panic(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i2;
+ i3 = HEAP32[_stderr >> 2] | 0;
+ HEAP32[i4 >> 2] = _lua_tolstring(i1, -1, 0) | 0;
+ _fprintf(i3 | 0, 1656, i4 | 0) | 0;
+ _fflush(i3 | 0) | 0;
+ STACKTOP = i2;
+ return 0;
+}
+function _testSetjmp(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i3 = 0, i4 = 0;
+ while ((i3 | 0) < 20) {
+ i4 = HEAP32[i2 + (i3 << 2) >> 2] | 0;
+ if ((i4 | 0) == 0) break;
+ if ((i4 | 0) == (i1 | 0)) {
+ return HEAP32[i2 + ((i3 << 2) + 4) >> 2] | 0;
+ }
+ i3 = i3 + 2 | 0;
+ }
+ return 0;
+}
+function _luaopen_math(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_createtable(i1, 0, 28);
+ _luaL_setfuncs(i1, 3576, 0);
+ _lua_pushnumber(i1, 3.141592653589793);
+ _lua_setfield(i1, -2, 3808);
+ _lua_pushnumber(i1, inf);
+ _lua_setfield(i1, -2, 3816);
+ STACKTOP = i2;
+ return 1;
+}
+function _luaopen_base(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_rawgeti(i1, -1001e3, 2);
+ _lua_rawgeti(i1, -1001e3, 2);
+ _lua_setfield(i1, -2, 9144);
+ _luaL_setfuncs(i1, 9152, 0);
+ _lua_pushlstring(i1, 9344, 7) | 0;
+ _lua_setfield(i1, -2, 9352);
+ STACKTOP = i2;
+ return 1;
+}
+function _luaE_extendCI(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i3 = STACKTOP;
+ i2 = _luaM_realloc_(i1, 0, 0, 40) | 0;
+ i1 = i1 + 16 | 0;
+ HEAP32[(HEAP32[i1 >> 2] | 0) + 12 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = HEAP32[i1 >> 2];
+ HEAP32[i2 + 12 >> 2] = 0;
+ STACKTOP = i3;
+ return i2 | 0;
+}
+function _luaB_getmetatable(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _luaL_checkany(i1, 1);
+ if ((_lua_getmetatable(i1, 1) | 0) == 0) {
+ _lua_pushnil(i1);
+ STACKTOP = i2;
+ return 1;
+ } else {
+ _luaL_getmetafield(i1, 1, 9704) | 0;
+ STACKTOP = i2;
+ return 1;
+ }
+ return 0;
+}
+function _lua_pushunsigned(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var d3 = 0.0;
+ if ((i2 | 0) > -1) {
+ d3 = +(i2 | 0);
+ } else {
+ d3 = +(i2 >>> 0);
+ }
+ i2 = i1 + 8 | 0;
+ i1 = HEAP32[i2 >> 2] | 0;
+ HEAPF64[i1 >> 3] = d3;
+ HEAP32[i1 + 8 >> 2] = 3;
+ HEAP32[i2 >> 2] = i1 + 16;
+ return;
+}
+function _lua_pushthread(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = i1 + 8 | 0;
+ i3 = HEAP32[i2 >> 2] | 0;
+ HEAP32[i3 >> 2] = i1;
+ HEAP32[i3 + 8 >> 2] = 72;
+ HEAP32[i2 >> 2] = (HEAP32[i2 >> 2] | 0) + 16;
+ return (HEAP32[(HEAP32[i1 + 12 >> 2] | 0) + 172 >> 2] | 0) == (i1 | 0) | 0;
+}
+function _gctm(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = _luaL_len(i1, 1) | 0;
+ if ((i3 | 0) <= 0) {
+ STACKTOP = i2;
+ return 0;
+ }
+ do {
+ _lua_rawgeti(i1, 1, i3);
+ _lua_settop(i1, -2);
+ i3 = i3 + -1 | 0;
+ } while ((i3 | 0) > 0);
+ STACKTOP = i2;
+ return 0;
+}
+function ___muldi3(i4, i2, i3, i1) {
+ i4 = i4 | 0;
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ var i5 = 0, i6 = 0;
+ i5 = i4;
+ i6 = i3;
+ i4 = ___muldsi3(i5, i6) | 0;
+ i3 = tempRet0;
+ return (tempRet0 = (Math_imul(i2, i6) | 0) + (Math_imul(i1, i5) | 0) + i3 | i3 & 0, i4 | 0 | 0) | 0;
+}
+function _luaH_resizearray(i1, i3, i4) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ var i2 = 0, i5 = 0;
+ i2 = STACKTOP;
+ if ((HEAP32[i3 + 16 >> 2] | 0) == 8016) {
+ i5 = 0;
+ } else {
+ i5 = 1 << (HEAPU8[i3 + 7 | 0] | 0);
+ }
+ _luaH_resize(i1, i3, i4, i5);
+ STACKTOP = i2;
+ return;
+}
+function _luaK_stringK(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i3 = 0, i4 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i3;
+ HEAP32[i4 >> 2] = i2;
+ HEAP32[i4 + 8 >> 2] = HEAPU8[i2 + 4 | 0] | 0 | 64;
+ i2 = _addk(i1, i4, i4) | 0;
+ STACKTOP = i3;
+ return i2 | 0;
+}
+function _math_modf(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, d3 = 0.0, i4 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i2;
+ d3 = +_modf(+(+_luaL_checknumber(i1, 1)), i4 | 0);
+ _lua_pushnumber(i1, +HEAPF64[i4 >> 3]);
+ _lua_pushnumber(i1, d3);
+ STACKTOP = i2;
+ return 2;
+}
+function _os_setlocale(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = _luaL_optlstring(i1, 1, 0, 0) | 0;
+ _lua_pushstring(i1, _setlocale(HEAP32[5960 + ((_luaL_checkoption(i1, 2, 6016, 5984) | 0) << 2) >> 2] | 0, i3 | 0) | 0) | 0;
+ STACKTOP = i2;
+ return 1;
+}
+function _luaB_pcall(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _luaL_checkany(i1, 1);
+ _lua_pushnil(i1);
+ _lua_insert(i1, 1);
+ i1 = _finishpcall(i1, (_lua_pcallk(i1, (_lua_gettop(i1) | 0) + -2 | 0, -1, 0, 0, 166) | 0) == 0 | 0) | 0;
+ STACKTOP = i2;
+ return i1 | 0;
+}
+function _error_expected(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i3 = 0, i4 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = HEAP32[i1 + 52 >> 2] | 0;
+ HEAP32[i3 >> 2] = _luaX_token2str(i1, i2) | 0;
+ _luaX_syntaxerror(i1, _luaO_pushfstring(i4, 6328, i3) | 0);
+}
+function _lua_pushvfstring(i1, i3, i4) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ if ((HEAP32[(HEAP32[i1 + 12 >> 2] | 0) + 12 >> 2] | 0) > 0) {
+ _luaC_step(i1);
+ }
+ i4 = _luaO_pushvfstring(i1, i3, i4) | 0;
+ STACKTOP = i2;
+ return i4 | 0;
+}
+function _db_setmetatable(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = _lua_type(i1, 2) | 0;
+ if (!((i3 | 0) == 0 | (i3 | 0) == 5)) {
+ _luaL_argerror(i1, 2, 11536) | 0;
+ }
+ _lua_settop(i1, 2);
+ _lua_setmetatable(i1, 1) | 0;
+ STACKTOP = i2;
+ return 1;
+}
+function _b_rrot(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ i3 = 0 - (_luaL_checkinteger(i1, 2) | 0) | 0;
+ i4 = _luaL_checkunsigned(i1, 1) | 0;
+ i3 = i3 & 31;
+ _lua_pushunsigned(i1, i4 >>> (32 - i3 | 0) | i4 << i3);
+ STACKTOP = i2;
+ return 1;
+}
+function _luaC_step(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = HEAP32[i1 + 12 >> 2] | 0;
+ if ((HEAP8[i3 + 63 | 0] | 0) == 0) {
+ _luaE_setdebt(i3, -1600);
+ STACKTOP = i2;
+ return;
+ } else {
+ _luaC_forcestep(i1);
+ STACKTOP = i2;
+ return;
+ }
+}
+function _math_frexp(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i2;
+ _lua_pushnumber(i1, +_frexp(+(+_luaL_checknumber(i1, 1)), i3 | 0));
+ _lua_pushinteger(i1, HEAP32[i3 >> 2] | 0);
+ STACKTOP = i2;
+ return 2;
+}
+function _luaO_pushfstring(i2, i1, i3) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i4 = 0, i5 = 0;
+ i4 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i5 = i4;
+ HEAP32[i5 >> 2] = i3;
+ i3 = _luaO_pushvfstring(i2, i1, i5) | 0;
+ STACKTOP = i4;
+ return i3 | 0;
+}
+function _luaO_hexavalue(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ if ((HEAP8[i1 + 10913 | 0] & 2) == 0) {
+ i1 = (i1 | 32) + -87 | 0;
+ STACKTOP = i2;
+ return i1 | 0;
+ } else {
+ i1 = i1 + -48 | 0;
+ STACKTOP = i2;
+ return i1 | 0;
+ }
+ return 0;
+}
+function _b_lrot(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ i3 = _luaL_checkinteger(i1, 2) | 0;
+ i4 = _luaL_checkunsigned(i1, 1) | 0;
+ i3 = i3 & 31;
+ _lua_pushunsigned(i1, i4 >>> (32 - i3 | 0) | i4 << i3);
+ STACKTOP = i2;
+ return 1;
+}
+function _f_lines(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ if ((HEAP32[(_luaL_checkudata(i1, 1, 2832) | 0) + 4 >> 2] | 0) == 0) {
+ _luaL_error(i1, 3080, i2) | 0;
+ }
+ _aux_lines(i1, 0);
+ STACKTOP = i2;
+ return 1;
+}
+function _luaC_barrierback_(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i3 = 0;
+ i2 = HEAP32[i2 + 12 >> 2] | 0;
+ i3 = i1 + 5 | 0;
+ HEAP8[i3] = HEAP8[i3] & 251;
+ i2 = i2 + 88 | 0;
+ HEAP32[i1 + 24 >> 2] = HEAP32[i2 >> 2];
+ HEAP32[i2 >> 2] = i1;
+ return;
+}
+function _os_rename(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = _luaL_checklstring(i1, 1, 0) | 0;
+ i1 = _luaL_fileresult(i1, (_rename(i3 | 0, _luaL_checklstring(i1, 2, 0) | 0) | 0) == 0 | 0, 0) | 0;
+ STACKTOP = i2;
+ return i1 | 0;
+}
+function _bitshift64Ashr(i3, i2, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ if ((i1 | 0) < 32) {
+ tempRet0 = i2 >> i1;
+ return i3 >>> i1 | (i2 & (1 << i1) - 1) << 32 - i1;
+ }
+ tempRet0 = (i2 | 0) < 0 ? -1 : 0;
+ return i2 >> i1 - 32 | 0;
+}
+function _luaB_cowrap(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ _luaL_checktype(i1, 1, 6);
+ i3 = _lua_newthread(i1) | 0;
+ _lua_pushvalue(i1, 1);
+ _lua_xmove(i1, i3, 1);
+ _lua_pushcclosure(i1, 167, 1);
+ STACKTOP = i2;
+ return 1;
+}
+function _gmatch(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _luaL_checklstring(i1, 1, 0) | 0;
+ _luaL_checklstring(i1, 2, 0) | 0;
+ _lua_settop(i1, 2);
+ _lua_pushinteger(i1, 0);
+ _lua_pushcclosure(i1, 163, 3);
+ STACKTOP = i2;
+ return 1;
+}
+function _luaB_next(i2) {
+ i2 = i2 | 0;
+ var i1 = 0;
+ i1 = STACKTOP;
+ _luaL_checktype(i2, 1, 5);
+ _lua_settop(i2, 2);
+ if ((_lua_next(i2, 1) | 0) == 0) {
+ _lua_pushnil(i2);
+ i2 = 1;
+ } else {
+ i2 = 2;
+ }
+ STACKTOP = i1;
+ return i2 | 0;
+}
+function _luaK_codeABC(i5, i3, i4, i2, i1) {
+ i5 = i5 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i6 = 0;
+ i6 = STACKTOP;
+ i5 = _luaK_code(i5, i4 << 6 | i3 | i2 << 23 | i1 << 14) | 0;
+ STACKTOP = i6;
+ return i5 | 0;
+}
+function _luaH_set(i2, i4, i5) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i3 = 0;
+ i1 = STACKTOP;
+ i3 = _luaH_get(i4, i5) | 0;
+ if ((i3 | 0) == 5192) {
+ i3 = _luaH_newkey(i2, i4, i5) | 0;
+ }
+ STACKTOP = i1;
+ return i3 | 0;
+}
+function _luaZ_init(i4, i1, i3, i2) {
+ i4 = i4 | 0;
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ HEAP32[i1 + 16 >> 2] = i4;
+ HEAP32[i1 + 8 >> 2] = i3;
+ HEAP32[i1 + 12 >> 2] = i2;
+ HEAP32[i1 >> 2] = 0;
+ HEAP32[i1 + 4 >> 2] = 0;
+ return;
+}
+function _lua_pushlightuserdata(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i3 = 0;
+ i2 = i2 + 8 | 0;
+ i3 = HEAP32[i2 >> 2] | 0;
+ HEAP32[i3 >> 2] = i1;
+ HEAP32[i3 + 8 >> 2] = 2;
+ HEAP32[i2 >> 2] = (HEAP32[i2 >> 2] | 0) + 16;
+ return;
+}
+function copyTempFloat(i1) {
+ i1 = i1 | 0;
+ HEAP8[tempDoublePtr] = HEAP8[i1];
+ HEAP8[tempDoublePtr + 1 | 0] = HEAP8[i1 + 1 | 0];
+ HEAP8[tempDoublePtr + 2 | 0] = HEAP8[i1 + 2 | 0];
+ HEAP8[tempDoublePtr + 3 | 0] = HEAP8[i1 + 3 | 0];
+}
+function _bitshift64Shl(i2, i3, i1) {
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ if ((i1 | 0) < 32) {
+ tempRet0 = i3 << i1 | (i2 & (1 << i1) - 1 << 32 - i1) >>> 32 - i1;
+ return i2 << i1;
+ }
+ tempRet0 = i2 << i1 - 32;
+ return 0;
+}
+function _luaB_rawlen(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ if (((_lua_type(i1, 1) | 0) & -2 | 0) != 4) {
+ _luaL_argerror(i1, 1, 9784) | 0;
+ }
+ _lua_pushinteger(i1, _lua_rawlen(i1, 1) | 0);
+ STACKTOP = i2;
+ return 1;
+}
+function _l_alloc(i3, i1, i4, i2) {
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i2 = i2 | 0;
+ i3 = STACKTOP;
+ if ((i2 | 0) == 0) {
+ _free(i1);
+ i1 = 0;
+ } else {
+ i1 = _realloc(i1, i2) | 0;
+ }
+ STACKTOP = i3;
+ return i1 | 0;
+}
+function _bitshift64Lshr(i3, i2, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ if ((i1 | 0) < 32) {
+ tempRet0 = i2 >>> i1;
+ return i3 >>> i1 | (i2 & (1 << i1) - 1) << 32 - i1;
+ }
+ tempRet0 = 0;
+ return i2 >>> i1 - 32 | 0;
+}
+function _luaG_aritherror(i3, i1, i2) {
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i4 = 0;
+ i4 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = (_luaV_tonumber(i1, i4) | 0) == 0;
+ _luaG_typeerror(i3, i4 ? i1 : i2, 1928);
+}
+function _str_len(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i3 = i2;
+ _luaL_checklstring(i1, 1, i3) | 0;
+ _lua_pushinteger(i1, HEAP32[i3 >> 2] | 0);
+ STACKTOP = i2;
+ return 1;
+}
+function _luaL_optinteger(i3, i4, i2) {
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ i2 = i2 | 0;
+ var i1 = 0;
+ i1 = STACKTOP;
+ if ((_lua_type(i3, i4) | 0) >= 1) {
+ i2 = _luaL_checkinteger(i3, i4) | 0;
+ }
+ STACKTOP = i1;
+ return i2 | 0;
+}
+function _os_difftime(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = ~~+_luaL_checknumber(i1, 1);
+ _lua_pushnumber(i1, +_difftime(i3 | 0, ~~+_luaL_optnumber(i1, 2, 0.0) | 0));
+ STACKTOP = i2;
+ return 1;
+}
+function _lua_pushboolean(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i3 = 0;
+ i2 = i2 + 8 | 0;
+ i3 = HEAP32[i2 >> 2] | 0;
+ HEAP32[i3 >> 2] = (i1 | 0) != 0;
+ HEAP32[i3 + 8 >> 2] = 1;
+ HEAP32[i2 >> 2] = i3 + 16;
+ return;
+}
+function _os_remove(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = _luaL_checklstring(i1, 1, 0) | 0;
+ i1 = _luaL_fileresult(i1, (_remove(i3 | 0) | 0) == 0 | 0, i3) | 0;
+ STACKTOP = i2;
+ return i1 | 0;
+}
+function _luaopen_table(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_createtable(i1, 0, 7);
+ _luaL_setfuncs(i1, 8088, 0);
+ _lua_getfield(i1, -1, 8152);
+ _lua_setglobal(i1, 8152);
+ STACKTOP = i2;
+ return 1;
+}
+function _lua_pushinteger(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i3 = 0;
+ i2 = i2 + 8 | 0;
+ i3 = HEAP32[i2 >> 2] | 0;
+ HEAPF64[i3 >> 3] = +(i1 | 0);
+ HEAP32[i3 + 8 >> 2] = 3;
+ HEAP32[i2 >> 2] = i3 + 16;
+ return;
+}
+function _luaB_rawset(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _luaL_checktype(i1, 1, 5);
+ _luaL_checkany(i1, 2);
+ _luaL_checkany(i1, 3);
+ _lua_settop(i1, 3);
+ _lua_rawset(i1, 1);
+ STACKTOP = i2;
+ return 1;
+}
+function _luaE_setdebt(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i3 = 0;
+ i3 = i2 + 12 | 0;
+ i2 = i2 + 8 | 0;
+ HEAP32[i2 >> 2] = (HEAP32[i3 >> 2] | 0) - i1 + (HEAP32[i2 >> 2] | 0);
+ HEAP32[i3 >> 2] = i1;
+ return;
+}
+function _luaB_cocreate(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ _luaL_checktype(i1, 1, 6);
+ i3 = _lua_newthread(i1) | 0;
+ _lua_pushvalue(i1, 1);
+ _lua_xmove(i1, i3, 1);
+ STACKTOP = i2;
+ return 1;
+}
+function _io_noclose(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ HEAP32[(_luaL_checkudata(i1, 1, 2832) | 0) + 4 >> 2] = 154;
+ _lua_pushnil(i1);
+ _lua_pushlstring(i1, 2840, 26) | 0;
+ STACKTOP = i2;
+ return 2;
+}
+function _io_fclose(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ i1 = _luaL_fileresult(i1, (_fclose(HEAP32[(_luaL_checkudata(i1, 1, 2832) | 0) >> 2] | 0) | 0) == 0 | 0, 0) | 0;
+ STACKTOP = i2;
+ return i1 | 0;
+}
+function _luaL_optnumber(i3, i4, d2) {
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ d2 = +d2;
+ var i1 = 0;
+ i1 = STACKTOP;
+ if ((_lua_type(i3, i4) | 0) >= 1) {
+ d2 = +_luaL_checknumber(i3, i4);
+ }
+ STACKTOP = i1;
+ return +d2;
+}
+function _math_atan2(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, d3 = 0.0;
+ i2 = STACKTOP;
+ d3 = +_luaL_checknumber(i1, 1);
+ _lua_pushnumber(i1, +Math_atan2(+d3, +(+_luaL_checknumber(i1, 2))));
+ STACKTOP = i2;
+ return 1;
+}
+function _luaK_codeABx(i4, i2, i3, i1) {
+ i4 = i4 | 0;
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ var i5 = 0;
+ i5 = STACKTOP;
+ i4 = _luaK_code(i4, i3 << 6 | i2 | i1 << 14) | 0;
+ STACKTOP = i5;
+ return i4 | 0;
+}
+function _luaF_newCclosure(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i3 = 0;
+ i3 = STACKTOP;
+ i2 = _luaC_newobj(i2, 38, (i1 << 4) + 16 | 0, 0, 0) | 0;
+ HEAP8[i2 + 6 | 0] = i1;
+ STACKTOP = i3;
+ return i2 | 0;
+}
+function _math_pow(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, d3 = 0.0;
+ i2 = STACKTOP;
+ d3 = +_luaL_checknumber(i1, 1);
+ _lua_pushnumber(i1, +Math_pow(+d3, +(+_luaL_checknumber(i1, 2))));
+ STACKTOP = i2;
+ return 1;
+}
+function _math_ldexp(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, d3 = 0.0;
+ i2 = STACKTOP;
+ d3 = +_luaL_checknumber(i1, 1);
+ _lua_pushnumber(i1, +_ldexp(d3, _luaL_checkinteger(i1, 2) | 0));
+ STACKTOP = i2;
+ return 1;
+}
+function _luaF_newupval(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ i1 = _luaC_newobj(i1, 10, 32, 0, 0) | 0;
+ HEAP32[i1 + 8 >> 2] = i1 + 16;
+ HEAP32[i1 + 24 >> 2] = 0;
+ STACKTOP = i2;
+ return i1 | 0;
+}
+function _lua_pushnumber(i2, d1) {
+ i2 = i2 | 0;
+ d1 = +d1;
+ var i3 = 0;
+ i2 = i2 + 8 | 0;
+ i3 = HEAP32[i2 >> 2] | 0;
+ HEAPF64[i3 >> 3] = d1;
+ HEAP32[i3 + 8 >> 2] = 3;
+ HEAP32[i2 >> 2] = i3 + 16;
+ return;
+}
+function _math_fmod(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, d3 = 0.0;
+ i2 = STACKTOP;
+ d3 = +_luaL_checknumber(i1, 1);
+ _lua_pushnumber(i1, +_fmod(+d3, +(+_luaL_checknumber(i1, 2))));
+ STACKTOP = i2;
+ return 1;
+}
+function _luaG_concaterror(i3, i2, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i4 = 0;
+ i4 = HEAP32[i2 + 8 >> 2] | 0;
+ _luaG_typeerror(i3, (i4 & 15 | 0) == 4 | (i4 | 0) == 3 ? i1 : i2, 1912);
+}
+function _luaB_rawequal(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _luaL_checkany(i1, 1);
+ _luaL_checkany(i1, 2);
+ _lua_pushboolean(i1, _lua_rawequal(i1, 1, 2) | 0);
+ STACKTOP = i2;
+ return 1;
+}
+function _db_getuservalue(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ if ((_lua_type(i1, 1) | 0) == 7) {
+ _lua_getuservalue(i1, 1);
+ } else {
+ _lua_pushnil(i1);
+ }
+ STACKTOP = i2;
+ return 1;
+}
+function _strchr(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i3 = 0;
+ i3 = STACKTOP;
+ i2 = ___strchrnul(i2, i1) | 0;
+ STACKTOP = i3;
+ return ((HEAP8[i2] | 0) == (i1 & 255) << 24 >> 24 ? i2 : 0) | 0;
+}
+function runPostSets() {}
+function _rand_r(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = (Math_imul(HEAP32[i1 >> 2] | 0, 31010991) | 0) + 1735287159 & 2147483647;
+ HEAP32[i1 >> 2] = i2;
+ return i2 | 0;
+}
+function _luaL_checkany(i1, i3) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ if ((_lua_type(i1, i3) | 0) == -1) {
+ _luaL_argerror(i1, i3, 1256) | 0;
+ }
+ STACKTOP = i2;
+ return;
+}
+function _i64Subtract(i2, i4, i1, i3) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i4 = i4 - i3 - (i1 >>> 0 > i2 >>> 0 | 0) >>> 0;
+ return (tempRet0 = i4, i2 - i1 >>> 0 | 0) | 0;
+}
+function _db_getmetatable(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _luaL_checkany(i1, 1);
+ if ((_lua_getmetatable(i1, 1) | 0) == 0) {
+ _lua_pushnil(i1);
+ }
+ STACKTOP = i2;
+ return 1;
+}
+function _luaB_rawget(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _luaL_checktype(i1, 1, 5);
+ _luaL_checkany(i1, 2);
+ _lua_settop(i1, 2);
+ _lua_rawget(i1, 1);
+ STACKTOP = i2;
+ return 1;
+}
+function _luaB_type(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _luaL_checkany(i1, 1);
+ _lua_pushstring(i1, _lua_typename(i1, _lua_type(i1, 1) | 0) | 0) | 0;
+ STACKTOP = i2;
+ return 1;
+}
+function dynCall_iiiii(i5, i4, i3, i2, i1) {
+ i5 = i5 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ return FUNCTION_TABLE_iiiii[i5 & 3](i4 | 0, i3 | 0, i2 | 0, i1 | 0) | 0;
+}
+function _lstop(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ _lua_sethook(i1, 0, 0, 0) | 0;
+ _luaL_error(i1, 200, i2) | 0;
+ STACKTOP = i2;
+ return;
+}
+function _i64Add(i1, i3, i4, i2) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ i2 = i2 | 0;
+ i4 = i1 + i4 >>> 0;
+ return (tempRet0 = i3 + i2 + (i4 >>> 0 < i1 >>> 0 | 0) >>> 0, i4 | 0) | 0;
+}
+function _luaK_ret(i3, i2, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i4 = 0;
+ i4 = STACKTOP;
+ _luaK_code(i3, i2 << 6 | (i1 << 23) + 8388608 | 31) | 0;
+ STACKTOP = i4;
+ return;
+}
+function _strpbrk(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i3 = 0;
+ i3 = STACKTOP;
+ i1 = i2 + (_strcspn(i2, i1) | 0) | 0;
+ STACKTOP = i3;
+ return ((HEAP8[i1] | 0) != 0 ? i1 : 0) | 0;
+}
+function _luaL_setmetatable(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i3 = 0;
+ i3 = STACKTOP;
+ _lua_getfield(i1, -1001e3, i2);
+ _lua_setmetatable(i1, -2) | 0;
+ STACKTOP = i3;
+ return;
+}
+function _lua_atpanic(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i3 = 0;
+ i3 = (HEAP32[i2 + 12 >> 2] | 0) + 168 | 0;
+ i2 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i3 >> 2] = i1;
+ return i2 | 0;
+}
+function _luaL_newstate() {
+ var i1 = 0, i2 = 0;
+ i2 = STACKTOP;
+ i1 = _lua_newstate(1, 0) | 0;
+ if ((i1 | 0) != 0) {
+ _lua_atpanic(i1, 143) | 0;
+ }
+ STACKTOP = i2;
+ return i1 | 0;
+}
+function _luaL_buffinit(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ HEAP32[i1 + 12 >> 2] = i2;
+ HEAP32[i1 >> 2] = i1 + 16;
+ HEAP32[i1 + 8 >> 2] = 0;
+ HEAP32[i1 + 4 >> 2] = 1024;
+ return;
+}
+function _strrchr(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i3 = 0;
+ i3 = STACKTOP;
+ i2 = ___memrchr(i1, i2, (_strlen(i1 | 0) | 0) + 1 | 0) | 0;
+ STACKTOP = i3;
+ return i2 | 0;
+}
+function _luaK_fixline(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ HEAP32[(HEAP32[(HEAP32[i1 >> 2] | 0) + 20 >> 2] | 0) + ((HEAP32[i1 + 20 >> 2] | 0) + -1 << 2) >> 2] = i2;
+ return;
+}
+function _luaX_lookahead(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i3 = STACKTOP;
+ i2 = _llex(i1, i1 + 40 | 0) | 0;
+ HEAP32[i1 + 32 >> 2] = i2;
+ STACKTOP = i3;
+ return i2 | 0;
+}
+function _f_call(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i3 = 0;
+ i3 = STACKTOP;
+ _luaD_call(i2, HEAP32[i1 >> 2] | 0, HEAP32[i1 + 4 >> 2] | 0, 0);
+ STACKTOP = i3;
+ return;
+}
+function _io_pclose(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _luaL_checkudata(i1, 1, 2832) | 0;
+ i1 = _luaL_execresult(i1, -1) | 0;
+ STACKTOP = i2;
+ return i1 | 0;
+}
+function _luaS_new(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i3 = 0;
+ i3 = STACKTOP;
+ i2 = _luaS_newlstr(i2, i1, _strlen(i1 | 0) | 0) | 0;
+ STACKTOP = i3;
+ return i2 | 0;
+}
+function _os_getenv(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_pushstring(i1, _getenv(_luaL_checklstring(i1, 1, 0) | 0) | 0) | 0;
+ STACKTOP = i2;
+ return 1;
+}
+function _math_rad(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_pushnumber(i1, +_luaL_checknumber(i1, 1) * .017453292519943295);
+ STACKTOP = i2;
+ return 1;
+}
+function _math_deg(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_pushnumber(i1, +_luaL_checknumber(i1, 1) / .017453292519943295);
+ STACKTOP = i2;
+ return 1;
+}
+function _writer(i4, i2, i1, i3) {
+ i4 = i4 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i4 = STACKTOP;
+ _luaL_addlstring(i3, i2, i1);
+ STACKTOP = i4;
+ return 0;
+}
+function _luaL_addstring(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i3 = 0;
+ i3 = STACKTOP;
+ _luaL_addlstring(i2, i1, _strlen(i1 | 0) | 0);
+ STACKTOP = i3;
+ return;
+}
+function _pcallcont(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ i1 = _finishpcall(i1, (_lua_getctx(i1, 0) | 0) == 1 | 0) | 0;
+ STACKTOP = i2;
+ return i1 | 0;
+}
+function _luaopen_coroutine(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_createtable(i1, 0, 6);
+ _luaL_setfuncs(i1, 10656, 0);
+ STACKTOP = i2;
+ return 1;
+}
+function _lua_version(i1) {
+ i1 = i1 | 0;
+ if ((i1 | 0) == 0) {
+ i1 = 920;
+ } else {
+ i1 = HEAP32[(HEAP32[i1 + 12 >> 2] | 0) + 176 >> 2] | 0;
+ }
+ return i1 | 0;
+}
+function _lua_pushnil(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i1 = i1 + 8 | 0;
+ i2 = HEAP32[i1 >> 2] | 0;
+ HEAP32[i2 + 8 >> 2] = 0;
+ HEAP32[i1 >> 2] = i2 + 16;
+ return;
+}
+function _math_floor(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_pushnumber(i1, +Math_floor(+(+_luaL_checknumber(i1, 1))));
+ STACKTOP = i2;
+ return 1;
+}
+function _laction(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _signal(i1 | 0, 0) | 0;
+ _lua_sethook(HEAP32[48] | 0, 1, 11, 1) | 0;
+ STACKTOP = i2;
+ return;
+}
+function dynCall_iiii(i4, i3, i2, i1) {
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ return FUNCTION_TABLE_iiii[i4 & 3](i3 | 0, i2 | 0, i1 | 0) | 0;
+}
+function _luaopen_debug(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_createtable(i1, 0, 16);
+ _luaL_setfuncs(i1, 11176, 0);
+ STACKTOP = i2;
+ return 1;
+}
+function _luaopen_bit32(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_createtable(i1, 0, 12);
+ _luaL_setfuncs(i1, 10240, 0);
+ STACKTOP = i2;
+ return 1;
+}
+function _math_sqrt(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_pushnumber(i1, +Math_sqrt(+(+_luaL_checknumber(i1, 1))));
+ STACKTOP = i2;
+ return 1;
+}
+function _math_ceil(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_pushnumber(i1, +Math_ceil(+(+_luaL_checknumber(i1, 1))));
+ STACKTOP = i2;
+ return 1;
+}
+function _math_atan(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_pushnumber(i1, +Math_atan(+(+_luaL_checknumber(i1, 1))));
+ STACKTOP = i2;
+ return 1;
+}
+function _math_asin(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_pushnumber(i1, +Math_asin(+(+_luaL_checknumber(i1, 1))));
+ STACKTOP = i2;
+ return 1;
+}
+function _math_acos(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_pushnumber(i1, +Math_acos(+(+_luaL_checknumber(i1, 1))));
+ STACKTOP = i2;
+ return 1;
+}
+function _lua_close(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _close_state(HEAP32[(HEAP32[i1 + 12 >> 2] | 0) + 172 >> 2] | 0);
+ STACKTOP = i2;
+ return;
+}
+function _dothecall(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ i2 = STACKTOP;
+ _luaD_call(i1, (HEAP32[i1 + 8 >> 2] | 0) + -32 | 0, 0, 0);
+ STACKTOP = i2;
+ return;
+}
+function _math_tan(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_pushnumber(i1, +Math_tan(+(+_luaL_checknumber(i1, 1))));
+ STACKTOP = i2;
+ return 1;
+}
+function _math_sin(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_pushnumber(i1, +Math_sin(+(+_luaL_checknumber(i1, 1))));
+ STACKTOP = i2;
+ return 1;
+}
+function _math_log10(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_pushnumber(i1, +_log10(+(+_luaL_checknumber(i1, 1))));
+ STACKTOP = i2;
+ return 1;
+}
+function _math_exp(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_pushnumber(i1, +Math_exp(+(+_luaL_checknumber(i1, 1))));
+ STACKTOP = i2;
+ return 1;
+}
+function _math_cos(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_pushnumber(i1, +Math_cos(+(+_luaL_checknumber(i1, 1))));
+ STACKTOP = i2;
+ return 1;
+}
+function _math_abs(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_pushnumber(i1, +Math_abs(+(+_luaL_checknumber(i1, 1))));
+ STACKTOP = i2;
+ return 1;
+}
+function _math_randomseed(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _srand(_luaL_checkunsigned(i1, 1) | 0);
+ _rand() | 0;
+ STACKTOP = i2;
+ return 0;
+}
+function _luaopen_os(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_createtable(i1, 0, 11);
+ _luaL_setfuncs(i1, 5624, 0);
+ STACKTOP = i2;
+ return 1;
+}
+function _math_tanh(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_pushnumber(i1, +_tanh(+(+_luaL_checknumber(i1, 1))));
+ STACKTOP = i2;
+ return 1;
+}
+function _math_sinh(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_pushnumber(i1, +_sinh(+(+_luaL_checknumber(i1, 1))));
+ STACKTOP = i2;
+ return 1;
+}
+function _math_cosh(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_pushnumber(i1, +_cosh(+(+_luaL_checknumber(i1, 1))));
+ STACKTOP = i2;
+ return 1;
+}
+function _luaB_yield(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ i1 = _lua_yieldk(i1, _lua_gettop(i1) | 0, 0, 0) | 0;
+ STACKTOP = i2;
+ return i1 | 0;
+}
+function _luaB_tostring(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _luaL_checkany(i1, 1);
+ _luaL_tolstring(i1, 1, 0) | 0;
+ STACKTOP = i2;
+ return 1;
+}
+function _growstack(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i3 = 0;
+ i3 = STACKTOP;
+ _luaD_growstack(i2, HEAP32[i1 >> 2] | 0);
+ STACKTOP = i3;
+ return;
+}
+function ___udivdi3(i4, i3, i2, i1) {
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ i4 = ___udivmoddi4(i4, i3, i2, i1, 0) | 0;
+ return i4 | 0;
+}
+function _b_not(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_pushunsigned(i1, ~(_luaL_checkunsigned(i1, 1) | 0));
+ STACKTOP = i2;
+ return 1;
+}
+function _luaO_fb2int(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = i1 >>> 3 & 31;
+ if ((i2 | 0) != 0) {
+ i1 = (i1 & 7 | 8) << i2 + -1;
+ }
+ return i1 | 0;
+}
+function _luaB_corunning(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_pushboolean(i1, _lua_pushthread(i1) | 0);
+ STACKTOP = i2;
+ return 2;
+}
+function stackAlloc(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + i1 | 0;
+ STACKTOP = STACKTOP + 7 & -8;
+ return i2 | 0;
+}
+function _strcoll(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i3 = 0;
+ i3 = STACKTOP;
+ i2 = _strcmp(i2, i1) | 0;
+ STACKTOP = i3;
+ return i2 | 0;
+}
+function _os_clock(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_pushnumber(i1, +(_clock() | 0) / 1.0e6);
+ STACKTOP = i2;
+ return 1;
+}
+function _dofilecont(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ i1 = (_lua_gettop(i1) | 0) + -1 | 0;
+ STACKTOP = i2;
+ return i1 | 0;
+}
+function _scalbnl(d2, i1) {
+ d2 = +d2;
+ i1 = i1 | 0;
+ var i3 = 0;
+ i3 = STACKTOP;
+ d2 = +_scalbn(d2, i1);
+ STACKTOP = i3;
+ return +d2;
+}
+function _tolower(i1) {
+ i1 = i1 | 0;
+ if ((i1 | 0) < 65) return i1 | 0;
+ if ((i1 | 0) > 90) return i1 | 0;
+ return i1 - 65 + 97 | 0;
+}
+function _lua_gettop(i1) {
+ i1 = i1 | 0;
+ return (HEAP32[i1 + 8 >> 2] | 0) - ((HEAP32[HEAP32[i1 + 16 >> 2] >> 2] | 0) + 16) >> 4 | 0;
+}
+function dynCall_iii(i3, i2, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ return FUNCTION_TABLE_iii[i3 & 1](i2 | 0, i1 | 0) | 0;
+}
+function _str_match(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ i1 = _str_find_aux(i1, 0) | 0;
+ STACKTOP = i2;
+ return i1 | 0;
+}
+function _luaM_toobig(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ _luaG_runerror(i1, 4144, i2);
+}
+function _luaK_getlabel(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = HEAP32[i1 + 20 >> 2] | 0;
+ HEAP32[i1 + 24 >> 2] = i2;
+ return i2 | 0;
+}
+function _ldexp(d2, i1) {
+ d2 = +d2;
+ i1 = i1 | 0;
+ var i3 = 0;
+ i3 = STACKTOP;
+ d2 = +_scalbn(d2, i1);
+ STACKTOP = i3;
+ return +d2;
+}
+function _str_find(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ i1 = _str_find_aux(i1, 1) | 0;
+ STACKTOP = i2;
+ return i1 | 0;
+}
+function _db_getregistry(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _lua_pushvalue(i1, -1001e3);
+ STACKTOP = i2;
+ return 1;
+}
+function _luaB_ipairs(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _pairsmeta(i1, 9960, 1, 165);
+ STACKTOP = i2;
+ return 3;
+}
+function _strlen(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = i1;
+ while (HEAP8[i2] | 0) {
+ i2 = i2 + 1 | 0;
+ }
+ return i2 - i1 | 0;
+}
+function _luaB_pairs(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _pairsmeta(i1, 9864, 0, 93);
+ STACKTOP = i2;
+ return 3;
+}
+function setThrew(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ if ((__THREW__ | 0) == 0) {
+ __THREW__ = i1;
+ threwValue = i2;
+ }
+}
+function _io_output(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _g_iofile(i1, 2800, 3512);
+ STACKTOP = i2;
+ return 1;
+}
+function dynCall_vii(i3, i2, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ FUNCTION_TABLE_vii[i3 & 15](i2 | 0, i1 | 0);
+}
+function _io_input(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ _g_iofile(i1, 2776, 3480);
+ STACKTOP = i2;
+ return 1;
+}
+function _semerror(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ HEAP32[i2 + 16 >> 2] = 0;
+ _luaX_syntaxerror(i2, i1);
+}
+function _luaX_syntaxerror(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ _lexerror(i1, i2, HEAP32[i1 + 16 >> 2] | 0);
+}
+function b4(i1, i2, i3, i4) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ abort(4);
+ return 0;
+}
+function _lua_typename(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ return HEAP32[8528 + (i1 + 1 << 2) >> 2] | 0;
+}
+function dynCall_ii(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ return FUNCTION_TABLE_ii[i2 & 255](i1 | 0) | 0;
+}
+function dynCall_vi(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ FUNCTION_TABLE_vi[i2 & 1](i1 | 0);
+}
+function b0(i1, i2, i3) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ abort(0);
+ return 0;
+}
+function _lua_gethookmask(i1) {
+ i1 = i1 | 0;
+ return HEAPU8[i1 + 40 | 0] | 0 | 0;
+}
+function _lua_gethookcount(i1) {
+ i1 = i1 | 0;
+ return HEAP32[i1 + 44 >> 2] | 0;
+}
+function _lua_status(i1) {
+ i1 = i1 | 0;
+ return HEAPU8[i1 + 6 | 0] | 0 | 0;
+}
+function _lua_gethook(i1) {
+ i1 = i1 | 0;
+ return HEAP32[i1 + 52 >> 2] | 0;
+}
+function b5(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ abort(5);
+ return 0;
+}
+function _lua_error(i1) {
+ i1 = i1 | 0;
+ _luaG_errormsg(i1);
+ return 0;
+}
+function b2(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ abort(2);
+}
+function stackRestore(i1) {
+ i1 = i1 | 0;
+ STACKTOP = i1;
+}
+function setTempRet9(i1) {
+ i1 = i1 | 0;
+ tempRet9 = i1;
+}
+function setTempRet8(i1) {
+ i1 = i1 | 0;
+ tempRet8 = i1;
+}
+function setTempRet7(i1) {
+ i1 = i1 | 0;
+ tempRet7 = i1;
+}
+function setTempRet6(i1) {
+ i1 = i1 | 0;
+ tempRet6 = i1;
+}
+function setTempRet5(i1) {
+ i1 = i1 | 0;
+ tempRet5 = i1;
+}
+function setTempRet4(i1) {
+ i1 = i1 | 0;
+ tempRet4 = i1;
+}
+function setTempRet3(i1) {
+ i1 = i1 | 0;
+ tempRet3 = i1;
+}
+function setTempRet2(i1) {
+ i1 = i1 | 0;
+ tempRet2 = i1;
+}
+function setTempRet1(i1) {
+ i1 = i1 | 0;
+ tempRet1 = i1;
+}
+function setTempRet0(i1) {
+ i1 = i1 | 0;
+ tempRet0 = i1;
+}
+function b3(i1) {
+ i1 = i1 | 0;
+ abort(3);
+ return 0;
+}
+function _rand() {
+ return _rand_r(___rand_seed) | 0;
+}
+function stackSave() {
+ return STACKTOP | 0;
+}
+function b1(i1) {
+ i1 = i1 | 0;
+ abort(1);
+}
+
+// EMSCRIPTEN_END_FUNCS
+ var FUNCTION_TABLE_iiii = [b0,_getF,_getS,_generic_reader];
+ var FUNCTION_TABLE_vi = [b1,_laction];
+ var FUNCTION_TABLE_vii = [b2,_lstop,_growstack,_f_call,_resume,_unroll,_f_parser,_dothecall,_f_luaopen,_hookf,b2,b2,b2,b2,b2,b2];
+ var FUNCTION_TABLE_ii = [b3,_io_close,_io_flush,_io_input,_io_lines,_io_open,_io_output,_io_popen,_io_read,_io_tmpfile,_io_type,_io_write,_f_flush,_f_lines,_f_read,_f_seek,_f_setvbuf,_f_write,_f_gc,_f_tostring,_math_abs,_math_acos,_math_asin,_math_atan2,_math_atan,_math_ceil,_math_cosh,_math_cos,_math_deg
+ ,_math_exp,_math_floor,_math_fmod,_math_frexp,_math_ldexp,_math_log10,_math_log,_math_max,_math_min,_math_modf,_math_pow,_math_rad,_math_random,_math_randomseed,_math_sinh,_math_sin,_math_sqrt,_math_tanh,_math_tan,_ll_loadlib,_ll_searchpath,_ll_seeall,_ll_module,_ll_require,_os_clock,_os_date,_os_difftime,_os_execute,_os_exit,_os_getenv
+ ,_os_remove,_os_rename,_os_setlocale,_os_time,_os_tmpname,_str_byte,_str_char,_str_dump,_str_find,_str_format,_gmatch,_str_gsub,_str_len,_str_lower,_str_match,_str_rep,_str_reverse,_str_sub,_str_upper,_tconcat,_maxn,_tinsert,_pack,_unpack,_tremove,_sort,_luaB_assert,_luaB_collectgarbage,_luaB_dofile,_luaB_error
+ ,_luaB_getmetatable,_luaB_ipairs,_luaB_loadfile,_luaB_load,_luaB_next,_luaB_pairs,_luaB_pcall,_luaB_print,_luaB_rawequal,_luaB_rawlen,_luaB_rawget,_luaB_rawset,_luaB_select,_luaB_setmetatable,_luaB_tonumber,_luaB_tostring,_luaB_type,_luaB_xpcall,_b_arshift,_b_and,_b_not,_b_or,_b_xor,_b_test,_b_extract,_b_lrot,_b_lshift,_b_replace,_b_rrot,_b_rshift
+ ,_luaB_cocreate,_luaB_coresume,_luaB_corunning,_luaB_costatus,_luaB_cowrap,_luaB_yield,_db_debug,_db_getuservalue,_db_gethook,_db_getinfo,_db_getlocal,_db_getregistry,_db_getmetatable,_db_getupvalue,_db_upvaluejoin,_db_upvalueid,_db_setuservalue,_db_sethook,_db_setlocal,_db_setmetatable,_db_setupvalue,_db_traceback,_pmain,_traceback,_panic,_luaopen_base,_luaopen_package,_luaopen_coroutine,_luaopen_table,_luaopen_io
+ ,_luaopen_os,_luaopen_string,_luaopen_bit32,_luaopen_math,_luaopen_debug,_io_noclose,_io_readline,_io_fclose,_io_pclose,_gctm,_searcher_preload,_searcher_Lua,_searcher_C,_searcher_Croot,_gmatch_aux,_dofilecont,_ipairsaux,_pcallcont,_luaB_auxwrap,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3
+ ,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3
+ ,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3
+ ,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3,b3];
+ var FUNCTION_TABLE_iiiii = [b4,_l_alloc,_writer,b4];
+ var FUNCTION_TABLE_iii = [b5,_lua_newstate];
+
+ return { _testSetjmp: _testSetjmp, _i64Subtract: _i64Subtract, _free: _free, _main: _main, _rand_r: _rand_r, _realloc: _realloc, _i64Add: _i64Add, _tolower: _tolower, _saveSetjmp: _saveSetjmp, _memset: _memset, _malloc: _malloc, _memcpy: _memcpy, _strlen: _strlen, _rand: _rand, _bitshift64Shl: _bitshift64Shl, runPostSets: runPostSets, stackAlloc: stackAlloc, stackSave: stackSave, stackRestore: stackRestore, setThrew: setThrew, setTempRet0: setTempRet0, setTempRet1: setTempRet1, setTempRet2: setTempRet2, setTempRet3: setTempRet3, setTempRet4: setTempRet4, setTempRet5: setTempRet5, setTempRet6: setTempRet6, setTempRet7: setTempRet7, setTempRet8: setTempRet8, setTempRet9: setTempRet9, dynCall_iiii: dynCall_iiii, dynCall_vi: dynCall_vi, dynCall_vii: dynCall_vii, dynCall_ii: dynCall_ii, dynCall_iiiii: dynCall_iiiii, dynCall_iii: dynCall_iii };
+}).toString(),
+// EMSCRIPTEN_END_ASM
+{ "Math": Math, "Int8Array": Int8Array, "Int16Array": Int16Array, "Int32Array": Int32Array, "Uint8Array": Uint8Array, "Uint16Array": Uint16Array, "Uint32Array": Uint32Array, "Float32Array": Float32Array, "Float64Array": Float64Array, "abort": abort, "assert": assert, "asmPrintInt": asmPrintInt, "asmPrintFloat": asmPrintFloat, "min": Math_min, "invoke_iiii": invoke_iiii, "invoke_vi": invoke_vi, "invoke_vii": invoke_vii, "invoke_ii": invoke_ii, "invoke_iiiii": invoke_iiiii, "invoke_iii": invoke_iii, "_isalnum": _isalnum, "_fabs": _fabs, "_frexp": _frexp, "_exp": _exp, "_fread": _fread, "__reallyNegative": __reallyNegative, "_longjmp": _longjmp, "__addDays": __addDays, "_fsync": _fsync, "_signal": _signal, "_rename": _rename, "_sbrk": _sbrk, "_emscripten_memcpy_big": _emscripten_memcpy_big, "_sinh": _sinh, "_sysconf": _sysconf, "_close": _close, "_ferror": _ferror, "_clock": _clock, "_cos": _cos, "_tanh": _tanh, "_unlink": _unlink, "_write": _write, "__isLeapYear": __isLeapYear, "_ftell": _ftell, "_isupper": _isupper, "_gmtime_r": _gmtime_r, "_islower": _islower, "_tmpnam": _tmpnam, "_tmpfile": _tmpfile, "_send": _send, "_abort": _abort, "_setvbuf": _setvbuf, "_atan2": _atan2, "_setlocale": _setlocale, "_isgraph": _isgraph, "_modf": _modf, "_strerror_r": _strerror_r, "_fscanf": _fscanf, "___setErrNo": ___setErrNo, "_isalpha": _isalpha, "_srand": _srand, "_mktime": _mktime, "_putchar": _putchar, "_gmtime": _gmtime, "_localeconv": _localeconv, "_sprintf": _sprintf, "_localtime": _localtime, "_read": _read, "_fwrite": _fwrite, "_time": _time, "_fprintf": _fprintf, "_exit": _exit, "_freopen": _freopen, "_llvm_pow_f64": _llvm_pow_f64, "_fgetc": _fgetc, "_fmod": _fmod, "_lseek": _lseek, "_rmdir": _rmdir, "_asin": _asin, "_floor": _floor, "_pwrite": _pwrite, "_localtime_r": _localtime_r, "_tzset": _tzset, "_open": _open, "_remove": _remove, "_snprintf": _snprintf, "__scanString": __scanString, "_strftime": _strftime, "_fseek": _fseek, "_iscntrl": _iscntrl, "_isxdigit": _isxdigit, "_fclose": _fclose, "_log": _log, "_recv": _recv, "_tan": _tan, "_copysign": _copysign, "__getFloat": __getFloat, "_fputc": _fputc, "_ispunct": _ispunct, "_ceil": _ceil, "_isspace": _isspace, "_fopen": _fopen, "_sin": _sin, "_acos": _acos, "_cosh": _cosh, "___buildEnvironment": ___buildEnvironment, "_difftime": _difftime, "_ungetc": _ungetc, "_system": _system, "_fflush": _fflush, "_log10": _log10, "_fileno": _fileno, "__exit": __exit, "__arraySum": __arraySum, "_fgets": _fgets, "_atan": _atan, "_pread": _pread, "_mkport": _mkport, "_toupper": _toupper, "_feof": _feof, "___errno_location": ___errno_location, "_clearerr": _clearerr, "_getenv": _getenv, "_strerror": _strerror, "_emscripten_longjmp": _emscripten_longjmp, "__formatString": __formatString, "_fputs": _fputs, "_sqrt": _sqrt, "STACKTOP": STACKTOP, "STACK_MAX": STACK_MAX, "tempDoublePtr": tempDoublePtr, "ABORT": ABORT, "cttz_i8": cttz_i8, "ctlz_i8": ctlz_i8, "___rand_seed": ___rand_seed, "NaN": NaN, "Infinity": Infinity, "_stderr": _stderr, "_stdin": _stdin, "_stdout": _stdout }, buffer);
+var _testSetjmp = Module["_testSetjmp"] = asm["_testSetjmp"];
+var _i64Subtract = Module["_i64Subtract"] = asm["_i64Subtract"];
+var _free = Module["_free"] = asm["_free"];
+var _main = Module["_main"] = asm["_main"];
+var _rand_r = Module["_rand_r"] = asm["_rand_r"];
+var _realloc = Module["_realloc"] = asm["_realloc"];
+var _i64Add = Module["_i64Add"] = asm["_i64Add"];
+var _tolower = Module["_tolower"] = asm["_tolower"];
+var _saveSetjmp = Module["_saveSetjmp"] = asm["_saveSetjmp"];
+var _memset = Module["_memset"] = asm["_memset"];
+var _malloc = Module["_malloc"] = asm["_malloc"];
+var _memcpy = Module["_memcpy"] = asm["_memcpy"];
+var _strlen = Module["_strlen"] = asm["_strlen"];
+var _rand = Module["_rand"] = asm["_rand"];
+var _bitshift64Shl = Module["_bitshift64Shl"] = asm["_bitshift64Shl"];
+var runPostSets = Module["runPostSets"] = asm["runPostSets"];
+var dynCall_iiii = Module["dynCall_iiii"] = asm["dynCall_iiii"];
+var dynCall_vi = Module["dynCall_vi"] = asm["dynCall_vi"];
+var dynCall_vii = Module["dynCall_vii"] = asm["dynCall_vii"];
+var dynCall_ii = Module["dynCall_ii"] = asm["dynCall_ii"];
+var dynCall_iiiii = Module["dynCall_iiiii"] = asm["dynCall_iiiii"];
+var dynCall_iii = Module["dynCall_iii"] = asm["dynCall_iii"];
+
+Runtime.stackAlloc = function(size) { return asm['stackAlloc'](size) };
+Runtime.stackSave = function() { return asm['stackSave']() };
+Runtime.stackRestore = function(top) { asm['stackRestore'](top) };
+
+
+// TODO: strip out parts of this we do not need
+
+//======= begin closure i64 code =======
+
+// Copyright 2009 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+// http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/**
+ * @fileoverview Defines a Long class for representing a 64-bit two's-complement
+ * integer value, which faithfully simulates the behavior of a Java "long". This
+ * implementation is derived from LongLib in GWT.
+ *
+ */
+
+var i64Math = (function() { // Emscripten wrapper
+ var goog = { math: {} };
+
+
+ /**
+ * Constructs a 64-bit two's-complement integer, given its low and high 32-bit
+ * values as *signed* integers. See the from* functions below for more
+ * convenient ways of constructing Longs.
+ *
+ * The internal representation of a long is the two given signed, 32-bit values.
+ * We use 32-bit pieces because these are the size of integers on which
+ * Javascript performs bit-operations. For operations like addition and
+ * multiplication, we split each number into 16-bit pieces, which can easily be
+ * multiplied within Javascript's floating-point representation without overflow
+ * or change in sign.
+ *
+ * In the algorithms below, we frequently reduce the negative case to the
+ * positive case by negating the input(s) and then post-processing the result.
+ * Note that we must ALWAYS check specially whether those values are MIN_VALUE
+ * (-2^63) because -MIN_VALUE == MIN_VALUE (since 2^63 cannot be represented as
+ * a positive number, it overflows back into a negative). Not handling this
+ * case would often result in infinite recursion.
+ *
+ * @param {number} low The low (signed) 32 bits of the long.
+ * @param {number} high The high (signed) 32 bits of the long.
+ * @constructor
+ */
+ goog.math.Long = function(low, high) {
+ /**
+ * @type {number}
+ * @private
+ */
+ this.low_ = low | 0; // force into 32 signed bits.
+
+ /**
+ * @type {number}
+ * @private
+ */
+ this.high_ = high | 0; // force into 32 signed bits.
+ };
+
+
+ // NOTE: Common constant values ZERO, ONE, NEG_ONE, etc. are defined below the
+ // from* methods on which they depend.
+
+
+ /**
+ * A cache of the Long representations of small integer values.
+ * @type {!Object}
+ * @private
+ */
+ goog.math.Long.IntCache_ = {};
+
+
+ /**
+ * Returns a Long representing the given (32-bit) integer value.
+ * @param {number} value The 32-bit integer in question.
+ * @return {!goog.math.Long} The corresponding Long value.
+ */
+ goog.math.Long.fromInt = function(value) {
+ if (-128 <= value && value < 128) {
+ var cachedObj = goog.math.Long.IntCache_[value];
+ if (cachedObj) {
+ return cachedObj;
+ }
+ }
+
+ var obj = new goog.math.Long(value | 0, value < 0 ? -1 : 0);
+ if (-128 <= value && value < 128) {
+ goog.math.Long.IntCache_[value] = obj;
+ }
+ return obj;
+ };
+
+
+ /**
+ * Returns a Long representing the given value, provided that it is a finite
+ * number. Otherwise, zero is returned.
+ * @param {number} value The number in question.
+ * @return {!goog.math.Long} The corresponding Long value.
+ */
+ goog.math.Long.fromNumber = function(value) {
+ if (isNaN(value) || !isFinite(value)) {
+ return goog.math.Long.ZERO;
+ } else if (value <= -goog.math.Long.TWO_PWR_63_DBL_) {
+ return goog.math.Long.MIN_VALUE;
+ } else if (value + 1 >= goog.math.Long.TWO_PWR_63_DBL_) {
+ return goog.math.Long.MAX_VALUE;
+ } else if (value < 0) {
+ return goog.math.Long.fromNumber(-value).negate();
+ } else {
+ return new goog.math.Long(
+ (value % goog.math.Long.TWO_PWR_32_DBL_) | 0,
+ (value / goog.math.Long.TWO_PWR_32_DBL_) | 0);
+ }
+ };
+
+
+ /**
+ * Returns a Long representing the 64-bit integer that comes by concatenating
+ * the given high and low bits. Each is assumed to use 32 bits.
+ * @param {number} lowBits The low 32-bits.
+ * @param {number} highBits The high 32-bits.
+ * @return {!goog.math.Long} The corresponding Long value.
+ */
+ goog.math.Long.fromBits = function(lowBits, highBits) {
+ return new goog.math.Long(lowBits, highBits);
+ };
+
+
+ /**
+ * Returns a Long representation of the given string, written using the given
+ * radix.
+ * @param {string} str The textual representation of the Long.
+ * @param {number=} opt_radix The radix in which the text is written.
+ * @return {!goog.math.Long} The corresponding Long value.
+ */
+ goog.math.Long.fromString = function(str, opt_radix) {
+ if (str.length == 0) {
+ throw Error('number format error: empty string');
+ }
+
+ var radix = opt_radix || 10;
+ if (radix < 2 || 36 < radix) {
+ throw Error('radix out of range: ' + radix);
+ }
+
+ if (str.charAt(0) == '-') {
+ return goog.math.Long.fromString(str.substring(1), radix).negate();
+ } else if (str.indexOf('-') >= 0) {
+ throw Error('number format error: interior "-" character: ' + str);
+ }
+
+ // Do several (8) digits each time through the loop, so as to
+ // minimize the calls to the very expensive emulated div.
+ var radixToPower = goog.math.Long.fromNumber(Math.pow(radix, 8));
+
+ var result = goog.math.Long.ZERO;
+ for (var i = 0; i < str.length; i += 8) {
+ var size = Math.min(8, str.length - i);
+ var value = parseInt(str.substring(i, i + size), radix);
+ if (size < 8) {
+ var power = goog.math.Long.fromNumber(Math.pow(radix, size));
+ result = result.multiply(power).add(goog.math.Long.fromNumber(value));
+ } else {
+ result = result.multiply(radixToPower);
+ result = result.add(goog.math.Long.fromNumber(value));
+ }
+ }
+ return result;
+ };
+
+
+ // NOTE: the compiler should inline these constant values below and then remove
+ // these variables, so there should be no runtime penalty for these.
+
+
+ /**
+ * Number used repeated below in calculations. This must appear before the
+ * first call to any from* function below.
+ * @type {number}
+ * @private
+ */
+ goog.math.Long.TWO_PWR_16_DBL_ = 1 << 16;
+
+
+ /**
+ * @type {number}
+ * @private
+ */
+ goog.math.Long.TWO_PWR_24_DBL_ = 1 << 24;
+
+
+ /**
+ * @type {number}
+ * @private
+ */
+ goog.math.Long.TWO_PWR_32_DBL_ =
+ goog.math.Long.TWO_PWR_16_DBL_ * goog.math.Long.TWO_PWR_16_DBL_;
+
+
+ /**
+ * @type {number}
+ * @private
+ */
+ goog.math.Long.TWO_PWR_31_DBL_ =
+ goog.math.Long.TWO_PWR_32_DBL_ / 2;
+
+
+ /**
+ * @type {number}
+ * @private
+ */
+ goog.math.Long.TWO_PWR_48_DBL_ =
+ goog.math.Long.TWO_PWR_32_DBL_ * goog.math.Long.TWO_PWR_16_DBL_;
+
+
+ /**
+ * @type {number}
+ * @private
+ */
+ goog.math.Long.TWO_PWR_64_DBL_ =
+ goog.math.Long.TWO_PWR_32_DBL_ * goog.math.Long.TWO_PWR_32_DBL_;
+
+
+ /**
+ * @type {number}
+ * @private
+ */
+ goog.math.Long.TWO_PWR_63_DBL_ =
+ goog.math.Long.TWO_PWR_64_DBL_ / 2;
+
+
+ /** @type {!goog.math.Long} */
+ goog.math.Long.ZERO = goog.math.Long.fromInt(0);
+
+
+ /** @type {!goog.math.Long} */
+ goog.math.Long.ONE = goog.math.Long.fromInt(1);
+
+
+ /** @type {!goog.math.Long} */
+ goog.math.Long.NEG_ONE = goog.math.Long.fromInt(-1);
+
+
+ /** @type {!goog.math.Long} */
+ goog.math.Long.MAX_VALUE =
+ goog.math.Long.fromBits(0xFFFFFFFF | 0, 0x7FFFFFFF | 0);
+
+
+ /** @type {!goog.math.Long} */
+ goog.math.Long.MIN_VALUE = goog.math.Long.fromBits(0, 0x80000000 | 0);
+
+
+ /**
+ * @type {!goog.math.Long}
+ * @private
+ */
+ goog.math.Long.TWO_PWR_24_ = goog.math.Long.fromInt(1 << 24);
+
+
+ /** @return {number} The value, assuming it is a 32-bit integer. */
+ goog.math.Long.prototype.toInt = function() {
+ return this.low_;
+ };
+
+
+ /** @return {number} The closest floating-point representation to this value. */
+ goog.math.Long.prototype.toNumber = function() {
+ return this.high_ * goog.math.Long.TWO_PWR_32_DBL_ +
+ this.getLowBitsUnsigned();
+ };
+
+
+ /**
+ * @param {number=} opt_radix The radix in which the text should be written.
+ * @return {string} The textual representation of this value.
+ */
+ goog.math.Long.prototype.toString = function(opt_radix) {
+ var radix = opt_radix || 10;
+ if (radix < 2 || 36 < radix) {
+ throw Error('radix out of range: ' + radix);
+ }
+
+ if (this.isZero()) {
+ return '0';
+ }
+
+ if (this.isNegative()) {
+ if (this.equals(goog.math.Long.MIN_VALUE)) {
+ // We need to change the Long value before it can be negated, so we remove
+ // the bottom-most digit in this base and then recurse to do the rest.
+ var radixLong = goog.math.Long.fromNumber(radix);
+ var div = this.div(radixLong);
+ var rem = div.multiply(radixLong).subtract(this);
+ return div.toString(radix) + rem.toInt().toString(radix);
+ } else {
+ return '-' + this.negate().toString(radix);
+ }
+ }
+
+ // Do several (6) digits each time through the loop, so as to
+ // minimize the calls to the very expensive emulated div.
+ var radixToPower = goog.math.Long.fromNumber(Math.pow(radix, 6));
+
+ var rem = this;
+ var result = '';
+ while (true) {
+ var remDiv = rem.div(radixToPower);
+ var intval = rem.subtract(remDiv.multiply(radixToPower)).toInt();
+ var digits = intval.toString(radix);
+
+ rem = remDiv;
+ if (rem.isZero()) {
+ return digits + result;
+ } else {
+ while (digits.length < 6) {
+ digits = '0' + digits;
+ }
+ result = '' + digits + result;
+ }
+ }
+ };
+
+
+ /** @return {number} The high 32-bits as a signed value. */
+ goog.math.Long.prototype.getHighBits = function() {
+ return this.high_;
+ };
+
+
+ /** @return {number} The low 32-bits as a signed value. */
+ goog.math.Long.prototype.getLowBits = function() {
+ return this.low_;
+ };
+
+
+ /** @return {number} The low 32-bits as an unsigned value. */
+ goog.math.Long.prototype.getLowBitsUnsigned = function() {
+ return (this.low_ >= 0) ?
+ this.low_ : goog.math.Long.TWO_PWR_32_DBL_ + this.low_;
+ };
+
+
+ /**
+ * @return {number} Returns the number of bits needed to represent the absolute
+ * value of this Long.
+ */
+ goog.math.Long.prototype.getNumBitsAbs = function() {
+ if (this.isNegative()) {
+ if (this.equals(goog.math.Long.MIN_VALUE)) {
+ return 64;
+ } else {
+ return this.negate().getNumBitsAbs();
+ }
+ } else {
+ var val = this.high_ != 0 ? this.high_ : this.low_;
+ for (var bit = 31; bit > 0; bit--) {
+ if ((val & (1 << bit)) != 0) {
+ break;
+ }
+ }
+ return this.high_ != 0 ? bit + 33 : bit + 1;
+ }
+ };
+
+
+ /** @return {boolean} Whether this value is zero. */
+ goog.math.Long.prototype.isZero = function() {
+ return this.high_ == 0 && this.low_ == 0;
+ };
+
+
+ /** @return {boolean} Whether this value is negative. */
+ goog.math.Long.prototype.isNegative = function() {
+ return this.high_ < 0;
+ };
+
+
+ /** @return {boolean} Whether this value is odd. */
+ goog.math.Long.prototype.isOdd = function() {
+ return (this.low_ & 1) == 1;
+ };
+
+
+ /**
+ * @param {goog.math.Long} other Long to compare against.
+ * @return {boolean} Whether this Long equals the other.
+ */
+ goog.math.Long.prototype.equals = function(other) {
+ return (this.high_ == other.high_) && (this.low_ == other.low_);
+ };
+
+
+ /**
+ * @param {goog.math.Long} other Long to compare against.
+ * @return {boolean} Whether this Long does not equal the other.
+ */
+ goog.math.Long.prototype.notEquals = function(other) {
+ return (this.high_ != other.high_) || (this.low_ != other.low_);
+ };
+
+
+ /**
+ * @param {goog.math.Long} other Long to compare against.
+ * @return {boolean} Whether this Long is less than the other.
+ */
+ goog.math.Long.prototype.lessThan = function(other) {
+ return this.compare(other) < 0;
+ };
+
+
+ /**
+ * @param {goog.math.Long} other Long to compare against.
+ * @return {boolean} Whether this Long is less than or equal to the other.
+ */
+ goog.math.Long.prototype.lessThanOrEqual = function(other) {
+ return this.compare(other) <= 0;
+ };
+
+
+ /**
+ * @param {goog.math.Long} other Long to compare against.
+ * @return {boolean} Whether this Long is greater than the other.
+ */
+ goog.math.Long.prototype.greaterThan = function(other) {
+ return this.compare(other) > 0;
+ };
+
+
+ /**
+ * @param {goog.math.Long} other Long to compare against.
+ * @return {boolean} Whether this Long is greater than or equal to the other.
+ */
+ goog.math.Long.prototype.greaterThanOrEqual = function(other) {
+ return this.compare(other) >= 0;
+ };
+
+
+ /**
+ * Compares this Long with the given one.
+ * @param {goog.math.Long} other Long to compare against.
+ * @return {number} 0 if they are the same, 1 if the this is greater, and -1
+ * if the given one is greater.
+ */
+ goog.math.Long.prototype.compare = function(other) {
+ if (this.equals(other)) {
+ return 0;
+ }
+
+ var thisNeg = this.isNegative();
+ var otherNeg = other.isNegative();
+ if (thisNeg && !otherNeg) {
+ return -1;
+ }
+ if (!thisNeg && otherNeg) {
+ return 1;
+ }
+
+ // at this point, the signs are the same, so subtraction will not overflow
+ if (this.subtract(other).isNegative()) {
+ return -1;
+ } else {
+ return 1;
+ }
+ };
+
+
+ /** @return {!goog.math.Long} The negation of this value. */
+ goog.math.Long.prototype.negate = function() {
+ if (this.equals(goog.math.Long.MIN_VALUE)) {
+ return goog.math.Long.MIN_VALUE;
+ } else {
+ return this.not().add(goog.math.Long.ONE);
+ }
+ };
+
+
+ /**
+ * Returns the sum of this and the given Long.
+ * @param {goog.math.Long} other Long to add to this one.
+ * @return {!goog.math.Long} The sum of this and the given Long.
+ */
+ goog.math.Long.prototype.add = function(other) {
+ // Divide each number into 4 chunks of 16 bits, and then sum the chunks.
+
+ var a48 = this.high_ >>> 16;
+ var a32 = this.high_ & 0xFFFF;
+ var a16 = this.low_ >>> 16;
+ var a00 = this.low_ & 0xFFFF;
+
+ var b48 = other.high_ >>> 16;
+ var b32 = other.high_ & 0xFFFF;
+ var b16 = other.low_ >>> 16;
+ var b00 = other.low_ & 0xFFFF;
+
+ var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
+ c00 += a00 + b00;
+ c16 += c00 >>> 16;
+ c00 &= 0xFFFF;
+ c16 += a16 + b16;
+ c32 += c16 >>> 16;
+ c16 &= 0xFFFF;
+ c32 += a32 + b32;
+ c48 += c32 >>> 16;
+ c32 &= 0xFFFF;
+ c48 += a48 + b48;
+ c48 &= 0xFFFF;
+ return goog.math.Long.fromBits((c16 << 16) | c00, (c48 << 16) | c32);
+ };
+
+
+ /**
+ * Returns the difference of this and the given Long.
+ * @param {goog.math.Long} other Long to subtract from this.
+ * @return {!goog.math.Long} The difference of this and the given Long.
+ */
+ goog.math.Long.prototype.subtract = function(other) {
+ return this.add(other.negate());
+ };
+
+
+ /**
+ * Returns the product of this and the given long.
+ * @param {goog.math.Long} other Long to multiply with this.
+ * @return {!goog.math.Long} The product of this and the other.
+ */
+ goog.math.Long.prototype.multiply = function(other) {
+ if (this.isZero()) {
+ return goog.math.Long.ZERO;
+ } else if (other.isZero()) {
+ return goog.math.Long.ZERO;
+ }
+
+ if (this.equals(goog.math.Long.MIN_VALUE)) {
+ return other.isOdd() ? goog.math.Long.MIN_VALUE : goog.math.Long.ZERO;
+ } else if (other.equals(goog.math.Long.MIN_VALUE)) {
+ return this.isOdd() ? goog.math.Long.MIN_VALUE : goog.math.Long.ZERO;
+ }
+
+ if (this.isNegative()) {
+ if (other.isNegative()) {
+ return this.negate().multiply(other.negate());
+ } else {
+ return this.negate().multiply(other).negate();
+ }
+ } else if (other.isNegative()) {
+ return this.multiply(other.negate()).negate();
+ }
+
+ // If both longs are small, use float multiplication
+ if (this.lessThan(goog.math.Long.TWO_PWR_24_) &&
+ other.lessThan(goog.math.Long.TWO_PWR_24_)) {
+ return goog.math.Long.fromNumber(this.toNumber() * other.toNumber());
+ }
+
+ // Divide each long into 4 chunks of 16 bits, and then add up 4x4 products.
+ // We can skip products that would overflow.
+
+ var a48 = this.high_ >>> 16;
+ var a32 = this.high_ & 0xFFFF;
+ var a16 = this.low_ >>> 16;
+ var a00 = this.low_ & 0xFFFF;
+
+ var b48 = other.high_ >>> 16;
+ var b32 = other.high_ & 0xFFFF;
+ var b16 = other.low_ >>> 16;
+ var b00 = other.low_ & 0xFFFF;
+
+ var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
+ c00 += a00 * b00;
+ c16 += c00 >>> 16;
+ c00 &= 0xFFFF;
+ c16 += a16 * b00;
+ c32 += c16 >>> 16;
+ c16 &= 0xFFFF;
+ c16 += a00 * b16;
+ c32 += c16 >>> 16;
+ c16 &= 0xFFFF;
+ c32 += a32 * b00;
+ c48 += c32 >>> 16;
+ c32 &= 0xFFFF;
+ c32 += a16 * b16;
+ c48 += c32 >>> 16;
+ c32 &= 0xFFFF;
+ c32 += a00 * b32;
+ c48 += c32 >>> 16;
+ c32 &= 0xFFFF;
+ c48 += a48 * b00 + a32 * b16 + a16 * b32 + a00 * b48;
+ c48 &= 0xFFFF;
+ return goog.math.Long.fromBits((c16 << 16) | c00, (c48 << 16) | c32);
+ };
+
+
+ /**
+ * Returns this Long divided by the given one.
+ * @param {goog.math.Long} other Long by which to divide.
+ * @return {!goog.math.Long} This Long divided by the given one.
+ */
+ goog.math.Long.prototype.div = function(other) {
+ if (other.isZero()) {
+ throw Error('division by zero');
+ } else if (this.isZero()) {
+ return goog.math.Long.ZERO;
+ }
+
+ if (this.equals(goog.math.Long.MIN_VALUE)) {
+ if (other.equals(goog.math.Long.ONE) ||
+ other.equals(goog.math.Long.NEG_ONE)) {
+ return goog.math.Long.MIN_VALUE; // recall that -MIN_VALUE == MIN_VALUE
+ } else if (other.equals(goog.math.Long.MIN_VALUE)) {
+ return goog.math.Long.ONE;
+ } else {
+ // At this point, we have |other| >= 2, so |this/other| < |MIN_VALUE|.
+ var halfThis = this.shiftRight(1);
+ var approx = halfThis.div(other).shiftLeft(1);
+ if (approx.equals(goog.math.Long.ZERO)) {
+ return other.isNegative() ? goog.math.Long.ONE : goog.math.Long.NEG_ONE;
+ } else {
+ var rem = this.subtract(other.multiply(approx));
+ var result = approx.add(rem.div(other));
+ return result;
+ }
+ }
+ } else if (other.equals(goog.math.Long.MIN_VALUE)) {
+ return goog.math.Long.ZERO;
+ }
+
+ if (this.isNegative()) {
+ if (other.isNegative()) {
+ return this.negate().div(other.negate());
+ } else {
+ return this.negate().div(other).negate();
+ }
+ } else if (other.isNegative()) {
+ return this.div(other.negate()).negate();
+ }
+
+ // Repeat the following until the remainder is less than other: find a
+ // floating-point that approximates remainder / other *from below*, add this
+ // into the result, and subtract it from the remainder. It is critical that
+ // the approximate value is less than or equal to the real value so that the
+ // remainder never becomes negative.
+ var res = goog.math.Long.ZERO;
+ var rem = this;
+ while (rem.greaterThanOrEqual(other)) {
+ // Approximate the result of division. This may be a little greater or
+ // smaller than the actual value.
+ var approx = Math.max(1, Math.floor(rem.toNumber() / other.toNumber()));
+
+ // We will tweak the approximate result by changing it in the 48-th digit or
+ // the smallest non-fractional digit, whichever is larger.
+ var log2 = Math.ceil(Math.log(approx) / Math.LN2);
+ var delta = (log2 <= 48) ? 1 : Math.pow(2, log2 - 48);
+
+ // Decrease the approximation until it is smaller than the remainder. Note
+ // that if it is too large, the product overflows and is negative.
+ var approxRes = goog.math.Long.fromNumber(approx);
+ var approxRem = approxRes.multiply(other);
+ while (approxRem.isNegative() || approxRem.greaterThan(rem)) {
+ approx -= delta;
+ approxRes = goog.math.Long.fromNumber(approx);
+ approxRem = approxRes.multiply(other);
+ }
+
+ // We know the answer can't be zero... and actually, zero would cause
+ // infinite recursion since we would make no progress.
+ if (approxRes.isZero()) {
+ approxRes = goog.math.Long.ONE;
+ }
+
+ res = res.add(approxRes);
+ rem = rem.subtract(approxRem);
+ }
+ return res;
+ };
+
+
+ /**
+ * Returns this Long modulo the given one.
+ * @param {goog.math.Long} other Long by which to mod.
+ * @return {!goog.math.Long} This Long modulo the given one.
+ */
+ goog.math.Long.prototype.modulo = function(other) {
+ return this.subtract(this.div(other).multiply(other));
+ };
+
+
+ /** @return {!goog.math.Long} The bitwise-NOT of this value. */
+ goog.math.Long.prototype.not = function() {
+ return goog.math.Long.fromBits(~this.low_, ~this.high_);
+ };
+
+
+ /**
+ * Returns the bitwise-AND of this Long and the given one.
+ * @param {goog.math.Long} other The Long with which to AND.
+ * @return {!goog.math.Long} The bitwise-AND of this and the other.
+ */
+ goog.math.Long.prototype.and = function(other) {
+ return goog.math.Long.fromBits(this.low_ & other.low_,
+ this.high_ & other.high_);
+ };
+
+
+ /**
+ * Returns the bitwise-OR of this Long and the given one.
+ * @param {goog.math.Long} other The Long with which to OR.
+ * @return {!goog.math.Long} The bitwise-OR of this and the other.
+ */
+ goog.math.Long.prototype.or = function(other) {
+ return goog.math.Long.fromBits(this.low_ | other.low_,
+ this.high_ | other.high_);
+ };
+
+
+ /**
+ * Returns the bitwise-XOR of this Long and the given one.
+ * @param {goog.math.Long} other The Long with which to XOR.
+ * @return {!goog.math.Long} The bitwise-XOR of this and the other.
+ */
+ goog.math.Long.prototype.xor = function(other) {
+ return goog.math.Long.fromBits(this.low_ ^ other.low_,
+ this.high_ ^ other.high_);
+ };
+
+
+ /**
+ * Returns this Long with bits shifted to the left by the given amount.
+ * @param {number} numBits The number of bits by which to shift.
+ * @return {!goog.math.Long} This shifted to the left by the given amount.
+ */
+ goog.math.Long.prototype.shiftLeft = function(numBits) {
+ numBits &= 63;
+ if (numBits == 0) {
+ return this;
+ } else {
+ var low = this.low_;
+ if (numBits < 32) {
+ var high = this.high_;
+ return goog.math.Long.fromBits(
+ low << numBits,
+ (high << numBits) | (low >>> (32 - numBits)));
+ } else {
+ return goog.math.Long.fromBits(0, low << (numBits - 32));
+ }
+ }
+ };
+
+
+ /**
+ * Returns this Long with bits shifted to the right by the given amount.
+ * @param {number} numBits The number of bits by which to shift.
+ * @return {!goog.math.Long} This shifted to the right by the given amount.
+ */
+ goog.math.Long.prototype.shiftRight = function(numBits) {
+ numBits &= 63;
+ if (numBits == 0) {
+ return this;
+ } else {
+ var high = this.high_;
+ if (numBits < 32) {
+ var low = this.low_;
+ return goog.math.Long.fromBits(
+ (low >>> numBits) | (high << (32 - numBits)),
+ high >> numBits);
+ } else {
+ return goog.math.Long.fromBits(
+ high >> (numBits - 32),
+ high >= 0 ? 0 : -1);
+ }
+ }
+ };
+
+
+ /**
+ * Returns this Long with bits shifted to the right by the given amount, with
+ * the new top bits matching the current sign bit.
+ * @param {number} numBits The number of bits by which to shift.
+ * @return {!goog.math.Long} This shifted to the right by the given amount, with
+ * zeros placed into the new leading bits.
+ */
+ goog.math.Long.prototype.shiftRightUnsigned = function(numBits) {
+ numBits &= 63;
+ if (numBits == 0) {
+ return this;
+ } else {
+ var high = this.high_;
+ if (numBits < 32) {
+ var low = this.low_;
+ return goog.math.Long.fromBits(
+ (low >>> numBits) | (high << (32 - numBits)),
+ high >>> numBits);
+ } else if (numBits == 32) {
+ return goog.math.Long.fromBits(high, 0);
+ } else {
+ return goog.math.Long.fromBits(high >>> (numBits - 32), 0);
+ }
+ }
+ };
+
+ //======= begin jsbn =======
+
+ var navigator = { appName: 'Modern Browser' }; // polyfill a little
+
+ // Copyright (c) 2005 Tom Wu
+ // All Rights Reserved.
+ // http://www-cs-students.stanford.edu/~tjw/jsbn/
+
+ /*
+ * Copyright (c) 2003-2005 Tom Wu
+ * All Rights Reserved.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining
+ * a copy of this software and associated documentation files (the
+ * "Software"), to deal in the Software without restriction, including
+ * without limitation the rights to use, copy, modify, merge, publish,
+ * distribute, sublicense, and/or sell copies of the Software, and to
+ * permit persons to whom the Software is furnished to do so, subject to
+ * the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be
+ * included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS-IS" AND WITHOUT WARRANTY OF ANY KIND,
+ * EXPRESS, IMPLIED OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY
+ * WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
+ *
+ * IN NO EVENT SHALL TOM WU BE LIABLE FOR ANY SPECIAL, INCIDENTAL,
+ * INDIRECT OR CONSEQUENTIAL DAMAGES OF ANY KIND, OR ANY DAMAGES WHATSOEVER
+ * RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER OR NOT ADVISED OF
+ * THE POSSIBILITY OF DAMAGE, AND ON ANY THEORY OF LIABILITY, ARISING OUT
+ * OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+ *
+ * In addition, the following condition applies:
+ *
+ * All redistributions must retain an intact copy of this copyright notice
+ * and disclaimer.
+ */
+
+ // Basic JavaScript BN library - subset useful for RSA encryption.
+
+ // Bits per digit
+ var dbits;
+
+ // JavaScript engine analysis
+ var canary = 0xdeadbeefcafe;
+ var j_lm = ((canary&0xffffff)==0xefcafe);
+
+ // (public) Constructor
+ function BigInteger(a,b,c) {
+ if(a != null)
+ if("number" == typeof a) this.fromNumber(a,b,c);
+ else if(b == null && "string" != typeof a) this.fromString(a,256);
+ else this.fromString(a,b);
+ }
+
+ // return new, unset BigInteger
+ function nbi() { return new BigInteger(null); }
+
+ // am: Compute w_j += (x*this_i), propagate carries,
+ // c is initial carry, returns final carry.
+ // c < 3*dvalue, x < 2*dvalue, this_i < dvalue
+ // We need to select the fastest one that works in this environment.
+
+ // am1: use a single mult and divide to get the high bits,
+ // max digit bits should be 26 because
+ // max internal value = 2*dvalue^2-2*dvalue (< 2^53)
+ function am1(i,x,w,j,c,n) {
+ while(--n >= 0) {
+ var v = x*this[i++]+w[j]+c;
+ c = Math.floor(v/0x4000000);
+ w[j++] = v&0x3ffffff;
+ }
+ return c;
+ }
+ // am2 avoids a big mult-and-extract completely.
+ // Max digit bits should be <= 30 because we do bitwise ops
+ // on values up to 2*hdvalue^2-hdvalue-1 (< 2^31)
+ function am2(i,x,w,j,c,n) {
+ var xl = x&0x7fff, xh = x>>15;
+ while(--n >= 0) {
+ var l = this[i]&0x7fff;
+ var h = this[i++]>>15;
+ var m = xh*l+h*xl;
+ l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);
+ c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);
+ w[j++] = l&0x3fffffff;
+ }
+ return c;
+ }
+ // Alternately, set max digit bits to 28 since some
+ // browsers slow down when dealing with 32-bit numbers.
+ function am3(i,x,w,j,c,n) {
+ var xl = x&0x3fff, xh = x>>14;
+ while(--n >= 0) {
+ var l = this[i]&0x3fff;
+ var h = this[i++]>>14;
+ var m = xh*l+h*xl;
+ l = xl*l+((m&0x3fff)<<14)+w[j]+c;
+ c = (l>>28)+(m>>14)+xh*h;
+ w[j++] = l&0xfffffff;
+ }
+ return c;
+ }
+ if(j_lm && (navigator.appName == "Microsoft Internet Explorer")) {
+ BigInteger.prototype.am = am2;
+ dbits = 30;
+ }
+ else if(j_lm && (navigator.appName != "Netscape")) {
+ BigInteger.prototype.am = am1;
+ dbits = 26;
+ }
+ else { // Mozilla/Netscape seems to prefer am3
+ BigInteger.prototype.am = am3;
+ dbits = 28;
+ }
+
+ BigInteger.prototype.DB = dbits;
+ BigInteger.prototype.DM = ((1<<dbits)-1);
+ BigInteger.prototype.DV = (1<<dbits);
+
+ var BI_FP = 52;
+ BigInteger.prototype.FV = Math.pow(2,BI_FP);
+ BigInteger.prototype.F1 = BI_FP-dbits;
+ BigInteger.prototype.F2 = 2*dbits-BI_FP;
+
+ // Digit conversions
+ var BI_RM = "0123456789abcdefghijklmnopqrstuvwxyz";
+ var BI_RC = new Array();
+ var rr,vv;
+ rr = "0".charCodeAt(0);
+ for(vv = 0; vv <= 9; ++vv) BI_RC[rr++] = vv;
+ rr = "a".charCodeAt(0);
+ for(vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;
+ rr = "A".charCodeAt(0);
+ for(vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;
+
+ function int2char(n) { return BI_RM.charAt(n); }
+ function intAt(s,i) {
+ var c = BI_RC[s.charCodeAt(i)];
+ return (c==null)?-1:c;
+ }
+
+ // (protected) copy this to r
+ function bnpCopyTo(r) {
+ for(var i = this.t-1; i >= 0; --i) r[i] = this[i];
+ r.t = this.t;
+ r.s = this.s;
+ }
+
+ // (protected) set from integer value x, -DV <= x < DV
+ function bnpFromInt(x) {
+ this.t = 1;
+ this.s = (x<0)?-1:0;
+ if(x > 0) this[0] = x;
+ else if(x < -1) this[0] = x+DV;
+ else this.t = 0;
+ }
+
+ // return bigint initialized to value
+ function nbv(i) { var r = nbi(); r.fromInt(i); return r; }
+
+ // (protected) set from string and radix
+ function bnpFromString(s,b) {
+ var k;
+ if(b == 16) k = 4;
+ else if(b == 8) k = 3;
+ else if(b == 256) k = 8; // byte array
+ else if(b == 2) k = 1;
+ else if(b == 32) k = 5;
+ else if(b == 4) k = 2;
+ else { this.fromRadix(s,b); return; }
+ this.t = 0;
+ this.s = 0;
+ var i = s.length, mi = false, sh = 0;
+ while(--i >= 0) {
+ var x = (k==8)?s[i]&0xff:intAt(s,i);
+ if(x < 0) {
+ if(s.charAt(i) == "-") mi = true;
+ continue;
+ }
+ mi = false;
+ if(sh == 0)
+ this[this.t++] = x;
+ else if(sh+k > this.DB) {
+ this[this.t-1] |= (x&((1<<(this.DB-sh))-1))<<sh;
+ this[this.t++] = (x>>(this.DB-sh));
+ }
+ else
+ this[this.t-1] |= x<<sh;
+ sh += k;
+ if(sh >= this.DB) sh -= this.DB;
+ }
+ if(k == 8 && (s[0]&0x80) != 0) {
+ this.s = -1;
+ if(sh > 0) this[this.t-1] |= ((1<<(this.DB-sh))-1)<<sh;
+ }
+ this.clamp();
+ if(mi) BigInteger.ZERO.subTo(this,this);
+ }
+
+ // (protected) clamp off excess high words
+ function bnpClamp() {
+ var c = this.s&this.DM;
+ while(this.t > 0 && this[this.t-1] == c) --this.t;
+ }
+
+ // (public) return string representation in given radix
+ function bnToString(b) {
+ if(this.s < 0) return "-"+this.negate().toString(b);
+ var k;
+ if(b == 16) k = 4;
+ else if(b == 8) k = 3;
+ else if(b == 2) k = 1;
+ else if(b == 32) k = 5;
+ else if(b == 4) k = 2;
+ else return this.toRadix(b);
+ var km = (1<<k)-1, d, m = false, r = "", i = this.t;
+ var p = this.DB-(i*this.DB)%k;
+ if(i-- > 0) {
+ if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }
+ while(i >= 0) {
+ if(p < k) {
+ d = (this[i]&((1<<p)-1))<<(k-p);
+ d |= this[--i]>>(p+=this.DB-k);
+ }
+ else {
+ d = (this[i]>>(p-=k))&km;
+ if(p <= 0) { p += this.DB; --i; }
+ }
+ if(d > 0) m = true;
+ if(m) r += int2char(d);
+ }
+ }
+ return m?r:"0";
+ }
+
+ // (public) -this
+ function bnNegate() { var r = nbi(); BigInteger.ZERO.subTo(this,r); return r; }
+
+ // (public) |this|
+ function bnAbs() { return (this.s<0)?this.negate():this; }
+
+ // (public) return + if this > a, - if this < a, 0 if equal
+ function bnCompareTo(a) {
+ var r = this.s-a.s;
+ if(r != 0) return r;
+ var i = this.t;
+ r = i-a.t;
+ if(r != 0) return (this.s<0)?-r:r;
+ while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;
+ return 0;
+ }
+
+ // returns bit length of the integer x
+ function nbits(x) {
+ var r = 1, t;
+ if((t=x>>>16) != 0) { x = t; r += 16; }
+ if((t=x>>8) != 0) { x = t; r += 8; }
+ if((t=x>>4) != 0) { x = t; r += 4; }
+ if((t=x>>2) != 0) { x = t; r += 2; }
+ if((t=x>>1) != 0) { x = t; r += 1; }
+ return r;
+ }
+
+ // (public) return the number of bits in "this"
+ function bnBitLength() {
+ if(this.t <= 0) return 0;
+ return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));
+ }
+
+ // (protected) r = this << n*DB
+ function bnpDLShiftTo(n,r) {
+ var i;
+ for(i = this.t-1; i >= 0; --i) r[i+n] = this[i];
+ for(i = n-1; i >= 0; --i) r[i] = 0;
+ r.t = this.t+n;
+ r.s = this.s;
+ }
+
+ // (protected) r = this >> n*DB
+ function bnpDRShiftTo(n,r) {
+ for(var i = n; i < this.t; ++i) r[i-n] = this[i];
+ r.t = Math.max(this.t-n,0);
+ r.s = this.s;
+ }
+
+ // (protected) r = this << n
+ function bnpLShiftTo(n,r) {
+ var bs = n%this.DB;
+ var cbs = this.DB-bs;
+ var bm = (1<<cbs)-1;
+ var ds = Math.floor(n/this.DB), c = (this.s<<bs)&this.DM, i;
+ for(i = this.t-1; i >= 0; --i) {
+ r[i+ds+1] = (this[i]>>cbs)|c;
+ c = (this[i]&bm)<<bs;
+ }
+ for(i = ds-1; i >= 0; --i) r[i] = 0;
+ r[ds] = c;
+ r.t = this.t+ds+1;
+ r.s = this.s;
+ r.clamp();
+ }
+
+ // (protected) r = this >> n
+ function bnpRShiftTo(n,r) {
+ r.s = this.s;
+ var ds = Math.floor(n/this.DB);
+ if(ds >= this.t) { r.t = 0; return; }
+ var bs = n%this.DB;
+ var cbs = this.DB-bs;
+ var bm = (1<<bs)-1;
+ r[0] = this[ds]>>bs;
+ for(var i = ds+1; i < this.t; ++i) {
+ r[i-ds-1] |= (this[i]&bm)<<cbs;
+ r[i-ds] = this[i]>>bs;
+ }
+ if(bs > 0) r[this.t-ds-1] |= (this.s&bm)<<cbs;
+ r.t = this.t-ds;
+ r.clamp();
+ }
+
+ // (protected) r = this - a
+ function bnpSubTo(a,r) {
+ var i = 0, c = 0, m = Math.min(a.t,this.t);
+ while(i < m) {
+ c += this[i]-a[i];
+ r[i++] = c&this.DM;
+ c >>= this.DB;
+ }
+ if(a.t < this.t) {
+ c -= a.s;
+ while(i < this.t) {
+ c += this[i];
+ r[i++] = c&this.DM;
+ c >>= this.DB;
+ }
+ c += this.s;
+ }
+ else {
+ c += this.s;
+ while(i < a.t) {
+ c -= a[i];
+ r[i++] = c&this.DM;
+ c >>= this.DB;
+ }
+ c -= a.s;
+ }
+ r.s = (c<0)?-1:0;
+ if(c < -1) r[i++] = this.DV+c;
+ else if(c > 0) r[i++] = c;
+ r.t = i;
+ r.clamp();
+ }
+
+ // (protected) r = this * a, r != this,a (HAC 14.12)
+ // "this" should be the larger one if appropriate.
+ function bnpMultiplyTo(a,r) {
+ var x = this.abs(), y = a.abs();
+ var i = x.t;
+ r.t = i+y.t;
+ while(--i >= 0) r[i] = 0;
+ for(i = 0; i < y.t; ++i) r[i+x.t] = x.am(0,y[i],r,i,0,x.t);
+ r.s = 0;
+ r.clamp();
+ if(this.s != a.s) BigInteger.ZERO.subTo(r,r);
+ }
+
+ // (protected) r = this^2, r != this (HAC 14.16)
+ function bnpSquareTo(r) {
+ var x = this.abs();
+ var i = r.t = 2*x.t;
+ while(--i >= 0) r[i] = 0;
+ for(i = 0; i < x.t-1; ++i) {
+ var c = x.am(i,x[i],r,2*i,0,1);
+ if((r[i+x.t]+=x.am(i+1,2*x[i],r,2*i+1,c,x.t-i-1)) >= x.DV) {
+ r[i+x.t] -= x.DV;
+ r[i+x.t+1] = 1;
+ }
+ }
+ if(r.t > 0) r[r.t-1] += x.am(i,x[i],r,2*i,0,1);
+ r.s = 0;
+ r.clamp();
+ }
+
+ // (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)
+ // r != q, this != m. q or r may be null.
+ function bnpDivRemTo(m,q,r) {
+ var pm = m.abs();
+ if(pm.t <= 0) return;
+ var pt = this.abs();
+ if(pt.t < pm.t) {
+ if(q != null) q.fromInt(0);
+ if(r != null) this.copyTo(r);
+ return;
+ }
+ if(r == null) r = nbi();
+ var y = nbi(), ts = this.s, ms = m.s;
+ var nsh = this.DB-nbits(pm[pm.t-1]); // normalize modulus
+ if(nsh > 0) { pm.lShiftTo(nsh,y); pt.lShiftTo(nsh,r); }
+ else { pm.copyTo(y); pt.copyTo(r); }
+ var ys = y.t;
+ var y0 = y[ys-1];
+ if(y0 == 0) return;
+ var yt = y0*(1<<this.F1)+((ys>1)?y[ys-2]>>this.F2:0);
+ var d1 = this.FV/yt, d2 = (1<<this.F1)/yt, e = 1<<this.F2;
+ var i = r.t, j = i-ys, t = (q==null)?nbi():q;
+ y.dlShiftTo(j,t);
+ if(r.compareTo(t) >= 0) {
+ r[r.t++] = 1;
+ r.subTo(t,r);
+ }
+ BigInteger.ONE.dlShiftTo(ys,t);
+ t.subTo(y,y); // "negative" y so we can replace sub with am later
+ while(y.t < ys) y[y.t++] = 0;
+ while(--j >= 0) {
+ // Estimate quotient digit
+ var qd = (r[--i]==y0)?this.DM:Math.floor(r[i]*d1+(r[i-1]+e)*d2);
+ if((r[i]+=y.am(0,qd,r,j,0,ys)) < qd) { // Try it out
+ y.dlShiftTo(j,t);
+ r.subTo(t,r);
+ while(r[i] < --qd) r.subTo(t,r);
+ }
+ }
+ if(q != null) {
+ r.drShiftTo(ys,q);
+ if(ts != ms) BigInteger.ZERO.subTo(q,q);
+ }
+ r.t = ys;
+ r.clamp();
+ if(nsh > 0) r.rShiftTo(nsh,r); // Denormalize remainder
+ if(ts < 0) BigInteger.ZERO.subTo(r,r);
+ }
+
+ // (public) this mod a
+ function bnMod(a) {
+ var r = nbi();
+ this.abs().divRemTo(a,null,r);
+ if(this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) a.subTo(r,r);
+ return r;
+ }
+
+ // Modular reduction using "classic" algorithm
+ function Classic(m) { this.m = m; }
+ function cConvert(x) {
+ if(x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m);
+ else return x;
+ }
+ function cRevert(x) { return x; }
+ function cReduce(x) { x.divRemTo(this.m,null,x); }
+ function cMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }
+ function cSqrTo(x,r) { x.squareTo(r); this.reduce(r); }
+
+ Classic.prototype.convert = cConvert;
+ Classic.prototype.revert = cRevert;
+ Classic.prototype.reduce = cReduce;
+ Classic.prototype.mulTo = cMulTo;
+ Classic.prototype.sqrTo = cSqrTo;
+
+ // (protected) return "-1/this % 2^DB"; useful for Mont. reduction
+ // justification:
+ // xy == 1 (mod m)
+ // xy = 1+km
+ // xy(2-xy) = (1+km)(1-km)
+ // x[y(2-xy)] = 1-k^2m^2
+ // x[y(2-xy)] == 1 (mod m^2)
+ // if y is 1/x mod m, then y(2-xy) is 1/x mod m^2
+ // should reduce x and y(2-xy) by m^2 at each step to keep size bounded.
+ // JS multiply "overflows" differently from C/C++, so care is needed here.
+ function bnpInvDigit() {
+ if(this.t < 1) return 0;
+ var x = this[0];
+ if((x&1) == 0) return 0;
+ var y = x&3; // y == 1/x mod 2^2
+ y = (y*(2-(x&0xf)*y))&0xf; // y == 1/x mod 2^4
+ y = (y*(2-(x&0xff)*y))&0xff; // y == 1/x mod 2^8
+ y = (y*(2-(((x&0xffff)*y)&0xffff)))&0xffff; // y == 1/x mod 2^16
+ // last step - calculate inverse mod DV directly;
+ // assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints
+ y = (y*(2-x*y%this.DV))%this.DV; // y == 1/x mod 2^dbits
+ // we really want the negative inverse, and -DV < y < DV
+ return (y>0)?this.DV-y:-y;
+ }
+
+ // Montgomery reduction
+ function Montgomery(m) {
+ this.m = m;
+ this.mp = m.invDigit();
+ this.mpl = this.mp&0x7fff;
+ this.mph = this.mp>>15;
+ this.um = (1<<(m.DB-15))-1;
+ this.mt2 = 2*m.t;
+ }
+
+ // xR mod m
+ function montConvert(x) {
+ var r = nbi();
+ x.abs().dlShiftTo(this.m.t,r);
+ r.divRemTo(this.m,null,r);
+ if(x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) this.m.subTo(r,r);
+ return r;
+ }
+
+ // x/R mod m
+ function montRevert(x) {
+ var r = nbi();
+ x.copyTo(r);
+ this.reduce(r);
+ return r;
+ }
+
+ // x = x/R mod m (HAC 14.32)
+ function montReduce(x) {
+ while(x.t <= this.mt2) // pad x so am has enough room later
+ x[x.t++] = 0;
+ for(var i = 0; i < this.m.t; ++i) {
+ // faster way of calculating u0 = x[i]*mp mod DV
+ var j = x[i]&0x7fff;
+ var u0 = (j*this.mpl+(((j*this.mph+(x[i]>>15)*this.mpl)&this.um)<<15))&x.DM;
+ // use am to combine the multiply-shift-add into one call
+ j = i+this.m.t;
+ x[j] += this.m.am(0,u0,x,i,0,this.m.t);
+ // propagate carry
+ while(x[j] >= x.DV) { x[j] -= x.DV; x[++j]++; }
+ }
+ x.clamp();
+ x.drShiftTo(this.m.t,x);
+ if(x.compareTo(this.m) >= 0) x.subTo(this.m,x);
+ }
+
+ // r = "x^2/R mod m"; x != r
+ function montSqrTo(x,r) { x.squareTo(r); this.reduce(r); }
+
+ // r = "xy/R mod m"; x,y != r
+ function montMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }
+
+ Montgomery.prototype.convert = montConvert;
+ Montgomery.prototype.revert = montRevert;
+ Montgomery.prototype.reduce = montReduce;
+ Montgomery.prototype.mulTo = montMulTo;
+ Montgomery.prototype.sqrTo = montSqrTo;
+
+ // (protected) true iff this is even
+ function bnpIsEven() { return ((this.t>0)?(this[0]&1):this.s) == 0; }
+
+ // (protected) this^e, e < 2^32, doing sqr and mul with "r" (HAC 14.79)
+ function bnpExp(e,z) {
+ if(e > 0xffffffff || e < 1) return BigInteger.ONE;
+ var r = nbi(), r2 = nbi(), g = z.convert(this), i = nbits(e)-1;
+ g.copyTo(r);
+ while(--i >= 0) {
+ z.sqrTo(r,r2);
+ if((e&(1<<i)) > 0) z.mulTo(r2,g,r);
+ else { var t = r; r = r2; r2 = t; }
+ }
+ return z.revert(r);
+ }
+
+ // (public) this^e % m, 0 <= e < 2^32
+ function bnModPowInt(e,m) {
+ var z;
+ if(e < 256 || m.isEven()) z = new Classic(m); else z = new Montgomery(m);
+ return this.exp(e,z);
+ }
+
+ // protected
+ BigInteger.prototype.copyTo = bnpCopyTo;
+ BigInteger.prototype.fromInt = bnpFromInt;
+ BigInteger.prototype.fromString = bnpFromString;
+ BigInteger.prototype.clamp = bnpClamp;
+ BigInteger.prototype.dlShiftTo = bnpDLShiftTo;
+ BigInteger.prototype.drShiftTo = bnpDRShiftTo;
+ BigInteger.prototype.lShiftTo = bnpLShiftTo;
+ BigInteger.prototype.rShiftTo = bnpRShiftTo;
+ BigInteger.prototype.subTo = bnpSubTo;
+ BigInteger.prototype.multiplyTo = bnpMultiplyTo;
+ BigInteger.prototype.squareTo = bnpSquareTo;
+ BigInteger.prototype.divRemTo = bnpDivRemTo;
+ BigInteger.prototype.invDigit = bnpInvDigit;
+ BigInteger.prototype.isEven = bnpIsEven;
+ BigInteger.prototype.exp = bnpExp;
+
+ // public
+ BigInteger.prototype.toString = bnToString;
+ BigInteger.prototype.negate = bnNegate;
+ BigInteger.prototype.abs = bnAbs;
+ BigInteger.prototype.compareTo = bnCompareTo;
+ BigInteger.prototype.bitLength = bnBitLength;
+ BigInteger.prototype.mod = bnMod;
+ BigInteger.prototype.modPowInt = bnModPowInt;
+
+ // "constants"
+ BigInteger.ZERO = nbv(0);
+ BigInteger.ONE = nbv(1);
+
+ // jsbn2 stuff
+
+ // (protected) convert from radix string
+ function bnpFromRadix(s,b) {
+ this.fromInt(0);
+ if(b == null) b = 10;
+ var cs = this.chunkSize(b);
+ var d = Math.pow(b,cs), mi = false, j = 0, w = 0;
+ for(var i = 0; i < s.length; ++i) {
+ var x = intAt(s,i);
+ if(x < 0) {
+ if(s.charAt(i) == "-" && this.signum() == 0) mi = true;
+ continue;
+ }
+ w = b*w+x;
+ if(++j >= cs) {
+ this.dMultiply(d);
+ this.dAddOffset(w,0);
+ j = 0;
+ w = 0;
+ }
+ }
+ if(j > 0) {
+ this.dMultiply(Math.pow(b,j));
+ this.dAddOffset(w,0);
+ }
+ if(mi) BigInteger.ZERO.subTo(this,this);
+ }
+
+ // (protected) return x s.t. r^x < DV
+ function bnpChunkSize(r) { return Math.floor(Math.LN2*this.DB/Math.log(r)); }
+
+ // (public) 0 if this == 0, 1 if this > 0
+ function bnSigNum() {
+ if(this.s < 0) return -1;
+ else if(this.t <= 0 || (this.t == 1 && this[0] <= 0)) return 0;
+ else return 1;
+ }
+
+ // (protected) this *= n, this >= 0, 1 < n < DV
+ function bnpDMultiply(n) {
+ this[this.t] = this.am(0,n-1,this,0,0,this.t);
+ ++this.t;
+ this.clamp();
+ }
+
+ // (protected) this += n << w words, this >= 0
+ function bnpDAddOffset(n,w) {
+ if(n == 0) return;
+ while(this.t <= w) this[this.t++] = 0;
+ this[w] += n;
+ while(this[w] >= this.DV) {
+ this[w] -= this.DV;
+ if(++w >= this.t) this[this.t++] = 0;
+ ++this[w];
+ }
+ }
+
+ // (protected) convert to radix string
+ function bnpToRadix(b) {
+ if(b == null) b = 10;
+ if(this.signum() == 0 || b < 2 || b > 36) return "0";
+ var cs = this.chunkSize(b);
+ var a = Math.pow(b,cs);
+ var d = nbv(a), y = nbi(), z = nbi(), r = "";
+ this.divRemTo(d,y,z);
+ while(y.signum() > 0) {
+ r = (a+z.intValue()).toString(b).substr(1) + r;
+ y.divRemTo(d,y,z);
+ }
+ return z.intValue().toString(b) + r;
+ }
+
+ // (public) return value as integer
+ function bnIntValue() {
+ if(this.s < 0) {
+ if(this.t == 1) return this[0]-this.DV;
+ else if(this.t == 0) return -1;
+ }
+ else if(this.t == 1) return this[0];
+ else if(this.t == 0) return 0;
+ // assumes 16 < DB < 32
+ return ((this[1]&((1<<(32-this.DB))-1))<<this.DB)|this[0];
+ }
+
+ // (protected) r = this + a
+ function bnpAddTo(a,r) {
+ var i = 0, c = 0, m = Math.min(a.t,this.t);
+ while(i < m) {
+ c += this[i]+a[i];
+ r[i++] = c&this.DM;
+ c >>= this.DB;
+ }
+ if(a.t < this.t) {
+ c += a.s;
+ while(i < this.t) {
+ c += this[i];
+ r[i++] = c&this.DM;
+ c >>= this.DB;
+ }
+ c += this.s;
+ }
+ else {
+ c += this.s;
+ while(i < a.t) {
+ c += a[i];
+ r[i++] = c&this.DM;
+ c >>= this.DB;
+ }
+ c += a.s;
+ }
+ r.s = (c<0)?-1:0;
+ if(c > 0) r[i++] = c;
+ else if(c < -1) r[i++] = this.DV+c;
+ r.t = i;
+ r.clamp();
+ }
+
+ BigInteger.prototype.fromRadix = bnpFromRadix;
+ BigInteger.prototype.chunkSize = bnpChunkSize;
+ BigInteger.prototype.signum = bnSigNum;
+ BigInteger.prototype.dMultiply = bnpDMultiply;
+ BigInteger.prototype.dAddOffset = bnpDAddOffset;
+ BigInteger.prototype.toRadix = bnpToRadix;
+ BigInteger.prototype.intValue = bnIntValue;
+ BigInteger.prototype.addTo = bnpAddTo;
+
+ //======= end jsbn =======
+
+ // Emscripten wrapper
+ var Wrapper = {
+ abs: function(l, h) {
+ var x = new goog.math.Long(l, h);
+ var ret;
+ if (x.isNegative()) {
+ ret = x.negate();
+ } else {
+ ret = x;
+ }
+ HEAP32[tempDoublePtr>>2] = ret.low_;
+ HEAP32[tempDoublePtr+4>>2] = ret.high_;
+ },
+ ensureTemps: function() {
+ if (Wrapper.ensuredTemps) return;
+ Wrapper.ensuredTemps = true;
+ Wrapper.two32 = new BigInteger();
+ Wrapper.two32.fromString('4294967296', 10);
+ Wrapper.two64 = new BigInteger();
+ Wrapper.two64.fromString('18446744073709551616', 10);
+ Wrapper.temp1 = new BigInteger();
+ Wrapper.temp2 = new BigInteger();
+ },
+ lh2bignum: function(l, h) {
+ var a = new BigInteger();
+ a.fromString(h.toString(), 10);
+ var b = new BigInteger();
+ a.multiplyTo(Wrapper.two32, b);
+ var c = new BigInteger();
+ c.fromString(l.toString(), 10);
+ var d = new BigInteger();
+ c.addTo(b, d);
+ return d;
+ },
+ stringify: function(l, h, unsigned) {
+ var ret = new goog.math.Long(l, h).toString();
+ if (unsigned && ret[0] == '-') {
+ // unsign slowly using jsbn bignums
+ Wrapper.ensureTemps();
+ var bignum = new BigInteger();
+ bignum.fromString(ret, 10);
+ ret = new BigInteger();
+ Wrapper.two64.addTo(bignum, ret);
+ ret = ret.toString(10);
+ }
+ return ret;
+ },
+ fromString: function(str, base, min, max, unsigned) {
+ Wrapper.ensureTemps();
+ var bignum = new BigInteger();
+ bignum.fromString(str, base);
+ var bigmin = new BigInteger();
+ bigmin.fromString(min, 10);
+ var bigmax = new BigInteger();
+ bigmax.fromString(max, 10);
+ if (unsigned && bignum.compareTo(BigInteger.ZERO) < 0) {
+ var temp = new BigInteger();
+ bignum.addTo(Wrapper.two64, temp);
+ bignum = temp;
+ }
+ var error = false;
+ if (bignum.compareTo(bigmin) < 0) {
+ bignum = bigmin;
+ error = true;
+ } else if (bignum.compareTo(bigmax) > 0) {
+ bignum = bigmax;
+ error = true;
+ }
+ var ret = goog.math.Long.fromString(bignum.toString()); // min-max checks should have clamped this to a range goog.math.Long can handle well
+ HEAP32[tempDoublePtr>>2] = ret.low_;
+ HEAP32[tempDoublePtr+4>>2] = ret.high_;
+ if (error) throw 'range error';
+ }
+ };
+ return Wrapper;
+})();
+
+//======= end closure i64 code =======
+
+
+
+// === Auto-generated postamble setup entry stuff ===
+
+if (memoryInitializer) {
+ if (ENVIRONMENT_IS_NODE || ENVIRONMENT_IS_SHELL) {
+ var data = Module['readBinary'](memoryInitializer);
+ HEAPU8.set(data, STATIC_BASE);
+ } else {
+ addRunDependency('memory initializer');
+ Browser.asyncLoad(memoryInitializer, function(data) {
+ HEAPU8.set(data, STATIC_BASE);
+ removeRunDependency('memory initializer');
+ }, function(data) {
+ throw 'could not load memory initializer ' + memoryInitializer;
+ });
+ }
+}
+
+function ExitStatus(status) {
+ this.name = "ExitStatus";
+ this.message = "Program terminated with exit(" + status + ")";
+ this.status = status;
+};
+ExitStatus.prototype = new Error();
+ExitStatus.prototype.constructor = ExitStatus;
+
+var initialStackTop;
+var preloadStartTime = null;
+var calledMain = false;
+
+dependenciesFulfilled = function runCaller() {
+ // If run has never been called, and we should call run (INVOKE_RUN is true, and Module.noInitialRun is not false)
+ if (!Module['calledRun'] && shouldRunNow) run(['binarytrees.lua'].concat(Module["arguments"]));
+ if (!Module['calledRun']) dependenciesFulfilled = runCaller; // try this again later, after new deps are fulfilled
+}
+
+Module['callMain'] = Module.callMain = function callMain(args) {
+ assert(runDependencies == 0, 'cannot call main when async dependencies remain! (listen on __ATMAIN__)');
+ assert(__ATPRERUN__.length == 0, 'cannot call main when preRun functions remain to be called');
+
+ args = args || [];
+
+ ensureInitRuntime();
+
+ var argc = args.length+1;
+ function pad() {
+ for (var i = 0; i < 4-1; i++) {
+ argv.push(0);
+ }
+ }
+ var argv = [allocate(intArrayFromString("/bin/this.program"), 'i8', ALLOC_NORMAL) ];
+ pad();
+ for (var i = 0; i < argc-1; i = i + 1) {
+ argv.push(allocate(intArrayFromString(args[i]), 'i8', ALLOC_NORMAL));
+ pad();
+ }
+ argv.push(0);
+ argv = allocate(argv, 'i32', ALLOC_NORMAL);
+
+ initialStackTop = STACKTOP;
+
+ try {
+
+ var ret = Module['_main'](argc, argv, 0);
+
+
+ // if we're not running an evented main loop, it's time to exit
+ if (!Module['noExitRuntime']) {
+ exit(ret);
+ }
+ }
+ catch(e) {
+ if (e instanceof ExitStatus) {
+ // exit() throws this once it's done to make sure execution
+ // has been stopped completely
+ return;
+ } else if (e == 'SimulateInfiniteLoop') {
+ // running an evented main loop, don't immediately exit
+ Module['noExitRuntime'] = true;
+ return;
+ } else {
+ if (e && typeof e === 'object' && e.stack) Module.printErr('exception thrown: ' + [e, e.stack]);
+ throw e;
+ }
+ } finally {
+ calledMain = true;
+ }
+}
+
+
+
+
+function run(args) {
+ args = args || Module['arguments'];
+
+ if (preloadStartTime === null) preloadStartTime = Date.now();
+
+ if (runDependencies > 0) {
+ Module.printErr('run() called, but dependencies remain, so not running');
+ return;
+ }
+
+ preRun();
+
+ if (runDependencies > 0) return; // a preRun added a dependency, run will be called later
+ if (Module['calledRun']) return; // run may have just been called through dependencies being fulfilled just in this very frame
+
+ function doRun() {
+ if (Module['calledRun']) return; // run may have just been called while the async setStatus time below was happening
+ Module['calledRun'] = true;
+
+ ensureInitRuntime();
+
+ preMain();
+
+ if (ENVIRONMENT_IS_WEB && preloadStartTime !== null) {
+ Module.printErr('pre-main prep time: ' + (Date.now() - preloadStartTime) + ' ms');
+ }
+
+ if (Module['_main'] && shouldRunNow) {
+ Module['callMain'](args);
+ }
+
+ postRun();
+ }
+
+ if (Module['setStatus']) {
+ Module['setStatus']('Running...');
+ setTimeout(function() {
+ setTimeout(function() {
+ Module['setStatus']('');
+ }, 1);
+ if (!ABORT) doRun();
+ }, 1);
+ } else {
+ doRun();
+ }
+}
+Module['run'] = Module.run = run;
+
+function exit(status) {
+ ABORT = true;
+ EXITSTATUS = status;
+ STACKTOP = initialStackTop;
+
+ // exit the runtime
+ exitRuntime();
+
+ // TODO We should handle this differently based on environment.
+ // In the browser, the best we can do is throw an exception
+ // to halt execution, but in node we could process.exit and
+ // I'd imagine SM shell would have something equivalent.
+ // This would let us set a proper exit status (which
+ // would be great for checking test exit statuses).
+ // https://github.com/kripken/emscripten/issues/1371
+
+ // throw an exception to halt the current execution
+ throw new ExitStatus(status);
+}
+Module['exit'] = Module.exit = exit;
+
+function abort(text) {
+ if (text) {
+ Module.print(text);
+ Module.printErr(text);
+ }
+
+ ABORT = true;
+ EXITSTATUS = 1;
+
+ var extra = '\nIf this abort() is unexpected, build with -s ASSERTIONS=1 which can give more information.';
+
+ throw 'abort() at ' + stackTrace() + extra;
+}
+Module['abort'] = Module.abort = abort;
+
+// {{PRE_RUN_ADDITIONS}}
+
+if (Module['preInit']) {
+ if (typeof Module['preInit'] == 'function') Module['preInit'] = [Module['preInit']];
+ while (Module['preInit'].length > 0) {
+ Module['preInit'].pop()();
+ }
+}
+
+// shouldRunNow refers to calling main(), not run().
+var shouldRunNow = true;
+if (Module['noInitialRun']) {
+ shouldRunNow = false;
+}
+
+
+run(['binarytrees.lua'].concat(Module["arguments"]));
diff --git a/test/mjsunit/wasm/embenchen/memops.js b/test/mjsunit/wasm/embenchen/memops.js
new file mode 100644
index 0000000..09bbd36
--- /dev/null
+++ b/test/mjsunit/wasm/embenchen/memops.js
@@ -0,0 +1,8090 @@
+// Modified embenchen to direct to asm-wasm.
+// Flags: --expose-wasm
+
+var EXPECTED_OUTPUT = 'final: 840.\n';
+var Module = {
+ arguments: [1],
+ print: function(x) {Module.printBuffer += x + '\n';},
+ preRun: [function() {Module.printBuffer = ''}],
+ postRun: [function() {
+ assertEquals(EXPECTED_OUTPUT, Module.printBuffer);
+ }],
+};
+// The Module object: Our interface to the outside world. We import
+// and export values on it, and do the work to get that through
+// closure compiler if necessary. There are various ways Module can be used:
+// 1. Not defined. We create it here
+// 2. A function parameter, function(Module) { ..generated code.. }
+// 3. pre-run appended it, var Module = {}; ..generated code..
+// 4. External script tag defines var Module.
+// We need to do an eval in order to handle the closure compiler
+// case, where this code here is minified but Module was defined
+// elsewhere (e.g. case 4 above). We also need to check if Module
+// already exists (e.g. case 3 above).
+// Note that if you want to run closure, and also to use Module
+// after the generated code, you will need to define var Module = {};
+// before the code. Then that object will be used in the code, and you
+// can continue to use Module afterwards as well.
+var Module;
+if (!Module) Module = (typeof Module !== 'undefined' ? Module : null) || {};
+
+// Sometimes an existing Module object exists with properties
+// meant to overwrite the default module functionality. Here
+// we collect those properties and reapply _after_ we configure
+// the current environment's defaults to avoid having to be so
+// defensive during initialization.
+var moduleOverrides = {};
+for (var key in Module) {
+ if (Module.hasOwnProperty(key)) {
+ moduleOverrides[key] = Module[key];
+ }
+}
+
+// The environment setup code below is customized to use Module.
+// *** Environment setup code ***
+var ENVIRONMENT_IS_NODE = typeof process === 'object' && typeof require === 'function';
+var ENVIRONMENT_IS_WEB = typeof window === 'object';
+var ENVIRONMENT_IS_WORKER = typeof importScripts === 'function';
+var ENVIRONMENT_IS_SHELL = !ENVIRONMENT_IS_WEB && !ENVIRONMENT_IS_NODE && !ENVIRONMENT_IS_WORKER;
+
+if (ENVIRONMENT_IS_NODE) {
+ // Expose functionality in the same simple way that the shells work
+ // Note that we pollute the global namespace here, otherwise we break in node
+ if (!Module['print']) Module['print'] = function print(x) {
+ process['stdout'].write(x + '\n');
+ };
+ if (!Module['printErr']) Module['printErr'] = function printErr(x) {
+ process['stderr'].write(x + '\n');
+ };
+
+ var nodeFS = require('fs');
+ var nodePath = require('path');
+
+ Module['read'] = function read(filename, binary) {
+ filename = nodePath['normalize'](filename);
+ var ret = nodeFS['readFileSync'](filename);
+ // The path is absolute if the normalized version is the same as the resolved.
+ if (!ret && filename != nodePath['resolve'](filename)) {
+ filename = path.join(__dirname, '..', 'src', filename);
+ ret = nodeFS['readFileSync'](filename);
+ }
+ if (ret && !binary) ret = ret.toString();
+ return ret;
+ };
+
+ Module['readBinary'] = function readBinary(filename) { return Module['read'](filename, true) };
+
+ Module['load'] = function load(f) {
+ globalEval(read(f));
+ };
+
+ Module['arguments'] = process['argv'].slice(2);
+
+ module['exports'] = Module;
+}
+else if (ENVIRONMENT_IS_SHELL) {
+ if (!Module['print']) Module['print'] = print;
+ if (typeof printErr != 'undefined') Module['printErr'] = printErr; // not present in v8 or older sm
+
+ if (typeof read != 'undefined') {
+ Module['read'] = read;
+ } else {
+ Module['read'] = function read() { throw 'no read() available (jsc?)' };
+ }
+
+ Module['readBinary'] = function readBinary(f) {
+ return read(f, 'binary');
+ };
+
+ if (typeof scriptArgs != 'undefined') {
+ Module['arguments'] = scriptArgs;
+ } else if (typeof arguments != 'undefined') {
+ Module['arguments'] = arguments;
+ }
+
+ this['Module'] = Module;
+
+ eval("if (typeof gc === 'function' && gc.toString().indexOf('[native code]') > 0) var gc = undefined"); // wipe out the SpiderMonkey shell 'gc' function, which can confuse closure (uses it as a minified name, and it is then initted to a non-falsey value unexpectedly)
+}
+else if (ENVIRONMENT_IS_WEB || ENVIRONMENT_IS_WORKER) {
+ Module['read'] = function read(url) {
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, false);
+ xhr.send(null);
+ return xhr.responseText;
+ };
+
+ if (typeof arguments != 'undefined') {
+ Module['arguments'] = arguments;
+ }
+
+ if (typeof console !== 'undefined') {
+ if (!Module['print']) Module['print'] = function print(x) {
+ console.log(x);
+ };
+ if (!Module['printErr']) Module['printErr'] = function printErr(x) {
+ console.log(x);
+ };
+ } else {
+ // Probably a worker, and without console.log. We can do very little here...
+ var TRY_USE_DUMP = false;
+ if (!Module['print']) Module['print'] = (TRY_USE_DUMP && (typeof(dump) !== "undefined") ? (function(x) {
+ dump(x);
+ }) : (function(x) {
+ // self.postMessage(x); // enable this if you want stdout to be sent as messages
+ }));
+ }
+
+ if (ENVIRONMENT_IS_WEB) {
+ window['Module'] = Module;
+ } else {
+ Module['load'] = importScripts;
+ }
+}
+else {
+ // Unreachable because SHELL is dependant on the others
+ throw 'Unknown runtime environment. Where are we?';
+}
+
+function globalEval(x) {
+ eval.call(null, x);
+}
+if (!Module['load'] == 'undefined' && Module['read']) {
+ Module['load'] = function load(f) {
+ globalEval(Module['read'](f));
+ };
+}
+if (!Module['print']) {
+ Module['print'] = function(){};
+}
+if (!Module['printErr']) {
+ Module['printErr'] = Module['print'];
+}
+if (!Module['arguments']) {
+ Module['arguments'] = [];
+}
+// *** Environment setup code ***
+
+// Closure helpers
+Module.print = Module['print'];
+Module.printErr = Module['printErr'];
+
+// Callbacks
+Module['preRun'] = [];
+Module['postRun'] = [];
+
+// Merge back in the overrides
+for (var key in moduleOverrides) {
+ if (moduleOverrides.hasOwnProperty(key)) {
+ Module[key] = moduleOverrides[key];
+ }
+}
+
+
+
+// === Auto-generated preamble library stuff ===
+
+//========================================
+// Runtime code shared with compiler
+//========================================
+
+var Runtime = {
+ stackSave: function () {
+ return STACKTOP;
+ },
+ stackRestore: function (stackTop) {
+ STACKTOP = stackTop;
+ },
+ forceAlign: function (target, quantum) {
+ quantum = quantum || 4;
+ if (quantum == 1) return target;
+ if (isNumber(target) && isNumber(quantum)) {
+ return Math.ceil(target/quantum)*quantum;
+ } else if (isNumber(quantum) && isPowerOfTwo(quantum)) {
+ return '(((' +target + ')+' + (quantum-1) + ')&' + -quantum + ')';
+ }
+ return 'Math.ceil((' + target + ')/' + quantum + ')*' + quantum;
+ },
+ isNumberType: function (type) {
+ return type in Runtime.INT_TYPES || type in Runtime.FLOAT_TYPES;
+ },
+ isPointerType: function isPointerType(type) {
+ return type[type.length-1] == '*';
+},
+ isStructType: function isStructType(type) {
+ if (isPointerType(type)) return false;
+ if (isArrayType(type)) return true;
+ if (/<?\{ ?[^}]* ?\}>?/.test(type)) return true; // { i32, i8 } etc. - anonymous struct types
+ // See comment in isStructPointerType()
+ return type[0] == '%';
+},
+ INT_TYPES: {"i1":0,"i8":0,"i16":0,"i32":0,"i64":0},
+ FLOAT_TYPES: {"float":0,"double":0},
+ or64: function (x, y) {
+ var l = (x | 0) | (y | 0);
+ var h = (Math.round(x / 4294967296) | Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ and64: function (x, y) {
+ var l = (x | 0) & (y | 0);
+ var h = (Math.round(x / 4294967296) & Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ xor64: function (x, y) {
+ var l = (x | 0) ^ (y | 0);
+ var h = (Math.round(x / 4294967296) ^ Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ getNativeTypeSize: function (type) {
+ switch (type) {
+ case 'i1': case 'i8': return 1;
+ case 'i16': return 2;
+ case 'i32': return 4;
+ case 'i64': return 8;
+ case 'float': return 4;
+ case 'double': return 8;
+ default: {
+ if (type[type.length-1] === '*') {
+ return Runtime.QUANTUM_SIZE; // A pointer
+ } else if (type[0] === 'i') {
+ var bits = parseInt(type.substr(1));
+ assert(bits % 8 === 0);
+ return bits/8;
+ } else {
+ return 0;
+ }
+ }
+ }
+ },
+ getNativeFieldSize: function (type) {
+ return Math.max(Runtime.getNativeTypeSize(type), Runtime.QUANTUM_SIZE);
+ },
+ dedup: function dedup(items, ident) {
+ var seen = {};
+ if (ident) {
+ return items.filter(function(item) {
+ if (seen[item[ident]]) return false;
+ seen[item[ident]] = true;
+ return true;
+ });
+ } else {
+ return items.filter(function(item) {
+ if (seen[item]) return false;
+ seen[item] = true;
+ return true;
+ });
+ }
+},
+ set: function set() {
+ var args = typeof arguments[0] === 'object' ? arguments[0] : arguments;
+ var ret = {};
+ for (var i = 0; i < args.length; i++) {
+ ret[args[i]] = 0;
+ }
+ return ret;
+},
+ STACK_ALIGN: 8,
+ getAlignSize: function (type, size, vararg) {
+ // we align i64s and doubles on 64-bit boundaries, unlike x86
+ if (!vararg && (type == 'i64' || type == 'double')) return 8;
+ if (!type) return Math.min(size, 8); // align structures internally to 64 bits
+ return Math.min(size || (type ? Runtime.getNativeFieldSize(type) : 0), Runtime.QUANTUM_SIZE);
+ },
+ calculateStructAlignment: function calculateStructAlignment(type) {
+ type.flatSize = 0;
+ type.alignSize = 0;
+ var diffs = [];
+ var prev = -1;
+ var index = 0;
+ type.flatIndexes = type.fields.map(function(field) {
+ index++;
+ var size, alignSize;
+ if (Runtime.isNumberType(field) || Runtime.isPointerType(field)) {
+ size = Runtime.getNativeTypeSize(field); // pack char; char; in structs, also char[X]s.
+ alignSize = Runtime.getAlignSize(field, size);
+ } else if (Runtime.isStructType(field)) {
+ if (field[1] === '0') {
+ // this is [0 x something]. When inside another structure like here, it must be at the end,
+ // and it adds no size
+ // XXX this happens in java-nbody for example... assert(index === type.fields.length, 'zero-length in the middle!');
+ size = 0;
+ if (Types.types[field]) {
+ alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
+ } else {
+ alignSize = type.alignSize || QUANTUM_SIZE;
+ }
+ } else {
+ size = Types.types[field].flatSize;
+ alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
+ }
+ } else if (field[0] == 'b') {
+ // bN, large number field, like a [N x i8]
+ size = field.substr(1)|0;
+ alignSize = 1;
+ } else if (field[0] === '<') {
+ // vector type
+ size = alignSize = Types.types[field].flatSize; // fully aligned
+ } else if (field[0] === 'i') {
+ // illegal integer field, that could not be legalized because it is an internal structure field
+ // it is ok to have such fields, if we just use them as markers of field size and nothing more complex
+ size = alignSize = parseInt(field.substr(1))/8;
+ assert(size % 1 === 0, 'cannot handle non-byte-size field ' + field);
+ } else {
+ assert(false, 'invalid type for calculateStructAlignment');
+ }
+ if (type.packed) alignSize = 1;
+ type.alignSize = Math.max(type.alignSize, alignSize);
+ var curr = Runtime.alignMemory(type.flatSize, alignSize); // if necessary, place this on aligned memory
+ type.flatSize = curr + size;
+ if (prev >= 0) {
+ diffs.push(curr-prev);
+ }
+ prev = curr;
+ return curr;
+ });
+ if (type.name_ && type.name_[0] === '[') {
+ // arrays have 2 elements, so we get the proper difference. then we scale here. that way we avoid
+ // allocating a potentially huge array for [999999 x i8] etc.
+ type.flatSize = parseInt(type.name_.substr(1))*type.flatSize/2;
+ }
+ type.flatSize = Runtime.alignMemory(type.flatSize, type.alignSize);
+ if (diffs.length == 0) {
+ type.flatFactor = type.flatSize;
+ } else if (Runtime.dedup(diffs).length == 1) {
+ type.flatFactor = diffs[0];
+ }
+ type.needsFlattening = (type.flatFactor != 1);
+ return type.flatIndexes;
+ },
+ generateStructInfo: function (struct, typeName, offset) {
+ var type, alignment;
+ if (typeName) {
+ offset = offset || 0;
+ type = (typeof Types === 'undefined' ? Runtime.typeInfo : Types.types)[typeName];
+ if (!type) return null;
+ if (type.fields.length != struct.length) {
+ printErr('Number of named fields must match the type for ' + typeName + ': possibly duplicate struct names. Cannot return structInfo');
+ return null;
+ }
+ alignment = type.flatIndexes;
+ } else {
+ var type = { fields: struct.map(function(item) { return item[0] }) };
+ alignment = Runtime.calculateStructAlignment(type);
+ }
+ var ret = {
+ __size__: type.flatSize
+ };
+ if (typeName) {
+ struct.forEach(function(item, i) {
+ if (typeof item === 'string') {
+ ret[item] = alignment[i] + offset;
+ } else {
+ // embedded struct
+ var key;
+ for (var k in item) key = k;
+ ret[key] = Runtime.generateStructInfo(item[key], type.fields[i], alignment[i]);
+ }
+ });
+ } else {
+ struct.forEach(function(item, i) {
+ ret[item[1]] = alignment[i];
+ });
+ }
+ return ret;
+ },
+ dynCall: function (sig, ptr, args) {
+ if (args && args.length) {
+ if (!args.splice) args = Array.prototype.slice.call(args);
+ args.splice(0, 0, ptr);
+ return Module['dynCall_' + sig].apply(null, args);
+ } else {
+ return Module['dynCall_' + sig].call(null, ptr);
+ }
+ },
+ functionPointers: [],
+ addFunction: function (func) {
+ for (var i = 0; i < Runtime.functionPointers.length; i++) {
+ if (!Runtime.functionPointers[i]) {
+ Runtime.functionPointers[i] = func;
+ return 2*(1 + i);
+ }
+ }
+ throw 'Finished up all reserved function pointers. Use a higher value for RESERVED_FUNCTION_POINTERS.';
+ },
+ removeFunction: function (index) {
+ Runtime.functionPointers[(index-2)/2] = null;
+ },
+ getAsmConst: function (code, numArgs) {
+ // code is a constant string on the heap, so we can cache these
+ if (!Runtime.asmConstCache) Runtime.asmConstCache = {};
+ var func = Runtime.asmConstCache[code];
+ if (func) return func;
+ var args = [];
+ for (var i = 0; i < numArgs; i++) {
+ args.push(String.fromCharCode(36) + i); // $0, $1 etc
+ }
+ var source = Pointer_stringify(code);
+ if (source[0] === '"') {
+ // tolerate EM_ASM("..code..") even though EM_ASM(..code..) is correct
+ if (source.indexOf('"', 1) === source.length-1) {
+ source = source.substr(1, source.length-2);
+ } else {
+ // something invalid happened, e.g. EM_ASM("..code($0)..", input)
+ abort('invalid EM_ASM input |' + source + '|. Please use EM_ASM(..code..) (no quotes) or EM_ASM({ ..code($0).. }, input) (to input values)');
+ }
+ }
+ try {
+ var evalled = eval('(function(' + args.join(',') + '){ ' + source + ' })'); // new Function does not allow upvars in node
+ } catch(e) {
+ Module.printErr('error in executing inline EM_ASM code: ' + e + ' on: \n\n' + source + '\n\nwith args |' + args + '| (make sure to use the right one out of EM_ASM, EM_ASM_ARGS, etc.)');
+ throw e;
+ }
+ return Runtime.asmConstCache[code] = evalled;
+ },
+ warnOnce: function (text) {
+ if (!Runtime.warnOnce.shown) Runtime.warnOnce.shown = {};
+ if (!Runtime.warnOnce.shown[text]) {
+ Runtime.warnOnce.shown[text] = 1;
+ Module.printErr(text);
+ }
+ },
+ funcWrappers: {},
+ getFuncWrapper: function (func, sig) {
+ assert(sig);
+ if (!Runtime.funcWrappers[func]) {
+ Runtime.funcWrappers[func] = function dynCall_wrapper() {
+ return Runtime.dynCall(sig, func, arguments);
+ };
+ }
+ return Runtime.funcWrappers[func];
+ },
+ UTF8Processor: function () {
+ var buffer = [];
+ var needed = 0;
+ this.processCChar = function (code) {
+ code = code & 0xFF;
+
+ if (buffer.length == 0) {
+ if ((code & 0x80) == 0x00) { // 0xxxxxxx
+ return String.fromCharCode(code);
+ }
+ buffer.push(code);
+ if ((code & 0xE0) == 0xC0) { // 110xxxxx
+ needed = 1;
+ } else if ((code & 0xF0) == 0xE0) { // 1110xxxx
+ needed = 2;
+ } else { // 11110xxx
+ needed = 3;
+ }
+ return '';
+ }
+
+ if (needed) {
+ buffer.push(code);
+ needed--;
+ if (needed > 0) return '';
+ }
+
+ var c1 = buffer[0];
+ var c2 = buffer[1];
+ var c3 = buffer[2];
+ var c4 = buffer[3];
+ var ret;
+ if (buffer.length == 2) {
+ ret = String.fromCharCode(((c1 & 0x1F) << 6) | (c2 & 0x3F));
+ } else if (buffer.length == 3) {
+ ret = String.fromCharCode(((c1 & 0x0F) << 12) | ((c2 & 0x3F) << 6) | (c3 & 0x3F));
+ } else {
+ // http://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae
+ var codePoint = ((c1 & 0x07) << 18) | ((c2 & 0x3F) << 12) |
+ ((c3 & 0x3F) << 6) | (c4 & 0x3F);
+ ret = String.fromCharCode(
+ Math.floor((codePoint - 0x10000) / 0x400) + 0xD800,
+ (codePoint - 0x10000) % 0x400 + 0xDC00);
+ }
+ buffer.length = 0;
+ return ret;
+ }
+ this.processJSString = function processJSString(string) {
+ /* TODO: use TextEncoder when present,
+ var encoder = new TextEncoder();
+ encoder['encoding'] = "utf-8";
+ var utf8Array = encoder['encode'](aMsg.data);
+ */
+ string = unescape(encodeURIComponent(string));
+ var ret = [];
+ for (var i = 0; i < string.length; i++) {
+ ret.push(string.charCodeAt(i));
+ }
+ return ret;
+ }
+ },
+ getCompilerSetting: function (name) {
+ throw 'You must build with -s RETAIN_COMPILER_SETTINGS=1 for Runtime.getCompilerSetting or emscripten_get_compiler_setting to work';
+ },
+ stackAlloc: function (size) { var ret = STACKTOP;STACKTOP = (STACKTOP + size)|0;STACKTOP = (((STACKTOP)+7)&-8); return ret; },
+ staticAlloc: function (size) { var ret = STATICTOP;STATICTOP = (STATICTOP + size)|0;STATICTOP = (((STATICTOP)+7)&-8); return ret; },
+ dynamicAlloc: function (size) { var ret = DYNAMICTOP;DYNAMICTOP = (DYNAMICTOP + size)|0;DYNAMICTOP = (((DYNAMICTOP)+7)&-8); if (DYNAMICTOP >= TOTAL_MEMORY) enlargeMemory();; return ret; },
+ alignMemory: function (size,quantum) { var ret = size = Math.ceil((size)/(quantum ? quantum : 8))*(quantum ? quantum : 8); return ret; },
+ makeBigInt: function (low,high,unsigned) { var ret = (unsigned ? ((+((low>>>0)))+((+((high>>>0)))*(+4294967296))) : ((+((low>>>0)))+((+((high|0)))*(+4294967296)))); return ret; },
+ GLOBAL_BASE: 8,
+ QUANTUM_SIZE: 4,
+ __dummy__: 0
+}
+
+
+Module['Runtime'] = Runtime;
+
+
+
+
+
+
+
+
+
+//========================================
+// Runtime essentials
+//========================================
+
+var __THREW__ = 0; // Used in checking for thrown exceptions.
+
+var ABORT = false; // whether we are quitting the application. no code should run after this. set in exit() and abort()
+var EXITSTATUS = 0;
+
+var undef = 0;
+// tempInt is used for 32-bit signed values or smaller. tempBigInt is used
+// for 32-bit unsigned values or more than 32 bits. TODO: audit all uses of tempInt
+var tempValue, tempInt, tempBigInt, tempInt2, tempBigInt2, tempPair, tempBigIntI, tempBigIntR, tempBigIntS, tempBigIntP, tempBigIntD, tempDouble, tempFloat;
+var tempI64, tempI64b;
+var tempRet0, tempRet1, tempRet2, tempRet3, tempRet4, tempRet5, tempRet6, tempRet7, tempRet8, tempRet9;
+
+function assert(condition, text) {
+ if (!condition) {
+ abort('Assertion failed: ' + text);
+ }
+}
+
+var globalScope = this;
+
+// C calling interface. A convenient way to call C functions (in C files, or
+// defined with extern "C").
+//
+// Note: LLVM optimizations can inline and remove functions, after which you will not be
+// able to call them. Closure can also do so. To avoid that, add your function to
+// the exports using something like
+//
+// -s EXPORTED_FUNCTIONS='["_main", "_myfunc"]'
+//
+// @param ident The name of the C function (note that C++ functions will be name-mangled - use extern "C")
+// @param returnType The return type of the function, one of the JS types 'number', 'string' or 'array' (use 'number' for any C pointer, and
+// 'array' for JavaScript arrays and typed arrays; note that arrays are 8-bit).
+// @param argTypes An array of the types of arguments for the function (if there are no arguments, this can be ommitted). Types are as in returnType,
+// except that 'array' is not possible (there is no way for us to know the length of the array)
+// @param args An array of the arguments to the function, as native JS values (as in returnType)
+// Note that string arguments will be stored on the stack (the JS string will become a C string on the stack).
+// @return The return value, as a native JS value (as in returnType)
+function ccall(ident, returnType, argTypes, args) {
+ return ccallFunc(getCFunc(ident), returnType, argTypes, args);
+}
+Module["ccall"] = ccall;
+
+// Returns the C function with a specified identifier (for C++, you need to do manual name mangling)
+function getCFunc(ident) {
+ try {
+ var func = Module['_' + ident]; // closure exported function
+ if (!func) func = eval('_' + ident); // explicit lookup
+ } catch(e) {
+ }
+ assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');
+ return func;
+}
+
+// Internal function that does a C call using a function, not an identifier
+function ccallFunc(func, returnType, argTypes, args) {
+ var stack = 0;
+ function toC(value, type) {
+ if (type == 'string') {
+ if (value === null || value === undefined || value === 0) return 0; // null string
+ value = intArrayFromString(value);
+ type = 'array';
+ }
+ if (type == 'array') {
+ if (!stack) stack = Runtime.stackSave();
+ var ret = Runtime.stackAlloc(value.length);
+ writeArrayToMemory(value, ret);
+ return ret;
+ }
+ return value;
+ }
+ function fromC(value, type) {
+ if (type == 'string') {
+ return Pointer_stringify(value);
+ }
+ assert(type != 'array');
+ return value;
+ }
+ var i = 0;
+ var cArgs = args ? args.map(function(arg) {
+ return toC(arg, argTypes[i++]);
+ }) : [];
+ var ret = fromC(func.apply(null, cArgs), returnType);
+ if (stack) Runtime.stackRestore(stack);
+ return ret;
+}
+
+// Returns a native JS wrapper for a C function. This is similar to ccall, but
+// returns a function you can call repeatedly in a normal way. For example:
+//
+// var my_function = cwrap('my_c_function', 'number', ['number', 'number']);
+// alert(my_function(5, 22));
+// alert(my_function(99, 12));
+//
+function cwrap(ident, returnType, argTypes) {
+ var func = getCFunc(ident);
+ return function() {
+ return ccallFunc(func, returnType, argTypes, Array.prototype.slice.call(arguments));
+ }
+}
+Module["cwrap"] = cwrap;
+
+// Sets a value in memory in a dynamic way at run-time. Uses the
+// type data. This is the same as makeSetValue, except that
+// makeSetValue is done at compile-time and generates the needed
+// code then, whereas this function picks the right code at
+// run-time.
+// Note that setValue and getValue only do *aligned* writes and reads!
+// Note that ccall uses JS types as for defining types, while setValue and
+// getValue need LLVM types ('i8', 'i32') - this is a lower-level operation
+function setValue(ptr, value, type, noSafe) {
+ type = type || 'i8';
+ if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
+ switch(type) {
+ case 'i1': HEAP8[(ptr)]=value; break;
+ case 'i8': HEAP8[(ptr)]=value; break;
+ case 'i16': HEAP16[((ptr)>>1)]=value; break;
+ case 'i32': HEAP32[((ptr)>>2)]=value; break;
+ case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;
+ case 'float': HEAPF32[((ptr)>>2)]=value; break;
+ case 'double': HEAPF64[((ptr)>>3)]=value; break;
+ default: abort('invalid type for setValue: ' + type);
+ }
+}
+Module['setValue'] = setValue;
+
+// Parallel to setValue.
+function getValue(ptr, type, noSafe) {
+ type = type || 'i8';
+ if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
+ switch(type) {
+ case 'i1': return HEAP8[(ptr)];
+ case 'i8': return HEAP8[(ptr)];
+ case 'i16': return HEAP16[((ptr)>>1)];
+ case 'i32': return HEAP32[((ptr)>>2)];
+ case 'i64': return HEAP32[((ptr)>>2)];
+ case 'float': return HEAPF32[((ptr)>>2)];
+ case 'double': return HEAPF64[((ptr)>>3)];
+ default: abort('invalid type for setValue: ' + type);
+ }
+ return null;
+}
+Module['getValue'] = getValue;
+
+var ALLOC_NORMAL = 0; // Tries to use _malloc()
+var ALLOC_STACK = 1; // Lives for the duration of the current function call
+var ALLOC_STATIC = 2; // Cannot be freed
+var ALLOC_DYNAMIC = 3; // Cannot be freed except through sbrk
+var ALLOC_NONE = 4; // Do not allocate
+Module['ALLOC_NORMAL'] = ALLOC_NORMAL;
+Module['ALLOC_STACK'] = ALLOC_STACK;
+Module['ALLOC_STATIC'] = ALLOC_STATIC;
+Module['ALLOC_DYNAMIC'] = ALLOC_DYNAMIC;
+Module['ALLOC_NONE'] = ALLOC_NONE;
+
+// allocate(): This is for internal use. You can use it yourself as well, but the interface
+// is a little tricky (see docs right below). The reason is that it is optimized
+// for multiple syntaxes to save space in generated code. So you should
+// normally not use allocate(), and instead allocate memory using _malloc(),
+// initialize it with setValue(), and so forth.
+// @slab: An array of data, or a number. If a number, then the size of the block to allocate,
+// in *bytes* (note that this is sometimes confusing: the next parameter does not
+// affect this!)
+// @types: Either an array of types, one for each byte (or 0 if no type at that position),
+// or a single type which is used for the entire block. This only matters if there
+// is initial data - if @slab is a number, then this does not matter at all and is
+// ignored.
+// @allocator: How to allocate memory, see ALLOC_*
+function allocate(slab, types, allocator, ptr) {
+ var zeroinit, size;
+ if (typeof slab === 'number') {
+ zeroinit = true;
+ size = slab;
+ } else {
+ zeroinit = false;
+ size = slab.length;
+ }
+
+ var singleType = typeof types === 'string' ? types : null;
+
+ var ret;
+ if (allocator == ALLOC_NONE) {
+ ret = ptr;
+ } else {
+ ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));
+ }
+
+ if (zeroinit) {
+ var ptr = ret, stop;
+ assert((ret & 3) == 0);
+ stop = ret + (size & ~3);
+ for (; ptr < stop; ptr += 4) {
+ HEAP32[((ptr)>>2)]=0;
+ }
+ stop = ret + size;
+ while (ptr < stop) {
+ HEAP8[((ptr++)|0)]=0;
+ }
+ return ret;
+ }
+
+ if (singleType === 'i8') {
+ if (slab.subarray || slab.slice) {
+ HEAPU8.set(slab, ret);
+ } else {
+ HEAPU8.set(new Uint8Array(slab), ret);
+ }
+ return ret;
+ }
+
+ var i = 0, type, typeSize, previousType;
+ while (i < size) {
+ var curr = slab[i];
+
+ if (typeof curr === 'function') {
+ curr = Runtime.getFunctionIndex(curr);
+ }
+
+ type = singleType || types[i];
+ if (type === 0) {
+ i++;
+ continue;
+ }
+
+ if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later
+
+ setValue(ret+i, curr, type);
+
+ // no need to look up size unless type changes, so cache it
+ if (previousType !== type) {
+ typeSize = Runtime.getNativeTypeSize(type);
+ previousType = type;
+ }
+ i += typeSize;
+ }
+
+ return ret;
+}
+Module['allocate'] = allocate;
+
+function Pointer_stringify(ptr, /* optional */ length) {
+ // TODO: use TextDecoder
+ // Find the length, and check for UTF while doing so
+ var hasUtf = false;
+ var t;
+ var i = 0;
+ while (1) {
+ t = HEAPU8[(((ptr)+(i))|0)];
+ if (t >= 128) hasUtf = true;
+ else if (t == 0 && !length) break;
+ i++;
+ if (length && i == length) break;
+ }
+ if (!length) length = i;
+
+ var ret = '';
+
+ if (!hasUtf) {
+ var MAX_CHUNK = 1024; // split up into chunks, because .apply on a huge string can overflow the stack
+ var curr;
+ while (length > 0) {
+ curr = String.fromCharCode.apply(String, HEAPU8.subarray(ptr, ptr + Math.min(length, MAX_CHUNK)));
+ ret = ret ? ret + curr : curr;
+ ptr += MAX_CHUNK;
+ length -= MAX_CHUNK;
+ }
+ return ret;
+ }
+
+ var utf8 = new Runtime.UTF8Processor();
+ for (i = 0; i < length; i++) {
+ t = HEAPU8[(((ptr)+(i))|0)];
+ ret += utf8.processCChar(t);
+ }
+ return ret;
+}
+Module['Pointer_stringify'] = Pointer_stringify;
+
+// Given a pointer 'ptr' to a null-terminated UTF16LE-encoded string in the emscripten HEAP, returns
+// a copy of that string as a Javascript String object.
+function UTF16ToString(ptr) {
+ var i = 0;
+
+ var str = '';
+ while (1) {
+ var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];
+ if (codeUnit == 0)
+ return str;
+ ++i;
+ // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.
+ str += String.fromCharCode(codeUnit);
+ }
+}
+Module['UTF16ToString'] = UTF16ToString;
+
+// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
+// null-terminated and encoded in UTF16LE form. The copy will require at most (str.length*2+1)*2 bytes of space in the HEAP.
+function stringToUTF16(str, outPtr) {
+ for(var i = 0; i < str.length; ++i) {
+ // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.
+ var codeUnit = str.charCodeAt(i); // possibly a lead surrogate
+ HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;
+ }
+ // Null-terminate the pointer to the HEAP.
+ HEAP16[(((outPtr)+(str.length*2))>>1)]=0;
+}
+Module['stringToUTF16'] = stringToUTF16;
+
+// Given a pointer 'ptr' to a null-terminated UTF32LE-encoded string in the emscripten HEAP, returns
+// a copy of that string as a Javascript String object.
+function UTF32ToString(ptr) {
+ var i = 0;
+
+ var str = '';
+ while (1) {
+ var utf32 = HEAP32[(((ptr)+(i*4))>>2)];
+ if (utf32 == 0)
+ return str;
+ ++i;
+ // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.
+ if (utf32 >= 0x10000) {
+ var ch = utf32 - 0x10000;
+ str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));
+ } else {
+ str += String.fromCharCode(utf32);
+ }
+ }
+}
+Module['UTF32ToString'] = UTF32ToString;
+
+// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
+// null-terminated and encoded in UTF32LE form. The copy will require at most (str.length+1)*4 bytes of space in the HEAP,
+// but can use less, since str.length does not return the number of characters in the string, but the number of UTF-16 code units in the string.
+function stringToUTF32(str, outPtr) {
+ var iChar = 0;
+ for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {
+ // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.
+ var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate
+ if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {
+ var trailSurrogate = str.charCodeAt(++iCodeUnit);
+ codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);
+ }
+ HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;
+ ++iChar;
+ }
+ // Null-terminate the pointer to the HEAP.
+ HEAP32[(((outPtr)+(iChar*4))>>2)]=0;
+}
+Module['stringToUTF32'] = stringToUTF32;
+
+function demangle(func) {
+ var i = 3;
+ // params, etc.
+ var basicTypes = {
+ 'v': 'void',
+ 'b': 'bool',
+ 'c': 'char',
+ 's': 'short',
+ 'i': 'int',
+ 'l': 'long',
+ 'f': 'float',
+ 'd': 'double',
+ 'w': 'wchar_t',
+ 'a': 'signed char',
+ 'h': 'unsigned char',
+ 't': 'unsigned short',
+ 'j': 'unsigned int',
+ 'm': 'unsigned long',
+ 'x': 'long long',
+ 'y': 'unsigned long long',
+ 'z': '...'
+ };
+ var subs = [];
+ var first = true;
+ function dump(x) {
+ //return;
+ if (x) Module.print(x);
+ Module.print(func);
+ var pre = '';
+ for (var a = 0; a < i; a++) pre += ' ';
+ Module.print (pre + '^');
+ }
+ function parseNested() {
+ i++;
+ if (func[i] === 'K') i++; // ignore const
+ var parts = [];
+ while (func[i] !== 'E') {
+ if (func[i] === 'S') { // substitution
+ i++;
+ var next = func.indexOf('_', i);
+ var num = func.substring(i, next) || 0;
+ parts.push(subs[num] || '?');
+ i = next+1;
+ continue;
+ }
+ if (func[i] === 'C') { // constructor
+ parts.push(parts[parts.length-1]);
+ i += 2;
+ continue;
+ }
+ var size = parseInt(func.substr(i));
+ var pre = size.toString().length;
+ if (!size || !pre) { i--; break; } // counter i++ below us
+ var curr = func.substr(i + pre, size);
+ parts.push(curr);
+ subs.push(curr);
+ i += pre + size;
+ }
+ i++; // skip E
+ return parts;
+ }
+ function parse(rawList, limit, allowVoid) { // main parser
+ limit = limit || Infinity;
+ var ret = '', list = [];
+ function flushList() {
+ return '(' + list.join(', ') + ')';
+ }
+ var name;
+ if (func[i] === 'N') {
+ // namespaced N-E
+ name = parseNested().join('::');
+ limit--;
+ if (limit === 0) return rawList ? [name] : name;
+ } else {
+ // not namespaced
+ if (func[i] === 'K' || (first && func[i] === 'L')) i++; // ignore const and first 'L'
+ var size = parseInt(func.substr(i));
+ if (size) {
+ var pre = size.toString().length;
+ name = func.substr(i + pre, size);
+ i += pre + size;
+ }
+ }
+ first = false;
+ if (func[i] === 'I') {
+ i++;
+ var iList = parse(true);
+ var iRet = parse(true, 1, true);
+ ret += iRet[0] + ' ' + name + '<' + iList.join(', ') + '>';
+ } else {
+ ret = name;
+ }
+ paramLoop: while (i < func.length && limit-- > 0) {
+ //dump('paramLoop');
+ var c = func[i++];
+ if (c in basicTypes) {
+ list.push(basicTypes[c]);
+ } else {
+ switch (c) {
+ case 'P': list.push(parse(true, 1, true)[0] + '*'); break; // pointer
+ case 'R': list.push(parse(true, 1, true)[0] + '&'); break; // reference
+ case 'L': { // literal
+ i++; // skip basic type
+ var end = func.indexOf('E', i);
+ var size = end - i;
+ list.push(func.substr(i, size));
+ i += size + 2; // size + 'EE'
+ break;
+ }
+ case 'A': { // array
+ var size = parseInt(func.substr(i));
+ i += size.toString().length;
+ if (func[i] !== '_') throw '?';
+ i++; // skip _
+ list.push(parse(true, 1, true)[0] + ' [' + size + ']');
+ break;
+ }
+ case 'E': break paramLoop;
+ default: ret += '?' + c; break paramLoop;
+ }
+ }
+ }
+ if (!allowVoid && list.length === 1 && list[0] === 'void') list = []; // avoid (void)
+ if (rawList) {
+ if (ret) {
+ list.push(ret + '?');
+ }
+ return list;
+ } else {
+ return ret + flushList();
+ }
+ }
+ try {
+ // Special-case the entry point, since its name differs from other name mangling.
+ if (func == 'Object._main' || func == '_main') {
+ return 'main()';
+ }
+ if (typeof func === 'number') func = Pointer_stringify(func);
+ if (func[0] !== '_') return func;
+ if (func[1] !== '_') return func; // C function
+ if (func[2] !== 'Z') return func;
+ switch (func[3]) {
+ case 'n': return 'operator new()';
+ case 'd': return 'operator delete()';
+ }
+ return parse();
+ } catch(e) {
+ return func;
+ }
+}
+
+function demangleAll(text) {
+ return text.replace(/__Z[\w\d_]+/g, function(x) { var y = demangle(x); return x === y ? x : (x + ' [' + y + ']') });
+}
+
+function stackTrace() {
+ var stack = new Error().stack;
+ return stack ? demangleAll(stack) : '(no stack trace available)'; // Stack trace is not available at least on IE10 and Safari 6.
+}
+
+// Memory management
+
+var PAGE_SIZE = 4096;
+function alignMemoryPage(x) {
+ return (x+4095)&-4096;
+}
+
+var HEAP;
+var HEAP8, HEAPU8, HEAP16, HEAPU16, HEAP32, HEAPU32, HEAPF32, HEAPF64;
+
+var STATIC_BASE = 0, STATICTOP = 0, staticSealed = false; // static area
+var STACK_BASE = 0, STACKTOP = 0, STACK_MAX = 0; // stack area
+var DYNAMIC_BASE = 0, DYNAMICTOP = 0; // dynamic area handled by sbrk
+
+function enlargeMemory() {
+ abort('Cannot enlarge memory arrays. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value ' + TOTAL_MEMORY + ', (2) compile with ALLOW_MEMORY_GROWTH which adjusts the size at runtime but prevents some optimizations, or (3) set Module.TOTAL_MEMORY before the program runs.');
+}
+
+var TOTAL_STACK = Module['TOTAL_STACK'] || 5242880;
+var TOTAL_MEMORY = Module['TOTAL_MEMORY'] || 134217728;
+var FAST_MEMORY = Module['FAST_MEMORY'] || 2097152;
+
+var totalMemory = 4096;
+while (totalMemory < TOTAL_MEMORY || totalMemory < 2*TOTAL_STACK) {
+ if (totalMemory < 16*1024*1024) {
+ totalMemory *= 2;
+ } else {
+ totalMemory += 16*1024*1024
+ }
+}
+if (totalMemory !== TOTAL_MEMORY) {
+ Module.printErr('increasing TOTAL_MEMORY to ' + totalMemory + ' to be more reasonable');
+ TOTAL_MEMORY = totalMemory;
+}
+
+// Initialize the runtime's memory
+// check for full engine support (use string 'subarray' to avoid closure compiler confusion)
+assert(typeof Int32Array !== 'undefined' && typeof Float64Array !== 'undefined' && !!(new Int32Array(1)['subarray']) && !!(new Int32Array(1)['set']),
+ 'JS engine does not provide full typed array support');
+
+var buffer = new ArrayBuffer(TOTAL_MEMORY);
+HEAP8 = new Int8Array(buffer);
+HEAP16 = new Int16Array(buffer);
+HEAP32 = new Int32Array(buffer);
+HEAPU8 = new Uint8Array(buffer);
+HEAPU16 = new Uint16Array(buffer);
+HEAPU32 = new Uint32Array(buffer);
+HEAPF32 = new Float32Array(buffer);
+HEAPF64 = new Float64Array(buffer);
+
+// Endianness check (note: assumes compiler arch was little-endian)
+HEAP32[0] = 255;
+assert(HEAPU8[0] === 255 && HEAPU8[3] === 0, 'Typed arrays 2 must be run on a little-endian system');
+
+Module['HEAP'] = HEAP;
+Module['HEAP8'] = HEAP8;
+Module['HEAP16'] = HEAP16;
+Module['HEAP32'] = HEAP32;
+Module['HEAPU8'] = HEAPU8;
+Module['HEAPU16'] = HEAPU16;
+Module['HEAPU32'] = HEAPU32;
+Module['HEAPF32'] = HEAPF32;
+Module['HEAPF64'] = HEAPF64;
+
+function callRuntimeCallbacks(callbacks) {
+ while(callbacks.length > 0) {
+ var callback = callbacks.shift();
+ if (typeof callback == 'function') {
+ callback();
+ continue;
+ }
+ var func = callback.func;
+ if (typeof func === 'number') {
+ if (callback.arg === undefined) {
+ Runtime.dynCall('v', func);
+ } else {
+ Runtime.dynCall('vi', func, [callback.arg]);
+ }
+ } else {
+ func(callback.arg === undefined ? null : callback.arg);
+ }
+ }
+}
+
+var __ATPRERUN__ = []; // functions called before the runtime is initialized
+var __ATINIT__ = []; // functions called during startup
+var __ATMAIN__ = []; // functions called when main() is to be run
+var __ATEXIT__ = []; // functions called during shutdown
+var __ATPOSTRUN__ = []; // functions called after the runtime has exited
+
+var runtimeInitialized = false;
+
+function preRun() {
+ // compatibility - merge in anything from Module['preRun'] at this time
+ if (Module['preRun']) {
+ if (typeof Module['preRun'] == 'function') Module['preRun'] = [Module['preRun']];
+ while (Module['preRun'].length) {
+ addOnPreRun(Module['preRun'].shift());
+ }
+ }
+ callRuntimeCallbacks(__ATPRERUN__);
+}
+
+function ensureInitRuntime() {
+ if (runtimeInitialized) return;
+ runtimeInitialized = true;
+ callRuntimeCallbacks(__ATINIT__);
+}
+
+function preMain() {
+ callRuntimeCallbacks(__ATMAIN__);
+}
+
+function exitRuntime() {
+ callRuntimeCallbacks(__ATEXIT__);
+}
+
+function postRun() {
+ // compatibility - merge in anything from Module['postRun'] at this time
+ if (Module['postRun']) {
+ if (typeof Module['postRun'] == 'function') Module['postRun'] = [Module['postRun']];
+ while (Module['postRun'].length) {
+ addOnPostRun(Module['postRun'].shift());
+ }
+ }
+ callRuntimeCallbacks(__ATPOSTRUN__);
+}
+
+function addOnPreRun(cb) {
+ __ATPRERUN__.unshift(cb);
+}
+Module['addOnPreRun'] = Module.addOnPreRun = addOnPreRun;
+
+function addOnInit(cb) {
+ __ATINIT__.unshift(cb);
+}
+Module['addOnInit'] = Module.addOnInit = addOnInit;
+
+function addOnPreMain(cb) {
+ __ATMAIN__.unshift(cb);
+}
+Module['addOnPreMain'] = Module.addOnPreMain = addOnPreMain;
+
+function addOnExit(cb) {
+ __ATEXIT__.unshift(cb);
+}
+Module['addOnExit'] = Module.addOnExit = addOnExit;
+
+function addOnPostRun(cb) {
+ __ATPOSTRUN__.unshift(cb);
+}
+Module['addOnPostRun'] = Module.addOnPostRun = addOnPostRun;
+
+// Tools
+
+// This processes a JS string into a C-line array of numbers, 0-terminated.
+// For LLVM-originating strings, see parser.js:parseLLVMString function
+function intArrayFromString(stringy, dontAddNull, length /* optional */) {
+ var ret = (new Runtime.UTF8Processor()).processJSString(stringy);
+ if (length) {
+ ret.length = length;
+ }
+ if (!dontAddNull) {
+ ret.push(0);
+ }
+ return ret;
+}
+Module['intArrayFromString'] = intArrayFromString;
+
+function intArrayToString(array) {
+ var ret = [];
+ for (var i = 0; i < array.length; i++) {
+ var chr = array[i];
+ if (chr > 0xFF) {
+ chr &= 0xFF;
+ }
+ ret.push(String.fromCharCode(chr));
+ }
+ return ret.join('');
+}
+Module['intArrayToString'] = intArrayToString;
+
+// Write a Javascript array to somewhere in the heap
+function writeStringToMemory(string, buffer, dontAddNull) {
+ var array = intArrayFromString(string, dontAddNull);
+ var i = 0;
+ while (i < array.length) {
+ var chr = array[i];
+ HEAP8[(((buffer)+(i))|0)]=chr;
+ i = i + 1;
+ }
+}
+Module['writeStringToMemory'] = writeStringToMemory;
+
+function writeArrayToMemory(array, buffer) {
+ for (var i = 0; i < array.length; i++) {
+ HEAP8[(((buffer)+(i))|0)]=array[i];
+ }
+}
+Module['writeArrayToMemory'] = writeArrayToMemory;
+
+function writeAsciiToMemory(str, buffer, dontAddNull) {
+ for (var i = 0; i < str.length; i++) {
+ HEAP8[(((buffer)+(i))|0)]=str.charCodeAt(i);
+ }
+ if (!dontAddNull) HEAP8[(((buffer)+(str.length))|0)]=0;
+}
+Module['writeAsciiToMemory'] = writeAsciiToMemory;
+
+function unSign(value, bits, ignore) {
+ if (value >= 0) {
+ return value;
+ }
+ return bits <= 32 ? 2*Math.abs(1 << (bits-1)) + value // Need some trickery, since if bits == 32, we are right at the limit of the bits JS uses in bitshifts
+ : Math.pow(2, bits) + value;
+}
+function reSign(value, bits, ignore) {
+ if (value <= 0) {
+ return value;
+ }
+ var half = bits <= 32 ? Math.abs(1 << (bits-1)) // abs is needed if bits == 32
+ : Math.pow(2, bits-1);
+ if (value >= half && (bits <= 32 || value > half)) { // for huge values, we can hit the precision limit and always get true here. so don't do that
+ // but, in general there is no perfect solution here. With 64-bit ints, we get rounding and errors
+ // TODO: In i64 mode 1, resign the two parts separately and safely
+ value = -2*half + value; // Cannot bitshift half, as it may be at the limit of the bits JS uses in bitshifts
+ }
+ return value;
+}
+
+// check for imul support, and also for correctness ( https://bugs.webkit.org/show_bug.cgi?id=126345 )
+if (!Math['imul'] || Math['imul'](0xffffffff, 5) !== -5) Math['imul'] = function imul(a, b) {
+ var ah = a >>> 16;
+ var al = a & 0xffff;
+ var bh = b >>> 16;
+ var bl = b & 0xffff;
+ return (al*bl + ((ah*bl + al*bh) << 16))|0;
+};
+Math.imul = Math['imul'];
+
+
+var Math_abs = Math.abs;
+var Math_cos = Math.cos;
+var Math_sin = Math.sin;
+var Math_tan = Math.tan;
+var Math_acos = Math.acos;
+var Math_asin = Math.asin;
+var Math_atan = Math.atan;
+var Math_atan2 = Math.atan2;
+var Math_exp = Math.exp;
+var Math_log = Math.log;
+var Math_sqrt = Math.sqrt;
+var Math_ceil = Math.ceil;
+var Math_floor = Math.floor;
+var Math_pow = Math.pow;
+var Math_imul = Math.imul;
+var Math_fround = Math.fround;
+var Math_min = Math.min;
+
+// A counter of dependencies for calling run(). If we need to
+// do asynchronous work before running, increment this and
+// decrement it. Incrementing must happen in a place like
+// PRE_RUN_ADDITIONS (used by emcc to add file preloading).
+// Note that you can add dependencies in preRun, even though
+// it happens right before run - run will be postponed until
+// the dependencies are met.
+var runDependencies = 0;
+var runDependencyWatcher = null;
+var dependenciesFulfilled = null; // overridden to take different actions when all run dependencies are fulfilled
+
+function addRunDependency(id) {
+ runDependencies++;
+ if (Module['monitorRunDependencies']) {
+ Module['monitorRunDependencies'](runDependencies);
+ }
+}
+Module['addRunDependency'] = addRunDependency;
+function removeRunDependency(id) {
+ runDependencies--;
+ if (Module['monitorRunDependencies']) {
+ Module['monitorRunDependencies'](runDependencies);
+ }
+ if (runDependencies == 0) {
+ if (runDependencyWatcher !== null) {
+ clearInterval(runDependencyWatcher);
+ runDependencyWatcher = null;
+ }
+ if (dependenciesFulfilled) {
+ var callback = dependenciesFulfilled;
+ dependenciesFulfilled = null;
+ callback(); // can add another dependenciesFulfilled
+ }
+ }
+}
+Module['removeRunDependency'] = removeRunDependency;
+
+Module["preloadedImages"] = {}; // maps url to image data
+Module["preloadedAudios"] = {}; // maps url to audio data
+
+
+var memoryInitializer = null;
+
+// === Body ===
+
+
+
+
+
+STATIC_BASE = 8;
+
+STATICTOP = STATIC_BASE + Runtime.alignMemory(531);
+/* global initializers */ __ATINIT__.push();
+
+
+/* memory initializer */ allocate([101,114,114,111,114,58,32,37,100,10,0,0,0,0,0,0,102,105,110,97,108,58,32,37,100,46,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], "i8", ALLOC_NONE, Runtime.GLOBAL_BASE);
+
+
+
+
+var tempDoublePtr = Runtime.alignMemory(allocate(12, "i8", ALLOC_STATIC), 8);
+
+assert(tempDoublePtr % 8 == 0);
+
+function copyTempFloat(ptr) { // functions, because inlining this code increases code size too much
+
+ HEAP8[tempDoublePtr] = HEAP8[ptr];
+
+ HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
+
+ HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
+
+ HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
+
+}
+
+function copyTempDouble(ptr) {
+
+ HEAP8[tempDoublePtr] = HEAP8[ptr];
+
+ HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
+
+ HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
+
+ HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
+
+ HEAP8[tempDoublePtr+4] = HEAP8[ptr+4];
+
+ HEAP8[tempDoublePtr+5] = HEAP8[ptr+5];
+
+ HEAP8[tempDoublePtr+6] = HEAP8[ptr+6];
+
+ HEAP8[tempDoublePtr+7] = HEAP8[ptr+7];
+
+}
+
+
+
+
+
+
+ var ERRNO_CODES={EPERM:1,ENOENT:2,ESRCH:3,EINTR:4,EIO:5,ENXIO:6,E2BIG:7,ENOEXEC:8,EBADF:9,ECHILD:10,EAGAIN:11,EWOULDBLOCK:11,ENOMEM:12,EACCES:13,EFAULT:14,ENOTBLK:15,EBUSY:16,EEXIST:17,EXDEV:18,ENODEV:19,ENOTDIR:20,EISDIR:21,EINVAL:22,ENFILE:23,EMFILE:24,ENOTTY:25,ETXTBSY:26,EFBIG:27,ENOSPC:28,ESPIPE:29,EROFS:30,EMLINK:31,EPIPE:32,EDOM:33,ERANGE:34,ENOMSG:42,EIDRM:43,ECHRNG:44,EL2NSYNC:45,EL3HLT:46,EL3RST:47,ELNRNG:48,EUNATCH:49,ENOCSI:50,EL2HLT:51,EDEADLK:35,ENOLCK:37,EBADE:52,EBADR:53,EXFULL:54,ENOANO:55,EBADRQC:56,EBADSLT:57,EDEADLOCK:35,EBFONT:59,ENOSTR:60,ENODATA:61,ETIME:62,ENOSR:63,ENONET:64,ENOPKG:65,EREMOTE:66,ENOLINK:67,EADV:68,ESRMNT:69,ECOMM:70,EPROTO:71,EMULTIHOP:72,EDOTDOT:73,EBADMSG:74,ENOTUNIQ:76,EBADFD:77,EREMCHG:78,ELIBACC:79,ELIBBAD:80,ELIBSCN:81,ELIBMAX:82,ELIBEXEC:83,ENOSYS:38,ENOTEMPTY:39,ENAMETOOLONG:36,ELOOP:40,EOPNOTSUPP:95,EPFNOSUPPORT:96,ECONNRESET:104,ENOBUFS:105,EAFNOSUPPORT:97,EPROTOTYPE:91,ENOTSOCK:88,ENOPROTOOPT:92,ESHUTDOWN:108,ECONNREFUSED:111,EADDRINUSE:98,ECONNABORTED:103,ENETUNREACH:101,ENETDOWN:100,ETIMEDOUT:110,EHOSTDOWN:112,EHOSTUNREACH:113,EINPROGRESS:115,EALREADY:114,EDESTADDRREQ:89,EMSGSIZE:90,EPROTONOSUPPORT:93,ESOCKTNOSUPPORT:94,EADDRNOTAVAIL:99,ENETRESET:102,EISCONN:106,ENOTCONN:107,ETOOMANYREFS:109,EUSERS:87,EDQUOT:122,ESTALE:116,ENOTSUP:95,ENOMEDIUM:123,EILSEQ:84,EOVERFLOW:75,ECANCELED:125,ENOTRECOVERABLE:131,EOWNERDEAD:130,ESTRPIPE:86};
+
+ var ERRNO_MESSAGES={0:"Success",1:"Not super-user",2:"No such file or directory",3:"No such process",4:"Interrupted system call",5:"I/O error",6:"No such device or address",7:"Arg list too long",8:"Exec format error",9:"Bad file number",10:"No children",11:"No more processes",12:"Not enough core",13:"Permission denied",14:"Bad address",15:"Block device required",16:"Mount device busy",17:"File exists",18:"Cross-device link",19:"No such device",20:"Not a directory",21:"Is a directory",22:"Invalid argument",23:"Too many open files in system",24:"Too many open files",25:"Not a typewriter",26:"Text file busy",27:"File too large",28:"No space left on device",29:"Illegal seek",30:"Read only file system",31:"Too many links",32:"Broken pipe",33:"Math arg out of domain of func",34:"Math result not representable",35:"File locking deadlock error",36:"File or path name too long",37:"No record locks available",38:"Function not implemented",39:"Directory not empty",40:"Too many symbolic links",42:"No message of desired type",43:"Identifier removed",44:"Channel number out of range",45:"Level 2 not synchronized",46:"Level 3 halted",47:"Level 3 reset",48:"Link number out of range",49:"Protocol driver not attached",50:"No CSI structure available",51:"Level 2 halted",52:"Invalid exchange",53:"Invalid request descriptor",54:"Exchange full",55:"No anode",56:"Invalid request code",57:"Invalid slot",59:"Bad font file fmt",60:"Device not a stream",61:"No data (for no delay io)",62:"Timer expired",63:"Out of streams resources",64:"Machine is not on the network",65:"Package not installed",66:"The object is remote",67:"The link has been severed",68:"Advertise error",69:"Srmount error",70:"Communication error on send",71:"Protocol error",72:"Multihop attempted",73:"Cross mount point (not really error)",74:"Trying to read unreadable message",75:"Value too large for defined data type",76:"Given log. name not unique",77:"f.d. invalid for this operation",78:"Remote address changed",79:"Can access a needed shared lib",80:"Accessing a corrupted shared lib",81:".lib section in a.out corrupted",82:"Attempting to link in too many libs",83:"Attempting to exec a shared library",84:"Illegal byte sequence",86:"Streams pipe error",87:"Too many users",88:"Socket operation on non-socket",89:"Destination address required",90:"Message too long",91:"Protocol wrong type for socket",92:"Protocol not available",93:"Unknown protocol",94:"Socket type not supported",95:"Not supported",96:"Protocol family not supported",97:"Address family not supported by protocol family",98:"Address already in use",99:"Address not available",100:"Network interface is not configured",101:"Network is unreachable",102:"Connection reset by network",103:"Connection aborted",104:"Connection reset by peer",105:"No buffer space available",106:"Socket is already connected",107:"Socket is not connected",108:"Can't send after socket shutdown",109:"Too many references",110:"Connection timed out",111:"Connection refused",112:"Host is down",113:"Host is unreachable",114:"Socket already connected",115:"Connection already in progress",116:"Stale file handle",122:"Quota exceeded",123:"No medium (in tape drive)",125:"Operation canceled",130:"Previous owner died",131:"State not recoverable"};
+
+
+ var ___errno_state=0;function ___setErrNo(value) {
+ // For convenient setting and returning of errno.
+ HEAP32[((___errno_state)>>2)]=value;
+ return value;
+ }
+
+ var PATH={splitPath:function (filename) {
+ var splitPathRe = /^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/;
+ return splitPathRe.exec(filename).slice(1);
+ },normalizeArray:function (parts, allowAboveRoot) {
+ // if the path tries to go above the root, `up` ends up > 0
+ var up = 0;
+ for (var i = parts.length - 1; i >= 0; i--) {
+ var last = parts[i];
+ if (last === '.') {
+ parts.splice(i, 1);
+ } else if (last === '..') {
+ parts.splice(i, 1);
+ up++;
+ } else if (up) {
+ parts.splice(i, 1);
+ up--;
+ }
+ }
+ // if the path is allowed to go above the root, restore leading ..s
+ if (allowAboveRoot) {
+ for (; up--; up) {
+ parts.unshift('..');
+ }
+ }
+ return parts;
+ },normalize:function (path) {
+ var isAbsolute = path.charAt(0) === '/',
+ trailingSlash = path.substr(-1) === '/';
+ // Normalize the path
+ path = PATH.normalizeArray(path.split('/').filter(function(p) {
+ return !!p;
+ }), !isAbsolute).join('/');
+ if (!path && !isAbsolute) {
+ path = '.';
+ }
+ if (path && trailingSlash) {
+ path += '/';
+ }
+ return (isAbsolute ? '/' : '') + path;
+ },dirname:function (path) {
+ var result = PATH.splitPath(path),
+ root = result[0],
+ dir = result[1];
+ if (!root && !dir) {
+ // No dirname whatsoever
+ return '.';
+ }
+ if (dir) {
+ // It has a dirname, strip trailing slash
+ dir = dir.substr(0, dir.length - 1);
+ }
+ return root + dir;
+ },basename:function (path) {
+ // EMSCRIPTEN return '/'' for '/', not an empty string
+ if (path === '/') return '/';
+ var lastSlash = path.lastIndexOf('/');
+ if (lastSlash === -1) return path;
+ return path.substr(lastSlash+1);
+ },extname:function (path) {
+ return PATH.splitPath(path)[3];
+ },join:function () {
+ var paths = Array.prototype.slice.call(arguments, 0);
+ return PATH.normalize(paths.join('/'));
+ },join2:function (l, r) {
+ return PATH.normalize(l + '/' + r);
+ },resolve:function () {
+ var resolvedPath = '',
+ resolvedAbsolute = false;
+ for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {
+ var path = (i >= 0) ? arguments[i] : FS.cwd();
+ // Skip empty and invalid entries
+ if (typeof path !== 'string') {
+ throw new TypeError('Arguments to path.resolve must be strings');
+ } else if (!path) {
+ continue;
+ }
+ resolvedPath = path + '/' + resolvedPath;
+ resolvedAbsolute = path.charAt(0) === '/';
+ }
+ // At this point the path should be resolved to a full absolute path, but
+ // handle relative paths to be safe (might happen when process.cwd() fails)
+ resolvedPath = PATH.normalizeArray(resolvedPath.split('/').filter(function(p) {
+ return !!p;
+ }), !resolvedAbsolute).join('/');
+ return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.';
+ },relative:function (from, to) {
+ from = PATH.resolve(from).substr(1);
+ to = PATH.resolve(to).substr(1);
+ function trim(arr) {
+ var start = 0;
+ for (; start < arr.length; start++) {
+ if (arr[start] !== '') break;
+ }
+ var end = arr.length - 1;
+ for (; end >= 0; end--) {
+ if (arr[end] !== '') break;
+ }
+ if (start > end) return [];
+ return arr.slice(start, end - start + 1);
+ }
+ var fromParts = trim(from.split('/'));
+ var toParts = trim(to.split('/'));
+ var length = Math.min(fromParts.length, toParts.length);
+ var samePartsLength = length;
+ for (var i = 0; i < length; i++) {
+ if (fromParts[i] !== toParts[i]) {
+ samePartsLength = i;
+ break;
+ }
+ }
+ var outputParts = [];
+ for (var i = samePartsLength; i < fromParts.length; i++) {
+ outputParts.push('..');
+ }
+ outputParts = outputParts.concat(toParts.slice(samePartsLength));
+ return outputParts.join('/');
+ }};
+
+ var TTY={ttys:[],init:function () {
+ // https://github.com/kripken/emscripten/pull/1555
+ // if (ENVIRONMENT_IS_NODE) {
+ // // currently, FS.init does not distinguish if process.stdin is a file or TTY
+ // // device, it always assumes it's a TTY device. because of this, we're forcing
+ // // process.stdin to UTF8 encoding to at least make stdin reading compatible
+ // // with text files until FS.init can be refactored.
+ // process['stdin']['setEncoding']('utf8');
+ // }
+ },shutdown:function () {
+ // https://github.com/kripken/emscripten/pull/1555
+ // if (ENVIRONMENT_IS_NODE) {
+ // // inolen: any idea as to why node -e 'process.stdin.read()' wouldn't exit immediately (with process.stdin being a tty)?
+ // // isaacs: because now it's reading from the stream, you've expressed interest in it, so that read() kicks off a _read() which creates a ReadReq operation
+ // // inolen: I thought read() in that case was a synchronous operation that just grabbed some amount of buffered data if it exists?
+ // // isaacs: it is. but it also triggers a _read() call, which calls readStart() on the handle
+ // // isaacs: do process.stdin.pause() and i'd think it'd probably close the pending call
+ // process['stdin']['pause']();
+ // }
+ },register:function (dev, ops) {
+ TTY.ttys[dev] = { input: [], output: [], ops: ops };
+ FS.registerDevice(dev, TTY.stream_ops);
+ },stream_ops:{open:function (stream) {
+ var tty = TTY.ttys[stream.node.rdev];
+ if (!tty) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ stream.tty = tty;
+ stream.seekable = false;
+ },close:function (stream) {
+ // flush any pending line data
+ if (stream.tty.output.length) {
+ stream.tty.ops.put_char(stream.tty, 10);
+ }
+ },read:function (stream, buffer, offset, length, pos /* ignored */) {
+ if (!stream.tty || !stream.tty.ops.get_char) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
+ }
+ var bytesRead = 0;
+ for (var i = 0; i < length; i++) {
+ var result;
+ try {
+ result = stream.tty.ops.get_char(stream.tty);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ if (result === undefined && bytesRead === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ if (result === null || result === undefined) break;
+ bytesRead++;
+ buffer[offset+i] = result;
+ }
+ if (bytesRead) {
+ stream.node.timestamp = Date.now();
+ }
+ return bytesRead;
+ },write:function (stream, buffer, offset, length, pos) {
+ if (!stream.tty || !stream.tty.ops.put_char) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
+ }
+ for (var i = 0; i < length; i++) {
+ try {
+ stream.tty.ops.put_char(stream.tty, buffer[offset+i]);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ }
+ if (length) {
+ stream.node.timestamp = Date.now();
+ }
+ return i;
+ }},default_tty_ops:{get_char:function (tty) {
+ if (!tty.input.length) {
+ var result = null;
+ if (ENVIRONMENT_IS_NODE) {
+ result = process['stdin']['read']();
+ if (!result) {
+ if (process['stdin']['_readableState'] && process['stdin']['_readableState']['ended']) {
+ return null; // EOF
+ }
+ return undefined; // no data available
+ }
+ } else if (typeof window != 'undefined' &&
+ typeof window.prompt == 'function') {
+ // Browser.
+ result = window.prompt('Input: '); // returns null on cancel
+ if (result !== null) {
+ result += '\n';
+ }
+ } else if (typeof readline == 'function') {
+ // Command line.
+ result = readline();
+ if (result !== null) {
+ result += '\n';
+ }
+ }
+ if (!result) {
+ return null;
+ }
+ tty.input = intArrayFromString(result, true);
+ }
+ return tty.input.shift();
+ },put_char:function (tty, val) {
+ if (val === null || val === 10) {
+ Module['print'](tty.output.join(''));
+ tty.output = [];
+ } else {
+ tty.output.push(TTY.utf8.processCChar(val));
+ }
+ }},default_tty1_ops:{put_char:function (tty, val) {
+ if (val === null || val === 10) {
+ Module['printErr'](tty.output.join(''));
+ tty.output = [];
+ } else {
+ tty.output.push(TTY.utf8.processCChar(val));
+ }
+ }}};
+
+ var MEMFS={ops_table:null,CONTENT_OWNING:1,CONTENT_FLEXIBLE:2,CONTENT_FIXED:3,mount:function (mount) {
+ return MEMFS.createNode(null, '/', 16384 | 511 /* 0777 */, 0);
+ },createNode:function (parent, name, mode, dev) {
+ if (FS.isBlkdev(mode) || FS.isFIFO(mode)) {
+ // no supported
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (!MEMFS.ops_table) {
+ MEMFS.ops_table = {
+ dir: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr,
+ lookup: MEMFS.node_ops.lookup,
+ mknod: MEMFS.node_ops.mknod,
+ rename: MEMFS.node_ops.rename,
+ unlink: MEMFS.node_ops.unlink,
+ rmdir: MEMFS.node_ops.rmdir,
+ readdir: MEMFS.node_ops.readdir,
+ symlink: MEMFS.node_ops.symlink
+ },
+ stream: {
+ llseek: MEMFS.stream_ops.llseek
+ }
+ },
+ file: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr
+ },
+ stream: {
+ llseek: MEMFS.stream_ops.llseek,
+ read: MEMFS.stream_ops.read,
+ write: MEMFS.stream_ops.write,
+ allocate: MEMFS.stream_ops.allocate,
+ mmap: MEMFS.stream_ops.mmap
+ }
+ },
+ link: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr,
+ readlink: MEMFS.node_ops.readlink
+ },
+ stream: {}
+ },
+ chrdev: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr
+ },
+ stream: FS.chrdev_stream_ops
+ },
+ };
+ }
+ var node = FS.createNode(parent, name, mode, dev);
+ if (FS.isDir(node.mode)) {
+ node.node_ops = MEMFS.ops_table.dir.node;
+ node.stream_ops = MEMFS.ops_table.dir.stream;
+ node.contents = {};
+ } else if (FS.isFile(node.mode)) {
+ node.node_ops = MEMFS.ops_table.file.node;
+ node.stream_ops = MEMFS.ops_table.file.stream;
+ node.contents = [];
+ node.contentMode = MEMFS.CONTENT_FLEXIBLE;
+ } else if (FS.isLink(node.mode)) {
+ node.node_ops = MEMFS.ops_table.link.node;
+ node.stream_ops = MEMFS.ops_table.link.stream;
+ } else if (FS.isChrdev(node.mode)) {
+ node.node_ops = MEMFS.ops_table.chrdev.node;
+ node.stream_ops = MEMFS.ops_table.chrdev.stream;
+ }
+ node.timestamp = Date.now();
+ // add the new node to the parent
+ if (parent) {
+ parent.contents[name] = node;
+ }
+ return node;
+ },ensureFlexible:function (node) {
+ if (node.contentMode !== MEMFS.CONTENT_FLEXIBLE) {
+ var contents = node.contents;
+ node.contents = Array.prototype.slice.call(contents);
+ node.contentMode = MEMFS.CONTENT_FLEXIBLE;
+ }
+ },node_ops:{getattr:function (node) {
+ var attr = {};
+ // device numbers reuse inode numbers.
+ attr.dev = FS.isChrdev(node.mode) ? node.id : 1;
+ attr.ino = node.id;
+ attr.mode = node.mode;
+ attr.nlink = 1;
+ attr.uid = 0;
+ attr.gid = 0;
+ attr.rdev = node.rdev;
+ if (FS.isDir(node.mode)) {
+ attr.size = 4096;
+ } else if (FS.isFile(node.mode)) {
+ attr.size = node.contents.length;
+ } else if (FS.isLink(node.mode)) {
+ attr.size = node.link.length;
+ } else {
+ attr.size = 0;
+ }
+ attr.atime = new Date(node.timestamp);
+ attr.mtime = new Date(node.timestamp);
+ attr.ctime = new Date(node.timestamp);
+ // NOTE: In our implementation, st_blocks = Math.ceil(st_size/st_blksize),
+ // but this is not required by the standard.
+ attr.blksize = 4096;
+ attr.blocks = Math.ceil(attr.size / attr.blksize);
+ return attr;
+ },setattr:function (node, attr) {
+ if (attr.mode !== undefined) {
+ node.mode = attr.mode;
+ }
+ if (attr.timestamp !== undefined) {
+ node.timestamp = attr.timestamp;
+ }
+ if (attr.size !== undefined) {
+ MEMFS.ensureFlexible(node);
+ var contents = node.contents;
+ if (attr.size < contents.length) contents.length = attr.size;
+ else while (attr.size > contents.length) contents.push(0);
+ }
+ },lookup:function (parent, name) {
+ throw FS.genericErrors[ERRNO_CODES.ENOENT];
+ },mknod:function (parent, name, mode, dev) {
+ return MEMFS.createNode(parent, name, mode, dev);
+ },rename:function (old_node, new_dir, new_name) {
+ // if we're overwriting a directory at new_name, make sure it's empty.
+ if (FS.isDir(old_node.mode)) {
+ var new_node;
+ try {
+ new_node = FS.lookupNode(new_dir, new_name);
+ } catch (e) {
+ }
+ if (new_node) {
+ for (var i in new_node.contents) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ }
+ }
+ // do the internal rewiring
+ delete old_node.parent.contents[old_node.name];
+ old_node.name = new_name;
+ new_dir.contents[new_name] = old_node;
+ old_node.parent = new_dir;
+ },unlink:function (parent, name) {
+ delete parent.contents[name];
+ },rmdir:function (parent, name) {
+ var node = FS.lookupNode(parent, name);
+ for (var i in node.contents) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ delete parent.contents[name];
+ },readdir:function (node) {
+ var entries = ['.', '..']
+ for (var key in node.contents) {
+ if (!node.contents.hasOwnProperty(key)) {
+ continue;
+ }
+ entries.push(key);
+ }
+ return entries;
+ },symlink:function (parent, newname, oldpath) {
+ var node = MEMFS.createNode(parent, newname, 511 /* 0777 */ | 40960, 0);
+ node.link = oldpath;
+ return node;
+ },readlink:function (node) {
+ if (!FS.isLink(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ return node.link;
+ }},stream_ops:{read:function (stream, buffer, offset, length, position) {
+ var contents = stream.node.contents;
+ if (position >= contents.length)
+ return 0;
+ var size = Math.min(contents.length - position, length);
+ assert(size >= 0);
+ if (size > 8 && contents.subarray) { // non-trivial, and typed array
+ buffer.set(contents.subarray(position, position + size), offset);
+ } else
+ {
+ for (var i = 0; i < size; i++) {
+ buffer[offset + i] = contents[position + i];
+ }
+ }
+ return size;
+ },write:function (stream, buffer, offset, length, position, canOwn) {
+ var node = stream.node;
+ node.timestamp = Date.now();
+ var contents = node.contents;
+ if (length && contents.length === 0 && position === 0 && buffer.subarray) {
+ // just replace it with the new data
+ if (canOwn && offset === 0) {
+ node.contents = buffer; // this could be a subarray of Emscripten HEAP, or allocated from some other source.
+ node.contentMode = (buffer.buffer === HEAP8.buffer) ? MEMFS.CONTENT_OWNING : MEMFS.CONTENT_FIXED;
+ } else {
+ node.contents = new Uint8Array(buffer.subarray(offset, offset+length));
+ node.contentMode = MEMFS.CONTENT_FIXED;
+ }
+ return length;
+ }
+ MEMFS.ensureFlexible(node);
+ var contents = node.contents;
+ while (contents.length < position) contents.push(0);
+ for (var i = 0; i < length; i++) {
+ contents[position + i] = buffer[offset + i];
+ }
+ return length;
+ },llseek:function (stream, offset, whence) {
+ var position = offset;
+ if (whence === 1) { // SEEK_CUR.
+ position += stream.position;
+ } else if (whence === 2) { // SEEK_END.
+ if (FS.isFile(stream.node.mode)) {
+ position += stream.node.contents.length;
+ }
+ }
+ if (position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ stream.ungotten = [];
+ stream.position = position;
+ return position;
+ },allocate:function (stream, offset, length) {
+ MEMFS.ensureFlexible(stream.node);
+ var contents = stream.node.contents;
+ var limit = offset + length;
+ while (limit > contents.length) contents.push(0);
+ },mmap:function (stream, buffer, offset, length, position, prot, flags) {
+ if (!FS.isFile(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ var ptr;
+ var allocated;
+ var contents = stream.node.contents;
+ // Only make a new copy when MAP_PRIVATE is specified.
+ if ( !(flags & 2) &&
+ (contents.buffer === buffer || contents.buffer === buffer.buffer) ) {
+ // We can't emulate MAP_SHARED when the file is not backed by the buffer
+ // we're mapping to (e.g. the HEAP buffer).
+ allocated = false;
+ ptr = contents.byteOffset;
+ } else {
+ // Try to avoid unnecessary slices.
+ if (position > 0 || position + length < contents.length) {
+ if (contents.subarray) {
+ contents = contents.subarray(position, position + length);
+ } else {
+ contents = Array.prototype.slice.call(contents, position, position + length);
+ }
+ }
+ allocated = true;
+ ptr = _malloc(length);
+ if (!ptr) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOMEM);
+ }
+ buffer.set(contents, ptr);
+ }
+ return { ptr: ptr, allocated: allocated };
+ }}};
+
+ var IDBFS={dbs:{},indexedDB:function () {
+ return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
+ },DB_VERSION:21,DB_STORE_NAME:"FILE_DATA",mount:function (mount) {
+ // reuse all of the core MEMFS functionality
+ return MEMFS.mount.apply(null, arguments);
+ },syncfs:function (mount, populate, callback) {
+ IDBFS.getLocalSet(mount, function(err, local) {
+ if (err) return callback(err);
+
+ IDBFS.getRemoteSet(mount, function(err, remote) {
+ if (err) return callback(err);
+
+ var src = populate ? remote : local;
+ var dst = populate ? local : remote;
+
+ IDBFS.reconcile(src, dst, callback);
+ });
+ });
+ },getDB:function (name, callback) {
+ // check the cache first
+ var db = IDBFS.dbs[name];
+ if (db) {
+ return callback(null, db);
+ }
+
+ var req;
+ try {
+ req = IDBFS.indexedDB().open(name, IDBFS.DB_VERSION);
+ } catch (e) {
+ return callback(e);
+ }
+ req.onupgradeneeded = function(e) {
+ var db = e.target.result;
+ var transaction = e.target.transaction;
+
+ var fileStore;
+
+ if (db.objectStoreNames.contains(IDBFS.DB_STORE_NAME)) {
+ fileStore = transaction.objectStore(IDBFS.DB_STORE_NAME);
+ } else {
+ fileStore = db.createObjectStore(IDBFS.DB_STORE_NAME);
+ }
+
+ fileStore.createIndex('timestamp', 'timestamp', { unique: false });
+ };
+ req.onsuccess = function() {
+ db = req.result;
+
+ // add to the cache
+ IDBFS.dbs[name] = db;
+ callback(null, db);
+ };
+ req.onerror = function() {
+ callback(this.error);
+ };
+ },getLocalSet:function (mount, callback) {
+ var entries = {};
+
+ function isRealDir(p) {
+ return p !== '.' && p !== '..';
+ };
+ function toAbsolute(root) {
+ return function(p) {
+ return PATH.join2(root, p);
+ }
+ };
+
+ var check = FS.readdir(mount.mountpoint).filter(isRealDir).map(toAbsolute(mount.mountpoint));
+
+ while (check.length) {
+ var path = check.pop();
+ var stat;
+
+ try {
+ stat = FS.stat(path);
+ } catch (e) {
+ return callback(e);
+ }
+
+ if (FS.isDir(stat.mode)) {
+ check.push.apply(check, FS.readdir(path).filter(isRealDir).map(toAbsolute(path)));
+ }
+
+ entries[path] = { timestamp: stat.mtime };
+ }
+
+ return callback(null, { type: 'local', entries: entries });
+ },getRemoteSet:function (mount, callback) {
+ var entries = {};
+
+ IDBFS.getDB(mount.mountpoint, function(err, db) {
+ if (err) return callback(err);
+
+ var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readonly');
+ transaction.onerror = function() { callback(this.error); };
+
+ var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
+ var index = store.index('timestamp');
+
+ index.openKeyCursor().onsuccess = function(event) {
+ var cursor = event.target.result;
+
+ if (!cursor) {
+ return callback(null, { type: 'remote', db: db, entries: entries });
+ }
+
+ entries[cursor.primaryKey] = { timestamp: cursor.key };
+
+ cursor.continue();
+ };
+ });
+ },loadLocalEntry:function (path, callback) {
+ var stat, node;
+
+ try {
+ var lookup = FS.lookupPath(path);
+ node = lookup.node;
+ stat = FS.stat(path);
+ } catch (e) {
+ return callback(e);
+ }
+
+ if (FS.isDir(stat.mode)) {
+ return callback(null, { timestamp: stat.mtime, mode: stat.mode });
+ } else if (FS.isFile(stat.mode)) {
+ return callback(null, { timestamp: stat.mtime, mode: stat.mode, contents: node.contents });
+ } else {
+ return callback(new Error('node type not supported'));
+ }
+ },storeLocalEntry:function (path, entry, callback) {
+ try {
+ if (FS.isDir(entry.mode)) {
+ FS.mkdir(path, entry.mode);
+ } else if (FS.isFile(entry.mode)) {
+ FS.writeFile(path, entry.contents, { encoding: 'binary', canOwn: true });
+ } else {
+ return callback(new Error('node type not supported'));
+ }
+
+ FS.utime(path, entry.timestamp, entry.timestamp);
+ } catch (e) {
+ return callback(e);
+ }
+
+ callback(null);
+ },removeLocalEntry:function (path, callback) {
+ try {
+ var lookup = FS.lookupPath(path);
+ var stat = FS.stat(path);
+
+ if (FS.isDir(stat.mode)) {
+ FS.rmdir(path);
+ } else if (FS.isFile(stat.mode)) {
+ FS.unlink(path);
+ }
+ } catch (e) {
+ return callback(e);
+ }
+
+ callback(null);
+ },loadRemoteEntry:function (store, path, callback) {
+ var req = store.get(path);
+ req.onsuccess = function(event) { callback(null, event.target.result); };
+ req.onerror = function() { callback(this.error); };
+ },storeRemoteEntry:function (store, path, entry, callback) {
+ var req = store.put(entry, path);
+ req.onsuccess = function() { callback(null); };
+ req.onerror = function() { callback(this.error); };
+ },removeRemoteEntry:function (store, path, callback) {
+ var req = store.delete(path);
+ req.onsuccess = function() { callback(null); };
+ req.onerror = function() { callback(this.error); };
+ },reconcile:function (src, dst, callback) {
+ var total = 0;
+
+ var create = [];
+ Object.keys(src.entries).forEach(function (key) {
+ var e = src.entries[key];
+ var e2 = dst.entries[key];
+ if (!e2 || e.timestamp > e2.timestamp) {
+ create.push(key);
+ total++;
+ }
+ });
+
+ var remove = [];
+ Object.keys(dst.entries).forEach(function (key) {
+ var e = dst.entries[key];
+ var e2 = src.entries[key];
+ if (!e2) {
+ remove.push(key);
+ total++;
+ }
+ });
+
+ if (!total) {
+ return callback(null);
+ }
+
+ var errored = false;
+ var completed = 0;
+ var db = src.type === 'remote' ? src.db : dst.db;
+ var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readwrite');
+ var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
+
+ function done(err) {
+ if (err) {
+ if (!done.errored) {
+ done.errored = true;
+ return callback(err);
+ }
+ return;
+ }
+ if (++completed >= total) {
+ return callback(null);
+ }
+ };
+
+ transaction.onerror = function() { done(this.error); };
+
+ // sort paths in ascending order so directory entries are created
+ // before the files inside them
+ create.sort().forEach(function (path) {
+ if (dst.type === 'local') {
+ IDBFS.loadRemoteEntry(store, path, function (err, entry) {
+ if (err) return done(err);
+ IDBFS.storeLocalEntry(path, entry, done);
+ });
+ } else {
+ IDBFS.loadLocalEntry(path, function (err, entry) {
+ if (err) return done(err);
+ IDBFS.storeRemoteEntry(store, path, entry, done);
+ });
+ }
+ });
+
+ // sort paths in descending order so files are deleted before their
+ // parent directories
+ remove.sort().reverse().forEach(function(path) {
+ if (dst.type === 'local') {
+ IDBFS.removeLocalEntry(path, done);
+ } else {
+ IDBFS.removeRemoteEntry(store, path, done);
+ }
+ });
+ }};
+
+ var NODEFS={isWindows:false,staticInit:function () {
+ NODEFS.isWindows = !!process.platform.match(/^win/);
+ },mount:function (mount) {
+ assert(ENVIRONMENT_IS_NODE);
+ return NODEFS.createNode(null, '/', NODEFS.getMode(mount.opts.root), 0);
+ },createNode:function (parent, name, mode, dev) {
+ if (!FS.isDir(mode) && !FS.isFile(mode) && !FS.isLink(mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var node = FS.createNode(parent, name, mode);
+ node.node_ops = NODEFS.node_ops;
+ node.stream_ops = NODEFS.stream_ops;
+ return node;
+ },getMode:function (path) {
+ var stat;
+ try {
+ stat = fs.lstatSync(path);
+ if (NODEFS.isWindows) {
+ // On Windows, directories return permission bits 'rw-rw-rw-', even though they have 'rwxrwxrwx', so
+ // propagate write bits to execute bits.
+ stat.mode = stat.mode | ((stat.mode & 146) >> 1);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return stat.mode;
+ },realPath:function (node) {
+ var parts = [];
+ while (node.parent !== node) {
+ parts.push(node.name);
+ node = node.parent;
+ }
+ parts.push(node.mount.opts.root);
+ parts.reverse();
+ return PATH.join.apply(null, parts);
+ },flagsToPermissionStringMap:{0:"r",1:"r+",2:"r+",64:"r",65:"r+",66:"r+",129:"rx+",193:"rx+",514:"w+",577:"w",578:"w+",705:"wx",706:"wx+",1024:"a",1025:"a",1026:"a+",1089:"a",1090:"a+",1153:"ax",1154:"ax+",1217:"ax",1218:"ax+",4096:"rs",4098:"rs+"},flagsToPermissionString:function (flags) {
+ if (flags in NODEFS.flagsToPermissionStringMap) {
+ return NODEFS.flagsToPermissionStringMap[flags];
+ } else {
+ return flags;
+ }
+ },node_ops:{getattr:function (node) {
+ var path = NODEFS.realPath(node);
+ var stat;
+ try {
+ stat = fs.lstatSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ // node.js v0.10.20 doesn't report blksize and blocks on Windows. Fake them with default blksize of 4096.
+ // See http://support.microsoft.com/kb/140365
+ if (NODEFS.isWindows && !stat.blksize) {
+ stat.blksize = 4096;
+ }
+ if (NODEFS.isWindows && !stat.blocks) {
+ stat.blocks = (stat.size+stat.blksize-1)/stat.blksize|0;
+ }
+ return {
+ dev: stat.dev,
+ ino: stat.ino,
+ mode: stat.mode,
+ nlink: stat.nlink,
+ uid: stat.uid,
+ gid: stat.gid,
+ rdev: stat.rdev,
+ size: stat.size,
+ atime: stat.atime,
+ mtime: stat.mtime,
+ ctime: stat.ctime,
+ blksize: stat.blksize,
+ blocks: stat.blocks
+ };
+ },setattr:function (node, attr) {
+ var path = NODEFS.realPath(node);
+ try {
+ if (attr.mode !== undefined) {
+ fs.chmodSync(path, attr.mode);
+ // update the common node structure mode as well
+ node.mode = attr.mode;
+ }
+ if (attr.timestamp !== undefined) {
+ var date = new Date(attr.timestamp);
+ fs.utimesSync(path, date, date);
+ }
+ if (attr.size !== undefined) {
+ fs.truncateSync(path, attr.size);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },lookup:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ var mode = NODEFS.getMode(path);
+ return NODEFS.createNode(parent, name, mode);
+ },mknod:function (parent, name, mode, dev) {
+ var node = NODEFS.createNode(parent, name, mode, dev);
+ // create the backing node for this in the fs root as well
+ var path = NODEFS.realPath(node);
+ try {
+ if (FS.isDir(node.mode)) {
+ fs.mkdirSync(path, node.mode);
+ } else {
+ fs.writeFileSync(path, '', { mode: node.mode });
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return node;
+ },rename:function (oldNode, newDir, newName) {
+ var oldPath = NODEFS.realPath(oldNode);
+ var newPath = PATH.join2(NODEFS.realPath(newDir), newName);
+ try {
+ fs.renameSync(oldPath, newPath);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },unlink:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ try {
+ fs.unlinkSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },rmdir:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ try {
+ fs.rmdirSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },readdir:function (node) {
+ var path = NODEFS.realPath(node);
+ try {
+ return fs.readdirSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },symlink:function (parent, newName, oldPath) {
+ var newPath = PATH.join2(NODEFS.realPath(parent), newName);
+ try {
+ fs.symlinkSync(oldPath, newPath);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },readlink:function (node) {
+ var path = NODEFS.realPath(node);
+ try {
+ return fs.readlinkSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ }},stream_ops:{open:function (stream) {
+ var path = NODEFS.realPath(stream.node);
+ try {
+ if (FS.isFile(stream.node.mode)) {
+ stream.nfd = fs.openSync(path, NODEFS.flagsToPermissionString(stream.flags));
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },close:function (stream) {
+ try {
+ if (FS.isFile(stream.node.mode) && stream.nfd) {
+ fs.closeSync(stream.nfd);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },read:function (stream, buffer, offset, length, position) {
+ // FIXME this is terrible.
+ var nbuffer = new Buffer(length);
+ var res;
+ try {
+ res = fs.readSync(stream.nfd, nbuffer, 0, length, position);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ if (res > 0) {
+ for (var i = 0; i < res; i++) {
+ buffer[offset + i] = nbuffer[i];
+ }
+ }
+ return res;
+ },write:function (stream, buffer, offset, length, position) {
+ // FIXME this is terrible.
+ var nbuffer = new Buffer(buffer.subarray(offset, offset + length));
+ var res;
+ try {
+ res = fs.writeSync(stream.nfd, nbuffer, 0, length, position);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return res;
+ },llseek:function (stream, offset, whence) {
+ var position = offset;
+ if (whence === 1) { // SEEK_CUR.
+ position += stream.position;
+ } else if (whence === 2) { // SEEK_END.
+ if (FS.isFile(stream.node.mode)) {
+ try {
+ var stat = fs.fstatSync(stream.nfd);
+ position += stat.size;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ }
+ }
+
+ if (position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+
+ stream.position = position;
+ return position;
+ }}};
+
+ var _stdin=allocate(1, "i32*", ALLOC_STATIC);
+
+ var _stdout=allocate(1, "i32*", ALLOC_STATIC);
+
+ var _stderr=allocate(1, "i32*", ALLOC_STATIC);
+
+ function _fflush(stream) {
+ // int fflush(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fflush.html
+ // we don't currently perform any user-space buffering of data
+ }var FS={root:null,mounts:[],devices:[null],streams:[],nextInode:1,nameTable:null,currentPath:"/",initialized:false,ignorePermissions:true,ErrnoError:null,genericErrors:{},handleFSError:function (e) {
+ if (!(e instanceof FS.ErrnoError)) throw e + ' : ' + stackTrace();
+ return ___setErrNo(e.errno);
+ },lookupPath:function (path, opts) {
+ path = PATH.resolve(FS.cwd(), path);
+ opts = opts || {};
+
+ var defaults = {
+ follow_mount: true,
+ recurse_count: 0
+ };
+ for (var key in defaults) {
+ if (opts[key] === undefined) {
+ opts[key] = defaults[key];
+ }
+ }
+
+ if (opts.recurse_count > 8) { // max recursive lookup of 8
+ throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
+ }
+
+ // split the path
+ var parts = PATH.normalizeArray(path.split('/').filter(function(p) {
+ return !!p;
+ }), false);
+
+ // start at the root
+ var current = FS.root;
+ var current_path = '/';
+
+ for (var i = 0; i < parts.length; i++) {
+ var islast = (i === parts.length-1);
+ if (islast && opts.parent) {
+ // stop resolving
+ break;
+ }
+
+ current = FS.lookupNode(current, parts[i]);
+ current_path = PATH.join2(current_path, parts[i]);
+
+ // jump to the mount's root node if this is a mountpoint
+ if (FS.isMountpoint(current)) {
+ if (!islast || (islast && opts.follow_mount)) {
+ current = current.mounted.root;
+ }
+ }
+
+ // by default, lookupPath will not follow a symlink if it is the final path component.
+ // setting opts.follow = true will override this behavior.
+ if (!islast || opts.follow) {
+ var count = 0;
+ while (FS.isLink(current.mode)) {
+ var link = FS.readlink(current_path);
+ current_path = PATH.resolve(PATH.dirname(current_path), link);
+
+ var lookup = FS.lookupPath(current_path, { recurse_count: opts.recurse_count });
+ current = lookup.node;
+
+ if (count++ > 40) { // limit max consecutive symlinks to 40 (SYMLOOP_MAX).
+ throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
+ }
+ }
+ }
+ }
+
+ return { path: current_path, node: current };
+ },getPath:function (node) {
+ var path;
+ while (true) {
+ if (FS.isRoot(node)) {
+ var mount = node.mount.mountpoint;
+ if (!path) return mount;
+ return mount[mount.length-1] !== '/' ? mount + '/' + path : mount + path;
+ }
+ path = path ? node.name + '/' + path : node.name;
+ node = node.parent;
+ }
+ },hashName:function (parentid, name) {
+ var hash = 0;
+
+
+ for (var i = 0; i < name.length; i++) {
+ hash = ((hash << 5) - hash + name.charCodeAt(i)) | 0;
+ }
+ return ((parentid + hash) >>> 0) % FS.nameTable.length;
+ },hashAddNode:function (node) {
+ var hash = FS.hashName(node.parent.id, node.name);
+ node.name_next = FS.nameTable[hash];
+ FS.nameTable[hash] = node;
+ },hashRemoveNode:function (node) {
+ var hash = FS.hashName(node.parent.id, node.name);
+ if (FS.nameTable[hash] === node) {
+ FS.nameTable[hash] = node.name_next;
+ } else {
+ var current = FS.nameTable[hash];
+ while (current) {
+ if (current.name_next === node) {
+ current.name_next = node.name_next;
+ break;
+ }
+ current = current.name_next;
+ }
+ }
+ },lookupNode:function (parent, name) {
+ var err = FS.mayLookup(parent);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ var hash = FS.hashName(parent.id, name);
+ for (var node = FS.nameTable[hash]; node; node = node.name_next) {
+ var nodeName = node.name;
+ if (node.parent.id === parent.id && nodeName === name) {
+ return node;
+ }
+ }
+ // if we failed to find it in the cache, call into the VFS
+ return FS.lookup(parent, name);
+ },createNode:function (parent, name, mode, rdev) {
+ if (!FS.FSNode) {
+ FS.FSNode = function(parent, name, mode, rdev) {
+ if (!parent) {
+ parent = this; // root node sets parent to itself
+ }
+ this.parent = parent;
+ this.mount = parent.mount;
+ this.mounted = null;
+ this.id = FS.nextInode++;
+ this.name = name;
+ this.mode = mode;
+ this.node_ops = {};
+ this.stream_ops = {};
+ this.rdev = rdev;
+ };
+
+ FS.FSNode.prototype = {};
+
+ // compatibility
+ var readMode = 292 | 73;
+ var writeMode = 146;
+
+ // NOTE we must use Object.defineProperties instead of individual calls to
+ // Object.defineProperty in order to make closure compiler happy
+ Object.defineProperties(FS.FSNode.prototype, {
+ read: {
+ get: function() { return (this.mode & readMode) === readMode; },
+ set: function(val) { val ? this.mode |= readMode : this.mode &= ~readMode; }
+ },
+ write: {
+ get: function() { return (this.mode & writeMode) === writeMode; },
+ set: function(val) { val ? this.mode |= writeMode : this.mode &= ~writeMode; }
+ },
+ isFolder: {
+ get: function() { return FS.isDir(this.mode); },
+ },
+ isDevice: {
+ get: function() { return FS.isChrdev(this.mode); },
+ },
+ });
+ }
+
+ var node = new FS.FSNode(parent, name, mode, rdev);
+
+ FS.hashAddNode(node);
+
+ return node;
+ },destroyNode:function (node) {
+ FS.hashRemoveNode(node);
+ },isRoot:function (node) {
+ return node === node.parent;
+ },isMountpoint:function (node) {
+ return !!node.mounted;
+ },isFile:function (mode) {
+ return (mode & 61440) === 32768;
+ },isDir:function (mode) {
+ return (mode & 61440) === 16384;
+ },isLink:function (mode) {
+ return (mode & 61440) === 40960;
+ },isChrdev:function (mode) {
+ return (mode & 61440) === 8192;
+ },isBlkdev:function (mode) {
+ return (mode & 61440) === 24576;
+ },isFIFO:function (mode) {
+ return (mode & 61440) === 4096;
+ },isSocket:function (mode) {
+ return (mode & 49152) === 49152;
+ },flagModes:{"r":0,"rs":1052672,"r+":2,"w":577,"wx":705,"xw":705,"w+":578,"wx+":706,"xw+":706,"a":1089,"ax":1217,"xa":1217,"a+":1090,"ax+":1218,"xa+":1218},modeStringToFlags:function (str) {
+ var flags = FS.flagModes[str];
+ if (typeof flags === 'undefined') {
+ throw new Error('Unknown file open mode: ' + str);
+ }
+ return flags;
+ },flagsToPermissionString:function (flag) {
+ var accmode = flag & 2097155;
+ var perms = ['r', 'w', 'rw'][accmode];
+ if ((flag & 512)) {
+ perms += 'w';
+ }
+ return perms;
+ },nodePermissions:function (node, perms) {
+ if (FS.ignorePermissions) {
+ return 0;
+ }
+ // return 0 if any user, group or owner bits are set.
+ if (perms.indexOf('r') !== -1 && !(node.mode & 292)) {
+ return ERRNO_CODES.EACCES;
+ } else if (perms.indexOf('w') !== -1 && !(node.mode & 146)) {
+ return ERRNO_CODES.EACCES;
+ } else if (perms.indexOf('x') !== -1 && !(node.mode & 73)) {
+ return ERRNO_CODES.EACCES;
+ }
+ return 0;
+ },mayLookup:function (dir) {
+ return FS.nodePermissions(dir, 'x');
+ },mayCreate:function (dir, name) {
+ try {
+ var node = FS.lookupNode(dir, name);
+ return ERRNO_CODES.EEXIST;
+ } catch (e) {
+ }
+ return FS.nodePermissions(dir, 'wx');
+ },mayDelete:function (dir, name, isdir) {
+ var node;
+ try {
+ node = FS.lookupNode(dir, name);
+ } catch (e) {
+ return e.errno;
+ }
+ var err = FS.nodePermissions(dir, 'wx');
+ if (err) {
+ return err;
+ }
+ if (isdir) {
+ if (!FS.isDir(node.mode)) {
+ return ERRNO_CODES.ENOTDIR;
+ }
+ if (FS.isRoot(node) || FS.getPath(node) === FS.cwd()) {
+ return ERRNO_CODES.EBUSY;
+ }
+ } else {
+ if (FS.isDir(node.mode)) {
+ return ERRNO_CODES.EISDIR;
+ }
+ }
+ return 0;
+ },mayOpen:function (node, flags) {
+ if (!node) {
+ return ERRNO_CODES.ENOENT;
+ }
+ if (FS.isLink(node.mode)) {
+ return ERRNO_CODES.ELOOP;
+ } else if (FS.isDir(node.mode)) {
+ if ((flags & 2097155) !== 0 || // opening for write
+ (flags & 512)) {
+ return ERRNO_CODES.EISDIR;
+ }
+ }
+ return FS.nodePermissions(node, FS.flagsToPermissionString(flags));
+ },MAX_OPEN_FDS:4096,nextfd:function (fd_start, fd_end) {
+ fd_start = fd_start || 0;
+ fd_end = fd_end || FS.MAX_OPEN_FDS;
+ for (var fd = fd_start; fd <= fd_end; fd++) {
+ if (!FS.streams[fd]) {
+ return fd;
+ }
+ }
+ throw new FS.ErrnoError(ERRNO_CODES.EMFILE);
+ },getStream:function (fd) {
+ return FS.streams[fd];
+ },createStream:function (stream, fd_start, fd_end) {
+ if (!FS.FSStream) {
+ FS.FSStream = function(){};
+ FS.FSStream.prototype = {};
+ // compatibility
+ Object.defineProperties(FS.FSStream.prototype, {
+ object: {
+ get: function() { return this.node; },
+ set: function(val) { this.node = val; }
+ },
+ isRead: {
+ get: function() { return (this.flags & 2097155) !== 1; }
+ },
+ isWrite: {
+ get: function() { return (this.flags & 2097155) !== 0; }
+ },
+ isAppend: {
+ get: function() { return (this.flags & 1024); }
+ }
+ });
+ }
+ if (0) {
+ // reuse the object
+ stream.__proto__ = FS.FSStream.prototype;
+ } else {
+ var newStream = new FS.FSStream();
+ for (var p in stream) {
+ newStream[p] = stream[p];
+ }
+ stream = newStream;
+ }
+ var fd = FS.nextfd(fd_start, fd_end);
+ stream.fd = fd;
+ FS.streams[fd] = stream;
+ return stream;
+ },closeStream:function (fd) {
+ FS.streams[fd] = null;
+ },getStreamFromPtr:function (ptr) {
+ return FS.streams[ptr - 1];
+ },getPtrForStream:function (stream) {
+ return stream ? stream.fd + 1 : 0;
+ },chrdev_stream_ops:{open:function (stream) {
+ var device = FS.getDevice(stream.node.rdev);
+ // override node's stream ops with the device's
+ stream.stream_ops = device.stream_ops;
+ // forward the open call
+ if (stream.stream_ops.open) {
+ stream.stream_ops.open(stream);
+ }
+ },llseek:function () {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }},major:function (dev) {
+ return ((dev) >> 8);
+ },minor:function (dev) {
+ return ((dev) & 0xff);
+ },makedev:function (ma, mi) {
+ return ((ma) << 8 | (mi));
+ },registerDevice:function (dev, ops) {
+ FS.devices[dev] = { stream_ops: ops };
+ },getDevice:function (dev) {
+ return FS.devices[dev];
+ },getMounts:function (mount) {
+ var mounts = [];
+ var check = [mount];
+
+ while (check.length) {
+ var m = check.pop();
+
+ mounts.push(m);
+
+ check.push.apply(check, m.mounts);
+ }
+
+ return mounts;
+ },syncfs:function (populate, callback) {
+ if (typeof(populate) === 'function') {
+ callback = populate;
+ populate = false;
+ }
+
+ var mounts = FS.getMounts(FS.root.mount);
+ var completed = 0;
+
+ function done(err) {
+ if (err) {
+ if (!done.errored) {
+ done.errored = true;
+ return callback(err);
+ }
+ return;
+ }
+ if (++completed >= mounts.length) {
+ callback(null);
+ }
+ };
+
+ // sync all mounts
+ mounts.forEach(function (mount) {
+ if (!mount.type.syncfs) {
+ return done(null);
+ }
+ mount.type.syncfs(mount, populate, done);
+ });
+ },mount:function (type, opts, mountpoint) {
+ var root = mountpoint === '/';
+ var pseudo = !mountpoint;
+ var node;
+
+ if (root && FS.root) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ } else if (!root && !pseudo) {
+ var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
+
+ mountpoint = lookup.path; // use the absolute path
+ node = lookup.node;
+
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+
+ if (!FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ }
+
+ var mount = {
+ type: type,
+ opts: opts,
+ mountpoint: mountpoint,
+ mounts: []
+ };
+
+ // create a root node for the fs
+ var mountRoot = type.mount(mount);
+ mountRoot.mount = mount;
+ mount.root = mountRoot;
+
+ if (root) {
+ FS.root = mountRoot;
+ } else if (node) {
+ // set as a mountpoint
+ node.mounted = mount;
+
+ // add the new mount to the current mount's children
+ if (node.mount) {
+ node.mount.mounts.push(mount);
+ }
+ }
+
+ return mountRoot;
+ },unmount:function (mountpoint) {
+ var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
+
+ if (!FS.isMountpoint(lookup.node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+
+ // destroy the nodes for this mount, and all its child mounts
+ var node = lookup.node;
+ var mount = node.mounted;
+ var mounts = FS.getMounts(mount);
+
+ Object.keys(FS.nameTable).forEach(function (hash) {
+ var current = FS.nameTable[hash];
+
+ while (current) {
+ var next = current.name_next;
+
+ if (mounts.indexOf(current.mount) !== -1) {
+ FS.destroyNode(current);
+ }
+
+ current = next;
+ }
+ });
+
+ // no longer a mountpoint
+ node.mounted = null;
+
+ // remove this mount from the child mounts
+ var idx = node.mount.mounts.indexOf(mount);
+ assert(idx !== -1);
+ node.mount.mounts.splice(idx, 1);
+ },lookup:function (parent, name) {
+ return parent.node_ops.lookup(parent, name);
+ },mknod:function (path, mode, dev) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var err = FS.mayCreate(parent, name);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.mknod) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return parent.node_ops.mknod(parent, name, mode, dev);
+ },create:function (path, mode) {
+ mode = mode !== undefined ? mode : 438 /* 0666 */;
+ mode &= 4095;
+ mode |= 32768;
+ return FS.mknod(path, mode, 0);
+ },mkdir:function (path, mode) {
+ mode = mode !== undefined ? mode : 511 /* 0777 */;
+ mode &= 511 | 512;
+ mode |= 16384;
+ return FS.mknod(path, mode, 0);
+ },mkdev:function (path, mode, dev) {
+ if (typeof(dev) === 'undefined') {
+ dev = mode;
+ mode = 438 /* 0666 */;
+ }
+ mode |= 8192;
+ return FS.mknod(path, mode, dev);
+ },symlink:function (oldpath, newpath) {
+ var lookup = FS.lookupPath(newpath, { parent: true });
+ var parent = lookup.node;
+ var newname = PATH.basename(newpath);
+ var err = FS.mayCreate(parent, newname);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.symlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return parent.node_ops.symlink(parent, newname, oldpath);
+ },rename:function (old_path, new_path) {
+ var old_dirname = PATH.dirname(old_path);
+ var new_dirname = PATH.dirname(new_path);
+ var old_name = PATH.basename(old_path);
+ var new_name = PATH.basename(new_path);
+ // parents must exist
+ var lookup, old_dir, new_dir;
+ try {
+ lookup = FS.lookupPath(old_path, { parent: true });
+ old_dir = lookup.node;
+ lookup = FS.lookupPath(new_path, { parent: true });
+ new_dir = lookup.node;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ // need to be part of the same mount
+ if (old_dir.mount !== new_dir.mount) {
+ throw new FS.ErrnoError(ERRNO_CODES.EXDEV);
+ }
+ // source must exist
+ var old_node = FS.lookupNode(old_dir, old_name);
+ // old path should not be an ancestor of the new path
+ var relative = PATH.relative(old_path, new_dirname);
+ if (relative.charAt(0) !== '.') {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ // new path should not be an ancestor of the old path
+ relative = PATH.relative(new_path, old_dirname);
+ if (relative.charAt(0) !== '.') {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ // see if the new path already exists
+ var new_node;
+ try {
+ new_node = FS.lookupNode(new_dir, new_name);
+ } catch (e) {
+ // not fatal
+ }
+ // early out if nothing needs to change
+ if (old_node === new_node) {
+ return;
+ }
+ // we'll need to delete the old entry
+ var isdir = FS.isDir(old_node.mode);
+ var err = FS.mayDelete(old_dir, old_name, isdir);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ // need delete permissions if we'll be overwriting.
+ // need create permissions if new doesn't already exist.
+ err = new_node ?
+ FS.mayDelete(new_dir, new_name, isdir) :
+ FS.mayCreate(new_dir, new_name);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!old_dir.node_ops.rename) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(old_node) || (new_node && FS.isMountpoint(new_node))) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ // if we are going to change the parent, check write permissions
+ if (new_dir !== old_dir) {
+ err = FS.nodePermissions(old_dir, 'w');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ }
+ // remove the node from the lookup hash
+ FS.hashRemoveNode(old_node);
+ // do the underlying fs rename
+ try {
+ old_dir.node_ops.rename(old_node, new_dir, new_name);
+ } catch (e) {
+ throw e;
+ } finally {
+ // add the node back to the hash (in case node_ops.rename
+ // changed its name)
+ FS.hashAddNode(old_node);
+ }
+ },rmdir:function (path) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var node = FS.lookupNode(parent, name);
+ var err = FS.mayDelete(parent, name, true);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.rmdir) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ parent.node_ops.rmdir(parent, name);
+ FS.destroyNode(node);
+ },readdir:function (path) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ var node = lookup.node;
+ if (!node.node_ops.readdir) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ return node.node_ops.readdir(node);
+ },unlink:function (path) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var node = FS.lookupNode(parent, name);
+ var err = FS.mayDelete(parent, name, false);
+ if (err) {
+ // POSIX says unlink should set EPERM, not EISDIR
+ if (err === ERRNO_CODES.EISDIR) err = ERRNO_CODES.EPERM;
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.unlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ parent.node_ops.unlink(parent, name);
+ FS.destroyNode(node);
+ },readlink:function (path) {
+ var lookup = FS.lookupPath(path);
+ var link = lookup.node;
+ if (!link.node_ops.readlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ return link.node_ops.readlink(link);
+ },stat:function (path, dontFollow) {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ var node = lookup.node;
+ if (!node.node_ops.getattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return node.node_ops.getattr(node);
+ },lstat:function (path) {
+ return FS.stat(path, true);
+ },chmod:function (path, mode, dontFollow) {
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ node.node_ops.setattr(node, {
+ mode: (mode & 4095) | (node.mode & ~4095),
+ timestamp: Date.now()
+ });
+ },lchmod:function (path, mode) {
+ FS.chmod(path, mode, true);
+ },fchmod:function (fd, mode) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ FS.chmod(stream.node, mode);
+ },chown:function (path, uid, gid, dontFollow) {
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ node.node_ops.setattr(node, {
+ timestamp: Date.now()
+ // we ignore the uid / gid for now
+ });
+ },lchown:function (path, uid, gid) {
+ FS.chown(path, uid, gid, true);
+ },fchown:function (fd, uid, gid) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ FS.chown(stream.node, uid, gid);
+ },truncate:function (path, len) {
+ if (len < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: true });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!FS.isFile(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var err = FS.nodePermissions(node, 'w');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ node.node_ops.setattr(node, {
+ size: len,
+ timestamp: Date.now()
+ });
+ },ftruncate:function (fd, len) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ FS.truncate(stream.node, len);
+ },utime:function (path, atime, mtime) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ var node = lookup.node;
+ node.node_ops.setattr(node, {
+ timestamp: Math.max(atime, mtime)
+ });
+ },open:function (path, flags, mode, fd_start, fd_end) {
+ flags = typeof flags === 'string' ? FS.modeStringToFlags(flags) : flags;
+ mode = typeof mode === 'undefined' ? 438 /* 0666 */ : mode;
+ if ((flags & 64)) {
+ mode = (mode & 4095) | 32768;
+ } else {
+ mode = 0;
+ }
+ var node;
+ if (typeof path === 'object') {
+ node = path;
+ } else {
+ path = PATH.normalize(path);
+ try {
+ var lookup = FS.lookupPath(path, {
+ follow: !(flags & 131072)
+ });
+ node = lookup.node;
+ } catch (e) {
+ // ignore
+ }
+ }
+ // perhaps we need to create the node
+ if ((flags & 64)) {
+ if (node) {
+ // if O_CREAT and O_EXCL are set, error out if the node already exists
+ if ((flags & 128)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EEXIST);
+ }
+ } else {
+ // node doesn't exist, try to create it
+ node = FS.mknod(path, mode, 0);
+ }
+ }
+ if (!node) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
+ }
+ // can't truncate a device
+ if (FS.isChrdev(node.mode)) {
+ flags &= ~512;
+ }
+ // check permissions
+ var err = FS.mayOpen(node, flags);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ // do truncation if necessary
+ if ((flags & 512)) {
+ FS.truncate(node, 0);
+ }
+ // we've already handled these, don't pass down to the underlying vfs
+ flags &= ~(128 | 512);
+
+ // register the stream with the filesystem
+ var stream = FS.createStream({
+ node: node,
+ path: FS.getPath(node), // we want the absolute path to the node
+ flags: flags,
+ seekable: true,
+ position: 0,
+ stream_ops: node.stream_ops,
+ // used by the file family libc calls (fopen, fwrite, ferror, etc.)
+ ungotten: [],
+ error: false
+ }, fd_start, fd_end);
+ // call the new stream's open function
+ if (stream.stream_ops.open) {
+ stream.stream_ops.open(stream);
+ }
+ if (Module['logReadFiles'] && !(flags & 1)) {
+ if (!FS.readFiles) FS.readFiles = {};
+ if (!(path in FS.readFiles)) {
+ FS.readFiles[path] = 1;
+ Module['printErr']('read file: ' + path);
+ }
+ }
+ return stream;
+ },close:function (stream) {
+ try {
+ if (stream.stream_ops.close) {
+ stream.stream_ops.close(stream);
+ }
+ } catch (e) {
+ throw e;
+ } finally {
+ FS.closeStream(stream.fd);
+ }
+ },llseek:function (stream, offset, whence) {
+ if (!stream.seekable || !stream.stream_ops.llseek) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ return stream.stream_ops.llseek(stream, offset, whence);
+ },read:function (stream, buffer, offset, length, position) {
+ if (length < 0 || position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 1) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (FS.isDir(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!stream.stream_ops.read) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var seeking = true;
+ if (typeof position === 'undefined') {
+ position = stream.position;
+ seeking = false;
+ } else if (!stream.seekable) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ var bytesRead = stream.stream_ops.read(stream, buffer, offset, length, position);
+ if (!seeking) stream.position += bytesRead;
+ return bytesRead;
+ },write:function (stream, buffer, offset, length, position, canOwn) {
+ if (length < 0 || position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (FS.isDir(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!stream.stream_ops.write) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var seeking = true;
+ if (typeof position === 'undefined') {
+ position = stream.position;
+ seeking = false;
+ } else if (!stream.seekable) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ if (stream.flags & 1024) {
+ // seek to the end before writing in append mode
+ FS.llseek(stream, 0, 2);
+ }
+ var bytesWritten = stream.stream_ops.write(stream, buffer, offset, length, position, canOwn);
+ if (!seeking) stream.position += bytesWritten;
+ return bytesWritten;
+ },allocate:function (stream, offset, length) {
+ if (offset < 0 || length <= 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (!FS.isFile(stream.node.mode) && !FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ if (!stream.stream_ops.allocate) {
+ throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
+ }
+ stream.stream_ops.allocate(stream, offset, length);
+ },mmap:function (stream, buffer, offset, length, position, prot, flags) {
+ // TODO if PROT is PROT_WRITE, make sure we have write access
+ if ((stream.flags & 2097155) === 1) {
+ throw new FS.ErrnoError(ERRNO_CODES.EACCES);
+ }
+ if (!stream.stream_ops.mmap) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ return stream.stream_ops.mmap(stream, buffer, offset, length, position, prot, flags);
+ },ioctl:function (stream, cmd, arg) {
+ if (!stream.stream_ops.ioctl) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTTY);
+ }
+ return stream.stream_ops.ioctl(stream, cmd, arg);
+ },readFile:function (path, opts) {
+ opts = opts || {};
+ opts.flags = opts.flags || 'r';
+ opts.encoding = opts.encoding || 'binary';
+ if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
+ throw new Error('Invalid encoding type "' + opts.encoding + '"');
+ }
+ var ret;
+ var stream = FS.open(path, opts.flags);
+ var stat = FS.stat(path);
+ var length = stat.size;
+ var buf = new Uint8Array(length);
+ FS.read(stream, buf, 0, length, 0);
+ if (opts.encoding === 'utf8') {
+ ret = '';
+ var utf8 = new Runtime.UTF8Processor();
+ for (var i = 0; i < length; i++) {
+ ret += utf8.processCChar(buf[i]);
+ }
+ } else if (opts.encoding === 'binary') {
+ ret = buf;
+ }
+ FS.close(stream);
+ return ret;
+ },writeFile:function (path, data, opts) {
+ opts = opts || {};
+ opts.flags = opts.flags || 'w';
+ opts.encoding = opts.encoding || 'utf8';
+ if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
+ throw new Error('Invalid encoding type "' + opts.encoding + '"');
+ }
+ var stream = FS.open(path, opts.flags, opts.mode);
+ if (opts.encoding === 'utf8') {
+ var utf8 = new Runtime.UTF8Processor();
+ var buf = new Uint8Array(utf8.processJSString(data));
+ FS.write(stream, buf, 0, buf.length, 0, opts.canOwn);
+ } else if (opts.encoding === 'binary') {
+ FS.write(stream, data, 0, data.length, 0, opts.canOwn);
+ }
+ FS.close(stream);
+ },cwd:function () {
+ return FS.currentPath;
+ },chdir:function (path) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ if (!FS.isDir(lookup.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ var err = FS.nodePermissions(lookup.node, 'x');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ FS.currentPath = lookup.path;
+ },createDefaultDirectories:function () {
+ FS.mkdir('/tmp');
+ },createDefaultDevices:function () {
+ // create /dev
+ FS.mkdir('/dev');
+ // setup /dev/null
+ FS.registerDevice(FS.makedev(1, 3), {
+ read: function() { return 0; },
+ write: function() { return 0; }
+ });
+ FS.mkdev('/dev/null', FS.makedev(1, 3));
+ // setup /dev/tty and /dev/tty1
+ // stderr needs to print output using Module['printErr']
+ // so we register a second tty just for it.
+ TTY.register(FS.makedev(5, 0), TTY.default_tty_ops);
+ TTY.register(FS.makedev(6, 0), TTY.default_tty1_ops);
+ FS.mkdev('/dev/tty', FS.makedev(5, 0));
+ FS.mkdev('/dev/tty1', FS.makedev(6, 0));
+ // we're not going to emulate the actual shm device,
+ // just create the tmp dirs that reside in it commonly
+ FS.mkdir('/dev/shm');
+ FS.mkdir('/dev/shm/tmp');
+ },createStandardStreams:function () {
+ // TODO deprecate the old functionality of a single
+ // input / output callback and that utilizes FS.createDevice
+ // and instead require a unique set of stream ops
+
+ // by default, we symlink the standard streams to the
+ // default tty devices. however, if the standard streams
+ // have been overwritten we create a unique device for
+ // them instead.
+ if (Module['stdin']) {
+ FS.createDevice('/dev', 'stdin', Module['stdin']);
+ } else {
+ FS.symlink('/dev/tty', '/dev/stdin');
+ }
+ if (Module['stdout']) {
+ FS.createDevice('/dev', 'stdout', null, Module['stdout']);
+ } else {
+ FS.symlink('/dev/tty', '/dev/stdout');
+ }
+ if (Module['stderr']) {
+ FS.createDevice('/dev', 'stderr', null, Module['stderr']);
+ } else {
+ FS.symlink('/dev/tty1', '/dev/stderr');
+ }
+
+ // open default streams for the stdin, stdout and stderr devices
+ var stdin = FS.open('/dev/stdin', 'r');
+ HEAP32[((_stdin)>>2)]=FS.getPtrForStream(stdin);
+ assert(stdin.fd === 0, 'invalid handle for stdin (' + stdin.fd + ')');
+
+ var stdout = FS.open('/dev/stdout', 'w');
+ HEAP32[((_stdout)>>2)]=FS.getPtrForStream(stdout);
+ assert(stdout.fd === 1, 'invalid handle for stdout (' + stdout.fd + ')');
+
+ var stderr = FS.open('/dev/stderr', 'w');
+ HEAP32[((_stderr)>>2)]=FS.getPtrForStream(stderr);
+ assert(stderr.fd === 2, 'invalid handle for stderr (' + stderr.fd + ')');
+ },ensureErrnoError:function () {
+ if (FS.ErrnoError) return;
+ FS.ErrnoError = function ErrnoError(errno) {
+ this.errno = errno;
+ for (var key in ERRNO_CODES) {
+ if (ERRNO_CODES[key] === errno) {
+ this.code = key;
+ break;
+ }
+ }
+ this.message = ERRNO_MESSAGES[errno];
+ };
+ FS.ErrnoError.prototype = new Error();
+ FS.ErrnoError.prototype.constructor = FS.ErrnoError;
+ // Some errors may happen quite a bit, to avoid overhead we reuse them (and suffer a lack of stack info)
+ [ERRNO_CODES.ENOENT].forEach(function(code) {
+ FS.genericErrors[code] = new FS.ErrnoError(code);
+ FS.genericErrors[code].stack = '<generic error, no stack>';
+ });
+ },staticInit:function () {
+ FS.ensureErrnoError();
+
+ FS.nameTable = new Array(4096);
+
+ FS.mount(MEMFS, {}, '/');
+
+ FS.createDefaultDirectories();
+ FS.createDefaultDevices();
+ },init:function (input, output, error) {
+ assert(!FS.init.initialized, 'FS.init was previously called. If you want to initialize later with custom parameters, remove any earlier calls (note that one is automatically added to the generated code)');
+ FS.init.initialized = true;
+
+ FS.ensureErrnoError();
+
+ // Allow Module.stdin etc. to provide defaults, if none explicitly passed to us here
+ Module['stdin'] = input || Module['stdin'];
+ Module['stdout'] = output || Module['stdout'];
+ Module['stderr'] = error || Module['stderr'];
+
+ FS.createStandardStreams();
+ },quit:function () {
+ FS.init.initialized = false;
+ for (var i = 0; i < FS.streams.length; i++) {
+ var stream = FS.streams[i];
+ if (!stream) {
+ continue;
+ }
+ FS.close(stream);
+ }
+ },getMode:function (canRead, canWrite) {
+ var mode = 0;
+ if (canRead) mode |= 292 | 73;
+ if (canWrite) mode |= 146;
+ return mode;
+ },joinPath:function (parts, forceRelative) {
+ var path = PATH.join.apply(null, parts);
+ if (forceRelative && path[0] == '/') path = path.substr(1);
+ return path;
+ },absolutePath:function (relative, base) {
+ return PATH.resolve(base, relative);
+ },standardizePath:function (path) {
+ return PATH.normalize(path);
+ },findObject:function (path, dontResolveLastLink) {
+ var ret = FS.analyzePath(path, dontResolveLastLink);
+ if (ret.exists) {
+ return ret.object;
+ } else {
+ ___setErrNo(ret.error);
+ return null;
+ }
+ },analyzePath:function (path, dontResolveLastLink) {
+ // operate from within the context of the symlink's target
+ try {
+ var lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
+ path = lookup.path;
+ } catch (e) {
+ }
+ var ret = {
+ isRoot: false, exists: false, error: 0, name: null, path: null, object: null,
+ parentExists: false, parentPath: null, parentObject: null
+ };
+ try {
+ var lookup = FS.lookupPath(path, { parent: true });
+ ret.parentExists = true;
+ ret.parentPath = lookup.path;
+ ret.parentObject = lookup.node;
+ ret.name = PATH.basename(path);
+ lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
+ ret.exists = true;
+ ret.path = lookup.path;
+ ret.object = lookup.node;
+ ret.name = lookup.node.name;
+ ret.isRoot = lookup.path === '/';
+ } catch (e) {
+ ret.error = e.errno;
+ };
+ return ret;
+ },createFolder:function (parent, name, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(canRead, canWrite);
+ return FS.mkdir(path, mode);
+ },createPath:function (parent, path, canRead, canWrite) {
+ parent = typeof parent === 'string' ? parent : FS.getPath(parent);
+ var parts = path.split('/').reverse();
+ while (parts.length) {
+ var part = parts.pop();
+ if (!part) continue;
+ var current = PATH.join2(parent, part);
+ try {
+ FS.mkdir(current);
+ } catch (e) {
+ // ignore EEXIST
+ }
+ parent = current;
+ }
+ return current;
+ },createFile:function (parent, name, properties, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(canRead, canWrite);
+ return FS.create(path, mode);
+ },createDataFile:function (parent, name, data, canRead, canWrite, canOwn) {
+ var path = name ? PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name) : parent;
+ var mode = FS.getMode(canRead, canWrite);
+ var node = FS.create(path, mode);
+ if (data) {
+ if (typeof data === 'string') {
+ var arr = new Array(data.length);
+ for (var i = 0, len = data.length; i < len; ++i) arr[i] = data.charCodeAt(i);
+ data = arr;
+ }
+ // make sure we can write to the file
+ FS.chmod(node, mode | 146);
+ var stream = FS.open(node, 'w');
+ FS.write(stream, data, 0, data.length, 0, canOwn);
+ FS.close(stream);
+ FS.chmod(node, mode);
+ }
+ return node;
+ },createDevice:function (parent, name, input, output) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(!!input, !!output);
+ if (!FS.createDevice.major) FS.createDevice.major = 64;
+ var dev = FS.makedev(FS.createDevice.major++, 0);
+ // Create a fake device that a set of stream ops to emulate
+ // the old behavior.
+ FS.registerDevice(dev, {
+ open: function(stream) {
+ stream.seekable = false;
+ },
+ close: function(stream) {
+ // flush any pending line data
+ if (output && output.buffer && output.buffer.length) {
+ output(10);
+ }
+ },
+ read: function(stream, buffer, offset, length, pos /* ignored */) {
+ var bytesRead = 0;
+ for (var i = 0; i < length; i++) {
+ var result;
+ try {
+ result = input();
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ if (result === undefined && bytesRead === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ if (result === null || result === undefined) break;
+ bytesRead++;
+ buffer[offset+i] = result;
+ }
+ if (bytesRead) {
+ stream.node.timestamp = Date.now();
+ }
+ return bytesRead;
+ },
+ write: function(stream, buffer, offset, length, pos) {
+ for (var i = 0; i < length; i++) {
+ try {
+ output(buffer[offset+i]);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ }
+ if (length) {
+ stream.node.timestamp = Date.now();
+ }
+ return i;
+ }
+ });
+ return FS.mkdev(path, mode, dev);
+ },createLink:function (parent, name, target, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ return FS.symlink(target, path);
+ },forceLoadFile:function (obj) {
+ if (obj.isDevice || obj.isFolder || obj.link || obj.contents) return true;
+ var success = true;
+ if (typeof XMLHttpRequest !== 'undefined') {
+ throw new Error("Lazy loading should have been performed (contents set) in createLazyFile, but it was not. Lazy loading only works in web workers. Use --embed-file or --preload-file in emcc on the main thread.");
+ } else if (Module['read']) {
+ // Command-line.
+ try {
+ // WARNING: Can't read binary files in V8's d8 or tracemonkey's js, as
+ // read() will try to parse UTF8.
+ obj.contents = intArrayFromString(Module['read'](obj.url), true);
+ } catch (e) {
+ success = false;
+ }
+ } else {
+ throw new Error('Cannot load without read() or XMLHttpRequest.');
+ }
+ if (!success) ___setErrNo(ERRNO_CODES.EIO);
+ return success;
+ },createLazyFile:function (parent, name, url, canRead, canWrite) {
+ // Lazy chunked Uint8Array (implements get and length from Uint8Array). Actual getting is abstracted away for eventual reuse.
+ function LazyUint8Array() {
+ this.lengthKnown = false;
+ this.chunks = []; // Loaded chunks. Index is the chunk number
+ }
+ LazyUint8Array.prototype.get = function LazyUint8Array_get(idx) {
+ if (idx > this.length-1 || idx < 0) {
+ return undefined;
+ }
+ var chunkOffset = idx % this.chunkSize;
+ var chunkNum = Math.floor(idx / this.chunkSize);
+ return this.getter(chunkNum)[chunkOffset];
+ }
+ LazyUint8Array.prototype.setDataGetter = function LazyUint8Array_setDataGetter(getter) {
+ this.getter = getter;
+ }
+ LazyUint8Array.prototype.cacheLength = function LazyUint8Array_cacheLength() {
+ // Find length
+ var xhr = new XMLHttpRequest();
+ xhr.open('HEAD', url, false);
+ xhr.send(null);
+ if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
+ var datalength = Number(xhr.getResponseHeader("Content-length"));
+ var header;
+ var hasByteServing = (header = xhr.getResponseHeader("Accept-Ranges")) && header === "bytes";
+ var chunkSize = 1024*1024; // Chunk size in bytes
+
+ if (!hasByteServing) chunkSize = datalength;
+
+ // Function to get a range from the remote URL.
+ var doXHR = (function(from, to) {
+ if (from > to) throw new Error("invalid range (" + from + ", " + to + ") or no bytes requested!");
+ if (to > datalength-1) throw new Error("only " + datalength + " bytes available! programmer error!");
+
+ // TODO: Use mozResponseArrayBuffer, responseStream, etc. if available.
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, false);
+ if (datalength !== chunkSize) xhr.setRequestHeader("Range", "bytes=" + from + "-" + to);
+
+ // Some hints to the browser that we want binary data.
+ if (typeof Uint8Array != 'undefined') xhr.responseType = 'arraybuffer';
+ if (xhr.overrideMimeType) {
+ xhr.overrideMimeType('text/plain; charset=x-user-defined');
+ }
+
+ xhr.send(null);
+ if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
+ if (xhr.response !== undefined) {
+ return new Uint8Array(xhr.response || []);
+ } else {
+ return intArrayFromString(xhr.responseText || '', true);
+ }
+ });
+ var lazyArray = this;
+ lazyArray.setDataGetter(function(chunkNum) {
+ var start = chunkNum * chunkSize;
+ var end = (chunkNum+1) * chunkSize - 1; // including this byte
+ end = Math.min(end, datalength-1); // if datalength-1 is selected, this is the last block
+ if (typeof(lazyArray.chunks[chunkNum]) === "undefined") {
+ lazyArray.chunks[chunkNum] = doXHR(start, end);
+ }
+ if (typeof(lazyArray.chunks[chunkNum]) === "undefined") throw new Error("doXHR failed!");
+ return lazyArray.chunks[chunkNum];
+ });
+
+ this._length = datalength;
+ this._chunkSize = chunkSize;
+ this.lengthKnown = true;
+ }
+ if (typeof XMLHttpRequest !== 'undefined') {
+ if (!ENVIRONMENT_IS_WORKER) throw 'Cannot do synchronous binary XHRs outside webworkers in modern browsers. Use --embed-file or --preload-file in emcc';
+ var lazyArray = new LazyUint8Array();
+ Object.defineProperty(lazyArray, "length", {
+ get: function() {
+ if(!this.lengthKnown) {
+ this.cacheLength();
+ }
+ return this._length;
+ }
+ });
+ Object.defineProperty(lazyArray, "chunkSize", {
+ get: function() {
+ if(!this.lengthKnown) {
+ this.cacheLength();
+ }
+ return this._chunkSize;
+ }
+ });
+
+ var properties = { isDevice: false, contents: lazyArray };
+ } else {
+ var properties = { isDevice: false, url: url };
+ }
+
+ var node = FS.createFile(parent, name, properties, canRead, canWrite);
+ // This is a total hack, but I want to get this lazy file code out of the
+ // core of MEMFS. If we want to keep this lazy file concept I feel it should
+ // be its own thin LAZYFS proxying calls to MEMFS.
+ if (properties.contents) {
+ node.contents = properties.contents;
+ } else if (properties.url) {
+ node.contents = null;
+ node.url = properties.url;
+ }
+ // override each stream op with one that tries to force load the lazy file first
+ var stream_ops = {};
+ var keys = Object.keys(node.stream_ops);
+ keys.forEach(function(key) {
+ var fn = node.stream_ops[key];
+ stream_ops[key] = function forceLoadLazyFile() {
+ if (!FS.forceLoadFile(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ return fn.apply(null, arguments);
+ };
+ });
+ // use a custom read function
+ stream_ops.read = function stream_ops_read(stream, buffer, offset, length, position) {
+ if (!FS.forceLoadFile(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ var contents = stream.node.contents;
+ if (position >= contents.length)
+ return 0;
+ var size = Math.min(contents.length - position, length);
+ assert(size >= 0);
+ if (contents.slice) { // normal array
+ for (var i = 0; i < size; i++) {
+ buffer[offset + i] = contents[position + i];
+ }
+ } else {
+ for (var i = 0; i < size; i++) { // LazyUint8Array from sync binary XHR
+ buffer[offset + i] = contents.get(position + i);
+ }
+ }
+ return size;
+ };
+ node.stream_ops = stream_ops;
+ return node;
+ },createPreloadedFile:function (parent, name, url, canRead, canWrite, onload, onerror, dontCreateFile, canOwn) {
+ Browser.init();
+ // TODO we should allow people to just pass in a complete filename instead
+ // of parent and name being that we just join them anyways
+ var fullname = name ? PATH.resolve(PATH.join2(parent, name)) : parent;
+ function processData(byteArray) {
+ function finish(byteArray) {
+ if (!dontCreateFile) {
+ FS.createDataFile(parent, name, byteArray, canRead, canWrite, canOwn);
+ }
+ if (onload) onload();
+ removeRunDependency('cp ' + fullname);
+ }
+ var handled = false;
+ Module['preloadPlugins'].forEach(function(plugin) {
+ if (handled) return;
+ if (plugin['canHandle'](fullname)) {
+ plugin['handle'](byteArray, fullname, finish, function() {
+ if (onerror) onerror();
+ removeRunDependency('cp ' + fullname);
+ });
+ handled = true;
+ }
+ });
+ if (!handled) finish(byteArray);
+ }
+ addRunDependency('cp ' + fullname);
+ if (typeof url == 'string') {
+ Browser.asyncLoad(url, function(byteArray) {
+ processData(byteArray);
+ }, onerror);
+ } else {
+ processData(url);
+ }
+ },indexedDB:function () {
+ return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
+ },DB_NAME:function () {
+ return 'EM_FS_' + window.location.pathname;
+ },DB_VERSION:20,DB_STORE_NAME:"FILE_DATA",saveFilesToDB:function (paths, onload, onerror) {
+ onload = onload || function(){};
+ onerror = onerror || function(){};
+ var indexedDB = FS.indexedDB();
+ try {
+ var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
+ } catch (e) {
+ return onerror(e);
+ }
+ openRequest.onupgradeneeded = function openRequest_onupgradeneeded() {
+ console.log('creating db');
+ var db = openRequest.result;
+ db.createObjectStore(FS.DB_STORE_NAME);
+ };
+ openRequest.onsuccess = function openRequest_onsuccess() {
+ var db = openRequest.result;
+ var transaction = db.transaction([FS.DB_STORE_NAME], 'readwrite');
+ var files = transaction.objectStore(FS.DB_STORE_NAME);
+ var ok = 0, fail = 0, total = paths.length;
+ function finish() {
+ if (fail == 0) onload(); else onerror();
+ }
+ paths.forEach(function(path) {
+ var putRequest = files.put(FS.analyzePath(path).object.contents, path);
+ putRequest.onsuccess = function putRequest_onsuccess() { ok++; if (ok + fail == total) finish() };
+ putRequest.onerror = function putRequest_onerror() { fail++; if (ok + fail == total) finish() };
+ });
+ transaction.onerror = onerror;
+ };
+ openRequest.onerror = onerror;
+ },loadFilesFromDB:function (paths, onload, onerror) {
+ onload = onload || function(){};
+ onerror = onerror || function(){};
+ var indexedDB = FS.indexedDB();
+ try {
+ var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
+ } catch (e) {
+ return onerror(e);
+ }
+ openRequest.onupgradeneeded = onerror; // no database to load from
+ openRequest.onsuccess = function openRequest_onsuccess() {
+ var db = openRequest.result;
+ try {
+ var transaction = db.transaction([FS.DB_STORE_NAME], 'readonly');
+ } catch(e) {
+ onerror(e);
+ return;
+ }
+ var files = transaction.objectStore(FS.DB_STORE_NAME);
+ var ok = 0, fail = 0, total = paths.length;
+ function finish() {
+ if (fail == 0) onload(); else onerror();
+ }
+ paths.forEach(function(path) {
+ var getRequest = files.get(path);
+ getRequest.onsuccess = function getRequest_onsuccess() {
+ if (FS.analyzePath(path).exists) {
+ FS.unlink(path);
+ }
+ FS.createDataFile(PATH.dirname(path), PATH.basename(path), getRequest.result, true, true, true);
+ ok++;
+ if (ok + fail == total) finish();
+ };
+ getRequest.onerror = function getRequest_onerror() { fail++; if (ok + fail == total) finish() };
+ });
+ transaction.onerror = onerror;
+ };
+ openRequest.onerror = onerror;
+ }};
+
+
+
+
+ function _mkport() { throw 'TODO' }var SOCKFS={mount:function (mount) {
+ return FS.createNode(null, '/', 16384 | 511 /* 0777 */, 0);
+ },createSocket:function (family, type, protocol) {
+ var streaming = type == 1;
+ if (protocol) {
+ assert(streaming == (protocol == 6)); // if SOCK_STREAM, must be tcp
+ }
+
+ // create our internal socket structure
+ var sock = {
+ family: family,
+ type: type,
+ protocol: protocol,
+ server: null,
+ peers: {},
+ pending: [],
+ recv_queue: [],
+ sock_ops: SOCKFS.websocket_sock_ops
+ };
+
+ // create the filesystem node to store the socket structure
+ var name = SOCKFS.nextname();
+ var node = FS.createNode(SOCKFS.root, name, 49152, 0);
+ node.sock = sock;
+
+ // and the wrapping stream that enables library functions such
+ // as read and write to indirectly interact with the socket
+ var stream = FS.createStream({
+ path: name,
+ node: node,
+ flags: FS.modeStringToFlags('r+'),
+ seekable: false,
+ stream_ops: SOCKFS.stream_ops
+ });
+
+ // map the new stream to the socket structure (sockets have a 1:1
+ // relationship with a stream)
+ sock.stream = stream;
+
+ return sock;
+ },getSocket:function (fd) {
+ var stream = FS.getStream(fd);
+ if (!stream || !FS.isSocket(stream.node.mode)) {
+ return null;
+ }
+ return stream.node.sock;
+ },stream_ops:{poll:function (stream) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.poll(sock);
+ },ioctl:function (stream, request, varargs) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.ioctl(sock, request, varargs);
+ },read:function (stream, buffer, offset, length, position /* ignored */) {
+ var sock = stream.node.sock;
+ var msg = sock.sock_ops.recvmsg(sock, length);
+ if (!msg) {
+ // socket is closed
+ return 0;
+ }
+ buffer.set(msg.buffer, offset);
+ return msg.buffer.length;
+ },write:function (stream, buffer, offset, length, position /* ignored */) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.sendmsg(sock, buffer, offset, length);
+ },close:function (stream) {
+ var sock = stream.node.sock;
+ sock.sock_ops.close(sock);
+ }},nextname:function () {
+ if (!SOCKFS.nextname.current) {
+ SOCKFS.nextname.current = 0;
+ }
+ return 'socket[' + (SOCKFS.nextname.current++) + ']';
+ },websocket_sock_ops:{createPeer:function (sock, addr, port) {
+ var ws;
+
+ if (typeof addr === 'object') {
+ ws = addr;
+ addr = null;
+ port = null;
+ }
+
+ if (ws) {
+ // for sockets that've already connected (e.g. we're the server)
+ // we can inspect the _socket property for the address
+ if (ws._socket) {
+ addr = ws._socket.remoteAddress;
+ port = ws._socket.remotePort;
+ }
+ // if we're just now initializing a connection to the remote,
+ // inspect the url property
+ else {
+ var result = /ws[s]?:\/\/([^:]+):(\d+)/.exec(ws.url);
+ if (!result) {
+ throw new Error('WebSocket URL must be in the format ws(s)://address:port');
+ }
+ addr = result[1];
+ port = parseInt(result[2], 10);
+ }
+ } else {
+ // create the actual websocket object and connect
+ try {
+ // runtimeConfig gets set to true if WebSocket runtime configuration is available.
+ var runtimeConfig = (Module['websocket'] && ('object' === typeof Module['websocket']));
+
+ // The default value is 'ws://' the replace is needed because the compiler replaces "//" comments with '#'
+ // comments without checking context, so we'd end up with ws:#, the replace swaps the "#" for "//" again.
+ var url = 'ws:#'.replace('#', '//');
+
+ if (runtimeConfig) {
+ if ('string' === typeof Module['websocket']['url']) {
+ url = Module['websocket']['url']; // Fetch runtime WebSocket URL config.
+ }
+ }
+
+ if (url === 'ws://' || url === 'wss://') { // Is the supplied URL config just a prefix, if so complete it.
+ url = url + addr + ':' + port;
+ }
+
+ // Make the WebSocket subprotocol (Sec-WebSocket-Protocol) default to binary if no configuration is set.
+ var subProtocols = 'binary'; // The default value is 'binary'
+
+ if (runtimeConfig) {
+ if ('string' === typeof Module['websocket']['subprotocol']) {
+ subProtocols = Module['websocket']['subprotocol']; // Fetch runtime WebSocket subprotocol config.
+ }
+ }
+
+ // The regex trims the string (removes spaces at the beginning and end, then splits the string by
+ // <any space>,<any space> into an Array. Whitespace removal is important for Websockify and ws.
+ subProtocols = subProtocols.replace(/^ +| +$/g,"").split(/ *, */);
+
+ // The node ws library API for specifying optional subprotocol is slightly different than the browser's.
+ var opts = ENVIRONMENT_IS_NODE ? {'protocol': subProtocols.toString()} : subProtocols;
+
+ // If node we use the ws library.
+ var WebSocket = ENVIRONMENT_IS_NODE ? require('ws') : window['WebSocket'];
+ ws = new WebSocket(url, opts);
+ ws.binaryType = 'arraybuffer';
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EHOSTUNREACH);
+ }
+ }
+
+
+ var peer = {
+ addr: addr,
+ port: port,
+ socket: ws,
+ dgram_send_queue: []
+ };
+
+ SOCKFS.websocket_sock_ops.addPeer(sock, peer);
+ SOCKFS.websocket_sock_ops.handlePeerEvents(sock, peer);
+
+ // if this is a bound dgram socket, send the port number first to allow
+ // us to override the ephemeral port reported to us by remotePort on the
+ // remote end.
+ if (sock.type === 2 && typeof sock.sport !== 'undefined') {
+ peer.dgram_send_queue.push(new Uint8Array([
+ 255, 255, 255, 255,
+ 'p'.charCodeAt(0), 'o'.charCodeAt(0), 'r'.charCodeAt(0), 't'.charCodeAt(0),
+ ((sock.sport & 0xff00) >> 8) , (sock.sport & 0xff)
+ ]));
+ }
+
+ return peer;
+ },getPeer:function (sock, addr, port) {
+ return sock.peers[addr + ':' + port];
+ },addPeer:function (sock, peer) {
+ sock.peers[peer.addr + ':' + peer.port] = peer;
+ },removePeer:function (sock, peer) {
+ delete sock.peers[peer.addr + ':' + peer.port];
+ },handlePeerEvents:function (sock, peer) {
+ var first = true;
+
+ var handleOpen = function () {
+ try {
+ var queued = peer.dgram_send_queue.shift();
+ while (queued) {
+ peer.socket.send(queued);
+ queued = peer.dgram_send_queue.shift();
+ }
+ } catch (e) {
+ // not much we can do here in the way of proper error handling as we've already
+ // lied and said this data was sent. shut it down.
+ peer.socket.close();
+ }
+ };
+
+ function handleMessage(data) {
+ assert(typeof data !== 'string' && data.byteLength !== undefined); // must receive an ArrayBuffer
+ data = new Uint8Array(data); // make a typed array view on the array buffer
+
+
+ // if this is the port message, override the peer's port with it
+ var wasfirst = first;
+ first = false;
+ if (wasfirst &&
+ data.length === 10 &&
+ data[0] === 255 && data[1] === 255 && data[2] === 255 && data[3] === 255 &&
+ data[4] === 'p'.charCodeAt(0) && data[5] === 'o'.charCodeAt(0) && data[6] === 'r'.charCodeAt(0) && data[7] === 't'.charCodeAt(0)) {
+ // update the peer's port and it's key in the peer map
+ var newport = ((data[8] << 8) | data[9]);
+ SOCKFS.websocket_sock_ops.removePeer(sock, peer);
+ peer.port = newport;
+ SOCKFS.websocket_sock_ops.addPeer(sock, peer);
+ return;
+ }
+
+ sock.recv_queue.push({ addr: peer.addr, port: peer.port, data: data });
+ };
+
+ if (ENVIRONMENT_IS_NODE) {
+ peer.socket.on('open', handleOpen);
+ peer.socket.on('message', function(data, flags) {
+ if (!flags.binary) {
+ return;
+ }
+ handleMessage((new Uint8Array(data)).buffer); // copy from node Buffer -> ArrayBuffer
+ });
+ peer.socket.on('error', function() {
+ // don't throw
+ });
+ } else {
+ peer.socket.onopen = handleOpen;
+ peer.socket.onmessage = function peer_socket_onmessage(event) {
+ handleMessage(event.data);
+ };
+ }
+ },poll:function (sock) {
+ if (sock.type === 1 && sock.server) {
+ // listen sockets should only say they're available for reading
+ // if there are pending clients.
+ return sock.pending.length ? (64 | 1) : 0;
+ }
+
+ var mask = 0;
+ var dest = sock.type === 1 ? // we only care about the socket state for connection-based sockets
+ SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport) :
+ null;
+
+ if (sock.recv_queue.length ||
+ !dest || // connection-less sockets are always ready to read
+ (dest && dest.socket.readyState === dest.socket.CLOSING) ||
+ (dest && dest.socket.readyState === dest.socket.CLOSED)) { // let recv return 0 once closed
+ mask |= (64 | 1);
+ }
+
+ if (!dest || // connection-less sockets are always ready to write
+ (dest && dest.socket.readyState === dest.socket.OPEN)) {
+ mask |= 4;
+ }
+
+ if ((dest && dest.socket.readyState === dest.socket.CLOSING) ||
+ (dest && dest.socket.readyState === dest.socket.CLOSED)) {
+ mask |= 16;
+ }
+
+ return mask;
+ },ioctl:function (sock, request, arg) {
+ switch (request) {
+ case 21531:
+ var bytes = 0;
+ if (sock.recv_queue.length) {
+ bytes = sock.recv_queue[0].data.length;
+ }
+ HEAP32[((arg)>>2)]=bytes;
+ return 0;
+ default:
+ return ERRNO_CODES.EINVAL;
+ }
+ },close:function (sock) {
+ // if we've spawned a listen server, close it
+ if (sock.server) {
+ try {
+ sock.server.close();
+ } catch (e) {
+ }
+ sock.server = null;
+ }
+ // close any peer connections
+ var peers = Object.keys(sock.peers);
+ for (var i = 0; i < peers.length; i++) {
+ var peer = sock.peers[peers[i]];
+ try {
+ peer.socket.close();
+ } catch (e) {
+ }
+ SOCKFS.websocket_sock_ops.removePeer(sock, peer);
+ }
+ return 0;
+ },bind:function (sock, addr, port) {
+ if (typeof sock.saddr !== 'undefined' || typeof sock.sport !== 'undefined') {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL); // already bound
+ }
+ sock.saddr = addr;
+ sock.sport = port || _mkport();
+ // in order to emulate dgram sockets, we need to launch a listen server when
+ // binding on a connection-less socket
+ // note: this is only required on the server side
+ if (sock.type === 2) {
+ // close the existing server if it exists
+ if (sock.server) {
+ sock.server.close();
+ sock.server = null;
+ }
+ // swallow error operation not supported error that occurs when binding in the
+ // browser where this isn't supported
+ try {
+ sock.sock_ops.listen(sock, 0);
+ } catch (e) {
+ if (!(e instanceof FS.ErrnoError)) throw e;
+ if (e.errno !== ERRNO_CODES.EOPNOTSUPP) throw e;
+ }
+ }
+ },connect:function (sock, addr, port) {
+ if (sock.server) {
+ throw new FS.ErrnoError(ERRNO_CODS.EOPNOTSUPP);
+ }
+
+ // TODO autobind
+ // if (!sock.addr && sock.type == 2) {
+ // }
+
+ // early out if we're already connected / in the middle of connecting
+ if (typeof sock.daddr !== 'undefined' && typeof sock.dport !== 'undefined') {
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
+ if (dest) {
+ if (dest.socket.readyState === dest.socket.CONNECTING) {
+ throw new FS.ErrnoError(ERRNO_CODES.EALREADY);
+ } else {
+ throw new FS.ErrnoError(ERRNO_CODES.EISCONN);
+ }
+ }
+ }
+
+ // add the socket to our peer list and set our
+ // destination address / port to match
+ var peer = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
+ sock.daddr = peer.addr;
+ sock.dport = peer.port;
+
+ // always "fail" in non-blocking mode
+ throw new FS.ErrnoError(ERRNO_CODES.EINPROGRESS);
+ },listen:function (sock, backlog) {
+ if (!ENVIRONMENT_IS_NODE) {
+ throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
+ }
+ if (sock.server) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL); // already listening
+ }
+ var WebSocketServer = require('ws').Server;
+ var host = sock.saddr;
+ sock.server = new WebSocketServer({
+ host: host,
+ port: sock.sport
+ // TODO support backlog
+ });
+
+ sock.server.on('connection', function(ws) {
+ if (sock.type === 1) {
+ var newsock = SOCKFS.createSocket(sock.family, sock.type, sock.protocol);
+
+ // create a peer on the new socket
+ var peer = SOCKFS.websocket_sock_ops.createPeer(newsock, ws);
+ newsock.daddr = peer.addr;
+ newsock.dport = peer.port;
+
+ // push to queue for accept to pick up
+ sock.pending.push(newsock);
+ } else {
+ // create a peer on the listen socket so calling sendto
+ // with the listen socket and an address will resolve
+ // to the correct client
+ SOCKFS.websocket_sock_ops.createPeer(sock, ws);
+ }
+ });
+ sock.server.on('closed', function() {
+ sock.server = null;
+ });
+ sock.server.on('error', function() {
+ // don't throw
+ });
+ },accept:function (listensock) {
+ if (!listensock.server) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var newsock = listensock.pending.shift();
+ newsock.stream.flags = listensock.stream.flags;
+ return newsock;
+ },getname:function (sock, peer) {
+ var addr, port;
+ if (peer) {
+ if (sock.daddr === undefined || sock.dport === undefined) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+ addr = sock.daddr;
+ port = sock.dport;
+ } else {
+ // TODO saddr and sport will be set for bind()'d UDP sockets, but what
+ // should we be returning for TCP sockets that've been connect()'d?
+ addr = sock.saddr || 0;
+ port = sock.sport || 0;
+ }
+ return { addr: addr, port: port };
+ },sendmsg:function (sock, buffer, offset, length, addr, port) {
+ if (sock.type === 2) {
+ // connection-less sockets will honor the message address,
+ // and otherwise fall back to the bound destination address
+ if (addr === undefined || port === undefined) {
+ addr = sock.daddr;
+ port = sock.dport;
+ }
+ // if there was no address to fall back to, error out
+ if (addr === undefined || port === undefined) {
+ throw new FS.ErrnoError(ERRNO_CODES.EDESTADDRREQ);
+ }
+ } else {
+ // connection-based sockets will only use the bound
+ addr = sock.daddr;
+ port = sock.dport;
+ }
+
+ // find the peer for the destination address
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, addr, port);
+
+ // early out if not connected with a connection-based socket
+ if (sock.type === 1) {
+ if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ } else if (dest.socket.readyState === dest.socket.CONNECTING) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ }
+
+ // create a copy of the incoming data to send, as the WebSocket API
+ // doesn't work entirely with an ArrayBufferView, it'll just send
+ // the entire underlying buffer
+ var data;
+ if (buffer instanceof Array || buffer instanceof ArrayBuffer) {
+ data = buffer.slice(offset, offset + length);
+ } else { // ArrayBufferView
+ data = buffer.buffer.slice(buffer.byteOffset + offset, buffer.byteOffset + offset + length);
+ }
+
+ // if we're emulating a connection-less dgram socket and don't have
+ // a cached connection, queue the buffer to send upon connect and
+ // lie, saying the data was sent now.
+ if (sock.type === 2) {
+ if (!dest || dest.socket.readyState !== dest.socket.OPEN) {
+ // if we're not connected, open a new connection
+ if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ dest = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
+ }
+ dest.dgram_send_queue.push(data);
+ return length;
+ }
+ }
+
+ try {
+ // send the actual data
+ dest.socket.send(data);
+ return length;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ },recvmsg:function (sock, length) {
+ // http://pubs.opengroup.org/onlinepubs/7908799/xns/recvmsg.html
+ if (sock.type === 1 && sock.server) {
+ // tcp servers should not be recv()'ing on the listen socket
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+
+ var queued = sock.recv_queue.shift();
+ if (!queued) {
+ if (sock.type === 1) {
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
+
+ if (!dest) {
+ // if we have a destination address but are not connected, error out
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+ else if (dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ // return null if the socket has closed
+ return null;
+ }
+ else {
+ // else, our socket is in a valid state but truly has nothing available
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ } else {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ }
+
+ // queued.data will be an ArrayBuffer if it's unadulterated, but if it's
+ // requeued TCP data it'll be an ArrayBufferView
+ var queuedLength = queued.data.byteLength || queued.data.length;
+ var queuedOffset = queued.data.byteOffset || 0;
+ var queuedBuffer = queued.data.buffer || queued.data;
+ var bytesRead = Math.min(length, queuedLength);
+ var res = {
+ buffer: new Uint8Array(queuedBuffer, queuedOffset, bytesRead),
+ addr: queued.addr,
+ port: queued.port
+ };
+
+
+ // push back any unread data for TCP connections
+ if (sock.type === 1 && bytesRead < queuedLength) {
+ var bytesRemaining = queuedLength - bytesRead;
+ queued.data = new Uint8Array(queuedBuffer, queuedOffset + bytesRead, bytesRemaining);
+ sock.recv_queue.unshift(queued);
+ }
+
+ return res;
+ }}};function _send(fd, buf, len, flags) {
+ var sock = SOCKFS.getSocket(fd);
+ if (!sock) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ // TODO honor flags
+ return _write(fd, buf, len);
+ }
+
+ function _pwrite(fildes, buf, nbyte, offset) {
+ // ssize_t pwrite(int fildes, const void *buf, size_t nbyte, off_t offset);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
+ var stream = FS.getStream(fildes);
+ if (!stream) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ try {
+ var slab = HEAP8;
+ return FS.write(stream, slab, buf, nbyte, offset);
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }function _write(fildes, buf, nbyte) {
+ // ssize_t write(int fildes, const void *buf, size_t nbyte);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
+ var stream = FS.getStream(fildes);
+ if (!stream) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+
+
+ try {
+ var slab = HEAP8;
+ return FS.write(stream, slab, buf, nbyte);
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }
+
+ function _fileno(stream) {
+ // int fileno(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fileno.html
+ stream = FS.getStreamFromPtr(stream);
+ if (!stream) return -1;
+ return stream.fd;
+ }function _fwrite(ptr, size, nitems, stream) {
+ // size_t fwrite(const void *restrict ptr, size_t size, size_t nitems, FILE *restrict stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fwrite.html
+ var bytesToWrite = nitems * size;
+ if (bytesToWrite == 0) return 0;
+ var fd = _fileno(stream);
+ var bytesWritten = _write(fd, ptr, bytesToWrite);
+ if (bytesWritten == -1) {
+ var streamObj = FS.getStreamFromPtr(stream);
+ if (streamObj) streamObj.error = true;
+ return 0;
+ } else {
+ return Math.floor(bytesWritten / size);
+ }
+ }
+
+
+
+ Module["_strlen"] = _strlen;
+
+ function __reallyNegative(x) {
+ return x < 0 || (x === 0 && (1/x) === -Infinity);
+ }function __formatString(format, varargs) {
+ var textIndex = format;
+ var argIndex = 0;
+ function getNextArg(type) {
+ // NOTE: Explicitly ignoring type safety. Otherwise this fails:
+ // int x = 4; printf("%c\n", (char)x);
+ var ret;
+ if (type === 'double') {
+ ret = HEAPF64[(((varargs)+(argIndex))>>3)];
+ } else if (type == 'i64') {
+ ret = [HEAP32[(((varargs)+(argIndex))>>2)],
+ HEAP32[(((varargs)+(argIndex+4))>>2)]];
+
+ } else {
+ type = 'i32'; // varargs are always i32, i64, or double
+ ret = HEAP32[(((varargs)+(argIndex))>>2)];
+ }
+ argIndex += Runtime.getNativeFieldSize(type);
+ return ret;
+ }
+
+ var ret = [];
+ var curr, next, currArg;
+ while(1) {
+ var startTextIndex = textIndex;
+ curr = HEAP8[(textIndex)];
+ if (curr === 0) break;
+ next = HEAP8[((textIndex+1)|0)];
+ if (curr == 37) {
+ // Handle flags.
+ var flagAlwaysSigned = false;
+ var flagLeftAlign = false;
+ var flagAlternative = false;
+ var flagZeroPad = false;
+ var flagPadSign = false;
+ flagsLoop: while (1) {
+ switch (next) {
+ case 43:
+ flagAlwaysSigned = true;
+ break;
+ case 45:
+ flagLeftAlign = true;
+ break;
+ case 35:
+ flagAlternative = true;
+ break;
+ case 48:
+ if (flagZeroPad) {
+ break flagsLoop;
+ } else {
+ flagZeroPad = true;
+ break;
+ }
+ case 32:
+ flagPadSign = true;
+ break;
+ default:
+ break flagsLoop;
+ }
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ }
+
+ // Handle width.
+ var width = 0;
+ if (next == 42) {
+ width = getNextArg('i32');
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ } else {
+ while (next >= 48 && next <= 57) {
+ width = width * 10 + (next - 48);
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ }
+ }
+
+ // Handle precision.
+ var precisionSet = false, precision = -1;
+ if (next == 46) {
+ precision = 0;
+ precisionSet = true;
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ if (next == 42) {
+ precision = getNextArg('i32');
+ textIndex++;
+ } else {
+ while(1) {
+ var precisionChr = HEAP8[((textIndex+1)|0)];
+ if (precisionChr < 48 ||
+ precisionChr > 57) break;
+ precision = precision * 10 + (precisionChr - 48);
+ textIndex++;
+ }
+ }
+ next = HEAP8[((textIndex+1)|0)];
+ }
+ if (precision < 0) {
+ precision = 6; // Standard default.
+ precisionSet = false;
+ }
+
+ // Handle integer sizes. WARNING: These assume a 32-bit architecture!
+ var argSize;
+ switch (String.fromCharCode(next)) {
+ case 'h':
+ var nextNext = HEAP8[((textIndex+2)|0)];
+ if (nextNext == 104) {
+ textIndex++;
+ argSize = 1; // char (actually i32 in varargs)
+ } else {
+ argSize = 2; // short (actually i32 in varargs)
+ }
+ break;
+ case 'l':
+ var nextNext = HEAP8[((textIndex+2)|0)];
+ if (nextNext == 108) {
+ textIndex++;
+ argSize = 8; // long long
+ } else {
+ argSize = 4; // long
+ }
+ break;
+ case 'L': // long long
+ case 'q': // int64_t
+ case 'j': // intmax_t
+ argSize = 8;
+ break;
+ case 'z': // size_t
+ case 't': // ptrdiff_t
+ case 'I': // signed ptrdiff_t or unsigned size_t
+ argSize = 4;
+ break;
+ default:
+ argSize = null;
+ }
+ if (argSize) textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+
+ // Handle type specifier.
+ switch (String.fromCharCode(next)) {
+ case 'd': case 'i': case 'u': case 'o': case 'x': case 'X': case 'p': {
+ // Integer.
+ var signed = next == 100 || next == 105;
+ argSize = argSize || 4;
+ var currArg = getNextArg('i' + (argSize * 8));
+ var argText;
+ // Flatten i64-1 [low, high] into a (slightly rounded) double
+ if (argSize == 8) {
+ currArg = Runtime.makeBigInt(currArg[0], currArg[1], next == 117);
+ }
+ // Truncate to requested size.
+ if (argSize <= 4) {
+ var limit = Math.pow(256, argSize) - 1;
+ currArg = (signed ? reSign : unSign)(currArg & limit, argSize * 8);
+ }
+ // Format the number.
+ var currAbsArg = Math.abs(currArg);
+ var prefix = '';
+ if (next == 100 || next == 105) {
+ argText = reSign(currArg, 8 * argSize, 1).toString(10);
+ } else if (next == 117) {
+ argText = unSign(currArg, 8 * argSize, 1).toString(10);
+ currArg = Math.abs(currArg);
+ } else if (next == 111) {
+ argText = (flagAlternative ? '0' : '') + currAbsArg.toString(8);
+ } else if (next == 120 || next == 88) {
+ prefix = (flagAlternative && currArg != 0) ? '0x' : '';
+ if (currArg < 0) {
+ // Represent negative numbers in hex as 2's complement.
+ currArg = -currArg;
+ argText = (currAbsArg - 1).toString(16);
+ var buffer = [];
+ for (var i = 0; i < argText.length; i++) {
+ buffer.push((0xF - parseInt(argText[i], 16)).toString(16));
+ }
+ argText = buffer.join('');
+ while (argText.length < argSize * 2) argText = 'f' + argText;
+ } else {
+ argText = currAbsArg.toString(16);
+ }
+ if (next == 88) {
+ prefix = prefix.toUpperCase();
+ argText = argText.toUpperCase();
+ }
+ } else if (next == 112) {
+ if (currAbsArg === 0) {
+ argText = '(nil)';
+ } else {
+ prefix = '0x';
+ argText = currAbsArg.toString(16);
+ }
+ }
+ if (precisionSet) {
+ while (argText.length < precision) {
+ argText = '0' + argText;
+ }
+ }
+
+ // Add sign if needed
+ if (currArg >= 0) {
+ if (flagAlwaysSigned) {
+ prefix = '+' + prefix;
+ } else if (flagPadSign) {
+ prefix = ' ' + prefix;
+ }
+ }
+
+ // Move sign to prefix so we zero-pad after the sign
+ if (argText.charAt(0) == '-') {
+ prefix = '-' + prefix;
+ argText = argText.substr(1);
+ }
+
+ // Add padding.
+ while (prefix.length + argText.length < width) {
+ if (flagLeftAlign) {
+ argText += ' ';
+ } else {
+ if (flagZeroPad) {
+ argText = '0' + argText;
+ } else {
+ prefix = ' ' + prefix;
+ }
+ }
+ }
+
+ // Insert the result into the buffer.
+ argText = prefix + argText;
+ argText.split('').forEach(function(chr) {
+ ret.push(chr.charCodeAt(0));
+ });
+ break;
+ }
+ case 'f': case 'F': case 'e': case 'E': case 'g': case 'G': {
+ // Float.
+ var currArg = getNextArg('double');
+ var argText;
+ if (isNaN(currArg)) {
+ argText = 'nan';
+ flagZeroPad = false;
+ } else if (!isFinite(currArg)) {
+ argText = (currArg < 0 ? '-' : '') + 'inf';
+ flagZeroPad = false;
+ } else {
+ var isGeneral = false;
+ var effectivePrecision = Math.min(precision, 20);
+
+ // Convert g/G to f/F or e/E, as per:
+ // http://pubs.opengroup.org/onlinepubs/9699919799/functions/printf.html
+ if (next == 103 || next == 71) {
+ isGeneral = true;
+ precision = precision || 1;
+ var exponent = parseInt(currArg.toExponential(effectivePrecision).split('e')[1], 10);
+ if (precision > exponent && exponent >= -4) {
+ next = ((next == 103) ? 'f' : 'F').charCodeAt(0);
+ precision -= exponent + 1;
+ } else {
+ next = ((next == 103) ? 'e' : 'E').charCodeAt(0);
+ precision--;
+ }
+ effectivePrecision = Math.min(precision, 20);
+ }
+
+ if (next == 101 || next == 69) {
+ argText = currArg.toExponential(effectivePrecision);
+ // Make sure the exponent has at least 2 digits.
+ if (/[eE][-+]\d$/.test(argText)) {
+ argText = argText.slice(0, -1) + '0' + argText.slice(-1);
+ }
+ } else if (next == 102 || next == 70) {
+ argText = currArg.toFixed(effectivePrecision);
+ if (currArg === 0 && __reallyNegative(currArg)) {
+ argText = '-' + argText;
+ }
+ }
+
+ var parts = argText.split('e');
+ if (isGeneral && !flagAlternative) {
+ // Discard trailing zeros and periods.
+ while (parts[0].length > 1 && parts[0].indexOf('.') != -1 &&
+ (parts[0].slice(-1) == '0' || parts[0].slice(-1) == '.')) {
+ parts[0] = parts[0].slice(0, -1);
+ }
+ } else {
+ // Make sure we have a period in alternative mode.
+ if (flagAlternative && argText.indexOf('.') == -1) parts[0] += '.';
+ // Zero pad until required precision.
+ while (precision > effectivePrecision++) parts[0] += '0';
+ }
+ argText = parts[0] + (parts.length > 1 ? 'e' + parts[1] : '');
+
+ // Capitalize 'E' if needed.
+ if (next == 69) argText = argText.toUpperCase();
+
+ // Add sign.
+ if (currArg >= 0) {
+ if (flagAlwaysSigned) {
+ argText = '+' + argText;
+ } else if (flagPadSign) {
+ argText = ' ' + argText;
+ }
+ }
+ }
+
+ // Add padding.
+ while (argText.length < width) {
+ if (flagLeftAlign) {
+ argText += ' ';
+ } else {
+ if (flagZeroPad && (argText[0] == '-' || argText[0] == '+')) {
+ argText = argText[0] + '0' + argText.slice(1);
+ } else {
+ argText = (flagZeroPad ? '0' : ' ') + argText;
+ }
+ }
+ }
+
+ // Adjust case.
+ if (next < 97) argText = argText.toUpperCase();
+
+ // Insert the result into the buffer.
+ argText.split('').forEach(function(chr) {
+ ret.push(chr.charCodeAt(0));
+ });
+ break;
+ }
+ case 's': {
+ // String.
+ var arg = getNextArg('i8*');
+ var argLength = arg ? _strlen(arg) : '(null)'.length;
+ if (precisionSet) argLength = Math.min(argLength, precision);
+ if (!flagLeftAlign) {
+ while (argLength < width--) {
+ ret.push(32);
+ }
+ }
+ if (arg) {
+ for (var i = 0; i < argLength; i++) {
+ ret.push(HEAPU8[((arg++)|0)]);
+ }
+ } else {
+ ret = ret.concat(intArrayFromString('(null)'.substr(0, argLength), true));
+ }
+ if (flagLeftAlign) {
+ while (argLength < width--) {
+ ret.push(32);
+ }
+ }
+ break;
+ }
+ case 'c': {
+ // Character.
+ if (flagLeftAlign) ret.push(getNextArg('i8'));
+ while (--width > 0) {
+ ret.push(32);
+ }
+ if (!flagLeftAlign) ret.push(getNextArg('i8'));
+ break;
+ }
+ case 'n': {
+ // Write the length written so far to the next parameter.
+ var ptr = getNextArg('i32*');
+ HEAP32[((ptr)>>2)]=ret.length;
+ break;
+ }
+ case '%': {
+ // Literal percent sign.
+ ret.push(curr);
+ break;
+ }
+ default: {
+ // Unknown specifiers remain untouched.
+ for (var i = startTextIndex; i < textIndex + 2; i++) {
+ ret.push(HEAP8[(i)]);
+ }
+ }
+ }
+ textIndex += 2;
+ // TODO: Support a/A (hex float) and m (last error) specifiers.
+ // TODO: Support %1${specifier} for arg selection.
+ } else {
+ ret.push(curr);
+ textIndex += 1;
+ }
+ }
+ return ret;
+ }function _fprintf(stream, format, varargs) {
+ // int fprintf(FILE *restrict stream, const char *restrict format, ...);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
+ var result = __formatString(format, varargs);
+ var stack = Runtime.stackSave();
+ var ret = _fwrite(allocate(result, 'i8', ALLOC_STACK), 1, result.length, stream);
+ Runtime.stackRestore(stack);
+ return ret;
+ }function _printf(format, varargs) {
+ // int printf(const char *restrict format, ...);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
+ var stdout = HEAP32[((_stdout)>>2)];
+ return _fprintf(stdout, format, varargs);
+ }
+
+ function _sbrk(bytes) {
+ // Implement a Linux-like 'memory area' for our 'process'.
+ // Changes the size of the memory area by |bytes|; returns the
+ // address of the previous top ('break') of the memory area
+ // We control the "dynamic" memory - DYNAMIC_BASE to DYNAMICTOP
+ var self = _sbrk;
+ if (!self.called) {
+ DYNAMICTOP = alignMemoryPage(DYNAMICTOP); // make sure we start out aligned
+ self.called = true;
+ assert(Runtime.dynamicAlloc);
+ self.alloc = Runtime.dynamicAlloc;
+ Runtime.dynamicAlloc = function() { abort('cannot dynamically allocate, sbrk now has control') };
+ }
+ var ret = DYNAMICTOP;
+ if (bytes != 0) self.alloc(bytes);
+ return ret; // Previous break location.
+ }
+
+ function _sysconf(name) {
+ // long sysconf(int name);
+ // http://pubs.opengroup.org/onlinepubs/009695399/functions/sysconf.html
+ switch(name) {
+ case 30: return PAGE_SIZE;
+ case 132:
+ case 133:
+ case 12:
+ case 137:
+ case 138:
+ case 15:
+ case 235:
+ case 16:
+ case 17:
+ case 18:
+ case 19:
+ case 20:
+ case 149:
+ case 13:
+ case 10:
+ case 236:
+ case 153:
+ case 9:
+ case 21:
+ case 22:
+ case 159:
+ case 154:
+ case 14:
+ case 77:
+ case 78:
+ case 139:
+ case 80:
+ case 81:
+ case 79:
+ case 82:
+ case 68:
+ case 67:
+ case 164:
+ case 11:
+ case 29:
+ case 47:
+ case 48:
+ case 95:
+ case 52:
+ case 51:
+ case 46:
+ return 200809;
+ case 27:
+ case 246:
+ case 127:
+ case 128:
+ case 23:
+ case 24:
+ case 160:
+ case 161:
+ case 181:
+ case 182:
+ case 242:
+ case 183:
+ case 184:
+ case 243:
+ case 244:
+ case 245:
+ case 165:
+ case 178:
+ case 179:
+ case 49:
+ case 50:
+ case 168:
+ case 169:
+ case 175:
+ case 170:
+ case 171:
+ case 172:
+ case 97:
+ case 76:
+ case 32:
+ case 173:
+ case 35:
+ return -1;
+ case 176:
+ case 177:
+ case 7:
+ case 155:
+ case 8:
+ case 157:
+ case 125:
+ case 126:
+ case 92:
+ case 93:
+ case 129:
+ case 130:
+ case 131:
+ case 94:
+ case 91:
+ return 1;
+ case 74:
+ case 60:
+ case 69:
+ case 70:
+ case 4:
+ return 1024;
+ case 31:
+ case 42:
+ case 72:
+ return 32;
+ case 87:
+ case 26:
+ case 33:
+ return 2147483647;
+ case 34:
+ case 1:
+ return 47839;
+ case 38:
+ case 36:
+ return 99;
+ case 43:
+ case 37:
+ return 2048;
+ case 0: return 2097152;
+ case 3: return 65536;
+ case 28: return 32768;
+ case 44: return 32767;
+ case 75: return 16384;
+ case 39: return 1000;
+ case 89: return 700;
+ case 71: return 256;
+ case 40: return 255;
+ case 2: return 100;
+ case 180: return 64;
+ case 25: return 20;
+ case 5: return 16;
+ case 6: return 6;
+ case 73: return 4;
+ case 84: return 1;
+ }
+ ___setErrNo(ERRNO_CODES.EINVAL);
+ return -1;
+ }
+
+
+ Module["_memset"] = _memset;
+
+ function ___errno_location() {
+ return ___errno_state;
+ }
+
+ function _abort() {
+ Module['abort']();
+ }
+
+ var Browser={mainLoop:{scheduler:null,method:"",shouldPause:false,paused:false,queue:[],pause:function () {
+ Browser.mainLoop.shouldPause = true;
+ },resume:function () {
+ if (Browser.mainLoop.paused) {
+ Browser.mainLoop.paused = false;
+ Browser.mainLoop.scheduler();
+ }
+ Browser.mainLoop.shouldPause = false;
+ },updateStatus:function () {
+ if (Module['setStatus']) {
+ var message = Module['statusMessage'] || 'Please wait...';
+ var remaining = Browser.mainLoop.remainingBlockers;
+ var expected = Browser.mainLoop.expectedBlockers;
+ if (remaining) {
+ if (remaining < expected) {
+ Module['setStatus'](message + ' (' + (expected - remaining) + '/' + expected + ')');
+ } else {
+ Module['setStatus'](message);
+ }
+ } else {
+ Module['setStatus']('');
+ }
+ }
+ }},isFullScreen:false,pointerLock:false,moduleContextCreatedCallbacks:[],workers:[],init:function () {
+ if (!Module["preloadPlugins"]) Module["preloadPlugins"] = []; // needs to exist even in workers
+
+ if (Browser.initted || ENVIRONMENT_IS_WORKER) return;
+ Browser.initted = true;
+
+ try {
+ new Blob();
+ Browser.hasBlobConstructor = true;
+ } catch(e) {
+ Browser.hasBlobConstructor = false;
+ console.log("warning: no blob constructor, cannot create blobs with mimetypes");
+ }
+ Browser.BlobBuilder = typeof MozBlobBuilder != "undefined" ? MozBlobBuilder : (typeof WebKitBlobBuilder != "undefined" ? WebKitBlobBuilder : (!Browser.hasBlobConstructor ? console.log("warning: no BlobBuilder") : null));
+ Browser.URLObject = typeof window != "undefined" ? (window.URL ? window.URL : window.webkitURL) : undefined;
+ if (!Module.noImageDecoding && typeof Browser.URLObject === 'undefined') {
+ console.log("warning: Browser does not support creating object URLs. Built-in browser image decoding will not be available.");
+ Module.noImageDecoding = true;
+ }
+
+ // Support for plugins that can process preloaded files. You can add more of these to
+ // your app by creating and appending to Module.preloadPlugins.
+ //
+ // Each plugin is asked if it can handle a file based on the file's name. If it can,
+ // it is given the file's raw data. When it is done, it calls a callback with the file's
+ // (possibly modified) data. For example, a plugin might decompress a file, or it
+ // might create some side data structure for use later (like an Image element, etc.).
+
+ var imagePlugin = {};
+ imagePlugin['canHandle'] = function imagePlugin_canHandle(name) {
+ return !Module.noImageDecoding && /\.(jpg|jpeg|png|bmp)$/i.test(name);
+ };
+ imagePlugin['handle'] = function imagePlugin_handle(byteArray, name, onload, onerror) {
+ var b = null;
+ if (Browser.hasBlobConstructor) {
+ try {
+ b = new Blob([byteArray], { type: Browser.getMimetype(name) });
+ if (b.size !== byteArray.length) { // Safari bug #118630
+ // Safari's Blob can only take an ArrayBuffer
+ b = new Blob([(new Uint8Array(byteArray)).buffer], { type: Browser.getMimetype(name) });
+ }
+ } catch(e) {
+ Runtime.warnOnce('Blob constructor present but fails: ' + e + '; falling back to blob builder');
+ }
+ }
+ if (!b) {
+ var bb = new Browser.BlobBuilder();
+ bb.append((new Uint8Array(byteArray)).buffer); // we need to pass a buffer, and must copy the array to get the right data range
+ b = bb.getBlob();
+ }
+ var url = Browser.URLObject.createObjectURL(b);
+ var img = new Image();
+ img.onload = function img_onload() {
+ assert(img.complete, 'Image ' + name + ' could not be decoded');
+ var canvas = document.createElement('canvas');
+ canvas.width = img.width;
+ canvas.height = img.height;
+ var ctx = canvas.getContext('2d');
+ ctx.drawImage(img, 0, 0);
+ Module["preloadedImages"][name] = canvas;
+ Browser.URLObject.revokeObjectURL(url);
+ if (onload) onload(byteArray);
+ };
+ img.onerror = function img_onerror(event) {
+ console.log('Image ' + url + ' could not be decoded');
+ if (onerror) onerror();
+ };
+ img.src = url;
+ };
+ Module['preloadPlugins'].push(imagePlugin);
+
+ var audioPlugin = {};
+ audioPlugin['canHandle'] = function audioPlugin_canHandle(name) {
+ return !Module.noAudioDecoding && name.substr(-4) in { '.ogg': 1, '.wav': 1, '.mp3': 1 };
+ };
+ audioPlugin['handle'] = function audioPlugin_handle(byteArray, name, onload, onerror) {
+ var done = false;
+ function finish(audio) {
+ if (done) return;
+ done = true;
+ Module["preloadedAudios"][name] = audio;
+ if (onload) onload(byteArray);
+ }
+ function fail() {
+ if (done) return;
+ done = true;
+ Module["preloadedAudios"][name] = new Audio(); // empty shim
+ if (onerror) onerror();
+ }
+ if (Browser.hasBlobConstructor) {
+ try {
+ var b = new Blob([byteArray], { type: Browser.getMimetype(name) });
+ } catch(e) {
+ return fail();
+ }
+ var url = Browser.URLObject.createObjectURL(b); // XXX we never revoke this!
+ var audio = new Audio();
+ audio.addEventListener('canplaythrough', function() { finish(audio) }, false); // use addEventListener due to chromium bug 124926
+ audio.onerror = function audio_onerror(event) {
+ if (done) return;
+ console.log('warning: browser could not fully decode audio ' + name + ', trying slower base64 approach');
+ function encode64(data) {
+ var BASE = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
+ var PAD = '=';
+ var ret = '';
+ var leftchar = 0;
+ var leftbits = 0;
+ for (var i = 0; i < data.length; i++) {
+ leftchar = (leftchar << 8) | data[i];
+ leftbits += 8;
+ while (leftbits >= 6) {
+ var curr = (leftchar >> (leftbits-6)) & 0x3f;
+ leftbits -= 6;
+ ret += BASE[curr];
+ }
+ }
+ if (leftbits == 2) {
+ ret += BASE[(leftchar&3) << 4];
+ ret += PAD + PAD;
+ } else if (leftbits == 4) {
+ ret += BASE[(leftchar&0xf) << 2];
+ ret += PAD;
+ }
+ return ret;
+ }
+ audio.src = 'data:audio/x-' + name.substr(-3) + ';base64,' + encode64(byteArray);
+ finish(audio); // we don't wait for confirmation this worked - but it's worth trying
+ };
+ audio.src = url;
+ // workaround for chrome bug 124926 - we do not always get oncanplaythrough or onerror
+ Browser.safeSetTimeout(function() {
+ finish(audio); // try to use it even though it is not necessarily ready to play
+ }, 10000);
+ } else {
+ return fail();
+ }
+ };
+ Module['preloadPlugins'].push(audioPlugin);
+
+ // Canvas event setup
+
+ var canvas = Module['canvas'];
+
+ // forced aspect ratio can be enabled by defining 'forcedAspectRatio' on Module
+ // Module['forcedAspectRatio'] = 4 / 3;
+
+ canvas.requestPointerLock = canvas['requestPointerLock'] ||
+ canvas['mozRequestPointerLock'] ||
+ canvas['webkitRequestPointerLock'] ||
+ canvas['msRequestPointerLock'] ||
+ function(){};
+ canvas.exitPointerLock = document['exitPointerLock'] ||
+ document['mozExitPointerLock'] ||
+ document['webkitExitPointerLock'] ||
+ document['msExitPointerLock'] ||
+ function(){}; // no-op if function does not exist
+ canvas.exitPointerLock = canvas.exitPointerLock.bind(document);
+
+ function pointerLockChange() {
+ Browser.pointerLock = document['pointerLockElement'] === canvas ||
+ document['mozPointerLockElement'] === canvas ||
+ document['webkitPointerLockElement'] === canvas ||
+ document['msPointerLockElement'] === canvas;
+ }
+
+ document.addEventListener('pointerlockchange', pointerLockChange, false);
+ document.addEventListener('mozpointerlockchange', pointerLockChange, false);
+ document.addEventListener('webkitpointerlockchange', pointerLockChange, false);
+ document.addEventListener('mspointerlockchange', pointerLockChange, false);
+
+ if (Module['elementPointerLock']) {
+ canvas.addEventListener("click", function(ev) {
+ if (!Browser.pointerLock && canvas.requestPointerLock) {
+ canvas.requestPointerLock();
+ ev.preventDefault();
+ }
+ }, false);
+ }
+ },createContext:function (canvas, useWebGL, setInModule, webGLContextAttributes) {
+ var ctx;
+ var errorInfo = '?';
+ function onContextCreationError(event) {
+ errorInfo = event.statusMessage || errorInfo;
+ }
+ try {
+ if (useWebGL) {
+ var contextAttributes = {
+ antialias: false,
+ alpha: false
+ };
+
+ if (webGLContextAttributes) {
+ for (var attribute in webGLContextAttributes) {
+ contextAttributes[attribute] = webGLContextAttributes[attribute];
+ }
+ }
+
+
+ canvas.addEventListener('webglcontextcreationerror', onContextCreationError, false);
+ try {
+ ['experimental-webgl', 'webgl'].some(function(webglId) {
+ return ctx = canvas.getContext(webglId, contextAttributes);
+ });
+ } finally {
+ canvas.removeEventListener('webglcontextcreationerror', onContextCreationError, false);
+ }
+ } else {
+ ctx = canvas.getContext('2d');
+ }
+ if (!ctx) throw ':(';
+ } catch (e) {
+ Module.print('Could not create canvas: ' + [errorInfo, e]);
+ return null;
+ }
+ if (useWebGL) {
+ // Set the background of the WebGL canvas to black
+ canvas.style.backgroundColor = "black";
+
+ // Warn on context loss
+ canvas.addEventListener('webglcontextlost', function(event) {
+ alert('WebGL context lost. You will need to reload the page.');
+ }, false);
+ }
+ if (setInModule) {
+ GLctx = Module.ctx = ctx;
+ Module.useWebGL = useWebGL;
+ Browser.moduleContextCreatedCallbacks.forEach(function(callback) { callback() });
+ Browser.init();
+ }
+ return ctx;
+ },destroyContext:function (canvas, useWebGL, setInModule) {},fullScreenHandlersInstalled:false,lockPointer:undefined,resizeCanvas:undefined,requestFullScreen:function (lockPointer, resizeCanvas) {
+ Browser.lockPointer = lockPointer;
+ Browser.resizeCanvas = resizeCanvas;
+ if (typeof Browser.lockPointer === 'undefined') Browser.lockPointer = true;
+ if (typeof Browser.resizeCanvas === 'undefined') Browser.resizeCanvas = false;
+
+ var canvas = Module['canvas'];
+ function fullScreenChange() {
+ Browser.isFullScreen = false;
+ var canvasContainer = canvas.parentNode;
+ if ((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
+ document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
+ document['fullScreenElement'] || document['fullscreenElement'] ||
+ document['msFullScreenElement'] || document['msFullscreenElement'] ||
+ document['webkitCurrentFullScreenElement']) === canvasContainer) {
+ canvas.cancelFullScreen = document['cancelFullScreen'] ||
+ document['mozCancelFullScreen'] ||
+ document['webkitCancelFullScreen'] ||
+ document['msExitFullscreen'] ||
+ document['exitFullscreen'] ||
+ function() {};
+ canvas.cancelFullScreen = canvas.cancelFullScreen.bind(document);
+ if (Browser.lockPointer) canvas.requestPointerLock();
+ Browser.isFullScreen = true;
+ if (Browser.resizeCanvas) Browser.setFullScreenCanvasSize();
+ } else {
+
+ // remove the full screen specific parent of the canvas again to restore the HTML structure from before going full screen
+ canvasContainer.parentNode.insertBefore(canvas, canvasContainer);
+ canvasContainer.parentNode.removeChild(canvasContainer);
+
+ if (Browser.resizeCanvas) Browser.setWindowedCanvasSize();
+ }
+ if (Module['onFullScreen']) Module['onFullScreen'](Browser.isFullScreen);
+ Browser.updateCanvasDimensions(canvas);
+ }
+
+ if (!Browser.fullScreenHandlersInstalled) {
+ Browser.fullScreenHandlersInstalled = true;
+ document.addEventListener('fullscreenchange', fullScreenChange, false);
+ document.addEventListener('mozfullscreenchange', fullScreenChange, false);
+ document.addEventListener('webkitfullscreenchange', fullScreenChange, false);
+ document.addEventListener('MSFullscreenChange', fullScreenChange, false);
+ }
+
+ // create a new parent to ensure the canvas has no siblings. this allows browsers to optimize full screen performance when its parent is the full screen root
+ var canvasContainer = document.createElement("div");
+ canvas.parentNode.insertBefore(canvasContainer, canvas);
+ canvasContainer.appendChild(canvas);
+
+ // use parent of canvas as full screen root to allow aspect ratio correction (Firefox stretches the root to screen size)
+ canvasContainer.requestFullScreen = canvasContainer['requestFullScreen'] ||
+ canvasContainer['mozRequestFullScreen'] ||
+ canvasContainer['msRequestFullscreen'] ||
+ (canvasContainer['webkitRequestFullScreen'] ? function() { canvasContainer['webkitRequestFullScreen'](Element['ALLOW_KEYBOARD_INPUT']) } : null);
+ canvasContainer.requestFullScreen();
+ },requestAnimationFrame:function requestAnimationFrame(func) {
+ if (typeof window === 'undefined') { // Provide fallback to setTimeout if window is undefined (e.g. in Node.js)
+ setTimeout(func, 1000/60);
+ } else {
+ if (!window.requestAnimationFrame) {
+ window.requestAnimationFrame = window['requestAnimationFrame'] ||
+ window['mozRequestAnimationFrame'] ||
+ window['webkitRequestAnimationFrame'] ||
+ window['msRequestAnimationFrame'] ||
+ window['oRequestAnimationFrame'] ||
+ window['setTimeout'];
+ }
+ window.requestAnimationFrame(func);
+ }
+ },safeCallback:function (func) {
+ return function() {
+ if (!ABORT) return func.apply(null, arguments);
+ };
+ },safeRequestAnimationFrame:function (func) {
+ return Browser.requestAnimationFrame(function() {
+ if (!ABORT) func();
+ });
+ },safeSetTimeout:function (func, timeout) {
+ return setTimeout(function() {
+ if (!ABORT) func();
+ }, timeout);
+ },safeSetInterval:function (func, timeout) {
+ return setInterval(function() {
+ if (!ABORT) func();
+ }, timeout);
+ },getMimetype:function (name) {
+ return {
+ 'jpg': 'image/jpeg',
+ 'jpeg': 'image/jpeg',
+ 'png': 'image/png',
+ 'bmp': 'image/bmp',
+ 'ogg': 'audio/ogg',
+ 'wav': 'audio/wav',
+ 'mp3': 'audio/mpeg'
+ }[name.substr(name.lastIndexOf('.')+1)];
+ },getUserMedia:function (func) {
+ if(!window.getUserMedia) {
+ window.getUserMedia = navigator['getUserMedia'] ||
+ navigator['mozGetUserMedia'];
+ }
+ window.getUserMedia(func);
+ },getMovementX:function (event) {
+ return event['movementX'] ||
+ event['mozMovementX'] ||
+ event['webkitMovementX'] ||
+ 0;
+ },getMovementY:function (event) {
+ return event['movementY'] ||
+ event['mozMovementY'] ||
+ event['webkitMovementY'] ||
+ 0;
+ },getMouseWheelDelta:function (event) {
+ return Math.max(-1, Math.min(1, event.type === 'DOMMouseScroll' ? event.detail : -event.wheelDelta));
+ },mouseX:0,mouseY:0,mouseMovementX:0,mouseMovementY:0,calculateMouseEvent:function (event) { // event should be mousemove, mousedown or mouseup
+ if (Browser.pointerLock) {
+ // When the pointer is locked, calculate the coordinates
+ // based on the movement of the mouse.
+ // Workaround for Firefox bug 764498
+ if (event.type != 'mousemove' &&
+ ('mozMovementX' in event)) {
+ Browser.mouseMovementX = Browser.mouseMovementY = 0;
+ } else {
+ Browser.mouseMovementX = Browser.getMovementX(event);
+ Browser.mouseMovementY = Browser.getMovementY(event);
+ }
+
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ Browser.mouseX = SDL.mouseX + Browser.mouseMovementX;
+ Browser.mouseY = SDL.mouseY + Browser.mouseMovementY;
+ } else {
+ // just add the mouse delta to the current absolut mouse position
+ // FIXME: ideally this should be clamped against the canvas size and zero
+ Browser.mouseX += Browser.mouseMovementX;
+ Browser.mouseY += Browser.mouseMovementY;
+ }
+ } else {
+ // Otherwise, calculate the movement based on the changes
+ // in the coordinates.
+ var rect = Module["canvas"].getBoundingClientRect();
+ var x, y;
+
+ // Neither .scrollX or .pageXOffset are defined in a spec, but
+ // we prefer .scrollX because it is currently in a spec draft.
+ // (see: http://www.w3.org/TR/2013/WD-cssom-view-20131217/)
+ var scrollX = ((typeof window.scrollX !== 'undefined') ? window.scrollX : window.pageXOffset);
+ var scrollY = ((typeof window.scrollY !== 'undefined') ? window.scrollY : window.pageYOffset);
+ if (event.type == 'touchstart' ||
+ event.type == 'touchend' ||
+ event.type == 'touchmove') {
+ var t = event.touches.item(0);
+ if (t) {
+ x = t.pageX - (scrollX + rect.left);
+ y = t.pageY - (scrollY + rect.top);
+ } else {
+ return;
+ }
+ } else {
+ x = event.pageX - (scrollX + rect.left);
+ y = event.pageY - (scrollY + rect.top);
+ }
+
+ // the canvas might be CSS-scaled compared to its backbuffer;
+ // SDL-using content will want mouse coordinates in terms
+ // of backbuffer units.
+ var cw = Module["canvas"].width;
+ var ch = Module["canvas"].height;
+ x = x * (cw / rect.width);
+ y = y * (ch / rect.height);
+
+ Browser.mouseMovementX = x - Browser.mouseX;
+ Browser.mouseMovementY = y - Browser.mouseY;
+ Browser.mouseX = x;
+ Browser.mouseY = y;
+ }
+ },xhrLoad:function (url, onload, onerror) {
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, true);
+ xhr.responseType = 'arraybuffer';
+ xhr.onload = function xhr_onload() {
+ if (xhr.status == 200 || (xhr.status == 0 && xhr.response)) { // file URLs can return 0
+ onload(xhr.response);
+ } else {
+ onerror();
+ }
+ };
+ xhr.onerror = onerror;
+ xhr.send(null);
+ },asyncLoad:function (url, onload, onerror, noRunDep) {
+ Browser.xhrLoad(url, function(arrayBuffer) {
+ assert(arrayBuffer, 'Loading data file "' + url + '" failed (no arrayBuffer).');
+ onload(new Uint8Array(arrayBuffer));
+ if (!noRunDep) removeRunDependency('al ' + url);
+ }, function(event) {
+ if (onerror) {
+ onerror();
+ } else {
+ throw 'Loading data file "' + url + '" failed.';
+ }
+ });
+ if (!noRunDep) addRunDependency('al ' + url);
+ },resizeListeners:[],updateResizeListeners:function () {
+ var canvas = Module['canvas'];
+ Browser.resizeListeners.forEach(function(listener) {
+ listener(canvas.width, canvas.height);
+ });
+ },setCanvasSize:function (width, height, noUpdates) {
+ var canvas = Module['canvas'];
+ Browser.updateCanvasDimensions(canvas, width, height);
+ if (!noUpdates) Browser.updateResizeListeners();
+ },windowedWidth:0,windowedHeight:0,setFullScreenCanvasSize:function () {
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
+ flags = flags | 0x00800000; // set SDL_FULLSCREEN flag
+ HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
+ }
+ Browser.updateResizeListeners();
+ },setWindowedCanvasSize:function () {
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
+ flags = flags & ~0x00800000; // clear SDL_FULLSCREEN flag
+ HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
+ }
+ Browser.updateResizeListeners();
+ },updateCanvasDimensions:function (canvas, wNative, hNative) {
+ if (wNative && hNative) {
+ canvas.widthNative = wNative;
+ canvas.heightNative = hNative;
+ } else {
+ wNative = canvas.widthNative;
+ hNative = canvas.heightNative;
+ }
+ var w = wNative;
+ var h = hNative;
+ if (Module['forcedAspectRatio'] && Module['forcedAspectRatio'] > 0) {
+ if (w/h < Module['forcedAspectRatio']) {
+ w = Math.round(h * Module['forcedAspectRatio']);
+ } else {
+ h = Math.round(w / Module['forcedAspectRatio']);
+ }
+ }
+ if (((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
+ document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
+ document['fullScreenElement'] || document['fullscreenElement'] ||
+ document['msFullScreenElement'] || document['msFullscreenElement'] ||
+ document['webkitCurrentFullScreenElement']) === canvas.parentNode) && (typeof screen != 'undefined')) {
+ var factor = Math.min(screen.width / w, screen.height / h);
+ w = Math.round(w * factor);
+ h = Math.round(h * factor);
+ }
+ if (Browser.resizeCanvas) {
+ if (canvas.width != w) canvas.width = w;
+ if (canvas.height != h) canvas.height = h;
+ if (typeof canvas.style != 'undefined') {
+ canvas.style.removeProperty( "width");
+ canvas.style.removeProperty("height");
+ }
+ } else {
+ if (canvas.width != wNative) canvas.width = wNative;
+ if (canvas.height != hNative) canvas.height = hNative;
+ if (typeof canvas.style != 'undefined') {
+ if (w != wNative || h != hNative) {
+ canvas.style.setProperty( "width", w + "px", "important");
+ canvas.style.setProperty("height", h + "px", "important");
+ } else {
+ canvas.style.removeProperty( "width");
+ canvas.style.removeProperty("height");
+ }
+ }
+ }
+ }};
+
+ function _time(ptr) {
+ var ret = Math.floor(Date.now()/1000);
+ if (ptr) {
+ HEAP32[((ptr)>>2)]=ret;
+ }
+ return ret;
+ }
+
+
+
+ function _emscripten_memcpy_big(dest, src, num) {
+ HEAPU8.set(HEAPU8.subarray(src, src+num), dest);
+ return dest;
+ }
+ Module["_memcpy"] = _memcpy;
+FS.staticInit();__ATINIT__.unshift({ func: function() { if (!Module["noFSInit"] && !FS.init.initialized) FS.init() } });__ATMAIN__.push({ func: function() { FS.ignorePermissions = false } });__ATEXIT__.push({ func: function() { FS.quit() } });Module["FS_createFolder"] = FS.createFolder;Module["FS_createPath"] = FS.createPath;Module["FS_createDataFile"] = FS.createDataFile;Module["FS_createPreloadedFile"] = FS.createPreloadedFile;Module["FS_createLazyFile"] = FS.createLazyFile;Module["FS_createLink"] = FS.createLink;Module["FS_createDevice"] = FS.createDevice;
+___errno_state = Runtime.staticAlloc(4); HEAP32[((___errno_state)>>2)]=0;
+__ATINIT__.unshift({ func: function() { TTY.init() } });__ATEXIT__.push({ func: function() { TTY.shutdown() } });TTY.utf8 = new Runtime.UTF8Processor();
+if (ENVIRONMENT_IS_NODE) { var fs = require("fs"); NODEFS.staticInit(); }
+__ATINIT__.push({ func: function() { SOCKFS.root = FS.mount(SOCKFS, {}, null); } });
+Module["requestFullScreen"] = function Module_requestFullScreen(lockPointer, resizeCanvas) { Browser.requestFullScreen(lockPointer, resizeCanvas) };
+ Module["requestAnimationFrame"] = function Module_requestAnimationFrame(func) { Browser.requestAnimationFrame(func) };
+ Module["setCanvasSize"] = function Module_setCanvasSize(width, height, noUpdates) { Browser.setCanvasSize(width, height, noUpdates) };
+ Module["pauseMainLoop"] = function Module_pauseMainLoop() { Browser.mainLoop.pause() };
+ Module["resumeMainLoop"] = function Module_resumeMainLoop() { Browser.mainLoop.resume() };
+ Module["getUserMedia"] = function Module_getUserMedia() { Browser.getUserMedia() }
+STACK_BASE = STACKTOP = Runtime.alignMemory(STATICTOP);
+
+staticSealed = true; // seal the static portion of memory
+
+STACK_MAX = STACK_BASE + 5242880;
+
+DYNAMIC_BASE = DYNAMICTOP = Runtime.alignMemory(STACK_MAX);
+
+assert(DYNAMIC_BASE < TOTAL_MEMORY, "TOTAL_MEMORY not big enough for stack");
+
+
+var Math_min = Math.min;
+function asmPrintInt(x, y) {
+ Module.print('int ' + x + ',' + y);// + ' ' + new Error().stack);
+}
+function asmPrintFloat(x, y) {
+ Module.print('float ' + x + ',' + y);// + ' ' + new Error().stack);
+}
+// EMSCRIPTEN_START_ASM
+var asm = Wasm.instantiateModuleFromAsm((function Module(global, env, buffer) {
+ 'use asm';
+ var HEAP8 = new global.Int8Array(buffer);
+ var HEAP16 = new global.Int16Array(buffer);
+ var HEAP32 = new global.Int32Array(buffer);
+ var HEAPU8 = new global.Uint8Array(buffer);
+ var HEAPU16 = new global.Uint16Array(buffer);
+ var HEAPU32 = new global.Uint32Array(buffer);
+ var HEAPF32 = new global.Float32Array(buffer);
+ var HEAPF64 = new global.Float64Array(buffer);
+
+ var STACKTOP=env.STACKTOP|0;
+ var STACK_MAX=env.STACK_MAX|0;
+ var tempDoublePtr=env.tempDoublePtr|0;
+ var ABORT=env.ABORT|0;
+
+ var __THREW__ = 0;
+ var threwValue = 0;
+ var setjmpId = 0;
+ var undef = 0;
+ var nan = +env.NaN, inf = +env.Infinity;
+ var tempInt = 0, tempBigInt = 0, tempBigIntP = 0, tempBigIntS = 0, tempBigIntR = 0.0, tempBigIntI = 0, tempBigIntD = 0, tempValue = 0, tempDouble = 0.0;
+
+ var tempRet0 = 0;
+ var tempRet1 = 0;
+ var tempRet2 = 0;
+ var tempRet3 = 0;
+ var tempRet4 = 0;
+ var tempRet5 = 0;
+ var tempRet6 = 0;
+ var tempRet7 = 0;
+ var tempRet8 = 0;
+ var tempRet9 = 0;
+ var Math_floor=global.Math.floor;
+ var Math_abs=global.Math.abs;
+ var Math_sqrt=global.Math.sqrt;
+ var Math_pow=global.Math.pow;
+ var Math_cos=global.Math.cos;
+ var Math_sin=global.Math.sin;
+ var Math_tan=global.Math.tan;
+ var Math_acos=global.Math.acos;
+ var Math_asin=global.Math.asin;
+ var Math_atan=global.Math.atan;
+ var Math_atan2=global.Math.atan2;
+ var Math_exp=global.Math.exp;
+ var Math_log=global.Math.log;
+ var Math_ceil=global.Math.ceil;
+ var Math_imul=global.Math.imul;
+ var abort=env.abort;
+ var assert=env.assert;
+ var asmPrintInt=env.asmPrintInt;
+ var asmPrintFloat=env.asmPrintFloat;
+ var Math_min=env.min;
+ var _fflush=env._fflush;
+ var _emscripten_memcpy_big=env._emscripten_memcpy_big;
+ var _printf=env._printf;
+ var _send=env._send;
+ var _pwrite=env._pwrite;
+ var _abort=env._abort;
+ var ___setErrNo=env.___setErrNo;
+ var _fwrite=env._fwrite;
+ var _sbrk=env._sbrk;
+ var _time=env._time;
+ var _mkport=env._mkport;
+ var __reallyNegative=env.__reallyNegative;
+ var __formatString=env.__formatString;
+ var _fileno=env._fileno;
+ var _write=env._write;
+ var _fprintf=env._fprintf;
+ var _sysconf=env._sysconf;
+ var ___errno_location=env.___errno_location;
+ var tempFloat = 0.0;
+
+// EMSCRIPTEN_START_FUNCS
+function _malloc(i12) {
+ i12 = i12 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0, i30 = 0, i31 = 0, i32 = 0;
+ i1 = STACKTOP;
+ do {
+ if (i12 >>> 0 < 245) {
+ if (i12 >>> 0 < 11) {
+ i12 = 16;
+ } else {
+ i12 = i12 + 11 & -8;
+ }
+ i20 = i12 >>> 3;
+ i18 = HEAP32[10] | 0;
+ i21 = i18 >>> i20;
+ if ((i21 & 3 | 0) != 0) {
+ i6 = (i21 & 1 ^ 1) + i20 | 0;
+ i5 = i6 << 1;
+ i3 = 80 + (i5 << 2) | 0;
+ i5 = 80 + (i5 + 2 << 2) | 0;
+ i7 = HEAP32[i5 >> 2] | 0;
+ i2 = i7 + 8 | 0;
+ i4 = HEAP32[i2 >> 2] | 0;
+ do {
+ if ((i3 | 0) != (i4 | 0)) {
+ if (i4 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i8 = i4 + 12 | 0;
+ if ((HEAP32[i8 >> 2] | 0) == (i7 | 0)) {
+ HEAP32[i8 >> 2] = i3;
+ HEAP32[i5 >> 2] = i4;
+ break;
+ } else {
+ _abort();
+ }
+ } else {
+ HEAP32[10] = i18 & ~(1 << i6);
+ }
+ } while (0);
+ i32 = i6 << 3;
+ HEAP32[i7 + 4 >> 2] = i32 | 3;
+ i32 = i7 + (i32 | 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ i32 = i2;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ if (i12 >>> 0 > (HEAP32[48 >> 2] | 0) >>> 0) {
+ if ((i21 | 0) != 0) {
+ i7 = 2 << i20;
+ i7 = i21 << i20 & (i7 | 0 - i7);
+ i7 = (i7 & 0 - i7) + -1 | 0;
+ i2 = i7 >>> 12 & 16;
+ i7 = i7 >>> i2;
+ i6 = i7 >>> 5 & 8;
+ i7 = i7 >>> i6;
+ i5 = i7 >>> 2 & 4;
+ i7 = i7 >>> i5;
+ i4 = i7 >>> 1 & 2;
+ i7 = i7 >>> i4;
+ i3 = i7 >>> 1 & 1;
+ i3 = (i6 | i2 | i5 | i4 | i3) + (i7 >>> i3) | 0;
+ i7 = i3 << 1;
+ i4 = 80 + (i7 << 2) | 0;
+ i7 = 80 + (i7 + 2 << 2) | 0;
+ i5 = HEAP32[i7 >> 2] | 0;
+ i2 = i5 + 8 | 0;
+ i6 = HEAP32[i2 >> 2] | 0;
+ do {
+ if ((i4 | 0) != (i6 | 0)) {
+ if (i6 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i8 = i6 + 12 | 0;
+ if ((HEAP32[i8 >> 2] | 0) == (i5 | 0)) {
+ HEAP32[i8 >> 2] = i4;
+ HEAP32[i7 >> 2] = i6;
+ break;
+ } else {
+ _abort();
+ }
+ } else {
+ HEAP32[10] = i18 & ~(1 << i3);
+ }
+ } while (0);
+ i6 = i3 << 3;
+ i4 = i6 - i12 | 0;
+ HEAP32[i5 + 4 >> 2] = i12 | 3;
+ i3 = i5 + i12 | 0;
+ HEAP32[i5 + (i12 | 4) >> 2] = i4 | 1;
+ HEAP32[i5 + i6 >> 2] = i4;
+ i6 = HEAP32[48 >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ i5 = HEAP32[60 >> 2] | 0;
+ i8 = i6 >>> 3;
+ i9 = i8 << 1;
+ i6 = 80 + (i9 << 2) | 0;
+ i7 = HEAP32[10] | 0;
+ i8 = 1 << i8;
+ if ((i7 & i8 | 0) != 0) {
+ i7 = 80 + (i9 + 2 << 2) | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ if (i8 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i28 = i7;
+ i27 = i8;
+ }
+ } else {
+ HEAP32[10] = i7 | i8;
+ i28 = 80 + (i9 + 2 << 2) | 0;
+ i27 = i6;
+ }
+ HEAP32[i28 >> 2] = i5;
+ HEAP32[i27 + 12 >> 2] = i5;
+ HEAP32[i5 + 8 >> 2] = i27;
+ HEAP32[i5 + 12 >> 2] = i6;
+ }
+ HEAP32[48 >> 2] = i4;
+ HEAP32[60 >> 2] = i3;
+ i32 = i2;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i18 = HEAP32[44 >> 2] | 0;
+ if ((i18 | 0) != 0) {
+ i2 = (i18 & 0 - i18) + -1 | 0;
+ i31 = i2 >>> 12 & 16;
+ i2 = i2 >>> i31;
+ i30 = i2 >>> 5 & 8;
+ i2 = i2 >>> i30;
+ i32 = i2 >>> 2 & 4;
+ i2 = i2 >>> i32;
+ i6 = i2 >>> 1 & 2;
+ i2 = i2 >>> i6;
+ i3 = i2 >>> 1 & 1;
+ i3 = HEAP32[344 + ((i30 | i31 | i32 | i6 | i3) + (i2 >>> i3) << 2) >> 2] | 0;
+ i2 = (HEAP32[i3 + 4 >> 2] & -8) - i12 | 0;
+ i6 = i3;
+ while (1) {
+ i5 = HEAP32[i6 + 16 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ i5 = HEAP32[i6 + 20 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ }
+ i6 = (HEAP32[i5 + 4 >> 2] & -8) - i12 | 0;
+ i4 = i6 >>> 0 < i2 >>> 0;
+ i2 = i4 ? i6 : i2;
+ i6 = i5;
+ i3 = i4 ? i5 : i3;
+ }
+ i6 = HEAP32[56 >> 2] | 0;
+ if (i3 >>> 0 < i6 >>> 0) {
+ _abort();
+ }
+ i4 = i3 + i12 | 0;
+ if (!(i3 >>> 0 < i4 >>> 0)) {
+ _abort();
+ }
+ i5 = HEAP32[i3 + 24 >> 2] | 0;
+ i7 = HEAP32[i3 + 12 >> 2] | 0;
+ do {
+ if ((i7 | 0) == (i3 | 0)) {
+ i8 = i3 + 20 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ if ((i7 | 0) == 0) {
+ i8 = i3 + 16 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ if ((i7 | 0) == 0) {
+ i26 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i10 = i7 + 20 | 0;
+ i9 = HEAP32[i10 >> 2] | 0;
+ if ((i9 | 0) != 0) {
+ i7 = i9;
+ i8 = i10;
+ continue;
+ }
+ i10 = i7 + 16 | 0;
+ i9 = HEAP32[i10 >> 2] | 0;
+ if ((i9 | 0) == 0) {
+ break;
+ } else {
+ i7 = i9;
+ i8 = i10;
+ }
+ }
+ if (i8 >>> 0 < i6 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i8 >> 2] = 0;
+ i26 = i7;
+ break;
+ }
+ } else {
+ i8 = HEAP32[i3 + 8 >> 2] | 0;
+ if (i8 >>> 0 < i6 >>> 0) {
+ _abort();
+ }
+ i6 = i8 + 12 | 0;
+ if ((HEAP32[i6 >> 2] | 0) != (i3 | 0)) {
+ _abort();
+ }
+ i9 = i7 + 8 | 0;
+ if ((HEAP32[i9 >> 2] | 0) == (i3 | 0)) {
+ HEAP32[i6 >> 2] = i7;
+ HEAP32[i9 >> 2] = i8;
+ i26 = i7;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ do {
+ if ((i5 | 0) != 0) {
+ i7 = HEAP32[i3 + 28 >> 2] | 0;
+ i6 = 344 + (i7 << 2) | 0;
+ if ((i3 | 0) == (HEAP32[i6 >> 2] | 0)) {
+ HEAP32[i6 >> 2] = i26;
+ if ((i26 | 0) == 0) {
+ HEAP32[44 >> 2] = HEAP32[44 >> 2] & ~(1 << i7);
+ break;
+ }
+ } else {
+ if (i5 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i6 = i5 + 16 | 0;
+ if ((HEAP32[i6 >> 2] | 0) == (i3 | 0)) {
+ HEAP32[i6 >> 2] = i26;
+ } else {
+ HEAP32[i5 + 20 >> 2] = i26;
+ }
+ if ((i26 | 0) == 0) {
+ break;
+ }
+ }
+ if (i26 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i26 + 24 >> 2] = i5;
+ i5 = HEAP32[i3 + 16 >> 2] | 0;
+ do {
+ if ((i5 | 0) != 0) {
+ if (i5 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i26 + 16 >> 2] = i5;
+ HEAP32[i5 + 24 >> 2] = i26;
+ break;
+ }
+ }
+ } while (0);
+ i5 = HEAP32[i3 + 20 >> 2] | 0;
+ if ((i5 | 0) != 0) {
+ if (i5 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i26 + 20 >> 2] = i5;
+ HEAP32[i5 + 24 >> 2] = i26;
+ break;
+ }
+ }
+ }
+ } while (0);
+ if (i2 >>> 0 < 16) {
+ i32 = i2 + i12 | 0;
+ HEAP32[i3 + 4 >> 2] = i32 | 3;
+ i32 = i3 + (i32 + 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ } else {
+ HEAP32[i3 + 4 >> 2] = i12 | 3;
+ HEAP32[i3 + (i12 | 4) >> 2] = i2 | 1;
+ HEAP32[i3 + (i2 + i12) >> 2] = i2;
+ i6 = HEAP32[48 >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ i5 = HEAP32[60 >> 2] | 0;
+ i8 = i6 >>> 3;
+ i9 = i8 << 1;
+ i6 = 80 + (i9 << 2) | 0;
+ i7 = HEAP32[10] | 0;
+ i8 = 1 << i8;
+ if ((i7 & i8 | 0) != 0) {
+ i7 = 80 + (i9 + 2 << 2) | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ if (i8 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i25 = i7;
+ i24 = i8;
+ }
+ } else {
+ HEAP32[10] = i7 | i8;
+ i25 = 80 + (i9 + 2 << 2) | 0;
+ i24 = i6;
+ }
+ HEAP32[i25 >> 2] = i5;
+ HEAP32[i24 + 12 >> 2] = i5;
+ HEAP32[i5 + 8 >> 2] = i24;
+ HEAP32[i5 + 12 >> 2] = i6;
+ }
+ HEAP32[48 >> 2] = i2;
+ HEAP32[60 >> 2] = i4;
+ }
+ i32 = i3 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ }
+ } else {
+ if (!(i12 >>> 0 > 4294967231)) {
+ i24 = i12 + 11 | 0;
+ i12 = i24 & -8;
+ i26 = HEAP32[44 >> 2] | 0;
+ if ((i26 | 0) != 0) {
+ i25 = 0 - i12 | 0;
+ i24 = i24 >>> 8;
+ if ((i24 | 0) != 0) {
+ if (i12 >>> 0 > 16777215) {
+ i27 = 31;
+ } else {
+ i31 = (i24 + 1048320 | 0) >>> 16 & 8;
+ i32 = i24 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i27 = (i32 + 245760 | 0) >>> 16 & 2;
+ i27 = 14 - (i30 | i31 | i27) + (i32 << i27 >>> 15) | 0;
+ i27 = i12 >>> (i27 + 7 | 0) & 1 | i27 << 1;
+ }
+ } else {
+ i27 = 0;
+ }
+ i30 = HEAP32[344 + (i27 << 2) >> 2] | 0;
+ L126 : do {
+ if ((i30 | 0) == 0) {
+ i29 = 0;
+ i24 = 0;
+ } else {
+ if ((i27 | 0) == 31) {
+ i24 = 0;
+ } else {
+ i24 = 25 - (i27 >>> 1) | 0;
+ }
+ i29 = 0;
+ i28 = i12 << i24;
+ i24 = 0;
+ while (1) {
+ i32 = HEAP32[i30 + 4 >> 2] & -8;
+ i31 = i32 - i12 | 0;
+ if (i31 >>> 0 < i25 >>> 0) {
+ if ((i32 | 0) == (i12 | 0)) {
+ i25 = i31;
+ i29 = i30;
+ i24 = i30;
+ break L126;
+ } else {
+ i25 = i31;
+ i24 = i30;
+ }
+ }
+ i31 = HEAP32[i30 + 20 >> 2] | 0;
+ i30 = HEAP32[i30 + (i28 >>> 31 << 2) + 16 >> 2] | 0;
+ i29 = (i31 | 0) == 0 | (i31 | 0) == (i30 | 0) ? i29 : i31;
+ if ((i30 | 0) == 0) {
+ break;
+ } else {
+ i28 = i28 << 1;
+ }
+ }
+ }
+ } while (0);
+ if ((i29 | 0) == 0 & (i24 | 0) == 0) {
+ i32 = 2 << i27;
+ i26 = i26 & (i32 | 0 - i32);
+ if ((i26 | 0) == 0) {
+ break;
+ }
+ i32 = (i26 & 0 - i26) + -1 | 0;
+ i28 = i32 >>> 12 & 16;
+ i32 = i32 >>> i28;
+ i27 = i32 >>> 5 & 8;
+ i32 = i32 >>> i27;
+ i30 = i32 >>> 2 & 4;
+ i32 = i32 >>> i30;
+ i31 = i32 >>> 1 & 2;
+ i32 = i32 >>> i31;
+ i29 = i32 >>> 1 & 1;
+ i29 = HEAP32[344 + ((i27 | i28 | i30 | i31 | i29) + (i32 >>> i29) << 2) >> 2] | 0;
+ }
+ if ((i29 | 0) != 0) {
+ while (1) {
+ i27 = (HEAP32[i29 + 4 >> 2] & -8) - i12 | 0;
+ i26 = i27 >>> 0 < i25 >>> 0;
+ i25 = i26 ? i27 : i25;
+ i24 = i26 ? i29 : i24;
+ i26 = HEAP32[i29 + 16 >> 2] | 0;
+ if ((i26 | 0) != 0) {
+ i29 = i26;
+ continue;
+ }
+ i29 = HEAP32[i29 + 20 >> 2] | 0;
+ if ((i29 | 0) == 0) {
+ break;
+ }
+ }
+ }
+ if ((i24 | 0) != 0 ? i25 >>> 0 < ((HEAP32[48 >> 2] | 0) - i12 | 0) >>> 0 : 0) {
+ i4 = HEAP32[56 >> 2] | 0;
+ if (i24 >>> 0 < i4 >>> 0) {
+ _abort();
+ }
+ i2 = i24 + i12 | 0;
+ if (!(i24 >>> 0 < i2 >>> 0)) {
+ _abort();
+ }
+ i3 = HEAP32[i24 + 24 >> 2] | 0;
+ i6 = HEAP32[i24 + 12 >> 2] | 0;
+ do {
+ if ((i6 | 0) == (i24 | 0)) {
+ i6 = i24 + 20 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ i6 = i24 + 16 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ i22 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i8 = i5 + 20 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ if ((i7 | 0) != 0) {
+ i5 = i7;
+ i6 = i8;
+ continue;
+ }
+ i7 = i5 + 16 | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ if ((i8 | 0) == 0) {
+ break;
+ } else {
+ i5 = i8;
+ i6 = i7;
+ }
+ }
+ if (i6 >>> 0 < i4 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i6 >> 2] = 0;
+ i22 = i5;
+ break;
+ }
+ } else {
+ i5 = HEAP32[i24 + 8 >> 2] | 0;
+ if (i5 >>> 0 < i4 >>> 0) {
+ _abort();
+ }
+ i7 = i5 + 12 | 0;
+ if ((HEAP32[i7 >> 2] | 0) != (i24 | 0)) {
+ _abort();
+ }
+ i4 = i6 + 8 | 0;
+ if ((HEAP32[i4 >> 2] | 0) == (i24 | 0)) {
+ HEAP32[i7 >> 2] = i6;
+ HEAP32[i4 >> 2] = i5;
+ i22 = i6;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ do {
+ if ((i3 | 0) != 0) {
+ i4 = HEAP32[i24 + 28 >> 2] | 0;
+ i5 = 344 + (i4 << 2) | 0;
+ if ((i24 | 0) == (HEAP32[i5 >> 2] | 0)) {
+ HEAP32[i5 >> 2] = i22;
+ if ((i22 | 0) == 0) {
+ HEAP32[44 >> 2] = HEAP32[44 >> 2] & ~(1 << i4);
+ break;
+ }
+ } else {
+ if (i3 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i4 = i3 + 16 | 0;
+ if ((HEAP32[i4 >> 2] | 0) == (i24 | 0)) {
+ HEAP32[i4 >> 2] = i22;
+ } else {
+ HEAP32[i3 + 20 >> 2] = i22;
+ }
+ if ((i22 | 0) == 0) {
+ break;
+ }
+ }
+ if (i22 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i22 + 24 >> 2] = i3;
+ i3 = HEAP32[i24 + 16 >> 2] | 0;
+ do {
+ if ((i3 | 0) != 0) {
+ if (i3 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i22 + 16 >> 2] = i3;
+ HEAP32[i3 + 24 >> 2] = i22;
+ break;
+ }
+ }
+ } while (0);
+ i3 = HEAP32[i24 + 20 >> 2] | 0;
+ if ((i3 | 0) != 0) {
+ if (i3 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i22 + 20 >> 2] = i3;
+ HEAP32[i3 + 24 >> 2] = i22;
+ break;
+ }
+ }
+ }
+ } while (0);
+ L204 : do {
+ if (!(i25 >>> 0 < 16)) {
+ HEAP32[i24 + 4 >> 2] = i12 | 3;
+ HEAP32[i24 + (i12 | 4) >> 2] = i25 | 1;
+ HEAP32[i24 + (i25 + i12) >> 2] = i25;
+ i4 = i25 >>> 3;
+ if (i25 >>> 0 < 256) {
+ i6 = i4 << 1;
+ i3 = 80 + (i6 << 2) | 0;
+ i5 = HEAP32[10] | 0;
+ i4 = 1 << i4;
+ if ((i5 & i4 | 0) != 0) {
+ i5 = 80 + (i6 + 2 << 2) | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ if (i4 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i21 = i5;
+ i20 = i4;
+ }
+ } else {
+ HEAP32[10] = i5 | i4;
+ i21 = 80 + (i6 + 2 << 2) | 0;
+ i20 = i3;
+ }
+ HEAP32[i21 >> 2] = i2;
+ HEAP32[i20 + 12 >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i20;
+ HEAP32[i24 + (i12 + 12) >> 2] = i3;
+ break;
+ }
+ i3 = i25 >>> 8;
+ if ((i3 | 0) != 0) {
+ if (i25 >>> 0 > 16777215) {
+ i3 = 31;
+ } else {
+ i31 = (i3 + 1048320 | 0) >>> 16 & 8;
+ i32 = i3 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i3 = (i32 + 245760 | 0) >>> 16 & 2;
+ i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
+ i3 = i25 >>> (i3 + 7 | 0) & 1 | i3 << 1;
+ }
+ } else {
+ i3 = 0;
+ }
+ i6 = 344 + (i3 << 2) | 0;
+ HEAP32[i24 + (i12 + 28) >> 2] = i3;
+ HEAP32[i24 + (i12 + 20) >> 2] = 0;
+ HEAP32[i24 + (i12 + 16) >> 2] = 0;
+ i4 = HEAP32[44 >> 2] | 0;
+ i5 = 1 << i3;
+ if ((i4 & i5 | 0) == 0) {
+ HEAP32[44 >> 2] = i4 | i5;
+ HEAP32[i6 >> 2] = i2;
+ HEAP32[i24 + (i12 + 24) >> 2] = i6;
+ HEAP32[i24 + (i12 + 12) >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i2;
+ break;
+ }
+ i4 = HEAP32[i6 >> 2] | 0;
+ if ((i3 | 0) == 31) {
+ i3 = 0;
+ } else {
+ i3 = 25 - (i3 >>> 1) | 0;
+ }
+ L225 : do {
+ if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i25 | 0)) {
+ i3 = i25 << i3;
+ while (1) {
+ i6 = i4 + (i3 >>> 31 << 2) + 16 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) == (i25 | 0)) {
+ i18 = i5;
+ break L225;
+ } else {
+ i3 = i3 << 1;
+ i4 = i5;
+ }
+ }
+ if (i6 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i6 >> 2] = i2;
+ HEAP32[i24 + (i12 + 24) >> 2] = i4;
+ HEAP32[i24 + (i12 + 12) >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i2;
+ break L204;
+ }
+ } else {
+ i18 = i4;
+ }
+ } while (0);
+ i4 = i18 + 8 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ i5 = HEAP32[56 >> 2] | 0;
+ if (i18 >>> 0 < i5 >>> 0) {
+ _abort();
+ }
+ if (i3 >>> 0 < i5 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i3 + 12 >> 2] = i2;
+ HEAP32[i4 >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i3;
+ HEAP32[i24 + (i12 + 12) >> 2] = i18;
+ HEAP32[i24 + (i12 + 24) >> 2] = 0;
+ break;
+ }
+ } else {
+ i32 = i25 + i12 | 0;
+ HEAP32[i24 + 4 >> 2] = i32 | 3;
+ i32 = i24 + (i32 + 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ }
+ } while (0);
+ i32 = i24 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ }
+ } else {
+ i12 = -1;
+ }
+ }
+ } while (0);
+ i18 = HEAP32[48 >> 2] | 0;
+ if (!(i12 >>> 0 > i18 >>> 0)) {
+ i3 = i18 - i12 | 0;
+ i2 = HEAP32[60 >> 2] | 0;
+ if (i3 >>> 0 > 15) {
+ HEAP32[60 >> 2] = i2 + i12;
+ HEAP32[48 >> 2] = i3;
+ HEAP32[i2 + (i12 + 4) >> 2] = i3 | 1;
+ HEAP32[i2 + i18 >> 2] = i3;
+ HEAP32[i2 + 4 >> 2] = i12 | 3;
+ } else {
+ HEAP32[48 >> 2] = 0;
+ HEAP32[60 >> 2] = 0;
+ HEAP32[i2 + 4 >> 2] = i18 | 3;
+ i32 = i2 + (i18 + 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ }
+ i32 = i2 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i18 = HEAP32[52 >> 2] | 0;
+ if (i12 >>> 0 < i18 >>> 0) {
+ i31 = i18 - i12 | 0;
+ HEAP32[52 >> 2] = i31;
+ i32 = HEAP32[64 >> 2] | 0;
+ HEAP32[64 >> 2] = i32 + i12;
+ HEAP32[i32 + (i12 + 4) >> 2] = i31 | 1;
+ HEAP32[i32 + 4 >> 2] = i12 | 3;
+ i32 = i32 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ do {
+ if ((HEAP32[128] | 0) == 0) {
+ i18 = _sysconf(30) | 0;
+ if ((i18 + -1 & i18 | 0) == 0) {
+ HEAP32[520 >> 2] = i18;
+ HEAP32[516 >> 2] = i18;
+ HEAP32[524 >> 2] = -1;
+ HEAP32[528 >> 2] = -1;
+ HEAP32[532 >> 2] = 0;
+ HEAP32[484 >> 2] = 0;
+ HEAP32[128] = (_time(0) | 0) & -16 ^ 1431655768;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ i20 = i12 + 48 | 0;
+ i25 = HEAP32[520 >> 2] | 0;
+ i21 = i12 + 47 | 0;
+ i22 = i25 + i21 | 0;
+ i25 = 0 - i25 | 0;
+ i18 = i22 & i25;
+ if (!(i18 >>> 0 > i12 >>> 0)) {
+ i32 = 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i24 = HEAP32[480 >> 2] | 0;
+ if ((i24 | 0) != 0 ? (i31 = HEAP32[472 >> 2] | 0, i32 = i31 + i18 | 0, i32 >>> 0 <= i31 >>> 0 | i32 >>> 0 > i24 >>> 0) : 0) {
+ i32 = 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ L269 : do {
+ if ((HEAP32[484 >> 2] & 4 | 0) == 0) {
+ i26 = HEAP32[64 >> 2] | 0;
+ L271 : do {
+ if ((i26 | 0) != 0) {
+ i24 = 488 | 0;
+ while (1) {
+ i27 = HEAP32[i24 >> 2] | 0;
+ if (!(i27 >>> 0 > i26 >>> 0) ? (i23 = i24 + 4 | 0, (i27 + (HEAP32[i23 >> 2] | 0) | 0) >>> 0 > i26 >>> 0) : 0) {
+ break;
+ }
+ i24 = HEAP32[i24 + 8 >> 2] | 0;
+ if ((i24 | 0) == 0) {
+ i13 = 182;
+ break L271;
+ }
+ }
+ if ((i24 | 0) != 0) {
+ i25 = i22 - (HEAP32[52 >> 2] | 0) & i25;
+ if (i25 >>> 0 < 2147483647) {
+ i13 = _sbrk(i25 | 0) | 0;
+ i26 = (i13 | 0) == ((HEAP32[i24 >> 2] | 0) + (HEAP32[i23 >> 2] | 0) | 0);
+ i22 = i13;
+ i24 = i25;
+ i23 = i26 ? i13 : -1;
+ i25 = i26 ? i25 : 0;
+ i13 = 191;
+ } else {
+ i25 = 0;
+ }
+ } else {
+ i13 = 182;
+ }
+ } else {
+ i13 = 182;
+ }
+ } while (0);
+ do {
+ if ((i13 | 0) == 182) {
+ i23 = _sbrk(0) | 0;
+ if ((i23 | 0) != (-1 | 0)) {
+ i24 = i23;
+ i22 = HEAP32[516 >> 2] | 0;
+ i25 = i22 + -1 | 0;
+ if ((i25 & i24 | 0) == 0) {
+ i25 = i18;
+ } else {
+ i25 = i18 - i24 + (i25 + i24 & 0 - i22) | 0;
+ }
+ i24 = HEAP32[472 >> 2] | 0;
+ i26 = i24 + i25 | 0;
+ if (i25 >>> 0 > i12 >>> 0 & i25 >>> 0 < 2147483647) {
+ i22 = HEAP32[480 >> 2] | 0;
+ if ((i22 | 0) != 0 ? i26 >>> 0 <= i24 >>> 0 | i26 >>> 0 > i22 >>> 0 : 0) {
+ i25 = 0;
+ break;
+ }
+ i22 = _sbrk(i25 | 0) | 0;
+ i13 = (i22 | 0) == (i23 | 0);
+ i24 = i25;
+ i23 = i13 ? i23 : -1;
+ i25 = i13 ? i25 : 0;
+ i13 = 191;
+ } else {
+ i25 = 0;
+ }
+ } else {
+ i25 = 0;
+ }
+ }
+ } while (0);
+ L291 : do {
+ if ((i13 | 0) == 191) {
+ i13 = 0 - i24 | 0;
+ if ((i23 | 0) != (-1 | 0)) {
+ i17 = i23;
+ i14 = i25;
+ i13 = 202;
+ break L269;
+ }
+ do {
+ if ((i22 | 0) != (-1 | 0) & i24 >>> 0 < 2147483647 & i24 >>> 0 < i20 >>> 0 ? (i19 = HEAP32[520 >> 2] | 0, i19 = i21 - i24 + i19 & 0 - i19, i19 >>> 0 < 2147483647) : 0) {
+ if ((_sbrk(i19 | 0) | 0) == (-1 | 0)) {
+ _sbrk(i13 | 0) | 0;
+ break L291;
+ } else {
+ i24 = i19 + i24 | 0;
+ break;
+ }
+ }
+ } while (0);
+ if ((i22 | 0) != (-1 | 0)) {
+ i17 = i22;
+ i14 = i24;
+ i13 = 202;
+ break L269;
+ }
+ }
+ } while (0);
+ HEAP32[484 >> 2] = HEAP32[484 >> 2] | 4;
+ i13 = 199;
+ } else {
+ i25 = 0;
+ i13 = 199;
+ }
+ } while (0);
+ if ((((i13 | 0) == 199 ? i18 >>> 0 < 2147483647 : 0) ? (i17 = _sbrk(i18 | 0) | 0, i16 = _sbrk(0) | 0, (i16 | 0) != (-1 | 0) & (i17 | 0) != (-1 | 0) & i17 >>> 0 < i16 >>> 0) : 0) ? (i15 = i16 - i17 | 0, i14 = i15 >>> 0 > (i12 + 40 | 0) >>> 0, i14) : 0) {
+ i14 = i14 ? i15 : i25;
+ i13 = 202;
+ }
+ if ((i13 | 0) == 202) {
+ i15 = (HEAP32[472 >> 2] | 0) + i14 | 0;
+ HEAP32[472 >> 2] = i15;
+ if (i15 >>> 0 > (HEAP32[476 >> 2] | 0) >>> 0) {
+ HEAP32[476 >> 2] = i15;
+ }
+ i15 = HEAP32[64 >> 2] | 0;
+ L311 : do {
+ if ((i15 | 0) != 0) {
+ i21 = 488 | 0;
+ while (1) {
+ i16 = HEAP32[i21 >> 2] | 0;
+ i19 = i21 + 4 | 0;
+ i20 = HEAP32[i19 >> 2] | 0;
+ if ((i17 | 0) == (i16 + i20 | 0)) {
+ i13 = 214;
+ break;
+ }
+ i18 = HEAP32[i21 + 8 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ break;
+ } else {
+ i21 = i18;
+ }
+ }
+ if (((i13 | 0) == 214 ? (HEAP32[i21 + 12 >> 2] & 8 | 0) == 0 : 0) ? i15 >>> 0 >= i16 >>> 0 & i15 >>> 0 < i17 >>> 0 : 0) {
+ HEAP32[i19 >> 2] = i20 + i14;
+ i2 = (HEAP32[52 >> 2] | 0) + i14 | 0;
+ i3 = i15 + 8 | 0;
+ if ((i3 & 7 | 0) == 0) {
+ i3 = 0;
+ } else {
+ i3 = 0 - i3 & 7;
+ }
+ i32 = i2 - i3 | 0;
+ HEAP32[64 >> 2] = i15 + i3;
+ HEAP32[52 >> 2] = i32;
+ HEAP32[i15 + (i3 + 4) >> 2] = i32 | 1;
+ HEAP32[i15 + (i2 + 4) >> 2] = 40;
+ HEAP32[68 >> 2] = HEAP32[528 >> 2];
+ break;
+ }
+ if (i17 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ HEAP32[56 >> 2] = i17;
+ }
+ i19 = i17 + i14 | 0;
+ i16 = 488 | 0;
+ while (1) {
+ if ((HEAP32[i16 >> 2] | 0) == (i19 | 0)) {
+ i13 = 224;
+ break;
+ }
+ i18 = HEAP32[i16 + 8 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ break;
+ } else {
+ i16 = i18;
+ }
+ }
+ if ((i13 | 0) == 224 ? (HEAP32[i16 + 12 >> 2] & 8 | 0) == 0 : 0) {
+ HEAP32[i16 >> 2] = i17;
+ i6 = i16 + 4 | 0;
+ HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + i14;
+ i6 = i17 + 8 | 0;
+ if ((i6 & 7 | 0) == 0) {
+ i6 = 0;
+ } else {
+ i6 = 0 - i6 & 7;
+ }
+ i7 = i17 + (i14 + 8) | 0;
+ if ((i7 & 7 | 0) == 0) {
+ i13 = 0;
+ } else {
+ i13 = 0 - i7 & 7;
+ }
+ i15 = i17 + (i13 + i14) | 0;
+ i8 = i6 + i12 | 0;
+ i7 = i17 + i8 | 0;
+ i10 = i15 - (i17 + i6) - i12 | 0;
+ HEAP32[i17 + (i6 + 4) >> 2] = i12 | 3;
+ L348 : do {
+ if ((i15 | 0) != (HEAP32[64 >> 2] | 0)) {
+ if ((i15 | 0) == (HEAP32[60 >> 2] | 0)) {
+ i32 = (HEAP32[48 >> 2] | 0) + i10 | 0;
+ HEAP32[48 >> 2] = i32;
+ HEAP32[60 >> 2] = i7;
+ HEAP32[i17 + (i8 + 4) >> 2] = i32 | 1;
+ HEAP32[i17 + (i32 + i8) >> 2] = i32;
+ break;
+ }
+ i12 = i14 + 4 | 0;
+ i18 = HEAP32[i17 + (i12 + i13) >> 2] | 0;
+ if ((i18 & 3 | 0) == 1) {
+ i11 = i18 & -8;
+ i16 = i18 >>> 3;
+ do {
+ if (!(i18 >>> 0 < 256)) {
+ i9 = HEAP32[i17 + ((i13 | 24) + i14) >> 2] | 0;
+ i19 = HEAP32[i17 + (i14 + 12 + i13) >> 2] | 0;
+ do {
+ if ((i19 | 0) == (i15 | 0)) {
+ i19 = i13 | 16;
+ i18 = i17 + (i12 + i19) | 0;
+ i16 = HEAP32[i18 >> 2] | 0;
+ if ((i16 | 0) == 0) {
+ i18 = i17 + (i19 + i14) | 0;
+ i16 = HEAP32[i18 >> 2] | 0;
+ if ((i16 | 0) == 0) {
+ i5 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i20 = i16 + 20 | 0;
+ i19 = HEAP32[i20 >> 2] | 0;
+ if ((i19 | 0) != 0) {
+ i16 = i19;
+ i18 = i20;
+ continue;
+ }
+ i19 = i16 + 16 | 0;
+ i20 = HEAP32[i19 >> 2] | 0;
+ if ((i20 | 0) == 0) {
+ break;
+ } else {
+ i16 = i20;
+ i18 = i19;
+ }
+ }
+ if (i18 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i18 >> 2] = 0;
+ i5 = i16;
+ break;
+ }
+ } else {
+ i18 = HEAP32[i17 + ((i13 | 8) + i14) >> 2] | 0;
+ if (i18 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i18 + 12 | 0;
+ if ((HEAP32[i16 >> 2] | 0) != (i15 | 0)) {
+ _abort();
+ }
+ i20 = i19 + 8 | 0;
+ if ((HEAP32[i20 >> 2] | 0) == (i15 | 0)) {
+ HEAP32[i16 >> 2] = i19;
+ HEAP32[i20 >> 2] = i18;
+ i5 = i19;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ if ((i9 | 0) != 0) {
+ i16 = HEAP32[i17 + (i14 + 28 + i13) >> 2] | 0;
+ i18 = 344 + (i16 << 2) | 0;
+ if ((i15 | 0) == (HEAP32[i18 >> 2] | 0)) {
+ HEAP32[i18 >> 2] = i5;
+ if ((i5 | 0) == 0) {
+ HEAP32[44 >> 2] = HEAP32[44 >> 2] & ~(1 << i16);
+ break;
+ }
+ } else {
+ if (i9 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i9 + 16 | 0;
+ if ((HEAP32[i16 >> 2] | 0) == (i15 | 0)) {
+ HEAP32[i16 >> 2] = i5;
+ } else {
+ HEAP32[i9 + 20 >> 2] = i5;
+ }
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ }
+ if (i5 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i5 + 24 >> 2] = i9;
+ i15 = i13 | 16;
+ i9 = HEAP32[i17 + (i15 + i14) >> 2] | 0;
+ do {
+ if ((i9 | 0) != 0) {
+ if (i9 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i5 + 16 >> 2] = i9;
+ HEAP32[i9 + 24 >> 2] = i5;
+ break;
+ }
+ }
+ } while (0);
+ i9 = HEAP32[i17 + (i12 + i15) >> 2] | 0;
+ if ((i9 | 0) != 0) {
+ if (i9 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i5 + 20 >> 2] = i9;
+ HEAP32[i9 + 24 >> 2] = i5;
+ break;
+ }
+ }
+ }
+ } else {
+ i5 = HEAP32[i17 + ((i13 | 8) + i14) >> 2] | 0;
+ i12 = HEAP32[i17 + (i14 + 12 + i13) >> 2] | 0;
+ i18 = 80 + (i16 << 1 << 2) | 0;
+ if ((i5 | 0) != (i18 | 0)) {
+ if (i5 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ if ((HEAP32[i5 + 12 >> 2] | 0) != (i15 | 0)) {
+ _abort();
+ }
+ }
+ if ((i12 | 0) == (i5 | 0)) {
+ HEAP32[10] = HEAP32[10] & ~(1 << i16);
+ break;
+ }
+ if ((i12 | 0) != (i18 | 0)) {
+ if (i12 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i12 + 8 | 0;
+ if ((HEAP32[i16 >> 2] | 0) == (i15 | 0)) {
+ i9 = i16;
+ } else {
+ _abort();
+ }
+ } else {
+ i9 = i12 + 8 | 0;
+ }
+ HEAP32[i5 + 12 >> 2] = i12;
+ HEAP32[i9 >> 2] = i5;
+ }
+ } while (0);
+ i15 = i17 + ((i11 | i13) + i14) | 0;
+ i10 = i11 + i10 | 0;
+ }
+ i5 = i15 + 4 | 0;
+ HEAP32[i5 >> 2] = HEAP32[i5 >> 2] & -2;
+ HEAP32[i17 + (i8 + 4) >> 2] = i10 | 1;
+ HEAP32[i17 + (i10 + i8) >> 2] = i10;
+ i5 = i10 >>> 3;
+ if (i10 >>> 0 < 256) {
+ i10 = i5 << 1;
+ i2 = 80 + (i10 << 2) | 0;
+ i9 = HEAP32[10] | 0;
+ i5 = 1 << i5;
+ if ((i9 & i5 | 0) != 0) {
+ i9 = 80 + (i10 + 2 << 2) | 0;
+ i5 = HEAP32[i9 >> 2] | 0;
+ if (i5 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i3 = i9;
+ i4 = i5;
+ }
+ } else {
+ HEAP32[10] = i9 | i5;
+ i3 = 80 + (i10 + 2 << 2) | 0;
+ i4 = i2;
+ }
+ HEAP32[i3 >> 2] = i7;
+ HEAP32[i4 + 12 >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i4;
+ HEAP32[i17 + (i8 + 12) >> 2] = i2;
+ break;
+ }
+ i3 = i10 >>> 8;
+ if ((i3 | 0) != 0) {
+ if (i10 >>> 0 > 16777215) {
+ i3 = 31;
+ } else {
+ i31 = (i3 + 1048320 | 0) >>> 16 & 8;
+ i32 = i3 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i3 = (i32 + 245760 | 0) >>> 16 & 2;
+ i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
+ i3 = i10 >>> (i3 + 7 | 0) & 1 | i3 << 1;
+ }
+ } else {
+ i3 = 0;
+ }
+ i4 = 344 + (i3 << 2) | 0;
+ HEAP32[i17 + (i8 + 28) >> 2] = i3;
+ HEAP32[i17 + (i8 + 20) >> 2] = 0;
+ HEAP32[i17 + (i8 + 16) >> 2] = 0;
+ i9 = HEAP32[44 >> 2] | 0;
+ i5 = 1 << i3;
+ if ((i9 & i5 | 0) == 0) {
+ HEAP32[44 >> 2] = i9 | i5;
+ HEAP32[i4 >> 2] = i7;
+ HEAP32[i17 + (i8 + 24) >> 2] = i4;
+ HEAP32[i17 + (i8 + 12) >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i7;
+ break;
+ }
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((i3 | 0) == 31) {
+ i3 = 0;
+ } else {
+ i3 = 25 - (i3 >>> 1) | 0;
+ }
+ L444 : do {
+ if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i10 | 0)) {
+ i3 = i10 << i3;
+ while (1) {
+ i5 = i4 + (i3 >>> 31 << 2) + 16 | 0;
+ i9 = HEAP32[i5 >> 2] | 0;
+ if ((i9 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i9 + 4 >> 2] & -8 | 0) == (i10 | 0)) {
+ i2 = i9;
+ break L444;
+ } else {
+ i3 = i3 << 1;
+ i4 = i9;
+ }
+ }
+ if (i5 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i5 >> 2] = i7;
+ HEAP32[i17 + (i8 + 24) >> 2] = i4;
+ HEAP32[i17 + (i8 + 12) >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i7;
+ break L348;
+ }
+ } else {
+ i2 = i4;
+ }
+ } while (0);
+ i4 = i2 + 8 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ i5 = HEAP32[56 >> 2] | 0;
+ if (i2 >>> 0 < i5 >>> 0) {
+ _abort();
+ }
+ if (i3 >>> 0 < i5 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i3 + 12 >> 2] = i7;
+ HEAP32[i4 >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i3;
+ HEAP32[i17 + (i8 + 12) >> 2] = i2;
+ HEAP32[i17 + (i8 + 24) >> 2] = 0;
+ break;
+ }
+ } else {
+ i32 = (HEAP32[52 >> 2] | 0) + i10 | 0;
+ HEAP32[52 >> 2] = i32;
+ HEAP32[64 >> 2] = i7;
+ HEAP32[i17 + (i8 + 4) >> 2] = i32 | 1;
+ }
+ } while (0);
+ i32 = i17 + (i6 | 8) | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i3 = 488 | 0;
+ while (1) {
+ i2 = HEAP32[i3 >> 2] | 0;
+ if (!(i2 >>> 0 > i15 >>> 0) ? (i11 = HEAP32[i3 + 4 >> 2] | 0, i10 = i2 + i11 | 0, i10 >>> 0 > i15 >>> 0) : 0) {
+ break;
+ }
+ i3 = HEAP32[i3 + 8 >> 2] | 0;
+ }
+ i3 = i2 + (i11 + -39) | 0;
+ if ((i3 & 7 | 0) == 0) {
+ i3 = 0;
+ } else {
+ i3 = 0 - i3 & 7;
+ }
+ i2 = i2 + (i11 + -47 + i3) | 0;
+ i2 = i2 >>> 0 < (i15 + 16 | 0) >>> 0 ? i15 : i2;
+ i3 = i2 + 8 | 0;
+ i4 = i17 + 8 | 0;
+ if ((i4 & 7 | 0) == 0) {
+ i4 = 0;
+ } else {
+ i4 = 0 - i4 & 7;
+ }
+ i32 = i14 + -40 - i4 | 0;
+ HEAP32[64 >> 2] = i17 + i4;
+ HEAP32[52 >> 2] = i32;
+ HEAP32[i17 + (i4 + 4) >> 2] = i32 | 1;
+ HEAP32[i17 + (i14 + -36) >> 2] = 40;
+ HEAP32[68 >> 2] = HEAP32[528 >> 2];
+ HEAP32[i2 + 4 >> 2] = 27;
+ HEAP32[i3 + 0 >> 2] = HEAP32[488 >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[492 >> 2];
+ HEAP32[i3 + 8 >> 2] = HEAP32[496 >> 2];
+ HEAP32[i3 + 12 >> 2] = HEAP32[500 >> 2];
+ HEAP32[488 >> 2] = i17;
+ HEAP32[492 >> 2] = i14;
+ HEAP32[500 >> 2] = 0;
+ HEAP32[496 >> 2] = i3;
+ i4 = i2 + 28 | 0;
+ HEAP32[i4 >> 2] = 7;
+ if ((i2 + 32 | 0) >>> 0 < i10 >>> 0) {
+ while (1) {
+ i3 = i4 + 4 | 0;
+ HEAP32[i3 >> 2] = 7;
+ if ((i4 + 8 | 0) >>> 0 < i10 >>> 0) {
+ i4 = i3;
+ } else {
+ break;
+ }
+ }
+ }
+ if ((i2 | 0) != (i15 | 0)) {
+ i2 = i2 - i15 | 0;
+ i3 = i15 + (i2 + 4) | 0;
+ HEAP32[i3 >> 2] = HEAP32[i3 >> 2] & -2;
+ HEAP32[i15 + 4 >> 2] = i2 | 1;
+ HEAP32[i15 + i2 >> 2] = i2;
+ i3 = i2 >>> 3;
+ if (i2 >>> 0 < 256) {
+ i4 = i3 << 1;
+ i2 = 80 + (i4 << 2) | 0;
+ i5 = HEAP32[10] | 0;
+ i3 = 1 << i3;
+ if ((i5 & i3 | 0) != 0) {
+ i4 = 80 + (i4 + 2 << 2) | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ if (i3 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i7 = i4;
+ i8 = i3;
+ }
+ } else {
+ HEAP32[10] = i5 | i3;
+ i7 = 80 + (i4 + 2 << 2) | 0;
+ i8 = i2;
+ }
+ HEAP32[i7 >> 2] = i15;
+ HEAP32[i8 + 12 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i8;
+ HEAP32[i15 + 12 >> 2] = i2;
+ break;
+ }
+ i3 = i2 >>> 8;
+ if ((i3 | 0) != 0) {
+ if (i2 >>> 0 > 16777215) {
+ i3 = 31;
+ } else {
+ i31 = (i3 + 1048320 | 0) >>> 16 & 8;
+ i32 = i3 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i3 = (i32 + 245760 | 0) >>> 16 & 2;
+ i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
+ i3 = i2 >>> (i3 + 7 | 0) & 1 | i3 << 1;
+ }
+ } else {
+ i3 = 0;
+ }
+ i7 = 344 + (i3 << 2) | 0;
+ HEAP32[i15 + 28 >> 2] = i3;
+ HEAP32[i15 + 20 >> 2] = 0;
+ HEAP32[i15 + 16 >> 2] = 0;
+ i4 = HEAP32[44 >> 2] | 0;
+ i5 = 1 << i3;
+ if ((i4 & i5 | 0) == 0) {
+ HEAP32[44 >> 2] = i4 | i5;
+ HEAP32[i7 >> 2] = i15;
+ HEAP32[i15 + 24 >> 2] = i7;
+ HEAP32[i15 + 12 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i15;
+ break;
+ }
+ i4 = HEAP32[i7 >> 2] | 0;
+ if ((i3 | 0) == 31) {
+ i3 = 0;
+ } else {
+ i3 = 25 - (i3 >>> 1) | 0;
+ }
+ L499 : do {
+ if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i2 | 0)) {
+ i3 = i2 << i3;
+ while (1) {
+ i7 = i4 + (i3 >>> 31 << 2) + 16 | 0;
+ i5 = HEAP32[i7 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) == (i2 | 0)) {
+ i6 = i5;
+ break L499;
+ } else {
+ i3 = i3 << 1;
+ i4 = i5;
+ }
+ }
+ if (i7 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i7 >> 2] = i15;
+ HEAP32[i15 + 24 >> 2] = i4;
+ HEAP32[i15 + 12 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i15;
+ break L311;
+ }
+ } else {
+ i6 = i4;
+ }
+ } while (0);
+ i4 = i6 + 8 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ i2 = HEAP32[56 >> 2] | 0;
+ if (i6 >>> 0 < i2 >>> 0) {
+ _abort();
+ }
+ if (i3 >>> 0 < i2 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i3 + 12 >> 2] = i15;
+ HEAP32[i4 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i3;
+ HEAP32[i15 + 12 >> 2] = i6;
+ HEAP32[i15 + 24 >> 2] = 0;
+ break;
+ }
+ }
+ } else {
+ i32 = HEAP32[56 >> 2] | 0;
+ if ((i32 | 0) == 0 | i17 >>> 0 < i32 >>> 0) {
+ HEAP32[56 >> 2] = i17;
+ }
+ HEAP32[488 >> 2] = i17;
+ HEAP32[492 >> 2] = i14;
+ HEAP32[500 >> 2] = 0;
+ HEAP32[76 >> 2] = HEAP32[128];
+ HEAP32[72 >> 2] = -1;
+ i2 = 0;
+ do {
+ i32 = i2 << 1;
+ i31 = 80 + (i32 << 2) | 0;
+ HEAP32[80 + (i32 + 3 << 2) >> 2] = i31;
+ HEAP32[80 + (i32 + 2 << 2) >> 2] = i31;
+ i2 = i2 + 1 | 0;
+ } while ((i2 | 0) != 32);
+ i2 = i17 + 8 | 0;
+ if ((i2 & 7 | 0) == 0) {
+ i2 = 0;
+ } else {
+ i2 = 0 - i2 & 7;
+ }
+ i32 = i14 + -40 - i2 | 0;
+ HEAP32[64 >> 2] = i17 + i2;
+ HEAP32[52 >> 2] = i32;
+ HEAP32[i17 + (i2 + 4) >> 2] = i32 | 1;
+ HEAP32[i17 + (i14 + -36) >> 2] = 40;
+ HEAP32[68 >> 2] = HEAP32[528 >> 2];
+ }
+ } while (0);
+ i2 = HEAP32[52 >> 2] | 0;
+ if (i2 >>> 0 > i12 >>> 0) {
+ i31 = i2 - i12 | 0;
+ HEAP32[52 >> 2] = i31;
+ i32 = HEAP32[64 >> 2] | 0;
+ HEAP32[64 >> 2] = i32 + i12;
+ HEAP32[i32 + (i12 + 4) >> 2] = i31 | 1;
+ HEAP32[i32 + 4 >> 2] = i12 | 3;
+ i32 = i32 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ }
+ HEAP32[(___errno_location() | 0) >> 2] = 12;
+ i32 = 0;
+ STACKTOP = i1;
+ return i32 | 0;
+}
+function _free(i7) {
+ i7 = i7 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0;
+ i1 = STACKTOP;
+ if ((i7 | 0) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i15 = i7 + -8 | 0;
+ i16 = HEAP32[56 >> 2] | 0;
+ if (i15 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ i13 = HEAP32[i7 + -4 >> 2] | 0;
+ i12 = i13 & 3;
+ if ((i12 | 0) == 1) {
+ _abort();
+ }
+ i8 = i13 & -8;
+ i6 = i7 + (i8 + -8) | 0;
+ do {
+ if ((i13 & 1 | 0) == 0) {
+ i19 = HEAP32[i15 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i15 = -8 - i19 | 0;
+ i13 = i7 + i15 | 0;
+ i12 = i19 + i8 | 0;
+ if (i13 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ if ((i13 | 0) == (HEAP32[60 >> 2] | 0)) {
+ i2 = i7 + (i8 + -4) | 0;
+ if ((HEAP32[i2 >> 2] & 3 | 0) != 3) {
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ HEAP32[48 >> 2] = i12;
+ HEAP32[i2 >> 2] = HEAP32[i2 >> 2] & -2;
+ HEAP32[i7 + (i15 + 4) >> 2] = i12 | 1;
+ HEAP32[i6 >> 2] = i12;
+ STACKTOP = i1;
+ return;
+ }
+ i18 = i19 >>> 3;
+ if (i19 >>> 0 < 256) {
+ i2 = HEAP32[i7 + (i15 + 8) >> 2] | 0;
+ i11 = HEAP32[i7 + (i15 + 12) >> 2] | 0;
+ i14 = 80 + (i18 << 1 << 2) | 0;
+ if ((i2 | 0) != (i14 | 0)) {
+ if (i2 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ if ((HEAP32[i2 + 12 >> 2] | 0) != (i13 | 0)) {
+ _abort();
+ }
+ }
+ if ((i11 | 0) == (i2 | 0)) {
+ HEAP32[10] = HEAP32[10] & ~(1 << i18);
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ if ((i11 | 0) != (i14 | 0)) {
+ if (i11 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ i14 = i11 + 8 | 0;
+ if ((HEAP32[i14 >> 2] | 0) == (i13 | 0)) {
+ i17 = i14;
+ } else {
+ _abort();
+ }
+ } else {
+ i17 = i11 + 8 | 0;
+ }
+ HEAP32[i2 + 12 >> 2] = i11;
+ HEAP32[i17 >> 2] = i2;
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ i17 = HEAP32[i7 + (i15 + 24) >> 2] | 0;
+ i18 = HEAP32[i7 + (i15 + 12) >> 2] | 0;
+ do {
+ if ((i18 | 0) == (i13 | 0)) {
+ i19 = i7 + (i15 + 20) | 0;
+ i18 = HEAP32[i19 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ i19 = i7 + (i15 + 16) | 0;
+ i18 = HEAP32[i19 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ i14 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i21 = i18 + 20 | 0;
+ i20 = HEAP32[i21 >> 2] | 0;
+ if ((i20 | 0) != 0) {
+ i18 = i20;
+ i19 = i21;
+ continue;
+ }
+ i20 = i18 + 16 | 0;
+ i21 = HEAP32[i20 >> 2] | 0;
+ if ((i21 | 0) == 0) {
+ break;
+ } else {
+ i18 = i21;
+ i19 = i20;
+ }
+ }
+ if (i19 >>> 0 < i16 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i19 >> 2] = 0;
+ i14 = i18;
+ break;
+ }
+ } else {
+ i19 = HEAP32[i7 + (i15 + 8) >> 2] | 0;
+ if (i19 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ i16 = i19 + 12 | 0;
+ if ((HEAP32[i16 >> 2] | 0) != (i13 | 0)) {
+ _abort();
+ }
+ i20 = i18 + 8 | 0;
+ if ((HEAP32[i20 >> 2] | 0) == (i13 | 0)) {
+ HEAP32[i16 >> 2] = i18;
+ HEAP32[i20 >> 2] = i19;
+ i14 = i18;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ if ((i17 | 0) != 0) {
+ i18 = HEAP32[i7 + (i15 + 28) >> 2] | 0;
+ i16 = 344 + (i18 << 2) | 0;
+ if ((i13 | 0) == (HEAP32[i16 >> 2] | 0)) {
+ HEAP32[i16 >> 2] = i14;
+ if ((i14 | 0) == 0) {
+ HEAP32[44 >> 2] = HEAP32[44 >> 2] & ~(1 << i18);
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ } else {
+ if (i17 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i17 + 16 | 0;
+ if ((HEAP32[i16 >> 2] | 0) == (i13 | 0)) {
+ HEAP32[i16 >> 2] = i14;
+ } else {
+ HEAP32[i17 + 20 >> 2] = i14;
+ }
+ if ((i14 | 0) == 0) {
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ }
+ if (i14 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i14 + 24 >> 2] = i17;
+ i16 = HEAP32[i7 + (i15 + 16) >> 2] | 0;
+ do {
+ if ((i16 | 0) != 0) {
+ if (i16 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i14 + 16 >> 2] = i16;
+ HEAP32[i16 + 24 >> 2] = i14;
+ break;
+ }
+ }
+ } while (0);
+ i15 = HEAP32[i7 + (i15 + 20) >> 2] | 0;
+ if ((i15 | 0) != 0) {
+ if (i15 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i14 + 20 >> 2] = i15;
+ HEAP32[i15 + 24 >> 2] = i14;
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ } else {
+ i2 = i13;
+ i11 = i12;
+ }
+ } else {
+ i2 = i13;
+ i11 = i12;
+ }
+ } else {
+ i2 = i15;
+ i11 = i8;
+ }
+ } while (0);
+ if (!(i2 >>> 0 < i6 >>> 0)) {
+ _abort();
+ }
+ i12 = i7 + (i8 + -4) | 0;
+ i13 = HEAP32[i12 >> 2] | 0;
+ if ((i13 & 1 | 0) == 0) {
+ _abort();
+ }
+ if ((i13 & 2 | 0) == 0) {
+ if ((i6 | 0) == (HEAP32[64 >> 2] | 0)) {
+ i21 = (HEAP32[52 >> 2] | 0) + i11 | 0;
+ HEAP32[52 >> 2] = i21;
+ HEAP32[64 >> 2] = i2;
+ HEAP32[i2 + 4 >> 2] = i21 | 1;
+ if ((i2 | 0) != (HEAP32[60 >> 2] | 0)) {
+ STACKTOP = i1;
+ return;
+ }
+ HEAP32[60 >> 2] = 0;
+ HEAP32[48 >> 2] = 0;
+ STACKTOP = i1;
+ return;
+ }
+ if ((i6 | 0) == (HEAP32[60 >> 2] | 0)) {
+ i21 = (HEAP32[48 >> 2] | 0) + i11 | 0;
+ HEAP32[48 >> 2] = i21;
+ HEAP32[60 >> 2] = i2;
+ HEAP32[i2 + 4 >> 2] = i21 | 1;
+ HEAP32[i2 + i21 >> 2] = i21;
+ STACKTOP = i1;
+ return;
+ }
+ i11 = (i13 & -8) + i11 | 0;
+ i12 = i13 >>> 3;
+ do {
+ if (!(i13 >>> 0 < 256)) {
+ i10 = HEAP32[i7 + (i8 + 16) >> 2] | 0;
+ i15 = HEAP32[i7 + (i8 | 4) >> 2] | 0;
+ do {
+ if ((i15 | 0) == (i6 | 0)) {
+ i13 = i7 + (i8 + 12) | 0;
+ i12 = HEAP32[i13 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ i13 = i7 + (i8 + 8) | 0;
+ i12 = HEAP32[i13 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ i9 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i14 = i12 + 20 | 0;
+ i15 = HEAP32[i14 >> 2] | 0;
+ if ((i15 | 0) != 0) {
+ i12 = i15;
+ i13 = i14;
+ continue;
+ }
+ i14 = i12 + 16 | 0;
+ i15 = HEAP32[i14 >> 2] | 0;
+ if ((i15 | 0) == 0) {
+ break;
+ } else {
+ i12 = i15;
+ i13 = i14;
+ }
+ }
+ if (i13 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i13 >> 2] = 0;
+ i9 = i12;
+ break;
+ }
+ } else {
+ i13 = HEAP32[i7 + i8 >> 2] | 0;
+ if (i13 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i14 = i13 + 12 | 0;
+ if ((HEAP32[i14 >> 2] | 0) != (i6 | 0)) {
+ _abort();
+ }
+ i12 = i15 + 8 | 0;
+ if ((HEAP32[i12 >> 2] | 0) == (i6 | 0)) {
+ HEAP32[i14 >> 2] = i15;
+ HEAP32[i12 >> 2] = i13;
+ i9 = i15;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ if ((i10 | 0) != 0) {
+ i12 = HEAP32[i7 + (i8 + 20) >> 2] | 0;
+ i13 = 344 + (i12 << 2) | 0;
+ if ((i6 | 0) == (HEAP32[i13 >> 2] | 0)) {
+ HEAP32[i13 >> 2] = i9;
+ if ((i9 | 0) == 0) {
+ HEAP32[44 >> 2] = HEAP32[44 >> 2] & ~(1 << i12);
+ break;
+ }
+ } else {
+ if (i10 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i12 = i10 + 16 | 0;
+ if ((HEAP32[i12 >> 2] | 0) == (i6 | 0)) {
+ HEAP32[i12 >> 2] = i9;
+ } else {
+ HEAP32[i10 + 20 >> 2] = i9;
+ }
+ if ((i9 | 0) == 0) {
+ break;
+ }
+ }
+ if (i9 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i9 + 24 >> 2] = i10;
+ i6 = HEAP32[i7 + (i8 + 8) >> 2] | 0;
+ do {
+ if ((i6 | 0) != 0) {
+ if (i6 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i9 + 16 >> 2] = i6;
+ HEAP32[i6 + 24 >> 2] = i9;
+ break;
+ }
+ }
+ } while (0);
+ i6 = HEAP32[i7 + (i8 + 12) >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ if (i6 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i9 + 20 >> 2] = i6;
+ HEAP32[i6 + 24 >> 2] = i9;
+ break;
+ }
+ }
+ }
+ } else {
+ i9 = HEAP32[i7 + i8 >> 2] | 0;
+ i7 = HEAP32[i7 + (i8 | 4) >> 2] | 0;
+ i8 = 80 + (i12 << 1 << 2) | 0;
+ if ((i9 | 0) != (i8 | 0)) {
+ if (i9 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ if ((HEAP32[i9 + 12 >> 2] | 0) != (i6 | 0)) {
+ _abort();
+ }
+ }
+ if ((i7 | 0) == (i9 | 0)) {
+ HEAP32[10] = HEAP32[10] & ~(1 << i12);
+ break;
+ }
+ if ((i7 | 0) != (i8 | 0)) {
+ if (i7 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i8 = i7 + 8 | 0;
+ if ((HEAP32[i8 >> 2] | 0) == (i6 | 0)) {
+ i10 = i8;
+ } else {
+ _abort();
+ }
+ } else {
+ i10 = i7 + 8 | 0;
+ }
+ HEAP32[i9 + 12 >> 2] = i7;
+ HEAP32[i10 >> 2] = i9;
+ }
+ } while (0);
+ HEAP32[i2 + 4 >> 2] = i11 | 1;
+ HEAP32[i2 + i11 >> 2] = i11;
+ if ((i2 | 0) == (HEAP32[60 >> 2] | 0)) {
+ HEAP32[48 >> 2] = i11;
+ STACKTOP = i1;
+ return;
+ }
+ } else {
+ HEAP32[i12 >> 2] = i13 & -2;
+ HEAP32[i2 + 4 >> 2] = i11 | 1;
+ HEAP32[i2 + i11 >> 2] = i11;
+ }
+ i6 = i11 >>> 3;
+ if (i11 >>> 0 < 256) {
+ i7 = i6 << 1;
+ i3 = 80 + (i7 << 2) | 0;
+ i8 = HEAP32[10] | 0;
+ i6 = 1 << i6;
+ if ((i8 & i6 | 0) != 0) {
+ i6 = 80 + (i7 + 2 << 2) | 0;
+ i7 = HEAP32[i6 >> 2] | 0;
+ if (i7 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i4 = i6;
+ i5 = i7;
+ }
+ } else {
+ HEAP32[10] = i8 | i6;
+ i4 = 80 + (i7 + 2 << 2) | 0;
+ i5 = i3;
+ }
+ HEAP32[i4 >> 2] = i2;
+ HEAP32[i5 + 12 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i5;
+ HEAP32[i2 + 12 >> 2] = i3;
+ STACKTOP = i1;
+ return;
+ }
+ i4 = i11 >>> 8;
+ if ((i4 | 0) != 0) {
+ if (i11 >>> 0 > 16777215) {
+ i4 = 31;
+ } else {
+ i20 = (i4 + 1048320 | 0) >>> 16 & 8;
+ i21 = i4 << i20;
+ i19 = (i21 + 520192 | 0) >>> 16 & 4;
+ i21 = i21 << i19;
+ i4 = (i21 + 245760 | 0) >>> 16 & 2;
+ i4 = 14 - (i19 | i20 | i4) + (i21 << i4 >>> 15) | 0;
+ i4 = i11 >>> (i4 + 7 | 0) & 1 | i4 << 1;
+ }
+ } else {
+ i4 = 0;
+ }
+ i5 = 344 + (i4 << 2) | 0;
+ HEAP32[i2 + 28 >> 2] = i4;
+ HEAP32[i2 + 20 >> 2] = 0;
+ HEAP32[i2 + 16 >> 2] = 0;
+ i7 = HEAP32[44 >> 2] | 0;
+ i6 = 1 << i4;
+ L199 : do {
+ if ((i7 & i6 | 0) != 0) {
+ i5 = HEAP32[i5 >> 2] | 0;
+ if ((i4 | 0) == 31) {
+ i4 = 0;
+ } else {
+ i4 = 25 - (i4 >>> 1) | 0;
+ }
+ L205 : do {
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) != (i11 | 0)) {
+ i4 = i11 << i4;
+ i7 = i5;
+ while (1) {
+ i6 = i7 + (i4 >>> 31 << 2) + 16 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) == (i11 | 0)) {
+ i3 = i5;
+ break L205;
+ } else {
+ i4 = i4 << 1;
+ i7 = i5;
+ }
+ }
+ if (i6 >>> 0 < (HEAP32[56 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i6 >> 2] = i2;
+ HEAP32[i2 + 24 >> 2] = i7;
+ HEAP32[i2 + 12 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i2;
+ break L199;
+ }
+ } else {
+ i3 = i5;
+ }
+ } while (0);
+ i5 = i3 + 8 | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ i6 = HEAP32[56 >> 2] | 0;
+ if (i3 >>> 0 < i6 >>> 0) {
+ _abort();
+ }
+ if (i4 >>> 0 < i6 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i4 + 12 >> 2] = i2;
+ HEAP32[i5 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i4;
+ HEAP32[i2 + 12 >> 2] = i3;
+ HEAP32[i2 + 24 >> 2] = 0;
+ break;
+ }
+ } else {
+ HEAP32[44 >> 2] = i7 | i6;
+ HEAP32[i5 >> 2] = i2;
+ HEAP32[i2 + 24 >> 2] = i5;
+ HEAP32[i2 + 12 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i2;
+ }
+ } while (0);
+ i21 = (HEAP32[72 >> 2] | 0) + -1 | 0;
+ HEAP32[72 >> 2] = i21;
+ if ((i21 | 0) == 0) {
+ i2 = 496 | 0;
+ } else {
+ STACKTOP = i1;
+ return;
+ }
+ while (1) {
+ i2 = HEAP32[i2 >> 2] | 0;
+ if ((i2 | 0) == 0) {
+ break;
+ } else {
+ i2 = i2 + 8 | 0;
+ }
+ }
+ HEAP32[72 >> 2] = -1;
+ STACKTOP = i1;
+ return;
+}
+function _main(i3, i5) {
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i6 = 0, i7 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i2 = i1;
+ L1 : do {
+ if ((i3 | 0) > 1) {
+ i3 = HEAP8[HEAP32[i5 + 4 >> 2] | 0] | 0;
+ switch (i3 | 0) {
+ case 50:
+ {
+ i3 = 400;
+ break L1;
+ }
+ case 51:
+ {
+ i4 = 4;
+ break L1;
+ }
+ case 52:
+ {
+ i3 = 4e3;
+ break L1;
+ }
+ case 53:
+ {
+ i3 = 8e3;
+ break L1;
+ }
+ case 49:
+ {
+ i3 = 55;
+ break L1;
+ }
+ case 48:
+ {
+ i7 = 0;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ default:
+ {
+ HEAP32[i2 >> 2] = i3 + -48;
+ _printf(8, i2 | 0) | 0;
+ i7 = -1;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ }
+ } else {
+ i4 = 4;
+ }
+ } while (0);
+ if ((i4 | 0) == 4) {
+ i3 = 800;
+ }
+ i5 = _malloc(1048576) | 0;
+ i6 = 0;
+ i4 = 0;
+ do {
+ i7 = 0;
+ while (1) {
+ HEAP8[i5 + i7 | 0] = i7 + i6;
+ i7 = i7 + 1 | 0;
+ if ((i7 | 0) == 1048576) {
+ i7 = 0;
+ break;
+ }
+ }
+ do {
+ i6 = (HEAP8[i5 + i7 | 0] & 1) + i6 | 0;
+ i7 = i7 + 1 | 0;
+ } while ((i7 | 0) != 1048576);
+ i6 = (i6 | 0) % 1e3 | 0;
+ i4 = i4 + 1 | 0;
+ } while ((i4 | 0) < (i3 | 0));
+ HEAP32[i2 >> 2] = i6;
+ _printf(24, i2 | 0) | 0;
+ i7 = 0;
+ STACKTOP = i1;
+ return i7 | 0;
+}
+function _memcpy(i3, i2, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i4 = 0;
+ if ((i1 | 0) >= 4096) return _emscripten_memcpy_big(i3 | 0, i2 | 0, i1 | 0) | 0;
+ i4 = i3 | 0;
+ if ((i3 & 3) == (i2 & 3)) {
+ while (i3 & 3) {
+ if ((i1 | 0) == 0) return i4 | 0;
+ HEAP8[i3] = HEAP8[i2] | 0;
+ i3 = i3 + 1 | 0;
+ i2 = i2 + 1 | 0;
+ i1 = i1 - 1 | 0;
+ }
+ while ((i1 | 0) >= 4) {
+ HEAP32[i3 >> 2] = HEAP32[i2 >> 2];
+ i3 = i3 + 4 | 0;
+ i2 = i2 + 4 | 0;
+ i1 = i1 - 4 | 0;
+ }
+ }
+ while ((i1 | 0) > 0) {
+ HEAP8[i3] = HEAP8[i2] | 0;
+ i3 = i3 + 1 | 0;
+ i2 = i2 + 1 | 0;
+ i1 = i1 - 1 | 0;
+ }
+ return i4 | 0;
+}
+function _memset(i1, i4, i3) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i2 = i1 + i3 | 0;
+ if ((i3 | 0) >= 20) {
+ i4 = i4 & 255;
+ i7 = i1 & 3;
+ i6 = i4 | i4 << 8 | i4 << 16 | i4 << 24;
+ i5 = i2 & ~3;
+ if (i7) {
+ i7 = i1 + 4 - i7 | 0;
+ while ((i1 | 0) < (i7 | 0)) {
+ HEAP8[i1] = i4;
+ i1 = i1 + 1 | 0;
+ }
+ }
+ while ((i1 | 0) < (i5 | 0)) {
+ HEAP32[i1 >> 2] = i6;
+ i1 = i1 + 4 | 0;
+ }
+ }
+ while ((i1 | 0) < (i2 | 0)) {
+ HEAP8[i1] = i4;
+ i1 = i1 + 1 | 0;
+ }
+ return i1 - i3 | 0;
+}
+function copyTempDouble(i1) {
+ i1 = i1 | 0;
+ HEAP8[tempDoublePtr] = HEAP8[i1];
+ HEAP8[tempDoublePtr + 1 | 0] = HEAP8[i1 + 1 | 0];
+ HEAP8[tempDoublePtr + 2 | 0] = HEAP8[i1 + 2 | 0];
+ HEAP8[tempDoublePtr + 3 | 0] = HEAP8[i1 + 3 | 0];
+ HEAP8[tempDoublePtr + 4 | 0] = HEAP8[i1 + 4 | 0];
+ HEAP8[tempDoublePtr + 5 | 0] = HEAP8[i1 + 5 | 0];
+ HEAP8[tempDoublePtr + 6 | 0] = HEAP8[i1 + 6 | 0];
+ HEAP8[tempDoublePtr + 7 | 0] = HEAP8[i1 + 7 | 0];
+}
+function copyTempFloat(i1) {
+ i1 = i1 | 0;
+ HEAP8[tempDoublePtr] = HEAP8[i1];
+ HEAP8[tempDoublePtr + 1 | 0] = HEAP8[i1 + 1 | 0];
+ HEAP8[tempDoublePtr + 2 | 0] = HEAP8[i1 + 2 | 0];
+ HEAP8[tempDoublePtr + 3 | 0] = HEAP8[i1 + 3 | 0];
+}
+function runPostSets() {}
+function _strlen(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = i1;
+ while (HEAP8[i2] | 0) {
+ i2 = i2 + 1 | 0;
+ }
+ return i2 - i1 | 0;
+}
+function stackAlloc(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + i1 | 0;
+ STACKTOP = STACKTOP + 7 & -8;
+ return i2 | 0;
+}
+function setThrew(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ if ((__THREW__ | 0) == 0) {
+ __THREW__ = i1;
+ threwValue = i2;
+ }
+}
+function stackRestore(i1) {
+ i1 = i1 | 0;
+ STACKTOP = i1;
+}
+function setTempRet9(i1) {
+ i1 = i1 | 0;
+ tempRet9 = i1;
+}
+function setTempRet8(i1) {
+ i1 = i1 | 0;
+ tempRet8 = i1;
+}
+function setTempRet7(i1) {
+ i1 = i1 | 0;
+ tempRet7 = i1;
+}
+function setTempRet6(i1) {
+ i1 = i1 | 0;
+ tempRet6 = i1;
+}
+function setTempRet5(i1) {
+ i1 = i1 | 0;
+ tempRet5 = i1;
+}
+function setTempRet4(i1) {
+ i1 = i1 | 0;
+ tempRet4 = i1;
+}
+function setTempRet3(i1) {
+ i1 = i1 | 0;
+ tempRet3 = i1;
+}
+function setTempRet2(i1) {
+ i1 = i1 | 0;
+ tempRet2 = i1;
+}
+function setTempRet1(i1) {
+ i1 = i1 | 0;
+ tempRet1 = i1;
+}
+function setTempRet0(i1) {
+ i1 = i1 | 0;
+ tempRet0 = i1;
+}
+function stackSave() {
+ return STACKTOP | 0;
+}
+
+// EMSCRIPTEN_END_FUNCS
+
+
+ return { _strlen: _strlen, _free: _free, _main: _main, _memset: _memset, _malloc: _malloc, _memcpy: _memcpy, runPostSets: runPostSets, stackAlloc: stackAlloc, stackSave: stackSave, stackRestore: stackRestore, setThrew: setThrew, setTempRet0: setTempRet0, setTempRet1: setTempRet1, setTempRet2: setTempRet2, setTempRet3: setTempRet3, setTempRet4: setTempRet4, setTempRet5: setTempRet5, setTempRet6: setTempRet6, setTempRet7: setTempRet7, setTempRet8: setTempRet8, setTempRet9: setTempRet9 };
+}).toString(),
+// EMSCRIPTEN_END_ASM
+{ "Math": Math, "Int8Array": Int8Array, "Int16Array": Int16Array, "Int32Array": Int32Array, "Uint8Array": Uint8Array, "Uint16Array": Uint16Array, "Uint32Array": Uint32Array, "Float32Array": Float32Array, "Float64Array": Float64Array, "abort": abort, "assert": assert, "asmPrintInt": asmPrintInt, "asmPrintFloat": asmPrintFloat, "min": Math_min, "_fflush": _fflush, "_emscripten_memcpy_big": _emscripten_memcpy_big, "_printf": _printf, "_send": _send, "_pwrite": _pwrite, "_abort": _abort, "___setErrNo": ___setErrNo, "_fwrite": _fwrite, "_sbrk": _sbrk, "_time": _time, "_mkport": _mkport, "__reallyNegative": __reallyNegative, "__formatString": __formatString, "_fileno": _fileno, "_write": _write, "_fprintf": _fprintf, "_sysconf": _sysconf, "___errno_location": ___errno_location, "STACKTOP": STACKTOP, "STACK_MAX": STACK_MAX, "tempDoublePtr": tempDoublePtr, "ABORT": ABORT, "NaN": NaN, "Infinity": Infinity }, buffer);
+var _strlen = Module["_strlen"] = asm["_strlen"];
+var _free = Module["_free"] = asm["_free"];
+var _main = Module["_main"] = asm["_main"];
+var _memset = Module["_memset"] = asm["_memset"];
+var _malloc = Module["_malloc"] = asm["_malloc"];
+var _memcpy = Module["_memcpy"] = asm["_memcpy"];
+var runPostSets = Module["runPostSets"] = asm["runPostSets"];
+
+Runtime.stackAlloc = function(size) { return asm['stackAlloc'](size) };
+Runtime.stackSave = function() { return asm['stackSave']() };
+Runtime.stackRestore = function(top) { asm['stackRestore'](top) };
+
+
+// Warning: printing of i64 values may be slightly rounded! No deep i64 math used, so precise i64 code not included
+var i64Math = null;
+
+// === Auto-generated postamble setup entry stuff ===
+
+if (memoryInitializer) {
+ if (ENVIRONMENT_IS_NODE || ENVIRONMENT_IS_SHELL) {
+ var data = Module['readBinary'](memoryInitializer);
+ HEAPU8.set(data, STATIC_BASE);
+ } else {
+ addRunDependency('memory initializer');
+ Browser.asyncLoad(memoryInitializer, function(data) {
+ HEAPU8.set(data, STATIC_BASE);
+ removeRunDependency('memory initializer');
+ }, function(data) {
+ throw 'could not load memory initializer ' + memoryInitializer;
+ });
+ }
+}
+
+function ExitStatus(status) {
+ this.name = "ExitStatus";
+ this.message = "Program terminated with exit(" + status + ")";
+ this.status = status;
+};
+ExitStatus.prototype = new Error();
+ExitStatus.prototype.constructor = ExitStatus;
+
+var initialStackTop;
+var preloadStartTime = null;
+var calledMain = false;
+
+dependenciesFulfilled = function runCaller() {
+ // If run has never been called, and we should call run (INVOKE_RUN is true, and Module.noInitialRun is not false)
+ if (!Module['calledRun'] && shouldRunNow) run([].concat(Module["arguments"]));
+ if (!Module['calledRun']) dependenciesFulfilled = runCaller; // try this again later, after new deps are fulfilled
+}
+
+Module['callMain'] = Module.callMain = function callMain(args) {
+ assert(runDependencies == 0, 'cannot call main when async dependencies remain! (listen on __ATMAIN__)');
+ assert(__ATPRERUN__.length == 0, 'cannot call main when preRun functions remain to be called');
+
+ args = args || [];
+
+ ensureInitRuntime();
+
+ var argc = args.length+1;
+ function pad() {
+ for (var i = 0; i < 4-1; i++) {
+ argv.push(0);
+ }
+ }
+ var argv = [allocate(intArrayFromString("/bin/this.program"), 'i8', ALLOC_NORMAL) ];
+ pad();
+ for (var i = 0; i < argc-1; i = i + 1) {
+ argv.push(allocate(intArrayFromString(args[i]), 'i8', ALLOC_NORMAL));
+ pad();
+ }
+ argv.push(0);
+ argv = allocate(argv, 'i32', ALLOC_NORMAL);
+
+ initialStackTop = STACKTOP;
+
+ try {
+
+ var ret = Module['_main'](argc, argv, 0);
+
+
+ // if we're not running an evented main loop, it's time to exit
+ if (!Module['noExitRuntime']) {
+ exit(ret);
+ }
+ }
+ catch(e) {
+ if (e instanceof ExitStatus) {
+ // exit() throws this once it's done to make sure execution
+ // has been stopped completely
+ return;
+ } else if (e == 'SimulateInfiniteLoop') {
+ // running an evented main loop, don't immediately exit
+ Module['noExitRuntime'] = true;
+ return;
+ } else {
+ if (e && typeof e === 'object' && e.stack) Module.printErr('exception thrown: ' + [e, e.stack]);
+ throw e;
+ }
+ } finally {
+ calledMain = true;
+ }
+}
+
+
+
+
+function run(args) {
+ args = args || Module['arguments'];
+
+ if (preloadStartTime === null) preloadStartTime = Date.now();
+
+ if (runDependencies > 0) {
+ Module.printErr('run() called, but dependencies remain, so not running');
+ return;
+ }
+
+ preRun();
+
+ if (runDependencies > 0) return; // a preRun added a dependency, run will be called later
+ if (Module['calledRun']) return; // run may have just been called through dependencies being fulfilled just in this very frame
+
+ function doRun() {
+ if (Module['calledRun']) return; // run may have just been called while the async setStatus time below was happening
+ Module['calledRun'] = true;
+
+ ensureInitRuntime();
+
+ preMain();
+
+ if (ENVIRONMENT_IS_WEB && preloadStartTime !== null) {
+ Module.printErr('pre-main prep time: ' + (Date.now() - preloadStartTime) + ' ms');
+ }
+
+ if (Module['_main'] && shouldRunNow) {
+ Module['callMain'](args);
+ }
+
+ postRun();
+ }
+
+ if (Module['setStatus']) {
+ Module['setStatus']('Running...');
+ setTimeout(function() {
+ setTimeout(function() {
+ Module['setStatus']('');
+ }, 1);
+ if (!ABORT) doRun();
+ }, 1);
+ } else {
+ doRun();
+ }
+}
+Module['run'] = Module.run = run;
+
+function exit(status) {
+ ABORT = true;
+ EXITSTATUS = status;
+ STACKTOP = initialStackTop;
+
+ // exit the runtime
+ exitRuntime();
+
+ // TODO We should handle this differently based on environment.
+ // In the browser, the best we can do is throw an exception
+ // to halt execution, but in node we could process.exit and
+ // I'd imagine SM shell would have something equivalent.
+ // This would let us set a proper exit status (which
+ // would be great for checking test exit statuses).
+ // https://github.com/kripken/emscripten/issues/1371
+
+ // throw an exception to halt the current execution
+ throw new ExitStatus(status);
+}
+Module['exit'] = Module.exit = exit;
+
+function abort(text) {
+ if (text) {
+ Module.print(text);
+ Module.printErr(text);
+ }
+
+ ABORT = true;
+ EXITSTATUS = 1;
+
+ var extra = '\nIf this abort() is unexpected, build with -s ASSERTIONS=1 which can give more information.';
+
+ throw 'abort() at ' + stackTrace() + extra;
+}
+Module['abort'] = Module.abort = abort;
+
+// {{PRE_RUN_ADDITIONS}}
+
+if (Module['preInit']) {
+ if (typeof Module['preInit'] == 'function') Module['preInit'] = [Module['preInit']];
+ while (Module['preInit'].length > 0) {
+ Module['preInit'].pop()();
+ }
+}
+
+// shouldRunNow refers to calling main(), not run().
+var shouldRunNow = true;
+if (Module['noInitialRun']) {
+ shouldRunNow = false;
+}
+
+
+run([].concat(Module["arguments"]));
diff --git a/test/mjsunit/wasm/embenchen/primes.js b/test/mjsunit/wasm/embenchen/primes.js
new file mode 100644
index 0000000..5e02d79
--- /dev/null
+++ b/test/mjsunit/wasm/embenchen/primes.js
@@ -0,0 +1,5987 @@
+// Modified embenchen to direct to asm-wasm.
+// Flags: --expose-wasm
+
+var EXPECTED_OUTPUT = 'lastprime: 387677.\n';
+var Module = {
+ arguments: [1],
+ print: function(x) {Module.printBuffer += x + '\n';},
+ preRun: [function() {Module.printBuffer = ''}],
+ postRun: [function() {
+ assertEquals(EXPECTED_OUTPUT, Module.printBuffer);
+ }],
+};
+// The Module object: Our interface to the outside world. We import
+// and export values on it, and do the work to get that through
+// closure compiler if necessary. There are various ways Module can be used:
+// 1. Not defined. We create it here
+// 2. A function parameter, function(Module) { ..generated code.. }
+// 3. pre-run appended it, var Module = {}; ..generated code..
+// 4. External script tag defines var Module.
+// We need to do an eval in order to handle the closure compiler
+// case, where this code here is minified but Module was defined
+// elsewhere (e.g. case 4 above). We also need to check if Module
+// already exists (e.g. case 3 above).
+// Note that if you want to run closure, and also to use Module
+// after the generated code, you will need to define var Module = {};
+// before the code. Then that object will be used in the code, and you
+// can continue to use Module afterwards as well.
+var Module;
+if (!Module) Module = (typeof Module !== 'undefined' ? Module : null) || {};
+
+// Sometimes an existing Module object exists with properties
+// meant to overwrite the default module functionality. Here
+// we collect those properties and reapply _after_ we configure
+// the current environment's defaults to avoid having to be so
+// defensive during initialization.
+var moduleOverrides = {};
+for (var key in Module) {
+ if (Module.hasOwnProperty(key)) {
+ moduleOverrides[key] = Module[key];
+ }
+}
+
+// The environment setup code below is customized to use Module.
+// *** Environment setup code ***
+var ENVIRONMENT_IS_NODE = typeof process === 'object' && typeof require === 'function';
+var ENVIRONMENT_IS_WEB = typeof window === 'object';
+var ENVIRONMENT_IS_WORKER = typeof importScripts === 'function';
+var ENVIRONMENT_IS_SHELL = !ENVIRONMENT_IS_WEB && !ENVIRONMENT_IS_NODE && !ENVIRONMENT_IS_WORKER;
+
+if (ENVIRONMENT_IS_NODE) {
+ // Expose functionality in the same simple way that the shells work
+ // Note that we pollute the global namespace here, otherwise we break in node
+ if (!Module['print']) Module['print'] = function print(x) {
+ process['stdout'].write(x + '\n');
+ };
+ if (!Module['printErr']) Module['printErr'] = function printErr(x) {
+ process['stderr'].write(x + '\n');
+ };
+
+ var nodeFS = require('fs');
+ var nodePath = require('path');
+
+ Module['read'] = function read(filename, binary) {
+ filename = nodePath['normalize'](filename);
+ var ret = nodeFS['readFileSync'](filename);
+ // The path is absolute if the normalized version is the same as the resolved.
+ if (!ret && filename != nodePath['resolve'](filename)) {
+ filename = path.join(__dirname, '..', 'src', filename);
+ ret = nodeFS['readFileSync'](filename);
+ }
+ if (ret && !binary) ret = ret.toString();
+ return ret;
+ };
+
+ Module['readBinary'] = function readBinary(filename) { return Module['read'](filename, true) };
+
+ Module['load'] = function load(f) {
+ globalEval(read(f));
+ };
+
+ Module['arguments'] = process['argv'].slice(2);
+
+ module['exports'] = Module;
+}
+else if (ENVIRONMENT_IS_SHELL) {
+ if (!Module['print']) Module['print'] = print;
+ if (typeof printErr != 'undefined') Module['printErr'] = printErr; // not present in v8 or older sm
+
+ if (typeof read != 'undefined') {
+ Module['read'] = read;
+ } else {
+ Module['read'] = function read() { throw 'no read() available (jsc?)' };
+ }
+
+ Module['readBinary'] = function readBinary(f) {
+ return read(f, 'binary');
+ };
+
+ if (typeof scriptArgs != 'undefined') {
+ Module['arguments'] = scriptArgs;
+ } else if (typeof arguments != 'undefined') {
+ Module['arguments'] = arguments;
+ }
+
+ this['Module'] = Module;
+
+ eval("if (typeof gc === 'function' && gc.toString().indexOf('[native code]') > 0) var gc = undefined"); // wipe out the SpiderMonkey shell 'gc' function, which can confuse closure (uses it as a minified name, and it is then initted to a non-falsey value unexpectedly)
+}
+else if (ENVIRONMENT_IS_WEB || ENVIRONMENT_IS_WORKER) {
+ Module['read'] = function read(url) {
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, false);
+ xhr.send(null);
+ return xhr.responseText;
+ };
+
+ if (typeof arguments != 'undefined') {
+ Module['arguments'] = arguments;
+ }
+
+ if (typeof console !== 'undefined') {
+ if (!Module['print']) Module['print'] = function print(x) {
+ console.log(x);
+ };
+ if (!Module['printErr']) Module['printErr'] = function printErr(x) {
+ console.log(x);
+ };
+ } else {
+ // Probably a worker, and without console.log. We can do very little here...
+ var TRY_USE_DUMP = false;
+ if (!Module['print']) Module['print'] = (TRY_USE_DUMP && (typeof(dump) !== "undefined") ? (function(x) {
+ dump(x);
+ }) : (function(x) {
+ // self.postMessage(x); // enable this if you want stdout to be sent as messages
+ }));
+ }
+
+ if (ENVIRONMENT_IS_WEB) {
+ window['Module'] = Module;
+ } else {
+ Module['load'] = importScripts;
+ }
+}
+else {
+ // Unreachable because SHELL is dependant on the others
+ throw 'Unknown runtime environment. Where are we?';
+}
+
+function globalEval(x) {
+ eval.call(null, x);
+}
+if (!Module['load'] == 'undefined' && Module['read']) {
+ Module['load'] = function load(f) {
+ globalEval(Module['read'](f));
+ };
+}
+if (!Module['print']) {
+ Module['print'] = function(){};
+}
+if (!Module['printErr']) {
+ Module['printErr'] = Module['print'];
+}
+if (!Module['arguments']) {
+ Module['arguments'] = [];
+}
+// *** Environment setup code ***
+
+// Closure helpers
+Module.print = Module['print'];
+Module.printErr = Module['printErr'];
+
+// Callbacks
+Module['preRun'] = [];
+Module['postRun'] = [];
+
+// Merge back in the overrides
+for (var key in moduleOverrides) {
+ if (moduleOverrides.hasOwnProperty(key)) {
+ Module[key] = moduleOverrides[key];
+ }
+}
+
+
+
+// === Auto-generated preamble library stuff ===
+
+//========================================
+// Runtime code shared with compiler
+//========================================
+
+var Runtime = {
+ stackSave: function () {
+ return STACKTOP;
+ },
+ stackRestore: function (stackTop) {
+ STACKTOP = stackTop;
+ },
+ forceAlign: function (target, quantum) {
+ quantum = quantum || 4;
+ if (quantum == 1) return target;
+ if (isNumber(target) && isNumber(quantum)) {
+ return Math.ceil(target/quantum)*quantum;
+ } else if (isNumber(quantum) && isPowerOfTwo(quantum)) {
+ return '(((' +target + ')+' + (quantum-1) + ')&' + -quantum + ')';
+ }
+ return 'Math.ceil((' + target + ')/' + quantum + ')*' + quantum;
+ },
+ isNumberType: function (type) {
+ return type in Runtime.INT_TYPES || type in Runtime.FLOAT_TYPES;
+ },
+ isPointerType: function isPointerType(type) {
+ return type[type.length-1] == '*';
+},
+ isStructType: function isStructType(type) {
+ if (isPointerType(type)) return false;
+ if (isArrayType(type)) return true;
+ if (/<?\{ ?[^}]* ?\}>?/.test(type)) return true; // { i32, i8 } etc. - anonymous struct types
+ // See comment in isStructPointerType()
+ return type[0] == '%';
+},
+ INT_TYPES: {"i1":0,"i8":0,"i16":0,"i32":0,"i64":0},
+ FLOAT_TYPES: {"float":0,"double":0},
+ or64: function (x, y) {
+ var l = (x | 0) | (y | 0);
+ var h = (Math.round(x / 4294967296) | Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ and64: function (x, y) {
+ var l = (x | 0) & (y | 0);
+ var h = (Math.round(x / 4294967296) & Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ xor64: function (x, y) {
+ var l = (x | 0) ^ (y | 0);
+ var h = (Math.round(x / 4294967296) ^ Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ getNativeTypeSize: function (type) {
+ switch (type) {
+ case 'i1': case 'i8': return 1;
+ case 'i16': return 2;
+ case 'i32': return 4;
+ case 'i64': return 8;
+ case 'float': return 4;
+ case 'double': return 8;
+ default: {
+ if (type[type.length-1] === '*') {
+ return Runtime.QUANTUM_SIZE; // A pointer
+ } else if (type[0] === 'i') {
+ var bits = parseInt(type.substr(1));
+ assert(bits % 8 === 0);
+ return bits/8;
+ } else {
+ return 0;
+ }
+ }
+ }
+ },
+ getNativeFieldSize: function (type) {
+ return Math.max(Runtime.getNativeTypeSize(type), Runtime.QUANTUM_SIZE);
+ },
+ dedup: function dedup(items, ident) {
+ var seen = {};
+ if (ident) {
+ return items.filter(function(item) {
+ if (seen[item[ident]]) return false;
+ seen[item[ident]] = true;
+ return true;
+ });
+ } else {
+ return items.filter(function(item) {
+ if (seen[item]) return false;
+ seen[item] = true;
+ return true;
+ });
+ }
+},
+ set: function set() {
+ var args = typeof arguments[0] === 'object' ? arguments[0] : arguments;
+ var ret = {};
+ for (var i = 0; i < args.length; i++) {
+ ret[args[i]] = 0;
+ }
+ return ret;
+},
+ STACK_ALIGN: 8,
+ getAlignSize: function (type, size, vararg) {
+ // we align i64s and doubles on 64-bit boundaries, unlike x86
+ if (!vararg && (type == 'i64' || type == 'double')) return 8;
+ if (!type) return Math.min(size, 8); // align structures internally to 64 bits
+ return Math.min(size || (type ? Runtime.getNativeFieldSize(type) : 0), Runtime.QUANTUM_SIZE);
+ },
+ calculateStructAlignment: function calculateStructAlignment(type) {
+ type.flatSize = 0;
+ type.alignSize = 0;
+ var diffs = [];
+ var prev = -1;
+ var index = 0;
+ type.flatIndexes = type.fields.map(function(field) {
+ index++;
+ var size, alignSize;
+ if (Runtime.isNumberType(field) || Runtime.isPointerType(field)) {
+ size = Runtime.getNativeTypeSize(field); // pack char; char; in structs, also char[X]s.
+ alignSize = Runtime.getAlignSize(field, size);
+ } else if (Runtime.isStructType(field)) {
+ if (field[1] === '0') {
+ // this is [0 x something]. When inside another structure like here, it must be at the end,
+ // and it adds no size
+ // XXX this happens in java-nbody for example... assert(index === type.fields.length, 'zero-length in the middle!');
+ size = 0;
+ if (Types.types[field]) {
+ alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
+ } else {
+ alignSize = type.alignSize || QUANTUM_SIZE;
+ }
+ } else {
+ size = Types.types[field].flatSize;
+ alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
+ }
+ } else if (field[0] == 'b') {
+ // bN, large number field, like a [N x i8]
+ size = field.substr(1)|0;
+ alignSize = 1;
+ } else if (field[0] === '<') {
+ // vector type
+ size = alignSize = Types.types[field].flatSize; // fully aligned
+ } else if (field[0] === 'i') {
+ // illegal integer field, that could not be legalized because it is an internal structure field
+ // it is ok to have such fields, if we just use them as markers of field size and nothing more complex
+ size = alignSize = parseInt(field.substr(1))/8;
+ assert(size % 1 === 0, 'cannot handle non-byte-size field ' + field);
+ } else {
+ assert(false, 'invalid type for calculateStructAlignment');
+ }
+ if (type.packed) alignSize = 1;
+ type.alignSize = Math.max(type.alignSize, alignSize);
+ var curr = Runtime.alignMemory(type.flatSize, alignSize); // if necessary, place this on aligned memory
+ type.flatSize = curr + size;
+ if (prev >= 0) {
+ diffs.push(curr-prev);
+ }
+ prev = curr;
+ return curr;
+ });
+ if (type.name_ && type.name_[0] === '[') {
+ // arrays have 2 elements, so we get the proper difference. then we scale here. that way we avoid
+ // allocating a potentially huge array for [999999 x i8] etc.
+ type.flatSize = parseInt(type.name_.substr(1))*type.flatSize/2;
+ }
+ type.flatSize = Runtime.alignMemory(type.flatSize, type.alignSize);
+ if (diffs.length == 0) {
+ type.flatFactor = type.flatSize;
+ } else if (Runtime.dedup(diffs).length == 1) {
+ type.flatFactor = diffs[0];
+ }
+ type.needsFlattening = (type.flatFactor != 1);
+ return type.flatIndexes;
+ },
+ generateStructInfo: function (struct, typeName, offset) {
+ var type, alignment;
+ if (typeName) {
+ offset = offset || 0;
+ type = (typeof Types === 'undefined' ? Runtime.typeInfo : Types.types)[typeName];
+ if (!type) return null;
+ if (type.fields.length != struct.length) {
+ printErr('Number of named fields must match the type for ' + typeName + ': possibly duplicate struct names. Cannot return structInfo');
+ return null;
+ }
+ alignment = type.flatIndexes;
+ } else {
+ var type = { fields: struct.map(function(item) { return item[0] }) };
+ alignment = Runtime.calculateStructAlignment(type);
+ }
+ var ret = {
+ __size__: type.flatSize
+ };
+ if (typeName) {
+ struct.forEach(function(item, i) {
+ if (typeof item === 'string') {
+ ret[item] = alignment[i] + offset;
+ } else {
+ // embedded struct
+ var key;
+ for (var k in item) key = k;
+ ret[key] = Runtime.generateStructInfo(item[key], type.fields[i], alignment[i]);
+ }
+ });
+ } else {
+ struct.forEach(function(item, i) {
+ ret[item[1]] = alignment[i];
+ });
+ }
+ return ret;
+ },
+ dynCall: function (sig, ptr, args) {
+ if (args && args.length) {
+ if (!args.splice) args = Array.prototype.slice.call(args);
+ args.splice(0, 0, ptr);
+ return Module['dynCall_' + sig].apply(null, args);
+ } else {
+ return Module['dynCall_' + sig].call(null, ptr);
+ }
+ },
+ functionPointers: [],
+ addFunction: function (func) {
+ for (var i = 0; i < Runtime.functionPointers.length; i++) {
+ if (!Runtime.functionPointers[i]) {
+ Runtime.functionPointers[i] = func;
+ return 2*(1 + i);
+ }
+ }
+ throw 'Finished up all reserved function pointers. Use a higher value for RESERVED_FUNCTION_POINTERS.';
+ },
+ removeFunction: function (index) {
+ Runtime.functionPointers[(index-2)/2] = null;
+ },
+ getAsmConst: function (code, numArgs) {
+ // code is a constant string on the heap, so we can cache these
+ if (!Runtime.asmConstCache) Runtime.asmConstCache = {};
+ var func = Runtime.asmConstCache[code];
+ if (func) return func;
+ var args = [];
+ for (var i = 0; i < numArgs; i++) {
+ args.push(String.fromCharCode(36) + i); // $0, $1 etc
+ }
+ var source = Pointer_stringify(code);
+ if (source[0] === '"') {
+ // tolerate EM_ASM("..code..") even though EM_ASM(..code..) is correct
+ if (source.indexOf('"', 1) === source.length-1) {
+ source = source.substr(1, source.length-2);
+ } else {
+ // something invalid happened, e.g. EM_ASM("..code($0)..", input)
+ abort('invalid EM_ASM input |' + source + '|. Please use EM_ASM(..code..) (no quotes) or EM_ASM({ ..code($0).. }, input) (to input values)');
+ }
+ }
+ try {
+ var evalled = eval('(function(' + args.join(',') + '){ ' + source + ' })'); // new Function does not allow upvars in node
+ } catch(e) {
+ Module.printErr('error in executing inline EM_ASM code: ' + e + ' on: \n\n' + source + '\n\nwith args |' + args + '| (make sure to use the right one out of EM_ASM, EM_ASM_ARGS, etc.)');
+ throw e;
+ }
+ return Runtime.asmConstCache[code] = evalled;
+ },
+ warnOnce: function (text) {
+ if (!Runtime.warnOnce.shown) Runtime.warnOnce.shown = {};
+ if (!Runtime.warnOnce.shown[text]) {
+ Runtime.warnOnce.shown[text] = 1;
+ Module.printErr(text);
+ }
+ },
+ funcWrappers: {},
+ getFuncWrapper: function (func, sig) {
+ assert(sig);
+ if (!Runtime.funcWrappers[func]) {
+ Runtime.funcWrappers[func] = function dynCall_wrapper() {
+ return Runtime.dynCall(sig, func, arguments);
+ };
+ }
+ return Runtime.funcWrappers[func];
+ },
+ UTF8Processor: function () {
+ var buffer = [];
+ var needed = 0;
+ this.processCChar = function (code) {
+ code = code & 0xFF;
+
+ if (buffer.length == 0) {
+ if ((code & 0x80) == 0x00) { // 0xxxxxxx
+ return String.fromCharCode(code);
+ }
+ buffer.push(code);
+ if ((code & 0xE0) == 0xC0) { // 110xxxxx
+ needed = 1;
+ } else if ((code & 0xF0) == 0xE0) { // 1110xxxx
+ needed = 2;
+ } else { // 11110xxx
+ needed = 3;
+ }
+ return '';
+ }
+
+ if (needed) {
+ buffer.push(code);
+ needed--;
+ if (needed > 0) return '';
+ }
+
+ var c1 = buffer[0];
+ var c2 = buffer[1];
+ var c3 = buffer[2];
+ var c4 = buffer[3];
+ var ret;
+ if (buffer.length == 2) {
+ ret = String.fromCharCode(((c1 & 0x1F) << 6) | (c2 & 0x3F));
+ } else if (buffer.length == 3) {
+ ret = String.fromCharCode(((c1 & 0x0F) << 12) | ((c2 & 0x3F) << 6) | (c3 & 0x3F));
+ } else {
+ // http://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae
+ var codePoint = ((c1 & 0x07) << 18) | ((c2 & 0x3F) << 12) |
+ ((c3 & 0x3F) << 6) | (c4 & 0x3F);
+ ret = String.fromCharCode(
+ Math.floor((codePoint - 0x10000) / 0x400) + 0xD800,
+ (codePoint - 0x10000) % 0x400 + 0xDC00);
+ }
+ buffer.length = 0;
+ return ret;
+ }
+ this.processJSString = function processJSString(string) {
+ /* TODO: use TextEncoder when present,
+ var encoder = new TextEncoder();
+ encoder['encoding'] = "utf-8";
+ var utf8Array = encoder['encode'](aMsg.data);
+ */
+ string = unescape(encodeURIComponent(string));
+ var ret = [];
+ for (var i = 0; i < string.length; i++) {
+ ret.push(string.charCodeAt(i));
+ }
+ return ret;
+ }
+ },
+ getCompilerSetting: function (name) {
+ throw 'You must build with -s RETAIN_COMPILER_SETTINGS=1 for Runtime.getCompilerSetting or emscripten_get_compiler_setting to work';
+ },
+ stackAlloc: function (size) { var ret = STACKTOP;STACKTOP = (STACKTOP + size)|0;STACKTOP = (((STACKTOP)+7)&-8); return ret; },
+ staticAlloc: function (size) { var ret = STATICTOP;STATICTOP = (STATICTOP + size)|0;STATICTOP = (((STATICTOP)+7)&-8); return ret; },
+ dynamicAlloc: function (size) { var ret = DYNAMICTOP;DYNAMICTOP = (DYNAMICTOP + size)|0;DYNAMICTOP = (((DYNAMICTOP)+7)&-8); if (DYNAMICTOP >= TOTAL_MEMORY) enlargeMemory();; return ret; },
+ alignMemory: function (size,quantum) { var ret = size = Math.ceil((size)/(quantum ? quantum : 8))*(quantum ? quantum : 8); return ret; },
+ makeBigInt: function (low,high,unsigned) { var ret = (unsigned ? ((+((low>>>0)))+((+((high>>>0)))*(+4294967296))) : ((+((low>>>0)))+((+((high|0)))*(+4294967296)))); return ret; },
+ GLOBAL_BASE: 8,
+ QUANTUM_SIZE: 4,
+ __dummy__: 0
+}
+
+
+Module['Runtime'] = Runtime;
+
+
+
+
+
+
+
+
+
+//========================================
+// Runtime essentials
+//========================================
+
+var __THREW__ = 0; // Used in checking for thrown exceptions.
+
+var ABORT = false; // whether we are quitting the application. no code should run after this. set in exit() and abort()
+var EXITSTATUS = 0;
+
+var undef = 0;
+// tempInt is used for 32-bit signed values or smaller. tempBigInt is used
+// for 32-bit unsigned values or more than 32 bits. TODO: audit all uses of tempInt
+var tempValue, tempInt, tempBigInt, tempInt2, tempBigInt2, tempPair, tempBigIntI, tempBigIntR, tempBigIntS, tempBigIntP, tempBigIntD, tempDouble, tempFloat;
+var tempI64, tempI64b;
+var tempRet0, tempRet1, tempRet2, tempRet3, tempRet4, tempRet5, tempRet6, tempRet7, tempRet8, tempRet9;
+
+function assert(condition, text) {
+ if (!condition) {
+ abort('Assertion failed: ' + text);
+ }
+}
+
+var globalScope = this;
+
+// C calling interface. A convenient way to call C functions (in C files, or
+// defined with extern "C").
+//
+// Note: LLVM optimizations can inline and remove functions, after which you will not be
+// able to call them. Closure can also do so. To avoid that, add your function to
+// the exports using something like
+//
+// -s EXPORTED_FUNCTIONS='["_main", "_myfunc"]'
+//
+// @param ident The name of the C function (note that C++ functions will be name-mangled - use extern "C")
+// @param returnType The return type of the function, one of the JS types 'number', 'string' or 'array' (use 'number' for any C pointer, and
+// 'array' for JavaScript arrays and typed arrays; note that arrays are 8-bit).
+// @param argTypes An array of the types of arguments for the function (if there are no arguments, this can be ommitted). Types are as in returnType,
+// except that 'array' is not possible (there is no way for us to know the length of the array)
+// @param args An array of the arguments to the function, as native JS values (as in returnType)
+// Note that string arguments will be stored on the stack (the JS string will become a C string on the stack).
+// @return The return value, as a native JS value (as in returnType)
+function ccall(ident, returnType, argTypes, args) {
+ return ccallFunc(getCFunc(ident), returnType, argTypes, args);
+}
+Module["ccall"] = ccall;
+
+// Returns the C function with a specified identifier (for C++, you need to do manual name mangling)
+function getCFunc(ident) {
+ try {
+ var func = Module['_' + ident]; // closure exported function
+ if (!func) func = eval('_' + ident); // explicit lookup
+ } catch(e) {
+ }
+ assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');
+ return func;
+}
+
+// Internal function that does a C call using a function, not an identifier
+function ccallFunc(func, returnType, argTypes, args) {
+ var stack = 0;
+ function toC(value, type) {
+ if (type == 'string') {
+ if (value === null || value === undefined || value === 0) return 0; // null string
+ value = intArrayFromString(value);
+ type = 'array';
+ }
+ if (type == 'array') {
+ if (!stack) stack = Runtime.stackSave();
+ var ret = Runtime.stackAlloc(value.length);
+ writeArrayToMemory(value, ret);
+ return ret;
+ }
+ return value;
+ }
+ function fromC(value, type) {
+ if (type == 'string') {
+ return Pointer_stringify(value);
+ }
+ assert(type != 'array');
+ return value;
+ }
+ var i = 0;
+ var cArgs = args ? args.map(function(arg) {
+ return toC(arg, argTypes[i++]);
+ }) : [];
+ var ret = fromC(func.apply(null, cArgs), returnType);
+ if (stack) Runtime.stackRestore(stack);
+ return ret;
+}
+
+// Returns a native JS wrapper for a C function. This is similar to ccall, but
+// returns a function you can call repeatedly in a normal way. For example:
+//
+// var my_function = cwrap('my_c_function', 'number', ['number', 'number']);
+// alert(my_function(5, 22));
+// alert(my_function(99, 12));
+//
+function cwrap(ident, returnType, argTypes) {
+ var func = getCFunc(ident);
+ return function() {
+ return ccallFunc(func, returnType, argTypes, Array.prototype.slice.call(arguments));
+ }
+}
+Module["cwrap"] = cwrap;
+
+// Sets a value in memory in a dynamic way at run-time. Uses the
+// type data. This is the same as makeSetValue, except that
+// makeSetValue is done at compile-time and generates the needed
+// code then, whereas this function picks the right code at
+// run-time.
+// Note that setValue and getValue only do *aligned* writes and reads!
+// Note that ccall uses JS types as for defining types, while setValue and
+// getValue need LLVM types ('i8', 'i32') - this is a lower-level operation
+function setValue(ptr, value, type, noSafe) {
+ type = type || 'i8';
+ if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
+ switch(type) {
+ case 'i1': HEAP8[(ptr)]=value; break;
+ case 'i8': HEAP8[(ptr)]=value; break;
+ case 'i16': HEAP16[((ptr)>>1)]=value; break;
+ case 'i32': HEAP32[((ptr)>>2)]=value; break;
+ case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;
+ case 'float': HEAPF32[((ptr)>>2)]=value; break;
+ case 'double': HEAPF64[((ptr)>>3)]=value; break;
+ default: abort('invalid type for setValue: ' + type);
+ }
+}
+Module['setValue'] = setValue;
+
+// Parallel to setValue.
+function getValue(ptr, type, noSafe) {
+ type = type || 'i8';
+ if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
+ switch(type) {
+ case 'i1': return HEAP8[(ptr)];
+ case 'i8': return HEAP8[(ptr)];
+ case 'i16': return HEAP16[((ptr)>>1)];
+ case 'i32': return HEAP32[((ptr)>>2)];
+ case 'i64': return HEAP32[((ptr)>>2)];
+ case 'float': return HEAPF32[((ptr)>>2)];
+ case 'double': return HEAPF64[((ptr)>>3)];
+ default: abort('invalid type for setValue: ' + type);
+ }
+ return null;
+}
+Module['getValue'] = getValue;
+
+var ALLOC_NORMAL = 0; // Tries to use _malloc()
+var ALLOC_STACK = 1; // Lives for the duration of the current function call
+var ALLOC_STATIC = 2; // Cannot be freed
+var ALLOC_DYNAMIC = 3; // Cannot be freed except through sbrk
+var ALLOC_NONE = 4; // Do not allocate
+Module['ALLOC_NORMAL'] = ALLOC_NORMAL;
+Module['ALLOC_STACK'] = ALLOC_STACK;
+Module['ALLOC_STATIC'] = ALLOC_STATIC;
+Module['ALLOC_DYNAMIC'] = ALLOC_DYNAMIC;
+Module['ALLOC_NONE'] = ALLOC_NONE;
+
+// allocate(): This is for internal use. You can use it yourself as well, but the interface
+// is a little tricky (see docs right below). The reason is that it is optimized
+// for multiple syntaxes to save space in generated code. So you should
+// normally not use allocate(), and instead allocate memory using _malloc(),
+// initialize it with setValue(), and so forth.
+// @slab: An array of data, or a number. If a number, then the size of the block to allocate,
+// in *bytes* (note that this is sometimes confusing: the next parameter does not
+// affect this!)
+// @types: Either an array of types, one for each byte (or 0 if no type at that position),
+// or a single type which is used for the entire block. This only matters if there
+// is initial data - if @slab is a number, then this does not matter at all and is
+// ignored.
+// @allocator: How to allocate memory, see ALLOC_*
+function allocate(slab, types, allocator, ptr) {
+ var zeroinit, size;
+ if (typeof slab === 'number') {
+ zeroinit = true;
+ size = slab;
+ } else {
+ zeroinit = false;
+ size = slab.length;
+ }
+
+ var singleType = typeof types === 'string' ? types : null;
+
+ var ret;
+ if (allocator == ALLOC_NONE) {
+ ret = ptr;
+ } else {
+ ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));
+ }
+
+ if (zeroinit) {
+ var ptr = ret, stop;
+ assert((ret & 3) == 0);
+ stop = ret + (size & ~3);
+ for (; ptr < stop; ptr += 4) {
+ HEAP32[((ptr)>>2)]=0;
+ }
+ stop = ret + size;
+ while (ptr < stop) {
+ HEAP8[((ptr++)|0)]=0;
+ }
+ return ret;
+ }
+
+ if (singleType === 'i8') {
+ if (slab.subarray || slab.slice) {
+ HEAPU8.set(slab, ret);
+ } else {
+ HEAPU8.set(new Uint8Array(slab), ret);
+ }
+ return ret;
+ }
+
+ var i = 0, type, typeSize, previousType;
+ while (i < size) {
+ var curr = slab[i];
+
+ if (typeof curr === 'function') {
+ curr = Runtime.getFunctionIndex(curr);
+ }
+
+ type = singleType || types[i];
+ if (type === 0) {
+ i++;
+ continue;
+ }
+
+ if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later
+
+ setValue(ret+i, curr, type);
+
+ // no need to look up size unless type changes, so cache it
+ if (previousType !== type) {
+ typeSize = Runtime.getNativeTypeSize(type);
+ previousType = type;
+ }
+ i += typeSize;
+ }
+
+ return ret;
+}
+Module['allocate'] = allocate;
+
+function Pointer_stringify(ptr, /* optional */ length) {
+ // TODO: use TextDecoder
+ // Find the length, and check for UTF while doing so
+ var hasUtf = false;
+ var t;
+ var i = 0;
+ while (1) {
+ t = HEAPU8[(((ptr)+(i))|0)];
+ if (t >= 128) hasUtf = true;
+ else if (t == 0 && !length) break;
+ i++;
+ if (length && i == length) break;
+ }
+ if (!length) length = i;
+
+ var ret = '';
+
+ if (!hasUtf) {
+ var MAX_CHUNK = 1024; // split up into chunks, because .apply on a huge string can overflow the stack
+ var curr;
+ while (length > 0) {
+ curr = String.fromCharCode.apply(String, HEAPU8.subarray(ptr, ptr + Math.min(length, MAX_CHUNK)));
+ ret = ret ? ret + curr : curr;
+ ptr += MAX_CHUNK;
+ length -= MAX_CHUNK;
+ }
+ return ret;
+ }
+
+ var utf8 = new Runtime.UTF8Processor();
+ for (i = 0; i < length; i++) {
+ t = HEAPU8[(((ptr)+(i))|0)];
+ ret += utf8.processCChar(t);
+ }
+ return ret;
+}
+Module['Pointer_stringify'] = Pointer_stringify;
+
+// Given a pointer 'ptr' to a null-terminated UTF16LE-encoded string in the emscripten HEAP, returns
+// a copy of that string as a Javascript String object.
+function UTF16ToString(ptr) {
+ var i = 0;
+
+ var str = '';
+ while (1) {
+ var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];
+ if (codeUnit == 0)
+ return str;
+ ++i;
+ // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.
+ str += String.fromCharCode(codeUnit);
+ }
+}
+Module['UTF16ToString'] = UTF16ToString;
+
+// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
+// null-terminated and encoded in UTF16LE form. The copy will require at most (str.length*2+1)*2 bytes of space in the HEAP.
+function stringToUTF16(str, outPtr) {
+ for(var i = 0; i < str.length; ++i) {
+ // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.
+ var codeUnit = str.charCodeAt(i); // possibly a lead surrogate
+ HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;
+ }
+ // Null-terminate the pointer to the HEAP.
+ HEAP16[(((outPtr)+(str.length*2))>>1)]=0;
+}
+Module['stringToUTF16'] = stringToUTF16;
+
+// Given a pointer 'ptr' to a null-terminated UTF32LE-encoded string in the emscripten HEAP, returns
+// a copy of that string as a Javascript String object.
+function UTF32ToString(ptr) {
+ var i = 0;
+
+ var str = '';
+ while (1) {
+ var utf32 = HEAP32[(((ptr)+(i*4))>>2)];
+ if (utf32 == 0)
+ return str;
+ ++i;
+ // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.
+ if (utf32 >= 0x10000) {
+ var ch = utf32 - 0x10000;
+ str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));
+ } else {
+ str += String.fromCharCode(utf32);
+ }
+ }
+}
+Module['UTF32ToString'] = UTF32ToString;
+
+// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
+// null-terminated and encoded in UTF32LE form. The copy will require at most (str.length+1)*4 bytes of space in the HEAP,
+// but can use less, since str.length does not return the number of characters in the string, but the number of UTF-16 code units in the string.
+function stringToUTF32(str, outPtr) {
+ var iChar = 0;
+ for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {
+ // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.
+ var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate
+ if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {
+ var trailSurrogate = str.charCodeAt(++iCodeUnit);
+ codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);
+ }
+ HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;
+ ++iChar;
+ }
+ // Null-terminate the pointer to the HEAP.
+ HEAP32[(((outPtr)+(iChar*4))>>2)]=0;
+}
+Module['stringToUTF32'] = stringToUTF32;
+
+function demangle(func) {
+ var i = 3;
+ // params, etc.
+ var basicTypes = {
+ 'v': 'void',
+ 'b': 'bool',
+ 'c': 'char',
+ 's': 'short',
+ 'i': 'int',
+ 'l': 'long',
+ 'f': 'float',
+ 'd': 'double',
+ 'w': 'wchar_t',
+ 'a': 'signed char',
+ 'h': 'unsigned char',
+ 't': 'unsigned short',
+ 'j': 'unsigned int',
+ 'm': 'unsigned long',
+ 'x': 'long long',
+ 'y': 'unsigned long long',
+ 'z': '...'
+ };
+ var subs = [];
+ var first = true;
+ function dump(x) {
+ //return;
+ if (x) Module.print(x);
+ Module.print(func);
+ var pre = '';
+ for (var a = 0; a < i; a++) pre += ' ';
+ Module.print (pre + '^');
+ }
+ function parseNested() {
+ i++;
+ if (func[i] === 'K') i++; // ignore const
+ var parts = [];
+ while (func[i] !== 'E') {
+ if (func[i] === 'S') { // substitution
+ i++;
+ var next = func.indexOf('_', i);
+ var num = func.substring(i, next) || 0;
+ parts.push(subs[num] || '?');
+ i = next+1;
+ continue;
+ }
+ if (func[i] === 'C') { // constructor
+ parts.push(parts[parts.length-1]);
+ i += 2;
+ continue;
+ }
+ var size = parseInt(func.substr(i));
+ var pre = size.toString().length;
+ if (!size || !pre) { i--; break; } // counter i++ below us
+ var curr = func.substr(i + pre, size);
+ parts.push(curr);
+ subs.push(curr);
+ i += pre + size;
+ }
+ i++; // skip E
+ return parts;
+ }
+ function parse(rawList, limit, allowVoid) { // main parser
+ limit = limit || Infinity;
+ var ret = '', list = [];
+ function flushList() {
+ return '(' + list.join(', ') + ')';
+ }
+ var name;
+ if (func[i] === 'N') {
+ // namespaced N-E
+ name = parseNested().join('::');
+ limit--;
+ if (limit === 0) return rawList ? [name] : name;
+ } else {
+ // not namespaced
+ if (func[i] === 'K' || (first && func[i] === 'L')) i++; // ignore const and first 'L'
+ var size = parseInt(func.substr(i));
+ if (size) {
+ var pre = size.toString().length;
+ name = func.substr(i + pre, size);
+ i += pre + size;
+ }
+ }
+ first = false;
+ if (func[i] === 'I') {
+ i++;
+ var iList = parse(true);
+ var iRet = parse(true, 1, true);
+ ret += iRet[0] + ' ' + name + '<' + iList.join(', ') + '>';
+ } else {
+ ret = name;
+ }
+ paramLoop: while (i < func.length && limit-- > 0) {
+ //dump('paramLoop');
+ var c = func[i++];
+ if (c in basicTypes) {
+ list.push(basicTypes[c]);
+ } else {
+ switch (c) {
+ case 'P': list.push(parse(true, 1, true)[0] + '*'); break; // pointer
+ case 'R': list.push(parse(true, 1, true)[0] + '&'); break; // reference
+ case 'L': { // literal
+ i++; // skip basic type
+ var end = func.indexOf('E', i);
+ var size = end - i;
+ list.push(func.substr(i, size));
+ i += size + 2; // size + 'EE'
+ break;
+ }
+ case 'A': { // array
+ var size = parseInt(func.substr(i));
+ i += size.toString().length;
+ if (func[i] !== '_') throw '?';
+ i++; // skip _
+ list.push(parse(true, 1, true)[0] + ' [' + size + ']');
+ break;
+ }
+ case 'E': break paramLoop;
+ default: ret += '?' + c; break paramLoop;
+ }
+ }
+ }
+ if (!allowVoid && list.length === 1 && list[0] === 'void') list = []; // avoid (void)
+ if (rawList) {
+ if (ret) {
+ list.push(ret + '?');
+ }
+ return list;
+ } else {
+ return ret + flushList();
+ }
+ }
+ try {
+ // Special-case the entry point, since its name differs from other name mangling.
+ if (func == 'Object._main' || func == '_main') {
+ return 'main()';
+ }
+ if (typeof func === 'number') func = Pointer_stringify(func);
+ if (func[0] !== '_') return func;
+ if (func[1] !== '_') return func; // C function
+ if (func[2] !== 'Z') return func;
+ switch (func[3]) {
+ case 'n': return 'operator new()';
+ case 'd': return 'operator delete()';
+ }
+ return parse();
+ } catch(e) {
+ return func;
+ }
+}
+
+function demangleAll(text) {
+ return text.replace(/__Z[\w\d_]+/g, function(x) { var y = demangle(x); return x === y ? x : (x + ' [' + y + ']') });
+}
+
+function stackTrace() {
+ var stack = new Error().stack;
+ return stack ? demangleAll(stack) : '(no stack trace available)'; // Stack trace is not available at least on IE10 and Safari 6.
+}
+
+// Memory management
+
+var PAGE_SIZE = 4096;
+function alignMemoryPage(x) {
+ return (x+4095)&-4096;
+}
+
+var HEAP;
+var HEAP8, HEAPU8, HEAP16, HEAPU16, HEAP32, HEAPU32, HEAPF32, HEAPF64;
+
+var STATIC_BASE = 0, STATICTOP = 0, staticSealed = false; // static area
+var STACK_BASE = 0, STACKTOP = 0, STACK_MAX = 0; // stack area
+var DYNAMIC_BASE = 0, DYNAMICTOP = 0; // dynamic area handled by sbrk
+
+function enlargeMemory() {
+ abort('Cannot enlarge memory arrays. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value ' + TOTAL_MEMORY + ', (2) compile with ALLOW_MEMORY_GROWTH which adjusts the size at runtime but prevents some optimizations, or (3) set Module.TOTAL_MEMORY before the program runs.');
+}
+
+var TOTAL_STACK = Module['TOTAL_STACK'] || 5242880;
+var TOTAL_MEMORY = Module['TOTAL_MEMORY'] || 134217728;
+var FAST_MEMORY = Module['FAST_MEMORY'] || 2097152;
+
+var totalMemory = 4096;
+while (totalMemory < TOTAL_MEMORY || totalMemory < 2*TOTAL_STACK) {
+ if (totalMemory < 16*1024*1024) {
+ totalMemory *= 2;
+ } else {
+ totalMemory += 16*1024*1024
+ }
+}
+if (totalMemory !== TOTAL_MEMORY) {
+ Module.printErr('increasing TOTAL_MEMORY to ' + totalMemory + ' to be more reasonable');
+ TOTAL_MEMORY = totalMemory;
+}
+
+// Initialize the runtime's memory
+// check for full engine support (use string 'subarray' to avoid closure compiler confusion)
+assert(typeof Int32Array !== 'undefined' && typeof Float64Array !== 'undefined' && !!(new Int32Array(1)['subarray']) && !!(new Int32Array(1)['set']),
+ 'JS engine does not provide full typed array support');
+
+var buffer = new ArrayBuffer(TOTAL_MEMORY);
+HEAP8 = new Int8Array(buffer);
+HEAP16 = new Int16Array(buffer);
+HEAP32 = new Int32Array(buffer);
+HEAPU8 = new Uint8Array(buffer);
+HEAPU16 = new Uint16Array(buffer);
+HEAPU32 = new Uint32Array(buffer);
+HEAPF32 = new Float32Array(buffer);
+HEAPF64 = new Float64Array(buffer);
+
+// Endianness check (note: assumes compiler arch was little-endian)
+HEAP32[0] = 255;
+assert(HEAPU8[0] === 255 && HEAPU8[3] === 0, 'Typed arrays 2 must be run on a little-endian system');
+
+Module['HEAP'] = HEAP;
+Module['HEAP8'] = HEAP8;
+Module['HEAP16'] = HEAP16;
+Module['HEAP32'] = HEAP32;
+Module['HEAPU8'] = HEAPU8;
+Module['HEAPU16'] = HEAPU16;
+Module['HEAPU32'] = HEAPU32;
+Module['HEAPF32'] = HEAPF32;
+Module['HEAPF64'] = HEAPF64;
+
+function callRuntimeCallbacks(callbacks) {
+ while(callbacks.length > 0) {
+ var callback = callbacks.shift();
+ if (typeof callback == 'function') {
+ callback();
+ continue;
+ }
+ var func = callback.func;
+ if (typeof func === 'number') {
+ if (callback.arg === undefined) {
+ Runtime.dynCall('v', func);
+ } else {
+ Runtime.dynCall('vi', func, [callback.arg]);
+ }
+ } else {
+ func(callback.arg === undefined ? null : callback.arg);
+ }
+ }
+}
+
+var __ATPRERUN__ = []; // functions called before the runtime is initialized
+var __ATINIT__ = []; // functions called during startup
+var __ATMAIN__ = []; // functions called when main() is to be run
+var __ATEXIT__ = []; // functions called during shutdown
+var __ATPOSTRUN__ = []; // functions called after the runtime has exited
+
+var runtimeInitialized = false;
+
+function preRun() {
+ // compatibility - merge in anything from Module['preRun'] at this time
+ if (Module['preRun']) {
+ if (typeof Module['preRun'] == 'function') Module['preRun'] = [Module['preRun']];
+ while (Module['preRun'].length) {
+ addOnPreRun(Module['preRun'].shift());
+ }
+ }
+ callRuntimeCallbacks(__ATPRERUN__);
+}
+
+function ensureInitRuntime() {
+ if (runtimeInitialized) return;
+ runtimeInitialized = true;
+ callRuntimeCallbacks(__ATINIT__);
+}
+
+function preMain() {
+ callRuntimeCallbacks(__ATMAIN__);
+}
+
+function exitRuntime() {
+ callRuntimeCallbacks(__ATEXIT__);
+}
+
+function postRun() {
+ // compatibility - merge in anything from Module['postRun'] at this time
+ if (Module['postRun']) {
+ if (typeof Module['postRun'] == 'function') Module['postRun'] = [Module['postRun']];
+ while (Module['postRun'].length) {
+ addOnPostRun(Module['postRun'].shift());
+ }
+ }
+ callRuntimeCallbacks(__ATPOSTRUN__);
+}
+
+function addOnPreRun(cb) {
+ __ATPRERUN__.unshift(cb);
+}
+Module['addOnPreRun'] = Module.addOnPreRun = addOnPreRun;
+
+function addOnInit(cb) {
+ __ATINIT__.unshift(cb);
+}
+Module['addOnInit'] = Module.addOnInit = addOnInit;
+
+function addOnPreMain(cb) {
+ __ATMAIN__.unshift(cb);
+}
+Module['addOnPreMain'] = Module.addOnPreMain = addOnPreMain;
+
+function addOnExit(cb) {
+ __ATEXIT__.unshift(cb);
+}
+Module['addOnExit'] = Module.addOnExit = addOnExit;
+
+function addOnPostRun(cb) {
+ __ATPOSTRUN__.unshift(cb);
+}
+Module['addOnPostRun'] = Module.addOnPostRun = addOnPostRun;
+
+// Tools
+
+// This processes a JS string into a C-line array of numbers, 0-terminated.
+// For LLVM-originating strings, see parser.js:parseLLVMString function
+function intArrayFromString(stringy, dontAddNull, length /* optional */) {
+ var ret = (new Runtime.UTF8Processor()).processJSString(stringy);
+ if (length) {
+ ret.length = length;
+ }
+ if (!dontAddNull) {
+ ret.push(0);
+ }
+ return ret;
+}
+Module['intArrayFromString'] = intArrayFromString;
+
+function intArrayToString(array) {
+ var ret = [];
+ for (var i = 0; i < array.length; i++) {
+ var chr = array[i];
+ if (chr > 0xFF) {
+ chr &= 0xFF;
+ }
+ ret.push(String.fromCharCode(chr));
+ }
+ return ret.join('');
+}
+Module['intArrayToString'] = intArrayToString;
+
+// Write a Javascript array to somewhere in the heap
+function writeStringToMemory(string, buffer, dontAddNull) {
+ var array = intArrayFromString(string, dontAddNull);
+ var i = 0;
+ while (i < array.length) {
+ var chr = array[i];
+ HEAP8[(((buffer)+(i))|0)]=chr;
+ i = i + 1;
+ }
+}
+Module['writeStringToMemory'] = writeStringToMemory;
+
+function writeArrayToMemory(array, buffer) {
+ for (var i = 0; i < array.length; i++) {
+ HEAP8[(((buffer)+(i))|0)]=array[i];
+ }
+}
+Module['writeArrayToMemory'] = writeArrayToMemory;
+
+function writeAsciiToMemory(str, buffer, dontAddNull) {
+ for (var i = 0; i < str.length; i++) {
+ HEAP8[(((buffer)+(i))|0)]=str.charCodeAt(i);
+ }
+ if (!dontAddNull) HEAP8[(((buffer)+(str.length))|0)]=0;
+}
+Module['writeAsciiToMemory'] = writeAsciiToMemory;
+
+function unSign(value, bits, ignore) {
+ if (value >= 0) {
+ return value;
+ }
+ return bits <= 32 ? 2*Math.abs(1 << (bits-1)) + value // Need some trickery, since if bits == 32, we are right at the limit of the bits JS uses in bitshifts
+ : Math.pow(2, bits) + value;
+}
+function reSign(value, bits, ignore) {
+ if (value <= 0) {
+ return value;
+ }
+ var half = bits <= 32 ? Math.abs(1 << (bits-1)) // abs is needed if bits == 32
+ : Math.pow(2, bits-1);
+ if (value >= half && (bits <= 32 || value > half)) { // for huge values, we can hit the precision limit and always get true here. so don't do that
+ // but, in general there is no perfect solution here. With 64-bit ints, we get rounding and errors
+ // TODO: In i64 mode 1, resign the two parts separately and safely
+ value = -2*half + value; // Cannot bitshift half, as it may be at the limit of the bits JS uses in bitshifts
+ }
+ return value;
+}
+
+// check for imul support, and also for correctness ( https://bugs.webkit.org/show_bug.cgi?id=126345 )
+if (!Math['imul'] || Math['imul'](0xffffffff, 5) !== -5) Math['imul'] = function imul(a, b) {
+ var ah = a >>> 16;
+ var al = a & 0xffff;
+ var bh = b >>> 16;
+ var bl = b & 0xffff;
+ return (al*bl + ((ah*bl + al*bh) << 16))|0;
+};
+Math.imul = Math['imul'];
+
+
+var Math_abs = Math.abs;
+var Math_cos = Math.cos;
+var Math_sin = Math.sin;
+var Math_tan = Math.tan;
+var Math_acos = Math.acos;
+var Math_asin = Math.asin;
+var Math_atan = Math.atan;
+var Math_atan2 = Math.atan2;
+var Math_exp = Math.exp;
+var Math_log = Math.log;
+var Math_sqrt = Math.sqrt;
+var Math_ceil = Math.ceil;
+var Math_floor = Math.floor;
+var Math_pow = Math.pow;
+var Math_imul = Math.imul;
+var Math_fround = Math.fround;
+var Math_min = Math.min;
+
+// A counter of dependencies for calling run(). If we need to
+// do asynchronous work before running, increment this and
+// decrement it. Incrementing must happen in a place like
+// PRE_RUN_ADDITIONS (used by emcc to add file preloading).
+// Note that you can add dependencies in preRun, even though
+// it happens right before run - run will be postponed until
+// the dependencies are met.
+var runDependencies = 0;
+var runDependencyWatcher = null;
+var dependenciesFulfilled = null; // overridden to take different actions when all run dependencies are fulfilled
+
+function addRunDependency(id) {
+ runDependencies++;
+ if (Module['monitorRunDependencies']) {
+ Module['monitorRunDependencies'](runDependencies);
+ }
+}
+Module['addRunDependency'] = addRunDependency;
+function removeRunDependency(id) {
+ runDependencies--;
+ if (Module['monitorRunDependencies']) {
+ Module['monitorRunDependencies'](runDependencies);
+ }
+ if (runDependencies == 0) {
+ if (runDependencyWatcher !== null) {
+ clearInterval(runDependencyWatcher);
+ runDependencyWatcher = null;
+ }
+ if (dependenciesFulfilled) {
+ var callback = dependenciesFulfilled;
+ dependenciesFulfilled = null;
+ callback(); // can add another dependenciesFulfilled
+ }
+ }
+}
+Module['removeRunDependency'] = removeRunDependency;
+
+Module["preloadedImages"] = {}; // maps url to image data
+Module["preloadedAudios"] = {}; // maps url to audio data
+
+
+var memoryInitializer = null;
+
+// === Body ===
+
+
+
+
+
+STATIC_BASE = 8;
+
+STATICTOP = STATIC_BASE + Runtime.alignMemory(35);
+/* global initializers */ __ATINIT__.push();
+
+
+/* memory initializer */ allocate([101,114,114,111,114,58,32,37,100,92,110,0,0,0,0,0,108,97,115,116,112,114,105,109,101,58,32,37,100,46,10,0], "i8", ALLOC_NONE, Runtime.GLOBAL_BASE);
+
+
+
+
+var tempDoublePtr = Runtime.alignMemory(allocate(12, "i8", ALLOC_STATIC), 8);
+
+assert(tempDoublePtr % 8 == 0);
+
+function copyTempFloat(ptr) { // functions, because inlining this code increases code size too much
+
+ HEAP8[tempDoublePtr] = HEAP8[ptr];
+
+ HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
+
+ HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
+
+ HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
+
+}
+
+function copyTempDouble(ptr) {
+
+ HEAP8[tempDoublePtr] = HEAP8[ptr];
+
+ HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
+
+ HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
+
+ HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
+
+ HEAP8[tempDoublePtr+4] = HEAP8[ptr+4];
+
+ HEAP8[tempDoublePtr+5] = HEAP8[ptr+5];
+
+ HEAP8[tempDoublePtr+6] = HEAP8[ptr+6];
+
+ HEAP8[tempDoublePtr+7] = HEAP8[ptr+7];
+
+}
+
+
+ function _malloc(bytes) {
+ /* Over-allocate to make sure it is byte-aligned by 8.
+ * This will leak memory, but this is only the dummy
+ * implementation (replaced by dlmalloc normally) so
+ * not an issue.
+ */
+ var ptr = Runtime.dynamicAlloc(bytes + 8);
+ return (ptr+8) & 0xFFFFFFF8;
+ }
+ Module["_malloc"] = _malloc;
+
+
+ Module["_memset"] = _memset;
+
+ function _free() {
+ }
+ Module["_free"] = _free;
+
+
+ function _emscripten_memcpy_big(dest, src, num) {
+ HEAPU8.set(HEAPU8.subarray(src, src+num), dest);
+ return dest;
+ }
+ Module["_memcpy"] = _memcpy;
+
+
+
+
+ var ERRNO_CODES={EPERM:1,ENOENT:2,ESRCH:3,EINTR:4,EIO:5,ENXIO:6,E2BIG:7,ENOEXEC:8,EBADF:9,ECHILD:10,EAGAIN:11,EWOULDBLOCK:11,ENOMEM:12,EACCES:13,EFAULT:14,ENOTBLK:15,EBUSY:16,EEXIST:17,EXDEV:18,ENODEV:19,ENOTDIR:20,EISDIR:21,EINVAL:22,ENFILE:23,EMFILE:24,ENOTTY:25,ETXTBSY:26,EFBIG:27,ENOSPC:28,ESPIPE:29,EROFS:30,EMLINK:31,EPIPE:32,EDOM:33,ERANGE:34,ENOMSG:42,EIDRM:43,ECHRNG:44,EL2NSYNC:45,EL3HLT:46,EL3RST:47,ELNRNG:48,EUNATCH:49,ENOCSI:50,EL2HLT:51,EDEADLK:35,ENOLCK:37,EBADE:52,EBADR:53,EXFULL:54,ENOANO:55,EBADRQC:56,EBADSLT:57,EDEADLOCK:35,EBFONT:59,ENOSTR:60,ENODATA:61,ETIME:62,ENOSR:63,ENONET:64,ENOPKG:65,EREMOTE:66,ENOLINK:67,EADV:68,ESRMNT:69,ECOMM:70,EPROTO:71,EMULTIHOP:72,EDOTDOT:73,EBADMSG:74,ENOTUNIQ:76,EBADFD:77,EREMCHG:78,ELIBACC:79,ELIBBAD:80,ELIBSCN:81,ELIBMAX:82,ELIBEXEC:83,ENOSYS:38,ENOTEMPTY:39,ENAMETOOLONG:36,ELOOP:40,EOPNOTSUPP:95,EPFNOSUPPORT:96,ECONNRESET:104,ENOBUFS:105,EAFNOSUPPORT:97,EPROTOTYPE:91,ENOTSOCK:88,ENOPROTOOPT:92,ESHUTDOWN:108,ECONNREFUSED:111,EADDRINUSE:98,ECONNABORTED:103,ENETUNREACH:101,ENETDOWN:100,ETIMEDOUT:110,EHOSTDOWN:112,EHOSTUNREACH:113,EINPROGRESS:115,EALREADY:114,EDESTADDRREQ:89,EMSGSIZE:90,EPROTONOSUPPORT:93,ESOCKTNOSUPPORT:94,EADDRNOTAVAIL:99,ENETRESET:102,EISCONN:106,ENOTCONN:107,ETOOMANYREFS:109,EUSERS:87,EDQUOT:122,ESTALE:116,ENOTSUP:95,ENOMEDIUM:123,EILSEQ:84,EOVERFLOW:75,ECANCELED:125,ENOTRECOVERABLE:131,EOWNERDEAD:130,ESTRPIPE:86};
+
+ var ERRNO_MESSAGES={0:"Success",1:"Not super-user",2:"No such file or directory",3:"No such process",4:"Interrupted system call",5:"I/O error",6:"No such device or address",7:"Arg list too long",8:"Exec format error",9:"Bad file number",10:"No children",11:"No more processes",12:"Not enough core",13:"Permission denied",14:"Bad address",15:"Block device required",16:"Mount device busy",17:"File exists",18:"Cross-device link",19:"No such device",20:"Not a directory",21:"Is a directory",22:"Invalid argument",23:"Too many open files in system",24:"Too many open files",25:"Not a typewriter",26:"Text file busy",27:"File too large",28:"No space left on device",29:"Illegal seek",30:"Read only file system",31:"Too many links",32:"Broken pipe",33:"Math arg out of domain of func",34:"Math result not representable",35:"File locking deadlock error",36:"File or path name too long",37:"No record locks available",38:"Function not implemented",39:"Directory not empty",40:"Too many symbolic links",42:"No message of desired type",43:"Identifier removed",44:"Channel number out of range",45:"Level 2 not synchronized",46:"Level 3 halted",47:"Level 3 reset",48:"Link number out of range",49:"Protocol driver not attached",50:"No CSI structure available",51:"Level 2 halted",52:"Invalid exchange",53:"Invalid request descriptor",54:"Exchange full",55:"No anode",56:"Invalid request code",57:"Invalid slot",59:"Bad font file fmt",60:"Device not a stream",61:"No data (for no delay io)",62:"Timer expired",63:"Out of streams resources",64:"Machine is not on the network",65:"Package not installed",66:"The object is remote",67:"The link has been severed",68:"Advertise error",69:"Srmount error",70:"Communication error on send",71:"Protocol error",72:"Multihop attempted",73:"Cross mount point (not really error)",74:"Trying to read unreadable message",75:"Value too large for defined data type",76:"Given log. name not unique",77:"f.d. invalid for this operation",78:"Remote address changed",79:"Can access a needed shared lib",80:"Accessing a corrupted shared lib",81:".lib section in a.out corrupted",82:"Attempting to link in too many libs",83:"Attempting to exec a shared library",84:"Illegal byte sequence",86:"Streams pipe error",87:"Too many users",88:"Socket operation on non-socket",89:"Destination address required",90:"Message too long",91:"Protocol wrong type for socket",92:"Protocol not available",93:"Unknown protocol",94:"Socket type not supported",95:"Not supported",96:"Protocol family not supported",97:"Address family not supported by protocol family",98:"Address already in use",99:"Address not available",100:"Network interface is not configured",101:"Network is unreachable",102:"Connection reset by network",103:"Connection aborted",104:"Connection reset by peer",105:"No buffer space available",106:"Socket is already connected",107:"Socket is not connected",108:"Can't send after socket shutdown",109:"Too many references",110:"Connection timed out",111:"Connection refused",112:"Host is down",113:"Host is unreachable",114:"Socket already connected",115:"Connection already in progress",116:"Stale file handle",122:"Quota exceeded",123:"No medium (in tape drive)",125:"Operation canceled",130:"Previous owner died",131:"State not recoverable"};
+
+
+ var ___errno_state=0;function ___setErrNo(value) {
+ // For convenient setting and returning of errno.
+ HEAP32[((___errno_state)>>2)]=value;
+ return value;
+ }
+
+ var TTY={ttys:[],init:function () {
+ // https://github.com/kripken/emscripten/pull/1555
+ // if (ENVIRONMENT_IS_NODE) {
+ // // currently, FS.init does not distinguish if process.stdin is a file or TTY
+ // // device, it always assumes it's a TTY device. because of this, we're forcing
+ // // process.stdin to UTF8 encoding to at least make stdin reading compatible
+ // // with text files until FS.init can be refactored.
+ // process['stdin']['setEncoding']('utf8');
+ // }
+ },shutdown:function () {
+ // https://github.com/kripken/emscripten/pull/1555
+ // if (ENVIRONMENT_IS_NODE) {
+ // // inolen: any idea as to why node -e 'process.stdin.read()' wouldn't exit immediately (with process.stdin being a tty)?
+ // // isaacs: because now it's reading from the stream, you've expressed interest in it, so that read() kicks off a _read() which creates a ReadReq operation
+ // // inolen: I thought read() in that case was a synchronous operation that just grabbed some amount of buffered data if it exists?
+ // // isaacs: it is. but it also triggers a _read() call, which calls readStart() on the handle
+ // // isaacs: do process.stdin.pause() and i'd think it'd probably close the pending call
+ // process['stdin']['pause']();
+ // }
+ },register:function (dev, ops) {
+ TTY.ttys[dev] = { input: [], output: [], ops: ops };
+ FS.registerDevice(dev, TTY.stream_ops);
+ },stream_ops:{open:function (stream) {
+ var tty = TTY.ttys[stream.node.rdev];
+ if (!tty) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ stream.tty = tty;
+ stream.seekable = false;
+ },close:function (stream) {
+ // flush any pending line data
+ if (stream.tty.output.length) {
+ stream.tty.ops.put_char(stream.tty, 10);
+ }
+ },read:function (stream, buffer, offset, length, pos /* ignored */) {
+ if (!stream.tty || !stream.tty.ops.get_char) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
+ }
+ var bytesRead = 0;
+ for (var i = 0; i < length; i++) {
+ var result;
+ try {
+ result = stream.tty.ops.get_char(stream.tty);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ if (result === undefined && bytesRead === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ if (result === null || result === undefined) break;
+ bytesRead++;
+ buffer[offset+i] = result;
+ }
+ if (bytesRead) {
+ stream.node.timestamp = Date.now();
+ }
+ return bytesRead;
+ },write:function (stream, buffer, offset, length, pos) {
+ if (!stream.tty || !stream.tty.ops.put_char) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
+ }
+ for (var i = 0; i < length; i++) {
+ try {
+ stream.tty.ops.put_char(stream.tty, buffer[offset+i]);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ }
+ if (length) {
+ stream.node.timestamp = Date.now();
+ }
+ return i;
+ }},default_tty_ops:{get_char:function (tty) {
+ if (!tty.input.length) {
+ var result = null;
+ if (ENVIRONMENT_IS_NODE) {
+ result = process['stdin']['read']();
+ if (!result) {
+ if (process['stdin']['_readableState'] && process['stdin']['_readableState']['ended']) {
+ return null; // EOF
+ }
+ return undefined; // no data available
+ }
+ } else if (typeof window != 'undefined' &&
+ typeof window.prompt == 'function') {
+ // Browser.
+ result = window.prompt('Input: '); // returns null on cancel
+ if (result !== null) {
+ result += '\n';
+ }
+ } else if (typeof readline == 'function') {
+ // Command line.
+ result = readline();
+ if (result !== null) {
+ result += '\n';
+ }
+ }
+ if (!result) {
+ return null;
+ }
+ tty.input = intArrayFromString(result, true);
+ }
+ return tty.input.shift();
+ },put_char:function (tty, val) {
+ if (val === null || val === 10) {
+ Module['print'](tty.output.join(''));
+ tty.output = [];
+ } else {
+ tty.output.push(TTY.utf8.processCChar(val));
+ }
+ }},default_tty1_ops:{put_char:function (tty, val) {
+ if (val === null || val === 10) {
+ Module['printErr'](tty.output.join(''));
+ tty.output = [];
+ } else {
+ tty.output.push(TTY.utf8.processCChar(val));
+ }
+ }}};
+
+ var MEMFS={ops_table:null,CONTENT_OWNING:1,CONTENT_FLEXIBLE:2,CONTENT_FIXED:3,mount:function (mount) {
+ return MEMFS.createNode(null, '/', 16384 | 511 /* 0777 */, 0);
+ },createNode:function (parent, name, mode, dev) {
+ if (FS.isBlkdev(mode) || FS.isFIFO(mode)) {
+ // no supported
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (!MEMFS.ops_table) {
+ MEMFS.ops_table = {
+ dir: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr,
+ lookup: MEMFS.node_ops.lookup,
+ mknod: MEMFS.node_ops.mknod,
+ rename: MEMFS.node_ops.rename,
+ unlink: MEMFS.node_ops.unlink,
+ rmdir: MEMFS.node_ops.rmdir,
+ readdir: MEMFS.node_ops.readdir,
+ symlink: MEMFS.node_ops.symlink
+ },
+ stream: {
+ llseek: MEMFS.stream_ops.llseek
+ }
+ },
+ file: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr
+ },
+ stream: {
+ llseek: MEMFS.stream_ops.llseek,
+ read: MEMFS.stream_ops.read,
+ write: MEMFS.stream_ops.write,
+ allocate: MEMFS.stream_ops.allocate,
+ mmap: MEMFS.stream_ops.mmap
+ }
+ },
+ link: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr,
+ readlink: MEMFS.node_ops.readlink
+ },
+ stream: {}
+ },
+ chrdev: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr
+ },
+ stream: FS.chrdev_stream_ops
+ },
+ };
+ }
+ var node = FS.createNode(parent, name, mode, dev);
+ if (FS.isDir(node.mode)) {
+ node.node_ops = MEMFS.ops_table.dir.node;
+ node.stream_ops = MEMFS.ops_table.dir.stream;
+ node.contents = {};
+ } else if (FS.isFile(node.mode)) {
+ node.node_ops = MEMFS.ops_table.file.node;
+ node.stream_ops = MEMFS.ops_table.file.stream;
+ node.contents = [];
+ node.contentMode = MEMFS.CONTENT_FLEXIBLE;
+ } else if (FS.isLink(node.mode)) {
+ node.node_ops = MEMFS.ops_table.link.node;
+ node.stream_ops = MEMFS.ops_table.link.stream;
+ } else if (FS.isChrdev(node.mode)) {
+ node.node_ops = MEMFS.ops_table.chrdev.node;
+ node.stream_ops = MEMFS.ops_table.chrdev.stream;
+ }
+ node.timestamp = Date.now();
+ // add the new node to the parent
+ if (parent) {
+ parent.contents[name] = node;
+ }
+ return node;
+ },ensureFlexible:function (node) {
+ if (node.contentMode !== MEMFS.CONTENT_FLEXIBLE) {
+ var contents = node.contents;
+ node.contents = Array.prototype.slice.call(contents);
+ node.contentMode = MEMFS.CONTENT_FLEXIBLE;
+ }
+ },node_ops:{getattr:function (node) {
+ var attr = {};
+ // device numbers reuse inode numbers.
+ attr.dev = FS.isChrdev(node.mode) ? node.id : 1;
+ attr.ino = node.id;
+ attr.mode = node.mode;
+ attr.nlink = 1;
+ attr.uid = 0;
+ attr.gid = 0;
+ attr.rdev = node.rdev;
+ if (FS.isDir(node.mode)) {
+ attr.size = 4096;
+ } else if (FS.isFile(node.mode)) {
+ attr.size = node.contents.length;
+ } else if (FS.isLink(node.mode)) {
+ attr.size = node.link.length;
+ } else {
+ attr.size = 0;
+ }
+ attr.atime = new Date(node.timestamp);
+ attr.mtime = new Date(node.timestamp);
+ attr.ctime = new Date(node.timestamp);
+ // NOTE: In our implementation, st_blocks = Math.ceil(st_size/st_blksize),
+ // but this is not required by the standard.
+ attr.blksize = 4096;
+ attr.blocks = Math.ceil(attr.size / attr.blksize);
+ return attr;
+ },setattr:function (node, attr) {
+ if (attr.mode !== undefined) {
+ node.mode = attr.mode;
+ }
+ if (attr.timestamp !== undefined) {
+ node.timestamp = attr.timestamp;
+ }
+ if (attr.size !== undefined) {
+ MEMFS.ensureFlexible(node);
+ var contents = node.contents;
+ if (attr.size < contents.length) contents.length = attr.size;
+ else while (attr.size > contents.length) contents.push(0);
+ }
+ },lookup:function (parent, name) {
+ throw FS.genericErrors[ERRNO_CODES.ENOENT];
+ },mknod:function (parent, name, mode, dev) {
+ return MEMFS.createNode(parent, name, mode, dev);
+ },rename:function (old_node, new_dir, new_name) {
+ // if we're overwriting a directory at new_name, make sure it's empty.
+ if (FS.isDir(old_node.mode)) {
+ var new_node;
+ try {
+ new_node = FS.lookupNode(new_dir, new_name);
+ } catch (e) {
+ }
+ if (new_node) {
+ for (var i in new_node.contents) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ }
+ }
+ // do the internal rewiring
+ delete old_node.parent.contents[old_node.name];
+ old_node.name = new_name;
+ new_dir.contents[new_name] = old_node;
+ old_node.parent = new_dir;
+ },unlink:function (parent, name) {
+ delete parent.contents[name];
+ },rmdir:function (parent, name) {
+ var node = FS.lookupNode(parent, name);
+ for (var i in node.contents) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ delete parent.contents[name];
+ },readdir:function (node) {
+ var entries = ['.', '..']
+ for (var key in node.contents) {
+ if (!node.contents.hasOwnProperty(key)) {
+ continue;
+ }
+ entries.push(key);
+ }
+ return entries;
+ },symlink:function (parent, newname, oldpath) {
+ var node = MEMFS.createNode(parent, newname, 511 /* 0777 */ | 40960, 0);
+ node.link = oldpath;
+ return node;
+ },readlink:function (node) {
+ if (!FS.isLink(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ return node.link;
+ }},stream_ops:{read:function (stream, buffer, offset, length, position) {
+ var contents = stream.node.contents;
+ if (position >= contents.length)
+ return 0;
+ var size = Math.min(contents.length - position, length);
+ assert(size >= 0);
+ if (size > 8 && contents.subarray) { // non-trivial, and typed array
+ buffer.set(contents.subarray(position, position + size), offset);
+ } else
+ {
+ for (var i = 0; i < size; i++) {
+ buffer[offset + i] = contents[position + i];
+ }
+ }
+ return size;
+ },write:function (stream, buffer, offset, length, position, canOwn) {
+ var node = stream.node;
+ node.timestamp = Date.now();
+ var contents = node.contents;
+ if (length && contents.length === 0 && position === 0 && buffer.subarray) {
+ // just replace it with the new data
+ if (canOwn && offset === 0) {
+ node.contents = buffer; // this could be a subarray of Emscripten HEAP, or allocated from some other source.
+ node.contentMode = (buffer.buffer === HEAP8.buffer) ? MEMFS.CONTENT_OWNING : MEMFS.CONTENT_FIXED;
+ } else {
+ node.contents = new Uint8Array(buffer.subarray(offset, offset+length));
+ node.contentMode = MEMFS.CONTENT_FIXED;
+ }
+ return length;
+ }
+ MEMFS.ensureFlexible(node);
+ var contents = node.contents;
+ while (contents.length < position) contents.push(0);
+ for (var i = 0; i < length; i++) {
+ contents[position + i] = buffer[offset + i];
+ }
+ return length;
+ },llseek:function (stream, offset, whence) {
+ var position = offset;
+ if (whence === 1) { // SEEK_CUR.
+ position += stream.position;
+ } else if (whence === 2) { // SEEK_END.
+ if (FS.isFile(stream.node.mode)) {
+ position += stream.node.contents.length;
+ }
+ }
+ if (position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ stream.ungotten = [];
+ stream.position = position;
+ return position;
+ },allocate:function (stream, offset, length) {
+ MEMFS.ensureFlexible(stream.node);
+ var contents = stream.node.contents;
+ var limit = offset + length;
+ while (limit > contents.length) contents.push(0);
+ },mmap:function (stream, buffer, offset, length, position, prot, flags) {
+ if (!FS.isFile(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ var ptr;
+ var allocated;
+ var contents = stream.node.contents;
+ // Only make a new copy when MAP_PRIVATE is specified.
+ if ( !(flags & 2) &&
+ (contents.buffer === buffer || contents.buffer === buffer.buffer) ) {
+ // We can't emulate MAP_SHARED when the file is not backed by the buffer
+ // we're mapping to (e.g. the HEAP buffer).
+ allocated = false;
+ ptr = contents.byteOffset;
+ } else {
+ // Try to avoid unnecessary slices.
+ if (position > 0 || position + length < contents.length) {
+ if (contents.subarray) {
+ contents = contents.subarray(position, position + length);
+ } else {
+ contents = Array.prototype.slice.call(contents, position, position + length);
+ }
+ }
+ allocated = true;
+ ptr = _malloc(length);
+ if (!ptr) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOMEM);
+ }
+ buffer.set(contents, ptr);
+ }
+ return { ptr: ptr, allocated: allocated };
+ }}};
+
+ var IDBFS={dbs:{},indexedDB:function () {
+ return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
+ },DB_VERSION:21,DB_STORE_NAME:"FILE_DATA",mount:function (mount) {
+ // reuse all of the core MEMFS functionality
+ return MEMFS.mount.apply(null, arguments);
+ },syncfs:function (mount, populate, callback) {
+ IDBFS.getLocalSet(mount, function(err, local) {
+ if (err) return callback(err);
+
+ IDBFS.getRemoteSet(mount, function(err, remote) {
+ if (err) return callback(err);
+
+ var src = populate ? remote : local;
+ var dst = populate ? local : remote;
+
+ IDBFS.reconcile(src, dst, callback);
+ });
+ });
+ },getDB:function (name, callback) {
+ // check the cache first
+ var db = IDBFS.dbs[name];
+ if (db) {
+ return callback(null, db);
+ }
+
+ var req;
+ try {
+ req = IDBFS.indexedDB().open(name, IDBFS.DB_VERSION);
+ } catch (e) {
+ return callback(e);
+ }
+ req.onupgradeneeded = function(e) {
+ var db = e.target.result;
+ var transaction = e.target.transaction;
+
+ var fileStore;
+
+ if (db.objectStoreNames.contains(IDBFS.DB_STORE_NAME)) {
+ fileStore = transaction.objectStore(IDBFS.DB_STORE_NAME);
+ } else {
+ fileStore = db.createObjectStore(IDBFS.DB_STORE_NAME);
+ }
+
+ fileStore.createIndex('timestamp', 'timestamp', { unique: false });
+ };
+ req.onsuccess = function() {
+ db = req.result;
+
+ // add to the cache
+ IDBFS.dbs[name] = db;
+ callback(null, db);
+ };
+ req.onerror = function() {
+ callback(this.error);
+ };
+ },getLocalSet:function (mount, callback) {
+ var entries = {};
+
+ function isRealDir(p) {
+ return p !== '.' && p !== '..';
+ };
+ function toAbsolute(root) {
+ return function(p) {
+ return PATH.join2(root, p);
+ }
+ };
+
+ var check = FS.readdir(mount.mountpoint).filter(isRealDir).map(toAbsolute(mount.mountpoint));
+
+ while (check.length) {
+ var path = check.pop();
+ var stat;
+
+ try {
+ stat = FS.stat(path);
+ } catch (e) {
+ return callback(e);
+ }
+
+ if (FS.isDir(stat.mode)) {
+ check.push.apply(check, FS.readdir(path).filter(isRealDir).map(toAbsolute(path)));
+ }
+
+ entries[path] = { timestamp: stat.mtime };
+ }
+
+ return callback(null, { type: 'local', entries: entries });
+ },getRemoteSet:function (mount, callback) {
+ var entries = {};
+
+ IDBFS.getDB(mount.mountpoint, function(err, db) {
+ if (err) return callback(err);
+
+ var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readonly');
+ transaction.onerror = function() { callback(this.error); };
+
+ var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
+ var index = store.index('timestamp');
+
+ index.openKeyCursor().onsuccess = function(event) {
+ var cursor = event.target.result;
+
+ if (!cursor) {
+ return callback(null, { type: 'remote', db: db, entries: entries });
+ }
+
+ entries[cursor.primaryKey] = { timestamp: cursor.key };
+
+ cursor.continue();
+ };
+ });
+ },loadLocalEntry:function (path, callback) {
+ var stat, node;
+
+ try {
+ var lookup = FS.lookupPath(path);
+ node = lookup.node;
+ stat = FS.stat(path);
+ } catch (e) {
+ return callback(e);
+ }
+
+ if (FS.isDir(stat.mode)) {
+ return callback(null, { timestamp: stat.mtime, mode: stat.mode });
+ } else if (FS.isFile(stat.mode)) {
+ return callback(null, { timestamp: stat.mtime, mode: stat.mode, contents: node.contents });
+ } else {
+ return callback(new Error('node type not supported'));
+ }
+ },storeLocalEntry:function (path, entry, callback) {
+ try {
+ if (FS.isDir(entry.mode)) {
+ FS.mkdir(path, entry.mode);
+ } else if (FS.isFile(entry.mode)) {
+ FS.writeFile(path, entry.contents, { encoding: 'binary', canOwn: true });
+ } else {
+ return callback(new Error('node type not supported'));
+ }
+
+ FS.utime(path, entry.timestamp, entry.timestamp);
+ } catch (e) {
+ return callback(e);
+ }
+
+ callback(null);
+ },removeLocalEntry:function (path, callback) {
+ try {
+ var lookup = FS.lookupPath(path);
+ var stat = FS.stat(path);
+
+ if (FS.isDir(stat.mode)) {
+ FS.rmdir(path);
+ } else if (FS.isFile(stat.mode)) {
+ FS.unlink(path);
+ }
+ } catch (e) {
+ return callback(e);
+ }
+
+ callback(null);
+ },loadRemoteEntry:function (store, path, callback) {
+ var req = store.get(path);
+ req.onsuccess = function(event) { callback(null, event.target.result); };
+ req.onerror = function() { callback(this.error); };
+ },storeRemoteEntry:function (store, path, entry, callback) {
+ var req = store.put(entry, path);
+ req.onsuccess = function() { callback(null); };
+ req.onerror = function() { callback(this.error); };
+ },removeRemoteEntry:function (store, path, callback) {
+ var req = store.delete(path);
+ req.onsuccess = function() { callback(null); };
+ req.onerror = function() { callback(this.error); };
+ },reconcile:function (src, dst, callback) {
+ var total = 0;
+
+ var create = [];
+ Object.keys(src.entries).forEach(function (key) {
+ var e = src.entries[key];
+ var e2 = dst.entries[key];
+ if (!e2 || e.timestamp > e2.timestamp) {
+ create.push(key);
+ total++;
+ }
+ });
+
+ var remove = [];
+ Object.keys(dst.entries).forEach(function (key) {
+ var e = dst.entries[key];
+ var e2 = src.entries[key];
+ if (!e2) {
+ remove.push(key);
+ total++;
+ }
+ });
+
+ if (!total) {
+ return callback(null);
+ }
+
+ var errored = false;
+ var completed = 0;
+ var db = src.type === 'remote' ? src.db : dst.db;
+ var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readwrite');
+ var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
+
+ function done(err) {
+ if (err) {
+ if (!done.errored) {
+ done.errored = true;
+ return callback(err);
+ }
+ return;
+ }
+ if (++completed >= total) {
+ return callback(null);
+ }
+ };
+
+ transaction.onerror = function() { done(this.error); };
+
+ // sort paths in ascending order so directory entries are created
+ // before the files inside them
+ create.sort().forEach(function (path) {
+ if (dst.type === 'local') {
+ IDBFS.loadRemoteEntry(store, path, function (err, entry) {
+ if (err) return done(err);
+ IDBFS.storeLocalEntry(path, entry, done);
+ });
+ } else {
+ IDBFS.loadLocalEntry(path, function (err, entry) {
+ if (err) return done(err);
+ IDBFS.storeRemoteEntry(store, path, entry, done);
+ });
+ }
+ });
+
+ // sort paths in descending order so files are deleted before their
+ // parent directories
+ remove.sort().reverse().forEach(function(path) {
+ if (dst.type === 'local') {
+ IDBFS.removeLocalEntry(path, done);
+ } else {
+ IDBFS.removeRemoteEntry(store, path, done);
+ }
+ });
+ }};
+
+ var NODEFS={isWindows:false,staticInit:function () {
+ NODEFS.isWindows = !!process.platform.match(/^win/);
+ },mount:function (mount) {
+ assert(ENVIRONMENT_IS_NODE);
+ return NODEFS.createNode(null, '/', NODEFS.getMode(mount.opts.root), 0);
+ },createNode:function (parent, name, mode, dev) {
+ if (!FS.isDir(mode) && !FS.isFile(mode) && !FS.isLink(mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var node = FS.createNode(parent, name, mode);
+ node.node_ops = NODEFS.node_ops;
+ node.stream_ops = NODEFS.stream_ops;
+ return node;
+ },getMode:function (path) {
+ var stat;
+ try {
+ stat = fs.lstatSync(path);
+ if (NODEFS.isWindows) {
+ // On Windows, directories return permission bits 'rw-rw-rw-', even though they have 'rwxrwxrwx', so
+ // propagate write bits to execute bits.
+ stat.mode = stat.mode | ((stat.mode & 146) >> 1);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return stat.mode;
+ },realPath:function (node) {
+ var parts = [];
+ while (node.parent !== node) {
+ parts.push(node.name);
+ node = node.parent;
+ }
+ parts.push(node.mount.opts.root);
+ parts.reverse();
+ return PATH.join.apply(null, parts);
+ },flagsToPermissionStringMap:{0:"r",1:"r+",2:"r+",64:"r",65:"r+",66:"r+",129:"rx+",193:"rx+",514:"w+",577:"w",578:"w+",705:"wx",706:"wx+",1024:"a",1025:"a",1026:"a+",1089:"a",1090:"a+",1153:"ax",1154:"ax+",1217:"ax",1218:"ax+",4096:"rs",4098:"rs+"},flagsToPermissionString:function (flags) {
+ if (flags in NODEFS.flagsToPermissionStringMap) {
+ return NODEFS.flagsToPermissionStringMap[flags];
+ } else {
+ return flags;
+ }
+ },node_ops:{getattr:function (node) {
+ var path = NODEFS.realPath(node);
+ var stat;
+ try {
+ stat = fs.lstatSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ // node.js v0.10.20 doesn't report blksize and blocks on Windows. Fake them with default blksize of 4096.
+ // See http://support.microsoft.com/kb/140365
+ if (NODEFS.isWindows && !stat.blksize) {
+ stat.blksize = 4096;
+ }
+ if (NODEFS.isWindows && !stat.blocks) {
+ stat.blocks = (stat.size+stat.blksize-1)/stat.blksize|0;
+ }
+ return {
+ dev: stat.dev,
+ ino: stat.ino,
+ mode: stat.mode,
+ nlink: stat.nlink,
+ uid: stat.uid,
+ gid: stat.gid,
+ rdev: stat.rdev,
+ size: stat.size,
+ atime: stat.atime,
+ mtime: stat.mtime,
+ ctime: stat.ctime,
+ blksize: stat.blksize,
+ blocks: stat.blocks
+ };
+ },setattr:function (node, attr) {
+ var path = NODEFS.realPath(node);
+ try {
+ if (attr.mode !== undefined) {
+ fs.chmodSync(path, attr.mode);
+ // update the common node structure mode as well
+ node.mode = attr.mode;
+ }
+ if (attr.timestamp !== undefined) {
+ var date = new Date(attr.timestamp);
+ fs.utimesSync(path, date, date);
+ }
+ if (attr.size !== undefined) {
+ fs.truncateSync(path, attr.size);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },lookup:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ var mode = NODEFS.getMode(path);
+ return NODEFS.createNode(parent, name, mode);
+ },mknod:function (parent, name, mode, dev) {
+ var node = NODEFS.createNode(parent, name, mode, dev);
+ // create the backing node for this in the fs root as well
+ var path = NODEFS.realPath(node);
+ try {
+ if (FS.isDir(node.mode)) {
+ fs.mkdirSync(path, node.mode);
+ } else {
+ fs.writeFileSync(path, '', { mode: node.mode });
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return node;
+ },rename:function (oldNode, newDir, newName) {
+ var oldPath = NODEFS.realPath(oldNode);
+ var newPath = PATH.join2(NODEFS.realPath(newDir), newName);
+ try {
+ fs.renameSync(oldPath, newPath);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },unlink:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ try {
+ fs.unlinkSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },rmdir:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ try {
+ fs.rmdirSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },readdir:function (node) {
+ var path = NODEFS.realPath(node);
+ try {
+ return fs.readdirSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },symlink:function (parent, newName, oldPath) {
+ var newPath = PATH.join2(NODEFS.realPath(parent), newName);
+ try {
+ fs.symlinkSync(oldPath, newPath);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },readlink:function (node) {
+ var path = NODEFS.realPath(node);
+ try {
+ return fs.readlinkSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ }},stream_ops:{open:function (stream) {
+ var path = NODEFS.realPath(stream.node);
+ try {
+ if (FS.isFile(stream.node.mode)) {
+ stream.nfd = fs.openSync(path, NODEFS.flagsToPermissionString(stream.flags));
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },close:function (stream) {
+ try {
+ if (FS.isFile(stream.node.mode) && stream.nfd) {
+ fs.closeSync(stream.nfd);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },read:function (stream, buffer, offset, length, position) {
+ // FIXME this is terrible.
+ var nbuffer = new Buffer(length);
+ var res;
+ try {
+ res = fs.readSync(stream.nfd, nbuffer, 0, length, position);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ if (res > 0) {
+ for (var i = 0; i < res; i++) {
+ buffer[offset + i] = nbuffer[i];
+ }
+ }
+ return res;
+ },write:function (stream, buffer, offset, length, position) {
+ // FIXME this is terrible.
+ var nbuffer = new Buffer(buffer.subarray(offset, offset + length));
+ var res;
+ try {
+ res = fs.writeSync(stream.nfd, nbuffer, 0, length, position);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return res;
+ },llseek:function (stream, offset, whence) {
+ var position = offset;
+ if (whence === 1) { // SEEK_CUR.
+ position += stream.position;
+ } else if (whence === 2) { // SEEK_END.
+ if (FS.isFile(stream.node.mode)) {
+ try {
+ var stat = fs.fstatSync(stream.nfd);
+ position += stat.size;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ }
+ }
+
+ if (position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+
+ stream.position = position;
+ return position;
+ }}};
+
+ var _stdin=allocate(1, "i32*", ALLOC_STATIC);
+
+ var _stdout=allocate(1, "i32*", ALLOC_STATIC);
+
+ var _stderr=allocate(1, "i32*", ALLOC_STATIC);
+
+ function _fflush(stream) {
+ // int fflush(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fflush.html
+ // we don't currently perform any user-space buffering of data
+ }var FS={root:null,mounts:[],devices:[null],streams:[],nextInode:1,nameTable:null,currentPath:"/",initialized:false,ignorePermissions:true,ErrnoError:null,genericErrors:{},handleFSError:function (e) {
+ if (!(e instanceof FS.ErrnoError)) throw e + ' : ' + stackTrace();
+ return ___setErrNo(e.errno);
+ },lookupPath:function (path, opts) {
+ path = PATH.resolve(FS.cwd(), path);
+ opts = opts || {};
+
+ var defaults = {
+ follow_mount: true,
+ recurse_count: 0
+ };
+ for (var key in defaults) {
+ if (opts[key] === undefined) {
+ opts[key] = defaults[key];
+ }
+ }
+
+ if (opts.recurse_count > 8) { // max recursive lookup of 8
+ throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
+ }
+
+ // split the path
+ var parts = PATH.normalizeArray(path.split('/').filter(function(p) {
+ return !!p;
+ }), false);
+
+ // start at the root
+ var current = FS.root;
+ var current_path = '/';
+
+ for (var i = 0; i < parts.length; i++) {
+ var islast = (i === parts.length-1);
+ if (islast && opts.parent) {
+ // stop resolving
+ break;
+ }
+
+ current = FS.lookupNode(current, parts[i]);
+ current_path = PATH.join2(current_path, parts[i]);
+
+ // jump to the mount's root node if this is a mountpoint
+ if (FS.isMountpoint(current)) {
+ if (!islast || (islast && opts.follow_mount)) {
+ current = current.mounted.root;
+ }
+ }
+
+ // by default, lookupPath will not follow a symlink if it is the final path component.
+ // setting opts.follow = true will override this behavior.
+ if (!islast || opts.follow) {
+ var count = 0;
+ while (FS.isLink(current.mode)) {
+ var link = FS.readlink(current_path);
+ current_path = PATH.resolve(PATH.dirname(current_path), link);
+
+ var lookup = FS.lookupPath(current_path, { recurse_count: opts.recurse_count });
+ current = lookup.node;
+
+ if (count++ > 40) { // limit max consecutive symlinks to 40 (SYMLOOP_MAX).
+ throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
+ }
+ }
+ }
+ }
+
+ return { path: current_path, node: current };
+ },getPath:function (node) {
+ var path;
+ while (true) {
+ if (FS.isRoot(node)) {
+ var mount = node.mount.mountpoint;
+ if (!path) return mount;
+ return mount[mount.length-1] !== '/' ? mount + '/' + path : mount + path;
+ }
+ path = path ? node.name + '/' + path : node.name;
+ node = node.parent;
+ }
+ },hashName:function (parentid, name) {
+ var hash = 0;
+
+
+ for (var i = 0; i < name.length; i++) {
+ hash = ((hash << 5) - hash + name.charCodeAt(i)) | 0;
+ }
+ return ((parentid + hash) >>> 0) % FS.nameTable.length;
+ },hashAddNode:function (node) {
+ var hash = FS.hashName(node.parent.id, node.name);
+ node.name_next = FS.nameTable[hash];
+ FS.nameTable[hash] = node;
+ },hashRemoveNode:function (node) {
+ var hash = FS.hashName(node.parent.id, node.name);
+ if (FS.nameTable[hash] === node) {
+ FS.nameTable[hash] = node.name_next;
+ } else {
+ var current = FS.nameTable[hash];
+ while (current) {
+ if (current.name_next === node) {
+ current.name_next = node.name_next;
+ break;
+ }
+ current = current.name_next;
+ }
+ }
+ },lookupNode:function (parent, name) {
+ var err = FS.mayLookup(parent);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ var hash = FS.hashName(parent.id, name);
+ for (var node = FS.nameTable[hash]; node; node = node.name_next) {
+ var nodeName = node.name;
+ if (node.parent.id === parent.id && nodeName === name) {
+ return node;
+ }
+ }
+ // if we failed to find it in the cache, call into the VFS
+ return FS.lookup(parent, name);
+ },createNode:function (parent, name, mode, rdev) {
+ if (!FS.FSNode) {
+ FS.FSNode = function(parent, name, mode, rdev) {
+ if (!parent) {
+ parent = this; // root node sets parent to itself
+ }
+ this.parent = parent;
+ this.mount = parent.mount;
+ this.mounted = null;
+ this.id = FS.nextInode++;
+ this.name = name;
+ this.mode = mode;
+ this.node_ops = {};
+ this.stream_ops = {};
+ this.rdev = rdev;
+ };
+
+ FS.FSNode.prototype = {};
+
+ // compatibility
+ var readMode = 292 | 73;
+ var writeMode = 146;
+
+ // NOTE we must use Object.defineProperties instead of individual calls to
+ // Object.defineProperty in order to make closure compiler happy
+ Object.defineProperties(FS.FSNode.prototype, {
+ read: {
+ get: function() { return (this.mode & readMode) === readMode; },
+ set: function(val) { val ? this.mode |= readMode : this.mode &= ~readMode; }
+ },
+ write: {
+ get: function() { return (this.mode & writeMode) === writeMode; },
+ set: function(val) { val ? this.mode |= writeMode : this.mode &= ~writeMode; }
+ },
+ isFolder: {
+ get: function() { return FS.isDir(this.mode); },
+ },
+ isDevice: {
+ get: function() { return FS.isChrdev(this.mode); },
+ },
+ });
+ }
+
+ var node = new FS.FSNode(parent, name, mode, rdev);
+
+ FS.hashAddNode(node);
+
+ return node;
+ },destroyNode:function (node) {
+ FS.hashRemoveNode(node);
+ },isRoot:function (node) {
+ return node === node.parent;
+ },isMountpoint:function (node) {
+ return !!node.mounted;
+ },isFile:function (mode) {
+ return (mode & 61440) === 32768;
+ },isDir:function (mode) {
+ return (mode & 61440) === 16384;
+ },isLink:function (mode) {
+ return (mode & 61440) === 40960;
+ },isChrdev:function (mode) {
+ return (mode & 61440) === 8192;
+ },isBlkdev:function (mode) {
+ return (mode & 61440) === 24576;
+ },isFIFO:function (mode) {
+ return (mode & 61440) === 4096;
+ },isSocket:function (mode) {
+ return (mode & 49152) === 49152;
+ },flagModes:{"r":0,"rs":1052672,"r+":2,"w":577,"wx":705,"xw":705,"w+":578,"wx+":706,"xw+":706,"a":1089,"ax":1217,"xa":1217,"a+":1090,"ax+":1218,"xa+":1218},modeStringToFlags:function (str) {
+ var flags = FS.flagModes[str];
+ if (typeof flags === 'undefined') {
+ throw new Error('Unknown file open mode: ' + str);
+ }
+ return flags;
+ },flagsToPermissionString:function (flag) {
+ var accmode = flag & 2097155;
+ var perms = ['r', 'w', 'rw'][accmode];
+ if ((flag & 512)) {
+ perms += 'w';
+ }
+ return perms;
+ },nodePermissions:function (node, perms) {
+ if (FS.ignorePermissions) {
+ return 0;
+ }
+ // return 0 if any user, group or owner bits are set.
+ if (perms.indexOf('r') !== -1 && !(node.mode & 292)) {
+ return ERRNO_CODES.EACCES;
+ } else if (perms.indexOf('w') !== -1 && !(node.mode & 146)) {
+ return ERRNO_CODES.EACCES;
+ } else if (perms.indexOf('x') !== -1 && !(node.mode & 73)) {
+ return ERRNO_CODES.EACCES;
+ }
+ return 0;
+ },mayLookup:function (dir) {
+ return FS.nodePermissions(dir, 'x');
+ },mayCreate:function (dir, name) {
+ try {
+ var node = FS.lookupNode(dir, name);
+ return ERRNO_CODES.EEXIST;
+ } catch (e) {
+ }
+ return FS.nodePermissions(dir, 'wx');
+ },mayDelete:function (dir, name, isdir) {
+ var node;
+ try {
+ node = FS.lookupNode(dir, name);
+ } catch (e) {
+ return e.errno;
+ }
+ var err = FS.nodePermissions(dir, 'wx');
+ if (err) {
+ return err;
+ }
+ if (isdir) {
+ if (!FS.isDir(node.mode)) {
+ return ERRNO_CODES.ENOTDIR;
+ }
+ if (FS.isRoot(node) || FS.getPath(node) === FS.cwd()) {
+ return ERRNO_CODES.EBUSY;
+ }
+ } else {
+ if (FS.isDir(node.mode)) {
+ return ERRNO_CODES.EISDIR;
+ }
+ }
+ return 0;
+ },mayOpen:function (node, flags) {
+ if (!node) {
+ return ERRNO_CODES.ENOENT;
+ }
+ if (FS.isLink(node.mode)) {
+ return ERRNO_CODES.ELOOP;
+ } else if (FS.isDir(node.mode)) {
+ if ((flags & 2097155) !== 0 || // opening for write
+ (flags & 512)) {
+ return ERRNO_CODES.EISDIR;
+ }
+ }
+ return FS.nodePermissions(node, FS.flagsToPermissionString(flags));
+ },MAX_OPEN_FDS:4096,nextfd:function (fd_start, fd_end) {
+ fd_start = fd_start || 0;
+ fd_end = fd_end || FS.MAX_OPEN_FDS;
+ for (var fd = fd_start; fd <= fd_end; fd++) {
+ if (!FS.streams[fd]) {
+ return fd;
+ }
+ }
+ throw new FS.ErrnoError(ERRNO_CODES.EMFILE);
+ },getStream:function (fd) {
+ return FS.streams[fd];
+ },createStream:function (stream, fd_start, fd_end) {
+ if (!FS.FSStream) {
+ FS.FSStream = function(){};
+ FS.FSStream.prototype = {};
+ // compatibility
+ Object.defineProperties(FS.FSStream.prototype, {
+ object: {
+ get: function() { return this.node; },
+ set: function(val) { this.node = val; }
+ },
+ isRead: {
+ get: function() { return (this.flags & 2097155) !== 1; }
+ },
+ isWrite: {
+ get: function() { return (this.flags & 2097155) !== 0; }
+ },
+ isAppend: {
+ get: function() { return (this.flags & 1024); }
+ }
+ });
+ }
+ if (0) {
+ // reuse the object
+ stream.__proto__ = FS.FSStream.prototype;
+ } else {
+ var newStream = new FS.FSStream();
+ for (var p in stream) {
+ newStream[p] = stream[p];
+ }
+ stream = newStream;
+ }
+ var fd = FS.nextfd(fd_start, fd_end);
+ stream.fd = fd;
+ FS.streams[fd] = stream;
+ return stream;
+ },closeStream:function (fd) {
+ FS.streams[fd] = null;
+ },getStreamFromPtr:function (ptr) {
+ return FS.streams[ptr - 1];
+ },getPtrForStream:function (stream) {
+ return stream ? stream.fd + 1 : 0;
+ },chrdev_stream_ops:{open:function (stream) {
+ var device = FS.getDevice(stream.node.rdev);
+ // override node's stream ops with the device's
+ stream.stream_ops = device.stream_ops;
+ // forward the open call
+ if (stream.stream_ops.open) {
+ stream.stream_ops.open(stream);
+ }
+ },llseek:function () {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }},major:function (dev) {
+ return ((dev) >> 8);
+ },minor:function (dev) {
+ return ((dev) & 0xff);
+ },makedev:function (ma, mi) {
+ return ((ma) << 8 | (mi));
+ },registerDevice:function (dev, ops) {
+ FS.devices[dev] = { stream_ops: ops };
+ },getDevice:function (dev) {
+ return FS.devices[dev];
+ },getMounts:function (mount) {
+ var mounts = [];
+ var check = [mount];
+
+ while (check.length) {
+ var m = check.pop();
+
+ mounts.push(m);
+
+ check.push.apply(check, m.mounts);
+ }
+
+ return mounts;
+ },syncfs:function (populate, callback) {
+ if (typeof(populate) === 'function') {
+ callback = populate;
+ populate = false;
+ }
+
+ var mounts = FS.getMounts(FS.root.mount);
+ var completed = 0;
+
+ function done(err) {
+ if (err) {
+ if (!done.errored) {
+ done.errored = true;
+ return callback(err);
+ }
+ return;
+ }
+ if (++completed >= mounts.length) {
+ callback(null);
+ }
+ };
+
+ // sync all mounts
+ mounts.forEach(function (mount) {
+ if (!mount.type.syncfs) {
+ return done(null);
+ }
+ mount.type.syncfs(mount, populate, done);
+ });
+ },mount:function (type, opts, mountpoint) {
+ var root = mountpoint === '/';
+ var pseudo = !mountpoint;
+ var node;
+
+ if (root && FS.root) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ } else if (!root && !pseudo) {
+ var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
+
+ mountpoint = lookup.path; // use the absolute path
+ node = lookup.node;
+
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+
+ if (!FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ }
+
+ var mount = {
+ type: type,
+ opts: opts,
+ mountpoint: mountpoint,
+ mounts: []
+ };
+
+ // create a root node for the fs
+ var mountRoot = type.mount(mount);
+ mountRoot.mount = mount;
+ mount.root = mountRoot;
+
+ if (root) {
+ FS.root = mountRoot;
+ } else if (node) {
+ // set as a mountpoint
+ node.mounted = mount;
+
+ // add the new mount to the current mount's children
+ if (node.mount) {
+ node.mount.mounts.push(mount);
+ }
+ }
+
+ return mountRoot;
+ },unmount:function (mountpoint) {
+ var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
+
+ if (!FS.isMountpoint(lookup.node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+
+ // destroy the nodes for this mount, and all its child mounts
+ var node = lookup.node;
+ var mount = node.mounted;
+ var mounts = FS.getMounts(mount);
+
+ Object.keys(FS.nameTable).forEach(function (hash) {
+ var current = FS.nameTable[hash];
+
+ while (current) {
+ var next = current.name_next;
+
+ if (mounts.indexOf(current.mount) !== -1) {
+ FS.destroyNode(current);
+ }
+
+ current = next;
+ }
+ });
+
+ // no longer a mountpoint
+ node.mounted = null;
+
+ // remove this mount from the child mounts
+ var idx = node.mount.mounts.indexOf(mount);
+ assert(idx !== -1);
+ node.mount.mounts.splice(idx, 1);
+ },lookup:function (parent, name) {
+ return parent.node_ops.lookup(parent, name);
+ },mknod:function (path, mode, dev) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var err = FS.mayCreate(parent, name);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.mknod) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return parent.node_ops.mknod(parent, name, mode, dev);
+ },create:function (path, mode) {
+ mode = mode !== undefined ? mode : 438 /* 0666 */;
+ mode &= 4095;
+ mode |= 32768;
+ return FS.mknod(path, mode, 0);
+ },mkdir:function (path, mode) {
+ mode = mode !== undefined ? mode : 511 /* 0777 */;
+ mode &= 511 | 512;
+ mode |= 16384;
+ return FS.mknod(path, mode, 0);
+ },mkdev:function (path, mode, dev) {
+ if (typeof(dev) === 'undefined') {
+ dev = mode;
+ mode = 438 /* 0666 */;
+ }
+ mode |= 8192;
+ return FS.mknod(path, mode, dev);
+ },symlink:function (oldpath, newpath) {
+ var lookup = FS.lookupPath(newpath, { parent: true });
+ var parent = lookup.node;
+ var newname = PATH.basename(newpath);
+ var err = FS.mayCreate(parent, newname);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.symlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return parent.node_ops.symlink(parent, newname, oldpath);
+ },rename:function (old_path, new_path) {
+ var old_dirname = PATH.dirname(old_path);
+ var new_dirname = PATH.dirname(new_path);
+ var old_name = PATH.basename(old_path);
+ var new_name = PATH.basename(new_path);
+ // parents must exist
+ var lookup, old_dir, new_dir;
+ try {
+ lookup = FS.lookupPath(old_path, { parent: true });
+ old_dir = lookup.node;
+ lookup = FS.lookupPath(new_path, { parent: true });
+ new_dir = lookup.node;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ // need to be part of the same mount
+ if (old_dir.mount !== new_dir.mount) {
+ throw new FS.ErrnoError(ERRNO_CODES.EXDEV);
+ }
+ // source must exist
+ var old_node = FS.lookupNode(old_dir, old_name);
+ // old path should not be an ancestor of the new path
+ var relative = PATH.relative(old_path, new_dirname);
+ if (relative.charAt(0) !== '.') {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ // new path should not be an ancestor of the old path
+ relative = PATH.relative(new_path, old_dirname);
+ if (relative.charAt(0) !== '.') {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ // see if the new path already exists
+ var new_node;
+ try {
+ new_node = FS.lookupNode(new_dir, new_name);
+ } catch (e) {
+ // not fatal
+ }
+ // early out if nothing needs to change
+ if (old_node === new_node) {
+ return;
+ }
+ // we'll need to delete the old entry
+ var isdir = FS.isDir(old_node.mode);
+ var err = FS.mayDelete(old_dir, old_name, isdir);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ // need delete permissions if we'll be overwriting.
+ // need create permissions if new doesn't already exist.
+ err = new_node ?
+ FS.mayDelete(new_dir, new_name, isdir) :
+ FS.mayCreate(new_dir, new_name);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!old_dir.node_ops.rename) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(old_node) || (new_node && FS.isMountpoint(new_node))) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ // if we are going to change the parent, check write permissions
+ if (new_dir !== old_dir) {
+ err = FS.nodePermissions(old_dir, 'w');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ }
+ // remove the node from the lookup hash
+ FS.hashRemoveNode(old_node);
+ // do the underlying fs rename
+ try {
+ old_dir.node_ops.rename(old_node, new_dir, new_name);
+ } catch (e) {
+ throw e;
+ } finally {
+ // add the node back to the hash (in case node_ops.rename
+ // changed its name)
+ FS.hashAddNode(old_node);
+ }
+ },rmdir:function (path) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var node = FS.lookupNode(parent, name);
+ var err = FS.mayDelete(parent, name, true);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.rmdir) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ parent.node_ops.rmdir(parent, name);
+ FS.destroyNode(node);
+ },readdir:function (path) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ var node = lookup.node;
+ if (!node.node_ops.readdir) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ return node.node_ops.readdir(node);
+ },unlink:function (path) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var node = FS.lookupNode(parent, name);
+ var err = FS.mayDelete(parent, name, false);
+ if (err) {
+ // POSIX says unlink should set EPERM, not EISDIR
+ if (err === ERRNO_CODES.EISDIR) err = ERRNO_CODES.EPERM;
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.unlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ parent.node_ops.unlink(parent, name);
+ FS.destroyNode(node);
+ },readlink:function (path) {
+ var lookup = FS.lookupPath(path);
+ var link = lookup.node;
+ if (!link.node_ops.readlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ return link.node_ops.readlink(link);
+ },stat:function (path, dontFollow) {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ var node = lookup.node;
+ if (!node.node_ops.getattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return node.node_ops.getattr(node);
+ },lstat:function (path) {
+ return FS.stat(path, true);
+ },chmod:function (path, mode, dontFollow) {
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ node.node_ops.setattr(node, {
+ mode: (mode & 4095) | (node.mode & ~4095),
+ timestamp: Date.now()
+ });
+ },lchmod:function (path, mode) {
+ FS.chmod(path, mode, true);
+ },fchmod:function (fd, mode) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ FS.chmod(stream.node, mode);
+ },chown:function (path, uid, gid, dontFollow) {
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ node.node_ops.setattr(node, {
+ timestamp: Date.now()
+ // we ignore the uid / gid for now
+ });
+ },lchown:function (path, uid, gid) {
+ FS.chown(path, uid, gid, true);
+ },fchown:function (fd, uid, gid) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ FS.chown(stream.node, uid, gid);
+ },truncate:function (path, len) {
+ if (len < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: true });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!FS.isFile(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var err = FS.nodePermissions(node, 'w');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ node.node_ops.setattr(node, {
+ size: len,
+ timestamp: Date.now()
+ });
+ },ftruncate:function (fd, len) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ FS.truncate(stream.node, len);
+ },utime:function (path, atime, mtime) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ var node = lookup.node;
+ node.node_ops.setattr(node, {
+ timestamp: Math.max(atime, mtime)
+ });
+ },open:function (path, flags, mode, fd_start, fd_end) {
+ flags = typeof flags === 'string' ? FS.modeStringToFlags(flags) : flags;
+ mode = typeof mode === 'undefined' ? 438 /* 0666 */ : mode;
+ if ((flags & 64)) {
+ mode = (mode & 4095) | 32768;
+ } else {
+ mode = 0;
+ }
+ var node;
+ if (typeof path === 'object') {
+ node = path;
+ } else {
+ path = PATH.normalize(path);
+ try {
+ var lookup = FS.lookupPath(path, {
+ follow: !(flags & 131072)
+ });
+ node = lookup.node;
+ } catch (e) {
+ // ignore
+ }
+ }
+ // perhaps we need to create the node
+ if ((flags & 64)) {
+ if (node) {
+ // if O_CREAT and O_EXCL are set, error out if the node already exists
+ if ((flags & 128)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EEXIST);
+ }
+ } else {
+ // node doesn't exist, try to create it
+ node = FS.mknod(path, mode, 0);
+ }
+ }
+ if (!node) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
+ }
+ // can't truncate a device
+ if (FS.isChrdev(node.mode)) {
+ flags &= ~512;
+ }
+ // check permissions
+ var err = FS.mayOpen(node, flags);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ // do truncation if necessary
+ if ((flags & 512)) {
+ FS.truncate(node, 0);
+ }
+ // we've already handled these, don't pass down to the underlying vfs
+ flags &= ~(128 | 512);
+
+ // register the stream with the filesystem
+ var stream = FS.createStream({
+ node: node,
+ path: FS.getPath(node), // we want the absolute path to the node
+ flags: flags,
+ seekable: true,
+ position: 0,
+ stream_ops: node.stream_ops,
+ // used by the file family libc calls (fopen, fwrite, ferror, etc.)
+ ungotten: [],
+ error: false
+ }, fd_start, fd_end);
+ // call the new stream's open function
+ if (stream.stream_ops.open) {
+ stream.stream_ops.open(stream);
+ }
+ if (Module['logReadFiles'] && !(flags & 1)) {
+ if (!FS.readFiles) FS.readFiles = {};
+ if (!(path in FS.readFiles)) {
+ FS.readFiles[path] = 1;
+ Module['printErr']('read file: ' + path);
+ }
+ }
+ return stream;
+ },close:function (stream) {
+ try {
+ if (stream.stream_ops.close) {
+ stream.stream_ops.close(stream);
+ }
+ } catch (e) {
+ throw e;
+ } finally {
+ FS.closeStream(stream.fd);
+ }
+ },llseek:function (stream, offset, whence) {
+ if (!stream.seekable || !stream.stream_ops.llseek) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ return stream.stream_ops.llseek(stream, offset, whence);
+ },read:function (stream, buffer, offset, length, position) {
+ if (length < 0 || position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 1) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (FS.isDir(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!stream.stream_ops.read) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var seeking = true;
+ if (typeof position === 'undefined') {
+ position = stream.position;
+ seeking = false;
+ } else if (!stream.seekable) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ var bytesRead = stream.stream_ops.read(stream, buffer, offset, length, position);
+ if (!seeking) stream.position += bytesRead;
+ return bytesRead;
+ },write:function (stream, buffer, offset, length, position, canOwn) {
+ if (length < 0 || position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (FS.isDir(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!stream.stream_ops.write) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var seeking = true;
+ if (typeof position === 'undefined') {
+ position = stream.position;
+ seeking = false;
+ } else if (!stream.seekable) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ if (stream.flags & 1024) {
+ // seek to the end before writing in append mode
+ FS.llseek(stream, 0, 2);
+ }
+ var bytesWritten = stream.stream_ops.write(stream, buffer, offset, length, position, canOwn);
+ if (!seeking) stream.position += bytesWritten;
+ return bytesWritten;
+ },allocate:function (stream, offset, length) {
+ if (offset < 0 || length <= 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (!FS.isFile(stream.node.mode) && !FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ if (!stream.stream_ops.allocate) {
+ throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
+ }
+ stream.stream_ops.allocate(stream, offset, length);
+ },mmap:function (stream, buffer, offset, length, position, prot, flags) {
+ // TODO if PROT is PROT_WRITE, make sure we have write access
+ if ((stream.flags & 2097155) === 1) {
+ throw new FS.ErrnoError(ERRNO_CODES.EACCES);
+ }
+ if (!stream.stream_ops.mmap) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ return stream.stream_ops.mmap(stream, buffer, offset, length, position, prot, flags);
+ },ioctl:function (stream, cmd, arg) {
+ if (!stream.stream_ops.ioctl) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTTY);
+ }
+ return stream.stream_ops.ioctl(stream, cmd, arg);
+ },readFile:function (path, opts) {
+ opts = opts || {};
+ opts.flags = opts.flags || 'r';
+ opts.encoding = opts.encoding || 'binary';
+ if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
+ throw new Error('Invalid encoding type "' + opts.encoding + '"');
+ }
+ var ret;
+ var stream = FS.open(path, opts.flags);
+ var stat = FS.stat(path);
+ var length = stat.size;
+ var buf = new Uint8Array(length);
+ FS.read(stream, buf, 0, length, 0);
+ if (opts.encoding === 'utf8') {
+ ret = '';
+ var utf8 = new Runtime.UTF8Processor();
+ for (var i = 0; i < length; i++) {
+ ret += utf8.processCChar(buf[i]);
+ }
+ } else if (opts.encoding === 'binary') {
+ ret = buf;
+ }
+ FS.close(stream);
+ return ret;
+ },writeFile:function (path, data, opts) {
+ opts = opts || {};
+ opts.flags = opts.flags || 'w';
+ opts.encoding = opts.encoding || 'utf8';
+ if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
+ throw new Error('Invalid encoding type "' + opts.encoding + '"');
+ }
+ var stream = FS.open(path, opts.flags, opts.mode);
+ if (opts.encoding === 'utf8') {
+ var utf8 = new Runtime.UTF8Processor();
+ var buf = new Uint8Array(utf8.processJSString(data));
+ FS.write(stream, buf, 0, buf.length, 0, opts.canOwn);
+ } else if (opts.encoding === 'binary') {
+ FS.write(stream, data, 0, data.length, 0, opts.canOwn);
+ }
+ FS.close(stream);
+ },cwd:function () {
+ return FS.currentPath;
+ },chdir:function (path) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ if (!FS.isDir(lookup.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ var err = FS.nodePermissions(lookup.node, 'x');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ FS.currentPath = lookup.path;
+ },createDefaultDirectories:function () {
+ FS.mkdir('/tmp');
+ },createDefaultDevices:function () {
+ // create /dev
+ FS.mkdir('/dev');
+ // setup /dev/null
+ FS.registerDevice(FS.makedev(1, 3), {
+ read: function() { return 0; },
+ write: function() { return 0; }
+ });
+ FS.mkdev('/dev/null', FS.makedev(1, 3));
+ // setup /dev/tty and /dev/tty1
+ // stderr needs to print output using Module['printErr']
+ // so we register a second tty just for it.
+ TTY.register(FS.makedev(5, 0), TTY.default_tty_ops);
+ TTY.register(FS.makedev(6, 0), TTY.default_tty1_ops);
+ FS.mkdev('/dev/tty', FS.makedev(5, 0));
+ FS.mkdev('/dev/tty1', FS.makedev(6, 0));
+ // we're not going to emulate the actual shm device,
+ // just create the tmp dirs that reside in it commonly
+ FS.mkdir('/dev/shm');
+ FS.mkdir('/dev/shm/tmp');
+ },createStandardStreams:function () {
+ // TODO deprecate the old functionality of a single
+ // input / output callback and that utilizes FS.createDevice
+ // and instead require a unique set of stream ops
+
+ // by default, we symlink the standard streams to the
+ // default tty devices. however, if the standard streams
+ // have been overwritten we create a unique device for
+ // them instead.
+ if (Module['stdin']) {
+ FS.createDevice('/dev', 'stdin', Module['stdin']);
+ } else {
+ FS.symlink('/dev/tty', '/dev/stdin');
+ }
+ if (Module['stdout']) {
+ FS.createDevice('/dev', 'stdout', null, Module['stdout']);
+ } else {
+ FS.symlink('/dev/tty', '/dev/stdout');
+ }
+ if (Module['stderr']) {
+ FS.createDevice('/dev', 'stderr', null, Module['stderr']);
+ } else {
+ FS.symlink('/dev/tty1', '/dev/stderr');
+ }
+
+ // open default streams for the stdin, stdout and stderr devices
+ var stdin = FS.open('/dev/stdin', 'r');
+ HEAP32[((_stdin)>>2)]=FS.getPtrForStream(stdin);
+ assert(stdin.fd === 0, 'invalid handle for stdin (' + stdin.fd + ')');
+
+ var stdout = FS.open('/dev/stdout', 'w');
+ HEAP32[((_stdout)>>2)]=FS.getPtrForStream(stdout);
+ assert(stdout.fd === 1, 'invalid handle for stdout (' + stdout.fd + ')');
+
+ var stderr = FS.open('/dev/stderr', 'w');
+ HEAP32[((_stderr)>>2)]=FS.getPtrForStream(stderr);
+ assert(stderr.fd === 2, 'invalid handle for stderr (' + stderr.fd + ')');
+ },ensureErrnoError:function () {
+ if (FS.ErrnoError) return;
+ FS.ErrnoError = function ErrnoError(errno) {
+ this.errno = errno;
+ for (var key in ERRNO_CODES) {
+ if (ERRNO_CODES[key] === errno) {
+ this.code = key;
+ break;
+ }
+ }
+ this.message = ERRNO_MESSAGES[errno];
+ };
+ FS.ErrnoError.prototype = new Error();
+ FS.ErrnoError.prototype.constructor = FS.ErrnoError;
+ // Some errors may happen quite a bit, to avoid overhead we reuse them (and suffer a lack of stack info)
+ [ERRNO_CODES.ENOENT].forEach(function(code) {
+ FS.genericErrors[code] = new FS.ErrnoError(code);
+ FS.genericErrors[code].stack = '<generic error, no stack>';
+ });
+ },staticInit:function () {
+ FS.ensureErrnoError();
+
+ FS.nameTable = new Array(4096);
+
+ FS.mount(MEMFS, {}, '/');
+
+ FS.createDefaultDirectories();
+ FS.createDefaultDevices();
+ },init:function (input, output, error) {
+ assert(!FS.init.initialized, 'FS.init was previously called. If you want to initialize later with custom parameters, remove any earlier calls (note that one is automatically added to the generated code)');
+ FS.init.initialized = true;
+
+ FS.ensureErrnoError();
+
+ // Allow Module.stdin etc. to provide defaults, if none explicitly passed to us here
+ Module['stdin'] = input || Module['stdin'];
+ Module['stdout'] = output || Module['stdout'];
+ Module['stderr'] = error || Module['stderr'];
+
+ FS.createStandardStreams();
+ },quit:function () {
+ FS.init.initialized = false;
+ for (var i = 0; i < FS.streams.length; i++) {
+ var stream = FS.streams[i];
+ if (!stream) {
+ continue;
+ }
+ FS.close(stream);
+ }
+ },getMode:function (canRead, canWrite) {
+ var mode = 0;
+ if (canRead) mode |= 292 | 73;
+ if (canWrite) mode |= 146;
+ return mode;
+ },joinPath:function (parts, forceRelative) {
+ var path = PATH.join.apply(null, parts);
+ if (forceRelative && path[0] == '/') path = path.substr(1);
+ return path;
+ },absolutePath:function (relative, base) {
+ return PATH.resolve(base, relative);
+ },standardizePath:function (path) {
+ return PATH.normalize(path);
+ },findObject:function (path, dontResolveLastLink) {
+ var ret = FS.analyzePath(path, dontResolveLastLink);
+ if (ret.exists) {
+ return ret.object;
+ } else {
+ ___setErrNo(ret.error);
+ return null;
+ }
+ },analyzePath:function (path, dontResolveLastLink) {
+ // operate from within the context of the symlink's target
+ try {
+ var lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
+ path = lookup.path;
+ } catch (e) {
+ }
+ var ret = {
+ isRoot: false, exists: false, error: 0, name: null, path: null, object: null,
+ parentExists: false, parentPath: null, parentObject: null
+ };
+ try {
+ var lookup = FS.lookupPath(path, { parent: true });
+ ret.parentExists = true;
+ ret.parentPath = lookup.path;
+ ret.parentObject = lookup.node;
+ ret.name = PATH.basename(path);
+ lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
+ ret.exists = true;
+ ret.path = lookup.path;
+ ret.object = lookup.node;
+ ret.name = lookup.node.name;
+ ret.isRoot = lookup.path === '/';
+ } catch (e) {
+ ret.error = e.errno;
+ };
+ return ret;
+ },createFolder:function (parent, name, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(canRead, canWrite);
+ return FS.mkdir(path, mode);
+ },createPath:function (parent, path, canRead, canWrite) {
+ parent = typeof parent === 'string' ? parent : FS.getPath(parent);
+ var parts = path.split('/').reverse();
+ while (parts.length) {
+ var part = parts.pop();
+ if (!part) continue;
+ var current = PATH.join2(parent, part);
+ try {
+ FS.mkdir(current);
+ } catch (e) {
+ // ignore EEXIST
+ }
+ parent = current;
+ }
+ return current;
+ },createFile:function (parent, name, properties, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(canRead, canWrite);
+ return FS.create(path, mode);
+ },createDataFile:function (parent, name, data, canRead, canWrite, canOwn) {
+ var path = name ? PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name) : parent;
+ var mode = FS.getMode(canRead, canWrite);
+ var node = FS.create(path, mode);
+ if (data) {
+ if (typeof data === 'string') {
+ var arr = new Array(data.length);
+ for (var i = 0, len = data.length; i < len; ++i) arr[i] = data.charCodeAt(i);
+ data = arr;
+ }
+ // make sure we can write to the file
+ FS.chmod(node, mode | 146);
+ var stream = FS.open(node, 'w');
+ FS.write(stream, data, 0, data.length, 0, canOwn);
+ FS.close(stream);
+ FS.chmod(node, mode);
+ }
+ return node;
+ },createDevice:function (parent, name, input, output) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(!!input, !!output);
+ if (!FS.createDevice.major) FS.createDevice.major = 64;
+ var dev = FS.makedev(FS.createDevice.major++, 0);
+ // Create a fake device that a set of stream ops to emulate
+ // the old behavior.
+ FS.registerDevice(dev, {
+ open: function(stream) {
+ stream.seekable = false;
+ },
+ close: function(stream) {
+ // flush any pending line data
+ if (output && output.buffer && output.buffer.length) {
+ output(10);
+ }
+ },
+ read: function(stream, buffer, offset, length, pos /* ignored */) {
+ var bytesRead = 0;
+ for (var i = 0; i < length; i++) {
+ var result;
+ try {
+ result = input();
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ if (result === undefined && bytesRead === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ if (result === null || result === undefined) break;
+ bytesRead++;
+ buffer[offset+i] = result;
+ }
+ if (bytesRead) {
+ stream.node.timestamp = Date.now();
+ }
+ return bytesRead;
+ },
+ write: function(stream, buffer, offset, length, pos) {
+ for (var i = 0; i < length; i++) {
+ try {
+ output(buffer[offset+i]);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ }
+ if (length) {
+ stream.node.timestamp = Date.now();
+ }
+ return i;
+ }
+ });
+ return FS.mkdev(path, mode, dev);
+ },createLink:function (parent, name, target, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ return FS.symlink(target, path);
+ },forceLoadFile:function (obj) {
+ if (obj.isDevice || obj.isFolder || obj.link || obj.contents) return true;
+ var success = true;
+ if (typeof XMLHttpRequest !== 'undefined') {
+ throw new Error("Lazy loading should have been performed (contents set) in createLazyFile, but it was not. Lazy loading only works in web workers. Use --embed-file or --preload-file in emcc on the main thread.");
+ } else if (Module['read']) {
+ // Command-line.
+ try {
+ // WARNING: Can't read binary files in V8's d8 or tracemonkey's js, as
+ // read() will try to parse UTF8.
+ obj.contents = intArrayFromString(Module['read'](obj.url), true);
+ } catch (e) {
+ success = false;
+ }
+ } else {
+ throw new Error('Cannot load without read() or XMLHttpRequest.');
+ }
+ if (!success) ___setErrNo(ERRNO_CODES.EIO);
+ return success;
+ },createLazyFile:function (parent, name, url, canRead, canWrite) {
+ // Lazy chunked Uint8Array (implements get and length from Uint8Array). Actual getting is abstracted away for eventual reuse.
+ function LazyUint8Array() {
+ this.lengthKnown = false;
+ this.chunks = []; // Loaded chunks. Index is the chunk number
+ }
+ LazyUint8Array.prototype.get = function LazyUint8Array_get(idx) {
+ if (idx > this.length-1 || idx < 0) {
+ return undefined;
+ }
+ var chunkOffset = idx % this.chunkSize;
+ var chunkNum = Math.floor(idx / this.chunkSize);
+ return this.getter(chunkNum)[chunkOffset];
+ }
+ LazyUint8Array.prototype.setDataGetter = function LazyUint8Array_setDataGetter(getter) {
+ this.getter = getter;
+ }
+ LazyUint8Array.prototype.cacheLength = function LazyUint8Array_cacheLength() {
+ // Find length
+ var xhr = new XMLHttpRequest();
+ xhr.open('HEAD', url, false);
+ xhr.send(null);
+ if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
+ var datalength = Number(xhr.getResponseHeader("Content-length"));
+ var header;
+ var hasByteServing = (header = xhr.getResponseHeader("Accept-Ranges")) && header === "bytes";
+ var chunkSize = 1024*1024; // Chunk size in bytes
+
+ if (!hasByteServing) chunkSize = datalength;
+
+ // Function to get a range from the remote URL.
+ var doXHR = (function(from, to) {
+ if (from > to) throw new Error("invalid range (" + from + ", " + to + ") or no bytes requested!");
+ if (to > datalength-1) throw new Error("only " + datalength + " bytes available! programmer error!");
+
+ // TODO: Use mozResponseArrayBuffer, responseStream, etc. if available.
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, false);
+ if (datalength !== chunkSize) xhr.setRequestHeader("Range", "bytes=" + from + "-" + to);
+
+ // Some hints to the browser that we want binary data.
+ if (typeof Uint8Array != 'undefined') xhr.responseType = 'arraybuffer';
+ if (xhr.overrideMimeType) {
+ xhr.overrideMimeType('text/plain; charset=x-user-defined');
+ }
+
+ xhr.send(null);
+ if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
+ if (xhr.response !== undefined) {
+ return new Uint8Array(xhr.response || []);
+ } else {
+ return intArrayFromString(xhr.responseText || '', true);
+ }
+ });
+ var lazyArray = this;
+ lazyArray.setDataGetter(function(chunkNum) {
+ var start = chunkNum * chunkSize;
+ var end = (chunkNum+1) * chunkSize - 1; // including this byte
+ end = Math.min(end, datalength-1); // if datalength-1 is selected, this is the last block
+ if (typeof(lazyArray.chunks[chunkNum]) === "undefined") {
+ lazyArray.chunks[chunkNum] = doXHR(start, end);
+ }
+ if (typeof(lazyArray.chunks[chunkNum]) === "undefined") throw new Error("doXHR failed!");
+ return lazyArray.chunks[chunkNum];
+ });
+
+ this._length = datalength;
+ this._chunkSize = chunkSize;
+ this.lengthKnown = true;
+ }
+ if (typeof XMLHttpRequest !== 'undefined') {
+ if (!ENVIRONMENT_IS_WORKER) throw 'Cannot do synchronous binary XHRs outside webworkers in modern browsers. Use --embed-file or --preload-file in emcc';
+ var lazyArray = new LazyUint8Array();
+ Object.defineProperty(lazyArray, "length", {
+ get: function() {
+ if(!this.lengthKnown) {
+ this.cacheLength();
+ }
+ return this._length;
+ }
+ });
+ Object.defineProperty(lazyArray, "chunkSize", {
+ get: function() {
+ if(!this.lengthKnown) {
+ this.cacheLength();
+ }
+ return this._chunkSize;
+ }
+ });
+
+ var properties = { isDevice: false, contents: lazyArray };
+ } else {
+ var properties = { isDevice: false, url: url };
+ }
+
+ var node = FS.createFile(parent, name, properties, canRead, canWrite);
+ // This is a total hack, but I want to get this lazy file code out of the
+ // core of MEMFS. If we want to keep this lazy file concept I feel it should
+ // be its own thin LAZYFS proxying calls to MEMFS.
+ if (properties.contents) {
+ node.contents = properties.contents;
+ } else if (properties.url) {
+ node.contents = null;
+ node.url = properties.url;
+ }
+ // override each stream op with one that tries to force load the lazy file first
+ var stream_ops = {};
+ var keys = Object.keys(node.stream_ops);
+ keys.forEach(function(key) {
+ var fn = node.stream_ops[key];
+ stream_ops[key] = function forceLoadLazyFile() {
+ if (!FS.forceLoadFile(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ return fn.apply(null, arguments);
+ };
+ });
+ // use a custom read function
+ stream_ops.read = function stream_ops_read(stream, buffer, offset, length, position) {
+ if (!FS.forceLoadFile(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ var contents = stream.node.contents;
+ if (position >= contents.length)
+ return 0;
+ var size = Math.min(contents.length - position, length);
+ assert(size >= 0);
+ if (contents.slice) { // normal array
+ for (var i = 0; i < size; i++) {
+ buffer[offset + i] = contents[position + i];
+ }
+ } else {
+ for (var i = 0; i < size; i++) { // LazyUint8Array from sync binary XHR
+ buffer[offset + i] = contents.get(position + i);
+ }
+ }
+ return size;
+ };
+ node.stream_ops = stream_ops;
+ return node;
+ },createPreloadedFile:function (parent, name, url, canRead, canWrite, onload, onerror, dontCreateFile, canOwn) {
+ Browser.init();
+ // TODO we should allow people to just pass in a complete filename instead
+ // of parent and name being that we just join them anyways
+ var fullname = name ? PATH.resolve(PATH.join2(parent, name)) : parent;
+ function processData(byteArray) {
+ function finish(byteArray) {
+ if (!dontCreateFile) {
+ FS.createDataFile(parent, name, byteArray, canRead, canWrite, canOwn);
+ }
+ if (onload) onload();
+ removeRunDependency('cp ' + fullname);
+ }
+ var handled = false;
+ Module['preloadPlugins'].forEach(function(plugin) {
+ if (handled) return;
+ if (plugin['canHandle'](fullname)) {
+ plugin['handle'](byteArray, fullname, finish, function() {
+ if (onerror) onerror();
+ removeRunDependency('cp ' + fullname);
+ });
+ handled = true;
+ }
+ });
+ if (!handled) finish(byteArray);
+ }
+ addRunDependency('cp ' + fullname);
+ if (typeof url == 'string') {
+ Browser.asyncLoad(url, function(byteArray) {
+ processData(byteArray);
+ }, onerror);
+ } else {
+ processData(url);
+ }
+ },indexedDB:function () {
+ return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
+ },DB_NAME:function () {
+ return 'EM_FS_' + window.location.pathname;
+ },DB_VERSION:20,DB_STORE_NAME:"FILE_DATA",saveFilesToDB:function (paths, onload, onerror) {
+ onload = onload || function(){};
+ onerror = onerror || function(){};
+ var indexedDB = FS.indexedDB();
+ try {
+ var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
+ } catch (e) {
+ return onerror(e);
+ }
+ openRequest.onupgradeneeded = function openRequest_onupgradeneeded() {
+ console.log('creating db');
+ var db = openRequest.result;
+ db.createObjectStore(FS.DB_STORE_NAME);
+ };
+ openRequest.onsuccess = function openRequest_onsuccess() {
+ var db = openRequest.result;
+ var transaction = db.transaction([FS.DB_STORE_NAME], 'readwrite');
+ var files = transaction.objectStore(FS.DB_STORE_NAME);
+ var ok = 0, fail = 0, total = paths.length;
+ function finish() {
+ if (fail == 0) onload(); else onerror();
+ }
+ paths.forEach(function(path) {
+ var putRequest = files.put(FS.analyzePath(path).object.contents, path);
+ putRequest.onsuccess = function putRequest_onsuccess() { ok++; if (ok + fail == total) finish() };
+ putRequest.onerror = function putRequest_onerror() { fail++; if (ok + fail == total) finish() };
+ });
+ transaction.onerror = onerror;
+ };
+ openRequest.onerror = onerror;
+ },loadFilesFromDB:function (paths, onload, onerror) {
+ onload = onload || function(){};
+ onerror = onerror || function(){};
+ var indexedDB = FS.indexedDB();
+ try {
+ var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
+ } catch (e) {
+ return onerror(e);
+ }
+ openRequest.onupgradeneeded = onerror; // no database to load from
+ openRequest.onsuccess = function openRequest_onsuccess() {
+ var db = openRequest.result;
+ try {
+ var transaction = db.transaction([FS.DB_STORE_NAME], 'readonly');
+ } catch(e) {
+ onerror(e);
+ return;
+ }
+ var files = transaction.objectStore(FS.DB_STORE_NAME);
+ var ok = 0, fail = 0, total = paths.length;
+ function finish() {
+ if (fail == 0) onload(); else onerror();
+ }
+ paths.forEach(function(path) {
+ var getRequest = files.get(path);
+ getRequest.onsuccess = function getRequest_onsuccess() {
+ if (FS.analyzePath(path).exists) {
+ FS.unlink(path);
+ }
+ FS.createDataFile(PATH.dirname(path), PATH.basename(path), getRequest.result, true, true, true);
+ ok++;
+ if (ok + fail == total) finish();
+ };
+ getRequest.onerror = function getRequest_onerror() { fail++; if (ok + fail == total) finish() };
+ });
+ transaction.onerror = onerror;
+ };
+ openRequest.onerror = onerror;
+ }};var PATH={splitPath:function (filename) {
+ var splitPathRe = /^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/;
+ return splitPathRe.exec(filename).slice(1);
+ },normalizeArray:function (parts, allowAboveRoot) {
+ // if the path tries to go above the root, `up` ends up > 0
+ var up = 0;
+ for (var i = parts.length - 1; i >= 0; i--) {
+ var last = parts[i];
+ if (last === '.') {
+ parts.splice(i, 1);
+ } else if (last === '..') {
+ parts.splice(i, 1);
+ up++;
+ } else if (up) {
+ parts.splice(i, 1);
+ up--;
+ }
+ }
+ // if the path is allowed to go above the root, restore leading ..s
+ if (allowAboveRoot) {
+ for (; up--; up) {
+ parts.unshift('..');
+ }
+ }
+ return parts;
+ },normalize:function (path) {
+ var isAbsolute = path.charAt(0) === '/',
+ trailingSlash = path.substr(-1) === '/';
+ // Normalize the path
+ path = PATH.normalizeArray(path.split('/').filter(function(p) {
+ return !!p;
+ }), !isAbsolute).join('/');
+ if (!path && !isAbsolute) {
+ path = '.';
+ }
+ if (path && trailingSlash) {
+ path += '/';
+ }
+ return (isAbsolute ? '/' : '') + path;
+ },dirname:function (path) {
+ var result = PATH.splitPath(path),
+ root = result[0],
+ dir = result[1];
+ if (!root && !dir) {
+ // No dirname whatsoever
+ return '.';
+ }
+ if (dir) {
+ // It has a dirname, strip trailing slash
+ dir = dir.substr(0, dir.length - 1);
+ }
+ return root + dir;
+ },basename:function (path) {
+ // EMSCRIPTEN return '/'' for '/', not an empty string
+ if (path === '/') return '/';
+ var lastSlash = path.lastIndexOf('/');
+ if (lastSlash === -1) return path;
+ return path.substr(lastSlash+1);
+ },extname:function (path) {
+ return PATH.splitPath(path)[3];
+ },join:function () {
+ var paths = Array.prototype.slice.call(arguments, 0);
+ return PATH.normalize(paths.join('/'));
+ },join2:function (l, r) {
+ return PATH.normalize(l + '/' + r);
+ },resolve:function () {
+ var resolvedPath = '',
+ resolvedAbsolute = false;
+ for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {
+ var path = (i >= 0) ? arguments[i] : FS.cwd();
+ // Skip empty and invalid entries
+ if (typeof path !== 'string') {
+ throw new TypeError('Arguments to path.resolve must be strings');
+ } else if (!path) {
+ continue;
+ }
+ resolvedPath = path + '/' + resolvedPath;
+ resolvedAbsolute = path.charAt(0) === '/';
+ }
+ // At this point the path should be resolved to a full absolute path, but
+ // handle relative paths to be safe (might happen when process.cwd() fails)
+ resolvedPath = PATH.normalizeArray(resolvedPath.split('/').filter(function(p) {
+ return !!p;
+ }), !resolvedAbsolute).join('/');
+ return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.';
+ },relative:function (from, to) {
+ from = PATH.resolve(from).substr(1);
+ to = PATH.resolve(to).substr(1);
+ function trim(arr) {
+ var start = 0;
+ for (; start < arr.length; start++) {
+ if (arr[start] !== '') break;
+ }
+ var end = arr.length - 1;
+ for (; end >= 0; end--) {
+ if (arr[end] !== '') break;
+ }
+ if (start > end) return [];
+ return arr.slice(start, end - start + 1);
+ }
+ var fromParts = trim(from.split('/'));
+ var toParts = trim(to.split('/'));
+ var length = Math.min(fromParts.length, toParts.length);
+ var samePartsLength = length;
+ for (var i = 0; i < length; i++) {
+ if (fromParts[i] !== toParts[i]) {
+ samePartsLength = i;
+ break;
+ }
+ }
+ var outputParts = [];
+ for (var i = samePartsLength; i < fromParts.length; i++) {
+ outputParts.push('..');
+ }
+ outputParts = outputParts.concat(toParts.slice(samePartsLength));
+ return outputParts.join('/');
+ }};var Browser={mainLoop:{scheduler:null,method:"",shouldPause:false,paused:false,queue:[],pause:function () {
+ Browser.mainLoop.shouldPause = true;
+ },resume:function () {
+ if (Browser.mainLoop.paused) {
+ Browser.mainLoop.paused = false;
+ Browser.mainLoop.scheduler();
+ }
+ Browser.mainLoop.shouldPause = false;
+ },updateStatus:function () {
+ if (Module['setStatus']) {
+ var message = Module['statusMessage'] || 'Please wait...';
+ var remaining = Browser.mainLoop.remainingBlockers;
+ var expected = Browser.mainLoop.expectedBlockers;
+ if (remaining) {
+ if (remaining < expected) {
+ Module['setStatus'](message + ' (' + (expected - remaining) + '/' + expected + ')');
+ } else {
+ Module['setStatus'](message);
+ }
+ } else {
+ Module['setStatus']('');
+ }
+ }
+ }},isFullScreen:false,pointerLock:false,moduleContextCreatedCallbacks:[],workers:[],init:function () {
+ if (!Module["preloadPlugins"]) Module["preloadPlugins"] = []; // needs to exist even in workers
+
+ if (Browser.initted || ENVIRONMENT_IS_WORKER) return;
+ Browser.initted = true;
+
+ try {
+ new Blob();
+ Browser.hasBlobConstructor = true;
+ } catch(e) {
+ Browser.hasBlobConstructor = false;
+ console.log("warning: no blob constructor, cannot create blobs with mimetypes");
+ }
+ Browser.BlobBuilder = typeof MozBlobBuilder != "undefined" ? MozBlobBuilder : (typeof WebKitBlobBuilder != "undefined" ? WebKitBlobBuilder : (!Browser.hasBlobConstructor ? console.log("warning: no BlobBuilder") : null));
+ Browser.URLObject = typeof window != "undefined" ? (window.URL ? window.URL : window.webkitURL) : undefined;
+ if (!Module.noImageDecoding && typeof Browser.URLObject === 'undefined') {
+ console.log("warning: Browser does not support creating object URLs. Built-in browser image decoding will not be available.");
+ Module.noImageDecoding = true;
+ }
+
+ // Support for plugins that can process preloaded files. You can add more of these to
+ // your app by creating and appending to Module.preloadPlugins.
+ //
+ // Each plugin is asked if it can handle a file based on the file's name. If it can,
+ // it is given the file's raw data. When it is done, it calls a callback with the file's
+ // (possibly modified) data. For example, a plugin might decompress a file, or it
+ // might create some side data structure for use later (like an Image element, etc.).
+
+ var imagePlugin = {};
+ imagePlugin['canHandle'] = function imagePlugin_canHandle(name) {
+ return !Module.noImageDecoding && /\.(jpg|jpeg|png|bmp)$/i.test(name);
+ };
+ imagePlugin['handle'] = function imagePlugin_handle(byteArray, name, onload, onerror) {
+ var b = null;
+ if (Browser.hasBlobConstructor) {
+ try {
+ b = new Blob([byteArray], { type: Browser.getMimetype(name) });
+ if (b.size !== byteArray.length) { // Safari bug #118630
+ // Safari's Blob can only take an ArrayBuffer
+ b = new Blob([(new Uint8Array(byteArray)).buffer], { type: Browser.getMimetype(name) });
+ }
+ } catch(e) {
+ Runtime.warnOnce('Blob constructor present but fails: ' + e + '; falling back to blob builder');
+ }
+ }
+ if (!b) {
+ var bb = new Browser.BlobBuilder();
+ bb.append((new Uint8Array(byteArray)).buffer); // we need to pass a buffer, and must copy the array to get the right data range
+ b = bb.getBlob();
+ }
+ var url = Browser.URLObject.createObjectURL(b);
+ var img = new Image();
+ img.onload = function img_onload() {
+ assert(img.complete, 'Image ' + name + ' could not be decoded');
+ var canvas = document.createElement('canvas');
+ canvas.width = img.width;
+ canvas.height = img.height;
+ var ctx = canvas.getContext('2d');
+ ctx.drawImage(img, 0, 0);
+ Module["preloadedImages"][name] = canvas;
+ Browser.URLObject.revokeObjectURL(url);
+ if (onload) onload(byteArray);
+ };
+ img.onerror = function img_onerror(event) {
+ console.log('Image ' + url + ' could not be decoded');
+ if (onerror) onerror();
+ };
+ img.src = url;
+ };
+ Module['preloadPlugins'].push(imagePlugin);
+
+ var audioPlugin = {};
+ audioPlugin['canHandle'] = function audioPlugin_canHandle(name) {
+ return !Module.noAudioDecoding && name.substr(-4) in { '.ogg': 1, '.wav': 1, '.mp3': 1 };
+ };
+ audioPlugin['handle'] = function audioPlugin_handle(byteArray, name, onload, onerror) {
+ var done = false;
+ function finish(audio) {
+ if (done) return;
+ done = true;
+ Module["preloadedAudios"][name] = audio;
+ if (onload) onload(byteArray);
+ }
+ function fail() {
+ if (done) return;
+ done = true;
+ Module["preloadedAudios"][name] = new Audio(); // empty shim
+ if (onerror) onerror();
+ }
+ if (Browser.hasBlobConstructor) {
+ try {
+ var b = new Blob([byteArray], { type: Browser.getMimetype(name) });
+ } catch(e) {
+ return fail();
+ }
+ var url = Browser.URLObject.createObjectURL(b); // XXX we never revoke this!
+ var audio = new Audio();
+ audio.addEventListener('canplaythrough', function() { finish(audio) }, false); // use addEventListener due to chromium bug 124926
+ audio.onerror = function audio_onerror(event) {
+ if (done) return;
+ console.log('warning: browser could not fully decode audio ' + name + ', trying slower base64 approach');
+ function encode64(data) {
+ var BASE = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
+ var PAD = '=';
+ var ret = '';
+ var leftchar = 0;
+ var leftbits = 0;
+ for (var i = 0; i < data.length; i++) {
+ leftchar = (leftchar << 8) | data[i];
+ leftbits += 8;
+ while (leftbits >= 6) {
+ var curr = (leftchar >> (leftbits-6)) & 0x3f;
+ leftbits -= 6;
+ ret += BASE[curr];
+ }
+ }
+ if (leftbits == 2) {
+ ret += BASE[(leftchar&3) << 4];
+ ret += PAD + PAD;
+ } else if (leftbits == 4) {
+ ret += BASE[(leftchar&0xf) << 2];
+ ret += PAD;
+ }
+ return ret;
+ }
+ audio.src = 'data:audio/x-' + name.substr(-3) + ';base64,' + encode64(byteArray);
+ finish(audio); // we don't wait for confirmation this worked - but it's worth trying
+ };
+ audio.src = url;
+ // workaround for chrome bug 124926 - we do not always get oncanplaythrough or onerror
+ Browser.safeSetTimeout(function() {
+ finish(audio); // try to use it even though it is not necessarily ready to play
+ }, 10000);
+ } else {
+ return fail();
+ }
+ };
+ Module['preloadPlugins'].push(audioPlugin);
+
+ // Canvas event setup
+
+ var canvas = Module['canvas'];
+
+ // forced aspect ratio can be enabled by defining 'forcedAspectRatio' on Module
+ // Module['forcedAspectRatio'] = 4 / 3;
+
+ canvas.requestPointerLock = canvas['requestPointerLock'] ||
+ canvas['mozRequestPointerLock'] ||
+ canvas['webkitRequestPointerLock'] ||
+ canvas['msRequestPointerLock'] ||
+ function(){};
+ canvas.exitPointerLock = document['exitPointerLock'] ||
+ document['mozExitPointerLock'] ||
+ document['webkitExitPointerLock'] ||
+ document['msExitPointerLock'] ||
+ function(){}; // no-op if function does not exist
+ canvas.exitPointerLock = canvas.exitPointerLock.bind(document);
+
+ function pointerLockChange() {
+ Browser.pointerLock = document['pointerLockElement'] === canvas ||
+ document['mozPointerLockElement'] === canvas ||
+ document['webkitPointerLockElement'] === canvas ||
+ document['msPointerLockElement'] === canvas;
+ }
+
+ document.addEventListener('pointerlockchange', pointerLockChange, false);
+ document.addEventListener('mozpointerlockchange', pointerLockChange, false);
+ document.addEventListener('webkitpointerlockchange', pointerLockChange, false);
+ document.addEventListener('mspointerlockchange', pointerLockChange, false);
+
+ if (Module['elementPointerLock']) {
+ canvas.addEventListener("click", function(ev) {
+ if (!Browser.pointerLock && canvas.requestPointerLock) {
+ canvas.requestPointerLock();
+ ev.preventDefault();
+ }
+ }, false);
+ }
+ },createContext:function (canvas, useWebGL, setInModule, webGLContextAttributes) {
+ var ctx;
+ var errorInfo = '?';
+ function onContextCreationError(event) {
+ errorInfo = event.statusMessage || errorInfo;
+ }
+ try {
+ if (useWebGL) {
+ var contextAttributes = {
+ antialias: false,
+ alpha: false
+ };
+
+ if (webGLContextAttributes) {
+ for (var attribute in webGLContextAttributes) {
+ contextAttributes[attribute] = webGLContextAttributes[attribute];
+ }
+ }
+
+
+ canvas.addEventListener('webglcontextcreationerror', onContextCreationError, false);
+ try {
+ ['experimental-webgl', 'webgl'].some(function(webglId) {
+ return ctx = canvas.getContext(webglId, contextAttributes);
+ });
+ } finally {
+ canvas.removeEventListener('webglcontextcreationerror', onContextCreationError, false);
+ }
+ } else {
+ ctx = canvas.getContext('2d');
+ }
+ if (!ctx) throw ':(';
+ } catch (e) {
+ Module.print('Could not create canvas: ' + [errorInfo, e]);
+ return null;
+ }
+ if (useWebGL) {
+ // Set the background of the WebGL canvas to black
+ canvas.style.backgroundColor = "black";
+
+ // Warn on context loss
+ canvas.addEventListener('webglcontextlost', function(event) {
+ alert('WebGL context lost. You will need to reload the page.');
+ }, false);
+ }
+ if (setInModule) {
+ GLctx = Module.ctx = ctx;
+ Module.useWebGL = useWebGL;
+ Browser.moduleContextCreatedCallbacks.forEach(function(callback) { callback() });
+ Browser.init();
+ }
+ return ctx;
+ },destroyContext:function (canvas, useWebGL, setInModule) {},fullScreenHandlersInstalled:false,lockPointer:undefined,resizeCanvas:undefined,requestFullScreen:function (lockPointer, resizeCanvas) {
+ Browser.lockPointer = lockPointer;
+ Browser.resizeCanvas = resizeCanvas;
+ if (typeof Browser.lockPointer === 'undefined') Browser.lockPointer = true;
+ if (typeof Browser.resizeCanvas === 'undefined') Browser.resizeCanvas = false;
+
+ var canvas = Module['canvas'];
+ function fullScreenChange() {
+ Browser.isFullScreen = false;
+ var canvasContainer = canvas.parentNode;
+ if ((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
+ document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
+ document['fullScreenElement'] || document['fullscreenElement'] ||
+ document['msFullScreenElement'] || document['msFullscreenElement'] ||
+ document['webkitCurrentFullScreenElement']) === canvasContainer) {
+ canvas.cancelFullScreen = document['cancelFullScreen'] ||
+ document['mozCancelFullScreen'] ||
+ document['webkitCancelFullScreen'] ||
+ document['msExitFullscreen'] ||
+ document['exitFullscreen'] ||
+ function() {};
+ canvas.cancelFullScreen = canvas.cancelFullScreen.bind(document);
+ if (Browser.lockPointer) canvas.requestPointerLock();
+ Browser.isFullScreen = true;
+ if (Browser.resizeCanvas) Browser.setFullScreenCanvasSize();
+ } else {
+
+ // remove the full screen specific parent of the canvas again to restore the HTML structure from before going full screen
+ canvasContainer.parentNode.insertBefore(canvas, canvasContainer);
+ canvasContainer.parentNode.removeChild(canvasContainer);
+
+ if (Browser.resizeCanvas) Browser.setWindowedCanvasSize();
+ }
+ if (Module['onFullScreen']) Module['onFullScreen'](Browser.isFullScreen);
+ Browser.updateCanvasDimensions(canvas);
+ }
+
+ if (!Browser.fullScreenHandlersInstalled) {
+ Browser.fullScreenHandlersInstalled = true;
+ document.addEventListener('fullscreenchange', fullScreenChange, false);
+ document.addEventListener('mozfullscreenchange', fullScreenChange, false);
+ document.addEventListener('webkitfullscreenchange', fullScreenChange, false);
+ document.addEventListener('MSFullscreenChange', fullScreenChange, false);
+ }
+
+ // create a new parent to ensure the canvas has no siblings. this allows browsers to optimize full screen performance when its parent is the full screen root
+ var canvasContainer = document.createElement("div");
+ canvas.parentNode.insertBefore(canvasContainer, canvas);
+ canvasContainer.appendChild(canvas);
+
+ // use parent of canvas as full screen root to allow aspect ratio correction (Firefox stretches the root to screen size)
+ canvasContainer.requestFullScreen = canvasContainer['requestFullScreen'] ||
+ canvasContainer['mozRequestFullScreen'] ||
+ canvasContainer['msRequestFullscreen'] ||
+ (canvasContainer['webkitRequestFullScreen'] ? function() { canvasContainer['webkitRequestFullScreen'](Element['ALLOW_KEYBOARD_INPUT']) } : null);
+ canvasContainer.requestFullScreen();
+ },requestAnimationFrame:function requestAnimationFrame(func) {
+ if (typeof window === 'undefined') { // Provide fallback to setTimeout if window is undefined (e.g. in Node.js)
+ setTimeout(func, 1000/60);
+ } else {
+ if (!window.requestAnimationFrame) {
+ window.requestAnimationFrame = window['requestAnimationFrame'] ||
+ window['mozRequestAnimationFrame'] ||
+ window['webkitRequestAnimationFrame'] ||
+ window['msRequestAnimationFrame'] ||
+ window['oRequestAnimationFrame'] ||
+ window['setTimeout'];
+ }
+ window.requestAnimationFrame(func);
+ }
+ },safeCallback:function (func) {
+ return function() {
+ if (!ABORT) return func.apply(null, arguments);
+ };
+ },safeRequestAnimationFrame:function (func) {
+ return Browser.requestAnimationFrame(function() {
+ if (!ABORT) func();
+ });
+ },safeSetTimeout:function (func, timeout) {
+ return setTimeout(function() {
+ if (!ABORT) func();
+ }, timeout);
+ },safeSetInterval:function (func, timeout) {
+ return setInterval(function() {
+ if (!ABORT) func();
+ }, timeout);
+ },getMimetype:function (name) {
+ return {
+ 'jpg': 'image/jpeg',
+ 'jpeg': 'image/jpeg',
+ 'png': 'image/png',
+ 'bmp': 'image/bmp',
+ 'ogg': 'audio/ogg',
+ 'wav': 'audio/wav',
+ 'mp3': 'audio/mpeg'
+ }[name.substr(name.lastIndexOf('.')+1)];
+ },getUserMedia:function (func) {
+ if(!window.getUserMedia) {
+ window.getUserMedia = navigator['getUserMedia'] ||
+ navigator['mozGetUserMedia'];
+ }
+ window.getUserMedia(func);
+ },getMovementX:function (event) {
+ return event['movementX'] ||
+ event['mozMovementX'] ||
+ event['webkitMovementX'] ||
+ 0;
+ },getMovementY:function (event) {
+ return event['movementY'] ||
+ event['mozMovementY'] ||
+ event['webkitMovementY'] ||
+ 0;
+ },getMouseWheelDelta:function (event) {
+ return Math.max(-1, Math.min(1, event.type === 'DOMMouseScroll' ? event.detail : -event.wheelDelta));
+ },mouseX:0,mouseY:0,mouseMovementX:0,mouseMovementY:0,calculateMouseEvent:function (event) { // event should be mousemove, mousedown or mouseup
+ if (Browser.pointerLock) {
+ // When the pointer is locked, calculate the coordinates
+ // based on the movement of the mouse.
+ // Workaround for Firefox bug 764498
+ if (event.type != 'mousemove' &&
+ ('mozMovementX' in event)) {
+ Browser.mouseMovementX = Browser.mouseMovementY = 0;
+ } else {
+ Browser.mouseMovementX = Browser.getMovementX(event);
+ Browser.mouseMovementY = Browser.getMovementY(event);
+ }
+
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ Browser.mouseX = SDL.mouseX + Browser.mouseMovementX;
+ Browser.mouseY = SDL.mouseY + Browser.mouseMovementY;
+ } else {
+ // just add the mouse delta to the current absolut mouse position
+ // FIXME: ideally this should be clamped against the canvas size and zero
+ Browser.mouseX += Browser.mouseMovementX;
+ Browser.mouseY += Browser.mouseMovementY;
+ }
+ } else {
+ // Otherwise, calculate the movement based on the changes
+ // in the coordinates.
+ var rect = Module["canvas"].getBoundingClientRect();
+ var x, y;
+
+ // Neither .scrollX or .pageXOffset are defined in a spec, but
+ // we prefer .scrollX because it is currently in a spec draft.
+ // (see: http://www.w3.org/TR/2013/WD-cssom-view-20131217/)
+ var scrollX = ((typeof window.scrollX !== 'undefined') ? window.scrollX : window.pageXOffset);
+ var scrollY = ((typeof window.scrollY !== 'undefined') ? window.scrollY : window.pageYOffset);
+ if (event.type == 'touchstart' ||
+ event.type == 'touchend' ||
+ event.type == 'touchmove') {
+ var t = event.touches.item(0);
+ if (t) {
+ x = t.pageX - (scrollX + rect.left);
+ y = t.pageY - (scrollY + rect.top);
+ } else {
+ return;
+ }
+ } else {
+ x = event.pageX - (scrollX + rect.left);
+ y = event.pageY - (scrollY + rect.top);
+ }
+
+ // the canvas might be CSS-scaled compared to its backbuffer;
+ // SDL-using content will want mouse coordinates in terms
+ // of backbuffer units.
+ var cw = Module["canvas"].width;
+ var ch = Module["canvas"].height;
+ x = x * (cw / rect.width);
+ y = y * (ch / rect.height);
+
+ Browser.mouseMovementX = x - Browser.mouseX;
+ Browser.mouseMovementY = y - Browser.mouseY;
+ Browser.mouseX = x;
+ Browser.mouseY = y;
+ }
+ },xhrLoad:function (url, onload, onerror) {
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, true);
+ xhr.responseType = 'arraybuffer';
+ xhr.onload = function xhr_onload() {
+ if (xhr.status == 200 || (xhr.status == 0 && xhr.response)) { // file URLs can return 0
+ onload(xhr.response);
+ } else {
+ onerror();
+ }
+ };
+ xhr.onerror = onerror;
+ xhr.send(null);
+ },asyncLoad:function (url, onload, onerror, noRunDep) {
+ Browser.xhrLoad(url, function(arrayBuffer) {
+ assert(arrayBuffer, 'Loading data file "' + url + '" failed (no arrayBuffer).');
+ onload(new Uint8Array(arrayBuffer));
+ if (!noRunDep) removeRunDependency('al ' + url);
+ }, function(event) {
+ if (onerror) {
+ onerror();
+ } else {
+ throw 'Loading data file "' + url + '" failed.';
+ }
+ });
+ if (!noRunDep) addRunDependency('al ' + url);
+ },resizeListeners:[],updateResizeListeners:function () {
+ var canvas = Module['canvas'];
+ Browser.resizeListeners.forEach(function(listener) {
+ listener(canvas.width, canvas.height);
+ });
+ },setCanvasSize:function (width, height, noUpdates) {
+ var canvas = Module['canvas'];
+ Browser.updateCanvasDimensions(canvas, width, height);
+ if (!noUpdates) Browser.updateResizeListeners();
+ },windowedWidth:0,windowedHeight:0,setFullScreenCanvasSize:function () {
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
+ flags = flags | 0x00800000; // set SDL_FULLSCREEN flag
+ HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
+ }
+ Browser.updateResizeListeners();
+ },setWindowedCanvasSize:function () {
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
+ flags = flags & ~0x00800000; // clear SDL_FULLSCREEN flag
+ HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
+ }
+ Browser.updateResizeListeners();
+ },updateCanvasDimensions:function (canvas, wNative, hNative) {
+ if (wNative && hNative) {
+ canvas.widthNative = wNative;
+ canvas.heightNative = hNative;
+ } else {
+ wNative = canvas.widthNative;
+ hNative = canvas.heightNative;
+ }
+ var w = wNative;
+ var h = hNative;
+ if (Module['forcedAspectRatio'] && Module['forcedAspectRatio'] > 0) {
+ if (w/h < Module['forcedAspectRatio']) {
+ w = Math.round(h * Module['forcedAspectRatio']);
+ } else {
+ h = Math.round(w / Module['forcedAspectRatio']);
+ }
+ }
+ if (((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
+ document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
+ document['fullScreenElement'] || document['fullscreenElement'] ||
+ document['msFullScreenElement'] || document['msFullscreenElement'] ||
+ document['webkitCurrentFullScreenElement']) === canvas.parentNode) && (typeof screen != 'undefined')) {
+ var factor = Math.min(screen.width / w, screen.height / h);
+ w = Math.round(w * factor);
+ h = Math.round(h * factor);
+ }
+ if (Browser.resizeCanvas) {
+ if (canvas.width != w) canvas.width = w;
+ if (canvas.height != h) canvas.height = h;
+ if (typeof canvas.style != 'undefined') {
+ canvas.style.removeProperty( "width");
+ canvas.style.removeProperty("height");
+ }
+ } else {
+ if (canvas.width != wNative) canvas.width = wNative;
+ if (canvas.height != hNative) canvas.height = hNative;
+ if (typeof canvas.style != 'undefined') {
+ if (w != wNative || h != hNative) {
+ canvas.style.setProperty( "width", w + "px", "important");
+ canvas.style.setProperty("height", h + "px", "important");
+ } else {
+ canvas.style.removeProperty( "width");
+ canvas.style.removeProperty("height");
+ }
+ }
+ }
+ }};
+
+
+
+
+
+
+
+ function _mkport() { throw 'TODO' }var SOCKFS={mount:function (mount) {
+ return FS.createNode(null, '/', 16384 | 511 /* 0777 */, 0);
+ },createSocket:function (family, type, protocol) {
+ var streaming = type == 1;
+ if (protocol) {
+ assert(streaming == (protocol == 6)); // if SOCK_STREAM, must be tcp
+ }
+
+ // create our internal socket structure
+ var sock = {
+ family: family,
+ type: type,
+ protocol: protocol,
+ server: null,
+ peers: {},
+ pending: [],
+ recv_queue: [],
+ sock_ops: SOCKFS.websocket_sock_ops
+ };
+
+ // create the filesystem node to store the socket structure
+ var name = SOCKFS.nextname();
+ var node = FS.createNode(SOCKFS.root, name, 49152, 0);
+ node.sock = sock;
+
+ // and the wrapping stream that enables library functions such
+ // as read and write to indirectly interact with the socket
+ var stream = FS.createStream({
+ path: name,
+ node: node,
+ flags: FS.modeStringToFlags('r+'),
+ seekable: false,
+ stream_ops: SOCKFS.stream_ops
+ });
+
+ // map the new stream to the socket structure (sockets have a 1:1
+ // relationship with a stream)
+ sock.stream = stream;
+
+ return sock;
+ },getSocket:function (fd) {
+ var stream = FS.getStream(fd);
+ if (!stream || !FS.isSocket(stream.node.mode)) {
+ return null;
+ }
+ return stream.node.sock;
+ },stream_ops:{poll:function (stream) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.poll(sock);
+ },ioctl:function (stream, request, varargs) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.ioctl(sock, request, varargs);
+ },read:function (stream, buffer, offset, length, position /* ignored */) {
+ var sock = stream.node.sock;
+ var msg = sock.sock_ops.recvmsg(sock, length);
+ if (!msg) {
+ // socket is closed
+ return 0;
+ }
+ buffer.set(msg.buffer, offset);
+ return msg.buffer.length;
+ },write:function (stream, buffer, offset, length, position /* ignored */) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.sendmsg(sock, buffer, offset, length);
+ },close:function (stream) {
+ var sock = stream.node.sock;
+ sock.sock_ops.close(sock);
+ }},nextname:function () {
+ if (!SOCKFS.nextname.current) {
+ SOCKFS.nextname.current = 0;
+ }
+ return 'socket[' + (SOCKFS.nextname.current++) + ']';
+ },websocket_sock_ops:{createPeer:function (sock, addr, port) {
+ var ws;
+
+ if (typeof addr === 'object') {
+ ws = addr;
+ addr = null;
+ port = null;
+ }
+
+ if (ws) {
+ // for sockets that've already connected (e.g. we're the server)
+ // we can inspect the _socket property for the address
+ if (ws._socket) {
+ addr = ws._socket.remoteAddress;
+ port = ws._socket.remotePort;
+ }
+ // if we're just now initializing a connection to the remote,
+ // inspect the url property
+ else {
+ var result = /ws[s]?:\/\/([^:]+):(\d+)/.exec(ws.url);
+ if (!result) {
+ throw new Error('WebSocket URL must be in the format ws(s)://address:port');
+ }
+ addr = result[1];
+ port = parseInt(result[2], 10);
+ }
+ } else {
+ // create the actual websocket object and connect
+ try {
+ // runtimeConfig gets set to true if WebSocket runtime configuration is available.
+ var runtimeConfig = (Module['websocket'] && ('object' === typeof Module['websocket']));
+
+ // The default value is 'ws://' the replace is needed because the compiler replaces "//" comments with '#'
+ // comments without checking context, so we'd end up with ws:#, the replace swaps the "#" for "//" again.
+ var url = 'ws:#'.replace('#', '//');
+
+ if (runtimeConfig) {
+ if ('string' === typeof Module['websocket']['url']) {
+ url = Module['websocket']['url']; // Fetch runtime WebSocket URL config.
+ }
+ }
+
+ if (url === 'ws://' || url === 'wss://') { // Is the supplied URL config just a prefix, if so complete it.
+ url = url + addr + ':' + port;
+ }
+
+ // Make the WebSocket subprotocol (Sec-WebSocket-Protocol) default to binary if no configuration is set.
+ var subProtocols = 'binary'; // The default value is 'binary'
+
+ if (runtimeConfig) {
+ if ('string' === typeof Module['websocket']['subprotocol']) {
+ subProtocols = Module['websocket']['subprotocol']; // Fetch runtime WebSocket subprotocol config.
+ }
+ }
+
+ // The regex trims the string (removes spaces at the beginning and end, then splits the string by
+ // <any space>,<any space> into an Array. Whitespace removal is important for Websockify and ws.
+ subProtocols = subProtocols.replace(/^ +| +$/g,"").split(/ *, */);
+
+ // The node ws library API for specifying optional subprotocol is slightly different than the browser's.
+ var opts = ENVIRONMENT_IS_NODE ? {'protocol': subProtocols.toString()} : subProtocols;
+
+ // If node we use the ws library.
+ var WebSocket = ENVIRONMENT_IS_NODE ? require('ws') : window['WebSocket'];
+ ws = new WebSocket(url, opts);
+ ws.binaryType = 'arraybuffer';
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EHOSTUNREACH);
+ }
+ }
+
+
+ var peer = {
+ addr: addr,
+ port: port,
+ socket: ws,
+ dgram_send_queue: []
+ };
+
+ SOCKFS.websocket_sock_ops.addPeer(sock, peer);
+ SOCKFS.websocket_sock_ops.handlePeerEvents(sock, peer);
+
+ // if this is a bound dgram socket, send the port number first to allow
+ // us to override the ephemeral port reported to us by remotePort on the
+ // remote end.
+ if (sock.type === 2 && typeof sock.sport !== 'undefined') {
+ peer.dgram_send_queue.push(new Uint8Array([
+ 255, 255, 255, 255,
+ 'p'.charCodeAt(0), 'o'.charCodeAt(0), 'r'.charCodeAt(0), 't'.charCodeAt(0),
+ ((sock.sport & 0xff00) >> 8) , (sock.sport & 0xff)
+ ]));
+ }
+
+ return peer;
+ },getPeer:function (sock, addr, port) {
+ return sock.peers[addr + ':' + port];
+ },addPeer:function (sock, peer) {
+ sock.peers[peer.addr + ':' + peer.port] = peer;
+ },removePeer:function (sock, peer) {
+ delete sock.peers[peer.addr + ':' + peer.port];
+ },handlePeerEvents:function (sock, peer) {
+ var first = true;
+
+ var handleOpen = function () {
+ try {
+ var queued = peer.dgram_send_queue.shift();
+ while (queued) {
+ peer.socket.send(queued);
+ queued = peer.dgram_send_queue.shift();
+ }
+ } catch (e) {
+ // not much we can do here in the way of proper error handling as we've already
+ // lied and said this data was sent. shut it down.
+ peer.socket.close();
+ }
+ };
+
+ function handleMessage(data) {
+ assert(typeof data !== 'string' && data.byteLength !== undefined); // must receive an ArrayBuffer
+ data = new Uint8Array(data); // make a typed array view on the array buffer
+
+
+ // if this is the port message, override the peer's port with it
+ var wasfirst = first;
+ first = false;
+ if (wasfirst &&
+ data.length === 10 &&
+ data[0] === 255 && data[1] === 255 && data[2] === 255 && data[3] === 255 &&
+ data[4] === 'p'.charCodeAt(0) && data[5] === 'o'.charCodeAt(0) && data[6] === 'r'.charCodeAt(0) && data[7] === 't'.charCodeAt(0)) {
+ // update the peer's port and it's key in the peer map
+ var newport = ((data[8] << 8) | data[9]);
+ SOCKFS.websocket_sock_ops.removePeer(sock, peer);
+ peer.port = newport;
+ SOCKFS.websocket_sock_ops.addPeer(sock, peer);
+ return;
+ }
+
+ sock.recv_queue.push({ addr: peer.addr, port: peer.port, data: data });
+ };
+
+ if (ENVIRONMENT_IS_NODE) {
+ peer.socket.on('open', handleOpen);
+ peer.socket.on('message', function(data, flags) {
+ if (!flags.binary) {
+ return;
+ }
+ handleMessage((new Uint8Array(data)).buffer); // copy from node Buffer -> ArrayBuffer
+ });
+ peer.socket.on('error', function() {
+ // don't throw
+ });
+ } else {
+ peer.socket.onopen = handleOpen;
+ peer.socket.onmessage = function peer_socket_onmessage(event) {
+ handleMessage(event.data);
+ };
+ }
+ },poll:function (sock) {
+ if (sock.type === 1 && sock.server) {
+ // listen sockets should only say they're available for reading
+ // if there are pending clients.
+ return sock.pending.length ? (64 | 1) : 0;
+ }
+
+ var mask = 0;
+ var dest = sock.type === 1 ? // we only care about the socket state for connection-based sockets
+ SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport) :
+ null;
+
+ if (sock.recv_queue.length ||
+ !dest || // connection-less sockets are always ready to read
+ (dest && dest.socket.readyState === dest.socket.CLOSING) ||
+ (dest && dest.socket.readyState === dest.socket.CLOSED)) { // let recv return 0 once closed
+ mask |= (64 | 1);
+ }
+
+ if (!dest || // connection-less sockets are always ready to write
+ (dest && dest.socket.readyState === dest.socket.OPEN)) {
+ mask |= 4;
+ }
+
+ if ((dest && dest.socket.readyState === dest.socket.CLOSING) ||
+ (dest && dest.socket.readyState === dest.socket.CLOSED)) {
+ mask |= 16;
+ }
+
+ return mask;
+ },ioctl:function (sock, request, arg) {
+ switch (request) {
+ case 21531:
+ var bytes = 0;
+ if (sock.recv_queue.length) {
+ bytes = sock.recv_queue[0].data.length;
+ }
+ HEAP32[((arg)>>2)]=bytes;
+ return 0;
+ default:
+ return ERRNO_CODES.EINVAL;
+ }
+ },close:function (sock) {
+ // if we've spawned a listen server, close it
+ if (sock.server) {
+ try {
+ sock.server.close();
+ } catch (e) {
+ }
+ sock.server = null;
+ }
+ // close any peer connections
+ var peers = Object.keys(sock.peers);
+ for (var i = 0; i < peers.length; i++) {
+ var peer = sock.peers[peers[i]];
+ try {
+ peer.socket.close();
+ } catch (e) {
+ }
+ SOCKFS.websocket_sock_ops.removePeer(sock, peer);
+ }
+ return 0;
+ },bind:function (sock, addr, port) {
+ if (typeof sock.saddr !== 'undefined' || typeof sock.sport !== 'undefined') {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL); // already bound
+ }
+ sock.saddr = addr;
+ sock.sport = port || _mkport();
+ // in order to emulate dgram sockets, we need to launch a listen server when
+ // binding on a connection-less socket
+ // note: this is only required on the server side
+ if (sock.type === 2) {
+ // close the existing server if it exists
+ if (sock.server) {
+ sock.server.close();
+ sock.server = null;
+ }
+ // swallow error operation not supported error that occurs when binding in the
+ // browser where this isn't supported
+ try {
+ sock.sock_ops.listen(sock, 0);
+ } catch (e) {
+ if (!(e instanceof FS.ErrnoError)) throw e;
+ if (e.errno !== ERRNO_CODES.EOPNOTSUPP) throw e;
+ }
+ }
+ },connect:function (sock, addr, port) {
+ if (sock.server) {
+ throw new FS.ErrnoError(ERRNO_CODS.EOPNOTSUPP);
+ }
+
+ // TODO autobind
+ // if (!sock.addr && sock.type == 2) {
+ // }
+
+ // early out if we're already connected / in the middle of connecting
+ if (typeof sock.daddr !== 'undefined' && typeof sock.dport !== 'undefined') {
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
+ if (dest) {
+ if (dest.socket.readyState === dest.socket.CONNECTING) {
+ throw new FS.ErrnoError(ERRNO_CODES.EALREADY);
+ } else {
+ throw new FS.ErrnoError(ERRNO_CODES.EISCONN);
+ }
+ }
+ }
+
+ // add the socket to our peer list and set our
+ // destination address / port to match
+ var peer = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
+ sock.daddr = peer.addr;
+ sock.dport = peer.port;
+
+ // always "fail" in non-blocking mode
+ throw new FS.ErrnoError(ERRNO_CODES.EINPROGRESS);
+ },listen:function (sock, backlog) {
+ if (!ENVIRONMENT_IS_NODE) {
+ throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
+ }
+ if (sock.server) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL); // already listening
+ }
+ var WebSocketServer = require('ws').Server;
+ var host = sock.saddr;
+ sock.server = new WebSocketServer({
+ host: host,
+ port: sock.sport
+ // TODO support backlog
+ });
+
+ sock.server.on('connection', function(ws) {
+ if (sock.type === 1) {
+ var newsock = SOCKFS.createSocket(sock.family, sock.type, sock.protocol);
+
+ // create a peer on the new socket
+ var peer = SOCKFS.websocket_sock_ops.createPeer(newsock, ws);
+ newsock.daddr = peer.addr;
+ newsock.dport = peer.port;
+
+ // push to queue for accept to pick up
+ sock.pending.push(newsock);
+ } else {
+ // create a peer on the listen socket so calling sendto
+ // with the listen socket and an address will resolve
+ // to the correct client
+ SOCKFS.websocket_sock_ops.createPeer(sock, ws);
+ }
+ });
+ sock.server.on('closed', function() {
+ sock.server = null;
+ });
+ sock.server.on('error', function() {
+ // don't throw
+ });
+ },accept:function (listensock) {
+ if (!listensock.server) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var newsock = listensock.pending.shift();
+ newsock.stream.flags = listensock.stream.flags;
+ return newsock;
+ },getname:function (sock, peer) {
+ var addr, port;
+ if (peer) {
+ if (sock.daddr === undefined || sock.dport === undefined) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+ addr = sock.daddr;
+ port = sock.dport;
+ } else {
+ // TODO saddr and sport will be set for bind()'d UDP sockets, but what
+ // should we be returning for TCP sockets that've been connect()'d?
+ addr = sock.saddr || 0;
+ port = sock.sport || 0;
+ }
+ return { addr: addr, port: port };
+ },sendmsg:function (sock, buffer, offset, length, addr, port) {
+ if (sock.type === 2) {
+ // connection-less sockets will honor the message address,
+ // and otherwise fall back to the bound destination address
+ if (addr === undefined || port === undefined) {
+ addr = sock.daddr;
+ port = sock.dport;
+ }
+ // if there was no address to fall back to, error out
+ if (addr === undefined || port === undefined) {
+ throw new FS.ErrnoError(ERRNO_CODES.EDESTADDRREQ);
+ }
+ } else {
+ // connection-based sockets will only use the bound
+ addr = sock.daddr;
+ port = sock.dport;
+ }
+
+ // find the peer for the destination address
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, addr, port);
+
+ // early out if not connected with a connection-based socket
+ if (sock.type === 1) {
+ if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ } else if (dest.socket.readyState === dest.socket.CONNECTING) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ }
+
+ // create a copy of the incoming data to send, as the WebSocket API
+ // doesn't work entirely with an ArrayBufferView, it'll just send
+ // the entire underlying buffer
+ var data;
+ if (buffer instanceof Array || buffer instanceof ArrayBuffer) {
+ data = buffer.slice(offset, offset + length);
+ } else { // ArrayBufferView
+ data = buffer.buffer.slice(buffer.byteOffset + offset, buffer.byteOffset + offset + length);
+ }
+
+ // if we're emulating a connection-less dgram socket and don't have
+ // a cached connection, queue the buffer to send upon connect and
+ // lie, saying the data was sent now.
+ if (sock.type === 2) {
+ if (!dest || dest.socket.readyState !== dest.socket.OPEN) {
+ // if we're not connected, open a new connection
+ if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ dest = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
+ }
+ dest.dgram_send_queue.push(data);
+ return length;
+ }
+ }
+
+ try {
+ // send the actual data
+ dest.socket.send(data);
+ return length;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ },recvmsg:function (sock, length) {
+ // http://pubs.opengroup.org/onlinepubs/7908799/xns/recvmsg.html
+ if (sock.type === 1 && sock.server) {
+ // tcp servers should not be recv()'ing on the listen socket
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+
+ var queued = sock.recv_queue.shift();
+ if (!queued) {
+ if (sock.type === 1) {
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
+
+ if (!dest) {
+ // if we have a destination address but are not connected, error out
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+ else if (dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ // return null if the socket has closed
+ return null;
+ }
+ else {
+ // else, our socket is in a valid state but truly has nothing available
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ } else {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ }
+
+ // queued.data will be an ArrayBuffer if it's unadulterated, but if it's
+ // requeued TCP data it'll be an ArrayBufferView
+ var queuedLength = queued.data.byteLength || queued.data.length;
+ var queuedOffset = queued.data.byteOffset || 0;
+ var queuedBuffer = queued.data.buffer || queued.data;
+ var bytesRead = Math.min(length, queuedLength);
+ var res = {
+ buffer: new Uint8Array(queuedBuffer, queuedOffset, bytesRead),
+ addr: queued.addr,
+ port: queued.port
+ };
+
+
+ // push back any unread data for TCP connections
+ if (sock.type === 1 && bytesRead < queuedLength) {
+ var bytesRemaining = queuedLength - bytesRead;
+ queued.data = new Uint8Array(queuedBuffer, queuedOffset + bytesRead, bytesRemaining);
+ sock.recv_queue.unshift(queued);
+ }
+
+ return res;
+ }}};function _send(fd, buf, len, flags) {
+ var sock = SOCKFS.getSocket(fd);
+ if (!sock) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ // TODO honor flags
+ return _write(fd, buf, len);
+ }
+
+ function _pwrite(fildes, buf, nbyte, offset) {
+ // ssize_t pwrite(int fildes, const void *buf, size_t nbyte, off_t offset);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
+ var stream = FS.getStream(fildes);
+ if (!stream) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ try {
+ var slab = HEAP8;
+ return FS.write(stream, slab, buf, nbyte, offset);
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }function _write(fildes, buf, nbyte) {
+ // ssize_t write(int fildes, const void *buf, size_t nbyte);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
+ var stream = FS.getStream(fildes);
+ if (!stream) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+
+
+ try {
+ var slab = HEAP8;
+ return FS.write(stream, slab, buf, nbyte);
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }
+
+ function _fileno(stream) {
+ // int fileno(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fileno.html
+ stream = FS.getStreamFromPtr(stream);
+ if (!stream) return -1;
+ return stream.fd;
+ }function _fwrite(ptr, size, nitems, stream) {
+ // size_t fwrite(const void *restrict ptr, size_t size, size_t nitems, FILE *restrict stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fwrite.html
+ var bytesToWrite = nitems * size;
+ if (bytesToWrite == 0) return 0;
+ var fd = _fileno(stream);
+ var bytesWritten = _write(fd, ptr, bytesToWrite);
+ if (bytesWritten == -1) {
+ var streamObj = FS.getStreamFromPtr(stream);
+ if (streamObj) streamObj.error = true;
+ return 0;
+ } else {
+ return Math.floor(bytesWritten / size);
+ }
+ }
+
+
+
+ Module["_strlen"] = _strlen;
+
+ function __reallyNegative(x) {
+ return x < 0 || (x === 0 && (1/x) === -Infinity);
+ }function __formatString(format, varargs) {
+ var textIndex = format;
+ var argIndex = 0;
+ function getNextArg(type) {
+ // NOTE: Explicitly ignoring type safety. Otherwise this fails:
+ // int x = 4; printf("%c\n", (char)x);
+ var ret;
+ if (type === 'double') {
+ ret = HEAPF64[(((varargs)+(argIndex))>>3)];
+ } else if (type == 'i64') {
+ ret = [HEAP32[(((varargs)+(argIndex))>>2)],
+ HEAP32[(((varargs)+(argIndex+4))>>2)]];
+
+ } else {
+ type = 'i32'; // varargs are always i32, i64, or double
+ ret = HEAP32[(((varargs)+(argIndex))>>2)];
+ }
+ argIndex += Runtime.getNativeFieldSize(type);
+ return ret;
+ }
+
+ var ret = [];
+ var curr, next, currArg;
+ while(1) {
+ var startTextIndex = textIndex;
+ curr = HEAP8[(textIndex)];
+ if (curr === 0) break;
+ next = HEAP8[((textIndex+1)|0)];
+ if (curr == 37) {
+ // Handle flags.
+ var flagAlwaysSigned = false;
+ var flagLeftAlign = false;
+ var flagAlternative = false;
+ var flagZeroPad = false;
+ var flagPadSign = false;
+ flagsLoop: while (1) {
+ switch (next) {
+ case 43:
+ flagAlwaysSigned = true;
+ break;
+ case 45:
+ flagLeftAlign = true;
+ break;
+ case 35:
+ flagAlternative = true;
+ break;
+ case 48:
+ if (flagZeroPad) {
+ break flagsLoop;
+ } else {
+ flagZeroPad = true;
+ break;
+ }
+ case 32:
+ flagPadSign = true;
+ break;
+ default:
+ break flagsLoop;
+ }
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ }
+
+ // Handle width.
+ var width = 0;
+ if (next == 42) {
+ width = getNextArg('i32');
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ } else {
+ while (next >= 48 && next <= 57) {
+ width = width * 10 + (next - 48);
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ }
+ }
+
+ // Handle precision.
+ var precisionSet = false, precision = -1;
+ if (next == 46) {
+ precision = 0;
+ precisionSet = true;
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ if (next == 42) {
+ precision = getNextArg('i32');
+ textIndex++;
+ } else {
+ while(1) {
+ var precisionChr = HEAP8[((textIndex+1)|0)];
+ if (precisionChr < 48 ||
+ precisionChr > 57) break;
+ precision = precision * 10 + (precisionChr - 48);
+ textIndex++;
+ }
+ }
+ next = HEAP8[((textIndex+1)|0)];
+ }
+ if (precision < 0) {
+ precision = 6; // Standard default.
+ precisionSet = false;
+ }
+
+ // Handle integer sizes. WARNING: These assume a 32-bit architecture!
+ var argSize;
+ switch (String.fromCharCode(next)) {
+ case 'h':
+ var nextNext = HEAP8[((textIndex+2)|0)];
+ if (nextNext == 104) {
+ textIndex++;
+ argSize = 1; // char (actually i32 in varargs)
+ } else {
+ argSize = 2; // short (actually i32 in varargs)
+ }
+ break;
+ case 'l':
+ var nextNext = HEAP8[((textIndex+2)|0)];
+ if (nextNext == 108) {
+ textIndex++;
+ argSize = 8; // long long
+ } else {
+ argSize = 4; // long
+ }
+ break;
+ case 'L': // long long
+ case 'q': // int64_t
+ case 'j': // intmax_t
+ argSize = 8;
+ break;
+ case 'z': // size_t
+ case 't': // ptrdiff_t
+ case 'I': // signed ptrdiff_t or unsigned size_t
+ argSize = 4;
+ break;
+ default:
+ argSize = null;
+ }
+ if (argSize) textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+
+ // Handle type specifier.
+ switch (String.fromCharCode(next)) {
+ case 'd': case 'i': case 'u': case 'o': case 'x': case 'X': case 'p': {
+ // Integer.
+ var signed = next == 100 || next == 105;
+ argSize = argSize || 4;
+ var currArg = getNextArg('i' + (argSize * 8));
+ var argText;
+ // Flatten i64-1 [low, high] into a (slightly rounded) double
+ if (argSize == 8) {
+ currArg = Runtime.makeBigInt(currArg[0], currArg[1], next == 117);
+ }
+ // Truncate to requested size.
+ if (argSize <= 4) {
+ var limit = Math.pow(256, argSize) - 1;
+ currArg = (signed ? reSign : unSign)(currArg & limit, argSize * 8);
+ }
+ // Format the number.
+ var currAbsArg = Math.abs(currArg);
+ var prefix = '';
+ if (next == 100 || next == 105) {
+ argText = reSign(currArg, 8 * argSize, 1).toString(10);
+ } else if (next == 117) {
+ argText = unSign(currArg, 8 * argSize, 1).toString(10);
+ currArg = Math.abs(currArg);
+ } else if (next == 111) {
+ argText = (flagAlternative ? '0' : '') + currAbsArg.toString(8);
+ } else if (next == 120 || next == 88) {
+ prefix = (flagAlternative && currArg != 0) ? '0x' : '';
+ if (currArg < 0) {
+ // Represent negative numbers in hex as 2's complement.
+ currArg = -currArg;
+ argText = (currAbsArg - 1).toString(16);
+ var buffer = [];
+ for (var i = 0; i < argText.length; i++) {
+ buffer.push((0xF - parseInt(argText[i], 16)).toString(16));
+ }
+ argText = buffer.join('');
+ while (argText.length < argSize * 2) argText = 'f' + argText;
+ } else {
+ argText = currAbsArg.toString(16);
+ }
+ if (next == 88) {
+ prefix = prefix.toUpperCase();
+ argText = argText.toUpperCase();
+ }
+ } else if (next == 112) {
+ if (currAbsArg === 0) {
+ argText = '(nil)';
+ } else {
+ prefix = '0x';
+ argText = currAbsArg.toString(16);
+ }
+ }
+ if (precisionSet) {
+ while (argText.length < precision) {
+ argText = '0' + argText;
+ }
+ }
+
+ // Add sign if needed
+ if (currArg >= 0) {
+ if (flagAlwaysSigned) {
+ prefix = '+' + prefix;
+ } else if (flagPadSign) {
+ prefix = ' ' + prefix;
+ }
+ }
+
+ // Move sign to prefix so we zero-pad after the sign
+ if (argText.charAt(0) == '-') {
+ prefix = '-' + prefix;
+ argText = argText.substr(1);
+ }
+
+ // Add padding.
+ while (prefix.length + argText.length < width) {
+ if (flagLeftAlign) {
+ argText += ' ';
+ } else {
+ if (flagZeroPad) {
+ argText = '0' + argText;
+ } else {
+ prefix = ' ' + prefix;
+ }
+ }
+ }
+
+ // Insert the result into the buffer.
+ argText = prefix + argText;
+ argText.split('').forEach(function(chr) {
+ ret.push(chr.charCodeAt(0));
+ });
+ break;
+ }
+ case 'f': case 'F': case 'e': case 'E': case 'g': case 'G': {
+ // Float.
+ var currArg = getNextArg('double');
+ var argText;
+ if (isNaN(currArg)) {
+ argText = 'nan';
+ flagZeroPad = false;
+ } else if (!isFinite(currArg)) {
+ argText = (currArg < 0 ? '-' : '') + 'inf';
+ flagZeroPad = false;
+ } else {
+ var isGeneral = false;
+ var effectivePrecision = Math.min(precision, 20);
+
+ // Convert g/G to f/F or e/E, as per:
+ // http://pubs.opengroup.org/onlinepubs/9699919799/functions/printf.html
+ if (next == 103 || next == 71) {
+ isGeneral = true;
+ precision = precision || 1;
+ var exponent = parseInt(currArg.toExponential(effectivePrecision).split('e')[1], 10);
+ if (precision > exponent && exponent >= -4) {
+ next = ((next == 103) ? 'f' : 'F').charCodeAt(0);
+ precision -= exponent + 1;
+ } else {
+ next = ((next == 103) ? 'e' : 'E').charCodeAt(0);
+ precision--;
+ }
+ effectivePrecision = Math.min(precision, 20);
+ }
+
+ if (next == 101 || next == 69) {
+ argText = currArg.toExponential(effectivePrecision);
+ // Make sure the exponent has at least 2 digits.
+ if (/[eE][-+]\d$/.test(argText)) {
+ argText = argText.slice(0, -1) + '0' + argText.slice(-1);
+ }
+ } else if (next == 102 || next == 70) {
+ argText = currArg.toFixed(effectivePrecision);
+ if (currArg === 0 && __reallyNegative(currArg)) {
+ argText = '-' + argText;
+ }
+ }
+
+ var parts = argText.split('e');
+ if (isGeneral && !flagAlternative) {
+ // Discard trailing zeros and periods.
+ while (parts[0].length > 1 && parts[0].indexOf('.') != -1 &&
+ (parts[0].slice(-1) == '0' || parts[0].slice(-1) == '.')) {
+ parts[0] = parts[0].slice(0, -1);
+ }
+ } else {
+ // Make sure we have a period in alternative mode.
+ if (flagAlternative && argText.indexOf('.') == -1) parts[0] += '.';
+ // Zero pad until required precision.
+ while (precision > effectivePrecision++) parts[0] += '0';
+ }
+ argText = parts[0] + (parts.length > 1 ? 'e' + parts[1] : '');
+
+ // Capitalize 'E' if needed.
+ if (next == 69) argText = argText.toUpperCase();
+
+ // Add sign.
+ if (currArg >= 0) {
+ if (flagAlwaysSigned) {
+ argText = '+' + argText;
+ } else if (flagPadSign) {
+ argText = ' ' + argText;
+ }
+ }
+ }
+
+ // Add padding.
+ while (argText.length < width) {
+ if (flagLeftAlign) {
+ argText += ' ';
+ } else {
+ if (flagZeroPad && (argText[0] == '-' || argText[0] == '+')) {
+ argText = argText[0] + '0' + argText.slice(1);
+ } else {
+ argText = (flagZeroPad ? '0' : ' ') + argText;
+ }
+ }
+ }
+
+ // Adjust case.
+ if (next < 97) argText = argText.toUpperCase();
+
+ // Insert the result into the buffer.
+ argText.split('').forEach(function(chr) {
+ ret.push(chr.charCodeAt(0));
+ });
+ break;
+ }
+ case 's': {
+ // String.
+ var arg = getNextArg('i8*');
+ var argLength = arg ? _strlen(arg) : '(null)'.length;
+ if (precisionSet) argLength = Math.min(argLength, precision);
+ if (!flagLeftAlign) {
+ while (argLength < width--) {
+ ret.push(32);
+ }
+ }
+ if (arg) {
+ for (var i = 0; i < argLength; i++) {
+ ret.push(HEAPU8[((arg++)|0)]);
+ }
+ } else {
+ ret = ret.concat(intArrayFromString('(null)'.substr(0, argLength), true));
+ }
+ if (flagLeftAlign) {
+ while (argLength < width--) {
+ ret.push(32);
+ }
+ }
+ break;
+ }
+ case 'c': {
+ // Character.
+ if (flagLeftAlign) ret.push(getNextArg('i8'));
+ while (--width > 0) {
+ ret.push(32);
+ }
+ if (!flagLeftAlign) ret.push(getNextArg('i8'));
+ break;
+ }
+ case 'n': {
+ // Write the length written so far to the next parameter.
+ var ptr = getNextArg('i32*');
+ HEAP32[((ptr)>>2)]=ret.length;
+ break;
+ }
+ case '%': {
+ // Literal percent sign.
+ ret.push(curr);
+ break;
+ }
+ default: {
+ // Unknown specifiers remain untouched.
+ for (var i = startTextIndex; i < textIndex + 2; i++) {
+ ret.push(HEAP8[(i)]);
+ }
+ }
+ }
+ textIndex += 2;
+ // TODO: Support a/A (hex float) and m (last error) specifiers.
+ // TODO: Support %1${specifier} for arg selection.
+ } else {
+ ret.push(curr);
+ textIndex += 1;
+ }
+ }
+ return ret;
+ }function _fprintf(stream, format, varargs) {
+ // int fprintf(FILE *restrict stream, const char *restrict format, ...);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
+ var result = __formatString(format, varargs);
+ var stack = Runtime.stackSave();
+ var ret = _fwrite(allocate(result, 'i8', ALLOC_STACK), 1, result.length, stream);
+ Runtime.stackRestore(stack);
+ return ret;
+ }function _printf(format, varargs) {
+ // int printf(const char *restrict format, ...);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
+ var stdout = HEAP32[((_stdout)>>2)];
+ return _fprintf(stdout, format, varargs);
+ }
+
+
+ var _sqrtf=Math_sqrt;
+Module["requestFullScreen"] = function Module_requestFullScreen(lockPointer, resizeCanvas) { Browser.requestFullScreen(lockPointer, resizeCanvas) };
+ Module["requestAnimationFrame"] = function Module_requestAnimationFrame(func) { Browser.requestAnimationFrame(func) };
+ Module["setCanvasSize"] = function Module_setCanvasSize(width, height, noUpdates) { Browser.setCanvasSize(width, height, noUpdates) };
+ Module["pauseMainLoop"] = function Module_pauseMainLoop() { Browser.mainLoop.pause() };
+ Module["resumeMainLoop"] = function Module_resumeMainLoop() { Browser.mainLoop.resume() };
+ Module["getUserMedia"] = function Module_getUserMedia() { Browser.getUserMedia() }
+FS.staticInit();__ATINIT__.unshift({ func: function() { if (!Module["noFSInit"] && !FS.init.initialized) FS.init() } });__ATMAIN__.push({ func: function() { FS.ignorePermissions = false } });__ATEXIT__.push({ func: function() { FS.quit() } });Module["FS_createFolder"] = FS.createFolder;Module["FS_createPath"] = FS.createPath;Module["FS_createDataFile"] = FS.createDataFile;Module["FS_createPreloadedFile"] = FS.createPreloadedFile;Module["FS_createLazyFile"] = FS.createLazyFile;Module["FS_createLink"] = FS.createLink;Module["FS_createDevice"] = FS.createDevice;
+___errno_state = Runtime.staticAlloc(4); HEAP32[((___errno_state)>>2)]=0;
+__ATINIT__.unshift({ func: function() { TTY.init() } });__ATEXIT__.push({ func: function() { TTY.shutdown() } });TTY.utf8 = new Runtime.UTF8Processor();
+if (ENVIRONMENT_IS_NODE) { var fs = require("fs"); NODEFS.staticInit(); }
+__ATINIT__.push({ func: function() { SOCKFS.root = FS.mount(SOCKFS, {}, null); } });
+STACK_BASE = STACKTOP = Runtime.alignMemory(STATICTOP);
+
+staticSealed = true; // seal the static portion of memory
+
+STACK_MAX = STACK_BASE + 5242880;
+
+DYNAMIC_BASE = DYNAMICTOP = Runtime.alignMemory(STACK_MAX);
+
+assert(DYNAMIC_BASE < TOTAL_MEMORY, "TOTAL_MEMORY not big enough for stack");
+
+
+var Math_min = Math.min;
+function asmPrintInt(x, y) {
+ Module.print('int ' + x + ',' + y);// + ' ' + new Error().stack);
+}
+function asmPrintFloat(x, y) {
+ Module.print('float ' + x + ',' + y);// + ' ' + new Error().stack);
+}
+// EMSCRIPTEN_START_ASM
+var asm = Wasm.instantiateModuleFromAsm((function Module(global, env, buffer) {
+ 'use asm';
+ var HEAP8 = new global.Int8Array(buffer);
+ var HEAP16 = new global.Int16Array(buffer);
+ var HEAP32 = new global.Int32Array(buffer);
+ var HEAPU8 = new global.Uint8Array(buffer);
+ var HEAPU16 = new global.Uint16Array(buffer);
+ var HEAPU32 = new global.Uint32Array(buffer);
+ var HEAPF32 = new global.Float32Array(buffer);
+ var HEAPF64 = new global.Float64Array(buffer);
+
+ var STACKTOP=env.STACKTOP|0;
+ var STACK_MAX=env.STACK_MAX|0;
+ var tempDoublePtr=env.tempDoublePtr|0;
+ var ABORT=env.ABORT|0;
+
+ var __THREW__ = 0;
+ var threwValue = 0;
+ var setjmpId = 0;
+ var undef = 0;
+ var nan = +env.NaN, inf = +env.Infinity;
+ var tempInt = 0, tempBigInt = 0, tempBigIntP = 0, tempBigIntS = 0, tempBigIntR = 0.0, tempBigIntI = 0, tempBigIntD = 0, tempValue = 0, tempDouble = 0.0;
+
+ var tempRet0 = 0;
+ var tempRet1 = 0;
+ var tempRet2 = 0;
+ var tempRet3 = 0;
+ var tempRet4 = 0;
+ var tempRet5 = 0;
+ var tempRet6 = 0;
+ var tempRet7 = 0;
+ var tempRet8 = 0;
+ var tempRet9 = 0;
+ var Math_floor=global.Math.floor;
+ var Math_abs=global.Math.abs;
+ var Math_sqrt=global.Math.sqrt;
+ var Math_pow=global.Math.pow;
+ var Math_cos=global.Math.cos;
+ var Math_sin=global.Math.sin;
+ var Math_tan=global.Math.tan;
+ var Math_acos=global.Math.acos;
+ var Math_asin=global.Math.asin;
+ var Math_atan=global.Math.atan;
+ var Math_atan2=global.Math.atan2;
+ var Math_exp=global.Math.exp;
+ var Math_log=global.Math.log;
+ var Math_ceil=global.Math.ceil;
+ var Math_imul=global.Math.imul;
+ var abort=env.abort;
+ var assert=env.assert;
+ var asmPrintInt=env.asmPrintInt;
+ var asmPrintFloat=env.asmPrintFloat;
+ var Math_min=env.min;
+ var _free=env._free;
+ var _emscripten_memcpy_big=env._emscripten_memcpy_big;
+ var _printf=env._printf;
+ var _send=env._send;
+ var _pwrite=env._pwrite;
+ var _sqrtf=env._sqrtf;
+ var __reallyNegative=env.__reallyNegative;
+ var _fwrite=env._fwrite;
+ var _malloc=env._malloc;
+ var _mkport=env._mkport;
+ var _fprintf=env._fprintf;
+ var ___setErrNo=env.___setErrNo;
+ var __formatString=env.__formatString;
+ var _fileno=env._fileno;
+ var _fflush=env._fflush;
+ var _write=env._write;
+ var tempFloat = 0.0;
+
+// EMSCRIPTEN_START_FUNCS
+function _main(i3, i5) {
+ i3 = i3 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i6 = 0, i7 = 0, d8 = 0.0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i2 = i1;
+ L1 : do {
+ if ((i3 | 0) > 1) {
+ i3 = HEAP8[HEAP32[i5 + 4 >> 2] | 0] | 0;
+ switch (i3 | 0) {
+ case 50:
+ {
+ i3 = 13e4;
+ break L1;
+ }
+ case 51:
+ {
+ i4 = 4;
+ break L1;
+ }
+ case 52:
+ {
+ i3 = 61e4;
+ break L1;
+ }
+ case 53:
+ {
+ i3 = 101e4;
+ break L1;
+ }
+ case 49:
+ {
+ i3 = 33e3;
+ break L1;
+ }
+ case 48:
+ {
+ i7 = 0;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ default:
+ {
+ HEAP32[i2 >> 2] = i3 + -48;
+ _printf(8, i2 | 0) | 0;
+ i7 = -1;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ }
+ } else {
+ i4 = 4;
+ }
+ } while (0);
+ if ((i4 | 0) == 4) {
+ i3 = 22e4;
+ }
+ i4 = 2;
+ i5 = 0;
+ while (1) {
+ d8 = +Math_sqrt(+(+(i4 | 0)));
+ L15 : do {
+ if (d8 > 2.0) {
+ i7 = 2;
+ while (1) {
+ i6 = i7 + 1 | 0;
+ if (((i4 | 0) % (i7 | 0) | 0 | 0) == 0) {
+ i6 = 0;
+ break L15;
+ }
+ if (+(i6 | 0) < d8) {
+ i7 = i6;
+ } else {
+ i6 = 1;
+ break;
+ }
+ }
+ } else {
+ i6 = 1;
+ }
+ } while (0);
+ i5 = i6 + i5 | 0;
+ if ((i5 | 0) >= (i3 | 0)) {
+ break;
+ } else {
+ i4 = i4 + 1 | 0;
+ }
+ }
+ HEAP32[i2 >> 2] = i4;
+ _printf(24, i2 | 0) | 0;
+ i7 = 0;
+ STACKTOP = i1;
+ return i7 | 0;
+}
+function _memcpy(i3, i2, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i4 = 0;
+ if ((i1 | 0) >= 4096) return _emscripten_memcpy_big(i3 | 0, i2 | 0, i1 | 0) | 0;
+ i4 = i3 | 0;
+ if ((i3 & 3) == (i2 & 3)) {
+ while (i3 & 3) {
+ if ((i1 | 0) == 0) return i4 | 0;
+ HEAP8[i3] = HEAP8[i2] | 0;
+ i3 = i3 + 1 | 0;
+ i2 = i2 + 1 | 0;
+ i1 = i1 - 1 | 0;
+ }
+ while ((i1 | 0) >= 4) {
+ HEAP32[i3 >> 2] = HEAP32[i2 >> 2];
+ i3 = i3 + 4 | 0;
+ i2 = i2 + 4 | 0;
+ i1 = i1 - 4 | 0;
+ }
+ }
+ while ((i1 | 0) > 0) {
+ HEAP8[i3] = HEAP8[i2] | 0;
+ i3 = i3 + 1 | 0;
+ i2 = i2 + 1 | 0;
+ i1 = i1 - 1 | 0;
+ }
+ return i4 | 0;
+}
+function runPostSets() {}
+function _memset(i1, i4, i3) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i2 = i1 + i3 | 0;
+ if ((i3 | 0) >= 20) {
+ i4 = i4 & 255;
+ i7 = i1 & 3;
+ i6 = i4 | i4 << 8 | i4 << 16 | i4 << 24;
+ i5 = i2 & ~3;
+ if (i7) {
+ i7 = i1 + 4 - i7 | 0;
+ while ((i1 | 0) < (i7 | 0)) {
+ HEAP8[i1] = i4;
+ i1 = i1 + 1 | 0;
+ }
+ }
+ while ((i1 | 0) < (i5 | 0)) {
+ HEAP32[i1 >> 2] = i6;
+ i1 = i1 + 4 | 0;
+ }
+ }
+ while ((i1 | 0) < (i2 | 0)) {
+ HEAP8[i1] = i4;
+ i1 = i1 + 1 | 0;
+ }
+ return i1 - i3 | 0;
+}
+function copyTempDouble(i1) {
+ i1 = i1 | 0;
+ HEAP8[tempDoublePtr] = HEAP8[i1];
+ HEAP8[tempDoublePtr + 1 | 0] = HEAP8[i1 + 1 | 0];
+ HEAP8[tempDoublePtr + 2 | 0] = HEAP8[i1 + 2 | 0];
+ HEAP8[tempDoublePtr + 3 | 0] = HEAP8[i1 + 3 | 0];
+ HEAP8[tempDoublePtr + 4 | 0] = HEAP8[i1 + 4 | 0];
+ HEAP8[tempDoublePtr + 5 | 0] = HEAP8[i1 + 5 | 0];
+ HEAP8[tempDoublePtr + 6 | 0] = HEAP8[i1 + 6 | 0];
+ HEAP8[tempDoublePtr + 7 | 0] = HEAP8[i1 + 7 | 0];
+}
+function copyTempFloat(i1) {
+ i1 = i1 | 0;
+ HEAP8[tempDoublePtr] = HEAP8[i1];
+ HEAP8[tempDoublePtr + 1 | 0] = HEAP8[i1 + 1 | 0];
+ HEAP8[tempDoublePtr + 2 | 0] = HEAP8[i1 + 2 | 0];
+ HEAP8[tempDoublePtr + 3 | 0] = HEAP8[i1 + 3 | 0];
+}
+function stackAlloc(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + i1 | 0;
+ STACKTOP = STACKTOP + 7 & -8;
+ return i2 | 0;
+}
+function _strlen(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = i1;
+ while (HEAP8[i2] | 0) {
+ i2 = i2 + 1 | 0;
+ }
+ return i2 - i1 | 0;
+}
+function setThrew(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ if ((__THREW__ | 0) == 0) {
+ __THREW__ = i1;
+ threwValue = i2;
+ }
+}
+function stackRestore(i1) {
+ i1 = i1 | 0;
+ STACKTOP = i1;
+}
+function setTempRet9(i1) {
+ i1 = i1 | 0;
+ tempRet9 = i1;
+}
+function setTempRet8(i1) {
+ i1 = i1 | 0;
+ tempRet8 = i1;
+}
+function setTempRet7(i1) {
+ i1 = i1 | 0;
+ tempRet7 = i1;
+}
+function setTempRet6(i1) {
+ i1 = i1 | 0;
+ tempRet6 = i1;
+}
+function setTempRet5(i1) {
+ i1 = i1 | 0;
+ tempRet5 = i1;
+}
+function setTempRet4(i1) {
+ i1 = i1 | 0;
+ tempRet4 = i1;
+}
+function setTempRet3(i1) {
+ i1 = i1 | 0;
+ tempRet3 = i1;
+}
+function setTempRet2(i1) {
+ i1 = i1 | 0;
+ tempRet2 = i1;
+}
+function setTempRet1(i1) {
+ i1 = i1 | 0;
+ tempRet1 = i1;
+}
+function setTempRet0(i1) {
+ i1 = i1 | 0;
+ tempRet0 = i1;
+}
+function stackSave() {
+ return STACKTOP | 0;
+}
+
+// EMSCRIPTEN_END_FUNCS
+
+
+ return { _strlen: _strlen, _memcpy: _memcpy, _main: _main, _memset: _memset, runPostSets: runPostSets, stackAlloc: stackAlloc, stackSave: stackSave, stackRestore: stackRestore, setThrew: setThrew, setTempRet0: setTempRet0, setTempRet1: setTempRet1, setTempRet2: setTempRet2, setTempRet3: setTempRet3, setTempRet4: setTempRet4, setTempRet5: setTempRet5, setTempRet6: setTempRet6, setTempRet7: setTempRet7, setTempRet8: setTempRet8, setTempRet9: setTempRet9 };
+}).toString(),
+// EMSCRIPTEN_END_ASM
+{ "Math": Math, "Int8Array": Int8Array, "Int16Array": Int16Array, "Int32Array": Int32Array, "Uint8Array": Uint8Array, "Uint16Array": Uint16Array, "Uint32Array": Uint32Array, "Float32Array": Float32Array, "Float64Array": Float64Array, "abort": abort, "assert": assert, "asmPrintInt": asmPrintInt, "asmPrintFloat": asmPrintFloat, "min": Math_min, "_free": _free, "_emscripten_memcpy_big": _emscripten_memcpy_big, "_printf": _printf, "_send": _send, "_pwrite": _pwrite, "_sqrtf": _sqrtf, "__reallyNegative": __reallyNegative, "_fwrite": _fwrite, "_malloc": _malloc, "_mkport": _mkport, "_fprintf": _fprintf, "___setErrNo": ___setErrNo, "__formatString": __formatString, "_fileno": _fileno, "_fflush": _fflush, "_write": _write, "STACKTOP": STACKTOP, "STACK_MAX": STACK_MAX, "tempDoublePtr": tempDoublePtr, "ABORT": ABORT, "NaN": NaN, "Infinity": Infinity }, buffer);
+var _strlen = Module["_strlen"] = asm["_strlen"];
+var _memcpy = Module["_memcpy"] = asm["_memcpy"];
+var _main = Module["_main"] = asm["_main"];
+var _memset = Module["_memset"] = asm["_memset"];
+var runPostSets = Module["runPostSets"] = asm["runPostSets"];
+
+Runtime.stackAlloc = function(size) { return asm['stackAlloc'](size) };
+Runtime.stackSave = function() { return asm['stackSave']() };
+Runtime.stackRestore = function(top) { asm['stackRestore'](top) };
+
+
+// Warning: printing of i64 values may be slightly rounded! No deep i64 math used, so precise i64 code not included
+var i64Math = null;
+
+// === Auto-generated postamble setup entry stuff ===
+
+if (memoryInitializer) {
+ if (ENVIRONMENT_IS_NODE || ENVIRONMENT_IS_SHELL) {
+ var data = Module['readBinary'](memoryInitializer);
+ HEAPU8.set(data, STATIC_BASE);
+ } else {
+ addRunDependency('memory initializer');
+ Browser.asyncLoad(memoryInitializer, function(data) {
+ HEAPU8.set(data, STATIC_BASE);
+ removeRunDependency('memory initializer');
+ }, function(data) {
+ throw 'could not load memory initializer ' + memoryInitializer;
+ });
+ }
+}
+
+function ExitStatus(status) {
+ this.name = "ExitStatus";
+ this.message = "Program terminated with exit(" + status + ")";
+ this.status = status;
+};
+ExitStatus.prototype = new Error();
+ExitStatus.prototype.constructor = ExitStatus;
+
+var initialStackTop;
+var preloadStartTime = null;
+var calledMain = false;
+
+dependenciesFulfilled = function runCaller() {
+ // If run has never been called, and we should call run (INVOKE_RUN is true, and Module.noInitialRun is not false)
+ if (!Module['calledRun'] && shouldRunNow) run([].concat(Module["arguments"]));
+ if (!Module['calledRun']) dependenciesFulfilled = runCaller; // try this again later, after new deps are fulfilled
+}
+
+Module['callMain'] = Module.callMain = function callMain(args) {
+ assert(runDependencies == 0, 'cannot call main when async dependencies remain! (listen on __ATMAIN__)');
+ assert(__ATPRERUN__.length == 0, 'cannot call main when preRun functions remain to be called');
+
+ args = args || [];
+
+ ensureInitRuntime();
+
+ var argc = args.length+1;
+ function pad() {
+ for (var i = 0; i < 4-1; i++) {
+ argv.push(0);
+ }
+ }
+ var argv = [allocate(intArrayFromString("/bin/this.program"), 'i8', ALLOC_NORMAL) ];
+ pad();
+ for (var i = 0; i < argc-1; i = i + 1) {
+ argv.push(allocate(intArrayFromString(args[i]), 'i8', ALLOC_NORMAL));
+ pad();
+ }
+ argv.push(0);
+ argv = allocate(argv, 'i32', ALLOC_NORMAL);
+
+ initialStackTop = STACKTOP;
+
+ try {
+
+ var ret = Module['_main'](argc, argv, 0);
+
+
+ // if we're not running an evented main loop, it's time to exit
+ if (!Module['noExitRuntime']) {
+ exit(ret);
+ }
+ }
+ catch(e) {
+ if (e instanceof ExitStatus) {
+ // exit() throws this once it's done to make sure execution
+ // has been stopped completely
+ return;
+ } else if (e == 'SimulateInfiniteLoop') {
+ // running an evented main loop, don't immediately exit
+ Module['noExitRuntime'] = true;
+ return;
+ } else {
+ if (e && typeof e === 'object' && e.stack) Module.printErr('exception thrown: ' + [e, e.stack]);
+ throw e;
+ }
+ } finally {
+ calledMain = true;
+ }
+}
+
+
+
+
+function run(args) {
+ args = args || Module['arguments'];
+
+ if (preloadStartTime === null) preloadStartTime = Date.now();
+
+ if (runDependencies > 0) {
+ Module.printErr('run() called, but dependencies remain, so not running');
+ return;
+ }
+
+ preRun();
+
+ if (runDependencies > 0) return; // a preRun added a dependency, run will be called later
+ if (Module['calledRun']) return; // run may have just been called through dependencies being fulfilled just in this very frame
+
+ function doRun() {
+ if (Module['calledRun']) return; // run may have just been called while the async setStatus time below was happening
+ Module['calledRun'] = true;
+
+ ensureInitRuntime();
+
+ preMain();
+
+ if (ENVIRONMENT_IS_WEB && preloadStartTime !== null) {
+ Module.printErr('pre-main prep time: ' + (Date.now() - preloadStartTime) + ' ms');
+ }
+
+ if (Module['_main'] && shouldRunNow) {
+ Module['callMain'](args);
+ }
+
+ postRun();
+ }
+
+ if (Module['setStatus']) {
+ Module['setStatus']('Running...');
+ setTimeout(function() {
+ setTimeout(function() {
+ Module['setStatus']('');
+ }, 1);
+ if (!ABORT) doRun();
+ }, 1);
+ } else {
+ doRun();
+ }
+}
+Module['run'] = Module.run = run;
+
+function exit(status) {
+ ABORT = true;
+ EXITSTATUS = status;
+ STACKTOP = initialStackTop;
+
+ // exit the runtime
+ exitRuntime();
+
+ // TODO We should handle this differently based on environment.
+ // In the browser, the best we can do is throw an exception
+ // to halt execution, but in node we could process.exit and
+ // I'd imagine SM shell would have something equivalent.
+ // This would let us set a proper exit status (which
+ // would be great for checking test exit statuses).
+ // https://github.com/kripken/emscripten/issues/1371
+
+ // throw an exception to halt the current execution
+ throw new ExitStatus(status);
+}
+Module['exit'] = Module.exit = exit;
+
+function abort(text) {
+ if (text) {
+ Module.print(text);
+ Module.printErr(text);
+ }
+
+ ABORT = true;
+ EXITSTATUS = 1;
+
+ var extra = '\nIf this abort() is unexpected, build with -s ASSERTIONS=1 which can give more information.';
+
+ throw 'abort() at ' + stackTrace() + extra;
+}
+Module['abort'] = Module.abort = abort;
+
+// {{PRE_RUN_ADDITIONS}}
+
+if (Module['preInit']) {
+ if (typeof Module['preInit'] == 'function') Module['preInit'] = [Module['preInit']];
+ while (Module['preInit'].length > 0) {
+ Module['preInit'].pop()();
+ }
+}
+
+// shouldRunNow refers to calling main(), not run().
+var shouldRunNow = true;
+if (Module['noInitialRun']) {
+ shouldRunNow = false;
+}
+
+
+run([].concat(Module["arguments"]));
diff --git a/test/mjsunit/wasm/embenchen/zlib.js b/test/mjsunit/wasm/embenchen/zlib.js
new file mode 100644
index 0000000..9c0d30a
--- /dev/null
+++ b/test/mjsunit/wasm/embenchen/zlib.js
@@ -0,0 +1,14755 @@
+// Modified embenchen to direct to asm-wasm.
+// Flags: --expose-wasm
+
+var EXPECTED_OUTPUT = 'sizes: 100000,25906\nok.\n';
+var Module = {
+ arguments: [1],
+ print: function(x) {Module.printBuffer += x + '\n';},
+ preRun: [function() {Module.printBuffer = ''}],
+ postRun: [function() {
+ assertEquals(EXPECTED_OUTPUT, Module.printBuffer);
+ }],
+};
+// The Module object: Our interface to the outside world. We import
+// and export values on it, and do the work to get that through
+// closure compiler if necessary. There are various ways Module can be used:
+// 1. Not defined. We create it here
+// 2. A function parameter, function(Module) { ..generated code.. }
+// 3. pre-run appended it, var Module = {}; ..generated code..
+// 4. External script tag defines var Module.
+// We need to do an eval in order to handle the closure compiler
+// case, where this code here is minified but Module was defined
+// elsewhere (e.g. case 4 above). We also need to check if Module
+// already exists (e.g. case 3 above).
+// Note that if you want to run closure, and also to use Module
+// after the generated code, you will need to define var Module = {};
+// before the code. Then that object will be used in the code, and you
+// can continue to use Module afterwards as well.
+var Module;
+if (!Module) Module = (typeof Module !== 'undefined' ? Module : null) || {};
+
+// Sometimes an existing Module object exists with properties
+// meant to overwrite the default module functionality. Here
+// we collect those properties and reapply _after_ we configure
+// the current environment's defaults to avoid having to be so
+// defensive during initialization.
+var moduleOverrides = {};
+for (var key in Module) {
+ if (Module.hasOwnProperty(key)) {
+ moduleOverrides[key] = Module[key];
+ }
+}
+
+// The environment setup code below is customized to use Module.
+// *** Environment setup code ***
+var ENVIRONMENT_IS_NODE = typeof process === 'object' && typeof require === 'function';
+var ENVIRONMENT_IS_WEB = typeof window === 'object';
+var ENVIRONMENT_IS_WORKER = typeof importScripts === 'function';
+var ENVIRONMENT_IS_SHELL = !ENVIRONMENT_IS_WEB && !ENVIRONMENT_IS_NODE && !ENVIRONMENT_IS_WORKER;
+
+if (ENVIRONMENT_IS_NODE) {
+ // Expose functionality in the same simple way that the shells work
+ // Note that we pollute the global namespace here, otherwise we break in node
+ if (!Module['print']) Module['print'] = function print(x) {
+ process['stdout'].write(x + '\n');
+ };
+ if (!Module['printErr']) Module['printErr'] = function printErr(x) {
+ process['stderr'].write(x + '\n');
+ };
+
+ var nodeFS = require('fs');
+ var nodePath = require('path');
+
+ Module['read'] = function read(filename, binary) {
+ filename = nodePath['normalize'](filename);
+ var ret = nodeFS['readFileSync'](filename);
+ // The path is absolute if the normalized version is the same as the resolved.
+ if (!ret && filename != nodePath['resolve'](filename)) {
+ filename = path.join(__dirname, '..', 'src', filename);
+ ret = nodeFS['readFileSync'](filename);
+ }
+ if (ret && !binary) ret = ret.toString();
+ return ret;
+ };
+
+ Module['readBinary'] = function readBinary(filename) { return Module['read'](filename, true) };
+
+ Module['load'] = function load(f) {
+ globalEval(read(f));
+ };
+
+ Module['arguments'] = process['argv'].slice(2);
+
+ module['exports'] = Module;
+}
+else if (ENVIRONMENT_IS_SHELL) {
+ if (!Module['print']) Module['print'] = print;
+ if (typeof printErr != 'undefined') Module['printErr'] = printErr; // not present in v8 or older sm
+
+ if (typeof read != 'undefined') {
+ Module['read'] = read;
+ } else {
+ Module['read'] = function read() { throw 'no read() available (jsc?)' };
+ }
+
+ Module['readBinary'] = function readBinary(f) {
+ return read(f, 'binary');
+ };
+
+ if (typeof scriptArgs != 'undefined') {
+ Module['arguments'] = scriptArgs;
+ } else if (typeof arguments != 'undefined') {
+ Module['arguments'] = arguments;
+ }
+
+ this['Module'] = Module;
+
+ eval("if (typeof gc === 'function' && gc.toString().indexOf('[native code]') > 0) var gc = undefined"); // wipe out the SpiderMonkey shell 'gc' function, which can confuse closure (uses it as a minified name, and it is then initted to a non-falsey value unexpectedly)
+}
+else if (ENVIRONMENT_IS_WEB || ENVIRONMENT_IS_WORKER) {
+ Module['read'] = function read(url) {
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, false);
+ xhr.send(null);
+ return xhr.responseText;
+ };
+
+ if (typeof arguments != 'undefined') {
+ Module['arguments'] = arguments;
+ }
+
+ if (typeof console !== 'undefined') {
+ if (!Module['print']) Module['print'] = function print(x) {
+ console.log(x);
+ };
+ if (!Module['printErr']) Module['printErr'] = function printErr(x) {
+ console.log(x);
+ };
+ } else {
+ // Probably a worker, and without console.log. We can do very little here...
+ var TRY_USE_DUMP = false;
+ if (!Module['print']) Module['print'] = (TRY_USE_DUMP && (typeof(dump) !== "undefined") ? (function(x) {
+ dump(x);
+ }) : (function(x) {
+ // self.postMessage(x); // enable this if you want stdout to be sent as messages
+ }));
+ }
+
+ if (ENVIRONMENT_IS_WEB) {
+ window['Module'] = Module;
+ } else {
+ Module['load'] = importScripts;
+ }
+}
+else {
+ // Unreachable because SHELL is dependant on the others
+ throw 'Unknown runtime environment. Where are we?';
+}
+
+function globalEval(x) {
+ eval.call(null, x);
+}
+if (!Module['load'] == 'undefined' && Module['read']) {
+ Module['load'] = function load(f) {
+ globalEval(Module['read'](f));
+ };
+}
+if (!Module['print']) {
+ Module['print'] = function(){};
+}
+if (!Module['printErr']) {
+ Module['printErr'] = Module['print'];
+}
+if (!Module['arguments']) {
+ Module['arguments'] = [];
+}
+// *** Environment setup code ***
+
+// Closure helpers
+Module.print = Module['print'];
+Module.printErr = Module['printErr'];
+
+// Callbacks
+Module['preRun'] = [];
+Module['postRun'] = [];
+
+// Merge back in the overrides
+for (var key in moduleOverrides) {
+ if (moduleOverrides.hasOwnProperty(key)) {
+ Module[key] = moduleOverrides[key];
+ }
+}
+
+
+
+// === Auto-generated preamble library stuff ===
+
+//========================================
+// Runtime code shared with compiler
+//========================================
+
+var Runtime = {
+ stackSave: function () {
+ return STACKTOP;
+ },
+ stackRestore: function (stackTop) {
+ STACKTOP = stackTop;
+ },
+ forceAlign: function (target, quantum) {
+ quantum = quantum || 4;
+ if (quantum == 1) return target;
+ if (isNumber(target) && isNumber(quantum)) {
+ return Math.ceil(target/quantum)*quantum;
+ } else if (isNumber(quantum) && isPowerOfTwo(quantum)) {
+ return '(((' +target + ')+' + (quantum-1) + ')&' + -quantum + ')';
+ }
+ return 'Math.ceil((' + target + ')/' + quantum + ')*' + quantum;
+ },
+ isNumberType: function (type) {
+ return type in Runtime.INT_TYPES || type in Runtime.FLOAT_TYPES;
+ },
+ isPointerType: function isPointerType(type) {
+ return type[type.length-1] == '*';
+},
+ isStructType: function isStructType(type) {
+ if (isPointerType(type)) return false;
+ if (isArrayType(type)) return true;
+ if (/<?\{ ?[^}]* ?\}>?/.test(type)) return true; // { i32, i8 } etc. - anonymous struct types
+ // See comment in isStructPointerType()
+ return type[0] == '%';
+},
+ INT_TYPES: {"i1":0,"i8":0,"i16":0,"i32":0,"i64":0},
+ FLOAT_TYPES: {"float":0,"double":0},
+ or64: function (x, y) {
+ var l = (x | 0) | (y | 0);
+ var h = (Math.round(x / 4294967296) | Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ and64: function (x, y) {
+ var l = (x | 0) & (y | 0);
+ var h = (Math.round(x / 4294967296) & Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ xor64: function (x, y) {
+ var l = (x | 0) ^ (y | 0);
+ var h = (Math.round(x / 4294967296) ^ Math.round(y / 4294967296)) * 4294967296;
+ return l + h;
+ },
+ getNativeTypeSize: function (type) {
+ switch (type) {
+ case 'i1': case 'i8': return 1;
+ case 'i16': return 2;
+ case 'i32': return 4;
+ case 'i64': return 8;
+ case 'float': return 4;
+ case 'double': return 8;
+ default: {
+ if (type[type.length-1] === '*') {
+ return Runtime.QUANTUM_SIZE; // A pointer
+ } else if (type[0] === 'i') {
+ var bits = parseInt(type.substr(1));
+ assert(bits % 8 === 0);
+ return bits/8;
+ } else {
+ return 0;
+ }
+ }
+ }
+ },
+ getNativeFieldSize: function (type) {
+ return Math.max(Runtime.getNativeTypeSize(type), Runtime.QUANTUM_SIZE);
+ },
+ dedup: function dedup(items, ident) {
+ var seen = {};
+ if (ident) {
+ return items.filter(function(item) {
+ if (seen[item[ident]]) return false;
+ seen[item[ident]] = true;
+ return true;
+ });
+ } else {
+ return items.filter(function(item) {
+ if (seen[item]) return false;
+ seen[item] = true;
+ return true;
+ });
+ }
+},
+ set: function set() {
+ var args = typeof arguments[0] === 'object' ? arguments[0] : arguments;
+ var ret = {};
+ for (var i = 0; i < args.length; i++) {
+ ret[args[i]] = 0;
+ }
+ return ret;
+},
+ STACK_ALIGN: 8,
+ getAlignSize: function (type, size, vararg) {
+ // we align i64s and doubles on 64-bit boundaries, unlike x86
+ if (!vararg && (type == 'i64' || type == 'double')) return 8;
+ if (!type) return Math.min(size, 8); // align structures internally to 64 bits
+ return Math.min(size || (type ? Runtime.getNativeFieldSize(type) : 0), Runtime.QUANTUM_SIZE);
+ },
+ calculateStructAlignment: function calculateStructAlignment(type) {
+ type.flatSize = 0;
+ type.alignSize = 0;
+ var diffs = [];
+ var prev = -1;
+ var index = 0;
+ type.flatIndexes = type.fields.map(function(field) {
+ index++;
+ var size, alignSize;
+ if (Runtime.isNumberType(field) || Runtime.isPointerType(field)) {
+ size = Runtime.getNativeTypeSize(field); // pack char; char; in structs, also char[X]s.
+ alignSize = Runtime.getAlignSize(field, size);
+ } else if (Runtime.isStructType(field)) {
+ if (field[1] === '0') {
+ // this is [0 x something]. When inside another structure like here, it must be at the end,
+ // and it adds no size
+ // XXX this happens in java-nbody for example... assert(index === type.fields.length, 'zero-length in the middle!');
+ size = 0;
+ if (Types.types[field]) {
+ alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
+ } else {
+ alignSize = type.alignSize || QUANTUM_SIZE;
+ }
+ } else {
+ size = Types.types[field].flatSize;
+ alignSize = Runtime.getAlignSize(null, Types.types[field].alignSize);
+ }
+ } else if (field[0] == 'b') {
+ // bN, large number field, like a [N x i8]
+ size = field.substr(1)|0;
+ alignSize = 1;
+ } else if (field[0] === '<') {
+ // vector type
+ size = alignSize = Types.types[field].flatSize; // fully aligned
+ } else if (field[0] === 'i') {
+ // illegal integer field, that could not be legalized because it is an internal structure field
+ // it is ok to have such fields, if we just use them as markers of field size and nothing more complex
+ size = alignSize = parseInt(field.substr(1))/8;
+ assert(size % 1 === 0, 'cannot handle non-byte-size field ' + field);
+ } else {
+ assert(false, 'invalid type for calculateStructAlignment');
+ }
+ if (type.packed) alignSize = 1;
+ type.alignSize = Math.max(type.alignSize, alignSize);
+ var curr = Runtime.alignMemory(type.flatSize, alignSize); // if necessary, place this on aligned memory
+ type.flatSize = curr + size;
+ if (prev >= 0) {
+ diffs.push(curr-prev);
+ }
+ prev = curr;
+ return curr;
+ });
+ if (type.name_ && type.name_[0] === '[') {
+ // arrays have 2 elements, so we get the proper difference. then we scale here. that way we avoid
+ // allocating a potentially huge array for [999999 x i8] etc.
+ type.flatSize = parseInt(type.name_.substr(1))*type.flatSize/2;
+ }
+ type.flatSize = Runtime.alignMemory(type.flatSize, type.alignSize);
+ if (diffs.length == 0) {
+ type.flatFactor = type.flatSize;
+ } else if (Runtime.dedup(diffs).length == 1) {
+ type.flatFactor = diffs[0];
+ }
+ type.needsFlattening = (type.flatFactor != 1);
+ return type.flatIndexes;
+ },
+ generateStructInfo: function (struct, typeName, offset) {
+ var type, alignment;
+ if (typeName) {
+ offset = offset || 0;
+ type = (typeof Types === 'undefined' ? Runtime.typeInfo : Types.types)[typeName];
+ if (!type) return null;
+ if (type.fields.length != struct.length) {
+ printErr('Number of named fields must match the type for ' + typeName + ': possibly duplicate struct names. Cannot return structInfo');
+ return null;
+ }
+ alignment = type.flatIndexes;
+ } else {
+ var type = { fields: struct.map(function(item) { return item[0] }) };
+ alignment = Runtime.calculateStructAlignment(type);
+ }
+ var ret = {
+ __size__: type.flatSize
+ };
+ if (typeName) {
+ struct.forEach(function(item, i) {
+ if (typeof item === 'string') {
+ ret[item] = alignment[i] + offset;
+ } else {
+ // embedded struct
+ var key;
+ for (var k in item) key = k;
+ ret[key] = Runtime.generateStructInfo(item[key], type.fields[i], alignment[i]);
+ }
+ });
+ } else {
+ struct.forEach(function(item, i) {
+ ret[item[1]] = alignment[i];
+ });
+ }
+ return ret;
+ },
+ dynCall: function (sig, ptr, args) {
+ if (args && args.length) {
+ if (!args.splice) args = Array.prototype.slice.call(args);
+ args.splice(0, 0, ptr);
+ return Module['dynCall_' + sig].apply(null, args);
+ } else {
+ return Module['dynCall_' + sig].call(null, ptr);
+ }
+ },
+ functionPointers: [],
+ addFunction: function (func) {
+ for (var i = 0; i < Runtime.functionPointers.length; i++) {
+ if (!Runtime.functionPointers[i]) {
+ Runtime.functionPointers[i] = func;
+ return 2*(1 + i);
+ }
+ }
+ throw 'Finished up all reserved function pointers. Use a higher value for RESERVED_FUNCTION_POINTERS.';
+ },
+ removeFunction: function (index) {
+ Runtime.functionPointers[(index-2)/2] = null;
+ },
+ getAsmConst: function (code, numArgs) {
+ // code is a constant string on the heap, so we can cache these
+ if (!Runtime.asmConstCache) Runtime.asmConstCache = {};
+ var func = Runtime.asmConstCache[code];
+ if (func) return func;
+ var args = [];
+ for (var i = 0; i < numArgs; i++) {
+ args.push(String.fromCharCode(36) + i); // $0, $1 etc
+ }
+ var source = Pointer_stringify(code);
+ if (source[0] === '"') {
+ // tolerate EM_ASM("..code..") even though EM_ASM(..code..) is correct
+ if (source.indexOf('"', 1) === source.length-1) {
+ source = source.substr(1, source.length-2);
+ } else {
+ // something invalid happened, e.g. EM_ASM("..code($0)..", input)
+ abort('invalid EM_ASM input |' + source + '|. Please use EM_ASM(..code..) (no quotes) or EM_ASM({ ..code($0).. }, input) (to input values)');
+ }
+ }
+ try {
+ var evalled = eval('(function(' + args.join(',') + '){ ' + source + ' })'); // new Function does not allow upvars in node
+ } catch(e) {
+ Module.printErr('error in executing inline EM_ASM code: ' + e + ' on: \n\n' + source + '\n\nwith args |' + args + '| (make sure to use the right one out of EM_ASM, EM_ASM_ARGS, etc.)');
+ throw e;
+ }
+ return Runtime.asmConstCache[code] = evalled;
+ },
+ warnOnce: function (text) {
+ if (!Runtime.warnOnce.shown) Runtime.warnOnce.shown = {};
+ if (!Runtime.warnOnce.shown[text]) {
+ Runtime.warnOnce.shown[text] = 1;
+ Module.printErr(text);
+ }
+ },
+ funcWrappers: {},
+ getFuncWrapper: function (func, sig) {
+ assert(sig);
+ if (!Runtime.funcWrappers[func]) {
+ Runtime.funcWrappers[func] = function dynCall_wrapper() {
+ return Runtime.dynCall(sig, func, arguments);
+ };
+ }
+ return Runtime.funcWrappers[func];
+ },
+ UTF8Processor: function () {
+ var buffer = [];
+ var needed = 0;
+ this.processCChar = function (code) {
+ code = code & 0xFF;
+
+ if (buffer.length == 0) {
+ if ((code & 0x80) == 0x00) { // 0xxxxxxx
+ return String.fromCharCode(code);
+ }
+ buffer.push(code);
+ if ((code & 0xE0) == 0xC0) { // 110xxxxx
+ needed = 1;
+ } else if ((code & 0xF0) == 0xE0) { // 1110xxxx
+ needed = 2;
+ } else { // 11110xxx
+ needed = 3;
+ }
+ return '';
+ }
+
+ if (needed) {
+ buffer.push(code);
+ needed--;
+ if (needed > 0) return '';
+ }
+
+ var c1 = buffer[0];
+ var c2 = buffer[1];
+ var c3 = buffer[2];
+ var c4 = buffer[3];
+ var ret;
+ if (buffer.length == 2) {
+ ret = String.fromCharCode(((c1 & 0x1F) << 6) | (c2 & 0x3F));
+ } else if (buffer.length == 3) {
+ ret = String.fromCharCode(((c1 & 0x0F) << 12) | ((c2 & 0x3F) << 6) | (c3 & 0x3F));
+ } else {
+ // http://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae
+ var codePoint = ((c1 & 0x07) << 18) | ((c2 & 0x3F) << 12) |
+ ((c3 & 0x3F) << 6) | (c4 & 0x3F);
+ ret = String.fromCharCode(
+ Math.floor((codePoint - 0x10000) / 0x400) + 0xD800,
+ (codePoint - 0x10000) % 0x400 + 0xDC00);
+ }
+ buffer.length = 0;
+ return ret;
+ }
+ this.processJSString = function processJSString(string) {
+ /* TODO: use TextEncoder when present,
+ var encoder = new TextEncoder();
+ encoder['encoding'] = "utf-8";
+ var utf8Array = encoder['encode'](aMsg.data);
+ */
+ string = unescape(encodeURIComponent(string));
+ var ret = [];
+ for (var i = 0; i < string.length; i++) {
+ ret.push(string.charCodeAt(i));
+ }
+ return ret;
+ }
+ },
+ getCompilerSetting: function (name) {
+ throw 'You must build with -s RETAIN_COMPILER_SETTINGS=1 for Runtime.getCompilerSetting or emscripten_get_compiler_setting to work';
+ },
+ stackAlloc: function (size) { var ret = STACKTOP;STACKTOP = (STACKTOP + size)|0;STACKTOP = (((STACKTOP)+7)&-8); return ret; },
+ staticAlloc: function (size) { var ret = STATICTOP;STATICTOP = (STATICTOP + size)|0;STATICTOP = (((STATICTOP)+7)&-8); return ret; },
+ dynamicAlloc: function (size) { var ret = DYNAMICTOP;DYNAMICTOP = (DYNAMICTOP + size)|0;DYNAMICTOP = (((DYNAMICTOP)+7)&-8); if (DYNAMICTOP >= TOTAL_MEMORY) enlargeMemory();; return ret; },
+ alignMemory: function (size,quantum) { var ret = size = Math.ceil((size)/(quantum ? quantum : 8))*(quantum ? quantum : 8); return ret; },
+ makeBigInt: function (low,high,unsigned) { var ret = (unsigned ? ((+((low>>>0)))+((+((high>>>0)))*(+4294967296))) : ((+((low>>>0)))+((+((high|0)))*(+4294967296)))); return ret; },
+ GLOBAL_BASE: 8,
+ QUANTUM_SIZE: 4,
+ __dummy__: 0
+}
+
+
+Module['Runtime'] = Runtime;
+
+
+
+
+
+
+
+
+
+//========================================
+// Runtime essentials
+//========================================
+
+var __THREW__ = 0; // Used in checking for thrown exceptions.
+
+var ABORT = false; // whether we are quitting the application. no code should run after this. set in exit() and abort()
+var EXITSTATUS = 0;
+
+var undef = 0;
+// tempInt is used for 32-bit signed values or smaller. tempBigInt is used
+// for 32-bit unsigned values or more than 32 bits. TODO: audit all uses of tempInt
+var tempValue, tempInt, tempBigInt, tempInt2, tempBigInt2, tempPair, tempBigIntI, tempBigIntR, tempBigIntS, tempBigIntP, tempBigIntD, tempDouble, tempFloat;
+var tempI64, tempI64b;
+var tempRet0, tempRet1, tempRet2, tempRet3, tempRet4, tempRet5, tempRet6, tempRet7, tempRet8, tempRet9;
+
+function assert(condition, text) {
+ if (!condition) {
+ abort('Assertion failed: ' + text);
+ }
+}
+
+var globalScope = this;
+
+// C calling interface. A convenient way to call C functions (in C files, or
+// defined with extern "C").
+//
+// Note: LLVM optimizations can inline and remove functions, after which you will not be
+// able to call them. Closure can also do so. To avoid that, add your function to
+// the exports using something like
+//
+// -s EXPORTED_FUNCTIONS='["_main", "_myfunc"]'
+//
+// @param ident The name of the C function (note that C++ functions will be name-mangled - use extern "C")
+// @param returnType The return type of the function, one of the JS types 'number', 'string' or 'array' (use 'number' for any C pointer, and
+// 'array' for JavaScript arrays and typed arrays; note that arrays are 8-bit).
+// @param argTypes An array of the types of arguments for the function (if there are no arguments, this can be ommitted). Types are as in returnType,
+// except that 'array' is not possible (there is no way for us to know the length of the array)
+// @param args An array of the arguments to the function, as native JS values (as in returnType)
+// Note that string arguments will be stored on the stack (the JS string will become a C string on the stack).
+// @return The return value, as a native JS value (as in returnType)
+function ccall(ident, returnType, argTypes, args) {
+ return ccallFunc(getCFunc(ident), returnType, argTypes, args);
+}
+Module["ccall"] = ccall;
+
+// Returns the C function with a specified identifier (for C++, you need to do manual name mangling)
+function getCFunc(ident) {
+ try {
+ var func = Module['_' + ident]; // closure exported function
+ if (!func) func = eval('_' + ident); // explicit lookup
+ } catch(e) {
+ }
+ assert(func, 'Cannot call unknown function ' + ident + ' (perhaps LLVM optimizations or closure removed it?)');
+ return func;
+}
+
+// Internal function that does a C call using a function, not an identifier
+function ccallFunc(func, returnType, argTypes, args) {
+ var stack = 0;
+ function toC(value, type) {
+ if (type == 'string') {
+ if (value === null || value === undefined || value === 0) return 0; // null string
+ value = intArrayFromString(value);
+ type = 'array';
+ }
+ if (type == 'array') {
+ if (!stack) stack = Runtime.stackSave();
+ var ret = Runtime.stackAlloc(value.length);
+ writeArrayToMemory(value, ret);
+ return ret;
+ }
+ return value;
+ }
+ function fromC(value, type) {
+ if (type == 'string') {
+ return Pointer_stringify(value);
+ }
+ assert(type != 'array');
+ return value;
+ }
+ var i = 0;
+ var cArgs = args ? args.map(function(arg) {
+ return toC(arg, argTypes[i++]);
+ }) : [];
+ var ret = fromC(func.apply(null, cArgs), returnType);
+ if (stack) Runtime.stackRestore(stack);
+ return ret;
+}
+
+// Returns a native JS wrapper for a C function. This is similar to ccall, but
+// returns a function you can call repeatedly in a normal way. For example:
+//
+// var my_function = cwrap('my_c_function', 'number', ['number', 'number']);
+// alert(my_function(5, 22));
+// alert(my_function(99, 12));
+//
+function cwrap(ident, returnType, argTypes) {
+ var func = getCFunc(ident);
+ return function() {
+ return ccallFunc(func, returnType, argTypes, Array.prototype.slice.call(arguments));
+ }
+}
+Module["cwrap"] = cwrap;
+
+// Sets a value in memory in a dynamic way at run-time. Uses the
+// type data. This is the same as makeSetValue, except that
+// makeSetValue is done at compile-time and generates the needed
+// code then, whereas this function picks the right code at
+// run-time.
+// Note that setValue and getValue only do *aligned* writes and reads!
+// Note that ccall uses JS types as for defining types, while setValue and
+// getValue need LLVM types ('i8', 'i32') - this is a lower-level operation
+function setValue(ptr, value, type, noSafe) {
+ type = type || 'i8';
+ if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
+ switch(type) {
+ case 'i1': HEAP8[(ptr)]=value; break;
+ case 'i8': HEAP8[(ptr)]=value; break;
+ case 'i16': HEAP16[((ptr)>>1)]=value; break;
+ case 'i32': HEAP32[((ptr)>>2)]=value; break;
+ case 'i64': (tempI64 = [value>>>0,(tempDouble=value,(+(Math_abs(tempDouble))) >= (+1) ? (tempDouble > (+0) ? ((Math_min((+(Math_floor((tempDouble)/(+4294967296)))), (+4294967295)))|0)>>>0 : (~~((+(Math_ceil((tempDouble - +(((~~(tempDouble)))>>>0))/(+4294967296))))))>>>0) : 0)],HEAP32[((ptr)>>2)]=tempI64[0],HEAP32[(((ptr)+(4))>>2)]=tempI64[1]); break;
+ case 'float': HEAPF32[((ptr)>>2)]=value; break;
+ case 'double': HEAPF64[((ptr)>>3)]=value; break;
+ default: abort('invalid type for setValue: ' + type);
+ }
+}
+Module['setValue'] = setValue;
+
+// Parallel to setValue.
+function getValue(ptr, type, noSafe) {
+ type = type || 'i8';
+ if (type.charAt(type.length-1) === '*') type = 'i32'; // pointers are 32-bit
+ switch(type) {
+ case 'i1': return HEAP8[(ptr)];
+ case 'i8': return HEAP8[(ptr)];
+ case 'i16': return HEAP16[((ptr)>>1)];
+ case 'i32': return HEAP32[((ptr)>>2)];
+ case 'i64': return HEAP32[((ptr)>>2)];
+ case 'float': return HEAPF32[((ptr)>>2)];
+ case 'double': return HEAPF64[((ptr)>>3)];
+ default: abort('invalid type for setValue: ' + type);
+ }
+ return null;
+}
+Module['getValue'] = getValue;
+
+var ALLOC_NORMAL = 0; // Tries to use _malloc()
+var ALLOC_STACK = 1; // Lives for the duration of the current function call
+var ALLOC_STATIC = 2; // Cannot be freed
+var ALLOC_DYNAMIC = 3; // Cannot be freed except through sbrk
+var ALLOC_NONE = 4; // Do not allocate
+Module['ALLOC_NORMAL'] = ALLOC_NORMAL;
+Module['ALLOC_STACK'] = ALLOC_STACK;
+Module['ALLOC_STATIC'] = ALLOC_STATIC;
+Module['ALLOC_DYNAMIC'] = ALLOC_DYNAMIC;
+Module['ALLOC_NONE'] = ALLOC_NONE;
+
+// allocate(): This is for internal use. You can use it yourself as well, but the interface
+// is a little tricky (see docs right below). The reason is that it is optimized
+// for multiple syntaxes to save space in generated code. So you should
+// normally not use allocate(), and instead allocate memory using _malloc(),
+// initialize it with setValue(), and so forth.
+// @slab: An array of data, or a number. If a number, then the size of the block to allocate,
+// in *bytes* (note that this is sometimes confusing: the next parameter does not
+// affect this!)
+// @types: Either an array of types, one for each byte (or 0 if no type at that position),
+// or a single type which is used for the entire block. This only matters if there
+// is initial data - if @slab is a number, then this does not matter at all and is
+// ignored.
+// @allocator: How to allocate memory, see ALLOC_*
+function allocate(slab, types, allocator, ptr) {
+ var zeroinit, size;
+ if (typeof slab === 'number') {
+ zeroinit = true;
+ size = slab;
+ } else {
+ zeroinit = false;
+ size = slab.length;
+ }
+
+ var singleType = typeof types === 'string' ? types : null;
+
+ var ret;
+ if (allocator == ALLOC_NONE) {
+ ret = ptr;
+ } else {
+ ret = [_malloc, Runtime.stackAlloc, Runtime.staticAlloc, Runtime.dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](Math.max(size, singleType ? 1 : types.length));
+ }
+
+ if (zeroinit) {
+ var ptr = ret, stop;
+ assert((ret & 3) == 0);
+ stop = ret + (size & ~3);
+ for (; ptr < stop; ptr += 4) {
+ HEAP32[((ptr)>>2)]=0;
+ }
+ stop = ret + size;
+ while (ptr < stop) {
+ HEAP8[((ptr++)|0)]=0;
+ }
+ return ret;
+ }
+
+ if (singleType === 'i8') {
+ if (slab.subarray || slab.slice) {
+ HEAPU8.set(slab, ret);
+ } else {
+ HEAPU8.set(new Uint8Array(slab), ret);
+ }
+ return ret;
+ }
+
+ var i = 0, type, typeSize, previousType;
+ while (i < size) {
+ var curr = slab[i];
+
+ if (typeof curr === 'function') {
+ curr = Runtime.getFunctionIndex(curr);
+ }
+
+ type = singleType || types[i];
+ if (type === 0) {
+ i++;
+ continue;
+ }
+
+ if (type == 'i64') type = 'i32'; // special case: we have one i32 here, and one i32 later
+
+ setValue(ret+i, curr, type);
+
+ // no need to look up size unless type changes, so cache it
+ if (previousType !== type) {
+ typeSize = Runtime.getNativeTypeSize(type);
+ previousType = type;
+ }
+ i += typeSize;
+ }
+
+ return ret;
+}
+Module['allocate'] = allocate;
+
+function Pointer_stringify(ptr, /* optional */ length) {
+ // TODO: use TextDecoder
+ // Find the length, and check for UTF while doing so
+ var hasUtf = false;
+ var t;
+ var i = 0;
+ while (1) {
+ t = HEAPU8[(((ptr)+(i))|0)];
+ if (t >= 128) hasUtf = true;
+ else if (t == 0 && !length) break;
+ i++;
+ if (length && i == length) break;
+ }
+ if (!length) length = i;
+
+ var ret = '';
+
+ if (!hasUtf) {
+ var MAX_CHUNK = 1024; // split up into chunks, because .apply on a huge string can overflow the stack
+ var curr;
+ while (length > 0) {
+ curr = String.fromCharCode.apply(String, HEAPU8.subarray(ptr, ptr + Math.min(length, MAX_CHUNK)));
+ ret = ret ? ret + curr : curr;
+ ptr += MAX_CHUNK;
+ length -= MAX_CHUNK;
+ }
+ return ret;
+ }
+
+ var utf8 = new Runtime.UTF8Processor();
+ for (i = 0; i < length; i++) {
+ t = HEAPU8[(((ptr)+(i))|0)];
+ ret += utf8.processCChar(t);
+ }
+ return ret;
+}
+Module['Pointer_stringify'] = Pointer_stringify;
+
+// Given a pointer 'ptr' to a null-terminated UTF16LE-encoded string in the emscripten HEAP, returns
+// a copy of that string as a Javascript String object.
+function UTF16ToString(ptr) {
+ var i = 0;
+
+ var str = '';
+ while (1) {
+ var codeUnit = HEAP16[(((ptr)+(i*2))>>1)];
+ if (codeUnit == 0)
+ return str;
+ ++i;
+ // fromCharCode constructs a character from a UTF-16 code unit, so we can pass the UTF16 string right through.
+ str += String.fromCharCode(codeUnit);
+ }
+}
+Module['UTF16ToString'] = UTF16ToString;
+
+// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
+// null-terminated and encoded in UTF16LE form. The copy will require at most (str.length*2+1)*2 bytes of space in the HEAP.
+function stringToUTF16(str, outPtr) {
+ for(var i = 0; i < str.length; ++i) {
+ // charCodeAt returns a UTF-16 encoded code unit, so it can be directly written to the HEAP.
+ var codeUnit = str.charCodeAt(i); // possibly a lead surrogate
+ HEAP16[(((outPtr)+(i*2))>>1)]=codeUnit;
+ }
+ // Null-terminate the pointer to the HEAP.
+ HEAP16[(((outPtr)+(str.length*2))>>1)]=0;
+}
+Module['stringToUTF16'] = stringToUTF16;
+
+// Given a pointer 'ptr' to a null-terminated UTF32LE-encoded string in the emscripten HEAP, returns
+// a copy of that string as a Javascript String object.
+function UTF32ToString(ptr) {
+ var i = 0;
+
+ var str = '';
+ while (1) {
+ var utf32 = HEAP32[(((ptr)+(i*4))>>2)];
+ if (utf32 == 0)
+ return str;
+ ++i;
+ // Gotcha: fromCharCode constructs a character from a UTF-16 encoded code (pair), not from a Unicode code point! So encode the code point to UTF-16 for constructing.
+ if (utf32 >= 0x10000) {
+ var ch = utf32 - 0x10000;
+ str += String.fromCharCode(0xD800 | (ch >> 10), 0xDC00 | (ch & 0x3FF));
+ } else {
+ str += String.fromCharCode(utf32);
+ }
+ }
+}
+Module['UTF32ToString'] = UTF32ToString;
+
+// Copies the given Javascript String object 'str' to the emscripten HEAP at address 'outPtr',
+// null-terminated and encoded in UTF32LE form. The copy will require at most (str.length+1)*4 bytes of space in the HEAP,
+// but can use less, since str.length does not return the number of characters in the string, but the number of UTF-16 code units in the string.
+function stringToUTF32(str, outPtr) {
+ var iChar = 0;
+ for(var iCodeUnit = 0; iCodeUnit < str.length; ++iCodeUnit) {
+ // Gotcha: charCodeAt returns a 16-bit word that is a UTF-16 encoded code unit, not a Unicode code point of the character! We must decode the string to UTF-32 to the heap.
+ var codeUnit = str.charCodeAt(iCodeUnit); // possibly a lead surrogate
+ if (codeUnit >= 0xD800 && codeUnit <= 0xDFFF) {
+ var trailSurrogate = str.charCodeAt(++iCodeUnit);
+ codeUnit = 0x10000 + ((codeUnit & 0x3FF) << 10) | (trailSurrogate & 0x3FF);
+ }
+ HEAP32[(((outPtr)+(iChar*4))>>2)]=codeUnit;
+ ++iChar;
+ }
+ // Null-terminate the pointer to the HEAP.
+ HEAP32[(((outPtr)+(iChar*4))>>2)]=0;
+}
+Module['stringToUTF32'] = stringToUTF32;
+
+function demangle(func) {
+ var i = 3;
+ // params, etc.
+ var basicTypes = {
+ 'v': 'void',
+ 'b': 'bool',
+ 'c': 'char',
+ 's': 'short',
+ 'i': 'int',
+ 'l': 'long',
+ 'f': 'float',
+ 'd': 'double',
+ 'w': 'wchar_t',
+ 'a': 'signed char',
+ 'h': 'unsigned char',
+ 't': 'unsigned short',
+ 'j': 'unsigned int',
+ 'm': 'unsigned long',
+ 'x': 'long long',
+ 'y': 'unsigned long long',
+ 'z': '...'
+ };
+ var subs = [];
+ var first = true;
+ function dump(x) {
+ //return;
+ if (x) Module.print(x);
+ Module.print(func);
+ var pre = '';
+ for (var a = 0; a < i; a++) pre += ' ';
+ Module.print (pre + '^');
+ }
+ function parseNested() {
+ i++;
+ if (func[i] === 'K') i++; // ignore const
+ var parts = [];
+ while (func[i] !== 'E') {
+ if (func[i] === 'S') { // substitution
+ i++;
+ var next = func.indexOf('_', i);
+ var num = func.substring(i, next) || 0;
+ parts.push(subs[num] || '?');
+ i = next+1;
+ continue;
+ }
+ if (func[i] === 'C') { // constructor
+ parts.push(parts[parts.length-1]);
+ i += 2;
+ continue;
+ }
+ var size = parseInt(func.substr(i));
+ var pre = size.toString().length;
+ if (!size || !pre) { i--; break; } // counter i++ below us
+ var curr = func.substr(i + pre, size);
+ parts.push(curr);
+ subs.push(curr);
+ i += pre + size;
+ }
+ i++; // skip E
+ return parts;
+ }
+ function parse(rawList, limit, allowVoid) { // main parser
+ limit = limit || Infinity;
+ var ret = '', list = [];
+ function flushList() {
+ return '(' + list.join(', ') + ')';
+ }
+ var name;
+ if (func[i] === 'N') {
+ // namespaced N-E
+ name = parseNested().join('::');
+ limit--;
+ if (limit === 0) return rawList ? [name] : name;
+ } else {
+ // not namespaced
+ if (func[i] === 'K' || (first && func[i] === 'L')) i++; // ignore const and first 'L'
+ var size = parseInt(func.substr(i));
+ if (size) {
+ var pre = size.toString().length;
+ name = func.substr(i + pre, size);
+ i += pre + size;
+ }
+ }
+ first = false;
+ if (func[i] === 'I') {
+ i++;
+ var iList = parse(true);
+ var iRet = parse(true, 1, true);
+ ret += iRet[0] + ' ' + name + '<' + iList.join(', ') + '>';
+ } else {
+ ret = name;
+ }
+ paramLoop: while (i < func.length && limit-- > 0) {
+ //dump('paramLoop');
+ var c = func[i++];
+ if (c in basicTypes) {
+ list.push(basicTypes[c]);
+ } else {
+ switch (c) {
+ case 'P': list.push(parse(true, 1, true)[0] + '*'); break; // pointer
+ case 'R': list.push(parse(true, 1, true)[0] + '&'); break; // reference
+ case 'L': { // literal
+ i++; // skip basic type
+ var end = func.indexOf('E', i);
+ var size = end - i;
+ list.push(func.substr(i, size));
+ i += size + 2; // size + 'EE'
+ break;
+ }
+ case 'A': { // array
+ var size = parseInt(func.substr(i));
+ i += size.toString().length;
+ if (func[i] !== '_') throw '?';
+ i++; // skip _
+ list.push(parse(true, 1, true)[0] + ' [' + size + ']');
+ break;
+ }
+ case 'E': break paramLoop;
+ default: ret += '?' + c; break paramLoop;
+ }
+ }
+ }
+ if (!allowVoid && list.length === 1 && list[0] === 'void') list = []; // avoid (void)
+ if (rawList) {
+ if (ret) {
+ list.push(ret + '?');
+ }
+ return list;
+ } else {
+ return ret + flushList();
+ }
+ }
+ try {
+ // Special-case the entry point, since its name differs from other name mangling.
+ if (func == 'Object._main' || func == '_main') {
+ return 'main()';
+ }
+ if (typeof func === 'number') func = Pointer_stringify(func);
+ if (func[0] !== '_') return func;
+ if (func[1] !== '_') return func; // C function
+ if (func[2] !== 'Z') return func;
+ switch (func[3]) {
+ case 'n': return 'operator new()';
+ case 'd': return 'operator delete()';
+ }
+ return parse();
+ } catch(e) {
+ return func;
+ }
+}
+
+function demangleAll(text) {
+ return text.replace(/__Z[\w\d_]+/g, function(x) { var y = demangle(x); return x === y ? x : (x + ' [' + y + ']') });
+}
+
+function stackTrace() {
+ var stack = new Error().stack;
+ return stack ? demangleAll(stack) : '(no stack trace available)'; // Stack trace is not available at least on IE10 and Safari 6.
+}
+
+// Memory management
+
+var PAGE_SIZE = 4096;
+function alignMemoryPage(x) {
+ return (x+4095)&-4096;
+}
+
+var HEAP;
+var HEAP8, HEAPU8, HEAP16, HEAPU16, HEAP32, HEAPU32, HEAPF32, HEAPF64;
+
+var STATIC_BASE = 0, STATICTOP = 0, staticSealed = false; // static area
+var STACK_BASE = 0, STACKTOP = 0, STACK_MAX = 0; // stack area
+var DYNAMIC_BASE = 0, DYNAMICTOP = 0; // dynamic area handled by sbrk
+
+function enlargeMemory() {
+ abort('Cannot enlarge memory arrays. Either (1) compile with -s TOTAL_MEMORY=X with X higher than the current value ' + TOTAL_MEMORY + ', (2) compile with ALLOW_MEMORY_GROWTH which adjusts the size at runtime but prevents some optimizations, or (3) set Module.TOTAL_MEMORY before the program runs.');
+}
+
+var TOTAL_STACK = Module['TOTAL_STACK'] || 5242880;
+var TOTAL_MEMORY = Module['TOTAL_MEMORY'] || 134217728;
+var FAST_MEMORY = Module['FAST_MEMORY'] || 2097152;
+
+var totalMemory = 4096;
+while (totalMemory < TOTAL_MEMORY || totalMemory < 2*TOTAL_STACK) {
+ if (totalMemory < 16*1024*1024) {
+ totalMemory *= 2;
+ } else {
+ totalMemory += 16*1024*1024
+ }
+}
+if (totalMemory !== TOTAL_MEMORY) {
+ Module.printErr('increasing TOTAL_MEMORY to ' + totalMemory + ' to be more reasonable');
+ TOTAL_MEMORY = totalMemory;
+}
+
+// Initialize the runtime's memory
+// check for full engine support (use string 'subarray' to avoid closure compiler confusion)
+assert(typeof Int32Array !== 'undefined' && typeof Float64Array !== 'undefined' && !!(new Int32Array(1)['subarray']) && !!(new Int32Array(1)['set']),
+ 'JS engine does not provide full typed array support');
+
+var buffer = new ArrayBuffer(TOTAL_MEMORY);
+HEAP8 = new Int8Array(buffer);
+HEAP16 = new Int16Array(buffer);
+HEAP32 = new Int32Array(buffer);
+HEAPU8 = new Uint8Array(buffer);
+HEAPU16 = new Uint16Array(buffer);
+HEAPU32 = new Uint32Array(buffer);
+HEAPF32 = new Float32Array(buffer);
+HEAPF64 = new Float64Array(buffer);
+
+// Endianness check (note: assumes compiler arch was little-endian)
+HEAP32[0] = 255;
+assert(HEAPU8[0] === 255 && HEAPU8[3] === 0, 'Typed arrays 2 must be run on a little-endian system');
+
+Module['HEAP'] = HEAP;
+Module['HEAP8'] = HEAP8;
+Module['HEAP16'] = HEAP16;
+Module['HEAP32'] = HEAP32;
+Module['HEAPU8'] = HEAPU8;
+Module['HEAPU16'] = HEAPU16;
+Module['HEAPU32'] = HEAPU32;
+Module['HEAPF32'] = HEAPF32;
+Module['HEAPF64'] = HEAPF64;
+
+function callRuntimeCallbacks(callbacks) {
+ while(callbacks.length > 0) {
+ var callback = callbacks.shift();
+ if (typeof callback == 'function') {
+ callback();
+ continue;
+ }
+ var func = callback.func;
+ if (typeof func === 'number') {
+ if (callback.arg === undefined) {
+ Runtime.dynCall('v', func);
+ } else {
+ Runtime.dynCall('vi', func, [callback.arg]);
+ }
+ } else {
+ func(callback.arg === undefined ? null : callback.arg);
+ }
+ }
+}
+
+var __ATPRERUN__ = []; // functions called before the runtime is initialized
+var __ATINIT__ = []; // functions called during startup
+var __ATMAIN__ = []; // functions called when main() is to be run
+var __ATEXIT__ = []; // functions called during shutdown
+var __ATPOSTRUN__ = []; // functions called after the runtime has exited
+
+var runtimeInitialized = false;
+
+function preRun() {
+ // compatibility - merge in anything from Module['preRun'] at this time
+ if (Module['preRun']) {
+ if (typeof Module['preRun'] == 'function') Module['preRun'] = [Module['preRun']];
+ while (Module['preRun'].length) {
+ addOnPreRun(Module['preRun'].shift());
+ }
+ }
+ callRuntimeCallbacks(__ATPRERUN__);
+}
+
+function ensureInitRuntime() {
+ if (runtimeInitialized) return;
+ runtimeInitialized = true;
+ callRuntimeCallbacks(__ATINIT__);
+}
+
+function preMain() {
+ callRuntimeCallbacks(__ATMAIN__);
+}
+
+function exitRuntime() {
+ callRuntimeCallbacks(__ATEXIT__);
+}
+
+function postRun() {
+ // compatibility - merge in anything from Module['postRun'] at this time
+ if (Module['postRun']) {
+ if (typeof Module['postRun'] == 'function') Module['postRun'] = [Module['postRun']];
+ while (Module['postRun'].length) {
+ addOnPostRun(Module['postRun'].shift());
+ }
+ }
+ callRuntimeCallbacks(__ATPOSTRUN__);
+}
+
+function addOnPreRun(cb) {
+ __ATPRERUN__.unshift(cb);
+}
+Module['addOnPreRun'] = Module.addOnPreRun = addOnPreRun;
+
+function addOnInit(cb) {
+ __ATINIT__.unshift(cb);
+}
+Module['addOnInit'] = Module.addOnInit = addOnInit;
+
+function addOnPreMain(cb) {
+ __ATMAIN__.unshift(cb);
+}
+Module['addOnPreMain'] = Module.addOnPreMain = addOnPreMain;
+
+function addOnExit(cb) {
+ __ATEXIT__.unshift(cb);
+}
+Module['addOnExit'] = Module.addOnExit = addOnExit;
+
+function addOnPostRun(cb) {
+ __ATPOSTRUN__.unshift(cb);
+}
+Module['addOnPostRun'] = Module.addOnPostRun = addOnPostRun;
+
+// Tools
+
+// This processes a JS string into a C-line array of numbers, 0-terminated.
+// For LLVM-originating strings, see parser.js:parseLLVMString function
+function intArrayFromString(stringy, dontAddNull, length /* optional */) {
+ var ret = (new Runtime.UTF8Processor()).processJSString(stringy);
+ if (length) {
+ ret.length = length;
+ }
+ if (!dontAddNull) {
+ ret.push(0);
+ }
+ return ret;
+}
+Module['intArrayFromString'] = intArrayFromString;
+
+function intArrayToString(array) {
+ var ret = [];
+ for (var i = 0; i < array.length; i++) {
+ var chr = array[i];
+ if (chr > 0xFF) {
+ chr &= 0xFF;
+ }
+ ret.push(String.fromCharCode(chr));
+ }
+ return ret.join('');
+}
+Module['intArrayToString'] = intArrayToString;
+
+// Write a Javascript array to somewhere in the heap
+function writeStringToMemory(string, buffer, dontAddNull) {
+ var array = intArrayFromString(string, dontAddNull);
+ var i = 0;
+ while (i < array.length) {
+ var chr = array[i];
+ HEAP8[(((buffer)+(i))|0)]=chr;
+ i = i + 1;
+ }
+}
+Module['writeStringToMemory'] = writeStringToMemory;
+
+function writeArrayToMemory(array, buffer) {
+ for (var i = 0; i < array.length; i++) {
+ HEAP8[(((buffer)+(i))|0)]=array[i];
+ }
+}
+Module['writeArrayToMemory'] = writeArrayToMemory;
+
+function writeAsciiToMemory(str, buffer, dontAddNull) {
+ for (var i = 0; i < str.length; i++) {
+ HEAP8[(((buffer)+(i))|0)]=str.charCodeAt(i);
+ }
+ if (!dontAddNull) HEAP8[(((buffer)+(str.length))|0)]=0;
+}
+Module['writeAsciiToMemory'] = writeAsciiToMemory;
+
+function unSign(value, bits, ignore) {
+ if (value >= 0) {
+ return value;
+ }
+ return bits <= 32 ? 2*Math.abs(1 << (bits-1)) + value // Need some trickery, since if bits == 32, we are right at the limit of the bits JS uses in bitshifts
+ : Math.pow(2, bits) + value;
+}
+function reSign(value, bits, ignore) {
+ if (value <= 0) {
+ return value;
+ }
+ var half = bits <= 32 ? Math.abs(1 << (bits-1)) // abs is needed if bits == 32
+ : Math.pow(2, bits-1);
+ if (value >= half && (bits <= 32 || value > half)) { // for huge values, we can hit the precision limit and always get true here. so don't do that
+ // but, in general there is no perfect solution here. With 64-bit ints, we get rounding and errors
+ // TODO: In i64 mode 1, resign the two parts separately and safely
+ value = -2*half + value; // Cannot bitshift half, as it may be at the limit of the bits JS uses in bitshifts
+ }
+ return value;
+}
+
+// check for imul support, and also for correctness ( https://bugs.webkit.org/show_bug.cgi?id=126345 )
+if (!Math['imul'] || Math['imul'](0xffffffff, 5) !== -5) Math['imul'] = function imul(a, b) {
+ var ah = a >>> 16;
+ var al = a & 0xffff;
+ var bh = b >>> 16;
+ var bl = b & 0xffff;
+ return (al*bl + ((ah*bl + al*bh) << 16))|0;
+};
+Math.imul = Math['imul'];
+
+
+var Math_abs = Math.abs;
+var Math_cos = Math.cos;
+var Math_sin = Math.sin;
+var Math_tan = Math.tan;
+var Math_acos = Math.acos;
+var Math_asin = Math.asin;
+var Math_atan = Math.atan;
+var Math_atan2 = Math.atan2;
+var Math_exp = Math.exp;
+var Math_log = Math.log;
+var Math_sqrt = Math.sqrt;
+var Math_ceil = Math.ceil;
+var Math_floor = Math.floor;
+var Math_pow = Math.pow;
+var Math_imul = Math.imul;
+var Math_fround = Math.fround;
+var Math_min = Math.min;
+
+// A counter of dependencies for calling run(). If we need to
+// do asynchronous work before running, increment this and
+// decrement it. Incrementing must happen in a place like
+// PRE_RUN_ADDITIONS (used by emcc to add file preloading).
+// Note that you can add dependencies in preRun, even though
+// it happens right before run - run will be postponed until
+// the dependencies are met.
+var runDependencies = 0;
+var runDependencyWatcher = null;
+var dependenciesFulfilled = null; // overridden to take different actions when all run dependencies are fulfilled
+
+function addRunDependency(id) {
+ runDependencies++;
+ if (Module['monitorRunDependencies']) {
+ Module['monitorRunDependencies'](runDependencies);
+ }
+}
+Module['addRunDependency'] = addRunDependency;
+function removeRunDependency(id) {
+ runDependencies--;
+ if (Module['monitorRunDependencies']) {
+ Module['monitorRunDependencies'](runDependencies);
+ }
+ if (runDependencies == 0) {
+ if (runDependencyWatcher !== null) {
+ clearInterval(runDependencyWatcher);
+ runDependencyWatcher = null;
+ }
+ if (dependenciesFulfilled) {
+ var callback = dependenciesFulfilled;
+ dependenciesFulfilled = null;
+ callback(); // can add another dependenciesFulfilled
+ }
+ }
+}
+Module['removeRunDependency'] = removeRunDependency;
+
+Module["preloadedImages"] = {}; // maps url to image data
+Module["preloadedAudios"] = {}; // maps url to audio data
+
+
+var memoryInitializer = null;
+
+// === Body ===
+
+
+
+
+
+STATIC_BASE = 8;
+
+STATICTOP = STATIC_BASE + Runtime.alignMemory(14963);
+/* global initializers */ __ATINIT__.push();
+
+
+/* memory initializer */ allocate([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,115,105,122,101,115,58,32,37,100,44,37,100,10,0,0,0,100,101,99,111,109,112,114,101,115,115,101,100,83,105,122,101,32,61,61,32,115,105,122,101,0,0,0,0,0,0,0,0,47,116,109,112,47,101,109,115,99,114,105,112,116,101,110,95,116,101,109,112,47,122,108,105,98,46,99,0,0,0,0,0,100,111,105,116,0,0,0,0,115,116,114,99,109,112,40,98,117,102,102,101,114,44,32,98,117,102,102,101,114,51,41,32,61,61,32,48,0,0,0,0,101,114,114,111,114,58,32,37,100,92,110,0,0,0,0,0,111,107,46,0,0,0,0,0,49,46,50,46,53,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,4,0,4,0,8,0,4,0,2,0,0,0,4,0,5,0,16,0,8,0,2,0,0,0,4,0,6,0,32,0,32,0,2,0,0,0,4,0,4,0,16,0,16,0,3,0,0,0,8,0,16,0,32,0,32,0,3,0,0,0,8,0,16,0,128,0,128,0,3,0,0,0,8,0,32,0,128,0,0,1,3,0,0,0,32,0,128,0,2,1,0,4,3,0,0,0,32,0,2,1,2,1,0,16,3,0,0,0,0,1,2,3,4,4,5,5,6,6,6,6,7,7,7,7,8,8,8,8,8,8,8,8,9,9,9,9,9,9,9,9,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,0,0,16,17,18,18,19,19,20,20,20,20,21,21,21,21,22,22,22,22,22,22,22,22,23,23,23,23,23,23,23,23,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,0,1,2,3,4,5,6,7,8,8,9,9,10,10,11,11,12,12,12,12,13,13,13,13,14,14,14,14,15,15,15,15,16,16,16,16,16,16,16,16,17,17,17,17,17,17,17,17,18,18,18,18,18,18,18,18,19,19,19,19,19,19,19,19,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,21,21,21,21,21,21,21,21,21,21,21,21,21,21,21,21,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,26,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,28,112,4,0,0,104,9,0,0,1,1,0,0,30,1,0,0,15,0,0,0,0,0,0,0,240,8,0,0,88,10,0,0,0,0,0,0,30,0,0,0,15,0,0,0,0,0,0,0,0,0,0,0,96,11,0,0,0,0,0,0,19,0,0,0,7,0,0,0,0,0,0,0,12,0,8,0,140,0,8,0,76,0,8,0,204,0,8,0,44,0,8,0,172,0,8,0,108,0,8,0,236,0,8,0,28,0,8,0,156,0,8,0,92,0,8,0,220,0,8,0,60,0,8,0,188,0,8,0,124,0,8,0,252,0,8,0,2,0,8,0,130,0,8,0,66,0,8,0,194,0,8,0,34,0,8,0,162,0,8,0,98,0,8,0,226,0,8,0,18,0,8,0,146,0,8,0,82,0,8,0,210,0,8,0,50,0,8,0,178,0,8,0,114,0,8,0,242,0,8,0,10,0,8,0,138,0,8,0,74,0,8,0,202,0,8,0,42,0,8,0,170,0,8,0,106,0,8,0,234,0,8,0,26,0,8,0,154,0,8,0,90,0,8,0,218,0,8,0,58,0,8,0,186,0,8,0,122,0,8,0,250,0,8,0,6,0,8,0,134,0,8,0,70,0,8,0,198,0,8,0,38,0,8,0,166,0,8,0,102,0,8,0,230,0,8,0,22,0,8,0,150,0,8,0,86,0,8,0,214,0,8,0,54,0,8,0,182,0,8,0,118,0,8,0,246,0,8,0,14,0,8,0,142,0,8,0,78,0,8,0,206,0,8,0,46,0,8,0,174,0,8,0,110,0,8,0,238,0,8,0,30,0,8,0,158,0,8,0,94,0,8,0,222,0,8,0,62,0,8,0,190,0,8,0,126,0,8,0,254,0,8,0,1,0,8,0,129,0,8,0,65,0,8,0,193,0,8,0,33,0,8,0,161,0,8,0,97,0,8,0,225,0,8,0,17,0,8,0,145,0,8,0,81,0,8,0,209,0,8,0,49,0,8,0,177,0,8,0,113,0,8,0,241,0,8,0,9,0,8,0,137,0,8,0,73,0,8,0,201,0,8,0,41,0,8,0,169,0,8,0,105,0,8,0,233,0,8,0,25,0,8,0,153,0,8,0,89,0,8,0,217,0,8,0,57,0,8,0,185,0,8,0,121,0,8,0,249,0,8,0,5,0,8,0,133,0,8,0,69,0,8,0,197,0,8,0,37,0,8,0,165,0,8,0,101,0,8,0,229,0,8,0,21,0,8,0,149,0,8,0,85,0,8,0,213,0,8,0,53,0,8,0,181,0,8,0,117,0,8,0,245,0,8,0,13,0,8,0,141,0,8,0,77,0,8,0,205,0,8,0,45,0,8,0,173,0,8,0,109,0,8,0,237,0,8,0,29,0,8,0,157,0,8,0,93,0,8,0,221,0,8,0,61,0,8,0,189,0,8,0,125,0,8,0,253,0,8,0,19,0,9,0,19,1,9,0,147,0,9,0,147,1,9,0,83,0,9,0,83,1,9,0,211,0,9,0,211,1,9,0,51,0,9,0,51,1,9,0,179,0,9,0,179,1,9,0,115,0,9,0,115,1,9,0,243,0,9,0,243,1,9,0,11,0,9,0,11,1,9,0,139,0,9,0,139,1,9,0,75,0,9,0,75,1,9,0,203,0,9,0,203,1,9,0,43,0,9,0,43,1,9,0,171,0,9,0,171,1,9,0,107,0,9,0,107,1,9,0,235,0,9,0,235,1,9,0,27,0,9,0,27,1,9,0,155,0,9,0,155,1,9,0,91,0,9,0,91,1,9,0,219,0,9,0,219,1,9,0,59,0,9,0,59,1,9,0,187,0,9,0,187,1,9,0,123,0,9,0,123,1,9,0,251,0,9,0,251,1,9,0,7,0,9,0,7,1,9,0,135,0,9,0,135,1,9,0,71,0,9,0,71,1,9,0,199,0,9,0,199,1,9,0,39,0,9,0,39,1,9,0,167,0,9,0,167,1,9,0,103,0,9,0,103,1,9,0,231,0,9,0,231,1,9,0,23,0,9,0,23,1,9,0,151,0,9,0,151,1,9,0,87,0,9,0,87,1,9,0,215,0,9,0,215,1,9,0,55,0,9,0,55,1,9,0,183,0,9,0,183,1,9,0,119,0,9,0,119,1,9,0,247,0,9,0,247,1,9,0,15,0,9,0,15,1,9,0,143,0,9,0,143,1,9,0,79,0,9,0,79,1,9,0,207,0,9,0,207,1,9,0,47,0,9,0,47,1,9,0,175,0,9,0,175,1,9,0,111,0,9,0,111,1,9,0,239,0,9,0,239,1,9,0,31,0,9,0,31,1,9,0,159,0,9,0,159,1,9,0,95,0,9,0,95,1,9,0,223,0,9,0,223,1,9,0,63,0,9,0,63,1,9,0,191,0,9,0,191,1,9,0,127,0,9,0,127,1,9,0,255,0,9,0,255,1,9,0,0,0,7,0,64,0,7,0,32,0,7,0,96,0,7,0,16,0,7,0,80,0,7,0,48,0,7,0,112,0,7,0,8,0,7,0,72,0,7,0,40,0,7,0,104,0,7,0,24,0,7,0,88,0,7,0,56,0,7,0,120,0,7,0,4,0,7,0,68,0,7,0,36,0,7,0,100,0,7,0,20,0,7,0,84,0,7,0,52,0,7,0,116,0,7,0,3,0,8,0,131,0,8,0,67,0,8,0,195,0,8,0,35,0,8,0,163,0,8,0,99,0,8,0,227,0,8,0,0,0,5,0,16,0,5,0,8,0,5,0,24,0,5,0,4,0,5,0,20,0,5,0,12,0,5,0,28,0,5,0,2,0,5,0,18,0,5,0,10,0,5,0,26,0,5,0,6,0,5,0,22,0,5,0,14,0,5,0,30,0,5,0,1,0,5,0,17,0,5,0,9,0,5,0,25,0,5,0,5,0,5,0,21,0,5,0,13,0,5,0,29,0,5,0,3,0,5,0,19,0,5,0,11,0,5,0,27,0,5,0,7,0,5,0,23,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,2,0,0,0,2,0,0,0,2,0,0,0,2,0,0,0,3,0,0,0,3,0,0,0,3,0,0,0,3,0,0,0,4,0,0,0,4,0,0,0,4,0,0,0,4,0,0,0,5,0,0,0,5,0,0,0,5,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,2,0,0,0,3,0,0,0,4,0,0,0,5,0,0,0,6,0,0,0,7,0,0,0,8,0,0,0,10,0,0,0,12,0,0,0,14,0,0,0,16,0,0,0,20,0,0,0,24,0,0,0,28,0,0,0,32,0,0,0,40,0,0,0,48,0,0,0,56,0,0,0,64,0,0,0,80,0,0,0,96,0,0,0,112,0,0,0,128,0,0,0,160,0,0,0,192,0,0,0,224,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,2,0,0,0,2,0,0,0,3,0,0,0,3,0,0,0,4,0,0,0,4,0,0,0,5,0,0,0,5,0,0,0,6,0,0,0,6,0,0,0,7,0,0,0,7,0,0,0,8,0,0,0,8,0,0,0,9,0,0,0,9,0,0,0,10,0,0,0,10,0,0,0,11,0,0,0,11,0,0,0,12,0,0,0,12,0,0,0,13,0,0,0,13,0,0,0,0,0,0,0,1,0,0,0,2,0,0,0,3,0,0,0,4,0,0,0,6,0,0,0,8,0,0,0,12,0,0,0,16,0,0,0,24,0,0,0,32,0,0,0,48,0,0,0,64,0,0,0,96,0,0,0,128,0,0,0,192,0,0,0,0,1,0,0,128,1,0,0,0,2,0,0,0,3,0,0,0,4,0,0,0,6,0,0,0,8,0,0,0,12,0,0,0,16,0,0,0,24,0,0,0,32,0,0,0,48,0,0,0,64,0,0,0,96,0,0,16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,3,0,0,0,7,0,0,0,0,0,0,0,49,46,50,46,53,0,0,0,110,101,101,100,32,100,105,99,116,105,111,110,97,114,121,0,115,116,114,101,97,109,32,101,110,100,0,0,0,0,0,0,0,0,0,0,0,0,0,0,102,105,108,101,32,101,114,114,111,114,0,0,0,0,0,0,115,116,114,101,97,109,32,101,114,114,111,114,0,0,0,0,100,97,116,97,32,101,114,114,111,114,0,0,0,0,0,0,105,110,115,117,102,102,105,99,105,101,110,116,32,109,101,109,111,114,121,0,0,0,0,0,98,117,102,102,101,114,32,101,114,114,111,114,0,0,0,0,105,110,99,111,109,112,97,116,105,98,108,101,32,118,101,114,115,105,111,110,0,0,0,0,184,11,0,0,200,11,0,0,216,11,0,0,224,11,0,0,240,11,0,0,0,12,0,0,16,12,0,0,40,12,0,0,56,12,0,0,216,11,0,0,0,0,0,0,150,48,7,119,44,97,14,238,186,81,9,153,25,196,109,7,143,244,106,112,53,165,99,233,163,149,100,158,50,136,219,14,164,184,220,121,30,233,213,224,136,217,210,151,43,76,182,9,189,124,177,126,7,45,184,231,145,29,191,144,100,16,183,29,242,32,176,106,72,113,185,243,222,65,190,132,125,212,218,26,235,228,221,109,81,181,212,244,199,133,211,131,86,152,108,19,192,168,107,100,122,249,98,253,236,201,101,138,79,92,1,20,217,108,6,99,99,61,15,250,245,13,8,141,200,32,110,59,94,16,105,76,228,65,96,213,114,113,103,162,209,228,3,60,71,212,4,75,253,133,13,210,107,181,10,165,250,168,181,53,108,152,178,66,214,201,187,219,64,249,188,172,227,108,216,50,117,92,223,69,207,13,214,220,89,61,209,171,172,48,217,38,58,0,222,81,128,81,215,200,22,97,208,191,181,244,180,33,35,196,179,86,153,149,186,207,15,165,189,184,158,184,2,40,8,136,5,95,178,217,12,198,36,233,11,177,135,124,111,47,17,76,104,88,171,29,97,193,61,45,102,182,144,65,220,118,6,113,219,1,188,32,210,152,42,16,213,239,137,133,177,113,31,181,182,6,165,228,191,159,51,212,184,232,162,201,7,120,52,249,0,15,142,168,9,150,24,152,14,225,187,13,106,127,45,61,109,8,151,108,100,145,1,92,99,230,244,81,107,107,98,97,108,28,216,48,101,133,78,0,98,242,237,149,6,108,123,165,1,27,193,244,8,130,87,196,15,245,198,217,176,101,80,233,183,18,234,184,190,139,124,136,185,252,223,29,221,98,73,45,218,21,243,124,211,140,101,76,212,251,88,97,178,77,206,81,181,58,116,0,188,163,226,48,187,212,65,165,223,74,215,149,216,61,109,196,209,164,251,244,214,211,106,233,105,67,252,217,110,52,70,136,103,173,208,184,96,218,115,45,4,68,229,29,3,51,95,76,10,170,201,124,13,221,60,113,5,80,170,65,2,39,16,16,11,190,134,32,12,201,37,181,104,87,179,133,111,32,9,212,102,185,159,228,97,206,14,249,222,94,152,201,217,41,34,152,208,176,180,168,215,199,23,61,179,89,129,13,180,46,59,92,189,183,173,108,186,192,32,131,184,237,182,179,191,154,12,226,182,3,154,210,177,116,57,71,213,234,175,119,210,157,21,38,219,4,131,22,220,115,18,11,99,227,132,59,100,148,62,106,109,13,168,90,106,122,11,207,14,228,157,255,9,147,39,174,0,10,177,158,7,125,68,147,15,240,210,163,8,135,104,242,1,30,254,194,6,105,93,87,98,247,203,103,101,128,113,54,108,25,231,6,107,110,118,27,212,254,224,43,211,137,90,122,218,16,204,74,221,103,111,223,185,249,249,239,190,142,67,190,183,23,213,142,176,96,232,163,214,214,126,147,209,161,196,194,216,56,82,242,223,79,241,103,187,209,103,87,188,166,221,6,181,63,75,54,178,72,218,43,13,216,76,27,10,175,246,74,3,54,96,122,4,65,195,239,96,223,85,223,103,168,239,142,110,49,121,190,105,70,140,179,97,203,26,131,102,188,160,210,111,37,54,226,104,82,149,119,12,204,3,71,11,187,185,22,2,34,47,38,5,85,190,59,186,197,40,11,189,178,146,90,180,43,4,106,179,92,167,255,215,194,49,207,208,181,139,158,217,44,29,174,222,91,176,194,100,155,38,242,99,236,156,163,106,117,10,147,109,2,169,6,9,156,63,54,14,235,133,103,7,114,19,87,0,5,130,74,191,149,20,122,184,226,174,43,177,123,56,27,182,12,155,142,210,146,13,190,213,229,183,239,220,124,33,223,219,11,212,210,211,134,66,226,212,241,248,179,221,104,110,131,218,31,205,22,190,129,91,38,185,246,225,119,176,111,119,71,183,24,230,90,8,136,112,106,15,255,202,59,6,102,92,11,1,17,255,158,101,143,105,174,98,248,211,255,107,97,69,207,108,22,120,226,10,160,238,210,13,215,84,131,4,78,194,179,3,57,97,38,103,167,247,22,96,208,77,71,105,73,219,119,110,62,74,106,209,174,220,90,214,217,102,11,223,64,240,59,216,55,83,174,188,169,197,158,187,222,127,207,178,71,233,255,181,48,28,242,189,189,138,194,186,202,48,147,179,83,166,163,180,36,5,54,208,186,147,6,215,205,41,87,222,84,191,103,217,35,46,122,102,179,184,74,97,196,2,27,104,93,148,43,111,42,55,190,11,180,161,142,12,195,27,223,5,90,141,239,2,45,0,0,0,0,65,49,27,25,130,98,54,50,195,83,45,43,4,197,108,100,69,244,119,125,134,167,90,86,199,150,65,79,8,138,217,200,73,187,194,209,138,232,239,250,203,217,244,227,12,79,181,172,77,126,174,181,142,45,131,158,207,28,152,135,81,18,194,74,16,35,217,83,211,112,244,120,146,65,239,97,85,215,174,46,20,230,181,55,215,181,152,28,150,132,131,5,89,152,27,130,24,169,0,155,219,250,45,176,154,203,54,169,93,93,119,230,28,108,108,255,223,63,65,212,158,14,90,205,162,36,132,149,227,21,159,140,32,70,178,167,97,119,169,190,166,225,232,241,231,208,243,232,36,131,222,195,101,178,197,218,170,174,93,93,235,159,70,68,40,204,107,111,105,253,112,118,174,107,49,57,239,90,42,32,44,9,7,11,109,56,28,18,243,54,70,223,178,7,93,198,113,84,112,237,48,101,107,244,247,243,42,187,182,194,49,162,117,145,28,137,52,160,7,144,251,188,159,23,186,141,132,14,121,222,169,37,56,239,178,60,255,121,243,115,190,72,232,106,125,27,197,65,60,42,222,88,5,79,121,240,68,126,98,233,135,45,79,194,198,28,84,219,1,138,21,148,64,187,14,141,131,232,35,166,194,217,56,191,13,197,160,56,76,244,187,33,143,167,150,10,206,150,141,19,9,0,204,92,72,49,215,69,139,98,250,110,202,83,225,119,84,93,187,186,21,108,160,163,214,63,141,136,151,14,150,145,80,152,215,222,17,169,204,199,210,250,225,236,147,203,250,245,92,215,98,114,29,230,121,107,222,181,84,64,159,132,79,89,88,18,14,22,25,35,21,15,218,112,56,36,155,65,35,61,167,107,253,101,230,90,230,124,37,9,203,87,100,56,208,78,163,174,145,1,226,159,138,24,33,204,167,51,96,253,188,42,175,225,36,173,238,208,63,180,45,131,18,159,108,178,9,134,171,36,72,201,234,21,83,208,41,70,126,251,104,119,101,226,246,121,63,47,183,72,36,54,116,27,9,29,53,42,18,4,242,188,83,75,179,141,72,82,112,222,101,121,49,239,126,96,254,243,230,231,191,194,253,254,124,145,208,213,61,160,203,204,250,54,138,131,187,7,145,154,120,84,188,177,57,101,167,168,75,152,131,59,10,169,152,34,201,250,181,9,136,203,174,16,79,93,239,95,14,108,244,70,205,63,217,109,140,14,194,116,67,18,90,243,2,35,65,234,193,112,108,193,128,65,119,216,71,215,54,151,6,230,45,142,197,181,0,165,132,132,27,188,26,138,65,113,91,187,90,104,152,232,119,67,217,217,108,90,30,79,45,21,95,126,54,12,156,45,27,39,221,28,0,62,18,0,152,185,83,49,131,160,144,98,174,139,209,83,181,146,22,197,244,221,87,244,239,196,148,167,194,239,213,150,217,246,233,188,7,174,168,141,28,183,107,222,49,156,42,239,42,133,237,121,107,202,172,72,112,211,111,27,93,248,46,42,70,225,225,54,222,102,160,7,197,127,99,84,232,84,34,101,243,77,229,243,178,2,164,194,169,27,103,145,132,48,38,160,159,41,184,174,197,228,249,159,222,253,58,204,243,214,123,253,232,207,188,107,169,128,253,90,178,153,62,9,159,178,127,56,132,171,176,36,28,44,241,21,7,53,50,70,42,30,115,119,49,7,180,225,112,72,245,208,107,81,54,131,70,122,119,178,93,99,78,215,250,203,15,230,225,210,204,181,204,249,141,132,215,224,74,18,150,175,11,35,141,182,200,112,160,157,137,65,187,132,70,93,35,3,7,108,56,26,196,63,21,49,133,14,14,40,66,152,79,103,3,169,84,126,192,250,121,85,129,203,98,76,31,197,56,129,94,244,35,152,157,167,14,179,220,150,21,170,27,0,84,229,90,49,79,252,153,98,98,215,216,83,121,206,23,79,225,73,86,126,250,80,149,45,215,123,212,28,204,98,19,138,141,45,82,187,150,52,145,232,187,31,208,217,160,6,236,243,126,94,173,194,101,71,110,145,72,108,47,160,83,117,232,54,18,58,169,7,9,35,106,84,36,8,43,101,63,17,228,121,167,150,165,72,188,143,102,27,145,164,39,42,138,189,224,188,203,242,161,141,208,235,98,222,253,192,35,239,230,217,189,225,188,20,252,208,167,13,63,131,138,38,126,178,145,63,185,36,208,112,248,21,203,105,59,70,230,66,122,119,253,91,181,107,101,220,244,90,126,197,55,9,83,238,118,56,72,247,177,174,9,184,240,159,18,161,51,204,63,138,114,253,36,147,0,0,0,0,55,106,194,1,110,212,132,3,89,190,70,2,220,168,9,7,235,194,203,6,178,124,141,4,133,22,79,5,184,81,19,14,143,59,209,15,214,133,151,13,225,239,85,12,100,249,26,9,83,147,216,8,10,45,158,10,61,71,92,11,112,163,38,28,71,201,228,29,30,119,162,31,41,29,96,30,172,11,47,27,155,97,237,26,194,223,171,24,245,181,105,25,200,242,53,18,255,152,247,19,166,38,177,17,145,76,115,16,20,90,60,21,35,48,254,20,122,142,184,22,77,228,122,23,224,70,77,56,215,44,143,57,142,146,201,59,185,248,11,58,60,238,68,63,11,132,134,62,82,58,192,60,101,80,2,61,88,23,94,54,111,125,156,55,54,195,218,53,1,169,24,52,132,191,87,49,179,213,149,48,234,107,211,50,221,1,17,51,144,229,107,36,167,143,169,37,254,49,239,39,201,91,45,38,76,77,98,35,123,39,160,34,34,153,230,32,21,243,36,33,40,180,120,42,31,222,186,43,70,96,252,41,113,10,62,40,244,28,113,45,195,118,179,44,154,200,245,46,173,162,55,47,192,141,154,112,247,231,88,113,174,89,30,115,153,51,220,114,28,37,147,119,43,79,81,118,114,241,23,116,69,155,213,117,120,220,137,126,79,182,75,127,22,8,13,125,33,98,207,124,164,116,128,121,147,30,66,120,202,160,4,122,253,202,198,123,176,46,188,108,135,68,126,109,222,250,56,111,233,144,250,110,108,134,181,107,91,236,119,106,2,82,49,104,53,56,243,105,8,127,175,98,63,21,109,99,102,171,43,97,81,193,233,96,212,215,166,101,227,189,100,100,186,3,34,102,141,105,224,103,32,203,215,72,23,161,21,73,78,31,83,75,121,117,145,74,252,99,222,79,203,9,28,78,146,183,90,76,165,221,152,77,152,154,196,70,175,240,6,71,246,78,64,69,193,36,130,68,68,50,205,65,115,88,15,64,42,230,73,66,29,140,139,67,80,104,241,84,103,2,51,85,62,188,117,87,9,214,183,86,140,192,248,83,187,170,58,82,226,20,124,80,213,126,190,81,232,57,226,90,223,83,32,91,134,237,102,89,177,135,164,88,52,145,235,93,3,251,41,92,90,69,111,94,109,47,173,95,128,27,53,225,183,113,247,224,238,207,177,226,217,165,115,227,92,179,60,230,107,217,254,231,50,103,184,229,5,13,122,228,56,74,38,239,15,32,228,238,86,158,162,236,97,244,96,237,228,226,47,232,211,136,237,233,138,54,171,235,189,92,105,234,240,184,19,253,199,210,209,252,158,108,151,254,169,6,85,255,44,16,26,250,27,122,216,251,66,196,158,249,117,174,92,248,72,233,0,243,127,131,194,242,38,61,132,240,17,87,70,241,148,65,9,244,163,43,203,245,250,149,141,247,205,255,79,246,96,93,120,217,87,55,186,216,14,137,252,218,57,227,62,219,188,245,113,222,139,159,179,223,210,33,245,221,229,75,55,220,216,12,107,215,239,102,169,214,182,216,239,212,129,178,45,213,4,164,98,208,51,206,160,209,106,112,230,211,93,26,36,210,16,254,94,197,39,148,156,196,126,42,218,198,73,64,24,199,204,86,87,194,251,60,149,195,162,130,211,193,149,232,17,192,168,175,77,203,159,197,143,202,198,123,201,200,241,17,11,201,116,7,68,204,67,109,134,205,26,211,192,207,45,185,2,206,64,150,175,145,119,252,109,144,46,66,43,146,25,40,233,147,156,62,166,150,171,84,100,151,242,234,34,149,197,128,224,148,248,199,188,159,207,173,126,158,150,19,56,156,161,121,250,157,36,111,181,152,19,5,119,153,74,187,49,155,125,209,243,154,48,53,137,141,7,95,75,140,94,225,13,142,105,139,207,143,236,157,128,138,219,247,66,139,130,73,4,137,181,35,198,136,136,100,154,131,191,14,88,130,230,176,30,128,209,218,220,129,84,204,147,132,99,166,81,133,58,24,23,135,13,114,213,134,160,208,226,169,151,186,32,168,206,4,102,170,249,110,164,171,124,120,235,174,75,18,41,175,18,172,111,173,37,198,173,172,24,129,241,167,47,235,51,166,118,85,117,164,65,63,183,165,196,41,248,160,243,67,58,161,170,253,124,163,157,151,190,162,208,115,196,181,231,25,6,180,190,167,64,182,137,205,130,183,12,219,205,178,59,177,15,179,98,15,73,177,85,101,139,176,104,34,215,187,95,72,21,186,6,246,83,184,49,156,145,185,180,138,222,188,131,224,28,189,218,94,90,191,237,52,152,190,0,0,0,0,101,103,188,184,139,200,9,170,238,175,181,18,87,151,98,143,50,240,222,55,220,95,107,37,185,56,215,157,239,40,180,197,138,79,8,125,100,224,189,111,1,135,1,215,184,191,214,74,221,216,106,242,51,119,223,224,86,16,99,88,159,87,25,80,250,48,165,232,20,159,16,250,113,248,172,66,200,192,123,223,173,167,199,103,67,8,114,117,38,111,206,205,112,127,173,149,21,24,17,45,251,183,164,63,158,208,24,135,39,232,207,26,66,143,115,162,172,32,198,176,201,71,122,8,62,175,50,160,91,200,142,24,181,103,59,10,208,0,135,178,105,56,80,47,12,95,236,151,226,240,89,133,135,151,229,61,209,135,134,101,180,224,58,221,90,79,143,207,63,40,51,119,134,16,228,234,227,119,88,82,13,216,237,64,104,191,81,248,161,248,43,240,196,159,151,72,42,48,34,90,79,87,158,226,246,111,73,127,147,8,245,199,125,167,64,213,24,192,252,109,78,208,159,53,43,183,35,141,197,24,150,159,160,127,42,39,25,71,253,186,124,32,65,2,146,143,244,16,247,232,72,168,61,88,20,155,88,63,168,35,182,144,29,49,211,247,161,137,106,207,118,20,15,168,202,172,225,7,127,190,132,96,195,6,210,112,160,94,183,23,28,230,89,184,169,244,60,223,21,76,133,231,194,209,224,128,126,105,14,47,203,123,107,72,119,195,162,15,13,203,199,104,177,115,41,199,4,97,76,160,184,217,245,152,111,68,144,255,211,252,126,80,102,238,27,55,218,86,77,39,185,14,40,64,5,182,198,239,176,164,163,136,12,28,26,176,219,129,127,215,103,57,145,120,210,43,244,31,110,147,3,247,38,59,102,144,154,131,136,63,47,145,237,88,147,41,84,96,68,180,49,7,248,12,223,168,77,30,186,207,241,166,236,223,146,254,137,184,46,70,103,23,155,84,2,112,39,236,187,72,240,113,222,47,76,201,48,128,249,219,85,231,69,99,156,160,63,107,249,199,131,211,23,104,54,193,114,15,138,121,203,55,93,228,174,80,225,92,64,255,84,78,37,152,232,246,115,136,139,174,22,239,55,22,248,64,130,4,157,39,62,188,36,31,233,33,65,120,85,153,175,215,224,139,202,176,92,51,59,182,89,237,94,209,229,85,176,126,80,71,213,25,236,255,108,33,59,98,9,70,135,218,231,233,50,200,130,142,142,112,212,158,237,40,177,249,81,144,95,86,228,130,58,49,88,58,131,9,143,167,230,110,51,31,8,193,134,13,109,166,58,181,164,225,64,189,193,134,252,5,47,41,73,23,74,78,245,175,243,118,34,50,150,17,158,138,120,190,43,152,29,217,151,32,75,201,244,120,46,174,72,192,192,1,253,210,165,102,65,106,28,94,150,247,121,57,42,79,151,150,159,93,242,241,35,229,5,25,107,77,96,126,215,245,142,209,98,231,235,182,222,95,82,142,9,194,55,233,181,122,217,70,0,104,188,33,188,208,234,49,223,136,143,86,99,48,97,249,214,34,4,158,106,154,189,166,189,7,216,193,1,191,54,110,180,173,83,9,8,21,154,78,114,29,255,41,206,165,17,134,123,183,116,225,199,15,205,217,16,146,168,190,172,42,70,17,25,56,35,118,165,128,117,102,198,216,16,1,122,96,254,174,207,114,155,201,115,202,34,241,164,87,71,150,24,239,169,57,173,253,204,94,17,69,6,238,77,118,99,137,241,206,141,38,68,220,232,65,248,100,81,121,47,249,52,30,147,65,218,177,38,83,191,214,154,235,233,198,249,179,140,161,69,11,98,14,240,25,7,105,76,161,190,81,155,60,219,54,39,132,53,153,146,150,80,254,46,46,153,185,84,38,252,222,232,158,18,113,93,140,119,22,225,52,206,46,54,169,171,73,138,17,69,230,63,3,32,129,131,187,118,145,224,227,19,246,92,91,253,89,233,73,152,62,85,241,33,6,130,108,68,97,62,212,170,206,139,198,207,169,55,126,56,65,127,214,93,38,195,110,179,137,118,124,214,238,202,196,111,214,29,89,10,177,161,225,228,30,20,243,129,121,168,75,215,105,203,19,178,14,119,171,92,161,194,185,57,198,126,1,128,254,169,156,229,153,21,36,11,54,160,54,110,81,28,142,167,22,102,134,194,113,218,62,44,222,111,44,73,185,211,148,240,129,4,9,149,230,184,177,123,73,13,163,30,46,177,27,72,62,210,67,45,89,110,251,195,246,219,233,166,145,103,81,31,169,176,204,122,206,12,116,148,97,185,102,241,6,5,222,0,0,0,0,119,7,48,150,238,14,97,44,153,9,81,186,7,109,196,25,112,106,244,143,233,99,165,53,158,100,149,163,14,219,136,50,121,220,184,164,224,213,233,30,151,210,217,136,9,182,76,43,126,177,124,189,231,184,45,7,144,191,29,145,29,183,16,100,106,176,32,242,243,185,113,72,132,190,65,222,26,218,212,125,109,221,228,235,244,212,181,81,131,211,133,199,19,108,152,86,100,107,168,192,253,98,249,122,138,101,201,236,20,1,92,79,99,6,108,217,250,15,61,99,141,8,13,245,59,110,32,200,76,105,16,94,213,96,65,228,162,103,113,114,60,3,228,209,75,4,212,71,210,13,133,253,165,10,181,107,53,181,168,250,66,178,152,108,219,187,201,214,172,188,249,64,50,216,108,227,69,223,92,117,220,214,13,207,171,209,61,89,38,217,48,172,81,222,0,58,200,215,81,128,191,208,97,22,33,180,244,181,86,179,196,35,207,186,149,153,184,189,165,15,40,2,184,158,95,5,136,8,198,12,217,178,177,11,233,36,47,111,124,135,88,104,76,17,193,97,29,171,182,102,45,61,118,220,65,144,1,219,113,6,152,210,32,188,239,213,16,42,113,177,133,137,6,182,181,31,159,191,228,165,232,184,212,51,120,7,201,162,15,0,249,52,150,9,168,142,225,14,152,24,127,106,13,187,8,109,61,45,145,100,108,151,230,99,92,1,107,107,81,244,28,108,97,98,133,101,48,216,242,98,0,78,108,6,149,237,27,1,165,123,130,8,244,193,245,15,196,87,101,176,217,198,18,183,233,80,139,190,184,234,252,185,136,124,98,221,29,223,21,218,45,73,140,211,124,243,251,212,76,101,77,178,97,88,58,181,81,206,163,188,0,116,212,187,48,226,74,223,165,65,61,216,149,215,164,209,196,109,211,214,244,251,67,105,233,106,52,110,217,252,173,103,136,70,218,96,184,208,68,4,45,115,51,3,29,229,170,10,76,95,221,13,124,201,80,5,113,60,39,2,65,170,190,11,16,16,201,12,32,134,87,104,181,37,32,111,133,179,185,102,212,9,206,97,228,159,94,222,249,14,41,217,201,152,176,208,152,34,199,215,168,180,89,179,61,23,46,180,13,129,183,189,92,59,192,186,108,173,237,184,131,32,154,191,179,182,3,182,226,12,116,177,210,154,234,213,71,57,157,210,119,175,4,219,38,21,115,220,22,131,227,99,11,18,148,100,59,132,13,109,106,62,122,106,90,168,228,14,207,11,147,9,255,157,10,0,174,39,125,7,158,177,240,15,147,68,135,8,163,210,30,1,242,104,105,6,194,254,247,98,87,93,128,101,103,203,25,108,54,113,110,107,6,231,254,212,27,118,137,211,43,224,16,218,122,90,103,221,74,204,249,185,223,111,142,190,239,249,23,183,190,67,96,176,142,213,214,214,163,232,161,209,147,126,56,216,194,196,79,223,242,82,209,187,103,241,166,188,87,103,63,181,6,221,72,178,54,75,216,13,43,218,175,10,27,76,54,3,74,246,65,4,122,96,223,96,239,195,168,103,223,85,49,110,142,239,70,105,190,121,203,97,179,140,188,102,131,26,37,111,210,160,82,104,226,54,204,12,119,149,187,11,71,3,34,2,22,185,85,5,38,47,197,186,59,190,178,189,11,40,43,180,90,146,92,179,106,4,194,215,255,167,181,208,207,49,44,217,158,139,91,222,174,29,155,100,194,176,236,99,242,38,117,106,163,156,2,109,147,10,156,9,6,169,235,14,54,63,114,7,103,133,5,0,87,19,149,191,74,130,226,184,122,20,123,177,43,174,12,182,27,56,146,210,142,155,229,213,190,13,124,220,239,183,11,219,223,33,134,211,210,212,241,212,226,66,104,221,179,248,31,218,131,110,129,190,22,205,246,185,38,91,111,176,119,225,24,183,71,119,136,8,90,230,255,15,106,112,102,6,59,202,17,1,11,92,143,101,158,255,248,98,174,105,97,107,255,211,22,108,207,69,160,10,226,120,215,13,210,238,78,4,131,84,57,3,179,194,167,103,38,97,208,96,22,247,73,105,71,77,62,110,119,219,174,209,106,74,217,214,90,220,64,223,11,102,55,216,59,240,169,188,174,83,222,187,158,197,71,178,207,127,48,181,255,233,189,189,242,28,202,186,194,138,83,179,147,48,36,180,163,166,186,208,54,5,205,215,6,147,84,222,87,41,35,217,103,191,179,102,122,46,196,97,74,184,93,104,27,2,42,111,43,148,180,11,190,55,195,12,142,161,90,5,223,27,45,2,239,141,0,0,0,0,25,27,49,65,50,54,98,130,43,45,83,195,100,108,197,4,125,119,244,69,86,90,167,134,79,65,150,199,200,217,138,8,209,194,187,73,250,239,232,138,227,244,217,203,172,181,79,12,181,174,126,77,158,131,45,142,135,152,28,207,74,194,18,81,83,217,35,16,120,244,112,211,97,239,65,146,46,174,215,85,55,181,230,20,28,152,181,215,5,131,132,150,130,27,152,89,155,0,169,24,176,45,250,219,169,54,203,154,230,119,93,93,255,108,108,28,212,65,63,223,205,90,14,158,149,132,36,162,140,159,21,227,167,178,70,32,190,169,119,97,241,232,225,166,232,243,208,231,195,222,131,36,218,197,178,101,93,93,174,170,68,70,159,235,111,107,204,40,118,112,253,105,57,49,107,174,32,42,90,239,11,7,9,44,18,28,56,109,223,70,54,243,198,93,7,178,237,112,84,113,244,107,101,48,187,42,243,247,162,49,194,182,137,28,145,117,144,7,160,52,23,159,188,251,14,132,141,186,37,169,222,121,60,178,239,56,115,243,121,255,106,232,72,190,65,197,27,125,88,222,42,60,240,121,79,5,233,98,126,68,194,79,45,135,219,84,28,198,148,21,138,1,141,14,187,64,166,35,232,131,191,56,217,194,56,160,197,13,33,187,244,76,10,150,167,143,19,141,150,206,92,204,0,9,69,215,49,72,110,250,98,139,119,225,83,202,186,187,93,84,163,160,108,21,136,141,63,214,145,150,14,151,222,215,152,80,199,204,169,17,236,225,250,210,245,250,203,147,114,98,215,92,107,121,230,29,64,84,181,222,89,79,132,159,22,14,18,88,15,21,35,25,36,56,112,218,61,35,65,155,101,253,107,167,124,230,90,230,87,203,9,37,78,208,56,100,1,145,174,163,24,138,159,226,51,167,204,33,42,188,253,96,173,36,225,175,180,63,208,238,159,18,131,45,134,9,178,108,201,72,36,171,208,83,21,234,251,126,70,41,226,101,119,104,47,63,121,246,54,36,72,183,29,9,27,116,4,18,42,53,75,83,188,242,82,72,141,179,121,101,222,112,96,126,239,49,231,230,243,254,254,253,194,191,213,208,145,124,204,203,160,61,131,138,54,250,154,145,7,187,177,188,84,120,168,167,101,57,59,131,152,75,34,152,169,10,9,181,250,201,16,174,203,136,95,239,93,79,70,244,108,14,109,217,63,205,116,194,14,140,243,90,18,67,234,65,35,2,193,108,112,193,216,119,65,128,151,54,215,71,142,45,230,6,165,0,181,197,188,27,132,132,113,65,138,26,104,90,187,91,67,119,232,152,90,108,217,217,21,45,79,30,12,54,126,95,39,27,45,156,62,0,28,221,185,152,0,18,160,131,49,83,139,174,98,144,146,181,83,209,221,244,197,22,196,239,244,87,239,194,167,148,246,217,150,213,174,7,188,233,183,28,141,168,156,49,222,107,133,42,239,42,202,107,121,237,211,112,72,172,248,93,27,111,225,70,42,46,102,222,54,225,127,197,7,160,84,232,84,99,77,243,101,34,2,178,243,229,27,169,194,164,48,132,145,103,41,159,160,38,228,197,174,184,253,222,159,249,214,243,204,58,207,232,253,123,128,169,107,188,153,178,90,253,178,159,9,62,171,132,56,127,44,28,36,176,53,7,21,241,30,42,70,50,7,49,119,115,72,112,225,180,81,107,208,245,122,70,131,54,99,93,178,119,203,250,215,78,210,225,230,15,249,204,181,204,224,215,132,141,175,150,18,74,182,141,35,11,157,160,112,200,132,187,65,137,3,35,93,70,26,56,108,7,49,21,63,196,40,14,14,133,103,79,152,66,126,84,169,3,85,121,250,192,76,98,203,129,129,56,197,31,152,35,244,94,179,14,167,157,170,21,150,220,229,84,0,27,252,79,49,90,215,98,98,153,206,121,83,216,73,225,79,23,80,250,126,86,123,215,45,149,98,204,28,212,45,141,138,19,52,150,187,82,31,187,232,145,6,160,217,208,94,126,243,236,71,101,194,173,108,72,145,110,117,83,160,47,58,18,54,232,35,9,7,169,8,36,84,106,17,63,101,43,150,167,121,228,143,188,72,165,164,145,27,102,189,138,42,39,242,203,188,224,235,208,141,161,192,253,222,98,217,230,239,35,20,188,225,189,13,167,208,252,38,138,131,63,63,145,178,126,112,208,36,185,105,203,21,248,66,230,70,59,91,253,119,122,220,101,107,181,197,126,90,244,238,83,9,55,247,72,56,118,184,9,174,177,161,18,159,240,138,63,204,51,147,36,253,114,0,0,0,0,1,194,106,55,3,132,212,110,2,70,190,89,7,9,168,220,6,203,194,235,4,141,124,178,5,79,22,133,14,19,81,184,15,209,59,143,13,151,133,214,12,85,239,225,9,26,249,100,8,216,147,83,10,158,45,10,11,92,71,61,28,38,163,112,29,228,201,71,31,162,119,30,30,96,29,41,27,47,11,172,26,237,97,155,24,171,223,194,25,105,181,245,18,53,242,200,19,247,152,255,17,177,38,166,16,115,76,145,21,60,90,20,20,254,48,35,22,184,142,122,23,122,228,77,56,77,70,224,57,143,44,215,59,201,146,142,58,11,248,185,63,68,238,60,62,134,132,11,60,192,58,82,61,2,80,101,54,94,23,88,55,156,125,111,53,218,195,54,52,24,169,1,49,87,191,132,48,149,213,179,50,211,107,234,51,17,1,221,36,107,229,144,37,169,143,167,39,239,49,254,38,45,91,201,35,98,77,76,34,160,39,123,32,230,153,34,33,36,243,21,42,120,180,40,43,186,222,31,41,252,96,70,40,62,10,113,45,113,28,244,44,179,118,195,46,245,200,154,47,55,162,173,112,154,141,192,113,88,231,247,115,30,89,174,114,220,51,153,119,147,37,28,118,81,79,43,116,23,241,114,117,213,155,69,126,137,220,120,127,75,182,79,125,13,8,22,124,207,98,33,121,128,116,164,120,66,30,147,122,4,160,202,123,198,202,253,108,188,46,176,109,126,68,135,111,56,250,222,110,250,144,233,107,181,134,108,106,119,236,91,104,49,82,2,105,243,56,53,98,175,127,8,99,109,21,63,97,43,171,102,96,233,193,81,101,166,215,212,100,100,189,227,102,34,3,186,103,224,105,141,72,215,203,32,73,21,161,23,75,83,31,78,74,145,117,121,79,222,99,252,78,28,9,203,76,90,183,146,77,152,221,165,70,196,154,152,71,6,240,175,69,64,78,246,68,130,36,193,65,205,50,68,64,15,88,115,66,73,230,42,67,139,140,29,84,241,104,80,85,51,2,103,87,117,188,62,86,183,214,9,83,248,192,140,82,58,170,187,80,124,20,226,81,190,126,213,90,226,57,232,91,32,83,223,89,102,237,134,88,164,135,177,93,235,145,52,92,41,251,3,94,111,69,90,95,173,47,109,225,53,27,128,224,247,113,183,226,177,207,238,227,115,165,217,230,60,179,92,231,254,217,107,229,184,103,50,228,122,13,5,239,38,74,56,238,228,32,15,236,162,158,86,237,96,244,97,232,47,226,228,233,237,136,211,235,171,54,138,234,105,92,189,253,19,184,240,252,209,210,199,254,151,108,158,255,85,6,169,250,26,16,44,251,216,122,27,249,158,196,66,248,92,174,117,243,0,233,72,242,194,131,127,240,132,61,38,241,70,87,17,244,9,65,148,245,203,43,163,247,141,149,250,246,79,255,205,217,120,93,96,216,186,55,87,218,252,137,14,219,62,227,57,222,113,245,188,223,179,159,139,221,245,33,210,220,55,75,229,215,107,12,216,214,169,102,239,212,239,216,182,213,45,178,129,208,98,164,4,209,160,206,51,211,230,112,106,210,36,26,93,197,94,254,16,196,156,148,39,198,218,42,126,199,24,64,73,194,87,86,204,195,149,60,251,193,211,130,162,192,17,232,149,203,77,175,168,202,143,197,159,200,201,123,198,201,11,17,241,204,68,7,116,205,134,109,67,207,192,211,26,206,2,185,45,145,175,150,64,144,109,252,119,146,43,66,46,147,233,40,25,150,166,62,156,151,100,84,171,149,34,234,242,148,224,128,197,159,188,199,248,158,126,173,207,156,56,19,150,157,250,121,161,152,181,111,36,153,119,5,19,155,49,187,74,154,243,209,125,141,137,53,48,140,75,95,7,142,13,225,94,143,207,139,105,138,128,157,236,139,66,247,219,137,4,73,130,136,198,35,181,131,154,100,136,130,88,14,191,128,30,176,230,129,220,218,209,132,147,204,84,133,81,166,99,135,23,24,58,134,213,114,13,169,226,208,160,168,32,186,151,170,102,4,206,171,164,110,249], "i8", ALLOC_NONE, Runtime.GLOBAL_BASE);
+/* memory initializer */ allocate([174,235,120,124,175,41,18,75,173,111,172,18,172,173,198,37,167,241,129,24,166,51,235,47,164,117,85,118,165,183,63,65,160,248,41,196,161,58,67,243,163,124,253,170,162,190,151,157,181,196,115,208,180,6,25,231,182,64,167,190,183,130,205,137,178,205,219,12,179,15,177,59,177,73,15,98,176,139,101,85,187,215,34,104,186,21,72,95,184,83,246,6,185,145,156,49,188,222,138,180,189,28,224,131,191,90,94,218,190,152,52,237,0,0,0,0,184,188,103,101,170,9,200,139,18,181,175,238,143,98,151,87,55,222,240,50,37,107,95,220,157,215,56,185,197,180,40,239,125,8,79,138,111,189,224,100,215,1,135,1,74,214,191,184,242,106,216,221,224,223,119,51,88,99,16,86,80,25,87,159,232,165,48,250,250,16,159,20,66,172,248,113,223,123,192,200,103,199,167,173,117,114,8,67,205,206,111,38,149,173,127,112,45,17,24,21,63,164,183,251,135,24,208,158,26,207,232,39,162,115,143,66,176,198,32,172,8,122,71,201,160,50,175,62,24,142,200,91,10,59,103,181,178,135,0,208,47,80,56,105,151,236,95,12,133,89,240,226,61,229,151,135,101,134,135,209,221,58,224,180,207,143,79,90,119,51,40,63,234,228,16,134,82,88,119,227,64,237,216,13,248,81,191,104,240,43,248,161,72,151,159,196,90,34,48,42,226,158,87,79,127,73,111,246,199,245,8,147,213,64,167,125,109,252,192,24,53,159,208,78,141,35,183,43,159,150,24,197,39,42,127,160,186,253,71,25,2,65,32,124,16,244,143,146,168,72,232,247,155,20,88,61,35,168,63,88,49,29,144,182,137,161,247,211,20,118,207,106,172,202,168,15,190,127,7,225,6,195,96,132,94,160,112,210,230,28,23,183,244,169,184,89,76,21,223,60,209,194,231,133,105,126,128,224,123,203,47,14,195,119,72,107,203,13,15,162,115,177,104,199,97,4,199,41,217,184,160,76,68,111,152,245,252,211,255,144,238,102,80,126,86,218,55,27,14,185,39,77,182,5,64,40,164,176,239,198,28,12,136,163,129,219,176,26,57,103,215,127,43,210,120,145,147,110,31,244,59,38,247,3,131,154,144,102,145,47,63,136,41,147,88,237,180,68,96,84,12,248,7,49,30,77,168,223,166,241,207,186,254,146,223,236,70,46,184,137,84,155,23,103,236,39,112,2,113,240,72,187,201,76,47,222,219,249,128,48,99,69,231,85,107,63,160,156,211,131,199,249,193,54,104,23,121,138,15,114,228,93,55,203,92,225,80,174,78,84,255,64,246,232,152,37,174,139,136,115,22,55,239,22,4,130,64,248,188,62,39,157,33,233,31,36,153,85,120,65,139,224,215,175,51,92,176,202,237,89,182,59,85,229,209,94,71,80,126,176,255,236,25,213,98,59,33,108,218,135,70,9,200,50,233,231,112,142,142,130,40,237,158,212,144,81,249,177,130,228,86,95,58,88,49,58,167,143,9,131,31,51,110,230,13,134,193,8,181,58,166,109,189,64,225,164,5,252,134,193,23,73,41,47,175,245,78,74,50,34,118,243,138,158,17,150,152,43,190,120,32,151,217,29,120,244,201,75,192,72,174,46,210,253,1,192,106,65,102,165,247,150,94,28,79,42,57,121,93,159,150,151,229,35,241,242,77,107,25,5,245,215,126,96,231,98,209,142,95,222,182,235,194,9,142,82,122,181,233,55,104,0,70,217,208,188,33,188,136,223,49,234,48,99,86,143,34,214,249,97,154,106,158,4,7,189,166,189,191,1,193,216,173,180,110,54,21,8,9,83,29,114,78,154,165,206,41,255,183,123,134,17,15,199,225,116,146,16,217,205,42,172,190,168,56,25,17,70,128,165,118,35,216,198,102,117,96,122,1,16,114,207,174,254,202,115,201,155,87,164,241,34,239,24,150,71,253,173,57,169,69,17,94,204,118,77,238,6,206,241,137,99,220,68,38,141,100,248,65,232,249,47,121,81,65,147,30,52,83,38,177,218,235,154,214,191,179,249,198,233,11,69,161,140,25,240,14,98,161,76,105,7,60,155,81,190,132,39,54,219,150,146,153,53,46,46,254,80,38,84,185,153,158,232,222,252,140,93,113,18,52,225,22,119,169,54,46,206,17,138,73,171,3,63,230,69,187,131,129,32,227,224,145,118,91,92,246,19,73,233,89,253,241,85,62,152,108,130,6,33,212,62,97,68,198,139,206,170,126,55,169,207,214,127,65,56,110,195,38,93,124,118,137,179,196,202,238,214,89,29,214,111,225,161,177,10,243,20,30,228,75,168,121,129,19,203,105,215,171,119,14,178,185,194,161,92,1,126,198,57,156,169,254,128,36,21,153,229,54,160,54,11,142,28,81,110,134,102,22,167,62,218,113,194,44,111,222,44,148,211,185,73,9,4,129,240,177,184,230,149,163,13,73,123,27,177,46,30,67,210,62,72,251,110,89,45,233,219,246,195,81,103,145,166,204,176,169,31,116,12,206,122,102,185,97,148,222,5,6,241,16,0,17,0,18,0,0,0,8,0,7,0,9,0,6,0,10,0,5,0,11,0,4,0,12,0,3,0,13,0,2,0,14,0,1,0,15,0,0,0,105,110,99,111,114,114,101,99,116,32,104,101,97,100,101,114,32,99,104,101,99,107,0,0,117,110,107,110,111,119,110,32,99,111,109,112,114,101,115,115,105,111,110,32,109,101,116,104,111,100,0,0,0,0,0,0,105,110,118,97,108,105,100,32,119,105,110,100,111,119,32,115,105,122,101,0,0,0,0,0,117,110,107,110,111,119,110,32,104,101,97,100,101,114,32,102,108,97,103,115,32,115,101,116,0,0,0,0,0,0,0,0,104,101,97,100,101,114,32,99,114,99,32,109,105,115,109,97,116,99,104,0,0,0,0,0,105,110,118,97,108,105,100,32,98,108,111,99,107,32,116,121,112,101,0,0,0,0,0,0,105,110,118,97,108,105,100,32,115,116,111,114,101,100,32,98,108,111,99,107,32,108,101,110,103,116,104,115,0,0,0,0,116,111,111,32,109,97,110,121,32,108,101,110,103,116,104,32,111,114,32,100,105,115,116,97,110,99,101,32,115,121,109,98,111,108,115,0,0,0,0,0,105,110,118,97,108,105,100,32,99,111,100,101,32,108,101,110,103,116,104,115,32,115,101,116,0,0,0,0,0,0,0,0,105,110,118,97,108,105,100,32,98,105,116,32,108,101,110,103,116,104,32,114,101,112,101,97,116,0,0,0,0,0,0,0,105,110,118,97,108,105,100,32,99,111,100,101,32,45,45,32,109,105,115,115,105,110,103,32,101,110,100,45,111,102,45,98,108,111,99,107,0,0,0,0,105,110,118,97,108,105,100,32,108,105,116,101,114,97,108,47,108,101,110,103,116,104,115,32,115,101,116,0,0,0,0,0,105,110,118,97,108,105,100,32,100,105,115,116,97,110,99,101,115,32,115,101,116,0,0,0,105,110,118,97,108,105,100,32,108,105,116,101,114,97,108,47,108,101,110,103,116,104,32,99,111,100,101,0,0,0,0,0,105,110,118,97,108,105,100,32,100,105,115,116,97,110,99,101,32,99,111,100,101,0,0,0,105,110,118,97,108,105,100,32,100,105,115,116,97,110,99,101,32,116,111,111,32,102,97,114,32,98,97,99,107,0,0,0,105,110,99,111,114,114,101,99,116,32,100,97,116,97,32,99,104,101,99,107,0,0,0,0,105,110,99,111,114,114,101,99,116,32,108,101,110,103,116,104,32,99,104,101,99,107,0,0,96,7,0,0,0,8,80,0,0,8,16,0,20,8,115,0,18,7,31,0,0,8,112,0,0,8,48,0,0,9,192,0,16,7,10,0,0,8,96,0,0,8,32,0,0,9,160,0,0,8,0,0,0,8,128,0,0,8,64,0,0,9,224,0,16,7,6,0,0,8,88,0,0,8,24,0,0,9,144,0,19,7,59,0,0,8,120,0,0,8,56,0,0,9,208,0,17,7,17,0,0,8,104,0,0,8,40,0,0,9,176,0,0,8,8,0,0,8,136,0,0,8,72,0,0,9,240,0,16,7,4,0,0,8,84,0,0,8,20,0,21,8,227,0,19,7,43,0,0,8,116,0,0,8,52,0,0,9,200,0,17,7,13,0,0,8,100,0,0,8,36,0,0,9,168,0,0,8,4,0,0,8,132,0,0,8,68,0,0,9,232,0,16,7,8,0,0,8,92,0,0,8,28,0,0,9,152,0,20,7,83,0,0,8,124,0,0,8,60,0,0,9,216,0,18,7,23,0,0,8,108,0,0,8,44,0,0,9,184,0,0,8,12,0,0,8,140,0,0,8,76,0,0,9,248,0,16,7,3,0,0,8,82,0,0,8,18,0,21,8,163,0,19,7,35,0,0,8,114,0,0,8,50,0,0,9,196,0,17,7,11,0,0,8,98,0,0,8,34,0,0,9,164,0,0,8,2,0,0,8,130,0,0,8,66,0,0,9,228,0,16,7,7,0,0,8,90,0,0,8,26,0,0,9,148,0,20,7,67,0,0,8,122,0,0,8,58,0,0,9,212,0,18,7,19,0,0,8,106,0,0,8,42,0,0,9,180,0,0,8,10,0,0,8,138,0,0,8,74,0,0,9,244,0,16,7,5,0,0,8,86,0,0,8,22,0,64,8,0,0,19,7,51,0,0,8,118,0,0,8,54,0,0,9,204,0,17,7,15,0,0,8,102,0,0,8,38,0,0,9,172,0,0,8,6,0,0,8,134,0,0,8,70,0,0,9,236,0,16,7,9,0,0,8,94,0,0,8,30,0,0,9,156,0,20,7,99,0,0,8,126,0,0,8,62,0,0,9,220,0,18,7,27,0,0,8,110,0,0,8,46,0,0,9,188,0,0,8,14,0,0,8,142,0,0,8,78,0,0,9,252,0,96,7,0,0,0,8,81,0,0,8,17,0,21,8,131,0,18,7,31,0,0,8,113,0,0,8,49,0,0,9,194,0,16,7,10,0,0,8,97,0,0,8,33,0,0,9,162,0,0,8,1,0,0,8,129,0,0,8,65,0,0,9,226,0,16,7,6,0,0,8,89,0,0,8,25,0,0,9,146,0,19,7,59,0,0,8,121,0,0,8,57,0,0,9,210,0,17,7,17,0,0,8,105,0,0,8,41,0,0,9,178,0,0,8,9,0,0,8,137,0,0,8,73,0,0,9,242,0,16,7,4,0,0,8,85,0,0,8,21,0,16,8,2,1,19,7,43,0,0,8,117,0,0,8,53,0,0,9,202,0,17,7,13,0,0,8,101,0,0,8,37,0,0,9,170,0,0,8,5,0,0,8,133,0,0,8,69,0,0,9,234,0,16,7,8,0,0,8,93,0,0,8,29,0,0,9,154,0,20,7,83,0,0,8,125,0,0,8,61,0,0,9,218,0,18,7,23,0,0,8,109,0,0,8,45,0,0,9,186,0,0,8,13,0,0,8,141,0,0,8,77,0,0,9,250,0,16,7,3,0,0,8,83,0,0,8,19,0,21,8,195,0,19,7,35,0,0,8,115,0,0,8,51,0,0,9,198,0,17,7,11,0,0,8,99,0,0,8,35,0,0,9,166,0,0,8,3,0,0,8,131,0,0,8,67,0,0,9,230,0,16,7,7,0,0,8,91,0,0,8,27,0,0,9,150,0,20,7,67,0,0,8,123,0,0,8,59,0,0,9,214,0,18,7,19,0,0,8,107,0,0,8,43,0,0,9,182,0,0,8,11,0,0,8,139,0,0,8,75,0,0,9,246,0,16,7,5,0,0,8,87,0,0,8,23,0,64,8,0,0,19,7,51,0,0,8,119,0,0,8,55,0,0,9,206,0,17,7,15,0,0,8,103,0,0,8,39,0,0,9,174,0,0,8,7,0,0,8,135,0,0,8,71,0,0,9,238,0,16,7,9,0,0,8,95,0,0,8,31,0,0,9,158,0,20,7,99,0,0,8,127,0,0,8,63,0,0,9,222,0,18,7,27,0,0,8,111,0,0,8,47,0,0,9,190,0,0,8,15,0,0,8,143,0,0,8,79,0,0,9,254,0,96,7,0,0,0,8,80,0,0,8,16,0,20,8,115,0,18,7,31,0,0,8,112,0,0,8,48,0,0,9,193,0,16,7,10,0,0,8,96,0,0,8,32,0,0,9,161,0,0,8,0,0,0,8,128,0,0,8,64,0,0,9,225,0,16,7,6,0,0,8,88,0,0,8,24,0,0,9,145,0,19,7,59,0,0,8,120,0,0,8,56,0,0,9,209,0,17,7,17,0,0,8,104,0,0,8,40,0,0,9,177,0,0,8,8,0,0,8,136,0,0,8,72,0,0,9,241,0,16,7,4,0,0,8,84,0,0,8,20,0,21,8,227,0,19,7,43,0,0,8,116,0,0,8,52,0,0,9,201,0,17,7,13,0,0,8,100,0,0,8,36,0,0,9,169,0,0,8,4,0,0,8,132,0,0,8,68,0,0,9,233,0,16,7,8,0,0,8,92,0,0,8,28,0,0,9,153,0,20,7,83,0,0,8,124,0,0,8,60,0,0,9,217,0,18,7,23,0,0,8,108,0,0,8,44,0,0,9,185,0,0,8,12,0,0,8,140,0,0,8,76,0,0,9,249,0,16,7,3,0,0,8,82,0,0,8,18,0,21,8,163,0,19,7,35,0,0,8,114,0,0,8,50,0,0,9,197,0,17,7,11,0,0,8,98,0,0,8,34,0,0,9,165,0,0,8,2,0,0,8,130,0,0,8,66,0,0,9,229,0,16,7,7,0,0,8,90,0,0,8,26,0,0,9,149,0,20,7,67,0,0,8,122,0,0,8,58,0,0,9,213,0,18,7,19,0,0,8,106,0,0,8,42,0,0,9,181,0,0,8,10,0,0,8,138,0,0,8,74,0,0,9,245,0,16,7,5,0,0,8,86,0,0,8,22,0,64,8,0,0,19,7,51,0,0,8,118,0,0,8,54,0,0,9,205,0,17,7,15,0,0,8,102,0,0,8,38,0,0,9,173,0,0,8,6,0,0,8,134,0,0,8,70,0,0,9,237,0,16,7,9,0,0,8,94,0,0,8,30,0,0,9,157,0,20,7,99,0,0,8,126,0,0,8,62,0,0,9,221,0,18,7,27,0,0,8,110,0,0,8,46,0,0,9,189,0,0,8,14,0,0,8,142,0,0,8,78,0,0,9,253,0,96,7,0,0,0,8,81,0,0,8,17,0,21,8,131,0,18,7,31,0,0,8,113,0,0,8,49,0,0,9,195,0,16,7,10,0,0,8,97,0,0,8,33,0,0,9,163,0,0,8,1,0,0,8,129,0,0,8,65,0,0,9,227,0,16,7,6,0,0,8,89,0,0,8,25,0,0,9,147,0,19,7,59,0,0,8,121,0,0,8,57,0,0,9,211,0,17,7,17,0,0,8,105,0,0,8,41,0,0,9,179,0,0,8,9,0,0,8,137,0,0,8,73,0,0,9,243,0,16,7,4,0,0,8,85,0,0,8,21,0,16,8,2,1,19,7,43,0,0,8,117,0,0,8,53,0,0,9,203,0,17,7,13,0,0,8,101,0,0,8,37,0,0,9,171,0,0,8,5,0,0,8,133,0,0,8,69,0,0,9,235,0,16,7,8,0,0,8,93,0,0,8,29,0,0,9,155,0,20,7,83,0,0,8,125,0,0,8,61,0,0,9,219,0,18,7,23,0,0,8,109,0,0,8,45,0,0,9,187,0,0,8,13,0,0,8,141,0,0,8,77,0,0,9,251,0,16,7,3,0,0,8,83,0,0,8,19,0,21,8,195,0,19,7,35,0,0,8,115,0,0,8,51,0,0,9,199,0,17,7,11,0,0,8,99,0,0,8,35,0,0,9,167,0,0,8,3,0,0,8,131,0,0,8,67,0,0,9,231,0,16,7,7,0,0,8,91,0,0,8,27,0,0,9,151,0,20,7,67,0,0,8,123,0,0,8,59,0,0,9,215,0,18,7,19,0,0,8,107,0,0,8,43,0,0,9,183,0,0,8,11,0,0,8,139,0,0,8,75,0,0,9,247,0,16,7,5,0,0,8,87,0,0,8,23,0,64,8,0,0,19,7,51,0,0,8,119,0,0,8,55,0,0,9,207,0,17,7,15,0,0,8,103,0,0,8,39,0,0,9,175,0,0,8,7,0,0,8,135,0,0,8,71,0,0,9,239,0,16,7,9,0,0,8,95,0,0,8,31,0,0,9,159,0,20,7,99,0,0,8,127,0,0,8,63,0,0,9,223,0,18,7,27,0,0,8,111,0,0,8,47,0,0,9,191,0,0,8,15,0,0,8,143,0,0,8,79,0,0,9,255,0,16,5,1,0,23,5,1,1,19,5,17,0,27,5,1,16,17,5,5,0,25,5,1,4,21,5,65,0,29,5,1,64,16,5,3,0,24,5,1,2,20,5,33,0,28,5,1,32,18,5,9,0,26,5,1,8,22,5,129,0,64,5,0,0,16,5,2,0,23,5,129,1,19,5,25,0,27,5,1,24,17,5,7,0,25,5,1,6,21,5,97,0,29,5,1,96,16,5,4,0,24,5,1,3,20,5,49,0,28,5,1,48,18,5,13,0,26,5,1,12,22,5,193,0,64,5,0,0,3,0,4,0,5,0,6,0,7,0,8,0,9,0,10,0,11,0,13,0,15,0,17,0,19,0,23,0,27,0,31,0,35,0,43,0,51,0,59,0,67,0,83,0,99,0,115,0,131,0,163,0,195,0,227,0,2,1,0,0,0,0,0,0,16,0,16,0,16,0,16,0,16,0,16,0,16,0,16,0,17,0,17,0,17,0,17,0,18,0,18,0,18,0,18,0,19,0,19,0,19,0,19,0,20,0,20,0,20,0,20,0,21,0,21,0,21,0,21,0,16,0,73,0,195,0,0,0,1,0,2,0,3,0,4,0,5,0,7,0,9,0,13,0,17,0,25,0,33,0,49,0,65,0,97,0,129,0,193,0,1,1,129,1,1,2,1,3,1,4,1,6,1,8,1,12,1,16,1,24,1,32,1,48,1,64,1,96,0,0,0,0,16,0,16,0,16,0,16,0,17,0,17,0,18,0,18,0,19,0,19,0,20,0,20,0,21,0,21,0,22,0,22,0,23,0,23,0,24,0,24,0,25,0,25,0,26,0,26,0,27,0,27,0,28,0,28,0,29,0,29,0,64,0,64,0,105,110,118,97,108,105,100,32,100,105,115,116,97,110,99,101,32,116,111,111,32,102,97,114,32,98,97,99,107,0,0,0,105,110,118,97,108,105,100,32,100,105,115,116,97,110,99,101,32,99,111,100,101,0,0,0,105,110,118,97,108,105,100,32,108,105,116,101,114,97,108,47,108,101,110,103,116,104,32,99,111,100,101,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], "i8", ALLOC_NONE, Runtime.GLOBAL_BASE+10240);
+
+
+
+
+var tempDoublePtr = Runtime.alignMemory(allocate(12, "i8", ALLOC_STATIC), 8);
+
+assert(tempDoublePtr % 8 == 0);
+
+function copyTempFloat(ptr) { // functions, because inlining this code increases code size too much
+
+ HEAP8[tempDoublePtr] = HEAP8[ptr];
+
+ HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
+
+ HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
+
+ HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
+
+}
+
+function copyTempDouble(ptr) {
+
+ HEAP8[tempDoublePtr] = HEAP8[ptr];
+
+ HEAP8[tempDoublePtr+1] = HEAP8[ptr+1];
+
+ HEAP8[tempDoublePtr+2] = HEAP8[ptr+2];
+
+ HEAP8[tempDoublePtr+3] = HEAP8[ptr+3];
+
+ HEAP8[tempDoublePtr+4] = HEAP8[ptr+4];
+
+ HEAP8[tempDoublePtr+5] = HEAP8[ptr+5];
+
+ HEAP8[tempDoublePtr+6] = HEAP8[ptr+6];
+
+ HEAP8[tempDoublePtr+7] = HEAP8[ptr+7];
+
+}
+
+
+
+
+
+
+ var ERRNO_CODES={EPERM:1,ENOENT:2,ESRCH:3,EINTR:4,EIO:5,ENXIO:6,E2BIG:7,ENOEXEC:8,EBADF:9,ECHILD:10,EAGAIN:11,EWOULDBLOCK:11,ENOMEM:12,EACCES:13,EFAULT:14,ENOTBLK:15,EBUSY:16,EEXIST:17,EXDEV:18,ENODEV:19,ENOTDIR:20,EISDIR:21,EINVAL:22,ENFILE:23,EMFILE:24,ENOTTY:25,ETXTBSY:26,EFBIG:27,ENOSPC:28,ESPIPE:29,EROFS:30,EMLINK:31,EPIPE:32,EDOM:33,ERANGE:34,ENOMSG:42,EIDRM:43,ECHRNG:44,EL2NSYNC:45,EL3HLT:46,EL3RST:47,ELNRNG:48,EUNATCH:49,ENOCSI:50,EL2HLT:51,EDEADLK:35,ENOLCK:37,EBADE:52,EBADR:53,EXFULL:54,ENOANO:55,EBADRQC:56,EBADSLT:57,EDEADLOCK:35,EBFONT:59,ENOSTR:60,ENODATA:61,ETIME:62,ENOSR:63,ENONET:64,ENOPKG:65,EREMOTE:66,ENOLINK:67,EADV:68,ESRMNT:69,ECOMM:70,EPROTO:71,EMULTIHOP:72,EDOTDOT:73,EBADMSG:74,ENOTUNIQ:76,EBADFD:77,EREMCHG:78,ELIBACC:79,ELIBBAD:80,ELIBSCN:81,ELIBMAX:82,ELIBEXEC:83,ENOSYS:38,ENOTEMPTY:39,ENAMETOOLONG:36,ELOOP:40,EOPNOTSUPP:95,EPFNOSUPPORT:96,ECONNRESET:104,ENOBUFS:105,EAFNOSUPPORT:97,EPROTOTYPE:91,ENOTSOCK:88,ENOPROTOOPT:92,ESHUTDOWN:108,ECONNREFUSED:111,EADDRINUSE:98,ECONNABORTED:103,ENETUNREACH:101,ENETDOWN:100,ETIMEDOUT:110,EHOSTDOWN:112,EHOSTUNREACH:113,EINPROGRESS:115,EALREADY:114,EDESTADDRREQ:89,EMSGSIZE:90,EPROTONOSUPPORT:93,ESOCKTNOSUPPORT:94,EADDRNOTAVAIL:99,ENETRESET:102,EISCONN:106,ENOTCONN:107,ETOOMANYREFS:109,EUSERS:87,EDQUOT:122,ESTALE:116,ENOTSUP:95,ENOMEDIUM:123,EILSEQ:84,EOVERFLOW:75,ECANCELED:125,ENOTRECOVERABLE:131,EOWNERDEAD:130,ESTRPIPE:86};
+
+ var ERRNO_MESSAGES={0:"Success",1:"Not super-user",2:"No such file or directory",3:"No such process",4:"Interrupted system call",5:"I/O error",6:"No such device or address",7:"Arg list too long",8:"Exec format error",9:"Bad file number",10:"No children",11:"No more processes",12:"Not enough core",13:"Permission denied",14:"Bad address",15:"Block device required",16:"Mount device busy",17:"File exists",18:"Cross-device link",19:"No such device",20:"Not a directory",21:"Is a directory",22:"Invalid argument",23:"Too many open files in system",24:"Too many open files",25:"Not a typewriter",26:"Text file busy",27:"File too large",28:"No space left on device",29:"Illegal seek",30:"Read only file system",31:"Too many links",32:"Broken pipe",33:"Math arg out of domain of func",34:"Math result not representable",35:"File locking deadlock error",36:"File or path name too long",37:"No record locks available",38:"Function not implemented",39:"Directory not empty",40:"Too many symbolic links",42:"No message of desired type",43:"Identifier removed",44:"Channel number out of range",45:"Level 2 not synchronized",46:"Level 3 halted",47:"Level 3 reset",48:"Link number out of range",49:"Protocol driver not attached",50:"No CSI structure available",51:"Level 2 halted",52:"Invalid exchange",53:"Invalid request descriptor",54:"Exchange full",55:"No anode",56:"Invalid request code",57:"Invalid slot",59:"Bad font file fmt",60:"Device not a stream",61:"No data (for no delay io)",62:"Timer expired",63:"Out of streams resources",64:"Machine is not on the network",65:"Package not installed",66:"The object is remote",67:"The link has been severed",68:"Advertise error",69:"Srmount error",70:"Communication error on send",71:"Protocol error",72:"Multihop attempted",73:"Cross mount point (not really error)",74:"Trying to read unreadable message",75:"Value too large for defined data type",76:"Given log. name not unique",77:"f.d. invalid for this operation",78:"Remote address changed",79:"Can access a needed shared lib",80:"Accessing a corrupted shared lib",81:".lib section in a.out corrupted",82:"Attempting to link in too many libs",83:"Attempting to exec a shared library",84:"Illegal byte sequence",86:"Streams pipe error",87:"Too many users",88:"Socket operation on non-socket",89:"Destination address required",90:"Message too long",91:"Protocol wrong type for socket",92:"Protocol not available",93:"Unknown protocol",94:"Socket type not supported",95:"Not supported",96:"Protocol family not supported",97:"Address family not supported by protocol family",98:"Address already in use",99:"Address not available",100:"Network interface is not configured",101:"Network is unreachable",102:"Connection reset by network",103:"Connection aborted",104:"Connection reset by peer",105:"No buffer space available",106:"Socket is already connected",107:"Socket is not connected",108:"Can't send after socket shutdown",109:"Too many references",110:"Connection timed out",111:"Connection refused",112:"Host is down",113:"Host is unreachable",114:"Socket already connected",115:"Connection already in progress",116:"Stale file handle",122:"Quota exceeded",123:"No medium (in tape drive)",125:"Operation canceled",130:"Previous owner died",131:"State not recoverable"};
+
+
+ var ___errno_state=0;function ___setErrNo(value) {
+ // For convenient setting and returning of errno.
+ HEAP32[((___errno_state)>>2)]=value;
+ return value;
+ }
+
+ var PATH={splitPath:function (filename) {
+ var splitPathRe = /^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/;
+ return splitPathRe.exec(filename).slice(1);
+ },normalizeArray:function (parts, allowAboveRoot) {
+ // if the path tries to go above the root, `up` ends up > 0
+ var up = 0;
+ for (var i = parts.length - 1; i >= 0; i--) {
+ var last = parts[i];
+ if (last === '.') {
+ parts.splice(i, 1);
+ } else if (last === '..') {
+ parts.splice(i, 1);
+ up++;
+ } else if (up) {
+ parts.splice(i, 1);
+ up--;
+ }
+ }
+ // if the path is allowed to go above the root, restore leading ..s
+ if (allowAboveRoot) {
+ for (; up--; up) {
+ parts.unshift('..');
+ }
+ }
+ return parts;
+ },normalize:function (path) {
+ var isAbsolute = path.charAt(0) === '/',
+ trailingSlash = path.substr(-1) === '/';
+ // Normalize the path
+ path = PATH.normalizeArray(path.split('/').filter(function(p) {
+ return !!p;
+ }), !isAbsolute).join('/');
+ if (!path && !isAbsolute) {
+ path = '.';
+ }
+ if (path && trailingSlash) {
+ path += '/';
+ }
+ return (isAbsolute ? '/' : '') + path;
+ },dirname:function (path) {
+ var result = PATH.splitPath(path),
+ root = result[0],
+ dir = result[1];
+ if (!root && !dir) {
+ // No dirname whatsoever
+ return '.';
+ }
+ if (dir) {
+ // It has a dirname, strip trailing slash
+ dir = dir.substr(0, dir.length - 1);
+ }
+ return root + dir;
+ },basename:function (path) {
+ // EMSCRIPTEN return '/'' for '/', not an empty string
+ if (path === '/') return '/';
+ var lastSlash = path.lastIndexOf('/');
+ if (lastSlash === -1) return path;
+ return path.substr(lastSlash+1);
+ },extname:function (path) {
+ return PATH.splitPath(path)[3];
+ },join:function () {
+ var paths = Array.prototype.slice.call(arguments, 0);
+ return PATH.normalize(paths.join('/'));
+ },join2:function (l, r) {
+ return PATH.normalize(l + '/' + r);
+ },resolve:function () {
+ var resolvedPath = '',
+ resolvedAbsolute = false;
+ for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {
+ var path = (i >= 0) ? arguments[i] : FS.cwd();
+ // Skip empty and invalid entries
+ if (typeof path !== 'string') {
+ throw new TypeError('Arguments to path.resolve must be strings');
+ } else if (!path) {
+ continue;
+ }
+ resolvedPath = path + '/' + resolvedPath;
+ resolvedAbsolute = path.charAt(0) === '/';
+ }
+ // At this point the path should be resolved to a full absolute path, but
+ // handle relative paths to be safe (might happen when process.cwd() fails)
+ resolvedPath = PATH.normalizeArray(resolvedPath.split('/').filter(function(p) {
+ return !!p;
+ }), !resolvedAbsolute).join('/');
+ return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.';
+ },relative:function (from, to) {
+ from = PATH.resolve(from).substr(1);
+ to = PATH.resolve(to).substr(1);
+ function trim(arr) {
+ var start = 0;
+ for (; start < arr.length; start++) {
+ if (arr[start] !== '') break;
+ }
+ var end = arr.length - 1;
+ for (; end >= 0; end--) {
+ if (arr[end] !== '') break;
+ }
+ if (start > end) return [];
+ return arr.slice(start, end - start + 1);
+ }
+ var fromParts = trim(from.split('/'));
+ var toParts = trim(to.split('/'));
+ var length = Math.min(fromParts.length, toParts.length);
+ var samePartsLength = length;
+ for (var i = 0; i < length; i++) {
+ if (fromParts[i] !== toParts[i]) {
+ samePartsLength = i;
+ break;
+ }
+ }
+ var outputParts = [];
+ for (var i = samePartsLength; i < fromParts.length; i++) {
+ outputParts.push('..');
+ }
+ outputParts = outputParts.concat(toParts.slice(samePartsLength));
+ return outputParts.join('/');
+ }};
+
+ var TTY={ttys:[],init:function () {
+ // https://github.com/kripken/emscripten/pull/1555
+ // if (ENVIRONMENT_IS_NODE) {
+ // // currently, FS.init does not distinguish if process.stdin is a file or TTY
+ // // device, it always assumes it's a TTY device. because of this, we're forcing
+ // // process.stdin to UTF8 encoding to at least make stdin reading compatible
+ // // with text files until FS.init can be refactored.
+ // process['stdin']['setEncoding']('utf8');
+ // }
+ },shutdown:function () {
+ // https://github.com/kripken/emscripten/pull/1555
+ // if (ENVIRONMENT_IS_NODE) {
+ // // inolen: any idea as to why node -e 'process.stdin.read()' wouldn't exit immediately (with process.stdin being a tty)?
+ // // isaacs: because now it's reading from the stream, you've expressed interest in it, so that read() kicks off a _read() which creates a ReadReq operation
+ // // inolen: I thought read() in that case was a synchronous operation that just grabbed some amount of buffered data if it exists?
+ // // isaacs: it is. but it also triggers a _read() call, which calls readStart() on the handle
+ // // isaacs: do process.stdin.pause() and i'd think it'd probably close the pending call
+ // process['stdin']['pause']();
+ // }
+ },register:function (dev, ops) {
+ TTY.ttys[dev] = { input: [], output: [], ops: ops };
+ FS.registerDevice(dev, TTY.stream_ops);
+ },stream_ops:{open:function (stream) {
+ var tty = TTY.ttys[stream.node.rdev];
+ if (!tty) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ stream.tty = tty;
+ stream.seekable = false;
+ },close:function (stream) {
+ // flush any pending line data
+ if (stream.tty.output.length) {
+ stream.tty.ops.put_char(stream.tty, 10);
+ }
+ },read:function (stream, buffer, offset, length, pos /* ignored */) {
+ if (!stream.tty || !stream.tty.ops.get_char) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
+ }
+ var bytesRead = 0;
+ for (var i = 0; i < length; i++) {
+ var result;
+ try {
+ result = stream.tty.ops.get_char(stream.tty);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ if (result === undefined && bytesRead === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ if (result === null || result === undefined) break;
+ bytesRead++;
+ buffer[offset+i] = result;
+ }
+ if (bytesRead) {
+ stream.node.timestamp = Date.now();
+ }
+ return bytesRead;
+ },write:function (stream, buffer, offset, length, pos) {
+ if (!stream.tty || !stream.tty.ops.put_char) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
+ }
+ for (var i = 0; i < length; i++) {
+ try {
+ stream.tty.ops.put_char(stream.tty, buffer[offset+i]);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ }
+ if (length) {
+ stream.node.timestamp = Date.now();
+ }
+ return i;
+ }},default_tty_ops:{get_char:function (tty) {
+ if (!tty.input.length) {
+ var result = null;
+ if (ENVIRONMENT_IS_NODE) {
+ result = process['stdin']['read']();
+ if (!result) {
+ if (process['stdin']['_readableState'] && process['stdin']['_readableState']['ended']) {
+ return null; // EOF
+ }
+ return undefined; // no data available
+ }
+ } else if (typeof window != 'undefined' &&
+ typeof window.prompt == 'function') {
+ // Browser.
+ result = window.prompt('Input: '); // returns null on cancel
+ if (result !== null) {
+ result += '\n';
+ }
+ } else if (typeof readline == 'function') {
+ // Command line.
+ result = readline();
+ if (result !== null) {
+ result += '\n';
+ }
+ }
+ if (!result) {
+ return null;
+ }
+ tty.input = intArrayFromString(result, true);
+ }
+ return tty.input.shift();
+ },put_char:function (tty, val) {
+ if (val === null || val === 10) {
+ Module['print'](tty.output.join(''));
+ tty.output = [];
+ } else {
+ tty.output.push(TTY.utf8.processCChar(val));
+ }
+ }},default_tty1_ops:{put_char:function (tty, val) {
+ if (val === null || val === 10) {
+ Module['printErr'](tty.output.join(''));
+ tty.output = [];
+ } else {
+ tty.output.push(TTY.utf8.processCChar(val));
+ }
+ }}};
+
+ var MEMFS={ops_table:null,CONTENT_OWNING:1,CONTENT_FLEXIBLE:2,CONTENT_FIXED:3,mount:function (mount) {
+ return MEMFS.createNode(null, '/', 16384 | 511 /* 0777 */, 0);
+ },createNode:function (parent, name, mode, dev) {
+ if (FS.isBlkdev(mode) || FS.isFIFO(mode)) {
+ // no supported
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (!MEMFS.ops_table) {
+ MEMFS.ops_table = {
+ dir: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr,
+ lookup: MEMFS.node_ops.lookup,
+ mknod: MEMFS.node_ops.mknod,
+ rename: MEMFS.node_ops.rename,
+ unlink: MEMFS.node_ops.unlink,
+ rmdir: MEMFS.node_ops.rmdir,
+ readdir: MEMFS.node_ops.readdir,
+ symlink: MEMFS.node_ops.symlink
+ },
+ stream: {
+ llseek: MEMFS.stream_ops.llseek
+ }
+ },
+ file: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr
+ },
+ stream: {
+ llseek: MEMFS.stream_ops.llseek,
+ read: MEMFS.stream_ops.read,
+ write: MEMFS.stream_ops.write,
+ allocate: MEMFS.stream_ops.allocate,
+ mmap: MEMFS.stream_ops.mmap
+ }
+ },
+ link: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr,
+ readlink: MEMFS.node_ops.readlink
+ },
+ stream: {}
+ },
+ chrdev: {
+ node: {
+ getattr: MEMFS.node_ops.getattr,
+ setattr: MEMFS.node_ops.setattr
+ },
+ stream: FS.chrdev_stream_ops
+ },
+ };
+ }
+ var node = FS.createNode(parent, name, mode, dev);
+ if (FS.isDir(node.mode)) {
+ node.node_ops = MEMFS.ops_table.dir.node;
+ node.stream_ops = MEMFS.ops_table.dir.stream;
+ node.contents = {};
+ } else if (FS.isFile(node.mode)) {
+ node.node_ops = MEMFS.ops_table.file.node;
+ node.stream_ops = MEMFS.ops_table.file.stream;
+ node.contents = [];
+ node.contentMode = MEMFS.CONTENT_FLEXIBLE;
+ } else if (FS.isLink(node.mode)) {
+ node.node_ops = MEMFS.ops_table.link.node;
+ node.stream_ops = MEMFS.ops_table.link.stream;
+ } else if (FS.isChrdev(node.mode)) {
+ node.node_ops = MEMFS.ops_table.chrdev.node;
+ node.stream_ops = MEMFS.ops_table.chrdev.stream;
+ }
+ node.timestamp = Date.now();
+ // add the new node to the parent
+ if (parent) {
+ parent.contents[name] = node;
+ }
+ return node;
+ },ensureFlexible:function (node) {
+ if (node.contentMode !== MEMFS.CONTENT_FLEXIBLE) {
+ var contents = node.contents;
+ node.contents = Array.prototype.slice.call(contents);
+ node.contentMode = MEMFS.CONTENT_FLEXIBLE;
+ }
+ },node_ops:{getattr:function (node) {
+ var attr = {};
+ // device numbers reuse inode numbers.
+ attr.dev = FS.isChrdev(node.mode) ? node.id : 1;
+ attr.ino = node.id;
+ attr.mode = node.mode;
+ attr.nlink = 1;
+ attr.uid = 0;
+ attr.gid = 0;
+ attr.rdev = node.rdev;
+ if (FS.isDir(node.mode)) {
+ attr.size = 4096;
+ } else if (FS.isFile(node.mode)) {
+ attr.size = node.contents.length;
+ } else if (FS.isLink(node.mode)) {
+ attr.size = node.link.length;
+ } else {
+ attr.size = 0;
+ }
+ attr.atime = new Date(node.timestamp);
+ attr.mtime = new Date(node.timestamp);
+ attr.ctime = new Date(node.timestamp);
+ // NOTE: In our implementation, st_blocks = Math.ceil(st_size/st_blksize),
+ // but this is not required by the standard.
+ attr.blksize = 4096;
+ attr.blocks = Math.ceil(attr.size / attr.blksize);
+ return attr;
+ },setattr:function (node, attr) {
+ if (attr.mode !== undefined) {
+ node.mode = attr.mode;
+ }
+ if (attr.timestamp !== undefined) {
+ node.timestamp = attr.timestamp;
+ }
+ if (attr.size !== undefined) {
+ MEMFS.ensureFlexible(node);
+ var contents = node.contents;
+ if (attr.size < contents.length) contents.length = attr.size;
+ else while (attr.size > contents.length) contents.push(0);
+ }
+ },lookup:function (parent, name) {
+ throw FS.genericErrors[ERRNO_CODES.ENOENT];
+ },mknod:function (parent, name, mode, dev) {
+ return MEMFS.createNode(parent, name, mode, dev);
+ },rename:function (old_node, new_dir, new_name) {
+ // if we're overwriting a directory at new_name, make sure it's empty.
+ if (FS.isDir(old_node.mode)) {
+ var new_node;
+ try {
+ new_node = FS.lookupNode(new_dir, new_name);
+ } catch (e) {
+ }
+ if (new_node) {
+ for (var i in new_node.contents) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ }
+ }
+ // do the internal rewiring
+ delete old_node.parent.contents[old_node.name];
+ old_node.name = new_name;
+ new_dir.contents[new_name] = old_node;
+ old_node.parent = new_dir;
+ },unlink:function (parent, name) {
+ delete parent.contents[name];
+ },rmdir:function (parent, name) {
+ var node = FS.lookupNode(parent, name);
+ for (var i in node.contents) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ delete parent.contents[name];
+ },readdir:function (node) {
+ var entries = ['.', '..']
+ for (var key in node.contents) {
+ if (!node.contents.hasOwnProperty(key)) {
+ continue;
+ }
+ entries.push(key);
+ }
+ return entries;
+ },symlink:function (parent, newname, oldpath) {
+ var node = MEMFS.createNode(parent, newname, 511 /* 0777 */ | 40960, 0);
+ node.link = oldpath;
+ return node;
+ },readlink:function (node) {
+ if (!FS.isLink(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ return node.link;
+ }},stream_ops:{read:function (stream, buffer, offset, length, position) {
+ var contents = stream.node.contents;
+ if (position >= contents.length)
+ return 0;
+ var size = Math.min(contents.length - position, length);
+ assert(size >= 0);
+ if (size > 8 && contents.subarray) { // non-trivial, and typed array
+ buffer.set(contents.subarray(position, position + size), offset);
+ } else
+ {
+ for (var i = 0; i < size; i++) {
+ buffer[offset + i] = contents[position + i];
+ }
+ }
+ return size;
+ },write:function (stream, buffer, offset, length, position, canOwn) {
+ var node = stream.node;
+ node.timestamp = Date.now();
+ var contents = node.contents;
+ if (length && contents.length === 0 && position === 0 && buffer.subarray) {
+ // just replace it with the new data
+ if (canOwn && offset === 0) {
+ node.contents = buffer; // this could be a subarray of Emscripten HEAP, or allocated from some other source.
+ node.contentMode = (buffer.buffer === HEAP8.buffer) ? MEMFS.CONTENT_OWNING : MEMFS.CONTENT_FIXED;
+ } else {
+ node.contents = new Uint8Array(buffer.subarray(offset, offset+length));
+ node.contentMode = MEMFS.CONTENT_FIXED;
+ }
+ return length;
+ }
+ MEMFS.ensureFlexible(node);
+ var contents = node.contents;
+ while (contents.length < position) contents.push(0);
+ for (var i = 0; i < length; i++) {
+ contents[position + i] = buffer[offset + i];
+ }
+ return length;
+ },llseek:function (stream, offset, whence) {
+ var position = offset;
+ if (whence === 1) { // SEEK_CUR.
+ position += stream.position;
+ } else if (whence === 2) { // SEEK_END.
+ if (FS.isFile(stream.node.mode)) {
+ position += stream.node.contents.length;
+ }
+ }
+ if (position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ stream.ungotten = [];
+ stream.position = position;
+ return position;
+ },allocate:function (stream, offset, length) {
+ MEMFS.ensureFlexible(stream.node);
+ var contents = stream.node.contents;
+ var limit = offset + length;
+ while (limit > contents.length) contents.push(0);
+ },mmap:function (stream, buffer, offset, length, position, prot, flags) {
+ if (!FS.isFile(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ var ptr;
+ var allocated;
+ var contents = stream.node.contents;
+ // Only make a new copy when MAP_PRIVATE is specified.
+ if ( !(flags & 2) &&
+ (contents.buffer === buffer || contents.buffer === buffer.buffer) ) {
+ // We can't emulate MAP_SHARED when the file is not backed by the buffer
+ // we're mapping to (e.g. the HEAP buffer).
+ allocated = false;
+ ptr = contents.byteOffset;
+ } else {
+ // Try to avoid unnecessary slices.
+ if (position > 0 || position + length < contents.length) {
+ if (contents.subarray) {
+ contents = contents.subarray(position, position + length);
+ } else {
+ contents = Array.prototype.slice.call(contents, position, position + length);
+ }
+ }
+ allocated = true;
+ ptr = _malloc(length);
+ if (!ptr) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOMEM);
+ }
+ buffer.set(contents, ptr);
+ }
+ return { ptr: ptr, allocated: allocated };
+ }}};
+
+ var IDBFS={dbs:{},indexedDB:function () {
+ return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
+ },DB_VERSION:21,DB_STORE_NAME:"FILE_DATA",mount:function (mount) {
+ // reuse all of the core MEMFS functionality
+ return MEMFS.mount.apply(null, arguments);
+ },syncfs:function (mount, populate, callback) {
+ IDBFS.getLocalSet(mount, function(err, local) {
+ if (err) return callback(err);
+
+ IDBFS.getRemoteSet(mount, function(err, remote) {
+ if (err) return callback(err);
+
+ var src = populate ? remote : local;
+ var dst = populate ? local : remote;
+
+ IDBFS.reconcile(src, dst, callback);
+ });
+ });
+ },getDB:function (name, callback) {
+ // check the cache first
+ var db = IDBFS.dbs[name];
+ if (db) {
+ return callback(null, db);
+ }
+
+ var req;
+ try {
+ req = IDBFS.indexedDB().open(name, IDBFS.DB_VERSION);
+ } catch (e) {
+ return callback(e);
+ }
+ req.onupgradeneeded = function(e) {
+ var db = e.target.result;
+ var transaction = e.target.transaction;
+
+ var fileStore;
+
+ if (db.objectStoreNames.contains(IDBFS.DB_STORE_NAME)) {
+ fileStore = transaction.objectStore(IDBFS.DB_STORE_NAME);
+ } else {
+ fileStore = db.createObjectStore(IDBFS.DB_STORE_NAME);
+ }
+
+ fileStore.createIndex('timestamp', 'timestamp', { unique: false });
+ };
+ req.onsuccess = function() {
+ db = req.result;
+
+ // add to the cache
+ IDBFS.dbs[name] = db;
+ callback(null, db);
+ };
+ req.onerror = function() {
+ callback(this.error);
+ };
+ },getLocalSet:function (mount, callback) {
+ var entries = {};
+
+ function isRealDir(p) {
+ return p !== '.' && p !== '..';
+ };
+ function toAbsolute(root) {
+ return function(p) {
+ return PATH.join2(root, p);
+ }
+ };
+
+ var check = FS.readdir(mount.mountpoint).filter(isRealDir).map(toAbsolute(mount.mountpoint));
+
+ while (check.length) {
+ var path = check.pop();
+ var stat;
+
+ try {
+ stat = FS.stat(path);
+ } catch (e) {
+ return callback(e);
+ }
+
+ if (FS.isDir(stat.mode)) {
+ check.push.apply(check, FS.readdir(path).filter(isRealDir).map(toAbsolute(path)));
+ }
+
+ entries[path] = { timestamp: stat.mtime };
+ }
+
+ return callback(null, { type: 'local', entries: entries });
+ },getRemoteSet:function (mount, callback) {
+ var entries = {};
+
+ IDBFS.getDB(mount.mountpoint, function(err, db) {
+ if (err) return callback(err);
+
+ var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readonly');
+ transaction.onerror = function() { callback(this.error); };
+
+ var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
+ var index = store.index('timestamp');
+
+ index.openKeyCursor().onsuccess = function(event) {
+ var cursor = event.target.result;
+
+ if (!cursor) {
+ return callback(null, { type: 'remote', db: db, entries: entries });
+ }
+
+ entries[cursor.primaryKey] = { timestamp: cursor.key };
+
+ cursor.continue();
+ };
+ });
+ },loadLocalEntry:function (path, callback) {
+ var stat, node;
+
+ try {
+ var lookup = FS.lookupPath(path);
+ node = lookup.node;
+ stat = FS.stat(path);
+ } catch (e) {
+ return callback(e);
+ }
+
+ if (FS.isDir(stat.mode)) {
+ return callback(null, { timestamp: stat.mtime, mode: stat.mode });
+ } else if (FS.isFile(stat.mode)) {
+ return callback(null, { timestamp: stat.mtime, mode: stat.mode, contents: node.contents });
+ } else {
+ return callback(new Error('node type not supported'));
+ }
+ },storeLocalEntry:function (path, entry, callback) {
+ try {
+ if (FS.isDir(entry.mode)) {
+ FS.mkdir(path, entry.mode);
+ } else if (FS.isFile(entry.mode)) {
+ FS.writeFile(path, entry.contents, { encoding: 'binary', canOwn: true });
+ } else {
+ return callback(new Error('node type not supported'));
+ }
+
+ FS.utime(path, entry.timestamp, entry.timestamp);
+ } catch (e) {
+ return callback(e);
+ }
+
+ callback(null);
+ },removeLocalEntry:function (path, callback) {
+ try {
+ var lookup = FS.lookupPath(path);
+ var stat = FS.stat(path);
+
+ if (FS.isDir(stat.mode)) {
+ FS.rmdir(path);
+ } else if (FS.isFile(stat.mode)) {
+ FS.unlink(path);
+ }
+ } catch (e) {
+ return callback(e);
+ }
+
+ callback(null);
+ },loadRemoteEntry:function (store, path, callback) {
+ var req = store.get(path);
+ req.onsuccess = function(event) { callback(null, event.target.result); };
+ req.onerror = function() { callback(this.error); };
+ },storeRemoteEntry:function (store, path, entry, callback) {
+ var req = store.put(entry, path);
+ req.onsuccess = function() { callback(null); };
+ req.onerror = function() { callback(this.error); };
+ },removeRemoteEntry:function (store, path, callback) {
+ var req = store.delete(path);
+ req.onsuccess = function() { callback(null); };
+ req.onerror = function() { callback(this.error); };
+ },reconcile:function (src, dst, callback) {
+ var total = 0;
+
+ var create = [];
+ Object.keys(src.entries).forEach(function (key) {
+ var e = src.entries[key];
+ var e2 = dst.entries[key];
+ if (!e2 || e.timestamp > e2.timestamp) {
+ create.push(key);
+ total++;
+ }
+ });
+
+ var remove = [];
+ Object.keys(dst.entries).forEach(function (key) {
+ var e = dst.entries[key];
+ var e2 = src.entries[key];
+ if (!e2) {
+ remove.push(key);
+ total++;
+ }
+ });
+
+ if (!total) {
+ return callback(null);
+ }
+
+ var errored = false;
+ var completed = 0;
+ var db = src.type === 'remote' ? src.db : dst.db;
+ var transaction = db.transaction([IDBFS.DB_STORE_NAME], 'readwrite');
+ var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
+
+ function done(err) {
+ if (err) {
+ if (!done.errored) {
+ done.errored = true;
+ return callback(err);
+ }
+ return;
+ }
+ if (++completed >= total) {
+ return callback(null);
+ }
+ };
+
+ transaction.onerror = function() { done(this.error); };
+
+ // sort paths in ascending order so directory entries are created
+ // before the files inside them
+ create.sort().forEach(function (path) {
+ if (dst.type === 'local') {
+ IDBFS.loadRemoteEntry(store, path, function (err, entry) {
+ if (err) return done(err);
+ IDBFS.storeLocalEntry(path, entry, done);
+ });
+ } else {
+ IDBFS.loadLocalEntry(path, function (err, entry) {
+ if (err) return done(err);
+ IDBFS.storeRemoteEntry(store, path, entry, done);
+ });
+ }
+ });
+
+ // sort paths in descending order so files are deleted before their
+ // parent directories
+ remove.sort().reverse().forEach(function(path) {
+ if (dst.type === 'local') {
+ IDBFS.removeLocalEntry(path, done);
+ } else {
+ IDBFS.removeRemoteEntry(store, path, done);
+ }
+ });
+ }};
+
+ var NODEFS={isWindows:false,staticInit:function () {
+ NODEFS.isWindows = !!process.platform.match(/^win/);
+ },mount:function (mount) {
+ assert(ENVIRONMENT_IS_NODE);
+ return NODEFS.createNode(null, '/', NODEFS.getMode(mount.opts.root), 0);
+ },createNode:function (parent, name, mode, dev) {
+ if (!FS.isDir(mode) && !FS.isFile(mode) && !FS.isLink(mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var node = FS.createNode(parent, name, mode);
+ node.node_ops = NODEFS.node_ops;
+ node.stream_ops = NODEFS.stream_ops;
+ return node;
+ },getMode:function (path) {
+ var stat;
+ try {
+ stat = fs.lstatSync(path);
+ if (NODEFS.isWindows) {
+ // On Windows, directories return permission bits 'rw-rw-rw-', even though they have 'rwxrwxrwx', so
+ // propagate write bits to execute bits.
+ stat.mode = stat.mode | ((stat.mode & 146) >> 1);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return stat.mode;
+ },realPath:function (node) {
+ var parts = [];
+ while (node.parent !== node) {
+ parts.push(node.name);
+ node = node.parent;
+ }
+ parts.push(node.mount.opts.root);
+ parts.reverse();
+ return PATH.join.apply(null, parts);
+ },flagsToPermissionStringMap:{0:"r",1:"r+",2:"r+",64:"r",65:"r+",66:"r+",129:"rx+",193:"rx+",514:"w+",577:"w",578:"w+",705:"wx",706:"wx+",1024:"a",1025:"a",1026:"a+",1089:"a",1090:"a+",1153:"ax",1154:"ax+",1217:"ax",1218:"ax+",4096:"rs",4098:"rs+"},flagsToPermissionString:function (flags) {
+ if (flags in NODEFS.flagsToPermissionStringMap) {
+ return NODEFS.flagsToPermissionStringMap[flags];
+ } else {
+ return flags;
+ }
+ },node_ops:{getattr:function (node) {
+ var path = NODEFS.realPath(node);
+ var stat;
+ try {
+ stat = fs.lstatSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ // node.js v0.10.20 doesn't report blksize and blocks on Windows. Fake them with default blksize of 4096.
+ // See http://support.microsoft.com/kb/140365
+ if (NODEFS.isWindows && !stat.blksize) {
+ stat.blksize = 4096;
+ }
+ if (NODEFS.isWindows && !stat.blocks) {
+ stat.blocks = (stat.size+stat.blksize-1)/stat.blksize|0;
+ }
+ return {
+ dev: stat.dev,
+ ino: stat.ino,
+ mode: stat.mode,
+ nlink: stat.nlink,
+ uid: stat.uid,
+ gid: stat.gid,
+ rdev: stat.rdev,
+ size: stat.size,
+ atime: stat.atime,
+ mtime: stat.mtime,
+ ctime: stat.ctime,
+ blksize: stat.blksize,
+ blocks: stat.blocks
+ };
+ },setattr:function (node, attr) {
+ var path = NODEFS.realPath(node);
+ try {
+ if (attr.mode !== undefined) {
+ fs.chmodSync(path, attr.mode);
+ // update the common node structure mode as well
+ node.mode = attr.mode;
+ }
+ if (attr.timestamp !== undefined) {
+ var date = new Date(attr.timestamp);
+ fs.utimesSync(path, date, date);
+ }
+ if (attr.size !== undefined) {
+ fs.truncateSync(path, attr.size);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },lookup:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ var mode = NODEFS.getMode(path);
+ return NODEFS.createNode(parent, name, mode);
+ },mknod:function (parent, name, mode, dev) {
+ var node = NODEFS.createNode(parent, name, mode, dev);
+ // create the backing node for this in the fs root as well
+ var path = NODEFS.realPath(node);
+ try {
+ if (FS.isDir(node.mode)) {
+ fs.mkdirSync(path, node.mode);
+ } else {
+ fs.writeFileSync(path, '', { mode: node.mode });
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return node;
+ },rename:function (oldNode, newDir, newName) {
+ var oldPath = NODEFS.realPath(oldNode);
+ var newPath = PATH.join2(NODEFS.realPath(newDir), newName);
+ try {
+ fs.renameSync(oldPath, newPath);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },unlink:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ try {
+ fs.unlinkSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },rmdir:function (parent, name) {
+ var path = PATH.join2(NODEFS.realPath(parent), name);
+ try {
+ fs.rmdirSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },readdir:function (node) {
+ var path = NODEFS.realPath(node);
+ try {
+ return fs.readdirSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },symlink:function (parent, newName, oldPath) {
+ var newPath = PATH.join2(NODEFS.realPath(parent), newName);
+ try {
+ fs.symlinkSync(oldPath, newPath);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },readlink:function (node) {
+ var path = NODEFS.realPath(node);
+ try {
+ return fs.readlinkSync(path);
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ }},stream_ops:{open:function (stream) {
+ var path = NODEFS.realPath(stream.node);
+ try {
+ if (FS.isFile(stream.node.mode)) {
+ stream.nfd = fs.openSync(path, NODEFS.flagsToPermissionString(stream.flags));
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },close:function (stream) {
+ try {
+ if (FS.isFile(stream.node.mode) && stream.nfd) {
+ fs.closeSync(stream.nfd);
+ }
+ } catch (e) {
+ if (!e.code) throw e;
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ },read:function (stream, buffer, offset, length, position) {
+ // FIXME this is terrible.
+ var nbuffer = new Buffer(length);
+ var res;
+ try {
+ res = fs.readSync(stream.nfd, nbuffer, 0, length, position);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ if (res > 0) {
+ for (var i = 0; i < res; i++) {
+ buffer[offset + i] = nbuffer[i];
+ }
+ }
+ return res;
+ },write:function (stream, buffer, offset, length, position) {
+ // FIXME this is terrible.
+ var nbuffer = new Buffer(buffer.subarray(offset, offset + length));
+ var res;
+ try {
+ res = fs.writeSync(stream.nfd, nbuffer, 0, length, position);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ return res;
+ },llseek:function (stream, offset, whence) {
+ var position = offset;
+ if (whence === 1) { // SEEK_CUR.
+ position += stream.position;
+ } else if (whence === 2) { // SEEK_END.
+ if (FS.isFile(stream.node.mode)) {
+ try {
+ var stat = fs.fstatSync(stream.nfd);
+ position += stat.size;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+ }
+ }
+ }
+
+ if (position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+
+ stream.position = position;
+ return position;
+ }}};
+
+ var _stdin=allocate(1, "i32*", ALLOC_STATIC);
+
+ var _stdout=allocate(1, "i32*", ALLOC_STATIC);
+
+ var _stderr=allocate(1, "i32*", ALLOC_STATIC);
+
+ function _fflush(stream) {
+ // int fflush(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fflush.html
+ // we don't currently perform any user-space buffering of data
+ }var FS={root:null,mounts:[],devices:[null],streams:[],nextInode:1,nameTable:null,currentPath:"/",initialized:false,ignorePermissions:true,ErrnoError:null,genericErrors:{},handleFSError:function (e) {
+ if (!(e instanceof FS.ErrnoError)) throw e + ' : ' + stackTrace();
+ return ___setErrNo(e.errno);
+ },lookupPath:function (path, opts) {
+ path = PATH.resolve(FS.cwd(), path);
+ opts = opts || {};
+
+ var defaults = {
+ follow_mount: true,
+ recurse_count: 0
+ };
+ for (var key in defaults) {
+ if (opts[key] === undefined) {
+ opts[key] = defaults[key];
+ }
+ }
+
+ if (opts.recurse_count > 8) { // max recursive lookup of 8
+ throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
+ }
+
+ // split the path
+ var parts = PATH.normalizeArray(path.split('/').filter(function(p) {
+ return !!p;
+ }), false);
+
+ // start at the root
+ var current = FS.root;
+ var current_path = '/';
+
+ for (var i = 0; i < parts.length; i++) {
+ var islast = (i === parts.length-1);
+ if (islast && opts.parent) {
+ // stop resolving
+ break;
+ }
+
+ current = FS.lookupNode(current, parts[i]);
+ current_path = PATH.join2(current_path, parts[i]);
+
+ // jump to the mount's root node if this is a mountpoint
+ if (FS.isMountpoint(current)) {
+ if (!islast || (islast && opts.follow_mount)) {
+ current = current.mounted.root;
+ }
+ }
+
+ // by default, lookupPath will not follow a symlink if it is the final path component.
+ // setting opts.follow = true will override this behavior.
+ if (!islast || opts.follow) {
+ var count = 0;
+ while (FS.isLink(current.mode)) {
+ var link = FS.readlink(current_path);
+ current_path = PATH.resolve(PATH.dirname(current_path), link);
+
+ var lookup = FS.lookupPath(current_path, { recurse_count: opts.recurse_count });
+ current = lookup.node;
+
+ if (count++ > 40) { // limit max consecutive symlinks to 40 (SYMLOOP_MAX).
+ throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
+ }
+ }
+ }
+ }
+
+ return { path: current_path, node: current };
+ },getPath:function (node) {
+ var path;
+ while (true) {
+ if (FS.isRoot(node)) {
+ var mount = node.mount.mountpoint;
+ if (!path) return mount;
+ return mount[mount.length-1] !== '/' ? mount + '/' + path : mount + path;
+ }
+ path = path ? node.name + '/' + path : node.name;
+ node = node.parent;
+ }
+ },hashName:function (parentid, name) {
+ var hash = 0;
+
+
+ for (var i = 0; i < name.length; i++) {
+ hash = ((hash << 5) - hash + name.charCodeAt(i)) | 0;
+ }
+ return ((parentid + hash) >>> 0) % FS.nameTable.length;
+ },hashAddNode:function (node) {
+ var hash = FS.hashName(node.parent.id, node.name);
+ node.name_next = FS.nameTable[hash];
+ FS.nameTable[hash] = node;
+ },hashRemoveNode:function (node) {
+ var hash = FS.hashName(node.parent.id, node.name);
+ if (FS.nameTable[hash] === node) {
+ FS.nameTable[hash] = node.name_next;
+ } else {
+ var current = FS.nameTable[hash];
+ while (current) {
+ if (current.name_next === node) {
+ current.name_next = node.name_next;
+ break;
+ }
+ current = current.name_next;
+ }
+ }
+ },lookupNode:function (parent, name) {
+ var err = FS.mayLookup(parent);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ var hash = FS.hashName(parent.id, name);
+ for (var node = FS.nameTable[hash]; node; node = node.name_next) {
+ var nodeName = node.name;
+ if (node.parent.id === parent.id && nodeName === name) {
+ return node;
+ }
+ }
+ // if we failed to find it in the cache, call into the VFS
+ return FS.lookup(parent, name);
+ },createNode:function (parent, name, mode, rdev) {
+ if (!FS.FSNode) {
+ FS.FSNode = function(parent, name, mode, rdev) {
+ if (!parent) {
+ parent = this; // root node sets parent to itself
+ }
+ this.parent = parent;
+ this.mount = parent.mount;
+ this.mounted = null;
+ this.id = FS.nextInode++;
+ this.name = name;
+ this.mode = mode;
+ this.node_ops = {};
+ this.stream_ops = {};
+ this.rdev = rdev;
+ };
+
+ FS.FSNode.prototype = {};
+
+ // compatibility
+ var readMode = 292 | 73;
+ var writeMode = 146;
+
+ // NOTE we must use Object.defineProperties instead of individual calls to
+ // Object.defineProperty in order to make closure compiler happy
+ Object.defineProperties(FS.FSNode.prototype, {
+ read: {
+ get: function() { return (this.mode & readMode) === readMode; },
+ set: function(val) { val ? this.mode |= readMode : this.mode &= ~readMode; }
+ },
+ write: {
+ get: function() { return (this.mode & writeMode) === writeMode; },
+ set: function(val) { val ? this.mode |= writeMode : this.mode &= ~writeMode; }
+ },
+ isFolder: {
+ get: function() { return FS.isDir(this.mode); },
+ },
+ isDevice: {
+ get: function() { return FS.isChrdev(this.mode); },
+ },
+ });
+ }
+
+ var node = new FS.FSNode(parent, name, mode, rdev);
+
+ FS.hashAddNode(node);
+
+ return node;
+ },destroyNode:function (node) {
+ FS.hashRemoveNode(node);
+ },isRoot:function (node) {
+ return node === node.parent;
+ },isMountpoint:function (node) {
+ return !!node.mounted;
+ },isFile:function (mode) {
+ return (mode & 61440) === 32768;
+ },isDir:function (mode) {
+ return (mode & 61440) === 16384;
+ },isLink:function (mode) {
+ return (mode & 61440) === 40960;
+ },isChrdev:function (mode) {
+ return (mode & 61440) === 8192;
+ },isBlkdev:function (mode) {
+ return (mode & 61440) === 24576;
+ },isFIFO:function (mode) {
+ return (mode & 61440) === 4096;
+ },isSocket:function (mode) {
+ return (mode & 49152) === 49152;
+ },flagModes:{"r":0,"rs":1052672,"r+":2,"w":577,"wx":705,"xw":705,"w+":578,"wx+":706,"xw+":706,"a":1089,"ax":1217,"xa":1217,"a+":1090,"ax+":1218,"xa+":1218},modeStringToFlags:function (str) {
+ var flags = FS.flagModes[str];
+ if (typeof flags === 'undefined') {
+ throw new Error('Unknown file open mode: ' + str);
+ }
+ return flags;
+ },flagsToPermissionString:function (flag) {
+ var accmode = flag & 2097155;
+ var perms = ['r', 'w', 'rw'][accmode];
+ if ((flag & 512)) {
+ perms += 'w';
+ }
+ return perms;
+ },nodePermissions:function (node, perms) {
+ if (FS.ignorePermissions) {
+ return 0;
+ }
+ // return 0 if any user, group or owner bits are set.
+ if (perms.indexOf('r') !== -1 && !(node.mode & 292)) {
+ return ERRNO_CODES.EACCES;
+ } else if (perms.indexOf('w') !== -1 && !(node.mode & 146)) {
+ return ERRNO_CODES.EACCES;
+ } else if (perms.indexOf('x') !== -1 && !(node.mode & 73)) {
+ return ERRNO_CODES.EACCES;
+ }
+ return 0;
+ },mayLookup:function (dir) {
+ return FS.nodePermissions(dir, 'x');
+ },mayCreate:function (dir, name) {
+ try {
+ var node = FS.lookupNode(dir, name);
+ return ERRNO_CODES.EEXIST;
+ } catch (e) {
+ }
+ return FS.nodePermissions(dir, 'wx');
+ },mayDelete:function (dir, name, isdir) {
+ var node;
+ try {
+ node = FS.lookupNode(dir, name);
+ } catch (e) {
+ return e.errno;
+ }
+ var err = FS.nodePermissions(dir, 'wx');
+ if (err) {
+ return err;
+ }
+ if (isdir) {
+ if (!FS.isDir(node.mode)) {
+ return ERRNO_CODES.ENOTDIR;
+ }
+ if (FS.isRoot(node) || FS.getPath(node) === FS.cwd()) {
+ return ERRNO_CODES.EBUSY;
+ }
+ } else {
+ if (FS.isDir(node.mode)) {
+ return ERRNO_CODES.EISDIR;
+ }
+ }
+ return 0;
+ },mayOpen:function (node, flags) {
+ if (!node) {
+ return ERRNO_CODES.ENOENT;
+ }
+ if (FS.isLink(node.mode)) {
+ return ERRNO_CODES.ELOOP;
+ } else if (FS.isDir(node.mode)) {
+ if ((flags & 2097155) !== 0 || // opening for write
+ (flags & 512)) {
+ return ERRNO_CODES.EISDIR;
+ }
+ }
+ return FS.nodePermissions(node, FS.flagsToPermissionString(flags));
+ },MAX_OPEN_FDS:4096,nextfd:function (fd_start, fd_end) {
+ fd_start = fd_start || 0;
+ fd_end = fd_end || FS.MAX_OPEN_FDS;
+ for (var fd = fd_start; fd <= fd_end; fd++) {
+ if (!FS.streams[fd]) {
+ return fd;
+ }
+ }
+ throw new FS.ErrnoError(ERRNO_CODES.EMFILE);
+ },getStream:function (fd) {
+ return FS.streams[fd];
+ },createStream:function (stream, fd_start, fd_end) {
+ if (!FS.FSStream) {
+ FS.FSStream = function(){};
+ FS.FSStream.prototype = {};
+ // compatibility
+ Object.defineProperties(FS.FSStream.prototype, {
+ object: {
+ get: function() { return this.node; },
+ set: function(val) { this.node = val; }
+ },
+ isRead: {
+ get: function() { return (this.flags & 2097155) !== 1; }
+ },
+ isWrite: {
+ get: function() { return (this.flags & 2097155) !== 0; }
+ },
+ isAppend: {
+ get: function() { return (this.flags & 1024); }
+ }
+ });
+ }
+ if (0) {
+ // reuse the object
+ stream.__proto__ = FS.FSStream.prototype;
+ } else {
+ var newStream = new FS.FSStream();
+ for (var p in stream) {
+ newStream[p] = stream[p];
+ }
+ stream = newStream;
+ }
+ var fd = FS.nextfd(fd_start, fd_end);
+ stream.fd = fd;
+ FS.streams[fd] = stream;
+ return stream;
+ },closeStream:function (fd) {
+ FS.streams[fd] = null;
+ },getStreamFromPtr:function (ptr) {
+ return FS.streams[ptr - 1];
+ },getPtrForStream:function (stream) {
+ return stream ? stream.fd + 1 : 0;
+ },chrdev_stream_ops:{open:function (stream) {
+ var device = FS.getDevice(stream.node.rdev);
+ // override node's stream ops with the device's
+ stream.stream_ops = device.stream_ops;
+ // forward the open call
+ if (stream.stream_ops.open) {
+ stream.stream_ops.open(stream);
+ }
+ },llseek:function () {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }},major:function (dev) {
+ return ((dev) >> 8);
+ },minor:function (dev) {
+ return ((dev) & 0xff);
+ },makedev:function (ma, mi) {
+ return ((ma) << 8 | (mi));
+ },registerDevice:function (dev, ops) {
+ FS.devices[dev] = { stream_ops: ops };
+ },getDevice:function (dev) {
+ return FS.devices[dev];
+ },getMounts:function (mount) {
+ var mounts = [];
+ var check = [mount];
+
+ while (check.length) {
+ var m = check.pop();
+
+ mounts.push(m);
+
+ check.push.apply(check, m.mounts);
+ }
+
+ return mounts;
+ },syncfs:function (populate, callback) {
+ if (typeof(populate) === 'function') {
+ callback = populate;
+ populate = false;
+ }
+
+ var mounts = FS.getMounts(FS.root.mount);
+ var completed = 0;
+
+ function done(err) {
+ if (err) {
+ if (!done.errored) {
+ done.errored = true;
+ return callback(err);
+ }
+ return;
+ }
+ if (++completed >= mounts.length) {
+ callback(null);
+ }
+ };
+
+ // sync all mounts
+ mounts.forEach(function (mount) {
+ if (!mount.type.syncfs) {
+ return done(null);
+ }
+ mount.type.syncfs(mount, populate, done);
+ });
+ },mount:function (type, opts, mountpoint) {
+ var root = mountpoint === '/';
+ var pseudo = !mountpoint;
+ var node;
+
+ if (root && FS.root) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ } else if (!root && !pseudo) {
+ var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
+
+ mountpoint = lookup.path; // use the absolute path
+ node = lookup.node;
+
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+
+ if (!FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ }
+
+ var mount = {
+ type: type,
+ opts: opts,
+ mountpoint: mountpoint,
+ mounts: []
+ };
+
+ // create a root node for the fs
+ var mountRoot = type.mount(mount);
+ mountRoot.mount = mount;
+ mount.root = mountRoot;
+
+ if (root) {
+ FS.root = mountRoot;
+ } else if (node) {
+ // set as a mountpoint
+ node.mounted = mount;
+
+ // add the new mount to the current mount's children
+ if (node.mount) {
+ node.mount.mounts.push(mount);
+ }
+ }
+
+ return mountRoot;
+ },unmount:function (mountpoint) {
+ var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
+
+ if (!FS.isMountpoint(lookup.node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+
+ // destroy the nodes for this mount, and all its child mounts
+ var node = lookup.node;
+ var mount = node.mounted;
+ var mounts = FS.getMounts(mount);
+
+ Object.keys(FS.nameTable).forEach(function (hash) {
+ var current = FS.nameTable[hash];
+
+ while (current) {
+ var next = current.name_next;
+
+ if (mounts.indexOf(current.mount) !== -1) {
+ FS.destroyNode(current);
+ }
+
+ current = next;
+ }
+ });
+
+ // no longer a mountpoint
+ node.mounted = null;
+
+ // remove this mount from the child mounts
+ var idx = node.mount.mounts.indexOf(mount);
+ assert(idx !== -1);
+ node.mount.mounts.splice(idx, 1);
+ },lookup:function (parent, name) {
+ return parent.node_ops.lookup(parent, name);
+ },mknod:function (path, mode, dev) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var err = FS.mayCreate(parent, name);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.mknod) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return parent.node_ops.mknod(parent, name, mode, dev);
+ },create:function (path, mode) {
+ mode = mode !== undefined ? mode : 438 /* 0666 */;
+ mode &= 4095;
+ mode |= 32768;
+ return FS.mknod(path, mode, 0);
+ },mkdir:function (path, mode) {
+ mode = mode !== undefined ? mode : 511 /* 0777 */;
+ mode &= 511 | 512;
+ mode |= 16384;
+ return FS.mknod(path, mode, 0);
+ },mkdev:function (path, mode, dev) {
+ if (typeof(dev) === 'undefined') {
+ dev = mode;
+ mode = 438 /* 0666 */;
+ }
+ mode |= 8192;
+ return FS.mknod(path, mode, dev);
+ },symlink:function (oldpath, newpath) {
+ var lookup = FS.lookupPath(newpath, { parent: true });
+ var parent = lookup.node;
+ var newname = PATH.basename(newpath);
+ var err = FS.mayCreate(parent, newname);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.symlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return parent.node_ops.symlink(parent, newname, oldpath);
+ },rename:function (old_path, new_path) {
+ var old_dirname = PATH.dirname(old_path);
+ var new_dirname = PATH.dirname(new_path);
+ var old_name = PATH.basename(old_path);
+ var new_name = PATH.basename(new_path);
+ // parents must exist
+ var lookup, old_dir, new_dir;
+ try {
+ lookup = FS.lookupPath(old_path, { parent: true });
+ old_dir = lookup.node;
+ lookup = FS.lookupPath(new_path, { parent: true });
+ new_dir = lookup.node;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ // need to be part of the same mount
+ if (old_dir.mount !== new_dir.mount) {
+ throw new FS.ErrnoError(ERRNO_CODES.EXDEV);
+ }
+ // source must exist
+ var old_node = FS.lookupNode(old_dir, old_name);
+ // old path should not be an ancestor of the new path
+ var relative = PATH.relative(old_path, new_dirname);
+ if (relative.charAt(0) !== '.') {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ // new path should not be an ancestor of the old path
+ relative = PATH.relative(new_path, old_dirname);
+ if (relative.charAt(0) !== '.') {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+ }
+ // see if the new path already exists
+ var new_node;
+ try {
+ new_node = FS.lookupNode(new_dir, new_name);
+ } catch (e) {
+ // not fatal
+ }
+ // early out if nothing needs to change
+ if (old_node === new_node) {
+ return;
+ }
+ // we'll need to delete the old entry
+ var isdir = FS.isDir(old_node.mode);
+ var err = FS.mayDelete(old_dir, old_name, isdir);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ // need delete permissions if we'll be overwriting.
+ // need create permissions if new doesn't already exist.
+ err = new_node ?
+ FS.mayDelete(new_dir, new_name, isdir) :
+ FS.mayCreate(new_dir, new_name);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!old_dir.node_ops.rename) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(old_node) || (new_node && FS.isMountpoint(new_node))) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ // if we are going to change the parent, check write permissions
+ if (new_dir !== old_dir) {
+ err = FS.nodePermissions(old_dir, 'w');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ }
+ // remove the node from the lookup hash
+ FS.hashRemoveNode(old_node);
+ // do the underlying fs rename
+ try {
+ old_dir.node_ops.rename(old_node, new_dir, new_name);
+ } catch (e) {
+ throw e;
+ } finally {
+ // add the node back to the hash (in case node_ops.rename
+ // changed its name)
+ FS.hashAddNode(old_node);
+ }
+ },rmdir:function (path) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var node = FS.lookupNode(parent, name);
+ var err = FS.mayDelete(parent, name, true);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.rmdir) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ parent.node_ops.rmdir(parent, name);
+ FS.destroyNode(node);
+ },readdir:function (path) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ var node = lookup.node;
+ if (!node.node_ops.readdir) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ return node.node_ops.readdir(node);
+ },unlink:function (path) {
+ var lookup = FS.lookupPath(path, { parent: true });
+ var parent = lookup.node;
+ var name = PATH.basename(path);
+ var node = FS.lookupNode(parent, name);
+ var err = FS.mayDelete(parent, name, false);
+ if (err) {
+ // POSIX says unlink should set EPERM, not EISDIR
+ if (err === ERRNO_CODES.EISDIR) err = ERRNO_CODES.EPERM;
+ throw new FS.ErrnoError(err);
+ }
+ if (!parent.node_ops.unlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isMountpoint(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+ }
+ parent.node_ops.unlink(parent, name);
+ FS.destroyNode(node);
+ },readlink:function (path) {
+ var lookup = FS.lookupPath(path);
+ var link = lookup.node;
+ if (!link.node_ops.readlink) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ return link.node_ops.readlink(link);
+ },stat:function (path, dontFollow) {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ var node = lookup.node;
+ if (!node.node_ops.getattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ return node.node_ops.getattr(node);
+ },lstat:function (path) {
+ return FS.stat(path, true);
+ },chmod:function (path, mode, dontFollow) {
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ node.node_ops.setattr(node, {
+ mode: (mode & 4095) | (node.mode & ~4095),
+ timestamp: Date.now()
+ });
+ },lchmod:function (path, mode) {
+ FS.chmod(path, mode, true);
+ },fchmod:function (fd, mode) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ FS.chmod(stream.node, mode);
+ },chown:function (path, uid, gid, dontFollow) {
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: !dontFollow });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ node.node_ops.setattr(node, {
+ timestamp: Date.now()
+ // we ignore the uid / gid for now
+ });
+ },lchown:function (path, uid, gid) {
+ FS.chown(path, uid, gid, true);
+ },fchown:function (fd, uid, gid) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ FS.chown(stream.node, uid, gid);
+ },truncate:function (path, len) {
+ if (len < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var node;
+ if (typeof path === 'string') {
+ var lookup = FS.lookupPath(path, { follow: true });
+ node = lookup.node;
+ } else {
+ node = path;
+ }
+ if (!node.node_ops.setattr) {
+ throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+ }
+ if (FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!FS.isFile(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var err = FS.nodePermissions(node, 'w');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ node.node_ops.setattr(node, {
+ size: len,
+ timestamp: Date.now()
+ });
+ },ftruncate:function (fd, len) {
+ var stream = FS.getStream(fd);
+ if (!stream) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ FS.truncate(stream.node, len);
+ },utime:function (path, atime, mtime) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ var node = lookup.node;
+ node.node_ops.setattr(node, {
+ timestamp: Math.max(atime, mtime)
+ });
+ },open:function (path, flags, mode, fd_start, fd_end) {
+ flags = typeof flags === 'string' ? FS.modeStringToFlags(flags) : flags;
+ mode = typeof mode === 'undefined' ? 438 /* 0666 */ : mode;
+ if ((flags & 64)) {
+ mode = (mode & 4095) | 32768;
+ } else {
+ mode = 0;
+ }
+ var node;
+ if (typeof path === 'object') {
+ node = path;
+ } else {
+ path = PATH.normalize(path);
+ try {
+ var lookup = FS.lookupPath(path, {
+ follow: !(flags & 131072)
+ });
+ node = lookup.node;
+ } catch (e) {
+ // ignore
+ }
+ }
+ // perhaps we need to create the node
+ if ((flags & 64)) {
+ if (node) {
+ // if O_CREAT and O_EXCL are set, error out if the node already exists
+ if ((flags & 128)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EEXIST);
+ }
+ } else {
+ // node doesn't exist, try to create it
+ node = FS.mknod(path, mode, 0);
+ }
+ }
+ if (!node) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
+ }
+ // can't truncate a device
+ if (FS.isChrdev(node.mode)) {
+ flags &= ~512;
+ }
+ // check permissions
+ var err = FS.mayOpen(node, flags);
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ // do truncation if necessary
+ if ((flags & 512)) {
+ FS.truncate(node, 0);
+ }
+ // we've already handled these, don't pass down to the underlying vfs
+ flags &= ~(128 | 512);
+
+ // register the stream with the filesystem
+ var stream = FS.createStream({
+ node: node,
+ path: FS.getPath(node), // we want the absolute path to the node
+ flags: flags,
+ seekable: true,
+ position: 0,
+ stream_ops: node.stream_ops,
+ // used by the file family libc calls (fopen, fwrite, ferror, etc.)
+ ungotten: [],
+ error: false
+ }, fd_start, fd_end);
+ // call the new stream's open function
+ if (stream.stream_ops.open) {
+ stream.stream_ops.open(stream);
+ }
+ if (Module['logReadFiles'] && !(flags & 1)) {
+ if (!FS.readFiles) FS.readFiles = {};
+ if (!(path in FS.readFiles)) {
+ FS.readFiles[path] = 1;
+ Module['printErr']('read file: ' + path);
+ }
+ }
+ return stream;
+ },close:function (stream) {
+ try {
+ if (stream.stream_ops.close) {
+ stream.stream_ops.close(stream);
+ }
+ } catch (e) {
+ throw e;
+ } finally {
+ FS.closeStream(stream.fd);
+ }
+ },llseek:function (stream, offset, whence) {
+ if (!stream.seekable || !stream.stream_ops.llseek) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ return stream.stream_ops.llseek(stream, offset, whence);
+ },read:function (stream, buffer, offset, length, position) {
+ if (length < 0 || position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 1) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (FS.isDir(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!stream.stream_ops.read) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var seeking = true;
+ if (typeof position === 'undefined') {
+ position = stream.position;
+ seeking = false;
+ } else if (!stream.seekable) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ var bytesRead = stream.stream_ops.read(stream, buffer, offset, length, position);
+ if (!seeking) stream.position += bytesRead;
+ return bytesRead;
+ },write:function (stream, buffer, offset, length, position, canOwn) {
+ if (length < 0 || position < 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (FS.isDir(stream.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+ }
+ if (!stream.stream_ops.write) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var seeking = true;
+ if (typeof position === 'undefined') {
+ position = stream.position;
+ seeking = false;
+ } else if (!stream.seekable) {
+ throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+ }
+ if (stream.flags & 1024) {
+ // seek to the end before writing in append mode
+ FS.llseek(stream, 0, 2);
+ }
+ var bytesWritten = stream.stream_ops.write(stream, buffer, offset, length, position, canOwn);
+ if (!seeking) stream.position += bytesWritten;
+ return bytesWritten;
+ },allocate:function (stream, offset, length) {
+ if (offset < 0 || length <= 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ if ((stream.flags & 2097155) === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+ }
+ if (!FS.isFile(stream.node.mode) && !FS.isDir(node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ if (!stream.stream_ops.allocate) {
+ throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
+ }
+ stream.stream_ops.allocate(stream, offset, length);
+ },mmap:function (stream, buffer, offset, length, position, prot, flags) {
+ // TODO if PROT is PROT_WRITE, make sure we have write access
+ if ((stream.flags & 2097155) === 1) {
+ throw new FS.ErrnoError(ERRNO_CODES.EACCES);
+ }
+ if (!stream.stream_ops.mmap) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+ }
+ return stream.stream_ops.mmap(stream, buffer, offset, length, position, prot, flags);
+ },ioctl:function (stream, cmd, arg) {
+ if (!stream.stream_ops.ioctl) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTTY);
+ }
+ return stream.stream_ops.ioctl(stream, cmd, arg);
+ },readFile:function (path, opts) {
+ opts = opts || {};
+ opts.flags = opts.flags || 'r';
+ opts.encoding = opts.encoding || 'binary';
+ if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
+ throw new Error('Invalid encoding type "' + opts.encoding + '"');
+ }
+ var ret;
+ var stream = FS.open(path, opts.flags);
+ var stat = FS.stat(path);
+ var length = stat.size;
+ var buf = new Uint8Array(length);
+ FS.read(stream, buf, 0, length, 0);
+ if (opts.encoding === 'utf8') {
+ ret = '';
+ var utf8 = new Runtime.UTF8Processor();
+ for (var i = 0; i < length; i++) {
+ ret += utf8.processCChar(buf[i]);
+ }
+ } else if (opts.encoding === 'binary') {
+ ret = buf;
+ }
+ FS.close(stream);
+ return ret;
+ },writeFile:function (path, data, opts) {
+ opts = opts || {};
+ opts.flags = opts.flags || 'w';
+ opts.encoding = opts.encoding || 'utf8';
+ if (opts.encoding !== 'utf8' && opts.encoding !== 'binary') {
+ throw new Error('Invalid encoding type "' + opts.encoding + '"');
+ }
+ var stream = FS.open(path, opts.flags, opts.mode);
+ if (opts.encoding === 'utf8') {
+ var utf8 = new Runtime.UTF8Processor();
+ var buf = new Uint8Array(utf8.processJSString(data));
+ FS.write(stream, buf, 0, buf.length, 0, opts.canOwn);
+ } else if (opts.encoding === 'binary') {
+ FS.write(stream, data, 0, data.length, 0, opts.canOwn);
+ }
+ FS.close(stream);
+ },cwd:function () {
+ return FS.currentPath;
+ },chdir:function (path) {
+ var lookup = FS.lookupPath(path, { follow: true });
+ if (!FS.isDir(lookup.node.mode)) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+ }
+ var err = FS.nodePermissions(lookup.node, 'x');
+ if (err) {
+ throw new FS.ErrnoError(err);
+ }
+ FS.currentPath = lookup.path;
+ },createDefaultDirectories:function () {
+ FS.mkdir('/tmp');
+ },createDefaultDevices:function () {
+ // create /dev
+ FS.mkdir('/dev');
+ // setup /dev/null
+ FS.registerDevice(FS.makedev(1, 3), {
+ read: function() { return 0; },
+ write: function() { return 0; }
+ });
+ FS.mkdev('/dev/null', FS.makedev(1, 3));
+ // setup /dev/tty and /dev/tty1
+ // stderr needs to print output using Module['printErr']
+ // so we register a second tty just for it.
+ TTY.register(FS.makedev(5, 0), TTY.default_tty_ops);
+ TTY.register(FS.makedev(6, 0), TTY.default_tty1_ops);
+ FS.mkdev('/dev/tty', FS.makedev(5, 0));
+ FS.mkdev('/dev/tty1', FS.makedev(6, 0));
+ // we're not going to emulate the actual shm device,
+ // just create the tmp dirs that reside in it commonly
+ FS.mkdir('/dev/shm');
+ FS.mkdir('/dev/shm/tmp');
+ },createStandardStreams:function () {
+ // TODO deprecate the old functionality of a single
+ // input / output callback and that utilizes FS.createDevice
+ // and instead require a unique set of stream ops
+
+ // by default, we symlink the standard streams to the
+ // default tty devices. however, if the standard streams
+ // have been overwritten we create a unique device for
+ // them instead.
+ if (Module['stdin']) {
+ FS.createDevice('/dev', 'stdin', Module['stdin']);
+ } else {
+ FS.symlink('/dev/tty', '/dev/stdin');
+ }
+ if (Module['stdout']) {
+ FS.createDevice('/dev', 'stdout', null, Module['stdout']);
+ } else {
+ FS.symlink('/dev/tty', '/dev/stdout');
+ }
+ if (Module['stderr']) {
+ FS.createDevice('/dev', 'stderr', null, Module['stderr']);
+ } else {
+ FS.symlink('/dev/tty1', '/dev/stderr');
+ }
+
+ // open default streams for the stdin, stdout and stderr devices
+ var stdin = FS.open('/dev/stdin', 'r');
+ HEAP32[((_stdin)>>2)]=FS.getPtrForStream(stdin);
+ assert(stdin.fd === 0, 'invalid handle for stdin (' + stdin.fd + ')');
+
+ var stdout = FS.open('/dev/stdout', 'w');
+ HEAP32[((_stdout)>>2)]=FS.getPtrForStream(stdout);
+ assert(stdout.fd === 1, 'invalid handle for stdout (' + stdout.fd + ')');
+
+ var stderr = FS.open('/dev/stderr', 'w');
+ HEAP32[((_stderr)>>2)]=FS.getPtrForStream(stderr);
+ assert(stderr.fd === 2, 'invalid handle for stderr (' + stderr.fd + ')');
+ },ensureErrnoError:function () {
+ if (FS.ErrnoError) return;
+ FS.ErrnoError = function ErrnoError(errno) {
+ this.errno = errno;
+ for (var key in ERRNO_CODES) {
+ if (ERRNO_CODES[key] === errno) {
+ this.code = key;
+ break;
+ }
+ }
+ this.message = ERRNO_MESSAGES[errno];
+ };
+ FS.ErrnoError.prototype = new Error();
+ FS.ErrnoError.prototype.constructor = FS.ErrnoError;
+ // Some errors may happen quite a bit, to avoid overhead we reuse them (and suffer a lack of stack info)
+ [ERRNO_CODES.ENOENT].forEach(function(code) {
+ FS.genericErrors[code] = new FS.ErrnoError(code);
+ FS.genericErrors[code].stack = '<generic error, no stack>';
+ });
+ },staticInit:function () {
+ FS.ensureErrnoError();
+
+ FS.nameTable = new Array(4096);
+
+ FS.mount(MEMFS, {}, '/');
+
+ FS.createDefaultDirectories();
+ FS.createDefaultDevices();
+ },init:function (input, output, error) {
+ assert(!FS.init.initialized, 'FS.init was previously called. If you want to initialize later with custom parameters, remove any earlier calls (note that one is automatically added to the generated code)');
+ FS.init.initialized = true;
+
+ FS.ensureErrnoError();
+
+ // Allow Module.stdin etc. to provide defaults, if none explicitly passed to us here
+ Module['stdin'] = input || Module['stdin'];
+ Module['stdout'] = output || Module['stdout'];
+ Module['stderr'] = error || Module['stderr'];
+
+ FS.createStandardStreams();
+ },quit:function () {
+ FS.init.initialized = false;
+ for (var i = 0; i < FS.streams.length; i++) {
+ var stream = FS.streams[i];
+ if (!stream) {
+ continue;
+ }
+ FS.close(stream);
+ }
+ },getMode:function (canRead, canWrite) {
+ var mode = 0;
+ if (canRead) mode |= 292 | 73;
+ if (canWrite) mode |= 146;
+ return mode;
+ },joinPath:function (parts, forceRelative) {
+ var path = PATH.join.apply(null, parts);
+ if (forceRelative && path[0] == '/') path = path.substr(1);
+ return path;
+ },absolutePath:function (relative, base) {
+ return PATH.resolve(base, relative);
+ },standardizePath:function (path) {
+ return PATH.normalize(path);
+ },findObject:function (path, dontResolveLastLink) {
+ var ret = FS.analyzePath(path, dontResolveLastLink);
+ if (ret.exists) {
+ return ret.object;
+ } else {
+ ___setErrNo(ret.error);
+ return null;
+ }
+ },analyzePath:function (path, dontResolveLastLink) {
+ // operate from within the context of the symlink's target
+ try {
+ var lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
+ path = lookup.path;
+ } catch (e) {
+ }
+ var ret = {
+ isRoot: false, exists: false, error: 0, name: null, path: null, object: null,
+ parentExists: false, parentPath: null, parentObject: null
+ };
+ try {
+ var lookup = FS.lookupPath(path, { parent: true });
+ ret.parentExists = true;
+ ret.parentPath = lookup.path;
+ ret.parentObject = lookup.node;
+ ret.name = PATH.basename(path);
+ lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
+ ret.exists = true;
+ ret.path = lookup.path;
+ ret.object = lookup.node;
+ ret.name = lookup.node.name;
+ ret.isRoot = lookup.path === '/';
+ } catch (e) {
+ ret.error = e.errno;
+ };
+ return ret;
+ },createFolder:function (parent, name, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(canRead, canWrite);
+ return FS.mkdir(path, mode);
+ },createPath:function (parent, path, canRead, canWrite) {
+ parent = typeof parent === 'string' ? parent : FS.getPath(parent);
+ var parts = path.split('/').reverse();
+ while (parts.length) {
+ var part = parts.pop();
+ if (!part) continue;
+ var current = PATH.join2(parent, part);
+ try {
+ FS.mkdir(current);
+ } catch (e) {
+ // ignore EEXIST
+ }
+ parent = current;
+ }
+ return current;
+ },createFile:function (parent, name, properties, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(canRead, canWrite);
+ return FS.create(path, mode);
+ },createDataFile:function (parent, name, data, canRead, canWrite, canOwn) {
+ var path = name ? PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name) : parent;
+ var mode = FS.getMode(canRead, canWrite);
+ var node = FS.create(path, mode);
+ if (data) {
+ if (typeof data === 'string') {
+ var arr = new Array(data.length);
+ for (var i = 0, len = data.length; i < len; ++i) arr[i] = data.charCodeAt(i);
+ data = arr;
+ }
+ // make sure we can write to the file
+ FS.chmod(node, mode | 146);
+ var stream = FS.open(node, 'w');
+ FS.write(stream, data, 0, data.length, 0, canOwn);
+ FS.close(stream);
+ FS.chmod(node, mode);
+ }
+ return node;
+ },createDevice:function (parent, name, input, output) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ var mode = FS.getMode(!!input, !!output);
+ if (!FS.createDevice.major) FS.createDevice.major = 64;
+ var dev = FS.makedev(FS.createDevice.major++, 0);
+ // Create a fake device that a set of stream ops to emulate
+ // the old behavior.
+ FS.registerDevice(dev, {
+ open: function(stream) {
+ stream.seekable = false;
+ },
+ close: function(stream) {
+ // flush any pending line data
+ if (output && output.buffer && output.buffer.length) {
+ output(10);
+ }
+ },
+ read: function(stream, buffer, offset, length, pos /* ignored */) {
+ var bytesRead = 0;
+ for (var i = 0; i < length; i++) {
+ var result;
+ try {
+ result = input();
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ if (result === undefined && bytesRead === 0) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ if (result === null || result === undefined) break;
+ bytesRead++;
+ buffer[offset+i] = result;
+ }
+ if (bytesRead) {
+ stream.node.timestamp = Date.now();
+ }
+ return bytesRead;
+ },
+ write: function(stream, buffer, offset, length, pos) {
+ for (var i = 0; i < length; i++) {
+ try {
+ output(buffer[offset+i]);
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ }
+ if (length) {
+ stream.node.timestamp = Date.now();
+ }
+ return i;
+ }
+ });
+ return FS.mkdev(path, mode, dev);
+ },createLink:function (parent, name, target, canRead, canWrite) {
+ var path = PATH.join2(typeof parent === 'string' ? parent : FS.getPath(parent), name);
+ return FS.symlink(target, path);
+ },forceLoadFile:function (obj) {
+ if (obj.isDevice || obj.isFolder || obj.link || obj.contents) return true;
+ var success = true;
+ if (typeof XMLHttpRequest !== 'undefined') {
+ throw new Error("Lazy loading should have been performed (contents set) in createLazyFile, but it was not. Lazy loading only works in web workers. Use --embed-file or --preload-file in emcc on the main thread.");
+ } else if (Module['read']) {
+ // Command-line.
+ try {
+ // WARNING: Can't read binary files in V8's d8 or tracemonkey's js, as
+ // read() will try to parse UTF8.
+ obj.contents = intArrayFromString(Module['read'](obj.url), true);
+ } catch (e) {
+ success = false;
+ }
+ } else {
+ throw new Error('Cannot load without read() or XMLHttpRequest.');
+ }
+ if (!success) ___setErrNo(ERRNO_CODES.EIO);
+ return success;
+ },createLazyFile:function (parent, name, url, canRead, canWrite) {
+ // Lazy chunked Uint8Array (implements get and length from Uint8Array). Actual getting is abstracted away for eventual reuse.
+ function LazyUint8Array() {
+ this.lengthKnown = false;
+ this.chunks = []; // Loaded chunks. Index is the chunk number
+ }
+ LazyUint8Array.prototype.get = function LazyUint8Array_get(idx) {
+ if (idx > this.length-1 || idx < 0) {
+ return undefined;
+ }
+ var chunkOffset = idx % this.chunkSize;
+ var chunkNum = Math.floor(idx / this.chunkSize);
+ return this.getter(chunkNum)[chunkOffset];
+ }
+ LazyUint8Array.prototype.setDataGetter = function LazyUint8Array_setDataGetter(getter) {
+ this.getter = getter;
+ }
+ LazyUint8Array.prototype.cacheLength = function LazyUint8Array_cacheLength() {
+ // Find length
+ var xhr = new XMLHttpRequest();
+ xhr.open('HEAD', url, false);
+ xhr.send(null);
+ if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
+ var datalength = Number(xhr.getResponseHeader("Content-length"));
+ var header;
+ var hasByteServing = (header = xhr.getResponseHeader("Accept-Ranges")) && header === "bytes";
+ var chunkSize = 1024*1024; // Chunk size in bytes
+
+ if (!hasByteServing) chunkSize = datalength;
+
+ // Function to get a range from the remote URL.
+ var doXHR = (function(from, to) {
+ if (from > to) throw new Error("invalid range (" + from + ", " + to + ") or no bytes requested!");
+ if (to > datalength-1) throw new Error("only " + datalength + " bytes available! programmer error!");
+
+ // TODO: Use mozResponseArrayBuffer, responseStream, etc. if available.
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, false);
+ if (datalength !== chunkSize) xhr.setRequestHeader("Range", "bytes=" + from + "-" + to);
+
+ // Some hints to the browser that we want binary data.
+ if (typeof Uint8Array != 'undefined') xhr.responseType = 'arraybuffer';
+ if (xhr.overrideMimeType) {
+ xhr.overrideMimeType('text/plain; charset=x-user-defined');
+ }
+
+ xhr.send(null);
+ if (!(xhr.status >= 200 && xhr.status < 300 || xhr.status === 304)) throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
+ if (xhr.response !== undefined) {
+ return new Uint8Array(xhr.response || []);
+ } else {
+ return intArrayFromString(xhr.responseText || '', true);
+ }
+ });
+ var lazyArray = this;
+ lazyArray.setDataGetter(function(chunkNum) {
+ var start = chunkNum * chunkSize;
+ var end = (chunkNum+1) * chunkSize - 1; // including this byte
+ end = Math.min(end, datalength-1); // if datalength-1 is selected, this is the last block
+ if (typeof(lazyArray.chunks[chunkNum]) === "undefined") {
+ lazyArray.chunks[chunkNum] = doXHR(start, end);
+ }
+ if (typeof(lazyArray.chunks[chunkNum]) === "undefined") throw new Error("doXHR failed!");
+ return lazyArray.chunks[chunkNum];
+ });
+
+ this._length = datalength;
+ this._chunkSize = chunkSize;
+ this.lengthKnown = true;
+ }
+ if (typeof XMLHttpRequest !== 'undefined') {
+ if (!ENVIRONMENT_IS_WORKER) throw 'Cannot do synchronous binary XHRs outside webworkers in modern browsers. Use --embed-file or --preload-file in emcc';
+ var lazyArray = new LazyUint8Array();
+ Object.defineProperty(lazyArray, "length", {
+ get: function() {
+ if(!this.lengthKnown) {
+ this.cacheLength();
+ }
+ return this._length;
+ }
+ });
+ Object.defineProperty(lazyArray, "chunkSize", {
+ get: function() {
+ if(!this.lengthKnown) {
+ this.cacheLength();
+ }
+ return this._chunkSize;
+ }
+ });
+
+ var properties = { isDevice: false, contents: lazyArray };
+ } else {
+ var properties = { isDevice: false, url: url };
+ }
+
+ var node = FS.createFile(parent, name, properties, canRead, canWrite);
+ // This is a total hack, but I want to get this lazy file code out of the
+ // core of MEMFS. If we want to keep this lazy file concept I feel it should
+ // be its own thin LAZYFS proxying calls to MEMFS.
+ if (properties.contents) {
+ node.contents = properties.contents;
+ } else if (properties.url) {
+ node.contents = null;
+ node.url = properties.url;
+ }
+ // override each stream op with one that tries to force load the lazy file first
+ var stream_ops = {};
+ var keys = Object.keys(node.stream_ops);
+ keys.forEach(function(key) {
+ var fn = node.stream_ops[key];
+ stream_ops[key] = function forceLoadLazyFile() {
+ if (!FS.forceLoadFile(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ return fn.apply(null, arguments);
+ };
+ });
+ // use a custom read function
+ stream_ops.read = function stream_ops_read(stream, buffer, offset, length, position) {
+ if (!FS.forceLoadFile(node)) {
+ throw new FS.ErrnoError(ERRNO_CODES.EIO);
+ }
+ var contents = stream.node.contents;
+ if (position >= contents.length)
+ return 0;
+ var size = Math.min(contents.length - position, length);
+ assert(size >= 0);
+ if (contents.slice) { // normal array
+ for (var i = 0; i < size; i++) {
+ buffer[offset + i] = contents[position + i];
+ }
+ } else {
+ for (var i = 0; i < size; i++) { // LazyUint8Array from sync binary XHR
+ buffer[offset + i] = contents.get(position + i);
+ }
+ }
+ return size;
+ };
+ node.stream_ops = stream_ops;
+ return node;
+ },createPreloadedFile:function (parent, name, url, canRead, canWrite, onload, onerror, dontCreateFile, canOwn) {
+ Browser.init();
+ // TODO we should allow people to just pass in a complete filename instead
+ // of parent and name being that we just join them anyways
+ var fullname = name ? PATH.resolve(PATH.join2(parent, name)) : parent;
+ function processData(byteArray) {
+ function finish(byteArray) {
+ if (!dontCreateFile) {
+ FS.createDataFile(parent, name, byteArray, canRead, canWrite, canOwn);
+ }
+ if (onload) onload();
+ removeRunDependency('cp ' + fullname);
+ }
+ var handled = false;
+ Module['preloadPlugins'].forEach(function(plugin) {
+ if (handled) return;
+ if (plugin['canHandle'](fullname)) {
+ plugin['handle'](byteArray, fullname, finish, function() {
+ if (onerror) onerror();
+ removeRunDependency('cp ' + fullname);
+ });
+ handled = true;
+ }
+ });
+ if (!handled) finish(byteArray);
+ }
+ addRunDependency('cp ' + fullname);
+ if (typeof url == 'string') {
+ Browser.asyncLoad(url, function(byteArray) {
+ processData(byteArray);
+ }, onerror);
+ } else {
+ processData(url);
+ }
+ },indexedDB:function () {
+ return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
+ },DB_NAME:function () {
+ return 'EM_FS_' + window.location.pathname;
+ },DB_VERSION:20,DB_STORE_NAME:"FILE_DATA",saveFilesToDB:function (paths, onload, onerror) {
+ onload = onload || function(){};
+ onerror = onerror || function(){};
+ var indexedDB = FS.indexedDB();
+ try {
+ var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
+ } catch (e) {
+ return onerror(e);
+ }
+ openRequest.onupgradeneeded = function openRequest_onupgradeneeded() {
+ console.log('creating db');
+ var db = openRequest.result;
+ db.createObjectStore(FS.DB_STORE_NAME);
+ };
+ openRequest.onsuccess = function openRequest_onsuccess() {
+ var db = openRequest.result;
+ var transaction = db.transaction([FS.DB_STORE_NAME], 'readwrite');
+ var files = transaction.objectStore(FS.DB_STORE_NAME);
+ var ok = 0, fail = 0, total = paths.length;
+ function finish() {
+ if (fail == 0) onload(); else onerror();
+ }
+ paths.forEach(function(path) {
+ var putRequest = files.put(FS.analyzePath(path).object.contents, path);
+ putRequest.onsuccess = function putRequest_onsuccess() { ok++; if (ok + fail == total) finish() };
+ putRequest.onerror = function putRequest_onerror() { fail++; if (ok + fail == total) finish() };
+ });
+ transaction.onerror = onerror;
+ };
+ openRequest.onerror = onerror;
+ },loadFilesFromDB:function (paths, onload, onerror) {
+ onload = onload || function(){};
+ onerror = onerror || function(){};
+ var indexedDB = FS.indexedDB();
+ try {
+ var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
+ } catch (e) {
+ return onerror(e);
+ }
+ openRequest.onupgradeneeded = onerror; // no database to load from
+ openRequest.onsuccess = function openRequest_onsuccess() {
+ var db = openRequest.result;
+ try {
+ var transaction = db.transaction([FS.DB_STORE_NAME], 'readonly');
+ } catch(e) {
+ onerror(e);
+ return;
+ }
+ var files = transaction.objectStore(FS.DB_STORE_NAME);
+ var ok = 0, fail = 0, total = paths.length;
+ function finish() {
+ if (fail == 0) onload(); else onerror();
+ }
+ paths.forEach(function(path) {
+ var getRequest = files.get(path);
+ getRequest.onsuccess = function getRequest_onsuccess() {
+ if (FS.analyzePath(path).exists) {
+ FS.unlink(path);
+ }
+ FS.createDataFile(PATH.dirname(path), PATH.basename(path), getRequest.result, true, true, true);
+ ok++;
+ if (ok + fail == total) finish();
+ };
+ getRequest.onerror = function getRequest_onerror() { fail++; if (ok + fail == total) finish() };
+ });
+ transaction.onerror = onerror;
+ };
+ openRequest.onerror = onerror;
+ }};
+
+
+
+
+ function _mkport() { throw 'TODO' }var SOCKFS={mount:function (mount) {
+ return FS.createNode(null, '/', 16384 | 511 /* 0777 */, 0);
+ },createSocket:function (family, type, protocol) {
+ var streaming = type == 1;
+ if (protocol) {
+ assert(streaming == (protocol == 6)); // if SOCK_STREAM, must be tcp
+ }
+
+ // create our internal socket structure
+ var sock = {
+ family: family,
+ type: type,
+ protocol: protocol,
+ server: null,
+ peers: {},
+ pending: [],
+ recv_queue: [],
+ sock_ops: SOCKFS.websocket_sock_ops
+ };
+
+ // create the filesystem node to store the socket structure
+ var name = SOCKFS.nextname();
+ var node = FS.createNode(SOCKFS.root, name, 49152, 0);
+ node.sock = sock;
+
+ // and the wrapping stream that enables library functions such
+ // as read and write to indirectly interact with the socket
+ var stream = FS.createStream({
+ path: name,
+ node: node,
+ flags: FS.modeStringToFlags('r+'),
+ seekable: false,
+ stream_ops: SOCKFS.stream_ops
+ });
+
+ // map the new stream to the socket structure (sockets have a 1:1
+ // relationship with a stream)
+ sock.stream = stream;
+
+ return sock;
+ },getSocket:function (fd) {
+ var stream = FS.getStream(fd);
+ if (!stream || !FS.isSocket(stream.node.mode)) {
+ return null;
+ }
+ return stream.node.sock;
+ },stream_ops:{poll:function (stream) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.poll(sock);
+ },ioctl:function (stream, request, varargs) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.ioctl(sock, request, varargs);
+ },read:function (stream, buffer, offset, length, position /* ignored */) {
+ var sock = stream.node.sock;
+ var msg = sock.sock_ops.recvmsg(sock, length);
+ if (!msg) {
+ // socket is closed
+ return 0;
+ }
+ buffer.set(msg.buffer, offset);
+ return msg.buffer.length;
+ },write:function (stream, buffer, offset, length, position /* ignored */) {
+ var sock = stream.node.sock;
+ return sock.sock_ops.sendmsg(sock, buffer, offset, length);
+ },close:function (stream) {
+ var sock = stream.node.sock;
+ sock.sock_ops.close(sock);
+ }},nextname:function () {
+ if (!SOCKFS.nextname.current) {
+ SOCKFS.nextname.current = 0;
+ }
+ return 'socket[' + (SOCKFS.nextname.current++) + ']';
+ },websocket_sock_ops:{createPeer:function (sock, addr, port) {
+ var ws;
+
+ if (typeof addr === 'object') {
+ ws = addr;
+ addr = null;
+ port = null;
+ }
+
+ if (ws) {
+ // for sockets that've already connected (e.g. we're the server)
+ // we can inspect the _socket property for the address
+ if (ws._socket) {
+ addr = ws._socket.remoteAddress;
+ port = ws._socket.remotePort;
+ }
+ // if we're just now initializing a connection to the remote,
+ // inspect the url property
+ else {
+ var result = /ws[s]?:\/\/([^:]+):(\d+)/.exec(ws.url);
+ if (!result) {
+ throw new Error('WebSocket URL must be in the format ws(s)://address:port');
+ }
+ addr = result[1];
+ port = parseInt(result[2], 10);
+ }
+ } else {
+ // create the actual websocket object and connect
+ try {
+ // runtimeConfig gets set to true if WebSocket runtime configuration is available.
+ var runtimeConfig = (Module['websocket'] && ('object' === typeof Module['websocket']));
+
+ // The default value is 'ws://' the replace is needed because the compiler replaces "//" comments with '#'
+ // comments without checking context, so we'd end up with ws:#, the replace swaps the "#" for "//" again.
+ var url = 'ws:#'.replace('#', '//');
+
+ if (runtimeConfig) {
+ if ('string' === typeof Module['websocket']['url']) {
+ url = Module['websocket']['url']; // Fetch runtime WebSocket URL config.
+ }
+ }
+
+ if (url === 'ws://' || url === 'wss://') { // Is the supplied URL config just a prefix, if so complete it.
+ url = url + addr + ':' + port;
+ }
+
+ // Make the WebSocket subprotocol (Sec-WebSocket-Protocol) default to binary if no configuration is set.
+ var subProtocols = 'binary'; // The default value is 'binary'
+
+ if (runtimeConfig) {
+ if ('string' === typeof Module['websocket']['subprotocol']) {
+ subProtocols = Module['websocket']['subprotocol']; // Fetch runtime WebSocket subprotocol config.
+ }
+ }
+
+ // The regex trims the string (removes spaces at the beginning and end, then splits the string by
+ // <any space>,<any space> into an Array. Whitespace removal is important for Websockify and ws.
+ subProtocols = subProtocols.replace(/^ +| +$/g,"").split(/ *, */);
+
+ // The node ws library API for specifying optional subprotocol is slightly different than the browser's.
+ var opts = ENVIRONMENT_IS_NODE ? {'protocol': subProtocols.toString()} : subProtocols;
+
+ // If node we use the ws library.
+ var WebSocket = ENVIRONMENT_IS_NODE ? require('ws') : window['WebSocket'];
+ ws = new WebSocket(url, opts);
+ ws.binaryType = 'arraybuffer';
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EHOSTUNREACH);
+ }
+ }
+
+
+ var peer = {
+ addr: addr,
+ port: port,
+ socket: ws,
+ dgram_send_queue: []
+ };
+
+ SOCKFS.websocket_sock_ops.addPeer(sock, peer);
+ SOCKFS.websocket_sock_ops.handlePeerEvents(sock, peer);
+
+ // if this is a bound dgram socket, send the port number first to allow
+ // us to override the ephemeral port reported to us by remotePort on the
+ // remote end.
+ if (sock.type === 2 && typeof sock.sport !== 'undefined') {
+ peer.dgram_send_queue.push(new Uint8Array([
+ 255, 255, 255, 255,
+ 'p'.charCodeAt(0), 'o'.charCodeAt(0), 'r'.charCodeAt(0), 't'.charCodeAt(0),
+ ((sock.sport & 0xff00) >> 8) , (sock.sport & 0xff)
+ ]));
+ }
+
+ return peer;
+ },getPeer:function (sock, addr, port) {
+ return sock.peers[addr + ':' + port];
+ },addPeer:function (sock, peer) {
+ sock.peers[peer.addr + ':' + peer.port] = peer;
+ },removePeer:function (sock, peer) {
+ delete sock.peers[peer.addr + ':' + peer.port];
+ },handlePeerEvents:function (sock, peer) {
+ var first = true;
+
+ var handleOpen = function () {
+ try {
+ var queued = peer.dgram_send_queue.shift();
+ while (queued) {
+ peer.socket.send(queued);
+ queued = peer.dgram_send_queue.shift();
+ }
+ } catch (e) {
+ // not much we can do here in the way of proper error handling as we've already
+ // lied and said this data was sent. shut it down.
+ peer.socket.close();
+ }
+ };
+
+ function handleMessage(data) {
+ assert(typeof data !== 'string' && data.byteLength !== undefined); // must receive an ArrayBuffer
+ data = new Uint8Array(data); // make a typed array view on the array buffer
+
+
+ // if this is the port message, override the peer's port with it
+ var wasfirst = first;
+ first = false;
+ if (wasfirst &&
+ data.length === 10 &&
+ data[0] === 255 && data[1] === 255 && data[2] === 255 && data[3] === 255 &&
+ data[4] === 'p'.charCodeAt(0) && data[5] === 'o'.charCodeAt(0) && data[6] === 'r'.charCodeAt(0) && data[7] === 't'.charCodeAt(0)) {
+ // update the peer's port and it's key in the peer map
+ var newport = ((data[8] << 8) | data[9]);
+ SOCKFS.websocket_sock_ops.removePeer(sock, peer);
+ peer.port = newport;
+ SOCKFS.websocket_sock_ops.addPeer(sock, peer);
+ return;
+ }
+
+ sock.recv_queue.push({ addr: peer.addr, port: peer.port, data: data });
+ };
+
+ if (ENVIRONMENT_IS_NODE) {
+ peer.socket.on('open', handleOpen);
+ peer.socket.on('message', function(data, flags) {
+ if (!flags.binary) {
+ return;
+ }
+ handleMessage((new Uint8Array(data)).buffer); // copy from node Buffer -> ArrayBuffer
+ });
+ peer.socket.on('error', function() {
+ // don't throw
+ });
+ } else {
+ peer.socket.onopen = handleOpen;
+ peer.socket.onmessage = function peer_socket_onmessage(event) {
+ handleMessage(event.data);
+ };
+ }
+ },poll:function (sock) {
+ if (sock.type === 1 && sock.server) {
+ // listen sockets should only say they're available for reading
+ // if there are pending clients.
+ return sock.pending.length ? (64 | 1) : 0;
+ }
+
+ var mask = 0;
+ var dest = sock.type === 1 ? // we only care about the socket state for connection-based sockets
+ SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport) :
+ null;
+
+ if (sock.recv_queue.length ||
+ !dest || // connection-less sockets are always ready to read
+ (dest && dest.socket.readyState === dest.socket.CLOSING) ||
+ (dest && dest.socket.readyState === dest.socket.CLOSED)) { // let recv return 0 once closed
+ mask |= (64 | 1);
+ }
+
+ if (!dest || // connection-less sockets are always ready to write
+ (dest && dest.socket.readyState === dest.socket.OPEN)) {
+ mask |= 4;
+ }
+
+ if ((dest && dest.socket.readyState === dest.socket.CLOSING) ||
+ (dest && dest.socket.readyState === dest.socket.CLOSED)) {
+ mask |= 16;
+ }
+
+ return mask;
+ },ioctl:function (sock, request, arg) {
+ switch (request) {
+ case 21531:
+ var bytes = 0;
+ if (sock.recv_queue.length) {
+ bytes = sock.recv_queue[0].data.length;
+ }
+ HEAP32[((arg)>>2)]=bytes;
+ return 0;
+ default:
+ return ERRNO_CODES.EINVAL;
+ }
+ },close:function (sock) {
+ // if we've spawned a listen server, close it
+ if (sock.server) {
+ try {
+ sock.server.close();
+ } catch (e) {
+ }
+ sock.server = null;
+ }
+ // close any peer connections
+ var peers = Object.keys(sock.peers);
+ for (var i = 0; i < peers.length; i++) {
+ var peer = sock.peers[peers[i]];
+ try {
+ peer.socket.close();
+ } catch (e) {
+ }
+ SOCKFS.websocket_sock_ops.removePeer(sock, peer);
+ }
+ return 0;
+ },bind:function (sock, addr, port) {
+ if (typeof sock.saddr !== 'undefined' || typeof sock.sport !== 'undefined') {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL); // already bound
+ }
+ sock.saddr = addr;
+ sock.sport = port || _mkport();
+ // in order to emulate dgram sockets, we need to launch a listen server when
+ // binding on a connection-less socket
+ // note: this is only required on the server side
+ if (sock.type === 2) {
+ // close the existing server if it exists
+ if (sock.server) {
+ sock.server.close();
+ sock.server = null;
+ }
+ // swallow error operation not supported error that occurs when binding in the
+ // browser where this isn't supported
+ try {
+ sock.sock_ops.listen(sock, 0);
+ } catch (e) {
+ if (!(e instanceof FS.ErrnoError)) throw e;
+ if (e.errno !== ERRNO_CODES.EOPNOTSUPP) throw e;
+ }
+ }
+ },connect:function (sock, addr, port) {
+ if (sock.server) {
+ throw new FS.ErrnoError(ERRNO_CODS.EOPNOTSUPP);
+ }
+
+ // TODO autobind
+ // if (!sock.addr && sock.type == 2) {
+ // }
+
+ // early out if we're already connected / in the middle of connecting
+ if (typeof sock.daddr !== 'undefined' && typeof sock.dport !== 'undefined') {
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
+ if (dest) {
+ if (dest.socket.readyState === dest.socket.CONNECTING) {
+ throw new FS.ErrnoError(ERRNO_CODES.EALREADY);
+ } else {
+ throw new FS.ErrnoError(ERRNO_CODES.EISCONN);
+ }
+ }
+ }
+
+ // add the socket to our peer list and set our
+ // destination address / port to match
+ var peer = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
+ sock.daddr = peer.addr;
+ sock.dport = peer.port;
+
+ // always "fail" in non-blocking mode
+ throw new FS.ErrnoError(ERRNO_CODES.EINPROGRESS);
+ },listen:function (sock, backlog) {
+ if (!ENVIRONMENT_IS_NODE) {
+ throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
+ }
+ if (sock.server) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL); // already listening
+ }
+ var WebSocketServer = require('ws').Server;
+ var host = sock.saddr;
+ sock.server = new WebSocketServer({
+ host: host,
+ port: sock.sport
+ // TODO support backlog
+ });
+
+ sock.server.on('connection', function(ws) {
+ if (sock.type === 1) {
+ var newsock = SOCKFS.createSocket(sock.family, sock.type, sock.protocol);
+
+ // create a peer on the new socket
+ var peer = SOCKFS.websocket_sock_ops.createPeer(newsock, ws);
+ newsock.daddr = peer.addr;
+ newsock.dport = peer.port;
+
+ // push to queue for accept to pick up
+ sock.pending.push(newsock);
+ } else {
+ // create a peer on the listen socket so calling sendto
+ // with the listen socket and an address will resolve
+ // to the correct client
+ SOCKFS.websocket_sock_ops.createPeer(sock, ws);
+ }
+ });
+ sock.server.on('closed', function() {
+ sock.server = null;
+ });
+ sock.server.on('error', function() {
+ // don't throw
+ });
+ },accept:function (listensock) {
+ if (!listensock.server) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ var newsock = listensock.pending.shift();
+ newsock.stream.flags = listensock.stream.flags;
+ return newsock;
+ },getname:function (sock, peer) {
+ var addr, port;
+ if (peer) {
+ if (sock.daddr === undefined || sock.dport === undefined) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+ addr = sock.daddr;
+ port = sock.dport;
+ } else {
+ // TODO saddr and sport will be set for bind()'d UDP sockets, but what
+ // should we be returning for TCP sockets that've been connect()'d?
+ addr = sock.saddr || 0;
+ port = sock.sport || 0;
+ }
+ return { addr: addr, port: port };
+ },sendmsg:function (sock, buffer, offset, length, addr, port) {
+ if (sock.type === 2) {
+ // connection-less sockets will honor the message address,
+ // and otherwise fall back to the bound destination address
+ if (addr === undefined || port === undefined) {
+ addr = sock.daddr;
+ port = sock.dport;
+ }
+ // if there was no address to fall back to, error out
+ if (addr === undefined || port === undefined) {
+ throw new FS.ErrnoError(ERRNO_CODES.EDESTADDRREQ);
+ }
+ } else {
+ // connection-based sockets will only use the bound
+ addr = sock.daddr;
+ port = sock.dport;
+ }
+
+ // find the peer for the destination address
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, addr, port);
+
+ // early out if not connected with a connection-based socket
+ if (sock.type === 1) {
+ if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ } else if (dest.socket.readyState === dest.socket.CONNECTING) {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ }
+
+ // create a copy of the incoming data to send, as the WebSocket API
+ // doesn't work entirely with an ArrayBufferView, it'll just send
+ // the entire underlying buffer
+ var data;
+ if (buffer instanceof Array || buffer instanceof ArrayBuffer) {
+ data = buffer.slice(offset, offset + length);
+ } else { // ArrayBufferView
+ data = buffer.buffer.slice(buffer.byteOffset + offset, buffer.byteOffset + offset + length);
+ }
+
+ // if we're emulating a connection-less dgram socket and don't have
+ // a cached connection, queue the buffer to send upon connect and
+ // lie, saying the data was sent now.
+ if (sock.type === 2) {
+ if (!dest || dest.socket.readyState !== dest.socket.OPEN) {
+ // if we're not connected, open a new connection
+ if (!dest || dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ dest = SOCKFS.websocket_sock_ops.createPeer(sock, addr, port);
+ }
+ dest.dgram_send_queue.push(data);
+ return length;
+ }
+ }
+
+ try {
+ // send the actual data
+ dest.socket.send(data);
+ return length;
+ } catch (e) {
+ throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+ }
+ },recvmsg:function (sock, length) {
+ // http://pubs.opengroup.org/onlinepubs/7908799/xns/recvmsg.html
+ if (sock.type === 1 && sock.server) {
+ // tcp servers should not be recv()'ing on the listen socket
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+
+ var queued = sock.recv_queue.shift();
+ if (!queued) {
+ if (sock.type === 1) {
+ var dest = SOCKFS.websocket_sock_ops.getPeer(sock, sock.daddr, sock.dport);
+
+ if (!dest) {
+ // if we have a destination address but are not connected, error out
+ throw new FS.ErrnoError(ERRNO_CODES.ENOTCONN);
+ }
+ else if (dest.socket.readyState === dest.socket.CLOSING || dest.socket.readyState === dest.socket.CLOSED) {
+ // return null if the socket has closed
+ return null;
+ }
+ else {
+ // else, our socket is in a valid state but truly has nothing available
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ } else {
+ throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+ }
+ }
+
+ // queued.data will be an ArrayBuffer if it's unadulterated, but if it's
+ // requeued TCP data it'll be an ArrayBufferView
+ var queuedLength = queued.data.byteLength || queued.data.length;
+ var queuedOffset = queued.data.byteOffset || 0;
+ var queuedBuffer = queued.data.buffer || queued.data;
+ var bytesRead = Math.min(length, queuedLength);
+ var res = {
+ buffer: new Uint8Array(queuedBuffer, queuedOffset, bytesRead),
+ addr: queued.addr,
+ port: queued.port
+ };
+
+
+ // push back any unread data for TCP connections
+ if (sock.type === 1 && bytesRead < queuedLength) {
+ var bytesRemaining = queuedLength - bytesRead;
+ queued.data = new Uint8Array(queuedBuffer, queuedOffset + bytesRead, bytesRemaining);
+ sock.recv_queue.unshift(queued);
+ }
+
+ return res;
+ }}};function _send(fd, buf, len, flags) {
+ var sock = SOCKFS.getSocket(fd);
+ if (!sock) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ // TODO honor flags
+ return _write(fd, buf, len);
+ }
+
+ function _pwrite(fildes, buf, nbyte, offset) {
+ // ssize_t pwrite(int fildes, const void *buf, size_t nbyte, off_t offset);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
+ var stream = FS.getStream(fildes);
+ if (!stream) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+ try {
+ var slab = HEAP8;
+ return FS.write(stream, slab, buf, nbyte, offset);
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }function _write(fildes, buf, nbyte) {
+ // ssize_t write(int fildes, const void *buf, size_t nbyte);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/write.html
+ var stream = FS.getStream(fildes);
+ if (!stream) {
+ ___setErrNo(ERRNO_CODES.EBADF);
+ return -1;
+ }
+
+
+ try {
+ var slab = HEAP8;
+ return FS.write(stream, slab, buf, nbyte);
+ } catch (e) {
+ FS.handleFSError(e);
+ return -1;
+ }
+ }
+
+ function _fileno(stream) {
+ // int fileno(FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fileno.html
+ stream = FS.getStreamFromPtr(stream);
+ if (!stream) return -1;
+ return stream.fd;
+ }function _fwrite(ptr, size, nitems, stream) {
+ // size_t fwrite(const void *restrict ptr, size_t size, size_t nitems, FILE *restrict stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fwrite.html
+ var bytesToWrite = nitems * size;
+ if (bytesToWrite == 0) return 0;
+ var fd = _fileno(stream);
+ var bytesWritten = _write(fd, ptr, bytesToWrite);
+ if (bytesWritten == -1) {
+ var streamObj = FS.getStreamFromPtr(stream);
+ if (streamObj) streamObj.error = true;
+ return 0;
+ } else {
+ return Math.floor(bytesWritten / size);
+ }
+ }
+
+
+
+ Module["_strlen"] = _strlen;
+
+ function __reallyNegative(x) {
+ return x < 0 || (x === 0 && (1/x) === -Infinity);
+ }function __formatString(format, varargs) {
+ var textIndex = format;
+ var argIndex = 0;
+ function getNextArg(type) {
+ // NOTE: Explicitly ignoring type safety. Otherwise this fails:
+ // int x = 4; printf("%c\n", (char)x);
+ var ret;
+ if (type === 'double') {
+ ret = HEAPF64[(((varargs)+(argIndex))>>3)];
+ } else if (type == 'i64') {
+ ret = [HEAP32[(((varargs)+(argIndex))>>2)],
+ HEAP32[(((varargs)+(argIndex+4))>>2)]];
+
+ } else {
+ type = 'i32'; // varargs are always i32, i64, or double
+ ret = HEAP32[(((varargs)+(argIndex))>>2)];
+ }
+ argIndex += Runtime.getNativeFieldSize(type);
+ return ret;
+ }
+
+ var ret = [];
+ var curr, next, currArg;
+ while(1) {
+ var startTextIndex = textIndex;
+ curr = HEAP8[(textIndex)];
+ if (curr === 0) break;
+ next = HEAP8[((textIndex+1)|0)];
+ if (curr == 37) {
+ // Handle flags.
+ var flagAlwaysSigned = false;
+ var flagLeftAlign = false;
+ var flagAlternative = false;
+ var flagZeroPad = false;
+ var flagPadSign = false;
+ flagsLoop: while (1) {
+ switch (next) {
+ case 43:
+ flagAlwaysSigned = true;
+ break;
+ case 45:
+ flagLeftAlign = true;
+ break;
+ case 35:
+ flagAlternative = true;
+ break;
+ case 48:
+ if (flagZeroPad) {
+ break flagsLoop;
+ } else {
+ flagZeroPad = true;
+ break;
+ }
+ case 32:
+ flagPadSign = true;
+ break;
+ default:
+ break flagsLoop;
+ }
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ }
+
+ // Handle width.
+ var width = 0;
+ if (next == 42) {
+ width = getNextArg('i32');
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ } else {
+ while (next >= 48 && next <= 57) {
+ width = width * 10 + (next - 48);
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ }
+ }
+
+ // Handle precision.
+ var precisionSet = false, precision = -1;
+ if (next == 46) {
+ precision = 0;
+ precisionSet = true;
+ textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+ if (next == 42) {
+ precision = getNextArg('i32');
+ textIndex++;
+ } else {
+ while(1) {
+ var precisionChr = HEAP8[((textIndex+1)|0)];
+ if (precisionChr < 48 ||
+ precisionChr > 57) break;
+ precision = precision * 10 + (precisionChr - 48);
+ textIndex++;
+ }
+ }
+ next = HEAP8[((textIndex+1)|0)];
+ }
+ if (precision < 0) {
+ precision = 6; // Standard default.
+ precisionSet = false;
+ }
+
+ // Handle integer sizes. WARNING: These assume a 32-bit architecture!
+ var argSize;
+ switch (String.fromCharCode(next)) {
+ case 'h':
+ var nextNext = HEAP8[((textIndex+2)|0)];
+ if (nextNext == 104) {
+ textIndex++;
+ argSize = 1; // char (actually i32 in varargs)
+ } else {
+ argSize = 2; // short (actually i32 in varargs)
+ }
+ break;
+ case 'l':
+ var nextNext = HEAP8[((textIndex+2)|0)];
+ if (nextNext == 108) {
+ textIndex++;
+ argSize = 8; // long long
+ } else {
+ argSize = 4; // long
+ }
+ break;
+ case 'L': // long long
+ case 'q': // int64_t
+ case 'j': // intmax_t
+ argSize = 8;
+ break;
+ case 'z': // size_t
+ case 't': // ptrdiff_t
+ case 'I': // signed ptrdiff_t or unsigned size_t
+ argSize = 4;
+ break;
+ default:
+ argSize = null;
+ }
+ if (argSize) textIndex++;
+ next = HEAP8[((textIndex+1)|0)];
+
+ // Handle type specifier.
+ switch (String.fromCharCode(next)) {
+ case 'd': case 'i': case 'u': case 'o': case 'x': case 'X': case 'p': {
+ // Integer.
+ var signed = next == 100 || next == 105;
+ argSize = argSize || 4;
+ var currArg = getNextArg('i' + (argSize * 8));
+ var argText;
+ // Flatten i64-1 [low, high] into a (slightly rounded) double
+ if (argSize == 8) {
+ currArg = Runtime.makeBigInt(currArg[0], currArg[1], next == 117);
+ }
+ // Truncate to requested size.
+ if (argSize <= 4) {
+ var limit = Math.pow(256, argSize) - 1;
+ currArg = (signed ? reSign : unSign)(currArg & limit, argSize * 8);
+ }
+ // Format the number.
+ var currAbsArg = Math.abs(currArg);
+ var prefix = '';
+ if (next == 100 || next == 105) {
+ argText = reSign(currArg, 8 * argSize, 1).toString(10);
+ } else if (next == 117) {
+ argText = unSign(currArg, 8 * argSize, 1).toString(10);
+ currArg = Math.abs(currArg);
+ } else if (next == 111) {
+ argText = (flagAlternative ? '0' : '') + currAbsArg.toString(8);
+ } else if (next == 120 || next == 88) {
+ prefix = (flagAlternative && currArg != 0) ? '0x' : '';
+ if (currArg < 0) {
+ // Represent negative numbers in hex as 2's complement.
+ currArg = -currArg;
+ argText = (currAbsArg - 1).toString(16);
+ var buffer = [];
+ for (var i = 0; i < argText.length; i++) {
+ buffer.push((0xF - parseInt(argText[i], 16)).toString(16));
+ }
+ argText = buffer.join('');
+ while (argText.length < argSize * 2) argText = 'f' + argText;
+ } else {
+ argText = currAbsArg.toString(16);
+ }
+ if (next == 88) {
+ prefix = prefix.toUpperCase();
+ argText = argText.toUpperCase();
+ }
+ } else if (next == 112) {
+ if (currAbsArg === 0) {
+ argText = '(nil)';
+ } else {
+ prefix = '0x';
+ argText = currAbsArg.toString(16);
+ }
+ }
+ if (precisionSet) {
+ while (argText.length < precision) {
+ argText = '0' + argText;
+ }
+ }
+
+ // Add sign if needed
+ if (currArg >= 0) {
+ if (flagAlwaysSigned) {
+ prefix = '+' + prefix;
+ } else if (flagPadSign) {
+ prefix = ' ' + prefix;
+ }
+ }
+
+ // Move sign to prefix so we zero-pad after the sign
+ if (argText.charAt(0) == '-') {
+ prefix = '-' + prefix;
+ argText = argText.substr(1);
+ }
+
+ // Add padding.
+ while (prefix.length + argText.length < width) {
+ if (flagLeftAlign) {
+ argText += ' ';
+ } else {
+ if (flagZeroPad) {
+ argText = '0' + argText;
+ } else {
+ prefix = ' ' + prefix;
+ }
+ }
+ }
+
+ // Insert the result into the buffer.
+ argText = prefix + argText;
+ argText.split('').forEach(function(chr) {
+ ret.push(chr.charCodeAt(0));
+ });
+ break;
+ }
+ case 'f': case 'F': case 'e': case 'E': case 'g': case 'G': {
+ // Float.
+ var currArg = getNextArg('double');
+ var argText;
+ if (isNaN(currArg)) {
+ argText = 'nan';
+ flagZeroPad = false;
+ } else if (!isFinite(currArg)) {
+ argText = (currArg < 0 ? '-' : '') + 'inf';
+ flagZeroPad = false;
+ } else {
+ var isGeneral = false;
+ var effectivePrecision = Math.min(precision, 20);
+
+ // Convert g/G to f/F or e/E, as per:
+ // http://pubs.opengroup.org/onlinepubs/9699919799/functions/printf.html
+ if (next == 103 || next == 71) {
+ isGeneral = true;
+ precision = precision || 1;
+ var exponent = parseInt(currArg.toExponential(effectivePrecision).split('e')[1], 10);
+ if (precision > exponent && exponent >= -4) {
+ next = ((next == 103) ? 'f' : 'F').charCodeAt(0);
+ precision -= exponent + 1;
+ } else {
+ next = ((next == 103) ? 'e' : 'E').charCodeAt(0);
+ precision--;
+ }
+ effectivePrecision = Math.min(precision, 20);
+ }
+
+ if (next == 101 || next == 69) {
+ argText = currArg.toExponential(effectivePrecision);
+ // Make sure the exponent has at least 2 digits.
+ if (/[eE][-+]\d$/.test(argText)) {
+ argText = argText.slice(0, -1) + '0' + argText.slice(-1);
+ }
+ } else if (next == 102 || next == 70) {
+ argText = currArg.toFixed(effectivePrecision);
+ if (currArg === 0 && __reallyNegative(currArg)) {
+ argText = '-' + argText;
+ }
+ }
+
+ var parts = argText.split('e');
+ if (isGeneral && !flagAlternative) {
+ // Discard trailing zeros and periods.
+ while (parts[0].length > 1 && parts[0].indexOf('.') != -1 &&
+ (parts[0].slice(-1) == '0' || parts[0].slice(-1) == '.')) {
+ parts[0] = parts[0].slice(0, -1);
+ }
+ } else {
+ // Make sure we have a period in alternative mode.
+ if (flagAlternative && argText.indexOf('.') == -1) parts[0] += '.';
+ // Zero pad until required precision.
+ while (precision > effectivePrecision++) parts[0] += '0';
+ }
+ argText = parts[0] + (parts.length > 1 ? 'e' + parts[1] : '');
+
+ // Capitalize 'E' if needed.
+ if (next == 69) argText = argText.toUpperCase();
+
+ // Add sign.
+ if (currArg >= 0) {
+ if (flagAlwaysSigned) {
+ argText = '+' + argText;
+ } else if (flagPadSign) {
+ argText = ' ' + argText;
+ }
+ }
+ }
+
+ // Add padding.
+ while (argText.length < width) {
+ if (flagLeftAlign) {
+ argText += ' ';
+ } else {
+ if (flagZeroPad && (argText[0] == '-' || argText[0] == '+')) {
+ argText = argText[0] + '0' + argText.slice(1);
+ } else {
+ argText = (flagZeroPad ? '0' : ' ') + argText;
+ }
+ }
+ }
+
+ // Adjust case.
+ if (next < 97) argText = argText.toUpperCase();
+
+ // Insert the result into the buffer.
+ argText.split('').forEach(function(chr) {
+ ret.push(chr.charCodeAt(0));
+ });
+ break;
+ }
+ case 's': {
+ // String.
+ var arg = getNextArg('i8*');
+ var argLength = arg ? _strlen(arg) : '(null)'.length;
+ if (precisionSet) argLength = Math.min(argLength, precision);
+ if (!flagLeftAlign) {
+ while (argLength < width--) {
+ ret.push(32);
+ }
+ }
+ if (arg) {
+ for (var i = 0; i < argLength; i++) {
+ ret.push(HEAPU8[((arg++)|0)]);
+ }
+ } else {
+ ret = ret.concat(intArrayFromString('(null)'.substr(0, argLength), true));
+ }
+ if (flagLeftAlign) {
+ while (argLength < width--) {
+ ret.push(32);
+ }
+ }
+ break;
+ }
+ case 'c': {
+ // Character.
+ if (flagLeftAlign) ret.push(getNextArg('i8'));
+ while (--width > 0) {
+ ret.push(32);
+ }
+ if (!flagLeftAlign) ret.push(getNextArg('i8'));
+ break;
+ }
+ case 'n': {
+ // Write the length written so far to the next parameter.
+ var ptr = getNextArg('i32*');
+ HEAP32[((ptr)>>2)]=ret.length;
+ break;
+ }
+ case '%': {
+ // Literal percent sign.
+ ret.push(curr);
+ break;
+ }
+ default: {
+ // Unknown specifiers remain untouched.
+ for (var i = startTextIndex; i < textIndex + 2; i++) {
+ ret.push(HEAP8[(i)]);
+ }
+ }
+ }
+ textIndex += 2;
+ // TODO: Support a/A (hex float) and m (last error) specifiers.
+ // TODO: Support %1${specifier} for arg selection.
+ } else {
+ ret.push(curr);
+ textIndex += 1;
+ }
+ }
+ return ret;
+ }function _fprintf(stream, format, varargs) {
+ // int fprintf(FILE *restrict stream, const char *restrict format, ...);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
+ var result = __formatString(format, varargs);
+ var stack = Runtime.stackSave();
+ var ret = _fwrite(allocate(result, 'i8', ALLOC_STACK), 1, result.length, stream);
+ Runtime.stackRestore(stack);
+ return ret;
+ }function _printf(format, varargs) {
+ // int printf(const char *restrict format, ...);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/printf.html
+ var stdout = HEAP32[((_stdout)>>2)];
+ return _fprintf(stdout, format, varargs);
+ }
+
+
+ function _fputs(s, stream) {
+ // int fputs(const char *restrict s, FILE *restrict stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fputs.html
+ var fd = _fileno(stream);
+ return _write(fd, s, _strlen(s));
+ }
+
+ function _fputc(c, stream) {
+ // int fputc(int c, FILE *stream);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/fputc.html
+ var chr = unSign(c & 0xFF);
+ HEAP8[((_fputc.ret)|0)]=chr;
+ var fd = _fileno(stream);
+ var ret = _write(fd, _fputc.ret, 1);
+ if (ret == -1) {
+ var streamObj = FS.getStreamFromPtr(stream);
+ if (streamObj) streamObj.error = true;
+ return -1;
+ } else {
+ return chr;
+ }
+ }function _puts(s) {
+ // int puts(const char *s);
+ // http://pubs.opengroup.org/onlinepubs/000095399/functions/puts.html
+ // NOTE: puts() always writes an extra newline.
+ var stdout = HEAP32[((_stdout)>>2)];
+ var ret = _fputs(s, stdout);
+ if (ret < 0) {
+ return ret;
+ } else {
+ var newlineRet = _fputc(10, stdout);
+ return (newlineRet < 0) ? -1 : ret + 1;
+ }
+ }
+
+ function _sysconf(name) {
+ // long sysconf(int name);
+ // http://pubs.opengroup.org/onlinepubs/009695399/functions/sysconf.html
+ switch(name) {
+ case 30: return PAGE_SIZE;
+ case 132:
+ case 133:
+ case 12:
+ case 137:
+ case 138:
+ case 15:
+ case 235:
+ case 16:
+ case 17:
+ case 18:
+ case 19:
+ case 20:
+ case 149:
+ case 13:
+ case 10:
+ case 236:
+ case 153:
+ case 9:
+ case 21:
+ case 22:
+ case 159:
+ case 154:
+ case 14:
+ case 77:
+ case 78:
+ case 139:
+ case 80:
+ case 81:
+ case 79:
+ case 82:
+ case 68:
+ case 67:
+ case 164:
+ case 11:
+ case 29:
+ case 47:
+ case 48:
+ case 95:
+ case 52:
+ case 51:
+ case 46:
+ return 200809;
+ case 27:
+ case 246:
+ case 127:
+ case 128:
+ case 23:
+ case 24:
+ case 160:
+ case 161:
+ case 181:
+ case 182:
+ case 242:
+ case 183:
+ case 184:
+ case 243:
+ case 244:
+ case 245:
+ case 165:
+ case 178:
+ case 179:
+ case 49:
+ case 50:
+ case 168:
+ case 169:
+ case 175:
+ case 170:
+ case 171:
+ case 172:
+ case 97:
+ case 76:
+ case 32:
+ case 173:
+ case 35:
+ return -1;
+ case 176:
+ case 177:
+ case 7:
+ case 155:
+ case 8:
+ case 157:
+ case 125:
+ case 126:
+ case 92:
+ case 93:
+ case 129:
+ case 130:
+ case 131:
+ case 94:
+ case 91:
+ return 1;
+ case 74:
+ case 60:
+ case 69:
+ case 70:
+ case 4:
+ return 1024;
+ case 31:
+ case 42:
+ case 72:
+ return 32;
+ case 87:
+ case 26:
+ case 33:
+ return 2147483647;
+ case 34:
+ case 1:
+ return 47839;
+ case 38:
+ case 36:
+ return 99;
+ case 43:
+ case 37:
+ return 2048;
+ case 0: return 2097152;
+ case 3: return 65536;
+ case 28: return 32768;
+ case 44: return 32767;
+ case 75: return 16384;
+ case 39: return 1000;
+ case 89: return 700;
+ case 71: return 256;
+ case 40: return 255;
+ case 2: return 100;
+ case 180: return 64;
+ case 25: return 20;
+ case 5: return 16;
+ case 6: return 6;
+ case 73: return 4;
+ case 84: return 1;
+ }
+ ___setErrNo(ERRNO_CODES.EINVAL);
+ return -1;
+ }
+
+
+ Module["_memset"] = _memset;
+
+ function ___errno_location() {
+ return ___errno_state;
+ }
+
+ function _abort() {
+ Module['abort']();
+ }
+
+ var Browser={mainLoop:{scheduler:null,method:"",shouldPause:false,paused:false,queue:[],pause:function () {
+ Browser.mainLoop.shouldPause = true;
+ },resume:function () {
+ if (Browser.mainLoop.paused) {
+ Browser.mainLoop.paused = false;
+ Browser.mainLoop.scheduler();
+ }
+ Browser.mainLoop.shouldPause = false;
+ },updateStatus:function () {
+ if (Module['setStatus']) {
+ var message = Module['statusMessage'] || 'Please wait...';
+ var remaining = Browser.mainLoop.remainingBlockers;
+ var expected = Browser.mainLoop.expectedBlockers;
+ if (remaining) {
+ if (remaining < expected) {
+ Module['setStatus'](message + ' (' + (expected - remaining) + '/' + expected + ')');
+ } else {
+ Module['setStatus'](message);
+ }
+ } else {
+ Module['setStatus']('');
+ }
+ }
+ }},isFullScreen:false,pointerLock:false,moduleContextCreatedCallbacks:[],workers:[],init:function () {
+ if (!Module["preloadPlugins"]) Module["preloadPlugins"] = []; // needs to exist even in workers
+
+ if (Browser.initted || ENVIRONMENT_IS_WORKER) return;
+ Browser.initted = true;
+
+ try {
+ new Blob();
+ Browser.hasBlobConstructor = true;
+ } catch(e) {
+ Browser.hasBlobConstructor = false;
+ console.log("warning: no blob constructor, cannot create blobs with mimetypes");
+ }
+ Browser.BlobBuilder = typeof MozBlobBuilder != "undefined" ? MozBlobBuilder : (typeof WebKitBlobBuilder != "undefined" ? WebKitBlobBuilder : (!Browser.hasBlobConstructor ? console.log("warning: no BlobBuilder") : null));
+ Browser.URLObject = typeof window != "undefined" ? (window.URL ? window.URL : window.webkitURL) : undefined;
+ if (!Module.noImageDecoding && typeof Browser.URLObject === 'undefined') {
+ console.log("warning: Browser does not support creating object URLs. Built-in browser image decoding will not be available.");
+ Module.noImageDecoding = true;
+ }
+
+ // Support for plugins that can process preloaded files. You can add more of these to
+ // your app by creating and appending to Module.preloadPlugins.
+ //
+ // Each plugin is asked if it can handle a file based on the file's name. If it can,
+ // it is given the file's raw data. When it is done, it calls a callback with the file's
+ // (possibly modified) data. For example, a plugin might decompress a file, or it
+ // might create some side data structure for use later (like an Image element, etc.).
+
+ var imagePlugin = {};
+ imagePlugin['canHandle'] = function imagePlugin_canHandle(name) {
+ return !Module.noImageDecoding && /\.(jpg|jpeg|png|bmp)$/i.test(name);
+ };
+ imagePlugin['handle'] = function imagePlugin_handle(byteArray, name, onload, onerror) {
+ var b = null;
+ if (Browser.hasBlobConstructor) {
+ try {
+ b = new Blob([byteArray], { type: Browser.getMimetype(name) });
+ if (b.size !== byteArray.length) { // Safari bug #118630
+ // Safari's Blob can only take an ArrayBuffer
+ b = new Blob([(new Uint8Array(byteArray)).buffer], { type: Browser.getMimetype(name) });
+ }
+ } catch(e) {
+ Runtime.warnOnce('Blob constructor present but fails: ' + e + '; falling back to blob builder');
+ }
+ }
+ if (!b) {
+ var bb = new Browser.BlobBuilder();
+ bb.append((new Uint8Array(byteArray)).buffer); // we need to pass a buffer, and must copy the array to get the right data range
+ b = bb.getBlob();
+ }
+ var url = Browser.URLObject.createObjectURL(b);
+ var img = new Image();
+ img.onload = function img_onload() {
+ assert(img.complete, 'Image ' + name + ' could not be decoded');
+ var canvas = document.createElement('canvas');
+ canvas.width = img.width;
+ canvas.height = img.height;
+ var ctx = canvas.getContext('2d');
+ ctx.drawImage(img, 0, 0);
+ Module["preloadedImages"][name] = canvas;
+ Browser.URLObject.revokeObjectURL(url);
+ if (onload) onload(byteArray);
+ };
+ img.onerror = function img_onerror(event) {
+ console.log('Image ' + url + ' could not be decoded');
+ if (onerror) onerror();
+ };
+ img.src = url;
+ };
+ Module['preloadPlugins'].push(imagePlugin);
+
+ var audioPlugin = {};
+ audioPlugin['canHandle'] = function audioPlugin_canHandle(name) {
+ return !Module.noAudioDecoding && name.substr(-4) in { '.ogg': 1, '.wav': 1, '.mp3': 1 };
+ };
+ audioPlugin['handle'] = function audioPlugin_handle(byteArray, name, onload, onerror) {
+ var done = false;
+ function finish(audio) {
+ if (done) return;
+ done = true;
+ Module["preloadedAudios"][name] = audio;
+ if (onload) onload(byteArray);
+ }
+ function fail() {
+ if (done) return;
+ done = true;
+ Module["preloadedAudios"][name] = new Audio(); // empty shim
+ if (onerror) onerror();
+ }
+ if (Browser.hasBlobConstructor) {
+ try {
+ var b = new Blob([byteArray], { type: Browser.getMimetype(name) });
+ } catch(e) {
+ return fail();
+ }
+ var url = Browser.URLObject.createObjectURL(b); // XXX we never revoke this!
+ var audio = new Audio();
+ audio.addEventListener('canplaythrough', function() { finish(audio) }, false); // use addEventListener due to chromium bug 124926
+ audio.onerror = function audio_onerror(event) {
+ if (done) return;
+ console.log('warning: browser could not fully decode audio ' + name + ', trying slower base64 approach');
+ function encode64(data) {
+ var BASE = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
+ var PAD = '=';
+ var ret = '';
+ var leftchar = 0;
+ var leftbits = 0;
+ for (var i = 0; i < data.length; i++) {
+ leftchar = (leftchar << 8) | data[i];
+ leftbits += 8;
+ while (leftbits >= 6) {
+ var curr = (leftchar >> (leftbits-6)) & 0x3f;
+ leftbits -= 6;
+ ret += BASE[curr];
+ }
+ }
+ if (leftbits == 2) {
+ ret += BASE[(leftchar&3) << 4];
+ ret += PAD + PAD;
+ } else if (leftbits == 4) {
+ ret += BASE[(leftchar&0xf) << 2];
+ ret += PAD;
+ }
+ return ret;
+ }
+ audio.src = 'data:audio/x-' + name.substr(-3) + ';base64,' + encode64(byteArray);
+ finish(audio); // we don't wait for confirmation this worked - but it's worth trying
+ };
+ audio.src = url;
+ // workaround for chrome bug 124926 - we do not always get oncanplaythrough or onerror
+ Browser.safeSetTimeout(function() {
+ finish(audio); // try to use it even though it is not necessarily ready to play
+ }, 10000);
+ } else {
+ return fail();
+ }
+ };
+ Module['preloadPlugins'].push(audioPlugin);
+
+ // Canvas event setup
+
+ var canvas = Module['canvas'];
+
+ // forced aspect ratio can be enabled by defining 'forcedAspectRatio' on Module
+ // Module['forcedAspectRatio'] = 4 / 3;
+
+ canvas.requestPointerLock = canvas['requestPointerLock'] ||
+ canvas['mozRequestPointerLock'] ||
+ canvas['webkitRequestPointerLock'] ||
+ canvas['msRequestPointerLock'] ||
+ function(){};
+ canvas.exitPointerLock = document['exitPointerLock'] ||
+ document['mozExitPointerLock'] ||
+ document['webkitExitPointerLock'] ||
+ document['msExitPointerLock'] ||
+ function(){}; // no-op if function does not exist
+ canvas.exitPointerLock = canvas.exitPointerLock.bind(document);
+
+ function pointerLockChange() {
+ Browser.pointerLock = document['pointerLockElement'] === canvas ||
+ document['mozPointerLockElement'] === canvas ||
+ document['webkitPointerLockElement'] === canvas ||
+ document['msPointerLockElement'] === canvas;
+ }
+
+ document.addEventListener('pointerlockchange', pointerLockChange, false);
+ document.addEventListener('mozpointerlockchange', pointerLockChange, false);
+ document.addEventListener('webkitpointerlockchange', pointerLockChange, false);
+ document.addEventListener('mspointerlockchange', pointerLockChange, false);
+
+ if (Module['elementPointerLock']) {
+ canvas.addEventListener("click", function(ev) {
+ if (!Browser.pointerLock && canvas.requestPointerLock) {
+ canvas.requestPointerLock();
+ ev.preventDefault();
+ }
+ }, false);
+ }
+ },createContext:function (canvas, useWebGL, setInModule, webGLContextAttributes) {
+ var ctx;
+ var errorInfo = '?';
+ function onContextCreationError(event) {
+ errorInfo = event.statusMessage || errorInfo;
+ }
+ try {
+ if (useWebGL) {
+ var contextAttributes = {
+ antialias: false,
+ alpha: false
+ };
+
+ if (webGLContextAttributes) {
+ for (var attribute in webGLContextAttributes) {
+ contextAttributes[attribute] = webGLContextAttributes[attribute];
+ }
+ }
+
+
+ canvas.addEventListener('webglcontextcreationerror', onContextCreationError, false);
+ try {
+ ['experimental-webgl', 'webgl'].some(function(webglId) {
+ return ctx = canvas.getContext(webglId, contextAttributes);
+ });
+ } finally {
+ canvas.removeEventListener('webglcontextcreationerror', onContextCreationError, false);
+ }
+ } else {
+ ctx = canvas.getContext('2d');
+ }
+ if (!ctx) throw ':(';
+ } catch (e) {
+ Module.print('Could not create canvas: ' + [errorInfo, e]);
+ return null;
+ }
+ if (useWebGL) {
+ // Set the background of the WebGL canvas to black
+ canvas.style.backgroundColor = "black";
+
+ // Warn on context loss
+ canvas.addEventListener('webglcontextlost', function(event) {
+ alert('WebGL context lost. You will need to reload the page.');
+ }, false);
+ }
+ if (setInModule) {
+ GLctx = Module.ctx = ctx;
+ Module.useWebGL = useWebGL;
+ Browser.moduleContextCreatedCallbacks.forEach(function(callback) { callback() });
+ Browser.init();
+ }
+ return ctx;
+ },destroyContext:function (canvas, useWebGL, setInModule) {},fullScreenHandlersInstalled:false,lockPointer:undefined,resizeCanvas:undefined,requestFullScreen:function (lockPointer, resizeCanvas) {
+ Browser.lockPointer = lockPointer;
+ Browser.resizeCanvas = resizeCanvas;
+ if (typeof Browser.lockPointer === 'undefined') Browser.lockPointer = true;
+ if (typeof Browser.resizeCanvas === 'undefined') Browser.resizeCanvas = false;
+
+ var canvas = Module['canvas'];
+ function fullScreenChange() {
+ Browser.isFullScreen = false;
+ var canvasContainer = canvas.parentNode;
+ if ((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
+ document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
+ document['fullScreenElement'] || document['fullscreenElement'] ||
+ document['msFullScreenElement'] || document['msFullscreenElement'] ||
+ document['webkitCurrentFullScreenElement']) === canvasContainer) {
+ canvas.cancelFullScreen = document['cancelFullScreen'] ||
+ document['mozCancelFullScreen'] ||
+ document['webkitCancelFullScreen'] ||
+ document['msExitFullscreen'] ||
+ document['exitFullscreen'] ||
+ function() {};
+ canvas.cancelFullScreen = canvas.cancelFullScreen.bind(document);
+ if (Browser.lockPointer) canvas.requestPointerLock();
+ Browser.isFullScreen = true;
+ if (Browser.resizeCanvas) Browser.setFullScreenCanvasSize();
+ } else {
+
+ // remove the full screen specific parent of the canvas again to restore the HTML structure from before going full screen
+ canvasContainer.parentNode.insertBefore(canvas, canvasContainer);
+ canvasContainer.parentNode.removeChild(canvasContainer);
+
+ if (Browser.resizeCanvas) Browser.setWindowedCanvasSize();
+ }
+ if (Module['onFullScreen']) Module['onFullScreen'](Browser.isFullScreen);
+ Browser.updateCanvasDimensions(canvas);
+ }
+
+ if (!Browser.fullScreenHandlersInstalled) {
+ Browser.fullScreenHandlersInstalled = true;
+ document.addEventListener('fullscreenchange', fullScreenChange, false);
+ document.addEventListener('mozfullscreenchange', fullScreenChange, false);
+ document.addEventListener('webkitfullscreenchange', fullScreenChange, false);
+ document.addEventListener('MSFullscreenChange', fullScreenChange, false);
+ }
+
+ // create a new parent to ensure the canvas has no siblings. this allows browsers to optimize full screen performance when its parent is the full screen root
+ var canvasContainer = document.createElement("div");
+ canvas.parentNode.insertBefore(canvasContainer, canvas);
+ canvasContainer.appendChild(canvas);
+
+ // use parent of canvas as full screen root to allow aspect ratio correction (Firefox stretches the root to screen size)
+ canvasContainer.requestFullScreen = canvasContainer['requestFullScreen'] ||
+ canvasContainer['mozRequestFullScreen'] ||
+ canvasContainer['msRequestFullscreen'] ||
+ (canvasContainer['webkitRequestFullScreen'] ? function() { canvasContainer['webkitRequestFullScreen'](Element['ALLOW_KEYBOARD_INPUT']) } : null);
+ canvasContainer.requestFullScreen();
+ },requestAnimationFrame:function requestAnimationFrame(func) {
+ if (typeof window === 'undefined') { // Provide fallback to setTimeout if window is undefined (e.g. in Node.js)
+ setTimeout(func, 1000/60);
+ } else {
+ if (!window.requestAnimationFrame) {
+ window.requestAnimationFrame = window['requestAnimationFrame'] ||
+ window['mozRequestAnimationFrame'] ||
+ window['webkitRequestAnimationFrame'] ||
+ window['msRequestAnimationFrame'] ||
+ window['oRequestAnimationFrame'] ||
+ window['setTimeout'];
+ }
+ window.requestAnimationFrame(func);
+ }
+ },safeCallback:function (func) {
+ return function() {
+ if (!ABORT) return func.apply(null, arguments);
+ };
+ },safeRequestAnimationFrame:function (func) {
+ return Browser.requestAnimationFrame(function() {
+ if (!ABORT) func();
+ });
+ },safeSetTimeout:function (func, timeout) {
+ return setTimeout(function() {
+ if (!ABORT) func();
+ }, timeout);
+ },safeSetInterval:function (func, timeout) {
+ return setInterval(function() {
+ if (!ABORT) func();
+ }, timeout);
+ },getMimetype:function (name) {
+ return {
+ 'jpg': 'image/jpeg',
+ 'jpeg': 'image/jpeg',
+ 'png': 'image/png',
+ 'bmp': 'image/bmp',
+ 'ogg': 'audio/ogg',
+ 'wav': 'audio/wav',
+ 'mp3': 'audio/mpeg'
+ }[name.substr(name.lastIndexOf('.')+1)];
+ },getUserMedia:function (func) {
+ if(!window.getUserMedia) {
+ window.getUserMedia = navigator['getUserMedia'] ||
+ navigator['mozGetUserMedia'];
+ }
+ window.getUserMedia(func);
+ },getMovementX:function (event) {
+ return event['movementX'] ||
+ event['mozMovementX'] ||
+ event['webkitMovementX'] ||
+ 0;
+ },getMovementY:function (event) {
+ return event['movementY'] ||
+ event['mozMovementY'] ||
+ event['webkitMovementY'] ||
+ 0;
+ },getMouseWheelDelta:function (event) {
+ return Math.max(-1, Math.min(1, event.type === 'DOMMouseScroll' ? event.detail : -event.wheelDelta));
+ },mouseX:0,mouseY:0,mouseMovementX:0,mouseMovementY:0,calculateMouseEvent:function (event) { // event should be mousemove, mousedown or mouseup
+ if (Browser.pointerLock) {
+ // When the pointer is locked, calculate the coordinates
+ // based on the movement of the mouse.
+ // Workaround for Firefox bug 764498
+ if (event.type != 'mousemove' &&
+ ('mozMovementX' in event)) {
+ Browser.mouseMovementX = Browser.mouseMovementY = 0;
+ } else {
+ Browser.mouseMovementX = Browser.getMovementX(event);
+ Browser.mouseMovementY = Browser.getMovementY(event);
+ }
+
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ Browser.mouseX = SDL.mouseX + Browser.mouseMovementX;
+ Browser.mouseY = SDL.mouseY + Browser.mouseMovementY;
+ } else {
+ // just add the mouse delta to the current absolut mouse position
+ // FIXME: ideally this should be clamped against the canvas size and zero
+ Browser.mouseX += Browser.mouseMovementX;
+ Browser.mouseY += Browser.mouseMovementY;
+ }
+ } else {
+ // Otherwise, calculate the movement based on the changes
+ // in the coordinates.
+ var rect = Module["canvas"].getBoundingClientRect();
+ var x, y;
+
+ // Neither .scrollX or .pageXOffset are defined in a spec, but
+ // we prefer .scrollX because it is currently in a spec draft.
+ // (see: http://www.w3.org/TR/2013/WD-cssom-view-20131217/)
+ var scrollX = ((typeof window.scrollX !== 'undefined') ? window.scrollX : window.pageXOffset);
+ var scrollY = ((typeof window.scrollY !== 'undefined') ? window.scrollY : window.pageYOffset);
+ if (event.type == 'touchstart' ||
+ event.type == 'touchend' ||
+ event.type == 'touchmove') {
+ var t = event.touches.item(0);
+ if (t) {
+ x = t.pageX - (scrollX + rect.left);
+ y = t.pageY - (scrollY + rect.top);
+ } else {
+ return;
+ }
+ } else {
+ x = event.pageX - (scrollX + rect.left);
+ y = event.pageY - (scrollY + rect.top);
+ }
+
+ // the canvas might be CSS-scaled compared to its backbuffer;
+ // SDL-using content will want mouse coordinates in terms
+ // of backbuffer units.
+ var cw = Module["canvas"].width;
+ var ch = Module["canvas"].height;
+ x = x * (cw / rect.width);
+ y = y * (ch / rect.height);
+
+ Browser.mouseMovementX = x - Browser.mouseX;
+ Browser.mouseMovementY = y - Browser.mouseY;
+ Browser.mouseX = x;
+ Browser.mouseY = y;
+ }
+ },xhrLoad:function (url, onload, onerror) {
+ var xhr = new XMLHttpRequest();
+ xhr.open('GET', url, true);
+ xhr.responseType = 'arraybuffer';
+ xhr.onload = function xhr_onload() {
+ if (xhr.status == 200 || (xhr.status == 0 && xhr.response)) { // file URLs can return 0
+ onload(xhr.response);
+ } else {
+ onerror();
+ }
+ };
+ xhr.onerror = onerror;
+ xhr.send(null);
+ },asyncLoad:function (url, onload, onerror, noRunDep) {
+ Browser.xhrLoad(url, function(arrayBuffer) {
+ assert(arrayBuffer, 'Loading data file "' + url + '" failed (no arrayBuffer).');
+ onload(new Uint8Array(arrayBuffer));
+ if (!noRunDep) removeRunDependency('al ' + url);
+ }, function(event) {
+ if (onerror) {
+ onerror();
+ } else {
+ throw 'Loading data file "' + url + '" failed.';
+ }
+ });
+ if (!noRunDep) addRunDependency('al ' + url);
+ },resizeListeners:[],updateResizeListeners:function () {
+ var canvas = Module['canvas'];
+ Browser.resizeListeners.forEach(function(listener) {
+ listener(canvas.width, canvas.height);
+ });
+ },setCanvasSize:function (width, height, noUpdates) {
+ var canvas = Module['canvas'];
+ Browser.updateCanvasDimensions(canvas, width, height);
+ if (!noUpdates) Browser.updateResizeListeners();
+ },windowedWidth:0,windowedHeight:0,setFullScreenCanvasSize:function () {
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
+ flags = flags | 0x00800000; // set SDL_FULLSCREEN flag
+ HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
+ }
+ Browser.updateResizeListeners();
+ },setWindowedCanvasSize:function () {
+ // check if SDL is available
+ if (typeof SDL != "undefined") {
+ var flags = HEAPU32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)];
+ flags = flags & ~0x00800000; // clear SDL_FULLSCREEN flag
+ HEAP32[((SDL.screen+Runtime.QUANTUM_SIZE*0)>>2)]=flags
+ }
+ Browser.updateResizeListeners();
+ },updateCanvasDimensions:function (canvas, wNative, hNative) {
+ if (wNative && hNative) {
+ canvas.widthNative = wNative;
+ canvas.heightNative = hNative;
+ } else {
+ wNative = canvas.widthNative;
+ hNative = canvas.heightNative;
+ }
+ var w = wNative;
+ var h = hNative;
+ if (Module['forcedAspectRatio'] && Module['forcedAspectRatio'] > 0) {
+ if (w/h < Module['forcedAspectRatio']) {
+ w = Math.round(h * Module['forcedAspectRatio']);
+ } else {
+ h = Math.round(w / Module['forcedAspectRatio']);
+ }
+ }
+ if (((document['webkitFullScreenElement'] || document['webkitFullscreenElement'] ||
+ document['mozFullScreenElement'] || document['mozFullscreenElement'] ||
+ document['fullScreenElement'] || document['fullscreenElement'] ||
+ document['msFullScreenElement'] || document['msFullscreenElement'] ||
+ document['webkitCurrentFullScreenElement']) === canvas.parentNode) && (typeof screen != 'undefined')) {
+ var factor = Math.min(screen.width / w, screen.height / h);
+ w = Math.round(w * factor);
+ h = Math.round(h * factor);
+ }
+ if (Browser.resizeCanvas) {
+ if (canvas.width != w) canvas.width = w;
+ if (canvas.height != h) canvas.height = h;
+ if (typeof canvas.style != 'undefined') {
+ canvas.style.removeProperty( "width");
+ canvas.style.removeProperty("height");
+ }
+ } else {
+ if (canvas.width != wNative) canvas.width = wNative;
+ if (canvas.height != hNative) canvas.height = hNative;
+ if (typeof canvas.style != 'undefined') {
+ if (w != wNative || h != hNative) {
+ canvas.style.setProperty( "width", w + "px", "important");
+ canvas.style.setProperty("height", h + "px", "important");
+ } else {
+ canvas.style.removeProperty( "width");
+ canvas.style.removeProperty("height");
+ }
+ }
+ }
+ }};
+
+ function _sbrk(bytes) {
+ // Implement a Linux-like 'memory area' for our 'process'.
+ // Changes the size of the memory area by |bytes|; returns the
+ // address of the previous top ('break') of the memory area
+ // We control the "dynamic" memory - DYNAMIC_BASE to DYNAMICTOP
+ var self = _sbrk;
+ if (!self.called) {
+ DYNAMICTOP = alignMemoryPage(DYNAMICTOP); // make sure we start out aligned
+ self.called = true;
+ assert(Runtime.dynamicAlloc);
+ self.alloc = Runtime.dynamicAlloc;
+ Runtime.dynamicAlloc = function() { abort('cannot dynamically allocate, sbrk now has control') };
+ }
+ var ret = DYNAMICTOP;
+ if (bytes != 0) self.alloc(bytes);
+ return ret; // Previous break location.
+ }
+
+ function ___assert_fail(condition, filename, line, func) {
+ ABORT = true;
+ throw 'Assertion failed: ' + Pointer_stringify(condition) + ', at: ' + [filename ? Pointer_stringify(filename) : 'unknown filename', line, func ? Pointer_stringify(func) : 'unknown function'] + ' at ' + stackTrace();
+ }
+
+ function _time(ptr) {
+ var ret = Math.floor(Date.now()/1000);
+ if (ptr) {
+ HEAP32[((ptr)>>2)]=ret;
+ }
+ return ret;
+ }
+
+ function _llvm_bswap_i32(x) {
+ return ((x&0xff)<<24) | (((x>>8)&0xff)<<16) | (((x>>16)&0xff)<<8) | (x>>>24);
+ }
+
+
+
+ function _emscripten_memcpy_big(dest, src, num) {
+ HEAPU8.set(HEAPU8.subarray(src, src+num), dest);
+ return dest;
+ }
+ Module["_memcpy"] = _memcpy;
+FS.staticInit();__ATINIT__.unshift({ func: function() { if (!Module["noFSInit"] && !FS.init.initialized) FS.init() } });__ATMAIN__.push({ func: function() { FS.ignorePermissions = false } });__ATEXIT__.push({ func: function() { FS.quit() } });Module["FS_createFolder"] = FS.createFolder;Module["FS_createPath"] = FS.createPath;Module["FS_createDataFile"] = FS.createDataFile;Module["FS_createPreloadedFile"] = FS.createPreloadedFile;Module["FS_createLazyFile"] = FS.createLazyFile;Module["FS_createLink"] = FS.createLink;Module["FS_createDevice"] = FS.createDevice;
+___errno_state = Runtime.staticAlloc(4); HEAP32[((___errno_state)>>2)]=0;
+__ATINIT__.unshift({ func: function() { TTY.init() } });__ATEXIT__.push({ func: function() { TTY.shutdown() } });TTY.utf8 = new Runtime.UTF8Processor();
+if (ENVIRONMENT_IS_NODE) { var fs = require("fs"); NODEFS.staticInit(); }
+__ATINIT__.push({ func: function() { SOCKFS.root = FS.mount(SOCKFS, {}, null); } });
+_fputc.ret = allocate([0], "i8", ALLOC_STATIC);
+Module["requestFullScreen"] = function Module_requestFullScreen(lockPointer, resizeCanvas) { Browser.requestFullScreen(lockPointer, resizeCanvas) };
+ Module["requestAnimationFrame"] = function Module_requestAnimationFrame(func) { Browser.requestAnimationFrame(func) };
+ Module["setCanvasSize"] = function Module_setCanvasSize(width, height, noUpdates) { Browser.setCanvasSize(width, height, noUpdates) };
+ Module["pauseMainLoop"] = function Module_pauseMainLoop() { Browser.mainLoop.pause() };
+ Module["resumeMainLoop"] = function Module_resumeMainLoop() { Browser.mainLoop.resume() };
+ Module["getUserMedia"] = function Module_getUserMedia() { Browser.getUserMedia() }
+STACK_BASE = STACKTOP = Runtime.alignMemory(STATICTOP);
+
+staticSealed = true; // seal the static portion of memory
+
+STACK_MAX = STACK_BASE + 5242880;
+
+DYNAMIC_BASE = DYNAMICTOP = Runtime.alignMemory(STACK_MAX);
+
+assert(DYNAMIC_BASE < TOTAL_MEMORY, "TOTAL_MEMORY not big enough for stack");
+
+
+var Math_min = Math.min;
+function invoke_iiii(index,a1,a2,a3) {
+ try {
+ return Module["dynCall_iiii"](index,a1,a2,a3);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function invoke_vii(index,a1,a2) {
+ try {
+ Module["dynCall_vii"](index,a1,a2);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function invoke_iii(index,a1,a2) {
+ try {
+ return Module["dynCall_iii"](index,a1,a2);
+ } catch(e) {
+ if (typeof e !== 'number' && e !== 'longjmp') throw e;
+ asm["setThrew"](1, 0);
+ }
+}
+
+function asmPrintInt(x, y) {
+ Module.print('int ' + x + ',' + y);// + ' ' + new Error().stack);
+}
+function asmPrintFloat(x, y) {
+ Module.print('float ' + x + ',' + y);// + ' ' + new Error().stack);
+}
+// EMSCRIPTEN_START_ASM
+var asm = Wasm.instantiateModuleFromAsm((function Module(global, env, buffer) {
+ 'use asm';
+ var HEAP8 = new global.Int8Array(buffer);
+ var HEAP16 = new global.Int16Array(buffer);
+ var HEAP32 = new global.Int32Array(buffer);
+ var HEAPU8 = new global.Uint8Array(buffer);
+ var HEAPU16 = new global.Uint16Array(buffer);
+ var HEAPU32 = new global.Uint32Array(buffer);
+ var HEAPF32 = new global.Float32Array(buffer);
+ var HEAPF64 = new global.Float64Array(buffer);
+
+ var STACKTOP=env.STACKTOP|0;
+ var STACK_MAX=env.STACK_MAX|0;
+ var tempDoublePtr=env.tempDoublePtr|0;
+ var ABORT=env.ABORT|0;
+
+ var __THREW__ = 0;
+ var threwValue = 0;
+ var setjmpId = 0;
+ var undef = 0;
+ var nan = +env.NaN, inf = +env.Infinity;
+ var tempInt = 0, tempBigInt = 0, tempBigIntP = 0, tempBigIntS = 0, tempBigIntR = 0.0, tempBigIntI = 0, tempBigIntD = 0, tempValue = 0, tempDouble = 0.0;
+
+ var tempRet0 = 0;
+ var tempRet1 = 0;
+ var tempRet2 = 0;
+ var tempRet3 = 0;
+ var tempRet4 = 0;
+ var tempRet5 = 0;
+ var tempRet6 = 0;
+ var tempRet7 = 0;
+ var tempRet8 = 0;
+ var tempRet9 = 0;
+ var Math_floor=global.Math.floor;
+ var Math_abs=global.Math.abs;
+ var Math_sqrt=global.Math.sqrt;
+ var Math_pow=global.Math.pow;
+ var Math_cos=global.Math.cos;
+ var Math_sin=global.Math.sin;
+ var Math_tan=global.Math.tan;
+ var Math_acos=global.Math.acos;
+ var Math_asin=global.Math.asin;
+ var Math_atan=global.Math.atan;
+ var Math_atan2=global.Math.atan2;
+ var Math_exp=global.Math.exp;
+ var Math_log=global.Math.log;
+ var Math_ceil=global.Math.ceil;
+ var Math_imul=global.Math.imul;
+ var abort=env.abort;
+ var assert=env.assert;
+ var asmPrintInt=env.asmPrintInt;
+ var asmPrintFloat=env.asmPrintFloat;
+ var Math_min=env.min;
+ var invoke_iiii=env.invoke_iiii;
+ var invoke_vii=env.invoke_vii;
+ var invoke_iii=env.invoke_iii;
+ var _send=env._send;
+ var ___setErrNo=env.___setErrNo;
+ var ___assert_fail=env.___assert_fail;
+ var _fflush=env._fflush;
+ var _pwrite=env._pwrite;
+ var __reallyNegative=env.__reallyNegative;
+ var _sbrk=env._sbrk;
+ var ___errno_location=env.___errno_location;
+ var _emscripten_memcpy_big=env._emscripten_memcpy_big;
+ var _fileno=env._fileno;
+ var _sysconf=env._sysconf;
+ var _puts=env._puts;
+ var _mkport=env._mkport;
+ var _write=env._write;
+ var _llvm_bswap_i32=env._llvm_bswap_i32;
+ var _fputc=env._fputc;
+ var _abort=env._abort;
+ var _fwrite=env._fwrite;
+ var _time=env._time;
+ var _fprintf=env._fprintf;
+ var __formatString=env.__formatString;
+ var _fputs=env._fputs;
+ var _printf=env._printf;
+ var tempFloat = 0.0;
+
+// EMSCRIPTEN_START_FUNCS
+function _inflate(i2, i3) {
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ var i1 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0, i30 = 0, i31 = 0, i32 = 0, i33 = 0, i34 = 0, i35 = 0, i36 = 0, i37 = 0, i38 = 0, i39 = 0, i40 = 0, i41 = 0, i42 = 0, i43 = 0, i44 = 0, i45 = 0, i46 = 0, i47 = 0, i48 = 0, i49 = 0, i50 = 0, i51 = 0, i52 = 0, i53 = 0, i54 = 0, i55 = 0, i56 = 0, i57 = 0, i58 = 0, i59 = 0, i60 = 0, i61 = 0, i62 = 0, i63 = 0, i64 = 0, i65 = 0, i66 = 0, i67 = 0, i68 = 0, i69 = 0, i70 = 0, i71 = 0, i72 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i25 = i1;
+ if ((i2 | 0) == 0) {
+ i72 = -2;
+ STACKTOP = i1;
+ return i72 | 0;
+ }
+ i4 = HEAP32[i2 + 28 >> 2] | 0;
+ if ((i4 | 0) == 0) {
+ i72 = -2;
+ STACKTOP = i1;
+ return i72 | 0;
+ }
+ i8 = i2 + 12 | 0;
+ i19 = HEAP32[i8 >> 2] | 0;
+ if ((i19 | 0) == 0) {
+ i72 = -2;
+ STACKTOP = i1;
+ return i72 | 0;
+ }
+ i62 = HEAP32[i2 >> 2] | 0;
+ if ((i62 | 0) == 0 ? (HEAP32[i2 + 4 >> 2] | 0) != 0 : 0) {
+ i72 = -2;
+ STACKTOP = i1;
+ return i72 | 0;
+ }
+ i68 = HEAP32[i4 >> 2] | 0;
+ if ((i68 | 0) == 11) {
+ HEAP32[i4 >> 2] = 12;
+ i68 = 12;
+ i62 = HEAP32[i2 >> 2] | 0;
+ i19 = HEAP32[i8 >> 2] | 0;
+ }
+ i15 = i2 + 16 | 0;
+ i59 = HEAP32[i15 >> 2] | 0;
+ i16 = i2 + 4 | 0;
+ i5 = HEAP32[i16 >> 2] | 0;
+ i17 = i4 + 56 | 0;
+ i6 = i4 + 60 | 0;
+ i12 = i4 + 8 | 0;
+ i10 = i4 + 24 | 0;
+ i39 = i25 + 1 | 0;
+ i11 = i4 + 16 | 0;
+ i38 = i4 + 32 | 0;
+ i35 = i2 + 24 | 0;
+ i40 = i4 + 36 | 0;
+ i41 = i4 + 20 | 0;
+ i9 = i2 + 48 | 0;
+ i42 = i4 + 64 | 0;
+ i46 = i4 + 12 | 0;
+ i47 = (i3 + -5 | 0) >>> 0 < 2;
+ i7 = i4 + 4 | 0;
+ i48 = i4 + 76 | 0;
+ i49 = i4 + 84 | 0;
+ i50 = i4 + 80 | 0;
+ i51 = i4 + 88 | 0;
+ i43 = (i3 | 0) == 6;
+ i57 = i4 + 7108 | 0;
+ i37 = i4 + 72 | 0;
+ i58 = i4 + 7112 | 0;
+ i54 = i4 + 68 | 0;
+ i28 = i4 + 44 | 0;
+ i29 = i4 + 7104 | 0;
+ i30 = i4 + 48 | 0;
+ i31 = i4 + 52 | 0;
+ i18 = i4 + 40 | 0;
+ i13 = i2 + 20 | 0;
+ i14 = i4 + 28 | 0;
+ i32 = i4 + 96 | 0;
+ i33 = i4 + 100 | 0;
+ i34 = i4 + 92 | 0;
+ i36 = i4 + 104 | 0;
+ i52 = i4 + 1328 | 0;
+ i53 = i4 + 108 | 0;
+ i27 = i4 + 112 | 0;
+ i55 = i4 + 752 | 0;
+ i56 = i4 + 624 | 0;
+ i44 = i25 + 2 | 0;
+ i45 = i25 + 3 | 0;
+ i67 = HEAP32[i6 >> 2] | 0;
+ i65 = i5;
+ i64 = HEAP32[i17 >> 2] | 0;
+ i26 = i59;
+ i61 = 0;
+ L17 : while (1) {
+ L19 : do {
+ switch (i68 | 0) {
+ case 16:
+ {
+ if (i67 >>> 0 < 14) {
+ i63 = i67;
+ while (1) {
+ if ((i65 | 0) == 0) {
+ i65 = 0;
+ break L17;
+ }
+ i65 = i65 + -1 | 0;
+ i66 = i62 + 1 | 0;
+ i64 = (HEAPU8[i62] << i63) + i64 | 0;
+ i63 = i63 + 8 | 0;
+ if (i63 >>> 0 < 14) {
+ i62 = i66;
+ } else {
+ i62 = i66;
+ break;
+ }
+ }
+ } else {
+ i63 = i67;
+ }
+ i71 = (i64 & 31) + 257 | 0;
+ HEAP32[i32 >> 2] = i71;
+ i72 = (i64 >>> 5 & 31) + 1 | 0;
+ HEAP32[i33 >> 2] = i72;
+ HEAP32[i34 >> 2] = (i64 >>> 10 & 15) + 4;
+ i64 = i64 >>> 14;
+ i63 = i63 + -14 | 0;
+ if (i71 >>> 0 > 286 | i72 >>> 0 > 30) {
+ HEAP32[i35 >> 2] = 11616;
+ HEAP32[i4 >> 2] = 29;
+ i66 = i26;
+ break L19;
+ } else {
+ HEAP32[i36 >> 2] = 0;
+ HEAP32[i4 >> 2] = 17;
+ i66 = 0;
+ i60 = 154;
+ break L19;
+ }
+ }
+ case 2:
+ {
+ if (i67 >>> 0 < 32) {
+ i63 = i67;
+ i60 = 47;
+ } else {
+ i60 = 49;
+ }
+ break;
+ }
+ case 23:
+ {
+ i66 = HEAP32[i37 >> 2] | 0;
+ i63 = i67;
+ i60 = 240;
+ break;
+ }
+ case 18:
+ {
+ i63 = HEAP32[i36 >> 2] | 0;
+ i69 = i65;
+ i60 = 164;
+ break;
+ }
+ case 1:
+ {
+ if (i67 >>> 0 < 16) {
+ i63 = i67;
+ while (1) {
+ if ((i65 | 0) == 0) {
+ i65 = 0;
+ break L17;
+ }
+ i65 = i65 + -1 | 0;
+ i66 = i62 + 1 | 0;
+ i64 = (HEAPU8[i62] << i63) + i64 | 0;
+ i63 = i63 + 8 | 0;
+ if (i63 >>> 0 < 16) {
+ i62 = i66;
+ } else {
+ i62 = i66;
+ break;
+ }
+ }
+ } else {
+ i63 = i67;
+ }
+ HEAP32[i11 >> 2] = i64;
+ if ((i64 & 255 | 0) != 8) {
+ HEAP32[i35 >> 2] = 11448;
+ HEAP32[i4 >> 2] = 29;
+ i66 = i26;
+ break L19;
+ }
+ if ((i64 & 57344 | 0) != 0) {
+ HEAP32[i35 >> 2] = 11504;
+ HEAP32[i4 >> 2] = 29;
+ i66 = i26;
+ break L19;
+ }
+ i60 = HEAP32[i38 >> 2] | 0;
+ if ((i60 | 0) == 0) {
+ i60 = i64;
+ } else {
+ HEAP32[i60 >> 2] = i64 >>> 8 & 1;
+ i60 = HEAP32[i11 >> 2] | 0;
+ }
+ if ((i60 & 512 | 0) != 0) {
+ HEAP8[i25] = i64;
+ HEAP8[i39] = i64 >>> 8;
+ HEAP32[i10 >> 2] = _crc32(HEAP32[i10 >> 2] | 0, i25, 2) | 0;
+ }
+ HEAP32[i4 >> 2] = 2;
+ i63 = 0;
+ i64 = 0;
+ i60 = 47;
+ break;
+ }
+ case 8:
+ {
+ i63 = i67;
+ i60 = 109;
+ break;
+ }
+ case 22:
+ {
+ i63 = i67;
+ i60 = 228;
+ break;
+ }
+ case 24:
+ {
+ i63 = i67;
+ i60 = 246;
+ break;
+ }
+ case 19:
+ {
+ i63 = i67;
+ i60 = 201;
+ break;
+ }
+ case 20:
+ {
+ i63 = i67;
+ i60 = 202;
+ break;
+ }
+ case 21:
+ {
+ i66 = HEAP32[i37 >> 2] | 0;
+ i63 = i67;
+ i60 = 221;
+ break;
+ }
+ case 10:
+ {
+ i63 = i67;
+ i60 = 121;
+ break;
+ }
+ case 11:
+ {
+ i63 = i67;
+ i60 = 124;
+ break;
+ }
+ case 12:
+ {
+ i63 = i67;
+ i60 = 125;
+ break;
+ }
+ case 5:
+ {
+ i63 = i67;
+ i60 = 73;
+ break;
+ }
+ case 4:
+ {
+ i63 = i67;
+ i60 = 62;
+ break;
+ }
+ case 0:
+ {
+ i66 = HEAP32[i12 >> 2] | 0;
+ if ((i66 | 0) == 0) {
+ HEAP32[i4 >> 2] = 12;
+ i63 = i67;
+ i66 = i26;
+ break L19;
+ }
+ if (i67 >>> 0 < 16) {
+ i63 = i67;
+ while (1) {
+ if ((i65 | 0) == 0) {
+ i65 = 0;
+ break L17;
+ }
+ i65 = i65 + -1 | 0;
+ i67 = i62 + 1 | 0;
+ i64 = (HEAPU8[i62] << i63) + i64 | 0;
+ i63 = i63 + 8 | 0;
+ if (i63 >>> 0 < 16) {
+ i62 = i67;
+ } else {
+ i62 = i67;
+ break;
+ }
+ }
+ } else {
+ i63 = i67;
+ }
+ if ((i66 & 2 | 0) != 0 & (i64 | 0) == 35615) {
+ HEAP32[i10 >> 2] = _crc32(0, 0, 0) | 0;
+ HEAP8[i25] = 31;
+ HEAP8[i39] = -117;
+ HEAP32[i10 >> 2] = _crc32(HEAP32[i10 >> 2] | 0, i25, 2) | 0;
+ HEAP32[i4 >> 2] = 1;
+ i63 = 0;
+ i64 = 0;
+ i66 = i26;
+ break L19;
+ }
+ HEAP32[i11 >> 2] = 0;
+ i67 = HEAP32[i38 >> 2] | 0;
+ if ((i67 | 0) != 0) {
+ HEAP32[i67 + 48 >> 2] = -1;
+ i66 = HEAP32[i12 >> 2] | 0;
+ }
+ if ((i66 & 1 | 0) != 0 ? ((((i64 << 8 & 65280) + (i64 >>> 8) | 0) >>> 0) % 31 | 0 | 0) == 0 : 0) {
+ if ((i64 & 15 | 0) != 8) {
+ HEAP32[i35 >> 2] = 11448;
+ HEAP32[i4 >> 2] = 29;
+ i66 = i26;
+ break L19;
+ }
+ i66 = i64 >>> 4;
+ i63 = i63 + -4 | 0;
+ i68 = (i66 & 15) + 8 | 0;
+ i67 = HEAP32[i40 >> 2] | 0;
+ if ((i67 | 0) != 0) {
+ if (i68 >>> 0 > i67 >>> 0) {
+ HEAP32[i35 >> 2] = 11480;
+ HEAP32[i4 >> 2] = 29;
+ i64 = i66;
+ i66 = i26;
+ break L19;
+ }
+ } else {
+ HEAP32[i40 >> 2] = i68;
+ }
+ HEAP32[i41 >> 2] = 1 << i68;
+ i63 = _adler32(0, 0, 0) | 0;
+ HEAP32[i10 >> 2] = i63;
+ HEAP32[i9 >> 2] = i63;
+ HEAP32[i4 >> 2] = i64 >>> 12 & 2 ^ 11;
+ i63 = 0;
+ i64 = 0;
+ i66 = i26;
+ break L19;
+ }
+ HEAP32[i35 >> 2] = 11424;
+ HEAP32[i4 >> 2] = 29;
+ i66 = i26;
+ break;
+ }
+ case 26:
+ {
+ if ((HEAP32[i12 >> 2] | 0) != 0) {
+ if (i67 >>> 0 < 32) {
+ i63 = i67;
+ while (1) {
+ if ((i65 | 0) == 0) {
+ i65 = 0;
+ break L17;
+ }
+ i65 = i65 + -1 | 0;
+ i66 = i62 + 1 | 0;
+ i64 = (HEAPU8[i62] << i63) + i64 | 0;
+ i63 = i63 + 8 | 0;
+ if (i63 >>> 0 < 32) {
+ i62 = i66;
+ } else {
+ i62 = i66;
+ break;
+ }
+ }
+ } else {
+ i63 = i67;
+ }
+ i66 = i59 - i26 | 0;
+ HEAP32[i13 >> 2] = (HEAP32[i13 >> 2] | 0) + i66;
+ HEAP32[i14 >> 2] = (HEAP32[i14 >> 2] | 0) + i66;
+ if ((i59 | 0) != (i26 | 0)) {
+ i59 = HEAP32[i10 >> 2] | 0;
+ i67 = i19 + (0 - i66) | 0;
+ if ((HEAP32[i11 >> 2] | 0) == 0) {
+ i59 = _adler32(i59, i67, i66) | 0;
+ } else {
+ i59 = _crc32(i59, i67, i66) | 0;
+ }
+ HEAP32[i10 >> 2] = i59;
+ HEAP32[i9 >> 2] = i59;
+ }
+ if ((HEAP32[i11 >> 2] | 0) == 0) {
+ i59 = _llvm_bswap_i32(i64 | 0) | 0;
+ } else {
+ i59 = i64;
+ }
+ if ((i59 | 0) == (HEAP32[i10 >> 2] | 0)) {
+ i63 = 0;
+ i64 = 0;
+ i59 = i26;
+ } else {
+ HEAP32[i35 >> 2] = 11904;
+ HEAP32[i4 >> 2] = 29;
+ i66 = i26;
+ i59 = i26;
+ break L19;
+ }
+ } else {
+ i63 = i67;
+ }
+ HEAP32[i4 >> 2] = 27;
+ i60 = 277;
+ break;
+ }
+ case 27:
+ {
+ i63 = i67;
+ i60 = 277;
+ break;
+ }
+ case 28:
+ {
+ i63 = i67;
+ i61 = 1;
+ i60 = 285;
+ break L17;
+ }
+ case 29:
+ {
+ i63 = i67;
+ i61 = -3;
+ break L17;
+ }
+ case 25:
+ {
+ if ((i26 | 0) == 0) {
+ i63 = i67;
+ i26 = 0;
+ i60 = 285;
+ break L17;
+ }
+ HEAP8[i19] = HEAP32[i42 >> 2];
+ HEAP32[i4 >> 2] = 20;
+ i63 = i67;
+ i66 = i26 + -1 | 0;
+ i19 = i19 + 1 | 0;
+ break;
+ }
+ case 17:
+ {
+ i66 = HEAP32[i36 >> 2] | 0;
+ if (i66 >>> 0 < (HEAP32[i34 >> 2] | 0) >>> 0) {
+ i63 = i67;
+ i60 = 154;
+ } else {
+ i60 = 158;
+ }
+ break;
+ }
+ case 13:
+ {
+ i63 = i67 & 7;
+ i64 = i64 >>> i63;
+ i63 = i67 - i63 | 0;
+ if (i63 >>> 0 < 32) {
+ while (1) {
+ if ((i65 | 0) == 0) {
+ i65 = 0;
+ break L17;
+ }
+ i65 = i65 + -1 | 0;
+ i66 = i62 + 1 | 0;
+ i64 = (HEAPU8[i62] << i63) + i64 | 0;
+ i63 = i63 + 8 | 0;
+ if (i63 >>> 0 < 32) {
+ i62 = i66;
+ } else {
+ i62 = i66;
+ break;
+ }
+ }
+ }
+ i66 = i64 & 65535;
+ if ((i66 | 0) == (i64 >>> 16 ^ 65535 | 0)) {
+ HEAP32[i42 >> 2] = i66;
+ HEAP32[i4 >> 2] = 14;
+ if (i43) {
+ i63 = 0;
+ i64 = 0;
+ i60 = 285;
+ break L17;
+ } else {
+ i63 = 0;
+ i64 = 0;
+ i60 = 143;
+ break L19;
+ }
+ } else {
+ HEAP32[i35 >> 2] = 11584;
+ HEAP32[i4 >> 2] = 29;
+ i66 = i26;
+ break L19;
+ }
+ }
+ case 7:
+ {
+ i63 = i67;
+ i60 = 96;
+ break;
+ }
+ case 14:
+ {
+ i63 = i67;
+ i60 = 143;
+ break;
+ }
+ case 15:
+ {
+ i63 = i67;
+ i60 = 144;
+ break;
+ }
+ case 9:
+ {
+ if (i67 >>> 0 < 32) {
+ i63 = i67;
+ while (1) {
+ if ((i65 | 0) == 0) {
+ i65 = 0;
+ break L17;
+ }
+ i65 = i65 + -1 | 0;
+ i66 = i62 + 1 | 0;
+ i64 = (HEAPU8[i62] << i63) + i64 | 0;
+ i63 = i63 + 8 | 0;
+ if (i63 >>> 0 < 32) {
+ i62 = i66;
+ } else {
+ i62 = i66;
+ break;
+ }
+ }
+ }
+ i63 = _llvm_bswap_i32(i64 | 0) | 0;
+ HEAP32[i10 >> 2] = i63;
+ HEAP32[i9 >> 2] = i63;
+ HEAP32[i4 >> 2] = 10;
+ i63 = 0;
+ i64 = 0;
+ i60 = 121;
+ break;
+ }
+ case 30:
+ {
+ i60 = 299;
+ break L17;
+ }
+ case 6:
+ {
+ i63 = i67;
+ i60 = 83;
+ break;
+ }
+ case 3:
+ {
+ if (i67 >>> 0 < 16) {
+ i63 = i67;
+ i66 = i62;
+ i60 = 55;
+ } else {
+ i60 = 57;
+ }
+ break;
+ }
+ default:
+ {
+ i2 = -2;
+ i60 = 300;
+ break L17;
+ }
+ }
+ } while (0);
+ if ((i60 | 0) == 47) {
+ while (1) {
+ i60 = 0;
+ if ((i65 | 0) == 0) {
+ i65 = 0;
+ break L17;
+ }
+ i65 = i65 + -1 | 0;
+ i60 = i62 + 1 | 0;
+ i64 = (HEAPU8[i62] << i63) + i64 | 0;
+ i63 = i63 + 8 | 0;
+ if (i63 >>> 0 < 32) {
+ i62 = i60;
+ i60 = 47;
+ } else {
+ i62 = i60;
+ i60 = 49;
+ break;
+ }
+ }
+ } else if ((i60 | 0) == 121) {
+ if ((HEAP32[i46 >> 2] | 0) == 0) {
+ i60 = 122;
+ break;
+ }
+ i60 = _adler32(0, 0, 0) | 0;
+ HEAP32[i10 >> 2] = i60;
+ HEAP32[i9 >> 2] = i60;
+ HEAP32[i4 >> 2] = 11;
+ i60 = 124;
+ } else if ((i60 | 0) == 143) {
+ HEAP32[i4 >> 2] = 15;
+ i60 = 144;
+ } else if ((i60 | 0) == 154) {
+ while (1) {
+ i60 = 0;
+ if (i63 >>> 0 < 3) {
+ while (1) {
+ if ((i65 | 0) == 0) {
+ i65 = 0;
+ break L17;
+ }
+ i65 = i65 + -1 | 0;
+ i67 = i62 + 1 | 0;
+ i64 = (HEAPU8[i62] << i63) + i64 | 0;
+ i63 = i63 + 8 | 0;
+ if (i63 >>> 0 < 3) {
+ i62 = i67;
+ } else {
+ i62 = i67;
+ break;
+ }
+ }
+ }
+ HEAP32[i36 >> 2] = i66 + 1;
+ HEAP16[i4 + (HEAPU16[11384 + (i66 << 1) >> 1] << 1) + 112 >> 1] = i64 & 7;
+ i64 = i64 >>> 3;
+ i63 = i63 + -3 | 0;
+ i66 = HEAP32[i36 >> 2] | 0;
+ if (i66 >>> 0 < (HEAP32[i34 >> 2] | 0) >>> 0) {
+ i60 = 154;
+ } else {
+ i67 = i63;
+ i60 = 158;
+ break;
+ }
+ }
+ } else if ((i60 | 0) == 277) {
+ i60 = 0;
+ if ((HEAP32[i12 >> 2] | 0) == 0) {
+ i60 = 284;
+ break;
+ }
+ if ((HEAP32[i11 >> 2] | 0) == 0) {
+ i60 = 284;
+ break;
+ }
+ if (i63 >>> 0 < 32) {
+ i66 = i62;
+ while (1) {
+ if ((i65 | 0) == 0) {
+ i65 = 0;
+ i62 = i66;
+ break L17;
+ }
+ i65 = i65 + -1 | 0;
+ i62 = i66 + 1 | 0;
+ i64 = (HEAPU8[i66] << i63) + i64 | 0;
+ i63 = i63 + 8 | 0;
+ if (i63 >>> 0 < 32) {
+ i66 = i62;
+ } else {
+ break;
+ }
+ }
+ }
+ if ((i64 | 0) == (HEAP32[i14 >> 2] | 0)) {
+ i63 = 0;
+ i64 = 0;
+ i60 = 284;
+ break;
+ }
+ HEAP32[i35 >> 2] = 11928;
+ HEAP32[i4 >> 2] = 29;
+ i66 = i26;
+ }
+ do {
+ if ((i60 | 0) == 49) {
+ i60 = HEAP32[i38 >> 2] | 0;
+ if ((i60 | 0) != 0) {
+ HEAP32[i60 + 4 >> 2] = i64;
+ }
+ if ((HEAP32[i11 >> 2] & 512 | 0) != 0) {
+ HEAP8[i25] = i64;
+ HEAP8[i39] = i64 >>> 8;
+ HEAP8[i44] = i64 >>> 16;
+ HEAP8[i45] = i64 >>> 24;
+ HEAP32[i10 >> 2] = _crc32(HEAP32[i10 >> 2] | 0, i25, 4) | 0;
+ }
+ HEAP32[i4 >> 2] = 3;
+ i63 = 0;
+ i64 = 0;
+ i66 = i62;
+ i60 = 55;
+ } else if ((i60 | 0) == 124) {
+ if (i47) {
+ i60 = 285;
+ break L17;
+ } else {
+ i60 = 125;
+ }
+ } else if ((i60 | 0) == 144) {
+ i60 = 0;
+ i66 = HEAP32[i42 >> 2] | 0;
+ if ((i66 | 0) == 0) {
+ HEAP32[i4 >> 2] = 11;
+ i66 = i26;
+ break;
+ }
+ i66 = i66 >>> 0 > i65 >>> 0 ? i65 : i66;
+ i67 = i66 >>> 0 > i26 >>> 0 ? i26 : i66;
+ if ((i67 | 0) == 0) {
+ i60 = 285;
+ break L17;
+ }
+ _memcpy(i19 | 0, i62 | 0, i67 | 0) | 0;
+ HEAP32[i42 >> 2] = (HEAP32[i42 >> 2] | 0) - i67;
+ i65 = i65 - i67 | 0;
+ i66 = i26 - i67 | 0;
+ i62 = i62 + i67 | 0;
+ i19 = i19 + i67 | 0;
+ } else if ((i60 | 0) == 158) {
+ i60 = 0;
+ if (i66 >>> 0 < 19) {
+ while (1) {
+ i61 = i66 + 1 | 0;
+ HEAP16[i4 + (HEAPU16[11384 + (i66 << 1) >> 1] << 1) + 112 >> 1] = 0;
+ if ((i61 | 0) == 19) {
+ break;
+ } else {
+ i66 = i61;
+ }
+ }
+ HEAP32[i36 >> 2] = 19;
+ }
+ HEAP32[i53 >> 2] = i52;
+ HEAP32[i48 >> 2] = i52;
+ HEAP32[i49 >> 2] = 7;
+ i61 = _inflate_table(0, i27, 19, i53, i49, i55) | 0;
+ if ((i61 | 0) == 0) {
+ HEAP32[i36 >> 2] = 0;
+ HEAP32[i4 >> 2] = 18;
+ i63 = 0;
+ i69 = i65;
+ i61 = 0;
+ i60 = 164;
+ break;
+ } else {
+ HEAP32[i35 >> 2] = 11656;
+ HEAP32[i4 >> 2] = 29;
+ i63 = i67;
+ i66 = i26;
+ break;
+ }
+ }
+ } while (0);
+ L163 : do {
+ if ((i60 | 0) == 55) {
+ while (1) {
+ i60 = 0;
+ if ((i65 | 0) == 0) {
+ i65 = 0;
+ i62 = i66;
+ break L17;
+ }
+ i65 = i65 + -1 | 0;
+ i62 = i66 + 1 | 0;
+ i64 = (HEAPU8[i66] << i63) + i64 | 0;
+ i63 = i63 + 8 | 0;
+ if (i63 >>> 0 < 16) {
+ i66 = i62;
+ i60 = 55;
+ } else {
+ i60 = 57;
+ break;
+ }
+ }
+ } else if ((i60 | 0) == 125) {
+ i60 = 0;
+ if ((HEAP32[i7 >> 2] | 0) != 0) {
+ i66 = i63 & 7;
+ HEAP32[i4 >> 2] = 26;
+ i63 = i63 - i66 | 0;
+ i64 = i64 >>> i66;
+ i66 = i26;
+ break;
+ }
+ if (i63 >>> 0 < 3) {
+ while (1) {
+ if ((i65 | 0) == 0) {
+ i65 = 0;
+ break L17;
+ }
+ i65 = i65 + -1 | 0;
+ i66 = i62 + 1 | 0;
+ i64 = (HEAPU8[i62] << i63) + i64 | 0;
+ i63 = i63 + 8 | 0;
+ if (i63 >>> 0 < 3) {
+ i62 = i66;
+ } else {
+ i62 = i66;
+ break;
+ }
+ }
+ }
+ HEAP32[i7 >> 2] = i64 & 1;
+ i66 = i64 >>> 1 & 3;
+ if ((i66 | 0) == 0) {
+ HEAP32[i4 >> 2] = 13;
+ } else if ((i66 | 0) == 1) {
+ HEAP32[i48 >> 2] = 11952;
+ HEAP32[i49 >> 2] = 9;
+ HEAP32[i50 >> 2] = 14e3;
+ HEAP32[i51 >> 2] = 5;
+ HEAP32[i4 >> 2] = 19;
+ if (i43) {
+ i60 = 133;
+ break L17;
+ }
+ } else if ((i66 | 0) == 2) {
+ HEAP32[i4 >> 2] = 16;
+ } else if ((i66 | 0) == 3) {
+ HEAP32[i35 >> 2] = 11560;
+ HEAP32[i4 >> 2] = 29;
+ }
+ i63 = i63 + -3 | 0;
+ i64 = i64 >>> 3;
+ i66 = i26;
+ } else if ((i60 | 0) == 164) {
+ i60 = 0;
+ i65 = HEAP32[i32 >> 2] | 0;
+ i66 = HEAP32[i33 >> 2] | 0;
+ do {
+ if (i63 >>> 0 < (i66 + i65 | 0) >>> 0) {
+ i71 = i67;
+ L181 : while (1) {
+ i70 = (1 << HEAP32[i49 >> 2]) + -1 | 0;
+ i72 = i70 & i64;
+ i68 = HEAP32[i48 >> 2] | 0;
+ i67 = HEAPU8[i68 + (i72 << 2) + 1 | 0] | 0;
+ if (i67 >>> 0 > i71 >>> 0) {
+ i67 = i71;
+ while (1) {
+ if ((i69 | 0) == 0) {
+ i63 = i67;
+ i65 = 0;
+ break L17;
+ }
+ i69 = i69 + -1 | 0;
+ i71 = i62 + 1 | 0;
+ i64 = (HEAPU8[i62] << i67) + i64 | 0;
+ i62 = i67 + 8 | 0;
+ i72 = i70 & i64;
+ i67 = HEAPU8[i68 + (i72 << 2) + 1 | 0] | 0;
+ if (i67 >>> 0 > i62 >>> 0) {
+ i67 = i62;
+ i62 = i71;
+ } else {
+ i70 = i62;
+ i62 = i71;
+ break;
+ }
+ }
+ } else {
+ i70 = i71;
+ }
+ i68 = HEAP16[i68 + (i72 << 2) + 2 >> 1] | 0;
+ L188 : do {
+ if ((i68 & 65535) < 16) {
+ if (i70 >>> 0 < i67 >>> 0) {
+ while (1) {
+ if ((i69 | 0) == 0) {
+ i63 = i70;
+ i65 = 0;
+ break L17;
+ }
+ i69 = i69 + -1 | 0;
+ i65 = i62 + 1 | 0;
+ i64 = (HEAPU8[i62] << i70) + i64 | 0;
+ i70 = i70 + 8 | 0;
+ if (i70 >>> 0 < i67 >>> 0) {
+ i62 = i65;
+ } else {
+ i62 = i65;
+ break;
+ }
+ }
+ }
+ HEAP32[i36 >> 2] = i63 + 1;
+ HEAP16[i4 + (i63 << 1) + 112 >> 1] = i68;
+ i71 = i70 - i67 | 0;
+ i64 = i64 >>> i67;
+ } else {
+ if (i68 << 16 >> 16 == 16) {
+ i68 = i67 + 2 | 0;
+ if (i70 >>> 0 < i68 >>> 0) {
+ i71 = i62;
+ while (1) {
+ if ((i69 | 0) == 0) {
+ i63 = i70;
+ i65 = 0;
+ i62 = i71;
+ break L17;
+ }
+ i69 = i69 + -1 | 0;
+ i62 = i71 + 1 | 0;
+ i64 = (HEAPU8[i71] << i70) + i64 | 0;
+ i70 = i70 + 8 | 0;
+ if (i70 >>> 0 < i68 >>> 0) {
+ i71 = i62;
+ } else {
+ break;
+ }
+ }
+ }
+ i64 = i64 >>> i67;
+ i67 = i70 - i67 | 0;
+ if ((i63 | 0) == 0) {
+ i60 = 181;
+ break L181;
+ }
+ i67 = i67 + -2 | 0;
+ i68 = (i64 & 3) + 3 | 0;
+ i64 = i64 >>> 2;
+ i70 = HEAP16[i4 + (i63 + -1 << 1) + 112 >> 1] | 0;
+ } else if (i68 << 16 >> 16 == 17) {
+ i68 = i67 + 3 | 0;
+ if (i70 >>> 0 < i68 >>> 0) {
+ i71 = i62;
+ while (1) {
+ if ((i69 | 0) == 0) {
+ i63 = i70;
+ i65 = 0;
+ i62 = i71;
+ break L17;
+ }
+ i69 = i69 + -1 | 0;
+ i62 = i71 + 1 | 0;
+ i64 = (HEAPU8[i71] << i70) + i64 | 0;
+ i70 = i70 + 8 | 0;
+ if (i70 >>> 0 < i68 >>> 0) {
+ i71 = i62;
+ } else {
+ break;
+ }
+ }
+ }
+ i64 = i64 >>> i67;
+ i67 = -3 - i67 + i70 | 0;
+ i68 = (i64 & 7) + 3 | 0;
+ i64 = i64 >>> 3;
+ i70 = 0;
+ } else {
+ i68 = i67 + 7 | 0;
+ if (i70 >>> 0 < i68 >>> 0) {
+ i71 = i62;
+ while (1) {
+ if ((i69 | 0) == 0) {
+ i63 = i70;
+ i65 = 0;
+ i62 = i71;
+ break L17;
+ }
+ i69 = i69 + -1 | 0;
+ i62 = i71 + 1 | 0;
+ i64 = (HEAPU8[i71] << i70) + i64 | 0;
+ i70 = i70 + 8 | 0;
+ if (i70 >>> 0 < i68 >>> 0) {
+ i71 = i62;
+ } else {
+ break;
+ }
+ }
+ }
+ i64 = i64 >>> i67;
+ i67 = -7 - i67 + i70 | 0;
+ i68 = (i64 & 127) + 11 | 0;
+ i64 = i64 >>> 7;
+ i70 = 0;
+ }
+ if ((i63 + i68 | 0) >>> 0 > (i66 + i65 | 0) >>> 0) {
+ i60 = 190;
+ break L181;
+ }
+ while (1) {
+ i68 = i68 + -1 | 0;
+ HEAP32[i36 >> 2] = i63 + 1;
+ HEAP16[i4 + (i63 << 1) + 112 >> 1] = i70;
+ if ((i68 | 0) == 0) {
+ i71 = i67;
+ break L188;
+ }
+ i63 = HEAP32[i36 >> 2] | 0;
+ }
+ }
+ } while (0);
+ i63 = HEAP32[i36 >> 2] | 0;
+ i65 = HEAP32[i32 >> 2] | 0;
+ i66 = HEAP32[i33 >> 2] | 0;
+ if (!(i63 >>> 0 < (i66 + i65 | 0) >>> 0)) {
+ i60 = 193;
+ break;
+ }
+ }
+ if ((i60 | 0) == 181) {
+ i60 = 0;
+ HEAP32[i35 >> 2] = 11688;
+ HEAP32[i4 >> 2] = 29;
+ i63 = i67;
+ i65 = i69;
+ i66 = i26;
+ break L163;
+ } else if ((i60 | 0) == 190) {
+ i60 = 0;
+ HEAP32[i35 >> 2] = 11688;
+ HEAP32[i4 >> 2] = 29;
+ i63 = i67;
+ i65 = i69;
+ i66 = i26;
+ break L163;
+ } else if ((i60 | 0) == 193) {
+ i60 = 0;
+ if ((HEAP32[i4 >> 2] | 0) == 29) {
+ i63 = i71;
+ i65 = i69;
+ i66 = i26;
+ break L163;
+ } else {
+ i63 = i71;
+ break;
+ }
+ }
+ } else {
+ i63 = i67;
+ }
+ } while (0);
+ if ((HEAP16[i56 >> 1] | 0) == 0) {
+ HEAP32[i35 >> 2] = 11720;
+ HEAP32[i4 >> 2] = 29;
+ i65 = i69;
+ i66 = i26;
+ break;
+ }
+ HEAP32[i53 >> 2] = i52;
+ HEAP32[i48 >> 2] = i52;
+ HEAP32[i49 >> 2] = 9;
+ i61 = _inflate_table(1, i27, i65, i53, i49, i55) | 0;
+ if ((i61 | 0) != 0) {
+ HEAP32[i35 >> 2] = 11760;
+ HEAP32[i4 >> 2] = 29;
+ i65 = i69;
+ i66 = i26;
+ break;
+ }
+ HEAP32[i50 >> 2] = HEAP32[i53 >> 2];
+ HEAP32[i51 >> 2] = 6;
+ i61 = _inflate_table(2, i4 + (HEAP32[i32 >> 2] << 1) + 112 | 0, HEAP32[i33 >> 2] | 0, i53, i51, i55) | 0;
+ if ((i61 | 0) == 0) {
+ HEAP32[i4 >> 2] = 19;
+ if (i43) {
+ i65 = i69;
+ i61 = 0;
+ i60 = 285;
+ break L17;
+ } else {
+ i65 = i69;
+ i61 = 0;
+ i60 = 201;
+ break;
+ }
+ } else {
+ HEAP32[i35 >> 2] = 11792;
+ HEAP32[i4 >> 2] = 29;
+ i65 = i69;
+ i66 = i26;
+ break;
+ }
+ }
+ } while (0);
+ if ((i60 | 0) == 57) {
+ i60 = HEAP32[i38 >> 2] | 0;
+ if ((i60 | 0) != 0) {
+ HEAP32[i60 + 8 >> 2] = i64 & 255;
+ HEAP32[i60 + 12 >> 2] = i64 >>> 8;
+ }
+ if ((HEAP32[i11 >> 2] & 512 | 0) != 0) {
+ HEAP8[i25] = i64;
+ HEAP8[i39] = i64 >>> 8;
+ HEAP32[i10 >> 2] = _crc32(HEAP32[i10 >> 2] | 0, i25, 2) | 0;
+ }
+ HEAP32[i4 >> 2] = 4;
+ i63 = 0;
+ i64 = 0;
+ i60 = 62;
+ } else if ((i60 | 0) == 201) {
+ HEAP32[i4 >> 2] = 20;
+ i60 = 202;
+ }
+ do {
+ if ((i60 | 0) == 62) {
+ i60 = 0;
+ i66 = HEAP32[i11 >> 2] | 0;
+ if ((i66 & 1024 | 0) == 0) {
+ i60 = HEAP32[i38 >> 2] | 0;
+ if ((i60 | 0) != 0) {
+ HEAP32[i60 + 16 >> 2] = 0;
+ }
+ } else {
+ if (i63 >>> 0 < 16) {
+ while (1) {
+ if ((i65 | 0) == 0) {
+ i65 = 0;
+ break L17;
+ }
+ i65 = i65 + -1 | 0;
+ i67 = i62 + 1 | 0;
+ i64 = (HEAPU8[i62] << i63) + i64 | 0;
+ i63 = i63 + 8 | 0;
+ if (i63 >>> 0 < 16) {
+ i62 = i67;
+ } else {
+ i62 = i67;
+ break;
+ }
+ }
+ }
+ HEAP32[i42 >> 2] = i64;
+ i60 = HEAP32[i38 >> 2] | 0;
+ if ((i60 | 0) != 0) {
+ HEAP32[i60 + 20 >> 2] = i64;
+ i66 = HEAP32[i11 >> 2] | 0;
+ }
+ if ((i66 & 512 | 0) == 0) {
+ i63 = 0;
+ i64 = 0;
+ } else {
+ HEAP8[i25] = i64;
+ HEAP8[i39] = i64 >>> 8;
+ HEAP32[i10 >> 2] = _crc32(HEAP32[i10 >> 2] | 0, i25, 2) | 0;
+ i63 = 0;
+ i64 = 0;
+ }
+ }
+ HEAP32[i4 >> 2] = 5;
+ i60 = 73;
+ } else if ((i60 | 0) == 202) {
+ i60 = 0;
+ if (i65 >>> 0 > 5 & i26 >>> 0 > 257) {
+ HEAP32[i8 >> 2] = i19;
+ HEAP32[i15 >> 2] = i26;
+ HEAP32[i2 >> 2] = i62;
+ HEAP32[i16 >> 2] = i65;
+ HEAP32[i17 >> 2] = i64;
+ HEAP32[i6 >> 2] = i63;
+ _inflate_fast(i2, i59);
+ i19 = HEAP32[i8 >> 2] | 0;
+ i66 = HEAP32[i15 >> 2] | 0;
+ i62 = HEAP32[i2 >> 2] | 0;
+ i65 = HEAP32[i16 >> 2] | 0;
+ i64 = HEAP32[i17 >> 2] | 0;
+ i63 = HEAP32[i6 >> 2] | 0;
+ if ((HEAP32[i4 >> 2] | 0) != 11) {
+ break;
+ }
+ HEAP32[i57 >> 2] = -1;
+ break;
+ }
+ HEAP32[i57 >> 2] = 0;
+ i69 = (1 << HEAP32[i49 >> 2]) + -1 | 0;
+ i71 = i69 & i64;
+ i66 = HEAP32[i48 >> 2] | 0;
+ i68 = HEAP8[i66 + (i71 << 2) + 1 | 0] | 0;
+ i67 = i68 & 255;
+ if (i67 >>> 0 > i63 >>> 0) {
+ while (1) {
+ if ((i65 | 0) == 0) {
+ i65 = 0;
+ break L17;
+ }
+ i65 = i65 + -1 | 0;
+ i70 = i62 + 1 | 0;
+ i64 = (HEAPU8[i62] << i63) + i64 | 0;
+ i63 = i63 + 8 | 0;
+ i71 = i69 & i64;
+ i68 = HEAP8[i66 + (i71 << 2) + 1 | 0] | 0;
+ i67 = i68 & 255;
+ if (i67 >>> 0 > i63 >>> 0) {
+ i62 = i70;
+ } else {
+ i62 = i70;
+ break;
+ }
+ }
+ }
+ i69 = HEAP8[i66 + (i71 << 2) | 0] | 0;
+ i70 = HEAP16[i66 + (i71 << 2) + 2 >> 1] | 0;
+ i71 = i69 & 255;
+ if (!(i69 << 24 >> 24 == 0)) {
+ if ((i71 & 240 | 0) == 0) {
+ i69 = i70 & 65535;
+ i70 = (1 << i67 + i71) + -1 | 0;
+ i71 = ((i64 & i70) >>> i67) + i69 | 0;
+ i68 = HEAP8[i66 + (i71 << 2) + 1 | 0] | 0;
+ if (((i68 & 255) + i67 | 0) >>> 0 > i63 >>> 0) {
+ while (1) {
+ if ((i65 | 0) == 0) {
+ i65 = 0;
+ break L17;
+ }
+ i65 = i65 + -1 | 0;
+ i71 = i62 + 1 | 0;
+ i64 = (HEAPU8[i62] << i63) + i64 | 0;
+ i63 = i63 + 8 | 0;
+ i62 = ((i64 & i70) >>> i67) + i69 | 0;
+ i68 = HEAP8[i66 + (i62 << 2) + 1 | 0] | 0;
+ if (((i68 & 255) + i67 | 0) >>> 0 > i63 >>> 0) {
+ i62 = i71;
+ } else {
+ i69 = i62;
+ i62 = i71;
+ break;
+ }
+ }
+ } else {
+ i69 = i71;
+ }
+ i70 = HEAP16[i66 + (i69 << 2) + 2 >> 1] | 0;
+ i69 = HEAP8[i66 + (i69 << 2) | 0] | 0;
+ HEAP32[i57 >> 2] = i67;
+ i66 = i67;
+ i63 = i63 - i67 | 0;
+ i64 = i64 >>> i67;
+ } else {
+ i66 = 0;
+ }
+ } else {
+ i66 = 0;
+ i69 = 0;
+ }
+ i72 = i68 & 255;
+ i64 = i64 >>> i72;
+ i63 = i63 - i72 | 0;
+ HEAP32[i57 >> 2] = i66 + i72;
+ HEAP32[i42 >> 2] = i70 & 65535;
+ i66 = i69 & 255;
+ if (i69 << 24 >> 24 == 0) {
+ HEAP32[i4 >> 2] = 25;
+ i66 = i26;
+ break;
+ }
+ if ((i66 & 32 | 0) != 0) {
+ HEAP32[i57 >> 2] = -1;
+ HEAP32[i4 >> 2] = 11;
+ i66 = i26;
+ break;
+ }
+ if ((i66 & 64 | 0) == 0) {
+ i66 = i66 & 15;
+ HEAP32[i37 >> 2] = i66;
+ HEAP32[i4 >> 2] = 21;
+ i60 = 221;
+ break;
+ } else {
+ HEAP32[i35 >> 2] = 11816;
+ HEAP32[i4 >> 2] = 29;
+ i66 = i26;
+ break;
+ }
+ }
+ } while (0);
+ if ((i60 | 0) == 73) {
+ i68 = HEAP32[i11 >> 2] | 0;
+ if ((i68 & 1024 | 0) != 0) {
+ i67 = HEAP32[i42 >> 2] | 0;
+ i60 = i67 >>> 0 > i65 >>> 0 ? i65 : i67;
+ if ((i60 | 0) != 0) {
+ i66 = HEAP32[i38 >> 2] | 0;
+ if ((i66 | 0) != 0 ? (i20 = HEAP32[i66 + 16 >> 2] | 0, (i20 | 0) != 0) : 0) {
+ i67 = (HEAP32[i66 + 20 >> 2] | 0) - i67 | 0;
+ i66 = HEAP32[i66 + 24 >> 2] | 0;
+ _memcpy(i20 + i67 | 0, i62 | 0, ((i67 + i60 | 0) >>> 0 > i66 >>> 0 ? i66 - i67 | 0 : i60) | 0) | 0;
+ i68 = HEAP32[i11 >> 2] | 0;
+ }
+ if ((i68 & 512 | 0) != 0) {
+ HEAP32[i10 >> 2] = _crc32(HEAP32[i10 >> 2] | 0, i62, i60) | 0;
+ }
+ i67 = (HEAP32[i42 >> 2] | 0) - i60 | 0;
+ HEAP32[i42 >> 2] = i67;
+ i65 = i65 - i60 | 0;
+ i62 = i62 + i60 | 0;
+ }
+ if ((i67 | 0) != 0) {
+ i60 = 285;
+ break;
+ }
+ }
+ HEAP32[i42 >> 2] = 0;
+ HEAP32[i4 >> 2] = 6;
+ i60 = 83;
+ } else if ((i60 | 0) == 221) {
+ i60 = 0;
+ if ((i66 | 0) == 0) {
+ i60 = HEAP32[i42 >> 2] | 0;
+ } else {
+ if (i63 >>> 0 < i66 >>> 0) {
+ while (1) {
+ if ((i65 | 0) == 0) {
+ i65 = 0;
+ break L17;
+ }
+ i65 = i65 + -1 | 0;
+ i67 = i62 + 1 | 0;
+ i64 = (HEAPU8[i62] << i63) + i64 | 0;
+ i63 = i63 + 8 | 0;
+ if (i63 >>> 0 < i66 >>> 0) {
+ i62 = i67;
+ } else {
+ i62 = i67;
+ break;
+ }
+ }
+ }
+ i60 = (HEAP32[i42 >> 2] | 0) + ((1 << i66) + -1 & i64) | 0;
+ HEAP32[i42 >> 2] = i60;
+ HEAP32[i57 >> 2] = (HEAP32[i57 >> 2] | 0) + i66;
+ i63 = i63 - i66 | 0;
+ i64 = i64 >>> i66;
+ }
+ HEAP32[i58 >> 2] = i60;
+ HEAP32[i4 >> 2] = 22;
+ i60 = 228;
+ }
+ do {
+ if ((i60 | 0) == 83) {
+ if ((HEAP32[i11 >> 2] & 2048 | 0) == 0) {
+ i60 = HEAP32[i38 >> 2] | 0;
+ if ((i60 | 0) != 0) {
+ HEAP32[i60 + 28 >> 2] = 0;
+ }
+ } else {
+ if ((i65 | 0) == 0) {
+ i65 = 0;
+ i60 = 285;
+ break L17;
+ } else {
+ i66 = 0;
+ }
+ while (1) {
+ i60 = i66 + 1 | 0;
+ i67 = HEAP8[i62 + i66 | 0] | 0;
+ i66 = HEAP32[i38 >> 2] | 0;
+ if (((i66 | 0) != 0 ? (i23 = HEAP32[i66 + 28 >> 2] | 0, (i23 | 0) != 0) : 0) ? (i21 = HEAP32[i42 >> 2] | 0, i21 >>> 0 < (HEAP32[i66 + 32 >> 2] | 0) >>> 0) : 0) {
+ HEAP32[i42 >> 2] = i21 + 1;
+ HEAP8[i23 + i21 | 0] = i67;
+ }
+ i66 = i67 << 24 >> 24 != 0;
+ if (i66 & i60 >>> 0 < i65 >>> 0) {
+ i66 = i60;
+ } else {
+ break;
+ }
+ }
+ if ((HEAP32[i11 >> 2] & 512 | 0) != 0) {
+ HEAP32[i10 >> 2] = _crc32(HEAP32[i10 >> 2] | 0, i62, i60) | 0;
+ }
+ i65 = i65 - i60 | 0;
+ i62 = i62 + i60 | 0;
+ if (i66) {
+ i60 = 285;
+ break L17;
+ }
+ }
+ HEAP32[i42 >> 2] = 0;
+ HEAP32[i4 >> 2] = 7;
+ i60 = 96;
+ } else if ((i60 | 0) == 228) {
+ i60 = 0;
+ i69 = (1 << HEAP32[i51 >> 2]) + -1 | 0;
+ i71 = i69 & i64;
+ i66 = HEAP32[i50 >> 2] | 0;
+ i68 = HEAP8[i66 + (i71 << 2) + 1 | 0] | 0;
+ i67 = i68 & 255;
+ if (i67 >>> 0 > i63 >>> 0) {
+ while (1) {
+ if ((i65 | 0) == 0) {
+ i65 = 0;
+ break L17;
+ }
+ i65 = i65 + -1 | 0;
+ i70 = i62 + 1 | 0;
+ i64 = (HEAPU8[i62] << i63) + i64 | 0;
+ i63 = i63 + 8 | 0;
+ i71 = i69 & i64;
+ i68 = HEAP8[i66 + (i71 << 2) + 1 | 0] | 0;
+ i67 = i68 & 255;
+ if (i67 >>> 0 > i63 >>> 0) {
+ i62 = i70;
+ } else {
+ i62 = i70;
+ break;
+ }
+ }
+ }
+ i69 = HEAP8[i66 + (i71 << 2) | 0] | 0;
+ i70 = HEAP16[i66 + (i71 << 2) + 2 >> 1] | 0;
+ i71 = i69 & 255;
+ if ((i71 & 240 | 0) == 0) {
+ i69 = i70 & 65535;
+ i70 = (1 << i67 + i71) + -1 | 0;
+ i71 = ((i64 & i70) >>> i67) + i69 | 0;
+ i68 = HEAP8[i66 + (i71 << 2) + 1 | 0] | 0;
+ if (((i68 & 255) + i67 | 0) >>> 0 > i63 >>> 0) {
+ while (1) {
+ if ((i65 | 0) == 0) {
+ i65 = 0;
+ break L17;
+ }
+ i65 = i65 + -1 | 0;
+ i71 = i62 + 1 | 0;
+ i64 = (HEAPU8[i62] << i63) + i64 | 0;
+ i63 = i63 + 8 | 0;
+ i62 = ((i64 & i70) >>> i67) + i69 | 0;
+ i68 = HEAP8[i66 + (i62 << 2) + 1 | 0] | 0;
+ if (((i68 & 255) + i67 | 0) >>> 0 > i63 >>> 0) {
+ i62 = i71;
+ } else {
+ i69 = i62;
+ i62 = i71;
+ break;
+ }
+ }
+ } else {
+ i69 = i71;
+ }
+ i70 = HEAP16[i66 + (i69 << 2) + 2 >> 1] | 0;
+ i69 = HEAP8[i66 + (i69 << 2) | 0] | 0;
+ i66 = (HEAP32[i57 >> 2] | 0) + i67 | 0;
+ HEAP32[i57 >> 2] = i66;
+ i63 = i63 - i67 | 0;
+ i64 = i64 >>> i67;
+ } else {
+ i66 = HEAP32[i57 >> 2] | 0;
+ }
+ i72 = i68 & 255;
+ i64 = i64 >>> i72;
+ i63 = i63 - i72 | 0;
+ HEAP32[i57 >> 2] = i66 + i72;
+ i66 = i69 & 255;
+ if ((i66 & 64 | 0) == 0) {
+ HEAP32[i54 >> 2] = i70 & 65535;
+ i66 = i66 & 15;
+ HEAP32[i37 >> 2] = i66;
+ HEAP32[i4 >> 2] = 23;
+ i60 = 240;
+ break;
+ } else {
+ HEAP32[i35 >> 2] = 11848;
+ HEAP32[i4 >> 2] = 29;
+ i66 = i26;
+ break;
+ }
+ }
+ } while (0);
+ if ((i60 | 0) == 96) {
+ if ((HEAP32[i11 >> 2] & 4096 | 0) == 0) {
+ i60 = HEAP32[i38 >> 2] | 0;
+ if ((i60 | 0) != 0) {
+ HEAP32[i60 + 36 >> 2] = 0;
+ }
+ } else {
+ if ((i65 | 0) == 0) {
+ i65 = 0;
+ i60 = 285;
+ break;
+ } else {
+ i66 = 0;
+ }
+ while (1) {
+ i60 = i66 + 1 | 0;
+ i66 = HEAP8[i62 + i66 | 0] | 0;
+ i67 = HEAP32[i38 >> 2] | 0;
+ if (((i67 | 0) != 0 ? (i24 = HEAP32[i67 + 36 >> 2] | 0, (i24 | 0) != 0) : 0) ? (i22 = HEAP32[i42 >> 2] | 0, i22 >>> 0 < (HEAP32[i67 + 40 >> 2] | 0) >>> 0) : 0) {
+ HEAP32[i42 >> 2] = i22 + 1;
+ HEAP8[i24 + i22 | 0] = i66;
+ }
+ i66 = i66 << 24 >> 24 != 0;
+ if (i66 & i60 >>> 0 < i65 >>> 0) {
+ i66 = i60;
+ } else {
+ break;
+ }
+ }
+ if ((HEAP32[i11 >> 2] & 512 | 0) != 0) {
+ HEAP32[i10 >> 2] = _crc32(HEAP32[i10 >> 2] | 0, i62, i60) | 0;
+ }
+ i65 = i65 - i60 | 0;
+ i62 = i62 + i60 | 0;
+ if (i66) {
+ i60 = 285;
+ break;
+ }
+ }
+ HEAP32[i4 >> 2] = 8;
+ i60 = 109;
+ } else if ((i60 | 0) == 240) {
+ i60 = 0;
+ if ((i66 | 0) != 0) {
+ if (i63 >>> 0 < i66 >>> 0) {
+ i67 = i62;
+ while (1) {
+ if ((i65 | 0) == 0) {
+ i65 = 0;
+ i62 = i67;
+ break L17;
+ }
+ i65 = i65 + -1 | 0;
+ i62 = i67 + 1 | 0;
+ i64 = (HEAPU8[i67] << i63) + i64 | 0;
+ i63 = i63 + 8 | 0;
+ if (i63 >>> 0 < i66 >>> 0) {
+ i67 = i62;
+ } else {
+ break;
+ }
+ }
+ }
+ HEAP32[i54 >> 2] = (HEAP32[i54 >> 2] | 0) + ((1 << i66) + -1 & i64);
+ HEAP32[i57 >> 2] = (HEAP32[i57 >> 2] | 0) + i66;
+ i63 = i63 - i66 | 0;
+ i64 = i64 >>> i66;
+ }
+ HEAP32[i4 >> 2] = 24;
+ i60 = 246;
+ }
+ do {
+ if ((i60 | 0) == 109) {
+ i60 = 0;
+ i66 = HEAP32[i11 >> 2] | 0;
+ if ((i66 & 512 | 0) != 0) {
+ if (i63 >>> 0 < 16) {
+ i67 = i62;
+ while (1) {
+ if ((i65 | 0) == 0) {
+ i65 = 0;
+ i62 = i67;
+ break L17;
+ }
+ i65 = i65 + -1 | 0;
+ i62 = i67 + 1 | 0;
+ i64 = (HEAPU8[i67] << i63) + i64 | 0;
+ i63 = i63 + 8 | 0;
+ if (i63 >>> 0 < 16) {
+ i67 = i62;
+ } else {
+ break;
+ }
+ }
+ }
+ if ((i64 | 0) == (HEAP32[i10 >> 2] & 65535 | 0)) {
+ i63 = 0;
+ i64 = 0;
+ } else {
+ HEAP32[i35 >> 2] = 11536;
+ HEAP32[i4 >> 2] = 29;
+ i66 = i26;
+ break;
+ }
+ }
+ i67 = HEAP32[i38 >> 2] | 0;
+ if ((i67 | 0) != 0) {
+ HEAP32[i67 + 44 >> 2] = i66 >>> 9 & 1;
+ HEAP32[i67 + 48 >> 2] = 1;
+ }
+ i66 = _crc32(0, 0, 0) | 0;
+ HEAP32[i10 >> 2] = i66;
+ HEAP32[i9 >> 2] = i66;
+ HEAP32[i4 >> 2] = 11;
+ i66 = i26;
+ } else if ((i60 | 0) == 246) {
+ i60 = 0;
+ if ((i26 | 0) == 0) {
+ i26 = 0;
+ i60 = 285;
+ break L17;
+ }
+ i67 = i59 - i26 | 0;
+ i66 = HEAP32[i54 >> 2] | 0;
+ if (i66 >>> 0 > i67 >>> 0) {
+ i67 = i66 - i67 | 0;
+ if (i67 >>> 0 > (HEAP32[i28 >> 2] | 0) >>> 0 ? (HEAP32[i29 >> 2] | 0) != 0 : 0) {
+ HEAP32[i35 >> 2] = 11872;
+ HEAP32[i4 >> 2] = 29;
+ i66 = i26;
+ break;
+ }
+ i68 = HEAP32[i30 >> 2] | 0;
+ if (i67 >>> 0 > i68 >>> 0) {
+ i68 = i67 - i68 | 0;
+ i66 = i68;
+ i68 = (HEAP32[i31 >> 2] | 0) + ((HEAP32[i18 >> 2] | 0) - i68) | 0;
+ } else {
+ i66 = i67;
+ i68 = (HEAP32[i31 >> 2] | 0) + (i68 - i67) | 0;
+ }
+ i69 = HEAP32[i42 >> 2] | 0;
+ i67 = i69;
+ i69 = i66 >>> 0 > i69 >>> 0 ? i69 : i66;
+ } else {
+ i69 = HEAP32[i42 >> 2] | 0;
+ i67 = i69;
+ i68 = i19 + (0 - i66) | 0;
+ }
+ i66 = i69 >>> 0 > i26 >>> 0 ? i26 : i69;
+ HEAP32[i42 >> 2] = i67 - i66;
+ i67 = ~i26;
+ i69 = ~i69;
+ i67 = i67 >>> 0 > i69 >>> 0 ? i67 : i69;
+ i69 = i66;
+ i70 = i19;
+ while (1) {
+ HEAP8[i70] = HEAP8[i68] | 0;
+ i69 = i69 + -1 | 0;
+ if ((i69 | 0) == 0) {
+ break;
+ } else {
+ i68 = i68 + 1 | 0;
+ i70 = i70 + 1 | 0;
+ }
+ }
+ i66 = i26 - i66 | 0;
+ i19 = i19 + ~i67 | 0;
+ if ((HEAP32[i42 >> 2] | 0) == 0) {
+ HEAP32[i4 >> 2] = 20;
+ }
+ }
+ } while (0);
+ i68 = HEAP32[i4 >> 2] | 0;
+ i67 = i63;
+ i26 = i66;
+ }
+ if ((i60 | 0) == 122) {
+ HEAP32[i8 >> 2] = i19;
+ HEAP32[i15 >> 2] = i26;
+ HEAP32[i2 >> 2] = i62;
+ HEAP32[i16 >> 2] = i65;
+ HEAP32[i17 >> 2] = i64;
+ HEAP32[i6 >> 2] = i63;
+ i72 = 2;
+ STACKTOP = i1;
+ return i72 | 0;
+ } else if ((i60 | 0) == 133) {
+ i63 = i63 + -3 | 0;
+ i64 = i64 >>> 3;
+ } else if ((i60 | 0) == 284) {
+ HEAP32[i4 >> 2] = 28;
+ i61 = 1;
+ } else if ((i60 | 0) != 285) if ((i60 | 0) == 299) {
+ i72 = -4;
+ STACKTOP = i1;
+ return i72 | 0;
+ } else if ((i60 | 0) == 300) {
+ STACKTOP = i1;
+ return i2 | 0;
+ }
+ HEAP32[i8 >> 2] = i19;
+ HEAP32[i15 >> 2] = i26;
+ HEAP32[i2 >> 2] = i62;
+ HEAP32[i16 >> 2] = i65;
+ HEAP32[i17 >> 2] = i64;
+ HEAP32[i6 >> 2] = i63;
+ if ((HEAP32[i18 >> 2] | 0) == 0) {
+ if ((HEAP32[i4 >> 2] | 0) >>> 0 < 26 ? (i59 | 0) != (HEAP32[i15 >> 2] | 0) : 0) {
+ i60 = 289;
+ }
+ } else {
+ i60 = 289;
+ }
+ if ((i60 | 0) == 289 ? (_updatewindow(i2, i59) | 0) != 0 : 0) {
+ HEAP32[i4 >> 2] = 30;
+ i72 = -4;
+ STACKTOP = i1;
+ return i72 | 0;
+ }
+ i16 = HEAP32[i16 >> 2] | 0;
+ i72 = HEAP32[i15 >> 2] | 0;
+ i15 = i59 - i72 | 0;
+ i71 = i2 + 8 | 0;
+ HEAP32[i71 >> 2] = i5 - i16 + (HEAP32[i71 >> 2] | 0);
+ HEAP32[i13 >> 2] = (HEAP32[i13 >> 2] | 0) + i15;
+ HEAP32[i14 >> 2] = (HEAP32[i14 >> 2] | 0) + i15;
+ i13 = (i59 | 0) == (i72 | 0);
+ if (!((HEAP32[i12 >> 2] | 0) == 0 | i13)) {
+ i12 = HEAP32[i10 >> 2] | 0;
+ i8 = (HEAP32[i8 >> 2] | 0) + (0 - i15) | 0;
+ if ((HEAP32[i11 >> 2] | 0) == 0) {
+ i8 = _adler32(i12, i8, i15) | 0;
+ } else {
+ i8 = _crc32(i12, i8, i15) | 0;
+ }
+ HEAP32[i10 >> 2] = i8;
+ HEAP32[i9 >> 2] = i8;
+ }
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((i4 | 0) == 19) {
+ i8 = 256;
+ } else {
+ i8 = (i4 | 0) == 14 ? 256 : 0;
+ }
+ HEAP32[i2 + 44 >> 2] = ((HEAP32[i7 >> 2] | 0) != 0 ? 64 : 0) + (HEAP32[i6 >> 2] | 0) + ((i4 | 0) == 11 ? 128 : 0) + i8;
+ i72 = ((i5 | 0) == (i16 | 0) & i13 | (i3 | 0) == 4) & (i61 | 0) == 0 ? -5 : i61;
+ STACKTOP = i1;
+ return i72 | 0;
+}
+function _malloc(i12) {
+ i12 = i12 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0, i30 = 0, i31 = 0, i32 = 0;
+ i1 = STACKTOP;
+ do {
+ if (i12 >>> 0 < 245) {
+ if (i12 >>> 0 < 11) {
+ i12 = 16;
+ } else {
+ i12 = i12 + 11 & -8;
+ }
+ i20 = i12 >>> 3;
+ i18 = HEAP32[3618] | 0;
+ i21 = i18 >>> i20;
+ if ((i21 & 3 | 0) != 0) {
+ i6 = (i21 & 1 ^ 1) + i20 | 0;
+ i5 = i6 << 1;
+ i3 = 14512 + (i5 << 2) | 0;
+ i5 = 14512 + (i5 + 2 << 2) | 0;
+ i7 = HEAP32[i5 >> 2] | 0;
+ i2 = i7 + 8 | 0;
+ i4 = HEAP32[i2 >> 2] | 0;
+ do {
+ if ((i3 | 0) != (i4 | 0)) {
+ if (i4 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i8 = i4 + 12 | 0;
+ if ((HEAP32[i8 >> 2] | 0) == (i7 | 0)) {
+ HEAP32[i8 >> 2] = i3;
+ HEAP32[i5 >> 2] = i4;
+ break;
+ } else {
+ _abort();
+ }
+ } else {
+ HEAP32[3618] = i18 & ~(1 << i6);
+ }
+ } while (0);
+ i32 = i6 << 3;
+ HEAP32[i7 + 4 >> 2] = i32 | 3;
+ i32 = i7 + (i32 | 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ i32 = i2;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ if (i12 >>> 0 > (HEAP32[14480 >> 2] | 0) >>> 0) {
+ if ((i21 | 0) != 0) {
+ i7 = 2 << i20;
+ i7 = i21 << i20 & (i7 | 0 - i7);
+ i7 = (i7 & 0 - i7) + -1 | 0;
+ i2 = i7 >>> 12 & 16;
+ i7 = i7 >>> i2;
+ i6 = i7 >>> 5 & 8;
+ i7 = i7 >>> i6;
+ i5 = i7 >>> 2 & 4;
+ i7 = i7 >>> i5;
+ i4 = i7 >>> 1 & 2;
+ i7 = i7 >>> i4;
+ i3 = i7 >>> 1 & 1;
+ i3 = (i6 | i2 | i5 | i4 | i3) + (i7 >>> i3) | 0;
+ i7 = i3 << 1;
+ i4 = 14512 + (i7 << 2) | 0;
+ i7 = 14512 + (i7 + 2 << 2) | 0;
+ i5 = HEAP32[i7 >> 2] | 0;
+ i2 = i5 + 8 | 0;
+ i6 = HEAP32[i2 >> 2] | 0;
+ do {
+ if ((i4 | 0) != (i6 | 0)) {
+ if (i6 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i8 = i6 + 12 | 0;
+ if ((HEAP32[i8 >> 2] | 0) == (i5 | 0)) {
+ HEAP32[i8 >> 2] = i4;
+ HEAP32[i7 >> 2] = i6;
+ break;
+ } else {
+ _abort();
+ }
+ } else {
+ HEAP32[3618] = i18 & ~(1 << i3);
+ }
+ } while (0);
+ i6 = i3 << 3;
+ i4 = i6 - i12 | 0;
+ HEAP32[i5 + 4 >> 2] = i12 | 3;
+ i3 = i5 + i12 | 0;
+ HEAP32[i5 + (i12 | 4) >> 2] = i4 | 1;
+ HEAP32[i5 + i6 >> 2] = i4;
+ i6 = HEAP32[14480 >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ i5 = HEAP32[14492 >> 2] | 0;
+ i8 = i6 >>> 3;
+ i9 = i8 << 1;
+ i6 = 14512 + (i9 << 2) | 0;
+ i7 = HEAP32[3618] | 0;
+ i8 = 1 << i8;
+ if ((i7 & i8 | 0) != 0) {
+ i7 = 14512 + (i9 + 2 << 2) | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ if (i8 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i28 = i7;
+ i27 = i8;
+ }
+ } else {
+ HEAP32[3618] = i7 | i8;
+ i28 = 14512 + (i9 + 2 << 2) | 0;
+ i27 = i6;
+ }
+ HEAP32[i28 >> 2] = i5;
+ HEAP32[i27 + 12 >> 2] = i5;
+ HEAP32[i5 + 8 >> 2] = i27;
+ HEAP32[i5 + 12 >> 2] = i6;
+ }
+ HEAP32[14480 >> 2] = i4;
+ HEAP32[14492 >> 2] = i3;
+ i32 = i2;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i18 = HEAP32[14476 >> 2] | 0;
+ if ((i18 | 0) != 0) {
+ i2 = (i18 & 0 - i18) + -1 | 0;
+ i31 = i2 >>> 12 & 16;
+ i2 = i2 >>> i31;
+ i30 = i2 >>> 5 & 8;
+ i2 = i2 >>> i30;
+ i32 = i2 >>> 2 & 4;
+ i2 = i2 >>> i32;
+ i6 = i2 >>> 1 & 2;
+ i2 = i2 >>> i6;
+ i3 = i2 >>> 1 & 1;
+ i3 = HEAP32[14776 + ((i30 | i31 | i32 | i6 | i3) + (i2 >>> i3) << 2) >> 2] | 0;
+ i2 = (HEAP32[i3 + 4 >> 2] & -8) - i12 | 0;
+ i6 = i3;
+ while (1) {
+ i5 = HEAP32[i6 + 16 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ i5 = HEAP32[i6 + 20 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ }
+ i6 = (HEAP32[i5 + 4 >> 2] & -8) - i12 | 0;
+ i4 = i6 >>> 0 < i2 >>> 0;
+ i2 = i4 ? i6 : i2;
+ i6 = i5;
+ i3 = i4 ? i5 : i3;
+ }
+ i6 = HEAP32[14488 >> 2] | 0;
+ if (i3 >>> 0 < i6 >>> 0) {
+ _abort();
+ }
+ i4 = i3 + i12 | 0;
+ if (!(i3 >>> 0 < i4 >>> 0)) {
+ _abort();
+ }
+ i5 = HEAP32[i3 + 24 >> 2] | 0;
+ i7 = HEAP32[i3 + 12 >> 2] | 0;
+ do {
+ if ((i7 | 0) == (i3 | 0)) {
+ i8 = i3 + 20 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ if ((i7 | 0) == 0) {
+ i8 = i3 + 16 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ if ((i7 | 0) == 0) {
+ i26 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i10 = i7 + 20 | 0;
+ i9 = HEAP32[i10 >> 2] | 0;
+ if ((i9 | 0) != 0) {
+ i7 = i9;
+ i8 = i10;
+ continue;
+ }
+ i10 = i7 + 16 | 0;
+ i9 = HEAP32[i10 >> 2] | 0;
+ if ((i9 | 0) == 0) {
+ break;
+ } else {
+ i7 = i9;
+ i8 = i10;
+ }
+ }
+ if (i8 >>> 0 < i6 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i8 >> 2] = 0;
+ i26 = i7;
+ break;
+ }
+ } else {
+ i8 = HEAP32[i3 + 8 >> 2] | 0;
+ if (i8 >>> 0 < i6 >>> 0) {
+ _abort();
+ }
+ i6 = i8 + 12 | 0;
+ if ((HEAP32[i6 >> 2] | 0) != (i3 | 0)) {
+ _abort();
+ }
+ i9 = i7 + 8 | 0;
+ if ((HEAP32[i9 >> 2] | 0) == (i3 | 0)) {
+ HEAP32[i6 >> 2] = i7;
+ HEAP32[i9 >> 2] = i8;
+ i26 = i7;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ do {
+ if ((i5 | 0) != 0) {
+ i7 = HEAP32[i3 + 28 >> 2] | 0;
+ i6 = 14776 + (i7 << 2) | 0;
+ if ((i3 | 0) == (HEAP32[i6 >> 2] | 0)) {
+ HEAP32[i6 >> 2] = i26;
+ if ((i26 | 0) == 0) {
+ HEAP32[14476 >> 2] = HEAP32[14476 >> 2] & ~(1 << i7);
+ break;
+ }
+ } else {
+ if (i5 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i6 = i5 + 16 | 0;
+ if ((HEAP32[i6 >> 2] | 0) == (i3 | 0)) {
+ HEAP32[i6 >> 2] = i26;
+ } else {
+ HEAP32[i5 + 20 >> 2] = i26;
+ }
+ if ((i26 | 0) == 0) {
+ break;
+ }
+ }
+ if (i26 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i26 + 24 >> 2] = i5;
+ i5 = HEAP32[i3 + 16 >> 2] | 0;
+ do {
+ if ((i5 | 0) != 0) {
+ if (i5 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i26 + 16 >> 2] = i5;
+ HEAP32[i5 + 24 >> 2] = i26;
+ break;
+ }
+ }
+ } while (0);
+ i5 = HEAP32[i3 + 20 >> 2] | 0;
+ if ((i5 | 0) != 0) {
+ if (i5 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i26 + 20 >> 2] = i5;
+ HEAP32[i5 + 24 >> 2] = i26;
+ break;
+ }
+ }
+ }
+ } while (0);
+ if (i2 >>> 0 < 16) {
+ i32 = i2 + i12 | 0;
+ HEAP32[i3 + 4 >> 2] = i32 | 3;
+ i32 = i3 + (i32 + 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ } else {
+ HEAP32[i3 + 4 >> 2] = i12 | 3;
+ HEAP32[i3 + (i12 | 4) >> 2] = i2 | 1;
+ HEAP32[i3 + (i2 + i12) >> 2] = i2;
+ i6 = HEAP32[14480 >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ i5 = HEAP32[14492 >> 2] | 0;
+ i8 = i6 >>> 3;
+ i9 = i8 << 1;
+ i6 = 14512 + (i9 << 2) | 0;
+ i7 = HEAP32[3618] | 0;
+ i8 = 1 << i8;
+ if ((i7 & i8 | 0) != 0) {
+ i7 = 14512 + (i9 + 2 << 2) | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ if (i8 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i25 = i7;
+ i24 = i8;
+ }
+ } else {
+ HEAP32[3618] = i7 | i8;
+ i25 = 14512 + (i9 + 2 << 2) | 0;
+ i24 = i6;
+ }
+ HEAP32[i25 >> 2] = i5;
+ HEAP32[i24 + 12 >> 2] = i5;
+ HEAP32[i5 + 8 >> 2] = i24;
+ HEAP32[i5 + 12 >> 2] = i6;
+ }
+ HEAP32[14480 >> 2] = i2;
+ HEAP32[14492 >> 2] = i4;
+ }
+ i32 = i3 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ }
+ } else {
+ if (!(i12 >>> 0 > 4294967231)) {
+ i24 = i12 + 11 | 0;
+ i12 = i24 & -8;
+ i26 = HEAP32[14476 >> 2] | 0;
+ if ((i26 | 0) != 0) {
+ i25 = 0 - i12 | 0;
+ i24 = i24 >>> 8;
+ if ((i24 | 0) != 0) {
+ if (i12 >>> 0 > 16777215) {
+ i27 = 31;
+ } else {
+ i31 = (i24 + 1048320 | 0) >>> 16 & 8;
+ i32 = i24 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i27 = (i32 + 245760 | 0) >>> 16 & 2;
+ i27 = 14 - (i30 | i31 | i27) + (i32 << i27 >>> 15) | 0;
+ i27 = i12 >>> (i27 + 7 | 0) & 1 | i27 << 1;
+ }
+ } else {
+ i27 = 0;
+ }
+ i30 = HEAP32[14776 + (i27 << 2) >> 2] | 0;
+ L126 : do {
+ if ((i30 | 0) == 0) {
+ i29 = 0;
+ i24 = 0;
+ } else {
+ if ((i27 | 0) == 31) {
+ i24 = 0;
+ } else {
+ i24 = 25 - (i27 >>> 1) | 0;
+ }
+ i29 = 0;
+ i28 = i12 << i24;
+ i24 = 0;
+ while (1) {
+ i32 = HEAP32[i30 + 4 >> 2] & -8;
+ i31 = i32 - i12 | 0;
+ if (i31 >>> 0 < i25 >>> 0) {
+ if ((i32 | 0) == (i12 | 0)) {
+ i25 = i31;
+ i29 = i30;
+ i24 = i30;
+ break L126;
+ } else {
+ i25 = i31;
+ i24 = i30;
+ }
+ }
+ i31 = HEAP32[i30 + 20 >> 2] | 0;
+ i30 = HEAP32[i30 + (i28 >>> 31 << 2) + 16 >> 2] | 0;
+ i29 = (i31 | 0) == 0 | (i31 | 0) == (i30 | 0) ? i29 : i31;
+ if ((i30 | 0) == 0) {
+ break;
+ } else {
+ i28 = i28 << 1;
+ }
+ }
+ }
+ } while (0);
+ if ((i29 | 0) == 0 & (i24 | 0) == 0) {
+ i32 = 2 << i27;
+ i26 = i26 & (i32 | 0 - i32);
+ if ((i26 | 0) == 0) {
+ break;
+ }
+ i32 = (i26 & 0 - i26) + -1 | 0;
+ i28 = i32 >>> 12 & 16;
+ i32 = i32 >>> i28;
+ i27 = i32 >>> 5 & 8;
+ i32 = i32 >>> i27;
+ i30 = i32 >>> 2 & 4;
+ i32 = i32 >>> i30;
+ i31 = i32 >>> 1 & 2;
+ i32 = i32 >>> i31;
+ i29 = i32 >>> 1 & 1;
+ i29 = HEAP32[14776 + ((i27 | i28 | i30 | i31 | i29) + (i32 >>> i29) << 2) >> 2] | 0;
+ }
+ if ((i29 | 0) != 0) {
+ while (1) {
+ i27 = (HEAP32[i29 + 4 >> 2] & -8) - i12 | 0;
+ i26 = i27 >>> 0 < i25 >>> 0;
+ i25 = i26 ? i27 : i25;
+ i24 = i26 ? i29 : i24;
+ i26 = HEAP32[i29 + 16 >> 2] | 0;
+ if ((i26 | 0) != 0) {
+ i29 = i26;
+ continue;
+ }
+ i29 = HEAP32[i29 + 20 >> 2] | 0;
+ if ((i29 | 0) == 0) {
+ break;
+ }
+ }
+ }
+ if ((i24 | 0) != 0 ? i25 >>> 0 < ((HEAP32[14480 >> 2] | 0) - i12 | 0) >>> 0 : 0) {
+ i4 = HEAP32[14488 >> 2] | 0;
+ if (i24 >>> 0 < i4 >>> 0) {
+ _abort();
+ }
+ i2 = i24 + i12 | 0;
+ if (!(i24 >>> 0 < i2 >>> 0)) {
+ _abort();
+ }
+ i3 = HEAP32[i24 + 24 >> 2] | 0;
+ i6 = HEAP32[i24 + 12 >> 2] | 0;
+ do {
+ if ((i6 | 0) == (i24 | 0)) {
+ i6 = i24 + 20 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ i6 = i24 + 16 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ i22 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i8 = i5 + 20 | 0;
+ i7 = HEAP32[i8 >> 2] | 0;
+ if ((i7 | 0) != 0) {
+ i5 = i7;
+ i6 = i8;
+ continue;
+ }
+ i7 = i5 + 16 | 0;
+ i8 = HEAP32[i7 >> 2] | 0;
+ if ((i8 | 0) == 0) {
+ break;
+ } else {
+ i5 = i8;
+ i6 = i7;
+ }
+ }
+ if (i6 >>> 0 < i4 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i6 >> 2] = 0;
+ i22 = i5;
+ break;
+ }
+ } else {
+ i5 = HEAP32[i24 + 8 >> 2] | 0;
+ if (i5 >>> 0 < i4 >>> 0) {
+ _abort();
+ }
+ i7 = i5 + 12 | 0;
+ if ((HEAP32[i7 >> 2] | 0) != (i24 | 0)) {
+ _abort();
+ }
+ i4 = i6 + 8 | 0;
+ if ((HEAP32[i4 >> 2] | 0) == (i24 | 0)) {
+ HEAP32[i7 >> 2] = i6;
+ HEAP32[i4 >> 2] = i5;
+ i22 = i6;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ do {
+ if ((i3 | 0) != 0) {
+ i4 = HEAP32[i24 + 28 >> 2] | 0;
+ i5 = 14776 + (i4 << 2) | 0;
+ if ((i24 | 0) == (HEAP32[i5 >> 2] | 0)) {
+ HEAP32[i5 >> 2] = i22;
+ if ((i22 | 0) == 0) {
+ HEAP32[14476 >> 2] = HEAP32[14476 >> 2] & ~(1 << i4);
+ break;
+ }
+ } else {
+ if (i3 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i4 = i3 + 16 | 0;
+ if ((HEAP32[i4 >> 2] | 0) == (i24 | 0)) {
+ HEAP32[i4 >> 2] = i22;
+ } else {
+ HEAP32[i3 + 20 >> 2] = i22;
+ }
+ if ((i22 | 0) == 0) {
+ break;
+ }
+ }
+ if (i22 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i22 + 24 >> 2] = i3;
+ i3 = HEAP32[i24 + 16 >> 2] | 0;
+ do {
+ if ((i3 | 0) != 0) {
+ if (i3 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i22 + 16 >> 2] = i3;
+ HEAP32[i3 + 24 >> 2] = i22;
+ break;
+ }
+ }
+ } while (0);
+ i3 = HEAP32[i24 + 20 >> 2] | 0;
+ if ((i3 | 0) != 0) {
+ if (i3 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i22 + 20 >> 2] = i3;
+ HEAP32[i3 + 24 >> 2] = i22;
+ break;
+ }
+ }
+ }
+ } while (0);
+ L204 : do {
+ if (!(i25 >>> 0 < 16)) {
+ HEAP32[i24 + 4 >> 2] = i12 | 3;
+ HEAP32[i24 + (i12 | 4) >> 2] = i25 | 1;
+ HEAP32[i24 + (i25 + i12) >> 2] = i25;
+ i4 = i25 >>> 3;
+ if (i25 >>> 0 < 256) {
+ i6 = i4 << 1;
+ i3 = 14512 + (i6 << 2) | 0;
+ i5 = HEAP32[3618] | 0;
+ i4 = 1 << i4;
+ if ((i5 & i4 | 0) != 0) {
+ i5 = 14512 + (i6 + 2 << 2) | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ if (i4 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i21 = i5;
+ i20 = i4;
+ }
+ } else {
+ HEAP32[3618] = i5 | i4;
+ i21 = 14512 + (i6 + 2 << 2) | 0;
+ i20 = i3;
+ }
+ HEAP32[i21 >> 2] = i2;
+ HEAP32[i20 + 12 >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i20;
+ HEAP32[i24 + (i12 + 12) >> 2] = i3;
+ break;
+ }
+ i3 = i25 >>> 8;
+ if ((i3 | 0) != 0) {
+ if (i25 >>> 0 > 16777215) {
+ i3 = 31;
+ } else {
+ i31 = (i3 + 1048320 | 0) >>> 16 & 8;
+ i32 = i3 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i3 = (i32 + 245760 | 0) >>> 16 & 2;
+ i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
+ i3 = i25 >>> (i3 + 7 | 0) & 1 | i3 << 1;
+ }
+ } else {
+ i3 = 0;
+ }
+ i6 = 14776 + (i3 << 2) | 0;
+ HEAP32[i24 + (i12 + 28) >> 2] = i3;
+ HEAP32[i24 + (i12 + 20) >> 2] = 0;
+ HEAP32[i24 + (i12 + 16) >> 2] = 0;
+ i4 = HEAP32[14476 >> 2] | 0;
+ i5 = 1 << i3;
+ if ((i4 & i5 | 0) == 0) {
+ HEAP32[14476 >> 2] = i4 | i5;
+ HEAP32[i6 >> 2] = i2;
+ HEAP32[i24 + (i12 + 24) >> 2] = i6;
+ HEAP32[i24 + (i12 + 12) >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i2;
+ break;
+ }
+ i4 = HEAP32[i6 >> 2] | 0;
+ if ((i3 | 0) == 31) {
+ i3 = 0;
+ } else {
+ i3 = 25 - (i3 >>> 1) | 0;
+ }
+ L225 : do {
+ if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i25 | 0)) {
+ i3 = i25 << i3;
+ while (1) {
+ i6 = i4 + (i3 >>> 31 << 2) + 16 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) == (i25 | 0)) {
+ i18 = i5;
+ break L225;
+ } else {
+ i3 = i3 << 1;
+ i4 = i5;
+ }
+ }
+ if (i6 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i6 >> 2] = i2;
+ HEAP32[i24 + (i12 + 24) >> 2] = i4;
+ HEAP32[i24 + (i12 + 12) >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i2;
+ break L204;
+ }
+ } else {
+ i18 = i4;
+ }
+ } while (0);
+ i4 = i18 + 8 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ i5 = HEAP32[14488 >> 2] | 0;
+ if (i18 >>> 0 < i5 >>> 0) {
+ _abort();
+ }
+ if (i3 >>> 0 < i5 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i3 + 12 >> 2] = i2;
+ HEAP32[i4 >> 2] = i2;
+ HEAP32[i24 + (i12 + 8) >> 2] = i3;
+ HEAP32[i24 + (i12 + 12) >> 2] = i18;
+ HEAP32[i24 + (i12 + 24) >> 2] = 0;
+ break;
+ }
+ } else {
+ i32 = i25 + i12 | 0;
+ HEAP32[i24 + 4 >> 2] = i32 | 3;
+ i32 = i24 + (i32 + 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ }
+ } while (0);
+ i32 = i24 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ }
+ } else {
+ i12 = -1;
+ }
+ }
+ } while (0);
+ i18 = HEAP32[14480 >> 2] | 0;
+ if (!(i12 >>> 0 > i18 >>> 0)) {
+ i3 = i18 - i12 | 0;
+ i2 = HEAP32[14492 >> 2] | 0;
+ if (i3 >>> 0 > 15) {
+ HEAP32[14492 >> 2] = i2 + i12;
+ HEAP32[14480 >> 2] = i3;
+ HEAP32[i2 + (i12 + 4) >> 2] = i3 | 1;
+ HEAP32[i2 + i18 >> 2] = i3;
+ HEAP32[i2 + 4 >> 2] = i12 | 3;
+ } else {
+ HEAP32[14480 >> 2] = 0;
+ HEAP32[14492 >> 2] = 0;
+ HEAP32[i2 + 4 >> 2] = i18 | 3;
+ i32 = i2 + (i18 + 4) | 0;
+ HEAP32[i32 >> 2] = HEAP32[i32 >> 2] | 1;
+ }
+ i32 = i2 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i18 = HEAP32[14484 >> 2] | 0;
+ if (i12 >>> 0 < i18 >>> 0) {
+ i31 = i18 - i12 | 0;
+ HEAP32[14484 >> 2] = i31;
+ i32 = HEAP32[14496 >> 2] | 0;
+ HEAP32[14496 >> 2] = i32 + i12;
+ HEAP32[i32 + (i12 + 4) >> 2] = i31 | 1;
+ HEAP32[i32 + 4 >> 2] = i12 | 3;
+ i32 = i32 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ do {
+ if ((HEAP32[3736] | 0) == 0) {
+ i18 = _sysconf(30) | 0;
+ if ((i18 + -1 & i18 | 0) == 0) {
+ HEAP32[14952 >> 2] = i18;
+ HEAP32[14948 >> 2] = i18;
+ HEAP32[14956 >> 2] = -1;
+ HEAP32[14960 >> 2] = -1;
+ HEAP32[14964 >> 2] = 0;
+ HEAP32[14916 >> 2] = 0;
+ HEAP32[3736] = (_time(0) | 0) & -16 ^ 1431655768;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ i20 = i12 + 48 | 0;
+ i25 = HEAP32[14952 >> 2] | 0;
+ i21 = i12 + 47 | 0;
+ i22 = i25 + i21 | 0;
+ i25 = 0 - i25 | 0;
+ i18 = i22 & i25;
+ if (!(i18 >>> 0 > i12 >>> 0)) {
+ i32 = 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i24 = HEAP32[14912 >> 2] | 0;
+ if ((i24 | 0) != 0 ? (i31 = HEAP32[14904 >> 2] | 0, i32 = i31 + i18 | 0, i32 >>> 0 <= i31 >>> 0 | i32 >>> 0 > i24 >>> 0) : 0) {
+ i32 = 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ L269 : do {
+ if ((HEAP32[14916 >> 2] & 4 | 0) == 0) {
+ i26 = HEAP32[14496 >> 2] | 0;
+ L271 : do {
+ if ((i26 | 0) != 0) {
+ i24 = 14920 | 0;
+ while (1) {
+ i27 = HEAP32[i24 >> 2] | 0;
+ if (!(i27 >>> 0 > i26 >>> 0) ? (i23 = i24 + 4 | 0, (i27 + (HEAP32[i23 >> 2] | 0) | 0) >>> 0 > i26 >>> 0) : 0) {
+ break;
+ }
+ i24 = HEAP32[i24 + 8 >> 2] | 0;
+ if ((i24 | 0) == 0) {
+ i13 = 182;
+ break L271;
+ }
+ }
+ if ((i24 | 0) != 0) {
+ i25 = i22 - (HEAP32[14484 >> 2] | 0) & i25;
+ if (i25 >>> 0 < 2147483647) {
+ i13 = _sbrk(i25 | 0) | 0;
+ i26 = (i13 | 0) == ((HEAP32[i24 >> 2] | 0) + (HEAP32[i23 >> 2] | 0) | 0);
+ i22 = i13;
+ i24 = i25;
+ i23 = i26 ? i13 : -1;
+ i25 = i26 ? i25 : 0;
+ i13 = 191;
+ } else {
+ i25 = 0;
+ }
+ } else {
+ i13 = 182;
+ }
+ } else {
+ i13 = 182;
+ }
+ } while (0);
+ do {
+ if ((i13 | 0) == 182) {
+ i23 = _sbrk(0) | 0;
+ if ((i23 | 0) != (-1 | 0)) {
+ i24 = i23;
+ i22 = HEAP32[14948 >> 2] | 0;
+ i25 = i22 + -1 | 0;
+ if ((i25 & i24 | 0) == 0) {
+ i25 = i18;
+ } else {
+ i25 = i18 - i24 + (i25 + i24 & 0 - i22) | 0;
+ }
+ i24 = HEAP32[14904 >> 2] | 0;
+ i26 = i24 + i25 | 0;
+ if (i25 >>> 0 > i12 >>> 0 & i25 >>> 0 < 2147483647) {
+ i22 = HEAP32[14912 >> 2] | 0;
+ if ((i22 | 0) != 0 ? i26 >>> 0 <= i24 >>> 0 | i26 >>> 0 > i22 >>> 0 : 0) {
+ i25 = 0;
+ break;
+ }
+ i22 = _sbrk(i25 | 0) | 0;
+ i13 = (i22 | 0) == (i23 | 0);
+ i24 = i25;
+ i23 = i13 ? i23 : -1;
+ i25 = i13 ? i25 : 0;
+ i13 = 191;
+ } else {
+ i25 = 0;
+ }
+ } else {
+ i25 = 0;
+ }
+ }
+ } while (0);
+ L291 : do {
+ if ((i13 | 0) == 191) {
+ i13 = 0 - i24 | 0;
+ if ((i23 | 0) != (-1 | 0)) {
+ i17 = i23;
+ i14 = i25;
+ i13 = 202;
+ break L269;
+ }
+ do {
+ if ((i22 | 0) != (-1 | 0) & i24 >>> 0 < 2147483647 & i24 >>> 0 < i20 >>> 0 ? (i19 = HEAP32[14952 >> 2] | 0, i19 = i21 - i24 + i19 & 0 - i19, i19 >>> 0 < 2147483647) : 0) {
+ if ((_sbrk(i19 | 0) | 0) == (-1 | 0)) {
+ _sbrk(i13 | 0) | 0;
+ break L291;
+ } else {
+ i24 = i19 + i24 | 0;
+ break;
+ }
+ }
+ } while (0);
+ if ((i22 | 0) != (-1 | 0)) {
+ i17 = i22;
+ i14 = i24;
+ i13 = 202;
+ break L269;
+ }
+ }
+ } while (0);
+ HEAP32[14916 >> 2] = HEAP32[14916 >> 2] | 4;
+ i13 = 199;
+ } else {
+ i25 = 0;
+ i13 = 199;
+ }
+ } while (0);
+ if ((((i13 | 0) == 199 ? i18 >>> 0 < 2147483647 : 0) ? (i17 = _sbrk(i18 | 0) | 0, i16 = _sbrk(0) | 0, (i16 | 0) != (-1 | 0) & (i17 | 0) != (-1 | 0) & i17 >>> 0 < i16 >>> 0) : 0) ? (i15 = i16 - i17 | 0, i14 = i15 >>> 0 > (i12 + 40 | 0) >>> 0, i14) : 0) {
+ i14 = i14 ? i15 : i25;
+ i13 = 202;
+ }
+ if ((i13 | 0) == 202) {
+ i15 = (HEAP32[14904 >> 2] | 0) + i14 | 0;
+ HEAP32[14904 >> 2] = i15;
+ if (i15 >>> 0 > (HEAP32[14908 >> 2] | 0) >>> 0) {
+ HEAP32[14908 >> 2] = i15;
+ }
+ i15 = HEAP32[14496 >> 2] | 0;
+ L311 : do {
+ if ((i15 | 0) != 0) {
+ i21 = 14920 | 0;
+ while (1) {
+ i16 = HEAP32[i21 >> 2] | 0;
+ i19 = i21 + 4 | 0;
+ i20 = HEAP32[i19 >> 2] | 0;
+ if ((i17 | 0) == (i16 + i20 | 0)) {
+ i13 = 214;
+ break;
+ }
+ i18 = HEAP32[i21 + 8 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ break;
+ } else {
+ i21 = i18;
+ }
+ }
+ if (((i13 | 0) == 214 ? (HEAP32[i21 + 12 >> 2] & 8 | 0) == 0 : 0) ? i15 >>> 0 >= i16 >>> 0 & i15 >>> 0 < i17 >>> 0 : 0) {
+ HEAP32[i19 >> 2] = i20 + i14;
+ i2 = (HEAP32[14484 >> 2] | 0) + i14 | 0;
+ i3 = i15 + 8 | 0;
+ if ((i3 & 7 | 0) == 0) {
+ i3 = 0;
+ } else {
+ i3 = 0 - i3 & 7;
+ }
+ i32 = i2 - i3 | 0;
+ HEAP32[14496 >> 2] = i15 + i3;
+ HEAP32[14484 >> 2] = i32;
+ HEAP32[i15 + (i3 + 4) >> 2] = i32 | 1;
+ HEAP32[i15 + (i2 + 4) >> 2] = 40;
+ HEAP32[14500 >> 2] = HEAP32[14960 >> 2];
+ break;
+ }
+ if (i17 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ HEAP32[14488 >> 2] = i17;
+ }
+ i19 = i17 + i14 | 0;
+ i16 = 14920 | 0;
+ while (1) {
+ if ((HEAP32[i16 >> 2] | 0) == (i19 | 0)) {
+ i13 = 224;
+ break;
+ }
+ i18 = HEAP32[i16 + 8 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ break;
+ } else {
+ i16 = i18;
+ }
+ }
+ if ((i13 | 0) == 224 ? (HEAP32[i16 + 12 >> 2] & 8 | 0) == 0 : 0) {
+ HEAP32[i16 >> 2] = i17;
+ i6 = i16 + 4 | 0;
+ HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + i14;
+ i6 = i17 + 8 | 0;
+ if ((i6 & 7 | 0) == 0) {
+ i6 = 0;
+ } else {
+ i6 = 0 - i6 & 7;
+ }
+ i7 = i17 + (i14 + 8) | 0;
+ if ((i7 & 7 | 0) == 0) {
+ i13 = 0;
+ } else {
+ i13 = 0 - i7 & 7;
+ }
+ i15 = i17 + (i13 + i14) | 0;
+ i8 = i6 + i12 | 0;
+ i7 = i17 + i8 | 0;
+ i10 = i15 - (i17 + i6) - i12 | 0;
+ HEAP32[i17 + (i6 + 4) >> 2] = i12 | 3;
+ L348 : do {
+ if ((i15 | 0) != (HEAP32[14496 >> 2] | 0)) {
+ if ((i15 | 0) == (HEAP32[14492 >> 2] | 0)) {
+ i32 = (HEAP32[14480 >> 2] | 0) + i10 | 0;
+ HEAP32[14480 >> 2] = i32;
+ HEAP32[14492 >> 2] = i7;
+ HEAP32[i17 + (i8 + 4) >> 2] = i32 | 1;
+ HEAP32[i17 + (i32 + i8) >> 2] = i32;
+ break;
+ }
+ i12 = i14 + 4 | 0;
+ i18 = HEAP32[i17 + (i12 + i13) >> 2] | 0;
+ if ((i18 & 3 | 0) == 1) {
+ i11 = i18 & -8;
+ i16 = i18 >>> 3;
+ do {
+ if (!(i18 >>> 0 < 256)) {
+ i9 = HEAP32[i17 + ((i13 | 24) + i14) >> 2] | 0;
+ i19 = HEAP32[i17 + (i14 + 12 + i13) >> 2] | 0;
+ do {
+ if ((i19 | 0) == (i15 | 0)) {
+ i19 = i13 | 16;
+ i18 = i17 + (i12 + i19) | 0;
+ i16 = HEAP32[i18 >> 2] | 0;
+ if ((i16 | 0) == 0) {
+ i18 = i17 + (i19 + i14) | 0;
+ i16 = HEAP32[i18 >> 2] | 0;
+ if ((i16 | 0) == 0) {
+ i5 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i20 = i16 + 20 | 0;
+ i19 = HEAP32[i20 >> 2] | 0;
+ if ((i19 | 0) != 0) {
+ i16 = i19;
+ i18 = i20;
+ continue;
+ }
+ i19 = i16 + 16 | 0;
+ i20 = HEAP32[i19 >> 2] | 0;
+ if ((i20 | 0) == 0) {
+ break;
+ } else {
+ i16 = i20;
+ i18 = i19;
+ }
+ }
+ if (i18 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i18 >> 2] = 0;
+ i5 = i16;
+ break;
+ }
+ } else {
+ i18 = HEAP32[i17 + ((i13 | 8) + i14) >> 2] | 0;
+ if (i18 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i18 + 12 | 0;
+ if ((HEAP32[i16 >> 2] | 0) != (i15 | 0)) {
+ _abort();
+ }
+ i20 = i19 + 8 | 0;
+ if ((HEAP32[i20 >> 2] | 0) == (i15 | 0)) {
+ HEAP32[i16 >> 2] = i19;
+ HEAP32[i20 >> 2] = i18;
+ i5 = i19;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ if ((i9 | 0) != 0) {
+ i16 = HEAP32[i17 + (i14 + 28 + i13) >> 2] | 0;
+ i18 = 14776 + (i16 << 2) | 0;
+ if ((i15 | 0) == (HEAP32[i18 >> 2] | 0)) {
+ HEAP32[i18 >> 2] = i5;
+ if ((i5 | 0) == 0) {
+ HEAP32[14476 >> 2] = HEAP32[14476 >> 2] & ~(1 << i16);
+ break;
+ }
+ } else {
+ if (i9 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i9 + 16 | 0;
+ if ((HEAP32[i16 >> 2] | 0) == (i15 | 0)) {
+ HEAP32[i16 >> 2] = i5;
+ } else {
+ HEAP32[i9 + 20 >> 2] = i5;
+ }
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ }
+ if (i5 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i5 + 24 >> 2] = i9;
+ i15 = i13 | 16;
+ i9 = HEAP32[i17 + (i15 + i14) >> 2] | 0;
+ do {
+ if ((i9 | 0) != 0) {
+ if (i9 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i5 + 16 >> 2] = i9;
+ HEAP32[i9 + 24 >> 2] = i5;
+ break;
+ }
+ }
+ } while (0);
+ i9 = HEAP32[i17 + (i12 + i15) >> 2] | 0;
+ if ((i9 | 0) != 0) {
+ if (i9 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i5 + 20 >> 2] = i9;
+ HEAP32[i9 + 24 >> 2] = i5;
+ break;
+ }
+ }
+ }
+ } else {
+ i5 = HEAP32[i17 + ((i13 | 8) + i14) >> 2] | 0;
+ i12 = HEAP32[i17 + (i14 + 12 + i13) >> 2] | 0;
+ i18 = 14512 + (i16 << 1 << 2) | 0;
+ if ((i5 | 0) != (i18 | 0)) {
+ if (i5 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ if ((HEAP32[i5 + 12 >> 2] | 0) != (i15 | 0)) {
+ _abort();
+ }
+ }
+ if ((i12 | 0) == (i5 | 0)) {
+ HEAP32[3618] = HEAP32[3618] & ~(1 << i16);
+ break;
+ }
+ if ((i12 | 0) != (i18 | 0)) {
+ if (i12 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i12 + 8 | 0;
+ if ((HEAP32[i16 >> 2] | 0) == (i15 | 0)) {
+ i9 = i16;
+ } else {
+ _abort();
+ }
+ } else {
+ i9 = i12 + 8 | 0;
+ }
+ HEAP32[i5 + 12 >> 2] = i12;
+ HEAP32[i9 >> 2] = i5;
+ }
+ } while (0);
+ i15 = i17 + ((i11 | i13) + i14) | 0;
+ i10 = i11 + i10 | 0;
+ }
+ i5 = i15 + 4 | 0;
+ HEAP32[i5 >> 2] = HEAP32[i5 >> 2] & -2;
+ HEAP32[i17 + (i8 + 4) >> 2] = i10 | 1;
+ HEAP32[i17 + (i10 + i8) >> 2] = i10;
+ i5 = i10 >>> 3;
+ if (i10 >>> 0 < 256) {
+ i10 = i5 << 1;
+ i2 = 14512 + (i10 << 2) | 0;
+ i9 = HEAP32[3618] | 0;
+ i5 = 1 << i5;
+ if ((i9 & i5 | 0) != 0) {
+ i9 = 14512 + (i10 + 2 << 2) | 0;
+ i5 = HEAP32[i9 >> 2] | 0;
+ if (i5 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i3 = i9;
+ i4 = i5;
+ }
+ } else {
+ HEAP32[3618] = i9 | i5;
+ i3 = 14512 + (i10 + 2 << 2) | 0;
+ i4 = i2;
+ }
+ HEAP32[i3 >> 2] = i7;
+ HEAP32[i4 + 12 >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i4;
+ HEAP32[i17 + (i8 + 12) >> 2] = i2;
+ break;
+ }
+ i3 = i10 >>> 8;
+ if ((i3 | 0) != 0) {
+ if (i10 >>> 0 > 16777215) {
+ i3 = 31;
+ } else {
+ i31 = (i3 + 1048320 | 0) >>> 16 & 8;
+ i32 = i3 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i3 = (i32 + 245760 | 0) >>> 16 & 2;
+ i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
+ i3 = i10 >>> (i3 + 7 | 0) & 1 | i3 << 1;
+ }
+ } else {
+ i3 = 0;
+ }
+ i4 = 14776 + (i3 << 2) | 0;
+ HEAP32[i17 + (i8 + 28) >> 2] = i3;
+ HEAP32[i17 + (i8 + 20) >> 2] = 0;
+ HEAP32[i17 + (i8 + 16) >> 2] = 0;
+ i9 = HEAP32[14476 >> 2] | 0;
+ i5 = 1 << i3;
+ if ((i9 & i5 | 0) == 0) {
+ HEAP32[14476 >> 2] = i9 | i5;
+ HEAP32[i4 >> 2] = i7;
+ HEAP32[i17 + (i8 + 24) >> 2] = i4;
+ HEAP32[i17 + (i8 + 12) >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i7;
+ break;
+ }
+ i4 = HEAP32[i4 >> 2] | 0;
+ if ((i3 | 0) == 31) {
+ i3 = 0;
+ } else {
+ i3 = 25 - (i3 >>> 1) | 0;
+ }
+ L444 : do {
+ if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i10 | 0)) {
+ i3 = i10 << i3;
+ while (1) {
+ i5 = i4 + (i3 >>> 31 << 2) + 16 | 0;
+ i9 = HEAP32[i5 >> 2] | 0;
+ if ((i9 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i9 + 4 >> 2] & -8 | 0) == (i10 | 0)) {
+ i2 = i9;
+ break L444;
+ } else {
+ i3 = i3 << 1;
+ i4 = i9;
+ }
+ }
+ if (i5 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i5 >> 2] = i7;
+ HEAP32[i17 + (i8 + 24) >> 2] = i4;
+ HEAP32[i17 + (i8 + 12) >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i7;
+ break L348;
+ }
+ } else {
+ i2 = i4;
+ }
+ } while (0);
+ i4 = i2 + 8 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ i5 = HEAP32[14488 >> 2] | 0;
+ if (i2 >>> 0 < i5 >>> 0) {
+ _abort();
+ }
+ if (i3 >>> 0 < i5 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i3 + 12 >> 2] = i7;
+ HEAP32[i4 >> 2] = i7;
+ HEAP32[i17 + (i8 + 8) >> 2] = i3;
+ HEAP32[i17 + (i8 + 12) >> 2] = i2;
+ HEAP32[i17 + (i8 + 24) >> 2] = 0;
+ break;
+ }
+ } else {
+ i32 = (HEAP32[14484 >> 2] | 0) + i10 | 0;
+ HEAP32[14484 >> 2] = i32;
+ HEAP32[14496 >> 2] = i7;
+ HEAP32[i17 + (i8 + 4) >> 2] = i32 | 1;
+ }
+ } while (0);
+ i32 = i17 + (i6 | 8) | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ i3 = 14920 | 0;
+ while (1) {
+ i2 = HEAP32[i3 >> 2] | 0;
+ if (!(i2 >>> 0 > i15 >>> 0) ? (i11 = HEAP32[i3 + 4 >> 2] | 0, i10 = i2 + i11 | 0, i10 >>> 0 > i15 >>> 0) : 0) {
+ break;
+ }
+ i3 = HEAP32[i3 + 8 >> 2] | 0;
+ }
+ i3 = i2 + (i11 + -39) | 0;
+ if ((i3 & 7 | 0) == 0) {
+ i3 = 0;
+ } else {
+ i3 = 0 - i3 & 7;
+ }
+ i2 = i2 + (i11 + -47 + i3) | 0;
+ i2 = i2 >>> 0 < (i15 + 16 | 0) >>> 0 ? i15 : i2;
+ i3 = i2 + 8 | 0;
+ i4 = i17 + 8 | 0;
+ if ((i4 & 7 | 0) == 0) {
+ i4 = 0;
+ } else {
+ i4 = 0 - i4 & 7;
+ }
+ i32 = i14 + -40 - i4 | 0;
+ HEAP32[14496 >> 2] = i17 + i4;
+ HEAP32[14484 >> 2] = i32;
+ HEAP32[i17 + (i4 + 4) >> 2] = i32 | 1;
+ HEAP32[i17 + (i14 + -36) >> 2] = 40;
+ HEAP32[14500 >> 2] = HEAP32[14960 >> 2];
+ HEAP32[i2 + 4 >> 2] = 27;
+ HEAP32[i3 + 0 >> 2] = HEAP32[14920 >> 2];
+ HEAP32[i3 + 4 >> 2] = HEAP32[14924 >> 2];
+ HEAP32[i3 + 8 >> 2] = HEAP32[14928 >> 2];
+ HEAP32[i3 + 12 >> 2] = HEAP32[14932 >> 2];
+ HEAP32[14920 >> 2] = i17;
+ HEAP32[14924 >> 2] = i14;
+ HEAP32[14932 >> 2] = 0;
+ HEAP32[14928 >> 2] = i3;
+ i4 = i2 + 28 | 0;
+ HEAP32[i4 >> 2] = 7;
+ if ((i2 + 32 | 0) >>> 0 < i10 >>> 0) {
+ while (1) {
+ i3 = i4 + 4 | 0;
+ HEAP32[i3 >> 2] = 7;
+ if ((i4 + 8 | 0) >>> 0 < i10 >>> 0) {
+ i4 = i3;
+ } else {
+ break;
+ }
+ }
+ }
+ if ((i2 | 0) != (i15 | 0)) {
+ i2 = i2 - i15 | 0;
+ i3 = i15 + (i2 + 4) | 0;
+ HEAP32[i3 >> 2] = HEAP32[i3 >> 2] & -2;
+ HEAP32[i15 + 4 >> 2] = i2 | 1;
+ HEAP32[i15 + i2 >> 2] = i2;
+ i3 = i2 >>> 3;
+ if (i2 >>> 0 < 256) {
+ i4 = i3 << 1;
+ i2 = 14512 + (i4 << 2) | 0;
+ i5 = HEAP32[3618] | 0;
+ i3 = 1 << i3;
+ if ((i5 & i3 | 0) != 0) {
+ i4 = 14512 + (i4 + 2 << 2) | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ if (i3 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i7 = i4;
+ i8 = i3;
+ }
+ } else {
+ HEAP32[3618] = i5 | i3;
+ i7 = 14512 + (i4 + 2 << 2) | 0;
+ i8 = i2;
+ }
+ HEAP32[i7 >> 2] = i15;
+ HEAP32[i8 + 12 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i8;
+ HEAP32[i15 + 12 >> 2] = i2;
+ break;
+ }
+ i3 = i2 >>> 8;
+ if ((i3 | 0) != 0) {
+ if (i2 >>> 0 > 16777215) {
+ i3 = 31;
+ } else {
+ i31 = (i3 + 1048320 | 0) >>> 16 & 8;
+ i32 = i3 << i31;
+ i30 = (i32 + 520192 | 0) >>> 16 & 4;
+ i32 = i32 << i30;
+ i3 = (i32 + 245760 | 0) >>> 16 & 2;
+ i3 = 14 - (i30 | i31 | i3) + (i32 << i3 >>> 15) | 0;
+ i3 = i2 >>> (i3 + 7 | 0) & 1 | i3 << 1;
+ }
+ } else {
+ i3 = 0;
+ }
+ i7 = 14776 + (i3 << 2) | 0;
+ HEAP32[i15 + 28 >> 2] = i3;
+ HEAP32[i15 + 20 >> 2] = 0;
+ HEAP32[i15 + 16 >> 2] = 0;
+ i4 = HEAP32[14476 >> 2] | 0;
+ i5 = 1 << i3;
+ if ((i4 & i5 | 0) == 0) {
+ HEAP32[14476 >> 2] = i4 | i5;
+ HEAP32[i7 >> 2] = i15;
+ HEAP32[i15 + 24 >> 2] = i7;
+ HEAP32[i15 + 12 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i15;
+ break;
+ }
+ i4 = HEAP32[i7 >> 2] | 0;
+ if ((i3 | 0) == 31) {
+ i3 = 0;
+ } else {
+ i3 = 25 - (i3 >>> 1) | 0;
+ }
+ L499 : do {
+ if ((HEAP32[i4 + 4 >> 2] & -8 | 0) != (i2 | 0)) {
+ i3 = i2 << i3;
+ while (1) {
+ i7 = i4 + (i3 >>> 31 << 2) + 16 | 0;
+ i5 = HEAP32[i7 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) == (i2 | 0)) {
+ i6 = i5;
+ break L499;
+ } else {
+ i3 = i3 << 1;
+ i4 = i5;
+ }
+ }
+ if (i7 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i7 >> 2] = i15;
+ HEAP32[i15 + 24 >> 2] = i4;
+ HEAP32[i15 + 12 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i15;
+ break L311;
+ }
+ } else {
+ i6 = i4;
+ }
+ } while (0);
+ i4 = i6 + 8 | 0;
+ i3 = HEAP32[i4 >> 2] | 0;
+ i2 = HEAP32[14488 >> 2] | 0;
+ if (i6 >>> 0 < i2 >>> 0) {
+ _abort();
+ }
+ if (i3 >>> 0 < i2 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i3 + 12 >> 2] = i15;
+ HEAP32[i4 >> 2] = i15;
+ HEAP32[i15 + 8 >> 2] = i3;
+ HEAP32[i15 + 12 >> 2] = i6;
+ HEAP32[i15 + 24 >> 2] = 0;
+ break;
+ }
+ }
+ } else {
+ i32 = HEAP32[14488 >> 2] | 0;
+ if ((i32 | 0) == 0 | i17 >>> 0 < i32 >>> 0) {
+ HEAP32[14488 >> 2] = i17;
+ }
+ HEAP32[14920 >> 2] = i17;
+ HEAP32[14924 >> 2] = i14;
+ HEAP32[14932 >> 2] = 0;
+ HEAP32[14508 >> 2] = HEAP32[3736];
+ HEAP32[14504 >> 2] = -1;
+ i2 = 0;
+ do {
+ i32 = i2 << 1;
+ i31 = 14512 + (i32 << 2) | 0;
+ HEAP32[14512 + (i32 + 3 << 2) >> 2] = i31;
+ HEAP32[14512 + (i32 + 2 << 2) >> 2] = i31;
+ i2 = i2 + 1 | 0;
+ } while ((i2 | 0) != 32);
+ i2 = i17 + 8 | 0;
+ if ((i2 & 7 | 0) == 0) {
+ i2 = 0;
+ } else {
+ i2 = 0 - i2 & 7;
+ }
+ i32 = i14 + -40 - i2 | 0;
+ HEAP32[14496 >> 2] = i17 + i2;
+ HEAP32[14484 >> 2] = i32;
+ HEAP32[i17 + (i2 + 4) >> 2] = i32 | 1;
+ HEAP32[i17 + (i14 + -36) >> 2] = 40;
+ HEAP32[14500 >> 2] = HEAP32[14960 >> 2];
+ }
+ } while (0);
+ i2 = HEAP32[14484 >> 2] | 0;
+ if (i2 >>> 0 > i12 >>> 0) {
+ i31 = i2 - i12 | 0;
+ HEAP32[14484 >> 2] = i31;
+ i32 = HEAP32[14496 >> 2] | 0;
+ HEAP32[14496 >> 2] = i32 + i12;
+ HEAP32[i32 + (i12 + 4) >> 2] = i31 | 1;
+ HEAP32[i32 + 4 >> 2] = i12 | 3;
+ i32 = i32 + 8 | 0;
+ STACKTOP = i1;
+ return i32 | 0;
+ }
+ }
+ HEAP32[(___errno_location() | 0) >> 2] = 12;
+ i32 = 0;
+ STACKTOP = i1;
+ return i32 | 0;
+}
+function _deflate(i2, i10) {
+ i2 = i2 | 0;
+ i10 = i10 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0, i30 = 0, i31 = 0, i32 = 0, i33 = 0, i34 = 0, i35 = 0, i36 = 0, i37 = 0;
+ i1 = STACKTOP;
+ if ((i2 | 0) == 0) {
+ i37 = -2;
+ STACKTOP = i1;
+ return i37 | 0;
+ }
+ i5 = i2 + 28 | 0;
+ i7 = HEAP32[i5 >> 2] | 0;
+ if ((i7 | 0) == 0 | i10 >>> 0 > 5) {
+ i37 = -2;
+ STACKTOP = i1;
+ return i37 | 0;
+ }
+ i4 = i2 + 12 | 0;
+ do {
+ if ((HEAP32[i4 >> 2] | 0) != 0) {
+ if ((HEAP32[i2 >> 2] | 0) == 0 ? (HEAP32[i2 + 4 >> 2] | 0) != 0 : 0) {
+ break;
+ }
+ i11 = i7 + 4 | 0;
+ i29 = HEAP32[i11 >> 2] | 0;
+ i9 = (i10 | 0) == 4;
+ if ((i29 | 0) != 666 | i9) {
+ i3 = i2 + 16 | 0;
+ if ((HEAP32[i3 >> 2] | 0) == 0) {
+ HEAP32[i2 + 24 >> 2] = HEAP32[3180 >> 2];
+ i37 = -5;
+ STACKTOP = i1;
+ return i37 | 0;
+ }
+ HEAP32[i7 >> 2] = i2;
+ i8 = i7 + 40 | 0;
+ i18 = HEAP32[i8 >> 2] | 0;
+ HEAP32[i8 >> 2] = i10;
+ do {
+ if ((i29 | 0) == 42) {
+ if ((HEAP32[i7 + 24 >> 2] | 0) != 2) {
+ i17 = (HEAP32[i7 + 48 >> 2] << 12) + -30720 | 0;
+ if ((HEAP32[i7 + 136 >> 2] | 0) <= 1 ? (i28 = HEAP32[i7 + 132 >> 2] | 0, (i28 | 0) >= 2) : 0) {
+ if ((i28 | 0) < 6) {
+ i28 = 64;
+ } else {
+ i28 = (i28 | 0) == 6 ? 128 : 192;
+ }
+ } else {
+ i28 = 0;
+ }
+ i28 = i28 | i17;
+ i17 = i7 + 108 | 0;
+ i37 = (HEAP32[i17 >> 2] | 0) == 0 ? i28 : i28 | 32;
+ HEAP32[i11 >> 2] = 113;
+ i29 = i7 + 20 | 0;
+ i30 = HEAP32[i29 >> 2] | 0;
+ HEAP32[i29 >> 2] = i30 + 1;
+ i28 = i7 + 8 | 0;
+ HEAP8[(HEAP32[i28 >> 2] | 0) + i30 | 0] = i37 >>> 8;
+ i30 = HEAP32[i29 >> 2] | 0;
+ HEAP32[i29 >> 2] = i30 + 1;
+ HEAP8[(HEAP32[i28 >> 2] | 0) + i30 | 0] = (i37 | ((i37 >>> 0) % 31 | 0)) ^ 31;
+ i30 = i2 + 48 | 0;
+ if ((HEAP32[i17 >> 2] | 0) != 0) {
+ i37 = HEAP32[i30 >> 2] | 0;
+ i36 = HEAP32[i29 >> 2] | 0;
+ HEAP32[i29 >> 2] = i36 + 1;
+ HEAP8[(HEAP32[i28 >> 2] | 0) + i36 | 0] = i37 >>> 24;
+ i36 = HEAP32[i29 >> 2] | 0;
+ HEAP32[i29 >> 2] = i36 + 1;
+ HEAP8[(HEAP32[i28 >> 2] | 0) + i36 | 0] = i37 >>> 16;
+ i36 = HEAP32[i30 >> 2] | 0;
+ i37 = HEAP32[i29 >> 2] | 0;
+ HEAP32[i29 >> 2] = i37 + 1;
+ HEAP8[(HEAP32[i28 >> 2] | 0) + i37 | 0] = i36 >>> 8;
+ i37 = HEAP32[i29 >> 2] | 0;
+ HEAP32[i29 >> 2] = i37 + 1;
+ HEAP8[(HEAP32[i28 >> 2] | 0) + i37 | 0] = i36;
+ }
+ HEAP32[i30 >> 2] = _adler32(0, 0, 0) | 0;
+ i31 = HEAP32[i11 >> 2] | 0;
+ i17 = 32;
+ break;
+ }
+ i32 = i2 + 48 | 0;
+ HEAP32[i32 >> 2] = _crc32(0, 0, 0) | 0;
+ i30 = i7 + 20 | 0;
+ i28 = HEAP32[i30 >> 2] | 0;
+ HEAP32[i30 >> 2] = i28 + 1;
+ i29 = i7 + 8 | 0;
+ HEAP8[(HEAP32[i29 >> 2] | 0) + i28 | 0] = 31;
+ i28 = HEAP32[i30 >> 2] | 0;
+ HEAP32[i30 >> 2] = i28 + 1;
+ HEAP8[(HEAP32[i29 >> 2] | 0) + i28 | 0] = -117;
+ i28 = HEAP32[i30 >> 2] | 0;
+ HEAP32[i30 >> 2] = i28 + 1;
+ HEAP8[(HEAP32[i29 >> 2] | 0) + i28 | 0] = 8;
+ i28 = i7 + 28 | 0;
+ i33 = HEAP32[i28 >> 2] | 0;
+ if ((i33 | 0) == 0) {
+ i22 = HEAP32[i30 >> 2] | 0;
+ HEAP32[i30 >> 2] = i22 + 1;
+ HEAP8[(HEAP32[i29 >> 2] | 0) + i22 | 0] = 0;
+ i22 = HEAP32[i30 >> 2] | 0;
+ HEAP32[i30 >> 2] = i22 + 1;
+ HEAP8[(HEAP32[i29 >> 2] | 0) + i22 | 0] = 0;
+ i22 = HEAP32[i30 >> 2] | 0;
+ HEAP32[i30 >> 2] = i22 + 1;
+ HEAP8[(HEAP32[i29 >> 2] | 0) + i22 | 0] = 0;
+ i22 = HEAP32[i30 >> 2] | 0;
+ HEAP32[i30 >> 2] = i22 + 1;
+ HEAP8[(HEAP32[i29 >> 2] | 0) + i22 | 0] = 0;
+ i22 = HEAP32[i30 >> 2] | 0;
+ HEAP32[i30 >> 2] = i22 + 1;
+ HEAP8[(HEAP32[i29 >> 2] | 0) + i22 | 0] = 0;
+ i22 = HEAP32[i7 + 132 >> 2] | 0;
+ if ((i22 | 0) != 9) {
+ if ((HEAP32[i7 + 136 >> 2] | 0) > 1) {
+ i22 = 4;
+ } else {
+ i22 = (i22 | 0) < 2 ? 4 : 0;
+ }
+ } else {
+ i22 = 2;
+ }
+ i37 = HEAP32[i30 >> 2] | 0;
+ HEAP32[i30 >> 2] = i37 + 1;
+ HEAP8[(HEAP32[i29 >> 2] | 0) + i37 | 0] = i22;
+ i37 = HEAP32[i30 >> 2] | 0;
+ HEAP32[i30 >> 2] = i37 + 1;
+ HEAP8[(HEAP32[i29 >> 2] | 0) + i37 | 0] = 3;
+ HEAP32[i11 >> 2] = 113;
+ break;
+ }
+ i37 = (((HEAP32[i33 + 44 >> 2] | 0) != 0 ? 2 : 0) | (HEAP32[i33 >> 2] | 0) != 0 | ((HEAP32[i33 + 16 >> 2] | 0) == 0 ? 0 : 4) | ((HEAP32[i33 + 28 >> 2] | 0) == 0 ? 0 : 8) | ((HEAP32[i33 + 36 >> 2] | 0) == 0 ? 0 : 16)) & 255;
+ i17 = HEAP32[i30 >> 2] | 0;
+ HEAP32[i30 >> 2] = i17 + 1;
+ HEAP8[(HEAP32[i29 >> 2] | 0) + i17 | 0] = i37;
+ i17 = HEAP32[(HEAP32[i28 >> 2] | 0) + 4 >> 2] & 255;
+ i37 = HEAP32[i30 >> 2] | 0;
+ HEAP32[i30 >> 2] = i37 + 1;
+ HEAP8[(HEAP32[i29 >> 2] | 0) + i37 | 0] = i17;
+ i37 = (HEAP32[(HEAP32[i28 >> 2] | 0) + 4 >> 2] | 0) >>> 8 & 255;
+ i17 = HEAP32[i30 >> 2] | 0;
+ HEAP32[i30 >> 2] = i17 + 1;
+ HEAP8[(HEAP32[i29 >> 2] | 0) + i17 | 0] = i37;
+ i17 = (HEAP32[(HEAP32[i28 >> 2] | 0) + 4 >> 2] | 0) >>> 16 & 255;
+ i37 = HEAP32[i30 >> 2] | 0;
+ HEAP32[i30 >> 2] = i37 + 1;
+ HEAP8[(HEAP32[i29 >> 2] | 0) + i37 | 0] = i17;
+ i37 = (HEAP32[(HEAP32[i28 >> 2] | 0) + 4 >> 2] | 0) >>> 24 & 255;
+ i17 = HEAP32[i30 >> 2] | 0;
+ HEAP32[i30 >> 2] = i17 + 1;
+ HEAP8[(HEAP32[i29 >> 2] | 0) + i17 | 0] = i37;
+ i17 = HEAP32[i7 + 132 >> 2] | 0;
+ if ((i17 | 0) != 9) {
+ if ((HEAP32[i7 + 136 >> 2] | 0) > 1) {
+ i17 = 4;
+ } else {
+ i17 = (i17 | 0) < 2 ? 4 : 0;
+ }
+ } else {
+ i17 = 2;
+ }
+ i37 = HEAP32[i30 >> 2] | 0;
+ HEAP32[i30 >> 2] = i37 + 1;
+ HEAP8[(HEAP32[i29 >> 2] | 0) + i37 | 0] = i17;
+ i37 = HEAP32[(HEAP32[i28 >> 2] | 0) + 12 >> 2] & 255;
+ i17 = HEAP32[i30 >> 2] | 0;
+ HEAP32[i30 >> 2] = i17 + 1;
+ HEAP8[(HEAP32[i29 >> 2] | 0) + i17 | 0] = i37;
+ i17 = HEAP32[i28 >> 2] | 0;
+ if ((HEAP32[i17 + 16 >> 2] | 0) != 0) {
+ i17 = HEAP32[i17 + 20 >> 2] & 255;
+ i37 = HEAP32[i30 >> 2] | 0;
+ HEAP32[i30 >> 2] = i37 + 1;
+ HEAP8[(HEAP32[i29 >> 2] | 0) + i37 | 0] = i17;
+ i37 = (HEAP32[(HEAP32[i28 >> 2] | 0) + 20 >> 2] | 0) >>> 8 & 255;
+ i17 = HEAP32[i30 >> 2] | 0;
+ HEAP32[i30 >> 2] = i17 + 1;
+ HEAP8[(HEAP32[i29 >> 2] | 0) + i17 | 0] = i37;
+ i17 = HEAP32[i28 >> 2] | 0;
+ }
+ if ((HEAP32[i17 + 44 >> 2] | 0) != 0) {
+ HEAP32[i32 >> 2] = _crc32(HEAP32[i32 >> 2] | 0, HEAP32[i29 >> 2] | 0, HEAP32[i30 >> 2] | 0) | 0;
+ }
+ HEAP32[i7 + 32 >> 2] = 0;
+ HEAP32[i11 >> 2] = 69;
+ i17 = 34;
+ } else {
+ i31 = i29;
+ i17 = 32;
+ }
+ } while (0);
+ if ((i17 | 0) == 32) {
+ if ((i31 | 0) == 69) {
+ i28 = i7 + 28 | 0;
+ i17 = 34;
+ } else {
+ i17 = 55;
+ }
+ }
+ do {
+ if ((i17 | 0) == 34) {
+ i37 = HEAP32[i28 >> 2] | 0;
+ if ((HEAP32[i37 + 16 >> 2] | 0) == 0) {
+ HEAP32[i11 >> 2] = 73;
+ i17 = 57;
+ break;
+ }
+ i29 = i7 + 20 | 0;
+ i34 = HEAP32[i29 >> 2] | 0;
+ i17 = i7 + 32 | 0;
+ i36 = HEAP32[i17 >> 2] | 0;
+ L55 : do {
+ if (i36 >>> 0 < (HEAP32[i37 + 20 >> 2] & 65535) >>> 0) {
+ i30 = i7 + 12 | 0;
+ i32 = i2 + 48 | 0;
+ i31 = i7 + 8 | 0;
+ i33 = i2 + 20 | 0;
+ i35 = i34;
+ while (1) {
+ if ((i35 | 0) == (HEAP32[i30 >> 2] | 0)) {
+ if ((HEAP32[i37 + 44 >> 2] | 0) != 0 & i35 >>> 0 > i34 >>> 0) {
+ HEAP32[i32 >> 2] = _crc32(HEAP32[i32 >> 2] | 0, (HEAP32[i31 >> 2] | 0) + i34 | 0, i35 - i34 | 0) | 0;
+ }
+ i34 = HEAP32[i5 >> 2] | 0;
+ i35 = HEAP32[i34 + 20 >> 2] | 0;
+ i36 = HEAP32[i3 >> 2] | 0;
+ i35 = i35 >>> 0 > i36 >>> 0 ? i36 : i35;
+ if ((i35 | 0) != 0 ? (_memcpy(HEAP32[i4 >> 2] | 0, HEAP32[i34 + 16 >> 2] | 0, i35 | 0) | 0, HEAP32[i4 >> 2] = (HEAP32[i4 >> 2] | 0) + i35, i27 = (HEAP32[i5 >> 2] | 0) + 16 | 0, HEAP32[i27 >> 2] = (HEAP32[i27 >> 2] | 0) + i35, HEAP32[i33 >> 2] = (HEAP32[i33 >> 2] | 0) + i35, HEAP32[i3 >> 2] = (HEAP32[i3 >> 2] | 0) - i35, i27 = HEAP32[i5 >> 2] | 0, i36 = i27 + 20 | 0, i37 = HEAP32[i36 >> 2] | 0, HEAP32[i36 >> 2] = i37 - i35, (i37 | 0) == (i35 | 0)) : 0) {
+ HEAP32[i27 + 16 >> 2] = HEAP32[i27 + 8 >> 2];
+ }
+ i34 = HEAP32[i29 >> 2] | 0;
+ if ((i34 | 0) == (HEAP32[i30 >> 2] | 0)) {
+ break;
+ }
+ i37 = HEAP32[i28 >> 2] | 0;
+ i36 = HEAP32[i17 >> 2] | 0;
+ i35 = i34;
+ }
+ i36 = HEAP8[(HEAP32[i37 + 16 >> 2] | 0) + i36 | 0] | 0;
+ HEAP32[i29 >> 2] = i35 + 1;
+ HEAP8[(HEAP32[i31 >> 2] | 0) + i35 | 0] = i36;
+ i36 = (HEAP32[i17 >> 2] | 0) + 1 | 0;
+ HEAP32[i17 >> 2] = i36;
+ i37 = HEAP32[i28 >> 2] | 0;
+ if (!(i36 >>> 0 < (HEAP32[i37 + 20 >> 2] & 65535) >>> 0)) {
+ break L55;
+ }
+ i35 = HEAP32[i29 >> 2] | 0;
+ }
+ i37 = HEAP32[i28 >> 2] | 0;
+ }
+ } while (0);
+ if ((HEAP32[i37 + 44 >> 2] | 0) != 0 ? (i26 = HEAP32[i29 >> 2] | 0, i26 >>> 0 > i34 >>> 0) : 0) {
+ i37 = i2 + 48 | 0;
+ HEAP32[i37 >> 2] = _crc32(HEAP32[i37 >> 2] | 0, (HEAP32[i7 + 8 >> 2] | 0) + i34 | 0, i26 - i34 | 0) | 0;
+ i37 = HEAP32[i28 >> 2] | 0;
+ }
+ if ((HEAP32[i17 >> 2] | 0) == (HEAP32[i37 + 20 >> 2] | 0)) {
+ HEAP32[i17 >> 2] = 0;
+ HEAP32[i11 >> 2] = 73;
+ i17 = 57;
+ break;
+ } else {
+ i31 = HEAP32[i11 >> 2] | 0;
+ i17 = 55;
+ break;
+ }
+ }
+ } while (0);
+ if ((i17 | 0) == 55) {
+ if ((i31 | 0) == 73) {
+ i37 = HEAP32[i7 + 28 >> 2] | 0;
+ i17 = 57;
+ } else {
+ i17 = 76;
+ }
+ }
+ do {
+ if ((i17 | 0) == 57) {
+ i26 = i7 + 28 | 0;
+ if ((HEAP32[i37 + 28 >> 2] | 0) == 0) {
+ HEAP32[i11 >> 2] = 91;
+ i17 = 78;
+ break;
+ }
+ i27 = i7 + 20 | 0;
+ i35 = HEAP32[i27 >> 2] | 0;
+ i32 = i7 + 12 | 0;
+ i29 = i2 + 48 | 0;
+ i28 = i7 + 8 | 0;
+ i31 = i2 + 20 | 0;
+ i30 = i7 + 32 | 0;
+ i33 = i35;
+ while (1) {
+ if ((i33 | 0) == (HEAP32[i32 >> 2] | 0)) {
+ if ((HEAP32[(HEAP32[i26 >> 2] | 0) + 44 >> 2] | 0) != 0 & i33 >>> 0 > i35 >>> 0) {
+ HEAP32[i29 >> 2] = _crc32(HEAP32[i29 >> 2] | 0, (HEAP32[i28 >> 2] | 0) + i35 | 0, i33 - i35 | 0) | 0;
+ }
+ i33 = HEAP32[i5 >> 2] | 0;
+ i34 = HEAP32[i33 + 20 >> 2] | 0;
+ i35 = HEAP32[i3 >> 2] | 0;
+ i34 = i34 >>> 0 > i35 >>> 0 ? i35 : i34;
+ if ((i34 | 0) != 0 ? (_memcpy(HEAP32[i4 >> 2] | 0, HEAP32[i33 + 16 >> 2] | 0, i34 | 0) | 0, HEAP32[i4 >> 2] = (HEAP32[i4 >> 2] | 0) + i34, i25 = (HEAP32[i5 >> 2] | 0) + 16 | 0, HEAP32[i25 >> 2] = (HEAP32[i25 >> 2] | 0) + i34, HEAP32[i31 >> 2] = (HEAP32[i31 >> 2] | 0) + i34, HEAP32[i3 >> 2] = (HEAP32[i3 >> 2] | 0) - i34, i25 = HEAP32[i5 >> 2] | 0, i36 = i25 + 20 | 0, i37 = HEAP32[i36 >> 2] | 0, HEAP32[i36 >> 2] = i37 - i34, (i37 | 0) == (i34 | 0)) : 0) {
+ HEAP32[i25 + 16 >> 2] = HEAP32[i25 + 8 >> 2];
+ }
+ i35 = HEAP32[i27 >> 2] | 0;
+ if ((i35 | 0) == (HEAP32[i32 >> 2] | 0)) {
+ i25 = 1;
+ break;
+ } else {
+ i33 = i35;
+ }
+ }
+ i34 = HEAP32[i30 >> 2] | 0;
+ HEAP32[i30 >> 2] = i34 + 1;
+ i34 = HEAP8[(HEAP32[(HEAP32[i26 >> 2] | 0) + 28 >> 2] | 0) + i34 | 0] | 0;
+ HEAP32[i27 >> 2] = i33 + 1;
+ HEAP8[(HEAP32[i28 >> 2] | 0) + i33 | 0] = i34;
+ if (i34 << 24 >> 24 == 0) {
+ i17 = 68;
+ break;
+ }
+ i33 = HEAP32[i27 >> 2] | 0;
+ }
+ if ((i17 | 0) == 68) {
+ i25 = i34 & 255;
+ }
+ if ((HEAP32[(HEAP32[i26 >> 2] | 0) + 44 >> 2] | 0) != 0 ? (i24 = HEAP32[i27 >> 2] | 0, i24 >>> 0 > i35 >>> 0) : 0) {
+ HEAP32[i29 >> 2] = _crc32(HEAP32[i29 >> 2] | 0, (HEAP32[i28 >> 2] | 0) + i35 | 0, i24 - i35 | 0) | 0;
+ }
+ if ((i25 | 0) == 0) {
+ HEAP32[i30 >> 2] = 0;
+ HEAP32[i11 >> 2] = 91;
+ i17 = 78;
+ break;
+ } else {
+ i31 = HEAP32[i11 >> 2] | 0;
+ i17 = 76;
+ break;
+ }
+ }
+ } while (0);
+ if ((i17 | 0) == 76) {
+ if ((i31 | 0) == 91) {
+ i26 = i7 + 28 | 0;
+ i17 = 78;
+ } else {
+ i17 = 97;
+ }
+ }
+ do {
+ if ((i17 | 0) == 78) {
+ if ((HEAP32[(HEAP32[i26 >> 2] | 0) + 36 >> 2] | 0) == 0) {
+ HEAP32[i11 >> 2] = 103;
+ i17 = 99;
+ break;
+ }
+ i24 = i7 + 20 | 0;
+ i32 = HEAP32[i24 >> 2] | 0;
+ i29 = i7 + 12 | 0;
+ i27 = i2 + 48 | 0;
+ i25 = i7 + 8 | 0;
+ i28 = i2 + 20 | 0;
+ i30 = i7 + 32 | 0;
+ i31 = i32;
+ while (1) {
+ if ((i31 | 0) == (HEAP32[i29 >> 2] | 0)) {
+ if ((HEAP32[(HEAP32[i26 >> 2] | 0) + 44 >> 2] | 0) != 0 & i31 >>> 0 > i32 >>> 0) {
+ HEAP32[i27 >> 2] = _crc32(HEAP32[i27 >> 2] | 0, (HEAP32[i25 >> 2] | 0) + i32 | 0, i31 - i32 | 0) | 0;
+ }
+ i31 = HEAP32[i5 >> 2] | 0;
+ i33 = HEAP32[i31 + 20 >> 2] | 0;
+ i32 = HEAP32[i3 >> 2] | 0;
+ i32 = i33 >>> 0 > i32 >>> 0 ? i32 : i33;
+ if ((i32 | 0) != 0 ? (_memcpy(HEAP32[i4 >> 2] | 0, HEAP32[i31 + 16 >> 2] | 0, i32 | 0) | 0, HEAP32[i4 >> 2] = (HEAP32[i4 >> 2] | 0) + i32, i23 = (HEAP32[i5 >> 2] | 0) + 16 | 0, HEAP32[i23 >> 2] = (HEAP32[i23 >> 2] | 0) + i32, HEAP32[i28 >> 2] = (HEAP32[i28 >> 2] | 0) + i32, HEAP32[i3 >> 2] = (HEAP32[i3 >> 2] | 0) - i32, i23 = HEAP32[i5 >> 2] | 0, i36 = i23 + 20 | 0, i37 = HEAP32[i36 >> 2] | 0, HEAP32[i36 >> 2] = i37 - i32, (i37 | 0) == (i32 | 0)) : 0) {
+ HEAP32[i23 + 16 >> 2] = HEAP32[i23 + 8 >> 2];
+ }
+ i32 = HEAP32[i24 >> 2] | 0;
+ if ((i32 | 0) == (HEAP32[i29 >> 2] | 0)) {
+ i23 = 1;
+ break;
+ } else {
+ i31 = i32;
+ }
+ }
+ i33 = HEAP32[i30 >> 2] | 0;
+ HEAP32[i30 >> 2] = i33 + 1;
+ i33 = HEAP8[(HEAP32[(HEAP32[i26 >> 2] | 0) + 36 >> 2] | 0) + i33 | 0] | 0;
+ HEAP32[i24 >> 2] = i31 + 1;
+ HEAP8[(HEAP32[i25 >> 2] | 0) + i31 | 0] = i33;
+ if (i33 << 24 >> 24 == 0) {
+ i17 = 89;
+ break;
+ }
+ i31 = HEAP32[i24 >> 2] | 0;
+ }
+ if ((i17 | 0) == 89) {
+ i23 = i33 & 255;
+ }
+ if ((HEAP32[(HEAP32[i26 >> 2] | 0) + 44 >> 2] | 0) != 0 ? (i22 = HEAP32[i24 >> 2] | 0, i22 >>> 0 > i32 >>> 0) : 0) {
+ HEAP32[i27 >> 2] = _crc32(HEAP32[i27 >> 2] | 0, (HEAP32[i25 >> 2] | 0) + i32 | 0, i22 - i32 | 0) | 0;
+ }
+ if ((i23 | 0) == 0) {
+ HEAP32[i11 >> 2] = 103;
+ i17 = 99;
+ break;
+ } else {
+ i31 = HEAP32[i11 >> 2] | 0;
+ i17 = 97;
+ break;
+ }
+ }
+ } while (0);
+ if ((i17 | 0) == 97 ? (i31 | 0) == 103 : 0) {
+ i26 = i7 + 28 | 0;
+ i17 = 99;
+ }
+ do {
+ if ((i17 | 0) == 99) {
+ if ((HEAP32[(HEAP32[i26 >> 2] | 0) + 44 >> 2] | 0) == 0) {
+ HEAP32[i11 >> 2] = 113;
+ break;
+ }
+ i17 = i7 + 20 | 0;
+ i22 = i7 + 12 | 0;
+ if ((((HEAP32[i17 >> 2] | 0) + 2 | 0) >>> 0 > (HEAP32[i22 >> 2] | 0) >>> 0 ? (i20 = HEAP32[i5 >> 2] | 0, i21 = HEAP32[i20 + 20 >> 2] | 0, i23 = HEAP32[i3 >> 2] | 0, i21 = i21 >>> 0 > i23 >>> 0 ? i23 : i21, (i21 | 0) != 0) : 0) ? (_memcpy(HEAP32[i4 >> 2] | 0, HEAP32[i20 + 16 >> 2] | 0, i21 | 0) | 0, HEAP32[i4 >> 2] = (HEAP32[i4 >> 2] | 0) + i21, i19 = (HEAP32[i5 >> 2] | 0) + 16 | 0, HEAP32[i19 >> 2] = (HEAP32[i19 >> 2] | 0) + i21, i19 = i2 + 20 | 0, HEAP32[i19 >> 2] = (HEAP32[i19 >> 2] | 0) + i21, HEAP32[i3 >> 2] = (HEAP32[i3 >> 2] | 0) - i21, i19 = HEAP32[i5 >> 2] | 0, i36 = i19 + 20 | 0, i37 = HEAP32[i36 >> 2] | 0, HEAP32[i36 >> 2] = i37 - i21, (i37 | 0) == (i21 | 0)) : 0) {
+ HEAP32[i19 + 16 >> 2] = HEAP32[i19 + 8 >> 2];
+ }
+ i19 = HEAP32[i17 >> 2] | 0;
+ if (!((i19 + 2 | 0) >>> 0 > (HEAP32[i22 >> 2] | 0) >>> 0)) {
+ i37 = i2 + 48 | 0;
+ i34 = HEAP32[i37 >> 2] & 255;
+ HEAP32[i17 >> 2] = i19 + 1;
+ i35 = i7 + 8 | 0;
+ HEAP8[(HEAP32[i35 >> 2] | 0) + i19 | 0] = i34;
+ i34 = (HEAP32[i37 >> 2] | 0) >>> 8 & 255;
+ i36 = HEAP32[i17 >> 2] | 0;
+ HEAP32[i17 >> 2] = i36 + 1;
+ HEAP8[(HEAP32[i35 >> 2] | 0) + i36 | 0] = i34;
+ HEAP32[i37 >> 2] = _crc32(0, 0, 0) | 0;
+ HEAP32[i11 >> 2] = 113;
+ }
+ }
+ } while (0);
+ i19 = i7 + 20 | 0;
+ if ((HEAP32[i19 >> 2] | 0) == 0) {
+ if ((HEAP32[i2 + 4 >> 2] | 0) == 0 ? (i18 | 0) >= (i10 | 0) & (i10 | 0) != 4 : 0) {
+ HEAP32[i2 + 24 >> 2] = HEAP32[3180 >> 2];
+ i37 = -5;
+ STACKTOP = i1;
+ return i37 | 0;
+ }
+ } else {
+ i17 = HEAP32[i5 >> 2] | 0;
+ i20 = HEAP32[i17 + 20 >> 2] | 0;
+ i18 = HEAP32[i3 >> 2] | 0;
+ i20 = i20 >>> 0 > i18 >>> 0 ? i18 : i20;
+ if ((i20 | 0) != 0) {
+ _memcpy(HEAP32[i4 >> 2] | 0, HEAP32[i17 + 16 >> 2] | 0, i20 | 0) | 0;
+ HEAP32[i4 >> 2] = (HEAP32[i4 >> 2] | 0) + i20;
+ i17 = (HEAP32[i5 >> 2] | 0) + 16 | 0;
+ HEAP32[i17 >> 2] = (HEAP32[i17 >> 2] | 0) + i20;
+ i17 = i2 + 20 | 0;
+ HEAP32[i17 >> 2] = (HEAP32[i17 >> 2] | 0) + i20;
+ HEAP32[i3 >> 2] = (HEAP32[i3 >> 2] | 0) - i20;
+ i17 = HEAP32[i5 >> 2] | 0;
+ i36 = i17 + 20 | 0;
+ i37 = HEAP32[i36 >> 2] | 0;
+ HEAP32[i36 >> 2] = i37 - i20;
+ if ((i37 | 0) == (i20 | 0)) {
+ HEAP32[i17 + 16 >> 2] = HEAP32[i17 + 8 >> 2];
+ }
+ i18 = HEAP32[i3 >> 2] | 0;
+ }
+ if ((i18 | 0) == 0) {
+ HEAP32[i8 >> 2] = -1;
+ i37 = 0;
+ STACKTOP = i1;
+ return i37 | 0;
+ }
+ }
+ i18 = (HEAP32[i11 >> 2] | 0) == 666;
+ i17 = (HEAP32[i2 + 4 >> 2] | 0) == 0;
+ if (i18) {
+ if (i17) {
+ i17 = 121;
+ } else {
+ HEAP32[i2 + 24 >> 2] = HEAP32[3180 >> 2];
+ i37 = -5;
+ STACKTOP = i1;
+ return i37 | 0;
+ }
+ } else {
+ if (i17) {
+ i17 = 121;
+ } else {
+ i17 = 124;
+ }
+ }
+ do {
+ if ((i17 | 0) == 121) {
+ if ((HEAP32[i7 + 116 >> 2] | 0) == 0) {
+ if ((i10 | 0) != 0) {
+ if (i18) {
+ break;
+ } else {
+ i17 = 124;
+ break;
+ }
+ } else {
+ i37 = 0;
+ STACKTOP = i1;
+ return i37 | 0;
+ }
+ } else {
+ i17 = 124;
+ }
+ }
+ } while (0);
+ do {
+ if ((i17 | 0) == 124) {
+ i18 = HEAP32[i7 + 136 >> 2] | 0;
+ L185 : do {
+ if ((i18 | 0) == 2) {
+ i22 = i7 + 116 | 0;
+ i18 = i7 + 96 | 0;
+ i13 = i7 + 108 | 0;
+ i14 = i7 + 56 | 0;
+ i21 = i7 + 5792 | 0;
+ i20 = i7 + 5796 | 0;
+ i24 = i7 + 5784 | 0;
+ i23 = i7 + 5788 | 0;
+ i12 = i7 + 92 | 0;
+ while (1) {
+ if ((HEAP32[i22 >> 2] | 0) == 0 ? (_fill_window(i7), (HEAP32[i22 >> 2] | 0) == 0) : 0) {
+ break;
+ }
+ HEAP32[i18 >> 2] = 0;
+ i37 = HEAP8[(HEAP32[i14 >> 2] | 0) + (HEAP32[i13 >> 2] | 0) | 0] | 0;
+ i26 = HEAP32[i21 >> 2] | 0;
+ HEAP16[(HEAP32[i20 >> 2] | 0) + (i26 << 1) >> 1] = 0;
+ HEAP32[i21 >> 2] = i26 + 1;
+ HEAP8[(HEAP32[i24 >> 2] | 0) + i26 | 0] = i37;
+ i37 = i7 + ((i37 & 255) << 2) + 148 | 0;
+ HEAP16[i37 >> 1] = (HEAP16[i37 >> 1] | 0) + 1 << 16 >> 16;
+ i37 = (HEAP32[i21 >> 2] | 0) == ((HEAP32[i23 >> 2] | 0) + -1 | 0);
+ HEAP32[i22 >> 2] = (HEAP32[i22 >> 2] | 0) + -1;
+ i26 = (HEAP32[i13 >> 2] | 0) + 1 | 0;
+ HEAP32[i13 >> 2] = i26;
+ if (!i37) {
+ continue;
+ }
+ i25 = HEAP32[i12 >> 2] | 0;
+ if ((i25 | 0) > -1) {
+ i27 = (HEAP32[i14 >> 2] | 0) + i25 | 0;
+ } else {
+ i27 = 0;
+ }
+ __tr_flush_block(i7, i27, i26 - i25 | 0, 0);
+ HEAP32[i12 >> 2] = HEAP32[i13 >> 2];
+ i26 = HEAP32[i7 >> 2] | 0;
+ i25 = i26 + 28 | 0;
+ i27 = HEAP32[i25 >> 2] | 0;
+ i30 = HEAP32[i27 + 20 >> 2] | 0;
+ i28 = i26 + 16 | 0;
+ i29 = HEAP32[i28 >> 2] | 0;
+ i29 = i30 >>> 0 > i29 >>> 0 ? i29 : i30;
+ if ((i29 | 0) != 0 ? (i16 = i26 + 12 | 0, _memcpy(HEAP32[i16 >> 2] | 0, HEAP32[i27 + 16 >> 2] | 0, i29 | 0) | 0, HEAP32[i16 >> 2] = (HEAP32[i16 >> 2] | 0) + i29, i16 = (HEAP32[i25 >> 2] | 0) + 16 | 0, HEAP32[i16 >> 2] = (HEAP32[i16 >> 2] | 0) + i29, i16 = i26 + 20 | 0, HEAP32[i16 >> 2] = (HEAP32[i16 >> 2] | 0) + i29, HEAP32[i28 >> 2] = (HEAP32[i28 >> 2] | 0) - i29, i16 = HEAP32[i25 >> 2] | 0, i36 = i16 + 20 | 0, i37 = HEAP32[i36 >> 2] | 0, HEAP32[i36 >> 2] = i37 - i29, (i37 | 0) == (i29 | 0)) : 0) {
+ HEAP32[i16 + 16 >> 2] = HEAP32[i16 + 8 >> 2];
+ }
+ if ((HEAP32[(HEAP32[i7 >> 2] | 0) + 16 >> 2] | 0) == 0) {
+ break L185;
+ }
+ }
+ if ((i10 | 0) != 0) {
+ i16 = HEAP32[i12 >> 2] | 0;
+ if ((i16 | 0) > -1) {
+ i14 = (HEAP32[i14 >> 2] | 0) + i16 | 0;
+ } else {
+ i14 = 0;
+ }
+ __tr_flush_block(i7, i14, (HEAP32[i13 >> 2] | 0) - i16 | 0, i9 & 1);
+ HEAP32[i12 >> 2] = HEAP32[i13 >> 2];
+ i14 = HEAP32[i7 >> 2] | 0;
+ i13 = i14 + 28 | 0;
+ i12 = HEAP32[i13 >> 2] | 0;
+ i17 = HEAP32[i12 + 20 >> 2] | 0;
+ i16 = i14 + 16 | 0;
+ i18 = HEAP32[i16 >> 2] | 0;
+ i17 = i17 >>> 0 > i18 >>> 0 ? i18 : i17;
+ if ((i17 | 0) != 0 ? (i15 = i14 + 12 | 0, _memcpy(HEAP32[i15 >> 2] | 0, HEAP32[i12 + 16 >> 2] | 0, i17 | 0) | 0, HEAP32[i15 >> 2] = (HEAP32[i15 >> 2] | 0) + i17, i15 = (HEAP32[i13 >> 2] | 0) + 16 | 0, HEAP32[i15 >> 2] = (HEAP32[i15 >> 2] | 0) + i17, i15 = i14 + 20 | 0, HEAP32[i15 >> 2] = (HEAP32[i15 >> 2] | 0) + i17, HEAP32[i16 >> 2] = (HEAP32[i16 >> 2] | 0) - i17, i15 = HEAP32[i13 >> 2] | 0, i36 = i15 + 20 | 0, i37 = HEAP32[i36 >> 2] | 0, HEAP32[i36 >> 2] = i37 - i17, (i37 | 0) == (i17 | 0)) : 0) {
+ HEAP32[i15 + 16 >> 2] = HEAP32[i15 + 8 >> 2];
+ }
+ if ((HEAP32[(HEAP32[i7 >> 2] | 0) + 16 >> 2] | 0) == 0) {
+ i12 = i9 ? 2 : 0;
+ i17 = 183;
+ break;
+ } else {
+ i12 = i9 ? 3 : 1;
+ i17 = 183;
+ break;
+ }
+ }
+ } else if ((i18 | 0) == 3) {
+ i27 = i7 + 116 | 0;
+ i26 = (i10 | 0) == 0;
+ i22 = i7 + 96 | 0;
+ i15 = i7 + 108 | 0;
+ i20 = i7 + 5792 | 0;
+ i24 = i7 + 5796 | 0;
+ i23 = i7 + 5784 | 0;
+ i21 = i7 + (HEAPU8[296] << 2) + 2440 | 0;
+ i25 = i7 + 5788 | 0;
+ i18 = i7 + 56 | 0;
+ i16 = i7 + 92 | 0;
+ while (1) {
+ i29 = HEAP32[i27 >> 2] | 0;
+ if (i29 >>> 0 < 258) {
+ _fill_window(i7);
+ i29 = HEAP32[i27 >> 2] | 0;
+ if (i29 >>> 0 < 258 & i26) {
+ break L185;
+ }
+ if ((i29 | 0) == 0) {
+ break;
+ }
+ HEAP32[i22 >> 2] = 0;
+ if (i29 >>> 0 > 2) {
+ i17 = 151;
+ } else {
+ i28 = HEAP32[i15 >> 2] | 0;
+ i17 = 166;
+ }
+ } else {
+ HEAP32[i22 >> 2] = 0;
+ i17 = 151;
+ }
+ if ((i17 | 0) == 151) {
+ i17 = 0;
+ i28 = HEAP32[i15 >> 2] | 0;
+ if ((i28 | 0) != 0) {
+ i31 = HEAP32[i18 >> 2] | 0;
+ i30 = HEAP8[i31 + (i28 + -1) | 0] | 0;
+ if ((i30 << 24 >> 24 == (HEAP8[i31 + i28 | 0] | 0) ? i30 << 24 >> 24 == (HEAP8[i31 + (i28 + 1) | 0] | 0) : 0) ? (i14 = i31 + (i28 + 2) | 0, i30 << 24 >> 24 == (HEAP8[i14] | 0)) : 0) {
+ i31 = i31 + (i28 + 258) | 0;
+ i32 = i14;
+ do {
+ i33 = i32 + 1 | 0;
+ if (!(i30 << 24 >> 24 == (HEAP8[i33] | 0))) {
+ i32 = i33;
+ break;
+ }
+ i33 = i32 + 2 | 0;
+ if (!(i30 << 24 >> 24 == (HEAP8[i33] | 0))) {
+ i32 = i33;
+ break;
+ }
+ i33 = i32 + 3 | 0;
+ if (!(i30 << 24 >> 24 == (HEAP8[i33] | 0))) {
+ i32 = i33;
+ break;
+ }
+ i33 = i32 + 4 | 0;
+ if (!(i30 << 24 >> 24 == (HEAP8[i33] | 0))) {
+ i32 = i33;
+ break;
+ }
+ i33 = i32 + 5 | 0;
+ if (!(i30 << 24 >> 24 == (HEAP8[i33] | 0))) {
+ i32 = i33;
+ break;
+ }
+ i33 = i32 + 6 | 0;
+ if (!(i30 << 24 >> 24 == (HEAP8[i33] | 0))) {
+ i32 = i33;
+ break;
+ }
+ i33 = i32 + 7 | 0;
+ if (!(i30 << 24 >> 24 == (HEAP8[i33] | 0))) {
+ i32 = i33;
+ break;
+ }
+ i32 = i32 + 8 | 0;
+ } while (i30 << 24 >> 24 == (HEAP8[i32] | 0) & i32 >>> 0 < i31 >>> 0);
+ i30 = i32 - i31 + 258 | 0;
+ i29 = i30 >>> 0 > i29 >>> 0 ? i29 : i30;
+ HEAP32[i22 >> 2] = i29;
+ if (i29 >>> 0 > 2) {
+ i29 = i29 + 253 | 0;
+ i28 = HEAP32[i20 >> 2] | 0;
+ HEAP16[(HEAP32[i24 >> 2] | 0) + (i28 << 1) >> 1] = 1;
+ HEAP32[i20 >> 2] = i28 + 1;
+ HEAP8[(HEAP32[i23 >> 2] | 0) + i28 | 0] = i29;
+ i29 = i7 + ((HEAPU8[808 + (i29 & 255) | 0] | 256) + 1 << 2) + 148 | 0;
+ HEAP16[i29 >> 1] = (HEAP16[i29 >> 1] | 0) + 1 << 16 >> 16;
+ HEAP16[i21 >> 1] = (HEAP16[i21 >> 1] | 0) + 1 << 16 >> 16;
+ i29 = (HEAP32[i20 >> 2] | 0) == ((HEAP32[i25 >> 2] | 0) + -1 | 0) | 0;
+ i28 = HEAP32[i22 >> 2] | 0;
+ HEAP32[i27 >> 2] = (HEAP32[i27 >> 2] | 0) - i28;
+ i28 = (HEAP32[i15 >> 2] | 0) + i28 | 0;
+ HEAP32[i15 >> 2] = i28;
+ HEAP32[i22 >> 2] = 0;
+ } else {
+ i17 = 166;
+ }
+ } else {
+ i17 = 166;
+ }
+ } else {
+ i28 = 0;
+ i17 = 166;
+ }
+ }
+ if ((i17 | 0) == 166) {
+ i17 = 0;
+ i29 = HEAP8[(HEAP32[i18 >> 2] | 0) + i28 | 0] | 0;
+ i28 = HEAP32[i20 >> 2] | 0;
+ HEAP16[(HEAP32[i24 >> 2] | 0) + (i28 << 1) >> 1] = 0;
+ HEAP32[i20 >> 2] = i28 + 1;
+ HEAP8[(HEAP32[i23 >> 2] | 0) + i28 | 0] = i29;
+ i29 = i7 + ((i29 & 255) << 2) + 148 | 0;
+ HEAP16[i29 >> 1] = (HEAP16[i29 >> 1] | 0) + 1 << 16 >> 16;
+ i29 = (HEAP32[i20 >> 2] | 0) == ((HEAP32[i25 >> 2] | 0) + -1 | 0) | 0;
+ HEAP32[i27 >> 2] = (HEAP32[i27 >> 2] | 0) + -1;
+ i28 = (HEAP32[i15 >> 2] | 0) + 1 | 0;
+ HEAP32[i15 >> 2] = i28;
+ }
+ if ((i29 | 0) == 0) {
+ continue;
+ }
+ i29 = HEAP32[i16 >> 2] | 0;
+ if ((i29 | 0) > -1) {
+ i30 = (HEAP32[i18 >> 2] | 0) + i29 | 0;
+ } else {
+ i30 = 0;
+ }
+ __tr_flush_block(i7, i30, i28 - i29 | 0, 0);
+ HEAP32[i16 >> 2] = HEAP32[i15 >> 2];
+ i30 = HEAP32[i7 >> 2] | 0;
+ i28 = i30 + 28 | 0;
+ i29 = HEAP32[i28 >> 2] | 0;
+ i33 = HEAP32[i29 + 20 >> 2] | 0;
+ i31 = i30 + 16 | 0;
+ i32 = HEAP32[i31 >> 2] | 0;
+ i32 = i33 >>> 0 > i32 >>> 0 ? i32 : i33;
+ if ((i32 | 0) != 0 ? (i13 = i30 + 12 | 0, _memcpy(HEAP32[i13 >> 2] | 0, HEAP32[i29 + 16 >> 2] | 0, i32 | 0) | 0, HEAP32[i13 >> 2] = (HEAP32[i13 >> 2] | 0) + i32, i13 = (HEAP32[i28 >> 2] | 0) + 16 | 0, HEAP32[i13 >> 2] = (HEAP32[i13 >> 2] | 0) + i32, i13 = i30 + 20 | 0, HEAP32[i13 >> 2] = (HEAP32[i13 >> 2] | 0) + i32, HEAP32[i31 >> 2] = (HEAP32[i31 >> 2] | 0) - i32, i13 = HEAP32[i28 >> 2] | 0, i36 = i13 + 20 | 0, i37 = HEAP32[i36 >> 2] | 0, HEAP32[i36 >> 2] = i37 - i32, (i37 | 0) == (i32 | 0)) : 0) {
+ HEAP32[i13 + 16 >> 2] = HEAP32[i13 + 8 >> 2];
+ }
+ if ((HEAP32[(HEAP32[i7 >> 2] | 0) + 16 >> 2] | 0) == 0) {
+ break L185;
+ }
+ }
+ i13 = HEAP32[i16 >> 2] | 0;
+ if ((i13 | 0) > -1) {
+ i14 = (HEAP32[i18 >> 2] | 0) + i13 | 0;
+ } else {
+ i14 = 0;
+ }
+ __tr_flush_block(i7, i14, (HEAP32[i15 >> 2] | 0) - i13 | 0, i9 & 1);
+ HEAP32[i16 >> 2] = HEAP32[i15 >> 2];
+ i14 = HEAP32[i7 >> 2] | 0;
+ i16 = i14 + 28 | 0;
+ i15 = HEAP32[i16 >> 2] | 0;
+ i18 = HEAP32[i15 + 20 >> 2] | 0;
+ i13 = i14 + 16 | 0;
+ i17 = HEAP32[i13 >> 2] | 0;
+ i17 = i18 >>> 0 > i17 >>> 0 ? i17 : i18;
+ if ((i17 | 0) != 0 ? (i12 = i14 + 12 | 0, _memcpy(HEAP32[i12 >> 2] | 0, HEAP32[i15 + 16 >> 2] | 0, i17 | 0) | 0, HEAP32[i12 >> 2] = (HEAP32[i12 >> 2] | 0) + i17, i12 = (HEAP32[i16 >> 2] | 0) + 16 | 0, HEAP32[i12 >> 2] = (HEAP32[i12 >> 2] | 0) + i17, i12 = i14 + 20 | 0, HEAP32[i12 >> 2] = (HEAP32[i12 >> 2] | 0) + i17, HEAP32[i13 >> 2] = (HEAP32[i13 >> 2] | 0) - i17, i12 = HEAP32[i16 >> 2] | 0, i36 = i12 + 20 | 0, i37 = HEAP32[i36 >> 2] | 0, HEAP32[i36 >> 2] = i37 - i17, (i37 | 0) == (i17 | 0)) : 0) {
+ HEAP32[i12 + 16 >> 2] = HEAP32[i12 + 8 >> 2];
+ }
+ if ((HEAP32[(HEAP32[i7 >> 2] | 0) + 16 >> 2] | 0) == 0) {
+ i12 = i9 ? 2 : 0;
+ i17 = 183;
+ break;
+ } else {
+ i12 = i9 ? 3 : 1;
+ i17 = 183;
+ break;
+ }
+ } else {
+ i12 = FUNCTION_TABLE_iii[HEAP32[184 + ((HEAP32[i7 + 132 >> 2] | 0) * 12 | 0) >> 2] & 3](i7, i10) | 0;
+ i17 = 183;
+ }
+ } while (0);
+ if ((i17 | 0) == 183) {
+ if ((i12 & -2 | 0) == 2) {
+ HEAP32[i11 >> 2] = 666;
+ }
+ if ((i12 & -3 | 0) != 0) {
+ if ((i12 | 0) != 1) {
+ break;
+ }
+ if ((i10 | 0) == 1) {
+ __tr_align(i7);
+ } else if (((i10 | 0) != 5 ? (__tr_stored_block(i7, 0, 0, 0), (i10 | 0) == 3) : 0) ? (i37 = HEAP32[i7 + 76 >> 2] | 0, i36 = HEAP32[i7 + 68 >> 2] | 0, HEAP16[i36 + (i37 + -1 << 1) >> 1] = 0, _memset(i36 | 0, 0, (i37 << 1) + -2 | 0) | 0, (HEAP32[i7 + 116 >> 2] | 0) == 0) : 0) {
+ HEAP32[i7 + 108 >> 2] = 0;
+ HEAP32[i7 + 92 >> 2] = 0;
+ }
+ i11 = HEAP32[i5 >> 2] | 0;
+ i12 = HEAP32[i11 + 20 >> 2] | 0;
+ i10 = HEAP32[i3 >> 2] | 0;
+ i12 = i12 >>> 0 > i10 >>> 0 ? i10 : i12;
+ if ((i12 | 0) != 0) {
+ _memcpy(HEAP32[i4 >> 2] | 0, HEAP32[i11 + 16 >> 2] | 0, i12 | 0) | 0;
+ HEAP32[i4 >> 2] = (HEAP32[i4 >> 2] | 0) + i12;
+ i10 = (HEAP32[i5 >> 2] | 0) + 16 | 0;
+ HEAP32[i10 >> 2] = (HEAP32[i10 >> 2] | 0) + i12;
+ i10 = i2 + 20 | 0;
+ HEAP32[i10 >> 2] = (HEAP32[i10 >> 2] | 0) + i12;
+ HEAP32[i3 >> 2] = (HEAP32[i3 >> 2] | 0) - i12;
+ i10 = HEAP32[i5 >> 2] | 0;
+ i36 = i10 + 20 | 0;
+ i37 = HEAP32[i36 >> 2] | 0;
+ HEAP32[i36 >> 2] = i37 - i12;
+ if ((i37 | 0) == (i12 | 0)) {
+ HEAP32[i10 + 16 >> 2] = HEAP32[i10 + 8 >> 2];
+ }
+ i10 = HEAP32[i3 >> 2] | 0;
+ }
+ if ((i10 | 0) != 0) {
+ break;
+ }
+ HEAP32[i8 >> 2] = -1;
+ i37 = 0;
+ STACKTOP = i1;
+ return i37 | 0;
+ }
+ }
+ if ((HEAP32[i3 >> 2] | 0) != 0) {
+ i37 = 0;
+ STACKTOP = i1;
+ return i37 | 0;
+ }
+ HEAP32[i8 >> 2] = -1;
+ i37 = 0;
+ STACKTOP = i1;
+ return i37 | 0;
+ }
+ } while (0);
+ if (!i9) {
+ i37 = 0;
+ STACKTOP = i1;
+ return i37 | 0;
+ }
+ i8 = i7 + 24 | 0;
+ i10 = HEAP32[i8 >> 2] | 0;
+ if ((i10 | 0) < 1) {
+ i37 = 1;
+ STACKTOP = i1;
+ return i37 | 0;
+ }
+ i11 = i2 + 48 | 0;
+ i9 = HEAP32[i11 >> 2] | 0;
+ if ((i10 | 0) == 2) {
+ i34 = HEAP32[i19 >> 2] | 0;
+ HEAP32[i19 >> 2] = i34 + 1;
+ i36 = i7 + 8 | 0;
+ HEAP8[(HEAP32[i36 >> 2] | 0) + i34 | 0] = i9;
+ i34 = (HEAP32[i11 >> 2] | 0) >>> 8 & 255;
+ i35 = HEAP32[i19 >> 2] | 0;
+ HEAP32[i19 >> 2] = i35 + 1;
+ HEAP8[(HEAP32[i36 >> 2] | 0) + i35 | 0] = i34;
+ i35 = (HEAP32[i11 >> 2] | 0) >>> 16 & 255;
+ i34 = HEAP32[i19 >> 2] | 0;
+ HEAP32[i19 >> 2] = i34 + 1;
+ HEAP8[(HEAP32[i36 >> 2] | 0) + i34 | 0] = i35;
+ i34 = (HEAP32[i11 >> 2] | 0) >>> 24 & 255;
+ i35 = HEAP32[i19 >> 2] | 0;
+ HEAP32[i19 >> 2] = i35 + 1;
+ HEAP8[(HEAP32[i36 >> 2] | 0) + i35 | 0] = i34;
+ i35 = i2 + 8 | 0;
+ i34 = HEAP32[i35 >> 2] & 255;
+ i37 = HEAP32[i19 >> 2] | 0;
+ HEAP32[i19 >> 2] = i37 + 1;
+ HEAP8[(HEAP32[i36 >> 2] | 0) + i37 | 0] = i34;
+ i37 = (HEAP32[i35 >> 2] | 0) >>> 8 & 255;
+ i34 = HEAP32[i19 >> 2] | 0;
+ HEAP32[i19 >> 2] = i34 + 1;
+ HEAP8[(HEAP32[i36 >> 2] | 0) + i34 | 0] = i37;
+ i34 = (HEAP32[i35 >> 2] | 0) >>> 16 & 255;
+ i37 = HEAP32[i19 >> 2] | 0;
+ HEAP32[i19 >> 2] = i37 + 1;
+ HEAP8[(HEAP32[i36 >> 2] | 0) + i37 | 0] = i34;
+ i35 = (HEAP32[i35 >> 2] | 0) >>> 24 & 255;
+ i37 = HEAP32[i19 >> 2] | 0;
+ HEAP32[i19 >> 2] = i37 + 1;
+ HEAP8[(HEAP32[i36 >> 2] | 0) + i37 | 0] = i35;
+ } else {
+ i35 = HEAP32[i19 >> 2] | 0;
+ HEAP32[i19 >> 2] = i35 + 1;
+ i36 = i7 + 8 | 0;
+ HEAP8[(HEAP32[i36 >> 2] | 0) + i35 | 0] = i9 >>> 24;
+ i35 = HEAP32[i19 >> 2] | 0;
+ HEAP32[i19 >> 2] = i35 + 1;
+ HEAP8[(HEAP32[i36 >> 2] | 0) + i35 | 0] = i9 >>> 16;
+ i35 = HEAP32[i11 >> 2] | 0;
+ i37 = HEAP32[i19 >> 2] | 0;
+ HEAP32[i19 >> 2] = i37 + 1;
+ HEAP8[(HEAP32[i36 >> 2] | 0) + i37 | 0] = i35 >>> 8;
+ i37 = HEAP32[i19 >> 2] | 0;
+ HEAP32[i19 >> 2] = i37 + 1;
+ HEAP8[(HEAP32[i36 >> 2] | 0) + i37 | 0] = i35;
+ }
+ i7 = HEAP32[i5 >> 2] | 0;
+ i10 = HEAP32[i7 + 20 >> 2] | 0;
+ i9 = HEAP32[i3 >> 2] | 0;
+ i9 = i10 >>> 0 > i9 >>> 0 ? i9 : i10;
+ if ((i9 | 0) != 0 ? (_memcpy(HEAP32[i4 >> 2] | 0, HEAP32[i7 + 16 >> 2] | 0, i9 | 0) | 0, HEAP32[i4 >> 2] = (HEAP32[i4 >> 2] | 0) + i9, i6 = (HEAP32[i5 >> 2] | 0) + 16 | 0, HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + i9, i6 = i2 + 20 | 0, HEAP32[i6 >> 2] = (HEAP32[i6 >> 2] | 0) + i9, HEAP32[i3 >> 2] = (HEAP32[i3 >> 2] | 0) - i9, i6 = HEAP32[i5 >> 2] | 0, i36 = i6 + 20 | 0, i37 = HEAP32[i36 >> 2] | 0, HEAP32[i36 >> 2] = i37 - i9, (i37 | 0) == (i9 | 0)) : 0) {
+ HEAP32[i6 + 16 >> 2] = HEAP32[i6 + 8 >> 2];
+ }
+ i2 = HEAP32[i8 >> 2] | 0;
+ if ((i2 | 0) > 0) {
+ HEAP32[i8 >> 2] = 0 - i2;
+ }
+ i37 = (HEAP32[i19 >> 2] | 0) == 0 | 0;
+ STACKTOP = i1;
+ return i37 | 0;
+ }
+ }
+ } while (0);
+ HEAP32[i2 + 24 >> 2] = HEAP32[3168 >> 2];
+ i37 = -2;
+ STACKTOP = i1;
+ return i37 | 0;
+}
+function _free(i7) {
+ i7 = i7 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0;
+ i1 = STACKTOP;
+ if ((i7 | 0) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i15 = i7 + -8 | 0;
+ i16 = HEAP32[14488 >> 2] | 0;
+ if (i15 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ i13 = HEAP32[i7 + -4 >> 2] | 0;
+ i12 = i13 & 3;
+ if ((i12 | 0) == 1) {
+ _abort();
+ }
+ i8 = i13 & -8;
+ i6 = i7 + (i8 + -8) | 0;
+ do {
+ if ((i13 & 1 | 0) == 0) {
+ i19 = HEAP32[i15 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i15 = -8 - i19 | 0;
+ i13 = i7 + i15 | 0;
+ i12 = i19 + i8 | 0;
+ if (i13 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ if ((i13 | 0) == (HEAP32[14492 >> 2] | 0)) {
+ i2 = i7 + (i8 + -4) | 0;
+ if ((HEAP32[i2 >> 2] & 3 | 0) != 3) {
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ HEAP32[14480 >> 2] = i12;
+ HEAP32[i2 >> 2] = HEAP32[i2 >> 2] & -2;
+ HEAP32[i7 + (i15 + 4) >> 2] = i12 | 1;
+ HEAP32[i6 >> 2] = i12;
+ STACKTOP = i1;
+ return;
+ }
+ i18 = i19 >>> 3;
+ if (i19 >>> 0 < 256) {
+ i2 = HEAP32[i7 + (i15 + 8) >> 2] | 0;
+ i11 = HEAP32[i7 + (i15 + 12) >> 2] | 0;
+ i14 = 14512 + (i18 << 1 << 2) | 0;
+ if ((i2 | 0) != (i14 | 0)) {
+ if (i2 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ if ((HEAP32[i2 + 12 >> 2] | 0) != (i13 | 0)) {
+ _abort();
+ }
+ }
+ if ((i11 | 0) == (i2 | 0)) {
+ HEAP32[3618] = HEAP32[3618] & ~(1 << i18);
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ if ((i11 | 0) != (i14 | 0)) {
+ if (i11 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ i14 = i11 + 8 | 0;
+ if ((HEAP32[i14 >> 2] | 0) == (i13 | 0)) {
+ i17 = i14;
+ } else {
+ _abort();
+ }
+ } else {
+ i17 = i11 + 8 | 0;
+ }
+ HEAP32[i2 + 12 >> 2] = i11;
+ HEAP32[i17 >> 2] = i2;
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ i17 = HEAP32[i7 + (i15 + 24) >> 2] | 0;
+ i18 = HEAP32[i7 + (i15 + 12) >> 2] | 0;
+ do {
+ if ((i18 | 0) == (i13 | 0)) {
+ i19 = i7 + (i15 + 20) | 0;
+ i18 = HEAP32[i19 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ i19 = i7 + (i15 + 16) | 0;
+ i18 = HEAP32[i19 >> 2] | 0;
+ if ((i18 | 0) == 0) {
+ i14 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i21 = i18 + 20 | 0;
+ i20 = HEAP32[i21 >> 2] | 0;
+ if ((i20 | 0) != 0) {
+ i18 = i20;
+ i19 = i21;
+ continue;
+ }
+ i20 = i18 + 16 | 0;
+ i21 = HEAP32[i20 >> 2] | 0;
+ if ((i21 | 0) == 0) {
+ break;
+ } else {
+ i18 = i21;
+ i19 = i20;
+ }
+ }
+ if (i19 >>> 0 < i16 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i19 >> 2] = 0;
+ i14 = i18;
+ break;
+ }
+ } else {
+ i19 = HEAP32[i7 + (i15 + 8) >> 2] | 0;
+ if (i19 >>> 0 < i16 >>> 0) {
+ _abort();
+ }
+ i16 = i19 + 12 | 0;
+ if ((HEAP32[i16 >> 2] | 0) != (i13 | 0)) {
+ _abort();
+ }
+ i20 = i18 + 8 | 0;
+ if ((HEAP32[i20 >> 2] | 0) == (i13 | 0)) {
+ HEAP32[i16 >> 2] = i18;
+ HEAP32[i20 >> 2] = i19;
+ i14 = i18;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ if ((i17 | 0) != 0) {
+ i18 = HEAP32[i7 + (i15 + 28) >> 2] | 0;
+ i16 = 14776 + (i18 << 2) | 0;
+ if ((i13 | 0) == (HEAP32[i16 >> 2] | 0)) {
+ HEAP32[i16 >> 2] = i14;
+ if ((i14 | 0) == 0) {
+ HEAP32[14476 >> 2] = HEAP32[14476 >> 2] & ~(1 << i18);
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ } else {
+ if (i17 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i16 = i17 + 16 | 0;
+ if ((HEAP32[i16 >> 2] | 0) == (i13 | 0)) {
+ HEAP32[i16 >> 2] = i14;
+ } else {
+ HEAP32[i17 + 20 >> 2] = i14;
+ }
+ if ((i14 | 0) == 0) {
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ }
+ if (i14 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i14 + 24 >> 2] = i17;
+ i16 = HEAP32[i7 + (i15 + 16) >> 2] | 0;
+ do {
+ if ((i16 | 0) != 0) {
+ if (i16 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i14 + 16 >> 2] = i16;
+ HEAP32[i16 + 24 >> 2] = i14;
+ break;
+ }
+ }
+ } while (0);
+ i15 = HEAP32[i7 + (i15 + 20) >> 2] | 0;
+ if ((i15 | 0) != 0) {
+ if (i15 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i14 + 20 >> 2] = i15;
+ HEAP32[i15 + 24 >> 2] = i14;
+ i2 = i13;
+ i11 = i12;
+ break;
+ }
+ } else {
+ i2 = i13;
+ i11 = i12;
+ }
+ } else {
+ i2 = i13;
+ i11 = i12;
+ }
+ } else {
+ i2 = i15;
+ i11 = i8;
+ }
+ } while (0);
+ if (!(i2 >>> 0 < i6 >>> 0)) {
+ _abort();
+ }
+ i12 = i7 + (i8 + -4) | 0;
+ i13 = HEAP32[i12 >> 2] | 0;
+ if ((i13 & 1 | 0) == 0) {
+ _abort();
+ }
+ if ((i13 & 2 | 0) == 0) {
+ if ((i6 | 0) == (HEAP32[14496 >> 2] | 0)) {
+ i21 = (HEAP32[14484 >> 2] | 0) + i11 | 0;
+ HEAP32[14484 >> 2] = i21;
+ HEAP32[14496 >> 2] = i2;
+ HEAP32[i2 + 4 >> 2] = i21 | 1;
+ if ((i2 | 0) != (HEAP32[14492 >> 2] | 0)) {
+ STACKTOP = i1;
+ return;
+ }
+ HEAP32[14492 >> 2] = 0;
+ HEAP32[14480 >> 2] = 0;
+ STACKTOP = i1;
+ return;
+ }
+ if ((i6 | 0) == (HEAP32[14492 >> 2] | 0)) {
+ i21 = (HEAP32[14480 >> 2] | 0) + i11 | 0;
+ HEAP32[14480 >> 2] = i21;
+ HEAP32[14492 >> 2] = i2;
+ HEAP32[i2 + 4 >> 2] = i21 | 1;
+ HEAP32[i2 + i21 >> 2] = i21;
+ STACKTOP = i1;
+ return;
+ }
+ i11 = (i13 & -8) + i11 | 0;
+ i12 = i13 >>> 3;
+ do {
+ if (!(i13 >>> 0 < 256)) {
+ i10 = HEAP32[i7 + (i8 + 16) >> 2] | 0;
+ i15 = HEAP32[i7 + (i8 | 4) >> 2] | 0;
+ do {
+ if ((i15 | 0) == (i6 | 0)) {
+ i13 = i7 + (i8 + 12) | 0;
+ i12 = HEAP32[i13 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ i13 = i7 + (i8 + 8) | 0;
+ i12 = HEAP32[i13 >> 2] | 0;
+ if ((i12 | 0) == 0) {
+ i9 = 0;
+ break;
+ }
+ }
+ while (1) {
+ i14 = i12 + 20 | 0;
+ i15 = HEAP32[i14 >> 2] | 0;
+ if ((i15 | 0) != 0) {
+ i12 = i15;
+ i13 = i14;
+ continue;
+ }
+ i14 = i12 + 16 | 0;
+ i15 = HEAP32[i14 >> 2] | 0;
+ if ((i15 | 0) == 0) {
+ break;
+ } else {
+ i12 = i15;
+ i13 = i14;
+ }
+ }
+ if (i13 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i13 >> 2] = 0;
+ i9 = i12;
+ break;
+ }
+ } else {
+ i13 = HEAP32[i7 + i8 >> 2] | 0;
+ if (i13 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i14 = i13 + 12 | 0;
+ if ((HEAP32[i14 >> 2] | 0) != (i6 | 0)) {
+ _abort();
+ }
+ i12 = i15 + 8 | 0;
+ if ((HEAP32[i12 >> 2] | 0) == (i6 | 0)) {
+ HEAP32[i14 >> 2] = i15;
+ HEAP32[i12 >> 2] = i13;
+ i9 = i15;
+ break;
+ } else {
+ _abort();
+ }
+ }
+ } while (0);
+ if ((i10 | 0) != 0) {
+ i12 = HEAP32[i7 + (i8 + 20) >> 2] | 0;
+ i13 = 14776 + (i12 << 2) | 0;
+ if ((i6 | 0) == (HEAP32[i13 >> 2] | 0)) {
+ HEAP32[i13 >> 2] = i9;
+ if ((i9 | 0) == 0) {
+ HEAP32[14476 >> 2] = HEAP32[14476 >> 2] & ~(1 << i12);
+ break;
+ }
+ } else {
+ if (i10 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i12 = i10 + 16 | 0;
+ if ((HEAP32[i12 >> 2] | 0) == (i6 | 0)) {
+ HEAP32[i12 >> 2] = i9;
+ } else {
+ HEAP32[i10 + 20 >> 2] = i9;
+ }
+ if ((i9 | 0) == 0) {
+ break;
+ }
+ }
+ if (i9 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ HEAP32[i9 + 24 >> 2] = i10;
+ i6 = HEAP32[i7 + (i8 + 8) >> 2] | 0;
+ do {
+ if ((i6 | 0) != 0) {
+ if (i6 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i9 + 16 >> 2] = i6;
+ HEAP32[i6 + 24 >> 2] = i9;
+ break;
+ }
+ }
+ } while (0);
+ i6 = HEAP32[i7 + (i8 + 12) >> 2] | 0;
+ if ((i6 | 0) != 0) {
+ if (i6 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i9 + 20 >> 2] = i6;
+ HEAP32[i6 + 24 >> 2] = i9;
+ break;
+ }
+ }
+ }
+ } else {
+ i9 = HEAP32[i7 + i8 >> 2] | 0;
+ i7 = HEAP32[i7 + (i8 | 4) >> 2] | 0;
+ i8 = 14512 + (i12 << 1 << 2) | 0;
+ if ((i9 | 0) != (i8 | 0)) {
+ if (i9 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ if ((HEAP32[i9 + 12 >> 2] | 0) != (i6 | 0)) {
+ _abort();
+ }
+ }
+ if ((i7 | 0) == (i9 | 0)) {
+ HEAP32[3618] = HEAP32[3618] & ~(1 << i12);
+ break;
+ }
+ if ((i7 | 0) != (i8 | 0)) {
+ if (i7 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ }
+ i8 = i7 + 8 | 0;
+ if ((HEAP32[i8 >> 2] | 0) == (i6 | 0)) {
+ i10 = i8;
+ } else {
+ _abort();
+ }
+ } else {
+ i10 = i7 + 8 | 0;
+ }
+ HEAP32[i9 + 12 >> 2] = i7;
+ HEAP32[i10 >> 2] = i9;
+ }
+ } while (0);
+ HEAP32[i2 + 4 >> 2] = i11 | 1;
+ HEAP32[i2 + i11 >> 2] = i11;
+ if ((i2 | 0) == (HEAP32[14492 >> 2] | 0)) {
+ HEAP32[14480 >> 2] = i11;
+ STACKTOP = i1;
+ return;
+ }
+ } else {
+ HEAP32[i12 >> 2] = i13 & -2;
+ HEAP32[i2 + 4 >> 2] = i11 | 1;
+ HEAP32[i2 + i11 >> 2] = i11;
+ }
+ i6 = i11 >>> 3;
+ if (i11 >>> 0 < 256) {
+ i7 = i6 << 1;
+ i3 = 14512 + (i7 << 2) | 0;
+ i8 = HEAP32[3618] | 0;
+ i6 = 1 << i6;
+ if ((i8 & i6 | 0) != 0) {
+ i6 = 14512 + (i7 + 2 << 2) | 0;
+ i7 = HEAP32[i6 >> 2] | 0;
+ if (i7 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ i4 = i6;
+ i5 = i7;
+ }
+ } else {
+ HEAP32[3618] = i8 | i6;
+ i4 = 14512 + (i7 + 2 << 2) | 0;
+ i5 = i3;
+ }
+ HEAP32[i4 >> 2] = i2;
+ HEAP32[i5 + 12 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i5;
+ HEAP32[i2 + 12 >> 2] = i3;
+ STACKTOP = i1;
+ return;
+ }
+ i4 = i11 >>> 8;
+ if ((i4 | 0) != 0) {
+ if (i11 >>> 0 > 16777215) {
+ i4 = 31;
+ } else {
+ i20 = (i4 + 1048320 | 0) >>> 16 & 8;
+ i21 = i4 << i20;
+ i19 = (i21 + 520192 | 0) >>> 16 & 4;
+ i21 = i21 << i19;
+ i4 = (i21 + 245760 | 0) >>> 16 & 2;
+ i4 = 14 - (i19 | i20 | i4) + (i21 << i4 >>> 15) | 0;
+ i4 = i11 >>> (i4 + 7 | 0) & 1 | i4 << 1;
+ }
+ } else {
+ i4 = 0;
+ }
+ i5 = 14776 + (i4 << 2) | 0;
+ HEAP32[i2 + 28 >> 2] = i4;
+ HEAP32[i2 + 20 >> 2] = 0;
+ HEAP32[i2 + 16 >> 2] = 0;
+ i7 = HEAP32[14476 >> 2] | 0;
+ i6 = 1 << i4;
+ L199 : do {
+ if ((i7 & i6 | 0) != 0) {
+ i5 = HEAP32[i5 >> 2] | 0;
+ if ((i4 | 0) == 31) {
+ i4 = 0;
+ } else {
+ i4 = 25 - (i4 >>> 1) | 0;
+ }
+ L204 : do {
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) != (i11 | 0)) {
+ i4 = i11 << i4;
+ i7 = i5;
+ while (1) {
+ i6 = i7 + (i4 >>> 31 << 2) + 16 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ }
+ if ((HEAP32[i5 + 4 >> 2] & -8 | 0) == (i11 | 0)) {
+ i3 = i5;
+ break L204;
+ } else {
+ i4 = i4 << 1;
+ i7 = i5;
+ }
+ }
+ if (i6 >>> 0 < (HEAP32[14488 >> 2] | 0) >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i6 >> 2] = i2;
+ HEAP32[i2 + 24 >> 2] = i7;
+ HEAP32[i2 + 12 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i2;
+ break L199;
+ }
+ } else {
+ i3 = i5;
+ }
+ } while (0);
+ i5 = i3 + 8 | 0;
+ i4 = HEAP32[i5 >> 2] | 0;
+ i6 = HEAP32[14488 >> 2] | 0;
+ if (i3 >>> 0 < i6 >>> 0) {
+ _abort();
+ }
+ if (i4 >>> 0 < i6 >>> 0) {
+ _abort();
+ } else {
+ HEAP32[i4 + 12 >> 2] = i2;
+ HEAP32[i5 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i4;
+ HEAP32[i2 + 12 >> 2] = i3;
+ HEAP32[i2 + 24 >> 2] = 0;
+ break;
+ }
+ } else {
+ HEAP32[14476 >> 2] = i7 | i6;
+ HEAP32[i5 >> 2] = i2;
+ HEAP32[i2 + 24 >> 2] = i5;
+ HEAP32[i2 + 12 >> 2] = i2;
+ HEAP32[i2 + 8 >> 2] = i2;
+ }
+ } while (0);
+ i21 = (HEAP32[14504 >> 2] | 0) + -1 | 0;
+ HEAP32[14504 >> 2] = i21;
+ if ((i21 | 0) == 0) {
+ i2 = 14928 | 0;
+ } else {
+ STACKTOP = i1;
+ return;
+ }
+ while (1) {
+ i2 = HEAP32[i2 >> 2] | 0;
+ if ((i2 | 0) == 0) {
+ break;
+ } else {
+ i2 = i2 + 8 | 0;
+ }
+ }
+ HEAP32[14504 >> 2] = -1;
+ STACKTOP = i1;
+ return;
+}
+function _build_tree(i4, i9) {
+ i4 = i4 | 0;
+ i9 = i9 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 32 | 0;
+ i1 = i2;
+ i3 = HEAP32[i9 >> 2] | 0;
+ i7 = i9 + 8 | 0;
+ i11 = HEAP32[i7 >> 2] | 0;
+ i12 = HEAP32[i11 >> 2] | 0;
+ i11 = HEAP32[i11 + 12 >> 2] | 0;
+ i8 = i4 + 5200 | 0;
+ HEAP32[i8 >> 2] = 0;
+ i6 = i4 + 5204 | 0;
+ HEAP32[i6 >> 2] = 573;
+ if ((i11 | 0) > 0) {
+ i5 = -1;
+ i13 = 0;
+ do {
+ if ((HEAP16[i3 + (i13 << 2) >> 1] | 0) == 0) {
+ HEAP16[i3 + (i13 << 2) + 2 >> 1] = 0;
+ } else {
+ i5 = (HEAP32[i8 >> 2] | 0) + 1 | 0;
+ HEAP32[i8 >> 2] = i5;
+ HEAP32[i4 + (i5 << 2) + 2908 >> 2] = i13;
+ HEAP8[i4 + i13 + 5208 | 0] = 0;
+ i5 = i13;
+ }
+ i13 = i13 + 1 | 0;
+ } while ((i13 | 0) != (i11 | 0));
+ i14 = HEAP32[i8 >> 2] | 0;
+ if ((i14 | 0) < 2) {
+ i10 = 3;
+ }
+ } else {
+ i14 = 0;
+ i5 = -1;
+ i10 = 3;
+ }
+ if ((i10 | 0) == 3) {
+ i10 = i4 + 5800 | 0;
+ i13 = i4 + 5804 | 0;
+ if ((i12 | 0) == 0) {
+ do {
+ i12 = (i5 | 0) < 2;
+ i13 = i5 + 1 | 0;
+ i5 = i12 ? i13 : i5;
+ i23 = i12 ? i13 : 0;
+ i14 = i14 + 1 | 0;
+ HEAP32[i8 >> 2] = i14;
+ HEAP32[i4 + (i14 << 2) + 2908 >> 2] = i23;
+ HEAP16[i3 + (i23 << 2) >> 1] = 1;
+ HEAP8[i4 + i23 + 5208 | 0] = 0;
+ HEAP32[i10 >> 2] = (HEAP32[i10 >> 2] | 0) + -1;
+ i14 = HEAP32[i8 >> 2] | 0;
+ } while ((i14 | 0) < 2);
+ } else {
+ do {
+ i15 = (i5 | 0) < 2;
+ i16 = i5 + 1 | 0;
+ i5 = i15 ? i16 : i5;
+ i23 = i15 ? i16 : 0;
+ i14 = i14 + 1 | 0;
+ HEAP32[i8 >> 2] = i14;
+ HEAP32[i4 + (i14 << 2) + 2908 >> 2] = i23;
+ HEAP16[i3 + (i23 << 2) >> 1] = 1;
+ HEAP8[i4 + i23 + 5208 | 0] = 0;
+ HEAP32[i10 >> 2] = (HEAP32[i10 >> 2] | 0) + -1;
+ HEAP32[i13 >> 2] = (HEAP32[i13 >> 2] | 0) - (HEAPU16[i12 + (i23 << 2) + 2 >> 1] | 0);
+ i14 = HEAP32[i8 >> 2] | 0;
+ } while ((i14 | 0) < 2);
+ }
+ }
+ i10 = i9 + 4 | 0;
+ HEAP32[i10 >> 2] = i5;
+ i12 = HEAP32[i8 >> 2] | 0;
+ if ((i12 | 0) > 1) {
+ i18 = i12;
+ i13 = (i12 | 0) / 2 | 0;
+ do {
+ i12 = HEAP32[i4 + (i13 << 2) + 2908 >> 2] | 0;
+ i14 = i4 + i12 + 5208 | 0;
+ i17 = i13 << 1;
+ L21 : do {
+ if ((i17 | 0) > (i18 | 0)) {
+ i15 = i13;
+ } else {
+ i16 = i3 + (i12 << 2) | 0;
+ i15 = i13;
+ while (1) {
+ do {
+ if ((i17 | 0) < (i18 | 0)) {
+ i18 = i17 | 1;
+ i19 = HEAP32[i4 + (i18 << 2) + 2908 >> 2] | 0;
+ i22 = HEAP16[i3 + (i19 << 2) >> 1] | 0;
+ i20 = HEAP32[i4 + (i17 << 2) + 2908 >> 2] | 0;
+ i21 = HEAP16[i3 + (i20 << 2) >> 1] | 0;
+ if (!((i22 & 65535) < (i21 & 65535))) {
+ if (!(i22 << 16 >> 16 == i21 << 16 >> 16)) {
+ break;
+ }
+ if ((HEAPU8[i4 + i19 + 5208 | 0] | 0) > (HEAPU8[i4 + i20 + 5208 | 0] | 0)) {
+ break;
+ }
+ }
+ i17 = i18;
+ }
+ } while (0);
+ i19 = HEAP16[i16 >> 1] | 0;
+ i18 = HEAP32[i4 + (i17 << 2) + 2908 >> 2] | 0;
+ i20 = HEAP16[i3 + (i18 << 2) >> 1] | 0;
+ if ((i19 & 65535) < (i20 & 65535)) {
+ break L21;
+ }
+ if (i19 << 16 >> 16 == i20 << 16 >> 16 ? (HEAPU8[i14] | 0) <= (HEAPU8[i4 + i18 + 5208 | 0] | 0) : 0) {
+ break L21;
+ }
+ HEAP32[i4 + (i15 << 2) + 2908 >> 2] = i18;
+ i19 = i17 << 1;
+ i18 = HEAP32[i8 >> 2] | 0;
+ if ((i19 | 0) > (i18 | 0)) {
+ i15 = i17;
+ break;
+ } else {
+ i15 = i17;
+ i17 = i19;
+ }
+ }
+ }
+ } while (0);
+ HEAP32[i4 + (i15 << 2) + 2908 >> 2] = i12;
+ i13 = i13 + -1 | 0;
+ i18 = HEAP32[i8 >> 2] | 0;
+ } while ((i13 | 0) > 0);
+ } else {
+ i18 = i12;
+ }
+ i12 = i4 + 2912 | 0;
+ while (1) {
+ i13 = HEAP32[i12 >> 2] | 0;
+ i20 = i18 + -1 | 0;
+ HEAP32[i8 >> 2] = i20;
+ i14 = HEAP32[i4 + (i18 << 2) + 2908 >> 2] | 0;
+ HEAP32[i12 >> 2] = i14;
+ i15 = i4 + i14 + 5208 | 0;
+ L40 : do {
+ if ((i18 | 0) < 3) {
+ i17 = 1;
+ } else {
+ i16 = i3 + (i14 << 2) | 0;
+ i17 = 1;
+ i18 = 2;
+ while (1) {
+ do {
+ if ((i18 | 0) < (i20 | 0)) {
+ i22 = i18 | 1;
+ i21 = HEAP32[i4 + (i22 << 2) + 2908 >> 2] | 0;
+ i23 = HEAP16[i3 + (i21 << 2) >> 1] | 0;
+ i20 = HEAP32[i4 + (i18 << 2) + 2908 >> 2] | 0;
+ i19 = HEAP16[i3 + (i20 << 2) >> 1] | 0;
+ if (!((i23 & 65535) < (i19 & 65535))) {
+ if (!(i23 << 16 >> 16 == i19 << 16 >> 16)) {
+ break;
+ }
+ if ((HEAPU8[i4 + i21 + 5208 | 0] | 0) > (HEAPU8[i4 + i20 + 5208 | 0] | 0)) {
+ break;
+ }
+ }
+ i18 = i22;
+ }
+ } while (0);
+ i21 = HEAP16[i16 >> 1] | 0;
+ i20 = HEAP32[i4 + (i18 << 2) + 2908 >> 2] | 0;
+ i19 = HEAP16[i3 + (i20 << 2) >> 1] | 0;
+ if ((i21 & 65535) < (i19 & 65535)) {
+ break L40;
+ }
+ if (i21 << 16 >> 16 == i19 << 16 >> 16 ? (HEAPU8[i15] | 0) <= (HEAPU8[i4 + i20 + 5208 | 0] | 0) : 0) {
+ break L40;
+ }
+ HEAP32[i4 + (i17 << 2) + 2908 >> 2] = i20;
+ i19 = i18 << 1;
+ i20 = HEAP32[i8 >> 2] | 0;
+ if ((i19 | 0) > (i20 | 0)) {
+ i17 = i18;
+ break;
+ } else {
+ i17 = i18;
+ i18 = i19;
+ }
+ }
+ }
+ } while (0);
+ HEAP32[i4 + (i17 << 2) + 2908 >> 2] = i14;
+ i17 = HEAP32[i12 >> 2] | 0;
+ i14 = (HEAP32[i6 >> 2] | 0) + -1 | 0;
+ HEAP32[i6 >> 2] = i14;
+ HEAP32[i4 + (i14 << 2) + 2908 >> 2] = i13;
+ i14 = (HEAP32[i6 >> 2] | 0) + -1 | 0;
+ HEAP32[i6 >> 2] = i14;
+ HEAP32[i4 + (i14 << 2) + 2908 >> 2] = i17;
+ i14 = i3 + (i11 << 2) | 0;
+ HEAP16[i14 >> 1] = (HEAPU16[i3 + (i17 << 2) >> 1] | 0) + (HEAPU16[i3 + (i13 << 2) >> 1] | 0);
+ i18 = HEAP8[i4 + i13 + 5208 | 0] | 0;
+ i16 = HEAP8[i4 + i17 + 5208 | 0] | 0;
+ i15 = i4 + i11 + 5208 | 0;
+ HEAP8[i15] = (((i18 & 255) < (i16 & 255) ? i16 : i18) & 255) + 1;
+ i19 = i11 & 65535;
+ HEAP16[i3 + (i17 << 2) + 2 >> 1] = i19;
+ HEAP16[i3 + (i13 << 2) + 2 >> 1] = i19;
+ i13 = i11 + 1 | 0;
+ HEAP32[i12 >> 2] = i11;
+ i19 = HEAP32[i8 >> 2] | 0;
+ L56 : do {
+ if ((i19 | 0) < 2) {
+ i16 = 1;
+ } else {
+ i16 = 1;
+ i17 = 2;
+ while (1) {
+ do {
+ if ((i17 | 0) < (i19 | 0)) {
+ i21 = i17 | 1;
+ i22 = HEAP32[i4 + (i21 << 2) + 2908 >> 2] | 0;
+ i19 = HEAP16[i3 + (i22 << 2) >> 1] | 0;
+ i18 = HEAP32[i4 + (i17 << 2) + 2908 >> 2] | 0;
+ i20 = HEAP16[i3 + (i18 << 2) >> 1] | 0;
+ if (!((i19 & 65535) < (i20 & 65535))) {
+ if (!(i19 << 16 >> 16 == i20 << 16 >> 16)) {
+ break;
+ }
+ if ((HEAPU8[i4 + i22 + 5208 | 0] | 0) > (HEAPU8[i4 + i18 + 5208 | 0] | 0)) {
+ break;
+ }
+ }
+ i17 = i21;
+ }
+ } while (0);
+ i19 = HEAP16[i14 >> 1] | 0;
+ i20 = HEAP32[i4 + (i17 << 2) + 2908 >> 2] | 0;
+ i18 = HEAP16[i3 + (i20 << 2) >> 1] | 0;
+ if ((i19 & 65535) < (i18 & 65535)) {
+ break L56;
+ }
+ if (i19 << 16 >> 16 == i18 << 16 >> 16 ? (HEAPU8[i15] | 0) <= (HEAPU8[i4 + i20 + 5208 | 0] | 0) : 0) {
+ break L56;
+ }
+ HEAP32[i4 + (i16 << 2) + 2908 >> 2] = i20;
+ i18 = i17 << 1;
+ i19 = HEAP32[i8 >> 2] | 0;
+ if ((i18 | 0) > (i19 | 0)) {
+ i16 = i17;
+ break;
+ } else {
+ i16 = i17;
+ i17 = i18;
+ }
+ }
+ }
+ } while (0);
+ HEAP32[i4 + (i16 << 2) + 2908 >> 2] = i11;
+ i18 = HEAP32[i8 >> 2] | 0;
+ if ((i18 | 0) > 1) {
+ i11 = i13;
+ } else {
+ break;
+ }
+ }
+ i12 = HEAP32[i12 >> 2] | 0;
+ i8 = (HEAP32[i6 >> 2] | 0) + -1 | 0;
+ HEAP32[i6 >> 2] = i8;
+ HEAP32[i4 + (i8 << 2) + 2908 >> 2] = i12;
+ i8 = HEAP32[i9 >> 2] | 0;
+ i9 = HEAP32[i10 >> 2] | 0;
+ i7 = HEAP32[i7 >> 2] | 0;
+ i12 = HEAP32[i7 >> 2] | 0;
+ i11 = HEAP32[i7 + 4 >> 2] | 0;
+ i10 = HEAP32[i7 + 8 >> 2] | 0;
+ i7 = HEAP32[i7 + 16 >> 2] | 0;
+ i13 = i4 + 2876 | 0;
+ i14 = i13 + 32 | 0;
+ do {
+ HEAP16[i13 >> 1] = 0;
+ i13 = i13 + 2 | 0;
+ } while ((i13 | 0) < (i14 | 0));
+ i14 = HEAP32[i6 >> 2] | 0;
+ HEAP16[i8 + (HEAP32[i4 + (i14 << 2) + 2908 >> 2] << 2) + 2 >> 1] = 0;
+ i14 = i14 + 1 | 0;
+ L72 : do {
+ if ((i14 | 0) < 573) {
+ i6 = i4 + 5800 | 0;
+ i13 = i4 + 5804 | 0;
+ if ((i12 | 0) == 0) {
+ i18 = 0;
+ do {
+ i12 = HEAP32[i4 + (i14 << 2) + 2908 >> 2] | 0;
+ i13 = i8 + (i12 << 2) + 2 | 0;
+ i15 = HEAPU16[i8 + (HEAPU16[i13 >> 1] << 2) + 2 >> 1] | 0;
+ i16 = (i15 | 0) < (i7 | 0);
+ i15 = i16 ? i15 + 1 | 0 : i7;
+ i18 = (i16 & 1 ^ 1) + i18 | 0;
+ HEAP16[i13 >> 1] = i15;
+ if ((i12 | 0) <= (i9 | 0)) {
+ i23 = i4 + (i15 << 1) + 2876 | 0;
+ HEAP16[i23 >> 1] = (HEAP16[i23 >> 1] | 0) + 1 << 16 >> 16;
+ if ((i12 | 0) < (i10 | 0)) {
+ i13 = 0;
+ } else {
+ i13 = HEAP32[i11 + (i12 - i10 << 2) >> 2] | 0;
+ }
+ i23 = Math_imul(HEAPU16[i8 + (i12 << 2) >> 1] | 0, i13 + i15 | 0) | 0;
+ HEAP32[i6 >> 2] = i23 + (HEAP32[i6 >> 2] | 0);
+ }
+ i14 = i14 + 1 | 0;
+ } while ((i14 | 0) != 573);
+ } else {
+ i18 = 0;
+ do {
+ i15 = HEAP32[i4 + (i14 << 2) + 2908 >> 2] | 0;
+ i16 = i8 + (i15 << 2) + 2 | 0;
+ i17 = HEAPU16[i8 + (HEAPU16[i16 >> 1] << 2) + 2 >> 1] | 0;
+ i19 = (i17 | 0) < (i7 | 0);
+ i17 = i19 ? i17 + 1 | 0 : i7;
+ i18 = (i19 & 1 ^ 1) + i18 | 0;
+ HEAP16[i16 >> 1] = i17;
+ if ((i15 | 0) <= (i9 | 0)) {
+ i23 = i4 + (i17 << 1) + 2876 | 0;
+ HEAP16[i23 >> 1] = (HEAP16[i23 >> 1] | 0) + 1 << 16 >> 16;
+ if ((i15 | 0) < (i10 | 0)) {
+ i16 = 0;
+ } else {
+ i16 = HEAP32[i11 + (i15 - i10 << 2) >> 2] | 0;
+ }
+ i23 = HEAPU16[i8 + (i15 << 2) >> 1] | 0;
+ i22 = Math_imul(i23, i16 + i17 | 0) | 0;
+ HEAP32[i6 >> 2] = i22 + (HEAP32[i6 >> 2] | 0);
+ i23 = Math_imul((HEAPU16[i12 + (i15 << 2) + 2 >> 1] | 0) + i16 | 0, i23) | 0;
+ HEAP32[i13 >> 2] = i23 + (HEAP32[i13 >> 2] | 0);
+ }
+ i14 = i14 + 1 | 0;
+ } while ((i14 | 0) != 573);
+ }
+ if ((i18 | 0) != 0) {
+ i10 = i4 + (i7 << 1) + 2876 | 0;
+ do {
+ i12 = i7;
+ while (1) {
+ i11 = i12 + -1 | 0;
+ i13 = i4 + (i11 << 1) + 2876 | 0;
+ i14 = HEAP16[i13 >> 1] | 0;
+ if (i14 << 16 >> 16 == 0) {
+ i12 = i11;
+ } else {
+ break;
+ }
+ }
+ HEAP16[i13 >> 1] = i14 + -1 << 16 >> 16;
+ i11 = i4 + (i12 << 1) + 2876 | 0;
+ HEAP16[i11 >> 1] = (HEAPU16[i11 >> 1] | 0) + 2;
+ i11 = (HEAP16[i10 >> 1] | 0) + -1 << 16 >> 16;
+ HEAP16[i10 >> 1] = i11;
+ i18 = i18 + -2 | 0;
+ } while ((i18 | 0) > 0);
+ if ((i7 | 0) != 0) {
+ i12 = 573;
+ while (1) {
+ i10 = i7 & 65535;
+ if (!(i11 << 16 >> 16 == 0)) {
+ i11 = i11 & 65535;
+ do {
+ do {
+ i12 = i12 + -1 | 0;
+ i15 = HEAP32[i4 + (i12 << 2) + 2908 >> 2] | 0;
+ } while ((i15 | 0) > (i9 | 0));
+ i13 = i8 + (i15 << 2) + 2 | 0;
+ i14 = HEAPU16[i13 >> 1] | 0;
+ if ((i14 | 0) != (i7 | 0)) {
+ i23 = Math_imul(HEAPU16[i8 + (i15 << 2) >> 1] | 0, i7 - i14 | 0) | 0;
+ HEAP32[i6 >> 2] = i23 + (HEAP32[i6 >> 2] | 0);
+ HEAP16[i13 >> 1] = i10;
+ }
+ i11 = i11 + -1 | 0;
+ } while ((i11 | 0) != 0);
+ }
+ i7 = i7 + -1 | 0;
+ if ((i7 | 0) == 0) {
+ break L72;
+ }
+ i11 = HEAP16[i4 + (i7 << 1) + 2876 >> 1] | 0;
+ }
+ }
+ }
+ }
+ } while (0);
+ i7 = 1;
+ i6 = 0;
+ do {
+ i6 = (HEAPU16[i4 + (i7 + -1 << 1) + 2876 >> 1] | 0) + (i6 & 65534) << 1;
+ HEAP16[i1 + (i7 << 1) >> 1] = i6;
+ i7 = i7 + 1 | 0;
+ } while ((i7 | 0) != 16);
+ if ((i5 | 0) < 0) {
+ STACKTOP = i2;
+ return;
+ } else {
+ i4 = 0;
+ }
+ while (1) {
+ i23 = HEAP16[i3 + (i4 << 2) + 2 >> 1] | 0;
+ i7 = i23 & 65535;
+ if (!(i23 << 16 >> 16 == 0)) {
+ i8 = i1 + (i7 << 1) | 0;
+ i6 = HEAP16[i8 >> 1] | 0;
+ HEAP16[i8 >> 1] = i6 + 1 << 16 >> 16;
+ i6 = i6 & 65535;
+ i8 = 0;
+ while (1) {
+ i8 = i8 | i6 & 1;
+ i7 = i7 + -1 | 0;
+ if ((i7 | 0) <= 0) {
+ break;
+ } else {
+ i6 = i6 >>> 1;
+ i8 = i8 << 1;
+ }
+ }
+ HEAP16[i3 + (i4 << 2) >> 1] = i8;
+ }
+ if ((i4 | 0) == (i5 | 0)) {
+ break;
+ } else {
+ i4 = i4 + 1 | 0;
+ }
+ }
+ STACKTOP = i2;
+ return;
+}
+function _deflate_slow(i2, i6) {
+ i2 = i2 | 0;
+ i6 = i6 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0, i30 = 0, i31 = 0, i32 = 0, i33 = 0, i34 = 0, i35 = 0, i36 = 0;
+ i1 = STACKTOP;
+ i15 = i2 + 116 | 0;
+ i16 = (i6 | 0) == 0;
+ i17 = i2 + 72 | 0;
+ i18 = i2 + 88 | 0;
+ i5 = i2 + 108 | 0;
+ i7 = i2 + 56 | 0;
+ i19 = i2 + 84 | 0;
+ i20 = i2 + 68 | 0;
+ i22 = i2 + 52 | 0;
+ i21 = i2 + 64 | 0;
+ i9 = i2 + 96 | 0;
+ i10 = i2 + 120 | 0;
+ i11 = i2 + 112 | 0;
+ i12 = i2 + 100 | 0;
+ i26 = i2 + 5792 | 0;
+ i27 = i2 + 5796 | 0;
+ i29 = i2 + 5784 | 0;
+ i23 = i2 + 5788 | 0;
+ i8 = i2 + 104 | 0;
+ i4 = i2 + 92 | 0;
+ i24 = i2 + 128 | 0;
+ i14 = i2 + 44 | 0;
+ i13 = i2 + 136 | 0;
+ L1 : while (1) {
+ i30 = HEAP32[i15 >> 2] | 0;
+ while (1) {
+ if (i30 >>> 0 < 262) {
+ _fill_window(i2);
+ i30 = HEAP32[i15 >> 2] | 0;
+ if (i30 >>> 0 < 262 & i16) {
+ i2 = 0;
+ i30 = 50;
+ break L1;
+ }
+ if ((i30 | 0) == 0) {
+ i30 = 40;
+ break L1;
+ }
+ if (!(i30 >>> 0 > 2)) {
+ HEAP32[i10 >> 2] = HEAP32[i9 >> 2];
+ HEAP32[i12 >> 2] = HEAP32[i11 >> 2];
+ HEAP32[i9 >> 2] = 2;
+ i32 = 2;
+ i30 = 16;
+ } else {
+ i30 = 8;
+ }
+ } else {
+ i30 = 8;
+ }
+ do {
+ if ((i30 | 0) == 8) {
+ i30 = 0;
+ i34 = HEAP32[i5 >> 2] | 0;
+ i31 = ((HEAPU8[(HEAP32[i7 >> 2] | 0) + (i34 + 2) | 0] | 0) ^ HEAP32[i17 >> 2] << HEAP32[i18 >> 2]) & HEAP32[i19 >> 2];
+ HEAP32[i17 >> 2] = i31;
+ i31 = (HEAP32[i20 >> 2] | 0) + (i31 << 1) | 0;
+ i35 = HEAP16[i31 >> 1] | 0;
+ HEAP16[(HEAP32[i21 >> 2] | 0) + ((HEAP32[i22 >> 2] & i34) << 1) >> 1] = i35;
+ i32 = i35 & 65535;
+ HEAP16[i31 >> 1] = i34;
+ i31 = HEAP32[i9 >> 2] | 0;
+ HEAP32[i10 >> 2] = i31;
+ HEAP32[i12 >> 2] = HEAP32[i11 >> 2];
+ HEAP32[i9 >> 2] = 2;
+ if (!(i35 << 16 >> 16 == 0)) {
+ if (i31 >>> 0 < (HEAP32[i24 >> 2] | 0) >>> 0) {
+ if (!(((HEAP32[i5 >> 2] | 0) - i32 | 0) >>> 0 > ((HEAP32[i14 >> 2] | 0) + -262 | 0) >>> 0)) {
+ i32 = _longest_match(i2, i32) | 0;
+ HEAP32[i9 >> 2] = i32;
+ if (i32 >>> 0 < 6) {
+ if ((HEAP32[i13 >> 2] | 0) != 1) {
+ if ((i32 | 0) != 3) {
+ i30 = 16;
+ break;
+ }
+ if (!(((HEAP32[i5 >> 2] | 0) - (HEAP32[i11 >> 2] | 0) | 0) >>> 0 > 4096)) {
+ i32 = 3;
+ i30 = 16;
+ break;
+ }
+ }
+ HEAP32[i9 >> 2] = 2;
+ i32 = 2;
+ i30 = 16;
+ } else {
+ i30 = 16;
+ }
+ } else {
+ i32 = 2;
+ i30 = 16;
+ }
+ } else {
+ i32 = 2;
+ }
+ } else {
+ i32 = 2;
+ i30 = 16;
+ }
+ }
+ } while (0);
+ if ((i30 | 0) == 16) {
+ i31 = HEAP32[i10 >> 2] | 0;
+ }
+ if (!(i31 >>> 0 < 3 | i32 >>> 0 > i31 >>> 0)) {
+ break;
+ }
+ if ((HEAP32[i8 >> 2] | 0) == 0) {
+ HEAP32[i8 >> 2] = 1;
+ HEAP32[i5 >> 2] = (HEAP32[i5 >> 2] | 0) + 1;
+ i30 = (HEAP32[i15 >> 2] | 0) + -1 | 0;
+ HEAP32[i15 >> 2] = i30;
+ continue;
+ }
+ i35 = HEAP8[(HEAP32[i7 >> 2] | 0) + ((HEAP32[i5 >> 2] | 0) + -1) | 0] | 0;
+ i34 = HEAP32[i26 >> 2] | 0;
+ HEAP16[(HEAP32[i27 >> 2] | 0) + (i34 << 1) >> 1] = 0;
+ HEAP32[i26 >> 2] = i34 + 1;
+ HEAP8[(HEAP32[i29 >> 2] | 0) + i34 | 0] = i35;
+ i35 = i2 + ((i35 & 255) << 2) + 148 | 0;
+ HEAP16[i35 >> 1] = (HEAP16[i35 >> 1] | 0) + 1 << 16 >> 16;
+ if ((HEAP32[i26 >> 2] | 0) == ((HEAP32[i23 >> 2] | 0) + -1 | 0)) {
+ i30 = HEAP32[i4 >> 2] | 0;
+ if ((i30 | 0) > -1) {
+ i31 = (HEAP32[i7 >> 2] | 0) + i30 | 0;
+ } else {
+ i31 = 0;
+ }
+ __tr_flush_block(i2, i31, (HEAP32[i5 >> 2] | 0) - i30 | 0, 0);
+ HEAP32[i4 >> 2] = HEAP32[i5 >> 2];
+ i33 = HEAP32[i2 >> 2] | 0;
+ i32 = i33 + 28 | 0;
+ i30 = HEAP32[i32 >> 2] | 0;
+ i35 = HEAP32[i30 + 20 >> 2] | 0;
+ i31 = i33 + 16 | 0;
+ i34 = HEAP32[i31 >> 2] | 0;
+ i34 = i35 >>> 0 > i34 >>> 0 ? i34 : i35;
+ if ((i34 | 0) != 0 ? (i28 = i33 + 12 | 0, _memcpy(HEAP32[i28 >> 2] | 0, HEAP32[i30 + 16 >> 2] | 0, i34 | 0) | 0, HEAP32[i28 >> 2] = (HEAP32[i28 >> 2] | 0) + i34, i28 = (HEAP32[i32 >> 2] | 0) + 16 | 0, HEAP32[i28 >> 2] = (HEAP32[i28 >> 2] | 0) + i34, i28 = i33 + 20 | 0, HEAP32[i28 >> 2] = (HEAP32[i28 >> 2] | 0) + i34, HEAP32[i31 >> 2] = (HEAP32[i31 >> 2] | 0) - i34, i28 = HEAP32[i32 >> 2] | 0, i33 = i28 + 20 | 0, i35 = HEAP32[i33 >> 2] | 0, HEAP32[i33 >> 2] = i35 - i34, (i35 | 0) == (i34 | 0)) : 0) {
+ HEAP32[i28 + 16 >> 2] = HEAP32[i28 + 8 >> 2];
+ }
+ }
+ HEAP32[i5 >> 2] = (HEAP32[i5 >> 2] | 0) + 1;
+ i30 = (HEAP32[i15 >> 2] | 0) + -1 | 0;
+ HEAP32[i15 >> 2] = i30;
+ if ((HEAP32[(HEAP32[i2 >> 2] | 0) + 16 >> 2] | 0) == 0) {
+ i2 = 0;
+ i30 = 50;
+ break L1;
+ }
+ }
+ i34 = HEAP32[i5 >> 2] | 0;
+ i30 = i34 + -3 + (HEAP32[i15 >> 2] | 0) | 0;
+ i35 = i31 + 253 | 0;
+ i31 = i34 + 65535 - (HEAP32[i12 >> 2] | 0) | 0;
+ i34 = HEAP32[i26 >> 2] | 0;
+ HEAP16[(HEAP32[i27 >> 2] | 0) + (i34 << 1) >> 1] = i31;
+ HEAP32[i26 >> 2] = i34 + 1;
+ HEAP8[(HEAP32[i29 >> 2] | 0) + i34 | 0] = i35;
+ i35 = i2 + ((HEAPU8[808 + (i35 & 255) | 0] | 0 | 256) + 1 << 2) + 148 | 0;
+ HEAP16[i35 >> 1] = (HEAP16[i35 >> 1] | 0) + 1 << 16 >> 16;
+ i31 = i31 + 65535 & 65535;
+ if (!(i31 >>> 0 < 256)) {
+ i31 = (i31 >>> 7) + 256 | 0;
+ }
+ i32 = i2 + ((HEAPU8[296 + i31 | 0] | 0) << 2) + 2440 | 0;
+ HEAP16[i32 >> 1] = (HEAP16[i32 >> 1] | 0) + 1 << 16 >> 16;
+ i32 = HEAP32[i26 >> 2] | 0;
+ i31 = (HEAP32[i23 >> 2] | 0) + -1 | 0;
+ i34 = HEAP32[i10 >> 2] | 0;
+ HEAP32[i15 >> 2] = 1 - i34 + (HEAP32[i15 >> 2] | 0);
+ i34 = i34 + -2 | 0;
+ HEAP32[i10 >> 2] = i34;
+ i33 = HEAP32[i5 >> 2] | 0;
+ while (1) {
+ i35 = i33 + 1 | 0;
+ HEAP32[i5 >> 2] = i35;
+ if (!(i35 >>> 0 > i30 >>> 0)) {
+ i36 = ((HEAPU8[(HEAP32[i7 >> 2] | 0) + (i33 + 3) | 0] | 0) ^ HEAP32[i17 >> 2] << HEAP32[i18 >> 2]) & HEAP32[i19 >> 2];
+ HEAP32[i17 >> 2] = i36;
+ i36 = (HEAP32[i20 >> 2] | 0) + (i36 << 1) | 0;
+ HEAP16[(HEAP32[i21 >> 2] | 0) + ((HEAP32[i22 >> 2] & i35) << 1) >> 1] = HEAP16[i36 >> 1] | 0;
+ HEAP16[i36 >> 1] = i35;
+ }
+ i34 = i34 + -1 | 0;
+ HEAP32[i10 >> 2] = i34;
+ if ((i34 | 0) == 0) {
+ break;
+ } else {
+ i33 = i35;
+ }
+ }
+ HEAP32[i8 >> 2] = 0;
+ HEAP32[i9 >> 2] = 2;
+ i30 = i33 + 2 | 0;
+ HEAP32[i5 >> 2] = i30;
+ if ((i32 | 0) != (i31 | 0)) {
+ continue;
+ }
+ i32 = HEAP32[i4 >> 2] | 0;
+ if ((i32 | 0) > -1) {
+ i31 = (HEAP32[i7 >> 2] | 0) + i32 | 0;
+ } else {
+ i31 = 0;
+ }
+ __tr_flush_block(i2, i31, i30 - i32 | 0, 0);
+ HEAP32[i4 >> 2] = HEAP32[i5 >> 2];
+ i33 = HEAP32[i2 >> 2] | 0;
+ i31 = i33 + 28 | 0;
+ i32 = HEAP32[i31 >> 2] | 0;
+ i35 = HEAP32[i32 + 20 >> 2] | 0;
+ i30 = i33 + 16 | 0;
+ i34 = HEAP32[i30 >> 2] | 0;
+ i34 = i35 >>> 0 > i34 >>> 0 ? i34 : i35;
+ if ((i34 | 0) != 0 ? (i25 = i33 + 12 | 0, _memcpy(HEAP32[i25 >> 2] | 0, HEAP32[i32 + 16 >> 2] | 0, i34 | 0) | 0, HEAP32[i25 >> 2] = (HEAP32[i25 >> 2] | 0) + i34, i25 = (HEAP32[i31 >> 2] | 0) + 16 | 0, HEAP32[i25 >> 2] = (HEAP32[i25 >> 2] | 0) + i34, i25 = i33 + 20 | 0, HEAP32[i25 >> 2] = (HEAP32[i25 >> 2] | 0) + i34, HEAP32[i30 >> 2] = (HEAP32[i30 >> 2] | 0) - i34, i25 = HEAP32[i31 >> 2] | 0, i35 = i25 + 20 | 0, i36 = HEAP32[i35 >> 2] | 0, HEAP32[i35 >> 2] = i36 - i34, (i36 | 0) == (i34 | 0)) : 0) {
+ HEAP32[i25 + 16 >> 2] = HEAP32[i25 + 8 >> 2];
+ }
+ if ((HEAP32[(HEAP32[i2 >> 2] | 0) + 16 >> 2] | 0) == 0) {
+ i2 = 0;
+ i30 = 50;
+ break;
+ }
+ }
+ if ((i30 | 0) == 40) {
+ if ((HEAP32[i8 >> 2] | 0) != 0) {
+ i36 = HEAP8[(HEAP32[i7 >> 2] | 0) + ((HEAP32[i5 >> 2] | 0) + -1) | 0] | 0;
+ i35 = HEAP32[i26 >> 2] | 0;
+ HEAP16[(HEAP32[i27 >> 2] | 0) + (i35 << 1) >> 1] = 0;
+ HEAP32[i26 >> 2] = i35 + 1;
+ HEAP8[(HEAP32[i29 >> 2] | 0) + i35 | 0] = i36;
+ i36 = i2 + ((i36 & 255) << 2) + 148 | 0;
+ HEAP16[i36 >> 1] = (HEAP16[i36 >> 1] | 0) + 1 << 16 >> 16;
+ HEAP32[i8 >> 2] = 0;
+ }
+ i8 = HEAP32[i4 >> 2] | 0;
+ if ((i8 | 0) > -1) {
+ i7 = (HEAP32[i7 >> 2] | 0) + i8 | 0;
+ } else {
+ i7 = 0;
+ }
+ i6 = (i6 | 0) == 4;
+ __tr_flush_block(i2, i7, (HEAP32[i5 >> 2] | 0) - i8 | 0, i6 & 1);
+ HEAP32[i4 >> 2] = HEAP32[i5 >> 2];
+ i4 = HEAP32[i2 >> 2] | 0;
+ i7 = i4 + 28 | 0;
+ i5 = HEAP32[i7 >> 2] | 0;
+ i10 = HEAP32[i5 + 20 >> 2] | 0;
+ i8 = i4 + 16 | 0;
+ i9 = HEAP32[i8 >> 2] | 0;
+ i9 = i10 >>> 0 > i9 >>> 0 ? i9 : i10;
+ if ((i9 | 0) != 0 ? (i3 = i4 + 12 | 0, _memcpy(HEAP32[i3 >> 2] | 0, HEAP32[i5 + 16 >> 2] | 0, i9 | 0) | 0, HEAP32[i3 >> 2] = (HEAP32[i3 >> 2] | 0) + i9, i3 = (HEAP32[i7 >> 2] | 0) + 16 | 0, HEAP32[i3 >> 2] = (HEAP32[i3 >> 2] | 0) + i9, i3 = i4 + 20 | 0, HEAP32[i3 >> 2] = (HEAP32[i3 >> 2] | 0) + i9, HEAP32[i8 >> 2] = (HEAP32[i8 >> 2] | 0) - i9, i3 = HEAP32[i7 >> 2] | 0, i35 = i3 + 20 | 0, i36 = HEAP32[i35 >> 2] | 0, HEAP32[i35 >> 2] = i36 - i9, (i36 | 0) == (i9 | 0)) : 0) {
+ HEAP32[i3 + 16 >> 2] = HEAP32[i3 + 8 >> 2];
+ }
+ if ((HEAP32[(HEAP32[i2 >> 2] | 0) + 16 >> 2] | 0) == 0) {
+ i36 = i6 ? 2 : 0;
+ STACKTOP = i1;
+ return i36 | 0;
+ } else {
+ i36 = i6 ? 3 : 1;
+ STACKTOP = i1;
+ return i36 | 0;
+ }
+ } else if ((i30 | 0) == 50) {
+ STACKTOP = i1;
+ return i2 | 0;
+ }
+ return 0;
+}
+function _inflate_fast(i7, i19) {
+ i7 = i7 | 0;
+ i19 = i19 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0, i30 = 0, i31 = 0, i32 = 0, i33 = 0, i34 = 0, i35 = 0, i36 = 0, i37 = 0;
+ i1 = STACKTOP;
+ i11 = HEAP32[i7 + 28 >> 2] | 0;
+ i29 = HEAP32[i7 >> 2] | 0;
+ i5 = i7 + 4 | 0;
+ i8 = i29 + ((HEAP32[i5 >> 2] | 0) + -6) | 0;
+ i9 = i7 + 12 | 0;
+ i28 = HEAP32[i9 >> 2] | 0;
+ i4 = i7 + 16 | 0;
+ i25 = HEAP32[i4 >> 2] | 0;
+ i6 = i28 + (i25 + -258) | 0;
+ i17 = HEAP32[i11 + 44 >> 2] | 0;
+ i12 = HEAP32[i11 + 48 >> 2] | 0;
+ i18 = HEAP32[i11 + 52 >> 2] | 0;
+ i3 = i11 + 56 | 0;
+ i2 = i11 + 60 | 0;
+ i16 = HEAP32[i11 + 76 >> 2] | 0;
+ i13 = HEAP32[i11 + 80 >> 2] | 0;
+ i14 = (1 << HEAP32[i11 + 84 >> 2]) + -1 | 0;
+ i15 = (1 << HEAP32[i11 + 88 >> 2]) + -1 | 0;
+ i19 = i28 + (i25 + ~i19) | 0;
+ i25 = i11 + 7104 | 0;
+ i20 = i18 + -1 | 0;
+ i27 = (i12 | 0) == 0;
+ i24 = (HEAP32[i11 + 40 >> 2] | 0) + -1 | 0;
+ i21 = i24 + i12 | 0;
+ i22 = i12 + -1 | 0;
+ i23 = i19 + -1 | 0;
+ i26 = i19 - i12 | 0;
+ i31 = HEAP32[i2 >> 2] | 0;
+ i30 = HEAP32[i3 >> 2] | 0;
+ i29 = i29 + -1 | 0;
+ i28 = i28 + -1 | 0;
+ L1 : do {
+ if (i31 >>> 0 < 15) {
+ i37 = i29 + 2 | 0;
+ i33 = i31 + 16 | 0;
+ i30 = ((HEAPU8[i29 + 1 | 0] | 0) << i31) + i30 + ((HEAPU8[i37] | 0) << i31 + 8) | 0;
+ i29 = i37;
+ } else {
+ i33 = i31;
+ }
+ i31 = i30 & i14;
+ i34 = HEAP8[i16 + (i31 << 2) | 0] | 0;
+ i32 = HEAP16[i16 + (i31 << 2) + 2 >> 1] | 0;
+ i31 = HEAPU8[i16 + (i31 << 2) + 1 | 0] | 0;
+ i30 = i30 >>> i31;
+ i31 = i33 - i31 | 0;
+ do {
+ if (!(i34 << 24 >> 24 == 0)) {
+ i33 = i34 & 255;
+ while (1) {
+ if ((i33 & 16 | 0) != 0) {
+ break;
+ }
+ if ((i33 & 64 | 0) != 0) {
+ i10 = 55;
+ break L1;
+ }
+ i37 = (i30 & (1 << i33) + -1) + (i32 & 65535) | 0;
+ i33 = HEAP8[i16 + (i37 << 2) | 0] | 0;
+ i32 = HEAP16[i16 + (i37 << 2) + 2 >> 1] | 0;
+ i37 = HEAPU8[i16 + (i37 << 2) + 1 | 0] | 0;
+ i30 = i30 >>> i37;
+ i31 = i31 - i37 | 0;
+ if (i33 << 24 >> 24 == 0) {
+ i10 = 6;
+ break;
+ } else {
+ i33 = i33 & 255;
+ }
+ }
+ if ((i10 | 0) == 6) {
+ i32 = i32 & 255;
+ i10 = 7;
+ break;
+ }
+ i32 = i32 & 65535;
+ i33 = i33 & 15;
+ if ((i33 | 0) != 0) {
+ if (i31 >>> 0 < i33 >>> 0) {
+ i29 = i29 + 1 | 0;
+ i35 = i31 + 8 | 0;
+ i34 = ((HEAPU8[i29] | 0) << i31) + i30 | 0;
+ } else {
+ i35 = i31;
+ i34 = i30;
+ }
+ i31 = i35 - i33 | 0;
+ i30 = i34 >>> i33;
+ i32 = (i34 & (1 << i33) + -1) + i32 | 0;
+ }
+ if (i31 >>> 0 < 15) {
+ i37 = i29 + 2 | 0;
+ i34 = i31 + 16 | 0;
+ i30 = ((HEAPU8[i29 + 1 | 0] | 0) << i31) + i30 + ((HEAPU8[i37] | 0) << i31 + 8) | 0;
+ i29 = i37;
+ } else {
+ i34 = i31;
+ }
+ i37 = i30 & i15;
+ i33 = HEAP16[i13 + (i37 << 2) + 2 >> 1] | 0;
+ i31 = HEAPU8[i13 + (i37 << 2) + 1 | 0] | 0;
+ i30 = i30 >>> i31;
+ i31 = i34 - i31 | 0;
+ i34 = HEAPU8[i13 + (i37 << 2) | 0] | 0;
+ if ((i34 & 16 | 0) == 0) {
+ do {
+ if ((i34 & 64 | 0) != 0) {
+ i10 = 52;
+ break L1;
+ }
+ i34 = (i30 & (1 << i34) + -1) + (i33 & 65535) | 0;
+ i33 = HEAP16[i13 + (i34 << 2) + 2 >> 1] | 0;
+ i37 = HEAPU8[i13 + (i34 << 2) + 1 | 0] | 0;
+ i30 = i30 >>> i37;
+ i31 = i31 - i37 | 0;
+ i34 = HEAPU8[i13 + (i34 << 2) | 0] | 0;
+ } while ((i34 & 16 | 0) == 0);
+ }
+ i33 = i33 & 65535;
+ i34 = i34 & 15;
+ if (i31 >>> 0 < i34 >>> 0) {
+ i35 = i29 + 1 | 0;
+ i30 = ((HEAPU8[i35] | 0) << i31) + i30 | 0;
+ i36 = i31 + 8 | 0;
+ if (i36 >>> 0 < i34 >>> 0) {
+ i29 = i29 + 2 | 0;
+ i31 = i31 + 16 | 0;
+ i30 = ((HEAPU8[i29] | 0) << i36) + i30 | 0;
+ } else {
+ i31 = i36;
+ i29 = i35;
+ }
+ }
+ i33 = (i30 & (1 << i34) + -1) + i33 | 0;
+ i30 = i30 >>> i34;
+ i31 = i31 - i34 | 0;
+ i35 = i28;
+ i34 = i35 - i19 | 0;
+ if (!(i33 >>> 0 > i34 >>> 0)) {
+ i34 = i28 + (0 - i33) | 0;
+ while (1) {
+ HEAP8[i28 + 1 | 0] = HEAP8[i34 + 1 | 0] | 0;
+ HEAP8[i28 + 2 | 0] = HEAP8[i34 + 2 | 0] | 0;
+ i35 = i34 + 3 | 0;
+ i33 = i28 + 3 | 0;
+ HEAP8[i33] = HEAP8[i35] | 0;
+ i32 = i32 + -3 | 0;
+ if (!(i32 >>> 0 > 2)) {
+ break;
+ } else {
+ i34 = i35;
+ i28 = i33;
+ }
+ }
+ if ((i32 | 0) == 0) {
+ i28 = i33;
+ break;
+ }
+ i33 = i28 + 4 | 0;
+ HEAP8[i33] = HEAP8[i34 + 4 | 0] | 0;
+ if (!(i32 >>> 0 > 1)) {
+ i28 = i33;
+ break;
+ }
+ i28 = i28 + 5 | 0;
+ HEAP8[i28] = HEAP8[i34 + 5 | 0] | 0;
+ break;
+ }
+ i34 = i33 - i34 | 0;
+ if (i34 >>> 0 > i17 >>> 0 ? (HEAP32[i25 >> 2] | 0) != 0 : 0) {
+ i10 = 22;
+ break L1;
+ }
+ do {
+ if (i27) {
+ i36 = i18 + (i24 - i34) | 0;
+ if (i34 >>> 0 < i32 >>> 0) {
+ i32 = i32 - i34 | 0;
+ i35 = i33 - i35 | 0;
+ i37 = i28;
+ do {
+ i36 = i36 + 1 | 0;
+ i37 = i37 + 1 | 0;
+ HEAP8[i37] = HEAP8[i36] | 0;
+ i34 = i34 + -1 | 0;
+ } while ((i34 | 0) != 0);
+ i33 = i28 + (i23 + i35 + (1 - i33)) | 0;
+ i28 = i28 + (i19 + i35) | 0;
+ } else {
+ i33 = i36;
+ }
+ } else {
+ if (!(i12 >>> 0 < i34 >>> 0)) {
+ i36 = i18 + (i22 - i34) | 0;
+ if (!(i34 >>> 0 < i32 >>> 0)) {
+ i33 = i36;
+ break;
+ }
+ i32 = i32 - i34 | 0;
+ i35 = i33 - i35 | 0;
+ i37 = i28;
+ do {
+ i36 = i36 + 1 | 0;
+ i37 = i37 + 1 | 0;
+ HEAP8[i37] = HEAP8[i36] | 0;
+ i34 = i34 + -1 | 0;
+ } while ((i34 | 0) != 0);
+ i33 = i28 + (i23 + i35 + (1 - i33)) | 0;
+ i28 = i28 + (i19 + i35) | 0;
+ break;
+ }
+ i37 = i18 + (i21 - i34) | 0;
+ i36 = i34 - i12 | 0;
+ if (i36 >>> 0 < i32 >>> 0) {
+ i32 = i32 - i36 | 0;
+ i34 = i33 - i35 | 0;
+ i35 = i28;
+ do {
+ i37 = i37 + 1 | 0;
+ i35 = i35 + 1 | 0;
+ HEAP8[i35] = HEAP8[i37] | 0;
+ i36 = i36 + -1 | 0;
+ } while ((i36 | 0) != 0);
+ i35 = i28 + (i26 + i34) | 0;
+ if (i12 >>> 0 < i32 >>> 0) {
+ i32 = i32 - i12 | 0;
+ i37 = i20;
+ i36 = i12;
+ do {
+ i37 = i37 + 1 | 0;
+ i35 = i35 + 1 | 0;
+ HEAP8[i35] = HEAP8[i37] | 0;
+ i36 = i36 + -1 | 0;
+ } while ((i36 | 0) != 0);
+ i33 = i28 + (i23 + i34 + (1 - i33)) | 0;
+ i28 = i28 + (i19 + i34) | 0;
+ } else {
+ i33 = i20;
+ i28 = i35;
+ }
+ } else {
+ i33 = i37;
+ }
+ }
+ } while (0);
+ if (i32 >>> 0 > 2) {
+ do {
+ HEAP8[i28 + 1 | 0] = HEAP8[i33 + 1 | 0] | 0;
+ HEAP8[i28 + 2 | 0] = HEAP8[i33 + 2 | 0] | 0;
+ i33 = i33 + 3 | 0;
+ i28 = i28 + 3 | 0;
+ HEAP8[i28] = HEAP8[i33] | 0;
+ i32 = i32 + -3 | 0;
+ } while (i32 >>> 0 > 2);
+ }
+ if ((i32 | 0) != 0) {
+ i34 = i28 + 1 | 0;
+ HEAP8[i34] = HEAP8[i33 + 1 | 0] | 0;
+ if (i32 >>> 0 > 1) {
+ i28 = i28 + 2 | 0;
+ HEAP8[i28] = HEAP8[i33 + 2 | 0] | 0;
+ } else {
+ i28 = i34;
+ }
+ }
+ } else {
+ i32 = i32 & 255;
+ i10 = 7;
+ }
+ } while (0);
+ if ((i10 | 0) == 7) {
+ i10 = 0;
+ i28 = i28 + 1 | 0;
+ HEAP8[i28] = i32;
+ }
+ } while (i29 >>> 0 < i8 >>> 0 & i28 >>> 0 < i6 >>> 0);
+ do {
+ if ((i10 | 0) == 22) {
+ HEAP32[i7 + 24 >> 2] = 14384;
+ HEAP32[i11 >> 2] = 29;
+ } else if ((i10 | 0) == 52) {
+ HEAP32[i7 + 24 >> 2] = 14416;
+ HEAP32[i11 >> 2] = 29;
+ } else if ((i10 | 0) == 55) {
+ if ((i33 & 32 | 0) == 0) {
+ HEAP32[i7 + 24 >> 2] = 14440;
+ HEAP32[i11 >> 2] = 29;
+ break;
+ } else {
+ HEAP32[i11 >> 2] = 11;
+ break;
+ }
+ }
+ } while (0);
+ i37 = i31 >>> 3;
+ i11 = i29 + (0 - i37) | 0;
+ i10 = i31 - (i37 << 3) | 0;
+ i12 = (1 << i10) + -1 & i30;
+ HEAP32[i7 >> 2] = i29 + (1 - i37);
+ HEAP32[i9 >> 2] = i28 + 1;
+ if (i11 >>> 0 < i8 >>> 0) {
+ i7 = i8 - i11 | 0;
+ } else {
+ i7 = i8 - i11 | 0;
+ }
+ HEAP32[i5 >> 2] = i7 + 5;
+ if (i28 >>> 0 < i6 >>> 0) {
+ i37 = i6 - i28 | 0;
+ i37 = i37 + 257 | 0;
+ HEAP32[i4 >> 2] = i37;
+ HEAP32[i3 >> 2] = i12;
+ HEAP32[i2 >> 2] = i10;
+ STACKTOP = i1;
+ return;
+ } else {
+ i37 = i6 - i28 | 0;
+ i37 = i37 + 257 | 0;
+ HEAP32[i4 >> 2] = i37;
+ HEAP32[i3 >> 2] = i12;
+ HEAP32[i2 >> 2] = i10;
+ STACKTOP = i1;
+ return;
+ }
+}
+function _send_tree(i2, i13, i12) {
+ i2 = i2 | 0;
+ i13 = i13 | 0;
+ i12 = i12 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0;
+ i11 = STACKTOP;
+ i15 = HEAP16[i13 + 2 >> 1] | 0;
+ i16 = i15 << 16 >> 16 == 0;
+ i7 = i2 + 2754 | 0;
+ i4 = i2 + 5820 | 0;
+ i8 = i2 + 2752 | 0;
+ i3 = i2 + 5816 | 0;
+ i14 = i2 + 20 | 0;
+ i10 = i2 + 8 | 0;
+ i9 = i2 + 2758 | 0;
+ i1 = i2 + 2756 | 0;
+ i5 = i2 + 2750 | 0;
+ i6 = i2 + 2748 | 0;
+ i21 = i16 ? 138 : 7;
+ i23 = i16 ? 3 : 4;
+ i18 = 0;
+ i15 = i15 & 65535;
+ i24 = -1;
+ L1 : while (1) {
+ i20 = 0;
+ while (1) {
+ if ((i18 | 0) > (i12 | 0)) {
+ break L1;
+ }
+ i18 = i18 + 1 | 0;
+ i19 = HEAP16[i13 + (i18 << 2) + 2 >> 1] | 0;
+ i16 = i19 & 65535;
+ i22 = i20 + 1 | 0;
+ i17 = (i15 | 0) == (i16 | 0);
+ if (!((i22 | 0) < (i21 | 0) & i17)) {
+ break;
+ } else {
+ i20 = i22;
+ }
+ }
+ do {
+ if ((i22 | 0) >= (i23 | 0)) {
+ if ((i15 | 0) != 0) {
+ if ((i15 | 0) == (i24 | 0)) {
+ i23 = HEAP16[i3 >> 1] | 0;
+ i21 = HEAP32[i4 >> 2] | 0;
+ i20 = i22;
+ } else {
+ i22 = HEAPU16[i2 + (i15 << 2) + 2686 >> 1] | 0;
+ i21 = HEAP32[i4 >> 2] | 0;
+ i24 = HEAPU16[i2 + (i15 << 2) + 2684 >> 1] | 0;
+ i25 = HEAPU16[i3 >> 1] | 0 | i24 << i21;
+ i23 = i25 & 65535;
+ HEAP16[i3 >> 1] = i23;
+ if ((i21 | 0) > (16 - i22 | 0)) {
+ i23 = HEAP32[i14 >> 2] | 0;
+ HEAP32[i14 >> 2] = i23 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i23 | 0] = i25;
+ i23 = (HEAPU16[i3 >> 1] | 0) >>> 8 & 255;
+ i21 = HEAP32[i14 >> 2] | 0;
+ HEAP32[i14 >> 2] = i21 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i21 | 0] = i23;
+ i21 = HEAP32[i4 >> 2] | 0;
+ i23 = i24 >>> (16 - i21 | 0) & 65535;
+ HEAP16[i3 >> 1] = i23;
+ i21 = i22 + -16 + i21 | 0;
+ } else {
+ i21 = i21 + i22 | 0;
+ }
+ HEAP32[i4 >> 2] = i21;
+ }
+ i22 = HEAPU16[i5 >> 1] | 0;
+ i24 = HEAPU16[i6 >> 1] | 0;
+ i23 = i23 & 65535 | i24 << i21;
+ HEAP16[i3 >> 1] = i23;
+ if ((i21 | 0) > (16 - i22 | 0)) {
+ i21 = HEAP32[i14 >> 2] | 0;
+ HEAP32[i14 >> 2] = i21 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i21 | 0] = i23;
+ i23 = (HEAPU16[i3 >> 1] | 0) >>> 8 & 255;
+ i21 = HEAP32[i14 >> 2] | 0;
+ HEAP32[i14 >> 2] = i21 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i21 | 0] = i23;
+ i21 = HEAP32[i4 >> 2] | 0;
+ i23 = i24 >>> (16 - i21 | 0);
+ HEAP16[i3 >> 1] = i23;
+ i21 = i22 + -16 + i21 | 0;
+ } else {
+ i21 = i21 + i22 | 0;
+ }
+ HEAP32[i4 >> 2] = i21;
+ i20 = i20 + 65533 & 65535;
+ i22 = i23 & 65535 | i20 << i21;
+ HEAP16[i3 >> 1] = i22;
+ if ((i21 | 0) > 14) {
+ i26 = HEAP32[i14 >> 2] | 0;
+ HEAP32[i14 >> 2] = i26 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i26 | 0] = i22;
+ i26 = (HEAPU16[i3 >> 1] | 0) >>> 8 & 255;
+ i27 = HEAP32[i14 >> 2] | 0;
+ HEAP32[i14 >> 2] = i27 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i27 | 0] = i26;
+ i27 = HEAP32[i4 >> 2] | 0;
+ HEAP16[i3 >> 1] = i20 >>> (16 - i27 | 0);
+ HEAP32[i4 >> 2] = i27 + -14;
+ break;
+ } else {
+ HEAP32[i4 >> 2] = i21 + 2;
+ break;
+ }
+ }
+ if ((i22 | 0) < 11) {
+ i24 = HEAPU16[i7 >> 1] | 0;
+ i23 = HEAP32[i4 >> 2] | 0;
+ i21 = HEAPU16[i8 >> 1] | 0;
+ i22 = HEAPU16[i3 >> 1] | 0 | i21 << i23;
+ HEAP16[i3 >> 1] = i22;
+ if ((i23 | 0) > (16 - i24 | 0)) {
+ i27 = HEAP32[i14 >> 2] | 0;
+ HEAP32[i14 >> 2] = i27 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i27 | 0] = i22;
+ i22 = (HEAPU16[i3 >> 1] | 0) >>> 8 & 255;
+ i27 = HEAP32[i14 >> 2] | 0;
+ HEAP32[i14 >> 2] = i27 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i27 | 0] = i22;
+ i27 = HEAP32[i4 >> 2] | 0;
+ i22 = i21 >>> (16 - i27 | 0);
+ HEAP16[i3 >> 1] = i22;
+ i21 = i24 + -16 + i27 | 0;
+ } else {
+ i21 = i23 + i24 | 0;
+ }
+ HEAP32[i4 >> 2] = i21;
+ i20 = i20 + 65534 & 65535;
+ i22 = i22 & 65535 | i20 << i21;
+ HEAP16[i3 >> 1] = i22;
+ if ((i21 | 0) > 13) {
+ i26 = HEAP32[i14 >> 2] | 0;
+ HEAP32[i14 >> 2] = i26 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i26 | 0] = i22;
+ i26 = (HEAPU16[i3 >> 1] | 0) >>> 8 & 255;
+ i27 = HEAP32[i14 >> 2] | 0;
+ HEAP32[i14 >> 2] = i27 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i27 | 0] = i26;
+ i27 = HEAP32[i4 >> 2] | 0;
+ HEAP16[i3 >> 1] = i20 >>> (16 - i27 | 0);
+ HEAP32[i4 >> 2] = i27 + -13;
+ break;
+ } else {
+ HEAP32[i4 >> 2] = i21 + 3;
+ break;
+ }
+ } else {
+ i21 = HEAPU16[i9 >> 1] | 0;
+ i24 = HEAP32[i4 >> 2] | 0;
+ i23 = HEAPU16[i1 >> 1] | 0;
+ i22 = HEAPU16[i3 >> 1] | 0 | i23 << i24;
+ HEAP16[i3 >> 1] = i22;
+ if ((i24 | 0) > (16 - i21 | 0)) {
+ i27 = HEAP32[i14 >> 2] | 0;
+ HEAP32[i14 >> 2] = i27 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i27 | 0] = i22;
+ i22 = (HEAPU16[i3 >> 1] | 0) >>> 8 & 255;
+ i27 = HEAP32[i14 >> 2] | 0;
+ HEAP32[i14 >> 2] = i27 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i27 | 0] = i22;
+ i27 = HEAP32[i4 >> 2] | 0;
+ i22 = i23 >>> (16 - i27 | 0);
+ HEAP16[i3 >> 1] = i22;
+ i21 = i21 + -16 + i27 | 0;
+ } else {
+ i21 = i24 + i21 | 0;
+ }
+ HEAP32[i4 >> 2] = i21;
+ i20 = i20 + 65526 & 65535;
+ i22 = i22 & 65535 | i20 << i21;
+ HEAP16[i3 >> 1] = i22;
+ if ((i21 | 0) > 9) {
+ i26 = HEAP32[i14 >> 2] | 0;
+ HEAP32[i14 >> 2] = i26 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i26 | 0] = i22;
+ i26 = (HEAPU16[i3 >> 1] | 0) >>> 8 & 255;
+ i27 = HEAP32[i14 >> 2] | 0;
+ HEAP32[i14 >> 2] = i27 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i27 | 0] = i26;
+ i27 = HEAP32[i4 >> 2] | 0;
+ HEAP16[i3 >> 1] = i20 >>> (16 - i27 | 0);
+ HEAP32[i4 >> 2] = i27 + -9;
+ break;
+ } else {
+ HEAP32[i4 >> 2] = i21 + 7;
+ break;
+ }
+ }
+ } else {
+ i20 = i2 + (i15 << 2) + 2686 | 0;
+ i21 = i2 + (i15 << 2) + 2684 | 0;
+ i23 = HEAP32[i4 >> 2] | 0;
+ i26 = HEAP16[i3 >> 1] | 0;
+ do {
+ i24 = HEAPU16[i20 >> 1] | 0;
+ i25 = HEAPU16[i21 >> 1] | 0;
+ i27 = i26 & 65535 | i25 << i23;
+ i26 = i27 & 65535;
+ HEAP16[i3 >> 1] = i26;
+ if ((i23 | 0) > (16 - i24 | 0)) {
+ i26 = HEAP32[i14 >> 2] | 0;
+ HEAP32[i14 >> 2] = i26 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i26 | 0] = i27;
+ i26 = (HEAPU16[i3 >> 1] | 0) >>> 8 & 255;
+ i23 = HEAP32[i14 >> 2] | 0;
+ HEAP32[i14 >> 2] = i23 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i23 | 0] = i26;
+ i23 = HEAP32[i4 >> 2] | 0;
+ i26 = i25 >>> (16 - i23 | 0) & 65535;
+ HEAP16[i3 >> 1] = i26;
+ i23 = i24 + -16 + i23 | 0;
+ } else {
+ i23 = i23 + i24 | 0;
+ }
+ HEAP32[i4 >> 2] = i23;
+ i22 = i22 + -1 | 0;
+ } while ((i22 | 0) != 0);
+ }
+ } while (0);
+ if (i19 << 16 >> 16 == 0) {
+ i24 = i15;
+ i21 = 138;
+ i23 = 3;
+ i15 = i16;
+ continue;
+ }
+ i24 = i15;
+ i21 = i17 ? 6 : 7;
+ i23 = i17 ? 3 : 4;
+ i15 = i16;
+ }
+ STACKTOP = i11;
+ return;
+}
+function __tr_flush_block(i2, i4, i6, i3) {
+ i2 = i2 | 0;
+ i4 = i4 | 0;
+ i6 = i6 | 0;
+ i3 = i3 | 0;
+ var i1 = 0, i5 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0;
+ i1 = STACKTOP;
+ if ((HEAP32[i2 + 132 >> 2] | 0) > 0) {
+ i5 = (HEAP32[i2 >> 2] | 0) + 44 | 0;
+ if ((HEAP32[i5 >> 2] | 0) == 2) {
+ i8 = -201342849;
+ i9 = 0;
+ while (1) {
+ if ((i8 & 1 | 0) != 0 ? (HEAP16[i2 + (i9 << 2) + 148 >> 1] | 0) != 0 : 0) {
+ i8 = 0;
+ break;
+ }
+ i9 = i9 + 1 | 0;
+ if ((i9 | 0) < 32) {
+ i8 = i8 >>> 1;
+ } else {
+ i7 = 6;
+ break;
+ }
+ }
+ L9 : do {
+ if ((i7 | 0) == 6) {
+ if (((HEAP16[i2 + 184 >> 1] | 0) == 0 ? (HEAP16[i2 + 188 >> 1] | 0) == 0 : 0) ? (HEAP16[i2 + 200 >> 1] | 0) == 0 : 0) {
+ i8 = 32;
+ while (1) {
+ i7 = i8 + 1 | 0;
+ if ((HEAP16[i2 + (i8 << 2) + 148 >> 1] | 0) != 0) {
+ i8 = 1;
+ break L9;
+ }
+ if ((i7 | 0) < 256) {
+ i8 = i7;
+ } else {
+ i8 = 0;
+ break;
+ }
+ }
+ } else {
+ i8 = 1;
+ }
+ }
+ } while (0);
+ HEAP32[i5 >> 2] = i8;
+ }
+ _build_tree(i2, i2 + 2840 | 0);
+ _build_tree(i2, i2 + 2852 | 0);
+ _scan_tree(i2, i2 + 148 | 0, HEAP32[i2 + 2844 >> 2] | 0);
+ _scan_tree(i2, i2 + 2440 | 0, HEAP32[i2 + 2856 >> 2] | 0);
+ _build_tree(i2, i2 + 2864 | 0);
+ i5 = 18;
+ while (1) {
+ i7 = i5 + -1 | 0;
+ if ((HEAP16[i2 + (HEAPU8[2888 + i5 | 0] << 2) + 2686 >> 1] | 0) != 0) {
+ break;
+ }
+ if ((i7 | 0) > 2) {
+ i5 = i7;
+ } else {
+ i5 = i7;
+ break;
+ }
+ }
+ i10 = i2 + 5800 | 0;
+ i7 = (i5 * 3 | 0) + 17 + (HEAP32[i10 >> 2] | 0) | 0;
+ HEAP32[i10 >> 2] = i7;
+ i7 = (i7 + 10 | 0) >>> 3;
+ i10 = ((HEAP32[i2 + 5804 >> 2] | 0) + 10 | 0) >>> 3;
+ i9 = i10 >>> 0 > i7 >>> 0 ? i7 : i10;
+ } else {
+ i10 = i6 + 5 | 0;
+ i5 = 0;
+ i9 = i10;
+ }
+ do {
+ if ((i6 + 4 | 0) >>> 0 > i9 >>> 0 | (i4 | 0) == 0) {
+ i4 = i2 + 5820 | 0;
+ i7 = HEAP32[i4 >> 2] | 0;
+ i8 = (i7 | 0) > 13;
+ if ((HEAP32[i2 + 136 >> 2] | 0) == 4 | (i10 | 0) == (i9 | 0)) {
+ i9 = i3 + 2 & 65535;
+ i6 = i2 + 5816 | 0;
+ i5 = HEAPU16[i6 >> 1] | i9 << i7;
+ HEAP16[i6 >> 1] = i5;
+ if (i8) {
+ i12 = i2 + 20 | 0;
+ i13 = HEAP32[i12 >> 2] | 0;
+ HEAP32[i12 >> 2] = i13 + 1;
+ i14 = i2 + 8 | 0;
+ HEAP8[(HEAP32[i14 >> 2] | 0) + i13 | 0] = i5;
+ i13 = (HEAPU16[i6 >> 1] | 0) >>> 8 & 255;
+ i5 = HEAP32[i12 >> 2] | 0;
+ HEAP32[i12 >> 2] = i5 + 1;
+ HEAP8[(HEAP32[i14 >> 2] | 0) + i5 | 0] = i13;
+ i5 = HEAP32[i4 >> 2] | 0;
+ HEAP16[i6 >> 1] = i9 >>> (16 - i5 | 0);
+ i5 = i5 + -13 | 0;
+ } else {
+ i5 = i7 + 3 | 0;
+ }
+ HEAP32[i4 >> 2] = i5;
+ _compress_block(i2, 1136, 2288);
+ break;
+ }
+ i10 = i3 + 4 & 65535;
+ i6 = i2 + 5816 | 0;
+ i9 = HEAPU16[i6 >> 1] | i10 << i7;
+ HEAP16[i6 >> 1] = i9;
+ if (i8) {
+ i13 = i2 + 20 | 0;
+ i12 = HEAP32[i13 >> 2] | 0;
+ HEAP32[i13 >> 2] = i12 + 1;
+ i14 = i2 + 8 | 0;
+ HEAP8[(HEAP32[i14 >> 2] | 0) + i12 | 0] = i9;
+ i9 = (HEAPU16[i6 >> 1] | 0) >>> 8 & 255;
+ i12 = HEAP32[i13 >> 2] | 0;
+ HEAP32[i13 >> 2] = i12 + 1;
+ HEAP8[(HEAP32[i14 >> 2] | 0) + i12 | 0] = i9;
+ i12 = HEAP32[i4 >> 2] | 0;
+ i9 = i10 >>> (16 - i12 | 0);
+ HEAP16[i6 >> 1] = i9;
+ i12 = i12 + -13 | 0;
+ } else {
+ i12 = i7 + 3 | 0;
+ }
+ HEAP32[i4 >> 2] = i12;
+ i7 = HEAP32[i2 + 2844 >> 2] | 0;
+ i8 = HEAP32[i2 + 2856 >> 2] | 0;
+ i10 = i7 + 65280 & 65535;
+ i11 = i9 & 65535 | i10 << i12;
+ HEAP16[i6 >> 1] = i11;
+ if ((i12 | 0) > 11) {
+ i13 = i2 + 20 | 0;
+ i9 = HEAP32[i13 >> 2] | 0;
+ HEAP32[i13 >> 2] = i9 + 1;
+ i14 = i2 + 8 | 0;
+ HEAP8[(HEAP32[i14 >> 2] | 0) + i9 | 0] = i11;
+ i11 = (HEAPU16[i6 >> 1] | 0) >>> 8 & 255;
+ i9 = HEAP32[i13 >> 2] | 0;
+ HEAP32[i13 >> 2] = i9 + 1;
+ HEAP8[(HEAP32[i14 >> 2] | 0) + i9 | 0] = i11;
+ i9 = HEAP32[i4 >> 2] | 0;
+ i11 = i10 >>> (16 - i9 | 0);
+ HEAP16[i6 >> 1] = i11;
+ i9 = i9 + -11 | 0;
+ } else {
+ i9 = i12 + 5 | 0;
+ }
+ HEAP32[i4 >> 2] = i9;
+ i10 = i8 & 65535;
+ i11 = i10 << i9 | i11 & 65535;
+ HEAP16[i6 >> 1] = i11;
+ if ((i9 | 0) > 11) {
+ i13 = i2 + 20 | 0;
+ i9 = HEAP32[i13 >> 2] | 0;
+ HEAP32[i13 >> 2] = i9 + 1;
+ i14 = i2 + 8 | 0;
+ HEAP8[(HEAP32[i14 >> 2] | 0) + i9 | 0] = i11;
+ i11 = (HEAPU16[i6 >> 1] | 0) >>> 8 & 255;
+ i9 = HEAP32[i13 >> 2] | 0;
+ HEAP32[i13 >> 2] = i9 + 1;
+ HEAP8[(HEAP32[i14 >> 2] | 0) + i9 | 0] = i11;
+ i9 = HEAP32[i4 >> 2] | 0;
+ i11 = i10 >>> (16 - i9 | 0);
+ HEAP16[i6 >> 1] = i11;
+ i9 = i9 + -11 | 0;
+ } else {
+ i9 = i9 + 5 | 0;
+ }
+ HEAP32[i4 >> 2] = i9;
+ i10 = i5 + 65533 & 65535;
+ i14 = i10 << i9 | i11 & 65535;
+ HEAP16[i6 >> 1] = i14;
+ if ((i9 | 0) > 12) {
+ i12 = i2 + 20 | 0;
+ i11 = HEAP32[i12 >> 2] | 0;
+ HEAP32[i12 >> 2] = i11 + 1;
+ i13 = i2 + 8 | 0;
+ HEAP8[(HEAP32[i13 >> 2] | 0) + i11 | 0] = i14;
+ i14 = (HEAPU16[i6 >> 1] | 0) >>> 8 & 255;
+ i11 = HEAP32[i12 >> 2] | 0;
+ HEAP32[i12 >> 2] = i11 + 1;
+ HEAP8[(HEAP32[i13 >> 2] | 0) + i11 | 0] = i14;
+ i11 = HEAP32[i4 >> 2] | 0;
+ i14 = i10 >>> (16 - i11 | 0);
+ HEAP16[i6 >> 1] = i14;
+ i11 = i11 + -12 | 0;
+ } else {
+ i11 = i9 + 4 | 0;
+ }
+ HEAP32[i4 >> 2] = i11;
+ if ((i5 | 0) > -1) {
+ i10 = i2 + 20 | 0;
+ i9 = i2 + 8 | 0;
+ i12 = 0;
+ while (1) {
+ i13 = HEAPU16[i2 + (HEAPU8[2888 + i12 | 0] << 2) + 2686 >> 1] | 0;
+ i14 = i13 << i11 | i14 & 65535;
+ HEAP16[i6 >> 1] = i14;
+ if ((i11 | 0) > 13) {
+ i11 = HEAP32[i10 >> 2] | 0;
+ HEAP32[i10 >> 2] = i11 + 1;
+ HEAP8[(HEAP32[i9 >> 2] | 0) + i11 | 0] = i14;
+ i14 = (HEAPU16[i6 >> 1] | 0) >>> 8 & 255;
+ i11 = HEAP32[i10 >> 2] | 0;
+ HEAP32[i10 >> 2] = i11 + 1;
+ HEAP8[(HEAP32[i9 >> 2] | 0) + i11 | 0] = i14;
+ i11 = HEAP32[i4 >> 2] | 0;
+ i14 = i13 >>> (16 - i11 | 0);
+ HEAP16[i6 >> 1] = i14;
+ i11 = i11 + -13 | 0;
+ } else {
+ i11 = i11 + 3 | 0;
+ }
+ HEAP32[i4 >> 2] = i11;
+ if ((i12 | 0) == (i5 | 0)) {
+ break;
+ } else {
+ i12 = i12 + 1 | 0;
+ }
+ }
+ }
+ i13 = i2 + 148 | 0;
+ _send_tree(i2, i13, i7);
+ i14 = i2 + 2440 | 0;
+ _send_tree(i2, i14, i8);
+ _compress_block(i2, i13, i14);
+ } else {
+ __tr_stored_block(i2, i4, i6, i3);
+ }
+ } while (0);
+ _init_block(i2);
+ if ((i3 | 0) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ i3 = i2 + 5820 | 0;
+ i4 = HEAP32[i3 >> 2] | 0;
+ if ((i4 | 0) <= 8) {
+ i5 = i2 + 5816 | 0;
+ if ((i4 | 0) > 0) {
+ i13 = HEAP16[i5 >> 1] & 255;
+ i12 = i2 + 20 | 0;
+ i14 = HEAP32[i12 >> 2] | 0;
+ HEAP32[i12 >> 2] = i14 + 1;
+ HEAP8[(HEAP32[i2 + 8 >> 2] | 0) + i14 | 0] = i13;
+ }
+ } else {
+ i5 = i2 + 5816 | 0;
+ i14 = HEAP16[i5 >> 1] & 255;
+ i11 = i2 + 20 | 0;
+ i12 = HEAP32[i11 >> 2] | 0;
+ HEAP32[i11 >> 2] = i12 + 1;
+ i13 = i2 + 8 | 0;
+ HEAP8[(HEAP32[i13 >> 2] | 0) + i12 | 0] = i14;
+ i12 = (HEAPU16[i5 >> 1] | 0) >>> 8 & 255;
+ i14 = HEAP32[i11 >> 2] | 0;
+ HEAP32[i11 >> 2] = i14 + 1;
+ HEAP8[(HEAP32[i13 >> 2] | 0) + i14 | 0] = i12;
+ }
+ HEAP16[i5 >> 1] = 0;
+ HEAP32[i3 >> 2] = 0;
+ STACKTOP = i1;
+ return;
+}
+function _deflate_fast(i3, i6) {
+ i3 = i3 | 0;
+ i6 = i6 | 0;
+ var i1 = 0, i2 = 0, i4 = 0, i5 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0, i30 = 0, i31 = 0, i32 = 0, i33 = 0, i34 = 0, i35 = 0, i36 = 0;
+ i1 = STACKTOP;
+ i20 = i3 + 116 | 0;
+ i22 = (i6 | 0) == 0;
+ i23 = i3 + 72 | 0;
+ i24 = i3 + 88 | 0;
+ i5 = i3 + 108 | 0;
+ i7 = i3 + 56 | 0;
+ i9 = i3 + 84 | 0;
+ i10 = i3 + 68 | 0;
+ i11 = i3 + 52 | 0;
+ i12 = i3 + 64 | 0;
+ i19 = i3 + 44 | 0;
+ i21 = i3 + 96 | 0;
+ i16 = i3 + 112 | 0;
+ i13 = i3 + 5792 | 0;
+ i17 = i3 + 5796 | 0;
+ i18 = i3 + 5784 | 0;
+ i14 = i3 + 5788 | 0;
+ i15 = i3 + 128 | 0;
+ i4 = i3 + 92 | 0;
+ while (1) {
+ if ((HEAP32[i20 >> 2] | 0) >>> 0 < 262) {
+ _fill_window(i3);
+ i25 = HEAP32[i20 >> 2] | 0;
+ if (i25 >>> 0 < 262 & i22) {
+ i2 = 0;
+ i25 = 34;
+ break;
+ }
+ if ((i25 | 0) == 0) {
+ i25 = 26;
+ break;
+ }
+ if (!(i25 >>> 0 > 2)) {
+ i25 = 9;
+ } else {
+ i25 = 6;
+ }
+ } else {
+ i25 = 6;
+ }
+ if ((i25 | 0) == 6) {
+ i25 = 0;
+ i26 = HEAP32[i5 >> 2] | 0;
+ i34 = ((HEAPU8[(HEAP32[i7 >> 2] | 0) + (i26 + 2) | 0] | 0) ^ HEAP32[i23 >> 2] << HEAP32[i24 >> 2]) & HEAP32[i9 >> 2];
+ HEAP32[i23 >> 2] = i34;
+ i34 = (HEAP32[i10 >> 2] | 0) + (i34 << 1) | 0;
+ i35 = HEAP16[i34 >> 1] | 0;
+ HEAP16[(HEAP32[i12 >> 2] | 0) + ((HEAP32[i11 >> 2] & i26) << 1) >> 1] = i35;
+ i27 = i35 & 65535;
+ HEAP16[i34 >> 1] = i26;
+ if (!(i35 << 16 >> 16 == 0) ? !((i26 - i27 | 0) >>> 0 > ((HEAP32[i19 >> 2] | 0) + -262 | 0) >>> 0) : 0) {
+ i26 = _longest_match(i3, i27) | 0;
+ HEAP32[i21 >> 2] = i26;
+ } else {
+ i25 = 9;
+ }
+ }
+ if ((i25 | 0) == 9) {
+ i26 = HEAP32[i21 >> 2] | 0;
+ }
+ do {
+ if (i26 >>> 0 > 2) {
+ i35 = i26 + 253 | 0;
+ i25 = (HEAP32[i5 >> 2] | 0) - (HEAP32[i16 >> 2] | 0) | 0;
+ i34 = HEAP32[i13 >> 2] | 0;
+ HEAP16[(HEAP32[i17 >> 2] | 0) + (i34 << 1) >> 1] = i25;
+ HEAP32[i13 >> 2] = i34 + 1;
+ HEAP8[(HEAP32[i18 >> 2] | 0) + i34 | 0] = i35;
+ i35 = i3 + ((HEAPU8[808 + (i35 & 255) | 0] | 0 | 256) + 1 << 2) + 148 | 0;
+ HEAP16[i35 >> 1] = (HEAP16[i35 >> 1] | 0) + 1 << 16 >> 16;
+ i25 = i25 + 65535 & 65535;
+ if (!(i25 >>> 0 < 256)) {
+ i25 = (i25 >>> 7) + 256 | 0;
+ }
+ i25 = i3 + ((HEAPU8[296 + i25 | 0] | 0) << 2) + 2440 | 0;
+ HEAP16[i25 >> 1] = (HEAP16[i25 >> 1] | 0) + 1 << 16 >> 16;
+ i25 = (HEAP32[i13 >> 2] | 0) == ((HEAP32[i14 >> 2] | 0) + -1 | 0) | 0;
+ i26 = HEAP32[i21 >> 2] | 0;
+ i35 = (HEAP32[i20 >> 2] | 0) - i26 | 0;
+ HEAP32[i20 >> 2] = i35;
+ if (!(i26 >>> 0 <= (HEAP32[i15 >> 2] | 0) >>> 0 & i35 >>> 0 > 2)) {
+ i26 = (HEAP32[i5 >> 2] | 0) + i26 | 0;
+ HEAP32[i5 >> 2] = i26;
+ HEAP32[i21 >> 2] = 0;
+ i34 = HEAP32[i7 >> 2] | 0;
+ i35 = HEAPU8[i34 + i26 | 0] | 0;
+ HEAP32[i23 >> 2] = i35;
+ HEAP32[i23 >> 2] = ((HEAPU8[i34 + (i26 + 1) | 0] | 0) ^ i35 << HEAP32[i24 >> 2]) & HEAP32[i9 >> 2];
+ break;
+ }
+ i30 = i26 + -1 | 0;
+ HEAP32[i21 >> 2] = i30;
+ i34 = HEAP32[i24 >> 2] | 0;
+ i33 = HEAP32[i7 >> 2] | 0;
+ i35 = HEAP32[i9 >> 2] | 0;
+ i32 = HEAP32[i10 >> 2] | 0;
+ i27 = HEAP32[i11 >> 2] | 0;
+ i29 = HEAP32[i12 >> 2] | 0;
+ i26 = HEAP32[i5 >> 2] | 0;
+ i31 = HEAP32[i23 >> 2] | 0;
+ while (1) {
+ i28 = i26 + 1 | 0;
+ HEAP32[i5 >> 2] = i28;
+ i31 = ((HEAPU8[i33 + (i26 + 3) | 0] | 0) ^ i31 << i34) & i35;
+ HEAP32[i23 >> 2] = i31;
+ i36 = i32 + (i31 << 1) | 0;
+ HEAP16[i29 + ((i27 & i28) << 1) >> 1] = HEAP16[i36 >> 1] | 0;
+ HEAP16[i36 >> 1] = i28;
+ i30 = i30 + -1 | 0;
+ HEAP32[i21 >> 2] = i30;
+ if ((i30 | 0) == 0) {
+ break;
+ } else {
+ i26 = i28;
+ }
+ }
+ i26 = i26 + 2 | 0;
+ HEAP32[i5 >> 2] = i26;
+ } else {
+ i25 = HEAP8[(HEAP32[i7 >> 2] | 0) + (HEAP32[i5 >> 2] | 0) | 0] | 0;
+ i26 = HEAP32[i13 >> 2] | 0;
+ HEAP16[(HEAP32[i17 >> 2] | 0) + (i26 << 1) >> 1] = 0;
+ HEAP32[i13 >> 2] = i26 + 1;
+ HEAP8[(HEAP32[i18 >> 2] | 0) + i26 | 0] = i25;
+ i25 = i3 + ((i25 & 255) << 2) + 148 | 0;
+ HEAP16[i25 >> 1] = (HEAP16[i25 >> 1] | 0) + 1 << 16 >> 16;
+ i25 = (HEAP32[i13 >> 2] | 0) == ((HEAP32[i14 >> 2] | 0) + -1 | 0) | 0;
+ HEAP32[i20 >> 2] = (HEAP32[i20 >> 2] | 0) + -1;
+ i26 = (HEAP32[i5 >> 2] | 0) + 1 | 0;
+ HEAP32[i5 >> 2] = i26;
+ }
+ } while (0);
+ if ((i25 | 0) == 0) {
+ continue;
+ }
+ i25 = HEAP32[i4 >> 2] | 0;
+ if ((i25 | 0) > -1) {
+ i27 = (HEAP32[i7 >> 2] | 0) + i25 | 0;
+ } else {
+ i27 = 0;
+ }
+ __tr_flush_block(i3, i27, i26 - i25 | 0, 0);
+ HEAP32[i4 >> 2] = HEAP32[i5 >> 2];
+ i27 = HEAP32[i3 >> 2] | 0;
+ i28 = i27 + 28 | 0;
+ i25 = HEAP32[i28 >> 2] | 0;
+ i30 = HEAP32[i25 + 20 >> 2] | 0;
+ i26 = i27 + 16 | 0;
+ i29 = HEAP32[i26 >> 2] | 0;
+ i29 = i30 >>> 0 > i29 >>> 0 ? i29 : i30;
+ if ((i29 | 0) != 0 ? (i8 = i27 + 12 | 0, _memcpy(HEAP32[i8 >> 2] | 0, HEAP32[i25 + 16 >> 2] | 0, i29 | 0) | 0, HEAP32[i8 >> 2] = (HEAP32[i8 >> 2] | 0) + i29, i8 = (HEAP32[i28 >> 2] | 0) + 16 | 0, HEAP32[i8 >> 2] = (HEAP32[i8 >> 2] | 0) + i29, i8 = i27 + 20 | 0, HEAP32[i8 >> 2] = (HEAP32[i8 >> 2] | 0) + i29, HEAP32[i26 >> 2] = (HEAP32[i26 >> 2] | 0) - i29, i8 = HEAP32[i28 >> 2] | 0, i35 = i8 + 20 | 0, i36 = HEAP32[i35 >> 2] | 0, HEAP32[i35 >> 2] = i36 - i29, (i36 | 0) == (i29 | 0)) : 0) {
+ HEAP32[i8 + 16 >> 2] = HEAP32[i8 + 8 >> 2];
+ }
+ if ((HEAP32[(HEAP32[i3 >> 2] | 0) + 16 >> 2] | 0) == 0) {
+ i2 = 0;
+ i25 = 34;
+ break;
+ }
+ }
+ if ((i25 | 0) == 26) {
+ i8 = HEAP32[i4 >> 2] | 0;
+ if ((i8 | 0) > -1) {
+ i7 = (HEAP32[i7 >> 2] | 0) + i8 | 0;
+ } else {
+ i7 = 0;
+ }
+ i6 = (i6 | 0) == 4;
+ __tr_flush_block(i3, i7, (HEAP32[i5 >> 2] | 0) - i8 | 0, i6 & 1);
+ HEAP32[i4 >> 2] = HEAP32[i5 >> 2];
+ i5 = HEAP32[i3 >> 2] | 0;
+ i7 = i5 + 28 | 0;
+ i4 = HEAP32[i7 >> 2] | 0;
+ i10 = HEAP32[i4 + 20 >> 2] | 0;
+ i8 = i5 + 16 | 0;
+ i9 = HEAP32[i8 >> 2] | 0;
+ i9 = i10 >>> 0 > i9 >>> 0 ? i9 : i10;
+ if ((i9 | 0) != 0 ? (i2 = i5 + 12 | 0, _memcpy(HEAP32[i2 >> 2] | 0, HEAP32[i4 + 16 >> 2] | 0, i9 | 0) | 0, HEAP32[i2 >> 2] = (HEAP32[i2 >> 2] | 0) + i9, i2 = (HEAP32[i7 >> 2] | 0) + 16 | 0, HEAP32[i2 >> 2] = (HEAP32[i2 >> 2] | 0) + i9, i2 = i5 + 20 | 0, HEAP32[i2 >> 2] = (HEAP32[i2 >> 2] | 0) + i9, HEAP32[i8 >> 2] = (HEAP32[i8 >> 2] | 0) - i9, i2 = HEAP32[i7 >> 2] | 0, i35 = i2 + 20 | 0, i36 = HEAP32[i35 >> 2] | 0, HEAP32[i35 >> 2] = i36 - i9, (i36 | 0) == (i9 | 0)) : 0) {
+ HEAP32[i2 + 16 >> 2] = HEAP32[i2 + 8 >> 2];
+ }
+ if ((HEAP32[(HEAP32[i3 >> 2] | 0) + 16 >> 2] | 0) == 0) {
+ i36 = i6 ? 2 : 0;
+ STACKTOP = i1;
+ return i36 | 0;
+ } else {
+ i36 = i6 ? 3 : 1;
+ STACKTOP = i1;
+ return i36 | 0;
+ }
+ } else if ((i25 | 0) == 34) {
+ STACKTOP = i1;
+ return i2 | 0;
+ }
+ return 0;
+}
+function _inflate_table(i11, i5, i13, i2, i1, i10) {
+ i11 = i11 | 0;
+ i5 = i5 | 0;
+ i13 = i13 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ i10 = i10 | 0;
+ var i3 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i12 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 = 0, i26 = 0, i27 = 0, i28 = 0, i29 = 0, i30 = 0, i31 = 0, i32 = 0, i33 = 0;
+ i3 = STACKTOP;
+ STACKTOP = STACKTOP + 64 | 0;
+ i7 = i3 + 32 | 0;
+ i12 = i3;
+ i4 = i7 + 0 | 0;
+ i9 = i4 + 32 | 0;
+ do {
+ HEAP16[i4 >> 1] = 0;
+ i4 = i4 + 2 | 0;
+ } while ((i4 | 0) < (i9 | 0));
+ i14 = (i13 | 0) == 0;
+ if (!i14) {
+ i4 = 0;
+ do {
+ i32 = i7 + (HEAPU16[i5 + (i4 << 1) >> 1] << 1) | 0;
+ HEAP16[i32 >> 1] = (HEAP16[i32 >> 1] | 0) + 1 << 16 >> 16;
+ i4 = i4 + 1 | 0;
+ } while ((i4 | 0) != (i13 | 0));
+ }
+ i4 = HEAP32[i1 >> 2] | 0;
+ i9 = 15;
+ while (1) {
+ i15 = i9 + -1 | 0;
+ if ((HEAP16[i7 + (i9 << 1) >> 1] | 0) != 0) {
+ break;
+ }
+ if ((i15 | 0) == 0) {
+ i6 = 7;
+ break;
+ } else {
+ i9 = i15;
+ }
+ }
+ if ((i6 | 0) == 7) {
+ i32 = HEAP32[i2 >> 2] | 0;
+ HEAP32[i2 >> 2] = i32 + 4;
+ HEAP8[i32] = 64;
+ HEAP8[i32 + 1 | 0] = 1;
+ HEAP16[i32 + 2 >> 1] = 0;
+ i32 = HEAP32[i2 >> 2] | 0;
+ HEAP32[i2 >> 2] = i32 + 4;
+ HEAP8[i32] = 64;
+ HEAP8[i32 + 1 | 0] = 1;
+ HEAP16[i32 + 2 >> 1] = 0;
+ HEAP32[i1 >> 2] = 1;
+ i32 = 0;
+ STACKTOP = i3;
+ return i32 | 0;
+ }
+ i4 = i4 >>> 0 > i9 >>> 0 ? i9 : i4;
+ L12 : do {
+ if (i9 >>> 0 > 1) {
+ i27 = 1;
+ while (1) {
+ i15 = i27 + 1 | 0;
+ if ((HEAP16[i7 + (i27 << 1) >> 1] | 0) != 0) {
+ break L12;
+ }
+ if (i15 >>> 0 < i9 >>> 0) {
+ i27 = i15;
+ } else {
+ i27 = i15;
+ break;
+ }
+ }
+ } else {
+ i27 = 1;
+ }
+ } while (0);
+ i4 = i4 >>> 0 < i27 >>> 0 ? i27 : i4;
+ i16 = 1;
+ i15 = 1;
+ do {
+ i16 = (i16 << 1) - (HEAPU16[i7 + (i15 << 1) >> 1] | 0) | 0;
+ i15 = i15 + 1 | 0;
+ if ((i16 | 0) < 0) {
+ i8 = -1;
+ i6 = 56;
+ break;
+ }
+ } while (i15 >>> 0 < 16);
+ if ((i6 | 0) == 56) {
+ STACKTOP = i3;
+ return i8 | 0;
+ }
+ if ((i16 | 0) > 0 ? !((i11 | 0) != 0 & (i9 | 0) == 1) : 0) {
+ i32 = -1;
+ STACKTOP = i3;
+ return i32 | 0;
+ }
+ HEAP16[i12 + 2 >> 1] = 0;
+ i16 = 0;
+ i15 = 1;
+ do {
+ i16 = (HEAPU16[i7 + (i15 << 1) >> 1] | 0) + (i16 & 65535) | 0;
+ i15 = i15 + 1 | 0;
+ HEAP16[i12 + (i15 << 1) >> 1] = i16;
+ } while ((i15 | 0) != 15);
+ if (!i14) {
+ i15 = 0;
+ do {
+ i14 = HEAP16[i5 + (i15 << 1) >> 1] | 0;
+ if (!(i14 << 16 >> 16 == 0)) {
+ i31 = i12 + ((i14 & 65535) << 1) | 0;
+ i32 = HEAP16[i31 >> 1] | 0;
+ HEAP16[i31 >> 1] = i32 + 1 << 16 >> 16;
+ HEAP16[i10 + ((i32 & 65535) << 1) >> 1] = i15;
+ }
+ i15 = i15 + 1 | 0;
+ } while ((i15 | 0) != (i13 | 0));
+ }
+ if ((i11 | 0) == 1) {
+ i14 = 1 << i4;
+ if (i14 >>> 0 > 851) {
+ i32 = 1;
+ STACKTOP = i3;
+ return i32 | 0;
+ } else {
+ i16 = 0;
+ i20 = 1;
+ i17 = 14128 + -514 | 0;
+ i19 = 256;
+ i18 = 14192 + -514 | 0;
+ }
+ } else if ((i11 | 0) != 0) {
+ i14 = 1 << i4;
+ i16 = (i11 | 0) == 2;
+ if (i16 & i14 >>> 0 > 591) {
+ i32 = 1;
+ STACKTOP = i3;
+ return i32 | 0;
+ } else {
+ i20 = 0;
+ i17 = 14256;
+ i19 = -1;
+ i18 = 14320;
+ }
+ } else {
+ i16 = 0;
+ i14 = 1 << i4;
+ i20 = 0;
+ i17 = i10;
+ i19 = 19;
+ i18 = i10;
+ }
+ i11 = i14 + -1 | 0;
+ i12 = i4 & 255;
+ i22 = i4;
+ i21 = 0;
+ i25 = 0;
+ i13 = -1;
+ i15 = HEAP32[i2 >> 2] | 0;
+ i24 = 0;
+ L44 : while (1) {
+ i23 = 1 << i22;
+ while (1) {
+ i29 = i27 - i21 | 0;
+ i22 = i29 & 255;
+ i28 = HEAP16[i10 + (i24 << 1) >> 1] | 0;
+ i30 = i28 & 65535;
+ if ((i30 | 0) >= (i19 | 0)) {
+ if ((i30 | 0) > (i19 | 0)) {
+ i26 = HEAP16[i18 + (i30 << 1) >> 1] & 255;
+ i28 = HEAP16[i17 + (i30 << 1) >> 1] | 0;
+ } else {
+ i26 = 96;
+ i28 = 0;
+ }
+ } else {
+ i26 = 0;
+ }
+ i31 = 1 << i29;
+ i30 = i25 >>> i21;
+ i32 = i23;
+ while (1) {
+ i29 = i32 - i31 | 0;
+ i33 = i29 + i30 | 0;
+ HEAP8[i15 + (i33 << 2) | 0] = i26;
+ HEAP8[i15 + (i33 << 2) + 1 | 0] = i22;
+ HEAP16[i15 + (i33 << 2) + 2 >> 1] = i28;
+ if ((i32 | 0) == (i31 | 0)) {
+ break;
+ } else {
+ i32 = i29;
+ }
+ }
+ i26 = 1 << i27 + -1;
+ while (1) {
+ if ((i26 & i25 | 0) == 0) {
+ break;
+ } else {
+ i26 = i26 >>> 1;
+ }
+ }
+ if ((i26 | 0) == 0) {
+ i25 = 0;
+ } else {
+ i25 = (i26 + -1 & i25) + i26 | 0;
+ }
+ i24 = i24 + 1 | 0;
+ i32 = i7 + (i27 << 1) | 0;
+ i33 = (HEAP16[i32 >> 1] | 0) + -1 << 16 >> 16;
+ HEAP16[i32 >> 1] = i33;
+ if (i33 << 16 >> 16 == 0) {
+ if ((i27 | 0) == (i9 | 0)) {
+ break L44;
+ }
+ i27 = HEAPU16[i5 + (HEAPU16[i10 + (i24 << 1) >> 1] << 1) >> 1] | 0;
+ }
+ if (!(i27 >>> 0 > i4 >>> 0)) {
+ continue;
+ }
+ i26 = i25 & i11;
+ if ((i26 | 0) != (i13 | 0)) {
+ break;
+ }
+ }
+ i28 = (i21 | 0) == 0 ? i4 : i21;
+ i23 = i15 + (i23 << 2) | 0;
+ i31 = i27 - i28 | 0;
+ L67 : do {
+ if (i27 >>> 0 < i9 >>> 0) {
+ i29 = i27;
+ i30 = i31;
+ i31 = 1 << i31;
+ while (1) {
+ i31 = i31 - (HEAPU16[i7 + (i29 << 1) >> 1] | 0) | 0;
+ if ((i31 | 0) < 1) {
+ break L67;
+ }
+ i30 = i30 + 1 | 0;
+ i29 = i30 + i28 | 0;
+ if (i29 >>> 0 < i9 >>> 0) {
+ i31 = i31 << 1;
+ } else {
+ break;
+ }
+ }
+ } else {
+ i30 = i31;
+ }
+ } while (0);
+ i29 = (1 << i30) + i14 | 0;
+ if (i20 & i29 >>> 0 > 851 | i16 & i29 >>> 0 > 591) {
+ i8 = 1;
+ i6 = 56;
+ break;
+ }
+ HEAP8[(HEAP32[i2 >> 2] | 0) + (i26 << 2) | 0] = i30;
+ HEAP8[(HEAP32[i2 >> 2] | 0) + (i26 << 2) + 1 | 0] = i12;
+ i22 = HEAP32[i2 >> 2] | 0;
+ HEAP16[i22 + (i26 << 2) + 2 >> 1] = (i23 - i22 | 0) >>> 2;
+ i22 = i30;
+ i21 = i28;
+ i13 = i26;
+ i15 = i23;
+ i14 = i29;
+ }
+ if ((i6 | 0) == 56) {
+ STACKTOP = i3;
+ return i8 | 0;
+ }
+ L77 : do {
+ if ((i25 | 0) != 0) {
+ do {
+ if ((i21 | 0) != 0) {
+ if ((i25 & i11 | 0) != (i13 | 0)) {
+ i21 = 0;
+ i22 = i12;
+ i9 = i4;
+ i15 = HEAP32[i2 >> 2] | 0;
+ }
+ } else {
+ i21 = 0;
+ }
+ i5 = i25 >>> i21;
+ HEAP8[i15 + (i5 << 2) | 0] = 64;
+ HEAP8[i15 + (i5 << 2) + 1 | 0] = i22;
+ HEAP16[i15 + (i5 << 2) + 2 >> 1] = 0;
+ i5 = 1 << i9 + -1;
+ while (1) {
+ if ((i5 & i25 | 0) == 0) {
+ break;
+ } else {
+ i5 = i5 >>> 1;
+ }
+ }
+ if ((i5 | 0) == 0) {
+ break L77;
+ }
+ i25 = (i5 + -1 & i25) + i5 | 0;
+ } while ((i25 | 0) != 0);
+ }
+ } while (0);
+ HEAP32[i2 >> 2] = (HEAP32[i2 >> 2] | 0) + (i14 << 2);
+ HEAP32[i1 >> 2] = i4;
+ i33 = 0;
+ STACKTOP = i3;
+ return i33 | 0;
+}
+function _compress_block(i1, i3, i7) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i7 = i7 | 0;
+ var i2 = 0, i4 = 0, i5 = 0, i6 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0;
+ i2 = STACKTOP;
+ i11 = i1 + 5792 | 0;
+ if ((HEAP32[i11 >> 2] | 0) == 0) {
+ i14 = HEAP32[i1 + 5820 >> 2] | 0;
+ i17 = HEAP16[i1 + 5816 >> 1] | 0;
+ } else {
+ i9 = i1 + 5796 | 0;
+ i10 = i1 + 5784 | 0;
+ i8 = i1 + 5820 | 0;
+ i12 = i1 + 5816 | 0;
+ i5 = i1 + 20 | 0;
+ i6 = i1 + 8 | 0;
+ i14 = 0;
+ while (1) {
+ i20 = HEAP16[(HEAP32[i9 >> 2] | 0) + (i14 << 1) >> 1] | 0;
+ i13 = i20 & 65535;
+ i4 = i14 + 1 | 0;
+ i14 = HEAPU8[(HEAP32[i10 >> 2] | 0) + i14 | 0] | 0;
+ do {
+ if (i20 << 16 >> 16 == 0) {
+ i15 = HEAPU16[i3 + (i14 << 2) + 2 >> 1] | 0;
+ i13 = HEAP32[i8 >> 2] | 0;
+ i14 = HEAPU16[i3 + (i14 << 2) >> 1] | 0;
+ i16 = HEAPU16[i12 >> 1] | 0 | i14 << i13;
+ i17 = i16 & 65535;
+ HEAP16[i12 >> 1] = i17;
+ if ((i13 | 0) > (16 - i15 | 0)) {
+ i17 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = i17 + 1;
+ HEAP8[(HEAP32[i6 >> 2] | 0) + i17 | 0] = i16;
+ i17 = (HEAPU16[i12 >> 1] | 0) >>> 8 & 255;
+ i20 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = i20 + 1;
+ HEAP8[(HEAP32[i6 >> 2] | 0) + i20 | 0] = i17;
+ i20 = HEAP32[i8 >> 2] | 0;
+ i17 = i14 >>> (16 - i20 | 0) & 65535;
+ HEAP16[i12 >> 1] = i17;
+ i14 = i15 + -16 + i20 | 0;
+ HEAP32[i8 >> 2] = i14;
+ break;
+ } else {
+ i14 = i13 + i15 | 0;
+ HEAP32[i8 >> 2] = i14;
+ break;
+ }
+ } else {
+ i15 = HEAPU8[808 + i14 | 0] | 0;
+ i19 = (i15 | 256) + 1 | 0;
+ i18 = HEAPU16[i3 + (i19 << 2) + 2 >> 1] | 0;
+ i17 = HEAP32[i8 >> 2] | 0;
+ i19 = HEAPU16[i3 + (i19 << 2) >> 1] | 0;
+ i20 = HEAPU16[i12 >> 1] | 0 | i19 << i17;
+ i16 = i20 & 65535;
+ HEAP16[i12 >> 1] = i16;
+ if ((i17 | 0) > (16 - i18 | 0)) {
+ i16 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = i16 + 1;
+ HEAP8[(HEAP32[i6 >> 2] | 0) + i16 | 0] = i20;
+ i16 = (HEAPU16[i12 >> 1] | 0) >>> 8 & 255;
+ i20 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = i20 + 1;
+ HEAP8[(HEAP32[i6 >> 2] | 0) + i20 | 0] = i16;
+ i20 = HEAP32[i8 >> 2] | 0;
+ i16 = i19 >>> (16 - i20 | 0) & 65535;
+ HEAP16[i12 >> 1] = i16;
+ i18 = i18 + -16 + i20 | 0;
+ } else {
+ i18 = i17 + i18 | 0;
+ }
+ HEAP32[i8 >> 2] = i18;
+ i17 = HEAP32[2408 + (i15 << 2) >> 2] | 0;
+ do {
+ if ((i15 + -8 | 0) >>> 0 < 20) {
+ i14 = i14 - (HEAP32[2528 + (i15 << 2) >> 2] | 0) & 65535;
+ i15 = i14 << i18 | i16 & 65535;
+ i16 = i15 & 65535;
+ HEAP16[i12 >> 1] = i16;
+ if ((i18 | 0) > (16 - i17 | 0)) {
+ i16 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = i16 + 1;
+ HEAP8[(HEAP32[i6 >> 2] | 0) + i16 | 0] = i15;
+ i16 = (HEAPU16[i12 >> 1] | 0) >>> 8 & 255;
+ i20 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = i20 + 1;
+ HEAP8[(HEAP32[i6 >> 2] | 0) + i20 | 0] = i16;
+ i20 = HEAP32[i8 >> 2] | 0;
+ i16 = i14 >>> (16 - i20 | 0) & 65535;
+ HEAP16[i12 >> 1] = i16;
+ i14 = i17 + -16 + i20 | 0;
+ HEAP32[i8 >> 2] = i14;
+ break;
+ } else {
+ i14 = i18 + i17 | 0;
+ HEAP32[i8 >> 2] = i14;
+ break;
+ }
+ } else {
+ i14 = i18;
+ }
+ } while (0);
+ i13 = i13 + -1 | 0;
+ if (i13 >>> 0 < 256) {
+ i15 = i13;
+ } else {
+ i15 = (i13 >>> 7) + 256 | 0;
+ }
+ i15 = HEAPU8[296 + i15 | 0] | 0;
+ i17 = HEAPU16[i7 + (i15 << 2) + 2 >> 1] | 0;
+ i18 = HEAPU16[i7 + (i15 << 2) >> 1] | 0;
+ i19 = i16 & 65535 | i18 << i14;
+ i16 = i19 & 65535;
+ HEAP16[i12 >> 1] = i16;
+ if ((i14 | 0) > (16 - i17 | 0)) {
+ i20 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = i20 + 1;
+ HEAP8[(HEAP32[i6 >> 2] | 0) + i20 | 0] = i19;
+ i20 = (HEAPU16[i12 >> 1] | 0) >>> 8 & 255;
+ i14 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = i14 + 1;
+ HEAP8[(HEAP32[i6 >> 2] | 0) + i14 | 0] = i20;
+ i14 = HEAP32[i8 >> 2] | 0;
+ i20 = i18 >>> (16 - i14 | 0) & 65535;
+ HEAP16[i12 >> 1] = i20;
+ i14 = i17 + -16 + i14 | 0;
+ i17 = i20;
+ } else {
+ i14 = i14 + i17 | 0;
+ i17 = i16;
+ }
+ HEAP32[i8 >> 2] = i14;
+ i16 = HEAP32[2648 + (i15 << 2) >> 2] | 0;
+ if ((i15 + -4 | 0) >>> 0 < 26) {
+ i13 = i13 - (HEAP32[2768 + (i15 << 2) >> 2] | 0) & 65535;
+ i15 = i13 << i14 | i17 & 65535;
+ i17 = i15 & 65535;
+ HEAP16[i12 >> 1] = i17;
+ if ((i14 | 0) > (16 - i16 | 0)) {
+ i17 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = i17 + 1;
+ HEAP8[(HEAP32[i6 >> 2] | 0) + i17 | 0] = i15;
+ i17 = (HEAPU16[i12 >> 1] | 0) >>> 8 & 255;
+ i14 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i5 >> 2] = i14 + 1;
+ HEAP8[(HEAP32[i6 >> 2] | 0) + i14 | 0] = i17;
+ i14 = HEAP32[i8 >> 2] | 0;
+ i17 = i13 >>> (16 - i14 | 0) & 65535;
+ HEAP16[i12 >> 1] = i17;
+ i14 = i16 + -16 + i14 | 0;
+ HEAP32[i8 >> 2] = i14;
+ break;
+ } else {
+ i14 = i14 + i16 | 0;
+ HEAP32[i8 >> 2] = i14;
+ break;
+ }
+ }
+ }
+ } while (0);
+ if (i4 >>> 0 < (HEAP32[i11 >> 2] | 0) >>> 0) {
+ i14 = i4;
+ } else {
+ break;
+ }
+ }
+ }
+ i5 = i3 + 1026 | 0;
+ i6 = HEAPU16[i5 >> 1] | 0;
+ i4 = i1 + 5820 | 0;
+ i3 = HEAPU16[i3 + 1024 >> 1] | 0;
+ i7 = i1 + 5816 | 0;
+ i8 = i17 & 65535 | i3 << i14;
+ HEAP16[i7 >> 1] = i8;
+ if ((i14 | 0) > (16 - i6 | 0)) {
+ i17 = i1 + 20 | 0;
+ i18 = HEAP32[i17 >> 2] | 0;
+ HEAP32[i17 >> 2] = i18 + 1;
+ i20 = i1 + 8 | 0;
+ HEAP8[(HEAP32[i20 >> 2] | 0) + i18 | 0] = i8;
+ i18 = (HEAPU16[i7 >> 1] | 0) >>> 8 & 255;
+ i19 = HEAP32[i17 >> 2] | 0;
+ HEAP32[i17 >> 2] = i19 + 1;
+ HEAP8[(HEAP32[i20 >> 2] | 0) + i19 | 0] = i18;
+ i19 = HEAP32[i4 >> 2] | 0;
+ HEAP16[i7 >> 1] = i3 >>> (16 - i19 | 0);
+ i19 = i6 + -16 + i19 | 0;
+ HEAP32[i4 >> 2] = i19;
+ i19 = HEAP16[i5 >> 1] | 0;
+ i19 = i19 & 65535;
+ i20 = i1 + 5812 | 0;
+ HEAP32[i20 >> 2] = i19;
+ STACKTOP = i2;
+ return;
+ } else {
+ i19 = i14 + i6 | 0;
+ HEAP32[i4 >> 2] = i19;
+ i19 = HEAP16[i5 >> 1] | 0;
+ i19 = i19 & 65535;
+ i20 = i1 + 5812 | 0;
+ HEAP32[i20 >> 2] = i19;
+ STACKTOP = i2;
+ return;
+ }
+}
+function _deflate_stored(i2, i5) {
+ i2 = i2 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i3 = 0, i4 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0;
+ i1 = STACKTOP;
+ i4 = (HEAP32[i2 + 12 >> 2] | 0) + -5 | 0;
+ i11 = i4 >>> 0 < 65535 ? i4 : 65535;
+ i12 = i2 + 116 | 0;
+ i4 = i2 + 108 | 0;
+ i6 = i2 + 92 | 0;
+ i10 = i2 + 44 | 0;
+ i7 = i2 + 56 | 0;
+ while (1) {
+ i13 = HEAP32[i12 >> 2] | 0;
+ if (i13 >>> 0 < 2) {
+ _fill_window(i2);
+ i13 = HEAP32[i12 >> 2] | 0;
+ if ((i13 | i5 | 0) == 0) {
+ i2 = 0;
+ i8 = 28;
+ break;
+ }
+ if ((i13 | 0) == 0) {
+ i8 = 20;
+ break;
+ }
+ }
+ i13 = (HEAP32[i4 >> 2] | 0) + i13 | 0;
+ HEAP32[i4 >> 2] = i13;
+ HEAP32[i12 >> 2] = 0;
+ i14 = HEAP32[i6 >> 2] | 0;
+ i15 = i14 + i11 | 0;
+ if (!((i13 | 0) != 0 & i13 >>> 0 < i15 >>> 0)) {
+ HEAP32[i12 >> 2] = i13 - i15;
+ HEAP32[i4 >> 2] = i15;
+ if ((i14 | 0) > -1) {
+ i13 = (HEAP32[i7 >> 2] | 0) + i14 | 0;
+ } else {
+ i13 = 0;
+ }
+ __tr_flush_block(i2, i13, i11, 0);
+ HEAP32[i6 >> 2] = HEAP32[i4 >> 2];
+ i16 = HEAP32[i2 >> 2] | 0;
+ i14 = i16 + 28 | 0;
+ i15 = HEAP32[i14 >> 2] | 0;
+ i17 = HEAP32[i15 + 20 >> 2] | 0;
+ i13 = i16 + 16 | 0;
+ i18 = HEAP32[i13 >> 2] | 0;
+ i17 = i17 >>> 0 > i18 >>> 0 ? i18 : i17;
+ if ((i17 | 0) != 0 ? (i8 = i16 + 12 | 0, _memcpy(HEAP32[i8 >> 2] | 0, HEAP32[i15 + 16 >> 2] | 0, i17 | 0) | 0, HEAP32[i8 >> 2] = (HEAP32[i8 >> 2] | 0) + i17, i8 = (HEAP32[i14 >> 2] | 0) + 16 | 0, HEAP32[i8 >> 2] = (HEAP32[i8 >> 2] | 0) + i17, i8 = i16 + 20 | 0, HEAP32[i8 >> 2] = (HEAP32[i8 >> 2] | 0) + i17, HEAP32[i13 >> 2] = (HEAP32[i13 >> 2] | 0) - i17, i8 = HEAP32[i14 >> 2] | 0, i16 = i8 + 20 | 0, i18 = HEAP32[i16 >> 2] | 0, HEAP32[i16 >> 2] = i18 - i17, (i18 | 0) == (i17 | 0)) : 0) {
+ HEAP32[i8 + 16 >> 2] = HEAP32[i8 + 8 >> 2];
+ }
+ if ((HEAP32[(HEAP32[i2 >> 2] | 0) + 16 >> 2] | 0) == 0) {
+ i2 = 0;
+ i8 = 28;
+ break;
+ }
+ i14 = HEAP32[i6 >> 2] | 0;
+ i13 = HEAP32[i4 >> 2] | 0;
+ }
+ i13 = i13 - i14 | 0;
+ if (i13 >>> 0 < ((HEAP32[i10 >> 2] | 0) + -262 | 0) >>> 0) {
+ continue;
+ }
+ if ((i14 | 0) > -1) {
+ i14 = (HEAP32[i7 >> 2] | 0) + i14 | 0;
+ } else {
+ i14 = 0;
+ }
+ __tr_flush_block(i2, i14, i13, 0);
+ HEAP32[i6 >> 2] = HEAP32[i4 >> 2];
+ i16 = HEAP32[i2 >> 2] | 0;
+ i14 = i16 + 28 | 0;
+ i15 = HEAP32[i14 >> 2] | 0;
+ i17 = HEAP32[i15 + 20 >> 2] | 0;
+ i13 = i16 + 16 | 0;
+ i18 = HEAP32[i13 >> 2] | 0;
+ i17 = i17 >>> 0 > i18 >>> 0 ? i18 : i17;
+ if ((i17 | 0) != 0 ? (i9 = i16 + 12 | 0, _memcpy(HEAP32[i9 >> 2] | 0, HEAP32[i15 + 16 >> 2] | 0, i17 | 0) | 0, HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + i17, i9 = (HEAP32[i14 >> 2] | 0) + 16 | 0, HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + i17, i9 = i16 + 20 | 0, HEAP32[i9 >> 2] = (HEAP32[i9 >> 2] | 0) + i17, HEAP32[i13 >> 2] = (HEAP32[i13 >> 2] | 0) - i17, i9 = HEAP32[i14 >> 2] | 0, i16 = i9 + 20 | 0, i18 = HEAP32[i16 >> 2] | 0, HEAP32[i16 >> 2] = i18 - i17, (i18 | 0) == (i17 | 0)) : 0) {
+ HEAP32[i9 + 16 >> 2] = HEAP32[i9 + 8 >> 2];
+ }
+ if ((HEAP32[(HEAP32[i2 >> 2] | 0) + 16 >> 2] | 0) == 0) {
+ i2 = 0;
+ i8 = 28;
+ break;
+ }
+ }
+ if ((i8 | 0) == 20) {
+ i8 = HEAP32[i6 >> 2] | 0;
+ if ((i8 | 0) > -1) {
+ i7 = (HEAP32[i7 >> 2] | 0) + i8 | 0;
+ } else {
+ i7 = 0;
+ }
+ i5 = (i5 | 0) == 4;
+ __tr_flush_block(i2, i7, (HEAP32[i4 >> 2] | 0) - i8 | 0, i5 & 1);
+ HEAP32[i6 >> 2] = HEAP32[i4 >> 2];
+ i4 = HEAP32[i2 >> 2] | 0;
+ i7 = i4 + 28 | 0;
+ i6 = HEAP32[i7 >> 2] | 0;
+ i9 = HEAP32[i6 + 20 >> 2] | 0;
+ i8 = i4 + 16 | 0;
+ i10 = HEAP32[i8 >> 2] | 0;
+ i9 = i9 >>> 0 > i10 >>> 0 ? i10 : i9;
+ if ((i9 | 0) != 0 ? (i3 = i4 + 12 | 0, _memcpy(HEAP32[i3 >> 2] | 0, HEAP32[i6 + 16 >> 2] | 0, i9 | 0) | 0, HEAP32[i3 >> 2] = (HEAP32[i3 >> 2] | 0) + i9, i3 = (HEAP32[i7 >> 2] | 0) + 16 | 0, HEAP32[i3 >> 2] = (HEAP32[i3 >> 2] | 0) + i9, i3 = i4 + 20 | 0, HEAP32[i3 >> 2] = (HEAP32[i3 >> 2] | 0) + i9, HEAP32[i8 >> 2] = (HEAP32[i8 >> 2] | 0) - i9, i3 = HEAP32[i7 >> 2] | 0, i17 = i3 + 20 | 0, i18 = HEAP32[i17 >> 2] | 0, HEAP32[i17 >> 2] = i18 - i9, (i18 | 0) == (i9 | 0)) : 0) {
+ HEAP32[i3 + 16 >> 2] = HEAP32[i3 + 8 >> 2];
+ }
+ if ((HEAP32[(HEAP32[i2 >> 2] | 0) + 16 >> 2] | 0) == 0) {
+ i18 = i5 ? 2 : 0;
+ STACKTOP = i1;
+ return i18 | 0;
+ } else {
+ i18 = i5 ? 3 : 1;
+ STACKTOP = i1;
+ return i18 | 0;
+ }
+ } else if ((i8 | 0) == 28) {
+ STACKTOP = i1;
+ return i2 | 0;
+ }
+ return 0;
+}
+function _fill_window(i15) {
+ i15 = i15 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0;
+ i2 = STACKTOP;
+ i16 = i15 + 44 | 0;
+ i9 = HEAP32[i16 >> 2] | 0;
+ i4 = i15 + 60 | 0;
+ i8 = i15 + 116 | 0;
+ i3 = i15 + 108 | 0;
+ i5 = i9 + -262 | 0;
+ i1 = i15 + 56 | 0;
+ i17 = i15 + 72 | 0;
+ i6 = i15 + 88 | 0;
+ i7 = i15 + 84 | 0;
+ i11 = i15 + 112 | 0;
+ i12 = i15 + 92 | 0;
+ i13 = i15 + 76 | 0;
+ i14 = i15 + 68 | 0;
+ i10 = i15 + 64 | 0;
+ i19 = HEAP32[i8 >> 2] | 0;
+ i21 = i9;
+ while (1) {
+ i20 = HEAP32[i3 >> 2] | 0;
+ i19 = (HEAP32[i4 >> 2] | 0) - i19 - i20 | 0;
+ if (!(i20 >>> 0 < (i5 + i21 | 0) >>> 0)) {
+ i20 = HEAP32[i1 >> 2] | 0;
+ _memcpy(i20 | 0, i20 + i9 | 0, i9 | 0) | 0;
+ HEAP32[i11 >> 2] = (HEAP32[i11 >> 2] | 0) - i9;
+ i20 = (HEAP32[i3 >> 2] | 0) - i9 | 0;
+ HEAP32[i3 >> 2] = i20;
+ HEAP32[i12 >> 2] = (HEAP32[i12 >> 2] | 0) - i9;
+ i22 = HEAP32[i13 >> 2] | 0;
+ i21 = i22;
+ i22 = (HEAP32[i14 >> 2] | 0) + (i22 << 1) | 0;
+ do {
+ i22 = i22 + -2 | 0;
+ i23 = HEAPU16[i22 >> 1] | 0;
+ if (i23 >>> 0 < i9 >>> 0) {
+ i23 = 0;
+ } else {
+ i23 = i23 - i9 & 65535;
+ }
+ HEAP16[i22 >> 1] = i23;
+ i21 = i21 + -1 | 0;
+ } while ((i21 | 0) != 0);
+ i22 = i9;
+ i21 = (HEAP32[i10 >> 2] | 0) + (i9 << 1) | 0;
+ do {
+ i21 = i21 + -2 | 0;
+ i23 = HEAPU16[i21 >> 1] | 0;
+ if (i23 >>> 0 < i9 >>> 0) {
+ i23 = 0;
+ } else {
+ i23 = i23 - i9 & 65535;
+ }
+ HEAP16[i21 >> 1] = i23;
+ i22 = i22 + -1 | 0;
+ } while ((i22 | 0) != 0);
+ i19 = i19 + i9 | 0;
+ }
+ i21 = HEAP32[i15 >> 2] | 0;
+ i24 = i21 + 4 | 0;
+ i23 = HEAP32[i24 >> 2] | 0;
+ if ((i23 | 0) == 0) {
+ i18 = 28;
+ break;
+ }
+ i22 = HEAP32[i8 >> 2] | 0;
+ i20 = (HEAP32[i1 >> 2] | 0) + (i22 + i20) | 0;
+ i19 = i23 >>> 0 > i19 >>> 0 ? i19 : i23;
+ if ((i19 | 0) == 0) {
+ i19 = 0;
+ } else {
+ HEAP32[i24 >> 2] = i23 - i19;
+ i22 = HEAP32[(HEAP32[i21 + 28 >> 2] | 0) + 24 >> 2] | 0;
+ if ((i22 | 0) == 1) {
+ i22 = i21 + 48 | 0;
+ HEAP32[i22 >> 2] = _adler32(HEAP32[i22 >> 2] | 0, HEAP32[i21 >> 2] | 0, i19) | 0;
+ i22 = i21;
+ } else if ((i22 | 0) == 2) {
+ i22 = i21 + 48 | 0;
+ HEAP32[i22 >> 2] = _crc32(HEAP32[i22 >> 2] | 0, HEAP32[i21 >> 2] | 0, i19) | 0;
+ i22 = i21;
+ } else {
+ i22 = i21;
+ }
+ _memcpy(i20 | 0, HEAP32[i22 >> 2] | 0, i19 | 0) | 0;
+ HEAP32[i22 >> 2] = (HEAP32[i22 >> 2] | 0) + i19;
+ i22 = i21 + 8 | 0;
+ HEAP32[i22 >> 2] = (HEAP32[i22 >> 2] | 0) + i19;
+ i22 = HEAP32[i8 >> 2] | 0;
+ }
+ i19 = i22 + i19 | 0;
+ HEAP32[i8 >> 2] = i19;
+ if (i19 >>> 0 > 2 ? (i23 = HEAP32[i3 >> 2] | 0, i22 = HEAP32[i1 >> 2] | 0, i24 = HEAPU8[i22 + i23 | 0] | 0, HEAP32[i17 >> 2] = i24, HEAP32[i17 >> 2] = ((HEAPU8[i22 + (i23 + 1) | 0] | 0) ^ i24 << HEAP32[i6 >> 2]) & HEAP32[i7 >> 2], !(i19 >>> 0 < 262)) : 0) {
+ break;
+ }
+ if ((HEAP32[(HEAP32[i15 >> 2] | 0) + 4 >> 2] | 0) == 0) {
+ break;
+ }
+ i21 = HEAP32[i16 >> 2] | 0;
+ }
+ if ((i18 | 0) == 28) {
+ STACKTOP = i2;
+ return;
+ }
+ i5 = i15 + 5824 | 0;
+ i6 = HEAP32[i5 >> 2] | 0;
+ i4 = HEAP32[i4 >> 2] | 0;
+ if (!(i6 >>> 0 < i4 >>> 0)) {
+ STACKTOP = i2;
+ return;
+ }
+ i3 = i19 + (HEAP32[i3 >> 2] | 0) | 0;
+ if (i6 >>> 0 < i3 >>> 0) {
+ i4 = i4 - i3 | 0;
+ i24 = i4 >>> 0 > 258 ? 258 : i4;
+ _memset((HEAP32[i1 >> 2] | 0) + i3 | 0, 0, i24 | 0) | 0;
+ HEAP32[i5 >> 2] = i24 + i3;
+ STACKTOP = i2;
+ return;
+ }
+ i3 = i3 + 258 | 0;
+ if (!(i6 >>> 0 < i3 >>> 0)) {
+ STACKTOP = i2;
+ return;
+ }
+ i3 = i3 - i6 | 0;
+ i4 = i4 - i6 | 0;
+ i24 = i3 >>> 0 > i4 >>> 0 ? i4 : i3;
+ _memset((HEAP32[i1 >> 2] | 0) + i6 | 0, 0, i24 | 0) | 0;
+ HEAP32[i5 >> 2] = (HEAP32[i5 >> 2] | 0) + i24;
+ STACKTOP = i2;
+ return;
+}
+function __tr_align(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0;
+ i2 = STACKTOP;
+ i3 = i1 + 5820 | 0;
+ i6 = HEAP32[i3 >> 2] | 0;
+ i4 = i1 + 5816 | 0;
+ i7 = HEAPU16[i4 >> 1] | 0 | 2 << i6;
+ i5 = i7 & 65535;
+ HEAP16[i4 >> 1] = i5;
+ if ((i6 | 0) > 13) {
+ i8 = i1 + 20 | 0;
+ i6 = HEAP32[i8 >> 2] | 0;
+ HEAP32[i8 >> 2] = i6 + 1;
+ i5 = i1 + 8 | 0;
+ HEAP8[(HEAP32[i5 >> 2] | 0) + i6 | 0] = i7;
+ i7 = (HEAPU16[i4 >> 1] | 0) >>> 8 & 255;
+ i6 = HEAP32[i8 >> 2] | 0;
+ HEAP32[i8 >> 2] = i6 + 1;
+ HEAP8[(HEAP32[i5 >> 2] | 0) + i6 | 0] = i7;
+ i6 = HEAP32[i3 >> 2] | 0;
+ i5 = 2 >>> (16 - i6 | 0) & 65535;
+ HEAP16[i4 >> 1] = i5;
+ i6 = i6 + -13 | 0;
+ } else {
+ i6 = i6 + 3 | 0;
+ }
+ HEAP32[i3 >> 2] = i6;
+ if ((i6 | 0) > 9) {
+ i7 = i1 + 20 | 0;
+ i6 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = i6 + 1;
+ i8 = i1 + 8 | 0;
+ HEAP8[(HEAP32[i8 >> 2] | 0) + i6 | 0] = i5;
+ i5 = (HEAPU16[i4 >> 1] | 0) >>> 8 & 255;
+ i6 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = i6 + 1;
+ HEAP8[(HEAP32[i8 >> 2] | 0) + i6 | 0] = i5;
+ HEAP16[i4 >> 1] = 0;
+ i6 = (HEAP32[i3 >> 2] | 0) + -9 | 0;
+ i5 = 0;
+ } else {
+ i6 = i6 + 7 | 0;
+ }
+ HEAP32[i3 >> 2] = i6;
+ if ((i6 | 0) != 16) {
+ if ((i6 | 0) > 7) {
+ i6 = i1 + 20 | 0;
+ i7 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i6 >> 2] = i7 + 1;
+ HEAP8[(HEAP32[i1 + 8 >> 2] | 0) + i7 | 0] = i5;
+ i7 = (HEAPU16[i4 >> 1] | 0) >>> 8;
+ HEAP16[i4 >> 1] = i7;
+ i6 = (HEAP32[i3 >> 2] | 0) + -8 | 0;
+ HEAP32[i3 >> 2] = i6;
+ } else {
+ i7 = i5;
+ }
+ } else {
+ i9 = i1 + 20 | 0;
+ i8 = HEAP32[i9 >> 2] | 0;
+ HEAP32[i9 >> 2] = i8 + 1;
+ i7 = i1 + 8 | 0;
+ HEAP8[(HEAP32[i7 >> 2] | 0) + i8 | 0] = i5;
+ i8 = (HEAPU16[i4 >> 1] | 0) >>> 8 & 255;
+ i6 = HEAP32[i9 >> 2] | 0;
+ HEAP32[i9 >> 2] = i6 + 1;
+ HEAP8[(HEAP32[i7 >> 2] | 0) + i6 | 0] = i8;
+ HEAP16[i4 >> 1] = 0;
+ HEAP32[i3 >> 2] = 0;
+ i6 = 0;
+ i7 = 0;
+ }
+ i5 = i1 + 5812 | 0;
+ if ((11 - i6 + (HEAP32[i5 >> 2] | 0) | 0) >= 9) {
+ HEAP32[i5 >> 2] = 7;
+ STACKTOP = i2;
+ return;
+ }
+ i7 = i7 & 65535 | 2 << i6;
+ HEAP16[i4 >> 1] = i7;
+ if ((i6 | 0) > 13) {
+ i8 = i1 + 20 | 0;
+ i6 = HEAP32[i8 >> 2] | 0;
+ HEAP32[i8 >> 2] = i6 + 1;
+ i9 = i1 + 8 | 0;
+ HEAP8[(HEAP32[i9 >> 2] | 0) + i6 | 0] = i7;
+ i7 = (HEAPU16[i4 >> 1] | 0) >>> 8 & 255;
+ i6 = HEAP32[i8 >> 2] | 0;
+ HEAP32[i8 >> 2] = i6 + 1;
+ HEAP8[(HEAP32[i9 >> 2] | 0) + i6 | 0] = i7;
+ i6 = HEAP32[i3 >> 2] | 0;
+ i7 = 2 >>> (16 - i6 | 0);
+ HEAP16[i4 >> 1] = i7;
+ i6 = i6 + -13 | 0;
+ } else {
+ i6 = i6 + 3 | 0;
+ }
+ i7 = i7 & 255;
+ HEAP32[i3 >> 2] = i6;
+ if ((i6 | 0) > 9) {
+ i8 = i1 + 20 | 0;
+ i9 = HEAP32[i8 >> 2] | 0;
+ HEAP32[i8 >> 2] = i9 + 1;
+ i6 = i1 + 8 | 0;
+ HEAP8[(HEAP32[i6 >> 2] | 0) + i9 | 0] = i7;
+ i9 = (HEAPU16[i4 >> 1] | 0) >>> 8 & 255;
+ i7 = HEAP32[i8 >> 2] | 0;
+ HEAP32[i8 >> 2] = i7 + 1;
+ HEAP8[(HEAP32[i6 >> 2] | 0) + i7 | 0] = i9;
+ HEAP16[i4 >> 1] = 0;
+ i7 = 0;
+ i6 = (HEAP32[i3 >> 2] | 0) + -9 | 0;
+ } else {
+ i6 = i6 + 7 | 0;
+ }
+ HEAP32[i3 >> 2] = i6;
+ if ((i6 | 0) == 16) {
+ i6 = i1 + 20 | 0;
+ i9 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i6 >> 2] = i9 + 1;
+ i8 = i1 + 8 | 0;
+ HEAP8[(HEAP32[i8 >> 2] | 0) + i9 | 0] = i7;
+ i7 = (HEAPU16[i4 >> 1] | 0) >>> 8 & 255;
+ i9 = HEAP32[i6 >> 2] | 0;
+ HEAP32[i6 >> 2] = i9 + 1;
+ HEAP8[(HEAP32[i8 >> 2] | 0) + i9 | 0] = i7;
+ HEAP16[i4 >> 1] = 0;
+ HEAP32[i3 >> 2] = 0;
+ HEAP32[i5 >> 2] = 7;
+ STACKTOP = i2;
+ return;
+ }
+ if ((i6 | 0) <= 7) {
+ HEAP32[i5 >> 2] = 7;
+ STACKTOP = i2;
+ return;
+ }
+ i8 = i1 + 20 | 0;
+ i9 = HEAP32[i8 >> 2] | 0;
+ HEAP32[i8 >> 2] = i9 + 1;
+ HEAP8[(HEAP32[i1 + 8 >> 2] | 0) + i9 | 0] = i7;
+ HEAP16[i4 >> 1] = (HEAPU16[i4 >> 1] | 0) >>> 8;
+ HEAP32[i3 >> 2] = (HEAP32[i3 >> 2] | 0) + -8;
+ HEAP32[i5 >> 2] = 7;
+ STACKTOP = i2;
+ return;
+}
+function _adler32(i6, i4, i5) {
+ i6 = i6 | 0;
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0;
+ i1 = STACKTOP;
+ i3 = i6 >>> 16;
+ i6 = i6 & 65535;
+ if ((i5 | 0) == 1) {
+ i2 = (HEAPU8[i4] | 0) + i6 | 0;
+ i2 = i2 >>> 0 > 65520 ? i2 + -65521 | 0 : i2;
+ i3 = i2 + i3 | 0;
+ i8 = (i3 >>> 0 > 65520 ? i3 + 15 | 0 : i3) << 16 | i2;
+ STACKTOP = i1;
+ return i8 | 0;
+ }
+ if ((i4 | 0) == 0) {
+ i8 = 1;
+ STACKTOP = i1;
+ return i8 | 0;
+ }
+ if (i5 >>> 0 < 16) {
+ if ((i5 | 0) != 0) {
+ while (1) {
+ i5 = i5 + -1 | 0;
+ i6 = (HEAPU8[i4] | 0) + i6 | 0;
+ i3 = i6 + i3 | 0;
+ if ((i5 | 0) == 0) {
+ break;
+ } else {
+ i4 = i4 + 1 | 0;
+ }
+ }
+ }
+ i8 = ((i3 >>> 0) % 65521 | 0) << 16 | (i6 >>> 0 > 65520 ? i6 + -65521 | 0 : i6);
+ STACKTOP = i1;
+ return i8 | 0;
+ }
+ if (i5 >>> 0 > 5551) {
+ do {
+ i5 = i5 + -5552 | 0;
+ i7 = i4;
+ i8 = 347;
+ while (1) {
+ i23 = (HEAPU8[i7] | 0) + i6 | 0;
+ i22 = i23 + (HEAPU8[i7 + 1 | 0] | 0) | 0;
+ i21 = i22 + (HEAPU8[i7 + 2 | 0] | 0) | 0;
+ i20 = i21 + (HEAPU8[i7 + 3 | 0] | 0) | 0;
+ i19 = i20 + (HEAPU8[i7 + 4 | 0] | 0) | 0;
+ i18 = i19 + (HEAPU8[i7 + 5 | 0] | 0) | 0;
+ i17 = i18 + (HEAPU8[i7 + 6 | 0] | 0) | 0;
+ i16 = i17 + (HEAPU8[i7 + 7 | 0] | 0) | 0;
+ i15 = i16 + (HEAPU8[i7 + 8 | 0] | 0) | 0;
+ i14 = i15 + (HEAPU8[i7 + 9 | 0] | 0) | 0;
+ i13 = i14 + (HEAPU8[i7 + 10 | 0] | 0) | 0;
+ i12 = i13 + (HEAPU8[i7 + 11 | 0] | 0) | 0;
+ i11 = i12 + (HEAPU8[i7 + 12 | 0] | 0) | 0;
+ i10 = i11 + (HEAPU8[i7 + 13 | 0] | 0) | 0;
+ i9 = i10 + (HEAPU8[i7 + 14 | 0] | 0) | 0;
+ i6 = i9 + (HEAPU8[i7 + 15 | 0] | 0) | 0;
+ i3 = i23 + i3 + i22 + i21 + i20 + i19 + i18 + i17 + i16 + i15 + i14 + i13 + i12 + i11 + i10 + i9 + i6 | 0;
+ i8 = i8 + -1 | 0;
+ if ((i8 | 0) == 0) {
+ break;
+ } else {
+ i7 = i7 + 16 | 0;
+ }
+ }
+ i4 = i4 + 5552 | 0;
+ i6 = (i6 >>> 0) % 65521 | 0;
+ i3 = (i3 >>> 0) % 65521 | 0;
+ } while (i5 >>> 0 > 5551);
+ if ((i5 | 0) != 0) {
+ if (i5 >>> 0 > 15) {
+ i2 = 15;
+ } else {
+ i2 = 16;
+ }
+ }
+ } else {
+ i2 = 15;
+ }
+ if ((i2 | 0) == 15) {
+ while (1) {
+ i5 = i5 + -16 | 0;
+ i9 = (HEAPU8[i4] | 0) + i6 | 0;
+ i10 = i9 + (HEAPU8[i4 + 1 | 0] | 0) | 0;
+ i11 = i10 + (HEAPU8[i4 + 2 | 0] | 0) | 0;
+ i12 = i11 + (HEAPU8[i4 + 3 | 0] | 0) | 0;
+ i13 = i12 + (HEAPU8[i4 + 4 | 0] | 0) | 0;
+ i14 = i13 + (HEAPU8[i4 + 5 | 0] | 0) | 0;
+ i15 = i14 + (HEAPU8[i4 + 6 | 0] | 0) | 0;
+ i16 = i15 + (HEAPU8[i4 + 7 | 0] | 0) | 0;
+ i17 = i16 + (HEAPU8[i4 + 8 | 0] | 0) | 0;
+ i18 = i17 + (HEAPU8[i4 + 9 | 0] | 0) | 0;
+ i19 = i18 + (HEAPU8[i4 + 10 | 0] | 0) | 0;
+ i20 = i19 + (HEAPU8[i4 + 11 | 0] | 0) | 0;
+ i21 = i20 + (HEAPU8[i4 + 12 | 0] | 0) | 0;
+ i22 = i21 + (HEAPU8[i4 + 13 | 0] | 0) | 0;
+ i23 = i22 + (HEAPU8[i4 + 14 | 0] | 0) | 0;
+ i6 = i23 + (HEAPU8[i4 + 15 | 0] | 0) | 0;
+ i3 = i9 + i3 + i10 + i11 + i12 + i13 + i14 + i15 + i16 + i17 + i18 + i19 + i20 + i21 + i22 + i23 + i6 | 0;
+ i4 = i4 + 16 | 0;
+ if (!(i5 >>> 0 > 15)) {
+ break;
+ } else {
+ i2 = 15;
+ }
+ }
+ if ((i5 | 0) == 0) {
+ i2 = 17;
+ } else {
+ i2 = 16;
+ }
+ }
+ if ((i2 | 0) == 16) {
+ while (1) {
+ i5 = i5 + -1 | 0;
+ i6 = (HEAPU8[i4] | 0) + i6 | 0;
+ i3 = i6 + i3 | 0;
+ if ((i5 | 0) == 0) {
+ i2 = 17;
+ break;
+ } else {
+ i4 = i4 + 1 | 0;
+ i2 = 16;
+ }
+ }
+ }
+ if ((i2 | 0) == 17) {
+ i6 = (i6 >>> 0) % 65521 | 0;
+ i3 = (i3 >>> 0) % 65521 | 0;
+ }
+ i23 = i3 << 16 | i6;
+ STACKTOP = i1;
+ return i23 | 0;
+}
+function _crc32(i4, i2, i3) {
+ i4 = i4 | 0;
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ var i1 = 0, i5 = 0;
+ i1 = STACKTOP;
+ if ((i2 | 0) == 0) {
+ i5 = 0;
+ STACKTOP = i1;
+ return i5 | 0;
+ }
+ i4 = ~i4;
+ L4 : do {
+ if ((i3 | 0) != 0) {
+ while (1) {
+ if ((i2 & 3 | 0) == 0) {
+ break;
+ }
+ i4 = HEAP32[3192 + (((HEAPU8[i2] | 0) ^ i4 & 255) << 2) >> 2] ^ i4 >>> 8;
+ i3 = i3 + -1 | 0;
+ if ((i3 | 0) == 0) {
+ break L4;
+ } else {
+ i2 = i2 + 1 | 0;
+ }
+ }
+ if (i3 >>> 0 > 31) {
+ while (1) {
+ i4 = HEAP32[i2 >> 2] ^ i4;
+ i4 = HEAP32[5240 + ((i4 >>> 8 & 255) << 2) >> 2] ^ HEAP32[6264 + ((i4 & 255) << 2) >> 2] ^ HEAP32[4216 + ((i4 >>> 16 & 255) << 2) >> 2] ^ HEAP32[3192 + (i4 >>> 24 << 2) >> 2] ^ HEAP32[i2 + 4 >> 2];
+ i4 = HEAP32[5240 + ((i4 >>> 8 & 255) << 2) >> 2] ^ HEAP32[6264 + ((i4 & 255) << 2) >> 2] ^ HEAP32[4216 + ((i4 >>> 16 & 255) << 2) >> 2] ^ HEAP32[3192 + (i4 >>> 24 << 2) >> 2] ^ HEAP32[i2 + 8 >> 2];
+ i4 = HEAP32[5240 + ((i4 >>> 8 & 255) << 2) >> 2] ^ HEAP32[6264 + ((i4 & 255) << 2) >> 2] ^ HEAP32[4216 + ((i4 >>> 16 & 255) << 2) >> 2] ^ HEAP32[3192 + (i4 >>> 24 << 2) >> 2] ^ HEAP32[i2 + 12 >> 2];
+ i4 = HEAP32[5240 + ((i4 >>> 8 & 255) << 2) >> 2] ^ HEAP32[6264 + ((i4 & 255) << 2) >> 2] ^ HEAP32[4216 + ((i4 >>> 16 & 255) << 2) >> 2] ^ HEAP32[3192 + (i4 >>> 24 << 2) >> 2] ^ HEAP32[i2 + 16 >> 2];
+ i4 = HEAP32[5240 + ((i4 >>> 8 & 255) << 2) >> 2] ^ HEAP32[6264 + ((i4 & 255) << 2) >> 2] ^ HEAP32[4216 + ((i4 >>> 16 & 255) << 2) >> 2] ^ HEAP32[3192 + (i4 >>> 24 << 2) >> 2] ^ HEAP32[i2 + 20 >> 2];
+ i4 = HEAP32[5240 + ((i4 >>> 8 & 255) << 2) >> 2] ^ HEAP32[6264 + ((i4 & 255) << 2) >> 2] ^ HEAP32[4216 + ((i4 >>> 16 & 255) << 2) >> 2] ^ HEAP32[3192 + (i4 >>> 24 << 2) >> 2] ^ HEAP32[i2 + 24 >> 2];
+ i5 = i2 + 32 | 0;
+ i4 = HEAP32[5240 + ((i4 >>> 8 & 255) << 2) >> 2] ^ HEAP32[6264 + ((i4 & 255) << 2) >> 2] ^ HEAP32[4216 + ((i4 >>> 16 & 255) << 2) >> 2] ^ HEAP32[3192 + (i4 >>> 24 << 2) >> 2] ^ HEAP32[i2 + 28 >> 2];
+ i4 = HEAP32[5240 + ((i4 >>> 8 & 255) << 2) >> 2] ^ HEAP32[6264 + ((i4 & 255) << 2) >> 2] ^ HEAP32[4216 + ((i4 >>> 16 & 255) << 2) >> 2] ^ HEAP32[3192 + (i4 >>> 24 << 2) >> 2];
+ i3 = i3 + -32 | 0;
+ if (i3 >>> 0 > 31) {
+ i2 = i5;
+ } else {
+ i2 = i5;
+ break;
+ }
+ }
+ }
+ if (i3 >>> 0 > 3) {
+ while (1) {
+ i5 = i2 + 4 | 0;
+ i4 = HEAP32[i2 >> 2] ^ i4;
+ i4 = HEAP32[5240 + ((i4 >>> 8 & 255) << 2) >> 2] ^ HEAP32[6264 + ((i4 & 255) << 2) >> 2] ^ HEAP32[4216 + ((i4 >>> 16 & 255) << 2) >> 2] ^ HEAP32[3192 + (i4 >>> 24 << 2) >> 2];
+ i3 = i3 + -4 | 0;
+ if (i3 >>> 0 > 3) {
+ i2 = i5;
+ } else {
+ i2 = i5;
+ break;
+ }
+ }
+ }
+ if ((i3 | 0) != 0) {
+ while (1) {
+ i4 = HEAP32[3192 + (((HEAPU8[i2] | 0) ^ i4 & 255) << 2) >> 2] ^ i4 >>> 8;
+ i3 = i3 + -1 | 0;
+ if ((i3 | 0) == 0) {
+ break;
+ } else {
+ i2 = i2 + 1 | 0;
+ }
+ }
+ }
+ }
+ } while (0);
+ i5 = ~i4;
+ STACKTOP = i1;
+ return i5 | 0;
+}
+function _deflateInit2_(i3, i7, i8, i10, i4, i1, i5, i6) {
+ i3 = i3 | 0;
+ i7 = i7 | 0;
+ i8 = i8 | 0;
+ i10 = i10 | 0;
+ i4 = i4 | 0;
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ i6 = i6 | 0;
+ var i2 = 0, i9 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0;
+ i2 = STACKTOP;
+ if ((i5 | 0) == 0) {
+ i12 = -6;
+ STACKTOP = i2;
+ return i12 | 0;
+ }
+ if (!((HEAP8[i5] | 0) == 49 & (i6 | 0) == 56)) {
+ i12 = -6;
+ STACKTOP = i2;
+ return i12 | 0;
+ }
+ if ((i3 | 0) == 0) {
+ i12 = -2;
+ STACKTOP = i2;
+ return i12 | 0;
+ }
+ i5 = i3 + 24 | 0;
+ HEAP32[i5 >> 2] = 0;
+ i6 = i3 + 32 | 0;
+ i9 = HEAP32[i6 >> 2] | 0;
+ if ((i9 | 0) == 0) {
+ HEAP32[i6 >> 2] = 1;
+ HEAP32[i3 + 40 >> 2] = 0;
+ i9 = 1;
+ }
+ i11 = i3 + 36 | 0;
+ if ((HEAP32[i11 >> 2] | 0) == 0) {
+ HEAP32[i11 >> 2] = 1;
+ }
+ i7 = (i7 | 0) == -1 ? 6 : i7;
+ if ((i10 | 0) < 0) {
+ i10 = 0 - i10 | 0;
+ i11 = 0;
+ } else {
+ i11 = (i10 | 0) > 15;
+ i10 = i11 ? i10 + -16 | 0 : i10;
+ i11 = i11 ? 2 : 1;
+ }
+ if (!((i4 + -1 | 0) >>> 0 < 9 & (i8 | 0) == 8)) {
+ i12 = -2;
+ STACKTOP = i2;
+ return i12 | 0;
+ }
+ if ((i10 + -8 | 0) >>> 0 > 7 | i7 >>> 0 > 9 | i1 >>> 0 > 4) {
+ i12 = -2;
+ STACKTOP = i2;
+ return i12 | 0;
+ }
+ i12 = (i10 | 0) == 8 ? 9 : i10;
+ i10 = i3 + 40 | 0;
+ i8 = FUNCTION_TABLE_iiii[i9 & 1](HEAP32[i10 >> 2] | 0, 1, 5828) | 0;
+ if ((i8 | 0) == 0) {
+ i12 = -4;
+ STACKTOP = i2;
+ return i12 | 0;
+ }
+ HEAP32[i3 + 28 >> 2] = i8;
+ HEAP32[i8 >> 2] = i3;
+ HEAP32[i8 + 24 >> 2] = i11;
+ HEAP32[i8 + 28 >> 2] = 0;
+ HEAP32[i8 + 48 >> 2] = i12;
+ i14 = 1 << i12;
+ i11 = i8 + 44 | 0;
+ HEAP32[i11 >> 2] = i14;
+ HEAP32[i8 + 52 >> 2] = i14 + -1;
+ i12 = i4 + 7 | 0;
+ HEAP32[i8 + 80 >> 2] = i12;
+ i12 = 1 << i12;
+ i13 = i8 + 76 | 0;
+ HEAP32[i13 >> 2] = i12;
+ HEAP32[i8 + 84 >> 2] = i12 + -1;
+ HEAP32[i8 + 88 >> 2] = ((i4 + 9 | 0) >>> 0) / 3 | 0;
+ i12 = i8 + 56 | 0;
+ HEAP32[i12 >> 2] = FUNCTION_TABLE_iiii[HEAP32[i6 >> 2] & 1](HEAP32[i10 >> 2] | 0, i14, 2) | 0;
+ i14 = FUNCTION_TABLE_iiii[HEAP32[i6 >> 2] & 1](HEAP32[i10 >> 2] | 0, HEAP32[i11 >> 2] | 0, 2) | 0;
+ i9 = i8 + 64 | 0;
+ HEAP32[i9 >> 2] = i14;
+ _memset(i14 | 0, 0, HEAP32[i11 >> 2] << 1 | 0) | 0;
+ i11 = i8 + 68 | 0;
+ HEAP32[i11 >> 2] = FUNCTION_TABLE_iiii[HEAP32[i6 >> 2] & 1](HEAP32[i10 >> 2] | 0, HEAP32[i13 >> 2] | 0, 2) | 0;
+ HEAP32[i8 + 5824 >> 2] = 0;
+ i4 = 1 << i4 + 6;
+ i13 = i8 + 5788 | 0;
+ HEAP32[i13 >> 2] = i4;
+ i4 = FUNCTION_TABLE_iiii[HEAP32[i6 >> 2] & 1](HEAP32[i10 >> 2] | 0, i4, 4) | 0;
+ HEAP32[i8 + 8 >> 2] = i4;
+ i6 = HEAP32[i13 >> 2] | 0;
+ HEAP32[i8 + 12 >> 2] = i6 << 2;
+ if (((HEAP32[i12 >> 2] | 0) != 0 ? (HEAP32[i9 >> 2] | 0) != 0 : 0) ? !((HEAP32[i11 >> 2] | 0) == 0 | (i4 | 0) == 0) : 0) {
+ HEAP32[i8 + 5796 >> 2] = i4 + (i6 >>> 1 << 1);
+ HEAP32[i8 + 5784 >> 2] = i4 + (i6 * 3 | 0);
+ HEAP32[i8 + 132 >> 2] = i7;
+ HEAP32[i8 + 136 >> 2] = i1;
+ HEAP8[i8 + 36 | 0] = 8;
+ i14 = _deflateReset(i3) | 0;
+ STACKTOP = i2;
+ return i14 | 0;
+ }
+ HEAP32[i8 + 4 >> 2] = 666;
+ HEAP32[i5 >> 2] = HEAP32[3176 >> 2];
+ _deflateEnd(i3) | 0;
+ i14 = -4;
+ STACKTOP = i2;
+ return i14 | 0;
+}
+function _longest_match(i19, i16) {
+ i19 = i19 | 0;
+ i16 = i16 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i4 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i17 = 0, i18 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0;
+ i1 = STACKTOP;
+ i18 = HEAP32[i19 + 124 >> 2] | 0;
+ i3 = HEAP32[i19 + 56 >> 2] | 0;
+ i5 = HEAP32[i19 + 108 >> 2] | 0;
+ i4 = i3 + i5 | 0;
+ i20 = HEAP32[i19 + 120 >> 2] | 0;
+ i10 = HEAP32[i19 + 144 >> 2] | 0;
+ i2 = (HEAP32[i19 + 44 >> 2] | 0) + -262 | 0;
+ i8 = i5 >>> 0 > i2 >>> 0 ? i5 - i2 | 0 : 0;
+ i6 = HEAP32[i19 + 64 >> 2] | 0;
+ i7 = HEAP32[i19 + 52 >> 2] | 0;
+ i9 = i3 + (i5 + 258) | 0;
+ i2 = HEAP32[i19 + 116 >> 2] | 0;
+ i12 = i10 >>> 0 > i2 >>> 0 ? i2 : i10;
+ i11 = i19 + 112 | 0;
+ i15 = i3 + (i5 + 1) | 0;
+ i14 = i3 + (i5 + 2) | 0;
+ i13 = i9;
+ i10 = i5 + 257 | 0;
+ i17 = i20;
+ i18 = i20 >>> 0 < (HEAP32[i19 + 140 >> 2] | 0) >>> 0 ? i18 : i18 >>> 2;
+ i19 = HEAP8[i3 + (i20 + i5) | 0] | 0;
+ i20 = HEAP8[i3 + (i5 + -1 + i20) | 0] | 0;
+ while (1) {
+ i21 = i3 + i16 | 0;
+ if ((((HEAP8[i3 + (i16 + i17) | 0] | 0) == i19 << 24 >> 24 ? (HEAP8[i3 + (i17 + -1 + i16) | 0] | 0) == i20 << 24 >> 24 : 0) ? (HEAP8[i21] | 0) == (HEAP8[i4] | 0) : 0) ? (HEAP8[i3 + (i16 + 1) | 0] | 0) == (HEAP8[i15] | 0) : 0) {
+ i21 = i3 + (i16 + 2) | 0;
+ i22 = i14;
+ do {
+ i23 = i22 + 1 | 0;
+ if ((HEAP8[i23] | 0) != (HEAP8[i21 + 1 | 0] | 0)) {
+ i22 = i23;
+ break;
+ }
+ i23 = i22 + 2 | 0;
+ if ((HEAP8[i23] | 0) != (HEAP8[i21 + 2 | 0] | 0)) {
+ i22 = i23;
+ break;
+ }
+ i23 = i22 + 3 | 0;
+ if ((HEAP8[i23] | 0) != (HEAP8[i21 + 3 | 0] | 0)) {
+ i22 = i23;
+ break;
+ }
+ i23 = i22 + 4 | 0;
+ if ((HEAP8[i23] | 0) != (HEAP8[i21 + 4 | 0] | 0)) {
+ i22 = i23;
+ break;
+ }
+ i23 = i22 + 5 | 0;
+ if ((HEAP8[i23] | 0) != (HEAP8[i21 + 5 | 0] | 0)) {
+ i22 = i23;
+ break;
+ }
+ i23 = i22 + 6 | 0;
+ if ((HEAP8[i23] | 0) != (HEAP8[i21 + 6 | 0] | 0)) {
+ i22 = i23;
+ break;
+ }
+ i23 = i22 + 7 | 0;
+ if ((HEAP8[i23] | 0) != (HEAP8[i21 + 7 | 0] | 0)) {
+ i22 = i23;
+ break;
+ }
+ i22 = i22 + 8 | 0;
+ i21 = i21 + 8 | 0;
+ } while ((HEAP8[i22] | 0) == (HEAP8[i21] | 0) & i22 >>> 0 < i9 >>> 0);
+ i21 = i22 - i13 | 0;
+ i22 = i21 + 258 | 0;
+ if ((i22 | 0) > (i17 | 0)) {
+ HEAP32[i11 >> 2] = i16;
+ if ((i22 | 0) >= (i12 | 0)) {
+ i17 = i22;
+ i3 = 20;
+ break;
+ }
+ i17 = i22;
+ i19 = HEAP8[i3 + (i22 + i5) | 0] | 0;
+ i20 = HEAP8[i3 + (i10 + i21) | 0] | 0;
+ }
+ }
+ i16 = HEAPU16[i6 + ((i16 & i7) << 1) >> 1] | 0;
+ if (!(i16 >>> 0 > i8 >>> 0)) {
+ i3 = 20;
+ break;
+ }
+ i18 = i18 + -1 | 0;
+ if ((i18 | 0) == 0) {
+ i3 = 20;
+ break;
+ }
+ }
+ if ((i3 | 0) == 20) {
+ STACKTOP = i1;
+ return (i17 >>> 0 > i2 >>> 0 ? i2 : i17) | 0;
+ }
+ return 0;
+}
+function __tr_stored_block(i3, i2, i5, i6) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i5 = i5 | 0;
+ i6 = i6 | 0;
+ var i1 = 0, i4 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0;
+ i1 = STACKTOP;
+ i4 = i3 + 5820 | 0;
+ i7 = HEAP32[i4 >> 2] | 0;
+ i9 = i6 & 65535;
+ i6 = i3 + 5816 | 0;
+ i8 = HEAPU16[i6 >> 1] | 0 | i9 << i7;
+ HEAP16[i6 >> 1] = i8;
+ if ((i7 | 0) > 13) {
+ i11 = i3 + 20 | 0;
+ i7 = HEAP32[i11 >> 2] | 0;
+ HEAP32[i11 >> 2] = i7 + 1;
+ i10 = i3 + 8 | 0;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i7 | 0] = i8;
+ i8 = (HEAPU16[i6 >> 1] | 0) >>> 8 & 255;
+ i7 = HEAP32[i11 >> 2] | 0;
+ HEAP32[i11 >> 2] = i7 + 1;
+ HEAP8[(HEAP32[i10 >> 2] | 0) + i7 | 0] = i8;
+ i7 = HEAP32[i4 >> 2] | 0;
+ i8 = i9 >>> (16 - i7 | 0);
+ HEAP16[i6 >> 1] = i8;
+ i7 = i7 + -13 | 0;
+ } else {
+ i7 = i7 + 3 | 0;
+ }
+ i8 = i8 & 255;
+ HEAP32[i4 >> 2] = i7;
+ do {
+ if ((i7 | 0) <= 8) {
+ i9 = i3 + 20 | 0;
+ if ((i7 | 0) > 0) {
+ i7 = HEAP32[i9 >> 2] | 0;
+ HEAP32[i9 >> 2] = i7 + 1;
+ i11 = i3 + 8 | 0;
+ HEAP8[(HEAP32[i11 >> 2] | 0) + i7 | 0] = i8;
+ i7 = i9;
+ i8 = i11;
+ break;
+ } else {
+ i7 = i9;
+ i8 = i3 + 8 | 0;
+ break;
+ }
+ } else {
+ i7 = i3 + 20 | 0;
+ i10 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = i10 + 1;
+ i11 = i3 + 8 | 0;
+ HEAP8[(HEAP32[i11 >> 2] | 0) + i10 | 0] = i8;
+ i10 = (HEAPU16[i6 >> 1] | 0) >>> 8 & 255;
+ i8 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = i8 + 1;
+ HEAP8[(HEAP32[i11 >> 2] | 0) + i8 | 0] = i10;
+ i8 = i11;
+ }
+ } while (0);
+ HEAP16[i6 >> 1] = 0;
+ HEAP32[i4 >> 2] = 0;
+ HEAP32[i3 + 5812 >> 2] = 8;
+ i10 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = i10 + 1;
+ HEAP8[(HEAP32[i8 >> 2] | 0) + i10 | 0] = i5;
+ i10 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = i10 + 1;
+ HEAP8[(HEAP32[i8 >> 2] | 0) + i10 | 0] = i5 >>> 8;
+ i10 = i5 & 65535 ^ 65535;
+ i11 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = i11 + 1;
+ HEAP8[(HEAP32[i8 >> 2] | 0) + i11 | 0] = i10;
+ i11 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = i11 + 1;
+ HEAP8[(HEAP32[i8 >> 2] | 0) + i11 | 0] = i10 >>> 8;
+ if ((i5 | 0) == 0) {
+ STACKTOP = i1;
+ return;
+ }
+ while (1) {
+ i5 = i5 + -1 | 0;
+ i10 = HEAP8[i2] | 0;
+ i11 = HEAP32[i7 >> 2] | 0;
+ HEAP32[i7 >> 2] = i11 + 1;
+ HEAP8[(HEAP32[i8 >> 2] | 0) + i11 | 0] = i10;
+ if ((i5 | 0) == 0) {
+ break;
+ } else {
+ i2 = i2 + 1 | 0;
+ }
+ }
+ STACKTOP = i1;
+ return;
+}
+function _inflateInit_(i1, i3, i4) {
+ i1 = i1 | 0;
+ i3 = i3 | 0;
+ i4 = i4 | 0;
+ var i2 = 0, i5 = 0, i6 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0;
+ i2 = STACKTOP;
+ if ((i3 | 0) == 0) {
+ i11 = -6;
+ STACKTOP = i2;
+ return i11 | 0;
+ }
+ if (!((HEAP8[i3] | 0) == 49 & (i4 | 0) == 56)) {
+ i11 = -6;
+ STACKTOP = i2;
+ return i11 | 0;
+ }
+ if ((i1 | 0) == 0) {
+ i11 = -2;
+ STACKTOP = i2;
+ return i11 | 0;
+ }
+ i3 = i1 + 24 | 0;
+ HEAP32[i3 >> 2] = 0;
+ i4 = i1 + 32 | 0;
+ i6 = HEAP32[i4 >> 2] | 0;
+ if ((i6 | 0) == 0) {
+ HEAP32[i4 >> 2] = 1;
+ HEAP32[i1 + 40 >> 2] = 0;
+ i6 = 1;
+ }
+ i4 = i1 + 36 | 0;
+ if ((HEAP32[i4 >> 2] | 0) == 0) {
+ HEAP32[i4 >> 2] = 1;
+ }
+ i5 = i1 + 40 | 0;
+ i8 = FUNCTION_TABLE_iiii[i6 & 1](HEAP32[i5 >> 2] | 0, 1, 7116) | 0;
+ if ((i8 | 0) == 0) {
+ i11 = -4;
+ STACKTOP = i2;
+ return i11 | 0;
+ }
+ i6 = i1 + 28 | 0;
+ HEAP32[i6 >> 2] = i8;
+ HEAP32[i8 + 52 >> 2] = 0;
+ i9 = HEAP32[i6 >> 2] | 0;
+ do {
+ if ((i9 | 0) != 0) {
+ i10 = i9 + 52 | 0;
+ i11 = HEAP32[i10 >> 2] | 0;
+ i7 = i9 + 36 | 0;
+ if ((i11 | 0) != 0) {
+ if ((HEAP32[i7 >> 2] | 0) == 15) {
+ i10 = i9;
+ } else {
+ FUNCTION_TABLE_vii[HEAP32[i4 >> 2] & 1](HEAP32[i5 >> 2] | 0, i11);
+ HEAP32[i10 >> 2] = 0;
+ i10 = HEAP32[i6 >> 2] | 0;
+ }
+ HEAP32[i9 + 8 >> 2] = 1;
+ HEAP32[i7 >> 2] = 15;
+ if ((i10 | 0) == 0) {
+ break;
+ } else {
+ i9 = i10;
+ }
+ } else {
+ HEAP32[i9 + 8 >> 2] = 1;
+ HEAP32[i7 >> 2] = 15;
+ }
+ HEAP32[i9 + 28 >> 2] = 0;
+ HEAP32[i1 + 20 >> 2] = 0;
+ HEAP32[i1 + 8 >> 2] = 0;
+ HEAP32[i3 >> 2] = 0;
+ HEAP32[i1 + 48 >> 2] = 1;
+ HEAP32[i9 >> 2] = 0;
+ HEAP32[i9 + 4 >> 2] = 0;
+ HEAP32[i9 + 12 >> 2] = 0;
+ HEAP32[i9 + 20 >> 2] = 32768;
+ HEAP32[i9 + 32 >> 2] = 0;
+ HEAP32[i9 + 40 >> 2] = 0;
+ HEAP32[i9 + 44 >> 2] = 0;
+ HEAP32[i9 + 48 >> 2] = 0;
+ HEAP32[i9 + 56 >> 2] = 0;
+ HEAP32[i9 + 60 >> 2] = 0;
+ i11 = i9 + 1328 | 0;
+ HEAP32[i9 + 108 >> 2] = i11;
+ HEAP32[i9 + 80 >> 2] = i11;
+ HEAP32[i9 + 76 >> 2] = i11;
+ HEAP32[i9 + 7104 >> 2] = 1;
+ HEAP32[i9 + 7108 >> 2] = -1;
+ i11 = 0;
+ STACKTOP = i2;
+ return i11 | 0;
+ }
+ } while (0);
+ FUNCTION_TABLE_vii[HEAP32[i4 >> 2] & 1](HEAP32[i5 >> 2] | 0, i8);
+ HEAP32[i6 >> 2] = 0;
+ i11 = -2;
+ STACKTOP = i2;
+ return i11 | 0;
+}
+function _init_block(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ i3 = 0;
+ do {
+ HEAP16[i1 + (i3 << 2) + 148 >> 1] = 0;
+ i3 = i3 + 1 | 0;
+ } while ((i3 | 0) != 286);
+ HEAP16[i1 + 2440 >> 1] = 0;
+ HEAP16[i1 + 2444 >> 1] = 0;
+ HEAP16[i1 + 2448 >> 1] = 0;
+ HEAP16[i1 + 2452 >> 1] = 0;
+ HEAP16[i1 + 2456 >> 1] = 0;
+ HEAP16[i1 + 2460 >> 1] = 0;
+ HEAP16[i1 + 2464 >> 1] = 0;
+ HEAP16[i1 + 2468 >> 1] = 0;
+ HEAP16[i1 + 2472 >> 1] = 0;
+ HEAP16[i1 + 2476 >> 1] = 0;
+ HEAP16[i1 + 2480 >> 1] = 0;
+ HEAP16[i1 + 2484 >> 1] = 0;
+ HEAP16[i1 + 2488 >> 1] = 0;
+ HEAP16[i1 + 2492 >> 1] = 0;
+ HEAP16[i1 + 2496 >> 1] = 0;
+ HEAP16[i1 + 2500 >> 1] = 0;
+ HEAP16[i1 + 2504 >> 1] = 0;
+ HEAP16[i1 + 2508 >> 1] = 0;
+ HEAP16[i1 + 2512 >> 1] = 0;
+ HEAP16[i1 + 2516 >> 1] = 0;
+ HEAP16[i1 + 2520 >> 1] = 0;
+ HEAP16[i1 + 2524 >> 1] = 0;
+ HEAP16[i1 + 2528 >> 1] = 0;
+ HEAP16[i1 + 2532 >> 1] = 0;
+ HEAP16[i1 + 2536 >> 1] = 0;
+ HEAP16[i1 + 2540 >> 1] = 0;
+ HEAP16[i1 + 2544 >> 1] = 0;
+ HEAP16[i1 + 2548 >> 1] = 0;
+ HEAP16[i1 + 2552 >> 1] = 0;
+ HEAP16[i1 + 2556 >> 1] = 0;
+ HEAP16[i1 + 2684 >> 1] = 0;
+ HEAP16[i1 + 2688 >> 1] = 0;
+ HEAP16[i1 + 2692 >> 1] = 0;
+ HEAP16[i1 + 2696 >> 1] = 0;
+ HEAP16[i1 + 2700 >> 1] = 0;
+ HEAP16[i1 + 2704 >> 1] = 0;
+ HEAP16[i1 + 2708 >> 1] = 0;
+ HEAP16[i1 + 2712 >> 1] = 0;
+ HEAP16[i1 + 2716 >> 1] = 0;
+ HEAP16[i1 + 2720 >> 1] = 0;
+ HEAP16[i1 + 2724 >> 1] = 0;
+ HEAP16[i1 + 2728 >> 1] = 0;
+ HEAP16[i1 + 2732 >> 1] = 0;
+ HEAP16[i1 + 2736 >> 1] = 0;
+ HEAP16[i1 + 2740 >> 1] = 0;
+ HEAP16[i1 + 2744 >> 1] = 0;
+ HEAP16[i1 + 2748 >> 1] = 0;
+ HEAP16[i1 + 2752 >> 1] = 0;
+ HEAP16[i1 + 2756 >> 1] = 0;
+ HEAP16[i1 + 1172 >> 1] = 1;
+ HEAP32[i1 + 5804 >> 2] = 0;
+ HEAP32[i1 + 5800 >> 2] = 0;
+ HEAP32[i1 + 5808 >> 2] = 0;
+ HEAP32[i1 + 5792 >> 2] = 0;
+ STACKTOP = i2;
+ return;
+}
+function _deflateReset(i1) {
+ i1 = i1 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0;
+ i2 = STACKTOP;
+ if ((i1 | 0) == 0) {
+ i5 = -2;
+ STACKTOP = i2;
+ return i5 | 0;
+ }
+ i3 = HEAP32[i1 + 28 >> 2] | 0;
+ if ((i3 | 0) == 0) {
+ i5 = -2;
+ STACKTOP = i2;
+ return i5 | 0;
+ }
+ if ((HEAP32[i1 + 32 >> 2] | 0) == 0) {
+ i5 = -2;
+ STACKTOP = i2;
+ return i5 | 0;
+ }
+ if ((HEAP32[i1 + 36 >> 2] | 0) == 0) {
+ i5 = -2;
+ STACKTOP = i2;
+ return i5 | 0;
+ }
+ HEAP32[i1 + 20 >> 2] = 0;
+ HEAP32[i1 + 8 >> 2] = 0;
+ HEAP32[i1 + 24 >> 2] = 0;
+ HEAP32[i1 + 44 >> 2] = 2;
+ HEAP32[i3 + 20 >> 2] = 0;
+ HEAP32[i3 + 16 >> 2] = HEAP32[i3 + 8 >> 2];
+ i4 = i3 + 24 | 0;
+ i5 = HEAP32[i4 >> 2] | 0;
+ if ((i5 | 0) < 0) {
+ i5 = 0 - i5 | 0;
+ HEAP32[i4 >> 2] = i5;
+ }
+ HEAP32[i3 + 4 >> 2] = (i5 | 0) != 0 ? 42 : 113;
+ if ((i5 | 0) == 2) {
+ i4 = _crc32(0, 0, 0) | 0;
+ } else {
+ i4 = _adler32(0, 0, 0) | 0;
+ }
+ HEAP32[i1 + 48 >> 2] = i4;
+ HEAP32[i3 + 40 >> 2] = 0;
+ __tr_init(i3);
+ HEAP32[i3 + 60 >> 2] = HEAP32[i3 + 44 >> 2] << 1;
+ i5 = HEAP32[i3 + 76 >> 2] | 0;
+ i4 = HEAP32[i3 + 68 >> 2] | 0;
+ HEAP16[i4 + (i5 + -1 << 1) >> 1] = 0;
+ _memset(i4 | 0, 0, (i5 << 1) + -2 | 0) | 0;
+ i5 = HEAP32[i3 + 132 >> 2] | 0;
+ HEAP32[i3 + 128 >> 2] = HEAPU16[178 + (i5 * 12 | 0) >> 1] | 0;
+ HEAP32[i3 + 140 >> 2] = HEAPU16[176 + (i5 * 12 | 0) >> 1] | 0;
+ HEAP32[i3 + 144 >> 2] = HEAPU16[180 + (i5 * 12 | 0) >> 1] | 0;
+ HEAP32[i3 + 124 >> 2] = HEAPU16[182 + (i5 * 12 | 0) >> 1] | 0;
+ HEAP32[i3 + 108 >> 2] = 0;
+ HEAP32[i3 + 92 >> 2] = 0;
+ HEAP32[i3 + 116 >> 2] = 0;
+ HEAP32[i3 + 120 >> 2] = 2;
+ HEAP32[i3 + 96 >> 2] = 2;
+ HEAP32[i3 + 112 >> 2] = 0;
+ HEAP32[i3 + 104 >> 2] = 0;
+ HEAP32[i3 + 72 >> 2] = 0;
+ i5 = 0;
+ STACKTOP = i2;
+ return i5 | 0;
+}
+function _updatewindow(i6, i4) {
+ i6 = i6 | 0;
+ i4 = i4 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i5 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0;
+ i1 = STACKTOP;
+ i2 = HEAP32[i6 + 28 >> 2] | 0;
+ i3 = i2 + 52 | 0;
+ i8 = HEAP32[i3 >> 2] | 0;
+ if ((i8 | 0) == 0) {
+ i8 = FUNCTION_TABLE_iiii[HEAP32[i6 + 32 >> 2] & 1](HEAP32[i6 + 40 >> 2] | 0, 1 << HEAP32[i2 + 36 >> 2], 1) | 0;
+ HEAP32[i3 >> 2] = i8;
+ if ((i8 | 0) == 0) {
+ i10 = 1;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ }
+ i5 = i2 + 40 | 0;
+ i10 = HEAP32[i5 >> 2] | 0;
+ if ((i10 | 0) == 0) {
+ i10 = 1 << HEAP32[i2 + 36 >> 2];
+ HEAP32[i5 >> 2] = i10;
+ HEAP32[i2 + 48 >> 2] = 0;
+ HEAP32[i2 + 44 >> 2] = 0;
+ }
+ i4 = i4 - (HEAP32[i6 + 16 >> 2] | 0) | 0;
+ if (!(i4 >>> 0 < i10 >>> 0)) {
+ _memcpy(i8 | 0, (HEAP32[i6 + 12 >> 2] | 0) + (0 - i10) | 0, i10 | 0) | 0;
+ HEAP32[i2 + 48 >> 2] = 0;
+ HEAP32[i2 + 44 >> 2] = HEAP32[i5 >> 2];
+ i10 = 0;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ i7 = i2 + 48 | 0;
+ i9 = HEAP32[i7 >> 2] | 0;
+ i10 = i10 - i9 | 0;
+ i10 = i10 >>> 0 > i4 >>> 0 ? i4 : i10;
+ i6 = i6 + 12 | 0;
+ _memcpy(i8 + i9 | 0, (HEAP32[i6 >> 2] | 0) + (0 - i4) | 0, i10 | 0) | 0;
+ i8 = i4 - i10 | 0;
+ if ((i4 | 0) != (i10 | 0)) {
+ _memcpy(HEAP32[i3 >> 2] | 0, (HEAP32[i6 >> 2] | 0) + (0 - i8) | 0, i8 | 0) | 0;
+ HEAP32[i7 >> 2] = i8;
+ HEAP32[i2 + 44 >> 2] = HEAP32[i5 >> 2];
+ i10 = 0;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ i6 = (HEAP32[i7 >> 2] | 0) + i4 | 0;
+ i3 = HEAP32[i5 >> 2] | 0;
+ HEAP32[i7 >> 2] = (i6 | 0) == (i3 | 0) ? 0 : i6;
+ i5 = i2 + 44 | 0;
+ i2 = HEAP32[i5 >> 2] | 0;
+ if (!(i2 >>> 0 < i3 >>> 0)) {
+ i10 = 0;
+ STACKTOP = i1;
+ return i10 | 0;
+ }
+ HEAP32[i5 >> 2] = i2 + i4;
+ i10 = 0;
+ STACKTOP = i1;
+ return i10 | 0;
+}
+function _scan_tree(i1, i5, i6) {
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ i6 = i6 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i7 = 0, i8 = 0, i9 = 0, i10 = 0, i11 = 0, i12 = 0, i13 = 0, i14 = 0, i15 = 0, i16 = 0;
+ i8 = STACKTOP;
+ i10 = HEAP16[i5 + 2 >> 1] | 0;
+ i9 = i10 << 16 >> 16 == 0;
+ HEAP16[i5 + (i6 + 1 << 2) + 2 >> 1] = -1;
+ i2 = i1 + 2752 | 0;
+ i3 = i1 + 2756 | 0;
+ i4 = i1 + 2748 | 0;
+ i7 = i9 ? 138 : 7;
+ i9 = i9 ? 3 : 4;
+ i13 = 0;
+ i11 = i10 & 65535;
+ i12 = -1;
+ L1 : while (1) {
+ i14 = 0;
+ do {
+ if ((i13 | 0) > (i6 | 0)) {
+ break L1;
+ }
+ i13 = i13 + 1 | 0;
+ i16 = HEAP16[i5 + (i13 << 2) + 2 >> 1] | 0;
+ i10 = i16 & 65535;
+ i14 = i14 + 1 | 0;
+ i15 = (i11 | 0) == (i10 | 0);
+ } while ((i14 | 0) < (i7 | 0) & i15);
+ do {
+ if ((i14 | 0) >= (i9 | 0)) {
+ if ((i11 | 0) == 0) {
+ if ((i14 | 0) < 11) {
+ HEAP16[i2 >> 1] = (HEAP16[i2 >> 1] | 0) + 1 << 16 >> 16;
+ break;
+ } else {
+ HEAP16[i3 >> 1] = (HEAP16[i3 >> 1] | 0) + 1 << 16 >> 16;
+ break;
+ }
+ } else {
+ if ((i11 | 0) != (i12 | 0)) {
+ i14 = i1 + (i11 << 2) + 2684 | 0;
+ HEAP16[i14 >> 1] = (HEAP16[i14 >> 1] | 0) + 1 << 16 >> 16;
+ }
+ HEAP16[i4 >> 1] = (HEAP16[i4 >> 1] | 0) + 1 << 16 >> 16;
+ break;
+ }
+ } else {
+ i12 = i1 + (i11 << 2) + 2684 | 0;
+ HEAP16[i12 >> 1] = (HEAPU16[i12 >> 1] | 0) + i14;
+ }
+ } while (0);
+ if (i16 << 16 >> 16 == 0) {
+ i12 = i11;
+ i7 = 138;
+ i9 = 3;
+ i11 = i10;
+ continue;
+ }
+ i12 = i11;
+ i7 = i15 ? 6 : 7;
+ i9 = i15 ? 3 : 4;
+ i11 = i10;
+ }
+ STACKTOP = i8;
+ return;
+}
+function _deflateEnd(i4) {
+ i4 = i4 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i3 = STACKTOP;
+ if ((i4 | 0) == 0) {
+ i7 = -2;
+ STACKTOP = i3;
+ return i7 | 0;
+ }
+ i1 = i4 + 28 | 0;
+ i6 = HEAP32[i1 >> 2] | 0;
+ if ((i6 | 0) == 0) {
+ i7 = -2;
+ STACKTOP = i3;
+ return i7 | 0;
+ }
+ i2 = HEAP32[i6 + 4 >> 2] | 0;
+ switch (i2 | 0) {
+ case 42:
+ case 69:
+ case 73:
+ case 91:
+ case 103:
+ case 113:
+ case 666:
+ {
+ break;
+ }
+ default:
+ {
+ i7 = -2;
+ STACKTOP = i3;
+ return i7 | 0;
+ }
+ }
+ i5 = HEAP32[i6 + 8 >> 2] | 0;
+ if ((i5 | 0) != 0) {
+ FUNCTION_TABLE_vii[HEAP32[i4 + 36 >> 2] & 1](HEAP32[i4 + 40 >> 2] | 0, i5);
+ i6 = HEAP32[i1 >> 2] | 0;
+ }
+ i5 = HEAP32[i6 + 68 >> 2] | 0;
+ if ((i5 | 0) != 0) {
+ FUNCTION_TABLE_vii[HEAP32[i4 + 36 >> 2] & 1](HEAP32[i4 + 40 >> 2] | 0, i5);
+ i6 = HEAP32[i1 >> 2] | 0;
+ }
+ i5 = HEAP32[i6 + 64 >> 2] | 0;
+ if ((i5 | 0) != 0) {
+ FUNCTION_TABLE_vii[HEAP32[i4 + 36 >> 2] & 1](HEAP32[i4 + 40 >> 2] | 0, i5);
+ i6 = HEAP32[i1 >> 2] | 0;
+ }
+ i7 = HEAP32[i6 + 56 >> 2] | 0;
+ i5 = i4 + 36 | 0;
+ if ((i7 | 0) == 0) {
+ i4 = i4 + 40 | 0;
+ } else {
+ i4 = i4 + 40 | 0;
+ FUNCTION_TABLE_vii[HEAP32[i5 >> 2] & 1](HEAP32[i4 >> 2] | 0, i7);
+ i6 = HEAP32[i1 >> 2] | 0;
+ }
+ FUNCTION_TABLE_vii[HEAP32[i5 >> 2] & 1](HEAP32[i4 >> 2] | 0, i6);
+ HEAP32[i1 >> 2] = 0;
+ i7 = (i2 | 0) == 113 ? -3 : 0;
+ STACKTOP = i3;
+ return i7 | 0;
+}
+function _main(i4, i5) {
+ i4 = i4 | 0;
+ i5 = i5 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i6 = 0;
+ i1 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i2 = i1;
+ L1 : do {
+ if ((i4 | 0) > 1) {
+ i4 = HEAP8[HEAP32[i5 + 4 >> 2] | 0] | 0;
+ switch (i4 | 0) {
+ case 50:
+ {
+ i2 = 250;
+ break L1;
+ }
+ case 51:
+ {
+ i3 = 4;
+ break L1;
+ }
+ case 52:
+ {
+ i2 = 2500;
+ break L1;
+ }
+ case 53:
+ {
+ i2 = 5e3;
+ break L1;
+ }
+ case 48:
+ {
+ i6 = 0;
+ STACKTOP = i1;
+ return i6 | 0;
+ }
+ case 49:
+ {
+ i2 = 60;
+ break L1;
+ }
+ default:
+ {
+ HEAP32[i2 >> 2] = i4 + -48;
+ _printf(144, i2 | 0) | 0;
+ i6 = -1;
+ STACKTOP = i1;
+ return i6 | 0;
+ }
+ }
+ } else {
+ i3 = 4;
+ }
+ } while (0);
+ if ((i3 | 0) == 4) {
+ i2 = 500;
+ }
+ i3 = _malloc(1e5) | 0;
+ i4 = 0;
+ i6 = 0;
+ i5 = 17;
+ while (1) {
+ do {
+ if ((i6 | 0) <= 0) {
+ if ((i4 & 7 | 0) == 0) {
+ i6 = i4 & 31;
+ i5 = 0;
+ break;
+ } else {
+ i5 = (((Math_imul(i4, i4) | 0) >>> 0) % 6714 | 0) & 255;
+ break;
+ }
+ } else {
+ i6 = i6 + -1 | 0;
+ }
+ } while (0);
+ HEAP8[i3 + i4 | 0] = i5;
+ i4 = i4 + 1 | 0;
+ if ((i4 | 0) == 1e5) {
+ i4 = 0;
+ break;
+ }
+ }
+ do {
+ _doit(i3, 1e5, i4);
+ i4 = i4 + 1 | 0;
+ } while ((i4 | 0) < (i2 | 0));
+ _puts(160) | 0;
+ i6 = 0;
+ STACKTOP = i1;
+ return i6 | 0;
+}
+function _doit(i6, i1, i7) {
+ i6 = i6 | 0;
+ i1 = i1 | 0;
+ i7 = i7 | 0;
+ var i2 = 0, i3 = 0, i4 = 0, i5 = 0, i8 = 0, i9 = 0;
+ i5 = STACKTOP;
+ STACKTOP = STACKTOP + 16 | 0;
+ i4 = i5;
+ i3 = i5 + 12 | 0;
+ i2 = i5 + 8 | 0;
+ i8 = _compressBound(i1) | 0;
+ i9 = HEAP32[2] | 0;
+ if ((i9 | 0) == 0) {
+ i9 = _malloc(i8) | 0;
+ HEAP32[2] = i9;
+ }
+ if ((HEAP32[4] | 0) == 0) {
+ HEAP32[4] = _malloc(i1) | 0;
+ }
+ HEAP32[i3 >> 2] = i8;
+ _compress(i9, i3, i6, i1) | 0;
+ i7 = (i7 | 0) == 0;
+ if (i7) {
+ i9 = HEAP32[i3 >> 2] | 0;
+ HEAP32[i4 >> 2] = i1;
+ HEAP32[i4 + 4 >> 2] = i9;
+ _printf(24, i4 | 0) | 0;
+ }
+ HEAP32[i2 >> 2] = i1;
+ _uncompress(HEAP32[4] | 0, i2, HEAP32[2] | 0, HEAP32[i3 >> 2] | 0) | 0;
+ if ((HEAP32[i2 >> 2] | 0) != (i1 | 0)) {
+ ___assert_fail(40, 72, 24, 104);
+ }
+ if (!i7) {
+ STACKTOP = i5;
+ return;
+ }
+ if ((_strcmp(i6, HEAP32[4] | 0) | 0) == 0) {
+ STACKTOP = i5;
+ return;
+ } else {
+ ___assert_fail(112, 72, 25, 104);
+ }
+}
+function _uncompress(i6, i1, i5, i7) {
+ i6 = i6 | 0;
+ i1 = i1 | 0;
+ i5 = i5 | 0;
+ i7 = i7 | 0;
+ var i2 = 0, i3 = 0, i4 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 64 | 0;
+ i3 = i2;
+ HEAP32[i3 >> 2] = i5;
+ i5 = i3 + 4 | 0;
+ HEAP32[i5 >> 2] = i7;
+ HEAP32[i3 + 12 >> 2] = i6;
+ HEAP32[i3 + 16 >> 2] = HEAP32[i1 >> 2];
+ HEAP32[i3 + 32 >> 2] = 0;
+ HEAP32[i3 + 36 >> 2] = 0;
+ i6 = _inflateInit_(i3, 2992, 56) | 0;
+ if ((i6 | 0) != 0) {
+ i7 = i6;
+ STACKTOP = i2;
+ return i7 | 0;
+ }
+ i6 = _inflate(i3, 4) | 0;
+ if ((i6 | 0) == 1) {
+ HEAP32[i1 >> 2] = HEAP32[i3 + 20 >> 2];
+ i7 = _inflateEnd(i3) | 0;
+ STACKTOP = i2;
+ return i7 | 0;
+ }
+ _inflateEnd(i3) | 0;
+ if ((i6 | 0) == 2) {
+ i7 = -3;
+ STACKTOP = i2;
+ return i7 | 0;
+ } else if ((i6 | 0) == -5) {
+ i4 = 4;
+ }
+ if ((i4 | 0) == 4 ? (HEAP32[i5 >> 2] | 0) == 0 : 0) {
+ i7 = -3;
+ STACKTOP = i2;
+ return i7 | 0;
+ }
+ i7 = i6;
+ STACKTOP = i2;
+ return i7 | 0;
+}
+function _compress(i4, i1, i6, i5) {
+ i4 = i4 | 0;
+ i1 = i1 | 0;
+ i6 = i6 | 0;
+ i5 = i5 | 0;
+ var i2 = 0, i3 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + 64 | 0;
+ i3 = i2;
+ HEAP32[i3 >> 2] = i6;
+ HEAP32[i3 + 4 >> 2] = i5;
+ HEAP32[i3 + 12 >> 2] = i4;
+ HEAP32[i3 + 16 >> 2] = HEAP32[i1 >> 2];
+ HEAP32[i3 + 32 >> 2] = 0;
+ HEAP32[i3 + 36 >> 2] = 0;
+ HEAP32[i3 + 40 >> 2] = 0;
+ i4 = _deflateInit_(i3, -1, 168, 56) | 0;
+ if ((i4 | 0) != 0) {
+ i6 = i4;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ i4 = _deflate(i3, 4) | 0;
+ if ((i4 | 0) == 1) {
+ HEAP32[i1 >> 2] = HEAP32[i3 + 20 >> 2];
+ i6 = _deflateEnd(i3) | 0;
+ STACKTOP = i2;
+ return i6 | 0;
+ } else {
+ _deflateEnd(i3) | 0;
+ i6 = (i4 | 0) == 0 ? -5 : i4;
+ STACKTOP = i2;
+ return i6 | 0;
+ }
+ return 0;
+}
+function _inflateEnd(i4) {
+ i4 = i4 | 0;
+ var i1 = 0, i2 = 0, i3 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i1 = STACKTOP;
+ if ((i4 | 0) == 0) {
+ i7 = -2;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ i2 = i4 + 28 | 0;
+ i3 = HEAP32[i2 >> 2] | 0;
+ if ((i3 | 0) == 0) {
+ i7 = -2;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ i6 = i4 + 36 | 0;
+ i5 = HEAP32[i6 >> 2] | 0;
+ if ((i5 | 0) == 0) {
+ i7 = -2;
+ STACKTOP = i1;
+ return i7 | 0;
+ }
+ i7 = HEAP32[i3 + 52 >> 2] | 0;
+ i4 = i4 + 40 | 0;
+ if ((i7 | 0) != 0) {
+ FUNCTION_TABLE_vii[i5 & 1](HEAP32[i4 >> 2] | 0, i7);
+ i5 = HEAP32[i6 >> 2] | 0;
+ i3 = HEAP32[i2 >> 2] | 0;
+ }
+ FUNCTION_TABLE_vii[i5 & 1](HEAP32[i4 >> 2] | 0, i3);
+ HEAP32[i2 >> 2] = 0;
+ i7 = 0;
+ STACKTOP = i1;
+ return i7 | 0;
+}
+function _memcpy(i3, i2, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i4 = 0;
+ if ((i1 | 0) >= 4096) return _emscripten_memcpy_big(i3 | 0, i2 | 0, i1 | 0) | 0;
+ i4 = i3 | 0;
+ if ((i3 & 3) == (i2 & 3)) {
+ while (i3 & 3) {
+ if ((i1 | 0) == 0) return i4 | 0;
+ HEAP8[i3] = HEAP8[i2] | 0;
+ i3 = i3 + 1 | 0;
+ i2 = i2 + 1 | 0;
+ i1 = i1 - 1 | 0;
+ }
+ while ((i1 | 0) >= 4) {
+ HEAP32[i3 >> 2] = HEAP32[i2 >> 2];
+ i3 = i3 + 4 | 0;
+ i2 = i2 + 4 | 0;
+ i1 = i1 - 4 | 0;
+ }
+ }
+ while ((i1 | 0) > 0) {
+ HEAP8[i3] = HEAP8[i2] | 0;
+ i3 = i3 + 1 | 0;
+ i2 = i2 + 1 | 0;
+ i1 = i1 - 1 | 0;
+ }
+ return i4 | 0;
+}
+function _strcmp(i4, i2) {
+ i4 = i4 | 0;
+ i2 = i2 | 0;
+ var i1 = 0, i3 = 0, i5 = 0;
+ i1 = STACKTOP;
+ i5 = HEAP8[i4] | 0;
+ i3 = HEAP8[i2] | 0;
+ if (i5 << 24 >> 24 != i3 << 24 >> 24 | i5 << 24 >> 24 == 0 | i3 << 24 >> 24 == 0) {
+ i4 = i5;
+ i5 = i3;
+ i4 = i4 & 255;
+ i5 = i5 & 255;
+ i5 = i4 - i5 | 0;
+ STACKTOP = i1;
+ return i5 | 0;
+ }
+ do {
+ i4 = i4 + 1 | 0;
+ i2 = i2 + 1 | 0;
+ i5 = HEAP8[i4] | 0;
+ i3 = HEAP8[i2] | 0;
+ } while (!(i5 << 24 >> 24 != i3 << 24 >> 24 | i5 << 24 >> 24 == 0 | i3 << 24 >> 24 == 0));
+ i4 = i5 & 255;
+ i5 = i3 & 255;
+ i5 = i4 - i5 | 0;
+ STACKTOP = i1;
+ return i5 | 0;
+}
+function _memset(i1, i4, i3) {
+ i1 = i1 | 0;
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ var i2 = 0, i5 = 0, i6 = 0, i7 = 0;
+ i2 = i1 + i3 | 0;
+ if ((i3 | 0) >= 20) {
+ i4 = i4 & 255;
+ i7 = i1 & 3;
+ i6 = i4 | i4 << 8 | i4 << 16 | i4 << 24;
+ i5 = i2 & ~3;
+ if (i7) {
+ i7 = i1 + 4 - i7 | 0;
+ while ((i1 | 0) < (i7 | 0)) {
+ HEAP8[i1] = i4;
+ i1 = i1 + 1 | 0;
+ }
+ }
+ while ((i1 | 0) < (i5 | 0)) {
+ HEAP32[i1 >> 2] = i6;
+ i1 = i1 + 4 | 0;
+ }
+ }
+ while ((i1 | 0) < (i2 | 0)) {
+ HEAP8[i1] = i4;
+ i1 = i1 + 1 | 0;
+ }
+ return i1 - i3 | 0;
+}
+function copyTempDouble(i1) {
+ i1 = i1 | 0;
+ HEAP8[tempDoublePtr] = HEAP8[i1];
+ HEAP8[tempDoublePtr + 1 | 0] = HEAP8[i1 + 1 | 0];
+ HEAP8[tempDoublePtr + 2 | 0] = HEAP8[i1 + 2 | 0];
+ HEAP8[tempDoublePtr + 3 | 0] = HEAP8[i1 + 3 | 0];
+ HEAP8[tempDoublePtr + 4 | 0] = HEAP8[i1 + 4 | 0];
+ HEAP8[tempDoublePtr + 5 | 0] = HEAP8[i1 + 5 | 0];
+ HEAP8[tempDoublePtr + 6 | 0] = HEAP8[i1 + 6 | 0];
+ HEAP8[tempDoublePtr + 7 | 0] = HEAP8[i1 + 7 | 0];
+}
+function __tr_init(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ HEAP32[i1 + 2840 >> 2] = i1 + 148;
+ HEAP32[i1 + 2848 >> 2] = 1064;
+ HEAP32[i1 + 2852 >> 2] = i1 + 2440;
+ HEAP32[i1 + 2860 >> 2] = 1088;
+ HEAP32[i1 + 2864 >> 2] = i1 + 2684;
+ HEAP32[i1 + 2872 >> 2] = 1112;
+ HEAP16[i1 + 5816 >> 1] = 0;
+ HEAP32[i1 + 5820 >> 2] = 0;
+ HEAP32[i1 + 5812 >> 2] = 8;
+ _init_block(i1);
+ STACKTOP = i2;
+ return;
+}
+function copyTempFloat(i1) {
+ i1 = i1 | 0;
+ HEAP8[tempDoublePtr] = HEAP8[i1];
+ HEAP8[tempDoublePtr + 1 | 0] = HEAP8[i1 + 1 | 0];
+ HEAP8[tempDoublePtr + 2 | 0] = HEAP8[i1 + 2 | 0];
+ HEAP8[tempDoublePtr + 3 | 0] = HEAP8[i1 + 3 | 0];
+}
+function _deflateInit_(i4, i3, i2, i1) {
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ var i5 = 0;
+ i5 = STACKTOP;
+ i4 = _deflateInit2_(i4, i3, 8, 15, 8, 0, i2, i1) | 0;
+ STACKTOP = i5;
+ return i4 | 0;
+}
+function _zcalloc(i3, i1, i2) {
+ i3 = i3 | 0;
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ var i4 = 0;
+ i4 = STACKTOP;
+ i3 = _malloc(Math_imul(i2, i1) | 0) | 0;
+ STACKTOP = i4;
+ return i3 | 0;
+}
+function dynCall_iiii(i4, i3, i2, i1) {
+ i4 = i4 | 0;
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ return FUNCTION_TABLE_iiii[i4 & 1](i3 | 0, i2 | 0, i1 | 0) | 0;
+}
+function runPostSets() {}
+function _strlen(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = i1;
+ while (HEAP8[i2] | 0) {
+ i2 = i2 + 1 | 0;
+ }
+ return i2 - i1 | 0;
+}
+function stackAlloc(i1) {
+ i1 = i1 | 0;
+ var i2 = 0;
+ i2 = STACKTOP;
+ STACKTOP = STACKTOP + i1 | 0;
+ STACKTOP = STACKTOP + 7 & -8;
+ return i2 | 0;
+}
+function dynCall_iii(i3, i2, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ return FUNCTION_TABLE_iii[i3 & 3](i2 | 0, i1 | 0) | 0;
+}
+function setThrew(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ if ((__THREW__ | 0) == 0) {
+ __THREW__ = i1;
+ threwValue = i2;
+ }
+}
+function dynCall_vii(i3, i2, i1) {
+ i3 = i3 | 0;
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ FUNCTION_TABLE_vii[i3 & 1](i2 | 0, i1 | 0);
+}
+function _zcfree(i2, i1) {
+ i2 = i2 | 0;
+ i1 = i1 | 0;
+ i2 = STACKTOP;
+ _free(i1);
+ STACKTOP = i2;
+ return;
+}
+function _compressBound(i1) {
+ i1 = i1 | 0;
+ return i1 + 13 + (i1 >>> 12) + (i1 >>> 14) + (i1 >>> 25) | 0;
+}
+function b0(i1, i2, i3) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ i3 = i3 | 0;
+ abort(0);
+ return 0;
+}
+function b2(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ abort(2);
+ return 0;
+}
+function b1(i1, i2) {
+ i1 = i1 | 0;
+ i2 = i2 | 0;
+ abort(1);
+}
+function stackRestore(i1) {
+ i1 = i1 | 0;
+ STACKTOP = i1;
+}
+function setTempRet9(i1) {
+ i1 = i1 | 0;
+ tempRet9 = i1;
+}
+function setTempRet8(i1) {
+ i1 = i1 | 0;
+ tempRet8 = i1;
+}
+function setTempRet7(i1) {
+ i1 = i1 | 0;
+ tempRet7 = i1;
+}
+function setTempRet6(i1) {
+ i1 = i1 | 0;
+ tempRet6 = i1;
+}
+function setTempRet5(i1) {
+ i1 = i1 | 0;
+ tempRet5 = i1;
+}
+function setTempRet4(i1) {
+ i1 = i1 | 0;
+ tempRet4 = i1;
+}
+function setTempRet3(i1) {
+ i1 = i1 | 0;
+ tempRet3 = i1;
+}
+function setTempRet2(i1) {
+ i1 = i1 | 0;
+ tempRet2 = i1;
+}
+function setTempRet1(i1) {
+ i1 = i1 | 0;
+ tempRet1 = i1;
+}
+function setTempRet0(i1) {
+ i1 = i1 | 0;
+ tempRet0 = i1;
+}
+function stackSave() {
+ return STACKTOP | 0;
+}
+
+// EMSCRIPTEN_END_FUNCS
+ var FUNCTION_TABLE_iiii = [b0,_zcalloc];
+ var FUNCTION_TABLE_vii = [b1,_zcfree];
+ var FUNCTION_TABLE_iii = [b2,_deflate_stored,_deflate_fast,_deflate_slow];
+
+ return { _strlen: _strlen, _free: _free, _main: _main, _memset: _memset, _malloc: _malloc, _memcpy: _memcpy, runPostSets: runPostSets, stackAlloc: stackAlloc, stackSave: stackSave, stackRestore: stackRestore, setThrew: setThrew, setTempRet0: setTempRet0, setTempRet1: setTempRet1, setTempRet2: setTempRet2, setTempRet3: setTempRet3, setTempRet4: setTempRet4, setTempRet5: setTempRet5, setTempRet6: setTempRet6, setTempRet7: setTempRet7, setTempRet8: setTempRet8, setTempRet9: setTempRet9, dynCall_iiii: dynCall_iiii, dynCall_vii: dynCall_vii, dynCall_iii: dynCall_iii };
+}).toString(),
+// EMSCRIPTEN_END_ASM
+{ "Math": Math, "Int8Array": Int8Array, "Int16Array": Int16Array, "Int32Array": Int32Array, "Uint8Array": Uint8Array, "Uint16Array": Uint16Array, "Uint32Array": Uint32Array, "Float32Array": Float32Array, "Float64Array": Float64Array, "abort": abort, "assert": assert, "asmPrintInt": asmPrintInt, "asmPrintFloat": asmPrintFloat, "min": Math_min, "invoke_iiii": invoke_iiii, "invoke_vii": invoke_vii, "invoke_iii": invoke_iii, "_send": _send, "___setErrNo": ___setErrNo, "___assert_fail": ___assert_fail, "_fflush": _fflush, "_pwrite": _pwrite, "__reallyNegative": __reallyNegative, "_sbrk": _sbrk, "___errno_location": ___errno_location, "_emscripten_memcpy_big": _emscripten_memcpy_big, "_fileno": _fileno, "_sysconf": _sysconf, "_puts": _puts, "_mkport": _mkport, "_write": _write, "_llvm_bswap_i32": _llvm_bswap_i32, "_fputc": _fputc, "_abort": _abort, "_fwrite": _fwrite, "_time": _time, "_fprintf": _fprintf, "__formatString": __formatString, "_fputs": _fputs, "_printf": _printf, "STACKTOP": STACKTOP, "STACK_MAX": STACK_MAX, "tempDoublePtr": tempDoublePtr, "ABORT": ABORT, "NaN": NaN, "Infinity": Infinity }, buffer);
+var _strlen = Module["_strlen"] = asm["_strlen"];
+var _free = Module["_free"] = asm["_free"];
+var _main = Module["_main"] = asm["_main"];
+var _memset = Module["_memset"] = asm["_memset"];
+var _malloc = Module["_malloc"] = asm["_malloc"];
+var _memcpy = Module["_memcpy"] = asm["_memcpy"];
+var runPostSets = Module["runPostSets"] = asm["runPostSets"];
+var dynCall_iiii = Module["dynCall_iiii"] = asm["dynCall_iiii"];
+var dynCall_vii = Module["dynCall_vii"] = asm["dynCall_vii"];
+var dynCall_iii = Module["dynCall_iii"] = asm["dynCall_iii"];
+
+Runtime.stackAlloc = function(size) { return asm['stackAlloc'](size) };
+Runtime.stackSave = function() { return asm['stackSave']() };
+Runtime.stackRestore = function(top) { asm['stackRestore'](top) };
+
+
+// Warning: printing of i64 values may be slightly rounded! No deep i64 math used, so precise i64 code not included
+var i64Math = null;
+
+// === Auto-generated postamble setup entry stuff ===
+
+if (memoryInitializer) {
+ if (ENVIRONMENT_IS_NODE || ENVIRONMENT_IS_SHELL) {
+ var data = Module['readBinary'](memoryInitializer);
+ HEAPU8.set(data, STATIC_BASE);
+ } else {
+ addRunDependency('memory initializer');
+ Browser.asyncLoad(memoryInitializer, function(data) {
+ HEAPU8.set(data, STATIC_BASE);
+ removeRunDependency('memory initializer');
+ }, function(data) {
+ throw 'could not load memory initializer ' + memoryInitializer;
+ });
+ }
+}
+
+function ExitStatus(status) {
+ this.name = "ExitStatus";
+ this.message = "Program terminated with exit(" + status + ")";
+ this.status = status;
+};
+ExitStatus.prototype = new Error();
+ExitStatus.prototype.constructor = ExitStatus;
+
+var initialStackTop;
+var preloadStartTime = null;
+var calledMain = false;
+
+dependenciesFulfilled = function runCaller() {
+ // If run has never been called, and we should call run (INVOKE_RUN is true, and Module.noInitialRun is not false)
+ if (!Module['calledRun'] && shouldRunNow) run([].concat(Module["arguments"]));
+ if (!Module['calledRun']) dependenciesFulfilled = runCaller; // try this again later, after new deps are fulfilled
+}
+
+Module['callMain'] = Module.callMain = function callMain(args) {
+ assert(runDependencies == 0, 'cannot call main when async dependencies remain! (listen on __ATMAIN__)');
+ assert(__ATPRERUN__.length == 0, 'cannot call main when preRun functions remain to be called');
+
+ args = args || [];
+
+ ensureInitRuntime();
+
+ var argc = args.length+1;
+ function pad() {
+ for (var i = 0; i < 4-1; i++) {
+ argv.push(0);
+ }
+ }
+ var argv = [allocate(intArrayFromString("/bin/this.program"), 'i8', ALLOC_NORMAL) ];
+ pad();
+ for (var i = 0; i < argc-1; i = i + 1) {
+ argv.push(allocate(intArrayFromString(args[i]), 'i8', ALLOC_NORMAL));
+ pad();
+ }
+ argv.push(0);
+ argv = allocate(argv, 'i32', ALLOC_NORMAL);
+
+ initialStackTop = STACKTOP;
+
+ try {
+
+ var ret = Module['_main'](argc, argv, 0);
+
+
+ // if we're not running an evented main loop, it's time to exit
+ if (!Module['noExitRuntime']) {
+ exit(ret);
+ }
+ }
+ catch(e) {
+ if (e instanceof ExitStatus) {
+ // exit() throws this once it's done to make sure execution
+ // has been stopped completely
+ return;
+ } else if (e == 'SimulateInfiniteLoop') {
+ // running an evented main loop, don't immediately exit
+ Module['noExitRuntime'] = true;
+ return;
+ } else {
+ if (e && typeof e === 'object' && e.stack) Module.printErr('exception thrown: ' + [e, e.stack]);
+ throw e;
+ }
+ } finally {
+ calledMain = true;
+ }
+}
+
+
+
+
+function run(args) {
+ args = args || Module['arguments'];
+
+ if (preloadStartTime === null) preloadStartTime = Date.now();
+
+ if (runDependencies > 0) {
+ Module.printErr('run() called, but dependencies remain, so not running');
+ return;
+ }
+
+ preRun();
+
+ if (runDependencies > 0) return; // a preRun added a dependency, run will be called later
+ if (Module['calledRun']) return; // run may have just been called through dependencies being fulfilled just in this very frame
+
+ function doRun() {
+ if (Module['calledRun']) return; // run may have just been called while the async setStatus time below was happening
+ Module['calledRun'] = true;
+
+ ensureInitRuntime();
+
+ preMain();
+
+ if (ENVIRONMENT_IS_WEB && preloadStartTime !== null) {
+ Module.printErr('pre-main prep time: ' + (Date.now() - preloadStartTime) + ' ms');
+ }
+
+ if (Module['_main'] && shouldRunNow) {
+ Module['callMain'](args);
+ }
+
+ postRun();
+ }
+
+ if (Module['setStatus']) {
+ Module['setStatus']('Running...');
+ setTimeout(function() {
+ setTimeout(function() {
+ Module['setStatus']('');
+ }, 1);
+ if (!ABORT) doRun();
+ }, 1);
+ } else {
+ doRun();
+ }
+}
+Module['run'] = Module.run = run;
+
+function exit(status) {
+ ABORT = true;
+ EXITSTATUS = status;
+ STACKTOP = initialStackTop;
+
+ // exit the runtime
+ exitRuntime();
+
+ // TODO We should handle this differently based on environment.
+ // In the browser, the best we can do is throw an exception
+ // to halt execution, but in node we could process.exit and
+ // I'd imagine SM shell would have something equivalent.
+ // This would let us set a proper exit status (which
+ // would be great for checking test exit statuses).
+ // https://github.com/kripken/emscripten/issues/1371
+
+ // throw an exception to halt the current execution
+ throw new ExitStatus(status);
+}
+Module['exit'] = Module.exit = exit;
+
+function abort(text) {
+ if (text) {
+ Module.print(text);
+ Module.printErr(text);
+ }
+
+ ABORT = true;
+ EXITSTATUS = 1;
+
+ var extra = '\nIf this abort() is unexpected, build with -s ASSERTIONS=1 which can give more information.';
+
+ throw 'abort() at ' + stackTrace() + extra;
+}
+Module['abort'] = Module.abort = abort;
+
+// {{PRE_RUN_ADDITIONS}}
+
+if (Module['preInit']) {
+ if (typeof Module['preInit'] == 'function') Module['preInit'] = [Module['preInit']];
+ while (Module['preInit'].length > 0) {
+ Module['preInit'].pop()();
+ }
+}
+
+// shouldRunNow refers to calling main(), not run().
+var shouldRunNow = true;
+if (Module['noInitialRun']) {
+ shouldRunNow = false;
+}
+
+
+run([].concat(Module["arguments"]));
diff --git a/test/mjsunit/wasm/export-table.js b/test/mjsunit/wasm/export-table.js
new file mode 100644
index 0000000..e85da9b
--- /dev/null
+++ b/test/mjsunit/wasm/export-table.js
@@ -0,0 +1,50 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-wasm
+
+load("test/mjsunit/wasm/wasm-constants.js");
+load("test/mjsunit/wasm/wasm-module-builder.js");
+
+(function testExportedMain() {
+ var kReturnValue = 88;
+ var builder = new WasmModuleBuilder();
+
+ builder.addFunction("main", [kAstI32])
+ .addBody([
+ kExprReturn,
+ kExprI8Const,
+ kReturnValue])
+ .exportFunc();
+
+ var module = builder.instantiate();
+
+ assertEquals("object", typeof module.exports);
+ assertEquals("function", typeof module.exports.main);
+
+ assertEquals(kReturnValue, module.exports.main());
+})();
+
+(function testExportedTwice() {
+ var kReturnValue = 99;
+
+ var builder = new WasmModuleBuilder();
+
+ builder.addFunction("main", [kAstI32])
+ .addBody([
+ kExprReturn,
+ kExprI8Const,
+ kReturnValue])
+ .exportAs("blah")
+ .exportAs("foo");
+
+ var module = builder.instantiate();
+
+ assertEquals("object", typeof module.exports);
+ assertEquals("function", typeof module.exports.blah);
+ assertEquals("function", typeof module.exports.foo);
+
+ assertEquals(kReturnValue, module.exports.foo());
+ assertEquals(kReturnValue, module.exports.blah());
+})();
diff --git a/test/mjsunit/wasm/ffi-error.js b/test/mjsunit/wasm/ffi-error.js
index 3359429..649ee27 100644
--- a/test/mjsunit/wasm/ffi-error.js
+++ b/test/mjsunit/wasm/ffi-error.js
@@ -5,40 +5,21 @@
// Flags: --expose-wasm
load("test/mjsunit/wasm/wasm-constants.js");
+load("test/mjsunit/wasm/wasm-module-builder.js");
function testCallFFI(ffi) {
- var kBodySize = 6;
- var kNameAddOffset = 28 + kBodySize + 1;
- var kNameMainOffset = kNameAddOffset + 4;
+ var builder = new WasmModuleBuilder();
- var data = bytes(
- kDeclMemory,
- 12, 12, 1, // memory
- // -- signatures
- kDeclSignatures, 1,
- 2, kAstI32, kAstF64, kAstF64, // (f64,f64)->int
- // -- foreign function
- kDeclFunctions, 2,
- kDeclFunctionName | kDeclFunctionImport,
- 0, 0, // signature index
- kNameAddOffset, 0, 0, 0, // name offset
- // -- main function
- kDeclFunctionName | kDeclFunctionExport,
- 0, 0, // signature index
- kNameMainOffset, 0, 0, 0, // name offset
- kBodySize, 0,
- // main body
- kExprCallFunction, 0, // --
- kExprGetLocal, 0, // --
- kExprGetLocal, 1, // --
- // names
- kDeclEnd,
- 'f', 'u', 'n', 0, // --
- 'm', 'a', 'i', 'n', 0 // --
- );
+ var sig_index = [kAstI32, kAstF64, kAstF64];
+ builder.addImport("fun", sig_index);
+ builder.addFunction("main", sig_index)
+ .addBody([
+ kExprCallImport, 0, // --
+ kExprGetLocal, 0, // --
+ kExprGetLocal, 1]) // --
+ .exportFunc();
- print("instantiate FFI");
- var module = _WASMEXP_.instantiateModule(data, ffi);
+ var module = builder.instantiate(ffi);
}
// everything is good.
diff --git a/test/mjsunit/wasm/ffi.js b/test/mjsunit/wasm/ffi.js
index 95d655d..61fcf02 100644
--- a/test/mjsunit/wasm/ffi.js
+++ b/test/mjsunit/wasm/ffi.js
@@ -5,52 +5,31 @@
// Flags: --expose-wasm
load("test/mjsunit/wasm/wasm-constants.js");
+load("test/mjsunit/wasm/wasm-module-builder.js");
function testCallFFI(func, check) {
- var kBodySize = 6;
- var kNameFunOffset = 24 + kBodySize + 1;
- var kNameMainOffset = kNameFunOffset + 4;
+ var builder = new WasmModuleBuilder();
- var ffi = new Object();
- ffi.fun = func;
+ var sig_index = builder.addSignature([kAstI32, kAstF64, kAstF64]);
+ builder.addImport("func", sig_index);
+ builder.addFunction("main", sig_index)
+ .addBody([
+ kExprCallImport, 0, // --
+ kExprGetLocal, 0, // --
+ kExprGetLocal, 1]) // --
+ .exportFunc();
- var data = bytes(
- // signatures
- kDeclSignatures, 1,
- 2, kAstI32, kAstF64, kAstF64, // (f64,f64) -> int
- // -- foreign function
- kDeclFunctions, 2,
- kDeclFunctionName | kDeclFunctionImport,
- 0, 0,
- kNameFunOffset, 0, 0, 0, // name offset
- // -- main function
- kDeclFunctionName | kDeclFunctionExport,
- 0, 0,
- kNameMainOffset, 0, 0, 0, // name offset
- kBodySize, 0,
- // main body
- kExprCallFunction, 0, // --
- kExprGetLocal, 0, // --
- kExprGetLocal, 1, // --
- // names
- kDeclEnd,
- 'f', 'u', 'n', 0, // --
- 'm', 'a', 'i', 'n', 0 // --
- );
-
- var module = _WASMEXP_.instantiateModule(data, ffi);
-
- assertEquals("function", typeof module.main);
+ var main = builder.instantiate({func: func}).exports.main;
for (var i = 0; i < 100000; i += 10003) {
var a = 22.5 + i, b = 10.5 + i;
- var r = module.main(a, b);
+ var r = main(a, b);
check(r, a, b);
}
}
var global = (function() { return this; })();
-var params = [-99, -99, -99, -99];
+var params = [-99, -99, -99, -99, -99];
var was_called = false;
var length = -1;
@@ -189,62 +168,39 @@
function testCallBinopVoid(type, func, check) {
- var kBodySize = 10;
- var kNameFunOffset = 28 + kBodySize + 1;
- var kNameMainOffset = kNameFunOffset + 4;
-
- var ffi = new Object();
-
var passed_length = -1;
var passed_a = -1;
var passed_b = -1;
var args_a = -1;
var args_b = -1;
- ffi.fun = function(a, b) {
+ ffi = {func: function(a, b) {
passed_length = arguments.length;
passed_a = a;
passed_b = b;
args_a = arguments[0];
args_b = arguments[1];
- }
+ }};
- var data = bytes(
- // -- signatures
- kDeclSignatures, 2,
- 2, kAstStmt, type, type, // (type,type)->void
- 2, kAstI32, type, type, // (type,type)->int
- // -- foreign function
- kDeclFunctions, 2,
- kDeclFunctionName | kDeclFunctionImport,
- 0, 0, // signature index
- kNameFunOffset, 0, 0, 0, // name offset
- // -- main function
- kDeclFunctionName | kDeclFunctionExport,
- 1, 0, // signature index
- kNameMainOffset, 0, 0, 0, // name offset
- kBodySize, 0, // body size
- // main body
- kExprBlock, 2, // --
- kExprCallFunction, 0, // --
- kExprGetLocal, 0, // --
- kExprGetLocal, 1, // --
- kExprI8Const, 99, // --
- // names
- kDeclEnd,
- 'f', 'u', 'n', 0, // --
- 'm', 'a', 'i', 'n', 0 // --
- );
+ var builder = new WasmModuleBuilder();
- var module = _WASMEXP_.instantiateModule(data, ffi);
+ builder.addImport("func", [kAstStmt, type, type]);
+ builder.addFunction("main", [kAstI32, type, type])
+ .addBody([
+ kExprBlock, 2, // --
+ kExprCallImport, 0, // --
+ kExprGetLocal, 0, // --
+ kExprGetLocal, 1, // --
+ kExprI8Const, 99]) // --
+ .exportFunc()
- assertEquals("function", typeof module.main);
+ var main = builder.instantiate(ffi).exports.main;
print("testCallBinopVoid", type);
for (var i = 0; i < 100000; i += 10003.1) {
var a = 22.5 + i, b = 10.5 + i;
- var r = module.main(a, b);
+ var r = main(a, b);
assertEquals(99, r);
assertEquals(2, passed_length);
var expected_a, expected_b;
@@ -282,51 +238,21 @@
function testCallPrint() {
- var kBodySize = 10;
- var kNamePrintOffset = 10 + 7 + 7 + 9 + kBodySize + 1;
- var kNameMainOffset = kNamePrintOffset + 6;
+ var builder = new WasmModuleBuilder();
- var ffi = new Object();
- ffi.print = print;
+ builder.addImport("print", [kAstStmt, kAstI32]);
+ builder.addImport("print", [kAstStmt, kAstF64]);
+ builder.addFunction("main", [kAstStmt, kAstF64])
+ .addBody([
+ kExprBlock, 2, // --
+ kExprCallImport, 0, // --
+ kExprI8Const, 97, // --
+ kExprCallImport, 1, // --
+ kExprGetLocal, 0]) // --
+ .exportFunc()
- var data = bytes(
- // -- signatures
- kDeclSignatures, 2,
- 1, kAstStmt, kAstI32, // i32->void
- 1, kAstStmt, kAstF64, // f64->int
- kDeclFunctions, 3,
- // -- import print i32
- kDeclFunctionName | kDeclFunctionImport,
- 0, 0, // signature index
- kNamePrintOffset, 0, 0, 0, // name offset
- // -- import print f64
- kDeclFunctionName | kDeclFunctionImport,
- 1, 0, // signature index
- kNamePrintOffset, 0, 0, 0, // name offset
- // -- decl main
- kDeclFunctionName | kDeclFunctionExport,
- 1, 0, // signature index
- kNameMainOffset, 0, 0, 0, // name offset
- kBodySize, 0, // body size
- // main body
- kExprBlock, 2, // --
- kExprCallFunction, 0, // --
- kExprI8Const, 97, // --
- kExprCallFunction, 1, // --
- kExprGetLocal, 0, // --
- // names
- kDeclEnd,
- 'p', 'r', 'i', 'n', 't', 0, // --
- 'm', 'a', 'i', 'n', 0 // --
- );
-
- var module = _WASMEXP_.instantiateModule(data, ffi);
-
- assertEquals("function", typeof module.main);
-
- for (var i = -9; i < 900; i += 6.125) {
- module.main(i);
- }
+ var main = builder.instantiate({print: print}).exports.main;
+ for (var i = -9; i < 900; i += 6.125) main(i);
}
testCallPrint();
diff --git a/test/mjsunit/wasm/function-prototype.js b/test/mjsunit/wasm/function-prototype.js
new file mode 100644
index 0000000..db04b95
--- /dev/null
+++ b/test/mjsunit/wasm/function-prototype.js
@@ -0,0 +1,35 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-wasm
+
+load("test/mjsunit/wasm/wasm-constants.js");
+load("test/mjsunit/wasm/wasm-module-builder.js");
+
+(function TestFunctionPrototype() {
+ var builder = new WasmModuleBuilder();
+
+ builder.addFunction("nine", [kAstI32])
+ .addBody([kExprI8Const, 9])
+ .exportFunc();
+
+ var func = builder.instantiate().exports.nine;
+
+ // Check type and existence of prototype
+ assertEquals("function", typeof func.apply);
+ assertTrue(func.prototype != undefined);
+ assertEquals("nine", func.name);
+ assertEquals(undefined, func.displayName);
+
+ // Check that .apply() works.
+ assertEquals(9, func.apply([]));
+ assertEquals(9, func.apply([1]));
+ assertEquals(9, func.apply([2, 3]));
+ assertEquals(9, func.apply([6, 7, 9, 9]));
+
+ // TODO(titzer): assertEquals(1, func.length);
+
+ // Check we don't crash when converting to a string.
+ print(func.toString());
+})();
diff --git a/test/mjsunit/wasm/gc-frame.js b/test/mjsunit/wasm/gc-frame.js
new file mode 100644
index 0000000..8387d26
--- /dev/null
+++ b/test/mjsunit/wasm/gc-frame.js
@@ -0,0 +1,74 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-wasm --expose-gc
+
+load("test/mjsunit/wasm/wasm-constants.js");
+load("test/mjsunit/wasm/wasm-module-builder.js");
+
+function makeFFI(func, t) {
+ var builder = new WasmModuleBuilder();
+
+ var sig_index = builder.addSignature([t,t,t,t,t,t,t,t,t,t,t]);
+ builder.addImport("func", sig_index);
+ // Try to create a frame with lots of spilled values and parameters
+ // on the stack to try to catch GC bugs in the reference maps for
+ // the different parts of the stack.
+ builder.addFunction("main", sig_index)
+ .addBody([
+ kExprCallImport, 0, // --
+ kExprGetLocal, 0, // --
+ kExprGetLocal, 1, // --
+ kExprGetLocal, 2, // --
+ kExprGetLocal, 3, // --
+ kExprGetLocal, 4, // --
+ kExprGetLocal, 5, // --
+ kExprGetLocal, 6, // --
+ kExprGetLocal, 7, // --
+ kExprGetLocal, 8, // --
+ kExprGetLocal, 9, // --
+ kExprCallImport, 0, // --
+ kExprGetLocal, 0, // --
+ kExprGetLocal, 1, // --
+ kExprGetLocal, 2, // --
+ kExprGetLocal, 3, // --
+ kExprGetLocal, 4, // --
+ kExprGetLocal, 5, // --
+ kExprGetLocal, 6, // --
+ kExprGetLocal, 7, // --
+ kExprGetLocal, 8, // --
+ kExprGetLocal, 9 // --
+ ]) // --
+ .exportFunc();
+
+ return builder.instantiate({func: func}).exports.main;
+}
+
+
+function print10(a, b, c, d, e, f, g, h, i) {
+ print(a + ",", b + ",", c + ",", d + ",", e + ",", f + ",", g + ",", h + ",", i);
+ gc();
+ print(a + ",", b + ",", c + ",", d + ",", e + ",", f + ",", g + ",", h + ",", i);
+}
+
+(function I32Test() {
+ var main = makeFFI(print10, kAstI32);
+ for (var i = 1; i < 0xFFFFFFF; i <<= 2) {
+ main(i - 1, i, i + 2, i + 3, i + 4, i + 5, i + 6, i + 7, i + 8);
+ }
+})();
+
+(function F32Test() {
+ var main = makeFFI(print10, kAstF32);
+ for (var i = 1; i < 2e+30; i *= -157) {
+ main(i - 1, i, i + 2, i + 3, i + 4, i + 5, i + 6, i + 7, i + 8);
+ }
+})();
+
+(function I32Test() {
+ var main = makeFFI(print10, kAstF64);
+ for (var i = 1; i < 2e+80; i *= -1137) {
+ main(i - 1, i, i + 2, i + 3, i + 4, i + 5, i + 6, i + 7, i + 8);
+ }
+})();
diff --git a/test/mjsunit/wasm/import-table.js b/test/mjsunit/wasm/import-table.js
index 33d1c35..7579901 100644
--- a/test/mjsunit/wasm/import-table.js
+++ b/test/mjsunit/wasm/import-table.js
@@ -5,49 +5,25 @@
// Flags: --expose-wasm
load("test/mjsunit/wasm/wasm-constants.js");
+load("test/mjsunit/wasm/wasm-module-builder.js");
function testCallImport(func, check) {
- var kBodySize = 6;
- var kNameFunOffset = 29 + kBodySize + 1;
- var kNameMainOffset = kNameFunOffset + 4;
+ var builder = new WasmModuleBuilder();
- var ffi = new Object();
- ffi.fun = func;
+ var sig_index = builder.addSignature([kAstI32, kAstF64, kAstF64]);
+ builder.addImport("func", sig_index);
+ builder.addFunction("main", sig_index)
+ .addBody([
+ kExprCallImport, 0, // --
+ kExprGetLocal, 0, // --
+ kExprGetLocal, 1]) // --
+ .exportAs("main");
- var data = bytes(
- // signatures
- kDeclSignatures, 1,
- 2, kAstI32, kAstF64, kAstF64, // (f64,f64) -> int
- // -- main function
- kDeclFunctions,
- 1,
- kDeclFunctionName | kDeclFunctionExport,
- 0, 0,
- kNameMainOffset, 0, 0, 0, // name offset
- kBodySize, 0,
- // main body
- kExprCallImport, 0, // --
- kExprGetLocal, 0, // --
- kExprGetLocal, 1, // --
- // imports
- kDeclImportTable,
- 1,
- 0, 0, // sig index
- 0, 0, 0, 0, // module name offset
- kNameFunOffset, 0, 0, 0, // function name offset
- // names
- kDeclEnd,
- 'f', 'u', 'n', 0, // --
- 'm', 'a', 'i', 'n', 0 // --
- );
-
- var module = _WASMEXP_.instantiateModule(data, ffi);
-
- assertEquals("function", typeof module.main);
+ var main = builder.instantiate({func: func}).exports.main;
for (var i = 0; i < 100000; i += 10003) {
var a = 22.5 + i, b = 10.5 + i;
- var r = module.main(a, b);
+ var r = main(a, b);
check(r, a, b);
}
}
@@ -192,10 +168,6 @@
function testCallBinopVoid(type, func, check) {
- var kBodySize = 10;
- var kNameFunOffset = 28 + kBodySize + 1;
- var kNameMainOffset = kNameFunOffset + 4;
-
var ffi = new Object();
var passed_length = -1;
@@ -204,7 +176,7 @@
var args_a = -1;
var args_b = -1;
- ffi.fun = function(a, b) {
+ ffi.func = function(a, b) {
passed_length = arguments.length;
passed_a = a;
passed_b = b;
@@ -212,42 +184,25 @@
args_b = arguments[1];
}
- var data = bytes(
- // -- signatures
- kDeclSignatures, 2,
- 2, kAstStmt, type, type, // (type,type)->void
- 2, kAstI32, type, type, // (type,type)->int
- // -- foreign function
- kDeclFunctions, 2,
- kDeclFunctionName | kDeclFunctionImport,
- 0, 0, // signature index
- kNameFunOffset, 0, 0, 0, // name offset
- // -- main function
- kDeclFunctionName | kDeclFunctionExport,
- 1, 0, // signature index
- kNameMainOffset, 0, 0, 0, // name offset
- kBodySize, 0, // body size
- // main body
- kExprBlock, 2, // --
- kExprCallFunction, 0, // --
- kExprGetLocal, 0, // --
- kExprGetLocal, 1, // --
- kExprI8Const, 99, // --
- // names
- kDeclEnd,
- 'f', 'u', 'n', 0, // --
- 'm', 'a', 'i', 'n', 0 // --
- );
+ var builder = new WasmModuleBuilder();
- var module = _WASMEXP_.instantiateModule(data, ffi);
+ builder.addImport("func", [kAstStmt, type, type]);
+ builder.addFunction("main", [kAstI32, type, type])
+ .addBody([
+ kExprBlock, 2, // --
+ kExprCallImport, 0, // --
+ kExprGetLocal, 0, // --
+ kExprGetLocal, 1, // --
+ kExprI8Const, 99])
+ .exportFunc("main");
- assertEquals("function", typeof module.main);
+ var main = builder.instantiate(ffi).exports.main;
print("testCallBinopVoid", type);
for (var i = 0; i < 100000; i += 10003.1) {
var a = 22.5 + i, b = 10.5 + i;
- var r = module.main(a, b);
+ var r = main(a, b);
assertEquals(99, r);
assertEquals(2, passed_length);
var expected_a, expected_b;
@@ -285,50 +240,22 @@
function testCallPrint() {
- var kBodySize = 10;
- var kNamePrintOffset = 10 + 7 + 7 + 9 + kBodySize + 1;
- var kNameMainOffset = kNamePrintOffset + 6;
+ var builder = new WasmModuleBuilder();
+ builder.addImport("print", [kAstStmt, kAstI32]);
+ builder.addImport("print", [kAstStmt, kAstF64]);
+ builder.addFunction("main", [kAstStmt, kAstF64])
+ .addBody([
+ kExprBlock, 2, // --
+ kExprCallImport, 0, // --
+ kExprI8Const, 97, // --
+ kExprCallImport, 1, // --
+ kExprGetLocal, 0]) // --
+ .exportFunc();
- var ffi = new Object();
- ffi.print = print;
+ var main = builder.instantiate({print: print}).exports.main;
- var data = bytes(
- // -- signatures
- kDeclSignatures, 2,
- 1, kAstStmt, kAstI32, // i32->void
- 1, kAstStmt, kAstF64, // f64->int
- kDeclFunctions, 3,
- // -- import print i32
- kDeclFunctionName | kDeclFunctionImport,
- 0, 0, // signature index
- kNamePrintOffset, 0, 0, 0, // name offset
- // -- import print f64
- kDeclFunctionName | kDeclFunctionImport,
- 1, 0, // signature index
- kNamePrintOffset, 0, 0, 0, // name offset
- // -- decl main
- kDeclFunctionName | kDeclFunctionExport,
- 1, 0, // signature index
- kNameMainOffset, 0, 0, 0, // name offset
- kBodySize, 0, // body size
- // main body
- kExprBlock, 2, // --
- kExprCallFunction, 0, // --
- kExprI8Const, 97, // --
- kExprCallFunction, 1, // --
- kExprGetLocal, 0, // --
- // names
- kDeclEnd,
- 'p', 'r', 'i', 'n', 't', 0, // --
- 'm', 'a', 'i', 'n', 0 // --
- );
-
- var module = _WASMEXP_.instantiateModule(data, ffi);
-
- assertEquals("function", typeof module.main);
-
- for (var i = -9; i < 900; i += 6.125) {
- module.main(i);
+ for (var i = -9; i < 900; i += 16.125) {
+ main(i);
}
}
@@ -337,51 +264,19 @@
function testCallImport2(foo, bar, expected) {
- var kBodySize = 5;
- var kNameFooOffset = 37 + kBodySize + 1;
- var kNameBarOffset = kNameFooOffset + 4;
- var kNameMainOffset = kNameBarOffset + 4;
+ var builder = new WasmModuleBuilder();
- var ffi = new Object();
- ffi.foo = foo;
- ffi.bar = bar;
+ builder.addImport("foo", [kAstI32]);
+ builder.addImport("bar", [kAstI32]);
+ builder.addFunction("main", [kAstI32])
+ .addBody([
+ kExprI32Add, // --
+ kExprCallImport, 0, // --
+ kExprCallImport, 1]) // --
+ .exportFunc();
- var data = bytes(
- // signatures
- kDeclSignatures, 1,
- 0, kAstI32, // void -> i32
- // -- main function
- kDeclFunctions,
- 1,
- kDeclFunctionName | kDeclFunctionExport,
- 0, 0,
- kNameMainOffset, 0, 0, 0, // name offset
- kBodySize, 0,
- // main body
- kExprI32Add, // --
- kExprCallImport, 0, // --
- kExprCallImport, 1, // --
- // imports
- kDeclImportTable,
- 2,
- 0, 0, // sig index
- 0, 0, 0, 0, // module name offset
- kNameFooOffset, 0, 0, 0, // function name offset
- 0, 0, // sig index
- 0, 0, 0, 0, // module name offset
- kNameBarOffset, 0, 0, 0, // function name offset
- // names
- kDeclEnd,
- 'f', 'o', 'o', 0, // --
- 'b', 'a', 'r', 0, // --
- 'm', 'a', 'i', 'n', 0 // --
- );
-
- var module = _WASMEXP_.instantiateModule(data, ffi);
-
- assertEquals("function", typeof module.main);
-
- assertEquals(expected, module.main());
+ var main = builder.instantiate({foo: foo, bar: bar}).exports.main;
+ assertEquals(expected, main());
}
testCallImport2(function() { return 33; }, function () { return 44; }, 77);
diff --git a/test/mjsunit/wasm/indirect-calls.js b/test/mjsunit/wasm/indirect-calls.js
index 560c8ba..3258687 100644
--- a/test/mjsunit/wasm/indirect-calls.js
+++ b/test/mjsunit/wasm/indirect-calls.js
@@ -5,69 +5,42 @@
// Flags: --expose-wasm
load("test/mjsunit/wasm/wasm-constants.js");
+load("test/mjsunit/wasm/wasm-module-builder.js");
var module = (function () {
- var kFuncWithBody = 9;
- var kFuncImported = 7;
- var kBodySize1 = 5;
- var kBodySize2 = 8;
- var kFuncTableSize = 8;
- var kSubOffset = 13 + kFuncWithBody + kBodySize1 + kFuncImported + kFuncWithBody + kBodySize2 + kFuncTableSize + 1;
- var kAddOffset = kSubOffset + 4;
- var kMainOffset = kAddOffset + 4;
+ var builder = new WasmModuleBuilder();
- var ffi = new Object();
- ffi.add = (function(a, b) { return a + b | 0; });
+ var sig_index = builder.addSignature([kAstI32, kAstI32, kAstI32]);
+ builder.addImport("add", sig_index);
+ builder.addFunction("add", sig_index)
+ .addBody([
+ kExprCallImport, 0, kExprGetLocal, 0, kExprGetLocal, 1
+ ]);
+ builder.addFunction("sub", sig_index)
+ .addBody([
+ kExprI32Sub, kExprGetLocal, 0, kExprGetLocal, 1
+ ]);
+ builder.addFunction("main", [kAstI32, kAstI32, kAstI32, kAstI32])
+ .addBody([
+ kExprCallIndirect, sig_index,
+ kExprGetLocal, 0,
+ kExprGetLocal, 1,
+ kExprGetLocal, 2])
+ .exportFunc()
+ builder.appendToFunctionTable([0, 1, 2]);
- return _WASMEXP_.instantiateModule(bytes(
- // -- signatures
- kDeclSignatures, 2,
- 2, kAstI32, kAstI32, kAstI32, // int, int -> int
- 3, kAstI32, kAstI32, kAstI32, kAstI32, // int, int, int -> int
- // -- function #0 (sub)
- kDeclFunctions, 3,
- kDeclFunctionName,
- 0, 0, // signature offset
- kSubOffset, 0, 0, 0, // name offset
- kBodySize1, 0, // body size
- kExprI32Sub, // --
- kExprGetLocal, 0, // --
- kExprGetLocal, 1, // --
- // -- function #1 (add)
- kDeclFunctionName | kDeclFunctionImport,
- 0, 0, // signature offset
- kAddOffset, 0, 0, 0, // name offset
- // -- function #2 (main)
- kDeclFunctionName | kDeclFunctionExport,
- 1, 0, // signature offset
- kMainOffset, 0, 0, 0, // name offset
- kBodySize2, 0, // body size
- kExprCallIndirect, 0,
- kExprGetLocal, 0,
- kExprGetLocal, 1,
- kExprGetLocal, 2,
- // -- function table
- kDeclFunctionTable,
- 3,
- 0, 0,
- 1, 0,
- 2, 0,
- kDeclEnd,
- 's', 'u', 'b', 0, // name
- 'a', 'd', 'd', 0, // name
- 'm', 'a', 'i', 'n', 0 // name
- ), ffi);
+ return builder.instantiate({add: function(a, b) { return a + b | 0; }});
})();
// Check the module exists.
assertFalse(module === undefined);
assertFalse(module === null);
assertFalse(module === 0);
-assertEquals("object", typeof module);
-assertEquals("function", typeof module.main);
+assertEquals("object", typeof module.exports);
+assertEquals("function", typeof module.exports.main);
-assertEquals(5, module.main(0, 12, 7));
-assertEquals(19, module.main(1, 12, 7));
+assertEquals(5, module.exports.main(1, 12, 7));
+assertEquals(19, module.exports.main(0, 12, 7));
-assertTraps(kTrapFuncSigMismatch, "module.main(2, 12, 33)");
-assertTraps(kTrapFuncInvalid, "module.main(3, 12, 33)");
+assertTraps(kTrapFuncSigMismatch, "module.exports.main(2, 12, 33)");
+assertTraps(kTrapFuncInvalid, "module.exports.main(3, 12, 33)");
diff --git a/test/mjsunit/wasm/instantiate-module-basic.js b/test/mjsunit/wasm/instantiate-module-basic.js
index 13a2261..bc13122 100644
--- a/test/mjsunit/wasm/instantiate-module-basic.js
+++ b/test/mjsunit/wasm/instantiate-module-basic.js
@@ -5,33 +5,20 @@
// Flags: --expose-wasm
load("test/mjsunit/wasm/wasm-constants.js");
+load("test/mjsunit/wasm/wasm-module-builder.js");
var kReturnValue = 117;
-var kBodySize = 2;
-var kNameOffset = 19 + kBodySize + 1;
+var module = (function Build() {
+ var builder = new WasmModuleBuilder();
-var data = bytes(
- // -- memory
- kDeclMemory,
- 10, 10, 1,
- // -- signatures
- kDeclSignatures, 1,
- 0, kAstI32, // signature: void -> int
- // -- main function
- kDeclFunctions, 1,
- kDeclFunctionName | kDeclFunctionExport,
- 0, 0, // signature index
- kNameOffset, 0, 0, 0, // name offset
- kBodySize, 0, // body size
- // -- body
- kExprI8Const, // --
- kReturnValue, // --
- kDeclEnd,
- 'm', 'a', 'i', 'n', 0 // name
-);
+ builder.addMemory(1, 1, true);
+ builder.addFunction("main", [kAstI32])
+ .addBody([kExprI8Const, kReturnValue])
+ .exportFunc();
-var module = _WASMEXP_.instantiateModule(data);
+ return builder.instantiate();
+})();
// Check the module exists.
assertFalse(module === undefined);
@@ -40,23 +27,24 @@
assertEquals("object", typeof module);
// Check the memory is an ArrayBuffer.
-var mem = module.memory;
+var mem = module.exports.memory;
assertFalse(mem === undefined);
assertFalse(mem === null);
assertFalse(mem === 0);
assertEquals("object", typeof mem);
assertTrue(mem instanceof ArrayBuffer);
for (var i = 0; i < 4; i++) {
- module.memory = 0; // should be ignored
- assertEquals(mem, module.memory);
+ module.exports.memory = 0; // should be ignored
+ assertEquals(mem, module.exports.memory);
}
-assertEquals(1024, module.memory.byteLength);
+assertEquals(65536, module.exports.memory.byteLength);
// Check the properties of the main function.
-assertFalse(module.main === undefined);
-assertFalse(module.main === null);
-assertFalse(module.main === 0);
-assertEquals("function", typeof module.main);
+var main = module.exports.main;
+assertFalse(main === undefined);
+assertFalse(main === null);
+assertFalse(main === 0);
+assertEquals("function", typeof main);
-assertEquals(kReturnValue, module.main());
+assertEquals(kReturnValue, main());
diff --git a/test/mjsunit/wasm/instantiate-run-basic.js b/test/mjsunit/wasm/instantiate-run-basic.js
index b103e8f..2e649a0 100644
--- a/test/mjsunit/wasm/instantiate-run-basic.js
+++ b/test/mjsunit/wasm/instantiate-run-basic.js
@@ -5,27 +5,16 @@
// Flags: --expose-wasm
load("test/mjsunit/wasm/wasm-constants.js");
+load("test/mjsunit/wasm/wasm-module-builder.js");
-var kReturnValue = 97;
+(function BasicTest() {
+ var kReturnValue = 107;
+ var builder = new WasmModuleBuilder();
-var kBodySize = 2;
-var kNameOffset = 15 + kBodySize + 1;
+ builder.addFunction("main", [kAstI32])
+ .addBody([kExprI8Const, kReturnValue])
+ .exportFunc();
-var data = bytes(
- // -- signatures
- kDeclSignatures, 1,
- 0, kAstI32, // signature: void -> int
- // -- main function
- kDeclFunctions, 1,
- kDeclFunctionName | kDeclFunctionExport,
- 0, 0, // signature index
- kNameOffset, 0, 0, 0, // name offset
- kBodySize, 0, // body size
- // -- body
- kExprI8Const, // --
- kReturnValue, // --
- kDeclEnd,
- 'm', 'a', 'i', 'n', 0 // name
-);
-
-assertEquals(kReturnValue, _WASMEXP_.instantiateModule(data).main());
+ var main = builder.instantiate().exports.main;
+ assertEquals(kReturnValue, main());
+})();
diff --git a/test/mjsunit/wasm/module-memory.js b/test/mjsunit/wasm/module-memory.js
index e9c1404..ef85eb2 100644
--- a/test/mjsunit/wasm/module-memory.js
+++ b/test/mjsunit/wasm/module-memory.js
@@ -5,52 +5,36 @@
// Flags: --expose-wasm --expose-gc --stress-compaction
load("test/mjsunit/wasm/wasm-constants.js");
+load("test/mjsunit/wasm/wasm-module-builder.js");
-var kMemSize = 4096;
+var kMemSize = 65536;
function genModule(memory) {
- var kBodySize = 27;
- var kNameMainOffset = 28 + kBodySize + 1;
+ var builder = new WasmModuleBuilder();
- var data = bytes(
- kDeclMemory,
- 12, 12, 1, // memory
- // -- signatures
- kDeclSignatures, 1,
- 1, kAstI32, kAstI32, // int->int
- // -- main function
- kDeclFunctions, 1,
- kDeclFunctionLocals | kDeclFunctionName | kDeclFunctionExport,
- 0, 0,
- kNameMainOffset, 0, 0, 0, // name offset
- 1, 0, // local int32 count
- 0, 0, // local int64 count
- 0, 0, // local float32 count
- 0, 0, // local float64 count
- kBodySize, 0, // code size
- // main body: while(i) { if(mem[i]) return -1; i -= 4; } return 0;
- kExprBlock,2,
- kExprLoop,1,
- kExprIf,
- kExprGetLocal,0,
- kExprBr, 0,
- kExprIfElse,
- kExprI32LoadMem,0,kExprGetLocal,0,
- kExprBr,2, kExprI8Const, 255,
- kExprSetLocal,0,
- kExprI32Sub,kExprGetLocal,0,kExprI8Const,4,
- kExprI8Const,0,
- // names
- kDeclEnd,
- 'm', 'a', 'i', 'n', 0 // --
- );
+ builder.addMemory(1, 1, true);
+ builder.addFunction("main", [kAstI32, kAstI32])
+ .addBody([
+ kExprBlock,2,
+ kExprLoop,1,
+ kExprIf,
+ kExprGetLocal,0,
+ kExprBr, 0,
+ kExprIfElse,
+ kExprI32LoadMem,0,0,kExprGetLocal,0,
+ kExprBr,2, kExprI8Const, 255,
+ kExprSetLocal,0,
+ kExprI32Sub,kExprGetLocal,0,kExprI8Const,4,
+ kExprI8Const,0])
+ .exportFunc();
- return _WASMEXP_.instantiateModule(data, null, memory);
+ return builder.instantiate(null, memory);
}
function testPokeMemory() {
var module = genModule(null);
- var buffer = module.memory;
+ var buffer = module.exports.memory;
+ var main = module.exports.main;
assertEquals(kMemSize, buffer.byteLength);
var array = new Int8Array(buffer);
@@ -61,21 +45,21 @@
}
for (var i = 0; i < 10; i++) {
- assertEquals(0, module.main(kMemSize - 4));
+ assertEquals(0, main(kMemSize - 4));
array[kMemSize/2 + i] = 1;
- assertEquals(0, module.main(kMemSize/2 - 4));
- assertEquals(-1, module.main(kMemSize - 4));
+ assertEquals(0, main(kMemSize/2 - 4));
+ assertEquals(-1, main(kMemSize - 4));
array[kMemSize/2 + i] = 0;
- assertEquals(0, module.main(kMemSize - 4));
+ assertEquals(0, main(kMemSize - 4));
}
}
testPokeMemory();
function testSurvivalAcrossGc() {
- var checker = genModule(null).main;
+ var checker = genModule(null).exports.main;
for (var i = 0; i < 5; i++) {
print("gc run ", i);
assertEquals(0, checker(kMemSize - 4));
@@ -92,6 +76,7 @@
function testPokeOuterMemory() {
var buffer = new ArrayBuffer(kMemSize);
var module = genModule(buffer);
+ var main = module.exports.main;
assertEquals(kMemSize, buffer.byteLength);
var array = new Int8Array(buffer);
@@ -102,14 +87,14 @@
}
for (var i = 0; i < 10; i++) {
- assertEquals(0, module.main(kMemSize - 4));
+ assertEquals(0, main(kMemSize - 4));
array[kMemSize/2 + i] = 1;
- assertEquals(0, module.main(kMemSize/2 - 4));
- assertEquals(-1, module.main(kMemSize - 4));
+ assertEquals(0, main(kMemSize/2 - 4));
+ assertEquals(-1, main(kMemSize - 4));
array[kMemSize/2 + i] = 0;
- assertEquals(0, module.main(kMemSize - 4));
+ assertEquals(0, main(kMemSize - 4));
}
}
@@ -117,7 +102,7 @@
function testOuterMemorySurvivalAcrossGc() {
var buffer = new ArrayBuffer(kMemSize);
- var checker = genModule(buffer).main;
+ var checker = genModule(buffer).exports.main;
for (var i = 0; i < 5; i++) {
print("gc run ", i);
assertEquals(0, checker(kMemSize - 4));
@@ -132,47 +117,29 @@
function testOOBThrows() {
- var kBodySize = 8;
- var kNameMainOffset = 29 + kBodySize + 1;
+ var builder = new WasmModuleBuilder();
- var data = bytes(
- kDeclMemory,
- 12, 12, 1, // memory = 4KB
- // -- signatures
- kDeclSignatures, 1,
- 2, kAstI32, kAstI32, kAstI32, // int->int
- // -- main function
- kDeclFunctions, 1,
- kDeclFunctionLocals | kDeclFunctionName | kDeclFunctionExport,
- 0, 0,
- kNameMainOffset, 0, 0, 0, // name offset
- 1, 0, // local int32 count
- 0, 0, // local int64 count
- 0, 0, // local float32 count
- 0, 0, // local float64 count
- kBodySize, 0, // code size
- // geti: return mem[a] = mem[b]
- kExprI32StoreMem, 0, kExprGetLocal, 0, kExprI32LoadMem, 0, kExprGetLocal, 1,
- // names
- kDeclEnd,
- 'g','e','t','i', 0 // --
- );
+ builder.addMemory(1, 1, true);
+ builder.addFunction("geti", [kAstI32, kAstI32, kAstI32])
+ .addBody([
+ kExprI32StoreMem, 0, 0, kExprGetLocal, 0, kExprI32LoadMem, 0, 0, kExprGetLocal, 1
+ ])
+ .exportFunc();
- var memory = null;
- var module = _WASMEXP_.instantiateModule(data, null, memory);
+ var module = builder.instantiate();
var offset;
- function read() { return module.geti(0, offset); }
- function write() { return module.geti(offset, 0); }
+ function read() { return module.exports.geti(0, offset); }
+ function write() { return module.exports.geti(offset, 0); }
- for (offset = 0; offset < 4092; offset++) {
+ for (offset = 0; offset < 65533; offset++) {
assertEquals(0, read());
assertEquals(0, write());
}
- for (offset = 4093; offset < 4124; offset++) {
+ for (offset = 65534; offset < 66536; offset++) {
assertTraps(kTrapMemOutOfBounds, read);
assertTraps(kTrapMemOutOfBounds, write);
}
diff --git a/test/mjsunit/wasm/params.js b/test/mjsunit/wasm/params.js
index 52d6214..7c2b3d1 100644
--- a/test/mjsunit/wasm/params.js
+++ b/test/mjsunit/wasm/params.js
@@ -5,54 +5,39 @@
// Flags: --expose-wasm
load("test/mjsunit/wasm/wasm-constants.js");
+load("test/mjsunit/wasm/wasm-module-builder.js");
-function runSelect2(module, which, a, b) {
- assertEquals(which == 0 ? a : b, module.select(a, b));
+function runSelect2(select, which, a, b) {
+ assertEquals(which == 0 ? a : b, select(a, b));
}
function testSelect2(type) {
- var kBodySize = 2;
- var kNameOffset = 21 + kBodySize + 1;
-
for (var which = 0; which < 2; which++) {
print("type = " + type + ", which = " + which);
- var data = bytes(
- // -- memory
- kDeclMemory,
- 12, 12, 1, // memory
- // -- signatures
- kDeclSignatures, 1,
- 2, type, type, type, // signature: (t,t)->t
- // -- select
- kDeclFunctions, 1,
- kDeclFunctionName | kDeclFunctionExport,
- 0, 0,
- kNameOffset, 0, 0, 0, // name offset
- kBodySize, 0, // body size
- kExprGetLocal, which, // --
- kDeclEnd,
- 's','e','l','e','c','t',0 // name
- );
+ var builder = new WasmModuleBuilder();
- var module = _WASMEXP_.instantiateModule(data);
+ builder.addFunction("select", [type, type, type])
+ .addBody([kExprGetLocal, which])
+ .exportFunc()
- assertEquals("function", typeof module.select);
- runSelect2(module, which, 99, 97);
- runSelect2(module, which, -99, -97);
+ var select = builder.instantiate().exports.select;
+
+ runSelect2(select, which, 99, 97);
+ runSelect2(select, which, -99, -97);
if (type != kAstF32) {
- runSelect2(module, which, 0x80000000 | 0, 0x7fffffff | 0);
- runSelect2(module, which, 0x80000001 | 0, 0x7ffffffe | 0);
- runSelect2(module, which, 0xffffffff | 0, 0xfffffffe | 0);
- runSelect2(module, which, -2147483647, 2147483646);
- runSelect2(module, which, -2147483646, 2147483645);
- runSelect2(module, which, -2147483648, 2147483647);
+ runSelect2(select, which, 0x80000000 | 0, 0x7fffffff | 0);
+ runSelect2(select, which, 0x80000001 | 0, 0x7ffffffe | 0);
+ runSelect2(select, which, 0xffffffff | 0, 0xfffffffe | 0);
+ runSelect2(select, which, -2147483647, 2147483646);
+ runSelect2(select, which, -2147483646, 2147483645);
+ runSelect2(select, which, -2147483648, 2147483647);
}
if (type != kAstI32 && type != kAstI64) {
- runSelect2(module, which, -1.25, 5.25);
- runSelect2(module, which, Infinity, -Infinity);
+ runSelect2(select, which, -1.25, 5.25);
+ runSelect2(select, which, Infinity, -Infinity);
}
}
}
@@ -63,20 +48,20 @@
testSelect2(kAstF64);
-function runSelect10(module, which, a, b) {
+function runSelect10(select, which, a, b) {
var x = -1;
var result = [
- module.select(a, b, x, x, x, x, x, x, x, x),
- module.select(x, a, b, x, x, x, x, x, x, x),
- module.select(x, x, a, b, x, x, x, x, x, x),
- module.select(x, x, x, a, b, x, x, x, x, x),
- module.select(x, x, x, x, a, b, x, x, x, x),
- module.select(x, x, x, x, x, a, b, x, x, x),
- module.select(x, x, x, x, x, x, a, b, x, x),
- module.select(x, x, x, x, x, x, x, a, b, x),
- module.select(x, x, x, x, x, x, x, x, a, b),
- module.select(x, x, x, x, x, x, x, x, x, a)
+ select(a, b, x, x, x, x, x, x, x, x),
+ select(x, a, b, x, x, x, x, x, x, x),
+ select(x, x, a, b, x, x, x, x, x, x),
+ select(x, x, x, a, b, x, x, x, x, x),
+ select(x, x, x, x, a, b, x, x, x, x),
+ select(x, x, x, x, x, a, b, x, x, x),
+ select(x, x, x, x, x, x, a, b, x, x),
+ select(x, x, x, x, x, x, x, a, b, x),
+ select(x, x, x, x, x, x, x, x, a, b),
+ select(x, x, x, x, x, x, x, x, x, a)
];
for (var i = 0; i < 10; i++) {
@@ -86,49 +71,36 @@
}
}
-function testSelect10(type) {
+function testSelect10(t) {
var kBodySize = 2;
- var kNameOffset = 29 + kBodySize + 1;
+ var kNameOffset = kHeaderSize + 29 + kBodySize + 1;
for (var which = 0; which < 10; which++) {
- print("type = " + type + ", which = " + which);
+ print("type = " + t + ", which = " + which);
- var t = type;
- var data = bytes(
- kDeclMemory,
- 12, 12, 1, // memory
- // signatures
- kDeclSignatures, 1,
- 10, t,t,t,t,t,t,t,t,t,t,t, // (tx10)->t
- // main function
- kDeclFunctions, 1,
- kDeclFunctionName | kDeclFunctionExport,
- 0, 0,
- kNameOffset, 0, 0, 0, // name offset
- kBodySize, 0, // body size
- kExprGetLocal, which, // --
- kDeclEnd,
- 's','e','l','e','c','t',0 // name
- );
+ var builder = new WasmModuleBuilder();
+ builder.addFunction("select", [t,t,t,t,t,t,t,t,t,t,t])
+ .addBody([kExprGetLocal, which])
+ .exportFunc();
- var module = _WASMEXP_.instantiateModule(data);
+ var select = builder.instantiate().exports.select;
- assertEquals("function", typeof module.select);
- runSelect10(module, which, 99, 97);
- runSelect10(module, which, -99, -97);
+ assertEquals("function", typeof select);
+ runSelect10(select, which, 99, 97);
+ runSelect10(select, which, -99, -97);
- if (type != kAstF32) {
- runSelect10(module, which, 0x80000000 | 0, 0x7fffffff | 0);
- runSelect10(module, which, 0x80000001 | 0, 0x7ffffffe | 0);
- runSelect10(module, which, 0xffffffff | 0, 0xfffffffe | 0);
- runSelect10(module, which, -2147483647, 2147483646);
- runSelect10(module, which, -2147483646, 2147483645);
- runSelect10(module, which, -2147483648, 2147483647);
+ if (t != kAstF32) {
+ runSelect10(select, which, 0x80000000 | 0, 0x7fffffff | 0);
+ runSelect10(select, which, 0x80000001 | 0, 0x7ffffffe | 0);
+ runSelect10(select, which, 0xffffffff | 0, 0xfffffffe | 0);
+ runSelect10(select, which, -2147483647, 2147483646);
+ runSelect10(select, which, -2147483646, 2147483645);
+ runSelect10(select, which, -2147483648, 2147483647);
}
- if (type != kAstI32 && type != kAstI64) {
- runSelect10(module, which, -1.25, 5.25);
- runSelect10(module, which, Infinity, -Infinity);
+ if (t != kAstI32 && t != kAstI64) {
+ runSelect10(select, which, -1.25, 5.25);
+ runSelect10(select, which, Infinity, -Infinity);
}
}
}
diff --git a/test/mjsunit/wasm/stack.js b/test/mjsunit/wasm/stack.js
index d4b72c0..ed05517 100644
--- a/test/mjsunit/wasm/stack.js
+++ b/test/mjsunit/wasm/stack.js
@@ -5,44 +5,14 @@
// Flags: --expose-wasm
load("test/mjsunit/wasm/wasm-constants.js");
+load("test/mjsunit/wasm/wasm-module-builder.js");
-function testStack(func, check) {
- var kBodySize = 2;
- var kNameFunOffset = 22 + kBodySize + 1;
- var kNameMainOffset = kNameFunOffset + 4;
-
- var ffi = new Object();
- ffi.fun = func;
-
- var data = bytes(
- // signatures
- kDeclSignatures, 1, // --
- 0, kAstStmt, // () -> void
- // -- foreign function
- kDeclFunctions, 2, // --
- kDeclFunctionName | kDeclFunctionImport, // --
- 0, 0, // --
- kNameFunOffset, 0, 0, 0, // name offset
- // -- main function
- kDeclFunctionName | kDeclFunctionExport, // --
- 0, 0, // --
- kNameMainOffset, 0, 0, 0, // name offset
- kBodySize, 0,
- // main body
- kExprCallFunction, 0, // --
- // names
- kDeclEnd, // --
- 'f', 'u', 'n', 0, // --
- 'm', 'a', 'i', 'n', 0 // --
- );
-
- var module = _WASMEXP_.instantiateModule(data, ffi);
-
- assertEquals("function", typeof module.main);
-
- module.main();
- check();
-}
+var expected = "Error\n" +
+ // The line numbers below will change as this test gains / loses lines..
+ " at STACK (stack.js:24:11)\n" + // --
+ " at <WASM> (<anonymous>)\n" + // TODO(jfb): wasm stack here.
+ " at testStack (stack.js:38:18)\n" + // --
+ " at stack.js:40:3"; // --
// The stack trace contains file path, only keep "stack.js".
function stripPath(s) {
@@ -55,15 +25,16 @@
stack = e.stack;
}
-function check_STACK() {
+(function testStack() {
+ var builder = new WasmModuleBuilder();
+
+ builder.addImport("func", [kAstStmt]);
+
+ builder.addFunction(undefined, [kAstStmt])
+ .addBody([kExprCallImport, 0])
+ .exportAs("main");
+
+ var module = builder.instantiate({func: STACK});
+ module.exports.main();
assertEquals(expected, stripPath(stack));
-}
-
-var expected = "Error\n" +
- // The line numbers below will change as this test gains / loses lines..
- " at STACK (stack.js:54:11)\n" + // --
- " at testStack (stack.js:43:10)\n" +
- // TODO(jfb) Add WebAssembly stack here.
- " at stack.js:69:1";
-
-testStack(STACK, check_STACK);
+})();
diff --git a/test/mjsunit/wasm/stackwalk.js b/test/mjsunit/wasm/stackwalk.js
index e863b07..8b8fb7e 100644
--- a/test/mjsunit/wasm/stackwalk.js
+++ b/test/mjsunit/wasm/stackwalk.js
@@ -5,44 +5,21 @@
// Flags: --expose-wasm --expose-gc --allow-natives-syntax
load("test/mjsunit/wasm/wasm-constants.js");
+load("test/mjsunit/wasm/wasm-module-builder.js");
function makeFFI(func) {
- var kBodySize = 6;
- var kNameFunOffset = 24 + kBodySize + 1;
- var kNameMainOffset = kNameFunOffset + 4;
+ var builder = new WasmModuleBuilder();
- var ffi = new Object();
- ffi.fun = func;
+ var sig_index = builder.addSignature([kAstI32, kAstF64, kAstF64]);
+ builder.addImport("func", sig_index);
+ builder.addFunction("main", sig_index)
+ .addBody([
+ kExprCallImport, 0, // --
+ kExprGetLocal, 0, // --
+ kExprGetLocal, 1]) // --
+ .exportFunc()
- var data = bytes(
- // signatures
- kDeclSignatures, 1,
- 2, kAstI32, kAstF64, kAstF64, // (f64,f64) -> int
- // -- foreign function
- kDeclFunctions, 2,
- kDeclFunctionName | kDeclFunctionImport,
- 0, 0,
- kNameFunOffset, 0, 0, 0, // name offset
- // -- main function
- kDeclFunctionName | kDeclFunctionExport,
- 0, 0,
- kNameMainOffset, 0, 0, 0, // name offset
- kBodySize, 0,
- // main body
- kExprCallFunction, 0, // --
- kExprGetLocal, 0, // --
- kExprGetLocal, 1, // --
- // names
- kDeclEnd,
- 'f', 'u', 'n', 0, // --
- 'm', 'a', 'i', 'n', 0 // --
- );
-
- var module = _WASMEXP_.instantiateModule(data, ffi);
-
- assertEquals("function", typeof module.main);
-
- return module.main;
+ return builder.instantiate({func: func}).exports.main;
}
diff --git a/test/mjsunit/wasm/start-function.js b/test/mjsunit/wasm/start-function.js
index 4008efa..bd4ccf2 100644
--- a/test/mjsunit/wasm/start-function.js
+++ b/test/mjsunit/wasm/start-function.js
@@ -5,33 +5,17 @@
// Flags: --expose-wasm
load("test/mjsunit/wasm/wasm-constants.js");
+load("test/mjsunit/wasm/wasm-module-builder.js");
function instantiate(sig, body) {
- var module = new Array();
- module = module.concat([
- // -- signatures
- kDeclSignatures, 1,
- ]);
- module = module.concat(sig);
- module = module.concat([
- // -- functions
- kDeclFunctions, 1,
- 0, // decl flags
- 0, 0, // signature
- body.length, 0, // body size
- ]);
- module = module.concat(body);
- module = module.concat([
- // -- declare start function
- kDeclStartFunction,
- 0
- ]);
+ var builder = new WasmModuleBuilder();
- var data = bytes.apply(this, module);
- print(module);
- print(data instanceof ArrayBuffer);
- print(data.byteLength);
- return _WASMEXP_.instantiateModule(data);
+ var func = builder.addFunction("", sig)
+ .addBody(body);
+
+ builder.addStart(func.index);
+
+ return builder.instantiate();
}
function assertFails(sig, body) {
@@ -53,120 +37,75 @@
return module;
}
-assertVerifies([0, kAstStmt], [kExprNop]);
-assertVerifies([0, kAstI32], [kExprI8Const, 0]);
+assertVerifies([kAstStmt], [kExprNop]);
+assertVerifies([kAstI32], [kExprI8Const, 0]);
// Arguments aren't allow to start functions.
-assertFails([1, kAstI32, kAstI32], [kExprGetLocal, 0]);
-assertFails([2, kAstI32, kAstI32, kAstF32], [kExprGetLocal, 0]);
-assertFails([3, kAstI32, kAstI32, kAstF32, kAstF64], [kExprGetLocal, 0]);
+assertFails([kAstI32, kAstI32], [kExprGetLocal, 0]);
+assertFails([kAstI32, kAstI32, kAstF32], [kExprGetLocal, 0]);
+assertFails([kAstI32, kAstI32, kAstF32, kAstF64], [kExprGetLocal, 0]);
(function testInvalidIndex() {
- var kBodySize = 1;
- var data = bytes(
- // -- signatures
- kDeclSignatures, 1,
- 0, kAstStmt,
- // -- functions
- kDeclFunctions, 1,
- 0, // decl flags
- 0, 0, // signature
- kBodySize, 0, // body size
- kExprNop, // body
- // -- declare start function
- kDeclStartFunction,
- 1
- );
+ print("testInvalidIndex");
+ var builder = new WasmModuleBuilder();
- assertThrows(function() { _WASMEXP_.instantiateModule(data); });
+ var func = builder.addFunction("", [kAstStmt])
+ .addBody([kExprNop]);
+
+ builder.addStart(func.index + 1);
+
+ assertThrows(builder.instantiate);
})();
(function testTwoStartFuncs() {
- var kBodySize = 1;
- var data = bytes(
- // -- signatures
- kDeclSignatures, 1,
- 0, kAstStmt,
- // -- functions
- kDeclFunctions, 1,
- 0, // decl flags
- 0, 0, // signature
- kBodySize, 0, // body size
- kExprNop, // body
- // -- declare start function
- kDeclStartFunction,
- 0,
- // -- declare start function
- kDeclStartFunction,
- 0
- );
+ print("testTwoStartFuncs");
+ var builder = new WasmModuleBuilder();
- assertThrows(function() { _WASMEXP_.instantiateModule(data); });
+ var func = builder.addFunction("", [kAstStmt])
+ .addBody([kExprNop]);
+
+ builder.addExplicitSection([kDeclStartFunction, 0]);
+ builder.addExplicitSection([kDeclStartFunction, 0]);
+
+ assertThrows(builder.instantiate);
})();
(function testRun() {
- var kBodySize = 6;
+ print("testRun");
+ var builder = new WasmModuleBuilder();
- var data = bytes(
- kDeclMemory,
- 12, 12, 1, // memory
- // -- signatures
- kDeclSignatures, 1,
- 0, kAstStmt,
- // -- start function
- kDeclFunctions, 1,
- 0, // decl flags
- 0, 0, // signature
- kBodySize, 0, // code size
- // -- start body
- kExprI32StoreMem, 0, kExprI8Const, 0, kExprI8Const, 77,
- // -- declare start function
- kDeclStartFunction,
- 0
- );
+ builder.addMemory(12, 12, true);
- var module = _WASMEXP_.instantiateModule(data);
- var memory = module.memory;
+ var func = builder.addFunction("", [kAstStmt])
+ .addBody([kExprI32StoreMem, 0, 0, kExprI8Const, 0, kExprI8Const, 77]);
+
+ builder.addStart(func.index);
+
+ var module = builder.instantiate();
+ var memory = module.exports.memory;
var view = new Int8Array(memory);
assertEquals(77, view[0]);
})();
(function testStartFFI() {
- var kBodySize = 2;
- var kNameOffset = 4 + 9 + 7 + 3;
-
- var data = bytes(
- // -- signatures
- kDeclSignatures, 1,
- 0, kAstStmt,
- // -- imported function
- kDeclFunctions, 2,
- kDeclFunctionImport | kDeclFunctionName, // decl flags
- 0, 0, // signature
- kNameOffset, 0, 0, 0,
- // -- start function
- 0, // decl flags
- 0, 0, // signature
- kBodySize, 0, // code size
- // -- start body
- kExprCallFunction, 0,
- // -- declare start function
- kDeclStartFunction,
- 1,
- kDeclEnd,
- 'f', 'o', 'o', 0
- );
-
+ print("testStartFFI");
var ranned = false;
- var ffi = new Object();
- ffi.foo = function() {
+ var ffi = { foo : function() {
print("we ranned at stert!");
ranned = true;
- }
- var module = _WASMEXP_.instantiateModule(data, ffi);
- var memory = module.memory;
- var view = new Int8Array(memory);
+ }};
+
+ var builder = new WasmModuleBuilder();
+ var sig_index = builder.addSignature([kAstStmt]);
+
+ builder.addImport("foo", sig_index);
+ var func = builder.addFunction("", sig_index)
+ .addBody([kExprCallImport, 0]);
+
+ builder.addStart(func.index);
+
+ var module = builder.instantiate(ffi);
assertTrue(ranned);
})();
diff --git a/test/mjsunit/wasm/test-wasm-module-builder.js b/test/mjsunit/wasm/test-wasm-module-builder.js
new file mode 100644
index 0000000..50797d0
--- /dev/null
+++ b/test/mjsunit/wasm/test-wasm-module-builder.js
@@ -0,0 +1,153 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-wasm
+
+load('test/mjsunit/wasm/wasm-constants.js');
+load('test/mjsunit/wasm/wasm-module-builder.js');
+
+var debug = false;
+
+(function BasicTest() {
+ var module = new WasmModuleBuilder();
+ module.addMemory(1, 2, false);
+ module.addFunction("foo", [kAstI32])
+ .addBody([kExprI8Const, 11])
+ .exportAs("blarg");
+
+ var buffer = module.toBuffer(debug);
+ var instance = Wasm.instantiateModule(buffer);
+ assertEquals(11, instance.exports.blarg());
+})();
+
+(function ImportTest() {
+ var module = new WasmModuleBuilder();
+ var index = module.addImport("print", [kAstStmt, kAstI32]);
+ module.addFunction("foo", [kAstStmt])
+ .addBody([kExprCallImport, index, kExprI8Const, 13])
+ .exportAs("main");
+
+ var buffer = module.toBuffer(debug);
+ var instance = Wasm.instantiateModule(buffer, {print: print});
+ print("should print 13! ");
+ instance.exports.main();
+})();
+
+(function LocalsTest() {
+ var module = new WasmModuleBuilder();
+ module.addFunction(undefined, [kAstI32, kAstI32])
+ .addLocals({i32_count: 1})
+ .addBody([kExprSetLocal, 1, kExprGetLocal, 0])
+ .exportAs("main");
+
+ var buffer = module.toBuffer(debug);
+ var instance = Wasm.instantiateModule(buffer);
+ assertEquals(19, instance.exports.main(19));
+ assertEquals(27777, instance.exports.main(27777));
+})();
+
+(function LocalsTest2() {
+ // TODO(titzer): i64 only works on 64-bit platforms.
+ var types = [
+ {locals: {i32_count: 1}, type: kAstI32},
+// {locals: {i64_count: 1}, type: kAstI64},
+ {locals: {f32_count: 1}, type: kAstF32},
+ {locals: {f64_count: 1}, type: kAstF64},
+ ];
+
+ for (p of types) {
+ var module = new WasmModuleBuilder();
+ module.addFunction(undefined, [p.type, p.type])
+ .addLocals(p.locals)
+ .addBody([kExprSetLocal, 1, kExprGetLocal, 0])
+ .exportAs("main");
+
+ var buffer = module.toBuffer(debug);
+ var instance = Wasm.instantiateModule(buffer);
+ assertEquals(19, instance.exports.main(19));
+ assertEquals(27777, instance.exports.main(27777));
+ }
+})();
+
+(function CallTest() {
+ var module = new WasmModuleBuilder();
+ module.addFunction("add", [kAstI32, kAstI32, kAstI32])
+ .addBody([kExprI32Add, kExprGetLocal, 0, kExprGetLocal, 1]);
+ module.addFunction("main", [kAstI32, kAstI32, kAstI32])
+ .addBody([kExprCallFunction, 0, kExprGetLocal, 0, kExprGetLocal, 1])
+ .exportAs("main");
+
+ var instance = module.instantiate();
+ assertEquals(44, instance.exports.main(11, 33));
+ assertEquals(7777, instance.exports.main(2222, 5555));
+})();
+
+(function IndirectCallTest() {
+ var module = new WasmModuleBuilder();
+ module.addFunction("add", [kAstI32, kAstI32, kAstI32])
+ .addBody([kExprI32Add, kExprGetLocal, 0, kExprGetLocal, 1]);
+ module.addFunction("main", [kAstI32, kAstI32, kAstI32, kAstI32])
+ .addBody([kExprCallIndirect, 0, kExprGetLocal,
+ 0, kExprGetLocal, 1, kExprGetLocal, 2])
+ .exportAs("main");
+ module.appendToFunctionTable([0]);
+
+ var instance = module.instantiate();
+ assertEquals(44, instance.exports.main(0, 11, 33));
+ assertEquals(7777, instance.exports.main(0, 2222, 5555));
+ assertThrows(function() { instance.exports.main(1, 1, 1); });
+})();
+
+(function DataSegmentTest() {
+ var module = new WasmModuleBuilder();
+ module.addMemory(1, 1, false);
+ module.addFunction("load", [kAstI32, kAstI32])
+ .addBody([kExprI32LoadMem, 0, 0, kExprGetLocal, 0])
+ .exportAs("load");
+ module.addDataSegment(0, [9, 9, 9, 9], true);
+
+ var buffer = module.toBuffer(debug);
+ var instance = Wasm.instantiateModule(buffer);
+ assertEquals(151587081, instance.exports.load(0));
+})();
+
+
+(function BasicTestWithUint8Array() {
+ var module = new WasmModuleBuilder();
+ module.addMemory(1, 2, false);
+ module.addFunction("foo", [kAstI32])
+ .addBody([kExprI8Const, 17])
+ .exportAs("blarg");
+
+ var buffer = module.toBuffer(debug);
+ var array = new Uint8Array(buffer);
+ var instance = Wasm.instantiateModule(array);
+ assertEquals(17, instance.exports.blarg());
+
+ var kPad = 5;
+ var buffer2 = new ArrayBuffer(kPad + buffer.byteLength + kPad);
+ var whole = new Uint8Array(buffer2);
+ for (var i = 0; i < whole.byteLength; i++) {
+ whole[i] = 0xff;
+ }
+ var array2 = new Uint8Array(buffer2, kPad, buffer.byteLength);
+ for (var i = 0; i < array2.byteLength; i++) {
+ array2[i] = array[i];
+ }
+ var instance = Wasm.instantiateModule(array2);
+ assertEquals(17, instance.exports.blarg());
+})();
+
+(function ImportTestTwoLevel() {
+ var module = new WasmModuleBuilder();
+ var index = module.addImportWithModule("mod", "print", [kAstStmt, kAstI32]);
+ module.addFunction("foo", [kAstStmt])
+ .addBody([kExprCallImport, index, kExprI8Const, 19])
+ .exportAs("main");
+
+ var buffer = module.toBuffer(debug);
+ var instance = Wasm.instantiateModule(buffer, {mod: {print: print}});
+ print("should print 19! ");
+ instance.exports.main();
+})();
diff --git a/test/mjsunit/wasm/unreachable.js b/test/mjsunit/wasm/unreachable.js
index 10eea23..3e2dffb 100644
--- a/test/mjsunit/wasm/unreachable.js
+++ b/test/mjsunit/wasm/unreachable.js
@@ -5,42 +5,20 @@
// Flags: --expose-wasm
load("test/mjsunit/wasm/wasm-constants.js");
+load("test/mjsunit/wasm/wasm-module-builder.js");
-var module = (function () {
- var kFuncWithBody = 9;
- var kFuncImported = 7;
- var kBodySize1 = 1;
- var kMainOffset = 6 + kFuncWithBody + kBodySize1 + 1;
+var main = (function () {
+ var builder = new WasmModuleBuilder();
+ builder.addFunction("main", [kAstStmt])
+ .addBody([kExprUnreachable])
+ .exportAs("main");
- var ffi = new Object();
- ffi.add = (function(a, b) { return a + b | 0; });
-
- return _WASMEXP_.instantiateModule(bytes(
- // -- signatures
- kDeclSignatures, 1,
- 0, kAstStmt, // void -> void
- // -- function #0 (unreachable)
- kDeclFunctions, 1,
- kDeclFunctionName | kDeclFunctionExport,
- 0, 0, // signature offset
- kMainOffset, 0, 0, 0, // name offset
- kBodySize1, 0, // body size
- kExprUnreachable,
- kDeclEnd,
- 'm', 'a', 'i', 'n', 0 // name
- ), ffi);
+ return builder.instantiate().exports.main;
})();
-// Check the module exists.
-assertFalse(module === undefined);
-assertFalse(module === null);
-assertFalse(module === 0);
-assertEquals("object", typeof module);
-assertEquals("function", typeof module.main);
-
var exception = "";
try {
- assertEquals(0, module.main());
+ assertEquals(0, main());
} catch(e) {
print("correctly caught: " + e);
exception = e;
diff --git a/test/mjsunit/wasm/verify-function-basic-errors.js b/test/mjsunit/wasm/verify-function-basic-errors.js
index c7383c8..74c9a96 100644
--- a/test/mjsunit/wasm/verify-function-basic-errors.js
+++ b/test/mjsunit/wasm/verify-function-basic-errors.js
@@ -6,13 +6,13 @@
function Foo() { }
-assertThrows(function() { _WASMEXP_.verifyFunction(); })
-assertThrows(function() { _WASMEXP_.verifyFunction(0); })
-assertThrows(function() { _WASMEXP_.verifyFunction("s"); })
-assertThrows(function() { _WASMEXP_.verifyFunction(undefined); })
-assertThrows(function() { _WASMEXP_.verifyFunction(1.1); })
-assertThrows(function() { _WASMEXP_.verifyFunction(1/0); })
-assertThrows(function() { _WASMEXP_.verifyFunction(null); })
-assertThrows(function() { _WASMEXP_.verifyFunction(new Foo()); })
-assertThrows(function() { _WASMEXP_.verifyFunction(new ArrayBuffer(0)); })
-assertThrows(function() { _WASMEXP_.verifyFunction(new ArrayBuffer(140000)); })
+assertThrows(function() { Wasm.verifyFunction(); })
+assertThrows(function() { Wasm.verifyFunction(0); })
+assertThrows(function() { Wasm.verifyFunction("s"); })
+assertThrows(function() { Wasm.verifyFunction(undefined); })
+assertThrows(function() { Wasm.verifyFunction(1.1); })
+assertThrows(function() { Wasm.verifyFunction(1/0); })
+assertThrows(function() { Wasm.verifyFunction(null); })
+assertThrows(function() { Wasm.verifyFunction(new Foo()); })
+assertThrows(function() { Wasm.verifyFunction(new ArrayBuffer(0)); })
+assertThrows(function() { Wasm.verifyFunction(new ArrayBuffer(140000)); })
diff --git a/test/mjsunit/wasm/verify-function-simple.js b/test/mjsunit/wasm/verify-function-simple.js
index c4d51c7..aa5c676 100644
--- a/test/mjsunit/wasm/verify-function-simple.js
+++ b/test/mjsunit/wasm/verify-function-simple.js
@@ -9,14 +9,11 @@
try {
var data = bytes(
0, kAstStmt, // signature
- 3, 0, // local int32 count
- 4, 0, // local int64 count
- 5, 0, // local float32 count
- 6, 0, // local float64 count
+ kDeclNoLocals, // --
kExprNop // body
);
- _WASMEXP_.verifyFunction(data);
+ Wasm.verifyFunction(data);
print("ok");
} catch (e) {
assertTrue(false);
@@ -27,14 +24,11 @@
try {
var data = bytes(
0, kAstI32, // signature
- 2, 0, // local int32 count
- 3, 0, // local int64 count
- 4, 0, // local float32 count
- 5, 0, // local float64 count
+ kDeclNoLocals, // --
kExprBlock, 2, kExprNop, kExprNop // body
);
- _WASMEXP_.verifyFunction(data);
+ Wasm.verifyFunction(data);
print("not ok");
} catch (e) {
print("ok: " + e);
diff --git a/test/mjsunit/wasm/verify-module-basic-errors.js b/test/mjsunit/wasm/verify-module-basic-errors.js
index 37658d3..29ef2aa 100644
--- a/test/mjsunit/wasm/verify-module-basic-errors.js
+++ b/test/mjsunit/wasm/verify-module-basic-errors.js
@@ -6,13 +6,13 @@
function Foo() { }
-assertThrows(function() { _WASMEXP_.verifyModule(); })
-assertThrows(function() { _WASMEXP_.verifyModule(0); })
-assertThrows(function() { _WASMEXP_.verifyModule("s"); })
-assertThrows(function() { _WASMEXP_.verifyModule(undefined); })
-assertThrows(function() { _WASMEXP_.verifyModule(1.1); })
-assertThrows(function() { _WASMEXP_.verifyModule(1/0); })
-assertThrows(function() { _WASMEXP_.verifyModule(null); })
-assertThrows(function() { _WASMEXP_.verifyModule(new Foo()); })
-assertThrows(function() { _WASMEXP_.verifyModule(new ArrayBuffer(0)); })
-assertThrows(function() { _WASMEXP_.verifyModule(new ArrayBuffer(7)); })
+assertThrows(function() { Wasm.verifyModule(); })
+assertThrows(function() { Wasm.verifyModule(0); })
+assertThrows(function() { Wasm.verifyModule("s"); })
+assertThrows(function() { Wasm.verifyModule(undefined); })
+assertThrows(function() { Wasm.verifyModule(1.1); })
+assertThrows(function() { Wasm.verifyModule(1/0); })
+assertThrows(function() { Wasm.verifyModule(null); })
+assertThrows(function() { Wasm.verifyModule(new Foo()); })
+assertThrows(function() { Wasm.verifyModule(new ArrayBuffer(0)); })
+assertThrows(function() { Wasm.verifyModule(new ArrayBuffer(7)); })
diff --git a/test/mjsunit/wasm/wasm-constants.js b/test/mjsunit/wasm/wasm-constants.js
index 458b51a..cc620bb 100644
--- a/test/mjsunit/wasm/wasm-constants.js
+++ b/test/mjsunit/wasm/wasm-constants.js
@@ -15,6 +15,41 @@
return buffer;
}
+// Header declaration constants
+var kWasmH0 = 0;
+var kWasmH1 = 0x61;
+var kWasmH2 = 0x73;
+var kWasmH3 = 0x6d;
+
+var kWasmV0 = 10;
+var kWasmV1 = 0;
+var kWasmV2 = 0;
+var kWasmV3 = 0;
+
+var kHeaderSize = 8;
+var kPageSize = 65536;
+
+function bytesWithHeader() {
+ var buffer = new ArrayBuffer(kHeaderSize + arguments.length);
+ var view = new Uint8Array(buffer);
+ view[0] = kWasmH0;
+ view[1] = kWasmH1;
+ view[2] = kWasmH2;
+ view[3] = kWasmH3;
+ view[4] = kWasmV0;
+ view[5] = kWasmV1;
+ view[6] = kWasmV2;
+ view[7] = kWasmV3;
+ for (var i = 0; i < arguments.length; i++) {
+ var val = arguments[i];
+ if ((typeof val) == "string") val = val.charCodeAt(0);
+ view[kHeaderSize + i] = val | 0;
+ }
+ return buffer;
+}
+
+var kDeclNoLocals = 0;
+
// Section declaration constants
var kDeclMemory = 0x00;
var kDeclSignatures = 0x01;
@@ -22,9 +57,18 @@
var kDeclGlobals = 0x03;
var kDeclDataSegments = 0x04;
var kDeclFunctionTable = 0x05;
+var kDeclEnd = 0x06;
var kDeclStartFunction = 0x07;
var kDeclImportTable = 0x08;
-var kDeclEnd = 0x06;
+var kDeclExportTable = 0x09;
+var kDeclFunctionSignatures = 0x0a;
+var kDeclFunctionBodies = 0x0b;
+var kDeclNames = 0x0c;
+
+var section_names = [
+ "memory", "signatures", "functions", "globals", "data_segments",
+ "function_table", "end", "start_function", "import_table", "export_table",
+ "function_signatures", "function_bodies", "names"];
// Function declaration flags
var kDeclFunctionName = 0x01;
@@ -119,7 +163,7 @@
var kExprI32Clz = 0x57;
var kExprI32Ctz = 0x58;
var kExprI32Popcnt = 0x59;
-var kExprBoolNot = 0x5a;
+var kExprI32Eqz = 0x5a;
var kExprI64Add = 0x5b;
var kExprI64Sub = 0x5c;
var kExprI64Mul = 0x5d;
@@ -211,6 +255,10 @@
var kExprF64ReinterpretI64 = 0xb3;
var kExprI32ReinterpretF32 = 0xb4;
var kExprI64ReinterpretF64 = 0xb5;
+var kExprI32Ror = 0xb6;
+var kExprI32Rol = 0xb7;
+var kExprI64Ror = 0xb8;
+var kExprI64Rol = 0xb9;
var kTrapUnreachable = 0;
var kTrapMemOutOfBounds = 1;
diff --git a/test/mjsunit/wasm/wasm-module-builder.js b/test/mjsunit/wasm/wasm-module-builder.js
new file mode 100644
index 0000000..e1d9963
--- /dev/null
+++ b/test/mjsunit/wasm/wasm-module-builder.js
@@ -0,0 +1,335 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+function WasmFunctionBuilder(name, sig_index) {
+ this.name = name;
+ this.sig_index = sig_index;
+ this.exports = [];
+}
+
+WasmFunctionBuilder.prototype.exportAs = function(name) {
+ this.exports.push(name);
+ return this;
+}
+
+WasmFunctionBuilder.prototype.exportFunc = function() {
+ this.exports.push(this.name);
+ return this;
+}
+
+WasmFunctionBuilder.prototype.addBody = function(body) {
+ this.body = body;
+ return this;
+}
+
+WasmFunctionBuilder.prototype.addLocals = function(locals) {
+ this.locals = locals;
+ return this;
+}
+
+function WasmModuleBuilder() {
+ this.signatures = [];
+ this.imports = [];
+ this.functions = [];
+ this.exports = [];
+ this.function_table = [];
+ this.data_segments = [];
+ this.explicit = [];
+ return this;
+}
+
+WasmModuleBuilder.prototype.addStart = function(start_index) {
+ this.start_index = start_index;
+}
+
+WasmModuleBuilder.prototype.addMemory = function(min, max, exp) {
+ this.memory = {min: min, max: max, exp: exp};
+ return this;
+}
+
+WasmModuleBuilder.prototype.addExplicitSection = function(bytes) {
+ this.explicit.push(bytes);
+ return this;
+}
+
+// Add a signature; format is [rettype, param0, param1, ...]
+WasmModuleBuilder.prototype.addSignature = function(sig) {
+ // TODO: canonicalize signatures?
+ this.signatures.push(sig);
+ return this.signatures.length - 1;
+}
+
+WasmModuleBuilder.prototype.addFunction = function(name, sig) {
+ var sig_index = (typeof sig) == "number" ? sig : this.addSignature(sig);
+ var func = new WasmFunctionBuilder(name, sig_index);
+ func.index = this.functions.length;
+ this.functions.push(func);
+ return func;
+}
+
+WasmModuleBuilder.prototype.addImportWithModule = function(module, name, sig) {
+ var sig_index = (typeof sig) == "number" ? sig : this.addSignature(sig);
+ this.imports.push({module: module, name: name, sig_index: sig_index});
+ return this.imports.length - 1;
+}
+
+WasmModuleBuilder.prototype.addImport = function(name, sig) {
+ var sig_index = (typeof sig) == "number" ? sig : this.addSignature(sig);
+ this.imports.push({module: name, name: undefined, sig_index: sig_index});
+ return this.imports.length - 1;
+}
+
+WasmModuleBuilder.prototype.addDataSegment = function(addr, data, init) {
+ this.data_segments.push({addr: addr, data: data, init: init});
+ return this.data_segments.length - 1;
+}
+
+WasmModuleBuilder.prototype.appendToFunctionTable = function(array) {
+ this.function_table = this.function_table.concat(array);
+ return this;
+}
+
+function emit_u8(bytes, val) {
+ bytes.push(val & 0xff);
+}
+
+function emit_u16(bytes, val) {
+ bytes.push(val & 0xff);
+ bytes.push((val >> 8) & 0xff);
+}
+
+function emit_u32(bytes, val) {
+ bytes.push(val & 0xff);
+ bytes.push((val >> 8) & 0xff);
+ bytes.push((val >> 16) & 0xff);
+ bytes.push((val >> 24) & 0xff);
+}
+
+function emit_string(bytes, string) {
+ emit_varint(bytes, string.length);
+ for (var i = 0; i < string.length; i++) {
+ emit_u8(bytes, string.charCodeAt(i));
+ }
+}
+
+function emit_varint(bytes, val) {
+ while (true) {
+ var v = val & 0xff;
+ val = val >>> 7;
+ if (val == 0) {
+ bytes.push(v);
+ break;
+ }
+ bytes.push(v | 0x80);
+ }
+}
+
+function emit_bytes(bytes, data) {
+ for (var i = 0; i < data.length; i++) {
+ bytes.push(data[i] & 0xff);
+ }
+}
+
+function emit_section(bytes, section_code, content_generator) {
+ // Start the section in a temporary buffer: its full length isn't know yet.
+ var tmp_bytes = [];
+ emit_string(tmp_bytes, section_names[section_code]);
+ content_generator(tmp_bytes);
+ // Now that we know the section length, emit it and copy the section.
+ emit_varint(bytes, tmp_bytes.length);
+ Array.prototype.push.apply(bytes, tmp_bytes);
+}
+
+WasmModuleBuilder.prototype.toArray = function(debug) {
+ // Add header bytes
+ var bytes = [];
+ bytes = bytes.concat([kWasmH0, kWasmH1, kWasmH2, kWasmH3,
+ kWasmV0, kWasmV1, kWasmV2, kWasmV3]);
+
+ var wasm = this;
+
+ // Add memory section
+ if (wasm.memory != undefined) {
+ if (debug) print("emitting memory @ " + bytes.length);
+ emit_section(bytes, kDeclMemory, function(bytes) {
+ emit_varint(bytes, wasm.memory.min);
+ emit_varint(bytes, wasm.memory.max);
+ emit_u8(bytes, wasm.memory.exp ? 1 : 0);
+ });
+ }
+
+ // Add signatures section
+ if (wasm.signatures.length > 0) {
+ if (debug) print("emitting signatures @ " + bytes.length);
+ emit_section(bytes, kDeclSignatures, function(bytes) {
+ emit_varint(bytes, wasm.signatures.length);
+ for (sig of wasm.signatures) {
+ var params = sig.length - 1;
+ emit_varint(bytes, params);
+ for (var j = 0; j < sig.length; j++) {
+ emit_u8(bytes, sig[j]);
+ }
+ }
+ });
+ }
+
+ // Add imports section
+ if (wasm.imports.length > 0) {
+ if (debug) print("emitting imports @ " + bytes.length);
+ emit_section(bytes, kDeclImportTable, function(bytes) {
+ emit_varint(bytes, wasm.imports.length);
+ for (imp of wasm.imports) {
+ emit_varint(bytes, imp.sig_index);
+ emit_string(bytes, imp.module);
+ emit_string(bytes, imp.name || '');
+ }
+ });
+ }
+
+ // Add functions section
+ var names = false;
+ var exports = 0;
+ if (wasm.functions.length > 0) {
+ var has_names = false;
+
+ // emit function signatures
+ if (debug) print("emitting function sigs @ " + bytes.length);
+ emit_section(bytes, kDeclFunctionSignatures, function(bytes) {
+ emit_varint(bytes, wasm.functions.length);
+ for (func of wasm.functions) {
+ has_names = has_names || (func.name != undefined &&
+ func.name.length > 0);
+ exports += func.exports.length;
+
+ emit_varint(bytes, func.sig_index);
+ }
+ });
+
+ // emit function bodies
+ if (debug) print("emitting function bodies @ " + bytes.length);
+ emit_section(bytes, kDeclFunctionBodies, function(bytes) {
+ emit_varint(bytes, wasm.functions.length);
+ for (func of wasm.functions) {
+ // Function body length will be patched later.
+ var local_decls = [];
+ var l = func.locals;
+ if (l != undefined) {
+ var local_decls_count = 0;
+ if (l.i32_count > 0) {
+ local_decls.push({count: l.i32_count, type: kAstI32});
+ }
+ if (l.i64_count > 0) {
+ local_decls.push({count: l.i64_count, type: kAstI64});
+ }
+ if (l.f32_count > 0) {
+ local_decls.push({count: l.f32_count, type: kAstF32});
+ }
+ if (l.f64_count > 0) {
+ local_decls.push({count: l.f64_count, type: kAstF64});
+ }
+ }
+ var header = new Array();
+
+ emit_varint(header, local_decls.length);
+ for (decl of local_decls) {
+ emit_varint(header, decl.count);
+ emit_u8(header, decl.type);
+ }
+
+ emit_varint(bytes, header.length + func.body.length);
+ emit_bytes(bytes, header);
+ emit_bytes(bytes, func.body);
+ }
+ });
+ }
+
+ // emit function names
+ if (has_names) {
+ if (debug) print("emitting names @ " + bytes.length);
+ emit_section(bytes, kDeclNames, function(bytes) {
+ emit_varint(bytes, wasm.functions.length);
+ for (func of wasm.functions) {
+ var name = func.name == undefined ? "" : func.name;
+ emit_string(bytes, name);
+ emit_u8(bytes, 0); // local names count == 0
+ }
+ });
+ }
+
+ // Add start function section.
+ if (wasm.start_index != undefined) {
+ if (debug) print("emitting start function @ " + bytes.length);
+ emit_section(bytes, kDeclStartFunction, function(bytes) {
+ emit_varint(bytes, wasm.start_index);
+ });
+ }
+
+ if (wasm.function_table.length > 0) {
+ if (debug) print("emitting function table @ " + bytes.length);
+ emit_section(bytes, kDeclFunctionTable, function(bytes) {
+ emit_varint(bytes, wasm.function_table.length);
+ for (index of wasm.function_table) {
+ emit_varint(bytes, index);
+ }
+ });
+ }
+
+ if (exports > 0) {
+ if (debug) print("emitting exports @ " + bytes.length);
+ emit_section(bytes, kDeclExportTable, function(bytes) {
+ emit_varint(bytes, exports);
+ for (func of wasm.functions) {
+ for (exp of func.exports) {
+ emit_varint(bytes, func.index);
+ emit_string(bytes, exp);
+ }
+ }
+ });
+ }
+
+ if (wasm.data_segments.length > 0) {
+ if (debug) print("emitting data segments @ " + bytes.length);
+ emit_section(bytes, kDeclDataSegments, function(bytes) {
+ emit_varint(bytes, wasm.data_segments.length);
+ for (seg of wasm.data_segments) {
+ emit_varint(bytes, seg.addr);
+ emit_varint(bytes, seg.data.length);
+ emit_bytes(bytes, seg.data);
+ }
+ });
+ }
+
+ // Emit any explicitly added sections
+ for (exp of wasm.explicit) {
+ if (debug) print("emitting explicit @ " + bytes.length);
+ emit_bytes(bytes, exp);
+ }
+
+ // End the module.
+ if (debug) print("emitting end @ " + bytes.length);
+ emit_section(bytes, kDeclEnd, function(bytes) {});
+
+ return bytes;
+}
+
+WasmModuleBuilder.prototype.toBuffer = function(debug) {
+ var bytes = this.toArray(debug);
+ var buffer = new ArrayBuffer(bytes.length);
+ var view = new Uint8Array(buffer);
+ for (var i = 0; i < bytes.length; i++) {
+ var val = bytes[i];
+ if ((typeof val) == "string") val = val.charCodeAt(0);
+ view[i] = val | 0;
+ }
+ return buffer;
+}
+
+WasmModuleBuilder.prototype.instantiate = function(ffi, memory) {
+ var buffer = this.toBuffer();
+ if (memory != undefined) {
+ return Wasm.instantiateModule(buffer, ffi, memory);
+ } else {
+ return Wasm.instantiateModule(buffer, ffi);
+ }
+}
diff --git a/test/mjsunit/wasm/wasm-object-api.js b/test/mjsunit/wasm/wasm-object-api.js
index 8912271..2f25c66 100644
--- a/test/mjsunit/wasm/wasm-object-api.js
+++ b/test/mjsunit/wasm/wasm-object-api.js
@@ -4,9 +4,9 @@
// Flags: --expose-wasm
-assertFalse(undefined === _WASMEXP_);
-assertFalse(undefined == _WASMEXP_);
-assertEquals("function", typeof _WASMEXP_.verifyModule);
-assertEquals("function", typeof _WASMEXP_.verifyFunction);
-assertEquals("function", typeof _WASMEXP_.instantiateModule);
-assertEquals("function", typeof _WASMEXP_.instantiateModuleFromAsm);
+assertFalse(undefined === Wasm);
+assertFalse(undefined == Wasm);
+assertEquals("function", typeof Wasm.verifyModule);
+assertEquals("function", typeof Wasm.verifyFunction);
+assertEquals("function", typeof Wasm.instantiateModule);
+assertEquals("function", typeof Wasm.instantiateModuleFromAsm);
diff --git a/test/mozilla/mozilla.status b/test/mozilla/mozilla.status
index c54d154..0f7d4aa 100644
--- a/test/mozilla/mozilla.status
+++ b/test/mozilla/mozilla.status
@@ -109,6 +109,9 @@
'js1_5/Regress/regress-360969-03': [FAIL, ['mode == debug', TIMEOUT, NO_VARIANTS]],
'js1_5/Regress/regress-360969-04': [FAIL, ['mode == debug', TIMEOUT, NO_VARIANTS]],
+ # Function declarations are no longer allowed as the body of a with statement.
+ 'js1_5/Regress/regress-326453': [FAIL],
+
##################### SKIPPED TESTS #####################
# This test checks that we behave properly in an out-of-memory
@@ -168,6 +171,8 @@
# in the test: "This test will probably run out of memory".
'js1_5/extensions/regress-345967': [SKIP],
+ # Slow with arm64 simulator in debug.
+ 'ecma_3/Statements/regress-302439': [PASS, ['mode == debug', SLOW]],
##################### FLAKY TESTS #####################
@@ -672,9 +677,6 @@
# We do not correctly handle assignments within "with"
'ecma_3/Statements/12.10-01': [FAIL],
- # https://bugs.chromium.org/p/v8/issues/detail?id=4647
- 'ecma_3/FunExpr/fe-001': [FAIL_OK],
-
##################### MOZILLA EXTENSION TESTS #####################
'ecma/extensions/15.1.2.1-1': [FAIL_OK],
diff --git a/test/mozilla/testcfg.py b/test/mozilla/testcfg.py
index 5739391..0eb32c8 100644
--- a/test/mozilla/testcfg.py
+++ b/test/mozilla/testcfg.py
@@ -107,10 +107,10 @@
def IsNegativeTest(self, testcase):
return testcase.path.endswith("-n")
- def IsFailureOutput(self, output, testpath):
- if output.exit_code != 0:
+ def IsFailureOutput(self, testcase):
+ if testcase.output.exit_code != 0:
return True
- return "FAILED!" in output.stdout
+ return "FAILED!" in testcase.output.stdout
def DownloadData(self):
print "Mozilla download is deprecated. It's part of DEPS."
diff --git a/test/preparser/empty.js b/test/preparser/empty.js
deleted file mode 100644
index 70b88e2..0000000
--- a/test/preparser/empty.js
+++ /dev/null
@@ -1,28 +0,0 @@
-// Copyright 2011 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// This file contains no JavaScript code.
diff --git a/test/preparser/functions-only.js b/test/preparser/functions-only.js
deleted file mode 100644
index 4dcde57..0000000
--- a/test/preparser/functions-only.js
+++ /dev/null
@@ -1,38 +0,0 @@
-// Copyright 2011 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// This file contains no identifiers or string literals, but does contain
-// symbols.
-
-(function () {
- if (this != null) {
- return this;
- }
- while (true) {
- if ([][2]) return false;
- }
-})({}, function() { return [true]; } );
diff --git a/test/preparser/preparser.expectation b/test/preparser/preparser.expectation
deleted file mode 100644
index 638f90e..0000000
--- a/test/preparser/preparser.expectation
+++ /dev/null
@@ -1,14 +0,0 @@
-# Expectations for .js preparser tests.
-# Only mentions tests that throw SyntaxError, and optionally specifies
-# the message and location expected in the exception.
-# Format:
-# testname[:message[:beg_pos,end_pos]]
-strict-octal-number:strict_octal_literal
-strict-octal-string:strict_octal_literal
-strict-octal-regexp:strict_octal_literal
-strict-octal-use-strict-after:strict_octal_literal
-strict-octal-use-strict-before:strict_octal_literal
-
-strict-const:strict_const
-
-strict-with:strict_mode_with
diff --git a/test/preparser/preparser.status b/test/preparser/preparser.status
index 9d69988..43049d4 100644
--- a/test/preparser/preparser.status
+++ b/test/preparser/preparser.status
@@ -27,18 +27,5 @@
[
[ALWAYS, {
- # TODO(mstarzinger): This script parses but throws a TypeError when run.
- 'non-alphanum': [FAIL],
-
- # We don't parse RegExps at scanning time, so we can't fail on octal
- # escapes (we need to parse to distinguish octal escapes from valid
- # back-references).
- 'strict-octal-regexp': [FAIL],
}], # ALWAYS
-
-['arch == android_arm or arch == android_ia32', {
- # Remove this once the issue above is fixed. Android test runner does not
- # handle "FAIL" test expectation correctly.
- 'strict-octal-regexp': [SKIP],
-}], # 'arch == android_arm or arch == android_ia32'
]
diff --git a/test/preparser/symbols-only.js b/test/preparser/symbols-only.js
deleted file mode 100644
index b652063..0000000
--- a/test/preparser/symbols-only.js
+++ /dev/null
@@ -1,49 +0,0 @@
-// Copyright 2011 the V8 project authors. All rights reserved.
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following
-// disclaimer in the documentation and/or other materials provided
-// with the distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived
-// from this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// This file contains no function declarations.
-
-var x = 42;
-var y = "hello world";
-if (x == y) {
- with ({ x: 10, y: "20", z: 42 }) {
- print(z);
- }
-}
-try {
- x = 2;
- throw y;
- y = 4;
-} catch (e) {
- y = e;
-} finally {
- x = y;
-}
-for (var i = 0; i < 10; i++) {
- x += x;
-}
-print(y);
diff --git a/test/preparser/testcfg.py b/test/preparser/testcfg.py
index 7e51b8e..c55e4a8 100644
--- a/test/preparser/testcfg.py
+++ b/test/preparser/testcfg.py
@@ -27,17 +27,11 @@
import os
-import re
from testrunner.local import testsuite
-from testrunner.local import utils
from testrunner.objects import testcase
-FLAGS_PATTERN = re.compile(r"//\s+Flags:(.*)")
-INVALID_FLAGS = ["--enable-slow-asserts"]
-
-
class PreparserTestSuite(testsuite.TestSuite):
def __init__(self, name, root):
super(PreparserTestSuite, self).__init__(name, root)
@@ -45,22 +39,6 @@
def shell(self):
return "d8"
- def _GetExpectations(self):
- expects_file = os.path.join(self.root, "preparser.expectation")
- expectations_map = {}
- if not os.path.exists(expects_file): return expectations_map
- rule_regex = re.compile("^([\w\-]+)(?::([\w\-]+))?(?::(\d+),(\d+))?$")
- for line in utils.ReadLinesFrom(expects_file):
- rule_match = rule_regex.match(line)
- if not rule_match: continue
- expects = []
- if (rule_match.group(2)):
- expects += [rule_match.group(2)]
- if (rule_match.group(3)):
- expects += [rule_match.group(3), rule_match.group(4)]
- expectations_map[rule_match.group(1)] = " ".join(expects)
- return expectations_map
-
def _ParsePythonTestTemplates(self, result, filename):
pathname = os.path.join(self.root, filename + ".pyt")
def Test(name, source, expectation, extra_flags=[]):
@@ -84,20 +62,8 @@
execfile(pathname, {"Test": Test, "Template": Template})
def ListTests(self, context):
- expectations = self._GetExpectations()
result = []
- # Find all .js files in this directory.
- filenames = [f[:-3] for f in os.listdir(self.root) if f.endswith(".js")]
- filenames.sort()
- for f in filenames:
- throws = expectations.get(f, None)
- flags = [f + ".js"]
- if throws:
- flags += ["--throws"]
- test = testcase.TestCase(self, f, flags=flags)
- result.append(test)
-
# Find all .pyt files in this directory.
filenames = [f[:-4] for f in os.listdir(self.root) if f.endswith(".pyt")]
filenames.sort()
@@ -106,25 +72,11 @@
return result
def GetFlagsForTestCase(self, testcase, context):
- first = testcase.flags[0]
- if first != "-e":
- testcase.flags[0] = os.path.join(self.root, first)
- source = self.GetSourceForTest(testcase)
- result = []
- flags_match = re.findall(FLAGS_PATTERN, source)
- for match in flags_match:
- result += match.strip().split()
- result += context.mode_flags
- result = [x for x in result if x not in INVALID_FLAGS]
- result.append(os.path.join(self.root, testcase.path + ".js"))
- return testcase.flags + result
return testcase.flags
def GetSourceForTest(self, testcase):
- if testcase.flags[0] == "-e":
- return testcase.flags[1]
- with open(testcase.flags[0]) as f:
- return f.read()
+ assert testcase.flags[0] == "-e"
+ return testcase.flags[1]
def _VariantGeneratorFactory(self):
return testsuite.StandardVariantGenerator
diff --git a/test/promises-aplus/testcfg.py b/test/promises-aplus/testcfg.py
index 5f447c3..bd80f97 100644
--- a/test/promises-aplus/testcfg.py
+++ b/test/promises-aplus/testcfg.py
@@ -91,11 +91,11 @@
def IsNegativeTest(self, testcase):
return '@negative' in self.GetSourceForTest(testcase)
- def IsFailureOutput(self, output, testpath):
- if output.exit_code != 0:
+ def IsFailureOutput(self, testcase):
+ if testcase.output.exit_code != 0:
return True
- return not 'All tests have run.' in output.stdout or \
- 'FAIL:' in output.stdout
+ return not 'All tests have run.' in testcase.output.stdout or \
+ 'FAIL:' in testcase.output.stdout
def DownloadTestData(self):
archive = os.path.join(self.root, TEST_ARCHIVE)
diff --git a/test/simdjs/testcfg.py b/test/simdjs/testcfg.py
index d2dbd71..c055d5a 100644
--- a/test/simdjs/testcfg.py
+++ b/test/simdjs/testcfg.py
@@ -48,10 +48,10 @@
def IsNegativeTest(self, testcase):
return False
- def IsFailureOutput(self, output, testpath):
- if output.exit_code != 0:
+ def IsFailureOutput(self, testcase):
+ if testcase.output.exit_code != 0:
return True
- return "FAILED!" in output.stdout
+ return "FAILED!" in testcase.output.stdout
def DownloadData(self):
print "SimdJs download is deprecated. It's part of DEPS."
diff --git a/test/test262/archive.py b/test/test262/archive.py
index 8398e51..c265b32 100755
--- a/test/test262/archive.py
+++ b/test/test262/archive.py
@@ -8,10 +8,15 @@
os.chdir(os.path.dirname(os.path.abspath(__file__)))
+# Workaround for slow grp and pwd calls.
+tarfile.grp = None
+tarfile.pwd = None
+
def filter_git(tar_info):
if tar_info.name.startswith(os.path.join('data', '.git')):
return None
else:
+ tar_info.uname = tar_info.gname = "test262"
return tar_info
with tarfile.open('data.tar', 'w') as tar:
diff --git a/test/test262/test262.status b/test/test262/test262.status
index a926bcc..8cd4496 100644
--- a/test/test262/test262.status
+++ b/test/test262/test262.status
@@ -27,19 +27,8 @@
[
[ALWAYS, {
- ############################### BUGS ###################################
-
- # BUG(v8:3455)
- 'intl402/11.2.3_b': [FAIL],
- 'intl402/12.2.3_b': [FAIL],
-
###################### NEEDS INVESTIGATION #######################
- # Possibly same cause as S8.5_A2.1, below: floating-point tests.
- 'built-ins/Math/cos/S15.8.2.7_A7': [PASS, FAIL_OK],
- 'built-ins/Math/sin/S15.8.2.16_A7': [PASS, FAIL_OK],
- 'built-ins/Math/tan/S15.8.2.18_A7': [PASS, FAIL_OK],
-
# This is an incompatibility between ES5 and V8 on enumerating
# shadowed elements in a for..in loop.
# https://code.google.com/p/v8/issues/detail?id=705
@@ -47,63 +36,12 @@
###################### MISSING ES6 FEATURES #######################
- # https://bugs.chromium.org/p/v8/issues/detail?id=4768
- # The Reflect.enumerate trap is removed
- 'built-ins/Reflect/enumerate/*': [SKIP],
- 'built-ins/Proxy/enumerate/*': [SKIP],
-
- # https://code.google.com/p/v8/issues/detail?id=4163
- 'built-ins/GeneratorPrototype/next/context-constructor-invocation': [FAIL],
-
- # https://code.google.com/p/v8/issues/detail?id=3566
- 'built-ins/Array/from/iter-map-fn-err': [FAIL],
- 'built-ins/Array/from/iter-set-elem-prop-err': [FAIL],
- 'built-ins/Map/iterator-close-after-set-failure': [FAIL],
- 'built-ins/Map/iterator-item-first-entry-returns-abrupt': [FAIL],
- 'built-ins/Map/iterator-item-second-entry-returns-abrupt': [FAIL],
- 'built-ins/Map/iterator-items-are-not-object-close-iterator': [FAIL],
- 'built-ins/Promise/all/iter-close': [FAIL],
- 'built-ins/Promise/race/iter-close': [PASS, FAIL],
- 'built-ins/Set/set-iterator-close-after-add-failure': [FAIL],
- 'built-ins/WeakMap/iterator-close-after-set-failure': [FAIL],
- 'built-ins/WeakMap/iterator-item-first-entry-returns-abrupt': [FAIL],
- 'built-ins/WeakMap/iterator-item-second-entry-returns-abrupt': [FAIL],
- 'built-ins/WeakMap/iterator-items-are-not-object-close-iterator': [FAIL],
- 'built-ins/WeakSet/iterator-close-after-add-failure': [FAIL],
-
- # https://code.google.com/p/v8/issues/detail?id=4348
- 'built-ins/String/prototype/Symbol.iterator/this-val-non-obj-coercible': [FAIL],
-
# The order of adding the name property is wrong
# https://code.google.com/p/v8/issues/detail?id=4199
'language/computed-property-names/class/static/method-number': [FAIL, FAIL_SLOPPY],
'language/computed-property-names/class/static/method-symbol': [FAIL, FAIL_SLOPPY],
'language/computed-property-names/class/static/method-string': [FAIL, FAIL_SLOPPY],
- # https://code.google.com/p/v8/issues/detail?id=3566
- 'language/statements/for-of/body-dstr-assign-error': [FAIL],
- 'language/statements/for-of/body-put-error': [FAIL],
- 'language/statements/for-of/generator-close-via-break': [FAIL],
- 'language/statements/for-of/generator-close-via-return': [FAIL],
- 'language/statements/for-of/generator-close-via-throw': [FAIL],
- 'language/statements/for-of/iterator-close-get-method-error': [FAIL],
- 'language/statements/for-of/iterator-close-non-object': [FAIL],
- 'language/statements/for-of/iterator-close-via-break': [FAIL],
- 'language/statements/for-of/iterator-close-via-return': [FAIL],
- 'language/statements/for-of/iterator-close-via-throw': [FAIL],
-
- # We do not expose Array.prototype.values
- # https://code.google.com/p/v8/issues/detail?id=4247
- 'built-ins/Array/prototype/Symbol.iterator': [FAIL],
- 'built-ins/Array/prototype/values/returns-iterator': [FAIL],
- 'built-ins/Array/prototype/values/returns-iterator-from-object': [FAIL],
- 'built-ins/Array/prototype/values/prop-desc': [FAIL],
- 'built-ins/Array/prototype/values/name': [FAIL],
- 'built-ins/Array/prototype/values/length': [FAIL],
- 'built-ins/Array/prototype/values/iteration': [FAIL],
- 'built-ins/Array/prototype/values/iteration-mutable': [FAIL],
- 'built-ins/Array/prototype/Symbol.unscopables/value': [FAIL],
-
# https://code.google.com/p/v8/issues/detail?id=4248
'language/expressions/compound-assignment/S11.13.2_A5.*': [FAIL],
'language/expressions/compound-assignment/S11.13.2_A6.*': [FAIL],
@@ -139,6 +77,14 @@
'language/expressions/class/name': [FAIL],
'language/expressions/function/name': [FAIL],
'language/expressions/generators/name': [FAIL],
+ 'intl402/NumberFormat/prototype/format/format-function-name': [FAIL],
+ 'intl402/DateTimeFormat/prototype/format/format-function-name': [FAIL],
+ 'intl402/Collator/prototype/compare/compare-function-name': [FAIL],
+
+ # https://bugs.chromium.org/p/v8/issues/detail?id=4778
+ 'intl402/Collator/prototype/compare/name': [FAIL],
+ 'intl402/DateTimeFormat/prototype/format/name': [FAIL],
+ 'intl402/NumberFormat/prototype/format/name': [FAIL],
# https://code.google.com/p/v8/issues/detail?id=4251
'language/expressions/postfix-increment/S11.3.1_A5_T1': [FAIL],
@@ -153,42 +99,49 @@
# https://code.google.com/p/v8/issues/detail?id=4253
'language/asi/S7.9_A5.7_T1': [PASS, FAIL_OK],
- # https://code.google.com/p/v8/issues/detail?id=4602
+ ###### BEGIN REGEXP SUBCLASSING SECTION ######
+ # Spec change in progress https://github.com/tc39/ecma262/pull/494
+ # RegExpBuiltinMatch reads flags from [[OriginalFlags]]
+ 'built-ins/RegExp/prototype/Symbol.match/builtin-coerce-sticky': [FAIL],
+ 'built-ins/RegExp/prototype/Symbol.match/builtin-get-global-err': [FAIL],
+ 'built-ins/RegExp/prototype/Symbol.match/builtin-get-sticky-err': [FAIL],
+ 'built-ins/RegExp/prototype/Symbol.match/builtin-success-g-set-lastindex': [FAIL],
+ 'built-ins/RegExp/prototype/Symbol.match/builtin-success-g-set-lastindex-err': [FAIL],
+ 'built-ins/RegExp/prototype/Symbol.match/coerce-sticky': [FAIL],
+ 'built-ins/RegExp/prototype/Symbol.match/get-sticky-err': [FAIL],
+ 'built-ins/RegExp/prototype/Symbol.replace/coerce-global': [FAIL],
+ 'built-ins/RegExp/prototype/Symbol.replace/coerce-unicode': [FAIL],
+ 'built-ins/RegExp/prototype/Symbol.replace/get-sticky-coerce': [FAIL],
+ 'built-ins/RegExp/prototype/Symbol.replace/get-sticky-err': [SKIP],
+ 'built-ins/RegExp/prototype/Symbol.search/get-sticky-coerce': [FAIL],
+ 'built-ins/RegExp/prototype/Symbol.search/get-sticky-err': [FAIL],
'built-ins/RegExp/prototype/exec/get-sticky-coerce': [FAIL],
'built-ins/RegExp/prototype/exec/get-sticky-err': [FAIL],
'built-ins/RegExp/prototype/test/get-sticky-err': [FAIL],
- # https://code.google.com/p/v8/issues/detail?id=4504
- 'built-ins/RegExp/prototype/exec/y-fail-lastindex-no-write': [PASS, FAIL],
- 'built-ins/RegExp/prototype/test/y-fail-lastindex-no-write': [PASS, FAIL],
+ # Missing lastIndex support
+ 'built-ins/RegExp/prototype/Symbol.split/str-result-coerce-length-err': [FAIL],
- # https://code.google.com/p/v8/issues/detail?id=4305
- # SKIP rather than FAIL some tests, as they may check for an exception which
- # happens to be thrown for some other reason (e.g,
- # built-ins/RegExp/prototype/Symbol.match/builtin-failure-set-lastindex-err)
- 'built-ins/RegExp/prototype/Symbol.match/*': [SKIP],
- 'built-ins/String/prototype/endsWith/return-abrupt-from-searchstring-regexp-test': [FAIL],
- 'built-ins/String/prototype/includes/return-abrupt-from-searchstring-regexp-test': [FAIL],
- 'built-ins/String/prototype/startsWith/return-abrupt-from-searchstring-regexp-test': [FAIL],
- 'built-ins/String/prototype/match/invoke-builtin-match': [FAIL],
+ # Times out
+ 'built-ins/RegExp/prototype/Symbol.split/str-coerce-lastindex': [SKIP],
+ 'built-ins/RegExp/prototype/Symbol.match/coerce-global': [SKIP],
+ 'built-ins/RegExp/prototype/Symbol.match/builtin-coerce-global': [SKIP],
- # https://code.google.com/p/v8/issues/detail?id=4343
- 'built-ins/RegExp/prototype/Symbol.replace/*': [SKIP],
+ # Sticky support busted
+ 'built-ins/RegExp/prototype/Symbol.replace/y-init-lastindex': [FAIL],
+ 'built-ins/RegExp/prototype/Symbol.replace/y-set-lastindex': [FAIL],
- # https://code.google.com/p/v8/issues/detail?id=4344
- 'built-ins/RegExp/prototype/Symbol.search/*': [SKIP],
+ # SKIP rather than FAIL, as the test checks for an exception which
+ # happens to be thrown for some other reason.
+ 'built-ins/RegExp/prototype/Symbol.split/str-result-get-length-err': [SKIP],
- # https://code.google.com/p/v8/issues/detail?id=4345
- 'built-ins/RegExp/prototype/Symbol.split/*': [SKIP],
+ ###### END REGEXP SUBCLASSING SECTION ######
# https://code.google.com/p/v8/issues/detail?id=4360
'intl402/Collator/10.1.1_1': [FAIL],
'intl402/DateTimeFormat/12.1.1_1': [FAIL],
'intl402/NumberFormat/11.1.1_1': [FAIL],
- # https://code.google.com/p/v8/issues/detail?id=4361
- 'intl402/Collator/10.1.1_a': [FAIL],
-
# https://code.google.com/p/v8/issues/detail?id=4476
'built-ins/String/prototype/toLocaleLowerCase/special_casing_conditional': [FAIL],
'built-ins/String/prototype/toLocaleLowerCase/supplementary_plane': [FAIL],
@@ -220,12 +173,6 @@
'built-ins/Promise/resolve-function-name': [FAIL],
'built-ins/Promise/all/resolve-element-function-name': [FAIL],
'built-ins/Promise/executor-function-name': [FAIL],
- 'built-ins/Promise/all/capability-executor-not-callable': [FAIL],
- 'built-ins/Promise/reject/capability-executor-not-callable': [FAIL],
- 'built-ins/Promise/race/capability-executor-not-callable': [FAIL],
- 'built-ins/Promise/prototype/then/capability-executor-not-callable': [FAIL],
- 'built-ins/Promise/resolve/capability-executor-not-callable': [FAIL],
- 'built-ins/Promise/race/S25.4.4.3_A3.1_T2': [FAIL],
# https://bugs.chromium.org/p/v8/issues/detail?id=4634
'built-ins/DataView/prototype/setFloat64/index-check-before-value-conversion': [FAIL],
@@ -246,18 +193,21 @@
'language/statements/class/subclass/builtin-objects/NativeError/URIError-message': [FAIL],
'language/statements/class/subclass/builtin-objects/Error/message-property-assignment': [FAIL],
- # https://bugs.chromium.org/p/v8/issues/detail?id=4663
- 'built-ins/object/entries/*': [SKIP],
- 'built-ins/object/values/*': [SKIP],
- 'built-ins/Object/entries/*': [SKIP],
- 'built-ins/Object/values/*': [SKIP],
-
# https://code.google.com/p/chromium/issues/detail?id=581577
'built-ins/RegExp/prototype/source/15.10.7.1-1': [FAIL],
'built-ins/RegExp/prototype/global/15.10.7.2-1': [FAIL],
'built-ins/RegExp/prototype/ignoreCase/15.10.7.3-1': [FAIL],
'built-ins/RegExp/prototype/multiline/15.10.7.4-1': [FAIL],
+ # https://bugs.chromium.org/p/v8/issues/detail?id=4727
+ 'built-ins/TypedArrays/length-arg-is-undefined-throws': [FAIL],
+ 'built-ins/TypedArrays/length-arg-is-symbol-throws': [FAIL],
+ 'built-ins/TypedArrays/length-arg-is-float-throws-rangeerror': [FAIL],
+ 'built-ins/TypedArrays/length-arg-is-nan-throws-rangeerror': [FAIL],
+
+ # https://bugs.chromium.org/p/v8/issues/detail?id=4784
+ 'built-ins/TypedArrays/buffer-arg-defined-negative-length': [FAIL],
+
######################## NEEDS INVESTIGATION ###########################
# These test failures are specific to the intl402 suite and need investigation
@@ -272,16 +222,12 @@
'intl402/Collator/10.2.3_b': [PASS, FAIL],
'intl402/Collator/prototype/10.3_a': [FAIL],
'intl402/DateTimeFormat/12.1.1': [FAIL],
- 'intl402/DateTimeFormat/12.1.1_a': [FAIL],
'intl402/DateTimeFormat/12.1.2': [PASS, FAIL],
'intl402/DateTimeFormat/12.1.2.1_4': [FAIL],
'intl402/DateTimeFormat/12.2.3_b': [FAIL],
- 'intl402/DateTimeFormat/prototype/12.3.3': [FAIL],
'intl402/DateTimeFormat/prototype/12.3_a': [FAIL],
'intl402/Number/prototype/toLocaleString/13.2.1_5': [PASS, FAIL],
'intl402/NumberFormat/11.1.1_20_c': [FAIL],
- 'intl402/NumberFormat/11.1.1_a': [FAIL],
- 'intl402/NumberFormat/11.1.1': [FAIL],
'intl402/NumberFormat/11.1.2': [PASS, FAIL],
'intl402/NumberFormat/11.1.2.1_4': [FAIL],
'intl402/NumberFormat/11.2.3_b': [FAIL],
@@ -290,15 +236,6 @@
##################### DELIBERATE INCOMPATIBILITIES #####################
- 'built-ins/Math/exp/S15.8.2.8_A6': [PASS, FAIL_OK], # Math.exp (less precise with --fast-math)
-
- # Linux for ia32 (and therefore simulators) default to extended 80 bit
- # floating point formats, so these tests checking 64-bit FP precision fail.
- # The other platforms/arch's pass these tests.
- # We follow the other major JS engines by keeping this default.
- 'language/types/number/S8.5_A2.1': [PASS, FAIL_OK],
- 'language/types/number/S8.5_A2.2': [PASS, FAIL_OK],
-
# https://code.google.com/p/v8/issues/detail?id=4693
'language/block-scope/syntax/redeclaration-in-block/attempt-to-redeclare-function-declaration-with-function-declaration': [PASS, FAIL_SLOPPY],
@@ -319,26 +256,19 @@
# Test262 Bug: https://bugs.ecmascript.org/show_bug.cgi?id=596
'built-ins/Array/prototype/sort/bug_596_1': [PASS, FAIL_OK],
- # Tests do not return boolean.
- 'built-ins/Object/keys/15.2.3.14-1-1': [PASS, FAIL_OK],
- 'built-ins/Object/keys/15.2.3.14-1-2': [PASS, FAIL_OK],
- 'built-ins/Object/keys/15.2.3.14-1-3': [PASS, FAIL_OK],
+ # Test bug https://github.com/tc39/test262/issues/518
+ 'built-ins/TypedArrays/object-arg-throws-setting-typedarray-property': [FAIL],
+ 'built-ins/Object/getOwnPropertyDescriptors/duplicate-keys': [FAIL],
+ 'built-ins/Object/getOwnPropertyDescriptors/symbols-included': [FAIL],
- # Test bug https://github.com/tc39/test262/issues/405
- 'intl402/Collator/prototype/compare/10.3.2_1_c': [PASS, FAIL_OK],
- 'intl402/Collator/prototype/compare/10.3.2_CS_b_NN': [PASS, FAIL_OK],
- 'intl402/Collator/prototype/compare/10.3.2_CS_c_NN': [PASS, FAIL_OK],
- 'intl402/Collator/prototype/compare/10.3.2_CS_d_NN': [PASS, FAIL_OK],
- 'intl402/Date/prototype/13.3.0_7': [PASS, FAIL_OK],
+ # Test bug https://github.com/tc39/test262/issues/521
+ 'built-ins/TypedArray/from/mapfn-is-not-callable': [FAIL],
- # Some tests are too strict, checking SameValue rather than ===
- # https://github.com/tc39/test262/issues/435
- 'built-ins/Array/prototype/indexOf/15.4.4.14-5-9': [FAIL],
- 'built-ins/Array/prototype/lastIndexOf/15.4.4.15-5-9': [FAIL],
-
- # https://github.com/tc39/test262/issues/489
- # Test will pass in 0 or -GMT, but fail in +GMT
- 'language/statements/class/subclass/builtin-objects/Date/regular-subclassing': [PASS, FAIL_OK],
+ # Test bug https://github.com/tc39/test262/issues/529
+ 'built-ins/Math/cos/S15.8.2.7_A7': [PASS, FAIL_OK],
+ 'built-ins/Math/sin/S15.8.2.16_A7': [PASS, FAIL_OK],
+ 'built-ins/Math/tan/S15.8.2.18_A7': [PASS, FAIL_OK],
+ 'built-ins/Math/exp/S15.8.2.8_A6': [PASS, FAIL_OK], # Math.exp (less precise with --fast-math)
############################ SKIPPED TESTS #############################
@@ -373,9 +303,6 @@
}], # system == linux
['system == macos', {
- 'intl402/11.3.2_TRP': [FAIL],
- 'intl402/9.2.5_11_g_ii_2': [FAIL],
-
# BUG(v8:4437).
'intl402/Collator/10.1.1_19_c': [SKIP],
'intl402/Collator/9.2.5_11_g_ii_2': [SKIP],
@@ -426,195 +353,4 @@
'built-ins/ArrayBuffer/allocation-limit': [SKIP],
}], # asan == True or msan == True or tsan == True
-['ignition == True', {
- 'annexB/B.2.3.*': [SKIP],
- 'built-ins/Array/prototype/reduce/*': [SKIP],
- 'built-ins/Array/prototype/reduceRight/*': [SKIP],
- 'built-ins/GeneratorFunction/*': [SKIP],
- 'built-ins/GeneratorPrototype/*': [SKIP],
- 'built-ins/Promise/prototype/then/capability-executor-not-callable': [SKIP],
- 'built-ins/Reflect/enumerate/*': [SKIP],
- 'language/computed-property-names/class/*': [SKIP],
- 'language/computed-property-names/to-name-side-effects/*': [SKIP],
- 'language/directive-prologue/*': [SKIP],
- 'language/expressions/arrow-function/*': [SKIP],
- 'language/expressions/assignment/destructuring/*': [SKIP],
- 'language/expressions/class/subclass/builtin-objects/GeneratorFunction/*': [SKIP],
- 'language/expressions/generators/*': [SKIP],
- 'language/expressions/instanceof/primitive-prototype-with-object': [SKIP],
- 'language/expressions/instanceof/prototype-getter-with-object-throws': [SKIP],
- 'language/expressions/instanceof/prototype-getter-with-object': [SKIP],
- 'language/expressions/object/method-definition/yield*': [SKIP],
- 'language/expressions/object/method-definition/generator*': [SKIP],
- 'language/expressions/yield/*': [SKIP],
- 'language/statements/class/definition/methods-gen-no-yield': [SKIP],
- 'language/statements/class/definition/methods-gen-return': [SKIP],
- 'language/statements/class/definition/methods-gen-yield-as-expression-with-rhs': [SKIP],
- 'language/statements/class/definition/methods-gen-yield-as-generator-method-binding-identifier': [SKIP],
- 'language/statements/class/definition/methods-gen-yield-as-literal-property-name': [SKIP],
- 'language/statements/class/definition/methods-gen-yield-as-property-name': [SKIP],
- 'language/statements/class/definition/methods-gen-yield-as-statement': [SKIP],
- 'language/statements/class/definition/methods-gen-yield-as-expression-without-rhs': [SKIP],
- 'language/statements/class/definition/methods-gen-yield-as-yield-operand': [SKIP],
- 'language/statements/class/definition/methods-gen-yield-newline': [SKIP],
- 'language/statements/class/definition/methods-gen-yield-star-before-newline': [SKIP],
- 'language/statements/class/subclass/builtin-objects/GeneratorFunction/*': [SKIP],
- 'language/statements/generators/*': [SKIP],
-
- 'built-ins/Array/prototype/concat/Array.prototype.concat_non-array': [SKIP],
- 'built-ins/Date/prototype/toISOString/15.9.5.43-0-13': [SKIP],
- 'built-ins/Object/prototype/hasOwnProperty/S15.2.4.5_A12': [SKIP],
- 'built-ins/Object/prototype/isPrototypeOf/S15.2.4.6_A12': [SKIP],
- 'built-ins/Object/prototype/propertyIsEnumerable/S15.2.4.7_A12': [SKIP],
- 'built-ins/Object/prototype/toLocaleString/S15.2.4.3_A12': [SKIP],
- 'built-ins/Object/prototype/toString/15.2.4.2-1-1': [SKIP],
- 'built-ins/Object/prototype/toString/15.2.4.2-1-2': [SKIP],
- 'built-ins/Object/prototype/toString/S15.2.4.2_A12': [SKIP],
- 'built-ins/Object/prototype/valueOf/S15.2.4.4_A12': [SKIP],
- 'built-ins/Object/prototype/valueOf/S15.2.4.4_A14': [SKIP],
- 'built-ins/Object/prototype/valueOf/S15.2.4.4_A15': [SKIP],
- 'built-ins/Promise/all/S25.4.4.1_A4.1_T1': [SKIP],
- 'built-ins/Promise/prototype/then/on-rejected-throw': [SKIP],
- 'built-ins/Promise/reject/S25.4.4.4_A3.1_T1': [SKIP],
- 'built-ins/String/prototype/codePointAt/this-is-undefined-throws': [SKIP],
- 'built-ins/String/prototype/concat/S15.5.4.6_A2': [SKIP],
- 'built-ins/String/prototype/endsWith/this-is-undefined-throws': [SKIP],
- 'built-ins/String/prototype/includes/this-is-undefined-throws': [SKIP],
- 'built-ins/String/prototype/repeat/this-is-undefined-throws': [SKIP],
- 'built-ins/String/prototype/startsWith/this-is-undefined-throws': [SKIP],
- 'built-ins/String/prototype/trim/15.5.4.20-1-1': [SKIP],
- 'language/block-scope/leave/nested-block-let-declaration-only-shadows-outer-parameter-value-1': [SKIP],
- 'language/block-scope/leave/nested-block-let-declaration-only-shadows-outer-parameter-value-2': [SKIP],
- 'language/block-scope/leave/verify-context-in-labelled-block': [SKIP],
- 'language/block-scope/leave/x-after-break-to-label': [SKIP],
- 'language/default-parameters/class-definitions': [SKIP],
- 'language/default-parameters/generators': [SKIP],
- 'language/expressions/object/method-definition/name-prop-name-yield-expr': [SKIP],
- 'language/expressions/tagged-template/call-expression-context-no-strict': [SKIP],
- 'language/expressions/tagged-template/call-expression-context-strict': [SKIP],
- 'language/expressions/template-literal/evaluation-order': [SKIP],
- 'language/statements/for-of/body-dstr-assign': [SKIP],
- 'language/statements/for-of/break': [SKIP],
- 'language/statements/for-of/break-from-catch': [SKIP],
- 'language/statements/for-of/break-from-finally': [SKIP],
- 'language/statements/for-of/break-from-try': [SKIP],
- 'language/statements/for-of/break-label': [SKIP],
- 'language/statements/for-of/break-label-from-catch': [SKIP],
- 'language/statements/for-of/break-label-from-finally': [SKIP],
- 'language/statements/for-of/break-label-from-try': [SKIP],
- 'language/statements/for-of/continue': [SKIP],
- 'language/statements/for-of/continue-from-catch': [SKIP],
- 'language/statements/for-of/continue-from-finally': [SKIP],
- 'language/statements/for-of/continue-from-try': [SKIP],
- 'language/statements/for-of/continue-label': [SKIP],
- 'language/statements/for-of/continue-label-from-catch': [SKIP],
- 'language/statements/for-of/continue-label-from-finally': [SKIP],
- 'language/statements/for-of/continue-label-from-try': [SKIP],
- 'language/statements/for-of/generator': [SKIP],
- 'language/statements/for-of/generator-next-error': [SKIP],
- 'language/statements/for-of/nested': [SKIP],
- 'language/statements/for-of/return': [SKIP],
- 'language/statements/for-of/return-from-catch': [SKIP],
- 'language/statements/for-of/return-from-finally': [SKIP],
- 'language/statements/for-of/return-from-try': [SKIP],
- 'language/statements/for-of/throw': [SKIP],
- 'language/statements/for-of/throw-from-catch': [SKIP],
- 'language/statements/for-of/throw-from-finally': [SKIP],
- 'language/statements/for-of/yield': [SKIP],
- 'language/statements/for-of/yield-from-catch': [SKIP],
- 'language/statements/for-of/yield-from-finally': [SKIP],
- 'language/statements/for-of/yield-from-try': [SKIP],
- 'language/statements/for-of/yield-star': [SKIP],
- 'language/statements/for-of/yield-star-from-catch': [SKIP],
- 'language/statements/for-of/yield-star-from-finally': [SKIP],
- 'language/statements/for-of/yield-star-from-try': [SKIP],
- 'language/object-literal/concise-generator': [SKIP],
- 'language/statements/do-while/S12.6.1_A4_T5': [SKIP],
- 'language/statements/while/S12.6.2_A4_T5': [SKIP],
- 'language/expressions/instanceof/symbol-hasinstance-not-callable': [SKIP],
-
-}], # ignition == True
-
-['ignition == True and (arch == arm or arch == arm64)', {
- 'built-ins/Promise/all/ctx-ctor': [SKIP],
- 'built-ins/Promise/race/ctx-ctor': [SKIP],
- 'built-ins/decodeURI/S15.1.3.1_A1.12_T3': [SKIP],
- 'built-ins/decodeURIComponent/S15.1.3.2_A1.10_T1': [SKIP],
- 'built-ins/decodeURIComponent/S15.1.3.2_A1.11_T2': [SKIP],
- 'built-ins/decodeURIComponent/S15.1.3.2_A1.12_T2': [SKIP],
- 'built-ins/decodeURIComponent/S15.1.3.2_A1.12_T3': [SKIP],
- 'intl402/9.2.2': [SKIP],
- 'language/statements/class/arguments/default-constructor': [SKIP],
- 'language/statements/class/definition/constructor-strict-by-default': [SKIP],
- 'language/statements/class/definition/fn-name-accessor-get': [SKIP],
- 'language/statements/class/definition/fn-name-accessor-set': [SKIP],
- 'language/statements/class/definition/fn-name-gen-method': [SKIP],
- 'language/statements/class/definition/fn-name-method': [SKIP],
- 'language/statements/class/definition/methods-restricted-properties': [SKIP],
- 'language/statements/class/definition/prototype-getter': [SKIP],
- 'language/statements/class/definition/prototype-wiring': [SKIP],
- 'language/statements/class/definition/this-access-restriction': [SKIP],
- 'language/statements/class/definition/this-access-restriction-2': [SKIP],
- 'language/statements/class/definition/this-check-ordering': [SKIP],
- 'language/statements/class/name': [SKIP],
- 'language/statements/class/restricted-properties': [SKIP],
- 'language/statements/class/subclass/binding': [SKIP],
- 'language/statements/class/subclass/builtin-objects/Array/super-must-be-called': [SKIP],
- 'language/statements/class/subclass/builtin-objects/ArrayBuffer/super-must-be-called': [SKIP],
- 'language/statements/class/subclass/builtin-objects/Boolean/super-must-be-called': [SKIP],
- 'language/statements/class/subclass/builtin-objects/DataView/regular-subclassing': [SKIP],
- 'language/statements/class/subclass/builtin-objects/DataView/super-must-be-called': [SKIP],
- 'language/statements/class/subclass/builtin-objects/Date/super-must-be-called': [SKIP],
- 'language/statements/class/subclass/builtin-objects/Error/regular-subclassing': [SKIP],
- 'language/statements/class/subclass/builtin-objects/Error/super-must-be-called': [SKIP],
- 'language/statements/class/subclass/builtin-objects/Function/instance-length': [SKIP],
- 'language/statements/class/subclass/builtin-objects/Function/instance-name': [SKIP],
- 'language/statements/class/subclass/builtin-objects/Function/super-must-be-called': [SKIP],
- 'language/statements/class/subclass/builtin-objects/Map/super-must-be-called': [SKIP],
- 'language/statements/class/subclass/builtin-objects/NativeError/EvalError-name': [SKIP],
- 'language/statements/class/subclass/builtin-objects/NativeError/EvalError-super': [SKIP],
- 'language/statements/class/subclass/builtin-objects/NativeError/RangeError-name': [SKIP],
- 'language/statements/class/subclass/builtin-objects/NativeError/RangeError-super': [SKIP],
- 'language/statements/class/subclass/builtin-objects/NativeError/ReferenceError-name': [SKIP],
- 'language/statements/class/subclass/builtin-objects/NativeError/ReferenceError-super': [SKIP],
- 'language/statements/class/subclass/builtin-objects/NativeError/SyntaxError-name': [SKIP],
- 'language/statements/class/subclass/builtin-objects/NativeError/SyntaxError-super': [SKIP],
- 'language/statements/class/subclass/builtin-objects/NativeError/TypeError-name': [SKIP],
- 'language/statements/class/subclass/builtin-objects/NativeError/TypeError-super': [SKIP],
- 'language/statements/class/subclass/builtin-objects/NativeError/URIError-name': [SKIP],
- 'language/statements/class/subclass/builtin-objects/NativeError/URIError-super': [SKIP],
- 'language/statements/class/subclass/builtin-objects/Number/super-must-be-called': [SKIP],
- 'language/statements/class/subclass/builtin-objects/Object/constructor-return-undefined-throws': [SKIP],
- 'language/statements/class/subclass/builtin-objects/Object/constructor-returns-non-object': [SKIP],
- 'language/statements/class/subclass/builtin-objects/Promise/regular-subclassing': [SKIP],
- 'language/statements/class/subclass/builtin-objects/Promise/super-must-be-called': [SKIP],
- 'language/statements/class/subclass/builtin-objects/RegExp/lastIndex': [SKIP],
- 'language/statements/class/subclass/builtin-objects/RegExp/super-must-be-called': [SKIP],
- 'language/statements/class/subclass/builtin-objects/Set/super-must-be-called': [SKIP],
- 'language/statements/class/subclass/builtin-objects/String/length': [SKIP],
- 'language/statements/class/subclass/builtin-objects/String/super-must-be-called': [SKIP],
- 'language/statements/class/subclass/builtin-objects/Symbol/new-symbol-with-super-throws': [SKIP],
- 'language/statements/class/subclass/builtin-objects/WeakMap/super-must-be-called': [SKIP],
- 'language/statements/class/subclass/builtin-objects/WeakSet/super-must-be-called': [SKIP],
- 'language/statements/class/subclass/class-definition-null-proto-missing-return-override': [SKIP],
- 'language/statements/class/subclass/default-constructor': [SKIP],
- 'language/statements/class/subclass/default-constructor-2': [SKIP],
- 'language/statements/class/subclass/derived-class-return-override-with-boolean': [SKIP],
- 'language/statements/class/subclass/derived-class-return-override-with-null': [SKIP],
- 'language/statements/class/subclass/derived-class-return-override-with-number': [SKIP],
- 'language/statements/class/subclass/derived-class-return-override-with-string': [SKIP],
- 'language/statements/class/subclass/derived-class-return-override-with-symbol': [SKIP],
- 'language/statements/const/fn-name-arrow': [SKIP],
- 'language/statements/const/fn-name-class': [SKIP],
- 'language/statements/const/fn-name-cover': [SKIP],
- 'language/statements/const/fn-name-fn': [SKIP],
- 'language/statements/const/fn-name-gen': [SKIP],
- 'language/statements/let/fn-name-arrow': [SKIP],
- 'language/statements/let/fn-name-class': [SKIP],
- 'language/statements/let/fn-name-cover': [SKIP],
- 'language/statements/let/fn-name-fn': [SKIP],
- 'language/statements/let/fn-name-gen': [SKIP],
- 'test-api/Regress470113': [SKIP],
-}], # ignition == True and (arch == arm or arch == arm64)
-
]
diff --git a/test/test262/testcfg.py b/test/test262/testcfg.py
index b5ad309..bf007bd 100644
--- a/test/test262/testcfg.py
+++ b/test/test262/testcfg.py
@@ -39,7 +39,8 @@
from testrunner.local import utils
from testrunner.objects import testcase
-ARCHIVE = os.path.join(os.path.dirname(os.path.abspath(__file__)), "data.tar")
+DATA = os.path.join(os.path.dirname(os.path.abspath(__file__)), "data")
+ARCHIVE = DATA + ".tar"
TEST_262_HARNESS_FILES = ["sta.js", "assert.js"]
@@ -128,7 +129,8 @@
def GetFlagsForTestCase(self, testcase, context):
return (testcase.flags + context.mode_flags + self.harness +
self.GetIncludesForTest(testcase) + ["--harmony"] +
- [os.path.join(self.testroot, testcase.path + ".js")])
+ [os.path.join(self.testroot, testcase.path + ".js")] +
+ (["--throws"] if "negative" in self.GetTestRecord(testcase) else []))
def _VariantGeneratorFactory(self):
return Test262VariantGenerator
@@ -143,7 +145,7 @@
self.ParseTestRecord = module.parseTestRecord
except:
raise ImportError("Cannot load parseTestRecord; you may need to "
- "--download-data for test262")
+ "gclient sync for test262")
finally:
if f:
f.close()
@@ -170,13 +172,20 @@
with open(filename) as f:
return f.read()
- def IsNegativeTest(self, testcase):
- test_record = self.GetTestRecord(testcase)
- return "negative" in test_record
+ def _ParseException(self, str):
+ for line in str.split("\n")[::-1]:
+ if line and not line[0].isspace() and ":" in line:
+ return line.split(":")[0]
- def IsFailureOutput(self, output, testpath):
+
+ def IsFailureOutput(self, testcase):
+ output = testcase.output
+ test_record = self.GetTestRecord(testcase)
if output.exit_code != 0:
return True
+ if "negative" in test_record:
+ if self._ParseException(output.stdout) != test_record["negative"]:
+ return True
return "FAILED!" in output.stdout
def HasUnexpectedOutput(self, testcase):
@@ -201,10 +210,13 @@
for f in archive_files:
os.remove(os.path.join(self.root, f))
- print "Extracting archive..."
- tar = tarfile.open(ARCHIVE)
- tar.extractall(path=os.path.dirname(ARCHIVE))
- tar.close()
+ # The archive is created only on swarming. Local checkouts have the
+ # data folder.
+ if os.path.exists(ARCHIVE) and not os.path.exists(DATA):
+ print "Extracting archive..."
+ tar = tarfile.open(ARCHIVE)
+ tar.extractall(path=os.path.dirname(ARCHIVE))
+ tar.close()
def GetSuite(name, root):
diff --git a/test/unittests/compiler/graph-unittest.h b/test/unittests/compiler/graph-unittest.h
index 9c99992..31bae6d 100644
--- a/test/unittests/compiler/graph-unittest.h
+++ b/test/unittests/compiler/graph-unittest.h
@@ -29,7 +29,6 @@
explicit GraphTest(int num_parameters = 1);
~GraphTest() override;
- protected:
Node* start() { return graph()->start(); }
Node* end() { return graph()->end(); }
diff --git a/test/unittests/compiler/int64-lowering-unittest.cc b/test/unittests/compiler/int64-lowering-unittest.cc
index eff6d4a..08f3038 100644
--- a/test/unittests/compiler/int64-lowering-unittest.cc
+++ b/test/unittests/compiler/int64-lowering-unittest.cc
@@ -28,7 +28,10 @@
class Int64LoweringTest : public GraphTest {
public:
- Int64LoweringTest() : GraphTest(), machine_(zone()) {
+ Int64LoweringTest()
+ : GraphTest(),
+ machine_(zone(), MachineRepresentation::kWord32,
+ MachineOperatorBuilder::Flag::kAllOptionalOps) {
value_[0] = 0x1234567890abcdef;
value_[1] = 0x1edcba098765432f;
value_[2] = 0x1133557799886644;
@@ -86,14 +89,34 @@
return static_cast<int32_t>(value_[i] >> 32);
}
+ void TestComparison(
+ const Operator* op,
+ Matcher<Node*> (*high_word_matcher)(const Matcher<Node*>& lhs_matcher,
+ const Matcher<Node*>& rhs_matcher),
+ Matcher<Node*> (*low_word_matcher)(const Matcher<Node*>& lhs_matcher,
+ const Matcher<Node*>& rhs_matcher)) {
+ LowerGraph(
+ graph()->NewNode(op, Int64Constant(value(0)), Int64Constant(value(1))),
+ MachineRepresentation::kWord32);
+ EXPECT_THAT(
+ graph()->end()->InputAt(1),
+ IsReturn(IsWord32Or(
+ high_word_matcher(IsInt32Constant(high_word_value(0)),
+ IsInt32Constant(high_word_value(1))),
+ IsWord32And(
+ IsWord32Equal(IsInt32Constant(high_word_value(0)),
+ IsInt32Constant(high_word_value(1))),
+ low_word_matcher(IsInt32Constant(low_word_value(0)),
+ IsInt32Constant(low_word_value(1))))),
+ start(), start()));
+ }
+
private:
MachineOperatorBuilder machine_;
int64_t value_[3];
};
TEST_F(Int64LoweringTest, Int64Constant) {
- if (4 != kPointerSize) return;
-
LowerGraph(Int64Constant(value(0)), MachineRepresentation::kWord64);
EXPECT_THAT(graph()->end()->InputAt(1),
IsReturn2(IsInt32Constant(low_word_value(0)),
@@ -101,8 +124,6 @@
}
TEST_F(Int64LoweringTest, Int64Load) {
- if (4 != kPointerSize) return;
-
int32_t base = 0x1234;
int32_t index = 0x5678;
@@ -128,8 +149,6 @@
}
TEST_F(Int64LoweringTest, Int64Store) {
- if (4 != kPointerSize) return;
-
// We have to build the TF graph explicitly here because Store does not return
// a value.
@@ -173,8 +192,6 @@
}
TEST_F(Int64LoweringTest, Int64And) {
- if (4 != kPointerSize) return;
-
LowerGraph(graph()->NewNode(machine()->Word64And(), Int64Constant(value(0)),
Int64Constant(value(1))),
MachineRepresentation::kWord64);
@@ -187,8 +204,6 @@
}
TEST_F(Int64LoweringTest, TruncateInt64ToInt32) {
- if (4 != kPointerSize) return;
-
LowerGraph(graph()->NewNode(machine()->TruncateInt64ToInt32(),
Int64Constant(value(0))),
MachineRepresentation::kWord32);
@@ -197,8 +212,6 @@
}
TEST_F(Int64LoweringTest, Parameter) {
- if (4 != kPointerSize) return;
-
LowerGraph(Parameter(0), MachineRepresentation::kWord64,
MachineRepresentation::kWord64, 1);
@@ -207,8 +220,6 @@
}
TEST_F(Int64LoweringTest, Parameter2) {
- if (4 != kPointerSize) return;
-
Signature<MachineRepresentation>::Builder sig_builder(zone(), 1, 5);
sig_builder.AddReturn(MachineRepresentation::kWord32);
@@ -229,8 +240,6 @@
}
TEST_F(Int64LoweringTest, CallI64Return) {
- if (4 != kPointerSize) return;
-
int32_t function = 0x9999;
Signature<MachineRepresentation>::Builder sig_builder(zone(), 1, 0);
@@ -259,8 +268,6 @@
}
TEST_F(Int64LoweringTest, CallI64Parameter) {
- if (4 != kPointerSize) return;
-
int32_t function = 0x9999;
Signature<MachineRepresentation>::Builder sig_builder(zone(), 1, 3);
@@ -294,6 +301,505 @@
wasm::ModuleEnv::GetI32WasmCallDescriptor(zone(), desc));
}
+// todo(ahaas): I added a list of missing instructions here to make merging
+// easier when I do them one by one.
+// kExprI64Add:
+TEST_F(Int64LoweringTest, Int64Add) {
+ LowerGraph(graph()->NewNode(machine()->Int64Add(), Int64Constant(value(0)),
+ Int64Constant(value(1))),
+ MachineRepresentation::kWord64);
+
+ Capture<Node*> add;
+ Matcher<Node*> add_matcher = IsInt32PairAdd(
+ IsInt32Constant(low_word_value(0)), IsInt32Constant(high_word_value(0)),
+ IsInt32Constant(low_word_value(1)), IsInt32Constant(high_word_value(1)));
+
+ EXPECT_THAT(graph()->end()->InputAt(1),
+ IsReturn2(IsProjection(0, AllOf(CaptureEq(&add), add_matcher)),
+ IsProjection(1, AllOf(CaptureEq(&add), add_matcher)),
+ start(), start()));
+}
+// kExprI64Sub:
+TEST_F(Int64LoweringTest, Int64Sub) {
+ LowerGraph(graph()->NewNode(machine()->Int64Sub(), Int64Constant(value(0)),
+ Int64Constant(value(1))),
+ MachineRepresentation::kWord64);
+
+ Capture<Node*> sub;
+ Matcher<Node*> sub_matcher = IsInt32PairSub(
+ IsInt32Constant(low_word_value(0)), IsInt32Constant(high_word_value(0)),
+ IsInt32Constant(low_word_value(1)), IsInt32Constant(high_word_value(1)));
+
+ EXPECT_THAT(graph()->end()->InputAt(1),
+ IsReturn2(IsProjection(0, AllOf(CaptureEq(&sub), sub_matcher)),
+ IsProjection(1, AllOf(CaptureEq(&sub), sub_matcher)),
+ start(), start()));
+}
+
+// kExprI64Mul:
+TEST_F(Int64LoweringTest, Int64Mul) {
+ LowerGraph(graph()->NewNode(machine()->Int64Mul(), Int64Constant(value(0)),
+ Int64Constant(value(1))),
+ MachineRepresentation::kWord64);
+
+ Capture<Node*> mul_capture;
+ Matcher<Node*> mul_matcher = IsInt32PairMul(
+ IsInt32Constant(low_word_value(0)), IsInt32Constant(high_word_value(0)),
+ IsInt32Constant(low_word_value(1)), IsInt32Constant(high_word_value(1)));
+
+ EXPECT_THAT(
+ graph()->end()->InputAt(1),
+ IsReturn2(IsProjection(0, AllOf(CaptureEq(&mul_capture), mul_matcher)),
+ IsProjection(1, AllOf(CaptureEq(&mul_capture), mul_matcher)),
+ start(), start()));
+}
+
+// kExprI64DivS:
+// kExprI64DivU:
+// kExprI64RemS:
+// kExprI64RemU:
+// kExprI64Ior:
+TEST_F(Int64LoweringTest, Int64Ior) {
+ LowerGraph(graph()->NewNode(machine()->Word64Or(), Int64Constant(value(0)),
+ Int64Constant(value(1))),
+ MachineRepresentation::kWord64);
+ EXPECT_THAT(graph()->end()->InputAt(1),
+ IsReturn2(IsWord32Or(IsInt32Constant(low_word_value(0)),
+ IsInt32Constant(low_word_value(1))),
+ IsWord32Or(IsInt32Constant(high_word_value(0)),
+ IsInt32Constant(high_word_value(1))),
+ start(), start()));
+}
+
+// kExprI64Xor:
+TEST_F(Int64LoweringTest, Int64Xor) {
+ LowerGraph(graph()->NewNode(machine()->Word64Xor(), Int64Constant(value(0)),
+ Int64Constant(value(1))),
+ MachineRepresentation::kWord64);
+ EXPECT_THAT(graph()->end()->InputAt(1),
+ IsReturn2(IsWord32Xor(IsInt32Constant(low_word_value(0)),
+ IsInt32Constant(low_word_value(1))),
+ IsWord32Xor(IsInt32Constant(high_word_value(0)),
+ IsInt32Constant(high_word_value(1))),
+ start(), start()));
+}
+// kExprI64Shl:
+TEST_F(Int64LoweringTest, Int64Shl) {
+ LowerGraph(graph()->NewNode(machine()->Word64Shl(), Int64Constant(value(0)),
+ Int64Constant(value(1))),
+ MachineRepresentation::kWord64);
+
+ Capture<Node*> shl;
+ Matcher<Node*> shl_matcher = IsWord32PairShl(
+ IsInt32Constant(low_word_value(0)), IsInt32Constant(high_word_value(0)),
+ IsInt32Constant(low_word_value(1)));
+
+ EXPECT_THAT(graph()->end()->InputAt(1),
+ IsReturn2(IsProjection(0, AllOf(CaptureEq(&shl), shl_matcher)),
+ IsProjection(1, AllOf(CaptureEq(&shl), shl_matcher)),
+ start(), start()));
+}
+// kExprI64ShrU:
+TEST_F(Int64LoweringTest, Int64ShrU) {
+ LowerGraph(graph()->NewNode(machine()->Word64Shr(), Int64Constant(value(0)),
+ Int64Constant(value(1))),
+ MachineRepresentation::kWord64);
+
+ Capture<Node*> shr;
+ Matcher<Node*> shr_matcher = IsWord32PairShr(
+ IsInt32Constant(low_word_value(0)), IsInt32Constant(high_word_value(0)),
+ IsInt32Constant(low_word_value(1)));
+
+ EXPECT_THAT(graph()->end()->InputAt(1),
+ IsReturn2(IsProjection(0, AllOf(CaptureEq(&shr), shr_matcher)),
+ IsProjection(1, AllOf(CaptureEq(&shr), shr_matcher)),
+ start(), start()));
+}
+// kExprI64ShrS:
+TEST_F(Int64LoweringTest, Int64ShrS) {
+ LowerGraph(graph()->NewNode(machine()->Word64Sar(), Int64Constant(value(0)),
+ Int64Constant(value(1))),
+ MachineRepresentation::kWord64);
+
+ Capture<Node*> sar;
+ Matcher<Node*> sar_matcher = IsWord32PairSar(
+ IsInt32Constant(low_word_value(0)), IsInt32Constant(high_word_value(0)),
+ IsInt32Constant(low_word_value(1)));
+
+ EXPECT_THAT(graph()->end()->InputAt(1),
+ IsReturn2(IsProjection(0, AllOf(CaptureEq(&sar), sar_matcher)),
+ IsProjection(1, AllOf(CaptureEq(&sar), sar_matcher)),
+ start(), start()));
+}
+// kExprI64Eq:
+TEST_F(Int64LoweringTest, Int64Eq) {
+ LowerGraph(graph()->NewNode(machine()->Word64Equal(), Int64Constant(value(0)),
+ Int64Constant(value(1))),
+ MachineRepresentation::kWord32);
+ EXPECT_THAT(
+ graph()->end()->InputAt(1),
+ IsReturn(IsWord32Equal(
+ IsWord32Or(IsWord32Xor(IsInt32Constant(low_word_value(0)),
+ IsInt32Constant(low_word_value(1))),
+ IsWord32Xor(IsInt32Constant(high_word_value(0)),
+ IsInt32Constant(high_word_value(1)))),
+ IsInt32Constant(0)),
+ start(), start()));
+}
+
+// kExprI64LtS:
+TEST_F(Int64LoweringTest, Int64LtS) {
+ TestComparison(machine()->Int64LessThan(), IsInt32LessThan, IsUint32LessThan);
+}
+// kExprI64LeS:
+TEST_F(Int64LoweringTest, Int64LeS) {
+ TestComparison(machine()->Int64LessThanOrEqual(), IsInt32LessThan,
+ IsUint32LessThanOrEqual);
+}
+// kExprI64LtU:
+TEST_F(Int64LoweringTest, Int64LtU) {
+ TestComparison(machine()->Uint64LessThan(), IsUint32LessThan,
+ IsUint32LessThan);
+}
+// kExprI64LeU:
+TEST_F(Int64LoweringTest, Int64LeU) {
+ TestComparison(machine()->Uint64LessThanOrEqual(), IsUint32LessThan,
+ IsUint32LessThanOrEqual);
+}
+
+// kExprI32ConvertI64:
+TEST_F(Int64LoweringTest, I32ConvertI64) {
+ LowerGraph(graph()->NewNode(machine()->TruncateInt64ToInt32(),
+ Int64Constant(value(0))),
+ MachineRepresentation::kWord32);
+ EXPECT_THAT(graph()->end()->InputAt(1),
+ IsReturn(IsInt32Constant(low_word_value(0)), start(), start()));
+}
+// kExprI64SConvertI32:
+TEST_F(Int64LoweringTest, I64SConvertI32) {
+ LowerGraph(graph()->NewNode(machine()->ChangeInt32ToInt64(),
+ Int32Constant(low_word_value(0))),
+ MachineRepresentation::kWord64);
+
+ EXPECT_THAT(graph()->end()->InputAt(1),
+ IsReturn2(IsInt32Constant(low_word_value(0)),
+ IsWord32Sar(IsInt32Constant(low_word_value(0)),
+ IsInt32Constant(31)),
+ start(), start()));
+}
+
+TEST_F(Int64LoweringTest, I64SConvertI32_2) {
+ LowerGraph(
+ graph()->NewNode(machine()->ChangeInt32ToInt64(),
+ graph()->NewNode(machine()->TruncateInt64ToInt32(),
+ Int64Constant(value(0)))),
+ MachineRepresentation::kWord64);
+
+ EXPECT_THAT(graph()->end()->InputAt(1),
+ IsReturn2(IsInt32Constant(low_word_value(0)),
+ IsWord32Sar(IsInt32Constant(low_word_value(0)),
+ IsInt32Constant(31)),
+ start(), start()));
+}
+// kExprI64UConvertI32:
+TEST_F(Int64LoweringTest, I64UConvertI32) {
+ LowerGraph(graph()->NewNode(machine()->ChangeUint32ToUint64(),
+ Int32Constant(low_word_value(0))),
+ MachineRepresentation::kWord64);
+
+ EXPECT_THAT(graph()->end()->InputAt(1),
+ IsReturn2(IsInt32Constant(low_word_value(0)), IsInt32Constant(0),
+ start(), start()));
+}
+
+TEST_F(Int64LoweringTest, I64UConvertI32_2) {
+ LowerGraph(
+ graph()->NewNode(machine()->ChangeUint32ToUint64(),
+ graph()->NewNode(machine()->TruncateInt64ToInt32(),
+ Int64Constant(value(0)))),
+ MachineRepresentation::kWord64);
+
+ EXPECT_THAT(graph()->end()->InputAt(1),
+ IsReturn2(IsInt32Constant(low_word_value(0)), IsInt32Constant(0),
+ start(), start()));
+}
+// kExprF64ReinterpretI64:
+TEST_F(Int64LoweringTest, F64ReinterpretI64) {
+ LowerGraph(graph()->NewNode(machine()->BitcastInt64ToFloat64(),
+ Int64Constant(value(0))),
+ MachineRepresentation::kFloat64);
+
+ Capture<Node*> stack_slot_capture;
+ Matcher<Node*> stack_slot_matcher =
+ IsStackSlot(MachineRepresentation::kWord64);
+
+ Capture<Node*> store_capture;
+ Matcher<Node*> store_matcher =
+ IsStore(StoreRepresentation(MachineRepresentation::kWord32,
+ WriteBarrierKind::kNoWriteBarrier),
+ AllOf(CaptureEq(&stack_slot_capture), stack_slot_matcher),
+ IsInt32Constant(0), IsInt32Constant(low_word_value(0)),
+ IsStore(StoreRepresentation(MachineRepresentation::kWord32,
+ WriteBarrierKind::kNoWriteBarrier),
+ AllOf(CaptureEq(&stack_slot_capture), stack_slot_matcher),
+ IsInt32Constant(4), IsInt32Constant(high_word_value(0)),
+ start(), start()),
+ start());
+
+ EXPECT_THAT(
+ graph()->end()->InputAt(1),
+ IsReturn(IsLoad(MachineType::Float64(),
+ AllOf(CaptureEq(&stack_slot_capture), stack_slot_matcher),
+ IsInt32Constant(0),
+ AllOf(CaptureEq(&store_capture), store_matcher), start()),
+ start(), start()));
+}
+// kExprI64ReinterpretF64:
+TEST_F(Int64LoweringTest, I64ReinterpretF64) {
+ LowerGraph(graph()->NewNode(machine()->BitcastFloat64ToInt64(),
+ Float64Constant(bit_cast<double>(value(0)))),
+ MachineRepresentation::kWord64);
+
+ Capture<Node*> stack_slot;
+ Matcher<Node*> stack_slot_matcher =
+ IsStackSlot(MachineRepresentation::kWord64);
+
+ Capture<Node*> store;
+ Matcher<Node*> store_matcher = IsStore(
+ StoreRepresentation(MachineRepresentation::kFloat64,
+ WriteBarrierKind::kNoWriteBarrier),
+ AllOf(CaptureEq(&stack_slot), stack_slot_matcher), IsInt32Constant(0),
+ IsFloat64Constant(bit_cast<double>(value(0))), start(), start());
+
+ EXPECT_THAT(
+ graph()->end()->InputAt(1),
+ IsReturn2(IsLoad(MachineType::Int32(),
+ AllOf(CaptureEq(&stack_slot), stack_slot_matcher),
+ IsInt32Constant(0),
+ AllOf(CaptureEq(&store), store_matcher), start()),
+ IsLoad(MachineType::Int32(),
+ AllOf(CaptureEq(&stack_slot), stack_slot_matcher),
+ IsInt32Constant(0x4),
+ AllOf(CaptureEq(&store), store_matcher), start()),
+ start(), start()));
+}
+// kExprI64Clz:
+TEST_F(Int64LoweringTest, I64Clz) {
+ LowerGraph(graph()->NewNode(machine()->Word64Clz(), Int64Constant(value(0))),
+ MachineRepresentation::kWord64);
+
+ Capture<Node*> branch_capture;
+ Matcher<Node*> branch_matcher = IsBranch(
+ IsWord32Equal(IsInt32Constant(high_word_value(0)), IsInt32Constant(0)),
+ start());
+
+ EXPECT_THAT(
+ graph()->end()->InputAt(1),
+ IsReturn2(
+ IsPhi(MachineRepresentation::kWord32,
+ IsInt32Add(IsWord32Clz(IsInt32Constant(low_word_value(0))),
+ IsInt32Constant(32)),
+ IsWord32Clz(IsInt32Constant(high_word_value(0))),
+ IsMerge(
+ IsIfTrue(AllOf(CaptureEq(&branch_capture), branch_matcher)),
+ IsIfFalse(
+ AllOf(CaptureEq(&branch_capture), branch_matcher)))),
+ IsInt32Constant(0), start(), start()));
+}
+// kExprI64Ctz:
+TEST_F(Int64LoweringTest, I64Ctz) {
+ LowerGraph(graph()->NewNode(machine()->Word64CtzPlaceholder(),
+ Int64Constant(value(0))),
+ MachineRepresentation::kWord64);
+ Capture<Node*> branch_capture;
+ Matcher<Node*> branch_matcher = IsBranch(
+ IsWord32Equal(IsInt32Constant(low_word_value(0)), IsInt32Constant(0)),
+ start());
+ EXPECT_THAT(
+ graph()->end()->InputAt(1),
+ IsReturn2(
+ IsPhi(MachineRepresentation::kWord32,
+ IsInt32Add(IsWord32Ctz(IsInt32Constant(high_word_value(0))),
+ IsInt32Constant(32)),
+ IsWord32Ctz(IsInt32Constant(low_word_value(0))),
+ IsMerge(
+ IsIfTrue(AllOf(CaptureEq(&branch_capture), branch_matcher)),
+ IsIfFalse(
+ AllOf(CaptureEq(&branch_capture), branch_matcher)))),
+ IsInt32Constant(0), start(), start()));
+}
+// kExprI64Popcnt:
+
+TEST_F(Int64LoweringTest, Dfs) {
+ Node* common = Int64Constant(value(0));
+ LowerGraph(graph()->NewNode(machine()->Word64And(), common,
+ graph()->NewNode(machine()->Word64And(), common,
+ Int64Constant(value(1)))),
+ MachineRepresentation::kWord64);
+
+ EXPECT_THAT(
+ graph()->end()->InputAt(1),
+ IsReturn2(IsWord32And(IsInt32Constant(low_word_value(0)),
+ IsWord32And(IsInt32Constant(low_word_value(0)),
+ IsInt32Constant(low_word_value(1)))),
+ IsWord32And(IsInt32Constant(high_word_value(0)),
+ IsWord32And(IsInt32Constant(high_word_value(0)),
+ IsInt32Constant(high_word_value(1)))),
+ start(), start()));
+}
+
+TEST_F(Int64LoweringTest, I64Popcnt) {
+ LowerGraph(graph()->NewNode(machine()->Word64PopcntPlaceholder(),
+ Int64Constant(value(0))),
+ MachineRepresentation::kWord64);
+
+ EXPECT_THAT(
+ graph()->end()->InputAt(1),
+ IsReturn2(IsInt32Add(IsWord32Popcnt(IsInt32Constant(low_word_value(0))),
+ IsWord32Popcnt(IsInt32Constant(high_word_value(0)))),
+ IsInt32Constant(0), start(), start()));
+}
+
+TEST_F(Int64LoweringTest, I64Ror) {
+ LowerGraph(graph()->NewNode(machine()->Word64Ror(), Int64Constant(value(0)),
+ Parameter(0)),
+ MachineRepresentation::kWord64, MachineRepresentation::kWord64, 1);
+
+ Matcher<Node*> branch_lt32_matcher =
+ IsBranch(IsInt32LessThan(IsParameter(0), IsInt32Constant(32)), start());
+
+ Matcher<Node*> low_input_matcher = IsPhi(
+ MachineRepresentation::kWord32, IsInt32Constant(low_word_value(0)),
+ IsInt32Constant(high_word_value(0)),
+ IsMerge(IsIfTrue(branch_lt32_matcher), IsIfFalse(branch_lt32_matcher)));
+
+ Matcher<Node*> high_input_matcher = IsPhi(
+ MachineRepresentation::kWord32, IsInt32Constant(high_word_value(0)),
+ IsInt32Constant(low_word_value(0)),
+ IsMerge(IsIfTrue(branch_lt32_matcher), IsIfFalse(branch_lt32_matcher)));
+
+ Matcher<Node*> shift_matcher =
+ IsWord32And(IsParameter(0), IsInt32Constant(0x1f));
+
+ Matcher<Node*> bit_mask_matcher = IsWord32Shl(
+ IsWord32Sar(IsInt32Constant(std::numeric_limits<int32_t>::min()),
+ shift_matcher),
+ IsInt32Constant(1));
+
+ Matcher<Node*> inv_mask_matcher =
+ IsWord32Xor(bit_mask_matcher, IsInt32Constant(-1));
+
+ EXPECT_THAT(
+ graph()->end()->InputAt(1),
+ IsReturn2(
+ IsWord32Or(IsWord32And(IsWord32Ror(low_input_matcher, shift_matcher),
+ inv_mask_matcher),
+ IsWord32And(IsWord32Ror(high_input_matcher, shift_matcher),
+ bit_mask_matcher)),
+ IsWord32Or(IsWord32And(IsWord32Ror(high_input_matcher, shift_matcher),
+ inv_mask_matcher),
+ IsWord32And(IsWord32Ror(low_input_matcher, shift_matcher),
+ bit_mask_matcher)),
+ start(), start()));
+}
+
+TEST_F(Int64LoweringTest, I64Ror_0) {
+ LowerGraph(graph()->NewNode(machine()->Word64Ror(), Int64Constant(value(0)),
+ Int32Constant(0)),
+ MachineRepresentation::kWord64);
+
+ EXPECT_THAT(graph()->end()->InputAt(1),
+ IsReturn2(IsInt32Constant(low_word_value(0)),
+ IsInt32Constant(high_word_value(0)), start(), start()));
+}
+
+TEST_F(Int64LoweringTest, I64Ror_32) {
+ LowerGraph(graph()->NewNode(machine()->Word64Ror(), Int64Constant(value(0)),
+ Int32Constant(32)),
+ MachineRepresentation::kWord64);
+
+ EXPECT_THAT(graph()->end()->InputAt(1),
+ IsReturn2(IsInt32Constant(high_word_value(0)),
+ IsInt32Constant(low_word_value(0)), start(), start()));
+}
+
+TEST_F(Int64LoweringTest, I64Ror_11) {
+ LowerGraph(graph()->NewNode(machine()->Word64Ror(), Int64Constant(value(0)),
+ Int32Constant(11)),
+ MachineRepresentation::kWord64);
+
+ EXPECT_THAT(
+ graph()->end()->InputAt(1),
+ IsReturn2(IsWord32Or(IsWord32Shr(IsInt32Constant(low_word_value(0)),
+ IsInt32Constant(11)),
+ IsWord32Shl(IsInt32Constant(high_word_value(0)),
+ IsInt32Constant(21))),
+ IsWord32Or(IsWord32Shr(IsInt32Constant(high_word_value(0)),
+ IsInt32Constant(11)),
+ IsWord32Shl(IsInt32Constant(low_word_value(0)),
+ IsInt32Constant(21))),
+ start(), start()));
+}
+
+TEST_F(Int64LoweringTest, I64Ror_43) {
+ LowerGraph(graph()->NewNode(machine()->Word64Ror(), Int64Constant(value(0)),
+ Int32Constant(43)),
+ MachineRepresentation::kWord64);
+
+ EXPECT_THAT(
+ graph()->end()->InputAt(1),
+ IsReturn2(IsWord32Or(IsWord32Shr(IsInt32Constant(high_word_value(0)),
+ IsInt32Constant(11)),
+ IsWord32Shl(IsInt32Constant(low_word_value(0)),
+ IsInt32Constant(21))),
+ IsWord32Or(IsWord32Shr(IsInt32Constant(low_word_value(0)),
+ IsInt32Constant(11)),
+ IsWord32Shl(IsInt32Constant(high_word_value(0)),
+ IsInt32Constant(21))),
+ start(), start()));
+}
+
+TEST_F(Int64LoweringTest, I64PhiWord64) {
+ LowerGraph(graph()->NewNode(common()->Phi(MachineRepresentation::kWord64, 2),
+ Int64Constant(value(0)), Int64Constant(value(1)),
+ start()),
+ MachineRepresentation::kWord64);
+
+ EXPECT_THAT(graph()->end()->InputAt(1),
+ IsReturn2(IsPhi(MachineRepresentation::kWord32,
+ IsInt32Constant(low_word_value(0)),
+ IsInt32Constant(low_word_value(1)), start()),
+ IsPhi(MachineRepresentation::kWord32,
+ IsInt32Constant(high_word_value(0)),
+ IsInt32Constant(high_word_value(1)), start()),
+ start(), start()));
+}
+
+void TestPhi(Int64LoweringTest* test, MachineRepresentation rep, Node* v1,
+ Node* v2) {
+ test->LowerGraph(test->graph()->NewNode(test->common()->Phi(rep, 2), v1, v2,
+ test->start()),
+ rep);
+
+ EXPECT_THAT(test->graph()->end()->InputAt(1),
+ IsReturn(IsPhi(rep, v1, v2, test->start()), test->start(),
+ test->start()));
+}
+
+TEST_F(Int64LoweringTest, I64PhiFloat32) {
+ TestPhi(this, MachineRepresentation::kFloat32, Float32Constant(1.5),
+ Float32Constant(2.5));
+}
+
+TEST_F(Int64LoweringTest, I64PhiFloat64) {
+ TestPhi(this, MachineRepresentation::kFloat64, Float32Constant(1.5),
+ Float32Constant(2.5));
+}
+
+TEST_F(Int64LoweringTest, I64PhiWord32) {
+ TestPhi(this, MachineRepresentation::kWord32, Float32Constant(1),
+ Float32Constant(2));
+}
} // namespace compiler
} // namespace internal
} // namespace v8
diff --git a/test/unittests/compiler/js-builtin-reducer-unittest.cc b/test/unittests/compiler/js-builtin-reducer-unittest.cc
index 9e14cda..0f8eed7 100644
--- a/test/unittests/compiler/js-builtin-reducer-unittest.cc
+++ b/test/unittests/compiler/js-builtin-reducer-unittest.cc
@@ -43,7 +43,7 @@
isolate()->factory()->NewStringFromAsciiChecked(
"Math")).ToHandleChecked();
Handle<JSFunction> f = Handle<JSFunction>::cast(
- JSObject::GetProperty(
+ Object::GetProperty(
m, isolate()->factory()->NewStringFromAsciiChecked(name))
.ToHandleChecked());
return HeapConstant(f);
@@ -149,8 +149,8 @@
Node* control = graph()->start();
Node* context = UndefinedConstant();
Node* frame_state = graph()->start();
- TRACED_FOREACH(Type*, t0, kIntegral32Types) {
- TRACED_FOREACH(Type*, t1, kIntegral32Types) {
+ TRACED_FOREACH(Type*, t0, kNumberTypes) {
+ TRACED_FOREACH(Type*, t1, kNumberTypes) {
Node* p0 = Parameter(t0, 0);
Node* p1 = Parameter(t1, 1);
Node* call = graph()->NewNode(javascript()->CallFunction(4), function,
@@ -159,7 +159,8 @@
Reduction r = Reduce(call);
ASSERT_TRUE(r.Changed());
- EXPECT_THAT(r.replacement(), IsInt32Mul(p0, p1));
+ EXPECT_THAT(r.replacement(),
+ IsNumberImul(IsNumberToUint32(p0), IsNumberToUint32(p1)));
}
}
}
diff --git a/test/unittests/compiler/js-intrinsic-lowering-unittest.cc b/test/unittests/compiler/js-intrinsic-lowering-unittest.cc
index 919c1b2..de0eefc 100644
--- a/test/unittests/compiler/js-intrinsic-lowering-unittest.cc
+++ b/test/unittests/compiler/js-intrinsic-lowering-unittest.cc
@@ -91,7 +91,8 @@
graph()->NewNode(javascript()->CallRuntime(Runtime::kInlineDoubleLo, 1),
input, context, effect, control));
ASSERT_TRUE(r.Changed());
- EXPECT_THAT(r.replacement(), IsFloat64ExtractLowWord32(input));
+ EXPECT_THAT(r.replacement(),
+ IsFloat64ExtractLowWord32(IsGuard(Type::Number(), input, _)));
}
@@ -108,7 +109,8 @@
graph()->NewNode(javascript()->CallRuntime(Runtime::kInlineDoubleHi, 1),
input, context, effect, control));
ASSERT_TRUE(r.Changed());
- EXPECT_THAT(r.replacement(), IsFloat64ExtractHighWord32(input));
+ EXPECT_THAT(r.replacement(),
+ IsFloat64ExtractHighWord32(IsGuard(Type::Number(), input, _)));
}
@@ -240,58 +242,6 @@
// -----------------------------------------------------------------------------
-// %_MathFloor
-
-
-TEST_F(JSIntrinsicLoweringTest, InlineMathFloor) {
- Node* const input = Parameter(0);
- Node* const context = Parameter(1);
- Node* const effect = graph()->start();
- Node* const control = graph()->start();
- Reduction const r = Reduce(
- graph()->NewNode(javascript()->CallRuntime(Runtime::kInlineMathFloor, 1),
- input, context, effect, control),
- MachineOperatorBuilder::kFloat64RoundDown);
- ASSERT_TRUE(r.Changed());
- EXPECT_THAT(r.replacement(), IsFloat64RoundDown(input));
-}
-
-
-// -----------------------------------------------------------------------------
-// %_MathSqrt
-
-
-TEST_F(JSIntrinsicLoweringTest, InlineMathSqrt) {
- Node* const input = Parameter(0);
- Node* const context = Parameter(1);
- Node* const effect = graph()->start();
- Node* const control = graph()->start();
- Reduction const r = Reduce(
- graph()->NewNode(javascript()->CallRuntime(Runtime::kInlineMathSqrt, 1),
- input, context, effect, control));
- ASSERT_TRUE(r.Changed());
- EXPECT_THAT(r.replacement(), IsFloat64Sqrt(input));
-}
-
-
-// -----------------------------------------------------------------------------
-// %_MathClz32
-
-
-TEST_F(JSIntrinsicLoweringTest, InlineMathClz32) {
- Node* const input = Parameter(0);
- Node* const context = Parameter(1);
- Node* const effect = graph()->start();
- Node* const control = graph()->start();
- Reduction const r = Reduce(
- graph()->NewNode(javascript()->CallRuntime(Runtime::kInlineMathClz32, 1),
- input, context, effect, control));
- ASSERT_TRUE(r.Changed());
- EXPECT_THAT(r.replacement(), IsWord32Clz(input));
-}
-
-
-// -----------------------------------------------------------------------------
// %_ValueOf
@@ -334,6 +284,23 @@
AllOf(CaptureEq(&if_false0), IsIfFalse(CaptureEq(&branch0))))));
}
+// -----------------------------------------------------------------------------
+// %_GetOrdinaryHasInstance
+
+TEST_F(JSIntrinsicLoweringTest, InlineGetOrdinaryHasInstance) {
+ Node* const context = Parameter(0);
+ Node* const effect = graph()->start();
+ Node* const control = graph()->start();
+ Reduction const r = Reduce(graph()->NewNode(
+ javascript()->CallRuntime(Runtime::kInlineGetOrdinaryHasInstance, 0),
+ context, effect, control));
+ ASSERT_TRUE(r.Changed());
+ EXPECT_THAT(
+ r.replacement(),
+ IsLoadContext(
+ ContextAccess(0, Context::ORDINARY_HAS_INSTANCE_INDEX, true), _));
+}
+
} // namespace compiler
} // namespace internal
} // namespace v8
diff --git a/test/unittests/compiler/js-typed-lowering-unittest.cc b/test/unittests/compiler/js-typed-lowering-unittest.cc
index e37d4a2..1adb5da 100644
--- a/test/unittests/compiler/js-typed-lowering-unittest.cc
+++ b/test/unittests/compiler/js-typed-lowering-unittest.cc
@@ -67,7 +67,7 @@
STATIC_ASSERT(LANGUAGE_END == 3);
-const LanguageMode kLanguageModes[] = {SLOPPY, STRICT, STRONG};
+const LanguageMode kLanguageModes[] = {SLOPPY, STRICT};
} // namespace
diff --git a/test/unittests/compiler/load-elimination-unittest.cc b/test/unittests/compiler/load-elimination-unittest.cc
index 3ad11cf..38bb151 100644
--- a/test/unittests/compiler/load-elimination-unittest.cc
+++ b/test/unittests/compiler/load-elimination-unittest.cc
@@ -12,30 +12,33 @@
namespace internal {
namespace compiler {
-class LoadEliminationTest : public GraphTest {
+class LoadEliminationTest : public TypedGraphTest {
public:
- LoadEliminationTest() : GraphTest(3), simplified_(zone()) {}
+ LoadEliminationTest()
+ : TypedGraphTest(3), common_(zone()), simplified_(zone()) {}
~LoadEliminationTest() override {}
protected:
Reduction Reduce(Node* node) {
// TODO(titzer): mock the GraphReducer here for better unit testing.
GraphReducer graph_reducer(zone(), graph());
- LoadElimination reducer(&graph_reducer);
+ LoadElimination reducer(&graph_reducer, graph(), common());
return reducer.Reduce(node);
}
SimplifiedOperatorBuilder* simplified() { return &simplified_; }
+ CommonOperatorBuilder* common() { return &common_; }
private:
+ CommonOperatorBuilder common_;
SimplifiedOperatorBuilder simplified_;
};
TEST_F(LoadEliminationTest, LoadFieldWithStoreField) {
- Node* object1 = Parameter(0);
- Node* object2 = Parameter(1);
- Node* value = Parameter(2);
+ Node* object1 = Parameter(Type::Any(), 0);
+ Node* object2 = Parameter(Type::Any(), 1);
+ Node* value = Parameter(Type::Any(), 2);
Node* effect = graph()->start();
Node* control = graph()->start();
diff --git a/test/unittests/compiler/loop-peeling-unittest.cc b/test/unittests/compiler/loop-peeling-unittest.cc
index 9dcec85..9db4905 100644
--- a/test/unittests/compiler/loop-peeling-unittest.cc
+++ b/test/unittests/compiler/loop-peeling-unittest.cc
@@ -64,7 +64,7 @@
OFStream os(stdout);
os << AsRPO(*graph());
}
- Zone zone;
+ Zone zone(isolate()->allocator());
return LoopFinder::BuildLoopTree(graph(), &zone);
}
diff --git a/test/unittests/compiler/node-test-utils.cc b/test/unittests/compiler/node-test-utils.cc
index ee4cf54..6e5d39f 100644
--- a/test/unittests/compiler/node-test-utils.cc
+++ b/test/unittests/compiler/node-test-utils.cc
@@ -1330,6 +1330,53 @@
const Matcher<Node*> control_matcher_;
};
+class IsStackSlotMatcher final : public NodeMatcher {
+ public:
+ explicit IsStackSlotMatcher(const Matcher<MachineRepresentation>& rep_matcher)
+ : NodeMatcher(IrOpcode::kStackSlot), rep_matcher_(rep_matcher) {}
+
+ void DescribeTo(std::ostream* os) const final {
+ NodeMatcher::DescribeTo(os);
+ *os << " whose rep (";
+ rep_matcher_.DescribeTo(os);
+ *os << ")";
+ }
+
+ bool MatchAndExplain(Node* node, MatchResultListener* listener) const final {
+ return (NodeMatcher::MatchAndExplain(node, listener) &&
+ PrintMatchAndExplain(OpParameter<MachineRepresentation>(node),
+ "rep", rep_matcher_, listener));
+ }
+
+ private:
+ const Matcher<MachineRepresentation> rep_matcher_;
+};
+
+class IsGuardMatcher final : public NodeMatcher {
+ public:
+ IsGuardMatcher(const Matcher<Type*>& type_matcher,
+ const Matcher<Node*>& value_matcher,
+ const Matcher<Node*>& control_matcher)
+ : NodeMatcher(IrOpcode::kGuard),
+ type_matcher_(type_matcher),
+ value_matcher_(value_matcher),
+ control_matcher_(control_matcher) {}
+
+ bool MatchAndExplain(Node* node, MatchResultListener* listener) const final {
+ return (NodeMatcher::MatchAndExplain(node, listener) &&
+ PrintMatchAndExplain(OpParameter<Type*>(node->op()), "type",
+ type_matcher_, listener) &&
+ PrintMatchAndExplain(NodeProperties::GetValueInput(node, 0),
+ "value", value_matcher_, listener) &&
+ PrintMatchAndExplain(NodeProperties::GetControlInput(node, 0),
+ "control", control_matcher_, listener));
+ }
+
+ private:
+ const Matcher<Type*> type_matcher_;
+ const Matcher<Node*> value_matcher_;
+ const Matcher<Node*> control_matcher_;
+};
class IsToNumberMatcher final : public NodeMatcher {
public:
@@ -1406,6 +1453,86 @@
const Matcher<Node*> context_matcher_;
};
+class IsQuadopMatcher final : public NodeMatcher {
+ public:
+ IsQuadopMatcher(IrOpcode::Value opcode, const Matcher<Node*>& a_matcher,
+ const Matcher<Node*>& b_matcher,
+ const Matcher<Node*>& c_matcher,
+ const Matcher<Node*>& d_matcher)
+ : NodeMatcher(opcode),
+ a_matcher_(a_matcher),
+ b_matcher_(b_matcher),
+ c_matcher_(c_matcher),
+ d_matcher_(d_matcher) {}
+
+ void DescribeTo(std::ostream* os) const final {
+ NodeMatcher::DescribeTo(os);
+ *os << " whose a (";
+ a_matcher_.DescribeTo(os);
+ *os << ") and b (";
+ b_matcher_.DescribeTo(os);
+ *os << ") and c (";
+ c_matcher_.DescribeTo(os);
+ *os << ") and d (";
+ d_matcher_.DescribeTo(os);
+ *os << ")";
+ }
+
+ bool MatchAndExplain(Node* node, MatchResultListener* listener) const final {
+ return (NodeMatcher::MatchAndExplain(node, listener) &&
+ PrintMatchAndExplain(NodeProperties::GetValueInput(node, 0), "a",
+ a_matcher_, listener) &&
+ PrintMatchAndExplain(NodeProperties::GetValueInput(node, 1), "b",
+ b_matcher_, listener) &&
+ PrintMatchAndExplain(NodeProperties::GetValueInput(node, 2), "c",
+ c_matcher_, listener) &&
+ PrintMatchAndExplain(NodeProperties::GetValueInput(node, 3), "d",
+ d_matcher_, listener));
+ }
+
+ private:
+ const Matcher<Node*> a_matcher_;
+ const Matcher<Node*> b_matcher_;
+ const Matcher<Node*> c_matcher_;
+ const Matcher<Node*> d_matcher_;
+};
+
+class IsTernopMatcher final : public NodeMatcher {
+ public:
+ IsTernopMatcher(IrOpcode::Value opcode, const Matcher<Node*>& lhs_matcher,
+ const Matcher<Node*>& mid_matcher,
+ const Matcher<Node*>& rhs_matcher)
+ : NodeMatcher(opcode),
+ lhs_matcher_(lhs_matcher),
+ mid_matcher_(mid_matcher),
+ rhs_matcher_(rhs_matcher) {}
+
+ void DescribeTo(std::ostream* os) const final {
+ NodeMatcher::DescribeTo(os);
+ *os << " whose lhs (";
+ lhs_matcher_.DescribeTo(os);
+ *os << ") and mid (";
+ mid_matcher_.DescribeTo(os);
+ *os << ") and rhs (";
+ rhs_matcher_.DescribeTo(os);
+ *os << ")";
+ }
+
+ bool MatchAndExplain(Node* node, MatchResultListener* listener) const final {
+ return (NodeMatcher::MatchAndExplain(node, listener) &&
+ PrintMatchAndExplain(NodeProperties::GetValueInput(node, 0), "lhs",
+ lhs_matcher_, listener) &&
+ PrintMatchAndExplain(NodeProperties::GetValueInput(node, 1), "mid",
+ mid_matcher_, listener) &&
+ PrintMatchAndExplain(NodeProperties::GetValueInput(node, 2), "rhs",
+ rhs_matcher_, listener));
+ }
+
+ private:
+ const Matcher<Node*> lhs_matcher_;
+ const Matcher<Node*> mid_matcher_;
+ const Matcher<Node*> rhs_matcher_;
+};
class IsBinopMatcher final : public NodeMatcher {
public:
@@ -1484,7 +1611,6 @@
} // namespace
-
Matcher<Node*> IsDead() {
return MakeMatcher(new NodeMatcher(IrOpcode::kDead));
}
@@ -1938,6 +2064,12 @@
effect_matcher, control_matcher));
}
+Matcher<Node*> IsGuard(const Matcher<Type*>& type_matcher,
+ const Matcher<Node*>& value_matcher,
+ const Matcher<Node*>& control_matcher) {
+ return MakeMatcher(
+ new IsGuardMatcher(type_matcher, value_matcher, control_matcher));
+}
Matcher<Node*> IsReferenceEqual(const Matcher<Type*>& type_matcher,
const Matcher<Node*>& lhs_matcher,
@@ -2044,6 +2176,9 @@
effect_matcher, control_matcher));
}
+Matcher<Node*> IsStackSlot(const Matcher<MachineRepresentation>& rep_matcher) {
+ return MakeMatcher(new IsStackSlotMatcher(rep_matcher));
+}
Matcher<Node*> IsToNumber(const Matcher<Node*>& base_matcher,
const Matcher<Node*>& context_matcher,
@@ -2069,6 +2204,29 @@
return MakeMatcher(new NodeMatcher(IrOpcode::kLoadFramePointer));
}
+#define IS_QUADOP_MATCHER(Name) \
+ Matcher<Node*> Is##Name( \
+ const Matcher<Node*>& a_matcher, const Matcher<Node*>& b_matcher, \
+ const Matcher<Node*>& c_matcher, const Matcher<Node*>& d_matcher) { \
+ return MakeMatcher(new IsQuadopMatcher(IrOpcode::k##Name, a_matcher, \
+ b_matcher, c_matcher, d_matcher)); \
+ }
+
+IS_QUADOP_MATCHER(Int32PairAdd)
+IS_QUADOP_MATCHER(Int32PairSub)
+IS_QUADOP_MATCHER(Int32PairMul)
+
+#define IS_TERNOP_MATCHER(Name) \
+ Matcher<Node*> Is##Name(const Matcher<Node*>& lhs_matcher, \
+ const Matcher<Node*>& mid_matcher, \
+ const Matcher<Node*>& rhs_matcher) { \
+ return MakeMatcher(new IsTernopMatcher(IrOpcode::k##Name, lhs_matcher, \
+ mid_matcher, rhs_matcher)); \
+ }
+
+IS_TERNOP_MATCHER(Word32PairShl)
+IS_TERNOP_MATCHER(Word32PairShr)
+IS_TERNOP_MATCHER(Word32PairSar)
#define IS_BINOP_MATCHER(Name) \
Matcher<Node*> Is##Name(const Matcher<Node*>& lhs_matcher, \
@@ -2083,8 +2241,10 @@
IS_BINOP_MATCHER(NumberShiftLeft)
IS_BINOP_MATCHER(NumberShiftRight)
IS_BINOP_MATCHER(NumberShiftRightLogical)
+IS_BINOP_MATCHER(NumberImul)
IS_BINOP_MATCHER(Word32And)
IS_BINOP_MATCHER(Word32Or)
+IS_BINOP_MATCHER(Word32Xor)
IS_BINOP_MATCHER(Word32Sar)
IS_BINOP_MATCHER(Word32Shl)
IS_BINOP_MATCHER(Word32Shr)
@@ -2146,6 +2306,8 @@
IS_UNOP_MATCHER(ObjectIsReceiver)
IS_UNOP_MATCHER(ObjectIsSmi)
IS_UNOP_MATCHER(Word32Clz)
+IS_UNOP_MATCHER(Word32Ctz)
+IS_UNOP_MATCHER(Word32Popcnt)
#undef IS_UNOP_MATCHER
} // namespace compiler
diff --git a/test/unittests/compiler/node-test-utils.h b/test/unittests/compiler/node-test-utils.h
index 03f2a3b..dd036c9 100644
--- a/test/unittests/compiler/node-test-utils.h
+++ b/test/unittests/compiler/node-test-utils.h
@@ -211,6 +211,8 @@
const Matcher<Node*>& rhs_matcher);
Matcher<Node*> IsNumberShiftRightLogical(const Matcher<Node*>& lhs_matcher,
const Matcher<Node*>& rhs_matcher);
+Matcher<Node*> IsNumberImul(const Matcher<Node*>& lhs_matcher,
+ const Matcher<Node*>& rhs_matcher);
Matcher<Node*> IsAllocate(const Matcher<Node*>& size_matcher,
const Matcher<Node*>& effect_matcher,
const Matcher<Node*>& control_matcher);
@@ -261,10 +263,13 @@
const Matcher<Node*>& value_matcher,
const Matcher<Node*>& effect_matcher,
const Matcher<Node*>& control_matcher);
+Matcher<Node*> IsStackSlot(const Matcher<MachineRepresentation>& rep_matcher);
Matcher<Node*> IsWord32And(const Matcher<Node*>& lhs_matcher,
const Matcher<Node*>& rhs_matcher);
Matcher<Node*> IsWord32Or(const Matcher<Node*>& lhs_matcher,
const Matcher<Node*>& rhs_matcher);
+Matcher<Node*> IsWord32Xor(const Matcher<Node*>& lhs_matcher,
+ const Matcher<Node*>& rhs_matcher);
Matcher<Node*> IsWord32Sar(const Matcher<Node*>& lhs_matcher,
const Matcher<Node*>& rhs_matcher);
Matcher<Node*> IsWord32Shl(const Matcher<Node*>& lhs_matcher,
@@ -276,6 +281,8 @@
Matcher<Node*> IsWord32Equal(const Matcher<Node*>& lhs_matcher,
const Matcher<Node*>& rhs_matcher);
Matcher<Node*> IsWord32Clz(const Matcher<Node*>& value_matcher);
+Matcher<Node*> IsWord32Ctz(const Matcher<Node*>& value_matcher);
+Matcher<Node*> IsWord32Popcnt(const Matcher<Node*>& value_matcher);
Matcher<Node*> IsWord64And(const Matcher<Node*>& lhs_matcher,
const Matcher<Node*>& rhs_matcher);
Matcher<Node*> IsWord64Or(const Matcher<Node*>& lhs_matcher,
@@ -356,6 +363,35 @@
Matcher<Node*> IsParameter(const Matcher<int> index_matcher);
Matcher<Node*> IsLoadFramePointer();
+Matcher<Node*> IsInt32PairAdd(const Matcher<Node*>& a_matcher,
+ const Matcher<Node*>& b_matcher,
+ const Matcher<Node*>& c_matcher,
+ const Matcher<Node*>& d_matcher);
+Matcher<Node*> IsInt32PairSub(const Matcher<Node*>& a_matcher,
+ const Matcher<Node*>& b_matcher,
+ const Matcher<Node*>& c_matcher,
+ const Matcher<Node*>& d_matcher);
+Matcher<Node*> IsInt32PairMul(const Matcher<Node*>& a_matcher,
+ const Matcher<Node*>& b_matcher,
+ const Matcher<Node*>& c_matcher,
+ const Matcher<Node*>& d_matcher);
+
+Matcher<Node*> IsWord32PairShl(const Matcher<Node*>& lhs_matcher,
+ const Matcher<Node*>& mid_matcher,
+ const Matcher<Node*>& rhs_matcher);
+Matcher<Node*> IsWord32PairShr(const Matcher<Node*>& lhs_matcher,
+ const Matcher<Node*>& mid_matcher,
+ const Matcher<Node*>& rhs_matcher);
+
+Matcher<Node*> IsWord32PairSar(const Matcher<Node*>& lhs_matcher,
+ const Matcher<Node*>& mid_matcher,
+ const Matcher<Node*>& rhs_matcher);
+
+Matcher<Node*> IsStackSlot();
+Matcher<Node*> IsGuard(const Matcher<Type*>& type_matcher,
+ const Matcher<Node*>& value_matcher,
+ const Matcher<Node*>& control_matcher);
+
} // namespace compiler
} // namespace internal
} // namespace v8
diff --git a/test/unittests/compiler/s390/OWNERS b/test/unittests/compiler/s390/OWNERS
new file mode 100644
index 0000000..eb007cb
--- /dev/null
+++ b/test/unittests/compiler/s390/OWNERS
@@ -0,0 +1,5 @@
+jyan@ca.ibm.com
+dstence@us.ibm.com
+joransiu@ca.ibm.com
+mbrandy@us.ibm.com
+michael_dawson@ca.ibm.com
diff --git a/test/unittests/compiler/s390/instruction-selector-s390-unittest.cc b/test/unittests/compiler/s390/instruction-selector-s390-unittest.cc
new file mode 100644
index 0000000..5fe72ee
--- /dev/null
+++ b/test/unittests/compiler/s390/instruction-selector-s390-unittest.cc
@@ -0,0 +1,11 @@
+// Copyright 2014 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "test/unittests/compiler/instruction-selector-unittest.h"
+
+namespace v8 {
+namespace internal {
+namespace compiler {} // namespace compiler
+} // namespace internal
+} // namespace v8
diff --git a/test/unittests/compiler/scheduler-unittest.cc b/test/unittests/compiler/scheduler-unittest.cc
index 6cf0734..da77bdc 100644
--- a/test/unittests/compiler/scheduler-unittest.cc
+++ b/test/unittests/compiler/scheduler-unittest.cc
@@ -2,15 +2,15 @@
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
+#include "src/compiler/schedule.h"
#include "src/compiler/access-builder.h"
#include "src/compiler/common-operator.h"
-#include "src/compiler/graph.h"
#include "src/compiler/graph-visualizer.h"
+#include "src/compiler/graph.h"
#include "src/compiler/js-operator.h"
#include "src/compiler/node.h"
#include "src/compiler/opcodes.h"
#include "src/compiler/operator.h"
-#include "src/compiler/schedule.h"
#include "src/compiler/scheduler.h"
#include "src/compiler/simplified-operator.h"
#include "src/compiler/source-position.h"
@@ -136,6 +136,51 @@
ComputeAndVerifySchedule(13);
}
+TARGET_TEST_F(SchedulerTest, FloatingDeadDiamond1) {
+ Node* start = graph()->NewNode(common()->Start(1));
+ graph()->SetStart(start);
+
+ Node* p0 = graph()->NewNode(common()->Parameter(0), start);
+ Node* d1 = CreateDiamond(graph(), common(), p0);
+ USE(d1);
+ Node* ret = graph()->NewNode(common()->Return(), p0, start, start);
+ Node* end = graph()->NewNode(common()->End(1), ret);
+
+ graph()->SetEnd(end);
+
+ ComputeAndVerifySchedule(4);
+}
+
+TARGET_TEST_F(SchedulerTest, FloatingDeadDiamond2) {
+ Graph* g = graph();
+ Node* start = g->NewNode(common()->Start(1));
+ g->SetStart(start);
+
+ Node* n1 = g->NewNode(common()->Parameter(1), start);
+
+ Node* n2 = g->NewNode(common()->Branch(), n1, start);
+ Node* n3 = g->NewNode(common()->IfTrue(), n2);
+ Node* n4 = g->NewNode(common()->IfFalse(), n2);
+ Node* n5 = g->NewNode(common()->Int32Constant(-100));
+ Node* n6 = g->NewNode(common()->Return(), n5, start, n4);
+ Node* n7 = g->NewNode(common()->Int32Constant(0));
+ Node* n8 = g->NewNode(common()->Return(), n7, start, n3);
+ Node* n9 = g->NewNode(common()->End(2), n6, n8);
+
+ // Dead nodes
+ Node* n10 = g->NewNode(common()->Branch(), n1, n3);
+ Node* n11 = g->NewNode(common()->IfTrue(), n10);
+ Node* n12 = g->NewNode(common()->IfFalse(), n10);
+ Node* n13 = g->NewNode(common()->Merge(2), n11, n12);
+ Node* n14 =
+ g->NewNode(common()->Phi(MachineRepresentation::kWord32, 2), n1, n7, n13);
+
+ USE(n14);
+
+ g->SetEnd(n9);
+
+ ComputeAndVerifySchedule(10);
+}
TARGET_TEST_F(SchedulerTest, FloatingDiamond2) {
Node* start = graph()->NewNode(common()->Start(2));
diff --git a/test/unittests/compiler/select-lowering-unittest.cc b/test/unittests/compiler/select-lowering-unittest.cc
deleted file mode 100644
index 43cfd84..0000000
--- a/test/unittests/compiler/select-lowering-unittest.cc
+++ /dev/null
@@ -1,74 +0,0 @@
-// Copyright 2014 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include "src/compiler/select-lowering.h"
-#include "test/unittests/compiler/graph-unittest.h"
-#include "test/unittests/compiler/node-test-utils.h"
-#include "testing/gmock-support.h"
-
-using testing::AllOf;
-using testing::Capture;
-using testing::CaptureEq;
-using testing::Not;
-
-namespace v8 {
-namespace internal {
-namespace compiler {
-
-class SelectLoweringTest : public GraphTest {
- public:
- SelectLoweringTest() : GraphTest(5), lowering_(graph(), common()) {}
-
- protected:
- Reduction Reduce(Node* node) { return lowering_.Reduce(node); }
-
- private:
- SelectLowering lowering_;
-};
-
-
-TEST_F(SelectLoweringTest, SelectWithSameConditions) {
- Node* const p0 = Parameter(0);
- Node* const p1 = Parameter(1);
- Node* const p2 = Parameter(2);
- Node* const p3 = Parameter(3);
- Node* const p4 = Parameter(4);
- Node* const s0 = graph()->NewNode(
- common()->Select(MachineRepresentation::kWord32), p0, p1, p2);
-
- Capture<Node*> branch;
- Capture<Node*> merge;
- {
- Reduction const r = Reduce(s0);
- ASSERT_TRUE(r.Changed());
- EXPECT_THAT(
- r.replacement(),
- IsPhi(
- MachineRepresentation::kWord32, p1, p2,
- AllOf(CaptureEq(&merge),
- IsMerge(IsIfTrue(CaptureEq(&branch)),
- IsIfFalse(AllOf(CaptureEq(&branch),
- IsBranch(p0, graph()->start())))))));
- }
- {
- Reduction const r = Reduce(graph()->NewNode(
- common()->Select(MachineRepresentation::kWord32), p0, p3, p4));
- ASSERT_TRUE(r.Changed());
- EXPECT_THAT(r.replacement(), IsPhi(MachineRepresentation::kWord32, p3, p4,
- CaptureEq(&merge)));
- }
- {
- // We must not reuse the diamond if it is reachable from either else/then
- // values of the Select, because the resulting graph can not be scheduled.
- Reduction const r = Reduce(graph()->NewNode(
- common()->Select(MachineRepresentation::kWord32), p0, s0, p0));
- ASSERT_TRUE(r.Changed());
- EXPECT_THAT(r.replacement(), IsPhi(MachineRepresentation::kWord32, s0, p0,
- Not(CaptureEq(&merge))));
- }
-}
-
-} // namespace compiler
-} // namespace internal
-} // namespace v8
diff --git a/test/unittests/compiler/zone-pool-unittest.cc b/test/unittests/compiler/zone-pool-unittest.cc
index 3bfde4b..47f1cc5 100644
--- a/test/unittests/compiler/zone-pool-unittest.cc
+++ b/test/unittests/compiler/zone-pool-unittest.cc
@@ -12,7 +12,7 @@
class ZonePoolTest : public TestWithIsolate {
public:
- ZonePoolTest() {}
+ ZonePoolTest() : zone_pool_(&allocator_) {}
protected:
ZonePool* zone_pool() { return &zone_pool_; }
@@ -38,6 +38,7 @@
}
private:
+ base::AccountingAllocator allocator_;
ZonePool zone_pool_;
base::RandomNumberGenerator rng;
};
diff --git a/test/unittests/heap/gc-idle-time-handler-unittest.cc b/test/unittests/heap/gc-idle-time-handler-unittest.cc
index 6413e36..99351b5 100644
--- a/test/unittests/heap/gc-idle-time-handler-unittest.cc
+++ b/test/unittests/heap/gc-idle-time-handler-unittest.cc
@@ -74,43 +74,6 @@
}
-TEST(GCIdleTimeHandler, EstimateMarkCompactTimeInitial) {
- size_t size = 100 * MB;
- size_t time = GCIdleTimeHandler::EstimateMarkCompactTime(size, 0);
- EXPECT_EQ(size / GCIdleTimeHandler::kInitialConservativeMarkCompactSpeed,
- time);
-}
-
-
-TEST(GCIdleTimeHandler, EstimateMarkCompactTimeNonZero) {
- size_t size = 100 * MB;
- size_t speed = 1 * MB;
- size_t time = GCIdleTimeHandler::EstimateMarkCompactTime(size, speed);
- EXPECT_EQ(size / speed, time);
-}
-
-
-TEST(GCIdleTimeHandler, EstimateMarkCompactTimeMax) {
- size_t size = std::numeric_limits<size_t>::max();
- size_t speed = 1;
- size_t time = GCIdleTimeHandler::EstimateMarkCompactTime(size, speed);
- EXPECT_EQ(GCIdleTimeHandler::kMaxMarkCompactTimeInMs, time);
-}
-
-
-TEST_F(GCIdleTimeHandlerTest, ShouldDoMarkCompact) {
- size_t idle_time_ms = GCIdleTimeHandler::kMaxScheduledIdleTime;
- EXPECT_TRUE(GCIdleTimeHandler::ShouldDoMarkCompact(idle_time_ms, 0, 0));
-}
-
-
-TEST_F(GCIdleTimeHandlerTest, DontDoMarkCompact) {
- size_t idle_time_ms = 1;
- EXPECT_FALSE(GCIdleTimeHandler::ShouldDoMarkCompact(
- idle_time_ms, kSizeOfObjects, kMarkingSpeed));
-}
-
-
TEST_F(GCIdleTimeHandlerTest, ShouldDoFinalIncrementalMarkCompact) {
size_t idle_time_ms = 16;
EXPECT_TRUE(GCIdleTimeHandler::ShouldDoFinalIncrementalMarkCompact(
diff --git a/test/unittests/heap/gc-tracer-unittest.cc b/test/unittests/heap/gc-tracer-unittest.cc
new file mode 100644
index 0000000..2bf4d03
--- /dev/null
+++ b/test/unittests/heap/gc-tracer-unittest.cc
@@ -0,0 +1,49 @@
+// Copyright 2014 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include <cmath>
+#include <limits>
+
+#include "src/heap/gc-tracer.h"
+#include "testing/gtest/include/gtest/gtest.h"
+
+namespace v8 {
+namespace internal {
+
+TEST(GCTracer, AverageSpeed) {
+ RingBuffer<BytesAndDuration> buffer;
+ EXPECT_EQ(100 / 2,
+ GCTracer::AverageSpeed(buffer, MakeBytesAndDuration(100, 2), 0));
+ buffer.Push(MakeBytesAndDuration(100, 8));
+ EXPECT_EQ(100 / 2,
+ GCTracer::AverageSpeed(buffer, MakeBytesAndDuration(100, 2), 2));
+ EXPECT_EQ(200 / 10,
+ GCTracer::AverageSpeed(buffer, MakeBytesAndDuration(100, 2), 3));
+ const int max_speed = 1024 * MB;
+ buffer.Reset();
+ buffer.Push(MakeBytesAndDuration(max_speed, 0.5));
+ EXPECT_EQ(max_speed,
+ GCTracer::AverageSpeed(buffer, MakeBytesAndDuration(0, 0), 1));
+ const int min_speed = 1;
+ buffer.Reset();
+ buffer.Push(MakeBytesAndDuration(1, 10000));
+ EXPECT_EQ(min_speed,
+ GCTracer::AverageSpeed(buffer, MakeBytesAndDuration(0, 0), 1));
+ buffer.Reset();
+ int sum = 0;
+ for (int i = 0; i < buffer.kSize; i++) {
+ sum += i + 1;
+ buffer.Push(MakeBytesAndDuration(i + 1, 1));
+ }
+ EXPECT_EQ(
+ sum * 1.0 / buffer.kSize,
+ GCTracer::AverageSpeed(buffer, MakeBytesAndDuration(0, 0), buffer.kSize));
+ buffer.Push(MakeBytesAndDuration(100, 1));
+ EXPECT_EQ(
+ (sum * 1.0 - 1 + 100) / buffer.kSize,
+ GCTracer::AverageSpeed(buffer, MakeBytesAndDuration(0, 0), buffer.kSize));
+}
+
+} // namespace internal
+} // namespace v8
diff --git a/test/unittests/heap/scavenge-job-unittest.cc b/test/unittests/heap/scavenge-job-unittest.cc
index dbd463c..91abbb1 100644
--- a/test/unittests/heap/scavenge-job-unittest.cc
+++ b/test/unittests/heap/scavenge-job-unittest.cc
@@ -71,7 +71,7 @@
EXPECT_FALSE(ScavengeJob::ReachedIdleAllocationLimit(
scavenge_speed, expected_size - 1, kNewSpaceCapacity));
EXPECT_TRUE(ScavengeJob::ReachedIdleAllocationLimit(
- scavenge_speed, expected_size, kNewSpaceCapacity));
+ scavenge_speed, expected_size + 1, kNewSpaceCapacity));
}
diff --git a/test/unittests/heap/slot-set-unittest.cc b/test/unittests/heap/slot-set-unittest.cc
index 3761889..26a26f0 100644
--- a/test/unittests/heap/slot-set-unittest.cc
+++ b/test/unittests/heap/slot-set-unittest.cc
@@ -55,9 +55,9 @@
set.Iterate([](Address slot_address) {
uintptr_t intaddr = reinterpret_cast<uintptr_t>(slot_address);
if (intaddr % 3 == 0) {
- return SlotSet::KEEP_SLOT;
+ return KEEP_SLOT;
} else {
- return SlotSet::REMOVE_SLOT;
+ return REMOVE_SLOT;
}
});
@@ -139,5 +139,33 @@
}
}
+TEST(TypedSlotSet, Iterate) {
+ TypedSlotSet set(0);
+ const int kDelta = 10000001;
+ int added = 0;
+ for (uint32_t i = 0; i < TypedSlotSet::kMaxOffset; i += kDelta) {
+ SlotType type = static_cast<SlotType>(i % NUMBER_OF_SLOT_TYPES);
+ set.Insert(type, i);
+ ++added;
+ }
+ int iterated = 0;
+ set.Iterate([&iterated, kDelta](SlotType type, Address addr) {
+ uint32_t i = static_cast<uint32_t>(reinterpret_cast<uintptr_t>(addr));
+ EXPECT_EQ(i % NUMBER_OF_SLOT_TYPES, static_cast<uint32_t>(type));
+ EXPECT_EQ(0, i % kDelta);
+ ++iterated;
+ return i % 2 == 0 ? KEEP_SLOT : REMOVE_SLOT;
+ });
+ EXPECT_EQ(added, iterated);
+ iterated = 0;
+ set.Iterate([&iterated](SlotType type, Address addr) {
+ uint32_t i = static_cast<uint32_t>(reinterpret_cast<uintptr_t>(addr));
+ EXPECT_EQ(0, i % 2);
+ ++iterated;
+ return KEEP_SLOT;
+ });
+ EXPECT_EQ(added / 2, iterated);
+}
+
} // namespace internal
} // namespace v8
diff --git a/test/unittests/interpreter/bytecode-array-builder-unittest.cc b/test/unittests/interpreter/bytecode-array-builder-unittest.cc
index 839215f..255d836 100644
--- a/test/unittests/interpreter/bytecode-array-builder-unittest.cc
+++ b/test/unittests/interpreter/bytecode-array-builder-unittest.cc
@@ -139,7 +139,6 @@
builder.CompareOperation(Token::Value::EQ, reg)
.CompareOperation(Token::Value::NE, reg)
.CompareOperation(Token::Value::EQ_STRICT, reg)
- .CompareOperation(Token::Value::NE_STRICT, reg)
.CompareOperation(Token::Value::LT, reg)
.CompareOperation(Token::Value::GT, reg)
.CompareOperation(Token::Value::LTE, reg)
@@ -161,6 +160,21 @@
.JumpIfUndefined(&start)
.JumpIfNotHole(&start);
+ // Longer jumps with constant operands
+ BytecodeLabel end[8];
+ builder.Jump(&end[0])
+ .LoadTrue()
+ .JumpIfTrue(&end[1])
+ .LoadTrue()
+ .JumpIfFalse(&end[2])
+ .LoadLiteral(Smi::FromInt(0))
+ .JumpIfTrue(&end[3])
+ .LoadLiteral(Smi::FromInt(0))
+ .JumpIfFalse(&end[4])
+ .JumpIfNull(&end[5])
+ .JumpIfUndefined(&end[6])
+ .JumpIfNotHole(&end[7]);
+
// Perform an operation that returns boolean value to
// generate JumpIfTrue/False
builder.CompareOperation(Token::Value::EQ, reg)
@@ -205,11 +219,11 @@
builder.ForInPrepare(reg)
.ForInDone(reg, reg)
- .ForInNext(reg, reg, reg)
+ .ForInNext(reg, reg, reg, 1)
.ForInStep(reg);
builder.ForInPrepare(wide)
.ForInDone(reg, other)
- .ForInNext(wide, wide, wide)
+ .ForInNext(wide, wide, wide, 1024)
.ForInStep(reg);
// Wide constant pool loads
@@ -223,9 +237,13 @@
// Emit wide global load / store operations.
builder.LoadGlobal(name, 1024, TypeofMode::NOT_INSIDE_TYPEOF)
.LoadGlobal(name, 1024, TypeofMode::INSIDE_TYPEOF)
+ .LoadGlobal(name, 1024, TypeofMode::INSIDE_TYPEOF)
.StoreGlobal(name, 1024, LanguageMode::SLOPPY)
.StoreGlobal(wide_name, 1, LanguageMode::STRICT);
+ // Emit extra wide global load.
+ builder.LoadGlobal(name, 1024 * 1024, TypeofMode::NOT_INSIDE_TYPEOF);
+
// Emit wide load / store property operations.
builder.LoadNamedProperty(reg, wide_name, 0)
.LoadKeyedProperty(reg, 2056)
@@ -271,28 +289,44 @@
.BinaryOperation(Token::Value::ADD, reg)
.JumpIfFalse(&start);
- builder.Debugger();
+ // Intrinsics handled by the interpreter.
+ builder.CallRuntime(Runtime::kInlineIsArray, reg, 1)
+ .CallRuntime(Runtime::kInlineIsArray, wide, 1);
+ builder.Debugger();
+ for (size_t i = 0; i < arraysize(end); i++) {
+ builder.Bind(&end[i]);
+ }
builder.Return();
// Generate BytecodeArray.
Handle<BytecodeArray> the_array = builder.ToBytecodeArray();
CHECK_EQ(the_array->frame_size(),
- (builder.fixed_and_temporary_register_count() +
- builder.translation_register_count()) *
- kPointerSize);
+ builder.fixed_and_temporary_register_count() * kPointerSize);
// Build scorecard of bytecodes encountered in the BytecodeArray.
std::vector<int> scorecard(Bytecodes::ToByte(Bytecode::kLast) + 1);
+
Bytecode final_bytecode = Bytecode::kLdaZero;
int i = 0;
while (i < the_array->length()) {
uint8_t code = the_array->get(i);
scorecard[code] += 1;
final_bytecode = Bytecodes::FromByte(code);
- i += Bytecodes::Size(Bytecodes::FromByte(code));
+ OperandScale operand_scale = OperandScale::kSingle;
+ int prefix_offset = 0;
+ if (Bytecodes::IsPrefixScalingBytecode(final_bytecode)) {
+ operand_scale = Bytecodes::PrefixBytecodeToOperandScale(final_bytecode);
+ prefix_offset = 1;
+ code = the_array->get(i + 1);
+ final_bytecode = Bytecodes::FromByte(code);
+ }
+ i += prefix_offset + Bytecodes::Size(final_bytecode, operand_scale);
}
+ // Insert entry for illegal bytecode as this is never willingly emitted.
+ scorecard[Bytecodes::ToByte(Bytecode::kIllegal)] = 1;
+
// Check return occurs at the end and only once in the BytecodeArray.
CHECK_EQ(final_bytecode, Bytecode::kReturn);
CHECK_EQ(scorecard[Bytecodes::ToByte(final_bytecode)], 1);
@@ -330,7 +364,7 @@
TEST_F(BytecodeArrayBuilderTest, RegisterValues) {
int index = 1;
- uint8_t operand = static_cast<uint8_t>(-index);
+ int32_t operand = -index;
Register the_register(index);
CHECK_EQ(the_register.index(), index);
@@ -531,6 +565,12 @@
for (int i = 0; i < 63; i++) {
builder.Jump(&label4);
}
+
+ // Add padding to force wide backwards jumps.
+ for (int i = 0; i < 256; i++) {
+ builder.LoadTrue();
+ }
+
builder.BinaryOperation(Token::Value::ADD, reg).JumpIfFalse(&label4);
builder.BinaryOperation(Token::Value::ADD, reg).JumpIfTrue(&label3);
builder.CompareOperation(Token::Value::EQ, reg).JumpIfFalse(&label2);
@@ -546,51 +586,65 @@
// Ignore compare operation.
iterator.Advance();
CHECK_EQ(iterator.current_bytecode(), Bytecode::kJumpIfTrue);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
CHECK_EQ(iterator.GetImmediateOperand(0), -2);
iterator.Advance();
// Ignore compare operation.
iterator.Advance();
CHECK_EQ(iterator.current_bytecode(), Bytecode::kJumpIfFalse);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
CHECK_EQ(iterator.GetImmediateOperand(0), -2);
iterator.Advance();
// Ignore binary operation.
iterator.Advance();
CHECK_EQ(iterator.current_bytecode(), Bytecode::kJumpIfToBooleanTrue);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
CHECK_EQ(iterator.GetImmediateOperand(0), -2);
iterator.Advance();
// Ignore binary operation.
iterator.Advance();
CHECK_EQ(iterator.current_bytecode(), Bytecode::kJumpIfToBooleanFalse);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
CHECK_EQ(iterator.GetImmediateOperand(0), -2);
iterator.Advance();
for (int i = 0; i < 63; i++) {
CHECK_EQ(iterator.current_bytecode(), Bytecode::kJump);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
CHECK_EQ(iterator.GetImmediateOperand(0), -i * 2 - 4);
iterator.Advance();
}
+ // Check padding to force wide backwards jumps.
+ for (int i = 0; i < 256; i++) {
+ CHECK_EQ(iterator.current_bytecode(), Bytecode::kLdaTrue);
+ iterator.Advance();
+ }
// Ignore binary operation.
iterator.Advance();
- CHECK_EQ(iterator.current_bytecode(),
- Bytecode::kJumpIfToBooleanFalseConstant);
- CHECK_EQ(Smi::cast(*iterator.GetConstantForIndexOperand(0))->value(), -132);
+ CHECK_EQ(iterator.current_bytecode(), Bytecode::kJumpIfToBooleanFalse);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kDouble);
+ CHECK_EQ(iterator.GetImmediateOperand(0), -389);
iterator.Advance();
// Ignore binary operation.
iterator.Advance();
- CHECK_EQ(iterator.current_bytecode(), Bytecode::kJumpIfToBooleanTrueConstant);
- CHECK_EQ(Smi::cast(*iterator.GetConstantForIndexOperand(0))->value(), -140);
+ CHECK_EQ(iterator.current_bytecode(), Bytecode::kJumpIfToBooleanTrue);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kDouble);
+ CHECK_EQ(iterator.GetImmediateOperand(0), -399);
iterator.Advance();
// Ignore compare operation.
iterator.Advance();
- CHECK_EQ(iterator.current_bytecode(), Bytecode::kJumpIfFalseConstant);
- CHECK_EQ(Smi::cast(*iterator.GetConstantForIndexOperand(0))->value(), -148);
+ CHECK_EQ(iterator.current_bytecode(), Bytecode::kJumpIfFalse);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kDouble);
+ CHECK_EQ(iterator.GetImmediateOperand(0), -409);
iterator.Advance();
// Ignore compare operation.
iterator.Advance();
- CHECK_EQ(iterator.current_bytecode(), Bytecode::kJumpIfTrueConstant);
- CHECK_EQ(Smi::cast(*iterator.GetConstantForIndexOperand(0))->value(), -156);
+ CHECK_EQ(iterator.current_bytecode(), Bytecode::kJumpIfTrue);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kDouble);
+ CHECK_EQ(iterator.GetImmediateOperand(0), -419);
iterator.Advance();
- CHECK_EQ(iterator.current_bytecode(), Bytecode::kJumpConstant);
- CHECK_EQ(Smi::cast(*iterator.GetConstantForIndexOperand(0))->value(), -160);
+ CHECK_EQ(iterator.current_bytecode(), Bytecode::kJump);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kDouble);
+ CHECK_EQ(iterator.GetImmediateOperand(0), -425);
iterator.Advance();
CHECK_EQ(iterator.current_bytecode(), Bytecode::kReturn);
iterator.Advance();
@@ -652,6 +706,85 @@
CHECK(iterator.done());
}
+TEST_F(BytecodeArrayBuilderTest, OperandScales) {
+ CHECK_EQ(BytecodeArrayBuilder::OperandSizesToScale(OperandSize::kByte),
+ OperandScale::kSingle);
+ CHECK_EQ(BytecodeArrayBuilder::OperandSizesToScale(OperandSize::kShort),
+ OperandScale::kDouble);
+ CHECK_EQ(BytecodeArrayBuilder::OperandSizesToScale(OperandSize::kQuad),
+ OperandScale::kQuadruple);
+ CHECK_EQ(BytecodeArrayBuilder::OperandSizesToScale(
+ OperandSize::kShort, OperandSize::kShort, OperandSize::kShort,
+ OperandSize::kShort),
+ OperandScale::kDouble);
+ CHECK_EQ(BytecodeArrayBuilder::OperandSizesToScale(
+ OperandSize::kQuad, OperandSize::kShort, OperandSize::kShort,
+ OperandSize::kShort),
+ OperandScale::kQuadruple);
+ CHECK_EQ(BytecodeArrayBuilder::OperandSizesToScale(
+ OperandSize::kShort, OperandSize::kQuad, OperandSize::kShort,
+ OperandSize::kShort),
+ OperandScale::kQuadruple);
+ CHECK_EQ(BytecodeArrayBuilder::OperandSizesToScale(
+ OperandSize::kShort, OperandSize::kShort, OperandSize::kQuad,
+ OperandSize::kShort),
+ OperandScale::kQuadruple);
+ CHECK_EQ(BytecodeArrayBuilder::OperandSizesToScale(
+ OperandSize::kShort, OperandSize::kShort, OperandSize::kShort,
+ OperandSize::kQuad),
+ OperandScale::kQuadruple);
+}
+
+TEST_F(BytecodeArrayBuilderTest, SizesForSignOperands) {
+ CHECK(BytecodeArrayBuilder::SizeForSignedOperand(0) == OperandSize::kByte);
+ CHECK(BytecodeArrayBuilder::SizeForSignedOperand(kMaxInt8) ==
+ OperandSize::kByte);
+ CHECK(BytecodeArrayBuilder::SizeForSignedOperand(kMinInt8) ==
+ OperandSize::kByte);
+ CHECK(BytecodeArrayBuilder::SizeForSignedOperand(kMaxInt8 + 1) ==
+ OperandSize::kShort);
+ CHECK(BytecodeArrayBuilder::SizeForSignedOperand(kMinInt8 - 1) ==
+ OperandSize::kShort);
+ CHECK(BytecodeArrayBuilder::SizeForSignedOperand(kMaxInt16) ==
+ OperandSize::kShort);
+ CHECK(BytecodeArrayBuilder::SizeForSignedOperand(kMinInt16) ==
+ OperandSize::kShort);
+ CHECK(BytecodeArrayBuilder::SizeForSignedOperand(kMaxInt16 + 1) ==
+ OperandSize::kQuad);
+ CHECK(BytecodeArrayBuilder::SizeForSignedOperand(kMinInt16 - 1) ==
+ OperandSize::kQuad);
+ CHECK(BytecodeArrayBuilder::SizeForSignedOperand(kMaxInt) ==
+ OperandSize::kQuad);
+ CHECK(BytecodeArrayBuilder::SizeForSignedOperand(kMinInt) ==
+ OperandSize::kQuad);
+}
+
+TEST_F(BytecodeArrayBuilderTest, SizesForUnsignOperands) {
+ // int overloads
+ CHECK(BytecodeArrayBuilder::SizeForUnsignedOperand(0) == OperandSize::kByte);
+ CHECK(BytecodeArrayBuilder::SizeForUnsignedOperand(kMaxUInt8) ==
+ OperandSize::kByte);
+ CHECK(BytecodeArrayBuilder::SizeForUnsignedOperand(kMaxUInt8 + 1) ==
+ OperandSize::kShort);
+ CHECK(BytecodeArrayBuilder::SizeForUnsignedOperand(kMaxUInt16) ==
+ OperandSize::kShort);
+ CHECK(BytecodeArrayBuilder::SizeForUnsignedOperand(kMaxUInt16 + 1) ==
+ OperandSize::kQuad);
+ // size_t overloads
+ CHECK(BytecodeArrayBuilder::SizeForUnsignedOperand(static_cast<size_t>(0)) ==
+ OperandSize::kByte);
+ CHECK(BytecodeArrayBuilder::SizeForUnsignedOperand(
+ static_cast<size_t>(kMaxUInt8)) == OperandSize::kByte);
+ CHECK(BytecodeArrayBuilder::SizeForUnsignedOperand(
+ static_cast<size_t>(kMaxUInt8 + 1)) == OperandSize::kShort);
+ CHECK(BytecodeArrayBuilder::SizeForUnsignedOperand(
+ static_cast<size_t>(kMaxUInt16)) == OperandSize::kShort);
+ CHECK(BytecodeArrayBuilder::SizeForUnsignedOperand(
+ static_cast<size_t>(kMaxUInt16 + 1)) == OperandSize::kQuad);
+ CHECK(BytecodeArrayBuilder::SizeForUnsignedOperand(
+ static_cast<size_t>(kMaxUInt32)) == OperandSize::kQuad);
+}
+
} // namespace interpreter
} // namespace internal
} // namespace v8
diff --git a/test/unittests/interpreter/bytecode-array-iterator-unittest.cc b/test/unittests/interpreter/bytecode-array-iterator-unittest.cc
index f2dcd71..43c6caa 100644
--- a/test/unittests/interpreter/bytecode-array-iterator-unittest.cc
+++ b/test/unittests/interpreter/bytecode-array-iterator-unittest.cc
@@ -22,7 +22,7 @@
TEST_F(BytecodeArrayIteratorTest, IteratesBytecodeArray) {
// Use a builder to create an array with containing multiple bytecodes
// with 0, 1 and 2 operands.
- BytecodeArrayBuilder builder(isolate(), zone(), 3, 2, 0);
+ BytecodeArrayBuilder builder(isolate(), zone(), 3, 3, 0);
Factory* factory = isolate()->factory();
Handle<HeapObject> heap_num_0 = factory->NewHeapNumber(2.718);
Handle<HeapObject> heap_num_1 = factory->NewHeapNumber(2147483647);
@@ -31,9 +31,9 @@
Smi* smi_1 = Smi::FromInt(-65536);
Register reg_0(0);
Register reg_1(1);
- Register reg_2 = Register::FromParameterIndex(2, builder.parameter_count());
+ Register param = Register::FromParameterIndex(2, builder.parameter_count());
Handle<String> name = factory->NewStringFromStaticChars("abc");
- int name_index = 3;
+ int name_index = 2;
int feedback_slot = 97;
builder.LoadLiteral(heap_num_0)
@@ -43,67 +43,139 @@
.LoadLiteral(smi_1)
.LoadAccumulatorWithRegister(reg_0)
.LoadNamedProperty(reg_1, name, feedback_slot)
- .StoreAccumulatorInRegister(reg_2)
+ .StoreAccumulatorInRegister(param)
+ .CallRuntimeForPair(Runtime::kLoadLookupSlotForCall, param, 1, reg_0)
+ .ForInPrepare(reg_0)
.CallRuntime(Runtime::kLoadIC_Miss, reg_0, 1)
.Debugger()
+ .LoadGlobal(name, 0x10000000, TypeofMode::NOT_INSIDE_TYPEOF)
.Return();
// Test iterator sees the expected output from the builder.
BytecodeArrayIterator iterator(builder.ToBytecodeArray());
+ const int kPrefixByteSize = 1;
+ int offset = 0;
+
CHECK_EQ(iterator.current_bytecode(), Bytecode::kLdaConstant);
+ CHECK_EQ(iterator.current_offset(), offset);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
CHECK(iterator.GetConstantForIndexOperand(0).is_identical_to(heap_num_0));
CHECK(!iterator.done());
+ offset += Bytecodes::Size(Bytecode::kLdaConstant, OperandScale::kSingle);
iterator.Advance();
CHECK_EQ(iterator.current_bytecode(), Bytecode::kLdaConstant);
+ CHECK_EQ(iterator.current_offset(), offset);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
CHECK(iterator.GetConstantForIndexOperand(0).is_identical_to(heap_num_1));
CHECK(!iterator.done());
+ offset += Bytecodes::Size(Bytecode::kLdaConstant, OperandScale::kSingle);
iterator.Advance();
CHECK_EQ(iterator.current_bytecode(), Bytecode::kLdaZero);
+ CHECK_EQ(iterator.current_offset(), offset);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
CHECK(!iterator.done());
+ offset += Bytecodes::Size(Bytecode::kLdaZero, OperandScale::kSingle);
iterator.Advance();
- CHECK_EQ(iterator.current_bytecode(), Bytecode::kLdaSmi8);
+ CHECK_EQ(iterator.current_bytecode(), Bytecode::kLdaSmi);
+ CHECK_EQ(iterator.current_offset(), offset);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
CHECK_EQ(Smi::FromInt(iterator.GetImmediateOperand(0)), smi_0);
CHECK(!iterator.done());
+ offset += Bytecodes::Size(Bytecode::kLdaSmi, OperandScale::kSingle);
iterator.Advance();
- CHECK_EQ(iterator.current_bytecode(), Bytecode::kLdaConstant);
- CHECK_EQ(*iterator.GetConstantForIndexOperand(0), smi_1);
+ CHECK_EQ(iterator.current_bytecode(), Bytecode::kLdaSmi);
+ CHECK_EQ(iterator.current_offset(), offset);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kQuadruple);
+ CHECK_EQ(Smi::FromInt(iterator.GetImmediateOperand(0)), smi_1);
CHECK(!iterator.done());
+ offset += Bytecodes::Size(Bytecode::kLdaSmi, OperandScale::kQuadruple) +
+ kPrefixByteSize;
iterator.Advance();
CHECK_EQ(iterator.current_bytecode(), Bytecode::kLdar);
+ CHECK_EQ(iterator.current_offset(), offset);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
CHECK_EQ(iterator.GetRegisterOperand(0).index(), reg_0.index());
CHECK(!iterator.done());
+ offset += Bytecodes::Size(Bytecode::kLdar, OperandScale::kSingle);
iterator.Advance();
CHECK_EQ(iterator.current_bytecode(), Bytecode::kLoadIC);
+ CHECK_EQ(iterator.current_offset(), offset);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
CHECK_EQ(iterator.GetRegisterOperand(0).index(), reg_1.index());
CHECK_EQ(iterator.GetIndexOperand(1), name_index);
CHECK_EQ(iterator.GetIndexOperand(2), feedback_slot);
CHECK(!iterator.done());
+ offset += Bytecodes::Size(Bytecode::kLoadIC, OperandScale::kSingle);
iterator.Advance();
CHECK_EQ(iterator.current_bytecode(), Bytecode::kStar);
- CHECK_EQ(iterator.GetRegisterOperand(0).index(), reg_2.index());
+ CHECK_EQ(iterator.current_offset(), offset);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
+ CHECK_EQ(iterator.GetRegisterOperand(0).index(), param.index());
+ CHECK_EQ(iterator.GetRegisterOperandRange(0), 1);
CHECK(!iterator.done());
+ offset += Bytecodes::Size(Bytecode::kStar, OperandScale::kSingle);
+ iterator.Advance();
+
+ CHECK_EQ(iterator.current_bytecode(), Bytecode::kCallRuntimeForPair);
+ CHECK_EQ(iterator.current_offset(), offset);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
+ CHECK_EQ(iterator.GetRuntimeIdOperand(0), Runtime::kLoadLookupSlotForCall);
+ CHECK_EQ(iterator.GetRegisterOperand(1).index(), param.index());
+ CHECK_EQ(iterator.GetRegisterOperandRange(1), 1);
+ CHECK_EQ(iterator.GetRegisterCountOperand(2), 1);
+ CHECK_EQ(iterator.GetRegisterOperand(3).index(), reg_0.index());
+ CHECK_EQ(iterator.GetRegisterOperandRange(3), 2);
+ CHECK(!iterator.done());
+ offset +=
+ Bytecodes::Size(Bytecode::kCallRuntimeForPair, OperandScale::kSingle);
+ iterator.Advance();
+
+ CHECK_EQ(iterator.current_bytecode(), Bytecode::kForInPrepare);
+ CHECK_EQ(iterator.current_offset(), offset);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
+ CHECK_EQ(iterator.GetRegisterOperand(0).index(), reg_0.index());
+ CHECK_EQ(iterator.GetRegisterOperandRange(0), 3);
+ CHECK(!iterator.done());
+ offset += Bytecodes::Size(Bytecode::kForInPrepare, OperandScale::kSingle);
iterator.Advance();
CHECK_EQ(iterator.current_bytecode(), Bytecode::kCallRuntime);
- CHECK_EQ(static_cast<Runtime::FunctionId>(iterator.GetIndexOperand(0)),
+ CHECK_EQ(iterator.current_offset(), offset);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
+ CHECK_EQ(static_cast<Runtime::FunctionId>(iterator.GetRuntimeIdOperand(0)),
Runtime::kLoadIC_Miss);
CHECK_EQ(iterator.GetRegisterOperand(1).index(), reg_0.index());
CHECK_EQ(iterator.GetRegisterCountOperand(2), 1);
CHECK(!iterator.done());
+ offset += Bytecodes::Size(Bytecode::kCallRuntime, OperandScale::kSingle);
iterator.Advance();
CHECK_EQ(iterator.current_bytecode(), Bytecode::kDebugger);
+ CHECK_EQ(iterator.current_offset(), offset);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
CHECK(!iterator.done());
+ offset += Bytecodes::Size(Bytecode::kDebugger, OperandScale::kSingle);
+ iterator.Advance();
+
+ CHECK_EQ(iterator.current_bytecode(), Bytecode::kLdaGlobal);
+ CHECK_EQ(iterator.current_offset(), offset);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kQuadruple);
+ CHECK_EQ(iterator.current_bytecode_size(), 10);
+ CHECK_EQ(iterator.GetIndexOperand(1), 0x10000000);
+ offset += Bytecodes::Size(Bytecode::kLdaGlobal, OperandScale::kQuadruple) +
+ kPrefixByteSize;
iterator.Advance();
CHECK_EQ(iterator.current_bytecode(), Bytecode::kReturn);
+ CHECK_EQ(iterator.current_offset(), offset);
+ CHECK_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
CHECK(!iterator.done());
iterator.Advance();
CHECK(iterator.done());
diff --git a/test/unittests/interpreter/bytecode-register-allocator-unittest.cc b/test/unittests/interpreter/bytecode-register-allocator-unittest.cc
index ec29935..d4dc111 100644
--- a/test/unittests/interpreter/bytecode-register-allocator-unittest.cc
+++ b/test/unittests/interpreter/bytecode-register-allocator-unittest.cc
@@ -140,29 +140,6 @@
}
}
-TEST_F(TemporaryRegisterAllocatorTest, RangeAvoidsTranslationBoundary) {
- int boundary = RegisterTranslator::DistanceToTranslationWindow(Register(0));
- int limit = boundary + 64;
-
- for (int run_length = 2; run_length < 32; run_length += 7) {
- ZoneVector<int> run_starts(zone());
- for (int start = 0; start < limit; start += run_length) {
- int run_start =
- allocator()->PrepareForConsecutiveTemporaryRegisters(run_length);
- run_starts.push_back(run_start);
- for (int i = 0; i < run_length; i++) {
- allocator()->BorrowConsecutiveTemporaryRegister(run_start + i);
- }
- CHECK(run_start >= boundary || run_start + run_length <= boundary);
- }
- for (size_t batch = 0; batch < run_starts.size(); batch++) {
- for (int i = run_starts[batch]; i < run_starts[batch] + run_length; i++) {
- allocator()->ReturnTemporaryRegister(i);
- }
- }
- }
-}
-
TEST_F(TemporaryRegisterAllocatorTest, NotInRange) {
for (int i = 0; i < 10; i++) {
int reg = allocator()->BorrowTemporaryRegisterNotInRange(2, 5);
diff --git a/test/unittests/interpreter/bytecodes-unittest.cc b/test/unittests/interpreter/bytecodes-unittest.cc
index 212e029..b3554c3 100644
--- a/test/unittests/interpreter/bytecodes-unittest.cc
+++ b/test/unittests/interpreter/bytecodes-unittest.cc
@@ -14,28 +14,27 @@
namespace interpreter {
TEST(OperandConversion, Registers) {
- int register_count = Register::MaxRegisterIndex() + 1;
+ int register_count = 128;
int step = register_count / 7;
for (int i = 0; i < register_count; i += step) {
if (i <= kMaxInt8) {
- uint8_t operand0 = Register(i).ToOperand();
+ uint32_t operand0 = Register(i).ToOperand();
Register reg0 = Register::FromOperand(operand0);
CHECK_EQ(i, reg0.index());
}
- uint16_t operand1 = Register(i).ToWideOperand();
- Register reg1 = Register::FromWideOperand(operand1);
+ uint32_t operand1 = Register(i).ToOperand();
+ Register reg1 = Register::FromOperand(operand1);
CHECK_EQ(i, reg1.index());
- uint32_t operand2 = Register(i).ToRawOperand();
- Register reg2 = Register::FromRawOperand(operand2);
+ uint32_t operand2 = Register(i).ToOperand();
+ Register reg2 = Register::FromOperand(operand2);
CHECK_EQ(i, reg2.index());
}
for (int i = 0; i <= kMaxUInt8; i++) {
- uint8_t operand = static_cast<uint8_t>(i);
- Register reg = Register::FromOperand(operand);
- if (i > 0 && i < -kMinInt8) {
+ Register reg = Register::FromOperand(i);
+ if (i > 0) {
CHECK(reg.is_parameter());
} else {
CHECK(!reg.is_parameter());
@@ -51,7 +50,7 @@
int parameter_count = parameter_counts[p];
for (int i = 0; i < parameter_count; i++) {
Register r = Register::FromParameterIndex(i, parameter_count);
- uint8_t operand_value = r.ToOperand();
+ uint32_t operand_value = r.ToOperand();
Register s = Register::FromOperand(operand_value);
CHECK_EQ(i, s.ToParameterIndex(parameter_count));
}
@@ -59,8 +58,8 @@
}
TEST(OperandConversion, RegistersParametersNoOverlap) {
- int register_count = Register::MaxRegisterIndex() + 1;
- int parameter_count = Register::MaxParameterIndex() + 1;
+ int register_count = 128;
+ int parameter_count = 100;
int32_t register_space_size = base::bits::RoundUpToPowerOfTwo32(
static_cast<uint32_t>(register_count + parameter_count));
uint32_t range = static_cast<uint32_t>(register_space_size);
@@ -68,18 +67,33 @@
for (int i = 0; i < register_count; i += 1) {
Register r = Register(i);
- uint32_t operand = r.ToWideOperand();
- CHECK_LT(operand, operand_count.size());
- operand_count[operand] += 1;
- CHECK_EQ(operand_count[operand], 1);
+ int32_t operand = r.ToOperand();
+ uint8_t index = static_cast<uint8_t>(operand);
+ CHECK_LT(index, operand_count.size());
+ operand_count[index] += 1;
+ CHECK_EQ(operand_count[index], 1);
}
for (int i = 0; i < parameter_count; i += 1) {
Register r = Register::FromParameterIndex(i, parameter_count);
- uint32_t operand = r.ToWideOperand();
- CHECK_LT(operand, operand_count.size());
- operand_count[operand] += 1;
- CHECK_EQ(operand_count[operand], 1);
+ uint32_t operand = r.ToOperand();
+ uint8_t index = static_cast<uint8_t>(operand);
+ CHECK_LT(index, operand_count.size());
+ operand_count[index] += 1;
+ CHECK_EQ(operand_count[index], 1);
+ }
+}
+
+TEST(OperandScaling, ScalableAndNonScalable) {
+ for (OperandScale operand_scale = OperandScale::kSingle;
+ operand_scale <= OperandScale::kMaxValid;
+ operand_scale = Bytecodes::NextOperandScale(operand_scale)) {
+ int scale = static_cast<int>(operand_scale);
+ CHECK_EQ(Bytecodes::Size(Bytecode::kCallRuntime, operand_scale),
+ 1 + 2 + 2 * scale);
+ CHECK_EQ(Bytecodes::Size(Bytecode::kCreateObjectLiteral, operand_scale),
+ 1 + 2 * scale + 1);
+ CHECK_EQ(Bytecodes::Size(Bytecode::kTestIn, operand_scale), 1 + scale);
}
}
@@ -87,16 +101,11 @@
CHECK_EQ(Bytecodes::NumberOfRegisterOperands(Bytecode::kAdd), 1);
CHECK_EQ(Bytecodes::NumberOfRegisterOperands(Bytecode::kCall), 2);
CHECK_EQ(Bytecodes::NumberOfRegisterOperands(Bytecode::kCallRuntime), 1);
- CHECK_EQ(Bytecodes::NumberOfRegisterOperands(Bytecode::kCallRuntimeWide), 1);
CHECK_EQ(Bytecodes::NumberOfRegisterOperands(Bytecode::kCallRuntimeForPair),
2);
- CHECK_EQ(
- Bytecodes::NumberOfRegisterOperands(Bytecode::kCallRuntimeForPairWide),
- 2);
CHECK_EQ(Bytecodes::NumberOfRegisterOperands(Bytecode::kDeletePropertyStrict),
1);
CHECK_EQ(Bytecodes::NumberOfRegisterOperands(Bytecode::kForInPrepare), 1);
- CHECK_EQ(Bytecodes::NumberOfRegisterOperands(Bytecode::kForInPrepareWide), 1);
CHECK_EQ(Bytecodes::NumberOfRegisterOperands(Bytecode::kInc), 0);
CHECK_EQ(Bytecodes::NumberOfRegisterOperands(Bytecode::kJumpIfTrue), 0);
CHECK_EQ(Bytecodes::NumberOfRegisterOperands(Bytecode::kNew), 2);
@@ -116,11 +125,11 @@
}
TEST(Bytecodes, RegisterOperands) {
- CHECK(Bytecodes::IsRegisterOperandType(OperandType::kReg8));
- CHECK(Bytecodes::IsRegisterInputOperandType(OperandType::kReg8));
- CHECK(!Bytecodes::IsRegisterOutputOperandType(OperandType::kReg8));
- CHECK(!Bytecodes::IsRegisterInputOperandType(OperandType::kRegOut8));
- CHECK(Bytecodes::IsRegisterOutputOperandType(OperandType::kRegOut8));
+ CHECK(Bytecodes::IsRegisterOperandType(OperandType::kReg));
+ CHECK(Bytecodes::IsRegisterInputOperandType(OperandType::kReg));
+ CHECK(!Bytecodes::IsRegisterOutputOperandType(OperandType::kReg));
+ CHECK(!Bytecodes::IsRegisterInputOperandType(OperandType::kRegOut));
+ CHECK(Bytecodes::IsRegisterOutputOperandType(OperandType::kRegOut));
#define IS_REGISTER_OPERAND_TYPE(Name, _) \
CHECK(Bytecodes::IsRegisterOperandType(OperandType::k##Name));
@@ -155,16 +164,155 @@
#undef IS_NOT_REGISTER_INPUT_OPERAND_TYPE
}
-TEST(Bytecodes, DebugBreak) {
- for (uint32_t i = 0; i < Bytecodes::ToByte(Bytecode::kLast); i++) {
- Bytecode bytecode = Bytecodes::FromByte(i);
- Bytecode debugbreak = Bytecodes::GetDebugBreak(bytecode);
- if (!Bytecodes::IsDebugBreak(debugbreak)) {
- PrintF("Bytecode %s has no matching debug break with length %d\n",
- Bytecodes::ToString(bytecode), Bytecodes::Size(bytecode));
- CHECK(false);
- }
+TEST(Bytecodes, DebugBreakExistForEachBytecode) {
+ static const OperandScale kOperandScale = OperandScale::kSingle;
+#define CHECK_DEBUG_BREAK_SIZE(Name, ...) \
+ if (!Bytecodes::IsDebugBreak(Bytecode::k##Name) && \
+ !Bytecodes::IsPrefixScalingBytecode(Bytecode::k##Name)) { \
+ Bytecode debug_bytecode = Bytecodes::GetDebugBreak(Bytecode::k##Name); \
+ CHECK_EQ(Bytecodes::Size(Bytecode::k##Name, kOperandScale), \
+ Bytecodes::Size(debug_bytecode, kOperandScale)); \
}
+ BYTECODE_LIST(CHECK_DEBUG_BREAK_SIZE)
+#undef CHECK_DEBUG_BREAK_SIZE
+}
+
+TEST(Bytecodes, DecodeBytecodeAndOperands) {
+ struct BytecodesAndResult {
+ const uint8_t bytecode[32];
+ const size_t length;
+ int parameter_count;
+ const char* output;
+ };
+
+#define B(Name) static_cast<uint8_t>(Bytecode::k##Name)
+ const BytecodesAndResult cases[] = {
+ {{B(LdaSmi), 0x01}, 2, 0, " LdaSmi [1]"},
+ {{B(Wide), B(LdaSmi), 0xe8, 0x03}, 4, 0, " LdaSmi.Wide [1000]"},
+ {{B(ExtraWide), B(LdaSmi), 0xa0, 0x86, 0x01, 0x00},
+ 6,
+ 0,
+ "LdaSmi.ExtraWide [100000]"},
+ {{B(LdaSmi), 0xff}, 2, 0, " LdaSmi [-1]"},
+ {{B(Wide), B(LdaSmi), 0x18, 0xfc}, 4, 0, " LdaSmi.Wide [-1000]"},
+ {{B(ExtraWide), B(LdaSmi), 0x60, 0x79, 0xfe, 0xff},
+ 6,
+ 0,
+ "LdaSmi.ExtraWide [-100000]"},
+ {{B(Star), 0xfb}, 2, 0, " Star r5"},
+ {{B(Wide), B(Star), 0x78, 0xff}, 4, 0, " Star.Wide r136"},
+ {{B(Wide), B(Call), 0x7a, 0xff, 0x79, 0xff, 0x02, 0x00, 0xb1, 0x00},
+ 10,
+ 0,
+ "Call.Wide r134, r135, #2, [177]"},
+ {{B(Ldar),
+ static_cast<uint8_t>(Register::FromParameterIndex(2, 3).ToOperand())},
+ 2,
+ 3,
+ " Ldar a1"},
+ {{B(Wide), B(CreateObjectLiteral), 0x01, 0x02, 0x03, 0x04, 0xa5},
+ 7,
+ 0,
+ "CreateObjectLiteral.Wide [513], [1027], #165"},
+ {{B(ExtraWide), B(JumpIfNull), 0x15, 0xcd, 0x5b, 0x07},
+ 6,
+ 0,
+ "JumpIfNull.ExtraWide [123456789]"},
+ };
+#undef B
+
+ for (size_t i = 0; i < arraysize(cases); ++i) {
+ // Generate reference string by prepending formatted bytes.
+ std::stringstream expected_ss;
+ std::ios default_format(nullptr);
+ default_format.copyfmt(expected_ss);
+ // Match format of Bytecodes::Decode() for byte representations.
+ expected_ss.fill('0');
+ expected_ss.flags(std::ios::right | std::ios::hex);
+ for (size_t b = 0; b < cases[i].length; b++) {
+ expected_ss << std::setw(2) << static_cast<uint32_t>(cases[i].bytecode[b])
+ << ' ';
+ }
+ expected_ss.copyfmt(default_format);
+ expected_ss << cases[i].output;
+
+ // Generate decoded byte output.
+ std::stringstream actual_ss;
+ Bytecodes::Decode(actual_ss, cases[i].bytecode, cases[i].parameter_count);
+
+ // Compare.
+ CHECK_EQ(actual_ss.str(), expected_ss.str());
+ }
+}
+
+TEST(Bytecodes, DebugBreakForPrefixBytecodes) {
+ CHECK_EQ(Bytecode::kDebugBreakWide,
+ Bytecodes::GetDebugBreak(Bytecode::kWide));
+ CHECK_EQ(Bytecode::kDebugBreakExtraWide,
+ Bytecodes::GetDebugBreak(Bytecode::kExtraWide));
+}
+
+TEST(Bytecodes, PrefixMappings) {
+ Bytecode prefixes[] = {Bytecode::kWide, Bytecode::kExtraWide};
+ TRACED_FOREACH(Bytecode, prefix, prefixes) {
+ CHECK_EQ(prefix, Bytecodes::OperandScaleToPrefixBytecode(
+ Bytecodes::PrefixBytecodeToOperandScale(prefix)));
+ }
+}
+
+TEST(OperandScale, PrefixesScale) {
+ CHECK(Bytecodes::NextOperandScale(OperandScale::kSingle) ==
+ OperandScale::kDouble);
+ CHECK(Bytecodes::NextOperandScale(OperandScale::kDouble) ==
+ OperandScale::kQuadruple);
+ CHECK(Bytecodes::NextOperandScale(OperandScale::kQuadruple) ==
+ OperandScale::kInvalid);
+}
+
+TEST(OperandScale, PrefixesRequired) {
+ CHECK(!Bytecodes::OperandScaleRequiresPrefixBytecode(OperandScale::kSingle));
+ CHECK(Bytecodes::OperandScaleRequiresPrefixBytecode(OperandScale::kDouble));
+ CHECK(
+ Bytecodes::OperandScaleRequiresPrefixBytecode(OperandScale::kQuadruple));
+ CHECK(Bytecodes::OperandScaleToPrefixBytecode(OperandScale::kDouble) ==
+ Bytecode::kWide);
+ CHECK(Bytecodes::OperandScaleToPrefixBytecode(OperandScale::kQuadruple) ==
+ Bytecode::kExtraWide);
+}
+
+TEST(AccumulatorUse, LogicalOperators) {
+ CHECK_EQ(AccumulatorUse::kNone | AccumulatorUse::kRead,
+ AccumulatorUse::kRead);
+ CHECK_EQ(AccumulatorUse::kRead | AccumulatorUse::kWrite,
+ AccumulatorUse::kReadWrite);
+ CHECK_EQ(AccumulatorUse::kRead & AccumulatorUse::kReadWrite,
+ AccumulatorUse::kRead);
+ CHECK_EQ(AccumulatorUse::kRead & AccumulatorUse::kWrite,
+ AccumulatorUse::kNone);
+}
+
+TEST(AccumulatorUse, SampleBytecodes) {
+ CHECK(Bytecodes::ReadsAccumulator(Bytecode::kStar));
+ CHECK(!Bytecodes::WritesAccumulator(Bytecode::kStar));
+ CHECK_EQ(Bytecodes::GetAccumulatorUse(Bytecode::kStar),
+ AccumulatorUse::kRead);
+ CHECK(!Bytecodes::ReadsAccumulator(Bytecode::kLdar));
+ CHECK(Bytecodes::WritesAccumulator(Bytecode::kLdar));
+ CHECK_EQ(Bytecodes::GetAccumulatorUse(Bytecode::kLdar),
+ AccumulatorUse::kWrite);
+ CHECK(Bytecodes::ReadsAccumulator(Bytecode::kAdd));
+ CHECK(Bytecodes::WritesAccumulator(Bytecode::kAdd));
+ CHECK_EQ(Bytecodes::GetAccumulatorUse(Bytecode::kAdd),
+ AccumulatorUse::kReadWrite);
+}
+
+TEST(AccumulatorUse, AccumulatorUseToString) {
+ std::set<std::string> names;
+ names.insert(Bytecodes::AccumulatorUseToString(AccumulatorUse::kNone));
+ names.insert(Bytecodes::AccumulatorUseToString(AccumulatorUse::kRead));
+ names.insert(Bytecodes::AccumulatorUseToString(AccumulatorUse::kWrite));
+ names.insert(Bytecodes::AccumulatorUseToString(AccumulatorUse::kReadWrite));
+ CHECK_EQ(names.size(), 4);
}
} // namespace interpreter
diff --git a/test/unittests/interpreter/constant-array-builder-unittest.cc b/test/unittests/interpreter/constant-array-builder-unittest.cc
index b3ec5ff..7122437 100644
--- a/test/unittests/interpreter/constant-array-builder-unittest.cc
+++ b/test/unittests/interpreter/constant-array-builder-unittest.cc
@@ -19,79 +19,76 @@
ConstantArrayBuilderTest() {}
~ConstantArrayBuilderTest() override {}
- static const size_t kLowCapacity = ConstantArrayBuilder::kLowCapacity;
- static const size_t kMaxCapacity = ConstantArrayBuilder::kMaxCapacity;
+ static const size_t k8BitCapacity = ConstantArrayBuilder::k8BitCapacity;
+ static const size_t k16BitCapacity = ConstantArrayBuilder::k16BitCapacity;
};
-
STATIC_CONST_MEMBER_DEFINITION const size_t
- ConstantArrayBuilderTest::kMaxCapacity;
+ ConstantArrayBuilderTest::k16BitCapacity;
STATIC_CONST_MEMBER_DEFINITION const size_t
- ConstantArrayBuilderTest::kLowCapacity;
-
+ ConstantArrayBuilderTest::k8BitCapacity;
TEST_F(ConstantArrayBuilderTest, AllocateAllEntries) {
ConstantArrayBuilder builder(isolate(), zone());
- for (size_t i = 0; i < kMaxCapacity; i++) {
+ for (size_t i = 0; i < k16BitCapacity; i++) {
builder.Insert(handle(Smi::FromInt(static_cast<int>(i)), isolate()));
}
- CHECK_EQ(builder.size(), kMaxCapacity);
- for (size_t i = 0; i < kMaxCapacity; i++) {
+ CHECK_EQ(builder.size(), k16BitCapacity);
+ for (size_t i = 0; i < k16BitCapacity; i++) {
CHECK_EQ(Handle<Smi>::cast(builder.At(i))->value(), i);
}
}
-
TEST_F(ConstantArrayBuilderTest, AllocateEntriesWithIdx8Reservations) {
- for (size_t reserved = 1; reserved < kLowCapacity; reserved *= 3) {
+ for (size_t reserved = 1; reserved < k8BitCapacity; reserved *= 3) {
ConstantArrayBuilder builder(isolate(), zone());
for (size_t i = 0; i < reserved; i++) {
OperandSize operand_size = builder.CreateReservedEntry();
CHECK(operand_size == OperandSize::kByte);
}
- for (size_t i = 0; i < 2 * kLowCapacity; i++) {
+ for (size_t i = 0; i < 2 * k8BitCapacity; i++) {
Handle<Object> object = isolate()->factory()->NewNumberFromSize(i);
builder.Insert(object);
- if (i + reserved < kLowCapacity) {
- CHECK_LE(builder.size(), kLowCapacity);
+ if (i + reserved < k8BitCapacity) {
+ CHECK_LE(builder.size(), k8BitCapacity);
CHECK_EQ(builder.size(), i + 1);
CHECK(builder.At(i)->SameValue(*object));
} else {
- CHECK_GE(builder.size(), kLowCapacity);
+ CHECK_GE(builder.size(), k8BitCapacity);
CHECK_EQ(builder.size(), i + reserved + 1);
CHECK(builder.At(i + reserved)->SameValue(*object));
}
}
- CHECK_EQ(builder.size(), 2 * kLowCapacity + reserved);
+ CHECK_EQ(builder.size(), 2 * k8BitCapacity + reserved);
// Check reserved values represented by the hole.
for (size_t i = 0; i < reserved; i++) {
- Handle<Object> empty = builder.At(kLowCapacity - reserved + i);
+ Handle<Object> empty = builder.At(k8BitCapacity - reserved + i);
CHECK(empty->SameValue(isolate()->heap()->the_hole_value()));
}
// Commmit reserved entries with duplicates and check size does not change.
- DCHECK_EQ(reserved + 2 * kLowCapacity, builder.size());
+ DCHECK_EQ(reserved + 2 * k8BitCapacity, builder.size());
size_t duplicates_in_idx8_space =
- std::min(reserved, kLowCapacity - reserved);
+ std::min(reserved, k8BitCapacity - reserved);
for (size_t i = 0; i < duplicates_in_idx8_space; i++) {
builder.CommitReservedEntry(OperandSize::kByte,
isolate()->factory()->NewNumberFromSize(i));
- DCHECK_EQ(reserved + 2 * kLowCapacity, builder.size());
+ DCHECK_EQ(reserved + 2 * k8BitCapacity, builder.size());
}
// Check all committed values match expected (holes where
// duplicates_in_idx8_space allocated).
- for (size_t i = 0; i < kLowCapacity - reserved; i++) {
+ for (size_t i = 0; i < k8BitCapacity - reserved; i++) {
Smi* smi = Smi::FromInt(static_cast<int>(i));
CHECK(Handle<Smi>::cast(builder.At(i))->SameValue(smi));
}
- for (size_t i = kLowCapacity; i < 2 * kLowCapacity + reserved; i++) {
+ for (size_t i = k8BitCapacity; i < 2 * k8BitCapacity + reserved; i++) {
Smi* smi = Smi::FromInt(static_cast<int>(i - reserved));
CHECK(Handle<Smi>::cast(builder.At(i))->SameValue(smi));
}
for (size_t i = 0; i < reserved; i++) {
- size_t index = kLowCapacity - reserved + i;
+ size_t index = k8BitCapacity - reserved + i;
CHECK(builder.At(index)->IsTheHole());
}
@@ -102,20 +99,19 @@
}
for (size_t i = 0; i < duplicates_in_idx8_space; i++) {
Handle<Object> object =
- isolate()->factory()->NewNumberFromSize(2 * kLowCapacity + i);
+ isolate()->factory()->NewNumberFromSize(2 * k8BitCapacity + i);
size_t index = builder.CommitReservedEntry(OperandSize::kByte, object);
- CHECK_EQ(static_cast<int>(index), kLowCapacity - reserved + i);
+ CHECK_EQ(static_cast<int>(index), k8BitCapacity - reserved + i);
CHECK(builder.At(static_cast<int>(index))->SameValue(*object));
}
- CHECK_EQ(builder.size(), 2 * kLowCapacity + reserved);
+ CHECK_EQ(builder.size(), 2 * k8BitCapacity + reserved);
}
}
-
-TEST_F(ConstantArrayBuilderTest, AllocateEntriesWithIdx16Reservations) {
- for (size_t reserved = 1; reserved < kLowCapacity; reserved *= 3) {
+TEST_F(ConstantArrayBuilderTest, AllocateEntriesWithWideReservations) {
+ for (size_t reserved = 1; reserved < k8BitCapacity; reserved *= 3) {
ConstantArrayBuilder builder(isolate(), zone());
- for (size_t i = 0; i < kLowCapacity; i++) {
+ for (size_t i = 0; i < k8BitCapacity; i++) {
Handle<Object> object = isolate()->factory()->NewNumberFromSize(i);
builder.Insert(object);
CHECK(builder.At(i)->SameValue(*object));
@@ -124,20 +120,20 @@
for (size_t i = 0; i < reserved; i++) {
OperandSize operand_size = builder.CreateReservedEntry();
CHECK(operand_size == OperandSize::kShort);
- CHECK_EQ(builder.size(), kLowCapacity);
+ CHECK_EQ(builder.size(), k8BitCapacity);
}
for (size_t i = 0; i < reserved; i++) {
builder.DiscardReservedEntry(OperandSize::kShort);
- CHECK_EQ(builder.size(), kLowCapacity);
+ CHECK_EQ(builder.size(), k8BitCapacity);
}
for (size_t i = 0; i < reserved; i++) {
OperandSize operand_size = builder.CreateReservedEntry();
CHECK(operand_size == OperandSize::kShort);
Handle<Object> object = isolate()->factory()->NewNumberFromSize(i);
builder.CommitReservedEntry(operand_size, object);
- CHECK_EQ(builder.size(), kLowCapacity);
+ CHECK_EQ(builder.size(), k8BitCapacity);
}
- for (size_t i = kLowCapacity; i < kLowCapacity + reserved; i++) {
+ for (size_t i = k8BitCapacity; i < k8BitCapacity + reserved; i++) {
OperandSize operand_size = builder.CreateReservedEntry();
CHECK(operand_size == OperandSize::kShort);
Handle<Object> object = isolate()->factory()->NewNumberFromSize(i);
@@ -163,26 +159,40 @@
}
}
+TEST_F(ConstantArrayBuilderTest, ToLargeFixedArray) {
+ ConstantArrayBuilder builder(isolate(), zone());
+ static const size_t kNumberOfElements = 37373;
+ for (size_t i = 0; i < kNumberOfElements; i++) {
+ Handle<Object> object = isolate()->factory()->NewNumberFromSize(i);
+ builder.Insert(object);
+ CHECK(builder.At(i)->SameValue(*object));
+ }
+ Handle<FixedArray> constant_array = builder.ToFixedArray();
+ CHECK_EQ(constant_array->length(), kNumberOfElements);
+ for (size_t i = 0; i < kNumberOfElements; i++) {
+ CHECK(constant_array->get(static_cast<int>(i))->SameValue(*builder.At(i)));
+ }
+}
TEST_F(ConstantArrayBuilderTest, GapFilledWhenLowReservationCommitted) {
ConstantArrayBuilder builder(isolate(), zone());
- for (size_t i = 0; i < kLowCapacity; i++) {
+ for (size_t i = 0; i < k8BitCapacity; i++) {
OperandSize operand_size = builder.CreateReservedEntry();
CHECK(OperandSize::kByte == operand_size);
CHECK_EQ(builder.size(), 0);
}
- for (size_t i = 0; i < kLowCapacity; i++) {
+ for (size_t i = 0; i < k8BitCapacity; i++) {
Handle<Object> object = isolate()->factory()->NewNumberFromSize(i);
builder.Insert(object);
- CHECK_EQ(builder.size(), i + kLowCapacity + 1);
+ CHECK_EQ(builder.size(), i + k8BitCapacity + 1);
}
- for (size_t i = 0; i < kLowCapacity; i++) {
+ for (size_t i = 0; i < k8BitCapacity; i++) {
builder.CommitReservedEntry(OperandSize::kByte,
- builder.At(i + kLowCapacity));
- CHECK_EQ(builder.size(), 2 * kLowCapacity);
+ builder.At(i + k8BitCapacity));
+ CHECK_EQ(builder.size(), 2 * k8BitCapacity);
}
- for (size_t i = 0; i < kLowCapacity; i++) {
- Handle<Object> original = builder.At(kLowCapacity + i);
+ for (size_t i = 0; i < k8BitCapacity; i++) {
+ Handle<Object> original = builder.At(k8BitCapacity + i);
Handle<Object> duplicate = builder.At(i);
CHECK(original->SameValue(*duplicate));
Handle<Object> reference = isolate()->factory()->NewNumberFromSize(i);
@@ -190,33 +200,89 @@
}
}
-
TEST_F(ConstantArrayBuilderTest, GapNotFilledWhenLowReservationDiscarded) {
ConstantArrayBuilder builder(isolate(), zone());
- for (size_t i = 0; i < kLowCapacity; i++) {
+ for (size_t i = 0; i < k8BitCapacity; i++) {
OperandSize operand_size = builder.CreateReservedEntry();
CHECK(OperandSize::kByte == operand_size);
CHECK_EQ(builder.size(), 0);
}
- for (size_t i = 0; i < kLowCapacity; i++) {
+ for (size_t i = 0; i < k8BitCapacity; i++) {
Handle<Object> object = isolate()->factory()->NewNumberFromSize(i);
builder.Insert(object);
- CHECK_EQ(builder.size(), i + kLowCapacity + 1);
+ CHECK_EQ(builder.size(), i + k8BitCapacity + 1);
}
- for (size_t i = 0; i < kLowCapacity; i++) {
+ for (size_t i = 0; i < k8BitCapacity; i++) {
builder.DiscardReservedEntry(OperandSize::kByte);
- builder.Insert(builder.At(i + kLowCapacity));
- CHECK_EQ(builder.size(), 2 * kLowCapacity);
+ builder.Insert(builder.At(i + k8BitCapacity));
+ CHECK_EQ(builder.size(), 2 * k8BitCapacity);
}
- for (size_t i = 0; i < kLowCapacity; i++) {
+ for (size_t i = 0; i < k8BitCapacity; i++) {
Handle<Object> reference = isolate()->factory()->NewNumberFromSize(i);
- Handle<Object> original = builder.At(kLowCapacity + i);
+ Handle<Object> original = builder.At(k8BitCapacity + i);
CHECK(original->SameValue(*reference));
Handle<Object> duplicate = builder.At(i);
CHECK(duplicate->SameValue(*isolate()->factory()->the_hole_value()));
}
}
+TEST_F(ConstantArrayBuilderTest, HolesWithUnusedReservations) {
+ static int kNumberOfHoles = 128;
+ ConstantArrayBuilder builder(isolate(), zone());
+ for (int i = 0; i < kNumberOfHoles; ++i) {
+ CHECK_EQ(builder.CreateReservedEntry(), OperandSize::kByte);
+ }
+ for (int i = 0; i < 128; ++i) {
+ CHECK_EQ(builder.Insert(isolate()->factory()->NewNumber(i)), i);
+ }
+ CHECK_EQ(builder.Insert(isolate()->factory()->NewNumber(256)), 256);
+
+ Handle<FixedArray> constant_array = builder.ToFixedArray();
+ CHECK_EQ(constant_array->length(), 257);
+ for (int i = 128; i < 256; i++) {
+ CHECK(constant_array->get(i)->SameValue(
+ *isolate()->factory()->the_hole_value()));
+ }
+ CHECK(!constant_array->get(127)->SameValue(
+ *isolate()->factory()->the_hole_value()));
+ CHECK(!constant_array->get(256)->SameValue(
+ *isolate()->factory()->the_hole_value()));
+}
+
+TEST_F(ConstantArrayBuilderTest, ReservationsAtAllScales) {
+ ConstantArrayBuilder builder(isolate(), zone());
+ for (int i = 0; i < 256; i++) {
+ CHECK_EQ(builder.CreateReservedEntry(), OperandSize::kByte);
+ }
+ for (int i = 256; i < 65536; ++i) {
+ CHECK_EQ(builder.CreateReservedEntry(), OperandSize::kShort);
+ }
+ for (int i = 65536; i < 131072; ++i) {
+ CHECK_EQ(builder.CreateReservedEntry(), OperandSize::kQuad);
+ }
+ CHECK_EQ(builder.CommitReservedEntry(OperandSize::kByte,
+ isolate()->factory()->NewNumber(1)),
+ 0);
+ CHECK_EQ(builder.CommitReservedEntry(OperandSize::kShort,
+ isolate()->factory()->NewNumber(2)),
+ 256);
+ CHECK_EQ(builder.CommitReservedEntry(OperandSize::kQuad,
+ isolate()->factory()->NewNumber(3)),
+ 65536);
+ Handle<FixedArray> constant_array = builder.ToFixedArray();
+ CHECK_EQ(constant_array->length(), 65537);
+ int count = 1;
+ for (int i = 0; i < constant_array->length(); ++i) {
+ Handle<Object> expected;
+ if (i == 0 || i == 256 || i == 65536) {
+ expected = isolate()->factory()->NewNumber(count++);
+ } else {
+ expected = isolate()->factory()->the_hole_value();
+ }
+ CHECK(constant_array->get(i)->SameValue(*expected));
+ }
+}
+
} // namespace interpreter
} // namespace internal
} // namespace v8
diff --git a/test/unittests/interpreter/interpreter-assembler-unittest.cc b/test/unittests/interpreter/interpreter-assembler-unittest.cc
index 3375a6b..0106c57 100644
--- a/test/unittests/interpreter/interpreter-assembler-unittest.cc
+++ b/test/unittests/interpreter/interpreter-assembler-unittest.cc
@@ -62,6 +62,18 @@
: IsWord32Or(lhs_matcher, rhs_matcher);
}
+InterpreterAssemblerTest::InterpreterAssemblerForTest::
+ ~InterpreterAssemblerForTest() {
+ // Tests don't necessarily read and write accumulator but
+ // InterpreterAssembler checks accumulator uses.
+ if (Bytecodes::ReadsAccumulator(bytecode())) {
+ GetAccumulator();
+ }
+ if (Bytecodes::WritesAccumulator(bytecode())) {
+ SetAccumulator(nullptr);
+ }
+}
+
Matcher<Node*> InterpreterAssemblerTest::InterpreterAssemblerForTest::IsLoad(
const Matcher<LoadRepresentation>& rep_matcher,
const Matcher<Node*>& base_matcher, const Matcher<Node*>& index_matcher) {
@@ -77,24 +89,25 @@
}
Matcher<Node*>
-InterpreterAssemblerTest::InterpreterAssemblerForTest::IsBytecodeOperand(
+InterpreterAssemblerTest::InterpreterAssemblerForTest::IsUnsignedByteOperand(
int offset) {
return IsLoad(
MachineType::Uint8(),
IsParameter(InterpreterDispatchDescriptor::kBytecodeArrayParameter),
IsIntPtrAdd(
IsParameter(InterpreterDispatchDescriptor::kBytecodeOffsetParameter),
- IsInt32Constant(offset)));
+ IsIntPtrConstant(offset)));
}
-Matcher<Node*> InterpreterAssemblerTest::InterpreterAssemblerForTest::
- IsBytecodeOperandSignExtended(int offset) {
+Matcher<Node*>
+InterpreterAssemblerTest::InterpreterAssemblerForTest::IsSignedByteOperand(
+ int offset) {
Matcher<Node*> load_matcher = IsLoad(
MachineType::Int8(),
IsParameter(InterpreterDispatchDescriptor::kBytecodeArrayParameter),
IsIntPtrAdd(
IsParameter(InterpreterDispatchDescriptor::kBytecodeOffsetParameter),
- IsInt32Constant(offset)));
+ IsIntPtrConstant(offset)));
if (kPointerSize == 8) {
load_matcher = IsChangeInt32ToInt64(load_matcher);
}
@@ -102,7 +115,7 @@
}
Matcher<Node*>
-InterpreterAssemblerTest::InterpreterAssemblerForTest::IsBytecodeOperandShort(
+InterpreterAssemblerTest::InterpreterAssemblerForTest::IsUnsignedShortOperand(
int offset) {
if (TargetSupportsUnalignedAccess()) {
return IsLoad(
@@ -111,36 +124,35 @@
IsIntPtrAdd(
IsParameter(
InterpreterDispatchDescriptor::kBytecodeOffsetParameter),
- IsInt32Constant(offset)));
+ IsIntPtrConstant(offset)));
} else {
- Matcher<Node*> first_byte = IsLoad(
- MachineType::Uint8(),
- IsParameter(InterpreterDispatchDescriptor::kBytecodeArrayParameter),
- IsIntPtrAdd(
- IsParameter(
- InterpreterDispatchDescriptor::kBytecodeOffsetParameter),
- IsInt32Constant(offset)));
- Matcher<Node*> second_byte = IsLoad(
- MachineType::Uint8(),
- IsParameter(InterpreterDispatchDescriptor::kBytecodeArrayParameter),
- IsIntPtrAdd(
- IsParameter(
- InterpreterDispatchDescriptor::kBytecodeOffsetParameter),
- IsInt32Constant(offset + 1)));
#if V8_TARGET_LITTLE_ENDIAN
- return IsWordOr(IsWordShl(second_byte, IsInt32Constant(kBitsPerByte)),
- first_byte);
+ const int kStep = -1;
+ const int kMsbOffset = 1;
#elif V8_TARGET_BIG_ENDIAN
- return IsWordOr(IsWordShl(first_byte, IsInt32Constant(kBitsPerByte)),
- second_byte);
+ const int kStep = 1;
+ const int kMsbOffset = 0;
#else
#error "Unknown Architecture"
#endif
+ Matcher<Node*> bytes[2];
+ for (int i = 0; i < static_cast<int>(arraysize(bytes)); i++) {
+ bytes[i] = IsLoad(
+ MachineType::Uint8(),
+ IsParameter(InterpreterDispatchDescriptor::kBytecodeArrayParameter),
+ IsIntPtrAdd(
+ IsParameter(
+ InterpreterDispatchDescriptor::kBytecodeOffsetParameter),
+ IsIntPtrConstant(offset + kMsbOffset + kStep * i)));
+ }
+ return IsWord32Or(IsWord32Shl(bytes[0], IsInt32Constant(kBitsPerByte)),
+ bytes[1]);
}
}
-Matcher<Node*> InterpreterAssemblerTest::InterpreterAssemblerForTest::
- IsBytecodeOperandShortSignExtended(int offset) {
+Matcher<Node*>
+InterpreterAssemblerTest::InterpreterAssemblerForTest::IsSignedShortOperand(
+ int offset) {
Matcher<Node*> load_matcher;
if (TargetSupportsUnalignedAccess()) {
load_matcher = IsLoad(
@@ -149,34 +161,29 @@
IsIntPtrAdd(
IsParameter(
InterpreterDispatchDescriptor::kBytecodeOffsetParameter),
- IsInt32Constant(offset)));
+ IsIntPtrConstant(offset)));
} else {
#if V8_TARGET_LITTLE_ENDIAN
- int hi_byte_offset = offset + 1;
- int lo_byte_offset = offset;
-
+ const int kStep = -1;
+ const int kMsbOffset = 1;
#elif V8_TARGET_BIG_ENDIAN
- int hi_byte_offset = offset;
- int lo_byte_offset = offset + 1;
+ const int kStep = 1;
+ const int kMsbOffset = 0;
#else
#error "Unknown Architecture"
#endif
- Matcher<Node*> hi_byte = IsLoad(
- MachineType::Int8(),
- IsParameter(InterpreterDispatchDescriptor::kBytecodeArrayParameter),
- IsIntPtrAdd(
- IsParameter(
- InterpreterDispatchDescriptor::kBytecodeOffsetParameter),
- IsInt32Constant(hi_byte_offset)));
- hi_byte = IsWord32Shl(hi_byte, IsInt32Constant(kBitsPerByte));
- Matcher<Node*> lo_byte = IsLoad(
- MachineType::Uint8(),
- IsParameter(InterpreterDispatchDescriptor::kBytecodeArrayParameter),
- IsIntPtrAdd(
- IsParameter(
- InterpreterDispatchDescriptor::kBytecodeOffsetParameter),
- IsInt32Constant(lo_byte_offset)));
- load_matcher = IsWord32Or(hi_byte, lo_byte);
+ Matcher<Node*> bytes[2];
+ for (int i = 0; i < static_cast<int>(arraysize(bytes)); i++) {
+ bytes[i] = IsLoad(
+ (i == 0) ? MachineType::Int8() : MachineType::Uint8(),
+ IsParameter(InterpreterDispatchDescriptor::kBytecodeArrayParameter),
+ IsIntPtrAdd(
+ IsParameter(
+ InterpreterDispatchDescriptor::kBytecodeOffsetParameter),
+ IsIntPtrConstant(offset + kMsbOffset + kStep * i)));
+ }
+ load_matcher = IsWord32Or(
+ IsWord32Shl(bytes[0], IsInt32Constant(kBitsPerByte)), bytes[1]);
}
if (kPointerSize == 8) {
@@ -185,6 +192,124 @@
return load_matcher;
}
+Matcher<Node*>
+InterpreterAssemblerTest::InterpreterAssemblerForTest::IsUnsignedQuadOperand(
+ int offset) {
+ if (TargetSupportsUnalignedAccess()) {
+ return IsLoad(
+ MachineType::Uint32(),
+ IsParameter(InterpreterDispatchDescriptor::kBytecodeArrayParameter),
+ IsIntPtrAdd(
+ IsParameter(
+ InterpreterDispatchDescriptor::kBytecodeOffsetParameter),
+ IsIntPtrConstant(offset)));
+ } else {
+#if V8_TARGET_LITTLE_ENDIAN
+ const int kStep = -1;
+ const int kMsbOffset = 3;
+#elif V8_TARGET_BIG_ENDIAN
+ const int kStep = 1;
+ const int kMsbOffset = 0;
+#else
+#error "Unknown Architecture"
+#endif
+ Matcher<Node*> bytes[4];
+ for (int i = 0; i < static_cast<int>(arraysize(bytes)); i++) {
+ bytes[i] = IsLoad(
+ MachineType::Uint8(),
+ IsParameter(InterpreterDispatchDescriptor::kBytecodeArrayParameter),
+ IsIntPtrAdd(
+ IsParameter(
+ InterpreterDispatchDescriptor::kBytecodeOffsetParameter),
+ IsIntPtrConstant(offset + kMsbOffset + kStep * i)));
+ }
+ return IsWord32Or(
+ IsWord32Shl(bytes[0], IsInt32Constant(3 * kBitsPerByte)),
+ IsWord32Or(
+ IsWord32Shl(bytes[1], IsInt32Constant(2 * kBitsPerByte)),
+ IsWord32Or(IsWord32Shl(bytes[2], IsInt32Constant(1 * kBitsPerByte)),
+ bytes[3])));
+ }
+}
+
+Matcher<Node*>
+InterpreterAssemblerTest::InterpreterAssemblerForTest::IsSignedQuadOperand(
+ int offset) {
+ Matcher<Node*> load_matcher;
+ if (TargetSupportsUnalignedAccess()) {
+ load_matcher = IsLoad(
+ MachineType::Int32(),
+ IsParameter(InterpreterDispatchDescriptor::kBytecodeArrayParameter),
+ IsIntPtrAdd(
+ IsParameter(
+ InterpreterDispatchDescriptor::kBytecodeOffsetParameter),
+ IsIntPtrConstant(offset)));
+ } else {
+#if V8_TARGET_LITTLE_ENDIAN
+ const int kStep = -1;
+ int kMsbOffset = 3;
+#elif V8_TARGET_BIG_ENDIAN
+ const int kStep = 1;
+ int kMsbOffset = 0;
+#else
+#error "Unknown Architecture"
+#endif
+ Matcher<Node*> bytes[4];
+ for (int i = 0; i < static_cast<int>(arraysize(bytes)); i++) {
+ bytes[i] = IsLoad(
+ (i == 0) ? MachineType::Int8() : MachineType::Uint8(),
+ IsParameter(InterpreterDispatchDescriptor::kBytecodeArrayParameter),
+ IsIntPtrAdd(
+ IsParameter(
+ InterpreterDispatchDescriptor::kBytecodeOffsetParameter),
+ IsIntPtrConstant(offset + kMsbOffset + kStep * i)));
+ }
+ load_matcher = IsWord32Or(
+ IsWord32Shl(bytes[0], IsInt32Constant(3 * kBitsPerByte)),
+ IsWord32Or(
+ IsWord32Shl(bytes[1], IsInt32Constant(2 * kBitsPerByte)),
+ IsWord32Or(IsWord32Shl(bytes[2], IsInt32Constant(1 * kBitsPerByte)),
+ bytes[3])));
+ }
+
+ if (kPointerSize == 8) {
+ load_matcher = IsChangeInt32ToInt64(load_matcher);
+ }
+ return load_matcher;
+}
+
+Matcher<Node*>
+InterpreterAssemblerTest::InterpreterAssemblerForTest::IsSignedOperand(
+ int offset, OperandSize operand_size) {
+ switch (operand_size) {
+ case OperandSize::kByte:
+ return IsSignedByteOperand(offset);
+ case OperandSize::kShort:
+ return IsSignedShortOperand(offset);
+ case OperandSize::kQuad:
+ return IsSignedQuadOperand(offset);
+ case OperandSize::kNone:
+ UNREACHABLE();
+ }
+ return nullptr;
+}
+
+Matcher<Node*>
+InterpreterAssemblerTest::InterpreterAssemblerForTest::IsUnsignedOperand(
+ int offset, OperandSize operand_size) {
+ switch (operand_size) {
+ case OperandSize::kByte:
+ return IsUnsignedByteOperand(offset);
+ case OperandSize::kShort:
+ return IsUnsignedShortOperand(offset);
+ case OperandSize::kQuad:
+ return IsUnsignedQuadOperand(offset);
+ case OperandSize::kNone:
+ UNREACHABLE();
+ }
+ return nullptr;
+}
+
TARGET_TEST_F(InterpreterAssemblerTest, Dispatch) {
TRACED_FOREACH(interpreter::Bytecode, bytecode, kBytecodes) {
InterpreterAssemblerForTest m(this, bytecode);
@@ -195,18 +320,22 @@
EXPECT_EQ(1, end->InputCount());
Node* tail_call_node = end->InputAt(0);
+ OperandScale operand_scale = OperandScale::kSingle;
Matcher<Node*> next_bytecode_offset_matcher = IsIntPtrAdd(
IsParameter(InterpreterDispatchDescriptor::kBytecodeOffsetParameter),
- IsInt32Constant(interpreter::Bytecodes::Size(bytecode)));
+ IsIntPtrConstant(
+ interpreter::Bytecodes::Size(bytecode, operand_scale)));
Matcher<Node*> target_bytecode_matcher = m.IsLoad(
MachineType::Uint8(),
IsParameter(InterpreterDispatchDescriptor::kBytecodeArrayParameter),
next_bytecode_offset_matcher);
+ if (kPointerSize == 8) {
+ target_bytecode_matcher = IsChangeUint32ToUint64(target_bytecode_matcher);
+ }
Matcher<Node*> code_target_matcher = m.IsLoad(
MachineType::Pointer(),
IsParameter(InterpreterDispatchDescriptor::kDispatchTableParameter),
- IsWord32Shl(target_bytecode_matcher,
- IsInt32Constant(kPointerSizeLog2)));
+ IsWordShl(target_bytecode_matcher, IsIntPtrConstant(kPointerSizeLog2)));
EXPECT_THAT(
tail_call_node,
@@ -230,7 +359,7 @@
TRACED_FOREACH(int, jump_offset, jump_offsets) {
TRACED_FOREACH(interpreter::Bytecode, bytecode, kBytecodes) {
InterpreterAssemblerForTest m(this, bytecode);
- m.Jump(m.Int32Constant(jump_offset));
+ m.Jump(m.IntPtrConstant(jump_offset));
Graph* graph = m.graph();
Node* end = graph->end();
EXPECT_EQ(1, end->InputCount());
@@ -238,14 +367,18 @@
Matcher<Node*> next_bytecode_offset_matcher = IsIntPtrAdd(
IsParameter(InterpreterDispatchDescriptor::kBytecodeOffsetParameter),
- IsInt32Constant(jump_offset));
+ IsIntPtrConstant(jump_offset));
Matcher<Node*> target_bytecode_matcher =
m.IsLoad(MachineType::Uint8(), _, next_bytecode_offset_matcher);
+ if (kPointerSize == 8) {
+ target_bytecode_matcher =
+ IsChangeUint32ToUint64(target_bytecode_matcher);
+ }
Matcher<Node*> code_target_matcher = m.IsLoad(
MachineType::Pointer(),
IsParameter(InterpreterDispatchDescriptor::kDispatchTableParameter),
- IsWord32Shl(target_bytecode_matcher,
- IsInt32Constant(kPointerSizeLog2)));
+ IsWordShl(target_bytecode_matcher,
+ IsIntPtrConstant(kPointerSizeLog2)));
EXPECT_THAT(
tail_call_node,
@@ -275,24 +408,29 @@
InterpreterAssemblerForTest m(this, bytecode);
Node* lhs = m.IntPtrConstant(0);
Node* rhs = m.IntPtrConstant(1);
- m.JumpIfWordEqual(lhs, rhs, m.Int32Constant(kJumpIfTrueOffset));
+ m.JumpIfWordEqual(lhs, rhs, m.IntPtrConstant(kJumpIfTrueOffset));
Graph* graph = m.graph();
Node* end = graph->end();
EXPECT_EQ(2, end->InputCount());
- int jump_offsets[] = {kJumpIfTrueOffset,
- interpreter::Bytecodes::Size(bytecode)};
+ OperandScale operand_scale = OperandScale::kSingle;
+ int jump_offsets[] = {kJumpIfTrueOffset, interpreter::Bytecodes::Size(
+ bytecode, operand_scale)};
for (int i = 0; i < static_cast<int>(arraysize(jump_offsets)); i++) {
Matcher<Node*> next_bytecode_offset_matcher = IsIntPtrAdd(
IsParameter(InterpreterDispatchDescriptor::kBytecodeOffsetParameter),
- IsInt32Constant(jump_offsets[i]));
+ IsIntPtrConstant(jump_offsets[i]));
Matcher<Node*> target_bytecode_matcher =
m.IsLoad(MachineType::Uint8(), _, next_bytecode_offset_matcher);
+ if (kPointerSize == 8) {
+ target_bytecode_matcher =
+ IsChangeUint32ToUint64(target_bytecode_matcher);
+ }
Matcher<Node*> code_target_matcher = m.IsLoad(
MachineType::Pointer(),
IsParameter(InterpreterDispatchDescriptor::kDispatchTableParameter),
- IsWord32Shl(target_bytecode_matcher,
- IsInt32Constant(kPointerSizeLog2)));
+ IsWordShl(target_bytecode_matcher,
+ IsIntPtrConstant(kPointerSizeLog2)));
EXPECT_THAT(
end->InputAt(i),
IsTailCall(
@@ -342,51 +480,55 @@
}
TARGET_TEST_F(InterpreterAssemblerTest, BytecodeOperand) {
+ static const OperandScale kOperandScales[] = {
+ OperandScale::kSingle, OperandScale::kDouble, OperandScale::kQuadruple};
TRACED_FOREACH(interpreter::Bytecode, bytecode, kBytecodes) {
- InterpreterAssemblerForTest m(this, bytecode);
- int number_of_operands = interpreter::Bytecodes::NumberOfOperands(bytecode);
- for (int i = 0; i < number_of_operands; i++) {
- int offset = interpreter::Bytecodes::GetOperandOffset(bytecode, i);
- switch (interpreter::Bytecodes::GetOperandType(bytecode, i)) {
- case interpreter::OperandType::kRegCount8:
- EXPECT_THAT(m.BytecodeOperandCount(i), m.IsBytecodeOperand(offset));
- break;
- case interpreter::OperandType::kIdx8:
- EXPECT_THAT(m.BytecodeOperandIdx(i), m.IsBytecodeOperand(offset));
- break;
- case interpreter::OperandType::kImm8:
- EXPECT_THAT(m.BytecodeOperandImm(i),
- m.IsBytecodeOperandSignExtended(offset));
- break;
- case interpreter::OperandType::kMaybeReg8:
- case interpreter::OperandType::kReg8:
- case interpreter::OperandType::kRegOut8:
- case interpreter::OperandType::kRegOutPair8:
- case interpreter::OperandType::kRegOutTriple8:
- case interpreter::OperandType::kRegPair8:
- EXPECT_THAT(m.BytecodeOperandReg(i),
- m.IsBytecodeOperandSignExtended(offset));
- break;
- case interpreter::OperandType::kRegCount16:
- EXPECT_THAT(m.BytecodeOperandCount(i),
- m.IsBytecodeOperandShort(offset));
- break;
- case interpreter::OperandType::kIdx16:
- EXPECT_THAT(m.BytecodeOperandIdx(i),
- m.IsBytecodeOperandShort(offset));
- break;
- case interpreter::OperandType::kMaybeReg16:
- case interpreter::OperandType::kReg16:
- case interpreter::OperandType::kRegOut16:
- case interpreter::OperandType::kRegOutPair16:
- case interpreter::OperandType::kRegOutTriple16:
- case interpreter::OperandType::kRegPair16:
- EXPECT_THAT(m.BytecodeOperandReg(i),
- m.IsBytecodeOperandShortSignExtended(offset));
- break;
- case interpreter::OperandType::kNone:
- UNREACHABLE();
- break;
+ TRACED_FOREACH(interpreter::OperandScale, operand_scale, kOperandScales) {
+ InterpreterAssemblerForTest m(this, bytecode, operand_scale);
+ int number_of_operands =
+ interpreter::Bytecodes::NumberOfOperands(bytecode);
+ for (int i = 0; i < number_of_operands; i++) {
+ int offset = interpreter::Bytecodes::GetOperandOffset(bytecode, i,
+ operand_scale);
+ OperandType operand_type =
+ interpreter::Bytecodes::GetOperandType(bytecode, i);
+ OperandSize operand_size =
+ Bytecodes::SizeOfOperand(operand_type, operand_scale);
+ switch (interpreter::Bytecodes::GetOperandType(bytecode, i)) {
+ case interpreter::OperandType::kRegCount:
+ EXPECT_THAT(m.BytecodeOperandCount(i),
+ m.IsUnsignedOperand(offset, operand_size));
+ break;
+ case interpreter::OperandType::kFlag8:
+ EXPECT_THAT(m.BytecodeOperandFlag(i),
+ m.IsUnsignedOperand(offset, operand_size));
+ break;
+ case interpreter::OperandType::kIdx:
+ EXPECT_THAT(m.BytecodeOperandIdx(i),
+ m.IsUnsignedOperand(offset, operand_size));
+ break;
+ case interpreter::OperandType::kImm: {
+ EXPECT_THAT(m.BytecodeOperandImm(i),
+ m.IsSignedOperand(offset, operand_size));
+ break;
+ }
+ case interpreter::OperandType::kMaybeReg:
+ case interpreter::OperandType::kReg:
+ case interpreter::OperandType::kRegOut:
+ case interpreter::OperandType::kRegOutPair:
+ case interpreter::OperandType::kRegOutTriple:
+ case interpreter::OperandType::kRegPair:
+ EXPECT_THAT(m.BytecodeOperandReg(i),
+ m.IsSignedOperand(offset, operand_size));
+ break;
+ case interpreter::OperandType::kRuntimeId:
+ EXPECT_THAT(m.BytecodeOperandRuntimeId(i),
+ m.IsUnsignedOperand(offset, operand_size));
+ break;
+ case interpreter::OperandType::kNone:
+ UNREACHABLE();
+ break;
+ }
}
}
}
@@ -394,12 +536,16 @@
TARGET_TEST_F(InterpreterAssemblerTest, GetSetAccumulator) {
TRACED_FOREACH(interpreter::Bytecode, bytecode, kBytecodes) {
+ if (!interpreter::Bytecodes::ReadsAccumulator(bytecode) ||
+ !interpreter::Bytecodes::WritesAccumulator(bytecode)) {
+ continue;
+ }
+
InterpreterAssemblerForTest m(this, bytecode);
// Should be incoming accumulator if not set.
EXPECT_THAT(
m.GetAccumulator(),
IsParameter(InterpreterDispatchDescriptor::kAccumulatorParameter));
-
// Should be set by SetAccumulator.
Node* accumulator_value_1 = m.Int32Constant(0xdeadbeef);
m.SetAccumulator(accumulator_value_1);
@@ -433,27 +579,27 @@
TARGET_TEST_F(InterpreterAssemblerTest, RegisterLocation) {
TRACED_FOREACH(interpreter::Bytecode, bytecode, kBytecodes) {
InterpreterAssemblerForTest m(this, bytecode);
- Node* reg_index_node = m.Int32Constant(44);
+ Node* reg_index_node = m.IntPtrConstant(44);
Node* reg_location_node = m.RegisterLocation(reg_index_node);
EXPECT_THAT(
reg_location_node,
IsIntPtrAdd(
IsParameter(InterpreterDispatchDescriptor::kRegisterFileParameter),
- IsWordShl(reg_index_node, IsInt32Constant(kPointerSizeLog2))));
+ IsWordShl(reg_index_node, IsIntPtrConstant(kPointerSizeLog2))));
}
}
TARGET_TEST_F(InterpreterAssemblerTest, LoadRegister) {
TRACED_FOREACH(interpreter::Bytecode, bytecode, kBytecodes) {
InterpreterAssemblerForTest m(this, bytecode);
- Node* reg_index_node = m.Int32Constant(44);
+ Node* reg_index_node = m.IntPtrConstant(44);
Node* load_reg_node = m.LoadRegister(reg_index_node);
EXPECT_THAT(
load_reg_node,
m.IsLoad(
MachineType::AnyTagged(),
IsParameter(InterpreterDispatchDescriptor::kRegisterFileParameter),
- IsWordShl(reg_index_node, IsInt32Constant(kPointerSizeLog2))));
+ IsWordShl(reg_index_node, IsIntPtrConstant(kPointerSizeLog2))));
}
}
@@ -461,7 +607,7 @@
TRACED_FOREACH(interpreter::Bytecode, bytecode, kBytecodes) {
InterpreterAssemblerForTest m(this, bytecode);
Node* store_value = m.Int32Constant(0xdeadbeef);
- Node* reg_index_node = m.Int32Constant(44);
+ Node* reg_index_node = m.IntPtrConstant(44);
Node* store_reg_node = m.StoreRegister(store_value, reg_index_node);
EXPECT_THAT(
store_reg_node,
@@ -469,7 +615,7 @@
StoreRepresentation(MachineRepresentation::kTagged,
kNoWriteBarrier),
IsParameter(InterpreterDispatchDescriptor::kRegisterFileParameter),
- IsWordShl(reg_index_node, IsInt32Constant(kPointerSizeLog2)),
+ IsWordShl(reg_index_node, IsIntPtrConstant(kPointerSizeLog2)),
store_value));
}
}
@@ -478,10 +624,12 @@
TRACED_FOREACH(interpreter::Bytecode, bytecode, kBytecodes) {
InterpreterAssemblerForTest m(this, bytecode);
Node* value = m.Int32Constant(44);
- EXPECT_THAT(m.SmiTag(value),
- IsWordShl(value, IsInt32Constant(kSmiShiftSize + kSmiTagSize)));
- EXPECT_THAT(m.SmiUntag(value),
- IsWordSar(value, IsInt32Constant(kSmiShiftSize + kSmiTagSize)));
+ EXPECT_THAT(
+ m.SmiTag(value),
+ IsWordShl(value, IsIntPtrConstant(kSmiShiftSize + kSmiTagSize)));
+ EXPECT_THAT(
+ m.SmiUntag(value),
+ IsWordSar(value, IsIntPtrConstant(kSmiShiftSize + kSmiTagSize)));
}
}
@@ -508,16 +656,16 @@
TARGET_TEST_F(InterpreterAssemblerTest, WordShl) {
TRACED_FOREACH(interpreter::Bytecode, bytecode, kBytecodes) {
InterpreterAssemblerForTest m(this, bytecode);
- Node* a = m.Int32Constant(0);
+ Node* a = m.IntPtrConstant(0);
Node* add = m.WordShl(a, 10);
- EXPECT_THAT(add, IsWordShl(a, IsInt32Constant(10)));
+ EXPECT_THAT(add, IsWordShl(a, IsIntPtrConstant(10)));
}
}
TARGET_TEST_F(InterpreterAssemblerTest, LoadConstantPoolEntry) {
TRACED_FOREACH(interpreter::Bytecode, bytecode, kBytecodes) {
InterpreterAssemblerForTest m(this, bytecode);
- Node* index = m.Int32Constant(2);
+ Node* index = m.IntPtrConstant(2);
Node* load_constant = m.LoadConstantPoolEntry(index);
Matcher<Node*> constant_pool_matcher = m.IsLoad(
MachineType::AnyTagged(),
@@ -528,23 +676,7 @@
m.IsLoad(MachineType::AnyTagged(), constant_pool_matcher,
IsIntPtrAdd(
IsIntPtrConstant(FixedArray::kHeaderSize - kHeapObjectTag),
- IsWordShl(index, IsInt32Constant(kPointerSizeLog2)))));
- }
-}
-
-TARGET_TEST_F(InterpreterAssemblerTest, LoadFixedArrayElement) {
- TRACED_FOREACH(interpreter::Bytecode, bytecode, kBytecodes) {
- InterpreterAssemblerForTest m(this, bytecode);
- int index = 3;
- Node* fixed_array = m.IntPtrConstant(0xdeadbeef);
- Node* load_element = m.LoadFixedArrayElement(fixed_array, index);
- EXPECT_THAT(
- load_element,
- m.IsLoad(MachineType::AnyTagged(), fixed_array,
- IsIntPtrAdd(
- IsIntPtrConstant(FixedArray::kHeaderSize - kHeapObjectTag),
- IsWordShl(IsInt32Constant(index),
- IsInt32Constant(kPointerSizeLog2)))));
+ IsWordShl(index, IsIntPtrConstant(kPointerSizeLog2)))));
}
}
@@ -563,13 +695,13 @@
TARGET_TEST_F(InterpreterAssemblerTest, LoadContextSlot) {
TRACED_FOREACH(interpreter::Bytecode, bytecode, kBytecodes) {
InterpreterAssemblerForTest m(this, bytecode);
- Node* context = m.Int32Constant(1);
- Node* slot_index = m.Int32Constant(22);
+ Node* context = m.IntPtrConstant(1);
+ Node* slot_index = m.IntPtrConstant(22);
Node* load_context_slot = m.LoadContextSlot(context, slot_index);
Matcher<Node*> offset =
- IsIntPtrAdd(IsWordShl(slot_index, IsInt32Constant(kPointerSizeLog2)),
- IsInt32Constant(Context::kHeaderSize - kHeapObjectTag));
+ IsIntPtrAdd(IsWordShl(slot_index, IsIntPtrConstant(kPointerSizeLog2)),
+ IsIntPtrConstant(Context::kHeaderSize - kHeapObjectTag));
EXPECT_THAT(load_context_slot,
m.IsLoad(MachineType::AnyTagged(), context, offset));
}
@@ -578,14 +710,14 @@
TARGET_TEST_F(InterpreterAssemblerTest, StoreContextSlot) {
TRACED_FOREACH(interpreter::Bytecode, bytecode, kBytecodes) {
InterpreterAssemblerForTest m(this, bytecode);
- Node* context = m.Int32Constant(1);
- Node* slot_index = m.Int32Constant(22);
- Node* value = m.Int32Constant(100);
+ Node* context = m.IntPtrConstant(1);
+ Node* slot_index = m.IntPtrConstant(22);
+ Node* value = m.SmiConstant(Smi::FromInt(100));
Node* store_context_slot = m.StoreContextSlot(context, slot_index, value);
Matcher<Node*> offset =
- IsIntPtrAdd(IsWordShl(slot_index, IsInt32Constant(kPointerSizeLog2)),
- IsInt32Constant(Context::kHeaderSize - kHeapObjectTag));
+ IsIntPtrAdd(IsWordShl(slot_index, IsIntPtrConstant(kPointerSizeLog2)),
+ IsIntPtrConstant(Context::kHeaderSize - kHeapObjectTag));
EXPECT_THAT(store_context_slot,
m.IsStore(StoreRepresentation(MachineRepresentation::kTagged,
kFullWriteBarrier),
@@ -629,7 +761,7 @@
IsInt32Mul(function_id, IsInt32Constant(sizeof(Runtime::Function))));
Matcher<Node*> function_entry =
m.IsLoad(MachineType::Pointer(), function,
- IsInt32Constant(offsetof(Runtime::Function, entry)));
+ IsIntPtrConstant(offsetof(Runtime::Function, entry)));
Node* call_runtime = m.CallRuntimeN(function_id, context, first_arg,
arg_count, result_size);
diff --git a/test/unittests/interpreter/interpreter-assembler-unittest.h b/test/unittests/interpreter/interpreter-assembler-unittest.h
index 321c724..1ebdc77 100644
--- a/test/unittests/interpreter/interpreter-assembler-unittest.h
+++ b/test/unittests/interpreter/interpreter-assembler-unittest.h
@@ -23,10 +23,12 @@
class InterpreterAssemblerForTest final : public InterpreterAssembler {
public:
- InterpreterAssemblerForTest(InterpreterAssemblerTest* test,
- Bytecode bytecode)
- : InterpreterAssembler(test->isolate(), test->zone(), bytecode) {}
- ~InterpreterAssemblerForTest() override {}
+ InterpreterAssemblerForTest(
+ InterpreterAssemblerTest* test, Bytecode bytecode,
+ OperandScale operand_scale = OperandScale::kSingle)
+ : InterpreterAssembler(test->isolate(), test->zone(), bytecode,
+ operand_scale) {}
+ ~InterpreterAssemblerForTest() override;
Matcher<compiler::Node*> IsLoad(
const Matcher<compiler::LoadRepresentation>& rep_matcher,
@@ -38,10 +40,17 @@
const Matcher<compiler::Node*>& index_matcher,
const Matcher<compiler::Node*>& value_matcher);
- Matcher<compiler::Node*> IsBytecodeOperand(int offset);
- Matcher<compiler::Node*> IsBytecodeOperandSignExtended(int offset);
- Matcher<compiler::Node*> IsBytecodeOperandShort(int offset);
- Matcher<compiler::Node*> IsBytecodeOperandShortSignExtended(int offset);
+ Matcher<compiler::Node*> IsUnsignedByteOperand(int offset);
+ Matcher<compiler::Node*> IsSignedByteOperand(int offset);
+ Matcher<compiler::Node*> IsUnsignedShortOperand(int offset);
+ Matcher<compiler::Node*> IsSignedShortOperand(int offset);
+ Matcher<compiler::Node*> IsUnsignedQuadOperand(int offset);
+ Matcher<compiler::Node*> IsSignedQuadOperand(int offset);
+
+ Matcher<compiler::Node*> IsSignedOperand(int offset,
+ OperandSize operand_size);
+ Matcher<compiler::Node*> IsUnsignedOperand(int offset,
+ OperandSize operand_size);
using InterpreterAssembler::graph;
diff --git a/test/unittests/interpreter/register-translator-unittest.cc b/test/unittests/interpreter/register-translator-unittest.cc
deleted file mode 100644
index e9f65a6..0000000
--- a/test/unittests/interpreter/register-translator-unittest.cc
+++ /dev/null
@@ -1,260 +0,0 @@
-// Copyright 2014 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include <stack>
-
-#include "src/v8.h"
-
-#include "src/interpreter/register-translator.h"
-#include "src/isolate.h"
-#include "test/unittests/test-utils.h"
-
-namespace v8 {
-namespace internal {
-namespace interpreter {
-
-class RegisterTranslatorTest : public TestWithIsolateAndZone,
- private RegisterMover {
- public:
- RegisterTranslatorTest() : translator_(this), move_count_(0) {
- window_start_ =
- RegisterTranslator::DistanceToTranslationWindow(Register(0));
- window_width_ =
- Register::MaxRegisterIndexForByteOperand() - window_start_ + 1;
- }
-
- ~RegisterTranslatorTest() override {}
-
- bool PopMoveAndMatch(Register from, Register to) {
- if (!moves_.empty()) {
- CHECK(from.is_valid() && to.is_valid());
- const std::pair<Register, Register> top = moves_.top();
- moves_.pop();
- return top.first == from && top.second == to;
- } else {
- return false;
- }
- }
-
- int move_count() const { return move_count_; }
- RegisterTranslator* translator() { return &translator_; }
-
- int window_start() const { return window_start_; }
- int window_width() const { return window_width_; }
- int window_limit() const { return window_start_ + window_width_; }
-
- protected:
- static const char* const kBadOperandRegex;
-
- private:
- void MoveRegisterUntranslated(Register from, Register to) override {
- moves_.push(std::make_pair(from, to));
- move_count_++;
- }
-
- RegisterTranslator translator_;
- std::stack<std::pair<Register, Register>> moves_;
- int move_count_;
- int window_start_;
- int window_width_;
-};
-
-const char* const RegisterTranslatorTest::kBadOperandRegex =
- ".*OperandType::kReg8 \\|\\| .*OperandType::kRegOut8\\) && "
- "RegisterIsMovableToWindow.*";
-
-TEST_F(RegisterTranslatorTest, TestFrameSizeAdjustmentsForTranslationWindow) {
- EXPECT_EQ(0, RegisterTranslator::RegisterCountAdjustment(0, 0));
- EXPECT_EQ(0, RegisterTranslator::RegisterCountAdjustment(10, 10));
- EXPECT_EQ(window_width(),
- RegisterTranslator::RegisterCountAdjustment(173, 0));
- EXPECT_EQ(window_width(),
- RegisterTranslator::RegisterCountAdjustment(173, 137));
- EXPECT_EQ(window_width(),
- RegisterTranslator::RegisterCountAdjustment(173, 137));
- // TODO(oth): Add a kMaxParameters8 that derives this info from the frame.
- int param_limit = FLAG_enable_embedded_constant_pool ? 119 : 120;
- EXPECT_EQ(0, RegisterTranslator::RegisterCountAdjustment(0, param_limit));
- EXPECT_EQ(window_limit(),
- RegisterTranslator::RegisterCountAdjustment(0, 128));
- EXPECT_EQ(window_limit(),
- RegisterTranslator::RegisterCountAdjustment(0, 129));
- EXPECT_EQ(window_limit() - 32,
- RegisterTranslator::RegisterCountAdjustment(32, 129));
-}
-
-TEST_F(RegisterTranslatorTest, TestInTranslationWindow) {
- EXPECT_GE(window_start(), 0);
- EXPECT_FALSE(
- RegisterTranslator::InTranslationWindow(Register(window_start() - 1)));
- EXPECT_TRUE(RegisterTranslator::InTranslationWindow(
- Register(Register::MaxRegisterIndexForByteOperand())));
- EXPECT_FALSE(RegisterTranslator::InTranslationWindow(
- Register(Register::MaxRegisterIndexForByteOperand() + 1)));
- for (int index = window_start(); index < window_limit(); index += 1) {
- EXPECT_TRUE(RegisterTranslator::InTranslationWindow(Register(index)));
- }
-}
-
-TEST_F(RegisterTranslatorTest, FitsInReg8Operand) {
- EXPECT_GT(window_start(), 0);
- EXPECT_TRUE(RegisterTranslator::FitsInReg8Operand(
- Register::FromParameterIndex(0, 3)));
- EXPECT_TRUE(RegisterTranslator::FitsInReg8Operand(
- Register::FromParameterIndex(2, 3)));
- EXPECT_TRUE(RegisterTranslator::FitsInReg8Operand(Register(0)));
- EXPECT_TRUE(
- RegisterTranslator::FitsInReg8Operand(Register(window_start() - 1)));
- EXPECT_FALSE(RegisterTranslator::FitsInReg8Operand(Register(kMaxInt8)));
- EXPECT_FALSE(RegisterTranslator::FitsInReg8Operand(Register(kMaxInt8 + 1)));
- for (int index = window_start(); index < window_limit(); index += 1) {
- EXPECT_FALSE(RegisterTranslator::FitsInReg8Operand(Register(index)));
- }
-}
-
-TEST_F(RegisterTranslatorTest, FitsInReg16Operand) {
- EXPECT_GT(window_start(), 0);
- EXPECT_TRUE(RegisterTranslator::FitsInReg16Operand(
- Register::FromParameterIndex(0, 3)));
- EXPECT_TRUE(RegisterTranslator::FitsInReg16Operand(
- Register::FromParameterIndex(2, 3)));
- EXPECT_TRUE(RegisterTranslator::FitsInReg16Operand(
- Register::FromParameterIndex(0, 999)));
- EXPECT_TRUE(RegisterTranslator::FitsInReg16Operand(
- Register::FromParameterIndex(0, Register::MaxParameterIndex() + 1)));
- EXPECT_TRUE(RegisterTranslator::FitsInReg16Operand(Register(0)));
- EXPECT_TRUE(
- RegisterTranslator::FitsInReg16Operand(Register(window_start() - 1)));
- EXPECT_TRUE(RegisterTranslator::FitsInReg16Operand(Register(kMaxInt8 + 1)));
- EXPECT_TRUE(RegisterTranslator::FitsInReg16Operand(Register(kMaxInt8 + 2)));
- for (int index = 0; index <= kMaxInt16 - window_width(); index += 1) {
- EXPECT_TRUE(RegisterTranslator::FitsInReg16Operand(Register(index)));
- }
- for (int index = Register::MaxRegisterIndex() - window_width() + 1;
- index < Register::MaxRegisterIndex() + 2; index += 1) {
- EXPECT_FALSE(RegisterTranslator::FitsInReg16Operand(Register(index)));
- }
-}
-
-TEST_F(RegisterTranslatorTest, NoTranslationRequired) {
- Register window_reg(window_start());
- Register local_reg(57);
- uint32_t operands[] = {local_reg.ToRawOperand()};
- translator()->TranslateInputRegisters(Bytecode::kLdar, operands, 1);
- translator()->TranslateOutputRegisters();
- EXPECT_EQ(0, move_count());
-
- Register param_reg = Register::FromParameterIndex(129, 130);
- operands[0] = param_reg.ToRawOperand();
- translator()->TranslateInputRegisters(Bytecode::kAdd, operands, 1);
- translator()->TranslateOutputRegisters();
- EXPECT_EQ(0, move_count());
-}
-
-TEST_F(RegisterTranslatorTest, TranslationRequired) {
- Register window_reg(window_start());
- Register local_reg(137);
- Register local_reg_translated(local_reg.index() + window_width());
-
- uint32_t operands[] = {local_reg.ToRawOperand()};
- translator()->TranslateInputRegisters(Bytecode::kLdar, operands, 1);
- EXPECT_EQ(1, move_count());
- EXPECT_TRUE(PopMoveAndMatch(local_reg_translated, window_reg));
- translator()->TranslateOutputRegisters();
- EXPECT_EQ(1, move_count());
- EXPECT_FALSE(PopMoveAndMatch(window_reg, local_reg_translated));
-
- operands[0] = local_reg.ToRawOperand();
- translator()->TranslateInputRegisters(Bytecode::kStar, operands, 1);
- EXPECT_EQ(1, move_count());
- EXPECT_FALSE(PopMoveAndMatch(local_reg_translated, window_reg));
- translator()->TranslateOutputRegisters();
- EXPECT_EQ(2, move_count());
- EXPECT_TRUE(PopMoveAndMatch(window_reg, local_reg_translated));
-
- Register param_reg = Register::FromParameterIndex(0, 130);
- operands[0] = {param_reg.ToRawOperand()};
- translator()->TranslateInputRegisters(Bytecode::kLdar, operands, 1);
- EXPECT_EQ(3, move_count());
- EXPECT_TRUE(PopMoveAndMatch(param_reg, window_reg));
- translator()->TranslateOutputRegisters();
- EXPECT_EQ(3, move_count());
- EXPECT_FALSE(PopMoveAndMatch(window_reg, param_reg));
-
- operands[0] = {param_reg.ToRawOperand()};
- translator()->TranslateInputRegisters(Bytecode::kStar, operands, 1);
- EXPECT_EQ(3, move_count());
- EXPECT_FALSE(PopMoveAndMatch(local_reg_translated, window_reg));
- translator()->TranslateOutputRegisters();
- EXPECT_EQ(4, move_count());
- EXPECT_TRUE(PopMoveAndMatch(window_reg, param_reg));
-}
-
-TEST_F(RegisterTranslatorTest, RangeTranslation) {
- Register window0(window_start());
- Register window1(window_start() + 1);
- Register window2(window_start() + 2);
- uint32_t operands[3];
-
- // Bytecode::kNew with valid range operand.
- Register constructor0(0);
- Register args0(1);
- operands[0] = constructor0.ToRawOperand();
- operands[1] = args0.ToRawOperand();
- operands[2] = 1;
- translator()->TranslateInputRegisters(Bytecode::kNew, operands, 3);
- translator()->TranslateOutputRegisters();
- EXPECT_EQ(0, move_count());
-
- // Bytecode::kNewWide with valid range operand.
- Register constructor1(128);
- Register constructor1_translated(constructor1.index() + window_width());
- Register args1(129);
- Register args1_translated(args1.index() + window_width());
- operands[0] = constructor1.ToRawOperand();
- operands[1] = args1.ToRawOperand();
- operands[2] = 3;
- translator()->TranslateInputRegisters(Bytecode::kNewWide, operands, 3);
- translator()->TranslateOutputRegisters();
- EXPECT_EQ(0, move_count());
-}
-
-TEST_F(RegisterTranslatorTest, BadRange0) {
- // Bytecode::kNew with invalid range operand (kMaybeReg8).
- Register constructor1(128);
- Register args1(129);
- uint32_t operands[] = {constructor1.ToRawOperand(), args1.ToRawOperand(), 3};
- ASSERT_DEATH_IF_SUPPORTED(
- translator()->TranslateInputRegisters(Bytecode::kNew, operands, 3),
- kBadOperandRegex);
-}
-
-TEST_F(RegisterTranslatorTest, BadRange1) {
- // Bytecode::kForInPrepare with invalid range operand (kRegTriple8)
- Register for_in_state(160);
- Register for_in_state_translated(for_in_state.index() + window_width());
- uint32_t operands[] = {for_in_state.ToRawOperand()};
- ASSERT_DEATH_IF_SUPPORTED(translator()->TranslateInputRegisters(
- Bytecode::kForInPrepare, operands, 1),
- kBadOperandRegex);
-}
-
-TEST_F(RegisterTranslatorTest, BadRange2) {
- // Bytecode::kForInNext with invalid range operand (kRegPair8)
- Register receiver(192);
- Register receiver_translated(receiver.index() + window_width());
- Register index(193);
- Register index_translated(index.index() + window_width());
- Register cache_info_pair(194);
- Register cache_info_pair_translated(cache_info_pair.index() + window_width());
- uint32_t operands[] = {receiver.ToRawOperand(), index.ToRawOperand(),
- cache_info_pair.ToRawOperand()};
- ASSERT_DEATH_IF_SUPPORTED(
- translator()->TranslateInputRegisters(Bytecode::kForInNext, operands, 3),
- kBadOperandRegex);
-}
-
-} // namespace interpreter
-} // namespace internal
-} // namespace v8
diff --git a/test/unittests/interpreter/source-position-table-unittest.cc b/test/unittests/interpreter/source-position-table-unittest.cc
new file mode 100644
index 0000000..d62302a
--- /dev/null
+++ b/test/unittests/interpreter/source-position-table-unittest.cc
@@ -0,0 +1,84 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/v8.h"
+
+#include "src/interpreter/source-position-table.h"
+#include "test/unittests/test-utils.h"
+
+namespace v8 {
+namespace internal {
+namespace interpreter {
+
+class SourcePositionTableTest : public TestWithIsolateAndZone {
+ public:
+ SourcePositionTableTest() {}
+ ~SourcePositionTableTest() override {}
+};
+
+// Some random offsets, mostly at 'suspicious' bit boundaries.
+static int offsets[] = {0, 1, 2, 3, 4, 30, 31, 32,
+ 33, 62, 63, 64, 65, 126, 127, 128,
+ 129, 250, 1000, 9999, 12000, 31415926};
+
+TEST_F(SourcePositionTableTest, EncodeStatement) {
+ SourcePositionTableBuilder builder(isolate(), zone());
+ for (int i = 0; i < arraysize(offsets); i++) {
+ builder.AddStatementPosition(offsets[i], offsets[i]);
+ }
+
+ // To test correctness, we rely on the assertions in ToSourcePositionTable().
+ // (Also below.)
+ CHECK(!builder.ToSourcePositionTable().is_null());
+}
+
+TEST_F(SourcePositionTableTest, EncodeStatementDuplicates) {
+ SourcePositionTableBuilder builder(isolate(), zone());
+ for (int i = 0; i < arraysize(offsets); i++) {
+ builder.AddStatementPosition(offsets[i], offsets[i]);
+ builder.AddStatementPosition(offsets[i], offsets[i] + 1);
+ }
+
+ // To test correctness, we rely on the assertions in ToSourcePositionTable().
+ // (Also below.)
+ CHECK(!builder.ToSourcePositionTable().is_null());
+}
+
+TEST_F(SourcePositionTableTest, EncodeExpression) {
+ SourcePositionTableBuilder builder(isolate(), zone());
+ for (int i = 0; i < arraysize(offsets); i++) {
+ builder.AddExpressionPosition(offsets[i], offsets[i]);
+ }
+ CHECK(!builder.ToSourcePositionTable().is_null());
+}
+
+TEST_F(SourcePositionTableTest, EncodeAscending) {
+ SourcePositionTableBuilder builder(isolate(), zone());
+
+ int accumulator = 0;
+ for (int i = 0; i < arraysize(offsets); i++) {
+ accumulator += offsets[i];
+ if (i % 2) {
+ builder.AddStatementPosition(accumulator, accumulator);
+ } else {
+ builder.AddExpressionPosition(accumulator, accumulator);
+ }
+ }
+
+ // Also test negative offsets:
+ for (int i = 0; i < arraysize(offsets); i++) {
+ accumulator -= offsets[i];
+ if (i % 2) {
+ builder.AddStatementPosition(accumulator, accumulator);
+ } else {
+ builder.AddExpressionPosition(accumulator, accumulator);
+ }
+ }
+
+ CHECK(!builder.ToSourcePositionTable().is_null());
+}
+
+} // namespace interpreter
+} // namespace internal
+} // namespace v8
diff --git a/test/unittests/runtime/runtime-interpreter-unittest.cc b/test/unittests/runtime/runtime-interpreter-unittest.cc
deleted file mode 100644
index c10ddcd..0000000
--- a/test/unittests/runtime/runtime-interpreter-unittest.cc
+++ /dev/null
@@ -1,73 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include "src/v8.h"
-
-#include "src/factory.h"
-#include "src/heap/heap.h"
-#include "src/heap/heap-inl.h"
-#include "src/runtime/runtime.h"
-#include "test/unittests/test-utils.h"
-
-namespace v8 {
-namespace internal {
-namespace interpreter {
-
-class RuntimeInterpreterTest : public TestWithIsolateAndZone {
- public:
- typedef Object* (*RuntimeMethod)(int, Object**, Isolate*);
-
- RuntimeInterpreterTest() {}
- ~RuntimeInterpreterTest() override {}
-
- bool TestOperatorWithObjects(RuntimeMethod method, Handle<Object> lhs,
- Handle<Object> rhs, bool expected);
-};
-
-
-bool RuntimeInterpreterTest::TestOperatorWithObjects(RuntimeMethod method,
- Handle<Object> lhs,
- Handle<Object> rhs,
- bool expected) {
- Object* args_object[] = {*rhs, *lhs};
- Handle<Object> result =
- handle(method(2, &args_object[1], isolate()), isolate());
- CHECK(result->IsTrue() || result->IsFalse());
- return result->IsTrue() == expected;
-}
-
-
-TEST_F(RuntimeInterpreterTest, ToBoolean) {
- double quiet_nan = std::numeric_limits<double>::quiet_NaN();
- std::pair<Handle<Object>, bool> cases[] = {
- std::make_pair(isolate()->factory()->NewNumberFromInt(0), false),
- std::make_pair(isolate()->factory()->NewNumberFromInt(1), true),
- std::make_pair(isolate()->factory()->NewNumberFromInt(100), true),
- std::make_pair(isolate()->factory()->NewNumberFromInt(-1), true),
- std::make_pair(isolate()->factory()->NewNumber(7.7), true),
- std::make_pair(isolate()->factory()->NewNumber(0.00001), true),
- std::make_pair(isolate()->factory()->NewNumber(quiet_nan), false),
- std::make_pair(isolate()->factory()->NewHeapNumber(0.0), false),
- std::make_pair(isolate()->factory()->undefined_value(), false),
- std::make_pair(isolate()->factory()->null_value(), false),
- std::make_pair(isolate()->factory()->true_value(), true),
- std::make_pair(isolate()->factory()->false_value(), false),
- std::make_pair(isolate()->factory()->NewStringFromStaticChars(""), false),
- std::make_pair(isolate()->factory()->NewStringFromStaticChars("_"), true),
- };
-
- for (size_t i = 0; i < arraysize(cases); i++) {
- auto& value_expected_tuple = cases[i];
- Object* args_object[] = {*value_expected_tuple.first};
- Handle<Object> result = handle(
- Runtime_InterpreterToBoolean(1, &args_object[0], isolate()), isolate());
- CHECK(result->IsBoolean());
- CHECK_EQ(result->IsTrue(), value_expected_tuple.second);
- }
-}
-
-
-} // namespace interpreter
-} // namespace internal
-} // namespace v8
diff --git a/test/unittests/test-utils.h b/test/unittests/test-utils.h
index 78283bf..1342510 100644
--- a/test/unittests/test-utils.h
+++ b/test/unittests/test-utils.h
@@ -93,12 +93,13 @@
class TestWithZone : public virtual ::testing::Test {
public:
- TestWithZone() {}
+ TestWithZone() : zone_(&allocator_) {}
virtual ~TestWithZone();
Zone* zone() { return &zone_; }
private:
+ base::AccountingAllocator allocator_;
Zone zone_;
DISALLOW_COPY_AND_ASSIGN(TestWithZone);
@@ -107,12 +108,13 @@
class TestWithIsolateAndZone : public virtual TestWithIsolate {
public:
- TestWithIsolateAndZone() {}
+ TestWithIsolateAndZone() : zone_(&allocator_) {}
virtual ~TestWithIsolateAndZone();
Zone* zone() { return &zone_; }
private:
+ base::AccountingAllocator allocator_;
Zone zone_;
DISALLOW_COPY_AND_ASSIGN(TestWithIsolateAndZone);
diff --git a/test/unittests/unittests.gyp b/test/unittests/unittests.gyp
index 638fd84..003281b 100644
--- a/test/unittests/unittests.gyp
+++ b/test/unittests/unittests.gyp
@@ -83,7 +83,6 @@
'compiler/opcodes-unittest.cc',
'compiler/register-allocator-unittest.cc',
'compiler/schedule-unittest.cc',
- 'compiler/select-lowering-unittest.cc',
'compiler/scheduler-unittest.cc',
'compiler/scheduler-rpo-unittest.cc',
'compiler/simplified-operator-reducer-unittest.cc',
@@ -101,22 +100,23 @@
'interpreter/constant-array-builder-unittest.cc',
'interpreter/interpreter-assembler-unittest.cc',
'interpreter/interpreter-assembler-unittest.h',
- 'interpreter/register-translator-unittest.cc',
+ 'interpreter/source-position-table-unittest.cc',
'libplatform/default-platform-unittest.cc',
'libplatform/task-queue-unittest.cc',
'libplatform/worker-thread-unittest.cc',
'heap/bitmap-unittest.cc',
'heap/gc-idle-time-handler-unittest.cc',
+ 'heap/gc-tracer-unittest.cc',
'heap/memory-reducer-unittest.cc',
'heap/heap-unittest.cc',
'heap/scavenge-job-unittest.cc',
'heap/slot-set-unittest.cc',
'locked-queue-unittest.cc',
'run-all-unittests.cc',
- 'runtime/runtime-interpreter-unittest.cc',
'test-utils.h',
'test-utils.cc',
'wasm/ast-decoder-unittest.cc',
+ 'wasm/decoder-unittest.cc',
'wasm/encoder-unittest.cc',
'wasm/loop-assignment-analysis-unittest.cc',
'wasm/module-decoder-unittest.cc',
@@ -158,6 +158,11 @@
'compiler/ppc/instruction-selector-ppc-unittest.cc',
],
}],
+ ['v8_target_arch=="s390" or v8_target_arch=="s390x"', {
+ 'sources': [ ### gcmole(arch:s390) ###
+ 'compiler/s390/instruction-selector-s390-unittest.cc',
+ ],
+ }],
['OS=="aix"', {
'ldflags': [ '-Wl,-bbigtoc' ],
}],
diff --git a/test/unittests/unittests.status b/test/unittests/unittests.status
index 18201cd..40b5754 100644
--- a/test/unittests/unittests.status
+++ b/test/unittests/unittests.status
@@ -9,6 +9,8 @@
'WasmFunctionVerifyTest*': [SKIP],
'WasmDecoderTest.TableSwitch*': [SKIP],
'WasmDecoderTest.AllLoadMemCombinations': [SKIP],
+ 'AstDecoderTest.AllLoadMemCombinations': [SKIP],
+ 'AstDecoderTest.AllStoreMemCombinations': [SKIP],
+ 'Bytecodes.DecodeBytecodeAndOperands': [SKIP],
}], # 'byteorder == big'
-
]
diff --git a/test/unittests/wasm/ast-decoder-unittest.cc b/test/unittests/wasm/ast-decoder-unittest.cc
index 6721587..0b1b79e 100644
--- a/test/unittests/wasm/ast-decoder-unittest.cc
+++ b/test/unittests/wasm/ast-decoder-unittest.cc
@@ -55,51 +55,34 @@
Verify(kError, env, code, code + arraysize(code)); \
} while (false)
-#define VERIFY(...) \
- do { \
- static const byte code[] = {__VA_ARGS__}; \
- Verify(kSuccess, &env_v_i, code, code + sizeof(code)); \
+#define VERIFY(...) \
+ do { \
+ static const byte code[] = {__VA_ARGS__}; \
+ Verify(kSuccess, sigs.v_i(), code, code + sizeof(code)); \
} while (false)
-
-class WasmDecoderTest : public TestWithZone {
+class AstDecoderTest : public TestWithZone {
public:
- WasmDecoderTest() : TestWithZone(), sigs() {
- init_env(&env_i_i, sigs.i_i());
- init_env(&env_v_v, sigs.v_v());
- init_env(&env_v_i, sigs.v_i());
- init_env(&env_i_f, sigs.i_f());
- init_env(&env_i_d, sigs.i_d());
- init_env(&env_l_l, sigs.l_l());
- init_env(&env_f_ff, sigs.f_ff());
- init_env(&env_d_dd, sigs.d_dd());
- }
+ typedef std::pair<uint32_t, LocalType> LocalsDecl;
+ AstDecoderTest() : module(nullptr) {}
TestSignatures sigs;
+ ModuleEnv* module;
+ LocalDeclEncoder local_decls;
- FunctionEnv env_i_i;
- FunctionEnv env_v_v;
- FunctionEnv env_v_i;
- FunctionEnv env_i_f;
- FunctionEnv env_i_d;
- FunctionEnv env_l_l;
- FunctionEnv env_f_ff;
- FunctionEnv env_d_dd;
-
- static void init_env(FunctionEnv* env, FunctionSig* sig) {
- env->module = nullptr;
- env->sig = sig;
- env->local_i32_count = 0;
- env->local_i64_count = 0;
- env->local_f32_count = 0;
- env->local_f64_count = 0;
- env->SumLocals();
+ void AddLocals(LocalType type, uint32_t count) {
+ local_decls.AddLocals(count, type);
}
- // A wrapper around VerifyWasmCode() that renders a nice failure message.
- void Verify(ErrorCode expected, FunctionEnv* env, const byte* start,
+ // Preprends local variable declarations and renders nice error messages for
+ // verification failures.
+ void Verify(ErrorCode expected, FunctionSig* sig, const byte* start,
const byte* end) {
- TreeResult result = VerifyWasmCode(env, start, end);
+ local_decls.Prepend(&start, &end);
+ // Verify the code.
+ TreeResult result =
+ VerifyWasmCode(zone()->allocator(), module, sig, start, end);
+
if (result.error_code != expected) {
ptrdiff_t pc = result.error_pc - result.start;
ptrdiff_t pt = result.error_pt - result.start;
@@ -118,15 +101,15 @@
}
FATAL(str.str().c_str());
}
+
+ delete[] start; // local_decls.Prepend() allocated a new buffer.
}
void TestBinop(WasmOpcode opcode, FunctionSig* success) {
// op(local[0], local[1])
byte code[] = {static_cast<byte>(opcode), kExprGetLocal, 0, kExprGetLocal,
1};
- FunctionEnv env;
- init_env(&env, success);
- EXPECT_VERIFIES(&env, code);
+ EXPECT_VERIFIES(success, code);
// Try all combinations of return and parameter types.
for (size_t i = 0; i < arraysize(kLocalTypes); i++) {
@@ -138,8 +121,7 @@
types[2] != success->GetParam(1)) {
// Test signature mismatch.
FunctionSig sig(1, 2, types);
- init_env(&env, &sig);
- EXPECT_FAILURE(&env, code);
+ EXPECT_FAILURE(&sig, code);
}
}
}
@@ -153,12 +135,10 @@
void TestUnop(WasmOpcode opcode, LocalType ret_type, LocalType param_type) {
// Return(op(local[0]))
byte code[] = {static_cast<byte>(opcode), kExprGetLocal, 0};
- FunctionEnv env;
{
LocalType types[] = {ret_type, param_type};
FunctionSig sig(1, 1, types);
- init_env(&env, &sig);
- EXPECT_VERIFIES(&env, code);
+ EXPECT_VERIFIES(&sig, code);
}
// Try all combinations of return and parameter types.
@@ -168,8 +148,7 @@
if (types[0] != ret_type || types[1] != param_type) {
// Test signature mismatch.
FunctionSig sig(1, 1, types);
- init_env(&env, &sig);
- EXPECT_FAILURE(&env, code);
+ EXPECT_FAILURE(&sig, code);
}
}
}
@@ -177,211 +156,164 @@
};
-static FunctionEnv CreateInt32FunctionEnv(FunctionSig* sig, int count) {
- FunctionEnv env;
- env.module = nullptr;
- env.sig = sig;
- env.local_i32_count = count;
- env.local_f64_count = 0;
- env.local_f32_count = 0;
- env.total_locals = static_cast<unsigned>(count + sig->parameter_count());
- return env;
-}
-
-
-TEST_F(WasmDecoderTest, Int8Const) {
+TEST_F(AstDecoderTest, Int8Const) {
byte code[] = {kExprI8Const, 0};
for (int i = -128; i < 128; i++) {
code[1] = static_cast<byte>(i);
- EXPECT_VERIFIES(&env_i_i, code);
+ EXPECT_VERIFIES(sigs.i_i(), code);
}
}
-
-TEST_F(WasmDecoderTest, EmptyFunction) {
+TEST_F(AstDecoderTest, EmptyFunction) {
byte code[] = {0};
- Verify(kSuccess, &env_v_v, code, code);
- Verify(kError, &env_i_i, code, code);
+ Verify(kSuccess, sigs.v_v(), code, code);
+ Verify(kError, sigs.i_i(), code, code);
}
-
-TEST_F(WasmDecoderTest, IncompleteIf1) {
+TEST_F(AstDecoderTest, IncompleteIf1) {
byte code[] = {kExprIf};
- EXPECT_FAILURE(&env_v_v, code);
- EXPECT_FAILURE(&env_i_i, code);
+ EXPECT_FAILURE(sigs.v_v(), code);
+ EXPECT_FAILURE(sigs.i_i(), code);
}
-
-TEST_F(WasmDecoderTest, IncompleteIf2) {
+TEST_F(AstDecoderTest, IncompleteIf2) {
byte code[] = {kExprIf, kExprI8Const, 0};
- EXPECT_FAILURE(&env_v_v, code);
- EXPECT_FAILURE(&env_i_i, code);
+ EXPECT_FAILURE(sigs.v_v(), code);
+ EXPECT_FAILURE(sigs.i_i(), code);
}
-
-TEST_F(WasmDecoderTest, Int8Const_fallthru) {
+TEST_F(AstDecoderTest, Int8Const_fallthru) {
byte code[] = {kExprI8Const, 0, kExprI8Const, 1};
- EXPECT_VERIFIES(&env_i_i, code);
+ EXPECT_VERIFIES(sigs.i_i(), code);
}
-
-TEST_F(WasmDecoderTest, Int32Const) {
- byte code[] = {kExprI32Const, 0, 0, 0, 0};
- int32_t* ptr = reinterpret_cast<int32_t*>(code + 1);
+TEST_F(AstDecoderTest, Int32Const) {
const int kInc = 4498211;
for (int32_t i = kMinInt; i < kMaxInt - kInc; i = i + kInc) {
- *ptr = i;
- EXPECT_VERIFIES(&env_i_i, code);
+ // TODO(binji): expand test for other sized int32s; 1 through 5 bytes.
+ byte code[] = {WASM_I32V(i)};
+ EXPECT_VERIFIES(sigs.i_i(), code);
}
}
-
-TEST_F(WasmDecoderTest, Int8Const_fallthru2) {
- byte code[] = {kExprI8Const, 0, kExprI32Const, 1, 2, 3, 4};
- EXPECT_VERIFIES(&env_i_i, code);
+TEST_F(AstDecoderTest, Int8Const_fallthru2) {
+ byte code[] = {WASM_I8(0), WASM_I32V_4(0x1122334)};
+ EXPECT_VERIFIES(sigs.i_i(), code);
}
-
-TEST_F(WasmDecoderTest, Int64Const) {
- byte code[] = {kExprI64Const, 0, 0, 0, 0, 0, 0, 0, 0};
- int64_t* ptr = reinterpret_cast<int64_t*>(code + 1);
+TEST_F(AstDecoderTest, Int64Const) {
const int kInc = 4498211;
for (int32_t i = kMinInt; i < kMaxInt - kInc; i = i + kInc) {
- *ptr = (static_cast<int64_t>(i) << 32) | i;
- EXPECT_VERIFIES(&env_l_l, code);
+ byte code[] = {WASM_I64V((static_cast<int64_t>(i) << 32) | i)};
+ EXPECT_VERIFIES(sigs.l_l(), code);
}
}
-
-TEST_F(WasmDecoderTest, Float32Const) {
+TEST_F(AstDecoderTest, Float32Const) {
byte code[] = {kExprF32Const, 0, 0, 0, 0};
float* ptr = reinterpret_cast<float*>(code + 1);
for (int i = 0; i < 30; i++) {
*ptr = i * -7.75f;
- EXPECT_VERIFIES(&env_f_ff, code);
+ EXPECT_VERIFIES(sigs.f_ff(), code);
}
}
-
-TEST_F(WasmDecoderTest, Float64Const) {
+TEST_F(AstDecoderTest, Float64Const) {
byte code[] = {kExprF64Const, 0, 0, 0, 0, 0, 0, 0, 0};
double* ptr = reinterpret_cast<double*>(code + 1);
for (int i = 0; i < 30; i++) {
*ptr = i * 33.45;
- EXPECT_VERIFIES(&env_d_dd, code);
+ EXPECT_VERIFIES(sigs.d_dd(), code);
}
}
-
-TEST_F(WasmDecoderTest, Int32Const_off_end) {
+TEST_F(AstDecoderTest, Int32Const_off_end) {
byte code[] = {kExprI32Const, 0xaa, 0xbb, 0xcc, 0x44};
for (int size = 1; size <= 4; size++) {
- Verify(kError, &env_i_i, code, code + size);
+ Verify(kError, sigs.i_i(), code, code + size);
}
}
-
-TEST_F(WasmDecoderTest, GetLocal0_param) {
- EXPECT_VERIFIES(&env_i_i, kCodeGetLocal0);
+TEST_F(AstDecoderTest, GetLocal0_param) {
+ EXPECT_VERIFIES(sigs.i_i(), kCodeGetLocal0);
}
-
-TEST_F(WasmDecoderTest, GetLocal0_local) {
- FunctionEnv env;
- init_env(&env, sigs.i_v());
- env.AddLocals(kAstI32, 1);
- EXPECT_VERIFIES(&env, kCodeGetLocal0);
+TEST_F(AstDecoderTest, GetLocal0_local) {
+ AddLocals(kAstI32, 1);
+ EXPECT_VERIFIES(sigs.i_v(), kCodeGetLocal0);
}
-
-TEST_F(WasmDecoderTest, GetLocal0_param_n) {
+TEST_F(AstDecoderTest, GetLocal0_param_n) {
FunctionSig* array[] = {sigs.i_i(), sigs.i_ii(), sigs.i_iii()};
for (size_t i = 0; i < arraysize(array); i++) {
- FunctionEnv env = CreateInt32FunctionEnv(array[i], 0);
- EXPECT_VERIFIES(&env, kCodeGetLocal0);
+ EXPECT_VERIFIES(array[i], kCodeGetLocal0);
}
}
-
-TEST_F(WasmDecoderTest, GetLocalN_local) {
+TEST_F(AstDecoderTest, GetLocalN_local) {
for (byte i = 1; i < 8; i++) {
- FunctionEnv env = CreateInt32FunctionEnv(sigs.i_v(), i);
+ AddLocals(kAstI32, 1);
for (byte j = 0; j < i; j++) {
byte code[] = {kExprGetLocal, j};
- EXPECT_VERIFIES(&env, code);
+ EXPECT_VERIFIES(sigs.i_v(), code);
}
}
}
-
-TEST_F(WasmDecoderTest, GetLocal0_fail_no_params) {
- FunctionEnv env = CreateInt32FunctionEnv(sigs.i_v(), 0);
-
- EXPECT_FAILURE(&env, kCodeGetLocal0);
+TEST_F(AstDecoderTest, GetLocal0_fail_no_params) {
+ EXPECT_FAILURE(sigs.i_v(), kCodeGetLocal0);
}
-
-TEST_F(WasmDecoderTest, GetLocal1_fail_no_locals) {
- EXPECT_FAILURE(&env_i_i, kCodeGetLocal1);
+TEST_F(AstDecoderTest, GetLocal1_fail_no_locals) {
+ EXPECT_FAILURE(sigs.i_i(), kCodeGetLocal1);
}
-
-TEST_F(WasmDecoderTest, GetLocal_off_end) {
+TEST_F(AstDecoderTest, GetLocal_off_end) {
static const byte code[] = {kExprGetLocal};
- EXPECT_FAILURE(&env_i_i, code);
+ EXPECT_FAILURE(sigs.i_i(), code);
}
+TEST_F(AstDecoderTest, GetLocal_varint) {
+ const int kMaxLocals = 8000000;
+ AddLocals(kAstI32, kMaxLocals);
-TEST_F(WasmDecoderTest, GetLocal_varint) {
- env_i_i.local_i32_count = 1000000000;
- env_i_i.total_locals += 1000000000;
-
- {
- static const byte code[] = {kExprGetLocal, 0xFF, 0x01};
- EXPECT_VERIFIES(&env_i_i, code);
- EXPECT_FAILURE(&env_i_f, code);
+ for (int index = 0; index < kMaxLocals; index = index * 11 + 5) {
+ EXPECT_VERIFIES_INLINE(sigs.i_i(), kExprGetLocal, U32V_1(index));
+ EXPECT_VERIFIES_INLINE(sigs.i_i(), kExprGetLocal, U32V_2(index));
+ EXPECT_VERIFIES_INLINE(sigs.i_i(), kExprGetLocal, U32V_3(index));
+ EXPECT_VERIFIES_INLINE(sigs.i_i(), kExprGetLocal, U32V_4(index));
}
- {
- static const byte code[] = {kExprGetLocal, 0xF0, 0x80, 0x01};
- EXPECT_VERIFIES(&env_i_i, code);
- EXPECT_FAILURE(&env_i_f, code);
- }
+ EXPECT_VERIFIES_INLINE(sigs.i_i(), kExprGetLocal, U32V_5(kMaxLocals - 1));
- {
- static const byte code[] = {kExprGetLocal, 0xF2, 0x81, 0x82, 0x01};
- EXPECT_VERIFIES(&env_i_i, code);
- EXPECT_FAILURE(&env_i_f, code);
- }
+ EXPECT_VERIFIES_INLINE(sigs.i_i(), kExprGetLocal, U32V_4(kMaxLocals - 1));
+ EXPECT_VERIFIES_INLINE(sigs.i_i(), kExprGetLocal, U32V_4(kMaxLocals));
+ EXPECT_FAILURE_INLINE(sigs.i_i(), kExprGetLocal, U32V_4(kMaxLocals + 1));
- {
- static const byte code[] = {kExprGetLocal, 0xF3, 0xA1, 0xB1, 0xC1, 0x01};
- EXPECT_VERIFIES(&env_i_i, code);
- EXPECT_FAILURE(&env_i_f, code);
- }
+ EXPECT_FAILURE_INLINE(sigs.i_v(), kExprGetLocal, U32V_4(kMaxLocals));
+ EXPECT_FAILURE_INLINE(sigs.i_v(), kExprGetLocal, U32V_4(kMaxLocals + 1));
}
-
-TEST_F(WasmDecoderTest, Binops_off_end) {
+TEST_F(AstDecoderTest, Binops_off_end) {
byte code1[] = {0}; // [opcode]
for (size_t i = 0; i < arraysize(kInt32BinopOpcodes); i++) {
code1[0] = kInt32BinopOpcodes[i];
- EXPECT_FAILURE(&env_i_i, code1);
+ EXPECT_FAILURE(sigs.i_i(), code1);
}
byte code3[] = {0, kExprGetLocal, 0}; // [opcode] [expr]
for (size_t i = 0; i < arraysize(kInt32BinopOpcodes); i++) {
code3[0] = kInt32BinopOpcodes[i];
- EXPECT_FAILURE(&env_i_i, code3);
+ EXPECT_FAILURE(sigs.i_i(), code3);
}
byte code4[] = {0, kExprGetLocal, 0, 0}; // [opcode] [expr] [opcode]
for (size_t i = 0; i < arraysize(kInt32BinopOpcodes); i++) {
code4[0] = kInt32BinopOpcodes[i];
code4[3] = kInt32BinopOpcodes[i];
- EXPECT_FAILURE(&env_i_i, code4);
+ EXPECT_FAILURE(sigs.i_i(), code4);
}
}
@@ -389,79 +321,68 @@
//===================================================================
//== Statements
//===================================================================
-TEST_F(WasmDecoderTest, Nop) {
+TEST_F(AstDecoderTest, Nop) {
static const byte code[] = {kExprNop};
- EXPECT_VERIFIES(&env_v_v, code);
+ EXPECT_VERIFIES(sigs.v_v(), code);
}
-
-TEST_F(WasmDecoderTest, SetLocal0_param) {
+TEST_F(AstDecoderTest, SetLocal0_param) {
static const byte code[] = {kExprSetLocal, 0, kExprI8Const, 0};
- EXPECT_VERIFIES(&env_i_i, code);
+ EXPECT_VERIFIES(sigs.i_i(), code);
}
-
-TEST_F(WasmDecoderTest, SetLocal0_local) {
+TEST_F(AstDecoderTest, SetLocal0_local) {
byte code[] = {kExprSetLocal, 0, kExprI8Const, 0};
- FunctionEnv env = CreateInt32FunctionEnv(sigs.i_v(), 1);
-
- EXPECT_VERIFIES(&env, code);
+ AddLocals(kAstI32, 1);
+ EXPECT_VERIFIES(sigs.i_v(), code);
}
-
-TEST_F(WasmDecoderTest, SetLocalN_local) {
+TEST_F(AstDecoderTest, SetLocalN_local) {
for (byte i = 1; i < 8; i++) {
- FunctionEnv env = CreateInt32FunctionEnv(sigs.i_v(), i);
+ AddLocals(kAstI32, 1);
for (byte j = 0; j < i; j++) {
byte code[] = {kExprSetLocal, j, kExprI8Const, i};
- EXPECT_VERIFIES(&env, code);
+ EXPECT_VERIFIES(sigs.v_v(), code);
}
}
}
-
-TEST_F(WasmDecoderTest, Block0) {
+TEST_F(AstDecoderTest, Block0) {
static const byte code[] = {kExprBlock, 0};
- EXPECT_VERIFIES(&env_v_v, code);
+ EXPECT_VERIFIES(sigs.v_v(), code);
}
-
-TEST_F(WasmDecoderTest, Block0_fallthru1) {
+TEST_F(AstDecoderTest, Block0_fallthru1) {
static const byte code[] = {kExprBlock, 0, kExprBlock, 0};
- EXPECT_VERIFIES(&env_v_v, code);
+ EXPECT_VERIFIES(sigs.v_v(), code);
}
-
-TEST_F(WasmDecoderTest, Block1) {
+TEST_F(AstDecoderTest, Block1) {
static const byte code[] = {kExprBlock, 1, kExprSetLocal, 0, kExprI8Const, 0};
- EXPECT_VERIFIES(&env_i_i, code);
+ EXPECT_VERIFIES(sigs.i_i(), code);
}
-
-TEST_F(WasmDecoderTest, Block0_fallthru2) {
+TEST_F(AstDecoderTest, Block0_fallthru2) {
static const byte code[] = {kExprBlock, 0, kExprSetLocal, 0, kExprI8Const, 0};
- EXPECT_VERIFIES(&env_i_i, code);
+ EXPECT_VERIFIES(sigs.i_i(), code);
}
-
-TEST_F(WasmDecoderTest, Block2) {
+TEST_F(AstDecoderTest, Block2) {
static const byte code[] = {kExprBlock, 2, // --
kExprSetLocal, 0, kExprI8Const, 0, // --
kExprSetLocal, 0, kExprI8Const, 0}; // --
- EXPECT_VERIFIES(&env_i_i, code);
+ EXPECT_VERIFIES(sigs.i_i(), code);
}
-
-TEST_F(WasmDecoderTest, Block2_fallthru) {
+TEST_F(AstDecoderTest, Block2_fallthru) {
static const byte code[] = {kExprBlock, 2, // --
kExprSetLocal, 0, kExprI8Const, 0, // --
kExprSetLocal, 0, kExprI8Const, 0, // --
kExprI8Const, 11}; // --
- EXPECT_VERIFIES(&env_i_i, code);
+ EXPECT_VERIFIES(sigs.i_i(), code);
}
-
-TEST_F(WasmDecoderTest, BlockN) {
+TEST_F(AstDecoderTest, BlockN) {
byte block[] = {kExprBlock, 2};
for (size_t i = 0; i < 10; i++) {
@@ -473,106 +394,91 @@
memcpy(code + sizeof(block) + j * sizeof(kCodeSetLocal0), kCodeSetLocal0,
sizeof(kCodeSetLocal0));
}
- Verify(kSuccess, &env_v_i, code, code + total);
+ Verify(kSuccess, sigs.v_i(), code, code + total);
free(code);
}
}
-
-TEST_F(WasmDecoderTest, BlockN_off_end) {
+TEST_F(AstDecoderTest, BlockN_off_end) {
for (byte i = 2; i < 10; i++) {
byte code[] = {kExprBlock, i, kExprNop};
- EXPECT_FAILURE(&env_v_v, code);
+ EXPECT_FAILURE(sigs.v_v(), code);
}
}
-
-TEST_F(WasmDecoderTest, Block1_break) {
+TEST_F(AstDecoderTest, Block1_break) {
static const byte code[] = {kExprBlock, 1, kExprBr, 0, kExprNop};
- EXPECT_VERIFIES(&env_v_v, code);
+ EXPECT_VERIFIES(sigs.v_v(), code);
}
-
-TEST_F(WasmDecoderTest, Block2_break) {
+TEST_F(AstDecoderTest, Block2_break) {
static const byte code[] = {kExprBlock, 2, kExprNop, kExprBr, 0, kExprNop};
- EXPECT_VERIFIES(&env_v_v, code);
+ EXPECT_VERIFIES(sigs.v_v(), code);
}
-
-TEST_F(WasmDecoderTest, Block1_continue) {
+TEST_F(AstDecoderTest, Block1_continue) {
static const byte code[] = {kExprBlock, 1, kExprBr, 1, kExprNop};
- EXPECT_FAILURE(&env_v_v, code);
+ EXPECT_FAILURE(sigs.v_v(), code);
}
-
-TEST_F(WasmDecoderTest, Block2_continue) {
+TEST_F(AstDecoderTest, Block2_continue) {
static const byte code[] = {kExprBlock, 2, kExprNop, kExprBr, 1, kExprNop};
- EXPECT_FAILURE(&env_v_v, code);
+ EXPECT_FAILURE(sigs.v_v(), code);
}
-
-TEST_F(WasmDecoderTest, ExprBlock0) {
+TEST_F(AstDecoderTest, ExprBlock0) {
static const byte code[] = {kExprBlock, 0};
- EXPECT_VERIFIES(&env_v_v, code);
+ EXPECT_VERIFIES(sigs.v_v(), code);
}
-
-TEST_F(WasmDecoderTest, ExprBlock1a) {
+TEST_F(AstDecoderTest, ExprBlock1a) {
static const byte code[] = {kExprBlock, 1, kExprI8Const, 0};
- EXPECT_VERIFIES(&env_i_i, code);
+ EXPECT_VERIFIES(sigs.i_i(), code);
}
-
-TEST_F(WasmDecoderTest, ExprBlock1b) {
+TEST_F(AstDecoderTest, ExprBlock1b) {
static const byte code[] = {kExprBlock, 1, kExprI8Const, 0};
- EXPECT_FAILURE(&env_f_ff, code);
+ EXPECT_FAILURE(sigs.f_ff(), code);
}
-
-TEST_F(WasmDecoderTest, ExprBlock1c) {
+TEST_F(AstDecoderTest, ExprBlock1c) {
static const byte code[] = {kExprBlock, 1, kExprF32Const, 0, 0, 0, 0};
- EXPECT_VERIFIES(&env_f_ff, code);
+ EXPECT_VERIFIES(sigs.f_ff(), code);
}
-
-TEST_F(WasmDecoderTest, IfEmpty) {
+TEST_F(AstDecoderTest, IfEmpty) {
static const byte code[] = {kExprIf, kExprGetLocal, 0, kExprNop};
- EXPECT_VERIFIES(&env_v_i, code);
+ EXPECT_VERIFIES(sigs.v_i(), code);
}
-
-TEST_F(WasmDecoderTest, IfSet) {
+TEST_F(AstDecoderTest, IfSet) {
static const byte code[] = {kExprIfElse, kExprGetLocal, 0, kExprSetLocal,
0, kExprI8Const, 0, kExprNop};
- EXPECT_VERIFIES(&env_v_i, code);
+ EXPECT_VERIFIES(sigs.v_i(), code);
}
-
-TEST_F(WasmDecoderTest, IfBlock1) {
+TEST_F(AstDecoderTest, IfBlock1) {
static const byte code[] = {kExprIfElse, kExprGetLocal, 0, kExprBlock,
1, kExprSetLocal, 0, kExprI8Const,
0, kExprNop};
- EXPECT_VERIFIES(&env_v_i, code);
+ EXPECT_VERIFIES(sigs.v_i(), code);
}
-
-TEST_F(WasmDecoderTest, IfBlock2) {
+TEST_F(AstDecoderTest, IfBlock2) {
static const byte code[] = {kExprIf, kExprGetLocal, 0, kExprBlock,
2, kExprSetLocal, 0, kExprI8Const,
0, kExprSetLocal, 0, kExprI8Const,
0};
- EXPECT_VERIFIES(&env_v_i, code);
+ EXPECT_VERIFIES(sigs.v_i(), code);
}
-
-TEST_F(WasmDecoderTest, IfElseEmpty) {
+TEST_F(AstDecoderTest, IfElseEmpty) {
static const byte code[] = {kExprIfElse, kExprGetLocal, 0, kExprNop,
kExprNop};
- EXPECT_VERIFIES(&env_v_i, code);
+ EXPECT_VERIFIES(sigs.v_i(), code);
}
-
-TEST_F(WasmDecoderTest, IfElseSet) {
+TEST_F(AstDecoderTest, IfElseSet) {
static const byte code[] = {kExprIfElse,
kExprGetLocal,
0, // --
@@ -584,218 +490,192 @@
0,
kExprI8Const,
1}; // --
- EXPECT_VERIFIES(&env_v_i, code);
+ EXPECT_VERIFIES(sigs.v_i(), code);
}
-
-TEST_F(WasmDecoderTest, IfElseUnreachable) {
+TEST_F(AstDecoderTest, IfElseUnreachable) {
static const byte code[] = {kExprIfElse, kExprI8Const, 0,
kExprUnreachable, kExprGetLocal, 0};
for (size_t i = 0; i < arraysize(kLocalTypes); i++) {
LocalType types[] = {kAstI32, kLocalTypes[i]};
- FunctionEnv env;
FunctionSig sig(1, 1, types);
- init_env(&env, &sig);
if (kLocalTypes[i] == kAstI32) {
- EXPECT_VERIFIES(&env, code);
+ EXPECT_VERIFIES(&sig, code);
} else {
- EXPECT_FAILURE(&env, code);
+ EXPECT_FAILURE(&sig, code);
}
}
}
-
-TEST_F(WasmDecoderTest, Loop0) {
+TEST_F(AstDecoderTest, Loop0) {
static const byte code[] = {kExprLoop, 0};
- EXPECT_VERIFIES(&env_v_v, code);
+ EXPECT_VERIFIES(sigs.v_v(), code);
}
-
-TEST_F(WasmDecoderTest, Loop1) {
+TEST_F(AstDecoderTest, Loop1) {
static const byte code[] = {kExprLoop, 1, kExprSetLocal, 0, kExprI8Const, 0};
- EXPECT_VERIFIES(&env_v_i, code);
+ EXPECT_VERIFIES(sigs.v_i(), code);
}
-
-TEST_F(WasmDecoderTest, Loop2) {
+TEST_F(AstDecoderTest, Loop2) {
static const byte code[] = {kExprLoop, 2, // --
kExprSetLocal, 0, kExprI8Const, 0, // --
kExprSetLocal, 0, kExprI8Const, 0}; // --
- EXPECT_VERIFIES(&env_v_i, code);
+ EXPECT_VERIFIES(sigs.v_i(), code);
}
-
-TEST_F(WasmDecoderTest, Loop1_continue) {
+TEST_F(AstDecoderTest, Loop1_continue) {
static const byte code[] = {kExprLoop, 1, kExprBr, 0, kExprNop};
- EXPECT_VERIFIES(&env_v_v, code);
+ EXPECT_VERIFIES(sigs.v_v(), code);
}
-
-TEST_F(WasmDecoderTest, Loop1_break) {
+TEST_F(AstDecoderTest, Loop1_break) {
static const byte code[] = {kExprLoop, 1, kExprBr, 1, kExprNop};
- EXPECT_VERIFIES(&env_v_v, code);
+ EXPECT_VERIFIES(sigs.v_v(), code);
}
-
-TEST_F(WasmDecoderTest, Loop2_continue) {
+TEST_F(AstDecoderTest, Loop2_continue) {
static const byte code[] = {kExprLoop, 2, // --
kExprSetLocal, 0, kExprI8Const, 0, // --
kExprBr, 0, kExprNop}; // --
- EXPECT_VERIFIES(&env_v_i, code);
+ EXPECT_VERIFIES(sigs.v_i(), code);
}
-
-TEST_F(WasmDecoderTest, Loop2_break) {
+TEST_F(AstDecoderTest, Loop2_break) {
static const byte code[] = {kExprLoop, 2, // --
kExprSetLocal, 0, kExprI8Const, 0, // --
kExprBr, 1, kExprNop}; // --
- EXPECT_VERIFIES(&env_v_i, code);
+ EXPECT_VERIFIES(sigs.v_i(), code);
}
-
-TEST_F(WasmDecoderTest, ExprLoop0) {
+TEST_F(AstDecoderTest, ExprLoop0) {
static const byte code[] = {kExprLoop, 0};
- EXPECT_VERIFIES(&env_v_v, code);
+ EXPECT_VERIFIES(sigs.v_v(), code);
}
-
-TEST_F(WasmDecoderTest, ExprLoop1a) {
+TEST_F(AstDecoderTest, ExprLoop1a) {
static const byte code[] = {kExprLoop, 1, kExprBr, 0, kExprI8Const, 0};
- EXPECT_VERIFIES(&env_i_i, code);
+ EXPECT_VERIFIES(sigs.i_i(), code);
}
-
-TEST_F(WasmDecoderTest, ExprLoop1b) {
+TEST_F(AstDecoderTest, ExprLoop1b) {
static const byte code[] = {kExprLoop, 1, kExprBr, 0, kExprI8Const, 0};
- EXPECT_VERIFIES(&env_i_i, code);
+ EXPECT_VERIFIES(sigs.i_i(), code);
}
-
-TEST_F(WasmDecoderTest, ExprLoop2_unreachable) {
+TEST_F(AstDecoderTest, ExprLoop2_unreachable) {
static const byte code[] = {kExprLoop, 2, kExprBr, 0,
kExprI8Const, 0, kExprNop};
- EXPECT_VERIFIES(&env_i_i, code);
+ EXPECT_VERIFIES(sigs.i_i(), code);
}
-
-TEST_F(WasmDecoderTest, ReturnVoid1) {
+TEST_F(AstDecoderTest, ReturnVoid1) {
static const byte code[] = {kExprNop};
- EXPECT_VERIFIES(&env_v_v, code);
- EXPECT_FAILURE(&env_i_i, code);
- EXPECT_FAILURE(&env_i_f, code);
+ EXPECT_VERIFIES(sigs.v_v(), code);
+ EXPECT_FAILURE(sigs.i_i(), code);
+ EXPECT_FAILURE(sigs.i_f(), code);
}
-
-TEST_F(WasmDecoderTest, ReturnVoid2) {
+TEST_F(AstDecoderTest, ReturnVoid2) {
static const byte code[] = {kExprBlock, 1, kExprBr, 0, kExprNop};
- EXPECT_VERIFIES(&env_v_v, code);
- EXPECT_FAILURE(&env_i_i, code);
- EXPECT_FAILURE(&env_i_f, code);
+ EXPECT_VERIFIES(sigs.v_v(), code);
+ EXPECT_FAILURE(sigs.i_i(), code);
+ EXPECT_FAILURE(sigs.i_f(), code);
}
+TEST_F(AstDecoderTest, ReturnVoid3) {
+ EXPECT_VERIFIES_INLINE(sigs.v_v(), kExprI8Const, 0);
+ EXPECT_VERIFIES_INLINE(sigs.v_v(), kExprI32Const, 0, 0, 0, 0);
+ EXPECT_VERIFIES_INLINE(sigs.v_v(), kExprI64Const, 0, 0, 0, 0, 0, 0, 0, 0);
+ EXPECT_VERIFIES_INLINE(sigs.v_v(), kExprF32Const, 0, 0, 0, 0);
+ EXPECT_VERIFIES_INLINE(sigs.v_v(), kExprF64Const, 0, 0, 0, 0, 0, 0, 0, 0);
-TEST_F(WasmDecoderTest, ReturnVoid3) {
- EXPECT_VERIFIES_INLINE(&env_v_v, kExprI8Const, 0);
- EXPECT_VERIFIES_INLINE(&env_v_v, kExprI32Const, 0, 0, 0, 0);
- EXPECT_VERIFIES_INLINE(&env_v_v, kExprI64Const, 0, 0, 0, 0, 0, 0, 0, 0);
- EXPECT_VERIFIES_INLINE(&env_v_v, kExprF32Const, 0, 0, 0, 0);
- EXPECT_VERIFIES_INLINE(&env_v_v, kExprF64Const, 0, 0, 0, 0, 0, 0, 0, 0);
-
- EXPECT_VERIFIES_INLINE(&env_v_i, kExprGetLocal, 0);
+ EXPECT_VERIFIES_INLINE(sigs.v_i(), kExprGetLocal, 0);
}
-
-TEST_F(WasmDecoderTest, Unreachable1) {
- EXPECT_VERIFIES_INLINE(&env_v_v, kExprUnreachable);
- EXPECT_VERIFIES_INLINE(&env_v_v, kExprUnreachable, kExprUnreachable);
- EXPECT_VERIFIES_INLINE(&env_v_v, WASM_BLOCK(2, WASM_UNREACHABLE, WASM_ZERO));
- EXPECT_VERIFIES_INLINE(&env_v_v, WASM_BLOCK(2, WASM_BR(0), WASM_ZERO));
- EXPECT_VERIFIES_INLINE(&env_v_v, WASM_LOOP(2, WASM_UNREACHABLE, WASM_ZERO));
- EXPECT_VERIFIES_INLINE(&env_v_v, WASM_LOOP(2, WASM_BR(0), WASM_ZERO));
+TEST_F(AstDecoderTest, Unreachable1) {
+ EXPECT_VERIFIES_INLINE(sigs.v_v(), kExprUnreachable);
+ EXPECT_VERIFIES_INLINE(sigs.v_v(), kExprUnreachable, kExprUnreachable);
+ EXPECT_VERIFIES_INLINE(sigs.v_v(),
+ WASM_BLOCK(2, WASM_UNREACHABLE, WASM_ZERO));
+ EXPECT_VERIFIES_INLINE(sigs.v_v(), WASM_BLOCK(2, WASM_BR(0), WASM_ZERO));
+ EXPECT_VERIFIES_INLINE(sigs.v_v(), WASM_LOOP(2, WASM_UNREACHABLE, WASM_ZERO));
+ EXPECT_VERIFIES_INLINE(sigs.v_v(), WASM_LOOP(2, WASM_BR(0), WASM_ZERO));
}
-
-TEST_F(WasmDecoderTest, Codeiness) {
+TEST_F(AstDecoderTest, Codeiness) {
VERIFY(kExprLoop, 2, // --
kExprSetLocal, 0, kExprI8Const, 0, // --
kExprBr, 0, kExprNop); // --
}
-
-TEST_F(WasmDecoderTest, ExprIf1) {
+TEST_F(AstDecoderTest, ExprIf1) {
VERIFY(kExprIf, kExprGetLocal, 0, kExprI8Const, 0, kExprI8Const, 1);
VERIFY(kExprIf, kExprGetLocal, 0, kExprGetLocal, 0, kExprGetLocal, 0);
VERIFY(kExprIf, kExprGetLocal, 0, kExprI32Add, kExprGetLocal, 0,
kExprGetLocal, 0, kExprI8Const, 1);
}
-
-TEST_F(WasmDecoderTest, ExprIf_off_end) {
+TEST_F(AstDecoderTest, ExprIf_off_end) {
static const byte kCode[] = {kExprIf, kExprGetLocal, 0, kExprGetLocal,
0, kExprGetLocal, 0};
for (size_t len = 1; len < arraysize(kCode); len++) {
- Verify(kError, &env_i_i, kCode, kCode + len);
+ Verify(kError, sigs.i_i(), kCode, kCode + len);
}
}
-
-TEST_F(WasmDecoderTest, ExprIf_type) {
+TEST_F(AstDecoderTest, ExprIf_type) {
{
// float|double ? 1 : 2
static const byte kCode[] = {kExprIfElse, kExprGetLocal, 0, kExprI8Const,
1, kExprI8Const, 2};
- EXPECT_FAILURE(&env_i_f, kCode);
- EXPECT_FAILURE(&env_i_d, kCode);
+ EXPECT_FAILURE(sigs.i_f(), kCode);
+ EXPECT_FAILURE(sigs.i_d(), kCode);
}
{
// 1 ? float|double : 2
static const byte kCode[] = {kExprIfElse, kExprI8Const, 1, kExprGetLocal,
0, kExprI8Const, 2};
- EXPECT_FAILURE(&env_i_f, kCode);
- EXPECT_FAILURE(&env_i_d, kCode);
+ EXPECT_FAILURE(sigs.i_f(), kCode);
+ EXPECT_FAILURE(sigs.i_d(), kCode);
}
{
// stmt ? 0 : 1
static const byte kCode[] = {kExprIfElse, kExprNop, kExprI8Const,
0, kExprI8Const, 1};
- EXPECT_FAILURE(&env_i_i, kCode);
+ EXPECT_FAILURE(sigs.i_i(), kCode);
}
{
// 0 ? stmt : 1
static const byte kCode[] = {kExprIfElse, kExprI8Const, 0,
kExprNop, kExprI8Const, 1};
- EXPECT_FAILURE(&env_i_i, kCode);
+ EXPECT_FAILURE(sigs.i_i(), kCode);
}
{
// 0 ? 1 : stmt
static const byte kCode[] = {kExprIfElse, kExprI8Const, 0, kExprI8Const, 1,
0, kExprBlock};
- EXPECT_FAILURE(&env_i_i, kCode);
+ EXPECT_FAILURE(sigs.i_i(), kCode);
}
}
-
-TEST_F(WasmDecoderTest, Int64Local_param) {
- EXPECT_VERIFIES(&env_l_l, kCodeGetLocal0);
+TEST_F(AstDecoderTest, Int64Local_param) {
+ EXPECT_VERIFIES(sigs.l_l(), kCodeGetLocal0);
}
-
-TEST_F(WasmDecoderTest, Int64Locals) {
+TEST_F(AstDecoderTest, Int64Locals) {
for (byte i = 1; i < 8; i++) {
- FunctionEnv env;
- init_env(&env, sigs.l_v());
- env.AddLocals(kAstI64, i);
+ AddLocals(kAstI64, 1);
for (byte j = 0; j < i; j++) {
byte code[] = {kExprGetLocal, j};
- EXPECT_VERIFIES(&env, code);
+ EXPECT_VERIFIES(sigs.l_v(), code);
}
}
}
-
-TEST_F(WasmDecoderTest, Int32Binops) {
+TEST_F(AstDecoderTest, Int32Binops) {
TestBinop(kExprI32Add, sigs.i_ii());
TestBinop(kExprI32Sub, sigs.i_ii());
TestBinop(kExprI32Mul, sigs.i_ii());
@@ -816,8 +696,7 @@
TestBinop(kExprI32LeU, sigs.i_ii());
}
-
-TEST_F(WasmDecoderTest, DoubleBinops) {
+TEST_F(AstDecoderTest, DoubleBinops) {
TestBinop(kExprF64Add, sigs.d_dd());
TestBinop(kExprF64Sub, sigs.d_dd());
TestBinop(kExprF64Mul, sigs.d_dd());
@@ -828,8 +707,7 @@
TestBinop(kExprF64Le, sigs.i_dd());
}
-
-TEST_F(WasmDecoderTest, FloatBinops) {
+TEST_F(AstDecoderTest, FloatBinops) {
TestBinop(kExprF32Add, sigs.f_ff());
TestBinop(kExprF32Sub, sigs.f_ff());
TestBinop(kExprF32Mul, sigs.f_ff());
@@ -840,8 +718,7 @@
TestBinop(kExprF32Le, sigs.i_ff());
}
-
-TEST_F(WasmDecoderTest, TypeConversions) {
+TEST_F(AstDecoderTest, TypeConversions) {
TestUnop(kExprI32SConvertF32, kAstI32, kAstF32);
TestUnop(kExprI32SConvertF64, kAstI32, kAstF64);
TestUnop(kExprI32UConvertF32, kAstI32, kAstF32);
@@ -854,9 +731,8 @@
TestUnop(kExprF32ConvertF64, kAstF32, kAstF64);
}
-
-TEST_F(WasmDecoderTest, MacrosStmt) {
- VERIFY(WASM_SET_LOCAL(0, WASM_I32(87348)));
+TEST_F(AstDecoderTest, MacrosStmt) {
+ VERIFY(WASM_SET_LOCAL(0, WASM_I32V_3(87348)));
VERIFY(WASM_STORE_MEM(MachineType::Int32(), WASM_I8(24), WASM_I8(40)));
VERIFY(WASM_IF(WASM_GET_LOCAL(0), WASM_NOP));
VERIFY(WASM_IF_ELSE(WASM_GET_LOCAL(0), WASM_NOP, WASM_NOP));
@@ -867,33 +743,30 @@
VERIFY(WASM_LOOP(1, WASM_CONTINUE(0)));
}
+TEST_F(AstDecoderTest, MacrosBreak) {
+ EXPECT_VERIFIES_INLINE(sigs.v_v(), WASM_LOOP(1, WASM_BREAK(0)));
-TEST_F(WasmDecoderTest, MacrosBreak) {
- EXPECT_VERIFIES_INLINE(&env_v_v, WASM_LOOP(1, WASM_BREAK(0)));
-
- EXPECT_VERIFIES_INLINE(&env_i_i, WASM_LOOP(1, WASM_BREAKV(0, WASM_ZERO)));
- EXPECT_VERIFIES_INLINE(&env_l_l, WASM_LOOP(1, WASM_BREAKV(0, WASM_I64(0))));
- EXPECT_VERIFIES_INLINE(&env_f_ff,
+ EXPECT_VERIFIES_INLINE(sigs.i_i(), WASM_LOOP(1, WASM_BREAKV(0, WASM_ZERO)));
+ EXPECT_VERIFIES_INLINE(sigs.l_l(),
+ WASM_LOOP(1, WASM_BREAKV(0, WASM_I64V_1(0))));
+ EXPECT_VERIFIES_INLINE(sigs.f_ff(),
WASM_LOOP(1, WASM_BREAKV(0, WASM_F32(0.0))));
- EXPECT_VERIFIES_INLINE(&env_d_dd,
+ EXPECT_VERIFIES_INLINE(sigs.d_dd(),
WASM_LOOP(1, WASM_BREAKV(0, WASM_F64(0.0))));
}
-
-TEST_F(WasmDecoderTest, MacrosContinue) {
- EXPECT_VERIFIES_INLINE(&env_v_v, WASM_LOOP(1, WASM_CONTINUE(0)));
+TEST_F(AstDecoderTest, MacrosContinue) {
+ EXPECT_VERIFIES_INLINE(sigs.v_v(), WASM_LOOP(1, WASM_CONTINUE(0)));
}
-
-TEST_F(WasmDecoderTest, MacrosVariadic) {
+TEST_F(AstDecoderTest, MacrosVariadic) {
VERIFY(WASM_BLOCK(2, WASM_NOP, WASM_NOP));
VERIFY(WASM_BLOCK(3, WASM_NOP, WASM_NOP, WASM_NOP));
VERIFY(WASM_LOOP(2, WASM_NOP, WASM_NOP));
VERIFY(WASM_LOOP(3, WASM_NOP, WASM_NOP, WASM_NOP));
}
-
-TEST_F(WasmDecoderTest, MacrosNestedBlocks) {
+TEST_F(AstDecoderTest, MacrosNestedBlocks) {
VERIFY(WASM_BLOCK(2, WASM_NOP, WASM_BLOCK(2, WASM_NOP, WASM_NOP)));
VERIFY(WASM_BLOCK(3, WASM_NOP, // --
WASM_BLOCK(2, WASM_NOP, WASM_NOP), // --
@@ -901,42 +774,31 @@
VERIFY(WASM_BLOCK(1, WASM_BLOCK(1, WASM_BLOCK(2, WASM_NOP, WASM_NOP))));
}
-
-TEST_F(WasmDecoderTest, MultipleReturn) {
+TEST_F(AstDecoderTest, MultipleReturn) {
static LocalType kIntTypes5[] = {kAstI32, kAstI32, kAstI32, kAstI32, kAstI32};
FunctionSig sig_ii_v(2, 0, kIntTypes5);
- FunctionEnv env_ii_v;
- init_env(&env_ii_v, &sig_ii_v);
- EXPECT_VERIFIES_INLINE(&env_ii_v, WASM_RETURN(WASM_ZERO, WASM_ONE));
- EXPECT_FAILURE_INLINE(&env_ii_v, WASM_RETURN(WASM_ZERO));
+ EXPECT_VERIFIES_INLINE(&sig_ii_v, WASM_RETURN(WASM_ZERO, WASM_ONE));
+ EXPECT_FAILURE_INLINE(&sig_ii_v, WASM_RETURN(WASM_ZERO));
FunctionSig sig_iii_v(3, 0, kIntTypes5);
- FunctionEnv env_iii_v;
- init_env(&env_iii_v, &sig_iii_v);
- EXPECT_VERIFIES_INLINE(&env_iii_v,
+ EXPECT_VERIFIES_INLINE(&sig_iii_v,
WASM_RETURN(WASM_ZERO, WASM_ONE, WASM_I8(44)));
- EXPECT_FAILURE_INLINE(&env_iii_v, WASM_RETURN(WASM_ZERO, WASM_ONE));
+ EXPECT_FAILURE_INLINE(&sig_iii_v, WASM_RETURN(WASM_ZERO, WASM_ONE));
}
-
-TEST_F(WasmDecoderTest, MultipleReturn_fallthru) {
+TEST_F(AstDecoderTest, MultipleReturn_fallthru) {
static LocalType kIntTypes5[] = {kAstI32, kAstI32, kAstI32, kAstI32, kAstI32};
FunctionSig sig_ii_v(2, 0, kIntTypes5);
- FunctionEnv env_ii_v;
- init_env(&env_ii_v, &sig_ii_v);
- EXPECT_VERIFIES_INLINE(&env_ii_v, WASM_ZERO, WASM_ONE);
- EXPECT_FAILURE_INLINE(&env_ii_v, WASM_ZERO);
+ EXPECT_VERIFIES_INLINE(&sig_ii_v, WASM_ZERO, WASM_ONE);
+ EXPECT_FAILURE_INLINE(&sig_ii_v, WASM_ZERO);
FunctionSig sig_iii_v(3, 0, kIntTypes5);
- FunctionEnv env_iii_v;
- init_env(&env_iii_v, &sig_iii_v);
- EXPECT_VERIFIES_INLINE(&env_iii_v, WASM_ZERO, WASM_ONE, WASM_I8(44));
- EXPECT_FAILURE_INLINE(&env_iii_v, WASM_ZERO, WASM_ONE);
+ EXPECT_VERIFIES_INLINE(&sig_iii_v, WASM_ZERO, WASM_ONE, WASM_I8(44));
+ EXPECT_FAILURE_INLINE(&sig_iii_v, WASM_ZERO, WASM_ONE);
}
-
-TEST_F(WasmDecoderTest, MacrosInt32) {
+TEST_F(AstDecoderTest, MacrosInt32) {
VERIFY(WASM_I32_ADD(WASM_GET_LOCAL(0), WASM_I8(12)));
VERIFY(WASM_I32_SUB(WASM_GET_LOCAL(0), WASM_I8(13)));
VERIFY(WASM_I32_MUL(WASM_GET_LOCAL(0), WASM_I8(14)));
@@ -950,6 +812,8 @@
VERIFY(WASM_I32_SHL(WASM_GET_LOCAL(0), WASM_I8(22)));
VERIFY(WASM_I32_SHR(WASM_GET_LOCAL(0), WASM_I8(23)));
VERIFY(WASM_I32_SAR(WASM_GET_LOCAL(0), WASM_I8(24)));
+ VERIFY(WASM_I32_ROR(WASM_GET_LOCAL(0), WASM_I8(24)));
+ VERIFY(WASM_I32_ROL(WASM_GET_LOCAL(0), WASM_I8(24)));
VERIFY(WASM_I32_EQ(WASM_GET_LOCAL(0), WASM_I8(25)));
VERIFY(WASM_I32_NE(WASM_GET_LOCAL(0), WASM_I8(25)));
@@ -964,47 +828,42 @@
VERIFY(WASM_I32_GEU(WASM_GET_LOCAL(0), WASM_I8(29)));
}
+TEST_F(AstDecoderTest, MacrosInt64) {
+#define VERIFY_L_LL(...) EXPECT_VERIFIES_INLINE(sigs.l_ll(), __VA_ARGS__)
+#define VERIFY_I_LL(...) EXPECT_VERIFIES_INLINE(sigs.i_ll(), __VA_ARGS__)
-TEST_F(WasmDecoderTest, MacrosInt64) {
- FunctionEnv env_i_ll;
- FunctionEnv env_l_ll;
- init_env(&env_i_ll, sigs.i_ll());
- init_env(&env_l_ll, sigs.l_ll());
+ VERIFY_L_LL(WASM_I64_ADD(WASM_GET_LOCAL(0), WASM_I64V_1(12)));
+ VERIFY_L_LL(WASM_I64_SUB(WASM_GET_LOCAL(0), WASM_I64V_1(13)));
+ VERIFY_L_LL(WASM_I64_MUL(WASM_GET_LOCAL(0), WASM_I64V_1(14)));
+ VERIFY_L_LL(WASM_I64_DIVS(WASM_GET_LOCAL(0), WASM_I64V_1(15)));
+ VERIFY_L_LL(WASM_I64_DIVU(WASM_GET_LOCAL(0), WASM_I64V_1(16)));
+ VERIFY_L_LL(WASM_I64_REMS(WASM_GET_LOCAL(0), WASM_I64V_1(17)));
+ VERIFY_L_LL(WASM_I64_REMU(WASM_GET_LOCAL(0), WASM_I64V_1(18)));
+ VERIFY_L_LL(WASM_I64_AND(WASM_GET_LOCAL(0), WASM_I64V_1(19)));
+ VERIFY_L_LL(WASM_I64_IOR(WASM_GET_LOCAL(0), WASM_I64V_1(20)));
+ VERIFY_L_LL(WASM_I64_XOR(WASM_GET_LOCAL(0), WASM_I64V_1(21)));
-#define VERIFY_L_LL(...) EXPECT_VERIFIES_INLINE(&env_l_ll, __VA_ARGS__)
-#define VERIFY_I_LL(...) EXPECT_VERIFIES_INLINE(&env_i_ll, __VA_ARGS__)
+ VERIFY_L_LL(WASM_I64_SHL(WASM_GET_LOCAL(0), WASM_I64V_1(22)));
+ VERIFY_L_LL(WASM_I64_SHR(WASM_GET_LOCAL(0), WASM_I64V_1(23)));
+ VERIFY_L_LL(WASM_I64_SAR(WASM_GET_LOCAL(0), WASM_I64V_1(24)));
+ VERIFY_L_LL(WASM_I64_ROR(WASM_GET_LOCAL(0), WASM_I64V_1(24)));
+ VERIFY_L_LL(WASM_I64_ROL(WASM_GET_LOCAL(0), WASM_I64V_1(24)));
- VERIFY_L_LL(WASM_I64_ADD(WASM_GET_LOCAL(0), WASM_I64(12)));
- VERIFY_L_LL(WASM_I64_SUB(WASM_GET_LOCAL(0), WASM_I64(13)));
- VERIFY_L_LL(WASM_I64_MUL(WASM_GET_LOCAL(0), WASM_I64(14)));
- VERIFY_L_LL(WASM_I64_DIVS(WASM_GET_LOCAL(0), WASM_I64(15)));
- VERIFY_L_LL(WASM_I64_DIVU(WASM_GET_LOCAL(0), WASM_I64(16)));
- VERIFY_L_LL(WASM_I64_REMS(WASM_GET_LOCAL(0), WASM_I64(17)));
- VERIFY_L_LL(WASM_I64_REMU(WASM_GET_LOCAL(0), WASM_I64(18)));
- VERIFY_L_LL(WASM_I64_AND(WASM_GET_LOCAL(0), WASM_I64(19)));
- VERIFY_L_LL(WASM_I64_IOR(WASM_GET_LOCAL(0), WASM_I64(20)));
- VERIFY_L_LL(WASM_I64_XOR(WASM_GET_LOCAL(0), WASM_I64(21)));
+ VERIFY_I_LL(WASM_I64_LTS(WASM_GET_LOCAL(0), WASM_I64V_1(26)));
+ VERIFY_I_LL(WASM_I64_LES(WASM_GET_LOCAL(0), WASM_I64V_1(27)));
+ VERIFY_I_LL(WASM_I64_LTU(WASM_GET_LOCAL(0), WASM_I64V_1(28)));
+ VERIFY_I_LL(WASM_I64_LEU(WASM_GET_LOCAL(0), WASM_I64V_1(29)));
- VERIFY_L_LL(WASM_I64_SHL(WASM_GET_LOCAL(0), WASM_I64(22)));
- VERIFY_L_LL(WASM_I64_SHR(WASM_GET_LOCAL(0), WASM_I64(23)));
- VERIFY_L_LL(WASM_I64_SAR(WASM_GET_LOCAL(0), WASM_I64(24)));
+ VERIFY_I_LL(WASM_I64_GTS(WASM_GET_LOCAL(0), WASM_I64V_1(26)));
+ VERIFY_I_LL(WASM_I64_GES(WASM_GET_LOCAL(0), WASM_I64V_1(27)));
+ VERIFY_I_LL(WASM_I64_GTU(WASM_GET_LOCAL(0), WASM_I64V_1(28)));
+ VERIFY_I_LL(WASM_I64_GEU(WASM_GET_LOCAL(0), WASM_I64V_1(29)));
- VERIFY_I_LL(WASM_I64_LTS(WASM_GET_LOCAL(0), WASM_I64(26)));
- VERIFY_I_LL(WASM_I64_LES(WASM_GET_LOCAL(0), WASM_I64(27)));
- VERIFY_I_LL(WASM_I64_LTU(WASM_GET_LOCAL(0), WASM_I64(28)));
- VERIFY_I_LL(WASM_I64_LEU(WASM_GET_LOCAL(0), WASM_I64(29)));
-
- VERIFY_I_LL(WASM_I64_GTS(WASM_GET_LOCAL(0), WASM_I64(26)));
- VERIFY_I_LL(WASM_I64_GES(WASM_GET_LOCAL(0), WASM_I64(27)));
- VERIFY_I_LL(WASM_I64_GTU(WASM_GET_LOCAL(0), WASM_I64(28)));
- VERIFY_I_LL(WASM_I64_GEU(WASM_GET_LOCAL(0), WASM_I64(29)));
-
- VERIFY_I_LL(WASM_I64_EQ(WASM_GET_LOCAL(0), WASM_I64(25)));
- VERIFY_I_LL(WASM_I64_NE(WASM_GET_LOCAL(0), WASM_I64(25)));
+ VERIFY_I_LL(WASM_I64_EQ(WASM_GET_LOCAL(0), WASM_I64V_1(25)));
+ VERIFY_I_LL(WASM_I64_NE(WASM_GET_LOCAL(0), WASM_I64V_1(25)));
}
-
-TEST_F(WasmDecoderTest, AllSimpleExpressions) {
+TEST_F(AstDecoderTest, AllSimpleExpressions) {
// Test all simple expressions which are described by a signature.
#define DECODE_TEST(name, opcode, sig) \
{ \
@@ -1021,86 +880,55 @@
#undef DECODE_TEST
}
-
-TEST_F(WasmDecoderTest, MemorySize) {
+TEST_F(AstDecoderTest, MemorySize) {
byte code[] = {kExprMemorySize};
- EXPECT_VERIFIES(&env_i_i, code);
- EXPECT_FAILURE(&env_f_ff, code);
+ EXPECT_VERIFIES(sigs.i_i(), code);
+ EXPECT_FAILURE(sigs.f_ff(), code);
}
-
-TEST_F(WasmDecoderTest, GrowMemory) {
+TEST_F(AstDecoderTest, GrowMemory) {
byte code[] = {kExprGrowMemory, kExprGetLocal, 0};
- EXPECT_VERIFIES(&env_i_i, code);
- EXPECT_FAILURE(&env_i_d, code);
+ EXPECT_VERIFIES(sigs.i_i(), code);
+ EXPECT_FAILURE(sigs.i_d(), code);
}
-
-TEST_F(WasmDecoderTest, LoadMemOffset) {
+TEST_F(AstDecoderTest, LoadMemOffset) {
for (int offset = 0; offset < 128; offset += 7) {
- byte code[] = {kExprI32LoadMem, WasmOpcodes::LoadStoreAccessOf(true),
- static_cast<byte>(offset), kExprI8Const, 0};
- EXPECT_VERIFIES(&env_i_i, code);
+ byte code[] = {kExprI32LoadMem, ZERO_ALIGNMENT, static_cast<byte>(offset),
+ kExprI8Const, 0};
+ EXPECT_VERIFIES(sigs.i_i(), code);
}
}
-
-TEST_F(WasmDecoderTest, StoreMemOffset) {
+TEST_F(AstDecoderTest, StoreMemOffset) {
for (int offset = 0; offset < 128; offset += 7) {
- byte code[] = {kExprI32StoreMem,
- WasmOpcodes::LoadStoreAccessOf(true),
- static_cast<byte>(offset),
- kExprI8Const,
- 0,
- kExprI8Const,
- 0};
- EXPECT_VERIFIES(&env_i_i, code);
+ byte code[] = {
+ kExprI32StoreMem, 0, static_cast<byte>(offset), kExprI8Const, 0,
+ kExprI8Const, 0};
+ EXPECT_VERIFIES(sigs.i_i(), code);
}
}
+TEST_F(AstDecoderTest, LoadMemOffset_varint) {
+ byte code1[] = {kExprI32LoadMem, ZERO_ALIGNMENT, ZERO_OFFSET, kExprI8Const,
+ 0};
+ byte code2[] = {kExprI32LoadMem, ZERO_ALIGNMENT, 0x80, 1, kExprI8Const, 0};
+ byte code3[] = {
+ kExprI32LoadMem, ZERO_ALIGNMENT, 0x81, 0x82, 5, kExprI8Const, 0};
+ byte code4[] = {
+ kExprI32LoadMem, ZERO_ALIGNMENT, 0x83, 0x84, 0x85, 7, kExprI8Const, 0};
-TEST_F(WasmDecoderTest, LoadMemOffset_varint) {
- byte code1[] = {kExprI32LoadMem, WasmOpcodes::LoadStoreAccessOf(true), 0,
- kExprI8Const, 0};
- byte code2[] = {kExprI32LoadMem,
- WasmOpcodes::LoadStoreAccessOf(true),
- 0x80,
- 1,
- kExprI8Const,
- 0};
- byte code3[] = {kExprI32LoadMem,
- WasmOpcodes::LoadStoreAccessOf(true),
- 0x81,
- 0x82,
- 5,
- kExprI8Const,
- 0};
- byte code4[] = {kExprI32LoadMem,
- WasmOpcodes::LoadStoreAccessOf(true),
- 0x83,
- 0x84,
- 0x85,
- 7,
- kExprI8Const,
- 0};
-
- EXPECT_VERIFIES(&env_i_i, code1);
- EXPECT_VERIFIES(&env_i_i, code2);
- EXPECT_VERIFIES(&env_i_i, code3);
- EXPECT_VERIFIES(&env_i_i, code4);
+ EXPECT_VERIFIES(sigs.i_i(), code1);
+ EXPECT_VERIFIES(sigs.i_i(), code2);
+ EXPECT_VERIFIES(sigs.i_i(), code3);
+ EXPECT_VERIFIES(sigs.i_i(), code4);
}
-
-TEST_F(WasmDecoderTest, StoreMemOffset_varint) {
- byte code1[] = {kExprI32StoreMem,
- WasmOpcodes::LoadStoreAccessOf(true),
- 0,
- kExprI8Const,
- 0,
- kExprI8Const,
- 0};
+TEST_F(AstDecoderTest, StoreMemOffset_varint) {
+ byte code1[] = {
+ kExprI32StoreMem, ZERO_ALIGNMENT, 0, kExprI8Const, 0, kExprI8Const, 0};
byte code2[] = {kExprI32StoreMem,
- WasmOpcodes::LoadStoreAccessOf(true),
+ ZERO_ALIGNMENT,
0x80,
1,
kExprI8Const,
@@ -1108,7 +936,7 @@
kExprI8Const,
0};
byte code3[] = {kExprI32StoreMem,
- WasmOpcodes::LoadStoreAccessOf(true),
+ ZERO_ALIGNMENT,
0x81,
0x82,
5,
@@ -1117,7 +945,7 @@
kExprI8Const,
0};
byte code4[] = {kExprI32StoreMem,
- WasmOpcodes::LoadStoreAccessOf(true),
+ ZERO_ALIGNMENT,
0x83,
0x84,
0x85,
@@ -1127,53 +955,48 @@
kExprI8Const,
0};
- EXPECT_VERIFIES(&env_i_i, code1);
- EXPECT_VERIFIES(&env_i_i, code2);
- EXPECT_VERIFIES(&env_i_i, code3);
- EXPECT_VERIFIES(&env_i_i, code4);
+ EXPECT_VERIFIES(sigs.i_i(), code1);
+ EXPECT_VERIFIES(sigs.i_i(), code2);
+ EXPECT_VERIFIES(sigs.i_i(), code3);
+ EXPECT_VERIFIES(sigs.i_i(), code4);
}
-
-TEST_F(WasmDecoderTest, AllLoadMemCombinations) {
+TEST_F(AstDecoderTest, AllLoadMemCombinations) {
for (size_t i = 0; i < arraysize(kLocalTypes); i++) {
LocalType local_type = kLocalTypes[i];
for (size_t j = 0; j < arraysize(machineTypes); j++) {
MachineType mem_type = machineTypes[j];
byte code[] = {
static_cast<byte>(WasmOpcodes::LoadStoreOpcodeOf(mem_type, false)),
- WasmOpcodes::LoadStoreAccessOf(false), kExprI8Const, 0};
- FunctionEnv env;
+ ZERO_ALIGNMENT, ZERO_OFFSET, kExprI8Const, 0};
FunctionSig sig(1, 0, &local_type);
- init_env(&env, &sig);
if (local_type == WasmOpcodes::LocalTypeFor(mem_type)) {
- EXPECT_VERIFIES(&env, code);
+ EXPECT_VERIFIES(&sig, code);
} else {
- EXPECT_FAILURE(&env, code);
+ EXPECT_FAILURE(&sig, code);
}
}
}
}
-
-TEST_F(WasmDecoderTest, AllStoreMemCombinations) {
+TEST_F(AstDecoderTest, AllStoreMemCombinations) {
for (size_t i = 0; i < arraysize(kLocalTypes); i++) {
LocalType local_type = kLocalTypes[i];
for (size_t j = 0; j < arraysize(machineTypes); j++) {
MachineType mem_type = machineTypes[j];
byte code[] = {
static_cast<byte>(WasmOpcodes::LoadStoreOpcodeOf(mem_type, true)),
- WasmOpcodes::LoadStoreAccessOf(false),
+ ZERO_ALIGNMENT,
+ ZERO_OFFSET,
kExprI8Const,
0,
kExprGetLocal,
0};
- FunctionEnv env;
FunctionSig sig(0, 1, &local_type);
- init_env(&env, &sig);
if (local_type == WasmOpcodes::LocalTypeFor(mem_type)) {
- EXPECT_VERIFIES(&env, code);
+ EXPECT_VERIFIES(&sig, code);
} else {
- EXPECT_FAILURE(&env, code);
+ EXPECT_FAILURE(&sig, code);
}
}
}
@@ -1189,30 +1012,26 @@
instance = nullptr;
module = &mod;
linker = nullptr;
- mod.globals = new std::vector<WasmGlobal>;
- mod.signatures = new std::vector<FunctionSig*>;
- mod.functions = new std::vector<WasmFunction>;
- mod.import_table = new std::vector<WasmImport>;
}
byte AddGlobal(MachineType mem_type) {
- mod.globals->push_back({0, mem_type, 0, false});
- CHECK(mod.globals->size() <= 127);
- return static_cast<byte>(mod.globals->size() - 1);
+ mod.globals.push_back({0, 0, mem_type, 0, false});
+ CHECK(mod.globals.size() <= 127);
+ return static_cast<byte>(mod.globals.size() - 1);
}
byte AddSignature(FunctionSig* sig) {
- mod.signatures->push_back(sig);
- CHECK(mod.signatures->size() <= 127);
- return static_cast<byte>(mod.signatures->size() - 1);
+ mod.signatures.push_back(sig);
+ CHECK(mod.signatures.size() <= 127);
+ return static_cast<byte>(mod.signatures.size() - 1);
}
byte AddFunction(FunctionSig* sig) {
- mod.functions->push_back({sig, 0, 0, 0, 0, 0, 0, 0, false, false});
- CHECK(mod.functions->size() <= 127);
- return static_cast<byte>(mod.functions->size() - 1);
+ mod.functions.push_back({sig, 0, 0, 0, 0, 0, 0, 0, false, false});
+ CHECK(mod.functions.size() <= 127);
+ return static_cast<byte>(mod.functions.size() - 1);
}
byte AddImport(FunctionSig* sig) {
- mod.import_table->push_back({sig, 0, 0});
- CHECK(mod.import_table->size() <= 127);
- return static_cast<byte>(mod.import_table->size() - 1);
+ mod.import_table.push_back({sig, 0, 0});
+ CHECK(mod.import_table.size() <= 127);
+ return static_cast<byte>(mod.import_table.size() - 1);
}
private:
@@ -1220,194 +1039,184 @@
};
} // namespace
-
-TEST_F(WasmDecoderTest, SimpleCalls) {
- FunctionEnv* env = &env_i_i;
+TEST_F(AstDecoderTest, SimpleCalls) {
+ FunctionSig* sig = sigs.i_i();
TestModuleEnv module_env;
- env->module = &module_env;
+ module = &module_env;
module_env.AddFunction(sigs.i_v());
module_env.AddFunction(sigs.i_i());
module_env.AddFunction(sigs.i_ii());
- EXPECT_VERIFIES_INLINE(env, WASM_CALL_FUNCTION(0));
- EXPECT_VERIFIES_INLINE(env, WASM_CALL_FUNCTION(1, WASM_I8(27)));
- EXPECT_VERIFIES_INLINE(env, WASM_CALL_FUNCTION(2, WASM_I8(37), WASM_I8(77)));
+ EXPECT_VERIFIES_INLINE(sig, WASM_CALL_FUNCTION(0));
+ EXPECT_VERIFIES_INLINE(sig, WASM_CALL_FUNCTION(1, WASM_I8(27)));
+ EXPECT_VERIFIES_INLINE(sig, WASM_CALL_FUNCTION(2, WASM_I8(37), WASM_I8(77)));
}
-
-TEST_F(WasmDecoderTest, CallsWithTooFewArguments) {
- FunctionEnv* env = &env_i_i;
+TEST_F(AstDecoderTest, CallsWithTooFewArguments) {
+ FunctionSig* sig = sigs.i_i();
TestModuleEnv module_env;
- env->module = &module_env;
+ module = &module_env;
module_env.AddFunction(sigs.i_i());
module_env.AddFunction(sigs.i_ii());
module_env.AddFunction(sigs.f_ff());
- EXPECT_FAILURE_INLINE(env, WASM_CALL_FUNCTION0(0));
- EXPECT_FAILURE_INLINE(env, WASM_CALL_FUNCTION(1, WASM_ZERO));
- EXPECT_FAILURE_INLINE(env, WASM_CALL_FUNCTION(2, WASM_GET_LOCAL(0)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_FUNCTION0(0));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_FUNCTION(1, WASM_ZERO));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_FUNCTION(2, WASM_GET_LOCAL(0)));
}
-
-TEST_F(WasmDecoderTest, CallsWithSpilloverArgs) {
+TEST_F(AstDecoderTest, CallsWithSpilloverArgs) {
static LocalType a_i_ff[] = {kAstI32, kAstF32, kAstF32};
FunctionSig sig_i_ff(1, 2, a_i_ff);
- FunctionEnv env_i_ff;
- init_env(&env_i_ff, &sig_i_ff);
TestModuleEnv module_env;
- env_i_ff.module = &module_env;
- env_i_i.module = &module_env;
- env_f_ff.module = &module_env;
+ module = &module_env;
module_env.AddFunction(&sig_i_ff);
- EXPECT_VERIFIES_INLINE(&env_i_i,
+ EXPECT_VERIFIES_INLINE(sigs.i_i(),
WASM_CALL_FUNCTION(0, WASM_F32(0.1), WASM_F32(0.1)));
- EXPECT_VERIFIES_INLINE(&env_i_ff,
+ EXPECT_VERIFIES_INLINE(sigs.i_ff(),
WASM_CALL_FUNCTION(0, WASM_F32(0.1), WASM_F32(0.1)));
- EXPECT_FAILURE_INLINE(&env_f_ff,
+ EXPECT_FAILURE_INLINE(sigs.f_ff(),
WASM_CALL_FUNCTION(0, WASM_F32(0.1), WASM_F32(0.1)));
EXPECT_FAILURE_INLINE(
- &env_i_i,
+ sigs.i_i(),
WASM_CALL_FUNCTION(0, WASM_F32(0.1), WASM_F32(0.1), WASM_F32(0.2)));
EXPECT_VERIFIES_INLINE(
- &env_f_ff,
+ sigs.f_ff(),
WASM_CALL_FUNCTION(0, WASM_F32(0.1), WASM_F32(0.1), WASM_F32(11)));
}
-
-TEST_F(WasmDecoderTest, CallsWithMismatchedSigs2) {
- FunctionEnv* env = &env_i_i;
+TEST_F(AstDecoderTest, CallsWithMismatchedSigs2) {
+ FunctionSig* sig = sigs.i_i();
TestModuleEnv module_env;
- env->module = &module_env;
+ module = &module_env;
module_env.AddFunction(sigs.i_i());
- EXPECT_FAILURE_INLINE(env, WASM_CALL_FUNCTION(0, WASM_I64(17)));
- EXPECT_FAILURE_INLINE(env, WASM_CALL_FUNCTION(0, WASM_F32(17.1)));
- EXPECT_FAILURE_INLINE(env, WASM_CALL_FUNCTION(0, WASM_F64(17.1)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_FUNCTION(0, WASM_I64V_1(17)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_FUNCTION(0, WASM_F32(17.1)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_FUNCTION(0, WASM_F64(17.1)));
}
-
-TEST_F(WasmDecoderTest, CallsWithMismatchedSigs3) {
- FunctionEnv* env = &env_i_i;
+TEST_F(AstDecoderTest, CallsWithMismatchedSigs3) {
+ FunctionSig* sig = sigs.i_i();
TestModuleEnv module_env;
- env->module = &module_env;
+ module = &module_env;
module_env.AddFunction(sigs.i_f());
- EXPECT_FAILURE_INLINE(env, WASM_CALL_FUNCTION(0, WASM_I8(17)));
- EXPECT_FAILURE_INLINE(env, WASM_CALL_FUNCTION(0, WASM_I64(27)));
- EXPECT_FAILURE_INLINE(env, WASM_CALL_FUNCTION(0, WASM_F64(37.2)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_FUNCTION(0, WASM_I8(17)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_FUNCTION(0, WASM_I64V_1(27)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_FUNCTION(0, WASM_F64(37.2)));
module_env.AddFunction(sigs.i_d());
- EXPECT_FAILURE_INLINE(env, WASM_CALL_FUNCTION(1, WASM_I8(16)));
- EXPECT_FAILURE_INLINE(env, WASM_CALL_FUNCTION(1, WASM_I64(16)));
- EXPECT_FAILURE_INLINE(env, WASM_CALL_FUNCTION(1, WASM_F32(17.6)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_FUNCTION(1, WASM_I8(16)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_FUNCTION(1, WASM_I64V_1(16)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_FUNCTION(1, WASM_F32(17.6)));
}
-
-TEST_F(WasmDecoderTest, SimpleIndirectCalls) {
- FunctionEnv* env = &env_i_i;
+TEST_F(AstDecoderTest, SimpleIndirectCalls) {
+ FunctionSig* sig = sigs.i_i();
TestModuleEnv module_env;
- env->module = &module_env;
+ module = &module_env;
byte f0 = module_env.AddSignature(sigs.i_v());
byte f1 = module_env.AddSignature(sigs.i_i());
byte f2 = module_env.AddSignature(sigs.i_ii());
- EXPECT_VERIFIES_INLINE(env, WASM_CALL_INDIRECT0(f0, WASM_ZERO));
- EXPECT_VERIFIES_INLINE(env, WASM_CALL_INDIRECT(f1, WASM_ZERO, WASM_I8(22)));
+ EXPECT_VERIFIES_INLINE(sig, WASM_CALL_INDIRECT0(f0, WASM_ZERO));
+ EXPECT_VERIFIES_INLINE(sig, WASM_CALL_INDIRECT(f1, WASM_ZERO, WASM_I8(22)));
EXPECT_VERIFIES_INLINE(
- env, WASM_CALL_INDIRECT(f2, WASM_ZERO, WASM_I8(32), WASM_I8(72)));
+ sig, WASM_CALL_INDIRECT(f2, WASM_ZERO, WASM_I8(32), WASM_I8(72)));
}
-
-TEST_F(WasmDecoderTest, IndirectCallsOutOfBounds) {
- FunctionEnv* env = &env_i_i;
+TEST_F(AstDecoderTest, IndirectCallsOutOfBounds) {
+ FunctionSig* sig = sigs.i_i();
TestModuleEnv module_env;
- env->module = &module_env;
+ module = &module_env;
- EXPECT_FAILURE_INLINE(env, WASM_CALL_INDIRECT0(0, WASM_ZERO));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_INDIRECT0(0, WASM_ZERO));
module_env.AddSignature(sigs.i_v());
- EXPECT_VERIFIES_INLINE(env, WASM_CALL_INDIRECT0(0, WASM_ZERO));
+ EXPECT_VERIFIES_INLINE(sig, WASM_CALL_INDIRECT0(0, WASM_ZERO));
- EXPECT_FAILURE_INLINE(env, WASM_CALL_INDIRECT(1, WASM_ZERO, WASM_I8(22)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_INDIRECT(1, WASM_ZERO, WASM_I8(22)));
module_env.AddSignature(sigs.i_i());
- EXPECT_VERIFIES_INLINE(env, WASM_CALL_INDIRECT(1, WASM_ZERO, WASM_I8(27)));
+ EXPECT_VERIFIES_INLINE(sig, WASM_CALL_INDIRECT(1, WASM_ZERO, WASM_I8(27)));
- EXPECT_FAILURE_INLINE(env, WASM_CALL_INDIRECT(2, WASM_ZERO, WASM_I8(27)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_INDIRECT(2, WASM_ZERO, WASM_I8(27)));
}
-
-TEST_F(WasmDecoderTest, IndirectCallsWithMismatchedSigs3) {
- FunctionEnv* env = &env_i_i;
+TEST_F(AstDecoderTest, IndirectCallsWithMismatchedSigs3) {
+ FunctionSig* sig = sigs.i_i();
TestModuleEnv module_env;
- env->module = &module_env;
+ module = &module_env;
byte f0 = module_env.AddFunction(sigs.i_f());
- EXPECT_FAILURE_INLINE(env, WASM_CALL_INDIRECT(f0, WASM_ZERO, WASM_I8(17)));
- EXPECT_FAILURE_INLINE(env, WASM_CALL_INDIRECT(f0, WASM_ZERO, WASM_I64(27)));
- EXPECT_FAILURE_INLINE(env, WASM_CALL_INDIRECT(f0, WASM_ZERO, WASM_F64(37.2)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_INDIRECT(f0, WASM_ZERO, WASM_I8(17)));
+ EXPECT_FAILURE_INLINE(sig,
+ WASM_CALL_INDIRECT(f0, WASM_ZERO, WASM_I64V_1(27)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_INDIRECT(f0, WASM_ZERO, WASM_F64(37.2)));
- EXPECT_FAILURE_INLINE(env, WASM_CALL_INDIRECT0(f0, WASM_I8(17)));
- EXPECT_FAILURE_INLINE(env, WASM_CALL_INDIRECT0(f0, WASM_I64(27)));
- EXPECT_FAILURE_INLINE(env, WASM_CALL_INDIRECT0(f0, WASM_F64(37.2)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_INDIRECT0(f0, WASM_I8(17)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_INDIRECT0(f0, WASM_I64V_1(27)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_INDIRECT0(f0, WASM_F64(37.2)));
byte f1 = module_env.AddFunction(sigs.i_d());
- EXPECT_FAILURE_INLINE(env, WASM_CALL_INDIRECT(f1, WASM_ZERO, WASM_I8(16)));
- EXPECT_FAILURE_INLINE(env, WASM_CALL_INDIRECT(f1, WASM_ZERO, WASM_I64(16)));
- EXPECT_FAILURE_INLINE(env, WASM_CALL_INDIRECT(f1, WASM_ZERO, WASM_F32(17.6)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_INDIRECT(f1, WASM_ZERO, WASM_I8(16)));
+ EXPECT_FAILURE_INLINE(sig,
+ WASM_CALL_INDIRECT(f1, WASM_ZERO, WASM_I64V_1(16)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_INDIRECT(f1, WASM_ZERO, WASM_F32(17.6)));
}
-TEST_F(WasmDecoderTest, SimpleImportCalls) {
- FunctionEnv* env = &env_i_i;
+TEST_F(AstDecoderTest, SimpleImportCalls) {
+ FunctionSig* sig = sigs.i_i();
TestModuleEnv module_env;
- env->module = &module_env;
+ module = &module_env;
byte f0 = module_env.AddImport(sigs.i_v());
byte f1 = module_env.AddImport(sigs.i_i());
byte f2 = module_env.AddImport(sigs.i_ii());
- EXPECT_VERIFIES_INLINE(env, WASM_CALL_IMPORT0(f0));
- EXPECT_VERIFIES_INLINE(env, WASM_CALL_IMPORT(f1, WASM_I8(22)));
- EXPECT_VERIFIES_INLINE(env, WASM_CALL_IMPORT(f2, WASM_I8(32), WASM_I8(72)));
+ EXPECT_VERIFIES_INLINE(sig, WASM_CALL_IMPORT0(f0));
+ EXPECT_VERIFIES_INLINE(sig, WASM_CALL_IMPORT(f1, WASM_I8(22)));
+ EXPECT_VERIFIES_INLINE(sig, WASM_CALL_IMPORT(f2, WASM_I8(32), WASM_I8(72)));
}
-TEST_F(WasmDecoderTest, ImportCallsWithMismatchedSigs3) {
- FunctionEnv* env = &env_i_i;
+TEST_F(AstDecoderTest, ImportCallsWithMismatchedSigs3) {
+ FunctionSig* sig = sigs.i_i();
TestModuleEnv module_env;
- env->module = &module_env;
+ module = &module_env;
byte f0 = module_env.AddImport(sigs.i_f());
- EXPECT_FAILURE_INLINE(env, WASM_CALL_IMPORT0(f0));
- EXPECT_FAILURE_INLINE(env, WASM_CALL_IMPORT(f0, WASM_I8(17)));
- EXPECT_FAILURE_INLINE(env, WASM_CALL_IMPORT(f0, WASM_I64(27)));
- EXPECT_FAILURE_INLINE(env, WASM_CALL_IMPORT(f0, WASM_F64(37.2)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_IMPORT0(f0));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_IMPORT(f0, WASM_I8(17)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_IMPORT(f0, WASM_I64V_1(27)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_IMPORT(f0, WASM_F64(37.2)));
byte f1 = module_env.AddImport(sigs.i_d());
- EXPECT_FAILURE_INLINE(env, WASM_CALL_IMPORT0(f1));
- EXPECT_FAILURE_INLINE(env, WASM_CALL_IMPORT(f1, WASM_I8(16)));
- EXPECT_FAILURE_INLINE(env, WASM_CALL_IMPORT(f1, WASM_I64(16)));
- EXPECT_FAILURE_INLINE(env, WASM_CALL_IMPORT(f1, WASM_F32(17.6)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_IMPORT0(f1));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_IMPORT(f1, WASM_I8(16)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_IMPORT(f1, WASM_I64V_1(16)));
+ EXPECT_FAILURE_INLINE(sig, WASM_CALL_IMPORT(f1, WASM_F32(17.6)));
}
-TEST_F(WasmDecoderTest, Int32Globals) {
- FunctionEnv* env = &env_i_i;
+TEST_F(AstDecoderTest, Int32Globals) {
+ FunctionSig* sig = sigs.i_i();
TestModuleEnv module_env;
- env->module = &module_env;
+ module = &module_env;
module_env.AddGlobal(MachineType::Int8());
module_env.AddGlobal(MachineType::Uint8());
@@ -1416,131 +1225,116 @@
module_env.AddGlobal(MachineType::Int32());
module_env.AddGlobal(MachineType::Uint32());
- EXPECT_VERIFIES_INLINE(env, WASM_LOAD_GLOBAL(0));
- EXPECT_VERIFIES_INLINE(env, WASM_LOAD_GLOBAL(1));
- EXPECT_VERIFIES_INLINE(env, WASM_LOAD_GLOBAL(2));
- EXPECT_VERIFIES_INLINE(env, WASM_LOAD_GLOBAL(3));
- EXPECT_VERIFIES_INLINE(env, WASM_LOAD_GLOBAL(4));
- EXPECT_VERIFIES_INLINE(env, WASM_LOAD_GLOBAL(5));
+ EXPECT_VERIFIES_INLINE(sig, WASM_LOAD_GLOBAL(0));
+ EXPECT_VERIFIES_INLINE(sig, WASM_LOAD_GLOBAL(1));
+ EXPECT_VERIFIES_INLINE(sig, WASM_LOAD_GLOBAL(2));
+ EXPECT_VERIFIES_INLINE(sig, WASM_LOAD_GLOBAL(3));
+ EXPECT_VERIFIES_INLINE(sig, WASM_LOAD_GLOBAL(4));
+ EXPECT_VERIFIES_INLINE(sig, WASM_LOAD_GLOBAL(5));
- EXPECT_VERIFIES_INLINE(env, WASM_STORE_GLOBAL(0, WASM_GET_LOCAL(0)));
- EXPECT_VERIFIES_INLINE(env, WASM_STORE_GLOBAL(1, WASM_GET_LOCAL(0)));
- EXPECT_VERIFIES_INLINE(env, WASM_STORE_GLOBAL(2, WASM_GET_LOCAL(0)));
- EXPECT_VERIFIES_INLINE(env, WASM_STORE_GLOBAL(3, WASM_GET_LOCAL(0)));
- EXPECT_VERIFIES_INLINE(env, WASM_STORE_GLOBAL(4, WASM_GET_LOCAL(0)));
- EXPECT_VERIFIES_INLINE(env, WASM_STORE_GLOBAL(5, WASM_GET_LOCAL(0)));
+ EXPECT_VERIFIES_INLINE(sig, WASM_STORE_GLOBAL(0, WASM_GET_LOCAL(0)));
+ EXPECT_VERIFIES_INLINE(sig, WASM_STORE_GLOBAL(1, WASM_GET_LOCAL(0)));
+ EXPECT_VERIFIES_INLINE(sig, WASM_STORE_GLOBAL(2, WASM_GET_LOCAL(0)));
+ EXPECT_VERIFIES_INLINE(sig, WASM_STORE_GLOBAL(3, WASM_GET_LOCAL(0)));
+ EXPECT_VERIFIES_INLINE(sig, WASM_STORE_GLOBAL(4, WASM_GET_LOCAL(0)));
+ EXPECT_VERIFIES_INLINE(sig, WASM_STORE_GLOBAL(5, WASM_GET_LOCAL(0)));
}
-
-TEST_F(WasmDecoderTest, Int32Globals_fail) {
- FunctionEnv* env = &env_i_i;
+TEST_F(AstDecoderTest, Int32Globals_fail) {
+ FunctionSig* sig = sigs.i_i();
TestModuleEnv module_env;
- env->module = &module_env;
+ module = &module_env;
module_env.AddGlobal(MachineType::Int64());
module_env.AddGlobal(MachineType::Uint64());
module_env.AddGlobal(MachineType::Float32());
module_env.AddGlobal(MachineType::Float64());
- EXPECT_FAILURE_INLINE(env, WASM_LOAD_GLOBAL(0));
- EXPECT_FAILURE_INLINE(env, WASM_LOAD_GLOBAL(1));
- EXPECT_FAILURE_INLINE(env, WASM_LOAD_GLOBAL(2));
- EXPECT_FAILURE_INLINE(env, WASM_LOAD_GLOBAL(3));
+ EXPECT_FAILURE_INLINE(sig, WASM_LOAD_GLOBAL(0));
+ EXPECT_FAILURE_INLINE(sig, WASM_LOAD_GLOBAL(1));
+ EXPECT_FAILURE_INLINE(sig, WASM_LOAD_GLOBAL(2));
+ EXPECT_FAILURE_INLINE(sig, WASM_LOAD_GLOBAL(3));
- EXPECT_FAILURE_INLINE(env, WASM_STORE_GLOBAL(0, WASM_GET_LOCAL(0)));
- EXPECT_FAILURE_INLINE(env, WASM_STORE_GLOBAL(1, WASM_GET_LOCAL(0)));
- EXPECT_FAILURE_INLINE(env, WASM_STORE_GLOBAL(2, WASM_GET_LOCAL(0)));
- EXPECT_FAILURE_INLINE(env, WASM_STORE_GLOBAL(3, WASM_GET_LOCAL(0)));
+ EXPECT_FAILURE_INLINE(sig, WASM_STORE_GLOBAL(0, WASM_GET_LOCAL(0)));
+ EXPECT_FAILURE_INLINE(sig, WASM_STORE_GLOBAL(1, WASM_GET_LOCAL(0)));
+ EXPECT_FAILURE_INLINE(sig, WASM_STORE_GLOBAL(2, WASM_GET_LOCAL(0)));
+ EXPECT_FAILURE_INLINE(sig, WASM_STORE_GLOBAL(3, WASM_GET_LOCAL(0)));
}
-
-TEST_F(WasmDecoderTest, Int64Globals) {
- FunctionEnv* env = &env_l_l;
+TEST_F(AstDecoderTest, Int64Globals) {
+ FunctionSig* sig = sigs.l_l();
TestModuleEnv module_env;
- env->module = &module_env;
+ module = &module_env;
module_env.AddGlobal(MachineType::Int64());
module_env.AddGlobal(MachineType::Uint64());
- EXPECT_VERIFIES_INLINE(env, WASM_LOAD_GLOBAL(0));
- EXPECT_VERIFIES_INLINE(env, WASM_LOAD_GLOBAL(1));
+ EXPECT_VERIFIES_INLINE(sig, WASM_LOAD_GLOBAL(0));
+ EXPECT_VERIFIES_INLINE(sig, WASM_LOAD_GLOBAL(1));
- EXPECT_VERIFIES_INLINE(env, WASM_STORE_GLOBAL(0, WASM_GET_LOCAL(0)));
- EXPECT_VERIFIES_INLINE(env, WASM_STORE_GLOBAL(1, WASM_GET_LOCAL(0)));
+ EXPECT_VERIFIES_INLINE(sig, WASM_STORE_GLOBAL(0, WASM_GET_LOCAL(0)));
+ EXPECT_VERIFIES_INLINE(sig, WASM_STORE_GLOBAL(1, WASM_GET_LOCAL(0)));
}
-
-TEST_F(WasmDecoderTest, Float32Globals) {
- FunctionEnv env_f_ff;
- FunctionEnv* env = &env_f_ff;
- init_env(env, sigs.f_ff());
+TEST_F(AstDecoderTest, Float32Globals) {
+ FunctionSig* sig = sigs.f_ff();
TestModuleEnv module_env;
- env->module = &module_env;
+ module = &module_env;
module_env.AddGlobal(MachineType::Float32());
- EXPECT_VERIFIES_INLINE(env, WASM_LOAD_GLOBAL(0));
- EXPECT_VERIFIES_INLINE(env, WASM_STORE_GLOBAL(0, WASM_GET_LOCAL(0)));
+ EXPECT_VERIFIES_INLINE(sig, WASM_LOAD_GLOBAL(0));
+ EXPECT_VERIFIES_INLINE(sig, WASM_STORE_GLOBAL(0, WASM_GET_LOCAL(0)));
}
-
-TEST_F(WasmDecoderTest, Float64Globals) {
- FunctionEnv env_d_dd;
- FunctionEnv* env = &env_d_dd;
- init_env(env, sigs.d_dd());
+TEST_F(AstDecoderTest, Float64Globals) {
+ FunctionSig* sig = sigs.d_dd();
TestModuleEnv module_env;
- env->module = &module_env;
+ module = &module_env;
module_env.AddGlobal(MachineType::Float64());
- EXPECT_VERIFIES_INLINE(env, WASM_LOAD_GLOBAL(0));
- EXPECT_VERIFIES_INLINE(env, WASM_STORE_GLOBAL(0, WASM_GET_LOCAL(0)));
+ EXPECT_VERIFIES_INLINE(sig, WASM_LOAD_GLOBAL(0));
+ EXPECT_VERIFIES_INLINE(sig, WASM_STORE_GLOBAL(0, WASM_GET_LOCAL(0)));
}
-
-TEST_F(WasmDecoderTest, AllLoadGlobalCombinations) {
+TEST_F(AstDecoderTest, AllLoadGlobalCombinations) {
for (size_t i = 0; i < arraysize(kLocalTypes); i++) {
LocalType local_type = kLocalTypes[i];
for (size_t j = 0; j < arraysize(machineTypes); j++) {
MachineType mem_type = machineTypes[j];
- FunctionEnv env;
FunctionSig sig(1, 0, &local_type);
TestModuleEnv module_env;
- init_env(&env, &sig);
- env.module = &module_env;
+ module = &module_env;
module_env.AddGlobal(mem_type);
if (local_type == WasmOpcodes::LocalTypeFor(mem_type)) {
- EXPECT_VERIFIES_INLINE(&env, WASM_LOAD_GLOBAL(0));
+ EXPECT_VERIFIES_INLINE(&sig, WASM_LOAD_GLOBAL(0));
} else {
- EXPECT_FAILURE_INLINE(&env, WASM_LOAD_GLOBAL(0));
+ EXPECT_FAILURE_INLINE(&sig, WASM_LOAD_GLOBAL(0));
}
}
}
}
-
-TEST_F(WasmDecoderTest, AllStoreGlobalCombinations) {
+TEST_F(AstDecoderTest, AllStoreGlobalCombinations) {
for (size_t i = 0; i < arraysize(kLocalTypes); i++) {
LocalType local_type = kLocalTypes[i];
for (size_t j = 0; j < arraysize(machineTypes); j++) {
MachineType mem_type = machineTypes[j];
- FunctionEnv env;
FunctionSig sig(0, 1, &local_type);
TestModuleEnv module_env;
- init_env(&env, &sig);
- env.module = &module_env;
+ module = &module_env;
module_env.AddGlobal(mem_type);
if (local_type == WasmOpcodes::LocalTypeFor(mem_type)) {
- EXPECT_VERIFIES_INLINE(&env, WASM_STORE_GLOBAL(0, WASM_GET_LOCAL(0)));
+ EXPECT_VERIFIES_INLINE(&sig, WASM_STORE_GLOBAL(0, WASM_GET_LOCAL(0)));
} else {
- EXPECT_FAILURE_INLINE(&env, WASM_STORE_GLOBAL(0, WASM_GET_LOCAL(0)));
+ EXPECT_FAILURE_INLINE(&sig, WASM_STORE_GLOBAL(0, WASM_GET_LOCAL(0)));
}
}
}
}
-
-TEST_F(WasmDecoderTest, BreakNesting1) {
+TEST_F(AstDecoderTest, BreakNesting1) {
for (int i = 0; i < 5; i++) {
// (block[2] (loop[2] (if (get p) break[N]) (set p 1)) p)
byte code[] = {WASM_BLOCK(
@@ -1548,65 +1342,60 @@
WASM_SET_LOCAL(0, WASM_I8(1))),
WASM_GET_LOCAL(0))};
if (i < 3) {
- EXPECT_VERIFIES(&env_i_i, code);
+ EXPECT_VERIFIES(sigs.i_i(), code);
} else {
- EXPECT_FAILURE(&env_i_i, code);
+ EXPECT_FAILURE(sigs.i_i(), code);
}
}
}
-
-TEST_F(WasmDecoderTest, BreakNesting2) {
- env_v_v.AddLocals(kAstI32, 1);
+TEST_F(AstDecoderTest, BreakNesting2) {
+ AddLocals(kAstI32, 1);
for (int i = 0; i < 5; i++) {
- // (block[2] (loop[2] (if (get p) break[N]) (set p 1)) (return p)) (11)
- byte code[] = {
- WASM_BLOCK(1, WASM_LOOP(2, WASM_IF(WASM_GET_LOCAL(0), WASM_BREAK(i)),
- WASM_SET_LOCAL(0, WASM_I8(1)))),
- WASM_I8(11)};
+ // (block[2] (loop[2] (if 0 break[N]) (set p 1)) (return p)) (11)
+ byte code[] = {WASM_BLOCK(1, WASM_LOOP(2, WASM_IF(WASM_ZERO, WASM_BREAK(i)),
+ WASM_SET_LOCAL(0, WASM_I8(1)))),
+ WASM_I8(11)};
if (i < 2) {
- EXPECT_VERIFIES(&env_v_v, code);
+ EXPECT_VERIFIES(sigs.v_v(), code);
} else {
- EXPECT_FAILURE(&env_v_v, code);
+ EXPECT_FAILURE(sigs.v_v(), code);
}
}
}
-
-TEST_F(WasmDecoderTest, BreakNesting3) {
- env_v_v.AddLocals(kAstI32, 1);
+TEST_F(AstDecoderTest, BreakNesting3) {
for (int i = 0; i < 5; i++) {
- // (block[1] (loop[1] (block[1] (if (get p) break[N])
+ // (block[1] (loop[1] (block[1] (if 0 break[N])
byte code[] = {WASM_BLOCK(
- 1, WASM_LOOP(
- 1, WASM_BLOCK(1, WASM_IF(WASM_GET_LOCAL(0), WASM_BREAK(i)))))};
+ 1, WASM_LOOP(1, WASM_BLOCK(1, WASM_IF(WASM_ZERO, WASM_BREAK(i)))))};
if (i < 3) {
- EXPECT_VERIFIES(&env_v_v, code);
+ EXPECT_VERIFIES(sigs.v_v(), code);
} else {
- EXPECT_FAILURE(&env_v_v, code);
+ EXPECT_FAILURE(sigs.v_v(), code);
}
}
}
-
-TEST_F(WasmDecoderTest, BreaksWithMultipleTypes) {
+TEST_F(AstDecoderTest, BreaksWithMultipleTypes) {
EXPECT_FAILURE_INLINE(
- &env_i_i, WASM_BLOCK(2, WASM_BRV_IF_ZERO(0, WASM_I8(7)), WASM_F32(7.7)));
+ sigs.i_i(),
+ WASM_BLOCK(2, WASM_BRV_IF_ZERO(0, WASM_I8(7)), WASM_F32(7.7)));
- EXPECT_FAILURE_INLINE(&env_i_i,
+ EXPECT_FAILURE_INLINE(sigs.i_i(),
WASM_BLOCK(2, WASM_BRV_IF_ZERO(0, WASM_I8(7)),
WASM_BRV_IF_ZERO(0, WASM_F32(7.7))));
- EXPECT_FAILURE_INLINE(&env_i_i,
+ EXPECT_FAILURE_INLINE(sigs.i_i(),
WASM_BLOCK(3, WASM_BRV_IF_ZERO(0, WASM_I8(8)),
WASM_BRV_IF_ZERO(0, WASM_I8(0)),
WASM_BRV_IF_ZERO(0, WASM_F32(7.7))));
- EXPECT_FAILURE_INLINE(&env_i_i, WASM_BLOCK(3, WASM_BRV_IF_ZERO(0, WASM_I8(9)),
- WASM_BRV_IF_ZERO(0, WASM_F32(7.7)),
- WASM_BRV_IF_ZERO(0, WASM_I8(11))));
+ EXPECT_FAILURE_INLINE(sigs.i_i(),
+ WASM_BLOCK(3, WASM_BRV_IF_ZERO(0, WASM_I8(9)),
+ WASM_BRV_IF_ZERO(0, WASM_F32(7.7)),
+ WASM_BRV_IF_ZERO(0, WASM_I8(11))));
}
-
-TEST_F(WasmDecoderTest, BreakNesting_6_levels) {
+TEST_F(AstDecoderTest, BreakNesting_6_levels) {
for (int mask = 0; mask < 64; mask++) {
for (int i = 0; i < 14; i++) {
byte code[] = {
@@ -1629,39 +1418,37 @@
}
if (i < depth) {
- EXPECT_VERIFIES(&env_v_v, code);
+ EXPECT_VERIFIES(sigs.v_v(), code);
} else {
- EXPECT_FAILURE(&env_v_v, code);
+ EXPECT_FAILURE(sigs.v_v(), code);
}
}
}
}
-
-TEST_F(WasmDecoderTest, ExprBreak_TypeCheck) {
- FunctionEnv* envs[] = {&env_i_i, &env_l_l, &env_f_ff, &env_d_dd};
- for (size_t i = 0; i < arraysize(envs); i++) {
- FunctionEnv* env = envs[i];
+TEST_F(AstDecoderTest, ExprBreak_TypeCheck) {
+ FunctionSig* sigarray[] = {sigs.i_i(), sigs.l_l(), sigs.f_ff(), sigs.d_dd()};
+ for (size_t i = 0; i < arraysize(sigarray); i++) {
+ FunctionSig* sig = sigarray[i];
// unify X and X => OK
EXPECT_VERIFIES_INLINE(
- env, WASM_BLOCK(2, WASM_IF(WASM_ZERO, WASM_BRV(0, WASM_GET_LOCAL(0))),
+ sig, WASM_BLOCK(2, WASM_IF(WASM_ZERO, WASM_BRV(0, WASM_GET_LOCAL(0))),
WASM_GET_LOCAL(0)));
}
// unify i32 and f32 => fail
EXPECT_FAILURE_INLINE(
- &env_i_i,
+ sigs.i_i(),
WASM_BLOCK(2, WASM_IF(WASM_ZERO, WASM_BRV(0, WASM_ZERO)), WASM_F32(1.2)));
// unify f64 and f64 => OK
EXPECT_VERIFIES_INLINE(
- &env_d_dd,
+ sigs.d_dd(),
WASM_BLOCK(2, WASM_IF(WASM_ZERO, WASM_BRV(0, WASM_GET_LOCAL(0))),
WASM_F64(1.2)));
}
-
-TEST_F(WasmDecoderTest, ExprBreak_TypeCheckAll) {
+TEST_F(AstDecoderTest, ExprBreak_TypeCheckAll) {
byte code1[] = {WASM_BLOCK(2,
WASM_IF(WASM_ZERO, WASM_BRV(0, WASM_GET_LOCAL(0))),
WASM_GET_LOCAL(1))};
@@ -1671,32 +1458,26 @@
for (size_t i = 0; i < arraysize(kLocalTypes); i++) {
for (size_t j = 0; j < arraysize(kLocalTypes); j++) {
- FunctionEnv env;
LocalType storage[] = {kLocalTypes[i], kLocalTypes[i], kLocalTypes[j]};
FunctionSig sig(1, 2, storage);
- init_env(&env, &sig);
if (i == j) {
- EXPECT_VERIFIES(&env, code1);
- EXPECT_VERIFIES(&env, code2);
+ EXPECT_VERIFIES(&sig, code1);
+ EXPECT_VERIFIES(&sig, code2);
} else {
- EXPECT_FAILURE(&env, code1);
- EXPECT_FAILURE(&env, code2);
+ EXPECT_FAILURE(&sig, code1);
+ EXPECT_FAILURE(&sig, code2);
}
}
}
}
-
-TEST_F(WasmDecoderTest, ExprBr_Unify) {
- FunctionEnv env;
-
+TEST_F(AstDecoderTest, ExprBr_Unify) {
for (int which = 0; which < 2; which++) {
for (size_t i = 0; i < arraysize(kLocalTypes); i++) {
LocalType type = kLocalTypes[i];
LocalType storage[] = {kAstI32, kAstI32, type};
FunctionSig sig(1, 2, storage);
- init_env(&env, &sig); // (i32, X) -> i32
byte code1[] = {
WASM_BLOCK(2, WASM_IF(WASM_ZERO, WASM_BRV(0, WASM_GET_LOCAL(which))),
@@ -1707,37 +1488,34 @@
if (type == kAstI32) {
- EXPECT_VERIFIES(&env, code1);
- EXPECT_VERIFIES(&env, code2);
+ EXPECT_VERIFIES(&sig, code1);
+ EXPECT_VERIFIES(&sig, code2);
} else {
- EXPECT_FAILURE(&env, code1);
- EXPECT_FAILURE(&env, code2);
+ EXPECT_FAILURE(&sig, code1);
+ EXPECT_FAILURE(&sig, code2);
}
}
}
}
-TEST_F(WasmDecoderTest, ExprBrIf_cond_type) {
- FunctionEnv env;
+TEST_F(AstDecoderTest, ExprBrIf_cond_type) {
byte code[] = {
WASM_BLOCK(1, WASM_BRV_IF(0, WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)))};
for (size_t i = 0; i < arraysize(kLocalTypes); i++) {
for (size_t j = 0; j < arraysize(kLocalTypes); j++) {
LocalType types[] = {kLocalTypes[i], kLocalTypes[j]};
FunctionSig sig(0, 2, types);
- init_env(&env, &sig);
if (types[1] == kAstI32) {
- EXPECT_VERIFIES(&env, code);
+ EXPECT_VERIFIES(&sig, code);
} else {
- EXPECT_FAILURE(&env, code);
+ EXPECT_FAILURE(&sig, code);
}
}
}
}
-TEST_F(WasmDecoderTest, ExprBrIf_val_type) {
- FunctionEnv env;
+TEST_F(AstDecoderTest, ExprBrIf_val_type) {
byte code[] = {
WASM_BLOCK(2, WASM_BRV_IF(0, WASM_GET_LOCAL(1), WASM_GET_LOCAL(2)),
WASM_GET_LOCAL(0))};
@@ -1746,27 +1524,22 @@
LocalType types[] = {kLocalTypes[i], kLocalTypes[i], kLocalTypes[j],
kAstI32};
FunctionSig sig(1, 3, types);
- init_env(&env, &sig);
if (i == j) {
- EXPECT_VERIFIES(&env, code);
+ EXPECT_VERIFIES(&sig, code);
} else {
- EXPECT_FAILURE(&env, code);
+ EXPECT_FAILURE(&sig, code);
}
}
}
}
-
-TEST_F(WasmDecoderTest, ExprBrIf_Unify) {
- FunctionEnv env;
-
+TEST_F(AstDecoderTest, ExprBrIf_Unify) {
for (int which = 0; which < 2; which++) {
for (size_t i = 0; i < arraysize(kLocalTypes); i++) {
LocalType type = kLocalTypes[i];
LocalType storage[] = {kAstI32, kAstI32, type};
FunctionSig sig(1, 2, storage);
- init_env(&env, &sig); // (i32, X) -> i32
byte code1[] = {WASM_BLOCK(2, WASM_BRV_IF_ZERO(0, WASM_GET_LOCAL(which)),
WASM_GET_LOCAL(which ^ 1))};
@@ -1774,221 +1547,171 @@
WASM_GET_LOCAL(which ^ 1))};
if (type == kAstI32) {
- EXPECT_VERIFIES(&env, code1);
- EXPECT_VERIFIES(&env, code2);
+ EXPECT_VERIFIES(&sig, code1);
+ EXPECT_VERIFIES(&sig, code2);
} else {
- EXPECT_FAILURE(&env, code1);
- EXPECT_FAILURE(&env, code2);
+ EXPECT_FAILURE(&sig, code1);
+ EXPECT_FAILURE(&sig, code2);
}
}
}
}
-
-TEST_F(WasmDecoderTest, TableSwitch0) {
- static byte code[] = {kExprTableSwitch, 0, 0, 0, 0};
- EXPECT_FAILURE(&env_v_v, code);
+TEST_F(AstDecoderTest, BrTable0) {
+ static byte code[] = {kExprBrTable, 0, 0};
+ EXPECT_FAILURE(sigs.v_v(), code);
}
-
-TEST_F(WasmDecoderTest, TableSwitch0b) {
- static byte code[] = {kExprTableSwitch, 0, 0, 0, 0, kExprI8Const, 11};
- EXPECT_FAILURE(&env_v_v, code);
- EXPECT_FAILURE(&env_i_i, code);
+TEST_F(AstDecoderTest, BrTable0b) {
+ static byte code[] = {kExprBrTable, 0, 0, kExprI32Const, 11};
+ EXPECT_FAILURE(sigs.v_v(), code);
+ EXPECT_FAILURE(sigs.i_i(), code);
}
+TEST_F(AstDecoderTest, BrTable0c) {
+ static byte code[] = {kExprBrTable, 0, 1, 0, 0, kExprI32Const, 11};
+ EXPECT_FAILURE(sigs.v_v(), code);
+ EXPECT_FAILURE(sigs.i_i(), code);
+}
-TEST_F(WasmDecoderTest, TableSwitch0c) {
+TEST_F(AstDecoderTest, BrTable1a) {
static byte code[] = {
- WASM_BLOCK(1, WASM_TABLESWITCH_OP(0, 1, WASM_CASE_BR(0)), WASM_I8(67))};
- EXPECT_VERIFIES(&env_v_v, code);
+ WASM_BLOCK(1, WASM_BR_TABLE(WASM_I8(67), 0, BR_TARGET(0)))};
+ EXPECT_VERIFIES(sigs.v_v(), code);
}
-TEST_F(WasmDecoderTest, TableSwitch0d) {
+TEST_F(AstDecoderTest, BrTable1b) {
static byte code[] = {
- WASM_BLOCK(1, WASM_TABLESWITCH_OP(0, 2, WASM_CASE_BR(0), WASM_CASE_BR(1)),
- WASM_I8(67))};
- EXPECT_VERIFIES(&env_v_v, code);
+ WASM_BLOCK(1, WASM_BR_TABLE(WASM_ZERO, 0, BR_TARGET(0)))};
+ EXPECT_VERIFIES(sigs.v_v(), code);
+ EXPECT_FAILURE(sigs.i_i(), code);
+ EXPECT_FAILURE(sigs.f_ff(), code);
+ EXPECT_FAILURE(sigs.d_dd(), code);
}
-TEST_F(WasmDecoderTest, TableSwitch1) {
- static byte code[] = {WASM_TABLESWITCH_OP(1, 1, WASM_CASE(0)),
- WASM_TABLESWITCH_BODY(WASM_I8(0), WASM_I8(9))};
- EXPECT_VERIFIES(&env_i_i, code);
- EXPECT_VERIFIES(&env_v_v, code);
- EXPECT_FAILURE(&env_f_ff, code);
- EXPECT_FAILURE(&env_d_dd, code);
+TEST_F(AstDecoderTest, BrTable2a) {
+ static byte code[] = {
+ WASM_BLOCK(1, WASM_BR_TABLE(WASM_I8(67), 1, BR_TARGET(0), BR_TARGET(0)))};
+ EXPECT_VERIFIES(sigs.v_v(), code);
}
+TEST_F(AstDecoderTest, BrTable2b) {
+ static byte code[] = {WASM_BLOCK(
+ 1, WASM_BLOCK(
+ 1, WASM_BR_TABLE(WASM_I8(67), 1, BR_TARGET(0), BR_TARGET(1))))};
+ EXPECT_VERIFIES(sigs.v_v(), code);
+}
-TEST_F(WasmDecoderTest, TableSwitch_off_end) {
- static byte code[] = {WASM_TABLESWITCH_OP(1, 1, WASM_CASE(0)),
- WASM_TABLESWITCH_BODY(WASM_I8(0), WASM_I8(9))};
- for (size_t len = arraysize(code) - 1; len > 0; len--) {
- Verify(kError, &env_v_v, code, code + len);
+TEST_F(AstDecoderTest, BrTable_off_end) {
+ static byte code[] = {
+ WASM_BLOCK(1, WASM_BR_TABLE(WASM_GET_LOCAL(0), 0, BR_TARGET(0)))};
+ for (size_t len = 1; len < sizeof(code); len++) {
+ Verify(kError, sigs.i_i(), code, code + len);
}
}
-
-TEST_F(WasmDecoderTest, TableSwitch2) {
- static byte code[] = {
- WASM_TABLESWITCH_OP(2, 2, WASM_CASE(0), WASM_CASE(1)),
- WASM_TABLESWITCH_BODY(WASM_I8(3), WASM_I8(10), WASM_I8(11))};
- EXPECT_VERIFIES(&env_i_i, code);
- EXPECT_VERIFIES(&env_v_v, code);
- EXPECT_FAILURE(&env_f_ff, code);
- EXPECT_FAILURE(&env_d_dd, code);
-}
-
-
-TEST_F(WasmDecoderTest, TableSwitch1b) {
- EXPECT_VERIFIES_INLINE(&env_i_i, WASM_TABLESWITCH_OP(1, 1, WASM_CASE(0)),
- WASM_TABLESWITCH_BODY(WASM_GET_LOCAL(0), WASM_ZERO));
-
- EXPECT_VERIFIES_INLINE(&env_f_ff, WASM_TABLESWITCH_OP(1, 1, WASM_CASE(0)),
- WASM_TABLESWITCH_BODY(WASM_ZERO, WASM_F32(0.0)));
-
- EXPECT_VERIFIES_INLINE(&env_d_dd, WASM_TABLESWITCH_OP(1, 1, WASM_CASE(0)),
- WASM_TABLESWITCH_BODY(WASM_ZERO, WASM_F64(0.0)));
-}
-
-TEST_F(WasmDecoderTest, TableSwitch_br1) {
- for (int depth = 0; depth < 2; depth++) {
- byte code[] = {WASM_BLOCK(1, WASM_TABLESWITCH_OP(0, 1, WASM_CASE_BR(depth)),
- WASM_GET_LOCAL(0))};
- EXPECT_VERIFIES(&env_v_i, code);
- EXPECT_FAILURE(&env_i_i, code);
+TEST_F(AstDecoderTest, BrTable_invalid_br1) {
+ for (int depth = 0; depth < 4; depth++) {
+ byte code[] = {
+ WASM_BLOCK(1, WASM_BR_TABLE(WASM_GET_LOCAL(0), 0, BR_TARGET(depth)))};
+ if (depth == 0) {
+ EXPECT_VERIFIES(sigs.v_i(), code);
+ } else {
+ EXPECT_FAILURE(sigs.v_i(), code);
+ }
}
}
-
-TEST_F(WasmDecoderTest, TableSwitch_invalid_br) {
- for (int depth = 1; depth < 4; depth++) {
- EXPECT_FAILURE_INLINE(&env_v_i,
- WASM_TABLESWITCH_OP(0, 1, WASM_CASE_BR(depth)),
- WASM_GET_LOCAL(0));
- EXPECT_FAILURE_INLINE(
- &env_v_i,
- WASM_TABLESWITCH_OP(0, 2, WASM_CASE_BR(depth), WASM_CASE_BR(depth)),
- WASM_GET_LOCAL(0));
+TEST_F(AstDecoderTest, BrTable_invalid_br2) {
+ for (int depth = 0; depth < 4; depth++) {
+ byte code[] = {
+ WASM_LOOP(1, WASM_BR_TABLE(WASM_GET_LOCAL(0), 0, BR_TARGET(depth)))};
+ if (depth <= 1) {
+ EXPECT_VERIFIES(sigs.v_i(), code);
+ } else {
+ EXPECT_FAILURE(sigs.v_i(), code);
+ }
}
}
-
-TEST_F(WasmDecoderTest, TableSwitch_invalid_case_ref) {
- EXPECT_FAILURE_INLINE(&env_i_i, WASM_TABLESWITCH_OP(0, 1, WASM_CASE(0)),
- WASM_GET_LOCAL(0));
- EXPECT_FAILURE_INLINE(&env_i_i, WASM_TABLESWITCH_OP(1, 1, WASM_CASE(1)),
- WASM_TABLESWITCH_BODY(WASM_GET_LOCAL(0), WASM_ZERO));
-}
-
-
-TEST_F(WasmDecoderTest, TableSwitch1_br) {
- EXPECT_VERIFIES_INLINE(
- &env_i_i, WASM_TABLESWITCH_OP(1, 1, WASM_CASE(0)),
- WASM_TABLESWITCH_BODY(WASM_GET_LOCAL(0), WASM_BRV(0, WASM_ZERO)));
-}
-
-
-TEST_F(WasmDecoderTest, TableSwitch2_br) {
- EXPECT_VERIFIES_INLINE(
- &env_i_i, WASM_TABLESWITCH_OP(2, 2, WASM_CASE(0), WASM_CASE(1)),
- WASM_TABLESWITCH_BODY(WASM_GET_LOCAL(0), WASM_BRV(0, WASM_I8(0)),
- WASM_BRV(0, WASM_I8(1))));
-
- EXPECT_FAILURE_INLINE(
- &env_f_ff, WASM_TABLESWITCH_OP(2, 2, WASM_CASE(0), WASM_CASE(1)),
- WASM_TABLESWITCH_BODY(WASM_ZERO, WASM_BRV(0, WASM_I8(3)),
- WASM_BRV(0, WASM_I8(4))));
-}
-
-
-TEST_F(WasmDecoderTest, TableSwitch2x2) {
- EXPECT_VERIFIES_INLINE(
- &env_i_i, WASM_TABLESWITCH_OP(2, 4, WASM_CASE(0), WASM_CASE(1),
- WASM_CASE(0), WASM_CASE(1)),
- WASM_TABLESWITCH_BODY(WASM_GET_LOCAL(0), WASM_BRV(0, WASM_I8(3)),
- WASM_BRV(0, WASM_I8(4))));
-}
-
-
-TEST_F(WasmDecoderTest, ExprBreakNesting1) {
- EXPECT_VERIFIES_INLINE(&env_v_v, WASM_BLOCK(1, WASM_BRV(0, WASM_ZERO)));
- EXPECT_VERIFIES_INLINE(&env_v_v, WASM_BLOCK(1, WASM_BR(0)));
- EXPECT_VERIFIES_INLINE(&env_v_v,
+TEST_F(AstDecoderTest, ExprBreakNesting1) {
+ EXPECT_VERIFIES_INLINE(sigs.v_v(), WASM_BLOCK(1, WASM_BRV(0, WASM_ZERO)));
+ EXPECT_VERIFIES_INLINE(sigs.v_v(), WASM_BLOCK(1, WASM_BR(0)));
+ EXPECT_VERIFIES_INLINE(sigs.v_v(),
WASM_BLOCK(1, WASM_BRV_IF(0, WASM_ZERO, WASM_ZERO)));
- EXPECT_VERIFIES_INLINE(&env_v_v, WASM_BLOCK(1, WASM_BR_IF(0, WASM_ZERO)));
+ EXPECT_VERIFIES_INLINE(sigs.v_v(), WASM_BLOCK(1, WASM_BR_IF(0, WASM_ZERO)));
- EXPECT_VERIFIES_INLINE(&env_v_v, WASM_LOOP(1, WASM_BRV(0, WASM_ZERO)));
- EXPECT_VERIFIES_INLINE(&env_v_v, WASM_LOOP(1, WASM_BR(0)));
- EXPECT_VERIFIES_INLINE(&env_v_v,
+ EXPECT_VERIFIES_INLINE(sigs.v_v(), WASM_LOOP(1, WASM_BRV(0, WASM_ZERO)));
+ EXPECT_VERIFIES_INLINE(sigs.v_v(), WASM_LOOP(1, WASM_BR(0)));
+ EXPECT_VERIFIES_INLINE(sigs.v_v(),
WASM_LOOP(1, WASM_BRV_IF(0, WASM_ZERO, WASM_ZERO)));
- EXPECT_VERIFIES_INLINE(&env_v_v, WASM_LOOP(1, WASM_BR_IF(0, WASM_ZERO)));
+ EXPECT_VERIFIES_INLINE(sigs.v_v(), WASM_LOOP(1, WASM_BR_IF(0, WASM_ZERO)));
- EXPECT_VERIFIES_INLINE(&env_v_v, WASM_LOOP(1, WASM_BRV(1, WASM_ZERO)));
- EXPECT_VERIFIES_INLINE(&env_v_v, WASM_LOOP(1, WASM_BR(1)));
+ EXPECT_VERIFIES_INLINE(sigs.v_v(), WASM_LOOP(1, WASM_BRV(1, WASM_ZERO)));
+ EXPECT_VERIFIES_INLINE(sigs.v_v(), WASM_LOOP(1, WASM_BR(1)));
}
-
-TEST_F(WasmDecoderTest, Select) {
+TEST_F(AstDecoderTest, Select) {
EXPECT_VERIFIES_INLINE(
- &env_i_i, WASM_SELECT(WASM_GET_LOCAL(0), WASM_GET_LOCAL(0), WASM_ZERO));
- EXPECT_VERIFIES_INLINE(&env_f_ff,
+ sigs.i_i(), WASM_SELECT(WASM_GET_LOCAL(0), WASM_GET_LOCAL(0), WASM_ZERO));
+ EXPECT_VERIFIES_INLINE(sigs.f_ff(),
WASM_SELECT(WASM_F32(0.0), WASM_F32(0.0), WASM_ZERO));
- EXPECT_VERIFIES_INLINE(&env_d_dd,
+ EXPECT_VERIFIES_INLINE(sigs.d_dd(),
WASM_SELECT(WASM_F64(0.0), WASM_F64(0.0), WASM_ZERO));
- EXPECT_VERIFIES_INLINE(&env_l_l,
- WASM_SELECT(WASM_I64(0), WASM_I64(0), WASM_ZERO));
+ EXPECT_VERIFIES_INLINE(
+ sigs.l_l(), WASM_SELECT(WASM_I64V_1(0), WASM_I64V_1(0), WASM_ZERO));
}
-TEST_F(WasmDecoderTest, Select_fail1) {
- EXPECT_FAILURE_INLINE(&env_i_i, WASM_SELECT(WASM_F32(0.0), WASM_GET_LOCAL(0),
- WASM_GET_LOCAL(0)));
- EXPECT_FAILURE_INLINE(&env_i_i, WASM_SELECT(WASM_GET_LOCAL(0), WASM_F32(0.0),
- WASM_GET_LOCAL(0)));
+TEST_F(AstDecoderTest, Select_fail1) {
EXPECT_FAILURE_INLINE(
- &env_i_i,
+ sigs.i_i(),
+ WASM_SELECT(WASM_F32(0.0), WASM_GET_LOCAL(0), WASM_GET_LOCAL(0)));
+ EXPECT_FAILURE_INLINE(
+ sigs.i_i(),
+ WASM_SELECT(WASM_GET_LOCAL(0), WASM_F32(0.0), WASM_GET_LOCAL(0)));
+ EXPECT_FAILURE_INLINE(
+ sigs.i_i(),
WASM_SELECT(WASM_GET_LOCAL(0), WASM_GET_LOCAL(0), WASM_F32(0.0)));
}
-TEST_F(WasmDecoderTest, Select_fail2) {
+TEST_F(AstDecoderTest, Select_fail2) {
for (size_t i = 0; i < arraysize(kLocalTypes); i++) {
LocalType type = kLocalTypes[i];
if (type == kAstI32) continue;
LocalType types[] = {type, kAstI32, type};
FunctionSig sig(1, 2, types);
- FunctionEnv env;
- init_env(&env, &sig);
EXPECT_VERIFIES_INLINE(
- &env,
+ &sig,
WASM_SELECT(WASM_GET_LOCAL(1), WASM_GET_LOCAL(1), WASM_GET_LOCAL(0)));
EXPECT_FAILURE_INLINE(
- &env,
+ &sig,
WASM_SELECT(WASM_GET_LOCAL(1), WASM_GET_LOCAL(0), WASM_GET_LOCAL(0)));
EXPECT_FAILURE_INLINE(
- &env,
+ &sig,
WASM_SELECT(WASM_GET_LOCAL(0), WASM_GET_LOCAL(1), WASM_GET_LOCAL(0)));
EXPECT_FAILURE_INLINE(
- &env,
+ &sig,
WASM_SELECT(WASM_GET_LOCAL(0), WASM_GET_LOCAL(0), WASM_GET_LOCAL(1)));
}
}
-
-TEST_F(WasmDecoderTest, Select_TypeCheck) {
- EXPECT_FAILURE_INLINE(&env_i_i, WASM_SELECT(WASM_F32(9.9), WASM_GET_LOCAL(0),
- WASM_GET_LOCAL(0)));
-
- EXPECT_FAILURE_INLINE(&env_i_i, WASM_SELECT(WASM_GET_LOCAL(0), WASM_F64(0.25),
- WASM_GET_LOCAL(0)));
+TEST_F(AstDecoderTest, Select_TypeCheck) {
+ EXPECT_FAILURE_INLINE(
+ sigs.i_i(),
+ WASM_SELECT(WASM_F32(9.9), WASM_GET_LOCAL(0), WASM_GET_LOCAL(0)));
EXPECT_FAILURE_INLINE(
- &env_i_i, WASM_SELECT(WASM_F32(9.9), WASM_GET_LOCAL(0), WASM_I64(0)));
+ sigs.i_i(),
+ WASM_SELECT(WASM_GET_LOCAL(0), WASM_F64(0.25), WASM_GET_LOCAL(0)));
+
+ EXPECT_FAILURE_INLINE(
+ sigs.i_i(),
+ WASM_SELECT(WASM_F32(9.9), WASM_GET_LOCAL(0), WASM_I64V_1(0)));
}
@@ -2003,6 +1726,12 @@
EXPECT_EQ(expected, OpcodeLength(code, code + sizeof(code))); \
}
+#define EXPECT_LENGTH_N(expected, ...) \
+ { \
+ static const byte code[] = {__VA_ARGS__}; \
+ EXPECT_EQ(expected, OpcodeLength(code, code + sizeof(code))); \
+ }
+
TEST_F(WasmOpcodeLengthTest, Statements) {
EXPECT_LENGTH(1, kExprNop);
EXPECT_LENGTH(2, kExprBlock);
@@ -2017,9 +1746,7 @@
TEST_F(WasmOpcodeLengthTest, MiscExpressions) {
EXPECT_LENGTH(2, kExprI8Const);
- EXPECT_LENGTH(5, kExprI32Const);
EXPECT_LENGTH(5, kExprF32Const);
- EXPECT_LENGTH(9, kExprI64Const);
EXPECT_LENGTH(9, kExprF64Const);
EXPECT_LENGTH(2, kExprGetLocal);
EXPECT_LENGTH(2, kExprSetLocal);
@@ -2036,47 +1763,59 @@
EXPECT_LENGTH(2, kExprBrIf);
}
-
-TEST_F(WasmOpcodeLengthTest, VariableLength) {
- byte size2[] = {kExprLoadGlobal, 1};
- byte size3[] = {kExprLoadGlobal, 1 | 0x80, 2};
- byte size4[] = {kExprLoadGlobal, 1 | 0x80, 2 | 0x80, 3};
- byte size5[] = {kExprLoadGlobal, 1 | 0x80, 2 | 0x80, 3 | 0x80, 4};
- byte size6[] = {kExprLoadGlobal, 1 | 0x80, 2 | 0x80, 3 | 0x80, 4 | 0x80, 5};
-
- EXPECT_EQ(2, OpcodeLength(size2, size2 + sizeof(size2)));
- EXPECT_EQ(3, OpcodeLength(size3, size3 + sizeof(size3)));
- EXPECT_EQ(4, OpcodeLength(size4, size4 + sizeof(size4)));
- EXPECT_EQ(5, OpcodeLength(size5, size5 + sizeof(size5)));
- EXPECT_EQ(6, OpcodeLength(size6, size6 + sizeof(size6)));
+TEST_F(WasmOpcodeLengthTest, I32Const) {
+ EXPECT_LENGTH_N(2, kExprI32Const, U32V_1(1));
+ EXPECT_LENGTH_N(3, kExprI32Const, U32V_2(999));
+ EXPECT_LENGTH_N(4, kExprI32Const, U32V_3(9999));
+ EXPECT_LENGTH_N(5, kExprI32Const, U32V_4(999999));
+ EXPECT_LENGTH_N(6, kExprI32Const, U32V_5(99999999));
}
+TEST_F(WasmOpcodeLengthTest, I64Const) {
+ EXPECT_LENGTH_N(2, kExprI64Const, U32V_1(1));
+ EXPECT_LENGTH_N(3, kExprI64Const, U32V_2(99));
+ EXPECT_LENGTH_N(4, kExprI64Const, U32V_3(9999));
+ EXPECT_LENGTH_N(5, kExprI64Const, U32V_4(99999));
+ EXPECT_LENGTH_N(6, kExprI64Const, U32V_5(9999999));
+ EXPECT_LENGTH_N(7, WASM_I64V_6(777777));
+ EXPECT_LENGTH_N(8, WASM_I64V_7(7777777));
+ EXPECT_LENGTH_N(9, WASM_I64V_8(77777777));
+ EXPECT_LENGTH_N(10, WASM_I64V_9(777777777));
+}
+
+TEST_F(WasmOpcodeLengthTest, VariableLength) {
+ EXPECT_LENGTH_N(2, kExprLoadGlobal, U32V_1(1));
+ EXPECT_LENGTH_N(3, kExprLoadGlobal, U32V_2(33));
+ EXPECT_LENGTH_N(4, kExprLoadGlobal, U32V_3(44));
+ EXPECT_LENGTH_N(5, kExprLoadGlobal, U32V_4(66));
+ EXPECT_LENGTH_N(6, kExprLoadGlobal, U32V_5(77));
+}
TEST_F(WasmOpcodeLengthTest, LoadsAndStores) {
- EXPECT_LENGTH(2, kExprI32LoadMem8S);
- EXPECT_LENGTH(2, kExprI32LoadMem8U);
- EXPECT_LENGTH(2, kExprI32LoadMem16S);
- EXPECT_LENGTH(2, kExprI32LoadMem16U);
- EXPECT_LENGTH(2, kExprI32LoadMem);
- EXPECT_LENGTH(2, kExprI64LoadMem8S);
- EXPECT_LENGTH(2, kExprI64LoadMem8U);
- EXPECT_LENGTH(2, kExprI64LoadMem16S);
- EXPECT_LENGTH(2, kExprI64LoadMem16U);
- EXPECT_LENGTH(2, kExprI64LoadMem32S);
- EXPECT_LENGTH(2, kExprI64LoadMem32U);
- EXPECT_LENGTH(2, kExprI64LoadMem);
- EXPECT_LENGTH(2, kExprF32LoadMem);
- EXPECT_LENGTH(2, kExprF64LoadMem);
+ EXPECT_LENGTH(3, kExprI32LoadMem8S);
+ EXPECT_LENGTH(3, kExprI32LoadMem8U);
+ EXPECT_LENGTH(3, kExprI32LoadMem16S);
+ EXPECT_LENGTH(3, kExprI32LoadMem16U);
+ EXPECT_LENGTH(3, kExprI32LoadMem);
+ EXPECT_LENGTH(3, kExprI64LoadMem8S);
+ EXPECT_LENGTH(3, kExprI64LoadMem8U);
+ EXPECT_LENGTH(3, kExprI64LoadMem16S);
+ EXPECT_LENGTH(3, kExprI64LoadMem16U);
+ EXPECT_LENGTH(3, kExprI64LoadMem32S);
+ EXPECT_LENGTH(3, kExprI64LoadMem32U);
+ EXPECT_LENGTH(3, kExprI64LoadMem);
+ EXPECT_LENGTH(3, kExprF32LoadMem);
+ EXPECT_LENGTH(3, kExprF64LoadMem);
- EXPECT_LENGTH(2, kExprI32StoreMem8);
- EXPECT_LENGTH(2, kExprI32StoreMem16);
- EXPECT_LENGTH(2, kExprI32StoreMem);
- EXPECT_LENGTH(2, kExprI64StoreMem8);
- EXPECT_LENGTH(2, kExprI64StoreMem16);
- EXPECT_LENGTH(2, kExprI64StoreMem32);
- EXPECT_LENGTH(2, kExprI64StoreMem);
- EXPECT_LENGTH(2, kExprF32StoreMem);
- EXPECT_LENGTH(2, kExprF64StoreMem);
+ EXPECT_LENGTH(3, kExprI32StoreMem8);
+ EXPECT_LENGTH(3, kExprI32StoreMem16);
+ EXPECT_LENGTH(3, kExprI32StoreMem);
+ EXPECT_LENGTH(3, kExprI64StoreMem8);
+ EXPECT_LENGTH(3, kExprI64StoreMem16);
+ EXPECT_LENGTH(3, kExprI64StoreMem32);
+ EXPECT_LENGTH(3, kExprI64StoreMem);
+ EXPECT_LENGTH(3, kExprF32StoreMem);
+ EXPECT_LENGTH(3, kExprF64StoreMem);
}
@@ -2113,7 +1852,7 @@
EXPECT_LENGTH(1, kExprI32Clz);
EXPECT_LENGTH(1, kExprI32Ctz);
EXPECT_LENGTH(1, kExprI32Popcnt);
- EXPECT_LENGTH(1, kExprBoolNot);
+ EXPECT_LENGTH(1, kExprI32Eqz);
EXPECT_LENGTH(1, kExprI64Add);
EXPECT_LENGTH(1, kExprI64Sub);
EXPECT_LENGTH(1, kExprI64Mul);
@@ -2211,16 +1950,18 @@
class WasmOpcodeArityTest : public TestWithZone {
public:
WasmOpcodeArityTest() : TestWithZone() {}
+ TestModuleEnv module;
+ TestSignatures sigs;
};
-#define EXPECT_ARITY(expected, ...) \
- { \
- static const byte code[] = {__VA_ARGS__}; \
- EXPECT_EQ(expected, OpcodeArity(&env, code, code + sizeof(code))); \
+#define EXPECT_ARITY(expected, ...) \
+ { \
+ static const byte code[] = {__VA_ARGS__}; \
+ EXPECT_EQ(expected, OpcodeArity(&module, sig, code, code + sizeof(code))); \
}
TEST_F(WasmOpcodeArityTest, Control) {
- FunctionEnv env;
+ FunctionSig* sig = sigs.v_v();
EXPECT_ARITY(0, kExprNop);
EXPECT_ARITY(0, kExprBlock, 0);
@@ -2243,19 +1984,16 @@
EXPECT_ARITY(2, kExprBrIf);
{
- TestSignatures sigs;
- FunctionEnv env;
- WasmDecoderTest::init_env(&env, sigs.v_v());
+ sig = sigs.v_v();
EXPECT_ARITY(0, kExprReturn);
- WasmDecoderTest::init_env(&env, sigs.i_i());
+ sig = sigs.i_i();
EXPECT_ARITY(1, kExprReturn);
}
}
TEST_F(WasmOpcodeArityTest, Misc) {
- FunctionEnv env;
-
+ FunctionSig* sig = sigs.v_v();
EXPECT_ARITY(0, kExprI8Const);
EXPECT_ARITY(0, kExprI32Const);
EXPECT_ARITY(0, kExprF32Const);
@@ -2269,8 +2007,6 @@
TEST_F(WasmOpcodeArityTest, Calls) {
- TestSignatures sigs;
- TestModuleEnv module;
module.AddFunction(sigs.i_ii());
module.AddFunction(sigs.i_i());
@@ -2281,9 +2017,7 @@
module.AddImport(sigs.i_d());
{
- FunctionEnv env;
- WasmDecoderTest::init_env(&env, sigs.i_ii());
- env.module = &module;
+ FunctionSig* sig = sigs.i_ii();
EXPECT_ARITY(2, kExprCallFunction, 0);
EXPECT_ARITY(2, kExprCallImport, 0);
@@ -2293,9 +2027,7 @@
}
{
- FunctionEnv env;
- WasmDecoderTest::init_env(&env, sigs.v_v());
- env.module = &module;
+ FunctionSig* sig = sigs.v_v();
EXPECT_ARITY(1, kExprCallFunction, 1);
EXPECT_ARITY(1, kExprCallImport, 1);
@@ -2307,8 +2039,7 @@
TEST_F(WasmOpcodeArityTest, LoadsAndStores) {
- FunctionEnv env;
-
+ FunctionSig* sig = sigs.v_v();
EXPECT_ARITY(1, kExprI32LoadMem8S);
EXPECT_ARITY(1, kExprI32LoadMem8U);
EXPECT_ARITY(1, kExprI32LoadMem16S);
@@ -2338,16 +2069,14 @@
TEST_F(WasmOpcodeArityTest, MiscMemExpressions) {
- FunctionEnv env;
-
+ FunctionSig* sig = sigs.v_v();
EXPECT_ARITY(0, kExprMemorySize);
EXPECT_ARITY(1, kExprGrowMemory);
}
TEST_F(WasmOpcodeArityTest, SimpleExpressions) {
- FunctionEnv env;
-
+ FunctionSig* sig = sigs.v_v();
EXPECT_ARITY(2, kExprI32Add);
EXPECT_ARITY(2, kExprI32Sub);
EXPECT_ARITY(2, kExprI32Mul);
@@ -2374,7 +2103,7 @@
EXPECT_ARITY(1, kExprI32Clz);
EXPECT_ARITY(1, kExprI32Ctz);
EXPECT_ARITY(1, kExprI32Popcnt);
- EXPECT_ARITY(1, kExprBoolNot);
+ EXPECT_ARITY(1, kExprI32Eqz);
EXPECT_ARITY(2, kExprI64Add);
EXPECT_ARITY(2, kExprI64Sub);
EXPECT_ARITY(2, kExprI64Mul);
@@ -2467,6 +2196,127 @@
EXPECT_ARITY(1, kExprI32ReinterpretF32);
EXPECT_ARITY(1, kExprI64ReinterpretF64);
}
+
+typedef ZoneVector<LocalType> LocalTypeMap;
+
+class LocalDeclDecoderTest : public TestWithZone {
+ public:
+ base::AccountingAllocator allocator;
+
+ size_t ExpectRun(LocalTypeMap map, size_t pos, LocalType expected,
+ size_t count) {
+ for (size_t i = 0; i < count; i++) {
+ EXPECT_EQ(expected, map[pos++]);
+ }
+ return pos;
+ }
+
+ LocalTypeMap Expand(AstLocalDecls& decls) {
+ ZoneVector<LocalType> map(zone());
+ for (auto p : decls.local_types) {
+ map.insert(map.end(), p.second, p.first);
+ }
+ return map;
+ }
+};
+
+TEST_F(LocalDeclDecoderTest, EmptyLocals) {
+ AstLocalDecls decls(zone());
+ bool result = DecodeLocalDecls(decls, nullptr, nullptr);
+ EXPECT_FALSE(result);
+}
+
+TEST_F(LocalDeclDecoderTest, NoLocals) {
+ static const byte data[] = {0};
+ AstLocalDecls decls(zone());
+ bool result = DecodeLocalDecls(decls, data, data + sizeof(data));
+ EXPECT_TRUE(result);
+ EXPECT_EQ(0, decls.total_local_count);
+}
+
+TEST_F(LocalDeclDecoderTest, OneLocal) {
+ for (size_t i = 0; i < arraysize(kLocalTypes); i++) {
+ LocalType type = kLocalTypes[i];
+ const byte data[] = {
+ 1, 1, static_cast<byte>(WasmOpcodes::LocalTypeCodeFor(type))};
+ AstLocalDecls decls(zone());
+ bool result = DecodeLocalDecls(decls, data, data + sizeof(data));
+ EXPECT_TRUE(result);
+ EXPECT_EQ(1, decls.total_local_count);
+
+ LocalTypeMap map = Expand(decls);
+ EXPECT_EQ(1, map.size());
+ EXPECT_EQ(type, map.at(0));
+ }
+}
+
+TEST_F(LocalDeclDecoderTest, FiveLocals) {
+ for (size_t i = 0; i < arraysize(kLocalTypes); i++) {
+ LocalType type = kLocalTypes[i];
+ const byte data[] = {
+ 1, 5, static_cast<byte>(WasmOpcodes::LocalTypeCodeFor(type))};
+ AstLocalDecls decls(zone());
+ bool result = DecodeLocalDecls(decls, data, data + sizeof(data));
+ EXPECT_TRUE(result);
+ EXPECT_EQ(sizeof(data), decls.decls_encoded_size);
+ EXPECT_EQ(5, decls.total_local_count);
+
+ LocalTypeMap map = Expand(decls);
+ EXPECT_EQ(5, map.size());
+ ExpectRun(map, 0, type, 5);
+ }
+}
+
+TEST_F(LocalDeclDecoderTest, MixedLocals) {
+ for (byte a = 0; a < 3; a++) {
+ for (byte b = 0; b < 3; b++) {
+ for (byte c = 0; c < 3; c++) {
+ for (byte d = 0; d < 3; d++) {
+ const byte data[] = {4, a, kLocalI32, b, kLocalI64,
+ c, kLocalF32, d, kLocalF64};
+ AstLocalDecls decls(zone());
+ bool result = DecodeLocalDecls(decls, data, data + sizeof(data));
+ EXPECT_TRUE(result);
+ EXPECT_EQ(sizeof(data), decls.decls_encoded_size);
+ EXPECT_EQ(a + b + c + d, decls.total_local_count);
+
+ LocalTypeMap map = Expand(decls);
+ EXPECT_EQ(a + b + c + d, map.size());
+
+ size_t pos = 0;
+ pos = ExpectRun(map, pos, kAstI32, a);
+ pos = ExpectRun(map, pos, kAstI64, b);
+ pos = ExpectRun(map, pos, kAstF32, c);
+ pos = ExpectRun(map, pos, kAstF64, d);
+ }
+ }
+ }
+ }
+}
+
+TEST_F(LocalDeclDecoderTest, UseEncoder) {
+ const byte* data = nullptr;
+ const byte* end = nullptr;
+ LocalDeclEncoder local_decls;
+
+ local_decls.AddLocals(5, kAstF32);
+ local_decls.AddLocals(1337, kAstI32);
+ local_decls.AddLocals(212, kAstI64);
+ local_decls.Prepend(&data, &end);
+
+ AstLocalDecls decls(zone());
+ bool result = DecodeLocalDecls(decls, data, end);
+ EXPECT_TRUE(result);
+ EXPECT_EQ(5 + 1337 + 212, decls.total_local_count);
+
+ LocalTypeMap map = Expand(decls);
+ size_t pos = 0;
+ pos = ExpectRun(map, pos, kAstF32, 5);
+ pos = ExpectRun(map, pos, kAstI32, 1337);
+ pos = ExpectRun(map, pos, kAstI64, 212);
+ delete[] data;
+}
+
} // namespace wasm
} // namespace internal
} // namespace v8
diff --git a/test/unittests/wasm/decoder-unittest.cc b/test/unittests/wasm/decoder-unittest.cc
new file mode 100644
index 0000000..11d68f1
--- /dev/null
+++ b/test/unittests/wasm/decoder-unittest.cc
@@ -0,0 +1,667 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "test/unittests/test-utils.h"
+
+#include "src/wasm/decoder.h"
+#include "src/wasm/wasm-macro-gen.h"
+
+namespace v8 {
+namespace internal {
+namespace wasm {
+
+class DecoderTest : public TestWithZone {
+ public:
+ DecoderTest() : decoder(nullptr, nullptr) {}
+
+ Decoder decoder;
+};
+
+#define CHECK_UINT32V_INLINE(expected, expected_length, ...) \
+ do { \
+ const byte data[] = {__VA_ARGS__}; \
+ decoder.Reset(data, data + sizeof(data)); \
+ int length; \
+ EXPECT_EQ(expected, \
+ decoder.checked_read_u32v(decoder.start(), 0, &length)); \
+ EXPECT_EQ(expected_length, length); \
+ } while (false)
+
+#define CHECK_INT32V_INLINE(expected, expected_length, ...) \
+ do { \
+ const byte data[] = {__VA_ARGS__}; \
+ decoder.Reset(data, data + sizeof(data)); \
+ int length; \
+ EXPECT_EQ(expected, \
+ decoder.checked_read_i32v(decoder.start(), 0, &length)); \
+ EXPECT_EQ(expected_length, length); \
+ } while (false)
+
+#define CHECK_UINT64V_INLINE(expected, expected_length, ...) \
+ do { \
+ const byte data[] = {__VA_ARGS__}; \
+ decoder.Reset(data, data + sizeof(data)); \
+ int length; \
+ EXPECT_EQ(expected, \
+ decoder.checked_read_u64v(decoder.start(), 0, &length)); \
+ EXPECT_EQ(expected_length, length); \
+ } while (false)
+
+#define CHECK_INT64V_INLINE(expected, expected_length, ...) \
+ do { \
+ const byte data[] = {__VA_ARGS__}; \
+ decoder.Reset(data, data + sizeof(data)); \
+ int length; \
+ EXPECT_EQ(expected, \
+ decoder.checked_read_i64v(decoder.start(), 0, &length)); \
+ EXPECT_EQ(expected_length, length); \
+ } while (false)
+
+TEST_F(DecoderTest, ReadU32v_OneByte) {
+ CHECK_UINT32V_INLINE(0, 1, 0);
+ CHECK_UINT32V_INLINE(5, 1, 5);
+ CHECK_UINT32V_INLINE(7, 1, 7);
+ CHECK_UINT32V_INLINE(9, 1, 9);
+ CHECK_UINT32V_INLINE(37, 1, 37);
+ CHECK_UINT32V_INLINE(69, 1, 69);
+ CHECK_UINT32V_INLINE(110, 1, 110);
+ CHECK_UINT32V_INLINE(125, 1, 125);
+ CHECK_UINT32V_INLINE(126, 1, 126);
+ CHECK_UINT32V_INLINE(127, 1, 127);
+}
+
+TEST_F(DecoderTest, ReadU32v_TwoByte) {
+ CHECK_UINT32V_INLINE(0, 1, 0, 0);
+ CHECK_UINT32V_INLINE(10, 1, 10, 0);
+ CHECK_UINT32V_INLINE(27, 1, 27, 0);
+ CHECK_UINT32V_INLINE(100, 1, 100, 0);
+
+ CHECK_UINT32V_INLINE(444, 2, U32V_2(444));
+ CHECK_UINT32V_INLINE(544, 2, U32V_2(544));
+ CHECK_UINT32V_INLINE(1311, 2, U32V_2(1311));
+ CHECK_UINT32V_INLINE(2333, 2, U32V_2(2333));
+
+ for (uint32_t i = 0; i < 1 << 14; i = i * 13 + 1) {
+ CHECK_UINT32V_INLINE(i, 2, U32V_2(i));
+ }
+
+ const uint32_t max = (1 << 14) - 1;
+ CHECK_UINT32V_INLINE(max, 2, U32V_2(max));
+}
+
+TEST_F(DecoderTest, ReadU32v_ThreeByte) {
+ CHECK_UINT32V_INLINE(0, 1, 0, 0, 0, 0);
+ CHECK_UINT32V_INLINE(10, 1, 10, 0, 0, 0);
+ CHECK_UINT32V_INLINE(27, 1, 27, 0, 0, 0);
+ CHECK_UINT32V_INLINE(100, 1, 100, 0, 0, 0);
+
+ CHECK_UINT32V_INLINE(11, 3, U32V_3(11));
+ CHECK_UINT32V_INLINE(101, 3, U32V_3(101));
+ CHECK_UINT32V_INLINE(446, 3, U32V_3(446));
+ CHECK_UINT32V_INLINE(546, 3, U32V_3(546));
+ CHECK_UINT32V_INLINE(1319, 3, U32V_3(1319));
+ CHECK_UINT32V_INLINE(2338, 3, U32V_3(2338));
+ CHECK_UINT32V_INLINE(8191, 3, U32V_3(8191));
+ CHECK_UINT32V_INLINE(9999, 3, U32V_3(9999));
+ CHECK_UINT32V_INLINE(14444, 3, U32V_3(14444));
+ CHECK_UINT32V_INLINE(314444, 3, U32V_3(314444));
+ CHECK_UINT32V_INLINE(614444, 3, U32V_3(614444));
+
+ const uint32_t max = (1 << 21) - 1;
+
+ for (uint32_t i = 0; i <= max; i = i * 13 + 3) {
+ CHECK_UINT32V_INLINE(i, 3, U32V_3(i), 0);
+ }
+
+ CHECK_UINT32V_INLINE(max, 3, U32V_3(max));
+}
+
+TEST_F(DecoderTest, ReadU32v_FourByte) {
+ CHECK_UINT32V_INLINE(0, 1, 0, 0, 0, 0, 0);
+ CHECK_UINT32V_INLINE(10, 1, 10, 0, 0, 0, 0);
+ CHECK_UINT32V_INLINE(27, 1, 27, 0, 0, 0, 0);
+ CHECK_UINT32V_INLINE(100, 1, 100, 0, 0, 0, 0);
+
+ CHECK_UINT32V_INLINE(13, 4, U32V_4(13));
+ CHECK_UINT32V_INLINE(107, 4, U32V_4(107));
+ CHECK_UINT32V_INLINE(449, 4, U32V_4(449));
+ CHECK_UINT32V_INLINE(541, 4, U32V_4(541));
+ CHECK_UINT32V_INLINE(1317, 4, U32V_4(1317));
+ CHECK_UINT32V_INLINE(2334, 4, U32V_4(2334));
+ CHECK_UINT32V_INLINE(8191, 4, U32V_4(8191));
+ CHECK_UINT32V_INLINE(9994, 4, U32V_4(9994));
+ CHECK_UINT32V_INLINE(14442, 4, U32V_4(14442));
+ CHECK_UINT32V_INLINE(314442, 4, U32V_4(314442));
+ CHECK_UINT32V_INLINE(614442, 4, U32V_4(614442));
+ CHECK_UINT32V_INLINE(1614442, 4, U32V_4(1614442));
+ CHECK_UINT32V_INLINE(5614442, 4, U32V_4(5614442));
+ CHECK_UINT32V_INLINE(19614442, 4, U32V_4(19614442));
+
+ const uint32_t max = (1 << 28) - 1;
+
+ for (uint32_t i = 0; i <= max; i = i * 13 + 5) {
+ CHECK_UINT32V_INLINE(i, 4, U32V_4(i), 0);
+ }
+
+ CHECK_UINT32V_INLINE(max, 4, U32V_4(max));
+}
+
+TEST_F(DecoderTest, ReadU32v_FiveByte) {
+ CHECK_UINT32V_INLINE(0, 1, 0, 0, 0, 0, 0);
+ CHECK_UINT32V_INLINE(10, 1, 10, 0, 0, 0, 0);
+ CHECK_UINT32V_INLINE(27, 1, 27, 0, 0, 0, 0);
+ CHECK_UINT32V_INLINE(100, 1, 100, 0, 0, 0, 0);
+
+ CHECK_UINT32V_INLINE(13, 5, U32V_5(13));
+ CHECK_UINT32V_INLINE(107, 5, U32V_5(107));
+ CHECK_UINT32V_INLINE(449, 5, U32V_5(449));
+ CHECK_UINT32V_INLINE(541, 5, U32V_5(541));
+ CHECK_UINT32V_INLINE(1317, 5, U32V_5(1317));
+ CHECK_UINT32V_INLINE(2334, 5, U32V_5(2334));
+ CHECK_UINT32V_INLINE(8191, 5, U32V_5(8191));
+ CHECK_UINT32V_INLINE(9994, 5, U32V_5(9994));
+ CHECK_UINT32V_INLINE(24442, 5, U32V_5(24442));
+ CHECK_UINT32V_INLINE(414442, 5, U32V_5(414442));
+ CHECK_UINT32V_INLINE(714442, 5, U32V_5(714442));
+ CHECK_UINT32V_INLINE(1614442, 5, U32V_5(1614442));
+ CHECK_UINT32V_INLINE(6614442, 5, U32V_5(6614442));
+ CHECK_UINT32V_INLINE(89614442, 5, U32V_5(89614442));
+ CHECK_UINT32V_INLINE(2219614442u, 5, U32V_5(2219614442u));
+ CHECK_UINT32V_INLINE(3219614442u, 5, U32V_5(3219614442u));
+ CHECK_UINT32V_INLINE(4019614442u, 5, U32V_5(4019614442u));
+
+ const uint32_t max = 0xFFFFFFFFu;
+
+ for (uint32_t i = 1; i < 32; i++) {
+ uint32_t val = 0x983489aau << i;
+ CHECK_UINT32V_INLINE(val, 5, U32V_5(val), 0);
+ }
+
+ CHECK_UINT32V_INLINE(max, 5, U32V_5(max));
+}
+
+TEST_F(DecoderTest, ReadU32v_various) {
+ for (int i = 0; i < 10; i++) {
+ uint32_t x = 0xCCCCCCCCu * i;
+ for (int width = 0; width < 32; width++) {
+ uint32_t val = x >> width;
+
+ CHECK_UINT32V_INLINE(val & MASK_7, 1, U32V_1(val));
+ CHECK_UINT32V_INLINE(val & MASK_14, 2, U32V_2(val));
+ CHECK_UINT32V_INLINE(val & MASK_21, 3, U32V_3(val));
+ CHECK_UINT32V_INLINE(val & MASK_28, 4, U32V_4(val));
+ CHECK_UINT32V_INLINE(val, 5, U32V_5(val));
+ }
+ }
+}
+
+TEST_F(DecoderTest, ReadI32v_OneByte) {
+ CHECK_INT32V_INLINE(0, 1, 0);
+ CHECK_INT32V_INLINE(4, 1, 4);
+ CHECK_INT32V_INLINE(6, 1, 6);
+ CHECK_INT32V_INLINE(9, 1, 9);
+ CHECK_INT32V_INLINE(33, 1, 33);
+ CHECK_INT32V_INLINE(61, 1, 61);
+ CHECK_INT32V_INLINE(63, 1, 63);
+
+ CHECK_INT32V_INLINE(-1, 1, 127);
+ CHECK_INT32V_INLINE(-2, 1, 126);
+ CHECK_INT32V_INLINE(-11, 1, 117);
+ CHECK_INT32V_INLINE(-62, 1, 66);
+ CHECK_INT32V_INLINE(-63, 1, 65);
+ CHECK_INT32V_INLINE(-64, 1, 64);
+}
+
+TEST_F(DecoderTest, ReadI32v_TwoByte) {
+ CHECK_INT32V_INLINE(0, 2, U32V_2(0));
+ CHECK_INT32V_INLINE(9, 2, U32V_2(9));
+ CHECK_INT32V_INLINE(61, 2, U32V_2(61));
+ CHECK_INT32V_INLINE(63, 2, U32V_2(63));
+
+ CHECK_INT32V_INLINE(-1, 2, U32V_2(-1));
+ CHECK_INT32V_INLINE(-2, 2, U32V_2(-2));
+ CHECK_INT32V_INLINE(-63, 2, U32V_2(-63));
+ CHECK_INT32V_INLINE(-64, 2, U32V_2(-64));
+
+ CHECK_INT32V_INLINE(-200, 2, U32V_2(-200));
+ CHECK_INT32V_INLINE(-1002, 2, U32V_2(-1002));
+ CHECK_INT32V_INLINE(-2004, 2, U32V_2(-2004));
+ CHECK_INT32V_INLINE(-4077, 2, U32V_2(-4077));
+
+ CHECK_INT32V_INLINE(207, 2, U32V_2(207));
+ CHECK_INT32V_INLINE(1009, 2, U32V_2(1009));
+ CHECK_INT32V_INLINE(2003, 2, U32V_2(2003));
+ CHECK_INT32V_INLINE(4072, 2, U32V_2(4072));
+
+ const int32_t min = 0 - (1 << 13);
+ for (int i = min; i < min + 10; i++) {
+ CHECK_INT32V_INLINE(i, 2, U32V_2(i));
+ }
+
+ const int32_t max = (1 << 13) - 1;
+ for (int i = max; i > max - 10; i--) {
+ CHECK_INT32V_INLINE(i, 2, U32V_2(i));
+ }
+}
+
+TEST_F(DecoderTest, ReadI32v_ThreeByte) {
+ CHECK_INT32V_INLINE(0, 3, U32V_3(0));
+ CHECK_INT32V_INLINE(9, 3, U32V_3(9));
+ CHECK_INT32V_INLINE(61, 3, U32V_3(61));
+ CHECK_INT32V_INLINE(63, 3, U32V_3(63));
+
+ CHECK_INT32V_INLINE(-1, 3, U32V_3(-1));
+ CHECK_INT32V_INLINE(-2, 3, U32V_3(-2));
+ CHECK_INT32V_INLINE(-63, 3, U32V_3(-63));
+ CHECK_INT32V_INLINE(-64, 3, U32V_3(-64));
+
+ CHECK_INT32V_INLINE(-207, 3, U32V_3(-207));
+ CHECK_INT32V_INLINE(-1012, 3, U32V_3(-1012));
+ CHECK_INT32V_INLINE(-4067, 3, U32V_3(-4067));
+ CHECK_INT32V_INLINE(-14067, 3, U32V_3(-14067));
+ CHECK_INT32V_INLINE(-234061, 3, U32V_3(-234061));
+
+ CHECK_INT32V_INLINE(237, 3, U32V_3(237));
+ CHECK_INT32V_INLINE(1309, 3, U32V_3(1309));
+ CHECK_INT32V_INLINE(4372, 3, U32V_3(4372));
+ CHECK_INT32V_INLINE(64372, 3, U32V_3(64372));
+ CHECK_INT32V_INLINE(374372, 3, U32V_3(374372));
+
+ const int32_t min = 0 - (1 << 20);
+ for (int i = min; i < min + 10; i++) {
+ CHECK_INT32V_INLINE(i, 3, U32V_3(i));
+ }
+
+ const int32_t max = (1 << 20) - 1;
+ for (int i = max; i > max - 10; i--) {
+ CHECK_INT32V_INLINE(i, 3, U32V_3(i));
+ }
+}
+
+TEST_F(DecoderTest, ReadI32v_FourByte) {
+ CHECK_INT32V_INLINE(0, 4, U32V_4(0));
+ CHECK_INT32V_INLINE(9, 4, U32V_4(9));
+ CHECK_INT32V_INLINE(61, 4, U32V_4(61));
+ CHECK_INT32V_INLINE(63, 4, U32V_4(63));
+
+ CHECK_INT32V_INLINE(-1, 4, U32V_4(-1));
+ CHECK_INT32V_INLINE(-2, 4, U32V_4(-2));
+ CHECK_INT32V_INLINE(-63, 4, U32V_4(-63));
+ CHECK_INT32V_INLINE(-64, 4, U32V_4(-64));
+
+ CHECK_INT32V_INLINE(-267, 4, U32V_4(-267));
+ CHECK_INT32V_INLINE(-1612, 4, U32V_4(-1612));
+ CHECK_INT32V_INLINE(-4667, 4, U32V_4(-4667));
+ CHECK_INT32V_INLINE(-16067, 4, U32V_4(-16067));
+ CHECK_INT32V_INLINE(-264061, 4, U32V_4(-264061));
+ CHECK_INT32V_INLINE(-1264061, 4, U32V_4(-1264061));
+ CHECK_INT32V_INLINE(-6264061, 4, U32V_4(-6264061));
+ CHECK_INT32V_INLINE(-8264061, 4, U32V_4(-8264061));
+
+ CHECK_INT32V_INLINE(277, 4, U32V_4(277));
+ CHECK_INT32V_INLINE(1709, 4, U32V_4(1709));
+ CHECK_INT32V_INLINE(4772, 4, U32V_4(4772));
+ CHECK_INT32V_INLINE(67372, 4, U32V_4(67372));
+ CHECK_INT32V_INLINE(374372, 4, U32V_4(374372));
+ CHECK_INT32V_INLINE(2374372, 4, U32V_4(2374372));
+ CHECK_INT32V_INLINE(7374372, 4, U32V_4(7374372));
+ CHECK_INT32V_INLINE(9374372, 4, U32V_4(9374372));
+
+ const int32_t min = 0 - (1 << 27);
+ for (int i = min; i < min + 10; i++) {
+ CHECK_INT32V_INLINE(i, 4, U32V_4(i));
+ }
+
+ const int32_t max = (1 << 27) - 1;
+ for (int i = max; i > max - 10; i--) {
+ CHECK_INT32V_INLINE(i, 4, U32V_4(i));
+ }
+}
+
+TEST_F(DecoderTest, ReadI32v_FiveByte) {
+ CHECK_INT32V_INLINE(0, 5, U32V_5(0));
+ CHECK_INT32V_INLINE(16, 5, U32V_5(16));
+ CHECK_INT32V_INLINE(94, 5, U32V_5(94));
+ CHECK_INT32V_INLINE(127, 5, U32V_5(127));
+
+ CHECK_INT32V_INLINE(-1, 5, U32V_5(-1));
+ CHECK_INT32V_INLINE(-2, 5, U32V_5(-2));
+ CHECK_INT32V_INLINE(-63, 5, U32V_5(-63));
+ CHECK_INT32V_INLINE(-64, 5, U32V_5(-64));
+
+ CHECK_INT32V_INLINE(-257, 5, U32V_5(-257));
+ CHECK_INT32V_INLINE(-1512, 5, U32V_5(-1512));
+ CHECK_INT32V_INLINE(-4567, 5, U32V_5(-4567));
+ CHECK_INT32V_INLINE(-15067, 5, U32V_5(-15067));
+ CHECK_INT32V_INLINE(-254061, 5, U32V_5(-254061));
+ CHECK_INT32V_INLINE(-1364061, 5, U32V_5(-1364061));
+ CHECK_INT32V_INLINE(-6364061, 5, U32V_5(-6364061));
+ CHECK_INT32V_INLINE(-8364061, 5, U32V_5(-8364061));
+ CHECK_INT32V_INLINE(-28364061, 5, U32V_5(-28364061));
+ CHECK_INT32V_INLINE(-228364061, 5, U32V_5(-228364061));
+
+ CHECK_INT32V_INLINE(227, 5, U32V_5(227));
+ CHECK_INT32V_INLINE(1209, 5, U32V_5(1209));
+ CHECK_INT32V_INLINE(4272, 5, U32V_5(4272));
+ CHECK_INT32V_INLINE(62372, 5, U32V_5(62372));
+ CHECK_INT32V_INLINE(324372, 5, U32V_5(324372));
+ CHECK_INT32V_INLINE(2274372, 5, U32V_5(2274372));
+ CHECK_INT32V_INLINE(7274372, 5, U32V_5(7274372));
+ CHECK_INT32V_INLINE(9274372, 5, U32V_5(9274372));
+ CHECK_INT32V_INLINE(42374372, 5, U32V_5(42374372));
+ CHECK_INT32V_INLINE(429374372, 5, U32V_5(429374372));
+
+ const int32_t min = kMinInt;
+ for (int i = min; i < min + 10; i++) {
+ CHECK_INT32V_INLINE(i, 5, U32V_5(i));
+ }
+
+ const int32_t max = kMaxInt;
+ for (int i = max; i > max - 10; i--) {
+ CHECK_INT32V_INLINE(i, 5, U32V_5(i));
+ }
+}
+
+TEST_F(DecoderTest, ReadU32v_off_end1) {
+ static const byte data[] = {U32V_1(11)};
+ int length = 0;
+ decoder.Reset(data, data);
+ decoder.checked_read_u32v(decoder.start(), 0, &length);
+ EXPECT_EQ(0, length);
+ EXPECT_FALSE(decoder.ok());
+}
+
+TEST_F(DecoderTest, ReadU32v_off_end2) {
+ static const byte data[] = {U32V_2(1111)};
+ for (size_t i = 0; i < sizeof(data); i++) {
+ int length = 0;
+ decoder.Reset(data, data + i);
+ decoder.checked_read_u32v(decoder.start(), 0, &length);
+ EXPECT_EQ(i, length);
+ EXPECT_FALSE(decoder.ok());
+ }
+}
+
+TEST_F(DecoderTest, ReadU32v_off_end3) {
+ static const byte data[] = {U32V_3(111111)};
+ for (size_t i = 0; i < sizeof(data); i++) {
+ int length = 0;
+ decoder.Reset(data, data + i);
+ decoder.checked_read_u32v(decoder.start(), 0, &length);
+ EXPECT_EQ(i, length);
+ EXPECT_FALSE(decoder.ok());
+ }
+}
+
+TEST_F(DecoderTest, ReadU32v_off_end4) {
+ static const byte data[] = {U32V_4(11111111)};
+ for (size_t i = 0; i < sizeof(data); i++) {
+ int length = 0;
+ decoder.Reset(data, data + i);
+ decoder.checked_read_u32v(decoder.start(), 0, &length);
+ EXPECT_EQ(i, length);
+ EXPECT_FALSE(decoder.ok());
+ }
+}
+
+TEST_F(DecoderTest, ReadU32v_off_end5) {
+ static const byte data[] = {U32V_5(111111111)};
+ for (size_t i = 0; i < sizeof(data); i++) {
+ int length = 0;
+ decoder.Reset(data, data + i);
+ decoder.checked_read_u32v(decoder.start(), 0, &length);
+ EXPECT_EQ(i, length);
+ EXPECT_FALSE(decoder.ok());
+ }
+}
+
+TEST_F(DecoderTest, ReadU32v_extra_bits) {
+ byte data[] = {0x80, 0x80, 0x80, 0x80, 0x00};
+ for (int i = 1; i < 16; i++) {
+ data[4] = static_cast<byte>(i << 4);
+ int length = 0;
+ decoder.Reset(data, data + sizeof(data));
+ decoder.checked_read_u32v(decoder.start(), 0, &length);
+ EXPECT_EQ(5, length);
+ EXPECT_FALSE(decoder.ok());
+ }
+}
+
+TEST_F(DecoderTest, ReadI32v_extra_bits_negative) {
+ // OK for negative signed values to have extra ones.
+ int length = 0;
+ byte data[] = {0xff, 0xff, 0xff, 0xff, 0x7f};
+ decoder.Reset(data, data + sizeof(data));
+ decoder.checked_read_i32v(decoder.start(), 0, &length);
+ EXPECT_EQ(5, length);
+ EXPECT_TRUE(decoder.ok());
+}
+
+TEST_F(DecoderTest, ReadI32v_extra_bits_positive) {
+ // Not OK for positive signed values to have extra ones.
+ int length = 0;
+ byte data[] = {0x80, 0x80, 0x80, 0x80, 0x77};
+ decoder.Reset(data, data + sizeof(data));
+ decoder.checked_read_i32v(decoder.start(), 0, &length);
+ EXPECT_EQ(5, length);
+ EXPECT_FALSE(decoder.ok());
+}
+
+TEST_F(DecoderTest, ReadU32v_Bits) {
+ // A more exhaustive test.
+ const int kMaxSize = 5;
+ const uint32_t kVals[] = {
+ 0xaabbccdd, 0x11223344, 0x33445566, 0xffeeddcc, 0xF0F0F0F0, 0x0F0F0F0F,
+ 0xEEEEEEEE, 0xAAAAAAAA, 0x12345678, 0x9abcdef0, 0x80309488, 0x729ed997,
+ 0xc4a0cf81, 0x16c6eb85, 0x4206db8e, 0xf3b089d5, 0xaa2e223e, 0xf99e29c8,
+ 0x4a4357d8, 0x1890b1c1, 0x8d80a085, 0xacb6ae4c, 0x1b827e10, 0xeb5c7bd9,
+ 0xbb1bc146, 0xdf57a33l};
+ byte data[kMaxSize];
+
+ // foreach value in above array
+ for (size_t v = 0; v < arraysize(kVals); v++) {
+ // foreach length 1...32
+ for (int i = 1; i <= 32; i++) {
+ uint32_t val = kVals[v];
+ if (i < 32) val &= ((1 << i) - 1);
+
+ int length = 1 + i / 7;
+ for (int j = 0; j < kMaxSize; j++) {
+ data[j] = static_cast<byte>((val >> (7 * j)) & MASK_7);
+ }
+ for (int j = 0; j < length - 1; j++) {
+ data[j] |= 0x80;
+ }
+
+ // foreach buffer size 0...5
+ for (int limit = 0; limit <= kMaxSize; limit++) {
+ decoder.Reset(data, data + limit);
+ int rlen;
+ uint32_t result = decoder.checked_read_u32v(data, 0, &rlen);
+ if (limit < length) {
+ EXPECT_FALSE(decoder.ok());
+ } else {
+ EXPECT_TRUE(decoder.ok());
+ EXPECT_EQ(val, result);
+ EXPECT_EQ(length, rlen);
+ }
+ }
+ }
+ }
+}
+
+TEST_F(DecoderTest, ReadU64v_OneByte) {
+ CHECK_UINT64V_INLINE(0, 1, 0);
+ CHECK_UINT64V_INLINE(6, 1, 6);
+ CHECK_UINT64V_INLINE(8, 1, 8);
+ CHECK_UINT64V_INLINE(12, 1, 12);
+ CHECK_UINT64V_INLINE(33, 1, 33);
+ CHECK_UINT64V_INLINE(59, 1, 59);
+ CHECK_UINT64V_INLINE(110, 1, 110);
+ CHECK_UINT64V_INLINE(125, 1, 125);
+ CHECK_UINT64V_INLINE(126, 1, 126);
+ CHECK_UINT64V_INLINE(127, 1, 127);
+}
+
+TEST_F(DecoderTest, ReadI64v_OneByte) {
+ CHECK_INT64V_INLINE(0, 1, 0);
+ CHECK_INT64V_INLINE(4, 1, 4);
+ CHECK_INT64V_INLINE(6, 1, 6);
+ CHECK_INT64V_INLINE(9, 1, 9);
+ CHECK_INT64V_INLINE(33, 1, 33);
+ CHECK_INT64V_INLINE(61, 1, 61);
+ CHECK_INT64V_INLINE(63, 1, 63);
+
+ CHECK_INT64V_INLINE(-1, 1, 127);
+ CHECK_INT64V_INLINE(-2, 1, 126);
+ CHECK_INT64V_INLINE(-11, 1, 117);
+ CHECK_INT64V_INLINE(-62, 1, 66);
+ CHECK_INT64V_INLINE(-63, 1, 65);
+ CHECK_INT64V_INLINE(-64, 1, 64);
+}
+
+TEST_F(DecoderTest, ReadU64v_PowerOf2) {
+ const int kMaxSize = 10;
+ byte data[kMaxSize];
+
+ for (int i = 0; i < 64; i++) {
+ const uint64_t val = 1ull << i;
+ int index = i / 7;
+ data[index] = 1 << (i % 7);
+ memset(data, 0x80, index);
+
+ for (int limit = 0; limit <= kMaxSize; limit++) {
+ decoder.Reset(data, data + limit);
+ int length;
+ uint64_t result = decoder.checked_read_u64v(data, 0, &length);
+ if (limit <= index) {
+ EXPECT_FALSE(decoder.ok());
+ } else {
+ EXPECT_TRUE(decoder.ok());
+ EXPECT_EQ(val, result);
+ EXPECT_EQ(index + 1, length);
+ }
+ }
+ }
+}
+
+TEST_F(DecoderTest, ReadU64v_Bits) {
+ const int kMaxSize = 10;
+ const uint64_t kVals[] = {
+ 0xaabbccdd11223344ull, 0x33445566ffeeddccull, 0xF0F0F0F0F0F0F0F0ull,
+ 0x0F0F0F0F0F0F0F0Full, 0xEEEEEEEEEEEEEEEEull, 0xAAAAAAAAAAAAAAAAull,
+ 0x123456789abcdef0ull, 0x80309488729ed997ull, 0xc4a0cf8116c6eb85ull,
+ 0x4206db8ef3b089d5ull, 0xaa2e223ef99e29c8ull, 0x4a4357d81890b1c1ull,
+ 0x8d80a085acb6ae4cull, 0x1b827e10eb5c7bd9ull, 0xbb1bc146df57a338ull};
+ byte data[kMaxSize];
+
+ // foreach value in above array
+ for (size_t v = 0; v < arraysize(kVals); v++) {
+ // foreach length 1...64
+ for (int i = 1; i <= 64; i++) {
+ uint64_t val = kVals[v];
+ if (i < 64) val &= ((1ull << i) - 1);
+
+ int length = 1 + i / 7;
+ for (int j = 0; j < kMaxSize; j++) {
+ data[j] = static_cast<byte>((val >> (7 * j)) & MASK_7);
+ }
+ for (int j = 0; j < length - 1; j++) {
+ data[j] |= 0x80;
+ }
+
+ // foreach buffer size 0...10
+ for (int limit = 0; limit <= kMaxSize; limit++) {
+ decoder.Reset(data, data + limit);
+ int rlen;
+ uint64_t result = decoder.checked_read_u64v(data, 0, &rlen);
+ if (limit < length) {
+ EXPECT_FALSE(decoder.ok());
+ } else {
+ EXPECT_TRUE(decoder.ok());
+ EXPECT_EQ(val, result);
+ EXPECT_EQ(length, rlen);
+ }
+ }
+ }
+ }
+}
+
+TEST_F(DecoderTest, ReadI64v_Bits) {
+ const int kMaxSize = 10;
+ // Exhaustive signedness test.
+ const uint64_t kVals[] = {
+ 0xaabbccdd11223344ull, 0x33445566ffeeddccull, 0xF0F0F0F0F0F0F0F0ull,
+ 0x0F0F0F0F0F0F0F0Full, 0xEEEEEEEEEEEEEEEEull, 0xAAAAAAAAAAAAAAAAull,
+ 0x123456789abcdef0ull, 0x80309488729ed997ull, 0xc4a0cf8116c6eb85ull,
+ 0x4206db8ef3b089d5ull, 0xaa2e223ef99e29c8ull, 0x4a4357d81890b1c1ull,
+ 0x8d80a085acb6ae4cull, 0x1b827e10eb5c7bd9ull, 0xbb1bc146df57a338ull};
+ byte data[kMaxSize];
+
+ // foreach value in above array
+ for (size_t v = 0; v < arraysize(kVals); v++) {
+ // foreach length 1...64
+ for (int i = 1; i <= 64; i++) {
+ const int64_t val = bit_cast<int64_t>(kVals[v] << (64 - i)) >> (64 - i);
+
+ int length = 1 + i / 7;
+ for (int j = 0; j < kMaxSize; j++) {
+ data[j] = static_cast<byte>((val >> (7 * j)) & MASK_7);
+ }
+ for (int j = 0; j < length - 1; j++) {
+ data[j] |= 0x80;
+ }
+
+ // foreach buffer size 0...10
+ for (int limit = 0; limit <= kMaxSize; limit++) {
+ decoder.Reset(data, data + limit);
+ int rlen;
+ int64_t result = decoder.checked_read_i64v(data, 0, &rlen);
+ if (limit < length) {
+ EXPECT_FALSE(decoder.ok());
+ } else {
+ EXPECT_TRUE(decoder.ok());
+ EXPECT_EQ(val, result);
+ EXPECT_EQ(length, rlen);
+ }
+ }
+ }
+ }
+}
+
+TEST_F(DecoderTest, ReadU64v_extra_bits) {
+ byte data[] = {0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x00};
+ for (int i = 1; i < 128; i++) {
+ data[9] = static_cast<byte>(i << 1);
+ int length = 0;
+ decoder.Reset(data, data + sizeof(data));
+ decoder.checked_read_u64v(decoder.start(), 0, &length);
+ EXPECT_EQ(10, length);
+ EXPECT_FALSE(decoder.ok());
+ }
+}
+
+TEST_F(DecoderTest, ReadI64v_extra_bits_negative) {
+ // OK for negative signed values to have extra ones.
+ int length = 0;
+ byte data[] = {0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x7f};
+ decoder.Reset(data, data + sizeof(data));
+ decoder.checked_read_i64v(decoder.start(), 0, &length);
+ EXPECT_EQ(10, length);
+ EXPECT_TRUE(decoder.ok());
+}
+
+TEST_F(DecoderTest, ReadI64v_extra_bits_positive) {
+ // Not OK for positive signed values to have extra ones.
+ int length = 0;
+ byte data[] = {0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x77};
+ decoder.Reset(data, data + sizeof(data));
+ decoder.checked_read_i64v(decoder.start(), 0, &length);
+ EXPECT_EQ(10, length);
+ EXPECT_FALSE(decoder.ok());
+}
+
+} // namespace wasm
+} // namespace internal
+} // namespace v8
diff --git a/test/unittests/wasm/encoder-unittest.cc b/test/unittests/wasm/encoder-unittest.cc
index e09e71a..740c054 100644
--- a/test/unittests/wasm/encoder-unittest.cc
+++ b/test/unittests/wasm/encoder-unittest.cc
@@ -52,7 +52,8 @@
TEST_F(EncoderTest, Function_Builder_Variable_Indexing) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
WasmModuleBuilder* builder = new (&zone) WasmModuleBuilder(&zone);
uint16_t f_index = builder->AddFunction();
WasmFunctionBuilder* function = builder->FunctionAt(f_index);
@@ -86,14 +87,12 @@
byte* header = buffer;
byte* body = buffer + f->HeaderSize();
f->Serialize(buffer, &header, &body);
- for (size_t i = 0; i < 7; i++) {
- CHECK_EQ(i, static_cast<size_t>(*(buffer + 2 * i + f->HeaderSize() + 1)));
- }
}
TEST_F(EncoderTest, Function_Builder_Indexing_Variable_Width) {
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
WasmModuleBuilder* builder = new (&zone) WasmModuleBuilder(&zone);
uint16_t f_index = builder->AddFunction();
WasmFunctionBuilder* function = builder->FunctionAt(f_index);
@@ -109,17 +108,85 @@
byte* body = buffer + f->HeaderSize();
f->Serialize(buffer, &header, &body);
body = buffer + f->HeaderSize();
- for (size_t i = 0; i < 127; i++) {
- CHECK_EQ(kExprGetLocal, static_cast<size_t>(*(body + 2 * i)));
- CHECK_EQ(i + 1, static_cast<size_t>(*(body + 2 * i + 1)));
- }
- CHECK_EQ(kExprGetLocal, static_cast<size_t>(*(body + 2 * 127)));
- CHECK_EQ(0x80, static_cast<size_t>(*(body + 2 * 127 + 1)));
- CHECK_EQ(0x01, static_cast<size_t>(*(body + 2 * 127 + 2)));
- CHECK_EQ(kExprGetLocal, static_cast<size_t>(*(body + 2 * 127 + 3)));
- CHECK_EQ(0x00, static_cast<size_t>(*(body + 2 * 127 + 4)));
}
+TEST_F(EncoderTest, Function_Builder_Block_Variable_Width) {
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
+ WasmModuleBuilder* builder = new (&zone) WasmModuleBuilder(&zone);
+ uint16_t f_index = builder->AddFunction();
+ WasmFunctionBuilder* function = builder->FunctionAt(f_index);
+ function->EmitWithVarInt(kExprBlock, 200);
+ for (int i = 0; i < 200; ++i) {
+ function->Emit(kExprNop);
+ }
+
+ WasmFunctionEncoder* f = function->Build(&zone, builder);
+ CHECK_EQ(f->BodySize(), 204);
+}
+
+TEST_F(EncoderTest, Function_Builder_EmitEditableVarIntImmediate) {
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
+ WasmModuleBuilder* builder = new (&zone) WasmModuleBuilder(&zone);
+ uint16_t f_index = builder->AddFunction();
+ WasmFunctionBuilder* function = builder->FunctionAt(f_index);
+ function->Emit(kExprLoop);
+ uint32_t offset = function->EmitEditableVarIntImmediate();
+ for (int i = 0; i < 200; ++i) {
+ function->Emit(kExprNop);
+ }
+ function->EditVarIntImmediate(offset, 200);
+
+ WasmFunctionEncoder* f = function->Build(&zone, builder);
+ CHECK_EQ(f->BodySize(), 204);
+}
+
+TEST_F(EncoderTest, Function_Builder_EmitEditableVarIntImmediate_Locals) {
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
+ WasmModuleBuilder* builder = new (&zone) WasmModuleBuilder(&zone);
+ uint16_t f_index = builder->AddFunction();
+ WasmFunctionBuilder* function = builder->FunctionAt(f_index);
+ function->Emit(kExprBlock);
+ uint32_t offset = function->EmitEditableVarIntImmediate();
+ for (int i = 0; i < 200; ++i) {
+ AddLocal(function, kAstI32);
+ }
+ function->EditVarIntImmediate(offset, 200);
+
+ WasmFunctionEncoder* f = function->Build(&zone, builder);
+ ZoneVector<uint8_t> buffer_vector(f->HeaderSize() + f->BodySize(), &zone);
+ byte* buffer = &buffer_vector[0];
+ byte* header = buffer;
+ byte* body = buffer + f->HeaderSize();
+ f->Serialize(buffer, &header, &body);
+ body = buffer + f->HeaderSize();
+
+ CHECK_EQ(f->BodySize(), 479);
+ const uint8_t varint200_low = (200 & 0x7f) | 0x80;
+ const uint8_t varint200_high = (200 >> 7) & 0x7f;
+ offset = 0;
+ CHECK_EQ(body[offset++], 1); // Local decl count.
+ CHECK_EQ(body[offset++], varint200_low);
+ CHECK_EQ(body[offset++], varint200_high);
+ CHECK_EQ(body[offset++], kLocalI32);
+ CHECK_EQ(body[offset++], kExprBlock);
+ CHECK_EQ(body[offset++], varint200_low);
+ CHECK_EQ(body[offset++], varint200_high);
+ // GetLocal with one-byte indices.
+ for (int i = 0; i <= 127; ++i) {
+ CHECK_EQ(body[offset++], kExprGetLocal);
+ CHECK_EQ(body[offset++], i);
+ }
+ // GetLocal with two-byte indices.
+ for (int i = 128; i < 200; ++i) {
+ CHECK_EQ(body[offset++], kExprGetLocal);
+ CHECK_EQ(body[offset++], (i & 0x7f) | 0x80);
+ CHECK_EQ(body[offset++], (i >> 7) & 0x7f);
+ }
+ CHECK_EQ(offset, 479);
+}
TEST_F(EncoderTest, LEB_Functions) {
byte leb_value[5] = {0, 0, 0, 0, 0};
diff --git a/test/unittests/wasm/loop-assignment-analysis-unittest.cc b/test/unittests/wasm/loop-assignment-analysis-unittest.cc
index 9586219..e77c1cf 100644
--- a/test/unittests/wasm/loop-assignment-analysis-unittest.cc
+++ b/test/unittests/wasm/loop-assignment-analysis-unittest.cc
@@ -23,25 +23,12 @@
class WasmLoopAssignmentAnalyzerTest : public TestWithZone {
public:
- WasmLoopAssignmentAnalyzerTest() : TestWithZone(), sigs() {
- init_env(&env, sigs.v_v());
- }
-
+ WasmLoopAssignmentAnalyzerTest() : num_locals(0) {}
TestSignatures sigs;
- FunctionEnv env;
-
- static void init_env(FunctionEnv* env, FunctionSig* sig) {
- env->module = nullptr;
- env->sig = sig;
- env->local_i32_count = 0;
- env->local_i64_count = 0;
- env->local_f32_count = 0;
- env->local_f64_count = 0;
- env->SumLocals();
- }
+ uint32_t num_locals;
BitVector* Analyze(const byte* start, const byte* end) {
- return AnalyzeLoopAssignmentForTesting(zone(), &env, start, end);
+ return AnalyzeLoopAssignmentForTesting(zone(), num_locals, start, end);
}
};
@@ -60,13 +47,13 @@
for (int j = 0; j < assigned->length(); j++) {
CHECK_EQ(false, assigned->Contains(j));
}
- env.AddLocals(kAstI32, 1);
+ num_locals++;
}
}
TEST_F(WasmLoopAssignmentAnalyzerTest, One) {
- env.AddLocals(kAstI32, 5);
+ num_locals = 5;
for (int i = 0; i < 5; i++) {
byte code[] = {WASM_LOOP(1, WASM_SET_ZERO(i))};
BitVector* assigned = Analyze(code, code + arraysize(code));
@@ -78,7 +65,7 @@
TEST_F(WasmLoopAssignmentAnalyzerTest, OneBeyond) {
- env.AddLocals(kAstI32, 5);
+ num_locals = 5;
for (int i = 0; i < 5; i++) {
byte code[] = {WASM_LOOP(1, WASM_SET_ZERO(i)), WASM_SET_ZERO(1)};
BitVector* assigned = Analyze(code, code + arraysize(code));
@@ -90,7 +77,7 @@
TEST_F(WasmLoopAssignmentAnalyzerTest, Two) {
- env.AddLocals(kAstI32, 5);
+ num_locals = 5;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
byte code[] = {WASM_LOOP(2, WASM_SET_ZERO(i), WASM_SET_ZERO(j))};
@@ -105,7 +92,7 @@
TEST_F(WasmLoopAssignmentAnalyzerTest, NestedIf) {
- env.AddLocals(kAstI32, 5);
+ num_locals = 5;
for (int i = 0; i < 5; i++) {
byte code[] = {WASM_LOOP(
1, WASM_IF_ELSE(WASM_SET_ZERO(0), WASM_SET_ZERO(i), WASM_SET_ZERO(1)))};
@@ -126,7 +113,7 @@
TEST_F(WasmLoopAssignmentAnalyzerTest, BigLocal) {
- env.AddLocals(kAstI32, 65000);
+ num_locals = 65000;
for (int i = 13; i < 65000; i = static_cast<int>(i * 1.5)) {
byte code[] = {kExprLoop,
1,
@@ -148,7 +135,7 @@
TEST_F(WasmLoopAssignmentAnalyzerTest, Break) {
- env.AddLocals(kAstI32, 3);
+ num_locals = 3;
byte code[] = {
WASM_LOOP(1, WASM_IF(WASM_GET_LOCAL(0), WASM_BRV(1, WASM_SET_ZERO(1)))),
WASM_SET_ZERO(0)};
@@ -162,7 +149,7 @@
TEST_F(WasmLoopAssignmentAnalyzerTest, Loop1) {
- env.AddLocals(kAstI32, 5);
+ num_locals = 5;
byte code[] = {
WASM_LOOP(1, WASM_IF(WASM_GET_LOCAL(0),
WASM_BRV(0, WASM_SET_LOCAL(
@@ -179,9 +166,8 @@
TEST_F(WasmLoopAssignmentAnalyzerTest, Loop2) {
- env.AddLocals(kAstI32, 3);
+ num_locals = 6;
const byte kIter = 0;
- env.AddLocals(kAstF32, 3);
const byte kSum = 3;
byte code[] = {WASM_BLOCK(
diff --git a/test/unittests/wasm/module-decoder-unittest.cc b/test/unittests/wasm/module-decoder-unittest.cc
index 467ffcc..44e7865 100644
--- a/test/unittests/wasm/module-decoder-unittest.cc
+++ b/test/unittests/wasm/module-decoder-unittest.cc
@@ -5,20 +5,26 @@
#include "test/unittests/test-utils.h"
#include "src/wasm/module-decoder.h"
+#include "src/wasm/wasm-macro-gen.h"
#include "src/wasm/wasm-opcodes.h"
namespace v8 {
namespace internal {
namespace wasm {
-class WasmModuleVerifyTest : public TestWithZone {
- public:
- ModuleResult DecodeModule(const byte* module_start, const byte* module_end) {
- return DecodeWasmModule(nullptr, zone(), module_start, module_end, false,
- false);
- }
-};
+#define EMPTY_FUNCTION(sig_index) 0, SIG_INDEX(sig_index), U16_LE(0)
+#define EMPTY_FUNCTION_SIZE ((size_t)5)
+#define EMPTY_BODY 0
+#define EMPTY_BODY_SIZE ((size_t)1)
+#define NOP_BODY 2, 0, kExprNop
+#define NOP_BODY_SIZE ((size_t)3)
+#define VOID_VOID_SIG 0, kLocalVoid
+#define VOID_VOID_SIG_SIZE ((size_t)2)
+#define INT_INT_SIG 1, kLocalI32, kLocalI32
+#define INT_INT_SIG_SIZE ((size_t)3)
+#define SECTION(NAME, EXTRA_SIZE) \
+ U32V_1(WASM_SECTION_##NAME##_SIZE + (EXTRA_SIZE)), WASM_SECTION_##NAME
#define EXPECT_VERIFIES(data) \
do { \
@@ -27,14 +33,30 @@
if (result.val) delete result.val; \
} while (false)
-
-#define EXPECT_FAILURE(data) \
- do { \
- ModuleResult result = DecodeModule(data, data + arraysize(data)); \
- EXPECT_FALSE(result.ok()); \
- if (result.val) delete result.val; \
+#define EXPECT_FAILURE_LEN(data, length) \
+ do { \
+ ModuleResult result = DecodeModule(data, data + length); \
+ EXPECT_FALSE(result.ok()); \
+ if (result.val) delete result.val; \
} while (false)
+#define EXPECT_FAILURE(data) EXPECT_FAILURE_LEN(data, sizeof(data))
+
+#define EXPECT_OFF_END_FAILURE(data, min, max) \
+ do { \
+ for (size_t length = min; length < max; length++) { \
+ EXPECT_FAILURE_LEN(data, length); \
+ } \
+ } while (false)
+
+static size_t SizeOfVarInt(size_t value) {
+ size_t size = 0;
+ do {
+ size++;
+ value = value >> 7;
+ } while (value > 0);
+ return size;
+}
struct LocalTypePair {
uint8_t code;
@@ -44,39 +66,59 @@
{kLocalF32, kAstF32},
{kLocalF64, kAstF64}};
-
-// TODO(titzer): use these macros everywhere below.
-#define U32_LE(v) \
- static_cast<byte>(v), static_cast<byte>((v) >> 8), \
- static_cast<byte>((v) >> 16), static_cast<byte>((v) >> 24)
-
-
-#define U16_LE(v) static_cast<byte>(v), static_cast<byte>((v) >> 8)
-
-
-TEST_F(WasmModuleVerifyTest, DecodeEmpty) {
- static const byte data[1]{kDeclEnd};
- {
- ModuleResult result = DecodeModule(data, data);
- EXPECT_TRUE(result.ok());
- if (result.val) delete result.val;
+class WasmModuleVerifyTest : public TestWithZone {
+ public:
+ ModuleResult DecodeModule(const byte* module_start, const byte* module_end) {
+ // Add the WASM magic and version number automatically.
+ size_t size = static_cast<size_t>(module_end - module_start);
+ byte header[] = {WASM_MODULE_HEADER};
+ size_t total = sizeof(header) + size;
+ auto temp = new byte[total];
+ memcpy(temp, header, sizeof(header));
+ memcpy(temp + sizeof(header), module_start, size);
+ ModuleResult result = DecodeWasmModule(nullptr, zone(), temp, temp + total,
+ false, kWasmOrigin);
+ delete[] temp;
+ return result;
}
- {
- ModuleResult result = DecodeModule(data, data + 1);
- EXPECT_TRUE(result.ok());
+ ModuleResult DecodeModuleNoHeader(const byte* module_start,
+ const byte* module_end) {
+ return DecodeWasmModule(nullptr, zone(), module_start, module_end, false,
+ kWasmOrigin);
+ }
+};
+
+TEST_F(WasmModuleVerifyTest, WrongMagic) {
+ for (uint32_t x = 1; x; x <<= 1) {
+ const byte data[] = {U32_LE(kWasmMagic ^ x), U32_LE(kWasmVersion),
+ SECTION(END, 0)};
+ ModuleResult result = DecodeModuleNoHeader(data, data + sizeof(data));
+ EXPECT_FALSE(result.ok());
if (result.val) delete result.val;
}
}
+TEST_F(WasmModuleVerifyTest, WrongVersion) {
+ for (uint32_t x = 1; x; x <<= 1) {
+ const byte data[] = {U32_LE(kWasmMagic), U32_LE(kWasmVersion ^ x),
+ SECTION(END, 0)};
+ ModuleResult result = DecodeModuleNoHeader(data, data + sizeof(data));
+ EXPECT_FALSE(result.ok());
+ if (result.val) delete result.val;
+ }
+}
+
+TEST_F(WasmModuleVerifyTest, DecodeEmpty) {
+ static const byte data[] = {SECTION(END, 0)};
+ EXPECT_VERIFIES(data);
+}
TEST_F(WasmModuleVerifyTest, OneGlobal) {
static const byte data[] = {
- kDeclGlobals,
+ SECTION(GLOBALS, 7), // --
1,
- 0,
- 0,
- 0,
- 0, // name offset
+ NAME_LENGTH(1),
+ 'g', // name
kMemI32, // memory type
0, // exported
};
@@ -85,13 +127,13 @@
// Should decode to exactly one global.
ModuleResult result = DecodeModule(data, data + arraysize(data));
EXPECT_TRUE(result.ok());
- EXPECT_EQ(1, result.val->globals->size());
- EXPECT_EQ(0, result.val->functions->size());
- EXPECT_EQ(0, result.val->data_segments->size());
+ EXPECT_EQ(1, result.val->globals.size());
+ EXPECT_EQ(0, result.val->functions.size());
+ EXPECT_EQ(0, result.val->data_segments.size());
- WasmGlobal* global = &result.val->globals->back();
+ WasmGlobal* global = &result.val->globals.back();
- EXPECT_EQ(0, global->name_offset);
+ EXPECT_EQ(1, global->name_length);
EXPECT_EQ(MachineType::Int32(), global->type);
EXPECT_EQ(0, global->offset);
EXPECT_FALSE(global->exported);
@@ -99,18 +141,14 @@
if (result.val) delete result.val;
}
- for (size_t size = 1; size < arraysize(data); size++) {
- // Should fall off end of module bytes.
- ModuleResult result = DecodeModule(data, data + size);
- EXPECT_FALSE(result.ok());
- if (result.val) delete result.val;
- }
+ EXPECT_OFF_END_FAILURE(data, 1, sizeof(data));
}
TEST_F(WasmModuleVerifyTest, ZeroGlobals) {
static const byte data[] = {
- kDeclGlobals, 0, // declare 0 globals
+ SECTION(GLOBALS, 1), // --
+ 0, // declare 0 globals
};
ModuleResult result = DecodeModule(data, data + arraysize(data));
EXPECT_TRUE(result.ok());
@@ -135,16 +173,22 @@
TEST_F(WasmModuleVerifyTest, NGlobals) {
static const byte data[] = {
- 0, 0, 0, 0, // name offset
- kMemI32, // memory type
- 0, // exported
+ NO_NAME, // name length
+ kMemI32, // memory type
+ 0, // exported
};
- for (uint32_t i = 0; i < 1000000; i = i * 7 + 1) {
+
+ for (uint32_t i = 0; i < 1000000; i = i * 13 + 1) {
std::vector<byte> buffer;
- buffer.push_back(kDeclGlobals);
- AppendUint32v(buffer, i);
+ size_t size =
+ WASM_SECTION_GLOBALS_SIZE + SizeOfVarInt(i) + i * sizeof(data);
+ const byte globals[] = {U32V_5(size), WASM_SECTION_GLOBALS};
+ for (size_t g = 0; g != sizeof(globals); ++g) {
+ buffer.push_back(globals[g]);
+ }
+ AppendUint32v(buffer, i); // Number of globals.
for (uint32_t j = 0; j < i; j++) {
- buffer.insert(buffer.end(), data, data + arraysize(data));
+ buffer.insert(buffer.end(), data, data + sizeof(data));
}
ModuleResult result = DecodeModule(&buffer[0], &buffer[0] + buffer.size());
@@ -153,33 +197,25 @@
}
}
-
TEST_F(WasmModuleVerifyTest, GlobalWithInvalidNameOffset) {
static const byte data[] = {
- kDeclGlobals,
- 1, // declare one global
- 0,
- 3,
- 0,
- 0, // name offset
- kMemI32, // memory type
+ SECTION(GLOBALS, 7),
+ 1, // declare one global
+ NO_NAME, // name offset
+ 33, // memory type
0, // exported
};
EXPECT_FAILURE(data);
}
-
TEST_F(WasmModuleVerifyTest, GlobalWithInvalidMemoryType) {
static const byte data[] = {
- kDeclGlobals,
- 1, // declare one global
- 0,
- 0,
- 0,
- 0, // name offset
- 33, // memory type
- 0, // exported
+ SECTION(GLOBALS, 7),
+ 1, // declare one global
+ NO_NAME, // name offset
+ 33, // memory type
+ 0, // exported
};
EXPECT_FAILURE(data);
@@ -188,18 +224,12 @@
TEST_F(WasmModuleVerifyTest, TwoGlobals) {
static const byte data[] = {
- kDeclGlobals,
+ SECTION(GLOBALS, 13),
2,
- 0,
- 0,
- 0,
- 0, // #0: name offset
+ NO_NAME, // #0: name length
kMemF32, // memory type
0, // exported
- 0,
- 0,
- 0,
- 0, // #1: name offset
+ NO_NAME, // #1: name length
kMemF64, // memory type
1, // exported
};
@@ -208,19 +238,19 @@
// Should decode to exactly two globals.
ModuleResult result = DecodeModule(data, data + arraysize(data));
EXPECT_TRUE(result.ok());
- EXPECT_EQ(2, result.val->globals->size());
- EXPECT_EQ(0, result.val->functions->size());
- EXPECT_EQ(0, result.val->data_segments->size());
+ EXPECT_EQ(2, result.val->globals.size());
+ EXPECT_EQ(0, result.val->functions.size());
+ EXPECT_EQ(0, result.val->data_segments.size());
- WasmGlobal* g0 = &result.val->globals->at(0);
- WasmGlobal* g1 = &result.val->globals->at(1);
+ WasmGlobal* g0 = &result.val->globals[0];
+ WasmGlobal* g1 = &result.val->globals[1];
- EXPECT_EQ(0, g0->name_offset);
+ EXPECT_EQ(0, g0->name_length);
EXPECT_EQ(MachineType::Float32(), g0->type);
EXPECT_EQ(0, g0->offset);
EXPECT_FALSE(g0->exported);
- EXPECT_EQ(0, g1->name_offset);
+ EXPECT_EQ(0, g1->name_length);
EXPECT_EQ(MachineType::Float64(), g1->type);
EXPECT_EQ(0, g1->offset);
EXPECT_TRUE(g1->exported);
@@ -228,26 +258,28 @@
if (result.val) delete result.val;
}
- for (size_t size = 1; size < arraysize(data); size++) {
- // Should fall off end of module bytes.
- ModuleResult result = DecodeModule(data, data + size);
- EXPECT_FALSE(result.ok());
- if (result.val) delete result.val;
- }
+ EXPECT_OFF_END_FAILURE(data, 1, sizeof(data));
}
TEST_F(WasmModuleVerifyTest, OneSignature) {
- static const byte data[] = {
- kDeclSignatures, 1, 0, kLocalVoid // void -> void
- };
- EXPECT_VERIFIES(data);
+ {
+ static const byte data[] = {SECTION(SIGNATURES, 1 + VOID_VOID_SIG_SIZE), 1,
+ VOID_VOID_SIG};
+ EXPECT_VERIFIES(data);
+ }
+
+ {
+ static const byte data[] = {SECTION(SIGNATURES, 1 + INT_INT_SIG_SIZE), 1,
+ INT_INT_SIG};
+ EXPECT_VERIFIES(data);
+ }
}
TEST_F(WasmModuleVerifyTest, MultipleSignatures) {
static const byte data[] = {
- kDeclSignatures,
+ SECTION(SIGNATURES, 10),
3,
0,
kLocalVoid, // void -> void
@@ -262,41 +294,36 @@
ModuleResult result = DecodeModule(data, data + arraysize(data));
EXPECT_TRUE(result.ok());
- EXPECT_EQ(3, result.val->signatures->size());
- if (result.val->signatures->size() == 3) {
- EXPECT_EQ(0, result.val->signatures->at(0)->return_count());
- EXPECT_EQ(1, result.val->signatures->at(1)->return_count());
- EXPECT_EQ(1, result.val->signatures->at(2)->return_count());
+ EXPECT_EQ(3, result.val->signatures.size());
+ if (result.val->signatures.size() == 3) {
+ EXPECT_EQ(0, result.val->signatures[0]->return_count());
+ EXPECT_EQ(1, result.val->signatures[1]->return_count());
+ EXPECT_EQ(1, result.val->signatures[2]->return_count());
- EXPECT_EQ(0, result.val->signatures->at(0)->parameter_count());
- EXPECT_EQ(1, result.val->signatures->at(1)->parameter_count());
- EXPECT_EQ(2, result.val->signatures->at(2)->parameter_count());
+ EXPECT_EQ(0, result.val->signatures[0]->parameter_count());
+ EXPECT_EQ(1, result.val->signatures[1]->parameter_count());
+ EXPECT_EQ(2, result.val->signatures[2]->parameter_count());
}
if (result.val) delete result.val;
- for (size_t size = 1; size < arraysize(data); size++) {
- ModuleResult result = DecodeModule(data, data + size);
- // Should fall off the end of module bytes.
- EXPECT_FALSE(result.ok());
- if (result.val) delete result.val;
- }
+ EXPECT_OFF_END_FAILURE(data, 1, sizeof(data));
}
TEST_F(WasmModuleVerifyTest, FunctionWithoutSig) {
static const byte data[] = {
- kDeclFunctions, 1,
+ SECTION(FUNCTIONS, 25), 1,
// func#0 ------------------------------------------------------
- 0, 0, // signature index
- 0, 0, 0, 0, // name offset
- 0, 0, 0, 0, // code start offset
- 0, 0, 0, 0, // code end offset
- 1, 2, // local int32 count
- 3, 4, // local int64 count
- 5, 6, // local float32 count
- 7, 8, // local float64 count
- 0, // exported
- 1 // external
+ SIG_INDEX(0), // signature index
+ NO_NAME, // name length
+ U32_LE(0), // code start offset
+ U32_LE(0), // code end offset
+ U16_LE(899), // local int32 count
+ U16_LE(799), // local int64 count
+ U16_LE(699), // local float32 count
+ U16_LE(599), // local float64 count
+ 0, // exported
+ 1 // external
};
ModuleResult result = DecodeModule(data, data + arraysize(data));
@@ -306,23 +333,23 @@
TEST_F(WasmModuleVerifyTest, OneEmptyVoidVoidFunction) {
- const int kCodeStartOffset = 23;
+ const int kCodeStartOffset = 51;
const int kCodeEndOffset = kCodeStartOffset + 1;
static const byte data[] = {
- kDeclSignatures, 1,
+ SECTION(SIGNATURES, 1 + VOID_VOID_SIG_SIZE), 1,
// sig#0 -------------------------------------------------------
- 0, 0, // void -> void
+ VOID_VOID_SIG,
// func#0 ------------------------------------------------------
- kDeclFunctions, 1,
- kDeclFunctionLocals | kDeclFunctionExport | kDeclFunctionName, 0,
- 0, // signature index
- 9, 0, 0, 0, // name offset
- 11, 2, // local int32 count
- 13, 4, // local int64 count
- 15, 6, // local float32 count
- 17, 8, // local float64 count
- 1, 0, // size
+ SECTION(FUNCTIONS, 19), 1,
+ kDeclFunctionLocals | kDeclFunctionExport | kDeclFunctionName,
+ SIG_INDEX(0), // signature index
+ NAME_LENGTH(2), 'h', 'i', // name
+ U16_LE(1466), // local int32 count
+ U16_LE(1355), // local int64 count
+ U16_LE(1244), // local float32 count
+ U16_LE(1133), // local float64 count
+ 1, 0, // size
kExprNop,
};
@@ -330,22 +357,23 @@
// Should decode to exactly one function.
ModuleResult result = DecodeModule(data, data + arraysize(data));
EXPECT_TRUE(result.ok());
- EXPECT_EQ(0, result.val->globals->size());
- EXPECT_EQ(1, result.val->signatures->size());
- EXPECT_EQ(1, result.val->functions->size());
- EXPECT_EQ(0, result.val->data_segments->size());
- EXPECT_EQ(0, result.val->function_table->size());
+ EXPECT_EQ(0, result.val->globals.size());
+ EXPECT_EQ(1, result.val->signatures.size());
+ EXPECT_EQ(1, result.val->functions.size());
+ EXPECT_EQ(0, result.val->data_segments.size());
+ EXPECT_EQ(0, result.val->function_table.size());
- WasmFunction* function = &result.val->functions->back();
+ WasmFunction* function = &result.val->functions.back();
- EXPECT_EQ(9, function->name_offset);
+ EXPECT_EQ(39, function->name_offset);
+ EXPECT_EQ(2, function->name_length);
EXPECT_EQ(kCodeStartOffset, function->code_start_offset);
EXPECT_EQ(kCodeEndOffset, function->code_end_offset);
- EXPECT_EQ(523, function->local_i32_count);
- EXPECT_EQ(1037, function->local_i64_count);
- EXPECT_EQ(1551, function->local_f32_count);
- EXPECT_EQ(2065, function->local_f64_count);
+ EXPECT_EQ(1466, function->local_i32_count);
+ EXPECT_EQ(1355, function->local_i64_count);
+ EXPECT_EQ(1244, function->local_f32_count);
+ EXPECT_EQ(1133, function->local_f64_count);
EXPECT_TRUE(function->exported);
EXPECT_FALSE(function->external);
@@ -353,32 +381,26 @@
if (result.val) delete result.val;
}
- for (size_t size = 5; size < arraysize(data); size++) {
- // Should fall off end of module bytes.
- ModuleResult result = DecodeModule(data, data + size);
- EXPECT_FALSE(result.ok());
- if (result.val) delete result.val;
- }
+ EXPECT_OFF_END_FAILURE(data, 16, sizeof(data));
}
TEST_F(WasmModuleVerifyTest, OneFunctionImported) {
static const byte data[] = {
- kDeclSignatures, 1,
+ SECTION(SIGNATURES, VOID_VOID_SIG_SIZE), 1,
// sig#0 -------------------------------------------------------
- 0, 0, // void -> void
- kDeclFunctions, 1,
+ VOID_VOID_SIG, SECTION(FUNCTIONS, 6), 1,
// func#0 ------------------------------------------------------
kDeclFunctionImport, // no name, no locals, imported
- 0, 0, // signature index
+ SIG_INDEX(0),
};
ModuleResult result = DecodeModule(data, data + arraysize(data));
EXPECT_TRUE(result.ok());
- EXPECT_EQ(1, result.val->functions->size());
- WasmFunction* function = &result.val->functions->back();
+ EXPECT_EQ(1, result.val->functions.size());
+ WasmFunction* function = &result.val->functions.back();
- EXPECT_EQ(0, function->name_offset);
+ EXPECT_EQ(0, function->name_length);
EXPECT_EQ(0, function->code_start_offset);
EXPECT_EQ(0, function->code_end_offset);
@@ -393,16 +415,15 @@
if (result.val) delete result.val;
}
-
TEST_F(WasmModuleVerifyTest, OneFunctionWithNopBody) {
- static const byte kCodeStartOffset = 11;
+ static const byte kCodeStartOffset = 40;
static const byte kCodeEndOffset = kCodeStartOffset + 1;
static const byte data[] = {
- kDeclSignatures, 1,
+ SECTION(SIGNATURES, 3), 1,
// sig#0 -------------------------------------------------------
0, 0, // void -> void
- kDeclFunctions, 1,
+ SECTION(FUNCTIONS, 7), 1,
// func#0 ------------------------------------------------------
0, // no name, no locals
0, 0, // signature index
@@ -412,10 +433,10 @@
ModuleResult result = DecodeModule(data, data + arraysize(data));
EXPECT_TRUE(result.ok());
- EXPECT_EQ(1, result.val->functions->size());
- WasmFunction* function = &result.val->functions->back();
+ EXPECT_EQ(1, result.val->functions.size());
+ WasmFunction* function = &result.val->functions.back();
- EXPECT_EQ(0, function->name_offset);
+ EXPECT_EQ(0, function->name_length);
EXPECT_EQ(kCodeStartOffset, function->code_start_offset);
EXPECT_EQ(kCodeEndOffset, function->code_end_offset);
@@ -432,14 +453,14 @@
TEST_F(WasmModuleVerifyTest, OneFunctionWithNopBody_WithLocals) {
- static const byte kCodeStartOffset = 19;
+ static const byte kCodeStartOffset = 48;
static const byte kCodeEndOffset = kCodeStartOffset + 1;
static const byte data[] = {
- kDeclSignatures, 1,
+ SECTION(SIGNATURES, 3), 1,
// sig#0 -------------------------------------------------------
0, 0, // void -> void
- kDeclFunctions, 1,
+ SECTION(FUNCTIONS, 15), 1,
// func#0 ------------------------------------------------------
kDeclFunctionLocals, 0, 0, // signature index
1, 2, // local int32 count
@@ -452,10 +473,10 @@
ModuleResult result = DecodeModule(data, data + arraysize(data));
EXPECT_TRUE(result.ok());
- EXPECT_EQ(1, result.val->functions->size());
- WasmFunction* function = &result.val->functions->back();
+ EXPECT_EQ(1, result.val->functions.size());
+ WasmFunction* function = &result.val->functions.back();
- EXPECT_EQ(0, function->name_offset);
+ EXPECT_EQ(0, function->name_length);
EXPECT_EQ(kCodeStartOffset, function->code_start_offset);
EXPECT_EQ(kCodeEndOffset, function->code_end_offset);
@@ -472,67 +493,68 @@
TEST_F(WasmModuleVerifyTest, OneGlobalOneFunctionWithNopBodyOneDataSegment) {
- static const byte kDeclMemorySize = 4;
- static const byte kCodeStartOffset =
- 2 + kDeclMemorySize + kDeclGlobalSize + 4 + 2 + 17;
+ static const byte kCodeStartOffset = 75;
static const byte kCodeEndOffset = kCodeStartOffset + 3;
+ static const byte kDataSegmentSourceOffset = kCodeEndOffset + 20;
static const byte data[] = {
- kDeclMemory, 28, 28, 1,
+ SECTION(MEMORY, 3), 28, 28, 1,
// global#0 --------------------------------------------------
- kDeclGlobals, 1, 0, 0, 0, 0, // name offset
- kMemU8, // memory type
- 0, // exported
+ SECTION(GLOBALS, 7), 1,
+ 0, // name length
+ kMemU8, // memory type
+ 0, // exported
// sig#0 -----------------------------------------------------
- kDeclSignatures, 1, 0, 0, // void -> void
+ SECTION(SIGNATURES, 3), 1, 0, 0, // void -> void
// func#0 ----------------------------------------------------
- kDeclFunctions, 1, kDeclFunctionLocals | kDeclFunctionName, 0,
- 0, // signature index
- 9, 0, 0, 0, // name offset
- 1, 2, // local int32 count
- 3, 4, // local int64 count
- 5, 6, // local float32 count
- 7, 8, // local float64 count
- 3, 0, // body size
- kExprNop, // func#0 body
- kExprNop, // func#0 body
- kExprNop, // func#0 body
+ SECTION(FUNCTIONS, 20), 1, kDeclFunctionLocals | kDeclFunctionName, 0,
+ 0, // signature index
+ 2, 'h', 'i', // name
+ 1, 2, // local int32 count
+ 3, 4, // local int64 count
+ 5, 6, // local float32 count
+ 7, 8, // local float64 count
+ 3, 0, // body size
+ kExprNop, // func#0 body
+ kExprNop, // func#0 body
+ kExprNop, // func#0 body
// segment#0 -------------------------------------------------
- kDeclDataSegments, 1, 0xae, 0xb3, 0x08, 0, // dest addr
- 15, 0, 0, 0, // source offset
- 5, 0, 0, 0, // source size
- 1, // init
+ SECTION(DATA_SEGMENTS, 14), 1,
+ U32V_3(0x8b3ae), // dest addr
+ U32V_1(5), // source size
+ 0, 1, 2, 3, 4, // data bytes
// rest ------------------------------------------------------
- kDeclEnd,
+ SECTION(END, 0),
};
{
ModuleResult result = DecodeModule(data, data + arraysize(data));
EXPECT_TRUE(result.ok());
- EXPECT_EQ(1, result.val->globals->size());
- EXPECT_EQ(1, result.val->functions->size());
- EXPECT_EQ(1, result.val->data_segments->size());
+ EXPECT_EQ(1, result.val->globals.size());
+ EXPECT_EQ(1, result.val->functions.size());
+ EXPECT_EQ(1, result.val->data_segments.size());
- WasmGlobal* global = &result.val->globals->back();
+ WasmGlobal* global = &result.val->globals.back();
- EXPECT_EQ(0, global->name_offset);
+ EXPECT_EQ(0, global->name_length);
EXPECT_EQ(MachineType::Uint8(), global->type);
EXPECT_EQ(0, global->offset);
EXPECT_FALSE(global->exported);
- WasmFunction* function = &result.val->functions->back();
+ WasmFunction* function = &result.val->functions.back();
- EXPECT_EQ(9, function->name_offset);
+ EXPECT_EQ(63, function->name_offset);
+ EXPECT_EQ(2, function->name_length);
EXPECT_EQ(kCodeStartOffset, function->code_start_offset);
EXPECT_EQ(kCodeEndOffset, function->code_end_offset);
EXPECT_FALSE(function->exported);
EXPECT_FALSE(function->external);
- WasmDataSegment* segment = &result.val->data_segments->back();
+ WasmDataSegment* segment = &result.val->data_segments.back();
EXPECT_EQ(0x8b3ae, segment->dest_addr);
- EXPECT_EQ(15, segment->source_offset);
+ EXPECT_EQ(kDataSegmentSourceOffset, segment->source_offset);
EXPECT_EQ(5, segment->source_size);
EXPECT_TRUE(segment->init);
@@ -542,147 +564,119 @@
TEST_F(WasmModuleVerifyTest, OneDataSegment) {
+ const byte kDataSegmentSourceOffset = 39;
const byte data[] = {
- kDeclMemory, 28, 28, 1, kDeclDataSegments, 1, 0xaa, 0xbb, 0x09,
- 0, // dest addr
- 11, 0, 0,
- 0, // source offset
- 3, 0, 0,
- 0, // source size
- 1, // init
+ SECTION(MEMORY, 3),
+ 28,
+ 28,
+ 1,
+ SECTION(DATA_SEGMENTS, 8),
+ 1,
+ U32V_3(0x9bbaa), // dest addr
+ U32V_1(3), // source size
+ 'a',
+ 'b',
+ 'c' // data bytes
};
{
EXPECT_VERIFIES(data);
ModuleResult result = DecodeModule(data, data + arraysize(data));
EXPECT_TRUE(result.ok());
- EXPECT_EQ(0, result.val->globals->size());
- EXPECT_EQ(0, result.val->functions->size());
- EXPECT_EQ(1, result.val->data_segments->size());
+ EXPECT_EQ(0, result.val->globals.size());
+ EXPECT_EQ(0, result.val->functions.size());
+ EXPECT_EQ(1, result.val->data_segments.size());
- WasmDataSegment* segment = &result.val->data_segments->back();
+ WasmDataSegment* segment = &result.val->data_segments.back();
EXPECT_EQ(0x9bbaa, segment->dest_addr);
- EXPECT_EQ(11, segment->source_offset);
+ EXPECT_EQ(kDataSegmentSourceOffset, segment->source_offset);
EXPECT_EQ(3, segment->source_size);
EXPECT_TRUE(segment->init);
if (result.val) delete result.val;
}
- for (size_t size = 5; size < arraysize(data); size++) {
- // Should fall off end of module bytes.
- ModuleResult result = DecodeModule(data, data + size);
- EXPECT_FALSE(result.ok());
- if (result.val) delete result.val;
- }
+ EXPECT_OFF_END_FAILURE(data, 13, sizeof(data));
}
TEST_F(WasmModuleVerifyTest, TwoDataSegments) {
+ const byte kDataSegment0SourceOffset = 39;
+ const byte kDataSegment1SourceOffset = 39 + 8;
+
const byte data[] = {
- kDeclMemory, 28, 28, 1, kDeclDataSegments, 2, 0xee, 0xff, 0x07,
- 0, // dest addr
- 9, 0, 0,
- 0, // #0: source offset
- 4, 0, 0,
- 0, // source size
- 0, // init
- 0xcc, 0xdd, 0x06,
- 0, // #1: dest addr
- 6, 0, 0,
- 0, // source offset
- 10, 0, 0,
- 0, // source size
- 1, // init
+ SECTION(MEMORY, 3),
+ 28,
+ 28,
+ 1,
+ SECTION(DATA_SEGMENTS, 31),
+ 2, // segment count
+ U32V_3(0x7ffee), // #0: dest addr
+ U32V_1(4), // source size
+ 1,
+ 2,
+ 3,
+ 4, // data bytes
+ U32V_3(0x6ddcc), // #1: dest addr
+ U32V_1(10), // source size
+ 1,
+ 2,
+ 3,
+ 4,
+ 5,
+ 6,
+ 7,
+ 8,
+ 9,
+ 10 // data bytes
};
{
ModuleResult result = DecodeModule(data, data + arraysize(data));
EXPECT_TRUE(result.ok());
- EXPECT_EQ(0, result.val->globals->size());
- EXPECT_EQ(0, result.val->functions->size());
- EXPECT_EQ(2, result.val->data_segments->size());
+ EXPECT_EQ(0, result.val->globals.size());
+ EXPECT_EQ(0, result.val->functions.size());
+ EXPECT_EQ(2, result.val->data_segments.size());
- WasmDataSegment* s0 = &result.val->data_segments->at(0);
- WasmDataSegment* s1 = &result.val->data_segments->at(1);
+ WasmDataSegment* s0 = &result.val->data_segments[0];
+ WasmDataSegment* s1 = &result.val->data_segments[1];
EXPECT_EQ(0x7ffee, s0->dest_addr);
- EXPECT_EQ(9, s0->source_offset);
+ EXPECT_EQ(kDataSegment0SourceOffset, s0->source_offset);
EXPECT_EQ(4, s0->source_size);
- EXPECT_FALSE(s0->init);
+ EXPECT_TRUE(s0->init);
EXPECT_EQ(0x6ddcc, s1->dest_addr);
- EXPECT_EQ(6, s1->source_offset);
+ EXPECT_EQ(kDataSegment1SourceOffset, s1->source_offset);
EXPECT_EQ(10, s1->source_size);
EXPECT_TRUE(s1->init);
if (result.val) delete result.val;
}
- for (size_t size = 5; size < arraysize(data); size++) {
- // Should fall off end of module bytes.
- ModuleResult result = DecodeModule(data, data + size);
- EXPECT_FALSE(result.ok());
- if (result.val) delete result.val;
- }
+ EXPECT_OFF_END_FAILURE(data, 13, sizeof(data));
}
-
-TEST_F(WasmModuleVerifyTest, DataSegmentWithInvalidSource) {
- const int dest_addr = 0x100;
- const byte mem_size_log2 = 15;
- const int kDataSize = 19;
-
- for (int source_offset = 0; source_offset < 5 + kDataSize; source_offset++) {
- for (int source_size = -1; source_size < 5 + kDataSize; source_size += 3) {
- byte data[] = {
- kDeclMemory,
- mem_size_log2,
- mem_size_log2,
- 1,
- kDeclDataSegments,
- 1,
- U32_LE(dest_addr),
- U32_LE(source_offset),
- U32_LE(source_size),
- 1, // init
- };
-
- STATIC_ASSERT(kDataSize == arraysize(data));
-
- if (source_offset < kDataSize && source_size >= 0 &&
- (source_offset + source_size) <= kDataSize) {
- EXPECT_VERIFIES(data);
- } else {
- EXPECT_FAILURE(data);
- }
- }
- }
-}
-
-
TEST_F(WasmModuleVerifyTest, DataSegmentWithInvalidDest) {
const int source_size = 3;
- const int source_offset = 11;
- for (byte mem_size_log2 = 12; mem_size_log2 < 20; mem_size_log2++) {
- int mem_size = 1 << mem_size_log2;
+ for (byte mem_pages = 1; mem_pages < 16; mem_pages++) {
+ int mem_size = mem_pages * 0x10000; // 64k pages.
for (int dest_addr = mem_size - source_size;
dest_addr < mem_size + source_size; dest_addr++) {
- byte data[] = {
- kDeclMemory,
- mem_size_log2,
- mem_size_log2,
- 1,
- kDeclDataSegments,
- 1,
- U32_LE(dest_addr),
- U32_LE(source_offset),
- U32_LE(source_size),
- 1, // init
- };
+ byte data[] = {SECTION(MEMORY, 3),
+ mem_pages,
+ mem_pages,
+ 1,
+ SECTION(DATA_SEGMENTS, 14),
+ 1,
+ U32V_3(dest_addr),
+ U32V_1(source_size),
+ 'a',
+ 'b',
+ 'c'};
if (dest_addr <= (mem_size - source_size)) {
EXPECT_VERIFIES(data);
@@ -695,27 +689,24 @@
// To make below tests for indirect calls much shorter.
-#define FUNCTION(sig_index, external) \
- kDeclFunctionImport, static_cast<byte>(sig_index), \
- static_cast<byte>(sig_index >> 8)
-
+#define FUNCTION(sig_index, external) kDeclFunctionImport, SIG_INDEX(sig_index)
TEST_F(WasmModuleVerifyTest, OneIndirectFunction) {
static const byte data[] = {
// sig#0 -------------------------------------------------------
- kDeclSignatures, 1, 0, 0, // void -> void
+ SECTION(SIGNATURES, 3), 1, 0, 0, // void -> void
// func#0 ------------------------------------------------------
- kDeclFunctions, 1, FUNCTION(0, 0),
+ SECTION(FUNCTIONS, 4), 1, FUNCTION(0, 0),
// indirect table ----------------------------------------------
- kDeclFunctionTable, 1, 0, 0};
+ SECTION(FUNCTION_TABLE, 2), 1, U32V_1(0)};
ModuleResult result = DecodeModule(data, data + arraysize(data));
EXPECT_TRUE(result.ok());
if (result.ok()) {
- EXPECT_EQ(1, result.val->signatures->size());
- EXPECT_EQ(1, result.val->functions->size());
- EXPECT_EQ(1, result.val->function_table->size());
- EXPECT_EQ(0, result.val->function_table->at(0));
+ EXPECT_EQ(1, result.val->signatures.size());
+ EXPECT_EQ(1, result.val->functions.size());
+ EXPECT_EQ(1, result.val->function_table.size());
+ EXPECT_EQ(0, result.val->function_table[0]);
}
if (result.val) delete result.val;
}
@@ -724,23 +715,33 @@
TEST_F(WasmModuleVerifyTest, MultipleIndirectFunctions) {
static const byte data[] = {
// sig#0 -------------------------------------------------------
- kDeclSignatures, 2, 0, 0, // void -> void
- 0, kLocalI32, // void -> i32
+ SECTION(SIGNATURES, 5), 2, 0, 0, // void -> void
+ 0, kLocalI32, // void -> i32
// func#0 ------------------------------------------------------
- kDeclFunctions, 4, FUNCTION(0, 1), FUNCTION(1, 1), FUNCTION(0, 1),
- FUNCTION(1, 1),
+ SECTION(FUNCTIONS, 13), 4, FUNCTION(0, 1), // --
+ FUNCTION(1, 1), // --
+ FUNCTION(0, 1), // --
+ FUNCTION(1, 1), // --
// indirect table ----------------------------------------------
- kDeclFunctionTable, 8, 0, 0, 1, 0, 2, 0, 3, 0, 0, 0, 1, 0, 2, 0, 3, 0,
+ SECTION(FUNCTION_TABLE, 9), 8,
+ U32V_1(0), // --
+ U32V_1(1), // --
+ U32V_1(2), // --
+ U32V_1(3), // --
+ U32V_1(0), // --
+ U32V_1(1), // --
+ U32V_1(2), // --
+ U32V_1(3), // --
};
ModuleResult result = DecodeModule(data, data + arraysize(data));
EXPECT_TRUE(result.ok());
if (result.ok()) {
- EXPECT_EQ(2, result.val->signatures->size());
- EXPECT_EQ(4, result.val->functions->size());
- EXPECT_EQ(8, result.val->function_table->size());
+ EXPECT_EQ(2, result.val->signatures.size());
+ EXPECT_EQ(4, result.val->functions.size());
+ EXPECT_EQ(8, result.val->function_table.size());
for (int i = 0; i < 8; i++) {
- EXPECT_EQ(i & 3, result.val->function_table->at(i));
+ EXPECT_EQ(i & 3, result.val->function_table[i]);
}
}
if (result.val) delete result.val;
@@ -750,9 +751,9 @@
TEST_F(WasmModuleVerifyTest, IndirectFunctionNoFunctions) {
static const byte data[] = {
// sig#0 -------------------------------------------------------
- kDeclSignatures, 1, 0, 0, // void -> void
+ SECTION(SIGNATURES, 3), 1, 0, 0, // void -> void
// indirect table ----------------------------------------------
- kDeclFunctionTable, 1, 0, 0,
+ SECTION(FUNCTION_TABLE, 3), 1, 0, 0,
};
EXPECT_FAILURE(data);
@@ -762,11 +763,11 @@
TEST_F(WasmModuleVerifyTest, IndirectFunctionInvalidIndex) {
static const byte data[] = {
// sig#0 -------------------------------------------------------
- kDeclSignatures, 1, 0, 0, // void -> void
+ SECTION(SIGNATURES, 3), 1, 0, 0, // void -> void
// functions ---------------------------------------------------
- kDeclFunctions, 1, FUNCTION(0, 1),
+ SECTION(FUNCTIONS, 4), 1, FUNCTION(0, 1),
// indirect table ----------------------------------------------
- kDeclFunctionTable, 1, 1, 0,
+ SECTION(FUNCTION_TABLE, 3), 1, 1, 0,
};
EXPECT_FAILURE(data);
@@ -778,7 +779,8 @@
TEST_F(WasmSignatureDecodeTest, Ok_v_v) {
static const byte data[] = {0, 0};
- Zone zone;
+ base::AccountingAllocator allocator;
+ Zone zone(&allocator);
FunctionSig* sig =
DecodeWasmSignatureForTesting(&zone, data, data + arraysize(data));
@@ -906,10 +908,11 @@
TEST_F(WasmFunctionVerifyTest, Ok_v_v_empty) {
static const byte data[] = {
0, kLocalVoid, // signature
- 3, 0, // local int32 count
- 4, 0, // local int64 count
- 5, 0, // local float32 count
- 6, 0, // local float64 count
+ 4, // locals
+ 3, kLocalI32, // --
+ 4, kLocalI64, // --
+ 5, kLocalF32, // --
+ 6, kLocalF64, // --
kExprNop // body
};
@@ -922,12 +925,9 @@
EXPECT_EQ(0, function->sig->parameter_count());
EXPECT_EQ(0, function->sig->return_count());
EXPECT_EQ(0, function->name_offset);
- EXPECT_EQ(arraysize(data) - 1, function->code_start_offset);
+ EXPECT_EQ(2, function->code_start_offset);
EXPECT_EQ(arraysize(data), function->code_end_offset);
- EXPECT_EQ(3, function->local_i32_count);
- EXPECT_EQ(4, function->local_i64_count);
- EXPECT_EQ(5, function->local_f32_count);
- EXPECT_EQ(6, function->local_f64_count);
+ // TODO(titzer): verify encoding of local declarations
EXPECT_FALSE(function->external);
EXPECT_FALSE(function->exported);
}
@@ -935,156 +935,445 @@
if (result.val) delete result.val;
}
+TEST_F(WasmModuleVerifyTest, SectionWithoutNameLength) {
+ const byte data[] = {1};
+ EXPECT_FAILURE(data);
+}
-TEST_F(WasmModuleVerifyTest, WLLSectionNoLen) {
+TEST_F(WasmModuleVerifyTest, TheLoneliestOfValidModulesTheTrulyEmptyOne) {
const byte data[] = {
- kDeclWLL, // section without length.
+ 1, // Section size.
+ 0, // Empty section name.
+ // No section name, no content, nothing but sadness.
+ };
+ EXPECT_VERIFIES(data);
+}
+
+TEST_F(WasmModuleVerifyTest, OnlyUnknownSectionEmpty) {
+ const byte data[] = {
+ 5, // Section size.
+ 4, 'l', 'u', 'l', 'z', // unknown section.
+ };
+ EXPECT_VERIFIES(data);
+}
+
+TEST_F(WasmModuleVerifyTest, OnlyUnknownSectionNonEmpty) {
+ const byte data[] = {
+ 10, // Section size.
+ 4, 'l', 'u', 'l', 'z', // unknown section.
+ // Section content:
+ 0xff, 0xff, 0xff, 0xff, 0xff,
+ };
+ EXPECT_VERIFIES(data);
+}
+
+TEST_F(WasmModuleVerifyTest, SignatureFollowedByEmptyUnknownSection) {
+ const byte data[] = {
+ SECTION(SIGNATURES, 1 + VOID_VOID_SIG_SIZE), 1, VOID_VOID_SIG,
+ // -----------------------------------------------------------
+ 5, // Section size.
+ 4, 'l', 'u', 'l', 'z', // unknown section.
+ };
+ EXPECT_VERIFIES(data);
+}
+
+TEST_F(WasmModuleVerifyTest, SignatureFollowedByUnknownSection) {
+ const byte data[] = {
+ SECTION(SIGNATURES, 1 + VOID_VOID_SIG_SIZE), 1, VOID_VOID_SIG,
+ // -----------------------------------------------------------
+ 10, // Section size.
+ 4, 'l', 'u', 'l', 'z', // unknown section.
+ 0xff, 0xff, 0xff, 0xff, 0xff,
+ };
+ EXPECT_VERIFIES(data);
+}
+
+TEST_F(WasmModuleVerifyTest, SignatureFollowedByUnknownSectionWithLongLEB) {
+ const byte data[] = {
+ SECTION(SIGNATURES, 1 + VOID_VOID_SIG_SIZE), 1, VOID_VOID_SIG,
+ // -----------------------------------------------------------
+ 0x85, 0x80, 0x80, 0x80, 0x00, // Section size: 1 but in a 5-byte LEB.
+ 4, 'l', 'u', 'l', 'z', // unknown section.
+ };
+ EXPECT_VERIFIES(data);
+}
+
+TEST_F(WasmModuleVerifyTest, UnknownSectionOverflow) {
+ static const byte data[] = {
+ 13, // Section size.
+ 1, // Section name length.
+ '\0', // Section name.
+ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, // 10 byte section
};
EXPECT_FAILURE(data);
}
-
-TEST_F(WasmModuleVerifyTest, WLLSectionEmpty) {
+TEST_F(WasmModuleVerifyTest, UnknownSectionUnderflow) {
static const byte data[] = {
- kDeclWLL, 0, // empty section
- };
- ModuleResult result = DecodeModule(data, data + arraysize(data));
- EXPECT_TRUE(result.ok());
- if (result.val) delete result.val;
-}
-
-
-TEST_F(WasmModuleVerifyTest, WLLSectionOne) {
- static const byte data[] = {
- kDeclWLL,
- 1, // LEB128 1
- 0, // one byte section
- };
- ModuleResult result = DecodeModule(data, data + arraysize(data));
- EXPECT_TRUE(result.ok());
- if (result.val) delete result.val;
-}
-
-
-TEST_F(WasmModuleVerifyTest, WLLSectionTen) {
- static const byte data[] = {
- kDeclWLL,
- 10, // LEB128 10
- 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, // 10 byte section
- };
- ModuleResult result = DecodeModule(data, data + arraysize(data));
- EXPECT_TRUE(result.ok());
- if (result.val) delete result.val;
-}
-
-
-TEST_F(WasmModuleVerifyTest, WLLSectionOverflow) {
- static const byte data[] = {
- kDeclWLL,
- 11, // LEB128 11
- 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, // 10 byte section
+ 0xff, 0xff, 0xff, 0xff, 0x0f, // Section size LEB128 0xffffffff
+ 1, '\0', // Section name and name length.
+ 1, 2, 3, 4, // 4 byte section
};
EXPECT_FAILURE(data);
}
-
-TEST_F(WasmModuleVerifyTest, WLLSectionUnderflow) {
- static const byte data[] = {
- kDeclWLL, 0xff, 0xff, 0xff, 0xff, 0x0f, // LEB128 0xffffffff
- 1, 2, 3, 4, // 4 byte section
- };
- EXPECT_FAILURE(data);
-}
-
-
-TEST_F(WasmModuleVerifyTest, WLLSectionLoop) {
+TEST_F(WasmModuleVerifyTest, UnknownSectionLoop) {
// Would infinite loop decoding if wrapping and allowed.
static const byte data[] = {
- kDeclWLL, 0xfa, 0xff, 0xff, 0xff, 0x0f, // LEB128 0xfffffffa
- 1, 2, 3, 4, // 4 byte section
+ 0xfa, 0xff, 0xff, 0xff, 0x0f, // Section size LEB128 0xfffffffa
+ 1, '\0', // Section name and name length.
+ 1, 2, 3, 4, // 4 byte section
};
EXPECT_FAILURE(data);
}
+TEST_F(WasmModuleVerifyTest, UnknownSectionSkipped) {
+ static const byte data[] = {
+ 3, // Section size.
+ 1,
+ '\0', // Section name: LEB128 1, string '\0'
+ 0, // one byte section
+ SECTION(GLOBALS, 7),
+ 1,
+ 0, // name length
+ kMemI32, // memory type
+ 0, // exported
+ };
+ ModuleResult result = DecodeModule(data, data + arraysize(data));
+ EXPECT_TRUE(result.ok());
+
+ EXPECT_EQ(1, result.val->globals.size());
+ EXPECT_EQ(0, result.val->functions.size());
+ EXPECT_EQ(0, result.val->data_segments.size());
+
+ WasmGlobal* global = &result.val->globals.back();
+
+ EXPECT_EQ(0, global->name_length);
+ EXPECT_EQ(MachineType::Int32(), global->type);
+ EXPECT_EQ(0, global->offset);
+ EXPECT_FALSE(global->exported);
+
+ if (result.val) delete result.val;
+}
+
TEST_F(WasmModuleVerifyTest, ImportTable_empty) {
- static const byte data[] = {kDeclSignatures, 0, kDeclImportTable, 0};
+ static const byte data[] = {SECTION(SIGNATURES, 1), 0,
+ SECTION(IMPORT_TABLE, 1), 0};
EXPECT_VERIFIES(data);
}
TEST_F(WasmModuleVerifyTest, ImportTable_nosigs) {
- static const byte data[] = {kDeclImportTable, 0};
+ static const byte data[] = {SECTION(IMPORT_TABLE, 1), 0};
EXPECT_FAILURE(data);
}
TEST_F(WasmModuleVerifyTest, ImportTable_invalid_sig) {
static const byte data[] = {
- kDeclSignatures,
- 0,
- kDeclImportTable,
- 1,
- 0,
- 0, // sig index
- 1,
- 0,
- 0,
- 0, // module name
- 1,
- 0,
- 0,
- 0 // function name
+ SECTION(SIGNATURES, 1), 0, SECTION(IMPORT_TABLE, 6), 1,
+ IMPORT_SIG_INDEX(0), // sig index
+ NAME_LENGTH(1), 'm', // module name
+ NAME_LENGTH(1), 'f', // function name
};
EXPECT_FAILURE(data);
}
TEST_F(WasmModuleVerifyTest, ImportTable_one_sig) {
static const byte data[] = {
- kDeclSignatures,
+ SECTION(SIGNATURES, 1 + VOID_VOID_SIG_SIZE),
1,
- 0,
- static_cast<byte>(kAstStmt),
- kDeclImportTable,
- 1,
- 0,
- 0, // sig index
- 1,
- 0,
- 0,
- 0, // module name
- 1,
- 0,
- 0,
- 0 // function name
+ VOID_VOID_SIG,
+ SECTION(IMPORT_TABLE, 6),
+ 1, // --
+ IMPORT_SIG_INDEX(0), // sig index
+ NAME_LENGTH(1),
+ 'm', // module name
+ NAME_LENGTH(1),
+ 'f', // function name
};
EXPECT_VERIFIES(data);
}
+TEST_F(WasmModuleVerifyTest, ImportTable_invalid_module) {
+ static const byte data[] = {
+ SECTION(SIGNATURES, 1 + VOID_VOID_SIG_SIZE),
+ 1,
+ VOID_VOID_SIG,
+ SECTION(IMPORT_TABLE, 6),
+ 1, // --
+ IMPORT_SIG_INDEX(0), // sig index
+ NO_NAME, // module name
+ NAME_LENGTH(1),
+ 'f' // function name
+ };
+ EXPECT_FAILURE(data);
+}
+
TEST_F(WasmModuleVerifyTest, ImportTable_off_end) {
static const byte data[] = {
- kDeclSignatures,
+ SECTION(SIGNATURES, 1 + VOID_VOID_SIG_SIZE),
1,
- 0,
- static_cast<byte>(kAstStmt),
- kDeclImportTable,
+ VOID_VOID_SIG,
+ SECTION(IMPORT_TABLE, 6),
1,
- 0,
- 0, // sig index
- 1,
- 0,
- 0,
- 0, // module name
- 1,
- 0,
- 0,
- 0 // function name
+ IMPORT_SIG_INDEX(0), // sig index
+ NAME_LENGTH(1),
+ 'm', // module name
+ NAME_LENGTH(1),
+ 'f', // function name
};
- for (size_t length = 5; length < sizeof(data); length++) {
+ EXPECT_OFF_END_FAILURE(data, 16, sizeof(data));
+}
+
+TEST_F(WasmModuleVerifyTest, ExportTable_empty1) {
+ static const byte data[] = {SECTION(SIGNATURES, 1 + VOID_VOID_SIG_SIZE),
+ 1,
+ VOID_VOID_SIG,
+ SECTION(FUNCTIONS, 1 + EMPTY_FUNCTION_SIZE),
+ 1,
+ EMPTY_FUNCTION(0),
+ SECTION(EXPORT_TABLE, 1),
+ 0};
+ EXPECT_VERIFIES(data);
+}
+
+TEST_F(WasmModuleVerifyTest, ExportTable_empty2) {
+ static const byte data[] = {SECTION(SIGNATURES, 1), 0,
+ SECTION(FUNCTIONS, 1), 0,
+ SECTION(EXPORT_TABLE, 1), 0};
+ // TODO(titzer): current behavior treats empty functions section as missing.
+ EXPECT_FAILURE(data);
+}
+
+TEST_F(WasmModuleVerifyTest, ExportTable_NoFunctions1) {
+ static const byte data[] = {SECTION(SIGNATURES, 1), 0,
+ SECTION(EXPORT_TABLE, 1), 0};
+ EXPECT_FAILURE(data);
+}
+
+TEST_F(WasmModuleVerifyTest, ExportTable_NoFunctions2) {
+ static const byte data[] = {SECTION(EXPORT_TABLE, 1), 0};
+ EXPECT_FAILURE(data);
+}
+
+TEST_F(WasmModuleVerifyTest, ExportTableOne) {
+ static const byte data[] = {
+ SECTION(SIGNATURES, 1 + VOID_VOID_SIG_SIZE),
+ 1, // sigs
+ VOID_VOID_SIG, // --
+ SECTION(FUNCTIONS, 1 + EMPTY_FUNCTION_SIZE),
+ 1, // functions
+ EMPTY_FUNCTION(0), // --
+ SECTION(EXPORT_TABLE, 7),
+ 1, // exports
+ FUNC_INDEX(0), // --
+ NO_NAME // --
+ };
+ EXPECT_VERIFIES(data);
+}
+
+TEST_F(WasmModuleVerifyTest, ExportTableTwo) {
+ static const byte data[] = {
+ SECTION(SIGNATURES, 1 + VOID_VOID_SIG_SIZE),
+ 1, // sigs
+ VOID_VOID_SIG, // --
+ SECTION(FUNCTIONS, 1 + EMPTY_FUNCTION_SIZE),
+ 1, // functions
+ EMPTY_FUNCTION(0), // --
+ SECTION(EXPORT_TABLE, 12),
+ 2, // exports
+ FUNC_INDEX(0), // --
+ NAME_LENGTH(4),
+ 'n',
+ 'a',
+ 'm',
+ 'e', // --
+ FUNC_INDEX(0), // --
+ NAME_LENGTH(3),
+ 'n',
+ 'o',
+ 'm' // --
+ };
+ EXPECT_VERIFIES(data);
+}
+
+TEST_F(WasmModuleVerifyTest, ExportTableThree) {
+ static const byte data[] = {
+ SECTION(SIGNATURES, 1 + VOID_VOID_SIG_SIZE),
+ 1, // sigs
+ VOID_VOID_SIG, // --
+ SECTION(FUNCTIONS, 1 + 3 * EMPTY_FUNCTION_SIZE),
+ 3, // functions
+ EMPTY_FUNCTION(0), // --
+ EMPTY_FUNCTION(0), // --
+ EMPTY_FUNCTION(0), // --
+ SECTION(EXPORT_TABLE, 10),
+ 3, // exports
+ FUNC_INDEX(0), // --
+ NAME_LENGTH(1),
+ 'a', // --
+ FUNC_INDEX(1), // --
+ NAME_LENGTH(1),
+ 'b', // --
+ FUNC_INDEX(2), // --
+ NAME_LENGTH(1),
+ 'c' // --
+ };
+ EXPECT_VERIFIES(data);
+}
+
+TEST_F(WasmModuleVerifyTest, ExportTableThreeOne) {
+ for (int i = 0; i < 6; i++) {
+ const byte data[] = {
+ SECTION(SIGNATURES, 1 + VOID_VOID_SIG_SIZE),
+ 1, // sigs
+ VOID_VOID_SIG, // --
+ SECTION(FUNCTIONS, 1 + 3 * EMPTY_FUNCTION_SIZE),
+ 3, // functions
+ EMPTY_FUNCTION(0), // --
+ EMPTY_FUNCTION(0), // --
+ EMPTY_FUNCTION(0), // --
+ SECTION(EXPORT_TABLE, 5),
+ 1, // exports
+ FUNC_INDEX(i), // --
+ NAME_LENGTH(2),
+ 'e',
+ 'x', // --
+ };
+
+ if (i < 3) {
+ EXPECT_VERIFIES(data);
+ } else {
+ EXPECT_FAILURE(data);
+ }
+ }
+}
+
+TEST_F(WasmModuleVerifyTest, ExportTableOne_off_end) {
+ static const byte data[] = {
+ SECTION(SIGNATURES, 1 + VOID_VOID_SIG_SIZE),
+ 1, // sigs
+ VOID_VOID_SIG, // --
+ SECTION(FUNCTIONS, 1 + EMPTY_FUNCTION_SIZE),
+ 1, // functions
+ EMPTY_FUNCTION(0), // --
+ SECTION(EXPORT_TABLE, 1 + 6),
+ 1, // exports
+ FUNC_INDEX(0), // --
+ NO_NAME // --
+ };
+
+ for (int length = 33; length < sizeof(data); length++) {
ModuleResult result = DecodeModule(data, data + length);
EXPECT_FALSE(result.ok());
if (result.val) delete result.val;
}
}
+#define SIGNATURES_SECTION(count, ...) \
+ SECTION(SIGNATURES, 1 + 3 * (count)), U32V_1(count), __VA_ARGS__
+#define FUNCTION_SIGNATURES_SECTION(count, ...) \
+ SECTION(FUNCTION_SIGNATURES, 1 + (count)), U32V_1(count), __VA_ARGS__
+
+#define FOO_STRING 3, 'f', 'o', 'o'
+#define NO_LOCAL_NAMES 0
+
+#define EMPTY_SIGNATURES_SECTION SECTION(SIGNATURES, 1), 0
+#define EMPTY_FUNCTION_SIGNATURES_SECTION SECTION(FUNCTION_SIGNATURES, 1), 0
+#define EMPTY_FUNCTION_BODIES_SECTION SECTION(FUNCTION_BODIES, 1), 0
+#define EMPTY_NAMES_SECTION SECTION(NAMES, 1), 0
+
+TEST_F(WasmModuleVerifyTest, FunctionSignatures_empty) {
+ static const byte data[] = {SECTION(SIGNATURES, 1), 0,
+ SECTION(FUNCTION_SIGNATURES, 1), 0};
+ EXPECT_VERIFIES(data);
+}
+
+TEST_F(WasmModuleVerifyTest, FunctionSignatures_one) {
+ static const byte data[] = {SIGNATURES_SECTION(1, VOID_VOID_SIG),
+ FUNCTION_SIGNATURES_SECTION(1, 0)};
+ EXPECT_VERIFIES(data);
+}
+
+TEST_F(WasmModuleVerifyTest, FunctionBodies_empty) {
+ static const byte data[] = {EMPTY_SIGNATURES_SECTION,
+ EMPTY_FUNCTION_SIGNATURES_SECTION,
+ EMPTY_FUNCTION_BODIES_SECTION};
+ EXPECT_VERIFIES(data);
+}
+
+TEST_F(WasmModuleVerifyTest, FunctionBodies_one_empty) {
+ static const byte data[] = {
+ SIGNATURES_SECTION(1, VOID_VOID_SIG), FUNCTION_SIGNATURES_SECTION(1, 0),
+ SECTION(FUNCTION_BODIES, 1 + EMPTY_BODY_SIZE), 1, EMPTY_BODY};
+ EXPECT_VERIFIES(data);
+}
+
+TEST_F(WasmModuleVerifyTest, FunctionBodies_one_nop) {
+ static const byte data[] = {
+ SIGNATURES_SECTION(1, VOID_VOID_SIG), FUNCTION_SIGNATURES_SECTION(1, 0),
+ SECTION(FUNCTION_BODIES, 1 + NOP_BODY_SIZE), 1, NOP_BODY};
+ EXPECT_VERIFIES(data);
+}
+
+TEST_F(WasmModuleVerifyTest, FunctionBodies_count_mismatch1) {
+ static const byte data[] = {SIGNATURES_SECTION(1, VOID_VOID_SIG),
+ FUNCTION_SIGNATURES_SECTION(2, 0, 0),
+ SECTION(FUNCTION_BODIES, 1 + EMPTY_BODY_SIZE), 1,
+ EMPTY_BODY};
+ EXPECT_FAILURE(data);
+}
+
+TEST_F(WasmModuleVerifyTest, FunctionBodies_count_mismatch2) {
+ static const byte data[] = {SIGNATURES_SECTION(1, VOID_VOID_SIG),
+ FUNCTION_SIGNATURES_SECTION(1, 0),
+ SECTION(FUNCTION_BODIES, 1 + 2 * NOP_BODY_SIZE),
+ 2,
+ NOP_BODY,
+ NOP_BODY};
+ EXPECT_FAILURE(data);
+}
+
+TEST_F(WasmModuleVerifyTest, Names_empty) {
+ static const byte data[] = {
+ EMPTY_SIGNATURES_SECTION, EMPTY_FUNCTION_SIGNATURES_SECTION,
+ EMPTY_FUNCTION_BODIES_SECTION, EMPTY_NAMES_SECTION};
+ EXPECT_VERIFIES(data);
+}
+
+TEST_F(WasmModuleVerifyTest, Names_one_empty) {
+ static const byte data[] = {
+ SIGNATURES_SECTION(1, VOID_VOID_SIG), // --
+ FUNCTION_SIGNATURES_SECTION(1, 0), // --
+ SECTION(FUNCTION_BODIES, 1 + EMPTY_BODY_SIZE),
+ 1,
+ EMPTY_BODY, // --
+ SECTION(NAMES, 1 + 5),
+ 1,
+ FOO_STRING,
+ NO_LOCAL_NAMES // --
+ };
+ EXPECT_VERIFIES(data);
+}
+
+TEST_F(WasmModuleVerifyTest, Names_two_empty) {
+ static const byte data[] = {
+ SIGNATURES_SECTION(1, VOID_VOID_SIG), // --
+ FUNCTION_SIGNATURES_SECTION(2, 0, 0), // --
+ SECTION(FUNCTION_BODIES, 1 + 2 * EMPTY_BODY_SIZE), // --
+ 2,
+ EMPTY_BODY,
+ EMPTY_BODY, // --
+ SECTION(NAMES, 1 + 10),
+ 2, // --
+ FOO_STRING,
+ NO_LOCAL_NAMES, // --
+ FOO_STRING,
+ NO_LOCAL_NAMES, // --
+ };
+ EXPECT_VERIFIES(data);
+}
+
} // namespace wasm
} // namespace internal
} // namespace v8
diff --git a/test/unittests/wasm/wasm-macro-gen-unittest.cc b/test/unittests/wasm/wasm-macro-gen-unittest.cc
index f3f604b..ec188c0 100644
--- a/test/unittests/wasm/wasm-macro-gen-unittest.cc
+++ b/test/unittests/wasm/wasm-macro-gen-unittest.cc
@@ -26,14 +26,18 @@
EXPECT_SIZE(2, WASM_I8(122));
EXPECT_SIZE(2, WASM_I8(254));
- EXPECT_SIZE(5, WASM_I32(1));
- EXPECT_SIZE(5, WASM_I32(10000));
- EXPECT_SIZE(5, WASM_I32(-9828934));
+ EXPECT_SIZE(2, WASM_I32V_1(1));
+ EXPECT_SIZE(3, WASM_I32V_2(200));
+ EXPECT_SIZE(4, WASM_I32V_3(10000));
+ EXPECT_SIZE(5, WASM_I32V_4(-9828934));
+ EXPECT_SIZE(6, WASM_I32V_5(-1119828934));
- EXPECT_SIZE(9, WASM_I64(1));
- EXPECT_SIZE(9, WASM_I64(10000));
- EXPECT_SIZE(9, WASM_I64(-9828934));
- EXPECT_SIZE(9, WASM_I64(0x123456789abcdef0ULL));
+ EXPECT_SIZE(2, WASM_I64V_1(1));
+ EXPECT_SIZE(3, WASM_I64V_2(300));
+ EXPECT_SIZE(4, WASM_I64V_3(10000));
+ EXPECT_SIZE(5, WASM_I64V_4(-9828934));
+ EXPECT_SIZE(6, WASM_I64V_5(-1119828934));
+ EXPECT_SIZE(10, WASM_I64V_9(0x123456789abcdef0ULL));
EXPECT_SIZE(5, WASM_F32(1.0f));
EXPECT_SIZE(5, WASM_F32(10000.0f));
@@ -52,7 +56,7 @@
EXPECT_SIZE(4, WASM_STORE_GLOBAL(0, WASM_ZERO));
- EXPECT_SIZE(6, WASM_STORE_MEM(MachineType::Int32(), WASM_ZERO, WASM_ZERO));
+ EXPECT_SIZE(7, WASM_STORE_MEM(MachineType::Int32(), WASM_ZERO, WASM_ZERO));
EXPECT_SIZE(4, WASM_IF(WASM_ZERO, WASM_NOP));
@@ -92,17 +96,8 @@
EXPECT_SIZE(3, WASM_CONTINUE(0));
}
-
-TEST_F(WasmMacroGenTest, TableSwitch) {
- EXPECT_SIZE(2, WASM_CASE(9));
- EXPECT_SIZE(2, WASM_CASE_BR(11));
-
- EXPECT_SIZE(7, WASM_TABLESWITCH_OP(0, 1, WASM_CASE(7)));
- EXPECT_SIZE(9, WASM_TABLESWITCH_OP(0, 2, WASM_CASE(7), WASM_CASE(8)));
-
- EXPECT_SIZE(4, WASM_TABLESWITCH_BODY(WASM_I8(88), WASM_I8(77)));
- EXPECT_SIZE(
- 6, WASM_TABLESWITCH_BODY(WASM_I8(33), WASM_I8(44), WASM_GET_LOCAL(0)));
+TEST_F(WasmMacroGenTest, BrTable) {
+ EXPECT_SIZE(8, WASM_BR_TABLE(WASM_ZERO, 1, BR_TARGET(1)));
}
@@ -113,9 +108,9 @@
EXPECT_SIZE(2, WASM_LOAD_GLOBAL(0));
EXPECT_SIZE(2, WASM_LOAD_GLOBAL(1));
EXPECT_SIZE(2, WASM_LOAD_GLOBAL(12));
- EXPECT_SIZE(4, WASM_LOAD_MEM(MachineType::Int32(), WASM_ZERO));
- EXPECT_SIZE(4, WASM_LOAD_MEM(MachineType::Float64(), WASM_ZERO));
- EXPECT_SIZE(4, WASM_LOAD_MEM(MachineType::Float32(), WASM_ZERO));
+ EXPECT_SIZE(5, WASM_LOAD_MEM(MachineType::Int32(), WASM_ZERO));
+ EXPECT_SIZE(5, WASM_LOAD_MEM(MachineType::Float64(), WASM_ZERO));
+ EXPECT_SIZE(5, WASM_LOAD_MEM(MachineType::Float32(), WASM_ZERO));
EXPECT_SIZE(3, WASM_NOT(WASM_ZERO));
@@ -173,6 +168,8 @@
EXPECT_SIZE(5, WASM_I32_SHL(WASM_ZERO, WASM_ZERO));
EXPECT_SIZE(5, WASM_I32_SHR(WASM_ZERO, WASM_ZERO));
EXPECT_SIZE(5, WASM_I32_SAR(WASM_ZERO, WASM_ZERO));
+ EXPECT_SIZE(5, WASM_I32_ROR(WASM_ZERO, WASM_ZERO));
+ EXPECT_SIZE(5, WASM_I32_ROL(WASM_ZERO, WASM_ZERO));
EXPECT_SIZE(5, WASM_I32_EQ(WASM_ZERO, WASM_ZERO));
EXPECT_SIZE(5, WASM_I32_LTS(WASM_ZERO, WASM_ZERO));
@@ -188,6 +185,8 @@
EXPECT_SIZE(3, WASM_I32_CLZ(WASM_ZERO));
EXPECT_SIZE(3, WASM_I32_CTZ(WASM_ZERO));
EXPECT_SIZE(3, WASM_I32_POPCNT(WASM_ZERO));
+
+ EXPECT_SIZE(3, WASM_I32_EQZ(WASM_ZERO));
}
@@ -205,6 +204,8 @@
EXPECT_SIZE(5, WASM_I64_SHL(WASM_ZERO, WASM_ZERO));
EXPECT_SIZE(5, WASM_I64_SHR(WASM_ZERO, WASM_ZERO));
EXPECT_SIZE(5, WASM_I64_SAR(WASM_ZERO, WASM_ZERO));
+ EXPECT_SIZE(5, WASM_I64_ROR(WASM_ZERO, WASM_ZERO));
+ EXPECT_SIZE(5, WASM_I64_ROL(WASM_ZERO, WASM_ZERO));
EXPECT_SIZE(5, WASM_I64_EQ(WASM_ZERO, WASM_ZERO));
EXPECT_SIZE(5, WASM_I64_LTS(WASM_ZERO, WASM_ZERO));
@@ -220,6 +221,8 @@
EXPECT_SIZE(3, WASM_I64_CLZ(WASM_ZERO));
EXPECT_SIZE(3, WASM_I64_CTZ(WASM_ZERO));
EXPECT_SIZE(3, WASM_I64_POPCNT(WASM_ZERO));
+
+ EXPECT_SIZE(3, WASM_I64_EQZ(WASM_ZERO));
}
@@ -307,10 +310,10 @@
TEST_F(WasmMacroGenTest, LoadsAndStores) {
for (size_t i = 0; i < arraysize(kMemTypes); i++) {
- EXPECT_SIZE(4, WASM_LOAD_MEM(kMemTypes[i], WASM_ZERO));
+ EXPECT_SIZE(5, WASM_LOAD_MEM(kMemTypes[i], WASM_ZERO));
}
for (size_t i = 0; i < arraysize(kMemTypes); i++) {
- EXPECT_SIZE(6, WASM_STORE_MEM(kMemTypes[i], WASM_ZERO, WASM_GET_LOCAL(0)));
+ EXPECT_SIZE(7, WASM_STORE_MEM(kMemTypes[i], WASM_ZERO, WASM_GET_LOCAL(0)));
}
}
diff --git a/test/webkit/class-syntax-declaration.js b/test/webkit/class-syntax-declaration.js
index f8ecdbb..3c9aed7 100644
--- a/test/webkit/class-syntax-declaration.js
+++ b/test/webkit/class-syntax-declaration.js
@@ -21,7 +21,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --harmony-sloppy --harmony-destructuring-bind
+// Flags: --harmony-sloppy
description('Tests for ES6 class syntax declarations');
diff --git a/test/webkit/class-syntax-expression.js b/test/webkit/class-syntax-expression.js
index 182afb1..3272b81 100644
--- a/test/webkit/class-syntax-expression.js
+++ b/test/webkit/class-syntax-expression.js
@@ -21,7 +21,7 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-// Flags: --harmony-sloppy --harmony-destructuring-bind
+// Flags: --harmony-sloppy
description('Tests for ES6 class syntax expressions');
diff --git a/test/webkit/const-without-initializer-expected.txt b/test/webkit/const-without-initializer-expected.txt
deleted file mode 100644
index 30ff8ef..0000000
--- a/test/webkit/const-without-initializer-expected.txt
+++ /dev/null
@@ -1,34 +0,0 @@
-# Copyright 2013 the V8 project authors. All rights reserved.
-# Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved.
-#
-# Redistribution and use in source and binary forms, with or without
-# modification, are permitted provided that the following conditions
-# are met:
-# 1. Redistributions of source code must retain the above copyright
-# notice, this list of conditions and the following disclaimer.
-# 2. Redistributions in binary form must reproduce the above copyright
-# notice, this list of conditions and the following disclaimer in the
-# documentation and/or other materials provided with the distribution.
-#
-# THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND ANY
-# EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-# DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR ANY
-# DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
-# (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-# LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
-# ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-# SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-Tests that declaring a const variable without initializing has the correct behavior and does not crash
-
-On success, you will see a series of "PASS" messages, followed by "TEST COMPLETE".
-
-
-PASS f is undefined
-PASS f is undefined
-PASS successfullyParsed is true
-
-TEST COMPLETE
-
diff --git a/test/webkit/const-without-initializer.js b/test/webkit/const-without-initializer.js
deleted file mode 100644
index b1a86b9..0000000
--- a/test/webkit/const-without-initializer.js
+++ /dev/null
@@ -1,36 +0,0 @@
-// Copyright 2013 the V8 project authors. All rights reserved.
-// Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved.
-//
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions
-// are met:
-// 1. Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// 2. Redistributions in binary form must reproduce the above copyright
-// notice, this list of conditions and the following disclaimer in the
-// documentation and/or other materials provided with the distribution.
-//
-// THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND ANY
-// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-// DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR ANY
-// DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
-// (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
-// ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// Flags: --legacy-const
-
-description(
-'Tests that declaring a const variable without initializing has the correct behavior and does not crash'
-);
-
-const f;
-
-shouldBe('f', 'undefined');
-
-f = 10;
-
-shouldBe('f', 'undefined');
diff --git a/test/webkit/constant-count-expected.txt b/test/webkit/constant-count-expected.txt
deleted file mode 100644
index dde9347..0000000
--- a/test/webkit/constant-count-expected.txt
+++ /dev/null
@@ -1,34 +0,0 @@
-# Copyright 2013 the V8 project authors. All rights reserved.
-# Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved.
-#
-# Redistribution and use in source and binary forms, with or without
-# modification, are permitted provided that the following conditions
-# are met:
-# 1. Redistributions of source code must retain the above copyright
-# notice, this list of conditions and the following disclaimer.
-# 2. Redistributions in binary form must reproduce the above copyright
-# notice, this list of conditions and the following disclaimer in the
-# documentation and/or other materials provided with the distribution.
-#
-# THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND ANY
-# EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-# DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR ANY
-# DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
-# (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-# LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
-# ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-# SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-This test checks exceptional cases for constant counting in the parser.
-
-On success, you will see a series of "PASS" messages, followed by "TEST COMPLETE".
-
-
-PASS a is undefined
-PASS f() is undefined
-PASS successfullyParsed is true
-
-TEST COMPLETE
-
diff --git a/test/webkit/constant-count.js b/test/webkit/constant-count.js
deleted file mode 100644
index 2e1ec5b..0000000
--- a/test/webkit/constant-count.js
+++ /dev/null
@@ -1,47 +0,0 @@
-// Copyright 2013 the V8 project authors. All rights reserved.
-// Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved.
-//
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions
-// are met:
-// 1. Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// 2. Redistributions in binary form must reproduce the above copyright
-// notice, this list of conditions and the following disclaimer in the
-// documentation and/or other materials provided with the distribution.
-//
-// THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND ANY
-// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-// DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR ANY
-// DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
-// (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
-// ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-// Flags: --legacy-const
-
-description(
-"This test checks exceptional cases for constant counting in the parser."
-);
-
-const a;
-const b;
---a;
---b;
-
-shouldBe("a", "undefined");
-
-function f()
-{
- const a;
- const b;
- --a;
- --b;
-
- return a;
-}
-
-shouldBe("f()", "undefined");
diff --git a/test/webkit/exception-for-nonobject-expected.txt b/test/webkit/exception-for-nonobject-expected.txt
index 7b8883a..866070b 100644
--- a/test/webkit/exception-for-nonobject-expected.txt
+++ b/test/webkit/exception-for-nonobject-expected.txt
@@ -27,7 +27,7 @@
PASS new {}.undefined threw exception TypeError: (intermediate value).undefined is not a constructor.
-PASS 1 instanceof {}.undefined threw exception TypeError: Expecting a function in instanceof check, but got undefined.
+PASS 1 instanceof {}.undefined threw exception TypeError: Right-hand side of 'instanceof' is not an object.
PASS successfullyParsed is true
TEST COMPLETE
diff --git a/test/webkit/exception-for-nonobject.js b/test/webkit/exception-for-nonobject.js
index d39c3e0..f54915e 100644
--- a/test/webkit/exception-for-nonobject.js
+++ b/test/webkit/exception-for-nonobject.js
@@ -21,6 +21,8 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+// Flags: --harmony-instanceof
+
description("Test for correct handling of exceptions from instanceof and 'new' expressions");
shouldThrow("new {}.undefined");
diff --git a/test/webkit/fast/js/arguments-expected.txt b/test/webkit/fast/js/arguments-expected.txt
index 17fbd88..92ef56e 100644
--- a/test/webkit/fast/js/arguments-expected.txt
+++ b/test/webkit/fast/js/arguments-expected.txt
@@ -157,7 +157,6 @@
PASS argumentsParam(true) is true
PASS argumentsFunctionConstructorParam(true) is true
PASS argumentsVarUndefined() is '[object Arguments]'
-FAIL argumentsConstUndefined() should be [object Arguments]. Threw exception SyntaxError: Missing initializer in const declaration
PASS argumentCalleeInException() is argumentCalleeInException
PASS shadowedArgumentsApply([true]) is true
PASS shadowedArgumentsLength([]) is 0
diff --git a/test/webkit/fast/js/arguments.js b/test/webkit/fast/js/arguments.js
index f5b3abf..0e23faa 100644
--- a/test/webkit/fast/js/arguments.js
+++ b/test/webkit/fast/js/arguments.js
@@ -574,13 +574,6 @@
}
shouldBe("argumentsVarUndefined()", "'[object Arguments]'");
-function argumentsConstUndefined()
-{
- const arguments;
- return String(arguments);
-}
-shouldBe("argumentsConstUndefined()", "'[object Arguments]'");
-
function argumentCalleeInException() {
try {
throw "";
diff --git a/test/webkit/fast/js/basic-strict-mode-expected.txt b/test/webkit/fast/js/basic-strict-mode-expected.txt
index 4bda2b1..a7a2960 100644
--- a/test/webkit/fast/js/basic-strict-mode-expected.txt
+++ b/test/webkit/fast/js/basic-strict-mode-expected.txt
@@ -206,14 +206,14 @@
PASS (function f(arg){'use strict'; var descriptor = Object.getOwnPropertyDescriptor(f.__proto__, 'caller'); return descriptor.get === descriptor.set; })() is true
PASS (function f(arg){'use strict'; var descriptor = Object.getOwnPropertyDescriptor(f.__proto__, 'arguments'); return descriptor.get === descriptor.set; })() is true
PASS 'use strict'; (function f() { for(var i in this); })(); true; is true
-PASS 'use strict'̻ threw exception SyntaxError: Unexpected token ILLEGAL.
-PASS (function(){'use strict'̻}) threw exception SyntaxError: Unexpected token ILLEGAL.
-PASS 'use strict'5.f threw exception SyntaxError: Unexpected token ILLEGAL.
-PASS (function(){'use strict'5.f}) threw exception SyntaxError: Unexpected token ILLEGAL.
-PASS 'use strict';̻ threw exception SyntaxError: Unexpected token ILLEGAL.
-PASS (function(){'use strict';̻}) threw exception SyntaxError: Unexpected token ILLEGAL.
-PASS 'use strict';5.f threw exception SyntaxError: Unexpected token ILLEGAL.
-PASS (function(){'use strict';5.f}) threw exception SyntaxError: Unexpected token ILLEGAL.
+PASS 'use strict'̻ threw exception SyntaxError: Invalid or unexpected token.
+PASS (function(){'use strict'̻}) threw exception SyntaxError: Invalid or unexpected token.
+PASS 'use strict'5.f threw exception SyntaxError: Invalid or unexpected token.
+PASS (function(){'use strict'5.f}) threw exception SyntaxError: Invalid or unexpected token.
+PASS 'use strict';̻ threw exception SyntaxError: Invalid or unexpected token.
+PASS (function(){'use strict';̻}) threw exception SyntaxError: Invalid or unexpected token.
+PASS 'use strict';5.f threw exception SyntaxError: Invalid or unexpected token.
+PASS (function(){'use strict';5.f}) threw exception SyntaxError: Invalid or unexpected token.
PASS 'use strict';1-(eval=1); threw exception SyntaxError: Unexpected eval or arguments in strict mode.
PASS (function(){'use strict';1-(eval=1);}) threw exception SyntaxError: Unexpected eval or arguments in strict mode.
PASS 'use strict';arguments=1; threw exception SyntaxError: Unexpected eval or arguments in strict mode.
diff --git a/test/webkit/fast/js/kde/parse-expected.txt b/test/webkit/fast/js/kde/parse-expected.txt
index 5caefd1..d1a9afe 100644
--- a/test/webkit/fast/js/kde/parse-expected.txt
+++ b/test/webkit/fast/js/kde/parse-expected.txt
@@ -39,13 +39,13 @@
PASS function test() { while(0) break lab } lab: 1 threw exception SyntaxError: Undefined label 'lab'.
PASS function test() { while(0) continue lab } lab: 1 threw exception SyntaxError: Undefined label 'lab'.
PASS var éĀʯΈᢨ = 101; éĀʯΈᢨ; is 101
-PASS var f÷; threw exception SyntaxError: Unexpected token ILLEGAL.
+PASS var f÷; threw exception SyntaxError: Invalid or unexpected token.
PASS var \u0061 = 102; a is 102
PASS var f\u0030 = 103; f0 is 103
PASS var \u00E9\u0100\u02AF\u0388\u18A8 = 104; \u00E9\u0100\u02AF\u0388\u18A8; is 104
-PASS var f\u00F7; threw exception SyntaxError: Unexpected token ILLEGAL.
-PASS var \u0030; threw exception SyntaxError: Unexpected token ILLEGAL.
-PASS var test = { }; test.i= 0; test.i\u002b= 1; test.i; threw exception SyntaxError: Unexpected token ILLEGAL.
+PASS var f\u00F7; threw exception SyntaxError: Invalid or unexpected token.
+PASS var \u0030; threw exception SyntaxError: Invalid or unexpected token.
+PASS var test = { }; test.i= 0; test.i\u002b= 1; test.i; threw exception SyntaxError: Invalid or unexpected token.
PASS var test = { }; test.i= 0; test.i+= 1; test.i; is 1
PASS successfullyParsed is true
diff --git a/test/webkit/fast/js/parser-syntax-check.js b/test/webkit/fast/js/parser-syntax-check.js
index a3fef13..c003745 100644
--- a/test/webkit/fast/js/parser-syntax-check.js
+++ b/test/webkit/fast/js/parser-syntax-check.js
@@ -21,6 +21,8 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+// Flags: --no-harmony-restrictive-declarations
+
description(
"This test checks that the following expressions or statements are valid ECMASCRIPT code or should throw parse error"
);
diff --git a/test/webkit/fast/regex/lastIndex-expected.txt b/test/webkit/fast/regex/lastIndex-expected.txt
index 1e0959c..71292c7 100644
--- a/test/webkit/fast/regex/lastIndex-expected.txt
+++ b/test/webkit/fast/regex/lastIndex-expected.txt
@@ -42,10 +42,10 @@
PASS Object.defineProperty(Object.defineProperty(/x/, 'lastIndex', {writable:false}), 'lastIndex', {writable:true}); true threw exception TypeError: Cannot redefine property: lastIndex.
PASS Object.defineProperty(Object.defineProperty(/x/, 'lastIndex', {writable:false}), 'lastIndex', {value:42}); true threw exception TypeError: Cannot redefine property: lastIndex.
PASS Object.defineProperty(Object.defineProperty(/x/, 'lastIndex', {writable:false}), 'lastIndex', {value:0}); true is true
-PASS Object.defineProperty(/x/, 'lastIndex', {writable:false}).exec('') is null
+FAIL Object.defineProperty(/x/, 'lastIndex', {writable:false}).exec('') should be null. Threw exception TypeError: Cannot assign to read only property 'lastIndex' of object '[object RegExp]'
PASS Object.defineProperty(/x/, 'lastIndex', {writable:false}).exec('x') is ["x"]
-FAIL Object.defineProperty(/x/g, 'lastIndex', {writable:false}).exec('') should throw an exception. Was null.
-FAIL Object.defineProperty(/x/g, 'lastIndex', {writable:false}).exec('x') should throw an exception. Was x.
+PASS Object.defineProperty(/x/g, 'lastIndex', {writable:false}).exec('') threw exception TypeError: Cannot assign to read only property 'lastIndex' of object '[object RegExp]'.
+PASS Object.defineProperty(/x/g, 'lastIndex', {writable:false}).exec('x') threw exception TypeError: Cannot assign to read only property 'lastIndex' of object '[object RegExp]'.
PASS var re = /x/; Object.freeze(re); Object.isFrozen(re); is true
PASS successfullyParsed is true
diff --git a/test/webkit/fast/regex/toString-expected.txt b/test/webkit/fast/regex/toString-expected.txt
index 08852f9..1f92569 100644
--- a/test/webkit/fast/regex/toString-expected.txt
+++ b/test/webkit/fast/regex/toString-expected.txt
@@ -28,7 +28,7 @@
PASS RegExp('/').source is "\\/"
PASS RegExp('').source is "(?:)"
-FAIL RegExp.prototype.source should be (?:) (of type string). Was undefined (of type undefined).
+PASS RegExp.prototype.source is "(?:)"
PASS RegExp('/').toString() is "/\\//"
PASS RegExp('').toString() is "/(?:)/"
PASS RegExp.prototype.toString() is "/(?:)/"
diff --git a/test/webkit/function-declaration-statement.js b/test/webkit/function-declaration-statement.js
index e2ee343..34e3fdd 100644
--- a/test/webkit/function-declaration-statement.js
+++ b/test/webkit/function-declaration-statement.js
@@ -21,6 +21,8 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+// Flags: --no-harmony-restrictive-declarations
+
description(
"This test checks that function declarations are treated as statements."
);
diff --git a/test/webkit/instance-of-immediates-expected.txt b/test/webkit/instance-of-immediates-expected.txt
index db58f00..c713b35 100644
--- a/test/webkit/instance-of-immediates-expected.txt
+++ b/test/webkit/instance-of-immediates-expected.txt
@@ -26,12 +26,12 @@
On success, you will see a series of "PASS" messages, followed by "TEST COMPLETE".
-PASS (1 instanceof 1) threw exception TypeError: Expecting a function in instanceof check, but got 1.
-PASS ({} instanceof 1) threw exception TypeError: Expecting a function in instanceof check, but got 1.
-PASS (obj instanceof 1) threw exception TypeError: Expecting a function in instanceof check, but got 1.
-PASS (1 instanceof {}) threw exception TypeError: Expecting a function in instanceof check, but got #<Object>.
-PASS ({} instanceof {}) threw exception TypeError: Expecting a function in instanceof check, but got #<Object>.
-PASS (obj instanceof {}) threw exception TypeError: Expecting a function in instanceof check, but got #<Object>.
+PASS (1 instanceof 1) threw exception TypeError: Right-hand side of 'instanceof' is not an object.
+PASS ({} instanceof 1) threw exception TypeError: Right-hand side of 'instanceof' is not an object.
+PASS (obj instanceof 1) threw exception TypeError: Right-hand side of 'instanceof' is not an object.
+PASS (1 instanceof {}) threw exception TypeError: Right-hand side of 'instanceof' is not callable.
+PASS ({} instanceof {}) threw exception TypeError: Right-hand side of 'instanceof' is not callable.
+PASS (obj instanceof {}) threw exception TypeError: Right-hand side of 'instanceof' is not callable.
PASS (1 instanceof Constructor) is false
PASS ({} instanceof Constructor) is false
PASS (obj instanceof Constructor) is true
diff --git a/test/webkit/instance-of-immediates.js b/test/webkit/instance-of-immediates.js
index 649a29f..be63e4b 100644
--- a/test/webkit/instance-of-immediates.js
+++ b/test/webkit/instance-of-immediates.js
@@ -21,6 +21,8 @@
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+// Flags: --harmony-instanceof
+
description('This test makes sure that instance of behaves correctly when the value, constructor, or its prototype are immediates.');
// A Constructor to use check for instances of, and an instance called obj.
diff --git a/test/webkit/testcfg.py b/test/webkit/testcfg.py
index ed811d2..01a2713 100644
--- a/test/webkit/testcfg.py
+++ b/test/webkit/testcfg.py
@@ -117,10 +117,10 @@
string == "Warning: unknown flag --enable-slow-asserts." or
string == "Try --help for options")
- def IsFailureOutput(self, output, testpath):
- if super(WebkitTestSuite, self).IsFailureOutput(output, testpath):
+ def IsFailureOutput(self, testcase):
+ if super(WebkitTestSuite, self).IsFailureOutput(testcase):
return True
- file_name = os.path.join(self.root, testpath) + "-expected.txt"
+ file_name = os.path.join(self.root, testcase.path) + "-expected.txt"
with file(file_name, "r") as expected:
expected_lines = expected.readlines()
@@ -136,7 +136,7 @@
def ActBlockIterator():
"""Iterates over blocks of actual output lines."""
- lines = output.stdout.splitlines()
+ lines = testcase.output.stdout.splitlines()
start_index = 0
found_eqeq = False
for index, line in enumerate(lines):
@@ -147,7 +147,7 @@
found_eqeq = True
else:
yield ActIterator(lines[start_index:index])
- # The next block of ouput lines starts after the separator.
+ # The next block of output lines starts after the separator.
start_index = index + 1
# Iterate over complete output if no separator was found.
if not found_eqeq:
diff --git a/test/webkit/webkit.status b/test/webkit/webkit.status
index fa52742..e23b9cf 100644
--- a/test/webkit/webkit.status
+++ b/test/webkit/webkit.status
@@ -97,6 +97,19 @@
}], # 'gc_stress == True and mode == debug'
##############################################################################
+['ignition == True', {
+ # TODO(4680): Throws a RangeError due to stack overflow. Need investigation.
+ 'fast/js/excessive-comma-usage': [SKIP], # Stack is brittle, SKIP not FAIL.
+}], # ignition == True
+
+##############################################################################
+['ignition == True and msan', {
+ # TODO(mythria,4680): Too slow and timeout on ignition.
+ 'dfg-double-vote-fuzz': [SKIP],
+ 'dfg-int-overflow-in-loop': [SKIP],
+}], # ignition == True and msan
+
+##############################################################################
['gcov_coverage', {
# Tests taking too long or getting too large call stacks.
'fast/js/excessive-comma-usage': [SKIP],